diff --git a/Makefile b/Makefile
index 40fabf1fe7..a1f2c94cf4 100644
--- a/Makefile
+++ b/Makefile
@@ -249,11 +249,21 @@ build_verbose: check_env
 	//submodules/TelegramUI:TelegramUI#shared,iphoneos-arm64 \
 	//:WatchAppExtension#dwarf-and-dsym,watchos-arm64_32,watchos-armv7k \
 	//:ShareExtension#dwarf-and-dsym,iphoneos-arm64 \
-    //:WidgetExtension#dwarf-and-dsym,iphoneos-arm64 \
-    //:NotificationContentExtension#dwarf-and-dsym,iphoneos-arm64 \
-    //:NotificationServiceExtension#dwarf-and-dsym,iphoneos-arm64 \
-    //:IntentsExtension#dwarf-and-dsym,iphoneos-arm64 \
-    --verbose 8 ${BUCK_OPTIONS} ${BUCK_THREADS_OPTIONS} ${BUCK_DEBUG_OPTIONS}
+	//:WidgetExtension#dwarf-and-dsym,iphoneos-arm64 \
+	//:NotificationContentExtension#dwarf-and-dsym,iphoneos-arm64 \
+	//:NotificationServiceExtension#dwarf-and-dsym,iphoneos-arm64 \
+	//:IntentsExtension#dwarf-and-dsym,iphoneos-arm64 \
+	--verbose 8 ${BUCK_OPTIONS} ${BUCK_THREADS_OPTIONS} ${BUCK_DEBUG_OPTIONS}
+
+build_openssl: check_env
+	$(BUCK) build \
+	//submodules/openssl:openssl#iphoneos-arm64 \
+	--verbose 7 ${BUCK_OPTIONS} ${BUCK_THREADS_OPTIONS} ${BUCK_DEBUG_OPTIONS}
+
+build_ton: check_env
+	$(BUCK) build \
+	//submodules/ton:ton#iphoneos-arm64 \
+	--verbose 7 ${BUCK_OPTIONS} ${BUCK_THREADS_OPTIONS} ${BUCK_DEBUG_OPTIONS}
 
 kill_xcode:
 	killall Xcode || true
diff --git a/Telegram_Buck.xcworkspace/buck-project.meta.json b/Telegram_Buck.xcworkspace/buck-project.meta.json
index 573f189fa5..05ca950f94 100644
--- a/Telegram_Buck.xcworkspace/buck-project.meta.json
+++ b/Telegram_Buck.xcworkspace/buck-project.meta.json
@@ -1 +1 @@
-{"required-targets":["//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_ac3_parser.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_adts_parser.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_avcodec.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_avdct.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_avfft.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_d3d11va.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_dirac.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_dv_profile.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_dxva2.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_jni.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_mediacodec.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_qsv.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_vaapi.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_vdpau.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_version.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_videotoolbox.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_vorbis_parser.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_xvmc.h","//submodules/FFMpeg:ffmpeg_header_libavformat_sub_avformat.h","//submodules/FFMpeg:ffmpeg_header_libavformat_sub_avio.h","//submodules/FFMpeg:ffmpeg_header_libavformat_sub_version.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_adler32.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_aes.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_aes_ctr.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_attributes.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_audio_fifo.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_avassert.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_avconfig.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_avstring.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_avutil.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_base64.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_blowfish.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_bprint.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_bswap.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_buffer.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_camellia.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_cast5.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_channel_layout.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_common.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_cpu.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_crc.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_des.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_dict.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_display.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_downmix_info.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_encryption_info.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_error.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_eval.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_ffversion.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_fifo.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_file.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_frame.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hash.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hmac.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_cuda.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_d3d11va.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_drm.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_dxva2.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_mediacodec.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_qsv.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_vaapi.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_vdpau.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_videotoolbox.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_imgutils.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_intfloat.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_intreadwrite.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_lfg.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_log.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_lzo.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_macros.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_mastering_display_metadata.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_mathematics.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_md5.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_mem.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_motion_vector.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_murmur3.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_opt.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_parseutils.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_pixdesc.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_pixelutils.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_pixfmt.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_random_seed.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_rational.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_rc4.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_replaygain.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_ripemd.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_samplefmt.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_sha.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_sha512.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_spherical.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_stereo3d.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_tea.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_threadmessage.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_time.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_timecode.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_timestamp.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_tree.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_twofish.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_version.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_xtea.h","//submodules/FFMpeg:ffmpeg_header_libswresample_sub_swresample.h","//submodules/FFMpeg:ffmpeg_header_libswresample_sub_version.h","//submodules/FFMpeg:libffmpeg_build","//submodules/MtProtoKit:openssl_libs","//submodules/MtProtoKit:ton_libs","//submodules/Opus:opus_lib_file","//submodules/WebP:WebP_lib_file"],"xcconfig-paths":["buck-out/gen/AppLibrary-Debug.xcconfig","buck-out/gen/AppLibrary-Profile.xcconfig","buck-out/gen/AppLibrary-Release.xcconfig","buck-out/gen/IntentsExtension#iphonesimulator-x86_64-Debug.xcconfig","buck-out/gen/IntentsExtension#iphonesimulator-x86_64-Profile.xcconfig","buck-out/gen/IntentsExtension#iphonesimulator-x86_64-Release.xcconfig","buck-out/gen/NotificationContentExtension#iphonesimulator-x86_64-Debug.xcconfig","buck-out/gen/NotificationContentExtension#iphonesimulator-x86_64-Profile.xcconfig","buck-out/gen/NotificationContentExtension#iphonesimulator-x86_64-Release.xcconfig","buck-out/gen/NotificationServiceExtension#iphonesimulator-x86_64-Debug.xcconfig","buck-out/gen/NotificationServiceExtension#iphonesimulator-x86_64-Profile.xcconfig","buck-out/gen/NotificationServiceExtension#iphonesimulator-x86_64-Release.xcconfig","buck-out/gen/ShareExtension#iphonesimulator-x86_64-Debug.xcconfig","buck-out/gen/ShareExtension#iphonesimulator-x86_64-Profile.xcconfig","buck-out/gen/ShareExtension#iphonesimulator-x86_64-Release.xcconfig","buck-out/gen/Telegram-Debug.xcconfig","buck-out/gen/Telegram-Profile.xcconfig","buck-out/gen/Telegram-Release.xcconfig","buck-out/gen/WatchApp#watchsimulator-i386-Debug.xcconfig","buck-out/gen/WatchApp#watchsimulator-i386-Profile.xcconfig","buck-out/gen/WatchApp#watchsimulator-i386-Release.xcconfig","buck-out/gen/WatchAppExtension#watchsimulator-i386-Debug.xcconfig","buck-out/gen/WatchAppExtension#watchsimulator-i386-Profile.xcconfig","buck-out/gen/WatchAppExtension#watchsimulator-i386-Release.xcconfig","buck-out/gen/WidgetExtension#iphonesimulator-x86_64-Debug.xcconfig","buck-out/gen/WidgetExtension#iphonesimulator-x86_64-Profile.xcconfig","buck-out/gen/WidgetExtension#iphonesimulator-x86_64-Release.xcconfig","buck-out/gen/submodules/AccountContext/AccountContext-Debug.xcconfig","buck-out/gen/submodules/AccountContext/AccountContext-Profile.xcconfig","buck-out/gen/submodules/AccountContext/AccountContext-Release.xcconfig","buck-out/gen/submodules/ActionSheetPeerItem/ActionSheetPeerItem-Debug.xcconfig","buck-out/gen/submodules/ActionSheetPeerItem/ActionSheetPeerItem-Profile.xcconfig","buck-out/gen/submodules/ActionSheetPeerItem/ActionSheetPeerItem-Release.xcconfig","buck-out/gen/submodules/ActivityIndicator/ActivityIndicator-Debug.xcconfig","buck-out/gen/submodules/ActivityIndicator/ActivityIndicator-Profile.xcconfig","buck-out/gen/submodules/ActivityIndicator/ActivityIndicator-Release.xcconfig","buck-out/gen/submodules/AlertUI/AlertUI-Debug.xcconfig","buck-out/gen/submodules/AlertUI/AlertUI-Profile.xcconfig","buck-out/gen/submodules/AlertUI/AlertUI-Release.xcconfig","buck-out/gen/submodules/AnimationUI/AnimationUI-Debug.xcconfig","buck-out/gen/submodules/AnimationUI/AnimationUI-Profile.xcconfig","buck-out/gen/submodules/AnimationUI/AnimationUI-Release.xcconfig","buck-out/gen/submodules/AppBundle/AppBundle-Debug.xcconfig","buck-out/gen/submodules/AppBundle/AppBundle-Profile.xcconfig","buck-out/gen/submodules/AppBundle/AppBundle-Release.xcconfig","buck-out/gen/submodules/AsyncDisplayKit/AsyncDisplayKit#shared-Debug.xcconfig","buck-out/gen/submodules/AsyncDisplayKit/AsyncDisplayKit#shared-Profile.xcconfig","buck-out/gen/submodules/AsyncDisplayKit/AsyncDisplayKit#shared-Release.xcconfig","buck-out/gen/submodules/AuthorizationUI/AuthorizationUI-Debug.xcconfig","buck-out/gen/submodules/AuthorizationUI/AuthorizationUI-Profile.xcconfig","buck-out/gen/submodules/AuthorizationUI/AuthorizationUI-Release.xcconfig","buck-out/gen/submodules/AvatarNode/AvatarNode-Debug.xcconfig","buck-out/gen/submodules/AvatarNode/AvatarNode-Profile.xcconfig","buck-out/gen/submodules/AvatarNode/AvatarNode-Release.xcconfig","buck-out/gen/submodules/BotPaymentsUI/BotPaymentsUI-Debug.xcconfig","buck-out/gen/submodules/BotPaymentsUI/BotPaymentsUI-Profile.xcconfig","buck-out/gen/submodules/BotPaymentsUI/BotPaymentsUI-Release.xcconfig","buck-out/gen/submodules/BuildConfig/BuildConfig-Debug.xcconfig","buck-out/gen/submodules/BuildConfig/BuildConfig-Profile.xcconfig","buck-out/gen/submodules/BuildConfig/BuildConfig-Release.xcconfig","buck-out/gen/submodules/CallListUI/CallListUI-Debug.xcconfig","buck-out/gen/submodules/CallListUI/CallListUI-Profile.xcconfig","buck-out/gen/submodules/CallListUI/CallListUI-Release.xcconfig","buck-out/gen/submodules/ChatListSearchItemHeader/ChatListSearchItemHeader-Debug.xcconfig","buck-out/gen/submodules/ChatListSearchItemHeader/ChatListSearchItemHeader-Profile.xcconfig","buck-out/gen/submodules/ChatListSearchItemHeader/ChatListSearchItemHeader-Release.xcconfig","buck-out/gen/submodules/ChatListSearchItemNode/ChatListSearchItemNode-Debug.xcconfig","buck-out/gen/submodules/ChatListSearchItemNode/ChatListSearchItemNode-Profile.xcconfig","buck-out/gen/submodules/ChatListSearchItemNode/ChatListSearchItemNode-Release.xcconfig","buck-out/gen/submodules/ChatListSearchRecentPeersNode/ChatListSearchRecentPeersNode-Debug.xcconfig","buck-out/gen/submodules/ChatListSearchRecentPeersNode/ChatListSearchRecentPeersNode-Profile.xcconfig","buck-out/gen/submodules/ChatListSearchRecentPeersNode/ChatListSearchRecentPeersNode-Release.xcconfig","buck-out/gen/submodules/ChatListUI/ChatListUI-Debug.xcconfig","buck-out/gen/submodules/ChatListUI/ChatListUI-Profile.xcconfig","buck-out/gen/submodules/ChatListUI/ChatListUI-Release.xcconfig","buck-out/gen/submodules/ChatTitleActivityNode/ChatTitleActivityNode-Debug.xcconfig","buck-out/gen/submodules/ChatTitleActivityNode/ChatTitleActivityNode-Profile.xcconfig","buck-out/gen/submodules/ChatTitleActivityNode/ChatTitleActivityNode-Release.xcconfig","buck-out/gen/submodules/CheckNode/CheckNode-Debug.xcconfig","buck-out/gen/submodules/CheckNode/CheckNode-Profile.xcconfig","buck-out/gen/submodules/CheckNode/CheckNode-Release.xcconfig","buck-out/gen/submodules/ComposePollUI/ComposePollUI-Debug.xcconfig","buck-out/gen/submodules/ComposePollUI/ComposePollUI-Profile.xcconfig","buck-out/gen/submodules/ComposePollUI/ComposePollUI-Release.xcconfig","buck-out/gen/submodules/ContactListUI/ContactListUI-Debug.xcconfig","buck-out/gen/submodules/ContactListUI/ContactListUI-Profile.xcconfig","buck-out/gen/submodules/ContactListUI/ContactListUI-Release.xcconfig","buck-out/gen/submodules/ContactsPeerItem/ContactsPeerItem-Debug.xcconfig","buck-out/gen/submodules/ContactsPeerItem/ContactsPeerItem-Profile.xcconfig","buck-out/gen/submodules/ContactsPeerItem/ContactsPeerItem-Release.xcconfig","buck-out/gen/submodules/ContextUI/ContextUI-Debug.xcconfig","buck-out/gen/submodules/ContextUI/ContextUI-Profile.xcconfig","buck-out/gen/submodules/ContextUI/ContextUI-Release.xcconfig","buck-out/gen/submodules/CounterContollerTitleView/CounterContollerTitleView-Debug.xcconfig","buck-out/gen/submodules/CounterContollerTitleView/CounterContollerTitleView-Profile.xcconfig","buck-out/gen/submodules/CounterContollerTitleView/CounterContollerTitleView-Release.xcconfig","buck-out/gen/submodules/CountrySelectionUI/CountrySelectionUI-Debug.xcconfig","buck-out/gen/submodules/CountrySelectionUI/CountrySelectionUI-Profile.xcconfig","buck-out/gen/submodules/CountrySelectionUI/CountrySelectionUI-Release.xcconfig","buck-out/gen/submodules/Crc32/Crc32-Debug.xcconfig","buck-out/gen/submodules/Crc32/Crc32-Profile.xcconfig","buck-out/gen/submodules/Crc32/Crc32-Release.xcconfig","buck-out/gen/submodules/DateSelectionUI/DateSelectionUI-Debug.xcconfig","buck-out/gen/submodules/DateSelectionUI/DateSelectionUI-Profile.xcconfig","buck-out/gen/submodules/DateSelectionUI/DateSelectionUI-Release.xcconfig","buck-out/gen/submodules/DeleteChatPeerActionSheetItem/DeleteChatPeerActionSheetItem-Debug.xcconfig","buck-out/gen/submodules/DeleteChatPeerActionSheetItem/DeleteChatPeerActionSheetItem-Profile.xcconfig","buck-out/gen/submodules/DeleteChatPeerActionSheetItem/DeleteChatPeerActionSheetItem-Release.xcconfig","buck-out/gen/submodules/DeviceAccess/DeviceAccess-Debug.xcconfig","buck-out/gen/submodules/DeviceAccess/DeviceAccess-Profile.xcconfig","buck-out/gen/submodules/DeviceAccess/DeviceAccess-Release.xcconfig","buck-out/gen/submodules/DeviceLocationManager/DeviceLocationManager-Debug.xcconfig","buck-out/gen/submodules/DeviceLocationManager/DeviceLocationManager-Profile.xcconfig","buck-out/gen/submodules/DeviceLocationManager/DeviceLocationManager-Release.xcconfig","buck-out/gen/submodules/DeviceProximity/DeviceProximity-Debug.xcconfig","buck-out/gen/submodules/DeviceProximity/DeviceProximity-Profile.xcconfig","buck-out/gen/submodules/DeviceProximity/DeviceProximity-Release.xcconfig","buck-out/gen/submodules/DirectionalPanGesture/DirectionalPanGesture-Debug.xcconfig","buck-out/gen/submodules/DirectionalPanGesture/DirectionalPanGesture-Profile.xcconfig","buck-out/gen/submodules/DirectionalPanGesture/DirectionalPanGesture-Release.xcconfig","buck-out/gen/submodules/Display/Display#shared-Debug.xcconfig","buck-out/gen/submodules/Display/Display#shared-Profile.xcconfig","buck-out/gen/submodules/Display/Display#shared-Release.xcconfig","buck-out/gen/submodules/Emoji/Emoji-Debug.xcconfig","buck-out/gen/submodules/Emoji/Emoji-Profile.xcconfig","buck-out/gen/submodules/Emoji/Emoji-Release.xcconfig","buck-out/gen/submodules/EncryptionKeyVisualization/EncryptionKeyVisualization-Debug.xcconfig","buck-out/gen/submodules/EncryptionKeyVisualization/EncryptionKeyVisualization-Profile.xcconfig","buck-out/gen/submodules/EncryptionKeyVisualization/EncryptionKeyVisualization-Release.xcconfig","buck-out/gen/submodules/FFMpeg/FFMpeg-Debug.xcconfig","buck-out/gen/submodules/FFMpeg/FFMpeg-Profile.xcconfig","buck-out/gen/submodules/FFMpeg/FFMpeg-Release.xcconfig","buck-out/gen/submodules/FFMpeg/libffmpeg-Debug.xcconfig","buck-out/gen/submodules/FFMpeg/libffmpeg-Profile.xcconfig","buck-out/gen/submodules/FFMpeg/libffmpeg-Release.xcconfig","buck-out/gen/submodules/GZip/GZip-Debug.xcconfig","buck-out/gen/submodules/GZip/GZip-Profile.xcconfig","buck-out/gen/submodules/GZip/GZip-Release.xcconfig","buck-out/gen/submodules/GalleryUI/GalleryUI-Debug.xcconfig","buck-out/gen/submodules/GalleryUI/GalleryUI-Profile.xcconfig","buck-out/gen/submodules/GalleryUI/GalleryUI-Release.xcconfig","buck-out/gen/submodules/GameUI/GameUI-Debug.xcconfig","buck-out/gen/submodules/GameUI/GameUI-Profile.xcconfig","buck-out/gen/submodules/GameUI/GameUI-Release.xcconfig","buck-out/gen/submodules/Geocoding/Geocoding-Debug.xcconfig","buck-out/gen/submodules/Geocoding/Geocoding-Profile.xcconfig","buck-out/gen/submodules/Geocoding/Geocoding-Release.xcconfig","buck-out/gen/submodules/GridMessageSelectionNode/GridMessageSelectionNode-Debug.xcconfig","buck-out/gen/submodules/GridMessageSelectionNode/GridMessageSelectionNode-Profile.xcconfig","buck-out/gen/submodules/GridMessageSelectionNode/GridMessageSelectionNode-Release.xcconfig","buck-out/gen/submodules/HashtagSearchUI/HashtagSearchUI-Debug.xcconfig","buck-out/gen/submodules/HashtagSearchUI/HashtagSearchUI-Profile.xcconfig","buck-out/gen/submodules/HashtagSearchUI/HashtagSearchUI-Release.xcconfig","buck-out/gen/submodules/HexColor/HexColor-Debug.xcconfig","buck-out/gen/submodules/HexColor/HexColor-Profile.xcconfig","buck-out/gen/submodules/HexColor/HexColor-Release.xcconfig","buck-out/gen/submodules/HockeySDK-iOS/HockeySDK-Debug.xcconfig","buck-out/gen/submodules/HockeySDK-iOS/HockeySDK-Profile.xcconfig","buck-out/gen/submodules/HockeySDK-iOS/HockeySDK-Release.xcconfig","buck-out/gen/submodules/HorizontalPeerItem/HorizontalPeerItem-Debug.xcconfig","buck-out/gen/submodules/HorizontalPeerItem/HorizontalPeerItem-Profile.xcconfig","buck-out/gen/submodules/HorizontalPeerItem/HorizontalPeerItem-Release.xcconfig","buck-out/gen/submodules/ImageBlur/ImageBlur-Debug.xcconfig","buck-out/gen/submodules/ImageBlur/ImageBlur-Profile.xcconfig","buck-out/gen/submodules/ImageBlur/ImageBlur-Release.xcconfig","buck-out/gen/submodules/ImageCompression/ImageCompression-Debug.xcconfig","buck-out/gen/submodules/ImageCompression/ImageCompression-Profile.xcconfig","buck-out/gen/submodules/ImageCompression/ImageCompression-Release.xcconfig","buck-out/gen/submodules/ImageTransparency/ImageTransparency-Debug.xcconfig","buck-out/gen/submodules/ImageTransparency/ImageTransparency-Profile.xcconfig","buck-out/gen/submodules/ImageTransparency/ImageTransparency-Release.xcconfig","buck-out/gen/submodules/InstantPageCache/InstantPageCache-Debug.xcconfig","buck-out/gen/submodules/InstantPageCache/InstantPageCache-Profile.xcconfig","buck-out/gen/submodules/InstantPageCache/InstantPageCache-Release.xcconfig","buck-out/gen/submodules/InstantPageUI/InstantPageUI-Debug.xcconfig","buck-out/gen/submodules/InstantPageUI/InstantPageUI-Profile.xcconfig","buck-out/gen/submodules/InstantPageUI/InstantPageUI-Release.xcconfig","buck-out/gen/submodules/ItemListAddressItem/ItemListAddressItem-Debug.xcconfig","buck-out/gen/submodules/ItemListAddressItem/ItemListAddressItem-Profile.xcconfig","buck-out/gen/submodules/ItemListAddressItem/ItemListAddressItem-Release.xcconfig","buck-out/gen/submodules/ItemListAvatarAndNameInfoItem/ItemListAvatarAndNameInfoItem-Debug.xcconfig","buck-out/gen/submodules/ItemListAvatarAndNameInfoItem/ItemListAvatarAndNameInfoItem-Profile.xcconfig","buck-out/gen/submodules/ItemListAvatarAndNameInfoItem/ItemListAvatarAndNameInfoItem-Release.xcconfig","buck-out/gen/submodules/ItemListPeerActionItem/ItemListPeerActionItem-Debug.xcconfig","buck-out/gen/submodules/ItemListPeerActionItem/ItemListPeerActionItem-Profile.xcconfig","buck-out/gen/submodules/ItemListPeerActionItem/ItemListPeerActionItem-Release.xcconfig","buck-out/gen/submodules/ItemListPeerItem/ItemListPeerItem-Debug.xcconfig","buck-out/gen/submodules/ItemListPeerItem/ItemListPeerItem-Profile.xcconfig","buck-out/gen/submodules/ItemListPeerItem/ItemListPeerItem-Release.xcconfig","buck-out/gen/submodules/ItemListStickerPackItem/ItemListStickerPackItem-Debug.xcconfig","buck-out/gen/submodules/ItemListStickerPackItem/ItemListStickerPackItem-Profile.xcconfig","buck-out/gen/submodules/ItemListStickerPackItem/ItemListStickerPackItem-Release.xcconfig","buck-out/gen/submodules/ItemListUI/ItemListUI-Debug.xcconfig","buck-out/gen/submodules/ItemListUI/ItemListUI-Profile.xcconfig","buck-out/gen/submodules/ItemListUI/ItemListUI-Release.xcconfig","buck-out/gen/submodules/JoinLinkPreviewUI/JoinLinkPreviewUI-Debug.xcconfig","buck-out/gen/submodules/JoinLinkPreviewUI/JoinLinkPreviewUI-Profile.xcconfig","buck-out/gen/submodules/JoinLinkPreviewUI/JoinLinkPreviewUI-Release.xcconfig","buck-out/gen/submodules/LanguageLinkPreviewUI/LanguageLinkPreviewUI-Debug.xcconfig","buck-out/gen/submodules/LanguageLinkPreviewUI/LanguageLinkPreviewUI-Profile.xcconfig","buck-out/gen/submodules/LanguageLinkPreviewUI/LanguageLinkPreviewUI-Release.xcconfig","buck-out/gen/submodules/LanguageSuggestionUI/LanguageSuggestionUI-Debug.xcconfig","buck-out/gen/submodules/LanguageSuggestionUI/LanguageSuggestionUI-Profile.xcconfig","buck-out/gen/submodules/LanguageSuggestionUI/LanguageSuggestionUI-Release.xcconfig","buck-out/gen/submodules/LegacyComponents/LegacyComponents-Debug.xcconfig","buck-out/gen/submodules/LegacyComponents/LegacyComponents-Profile.xcconfig","buck-out/gen/submodules/LegacyComponents/LegacyComponents-Release.xcconfig","buck-out/gen/submodules/LegacyDataImport/LegacyDataImport-Debug.xcconfig","buck-out/gen/submodules/LegacyDataImport/LegacyDataImport-Profile.xcconfig","buck-out/gen/submodules/LegacyDataImport/LegacyDataImport-Release.xcconfig","buck-out/gen/submodules/LegacyMediaPickerUI/LegacyMediaPickerUI-Debug.xcconfig","buck-out/gen/submodules/LegacyMediaPickerUI/LegacyMediaPickerUI-Profile.xcconfig","buck-out/gen/submodules/LegacyMediaPickerUI/LegacyMediaPickerUI-Release.xcconfig","buck-out/gen/submodules/LegacyUI/LegacyUI-Debug.xcconfig","buck-out/gen/submodules/LegacyUI/LegacyUI-Profile.xcconfig","buck-out/gen/submodules/LegacyUI/LegacyUI-Release.xcconfig","buck-out/gen/submodules/LightweightAccountData/LightweightAccountData-Debug.xcconfig","buck-out/gen/submodules/LightweightAccountData/LightweightAccountData-Profile.xcconfig","buck-out/gen/submodules/LightweightAccountData/LightweightAccountData-Release.xcconfig","buck-out/gen/submodules/ListSectionHeaderNode/ListSectionHeaderNode-Debug.xcconfig","buck-out/gen/submodules/ListSectionHeaderNode/ListSectionHeaderNode-Profile.xcconfig","buck-out/gen/submodules/ListSectionHeaderNode/ListSectionHeaderNode-Release.xcconfig","buck-out/gen/submodules/LiveLocationManager/LiveLocationManager-Debug.xcconfig","buck-out/gen/submodules/LiveLocationManager/LiveLocationManager-Profile.xcconfig","buck-out/gen/submodules/LiveLocationManager/LiveLocationManager-Release.xcconfig","buck-out/gen/submodules/LiveLocationPositionNode/LiveLocationPositionNode-Debug.xcconfig","buck-out/gen/submodules/LiveLocationPositionNode/LiveLocationPositionNode-Profile.xcconfig","buck-out/gen/submodules/LiveLocationPositionNode/LiveLocationPositionNode-Release.xcconfig","buck-out/gen/submodules/LiveLocationTimerNode/LiveLocationTimerNode-Debug.xcconfig","buck-out/gen/submodules/LiveLocationTimerNode/LiveLocationTimerNode-Profile.xcconfig","buck-out/gen/submodules/LiveLocationTimerNode/LiveLocationTimerNode-Release.xcconfig","buck-out/gen/submodules/LocalAuth/LocalAuth-Debug.xcconfig","buck-out/gen/submodules/LocalAuth/LocalAuth-Profile.xcconfig","buck-out/gen/submodules/LocalAuth/LocalAuth-Release.xcconfig","buck-out/gen/submodules/LocalMediaResources/LocalMediaResources-Debug.xcconfig","buck-out/gen/submodules/LocalMediaResources/LocalMediaResources-Profile.xcconfig","buck-out/gen/submodules/LocalMediaResources/LocalMediaResources-Release.xcconfig","buck-out/gen/submodules/LocalizedPeerData/LocalizedPeerData-Debug.xcconfig","buck-out/gen/submodules/LocalizedPeerData/LocalizedPeerData-Profile.xcconfig","buck-out/gen/submodules/LocalizedPeerData/LocalizedPeerData-Release.xcconfig","buck-out/gen/submodules/LocationUI/LocationUI-Debug.xcconfig","buck-out/gen/submodules/LocationUI/LocationUI-Profile.xcconfig","buck-out/gen/submodules/LocationUI/LocationUI-Release.xcconfig","buck-out/gen/submodules/MapResourceToAvatarSizes/MapResourceToAvatarSizes-Debug.xcconfig","buck-out/gen/submodules/MapResourceToAvatarSizes/MapResourceToAvatarSizes-Profile.xcconfig","buck-out/gen/submodules/MapResourceToAvatarSizes/MapResourceToAvatarSizes-Release.xcconfig","buck-out/gen/submodules/MediaPlayer/UniversalMediaPlayer-Debug.xcconfig","buck-out/gen/submodules/MediaPlayer/UniversalMediaPlayer-Profile.xcconfig","buck-out/gen/submodules/MediaPlayer/UniversalMediaPlayer-Release.xcconfig","buck-out/gen/submodules/MediaResources/MediaResources-Debug.xcconfig","buck-out/gen/submodules/MediaResources/MediaResources-Profile.xcconfig","buck-out/gen/submodules/MediaResources/MediaResources-Release.xcconfig","buck-out/gen/submodules/MergeLists/MergeLists-Debug.xcconfig","buck-out/gen/submodules/MergeLists/MergeLists-Profile.xcconfig","buck-out/gen/submodules/MergeLists/MergeLists-Release.xcconfig","buck-out/gen/submodules/MessageReactionListUI/MessageReactionListUI-Debug.xcconfig","buck-out/gen/submodules/MessageReactionListUI/MessageReactionListUI-Profile.xcconfig","buck-out/gen/submodules/MessageReactionListUI/MessageReactionListUI-Release.xcconfig","buck-out/gen/submodules/MimeTypes/MimeTypes-Debug.xcconfig","buck-out/gen/submodules/MimeTypes/MimeTypes-Profile.xcconfig","buck-out/gen/submodules/MimeTypes/MimeTypes-Release.xcconfig","buck-out/gen/submodules/MosaicLayout/MosaicLayout-Debug.xcconfig","buck-out/gen/submodules/MosaicLayout/MosaicLayout-Profile.xcconfig","buck-out/gen/submodules/MosaicLayout/MosaicLayout-Release.xcconfig","buck-out/gen/submodules/MtProtoKit/MtProtoKit#shared-Debug.xcconfig","buck-out/gen/submodules/MtProtoKit/MtProtoKit#shared-Profile.xcconfig","buck-out/gen/submodules/MtProtoKit/MtProtoKit#shared-Release.xcconfig","buck-out/gen/submodules/MtProtoKit/openssl-Debug.xcconfig","buck-out/gen/submodules/MtProtoKit/openssl-Profile.xcconfig","buck-out/gen/submodules/MtProtoKit/openssl-Release.xcconfig","buck-out/gen/submodules/MtProtoKit/ton-Debug.xcconfig","buck-out/gen/submodules/MtProtoKit/ton-Profile.xcconfig","buck-out/gen/submodules/MtProtoKit/ton-Release.xcconfig","buck-out/gen/submodules/MusicAlbumArtResources/MusicAlbumArtResources-Debug.xcconfig","buck-out/gen/submodules/MusicAlbumArtResources/MusicAlbumArtResources-Profile.xcconfig","buck-out/gen/submodules/MusicAlbumArtResources/MusicAlbumArtResources-Release.xcconfig","buck-out/gen/submodules/NotificationMuteSettingsUI/NotificationMuteSettingsUI-Debug.xcconfig","buck-out/gen/submodules/NotificationMuteSettingsUI/NotificationMuteSettingsUI-Profile.xcconfig","buck-out/gen/submodules/NotificationMuteSettingsUI/NotificationMuteSettingsUI-Release.xcconfig","buck-out/gen/submodules/NotificationSoundSelectionUI/NotificationSoundSelectionUI-Debug.xcconfig","buck-out/gen/submodules/NotificationSoundSelectionUI/NotificationSoundSelectionUI-Profile.xcconfig","buck-out/gen/submodules/NotificationSoundSelectionUI/NotificationSoundSelectionUI-Release.xcconfig","buck-out/gen/submodules/OpenInExternalAppUI/OpenInExternalAppUI-Debug.xcconfig","buck-out/gen/submodules/OpenInExternalAppUI/OpenInExternalAppUI-Profile.xcconfig","buck-out/gen/submodules/OpenInExternalAppUI/OpenInExternalAppUI-Release.xcconfig","buck-out/gen/submodules/Opus/opus-Debug.xcconfig","buck-out/gen/submodules/Opus/opus-Profile.xcconfig","buck-out/gen/submodules/Opus/opus-Release.xcconfig","buck-out/gen/submodules/Opus/opus_lib-Debug.xcconfig","buck-out/gen/submodules/Opus/opus_lib-Profile.xcconfig","buck-out/gen/submodules/Opus/opus_lib-Release.xcconfig","buck-out/gen/submodules/OpusBinding/OpusBinding-Debug.xcconfig","buck-out/gen/submodules/OpusBinding/OpusBinding-Profile.xcconfig","buck-out/gen/submodules/OpusBinding/OpusBinding-Release.xcconfig","buck-out/gen/submodules/OverlayStatusController/OverlayStatusController-Debug.xcconfig","buck-out/gen/submodules/OverlayStatusController/OverlayStatusController-Profile.xcconfig","buck-out/gen/submodules/OverlayStatusController/OverlayStatusController-Release.xcconfig","buck-out/gen/submodules/PasscodeUI/PasscodeUI-Debug.xcconfig","buck-out/gen/submodules/PasscodeUI/PasscodeUI-Profile.xcconfig","buck-out/gen/submodules/PasscodeUI/PasscodeUI-Release.xcconfig","buck-out/gen/submodules/PassportUI/PassportUI-Debug.xcconfig","buck-out/gen/submodules/PassportUI/PassportUI-Profile.xcconfig","buck-out/gen/submodules/PassportUI/PassportUI-Release.xcconfig","buck-out/gen/submodules/PasswordSetupUI/PasswordSetupUI-Debug.xcconfig","buck-out/gen/submodules/PasswordSetupUI/PasswordSetupUI-Profile.xcconfig","buck-out/gen/submodules/PasswordSetupUI/PasswordSetupUI-Release.xcconfig","buck-out/gen/submodules/Pdf/Pdf-Debug.xcconfig","buck-out/gen/submodules/Pdf/Pdf-Profile.xcconfig","buck-out/gen/submodules/Pdf/Pdf-Release.xcconfig","buck-out/gen/submodules/PeerAvatarGalleryUI/PeerAvatarGalleryUI-Debug.xcconfig","buck-out/gen/submodules/PeerAvatarGalleryUI/PeerAvatarGalleryUI-Profile.xcconfig","buck-out/gen/submodules/PeerAvatarGalleryUI/PeerAvatarGalleryUI-Release.xcconfig","buck-out/gen/submodules/PeerInfoUI/PeerInfoUI-Debug.xcconfig","buck-out/gen/submodules/PeerInfoUI/PeerInfoUI-Profile.xcconfig","buck-out/gen/submodules/PeerInfoUI/PeerInfoUI-Release.xcconfig","buck-out/gen/submodules/PeerOnlineMarkerNode/PeerOnlineMarkerNode-Debug.xcconfig","buck-out/gen/submodules/PeerOnlineMarkerNode/PeerOnlineMarkerNode-Profile.xcconfig","buck-out/gen/submodules/PeerOnlineMarkerNode/PeerOnlineMarkerNode-Release.xcconfig","buck-out/gen/submodules/PeerPresenceStatusManager/PeerPresenceStatusManager-Debug.xcconfig","buck-out/gen/submodules/PeerPresenceStatusManager/PeerPresenceStatusManager-Profile.xcconfig","buck-out/gen/submodules/PeerPresenceStatusManager/PeerPresenceStatusManager-Release.xcconfig","buck-out/gen/submodules/PeersNearbyIconNode/PeersNearbyIconNode-Debug.xcconfig","buck-out/gen/submodules/PeersNearbyIconNode/PeersNearbyIconNode-Profile.xcconfig","buck-out/gen/submodules/PeersNearbyIconNode/PeersNearbyIconNode-Release.xcconfig","buck-out/gen/submodules/PeersNearbyUI/PeersNearbyUI-Debug.xcconfig","buck-out/gen/submodules/PeersNearbyUI/PeersNearbyUI-Profile.xcconfig","buck-out/gen/submodules/PeersNearbyUI/PeersNearbyUI-Release.xcconfig","buck-out/gen/submodules/PersistentStringHash/PersistentStringHash-Debug.xcconfig","buck-out/gen/submodules/PersistentStringHash/PersistentStringHash-Profile.xcconfig","buck-out/gen/submodules/PersistentStringHash/PersistentStringHash-Release.xcconfig","buck-out/gen/submodules/PhoneInputNode/PhoneInputNode-Debug.xcconfig","buck-out/gen/submodules/PhoneInputNode/PhoneInputNode-Profile.xcconfig","buck-out/gen/submodules/PhoneInputNode/PhoneInputNode-Release.xcconfig","buck-out/gen/submodules/PhotoResources/PhotoResources-Debug.xcconfig","buck-out/gen/submodules/PhotoResources/PhotoResources-Profile.xcconfig","buck-out/gen/submodules/PhotoResources/PhotoResources-Release.xcconfig","buck-out/gen/submodules/PlatformRestrictionMatching/PlatformRestrictionMatching-Debug.xcconfig","buck-out/gen/submodules/PlatformRestrictionMatching/PlatformRestrictionMatching-Profile.xcconfig","buck-out/gen/submodules/PlatformRestrictionMatching/PlatformRestrictionMatching-Release.xcconfig","buck-out/gen/submodules/Postbox/Postbox#shared-Debug.xcconfig","buck-out/gen/submodules/Postbox/Postbox#shared-Profile.xcconfig","buck-out/gen/submodules/Postbox/Postbox#shared-Release.xcconfig","buck-out/gen/submodules/ProgressNavigationButtonNode/ProgressNavigationButtonNode-Debug.xcconfig","buck-out/gen/submodules/ProgressNavigationButtonNode/ProgressNavigationButtonNode-Profile.xcconfig","buck-out/gen/submodules/ProgressNavigationButtonNode/ProgressNavigationButtonNode-Release.xcconfig","buck-out/gen/submodules/QrCode/QrCode-Debug.xcconfig","buck-out/gen/submodules/QrCode/QrCode-Profile.xcconfig","buck-out/gen/submodules/QrCode/QrCode-Release.xcconfig","buck-out/gen/submodules/RMIntro/RMIntro-Debug.xcconfig","buck-out/gen/submodules/RMIntro/RMIntro-Profile.xcconfig","buck-out/gen/submodules/RMIntro/RMIntro-Release.xcconfig","buck-out/gen/submodules/RadialStatusNode/RadialStatusNode-Debug.xcconfig","buck-out/gen/submodules/RadialStatusNode/RadialStatusNode-Profile.xcconfig","buck-out/gen/submodules/RadialStatusNode/RadialStatusNode-Release.xcconfig","buck-out/gen/submodules/RaiseToListen/RaiseToListen-Debug.xcconfig","buck-out/gen/submodules/RaiseToListen/RaiseToListen-Profile.xcconfig","buck-out/gen/submodules/RaiseToListen/RaiseToListen-Release.xcconfig","buck-out/gen/submodules/ReactionSelectionNode/ReactionSelectionNode-Debug.xcconfig","buck-out/gen/submodules/ReactionSelectionNode/ReactionSelectionNode-Profile.xcconfig","buck-out/gen/submodules/ReactionSelectionNode/ReactionSelectionNode-Release.xcconfig","buck-out/gen/submodules/SSignalKit/SSignalKit/SSignalKit-Debug.xcconfig","buck-out/gen/submodules/SSignalKit/SSignalKit/SSignalKit-Profile.xcconfig","buck-out/gen/submodules/SSignalKit/SSignalKit/SSignalKit-Release.xcconfig","buck-out/gen/submodules/SSignalKit/SwiftSignalKit/SwiftSignalKit#shared-Debug.xcconfig","buck-out/gen/submodules/SSignalKit/SwiftSignalKit/SwiftSignalKit#shared-Profile.xcconfig","buck-out/gen/submodules/SSignalKit/SwiftSignalKit/SwiftSignalKit#shared-Release.xcconfig","buck-out/gen/submodules/SaveToCameraRoll/SaveToCameraRoll-Debug.xcconfig","buck-out/gen/submodules/SaveToCameraRoll/SaveToCameraRoll-Profile.xcconfig","buck-out/gen/submodules/SaveToCameraRoll/SaveToCameraRoll-Release.xcconfig","buck-out/gen/submodules/ScreenCaptureDetection/ScreenCaptureDetection-Debug.xcconfig","buck-out/gen/submodules/ScreenCaptureDetection/ScreenCaptureDetection-Profile.xcconfig","buck-out/gen/submodules/ScreenCaptureDetection/ScreenCaptureDetection-Release.xcconfig","buck-out/gen/submodules/SearchBarNode/SearchBarNode-Debug.xcconfig","buck-out/gen/submodules/SearchBarNode/SearchBarNode-Profile.xcconfig","buck-out/gen/submodules/SearchBarNode/SearchBarNode-Release.xcconfig","buck-out/gen/submodules/SearchUI/SearchUI-Debug.xcconfig","buck-out/gen/submodules/SearchUI/SearchUI-Profile.xcconfig","buck-out/gen/submodules/SearchUI/SearchUI-Release.xcconfig","buck-out/gen/submodules/SegmentedControlNode/SegmentedControlNode-Debug.xcconfig","buck-out/gen/submodules/SegmentedControlNode/SegmentedControlNode-Profile.xcconfig","buck-out/gen/submodules/SegmentedControlNode/SegmentedControlNode-Release.xcconfig","buck-out/gen/submodules/SelectablePeerNode/SelectablePeerNode-Debug.xcconfig","buck-out/gen/submodules/SelectablePeerNode/SelectablePeerNode-Profile.xcconfig","buck-out/gen/submodules/SelectablePeerNode/SelectablePeerNode-Release.xcconfig","buck-out/gen/submodules/SettingsUI/SettingsUI-Debug.xcconfig","buck-out/gen/submodules/SettingsUI/SettingsUI-Profile.xcconfig","buck-out/gen/submodules/SettingsUI/SettingsUI-Release.xcconfig","buck-out/gen/submodules/ShareController/ShareController-Debug.xcconfig","buck-out/gen/submodules/ShareController/ShareController-Profile.xcconfig","buck-out/gen/submodules/ShareController/ShareController-Release.xcconfig","buck-out/gen/submodules/ShareItems/ShareItems-Debug.xcconfig","buck-out/gen/submodules/ShareItems/ShareItems-Profile.xcconfig","buck-out/gen/submodules/ShareItems/ShareItems-Release.xcconfig","buck-out/gen/submodules/SinglePhoneInputNode/SinglePhoneInputNode-Debug.xcconfig","buck-out/gen/submodules/SinglePhoneInputNode/SinglePhoneInputNode-Profile.xcconfig","buck-out/gen/submodules/SinglePhoneInputNode/SinglePhoneInputNode-Release.xcconfig","buck-out/gen/submodules/SolidRoundedButtonNode/SolidRoundedButtonNode-Debug.xcconfig","buck-out/gen/submodules/SolidRoundedButtonNode/SolidRoundedButtonNode-Profile.xcconfig","buck-out/gen/submodules/SolidRoundedButtonNode/SolidRoundedButtonNode-Release.xcconfig","buck-out/gen/submodules/StickerPackPreviewUI/StickerPackPreviewUI-Debug.xcconfig","buck-out/gen/submodules/StickerPackPreviewUI/StickerPackPreviewUI-Profile.xcconfig","buck-out/gen/submodules/StickerPackPreviewUI/StickerPackPreviewUI-Release.xcconfig","buck-out/gen/submodules/StickerResources/StickerResources-Debug.xcconfig","buck-out/gen/submodules/StickerResources/StickerResources-Profile.xcconfig","buck-out/gen/submodules/StickerResources/StickerResources-Release.xcconfig","buck-out/gen/submodules/Stripe/Stripe-Debug.xcconfig","buck-out/gen/submodules/Stripe/Stripe-Profile.xcconfig","buck-out/gen/submodules/Stripe/Stripe-Release.xcconfig","buck-out/gen/submodules/SwipeToDismissGesture/SwipeToDismissGesture-Debug.xcconfig","buck-out/gen/submodules/SwipeToDismissGesture/SwipeToDismissGesture-Profile.xcconfig","buck-out/gen/submodules/SwipeToDismissGesture/SwipeToDismissGesture-Release.xcconfig","buck-out/gen/submodules/SwitchNode/SwitchNode-Debug.xcconfig","buck-out/gen/submodules/SwitchNode/SwitchNode-Profile.xcconfig","buck-out/gen/submodules/SwitchNode/SwitchNode-Release.xcconfig","buck-out/gen/submodules/TelegramApi/TelegramApi-Debug.xcconfig","buck-out/gen/submodules/TelegramApi/TelegramApi-Profile.xcconfig","buck-out/gen/submodules/TelegramApi/TelegramApi-Release.xcconfig","buck-out/gen/submodules/TelegramAudio/TelegramAudio-Debug.xcconfig","buck-out/gen/submodules/TelegramAudio/TelegramAudio-Profile.xcconfig","buck-out/gen/submodules/TelegramAudio/TelegramAudio-Release.xcconfig","buck-out/gen/submodules/TelegramBaseController/TelegramBaseController-Debug.xcconfig","buck-out/gen/submodules/TelegramBaseController/TelegramBaseController-Profile.xcconfig","buck-out/gen/submodules/TelegramBaseController/TelegramBaseController-Release.xcconfig","buck-out/gen/submodules/TelegramCallsUI/TelegramCallsUI-Debug.xcconfig","buck-out/gen/submodules/TelegramCallsUI/TelegramCallsUI-Profile.xcconfig","buck-out/gen/submodules/TelegramCallsUI/TelegramCallsUI-Release.xcconfig","buck-out/gen/submodules/TelegramCore/TelegramCore#shared-Debug.xcconfig","buck-out/gen/submodules/TelegramCore/TelegramCore#shared-Profile.xcconfig","buck-out/gen/submodules/TelegramCore/TelegramCore#shared-Release.xcconfig","buck-out/gen/submodules/TelegramNotices/TelegramNotices-Debug.xcconfig","buck-out/gen/submodules/TelegramNotices/TelegramNotices-Profile.xcconfig","buck-out/gen/submodules/TelegramNotices/TelegramNotices-Release.xcconfig","buck-out/gen/submodules/TelegramPermissions/TelegramPermissions-Debug.xcconfig","buck-out/gen/submodules/TelegramPermissions/TelegramPermissions-Profile.xcconfig","buck-out/gen/submodules/TelegramPermissions/TelegramPermissions-Release.xcconfig","buck-out/gen/submodules/TelegramPermissionsUI/TelegramPermissionsUI-Debug.xcconfig","buck-out/gen/submodules/TelegramPermissionsUI/TelegramPermissionsUI-Profile.xcconfig","buck-out/gen/submodules/TelegramPermissionsUI/TelegramPermissionsUI-Release.xcconfig","buck-out/gen/submodules/TelegramPresentationData/TelegramPresentationData-Debug.xcconfig","buck-out/gen/submodules/TelegramPresentationData/TelegramPresentationData-Profile.xcconfig","buck-out/gen/submodules/TelegramPresentationData/TelegramPresentationData-Release.xcconfig","buck-out/gen/submodules/TelegramStringFormatting/TelegramStringFormatting-Debug.xcconfig","buck-out/gen/submodules/TelegramStringFormatting/TelegramStringFormatting-Profile.xcconfig","buck-out/gen/submodules/TelegramStringFormatting/TelegramStringFormatting-Release.xcconfig","buck-out/gen/submodules/TelegramUI/TelegramUI#shared-Debug.xcconfig","buck-out/gen/submodules/TelegramUI/TelegramUI#shared-Profile.xcconfig","buck-out/gen/submodules/TelegramUI/TelegramUI#shared-Release.xcconfig","buck-out/gen/submodules/TelegramUIPreferences/TelegramUIPreferences-Debug.xcconfig","buck-out/gen/submodules/TelegramUIPreferences/TelegramUIPreferences-Profile.xcconfig","buck-out/gen/submodules/TelegramUIPreferences/TelegramUIPreferences-Release.xcconfig","buck-out/gen/submodules/TelegramUniversalVideoContent/TelegramUniversalVideoContent-Debug.xcconfig","buck-out/gen/submodules/TelegramUniversalVideoContent/TelegramUniversalVideoContent-Profile.xcconfig","buck-out/gen/submodules/TelegramUniversalVideoContent/TelegramUniversalVideoContent-Release.xcconfig","buck-out/gen/submodules/TelegramUpdateUI/TelegramUpdateUI-Debug.xcconfig","buck-out/gen/submodules/TelegramUpdateUI/TelegramUpdateUI-Profile.xcconfig","buck-out/gen/submodules/TelegramUpdateUI/TelegramUpdateUI-Release.xcconfig","buck-out/gen/submodules/TelegramVoip/TelegramVoip-Debug.xcconfig","buck-out/gen/submodules/TelegramVoip/TelegramVoip-Profile.xcconfig","buck-out/gen/submodules/TelegramVoip/TelegramVoip-Release.xcconfig","buck-out/gen/submodules/TemporaryCachedPeerDataManager/TemporaryCachedPeerDataManager-Debug.xcconfig","buck-out/gen/submodules/TemporaryCachedPeerDataManager/TemporaryCachedPeerDataManager-Profile.xcconfig","buck-out/gen/submodules/TemporaryCachedPeerDataManager/TemporaryCachedPeerDataManager-Release.xcconfig","buck-out/gen/submodules/TextFormat/TextFormat-Debug.xcconfig","buck-out/gen/submodules/TextFormat/TextFormat-Profile.xcconfig","buck-out/gen/submodules/TextFormat/TextFormat-Release.xcconfig","buck-out/gen/submodules/TextSelectionNode/TextSelectionNode-Debug.xcconfig","buck-out/gen/submodules/TextSelectionNode/TextSelectionNode-Profile.xcconfig","buck-out/gen/submodules/TextSelectionNode/TextSelectionNode-Release.xcconfig","buck-out/gen/submodules/TinyThumbnail/TinyThumbnail-Debug.xcconfig","buck-out/gen/submodules/TinyThumbnail/TinyThumbnail-Profile.xcconfig","buck-out/gen/submodules/TinyThumbnail/TinyThumbnail-Release.xcconfig","buck-out/gen/submodules/TouchDownGesture/TouchDownGesture-Debug.xcconfig","buck-out/gen/submodules/TouchDownGesture/TouchDownGesture-Profile.xcconfig","buck-out/gen/submodules/TouchDownGesture/TouchDownGesture-Release.xcconfig","buck-out/gen/submodules/Tuples/Tuples-Debug.xcconfig","buck-out/gen/submodules/Tuples/Tuples-Profile.xcconfig","buck-out/gen/submodules/Tuples/Tuples-Release.xcconfig","buck-out/gen/submodules/UndoUI/UndoUI-Debug.xcconfig","buck-out/gen/submodules/UndoUI/UndoUI-Profile.xcconfig","buck-out/gen/submodules/UndoUI/UndoUI-Release.xcconfig","buck-out/gen/submodules/UrlEscaping/UrlEscaping-Debug.xcconfig","buck-out/gen/submodules/UrlEscaping/UrlEscaping-Profile.xcconfig","buck-out/gen/submodules/UrlEscaping/UrlEscaping-Release.xcconfig","buck-out/gen/submodules/UrlHandling/UrlHandling-Debug.xcconfig","buck-out/gen/submodules/UrlHandling/UrlHandling-Profile.xcconfig","buck-out/gen/submodules/UrlHandling/UrlHandling-Release.xcconfig","buck-out/gen/submodules/WalletUI/WalletUI-Debug.xcconfig","buck-out/gen/submodules/WalletUI/WalletUI-Profile.xcconfig","buck-out/gen/submodules/WalletUI/WalletUI-Release.xcconfig","buck-out/gen/submodules/WallpaperResources/WallpaperResources-Debug.xcconfig","buck-out/gen/submodules/WallpaperResources/WallpaperResources-Profile.xcconfig","buck-out/gen/submodules/WallpaperResources/WallpaperResources-Release.xcconfig","buck-out/gen/submodules/WatchBridge/WatchBridge-Debug.xcconfig","buck-out/gen/submodules/WatchBridge/WatchBridge-Profile.xcconfig","buck-out/gen/submodules/WatchBridge/WatchBridge-Release.xcconfig","buck-out/gen/submodules/WatchBridgeAudio/WatchBridgeAudio-Debug.xcconfig","buck-out/gen/submodules/WatchBridgeAudio/WatchBridgeAudio-Profile.xcconfig","buck-out/gen/submodules/WatchBridgeAudio/WatchBridgeAudio-Release.xcconfig","buck-out/gen/submodules/WatchCommon/Host/WatchCommon-Debug.xcconfig","buck-out/gen/submodules/WatchCommon/Host/WatchCommon-Profile.xcconfig","buck-out/gen/submodules/WatchCommon/Host/WatchCommon-Release.xcconfig","buck-out/gen/submodules/WebP/WebPImage-Debug.xcconfig","buck-out/gen/submodules/WebP/WebPImage-Profile.xcconfig","buck-out/gen/submodules/WebP/WebPImage-Release.xcconfig","buck-out/gen/submodules/WebP/WebP_lib-Debug.xcconfig","buck-out/gen/submodules/WebP/WebP_lib-Profile.xcconfig","buck-out/gen/submodules/WebP/WebP_lib-Release.xcconfig","buck-out/gen/submodules/WebSearchUI/WebSearchUI-Debug.xcconfig","buck-out/gen/submodules/WebSearchUI/WebSearchUI-Profile.xcconfig","buck-out/gen/submodules/WebSearchUI/WebSearchUI-Release.xcconfig","buck-out/gen/submodules/WebUI/WebUI-Debug.xcconfig","buck-out/gen/submodules/WebUI/WebUI-Profile.xcconfig","buck-out/gen/submodules/WebUI/WebUI-Release.xcconfig","buck-out/gen/submodules/WebsiteType/WebsiteType-Debug.xcconfig","buck-out/gen/submodules/WebsiteType/WebsiteType-Profile.xcconfig","buck-out/gen/submodules/WebsiteType/WebsiteType-Release.xcconfig","buck-out/gen/submodules/YuvConversion/YuvConversion-Debug.xcconfig","buck-out/gen/submodules/YuvConversion/YuvConversion-Profile.xcconfig","buck-out/gen/submodules/YuvConversion/YuvConversion-Release.xcconfig","buck-out/gen/submodules/libphonenumber/libphonenumber-Debug.xcconfig","buck-out/gen/submodules/libphonenumber/libphonenumber-Profile.xcconfig","buck-out/gen/submodules/libphonenumber/libphonenumber-Release.xcconfig","buck-out/gen/submodules/libtgvoip/libtgvoip-Debug.xcconfig","buck-out/gen/submodules/libtgvoip/libtgvoip-Profile.xcconfig","buck-out/gen/submodules/libtgvoip/libtgvoip-Release.xcconfig","buck-out/gen/submodules/lottie-ios/Lottie-Debug.xcconfig","buck-out/gen/submodules/lottie-ios/Lottie-Profile.xcconfig","buck-out/gen/submodules/lottie-ios/Lottie-Release.xcconfig","buck-out/gen/submodules/rlottie/RLottieBinding-Debug.xcconfig","buck-out/gen/submodules/rlottie/RLottieBinding-Profile.xcconfig","buck-out/gen/submodules/rlottie/RLottieBinding-Release.xcconfig","buck-out/gen/submodules/sqlcipher/sqlcipher-Debug.xcconfig","buck-out/gen/submodules/sqlcipher/sqlcipher-Profile.xcconfig","buck-out/gen/submodules/sqlcipher/sqlcipher-Release.xcconfig"],"copy-in-xcode":[]}
\ No newline at end of file
+{"required-targets":["//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_ac3_parser.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_adts_parser.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_avcodec.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_avdct.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_avfft.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_d3d11va.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_dirac.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_dv_profile.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_dxva2.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_jni.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_mediacodec.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_qsv.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_vaapi.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_vdpau.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_version.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_videotoolbox.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_vorbis_parser.h","//submodules/FFMpeg:ffmpeg_header_libavcodec_sub_xvmc.h","//submodules/FFMpeg:ffmpeg_header_libavformat_sub_avformat.h","//submodules/FFMpeg:ffmpeg_header_libavformat_sub_avio.h","//submodules/FFMpeg:ffmpeg_header_libavformat_sub_version.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_adler32.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_aes.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_aes_ctr.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_attributes.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_audio_fifo.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_avassert.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_avconfig.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_avstring.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_avutil.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_base64.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_blowfish.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_bprint.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_bswap.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_buffer.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_camellia.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_cast5.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_channel_layout.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_common.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_cpu.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_crc.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_des.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_dict.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_display.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_downmix_info.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_encryption_info.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_error.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_eval.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_ffversion.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_fifo.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_file.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_frame.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hash.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hmac.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_cuda.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_d3d11va.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_drm.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_dxva2.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_mediacodec.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_qsv.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_vaapi.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_vdpau.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_hwcontext_videotoolbox.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_imgutils.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_intfloat.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_intreadwrite.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_lfg.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_log.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_lzo.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_macros.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_mastering_display_metadata.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_mathematics.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_md5.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_mem.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_motion_vector.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_murmur3.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_opt.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_parseutils.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_pixdesc.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_pixelutils.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_pixfmt.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_random_seed.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_rational.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_rc4.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_replaygain.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_ripemd.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_samplefmt.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_sha.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_sha512.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_spherical.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_stereo3d.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_tea.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_threadmessage.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_time.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_timecode.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_timestamp.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_tree.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_twofish.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_version.h","//submodules/FFMpeg:ffmpeg_header_libavutil_sub_xtea.h","//submodules/FFMpeg:ffmpeg_header_libswresample_sub_swresample.h","//submodules/FFMpeg:ffmpeg_header_libswresample_sub_version.h","//submodules/FFMpeg:libffmpeg_build","//submodules/Opus:opus_lib_file","//submodules/WebP:WebP_lib_file","//submodules/openssl:openssl_build_merged","//submodules/openssl:openssl_header_openssl_sub_aes.h","//submodules/openssl:openssl_header_openssl_sub_asn1.h","//submodules/openssl:openssl_header_openssl_sub_asn1_mac.h","//submodules/openssl:openssl_header_openssl_sub_asn1err.h","//submodules/openssl:openssl_header_openssl_sub_asn1t.h","//submodules/openssl:openssl_header_openssl_sub_async.h","//submodules/openssl:openssl_header_openssl_sub_asyncerr.h","//submodules/openssl:openssl_header_openssl_sub_bio.h","//submodules/openssl:openssl_header_openssl_sub_bioerr.h","//submodules/openssl:openssl_header_openssl_sub_blowfish.h","//submodules/openssl:openssl_header_openssl_sub_bn.h","//submodules/openssl:openssl_header_openssl_sub_bnerr.h","//submodules/openssl:openssl_header_openssl_sub_buffer.h","//submodules/openssl:openssl_header_openssl_sub_buffererr.h","//submodules/openssl:openssl_header_openssl_sub_camellia.h","//submodules/openssl:openssl_header_openssl_sub_cast.h","//submodules/openssl:openssl_header_openssl_sub_cmac.h","//submodules/openssl:openssl_header_openssl_sub_cms.h","//submodules/openssl:openssl_header_openssl_sub_cmserr.h","//submodules/openssl:openssl_header_openssl_sub_comp.h","//submodules/openssl:openssl_header_openssl_sub_comperr.h","//submodules/openssl:openssl_header_openssl_sub_conf.h","//submodules/openssl:openssl_header_openssl_sub_conf_api.h","//submodules/openssl:openssl_header_openssl_sub_conferr.h","//submodules/openssl:openssl_header_openssl_sub_crypto.h","//submodules/openssl:openssl_header_openssl_sub_cryptoerr.h","//submodules/openssl:openssl_header_openssl_sub_ct.h","//submodules/openssl:openssl_header_openssl_sub_cterr.h","//submodules/openssl:openssl_header_openssl_sub_des.h","//submodules/openssl:openssl_header_openssl_sub_dh.h","//submodules/openssl:openssl_header_openssl_sub_dherr.h","//submodules/openssl:openssl_header_openssl_sub_dsa.h","//submodules/openssl:openssl_header_openssl_sub_dsaerr.h","//submodules/openssl:openssl_header_openssl_sub_dtls1.h","//submodules/openssl:openssl_header_openssl_sub_e_os2.h","//submodules/openssl:openssl_header_openssl_sub_ebcdic.h","//submodules/openssl:openssl_header_openssl_sub_ec.h","//submodules/openssl:openssl_header_openssl_sub_ecdh.h","//submodules/openssl:openssl_header_openssl_sub_ecdsa.h","//submodules/openssl:openssl_header_openssl_sub_ecerr.h","//submodules/openssl:openssl_header_openssl_sub_engine.h","//submodules/openssl:openssl_header_openssl_sub_engineerr.h","//submodules/openssl:openssl_header_openssl_sub_err.h","//submodules/openssl:openssl_header_openssl_sub_evp.h","//submodules/openssl:openssl_header_openssl_sub_evperr.h","//submodules/openssl:openssl_header_openssl_sub_hmac.h","//submodules/openssl:openssl_header_openssl_sub_idea.h","//submodules/openssl:openssl_header_openssl_sub_kdf.h","//submodules/openssl:openssl_header_openssl_sub_kdferr.h","//submodules/openssl:openssl_header_openssl_sub_lhash.h","//submodules/openssl:openssl_header_openssl_sub_md2.h","//submodules/openssl:openssl_header_openssl_sub_md4.h","//submodules/openssl:openssl_header_openssl_sub_md5.h","//submodules/openssl:openssl_header_openssl_sub_mdc2.h","//submodules/openssl:openssl_header_openssl_sub_modes.h","//submodules/openssl:openssl_header_openssl_sub_obj_mac.h","//submodules/openssl:openssl_header_openssl_sub_objects.h","//submodules/openssl:openssl_header_openssl_sub_objectserr.h","//submodules/openssl:openssl_header_openssl_sub_ocsp.h","//submodules/openssl:openssl_header_openssl_sub_ocsperr.h","//submodules/openssl:openssl_header_openssl_sub_opensslconf.h","//submodules/openssl:openssl_header_openssl_sub_opensslv.h","//submodules/openssl:openssl_header_openssl_sub_ossl_typ.h","//submodules/openssl:openssl_header_openssl_sub_pem.h","//submodules/openssl:openssl_header_openssl_sub_pem2.h","//submodules/openssl:openssl_header_openssl_sub_pemerr.h","//submodules/openssl:openssl_header_openssl_sub_pkcs12.h","//submodules/openssl:openssl_header_openssl_sub_pkcs12err.h","//submodules/openssl:openssl_header_openssl_sub_pkcs7.h","//submodules/openssl:openssl_header_openssl_sub_pkcs7err.h","//submodules/openssl:openssl_header_openssl_sub_rand.h","//submodules/openssl:openssl_header_openssl_sub_rand_drbg.h","//submodules/openssl:openssl_header_openssl_sub_randerr.h","//submodules/openssl:openssl_header_openssl_sub_rc2.h","//submodules/openssl:openssl_header_openssl_sub_rc4.h","//submodules/openssl:openssl_header_openssl_sub_rc5.h","//submodules/openssl:openssl_header_openssl_sub_ripemd.h","//submodules/openssl:openssl_header_openssl_sub_rsa.h","//submodules/openssl:openssl_header_openssl_sub_rsaerr.h","//submodules/openssl:openssl_header_openssl_sub_safestack.h","//submodules/openssl:openssl_header_openssl_sub_seed.h","//submodules/openssl:openssl_header_openssl_sub_sha.h","//submodules/openssl:openssl_header_openssl_sub_srp.h","//submodules/openssl:openssl_header_openssl_sub_srtp.h","//submodules/openssl:openssl_header_openssl_sub_ssl.h","//submodules/openssl:openssl_header_openssl_sub_ssl2.h","//submodules/openssl:openssl_header_openssl_sub_ssl3.h","//submodules/openssl:openssl_header_openssl_sub_sslerr.h","//submodules/openssl:openssl_header_openssl_sub_stack.h","//submodules/openssl:openssl_header_openssl_sub_store.h","//submodules/openssl:openssl_header_openssl_sub_storeerr.h","//submodules/openssl:openssl_header_openssl_sub_symhacks.h","//submodules/openssl:openssl_header_openssl_sub_tls1.h","//submodules/openssl:openssl_header_openssl_sub_ts.h","//submodules/openssl:openssl_header_openssl_sub_tserr.h","//submodules/openssl:openssl_header_openssl_sub_txt_db.h","//submodules/openssl:openssl_header_openssl_sub_ui.h","//submodules/openssl:openssl_header_openssl_sub_uierr.h","//submodules/openssl:openssl_header_openssl_sub_whrlpool.h","//submodules/openssl:openssl_header_openssl_sub_x509.h","//submodules/openssl:openssl_header_openssl_sub_x509_vfy.h","//submodules/openssl:openssl_header_openssl_sub_x509err.h","//submodules/openssl:openssl_header_openssl_sub_x509v3.h","//submodules/openssl:openssl_header_openssl_sub_x509v3err.h","//submodules/ton:ton_build","//submodules/ton:ton_header_auto_sub_tl_sub_tonlib_api.h","//submodules/ton:ton_header_td_sub_utils_sub_SharedSlice.h","//submodules/ton:ton_header_td_sub_utils_sub_Slice-decl.h","//submodules/ton:ton_header_td_sub_utils_sub_Slice.h","//submodules/ton:ton_header_td_sub_utils_sub_check.h","//submodules/ton:ton_header_td_sub_utils_sub_common.h","//submodules/ton:ton_header_td_sub_utils_sub_config.h","//submodules/ton:ton_header_td_sub_utils_sub_int_types.h","//submodules/ton:ton_header_td_sub_utils_sub_port_sub_platform.h","//submodules/ton:ton_header_td_sub_utils_sub_unique_ptr.h","//submodules/ton:ton_header_tl_sub_TlObject.h","//submodules/ton:ton_header_tonlib_sub_Client.h","//submodules/ton:ton_header_tonlib_sub_tonlib_client_json.h","//submodules/ton:ton_header_tonlib_sub_tonlibjson_export.h"],"xcconfig-paths":["buck-out/gen/AppLibrary-Debug.xcconfig","buck-out/gen/AppLibrary-Profile.xcconfig","buck-out/gen/AppLibrary-Release.xcconfig","buck-out/gen/IntentsExtension#iphonesimulator-x86_64-Debug.xcconfig","buck-out/gen/IntentsExtension#iphonesimulator-x86_64-Profile.xcconfig","buck-out/gen/IntentsExtension#iphonesimulator-x86_64-Release.xcconfig","buck-out/gen/NotificationContentExtension#iphonesimulator-x86_64-Debug.xcconfig","buck-out/gen/NotificationContentExtension#iphonesimulator-x86_64-Profile.xcconfig","buck-out/gen/NotificationContentExtension#iphonesimulator-x86_64-Release.xcconfig","buck-out/gen/NotificationServiceExtension#iphonesimulator-x86_64-Debug.xcconfig","buck-out/gen/NotificationServiceExtension#iphonesimulator-x86_64-Profile.xcconfig","buck-out/gen/NotificationServiceExtension#iphonesimulator-x86_64-Release.xcconfig","buck-out/gen/ShareExtension#iphonesimulator-x86_64-Debug.xcconfig","buck-out/gen/ShareExtension#iphonesimulator-x86_64-Profile.xcconfig","buck-out/gen/ShareExtension#iphonesimulator-x86_64-Release.xcconfig","buck-out/gen/Telegram-Debug.xcconfig","buck-out/gen/Telegram-Profile.xcconfig","buck-out/gen/Telegram-Release.xcconfig","buck-out/gen/WatchApp#watchsimulator-i386-Debug.xcconfig","buck-out/gen/WatchApp#watchsimulator-i386-Profile.xcconfig","buck-out/gen/WatchApp#watchsimulator-i386-Release.xcconfig","buck-out/gen/WatchAppExtension#watchsimulator-i386-Debug.xcconfig","buck-out/gen/WatchAppExtension#watchsimulator-i386-Profile.xcconfig","buck-out/gen/WatchAppExtension#watchsimulator-i386-Release.xcconfig","buck-out/gen/WidgetExtension#iphonesimulator-x86_64-Debug.xcconfig","buck-out/gen/WidgetExtension#iphonesimulator-x86_64-Profile.xcconfig","buck-out/gen/WidgetExtension#iphonesimulator-x86_64-Release.xcconfig","buck-out/gen/submodules/AccountContext/AccountContext-Debug.xcconfig","buck-out/gen/submodules/AccountContext/AccountContext-Profile.xcconfig","buck-out/gen/submodules/AccountContext/AccountContext-Release.xcconfig","buck-out/gen/submodules/ActionSheetPeerItem/ActionSheetPeerItem-Debug.xcconfig","buck-out/gen/submodules/ActionSheetPeerItem/ActionSheetPeerItem-Profile.xcconfig","buck-out/gen/submodules/ActionSheetPeerItem/ActionSheetPeerItem-Release.xcconfig","buck-out/gen/submodules/ActivityIndicator/ActivityIndicator-Debug.xcconfig","buck-out/gen/submodules/ActivityIndicator/ActivityIndicator-Profile.xcconfig","buck-out/gen/submodules/ActivityIndicator/ActivityIndicator-Release.xcconfig","buck-out/gen/submodules/AlertUI/AlertUI-Debug.xcconfig","buck-out/gen/submodules/AlertUI/AlertUI-Profile.xcconfig","buck-out/gen/submodules/AlertUI/AlertUI-Release.xcconfig","buck-out/gen/submodules/AnimationUI/AnimationUI-Debug.xcconfig","buck-out/gen/submodules/AnimationUI/AnimationUI-Profile.xcconfig","buck-out/gen/submodules/AnimationUI/AnimationUI-Release.xcconfig","buck-out/gen/submodules/AppBundle/AppBundle-Debug.xcconfig","buck-out/gen/submodules/AppBundle/AppBundle-Profile.xcconfig","buck-out/gen/submodules/AppBundle/AppBundle-Release.xcconfig","buck-out/gen/submodules/AsyncDisplayKit/AsyncDisplayKit#shared-Debug.xcconfig","buck-out/gen/submodules/AsyncDisplayKit/AsyncDisplayKit#shared-Profile.xcconfig","buck-out/gen/submodules/AsyncDisplayKit/AsyncDisplayKit#shared-Release.xcconfig","buck-out/gen/submodules/AuthorizationUI/AuthorizationUI-Debug.xcconfig","buck-out/gen/submodules/AuthorizationUI/AuthorizationUI-Profile.xcconfig","buck-out/gen/submodules/AuthorizationUI/AuthorizationUI-Release.xcconfig","buck-out/gen/submodules/AvatarNode/AvatarNode-Debug.xcconfig","buck-out/gen/submodules/AvatarNode/AvatarNode-Profile.xcconfig","buck-out/gen/submodules/AvatarNode/AvatarNode-Release.xcconfig","buck-out/gen/submodules/BotPaymentsUI/BotPaymentsUI-Debug.xcconfig","buck-out/gen/submodules/BotPaymentsUI/BotPaymentsUI-Profile.xcconfig","buck-out/gen/submodules/BotPaymentsUI/BotPaymentsUI-Release.xcconfig","buck-out/gen/submodules/BuildConfig/BuildConfig-Debug.xcconfig","buck-out/gen/submodules/BuildConfig/BuildConfig-Profile.xcconfig","buck-out/gen/submodules/BuildConfig/BuildConfig-Release.xcconfig","buck-out/gen/submodules/CallListUI/CallListUI-Debug.xcconfig","buck-out/gen/submodules/CallListUI/CallListUI-Profile.xcconfig","buck-out/gen/submodules/CallListUI/CallListUI-Release.xcconfig","buck-out/gen/submodules/ChatListSearchItemHeader/ChatListSearchItemHeader-Debug.xcconfig","buck-out/gen/submodules/ChatListSearchItemHeader/ChatListSearchItemHeader-Profile.xcconfig","buck-out/gen/submodules/ChatListSearchItemHeader/ChatListSearchItemHeader-Release.xcconfig","buck-out/gen/submodules/ChatListSearchItemNode/ChatListSearchItemNode-Debug.xcconfig","buck-out/gen/submodules/ChatListSearchItemNode/ChatListSearchItemNode-Profile.xcconfig","buck-out/gen/submodules/ChatListSearchItemNode/ChatListSearchItemNode-Release.xcconfig","buck-out/gen/submodules/ChatListSearchRecentPeersNode/ChatListSearchRecentPeersNode-Debug.xcconfig","buck-out/gen/submodules/ChatListSearchRecentPeersNode/ChatListSearchRecentPeersNode-Profile.xcconfig","buck-out/gen/submodules/ChatListSearchRecentPeersNode/ChatListSearchRecentPeersNode-Release.xcconfig","buck-out/gen/submodules/ChatListUI/ChatListUI-Debug.xcconfig","buck-out/gen/submodules/ChatListUI/ChatListUI-Profile.xcconfig","buck-out/gen/submodules/ChatListUI/ChatListUI-Release.xcconfig","buck-out/gen/submodules/ChatTitleActivityNode/ChatTitleActivityNode-Debug.xcconfig","buck-out/gen/submodules/ChatTitleActivityNode/ChatTitleActivityNode-Profile.xcconfig","buck-out/gen/submodules/ChatTitleActivityNode/ChatTitleActivityNode-Release.xcconfig","buck-out/gen/submodules/CheckNode/CheckNode-Debug.xcconfig","buck-out/gen/submodules/CheckNode/CheckNode-Profile.xcconfig","buck-out/gen/submodules/CheckNode/CheckNode-Release.xcconfig","buck-out/gen/submodules/ComposePollUI/ComposePollUI-Debug.xcconfig","buck-out/gen/submodules/ComposePollUI/ComposePollUI-Profile.xcconfig","buck-out/gen/submodules/ComposePollUI/ComposePollUI-Release.xcconfig","buck-out/gen/submodules/ContactListUI/ContactListUI-Debug.xcconfig","buck-out/gen/submodules/ContactListUI/ContactListUI-Profile.xcconfig","buck-out/gen/submodules/ContactListUI/ContactListUI-Release.xcconfig","buck-out/gen/submodules/ContactsPeerItem/ContactsPeerItem-Debug.xcconfig","buck-out/gen/submodules/ContactsPeerItem/ContactsPeerItem-Profile.xcconfig","buck-out/gen/submodules/ContactsPeerItem/ContactsPeerItem-Release.xcconfig","buck-out/gen/submodules/ContextUI/ContextUI-Debug.xcconfig","buck-out/gen/submodules/ContextUI/ContextUI-Profile.xcconfig","buck-out/gen/submodules/ContextUI/ContextUI-Release.xcconfig","buck-out/gen/submodules/CounterContollerTitleView/CounterContollerTitleView-Debug.xcconfig","buck-out/gen/submodules/CounterContollerTitleView/CounterContollerTitleView-Profile.xcconfig","buck-out/gen/submodules/CounterContollerTitleView/CounterContollerTitleView-Release.xcconfig","buck-out/gen/submodules/CountrySelectionUI/CountrySelectionUI-Debug.xcconfig","buck-out/gen/submodules/CountrySelectionUI/CountrySelectionUI-Profile.xcconfig","buck-out/gen/submodules/CountrySelectionUI/CountrySelectionUI-Release.xcconfig","buck-out/gen/submodules/Crc32/Crc32-Debug.xcconfig","buck-out/gen/submodules/Crc32/Crc32-Profile.xcconfig","buck-out/gen/submodules/Crc32/Crc32-Release.xcconfig","buck-out/gen/submodules/DateSelectionUI/DateSelectionUI-Debug.xcconfig","buck-out/gen/submodules/DateSelectionUI/DateSelectionUI-Profile.xcconfig","buck-out/gen/submodules/DateSelectionUI/DateSelectionUI-Release.xcconfig","buck-out/gen/submodules/DeleteChatPeerActionSheetItem/DeleteChatPeerActionSheetItem-Debug.xcconfig","buck-out/gen/submodules/DeleteChatPeerActionSheetItem/DeleteChatPeerActionSheetItem-Profile.xcconfig","buck-out/gen/submodules/DeleteChatPeerActionSheetItem/DeleteChatPeerActionSheetItem-Release.xcconfig","buck-out/gen/submodules/DeviceAccess/DeviceAccess-Debug.xcconfig","buck-out/gen/submodules/DeviceAccess/DeviceAccess-Profile.xcconfig","buck-out/gen/submodules/DeviceAccess/DeviceAccess-Release.xcconfig","buck-out/gen/submodules/DeviceLocationManager/DeviceLocationManager-Debug.xcconfig","buck-out/gen/submodules/DeviceLocationManager/DeviceLocationManager-Profile.xcconfig","buck-out/gen/submodules/DeviceLocationManager/DeviceLocationManager-Release.xcconfig","buck-out/gen/submodules/DeviceProximity/DeviceProximity-Debug.xcconfig","buck-out/gen/submodules/DeviceProximity/DeviceProximity-Profile.xcconfig","buck-out/gen/submodules/DeviceProximity/DeviceProximity-Release.xcconfig","buck-out/gen/submodules/DirectionalPanGesture/DirectionalPanGesture-Debug.xcconfig","buck-out/gen/submodules/DirectionalPanGesture/DirectionalPanGesture-Profile.xcconfig","buck-out/gen/submodules/DirectionalPanGesture/DirectionalPanGesture-Release.xcconfig","buck-out/gen/submodules/Display/Display#shared-Debug.xcconfig","buck-out/gen/submodules/Display/Display#shared-Profile.xcconfig","buck-out/gen/submodules/Display/Display#shared-Release.xcconfig","buck-out/gen/submodules/Emoji/Emoji-Debug.xcconfig","buck-out/gen/submodules/Emoji/Emoji-Profile.xcconfig","buck-out/gen/submodules/Emoji/Emoji-Release.xcconfig","buck-out/gen/submodules/EncryptionKeyVisualization/EncryptionKeyVisualization-Debug.xcconfig","buck-out/gen/submodules/EncryptionKeyVisualization/EncryptionKeyVisualization-Profile.xcconfig","buck-out/gen/submodules/EncryptionKeyVisualization/EncryptionKeyVisualization-Release.xcconfig","buck-out/gen/submodules/FFMpeg/FFMpeg-Debug.xcconfig","buck-out/gen/submodules/FFMpeg/FFMpeg-Profile.xcconfig","buck-out/gen/submodules/FFMpeg/FFMpeg-Release.xcconfig","buck-out/gen/submodules/FFMpeg/libffmpeg-Debug.xcconfig","buck-out/gen/submodules/FFMpeg/libffmpeg-Profile.xcconfig","buck-out/gen/submodules/FFMpeg/libffmpeg-Release.xcconfig","buck-out/gen/submodules/GZip/GZip-Debug.xcconfig","buck-out/gen/submodules/GZip/GZip-Profile.xcconfig","buck-out/gen/submodules/GZip/GZip-Release.xcconfig","buck-out/gen/submodules/GalleryUI/GalleryUI-Debug.xcconfig","buck-out/gen/submodules/GalleryUI/GalleryUI-Profile.xcconfig","buck-out/gen/submodules/GalleryUI/GalleryUI-Release.xcconfig","buck-out/gen/submodules/GameUI/GameUI-Debug.xcconfig","buck-out/gen/submodules/GameUI/GameUI-Profile.xcconfig","buck-out/gen/submodules/GameUI/GameUI-Release.xcconfig","buck-out/gen/submodules/Geocoding/Geocoding-Debug.xcconfig","buck-out/gen/submodules/Geocoding/Geocoding-Profile.xcconfig","buck-out/gen/submodules/Geocoding/Geocoding-Release.xcconfig","buck-out/gen/submodules/GridMessageSelectionNode/GridMessageSelectionNode-Debug.xcconfig","buck-out/gen/submodules/GridMessageSelectionNode/GridMessageSelectionNode-Profile.xcconfig","buck-out/gen/submodules/GridMessageSelectionNode/GridMessageSelectionNode-Release.xcconfig","buck-out/gen/submodules/HashtagSearchUI/HashtagSearchUI-Debug.xcconfig","buck-out/gen/submodules/HashtagSearchUI/HashtagSearchUI-Profile.xcconfig","buck-out/gen/submodules/HashtagSearchUI/HashtagSearchUI-Release.xcconfig","buck-out/gen/submodules/HexColor/HexColor-Debug.xcconfig","buck-out/gen/submodules/HexColor/HexColor-Profile.xcconfig","buck-out/gen/submodules/HexColor/HexColor-Release.xcconfig","buck-out/gen/submodules/HockeySDK-iOS/HockeySDK-Debug.xcconfig","buck-out/gen/submodules/HockeySDK-iOS/HockeySDK-Profile.xcconfig","buck-out/gen/submodules/HockeySDK-iOS/HockeySDK-Release.xcconfig","buck-out/gen/submodules/HorizontalPeerItem/HorizontalPeerItem-Debug.xcconfig","buck-out/gen/submodules/HorizontalPeerItem/HorizontalPeerItem-Profile.xcconfig","buck-out/gen/submodules/HorizontalPeerItem/HorizontalPeerItem-Release.xcconfig","buck-out/gen/submodules/ImageBlur/ImageBlur-Debug.xcconfig","buck-out/gen/submodules/ImageBlur/ImageBlur-Profile.xcconfig","buck-out/gen/submodules/ImageBlur/ImageBlur-Release.xcconfig","buck-out/gen/submodules/ImageCompression/ImageCompression-Debug.xcconfig","buck-out/gen/submodules/ImageCompression/ImageCompression-Profile.xcconfig","buck-out/gen/submodules/ImageCompression/ImageCompression-Release.xcconfig","buck-out/gen/submodules/ImageTransparency/ImageTransparency-Debug.xcconfig","buck-out/gen/submodules/ImageTransparency/ImageTransparency-Profile.xcconfig","buck-out/gen/submodules/ImageTransparency/ImageTransparency-Release.xcconfig","buck-out/gen/submodules/InstantPageCache/InstantPageCache-Debug.xcconfig","buck-out/gen/submodules/InstantPageCache/InstantPageCache-Profile.xcconfig","buck-out/gen/submodules/InstantPageCache/InstantPageCache-Release.xcconfig","buck-out/gen/submodules/InstantPageUI/InstantPageUI-Debug.xcconfig","buck-out/gen/submodules/InstantPageUI/InstantPageUI-Profile.xcconfig","buck-out/gen/submodules/InstantPageUI/InstantPageUI-Release.xcconfig","buck-out/gen/submodules/ItemListAddressItem/ItemListAddressItem-Debug.xcconfig","buck-out/gen/submodules/ItemListAddressItem/ItemListAddressItem-Profile.xcconfig","buck-out/gen/submodules/ItemListAddressItem/ItemListAddressItem-Release.xcconfig","buck-out/gen/submodules/ItemListAvatarAndNameInfoItem/ItemListAvatarAndNameInfoItem-Debug.xcconfig","buck-out/gen/submodules/ItemListAvatarAndNameInfoItem/ItemListAvatarAndNameInfoItem-Profile.xcconfig","buck-out/gen/submodules/ItemListAvatarAndNameInfoItem/ItemListAvatarAndNameInfoItem-Release.xcconfig","buck-out/gen/submodules/ItemListPeerActionItem/ItemListPeerActionItem-Debug.xcconfig","buck-out/gen/submodules/ItemListPeerActionItem/ItemListPeerActionItem-Profile.xcconfig","buck-out/gen/submodules/ItemListPeerActionItem/ItemListPeerActionItem-Release.xcconfig","buck-out/gen/submodules/ItemListPeerItem/ItemListPeerItem-Debug.xcconfig","buck-out/gen/submodules/ItemListPeerItem/ItemListPeerItem-Profile.xcconfig","buck-out/gen/submodules/ItemListPeerItem/ItemListPeerItem-Release.xcconfig","buck-out/gen/submodules/ItemListStickerPackItem/ItemListStickerPackItem-Debug.xcconfig","buck-out/gen/submodules/ItemListStickerPackItem/ItemListStickerPackItem-Profile.xcconfig","buck-out/gen/submodules/ItemListStickerPackItem/ItemListStickerPackItem-Release.xcconfig","buck-out/gen/submodules/ItemListUI/ItemListUI-Debug.xcconfig","buck-out/gen/submodules/ItemListUI/ItemListUI-Profile.xcconfig","buck-out/gen/submodules/ItemListUI/ItemListUI-Release.xcconfig","buck-out/gen/submodules/JoinLinkPreviewUI/JoinLinkPreviewUI-Debug.xcconfig","buck-out/gen/submodules/JoinLinkPreviewUI/JoinLinkPreviewUI-Profile.xcconfig","buck-out/gen/submodules/JoinLinkPreviewUI/JoinLinkPreviewUI-Release.xcconfig","buck-out/gen/submodules/LanguageLinkPreviewUI/LanguageLinkPreviewUI-Debug.xcconfig","buck-out/gen/submodules/LanguageLinkPreviewUI/LanguageLinkPreviewUI-Profile.xcconfig","buck-out/gen/submodules/LanguageLinkPreviewUI/LanguageLinkPreviewUI-Release.xcconfig","buck-out/gen/submodules/LanguageSuggestionUI/LanguageSuggestionUI-Debug.xcconfig","buck-out/gen/submodules/LanguageSuggestionUI/LanguageSuggestionUI-Profile.xcconfig","buck-out/gen/submodules/LanguageSuggestionUI/LanguageSuggestionUI-Release.xcconfig","buck-out/gen/submodules/LegacyComponents/LegacyComponents-Debug.xcconfig","buck-out/gen/submodules/LegacyComponents/LegacyComponents-Profile.xcconfig","buck-out/gen/submodules/LegacyComponents/LegacyComponents-Release.xcconfig","buck-out/gen/submodules/LegacyDataImport/LegacyDataImport-Debug.xcconfig","buck-out/gen/submodules/LegacyDataImport/LegacyDataImport-Profile.xcconfig","buck-out/gen/submodules/LegacyDataImport/LegacyDataImport-Release.xcconfig","buck-out/gen/submodules/LegacyMediaPickerUI/LegacyMediaPickerUI-Debug.xcconfig","buck-out/gen/submodules/LegacyMediaPickerUI/LegacyMediaPickerUI-Profile.xcconfig","buck-out/gen/submodules/LegacyMediaPickerUI/LegacyMediaPickerUI-Release.xcconfig","buck-out/gen/submodules/LegacyUI/LegacyUI-Debug.xcconfig","buck-out/gen/submodules/LegacyUI/LegacyUI-Profile.xcconfig","buck-out/gen/submodules/LegacyUI/LegacyUI-Release.xcconfig","buck-out/gen/submodules/LightweightAccountData/LightweightAccountData-Debug.xcconfig","buck-out/gen/submodules/LightweightAccountData/LightweightAccountData-Profile.xcconfig","buck-out/gen/submodules/LightweightAccountData/LightweightAccountData-Release.xcconfig","buck-out/gen/submodules/ListSectionHeaderNode/ListSectionHeaderNode-Debug.xcconfig","buck-out/gen/submodules/ListSectionHeaderNode/ListSectionHeaderNode-Profile.xcconfig","buck-out/gen/submodules/ListSectionHeaderNode/ListSectionHeaderNode-Release.xcconfig","buck-out/gen/submodules/LiveLocationManager/LiveLocationManager-Debug.xcconfig","buck-out/gen/submodules/LiveLocationManager/LiveLocationManager-Profile.xcconfig","buck-out/gen/submodules/LiveLocationManager/LiveLocationManager-Release.xcconfig","buck-out/gen/submodules/LiveLocationPositionNode/LiveLocationPositionNode-Debug.xcconfig","buck-out/gen/submodules/LiveLocationPositionNode/LiveLocationPositionNode-Profile.xcconfig","buck-out/gen/submodules/LiveLocationPositionNode/LiveLocationPositionNode-Release.xcconfig","buck-out/gen/submodules/LiveLocationTimerNode/LiveLocationTimerNode-Debug.xcconfig","buck-out/gen/submodules/LiveLocationTimerNode/LiveLocationTimerNode-Profile.xcconfig","buck-out/gen/submodules/LiveLocationTimerNode/LiveLocationTimerNode-Release.xcconfig","buck-out/gen/submodules/LocalAuth/LocalAuth-Debug.xcconfig","buck-out/gen/submodules/LocalAuth/LocalAuth-Profile.xcconfig","buck-out/gen/submodules/LocalAuth/LocalAuth-Release.xcconfig","buck-out/gen/submodules/LocalMediaResources/LocalMediaResources-Debug.xcconfig","buck-out/gen/submodules/LocalMediaResources/LocalMediaResources-Profile.xcconfig","buck-out/gen/submodules/LocalMediaResources/LocalMediaResources-Release.xcconfig","buck-out/gen/submodules/LocalizedPeerData/LocalizedPeerData-Debug.xcconfig","buck-out/gen/submodules/LocalizedPeerData/LocalizedPeerData-Profile.xcconfig","buck-out/gen/submodules/LocalizedPeerData/LocalizedPeerData-Release.xcconfig","buck-out/gen/submodules/LocationUI/LocationUI-Debug.xcconfig","buck-out/gen/submodules/LocationUI/LocationUI-Profile.xcconfig","buck-out/gen/submodules/LocationUI/LocationUI-Release.xcconfig","buck-out/gen/submodules/MapResourceToAvatarSizes/MapResourceToAvatarSizes-Debug.xcconfig","buck-out/gen/submodules/MapResourceToAvatarSizes/MapResourceToAvatarSizes-Profile.xcconfig","buck-out/gen/submodules/MapResourceToAvatarSizes/MapResourceToAvatarSizes-Release.xcconfig","buck-out/gen/submodules/MediaPlayer/UniversalMediaPlayer-Debug.xcconfig","buck-out/gen/submodules/MediaPlayer/UniversalMediaPlayer-Profile.xcconfig","buck-out/gen/submodules/MediaPlayer/UniversalMediaPlayer-Release.xcconfig","buck-out/gen/submodules/MediaResources/MediaResources-Debug.xcconfig","buck-out/gen/submodules/MediaResources/MediaResources-Profile.xcconfig","buck-out/gen/submodules/MediaResources/MediaResources-Release.xcconfig","buck-out/gen/submodules/MergeLists/MergeLists-Debug.xcconfig","buck-out/gen/submodules/MergeLists/MergeLists-Profile.xcconfig","buck-out/gen/submodules/MergeLists/MergeLists-Release.xcconfig","buck-out/gen/submodules/MessageReactionListUI/MessageReactionListUI-Debug.xcconfig","buck-out/gen/submodules/MessageReactionListUI/MessageReactionListUI-Profile.xcconfig","buck-out/gen/submodules/MessageReactionListUI/MessageReactionListUI-Release.xcconfig","buck-out/gen/submodules/MimeTypes/MimeTypes-Debug.xcconfig","buck-out/gen/submodules/MimeTypes/MimeTypes-Profile.xcconfig","buck-out/gen/submodules/MimeTypes/MimeTypes-Release.xcconfig","buck-out/gen/submodules/MosaicLayout/MosaicLayout-Debug.xcconfig","buck-out/gen/submodules/MosaicLayout/MosaicLayout-Profile.xcconfig","buck-out/gen/submodules/MosaicLayout/MosaicLayout-Release.xcconfig","buck-out/gen/submodules/MtProtoKit/MtProtoKit#shared-Debug.xcconfig","buck-out/gen/submodules/MtProtoKit/MtProtoKit#shared-Profile.xcconfig","buck-out/gen/submodules/MtProtoKit/MtProtoKit#shared-Release.xcconfig","buck-out/gen/submodules/MusicAlbumArtResources/MusicAlbumArtResources-Debug.xcconfig","buck-out/gen/submodules/MusicAlbumArtResources/MusicAlbumArtResources-Profile.xcconfig","buck-out/gen/submodules/MusicAlbumArtResources/MusicAlbumArtResources-Release.xcconfig","buck-out/gen/submodules/NotificationMuteSettingsUI/NotificationMuteSettingsUI-Debug.xcconfig","buck-out/gen/submodules/NotificationMuteSettingsUI/NotificationMuteSettingsUI-Profile.xcconfig","buck-out/gen/submodules/NotificationMuteSettingsUI/NotificationMuteSettingsUI-Release.xcconfig","buck-out/gen/submodules/NotificationSoundSelectionUI/NotificationSoundSelectionUI-Debug.xcconfig","buck-out/gen/submodules/NotificationSoundSelectionUI/NotificationSoundSelectionUI-Profile.xcconfig","buck-out/gen/submodules/NotificationSoundSelectionUI/NotificationSoundSelectionUI-Release.xcconfig","buck-out/gen/submodules/OpenInExternalAppUI/OpenInExternalAppUI-Debug.xcconfig","buck-out/gen/submodules/OpenInExternalAppUI/OpenInExternalAppUI-Profile.xcconfig","buck-out/gen/submodules/OpenInExternalAppUI/OpenInExternalAppUI-Release.xcconfig","buck-out/gen/submodules/Opus/opus-Debug.xcconfig","buck-out/gen/submodules/Opus/opus-Profile.xcconfig","buck-out/gen/submodules/Opus/opus-Release.xcconfig","buck-out/gen/submodules/Opus/opus_lib-Debug.xcconfig","buck-out/gen/submodules/Opus/opus_lib-Profile.xcconfig","buck-out/gen/submodules/Opus/opus_lib-Release.xcconfig","buck-out/gen/submodules/OpusBinding/OpusBinding-Debug.xcconfig","buck-out/gen/submodules/OpusBinding/OpusBinding-Profile.xcconfig","buck-out/gen/submodules/OpusBinding/OpusBinding-Release.xcconfig","buck-out/gen/submodules/OverlayStatusController/OverlayStatusController-Debug.xcconfig","buck-out/gen/submodules/OverlayStatusController/OverlayStatusController-Profile.xcconfig","buck-out/gen/submodules/OverlayStatusController/OverlayStatusController-Release.xcconfig","buck-out/gen/submodules/PasscodeUI/PasscodeUI-Debug.xcconfig","buck-out/gen/submodules/PasscodeUI/PasscodeUI-Profile.xcconfig","buck-out/gen/submodules/PasscodeUI/PasscodeUI-Release.xcconfig","buck-out/gen/submodules/PassportUI/PassportUI-Debug.xcconfig","buck-out/gen/submodules/PassportUI/PassportUI-Profile.xcconfig","buck-out/gen/submodules/PassportUI/PassportUI-Release.xcconfig","buck-out/gen/submodules/PasswordSetupUI/PasswordSetupUI-Debug.xcconfig","buck-out/gen/submodules/PasswordSetupUI/PasswordSetupUI-Profile.xcconfig","buck-out/gen/submodules/PasswordSetupUI/PasswordSetupUI-Release.xcconfig","buck-out/gen/submodules/Pdf/Pdf-Debug.xcconfig","buck-out/gen/submodules/Pdf/Pdf-Profile.xcconfig","buck-out/gen/submodules/Pdf/Pdf-Release.xcconfig","buck-out/gen/submodules/PeerAvatarGalleryUI/PeerAvatarGalleryUI-Debug.xcconfig","buck-out/gen/submodules/PeerAvatarGalleryUI/PeerAvatarGalleryUI-Profile.xcconfig","buck-out/gen/submodules/PeerAvatarGalleryUI/PeerAvatarGalleryUI-Release.xcconfig","buck-out/gen/submodules/PeerInfoUI/PeerInfoUI-Debug.xcconfig","buck-out/gen/submodules/PeerInfoUI/PeerInfoUI-Profile.xcconfig","buck-out/gen/submodules/PeerInfoUI/PeerInfoUI-Release.xcconfig","buck-out/gen/submodules/PeerOnlineMarkerNode/PeerOnlineMarkerNode-Debug.xcconfig","buck-out/gen/submodules/PeerOnlineMarkerNode/PeerOnlineMarkerNode-Profile.xcconfig","buck-out/gen/submodules/PeerOnlineMarkerNode/PeerOnlineMarkerNode-Release.xcconfig","buck-out/gen/submodules/PeerPresenceStatusManager/PeerPresenceStatusManager-Debug.xcconfig","buck-out/gen/submodules/PeerPresenceStatusManager/PeerPresenceStatusManager-Profile.xcconfig","buck-out/gen/submodules/PeerPresenceStatusManager/PeerPresenceStatusManager-Release.xcconfig","buck-out/gen/submodules/PeersNearbyIconNode/PeersNearbyIconNode-Debug.xcconfig","buck-out/gen/submodules/PeersNearbyIconNode/PeersNearbyIconNode-Profile.xcconfig","buck-out/gen/submodules/PeersNearbyIconNode/PeersNearbyIconNode-Release.xcconfig","buck-out/gen/submodules/PeersNearbyUI/PeersNearbyUI-Debug.xcconfig","buck-out/gen/submodules/PeersNearbyUI/PeersNearbyUI-Profile.xcconfig","buck-out/gen/submodules/PeersNearbyUI/PeersNearbyUI-Release.xcconfig","buck-out/gen/submodules/PersistentStringHash/PersistentStringHash-Debug.xcconfig","buck-out/gen/submodules/PersistentStringHash/PersistentStringHash-Profile.xcconfig","buck-out/gen/submodules/PersistentStringHash/PersistentStringHash-Release.xcconfig","buck-out/gen/submodules/PhoneInputNode/PhoneInputNode-Debug.xcconfig","buck-out/gen/submodules/PhoneInputNode/PhoneInputNode-Profile.xcconfig","buck-out/gen/submodules/PhoneInputNode/PhoneInputNode-Release.xcconfig","buck-out/gen/submodules/PhotoResources/PhotoResources-Debug.xcconfig","buck-out/gen/submodules/PhotoResources/PhotoResources-Profile.xcconfig","buck-out/gen/submodules/PhotoResources/PhotoResources-Release.xcconfig","buck-out/gen/submodules/PlatformRestrictionMatching/PlatformRestrictionMatching-Debug.xcconfig","buck-out/gen/submodules/PlatformRestrictionMatching/PlatformRestrictionMatching-Profile.xcconfig","buck-out/gen/submodules/PlatformRestrictionMatching/PlatformRestrictionMatching-Release.xcconfig","buck-out/gen/submodules/Postbox/Postbox#shared-Debug.xcconfig","buck-out/gen/submodules/Postbox/Postbox#shared-Profile.xcconfig","buck-out/gen/submodules/Postbox/Postbox#shared-Release.xcconfig","buck-out/gen/submodules/ProgressNavigationButtonNode/ProgressNavigationButtonNode-Debug.xcconfig","buck-out/gen/submodules/ProgressNavigationButtonNode/ProgressNavigationButtonNode-Profile.xcconfig","buck-out/gen/submodules/ProgressNavigationButtonNode/ProgressNavigationButtonNode-Release.xcconfig","buck-out/gen/submodules/QrCode/QrCode-Debug.xcconfig","buck-out/gen/submodules/QrCode/QrCode-Profile.xcconfig","buck-out/gen/submodules/QrCode/QrCode-Release.xcconfig","buck-out/gen/submodules/RMIntro/RMIntro-Debug.xcconfig","buck-out/gen/submodules/RMIntro/RMIntro-Profile.xcconfig","buck-out/gen/submodules/RMIntro/RMIntro-Release.xcconfig","buck-out/gen/submodules/RadialStatusNode/RadialStatusNode-Debug.xcconfig","buck-out/gen/submodules/RadialStatusNode/RadialStatusNode-Profile.xcconfig","buck-out/gen/submodules/RadialStatusNode/RadialStatusNode-Release.xcconfig","buck-out/gen/submodules/RaiseToListen/RaiseToListen-Debug.xcconfig","buck-out/gen/submodules/RaiseToListen/RaiseToListen-Profile.xcconfig","buck-out/gen/submodules/RaiseToListen/RaiseToListen-Release.xcconfig","buck-out/gen/submodules/ReactionSelectionNode/ReactionSelectionNode-Debug.xcconfig","buck-out/gen/submodules/ReactionSelectionNode/ReactionSelectionNode-Profile.xcconfig","buck-out/gen/submodules/ReactionSelectionNode/ReactionSelectionNode-Release.xcconfig","buck-out/gen/submodules/SSignalKit/SSignalKit/SSignalKit-Debug.xcconfig","buck-out/gen/submodules/SSignalKit/SSignalKit/SSignalKit-Profile.xcconfig","buck-out/gen/submodules/SSignalKit/SSignalKit/SSignalKit-Release.xcconfig","buck-out/gen/submodules/SSignalKit/SwiftSignalKit/SwiftSignalKit#shared-Debug.xcconfig","buck-out/gen/submodules/SSignalKit/SwiftSignalKit/SwiftSignalKit#shared-Profile.xcconfig","buck-out/gen/submodules/SSignalKit/SwiftSignalKit/SwiftSignalKit#shared-Release.xcconfig","buck-out/gen/submodules/SaveToCameraRoll/SaveToCameraRoll-Debug.xcconfig","buck-out/gen/submodules/SaveToCameraRoll/SaveToCameraRoll-Profile.xcconfig","buck-out/gen/submodules/SaveToCameraRoll/SaveToCameraRoll-Release.xcconfig","buck-out/gen/submodules/ScreenCaptureDetection/ScreenCaptureDetection-Debug.xcconfig","buck-out/gen/submodules/ScreenCaptureDetection/ScreenCaptureDetection-Profile.xcconfig","buck-out/gen/submodules/ScreenCaptureDetection/ScreenCaptureDetection-Release.xcconfig","buck-out/gen/submodules/SearchBarNode/SearchBarNode-Debug.xcconfig","buck-out/gen/submodules/SearchBarNode/SearchBarNode-Profile.xcconfig","buck-out/gen/submodules/SearchBarNode/SearchBarNode-Release.xcconfig","buck-out/gen/submodules/SearchUI/SearchUI-Debug.xcconfig","buck-out/gen/submodules/SearchUI/SearchUI-Profile.xcconfig","buck-out/gen/submodules/SearchUI/SearchUI-Release.xcconfig","buck-out/gen/submodules/SegmentedControlNode/SegmentedControlNode-Debug.xcconfig","buck-out/gen/submodules/SegmentedControlNode/SegmentedControlNode-Profile.xcconfig","buck-out/gen/submodules/SegmentedControlNode/SegmentedControlNode-Release.xcconfig","buck-out/gen/submodules/SelectablePeerNode/SelectablePeerNode-Debug.xcconfig","buck-out/gen/submodules/SelectablePeerNode/SelectablePeerNode-Profile.xcconfig","buck-out/gen/submodules/SelectablePeerNode/SelectablePeerNode-Release.xcconfig","buck-out/gen/submodules/SettingsUI/SettingsUI-Debug.xcconfig","buck-out/gen/submodules/SettingsUI/SettingsUI-Profile.xcconfig","buck-out/gen/submodules/SettingsUI/SettingsUI-Release.xcconfig","buck-out/gen/submodules/ShareController/ShareController-Debug.xcconfig","buck-out/gen/submodules/ShareController/ShareController-Profile.xcconfig","buck-out/gen/submodules/ShareController/ShareController-Release.xcconfig","buck-out/gen/submodules/ShareItems/ShareItems-Debug.xcconfig","buck-out/gen/submodules/ShareItems/ShareItems-Profile.xcconfig","buck-out/gen/submodules/ShareItems/ShareItems-Release.xcconfig","buck-out/gen/submodules/SinglePhoneInputNode/SinglePhoneInputNode-Debug.xcconfig","buck-out/gen/submodules/SinglePhoneInputNode/SinglePhoneInputNode-Profile.xcconfig","buck-out/gen/submodules/SinglePhoneInputNode/SinglePhoneInputNode-Release.xcconfig","buck-out/gen/submodules/SolidRoundedButtonNode/SolidRoundedButtonNode-Debug.xcconfig","buck-out/gen/submodules/SolidRoundedButtonNode/SolidRoundedButtonNode-Profile.xcconfig","buck-out/gen/submodules/SolidRoundedButtonNode/SolidRoundedButtonNode-Release.xcconfig","buck-out/gen/submodules/StickerPackPreviewUI/StickerPackPreviewUI-Debug.xcconfig","buck-out/gen/submodules/StickerPackPreviewUI/StickerPackPreviewUI-Profile.xcconfig","buck-out/gen/submodules/StickerPackPreviewUI/StickerPackPreviewUI-Release.xcconfig","buck-out/gen/submodules/StickerResources/StickerResources-Debug.xcconfig","buck-out/gen/submodules/StickerResources/StickerResources-Profile.xcconfig","buck-out/gen/submodules/StickerResources/StickerResources-Release.xcconfig","buck-out/gen/submodules/Stripe/Stripe-Debug.xcconfig","buck-out/gen/submodules/Stripe/Stripe-Profile.xcconfig","buck-out/gen/submodules/Stripe/Stripe-Release.xcconfig","buck-out/gen/submodules/SwipeToDismissGesture/SwipeToDismissGesture-Debug.xcconfig","buck-out/gen/submodules/SwipeToDismissGesture/SwipeToDismissGesture-Profile.xcconfig","buck-out/gen/submodules/SwipeToDismissGesture/SwipeToDismissGesture-Release.xcconfig","buck-out/gen/submodules/SwitchNode/SwitchNode-Debug.xcconfig","buck-out/gen/submodules/SwitchNode/SwitchNode-Profile.xcconfig","buck-out/gen/submodules/SwitchNode/SwitchNode-Release.xcconfig","buck-out/gen/submodules/TelegramApi/TelegramApi-Debug.xcconfig","buck-out/gen/submodules/TelegramApi/TelegramApi-Profile.xcconfig","buck-out/gen/submodules/TelegramApi/TelegramApi-Release.xcconfig","buck-out/gen/submodules/TelegramAudio/TelegramAudio-Debug.xcconfig","buck-out/gen/submodules/TelegramAudio/TelegramAudio-Profile.xcconfig","buck-out/gen/submodules/TelegramAudio/TelegramAudio-Release.xcconfig","buck-out/gen/submodules/TelegramBaseController/TelegramBaseController-Debug.xcconfig","buck-out/gen/submodules/TelegramBaseController/TelegramBaseController-Profile.xcconfig","buck-out/gen/submodules/TelegramBaseController/TelegramBaseController-Release.xcconfig","buck-out/gen/submodules/TelegramCallsUI/TelegramCallsUI-Debug.xcconfig","buck-out/gen/submodules/TelegramCallsUI/TelegramCallsUI-Profile.xcconfig","buck-out/gen/submodules/TelegramCallsUI/TelegramCallsUI-Release.xcconfig","buck-out/gen/submodules/TelegramCore/TelegramCore#shared-Debug.xcconfig","buck-out/gen/submodules/TelegramCore/TelegramCore#shared-Profile.xcconfig","buck-out/gen/submodules/TelegramCore/TelegramCore#shared-Release.xcconfig","buck-out/gen/submodules/TelegramNotices/TelegramNotices-Debug.xcconfig","buck-out/gen/submodules/TelegramNotices/TelegramNotices-Profile.xcconfig","buck-out/gen/submodules/TelegramNotices/TelegramNotices-Release.xcconfig","buck-out/gen/submodules/TelegramPermissions/TelegramPermissions-Debug.xcconfig","buck-out/gen/submodules/TelegramPermissions/TelegramPermissions-Profile.xcconfig","buck-out/gen/submodules/TelegramPermissions/TelegramPermissions-Release.xcconfig","buck-out/gen/submodules/TelegramPermissionsUI/TelegramPermissionsUI-Debug.xcconfig","buck-out/gen/submodules/TelegramPermissionsUI/TelegramPermissionsUI-Profile.xcconfig","buck-out/gen/submodules/TelegramPermissionsUI/TelegramPermissionsUI-Release.xcconfig","buck-out/gen/submodules/TelegramPresentationData/TelegramPresentationData-Debug.xcconfig","buck-out/gen/submodules/TelegramPresentationData/TelegramPresentationData-Profile.xcconfig","buck-out/gen/submodules/TelegramPresentationData/TelegramPresentationData-Release.xcconfig","buck-out/gen/submodules/TelegramStringFormatting/TelegramStringFormatting-Debug.xcconfig","buck-out/gen/submodules/TelegramStringFormatting/TelegramStringFormatting-Profile.xcconfig","buck-out/gen/submodules/TelegramStringFormatting/TelegramStringFormatting-Release.xcconfig","buck-out/gen/submodules/TelegramUI/TelegramUI#shared-Debug.xcconfig","buck-out/gen/submodules/TelegramUI/TelegramUI#shared-Profile.xcconfig","buck-out/gen/submodules/TelegramUI/TelegramUI#shared-Release.xcconfig","buck-out/gen/submodules/TelegramUIPreferences/TelegramUIPreferences-Debug.xcconfig","buck-out/gen/submodules/TelegramUIPreferences/TelegramUIPreferences-Profile.xcconfig","buck-out/gen/submodules/TelegramUIPreferences/TelegramUIPreferences-Release.xcconfig","buck-out/gen/submodules/TelegramUniversalVideoContent/TelegramUniversalVideoContent-Debug.xcconfig","buck-out/gen/submodules/TelegramUniversalVideoContent/TelegramUniversalVideoContent-Profile.xcconfig","buck-out/gen/submodules/TelegramUniversalVideoContent/TelegramUniversalVideoContent-Release.xcconfig","buck-out/gen/submodules/TelegramUpdateUI/TelegramUpdateUI-Debug.xcconfig","buck-out/gen/submodules/TelegramUpdateUI/TelegramUpdateUI-Profile.xcconfig","buck-out/gen/submodules/TelegramUpdateUI/TelegramUpdateUI-Release.xcconfig","buck-out/gen/submodules/TelegramVoip/TelegramVoip-Debug.xcconfig","buck-out/gen/submodules/TelegramVoip/TelegramVoip-Profile.xcconfig","buck-out/gen/submodules/TelegramVoip/TelegramVoip-Release.xcconfig","buck-out/gen/submodules/TemporaryCachedPeerDataManager/TemporaryCachedPeerDataManager-Debug.xcconfig","buck-out/gen/submodules/TemporaryCachedPeerDataManager/TemporaryCachedPeerDataManager-Profile.xcconfig","buck-out/gen/submodules/TemporaryCachedPeerDataManager/TemporaryCachedPeerDataManager-Release.xcconfig","buck-out/gen/submodules/TextFormat/TextFormat-Debug.xcconfig","buck-out/gen/submodules/TextFormat/TextFormat-Profile.xcconfig","buck-out/gen/submodules/TextFormat/TextFormat-Release.xcconfig","buck-out/gen/submodules/TextSelectionNode/TextSelectionNode-Debug.xcconfig","buck-out/gen/submodules/TextSelectionNode/TextSelectionNode-Profile.xcconfig","buck-out/gen/submodules/TextSelectionNode/TextSelectionNode-Release.xcconfig","buck-out/gen/submodules/TinyThumbnail/TinyThumbnail-Debug.xcconfig","buck-out/gen/submodules/TinyThumbnail/TinyThumbnail-Profile.xcconfig","buck-out/gen/submodules/TinyThumbnail/TinyThumbnail-Release.xcconfig","buck-out/gen/submodules/TouchDownGesture/TouchDownGesture-Debug.xcconfig","buck-out/gen/submodules/TouchDownGesture/TouchDownGesture-Profile.xcconfig","buck-out/gen/submodules/TouchDownGesture/TouchDownGesture-Release.xcconfig","buck-out/gen/submodules/Tuples/Tuples-Debug.xcconfig","buck-out/gen/submodules/Tuples/Tuples-Profile.xcconfig","buck-out/gen/submodules/Tuples/Tuples-Release.xcconfig","buck-out/gen/submodules/UndoUI/UndoUI-Debug.xcconfig","buck-out/gen/submodules/UndoUI/UndoUI-Profile.xcconfig","buck-out/gen/submodules/UndoUI/UndoUI-Release.xcconfig","buck-out/gen/submodules/UrlEscaping/UrlEscaping-Debug.xcconfig","buck-out/gen/submodules/UrlEscaping/UrlEscaping-Profile.xcconfig","buck-out/gen/submodules/UrlEscaping/UrlEscaping-Release.xcconfig","buck-out/gen/submodules/UrlHandling/UrlHandling-Debug.xcconfig","buck-out/gen/submodules/UrlHandling/UrlHandling-Profile.xcconfig","buck-out/gen/submodules/UrlHandling/UrlHandling-Release.xcconfig","buck-out/gen/submodules/WalletUI/WalletUI-Debug.xcconfig","buck-out/gen/submodules/WalletUI/WalletUI-Profile.xcconfig","buck-out/gen/submodules/WalletUI/WalletUI-Release.xcconfig","buck-out/gen/submodules/WallpaperResources/WallpaperResources-Debug.xcconfig","buck-out/gen/submodules/WallpaperResources/WallpaperResources-Profile.xcconfig","buck-out/gen/submodules/WallpaperResources/WallpaperResources-Release.xcconfig","buck-out/gen/submodules/WatchBridge/WatchBridge-Debug.xcconfig","buck-out/gen/submodules/WatchBridge/WatchBridge-Profile.xcconfig","buck-out/gen/submodules/WatchBridge/WatchBridge-Release.xcconfig","buck-out/gen/submodules/WatchBridgeAudio/WatchBridgeAudio-Debug.xcconfig","buck-out/gen/submodules/WatchBridgeAudio/WatchBridgeAudio-Profile.xcconfig","buck-out/gen/submodules/WatchBridgeAudio/WatchBridgeAudio-Release.xcconfig","buck-out/gen/submodules/WatchCommon/Host/WatchCommon-Debug.xcconfig","buck-out/gen/submodules/WatchCommon/Host/WatchCommon-Profile.xcconfig","buck-out/gen/submodules/WatchCommon/Host/WatchCommon-Release.xcconfig","buck-out/gen/submodules/WebP/WebPImage-Debug.xcconfig","buck-out/gen/submodules/WebP/WebPImage-Profile.xcconfig","buck-out/gen/submodules/WebP/WebPImage-Release.xcconfig","buck-out/gen/submodules/WebP/WebP_lib-Debug.xcconfig","buck-out/gen/submodules/WebP/WebP_lib-Profile.xcconfig","buck-out/gen/submodules/WebP/WebP_lib-Release.xcconfig","buck-out/gen/submodules/WebSearchUI/WebSearchUI-Debug.xcconfig","buck-out/gen/submodules/WebSearchUI/WebSearchUI-Profile.xcconfig","buck-out/gen/submodules/WebSearchUI/WebSearchUI-Release.xcconfig","buck-out/gen/submodules/WebUI/WebUI-Debug.xcconfig","buck-out/gen/submodules/WebUI/WebUI-Profile.xcconfig","buck-out/gen/submodules/WebUI/WebUI-Release.xcconfig","buck-out/gen/submodules/WebsiteType/WebsiteType-Debug.xcconfig","buck-out/gen/submodules/WebsiteType/WebsiteType-Profile.xcconfig","buck-out/gen/submodules/WebsiteType/WebsiteType-Release.xcconfig","buck-out/gen/submodules/YuvConversion/YuvConversion-Debug.xcconfig","buck-out/gen/submodules/YuvConversion/YuvConversion-Profile.xcconfig","buck-out/gen/submodules/YuvConversion/YuvConversion-Release.xcconfig","buck-out/gen/submodules/libphonenumber/libphonenumber-Debug.xcconfig","buck-out/gen/submodules/libphonenumber/libphonenumber-Profile.xcconfig","buck-out/gen/submodules/libphonenumber/libphonenumber-Release.xcconfig","buck-out/gen/submodules/libtgvoip/libtgvoip-Debug.xcconfig","buck-out/gen/submodules/libtgvoip/libtgvoip-Profile.xcconfig","buck-out/gen/submodules/libtgvoip/libtgvoip-Release.xcconfig","buck-out/gen/submodules/lottie-ios/Lottie-Debug.xcconfig","buck-out/gen/submodules/lottie-ios/Lottie-Profile.xcconfig","buck-out/gen/submodules/lottie-ios/Lottie-Release.xcconfig","buck-out/gen/submodules/openssl/openssl-Debug.xcconfig","buck-out/gen/submodules/openssl/openssl-Profile.xcconfig","buck-out/gen/submodules/openssl/openssl-Release.xcconfig","buck-out/gen/submodules/rlottie/RLottieBinding-Debug.xcconfig","buck-out/gen/submodules/rlottie/RLottieBinding-Profile.xcconfig","buck-out/gen/submodules/rlottie/RLottieBinding-Release.xcconfig","buck-out/gen/submodules/sqlcipher/sqlcipher-Debug.xcconfig","buck-out/gen/submodules/sqlcipher/sqlcipher-Profile.xcconfig","buck-out/gen/submodules/sqlcipher/sqlcipher-Release.xcconfig","buck-out/gen/submodules/ton/ton-Debug.xcconfig","buck-out/gen/submodules/ton/ton-Profile.xcconfig","buck-out/gen/submodules/ton/ton-Release.xcconfig"],"copy-in-xcode":[]}
\ No newline at end of file
diff --git a/Telegram_Buck.xcworkspace/contents.xcworkspacedata b/Telegram_Buck.xcworkspace/contents.xcworkspacedata
index 3e61562224..b5bb934e6d 100644
--- a/Telegram_Buck.xcworkspace/contents.xcworkspacedata
+++ b/Telegram_Buck.xcworkspace/contents.xcworkspacedata
@@ -1 +1 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?><Workspace version="1.0"><FileRef location="container:Project.xcodeproj"/><Group location="container:" name="submodules"><Group location="container:" name="SSignalKit"><FileRef location="container:submodules/SSignalKit/SSignalKit/SSignalKit.xcodeproj"/><FileRef location="container:submodules/SSignalKit/SwiftSignalKit/SwiftSignalKit.xcodeproj"/></Group><Group location="container:" name="WatchCommon"><FileRef location="container:submodules/WatchCommon/Host/Host.xcodeproj"/></Group><FileRef location="container:submodules/AccountContext/AccountContext.xcodeproj"/><FileRef location="container:submodules/ActionSheetPeerItem/ActionSheetPeerItem.xcodeproj"/><FileRef location="container:submodules/ActivityIndicator/ActivityIndicator.xcodeproj"/><FileRef location="container:submodules/AlertUI/AlertUI.xcodeproj"/><FileRef location="container:submodules/AnimationUI/AnimationUI.xcodeproj"/><FileRef location="container:submodules/AppBundle/AppBundle.xcodeproj"/><FileRef location="container:submodules/AsyncDisplayKit/AsyncDisplayKit.xcodeproj"/><FileRef location="container:submodules/AuthorizationUI/AuthorizationUI.xcodeproj"/><FileRef location="container:submodules/AvatarNode/AvatarNode.xcodeproj"/><FileRef location="container:submodules/BotPaymentsUI/BotPaymentsUI.xcodeproj"/><FileRef location="container:submodules/BuildConfig/BuildConfig.xcodeproj"/><FileRef location="container:submodules/CallListUI/CallListUI.xcodeproj"/><FileRef location="container:submodules/ChatListSearchItemHeader/ChatListSearchItemHeader.xcodeproj"/><FileRef location="container:submodules/ChatListSearchItemNode/ChatListSearchItemNode.xcodeproj"/><FileRef location="container:submodules/ChatListSearchRecentPeersNode/ChatListSearchRecentPeersNode.xcodeproj"/><FileRef location="container:submodules/ChatListUI/ChatListUI.xcodeproj"/><FileRef location="container:submodules/ChatTitleActivityNode/ChatTitleActivityNode.xcodeproj"/><FileRef location="container:submodules/CheckNode/CheckNode.xcodeproj"/><FileRef location="container:submodules/ComposePollUI/ComposePollUI.xcodeproj"/><FileRef location="container:submodules/ContactListUI/ContactListUI.xcodeproj"/><FileRef location="container:submodules/ContactsPeerItem/ContactsPeerItem.xcodeproj"/><FileRef location="container:submodules/ContextUI/ContextUI.xcodeproj"/><FileRef location="container:submodules/CounterContollerTitleView/CounterContollerTitleView.xcodeproj"/><FileRef location="container:submodules/CountrySelectionUI/CountrySelectionUI.xcodeproj"/><FileRef location="container:submodules/Crc32/Crc32.xcodeproj"/><FileRef location="container:submodules/DateSelectionUI/DateSelectionUI.xcodeproj"/><FileRef location="container:submodules/DeleteChatPeerActionSheetItem/DeleteChatPeerActionSheetItem.xcodeproj"/><FileRef location="container:submodules/DeviceAccess/DeviceAccess.xcodeproj"/><FileRef location="container:submodules/DeviceLocationManager/DeviceLocationManager.xcodeproj"/><FileRef location="container:submodules/DeviceProximity/DeviceProximity.xcodeproj"/><FileRef location="container:submodules/DirectionalPanGesture/DirectionalPanGesture.xcodeproj"/><FileRef location="container:submodules/Display/Display.xcodeproj"/><FileRef location="container:submodules/Emoji/Emoji.xcodeproj"/><FileRef location="container:submodules/EncryptionKeyVisualization/EncryptionKeyVisualization.xcodeproj"/><FileRef location="container:submodules/FFMpeg/FFMpeg.xcodeproj"/><FileRef location="container:submodules/GZip/GZip.xcodeproj"/><FileRef location="container:submodules/GalleryUI/GalleryUI.xcodeproj"/><FileRef location="container:submodules/GameUI/GameUI.xcodeproj"/><FileRef location="container:submodules/Geocoding/Geocoding.xcodeproj"/><FileRef location="container:submodules/GridMessageSelectionNode/GridMessageSelectionNode.xcodeproj"/><FileRef location="container:submodules/HashtagSearchUI/HashtagSearchUI.xcodeproj"/><FileRef location="container:submodules/HexColor/HexColor.xcodeproj"/><FileRef location="container:submodules/HockeySDK-iOS/HockeySDK-iOS.xcodeproj"/><FileRef location="container:submodules/HorizontalPeerItem/HorizontalPeerItem.xcodeproj"/><FileRef location="container:submodules/ImageBlur/ImageBlur.xcodeproj"/><FileRef location="container:submodules/ImageCompression/ImageCompression.xcodeproj"/><FileRef location="container:submodules/ImageTransparency/ImageTransparency.xcodeproj"/><FileRef location="container:submodules/InstantPageCache/InstantPageCache.xcodeproj"/><FileRef location="container:submodules/InstantPageUI/InstantPageUI.xcodeproj"/><FileRef location="container:submodules/ItemListAddressItem/ItemListAddressItem.xcodeproj"/><FileRef location="container:submodules/ItemListAvatarAndNameInfoItem/ItemListAvatarAndNameInfoItem.xcodeproj"/><FileRef location="container:submodules/ItemListPeerActionItem/ItemListPeerActionItem.xcodeproj"/><FileRef location="container:submodules/ItemListPeerItem/ItemListPeerItem.xcodeproj"/><FileRef location="container:submodules/ItemListStickerPackItem/ItemListStickerPackItem.xcodeproj"/><FileRef location="container:submodules/ItemListUI/ItemListUI.xcodeproj"/><FileRef location="container:submodules/JoinLinkPreviewUI/JoinLinkPreviewUI.xcodeproj"/><FileRef location="container:submodules/LanguageLinkPreviewUI/LanguageLinkPreviewUI.xcodeproj"/><FileRef location="container:submodules/LanguageSuggestionUI/LanguageSuggestionUI.xcodeproj"/><FileRef location="container:submodules/LegacyComponents/LegacyComponents.xcodeproj"/><FileRef location="container:submodules/LegacyDataImport/LegacyDataImport.xcodeproj"/><FileRef location="container:submodules/LegacyMediaPickerUI/LegacyMediaPickerUI.xcodeproj"/><FileRef location="container:submodules/LegacyUI/LegacyUI.xcodeproj"/><FileRef location="container:submodules/LightweightAccountData/LightweightAccountData.xcodeproj"/><FileRef location="container:submodules/ListSectionHeaderNode/ListSectionHeaderNode.xcodeproj"/><FileRef location="container:submodules/LiveLocationManager/LiveLocationManager.xcodeproj"/><FileRef location="container:submodules/LiveLocationPositionNode/LiveLocationPositionNode.xcodeproj"/><FileRef location="container:submodules/LiveLocationTimerNode/LiveLocationTimerNode.xcodeproj"/><FileRef location="container:submodules/LocalAuth/LocalAuth.xcodeproj"/><FileRef location="container:submodules/LocalMediaResources/LocalMediaResources.xcodeproj"/><FileRef location="container:submodules/LocalizedPeerData/LocalizedPeerData.xcodeproj"/><FileRef location="container:submodules/LocationUI/LocationUI.xcodeproj"/><FileRef location="container:submodules/MapResourceToAvatarSizes/MapResourceToAvatarSizes.xcodeproj"/><FileRef location="container:submodules/MediaPlayer/MediaPlayer.xcodeproj"/><FileRef location="container:submodules/MediaResources/MediaResources.xcodeproj"/><FileRef location="container:submodules/MergeLists/MergeLists.xcodeproj"/><FileRef location="container:submodules/MessageReactionListUI/MessageReactionListUI.xcodeproj"/><FileRef location="container:submodules/MimeTypes/MimeTypes.xcodeproj"/><FileRef location="container:submodules/MosaicLayout/MosaicLayout.xcodeproj"/><FileRef location="container:submodules/MtProtoKit/MtProtoKit.xcodeproj"/><FileRef location="container:submodules/MusicAlbumArtResources/MusicAlbumArtResources.xcodeproj"/><FileRef location="container:submodules/NotificationMuteSettingsUI/NotificationMuteSettingsUI.xcodeproj"/><FileRef location="container:submodules/NotificationSoundSelectionUI/NotificationSoundSelectionUI.xcodeproj"/><FileRef location="container:submodules/OpenInExternalAppUI/OpenInExternalAppUI.xcodeproj"/><FileRef location="container:submodules/Opus/Opus.xcodeproj"/><FileRef location="container:submodules/OpusBinding/OpusBinding.xcodeproj"/><FileRef location="container:submodules/OverlayStatusController/OverlayStatusController.xcodeproj"/><FileRef location="container:submodules/PasscodeUI/PasscodeUI.xcodeproj"/><FileRef location="container:submodules/PassportUI/PassportUI.xcodeproj"/><FileRef location="container:submodules/PasswordSetupUI/PasswordSetupUI.xcodeproj"/><FileRef location="container:submodules/Pdf/Pdf.xcodeproj"/><FileRef location="container:submodules/PeerAvatarGalleryUI/PeerAvatarGalleryUI.xcodeproj"/><FileRef location="container:submodules/PeerInfoUI/PeerInfoUI.xcodeproj"/><FileRef location="container:submodules/PeerOnlineMarkerNode/PeerOnlineMarkerNode.xcodeproj"/><FileRef location="container:submodules/PeerPresenceStatusManager/PeerPresenceStatusManager.xcodeproj"/><FileRef location="container:submodules/PeersNearbyIconNode/PeersNearbyIconNode.xcodeproj"/><FileRef location="container:submodules/PeersNearbyUI/PeersNearbyUI.xcodeproj"/><FileRef location="container:submodules/PersistentStringHash/PersistentStringHash.xcodeproj"/><FileRef location="container:submodules/PhoneInputNode/PhoneInputNode.xcodeproj"/><FileRef location="container:submodules/PhotoResources/PhotoResources.xcodeproj"/><FileRef location="container:submodules/PlatformRestrictionMatching/PlatformRestrictionMatching.xcodeproj"/><FileRef location="container:submodules/Postbox/Postbox.xcodeproj"/><FileRef location="container:submodules/ProgressNavigationButtonNode/ProgressNavigationButtonNode.xcodeproj"/><FileRef location="container:submodules/QrCode/QrCode.xcodeproj"/><FileRef location="container:submodules/RMIntro/RMIntro.xcodeproj"/><FileRef location="container:submodules/RadialStatusNode/RadialStatusNode.xcodeproj"/><FileRef location="container:submodules/RaiseToListen/RaiseToListen.xcodeproj"/><FileRef location="container:submodules/ReactionSelectionNode/ReactionSelectionNode.xcodeproj"/><FileRef location="container:submodules/SaveToCameraRoll/SaveToCameraRoll.xcodeproj"/><FileRef location="container:submodules/ScreenCaptureDetection/ScreenCaptureDetection.xcodeproj"/><FileRef location="container:submodules/SearchBarNode/SearchBarNode.xcodeproj"/><FileRef location="container:submodules/SearchUI/SearchUI.xcodeproj"/><FileRef location="container:submodules/SegmentedControlNode/SegmentedControlNode.xcodeproj"/><FileRef location="container:submodules/SelectablePeerNode/SelectablePeerNode.xcodeproj"/><FileRef location="container:submodules/SettingsUI/SettingsUI.xcodeproj"/><FileRef location="container:submodules/ShareController/ShareController.xcodeproj"/><FileRef location="container:submodules/ShareItems/ShareItems.xcodeproj"/><FileRef location="container:submodules/SinglePhoneInputNode/SinglePhoneInputNode.xcodeproj"/><FileRef location="container:submodules/SolidRoundedButtonNode/SolidRoundedButtonNode.xcodeproj"/><FileRef location="container:submodules/StickerPackPreviewUI/StickerPackPreviewUI.xcodeproj"/><FileRef location="container:submodules/StickerResources/StickerResources.xcodeproj"/><FileRef location="container:submodules/Stripe/Stripe.xcodeproj"/><FileRef location="container:submodules/SwipeToDismissGesture/SwipeToDismissGesture.xcodeproj"/><FileRef location="container:submodules/SwitchNode/SwitchNode.xcodeproj"/><FileRef location="container:submodules/TelegramApi/TelegramApi.xcodeproj"/><FileRef location="container:submodules/TelegramAudio/TelegramAudio.xcodeproj"/><FileRef location="container:submodules/TelegramBaseController/TelegramBaseController.xcodeproj"/><FileRef location="container:submodules/TelegramCallsUI/TelegramCallsUI.xcodeproj"/><FileRef location="container:submodules/TelegramCore/TelegramCore.xcodeproj"/><FileRef location="container:submodules/TelegramNotices/TelegramNotices.xcodeproj"/><FileRef location="container:submodules/TelegramPermissions/TelegramPermissions.xcodeproj"/><FileRef location="container:submodules/TelegramPermissionsUI/TelegramPermissionsUI.xcodeproj"/><FileRef location="container:submodules/TelegramPresentationData/TelegramPresentationData.xcodeproj"/><FileRef location="container:submodules/TelegramStringFormatting/TelegramStringFormatting.xcodeproj"/><FileRef location="container:submodules/TelegramUI/TelegramUI.xcodeproj"/><FileRef location="container:submodules/TelegramUIPreferences/TelegramUIPreferences.xcodeproj"/><FileRef location="container:submodules/TelegramUniversalVideoContent/TelegramUniversalVideoContent.xcodeproj"/><FileRef location="container:submodules/TelegramUpdateUI/TelegramUpdateUI.xcodeproj"/><FileRef location="container:submodules/TelegramVoip/TelegramVoip.xcodeproj"/><FileRef location="container:submodules/TemporaryCachedPeerDataManager/TemporaryCachedPeerDataManager.xcodeproj"/><FileRef location="container:submodules/TextFormat/TextFormat.xcodeproj"/><FileRef location="container:submodules/TextSelectionNode/TextSelectionNode.xcodeproj"/><FileRef location="container:submodules/TinyThumbnail/TinyThumbnail.xcodeproj"/><FileRef location="container:submodules/TouchDownGesture/TouchDownGesture.xcodeproj"/><FileRef location="container:submodules/Tuples/Tuples.xcodeproj"/><FileRef location="container:submodules/UndoUI/UndoUI.xcodeproj"/><FileRef location="container:submodules/UrlEscaping/UrlEscaping.xcodeproj"/><FileRef location="container:submodules/UrlHandling/UrlHandling.xcodeproj"/><FileRef location="container:submodules/WalletUI/WalletUI.xcodeproj"/><FileRef location="container:submodules/WallpaperResources/WallpaperResources.xcodeproj"/><FileRef location="container:submodules/WatchBridge/WatchBridge.xcodeproj"/><FileRef location="container:submodules/WatchBridgeAudio/WatchBridgeAudio.xcodeproj"/><FileRef location="container:submodules/WebP/WebP.xcodeproj"/><FileRef location="container:submodules/WebSearchUI/WebSearchUI.xcodeproj"/><FileRef location="container:submodules/WebUI/WebUI.xcodeproj"/><FileRef location="container:submodules/WebsiteType/WebsiteType.xcodeproj"/><FileRef location="container:submodules/YuvConversion/YuvConversion.xcodeproj"/><FileRef location="container:submodules/libphonenumber/libphonenumber.xcodeproj"/><FileRef location="container:submodules/libtgvoip/libtgvoip.xcodeproj"/><FileRef location="container:submodules/lottie-ios/lottie-ios.xcodeproj"/><FileRef location="container:submodules/rlottie/rlottie.xcodeproj"/><FileRef location="container:submodules/sqlcipher/sqlcipher.xcodeproj"/></Group></Workspace>
\ No newline at end of file
+<?xml version="1.0" encoding="UTF-8" standalone="no"?><Workspace version="1.0"><FileRef location="container:Project.xcodeproj"/><Group location="container:" name="submodules"><Group location="container:" name="SSignalKit"><FileRef location="container:submodules/SSignalKit/SSignalKit/SSignalKit.xcodeproj"/><FileRef location="container:submodules/SSignalKit/SwiftSignalKit/SwiftSignalKit.xcodeproj"/></Group><Group location="container:" name="WatchCommon"><FileRef location="container:submodules/WatchCommon/Host/Host.xcodeproj"/></Group><FileRef location="container:submodules/AccountContext/AccountContext.xcodeproj"/><FileRef location="container:submodules/ActionSheetPeerItem/ActionSheetPeerItem.xcodeproj"/><FileRef location="container:submodules/ActivityIndicator/ActivityIndicator.xcodeproj"/><FileRef location="container:submodules/AlertUI/AlertUI.xcodeproj"/><FileRef location="container:submodules/AnimationUI/AnimationUI.xcodeproj"/><FileRef location="container:submodules/AppBundle/AppBundle.xcodeproj"/><FileRef location="container:submodules/AsyncDisplayKit/AsyncDisplayKit.xcodeproj"/><FileRef location="container:submodules/AuthorizationUI/AuthorizationUI.xcodeproj"/><FileRef location="container:submodules/AvatarNode/AvatarNode.xcodeproj"/><FileRef location="container:submodules/BotPaymentsUI/BotPaymentsUI.xcodeproj"/><FileRef location="container:submodules/BuildConfig/BuildConfig.xcodeproj"/><FileRef location="container:submodules/CallListUI/CallListUI.xcodeproj"/><FileRef location="container:submodules/ChatListSearchItemHeader/ChatListSearchItemHeader.xcodeproj"/><FileRef location="container:submodules/ChatListSearchItemNode/ChatListSearchItemNode.xcodeproj"/><FileRef location="container:submodules/ChatListSearchRecentPeersNode/ChatListSearchRecentPeersNode.xcodeproj"/><FileRef location="container:submodules/ChatListUI/ChatListUI.xcodeproj"/><FileRef location="container:submodules/ChatTitleActivityNode/ChatTitleActivityNode.xcodeproj"/><FileRef location="container:submodules/CheckNode/CheckNode.xcodeproj"/><FileRef location="container:submodules/ComposePollUI/ComposePollUI.xcodeproj"/><FileRef location="container:submodules/ContactListUI/ContactListUI.xcodeproj"/><FileRef location="container:submodules/ContactsPeerItem/ContactsPeerItem.xcodeproj"/><FileRef location="container:submodules/ContextUI/ContextUI.xcodeproj"/><FileRef location="container:submodules/CounterContollerTitleView/CounterContollerTitleView.xcodeproj"/><FileRef location="container:submodules/CountrySelectionUI/CountrySelectionUI.xcodeproj"/><FileRef location="container:submodules/Crc32/Crc32.xcodeproj"/><FileRef location="container:submodules/DateSelectionUI/DateSelectionUI.xcodeproj"/><FileRef location="container:submodules/DeleteChatPeerActionSheetItem/DeleteChatPeerActionSheetItem.xcodeproj"/><FileRef location="container:submodules/DeviceAccess/DeviceAccess.xcodeproj"/><FileRef location="container:submodules/DeviceLocationManager/DeviceLocationManager.xcodeproj"/><FileRef location="container:submodules/DeviceProximity/DeviceProximity.xcodeproj"/><FileRef location="container:submodules/DirectionalPanGesture/DirectionalPanGesture.xcodeproj"/><FileRef location="container:submodules/Display/Display.xcodeproj"/><FileRef location="container:submodules/Emoji/Emoji.xcodeproj"/><FileRef location="container:submodules/EncryptionKeyVisualization/EncryptionKeyVisualization.xcodeproj"/><FileRef location="container:submodules/FFMpeg/FFMpeg.xcodeproj"/><FileRef location="container:submodules/GZip/GZip.xcodeproj"/><FileRef location="container:submodules/GalleryUI/GalleryUI.xcodeproj"/><FileRef location="container:submodules/GameUI/GameUI.xcodeproj"/><FileRef location="container:submodules/Geocoding/Geocoding.xcodeproj"/><FileRef location="container:submodules/GridMessageSelectionNode/GridMessageSelectionNode.xcodeproj"/><FileRef location="container:submodules/HashtagSearchUI/HashtagSearchUI.xcodeproj"/><FileRef location="container:submodules/HexColor/HexColor.xcodeproj"/><FileRef location="container:submodules/HockeySDK-iOS/HockeySDK-iOS.xcodeproj"/><FileRef location="container:submodules/HorizontalPeerItem/HorizontalPeerItem.xcodeproj"/><FileRef location="container:submodules/ImageBlur/ImageBlur.xcodeproj"/><FileRef location="container:submodules/ImageCompression/ImageCompression.xcodeproj"/><FileRef location="container:submodules/ImageTransparency/ImageTransparency.xcodeproj"/><FileRef location="container:submodules/InstantPageCache/InstantPageCache.xcodeproj"/><FileRef location="container:submodules/InstantPageUI/InstantPageUI.xcodeproj"/><FileRef location="container:submodules/ItemListAddressItem/ItemListAddressItem.xcodeproj"/><FileRef location="container:submodules/ItemListAvatarAndNameInfoItem/ItemListAvatarAndNameInfoItem.xcodeproj"/><FileRef location="container:submodules/ItemListPeerActionItem/ItemListPeerActionItem.xcodeproj"/><FileRef location="container:submodules/ItemListPeerItem/ItemListPeerItem.xcodeproj"/><FileRef location="container:submodules/ItemListStickerPackItem/ItemListStickerPackItem.xcodeproj"/><FileRef location="container:submodules/ItemListUI/ItemListUI.xcodeproj"/><FileRef location="container:submodules/JoinLinkPreviewUI/JoinLinkPreviewUI.xcodeproj"/><FileRef location="container:submodules/LanguageLinkPreviewUI/LanguageLinkPreviewUI.xcodeproj"/><FileRef location="container:submodules/LanguageSuggestionUI/LanguageSuggestionUI.xcodeproj"/><FileRef location="container:submodules/LegacyComponents/LegacyComponents.xcodeproj"/><FileRef location="container:submodules/LegacyDataImport/LegacyDataImport.xcodeproj"/><FileRef location="container:submodules/LegacyMediaPickerUI/LegacyMediaPickerUI.xcodeproj"/><FileRef location="container:submodules/LegacyUI/LegacyUI.xcodeproj"/><FileRef location="container:submodules/LightweightAccountData/LightweightAccountData.xcodeproj"/><FileRef location="container:submodules/ListSectionHeaderNode/ListSectionHeaderNode.xcodeproj"/><FileRef location="container:submodules/LiveLocationManager/LiveLocationManager.xcodeproj"/><FileRef location="container:submodules/LiveLocationPositionNode/LiveLocationPositionNode.xcodeproj"/><FileRef location="container:submodules/LiveLocationTimerNode/LiveLocationTimerNode.xcodeproj"/><FileRef location="container:submodules/LocalAuth/LocalAuth.xcodeproj"/><FileRef location="container:submodules/LocalMediaResources/LocalMediaResources.xcodeproj"/><FileRef location="container:submodules/LocalizedPeerData/LocalizedPeerData.xcodeproj"/><FileRef location="container:submodules/LocationUI/LocationUI.xcodeproj"/><FileRef location="container:submodules/MapResourceToAvatarSizes/MapResourceToAvatarSizes.xcodeproj"/><FileRef location="container:submodules/MediaPlayer/MediaPlayer.xcodeproj"/><FileRef location="container:submodules/MediaResources/MediaResources.xcodeproj"/><FileRef location="container:submodules/MergeLists/MergeLists.xcodeproj"/><FileRef location="container:submodules/MessageReactionListUI/MessageReactionListUI.xcodeproj"/><FileRef location="container:submodules/MimeTypes/MimeTypes.xcodeproj"/><FileRef location="container:submodules/MosaicLayout/MosaicLayout.xcodeproj"/><FileRef location="container:submodules/MtProtoKit/MtProtoKit.xcodeproj"/><FileRef location="container:submodules/MusicAlbumArtResources/MusicAlbumArtResources.xcodeproj"/><FileRef location="container:submodules/NotificationMuteSettingsUI/NotificationMuteSettingsUI.xcodeproj"/><FileRef location="container:submodules/NotificationSoundSelectionUI/NotificationSoundSelectionUI.xcodeproj"/><FileRef location="container:submodules/OpenInExternalAppUI/OpenInExternalAppUI.xcodeproj"/><FileRef location="container:submodules/Opus/Opus.xcodeproj"/><FileRef location="container:submodules/OpusBinding/OpusBinding.xcodeproj"/><FileRef location="container:submodules/OverlayStatusController/OverlayStatusController.xcodeproj"/><FileRef location="container:submodules/PasscodeUI/PasscodeUI.xcodeproj"/><FileRef location="container:submodules/PassportUI/PassportUI.xcodeproj"/><FileRef location="container:submodules/PasswordSetupUI/PasswordSetupUI.xcodeproj"/><FileRef location="container:submodules/Pdf/Pdf.xcodeproj"/><FileRef location="container:submodules/PeerAvatarGalleryUI/PeerAvatarGalleryUI.xcodeproj"/><FileRef location="container:submodules/PeerInfoUI/PeerInfoUI.xcodeproj"/><FileRef location="container:submodules/PeerOnlineMarkerNode/PeerOnlineMarkerNode.xcodeproj"/><FileRef location="container:submodules/PeerPresenceStatusManager/PeerPresenceStatusManager.xcodeproj"/><FileRef location="container:submodules/PeersNearbyIconNode/PeersNearbyIconNode.xcodeproj"/><FileRef location="container:submodules/PeersNearbyUI/PeersNearbyUI.xcodeproj"/><FileRef location="container:submodules/PersistentStringHash/PersistentStringHash.xcodeproj"/><FileRef location="container:submodules/PhoneInputNode/PhoneInputNode.xcodeproj"/><FileRef location="container:submodules/PhotoResources/PhotoResources.xcodeproj"/><FileRef location="container:submodules/PlatformRestrictionMatching/PlatformRestrictionMatching.xcodeproj"/><FileRef location="container:submodules/Postbox/Postbox.xcodeproj"/><FileRef location="container:submodules/ProgressNavigationButtonNode/ProgressNavigationButtonNode.xcodeproj"/><FileRef location="container:submodules/QrCode/QrCode.xcodeproj"/><FileRef location="container:submodules/RMIntro/RMIntro.xcodeproj"/><FileRef location="container:submodules/RadialStatusNode/RadialStatusNode.xcodeproj"/><FileRef location="container:submodules/RaiseToListen/RaiseToListen.xcodeproj"/><FileRef location="container:submodules/ReactionSelectionNode/ReactionSelectionNode.xcodeproj"/><FileRef location="container:submodules/SaveToCameraRoll/SaveToCameraRoll.xcodeproj"/><FileRef location="container:submodules/ScreenCaptureDetection/ScreenCaptureDetection.xcodeproj"/><FileRef location="container:submodules/SearchBarNode/SearchBarNode.xcodeproj"/><FileRef location="container:submodules/SearchUI/SearchUI.xcodeproj"/><FileRef location="container:submodules/SegmentedControlNode/SegmentedControlNode.xcodeproj"/><FileRef location="container:submodules/SelectablePeerNode/SelectablePeerNode.xcodeproj"/><FileRef location="container:submodules/SettingsUI/SettingsUI.xcodeproj"/><FileRef location="container:submodules/ShareController/ShareController.xcodeproj"/><FileRef location="container:submodules/ShareItems/ShareItems.xcodeproj"/><FileRef location="container:submodules/SinglePhoneInputNode/SinglePhoneInputNode.xcodeproj"/><FileRef location="container:submodules/SolidRoundedButtonNode/SolidRoundedButtonNode.xcodeproj"/><FileRef location="container:submodules/StickerPackPreviewUI/StickerPackPreviewUI.xcodeproj"/><FileRef location="container:submodules/StickerResources/StickerResources.xcodeproj"/><FileRef location="container:submodules/Stripe/Stripe.xcodeproj"/><FileRef location="container:submodules/SwipeToDismissGesture/SwipeToDismissGesture.xcodeproj"/><FileRef location="container:submodules/SwitchNode/SwitchNode.xcodeproj"/><FileRef location="container:submodules/TelegramApi/TelegramApi.xcodeproj"/><FileRef location="container:submodules/TelegramAudio/TelegramAudio.xcodeproj"/><FileRef location="container:submodules/TelegramBaseController/TelegramBaseController.xcodeproj"/><FileRef location="container:submodules/TelegramCallsUI/TelegramCallsUI.xcodeproj"/><FileRef location="container:submodules/TelegramCore/TelegramCore.xcodeproj"/><FileRef location="container:submodules/TelegramNotices/TelegramNotices.xcodeproj"/><FileRef location="container:submodules/TelegramPermissions/TelegramPermissions.xcodeproj"/><FileRef location="container:submodules/TelegramPermissionsUI/TelegramPermissionsUI.xcodeproj"/><FileRef location="container:submodules/TelegramPresentationData/TelegramPresentationData.xcodeproj"/><FileRef location="container:submodules/TelegramStringFormatting/TelegramStringFormatting.xcodeproj"/><FileRef location="container:submodules/TelegramUI/TelegramUI.xcodeproj"/><FileRef location="container:submodules/TelegramUIPreferences/TelegramUIPreferences.xcodeproj"/><FileRef location="container:submodules/TelegramUniversalVideoContent/TelegramUniversalVideoContent.xcodeproj"/><FileRef location="container:submodules/TelegramUpdateUI/TelegramUpdateUI.xcodeproj"/><FileRef location="container:submodules/TelegramVoip/TelegramVoip.xcodeproj"/><FileRef location="container:submodules/TemporaryCachedPeerDataManager/TemporaryCachedPeerDataManager.xcodeproj"/><FileRef location="container:submodules/TextFormat/TextFormat.xcodeproj"/><FileRef location="container:submodules/TextSelectionNode/TextSelectionNode.xcodeproj"/><FileRef location="container:submodules/TinyThumbnail/TinyThumbnail.xcodeproj"/><FileRef location="container:submodules/TouchDownGesture/TouchDownGesture.xcodeproj"/><FileRef location="container:submodules/Tuples/Tuples.xcodeproj"/><FileRef location="container:submodules/UndoUI/UndoUI.xcodeproj"/><FileRef location="container:submodules/UrlEscaping/UrlEscaping.xcodeproj"/><FileRef location="container:submodules/UrlHandling/UrlHandling.xcodeproj"/><FileRef location="container:submodules/WalletUI/WalletUI.xcodeproj"/><FileRef location="container:submodules/WallpaperResources/WallpaperResources.xcodeproj"/><FileRef location="container:submodules/WatchBridge/WatchBridge.xcodeproj"/><FileRef location="container:submodules/WatchBridgeAudio/WatchBridgeAudio.xcodeproj"/><FileRef location="container:submodules/WebP/WebP.xcodeproj"/><FileRef location="container:submodules/WebSearchUI/WebSearchUI.xcodeproj"/><FileRef location="container:submodules/WebUI/WebUI.xcodeproj"/><FileRef location="container:submodules/WebsiteType/WebsiteType.xcodeproj"/><FileRef location="container:submodules/YuvConversion/YuvConversion.xcodeproj"/><FileRef location="container:submodules/libphonenumber/libphonenumber.xcodeproj"/><FileRef location="container:submodules/libtgvoip/libtgvoip.xcodeproj"/><FileRef location="container:submodules/lottie-ios/lottie-ios.xcodeproj"/><FileRef location="container:submodules/openssl/openssl.xcodeproj"/><FileRef location="container:submodules/rlottie/rlottie.xcodeproj"/><FileRef location="container:submodules/sqlcipher/sqlcipher.xcodeproj"/><FileRef location="container:submodules/ton/ton.xcodeproj"/></Group></Workspace>
\ No newline at end of file
diff --git a/Telegram_Buck.xcworkspace/xcshareddata/xcschemes/Telegram_Buck.xcscheme b/Telegram_Buck.xcworkspace/xcshareddata/xcschemes/Telegram_Buck.xcscheme
index 3a3c953561..480010c721 100644
--- a/Telegram_Buck.xcworkspace/xcshareddata/xcschemes/Telegram_Buck.xcscheme
+++ b/Telegram_Buck.xcworkspace/xcshareddata/xcschemes/Telegram_Buck.xcscheme
@@ -73,7 +73,7 @@
                BlueprintIdentifier = "E66DC04EB4B57B8200000000"
                BuildableName = "libopenssl.a"
                BlueprintName = "openssl"
-               ReferencedContainer = "container:submodules/MtProtoKit/MtProtoKit.xcodeproj">
+               ReferencedContainer = "container:submodules/openssl/openssl.xcodeproj">
             </BuildableReference>
          </BuildActionEntry>
          <BuildActionEntry
@@ -87,7 +87,7 @@
                BlueprintIdentifier = "E66DC04E0001C15300000000"
                BuildableName = "libton.a"
                BlueprintName = "ton"
-               ReferencedContainer = "container:submodules/MtProtoKit/MtProtoKit.xcodeproj">
+               ReferencedContainer = "container:submodules/ton/ton.xcodeproj">
             </BuildableReference>
          </BuildActionEntry>
          <BuildActionEntry
diff --git a/package_app b/package_app
deleted file mode 100755
index c6071e6d21..0000000000
--- a/package_app
+++ /dev/null
@@ -1,357 +0,0 @@
-#!/bin/sh
-
-set -x
-set -e
-
-PLATFORM_FLAVORS="$1"
-BUCK="$2"
-shift
-shift
-
-BUILD_PATH="build"
-APP_NAME="Telegram"
-
-IPA_PATH="$BUILD_PATH/$APP_NAME.ipa"
-DSYMS_FOLDER_NAME="DSYMs"
-DSYMS_ZIP="$BUILD_PATH/$DSYMS_FOLDER_NAME.zip"
-DSYMS_DIR="$BUILD_PATH/$DSYMS_FOLDER_NAME"
-
-TEMP_PATH="$BUILD_PATH/temp"
-TEMP_ENTITLEMENTS_PATH="$TEMP_PATH/entitlements"
-KEYCHAIN_PATH="$TEMP_PATH/keychain"
-
-mkdir -p "$BUILD_PATH"
-rm -f "$IPA_PATH"
-rm -f "$DSYMS_ZIP"
-rm -rf "$DSYMS_DIR"
-mkdir -p "$DSYMS_DIR"
-rm -rf "$TEMP_PATH"
-
-mkdir -p "$TEMP_PATH"
-mkdir -p "$TEMP_ENTITLEMENTS_PATH"
-
-cp "buck-out/gen/AppPackage#$PLATFORM_FLAVORS.ipa" "$IPA_PATH.original"
-rm -rf "$IPA_PATH.original.unpacked"
-rm -f "$BUILD_PATH/${APP_NAME}_signed.ipa"
-mkdir -p "$IPA_PATH.original.unpacked"
-unzip "$IPA_PATH.original" -d "$IPA_PATH.original.unpacked/"
-rm "$IPA_PATH.original"
-
-UNPACKED_PATH="$IPA_PATH.original.unpacked"
-APP_PATH="$UNPACKED_PATH/Payload/Telegram.app"
-FRAMEWORKS_DIR="$APP_PATH/Frameworks"
-
-rm -rf "$IPA_PATH.original.unpacked/SwiftSupport/iphoneos/"*
-rm -rf "$IPA_PATH.original.unpacked/Symbols/"*
-rm -rf "$FRAMEWORKS_DIR/"*
-
-if [ -z "$1" ] || [ -z "$2" ]; then
-	echo "Usage: sh package_app.sh path/to/buck platform-flavors"
-	exit 1
-fi
-
-if [ -z "$PACKAGE_METHOD" ]; then
-	echo "PACKAGE_METHOD is not set"
-	exit 1
-fi
-
-if [ "$PACKAGE_METHOD" != "appstore" ] && [ "$PACKAGE_METHOD" != "enterprise" ]; then
-	echo "PACKAGE_METHOD $PACKAGE_METHOD should be in [appstore, enterprise]"
-	exit 1
-fi
-
-if [ -z "$PACKAGE_CODE_SIGN_IDENTITY" ]; then
-	echo "PACKAGE_CODE_SIGN_IDENTITY is not set"
-	exit 1
-fi
-
-if [ -z "$DEVELOPMENT_TEAM" ]; then
-	echo "DEVELOPMENT_TEAM is not set"
-	exit 1
-fi
-
-if [ ! -d "$CODESIGNING_DATA_PATH" ]; then
-	echo "CODESIGNING_DATA_PATH $CODESIGNING_DATA_PATH does not exist"
-	exit 1
-fi
-
-if [ -z "$CODESIGNING_CERTS_VARIANT" ]; then
-	echo "CODESIGNING_CERTS_VARIANT is not set"
-	exit 1
-fi
-
-if [ -z "$CODESIGNING_PROFILES_VARIANT" ]; then
-	echo "CODESIGNING_PROFILES_VARIANT is not set"
-	exit 1
-fi
-
-CERTS_PATH="$CODESIGNING_DATA_PATH/certs/$CODESIGNING_CERTS_VARIANT"
-PROFILES_PATH="$CODESIGNING_DATA_PATH/profiles/$CODESIGNING_PROFILES_VARIANT"
-
-if [ ! -d "$CERTS_PATH" ]; then
-	echo "$CERTS_PATH does not exist"
-	exit 1
-fi
-
-if [ ! -d "$PROFILES_PATH" ]; then
-	echo "$PROFILES_PATH does not exist"
-	exit 1
-fi
-
-#security delete-keychain "$KEYCHAIN_PATH" || true
-rm -f "$KEYCHAIN_PATH"
-#security create-keychain -p "password" "$KEYCHAIN_PATH"
-#security unlock-keychain -p "password" "$KEYCHAIN_PATH"
-KEYCHAIN_FLAG="--keychain '$KEYCHAIN_PATH'"
-
-APP_ITEMS_WITH_PROVISIONING_PROFILE="APP EXTENSION_Share EXTENSION_Widget EXTENSION_NotificationService EXTENSION_NotificationContent EXTENSION_Intents WATCH_APP WATCH_EXTENSION"
-APP_ITEMS_WITH_ENTITLEMENTS="APP EXTENSION_Share EXTENSION_Widget EXTENSION_NotificationService EXTENSION_NotificationContent EXTENSION_Intents"
-
-COMMON_IDENTITY_HASH=""
-
-REMOVE_ENTITLEMENT_KEYS=(\
-	"com.apple.developer.icloud-container-development-container-identifiers" \
-	"com.apple.developer.ubiquity-kvstore-identifier" \
-)
-
-COPY_ENTITLEMENT_KEYS=(\
-	"com.apple.developer.associated-domains" \
-	"com.apple.developer.icloud-services" \
-)
-
-for ITEM in $APP_ITEMS_WITH_PROVISIONING_PROFILE; do
-	PROFILE_VAR=PACKAGE_PROVISIONING_PROFILE_$ITEM
-	if [ -z "${!PROFILE_VAR}" ]; then
-		echo "$PROFILE_VAR is not set"
-		exit 1
-	fi
-	for PROFILE in "$PROFILES_PATH/"*; do
-		PROFILE_DATA=$(security cms -D -i "$PROFILE")
-		PROFILE_NAME=$(/usr/libexec/PlistBuddy -c "Print :Name" /dev/stdin <<< $(echo $PROFILE_DATA))
-		if [ "$PROFILE_NAME" == "${!PROFILE_VAR}" ]; then
-			TEAM_IDENTIFIER=$(/usr/libexec/PlistBuddy -c "Print :Entitlements:com.apple.developer.team-identifier" /dev/stdin <<< $(echo $PROFILE_DATA))
-			if [ "$TEAM_IDENTIFIER" != "$DEVELOPMENT_TEAM" ]; then
-				"Entitlements:com.apple.developer.team-identifier in $PROFILE does not match $DEVELOPMENT_TEAM"
-			fi
-
-			IDENTITY_NAME=$(/usr/libexec/PlistBuddy -c "Print :DeveloperCertificates:0 :data" /dev/stdin <<< $(echo $PROFILE_DATA) | openssl x509 -inform DER -subject -nameopt multiline -sha1 -noout | grep commonName | sed -e 's#[ ]*commonName[ ]*=[ ]*##g')
-			if [ ! -z "$IDENTITY_NAME" ]; then
-				IDENTITY_HASH=$(/usr/libexec/PlistBuddy -c "Print :DeveloperCertificates:0 :data" /dev/stdin <<< $(echo $PROFILE_DATA) | openssl x509 -inform DER -fingerprint -sha1 -noout | sed -e 's#SHA1 Fingerprint=##' | sed -e 's#:##g')
-				if [ -z "$COMMON_IDENTITY_HASH" ]; then
-					COMMON_IDENTITY_HASH="$IDENTITY_HASH"
-				elif [ "$COMMON_IDENTITY_HASH" != "$IDENTITY_HASH" ]; then
-					"Signing identity in $PROFILE ($IDENTITY_HASH) does not match $COMMON_IDENTITY_HASH from previously processed profiles"
-				fi
-			else
-				echo "Signing identity name in $PROFILE does not match $PACKAGE_CODE_SIGN_IDENTITY"
-				exit 1
-			fi
-
-			declare PROFILE_PATH_$ITEM="$PROFILE"
-
-			PROFILE_ENTITLEMENTS_PATH="$TEMP_ENTITLEMENTS_PATH/$ITEM.entitlements"
-			security cms -D -i "$PROFILE" > "$TEMP_PATH/temp.plist" && /usr/libexec/PlistBuddy -x -c 'Print:Entitlements' "$TEMP_PATH/temp.plist" > "$PROFILE_ENTITLEMENTS_PATH"
-
-			for KEY in "${REMOVE_ENTITLEMENT_KEYS[@]}"; do
-	            /usr/libexec/PlistBuddy -c "Delete $KEY" "$PROFILE_ENTITLEMENTS_PATH" 2>/dev/null
-	        done
-
-	        ENTITLEMENTS_VAR=PACKAGE_ENTITLEMENTS_$ITEM
-			if [ ! -z "${!ENTITLEMENTS_VAR}" ]; then
-				if [ ! -f "${!ENTITLEMENTS_VAR}" ]; then
-					echo "${!ENTITLEMENTS_VAR} does not exist"
-					exit 1	
-				fi
-
-				for KEY in "${COPY_ENTITLEMENT_KEYS[@]}"; do
-		            VALUE=$(PlistBuddy -c "Print :$KEY" "${!ENTITLEMENTS_VAR}")
-		            echo "$VALUE"
-		            exit 0
-		        done
-			fi
-			declare ENTITLEMENTS_PATH_$ITEM="$PROFILE_ENTITLEMENTS_PATH"
-		fi
-	done
-done
-
-for ITEM in $APP_ITEMS_WITH_PROVISIONING_PROFILE; do
-	PROFILE_PATH_VAR=PROFILE_PATH_$ITEM
-	if [ -z "${!PROFILE_PATH_VAR}" ]; then
-		echo "Provisioning profile for $ITEM was not found"
-		exit 1
-	fi
-done
-
-for ITEM in $APP_ITEMS_WITH_ENTITLEMENTS; do
-	ENTITLEMENTS_VAR=PACKAGE_ENTITLEMENTS_$ITEM
-	if [ -z "${!ENTITLEMENTS_VAR}" ]; then
-		echo "$ENTITLEMENTS_VAR is not set"
-		exit 1
-	fi
-	if [ ! -f "${!ENTITLEMENTS_VAR}" ]; then
-		echo "${!ENTITLEMENTS_VAR} does not exist"
-		exit 1	
-	fi
-done
-
-if [ -z "$COMMON_IDENTITY_HASH" ]; then
-	echo "Failed to determine signing identity"
-	exit 1
-fi
-
-for DEPENDENCY in $(${BUCK} query "kind('apple_library', deps('//:Telegram#$PLATFORM_FLAVORS', 1))" "$@"); do
-	DEPENDENCY_PATH=$(echo "$DEPENDENCY" | sed -e "s#^//##" | sed -e "s#:#/#")
-	DEPENDENCY_NAME=$(echo "$DEPENDENCY" | sed -e "s/#.*//" | sed -e "s/^.*\://")
-	DYLIB_PATH="buck-out/gen/$DEPENDENCY_PATH/lib$DEPENDENCY_NAME.dylib"
-	TARGET_DYLIB_PATH="$FRAMEWORKS_DIR/lib$DEPENDENCY_NAME.dylib"
-	cp "$DYLIB_PATH" "$TARGET_DYLIB_PATH"
-	DSYM_PATH="buck-out/gen/$(echo "$DEPENDENCY" | sed -e "s/#/#apple-dsym,/" | sed -e "s#^//##" | sed -e "s#:#/#").dSYM"
-	cp -r "$DSYM_PATH" "$DSYMS_DIR/"
-done
-
-APP_BINARY_DSYM_PATH="buck-out/gen/Telegram#dwarf-and-dsym,$PLATFORM_FLAVORS,no-include-frameworks/Telegram.app.dSYM"
-cp -r "$APP_BINARY_DSYM_PATH" "$DSYMS_DIR/"
-
-EXTENSIONS="Share Widget Intents NotificationContent NotificationService"
-for EXTENSION in $EXTENSIONS; do
-	EXTENSION_DSYM_PATH="buck-out/gen/${EXTENSION}Extension#dwarf-and-dsym,$PLATFORM_FLAVORS,no-include-frameworks/${EXTENSION}Extension.appex.dSYM"
-	cp -r "$EXTENSION_DSYM_PATH" "$DSYMS_DIR/"
-done
-
-WATCH_EXTENSION_DSYM_PATH="buck-out/gen/WatchAppExtension#dwarf-and-dsym,no-include-frameworks,watchos-arm64_32,watchos-armv7k/WatchAppExtension.appex.dSYM"
-cp -r "$WATCH_EXTENSION_DSYM_PATH" "$DSYMS_DIR/"
-
-for LIB in $(ls "$FRAMEWORKS_DIR"/*.dylib); do
-	strip -S -T "$LIB"
-done
-
-xcrun swift-stdlib-tool --scan-folder "$IPA_PATH.original.unpacked/Payload/Telegram.app" --scan-folder "$IPA_PATH.original.unpacked/Payload/Telegram.app/Frameworks" --scan-folder "$IPA_PATH.original.unpacked/Payload/Telegram.app/PlugIns" --strip-bitcode --platform iphoneos --copy --destination "$IPA_PATH.original.unpacked/SwiftSupport/iphoneos"
-
-cp "$IPA_PATH.original.unpacked/SwiftSupport/iphoneos/"*.dylib "$FRAMEWORKS_DIR/"
-
-REMOVE_ARCHS="armv7s arm64e"
-
-for framework in "$FRAMEWORKS_DIR"/*; do
-    if [[ "$framework" == *.framework || "$framework" == *.dylib ]]; then
-    	codesign --remove-signature "$framework"
-    	for ARCH in $REMOVE_ARCHS; do
-			lipo -remove "$ARCH" "$framework" -o "$framework" || true
-		done
-		xcrun bitcode_strip -r "$framework" -o "$framework"
-		strip -S -T "$framework"
-        /usr/bin/codesign ${VERBOSE} ${KEYCHAIN_FLAG} -f -s "$COMMON_IDENTITY_HASH" "$framework"
-    fi
-done
-
-PLUGINS="Share Widget Intents NotificationService NotificationContent"
-for PLUGIN in $PLUGINS; do
-	PLUGIN_PATH="$APP_PATH/PlugIns/${PLUGIN}Extension.appex"
-	if [ ! -d "$PLUGIN_PATH" ]; then
-		echo "Directory at $PLUGIN_PATH does not exist"
-		exit 1
-	fi
-	PROFILE_PATH_VAR="PROFILE_PATH_EXTENSION_$PLUGIN"
-	if [ -z "${!PROFILE_PATH_VAR}" ]; then
-		echo "$PROFILE_PATH_VAR is not defined"
-		exit 1
-	fi
-	if [ ! -f "${!PROFILE_PATH_VAR}" ]; then
-		echo "${!PROFILE_PATH_VAR} does not exist"
-		exit 1
-	fi
-	ENTITLEMENTS_PATH_VAR="ENTITLEMENTS_PATH_EXTENSION_$PLUGIN"
-	if [ -z "${!ENTITLEMENTS_PATH_VAR}" ]; then
-		echo "$ENTITLEMENTS_PATH_VAR is not defined"
-		exit 1
-	fi
-	if [ ! -f "${!ENTITLEMENTS_PATH_VAR}" ]; then
-		echo "${!ENTITLEMENTS_PATH_VAR} does not exist"
-		exit 1
-	fi
-	cp "${!PROFILE_PATH_VAR}" "$PLUGIN_PATH/embedded.mobileprovision"
-	/usr/bin/codesign ${VERBOSE} -f -s "$COMMON_IDENTITY_HASH" --entitlements "${!ENTITLEMENTS_PATH_VAR}" "$PLUGIN_PATH"	
-done
-
-WATCH_APP_PATH="$APP_PATH/Watch/WatchApp.app"
-WATCH_EXTENSION_PATH="$WATCH_APP_PATH/PlugIns/WatchAppExtension.appex"
-
-WATCH_EXTENSION_PROFILE_PATH_VAR="PROFILE_PATH_WATCH_EXTENSION"
-if [ -z "${!WATCH_EXTENSION_PROFILE_PATH_VAR}" ]; then
-	echo "$WATCH_EXTENSION_PROFILE_PATH_VAR is not defined"
-	exit 1
-fi
-if [ ! -f "${!WATCH_EXTENSION_PROFILE_PATH_VAR}" ]; then
-	echo "${!WATCH_EXTENSION_PROFILE_PATH_VAR} does not exist"
-	exit 1
-fi
-WATCH_EXTENSION_ENTITLEMENTS_PATH_VAR="ENTITLEMENTS_PATH_WATCH_EXTENSION"
-if [ -z "${!WATCH_EXTENSION_ENTITLEMENTS_PATH_VAR}" ]; then
-	echo "$WATCH_EXTENSION_ENTITLEMENTS_PATH_VAR is not defined"
-	exit 1
-fi
-if [ ! -f "${!WATCH_EXTENSION_ENTITLEMENTS_PATH_VAR}" ]; then
-	echo "${!WATCH_EXTENSION_ENTITLEMENTS_PATH_VAR} does not exist"
-	exit 1
-fi
-
-cp "${!WATCH_EXTENSION_PROFILE_PATH_VAR}" "$WATCH_EXTENSION_PATH/embedded.mobileprovision"
-/usr/bin/codesign ${VERBOSE} -f -s "$COMMON_IDENTITY_HASH" --entitlements "${!WATCH_EXTENSION_ENTITLEMENTS_PATH_VAR}" "$WATCH_EXTENSION_PATH"
-
-WATCH_APP_PROFILE_PATH_VAR="PROFILE_PATH_WATCH_APP"
-if [ -z "${!WATCH_APP_PROFILE_PATH_VAR}" ]; then
-	echo "$WATCH_APP_PROFILE_PATH_VAR is not defined"
-	exit 1
-fi
-if [ ! -f "${!WATCH_APP_PROFILE_PATH_VAR}" ]; then
-	echo "${!WATCH_APP_PROFILE_PATH_VAR} does not exist"
-	exit 1
-fi
-WATCH_APP_ENTITLEMENTS_PATH_VAR="ENTITLEMENTS_PATH_WATCH_APP"
-if [ -z "${!WATCH_APP_ENTITLEMENTS_PATH_VAR}" ]; then
-	echo "$WATCH_APP_ENTITLEMENTS_PATH_VAR is not defined"
-	exit 1
-fi
-if [ ! -f "${!WATCH_APP_ENTITLEMENTS_PATH_VAR}" ]; then
-	echo "${!WATCH_APP_ENTITLEMENTS_PATH_VAR} does not exist"
-	exit 1
-fi
-
-cp "${!WATCH_APP_PROFILE_PATH_VAR}" "$WATCH_APP_PATH/embedded.mobileprovision"
-/usr/bin/codesign ${VERBOSE} -f -s "$COMMON_IDENTITY_HASH" --entitlements "${!WATCH_APP_ENTITLEMENTS_PATH_VAR}" "$WATCH_APP_PATH"
-
-APP_PROFILE_PATH_VAR="PROFILE_PATH_APP"
-if [ -z "${!APP_PROFILE_PATH_VAR}" ]; then
-	echo "$APP_PROFILE_PATH_VAR is not defined"
-	exit 1
-fi
-if [ ! -f "${!APP_PROFILE_PATH_VAR}" ]; then
-	echo "${!APP_PROFILE_PATH_VAR} does not exist"
-	exit 1
-fi
-APP_ENTITLEMENTS_PATH_VAR="ENTITLEMENTS_PATH_APP"
-if [ -z "${!APP_ENTITLEMENTS_PATH_VAR}" ]; then
-	echo "$APP_ENTITLEMENTS_PATH_VAR is not defined"
-	exit 1
-fi
-if [ ! -f "${!APP_ENTITLEMENTS_PATH_VAR}" ]; then
-	echo "${!APP_ENTITLEMENTS_PATH_VAR} does not exist"
-	exit 1
-fi
-
-cp "${!APP_PROFILE_PATH_VAR}" "$APP_PATH/embedded.mobileprovision"
-/usr/bin/codesign ${VERBOSE} -f -s "$COMMON_IDENTITY_HASH" --entitlements "${!APP_ENTITLEMENTS_PATH_VAR}" "$APP_PATH"
-
-DIR=$(pwd)
-
-cd "$UNPACKED_PATH"
-if [ "$PACKAGE_METHOD" == "appstore" ]; then
-	zip -r "../${APP_NAME}_signed.ipa" Payload SwiftSupport WatchKitSupport2
-elif [ "$PACKAGE_METHOD" == "enterprise" ]; then
-	zip -r "../${APP_NAME}_signed.ipa" Payload
-fi
-cd "$DIR"
-
-cd "$BUILD_PATH"
-zip -r "$DSYMS_FOLDER_NAME.zip" "$DSYMS_FOLDER_NAME"
-
-cd "$DIR"
diff --git a/submodules/MtProtoKit/BUCK b/submodules/MtProtoKit/BUCK
index 9e36c8dd13..450f4d878c 100644
--- a/submodules/MtProtoKit/BUCK
+++ b/submodules/MtProtoKit/BUCK
@@ -1,71 +1,4 @@
-load("//Config:buck_rule_macros.bzl", "static_library", "framework", "glob_map", "glob_sub_map", "merge_maps")
-
-genrule(
-    name = "openssl_libs",
-    srcs = [
-        "openssl/iOS/libcrypto.a",
-    ],
-    bash = "mkdir -p $OUT; cp $SRCS $OUT/",
-    out = "openssl_libs",
-    visibility = ["PUBLIC"]
-)
-
-apple_library(
-    name = "openssl",
-    visibility = [
-        "//submodules/MtProtoKit:MtProtoKit"
-    ],
-    header_namespace = "openssl",
-    exported_headers = glob([
-        "openssl/**/*.h",
-    ]),
-    exported_linker_flags = [
-        "-lcrypto",
-        "-L$(location :openssl_libs)",
-    ],
-)
-
-ton_lib_names = [
-    "adnllite",
-    "crc32c",
-    "keys",
-    "lite-client-common",
-    "tdactor",
-    "tddb",
-    "tdnet",
-    "tdutils",
-    "tl-lite-utils",
-    "tl-utils",
-    "tl_api",
-    "tl_lite_api",
-    "tl_tonlib_api",
-    "ton_block",
-    "ton_crypto",
-    "tonlib",
-]
-
-ton_lib_flags = ["-l" + name for name in ton_lib_names]
-
-genrule(
-    name = "ton_libs",
-    srcs = glob([
-        "TON/iOS/lib/*.a",
-    ]),
-    bash = "mkdir -p $OUT; cp $SRCS $OUT/",
-    out = "ton_libs",
-    visibility = ["PUBLIC"]
-)
-
-apple_library(
-    name = "ton",
-    visibility = [
-        "//submodules/MtProtoKit:MtProtoKit"
-    ],
-    exported_headers = [],
-    exported_linker_flags = [
-        "-L$(location :ton_libs)",
-    ] + ton_lib_flags,
-)
+load("//Config:buck_rule_macros.bzl", "static_library", "framework", "glob_map", "merge_maps")
 
 framework(
     name = "MtProtoKit",
@@ -85,9 +18,6 @@ framework(
             "thirdparty/AsyncSocket/*.h",
             "TON/*.h",
         ])),
-        glob_sub_map("TON/iOS/include/", glob([
-            "TON/iOS/include/**/*.h",
-        ])),
     ]),
     exported_headers = [
         "MtProtoKit/MTTime.h",
@@ -153,8 +83,8 @@ framework(
     ],
     visibility = ["PUBLIC"],
     deps = [
-        ":openssl",
-        ":ton",
+        "//submodules/openssl:openssl",
+        "//submodules/ton:ton",
     ],
     frameworks = [
         "$SDKROOT/System/Library/Frameworks/Foundation.framework",
diff --git a/submodules/MtProtoKit/MTPKCS.m b/submodules/MtProtoKit/MTPKCS.m
index 8fc6143692..00f59887b9 100644
--- a/submodules/MtProtoKit/MTPKCS.m
+++ b/submodules/MtProtoKit/MTPKCS.m
@@ -51,7 +51,11 @@
         return nil;
     }
     
-    result = [[MTPKCS alloc] initWithName:[NSString stringWithUTF8String:cert->name] data:[NSData dataWithBytes:cert->cert_info->key->public_key->data length:cert->cert_info->key->public_key->length]];
+    X509_NAME *name = X509_get_subject_name(cert);
+    EVP_PKEY *publicKey = X509_get_pubkey(cert);
+    
+    assert(false);
+    //result = [[MTPKCS alloc] initWithName:[NSString stringWithUTF8String:cert->name] data:[NSData dataWithBytes:cert->cert_info->key->public_key->data length:cert->cert_info->key->public_key->length]];
     
     return result;
 }
diff --git a/submodules/MtProtoKit/MTProtoKit/MTEncryption.m b/submodules/MtProtoKit/MTProtoKit/MTEncryption.m
index 3bf73680c7..4e778873f9 100644
--- a/submodules/MtProtoKit/MTProtoKit/MTEncryption.m
+++ b/submodules/MtProtoKit/MTProtoKit/MTEncryption.m
@@ -10,6 +10,7 @@
 
 #include <openssl/bn.h>
 #include <openssl/err.h>
+#include <openssl/rsa.h>
 
 #import "MTAes.h"
 #import "MTRsa.h"
@@ -800,17 +801,20 @@ uint64_t MTRsaFingerprint(NSString *key) {
     BIO_write(keyBio, keyData.bytes, (int)keyData.length);
     RSA *rsaKey = PEM_read_bio_RSAPublicKey(keyBio, NULL, NULL, NULL);
     
-    int nBytes = BN_num_bytes(rsaKey->n);
-    int eBytes = BN_num_bytes(rsaKey->e);
+    BIGNUM *rsaKeyN = RSA_get0_n(rsaKey);
+    BIGNUM *rsaKeyE = RSA_get0_e(rsaKey);
+    
+    int nBytes = BN_num_bytes(rsaKeyN);
+    int eBytes = BN_num_bytes(rsaKeyE);
     
     MTBuffer *buffer = [[MTBuffer alloc] init];
     
     NSMutableData *nData = [[NSMutableData alloc] initWithLength:nBytes];
-    BN_bn2bin(rsaKey->n, nData.mutableBytes);
+    BN_bn2bin(rsaKeyN, nData.mutableBytes);
     [buffer appendTLBytes:nData];
     
     NSMutableData *eData = [[NSMutableData alloc] initWithLength:eBytes];
-    BN_bn2bin(rsaKey->e, eData.mutableBytes);
+    BN_bn2bin(rsaKeyE, eData.mutableBytes);
     [buffer appendTLBytes:eData];
     
     NSData *sha1Data = MTSha1(buffer.data);
@@ -877,32 +881,33 @@ static NSData *decrypt_TL_data(unsigned char buffer[256]) {
         return nil;
     }
     
-    BIGNUM x, y;
+    BIGNUM *x = BN_new();
+    BIGNUM *y = BN_new();
     BN_CTX *bnContext = BN_CTX_new();
     uint8_t *bytes = buffer;
-    BN_init(&x);
-    BN_init(&y);
-    BN_bin2bn(bytes, 256, &x);
+    BN_bin2bn(bytes, 256, x);
+    
+    BIGNUM *rsaKeyN = RSA_get0_n(rsaKey);
+    BIGNUM *rsaKeyE = RSA_get0_e(rsaKey);
     
     NSData *result = nil;
-    if (BN_mod_exp(&y, &x, rsaKey->e, rsaKey->n, bnContext) == 1) {
-        unsigned l = 256 - BN_num_bytes(&y);
+    if (BN_mod_exp(y, x, rsaKeyE, rsaKeyN, bnContext) == 1) {
+        unsigned l = 256 - BN_num_bytes(y);
         memset(bytes, 0, l);
-        if (BN_bn2bin(&y, bytes + l) == 256 - l) {
+        if (BN_bn2bin(y, bytes + l) == 256 - l) {
             AES_KEY aeskey;
             unsigned char iv[16];
             memcpy(iv, bytes + 16, 16);
             AES_set_decrypt_key(bytes, 256, &aeskey);
             AES_cbc_encrypt(bytes + 32, bytes + 32, 256 - 32, &aeskey, iv, AES_DECRYPT);
             
-            EVP_MD_CTX ctx;
+            EVP_MD_CTX *ctx = EVP_MD_CTX_new();
             unsigned char sha256_out[32];
             unsigned olen = 0;
-            EVP_MD_CTX_init(&ctx);
-            EVP_DigestInit_ex(&ctx, EVP_sha256(), NULL);
-            EVP_DigestUpdate(&ctx, bytes + 32, 256 - 32 - 16);
-            EVP_DigestFinal_ex(&ctx, sha256_out, &olen);
-            EVP_MD_CTX_cleanup(&ctx);
+            EVP_DigestInit_ex(ctx, EVP_sha256(), NULL);
+            EVP_DigestUpdate(ctx, bytes + 32, 256 - 32 - 16);
+            EVP_DigestFinal_ex(ctx, sha256_out, &olen);
+            EVP_MD_CTX_free(ctx);
             if (olen == 32) {
                 if (memcmp(bytes + 256 - 16, sha256_out, 16) == 0) {
                     unsigned data_len = *(unsigned *) (bytes + 32);
@@ -921,8 +926,8 @@ static NSData *decrypt_TL_data(unsigned char buffer[256]) {
             }
         }
     }
-    BN_free(&x);
-    BN_free(&y);
+    BN_free(x);
+    BN_free(y);
     RSA_free(rsaKey);
     BIO_free(keyBio);
     BN_CTX_free(bnContext);
diff --git a/submodules/MtProtoKit/TON/iOS/include/td/utils/config.h b/submodules/MtProtoKit/TON/iOS/include/td/utils/config.h
deleted file mode 100644
index bb671cfa26..0000000000
--- a/submodules/MtProtoKit/TON/iOS/include/td/utils/config.h
+++ /dev/null
@@ -1,9 +0,0 @@
-#pragma once
-
-#define TD_HAVE_OPENSSL 1
-#define TD_HAVE_ZLIB 1
-#define TD_HAVE_CRC32C 1
-#define TD_HAVE_COROUTINES 0
-#define TD_HAVE_ABSL 0
-#define TD_HAVE_GETOPT 1
-#define TD_FD_DEBUG 0
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libadnllite.a b/submodules/MtProtoKit/TON/iOS/lib/libadnllite.a
deleted file mode 100644
index 41072ac124..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libadnllite.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libcrc32c.a b/submodules/MtProtoKit/TON/iOS/lib/libcrc32c.a
deleted file mode 100644
index c19afc4fb8..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libcrc32c.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libkeys.a b/submodules/MtProtoKit/TON/iOS/lib/libkeys.a
deleted file mode 100644
index 1e04be7bd7..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libkeys.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/liblite-client-common.a b/submodules/MtProtoKit/TON/iOS/lib/liblite-client-common.a
deleted file mode 100644
index d249337c8f..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/liblite-client-common.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libtdactor.a b/submodules/MtProtoKit/TON/iOS/lib/libtdactor.a
deleted file mode 100644
index 6433e04a3d..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libtdactor.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libtddb.a b/submodules/MtProtoKit/TON/iOS/lib/libtddb.a
deleted file mode 100644
index 6e2af6bafe..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libtddb.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libtdnet.a b/submodules/MtProtoKit/TON/iOS/lib/libtdnet.a
deleted file mode 100644
index 5bc5dbce83..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libtdnet.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libtdutils.a b/submodules/MtProtoKit/TON/iOS/lib/libtdutils.a
deleted file mode 100644
index 8ff7e1f9b7..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libtdutils.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libtl-lite-utils.a b/submodules/MtProtoKit/TON/iOS/lib/libtl-lite-utils.a
deleted file mode 100644
index 30559a49fa..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libtl-lite-utils.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libtl-utils.a b/submodules/MtProtoKit/TON/iOS/lib/libtl-utils.a
deleted file mode 100644
index ccda28c8b0..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libtl-utils.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libtl_api.a b/submodules/MtProtoKit/TON/iOS/lib/libtl_api.a
deleted file mode 100644
index 302099ebe6..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libtl_api.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libtl_lite_api.a b/submodules/MtProtoKit/TON/iOS/lib/libtl_lite_api.a
deleted file mode 100644
index 22160af5f3..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libtl_lite_api.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libtl_tonlib_api.a b/submodules/MtProtoKit/TON/iOS/lib/libtl_tonlib_api.a
deleted file mode 100644
index 0e600a0910..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libtl_tonlib_api.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libton_block.a b/submodules/MtProtoKit/TON/iOS/lib/libton_block.a
deleted file mode 100644
index 79b137413d..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libton_block.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libton_crypto.a b/submodules/MtProtoKit/TON/iOS/lib/libton_crypto.a
deleted file mode 100644
index ac3f27ad14..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libton_crypto.a and /dev/null differ
diff --git a/submodules/MtProtoKit/TON/iOS/lib/libtonlib.a b/submodules/MtProtoKit/TON/iOS/lib/libtonlib.a
deleted file mode 100644
index cda1c5a30d..0000000000
Binary files a/submodules/MtProtoKit/TON/iOS/lib/libtonlib.a and /dev/null differ
diff --git a/submodules/ffmpeg/BUCK b/submodules/ffmpeg/BUCK
index 82f747f3b8..aed1b5364a 100644
--- a/submodules/ffmpeg/BUCK
+++ b/submodules/ffmpeg/BUCK
@@ -106,7 +106,7 @@ ffmpeg_header_paths = [
     "libswresample/swresample.h",
 ]
 
-library_archs = "arm64 armv7 x86_64"# if native.read_config("custom", "mode") == "project" else "arm64 armv7"
+library_archs = "arm64 armv7 x86_64"
 
 genrule(
     name = "libffmpeg_build",
diff --git a/submodules/openssl/BUCK b/submodules/openssl/BUCK
new file mode 100644
index 0000000000..8e26f2d2fa
--- /dev/null
+++ b/submodules/openssl/BUCK
@@ -0,0 +1,160 @@
+load("//Config:buck_rule_macros.bzl", "static_library", "gen_header_targets")
+
+openssl_headers = [
+    "aes.h",
+    "asn1.h",
+    "asn1_mac.h",
+    "asn1err.h",
+    "asn1t.h",
+    "async.h",
+    "asyncerr.h",
+    "bio.h",
+    "bioerr.h",
+    "blowfish.h",
+    "bn.h",
+    "bnerr.h",
+    "buffer.h",
+    "buffererr.h",
+    "camellia.h",
+    "cast.h",
+    "cmac.h",
+    "cms.h",
+    "cmserr.h",
+    "comp.h",
+    "comperr.h",
+    "conf.h",
+    "conf_api.h",
+    "conferr.h",
+    "crypto.h",
+    "cryptoerr.h",
+    "ct.h",
+    "cterr.h",
+    "des.h",
+    "dh.h",
+    "dherr.h",
+    "dsa.h",
+    "dsaerr.h",
+    "dtls1.h",
+    "e_os2.h",
+    "ebcdic.h",
+    "ec.h",
+    "ecdh.h",
+    "ecdsa.h",
+    "ecerr.h",
+    "engine.h",
+    "engineerr.h",
+    "err.h",
+    "evp.h",
+    "evperr.h",
+    "hmac.h",
+    "idea.h",
+    "kdf.h",
+    "kdferr.h",
+    "lhash.h",
+    "md2.h",
+    "md4.h",
+    "md5.h",
+    "mdc2.h",
+    "modes.h",
+    "obj_mac.h",
+    "objects.h",
+    "objectserr.h",
+    "ocsp.h",
+    "ocsperr.h",
+    "opensslconf.h",
+    "opensslv.h",
+    "ossl_typ.h",
+    "pem.h",
+    "pem2.h",
+    "pemerr.h",
+    "pkcs12.h",
+    "pkcs12err.h",
+    "pkcs7.h",
+    "pkcs7err.h",
+    "rand.h",
+    "rand_drbg.h",
+    "randerr.h",
+    "rc2.h",
+    "rc4.h",
+    "rc5.h",
+    "ripemd.h",
+    "rsa.h",
+    "rsaerr.h",
+    "safestack.h",
+    "seed.h",
+    "sha.h",
+    "srp.h",
+    "srtp.h",
+    "ssl.h",
+    "ssl2.h",
+    "ssl3.h",
+    "sslerr.h",
+    "stack.h",
+    "store.h",
+    "storeerr.h",
+    "symhacks.h",
+    "tls1.h",
+    "ts.h",
+    "tserr.h",
+    "txt_db.h",
+    "ui.h",
+    "uierr.h",
+    "whrlpool.h",
+    "x509.h",
+    "x509_vfy.h",
+    "x509err.h",
+    "x509v3.h",
+    "x509v3err.h",
+]
+
+openssl_header_paths = ["openssl/" + header for header in openssl_headers]
+
+archs = ["arm64", "armv7", "x86_64"]
+
+rules = [
+    genrule(
+        name = "openssl_build_" + arch,
+        srcs = glob([
+            "build-openssl.sh",
+            "*.tar.gz",
+            "*.patch",
+        ]),
+        bash = "sh $SRCDIR/build-openssl.sh $OUT $SRCDIR " + arch,
+        out = "openssl_" + arch,
+        visibility = [
+            "//submodules/openssl:...",
+        ]
+    ) for arch in archs
+]
+
+genrule(
+    name = "openssl_build_merged",
+    srcs = [
+        "pack-openssl.sh",
+    ],
+    bash = "sh $SRCDIR/pack-openssl.sh $OUT $(location :openssl_build_arm64)/out/include " + " ".join(["$(location :openssl_build_" + arch + ")/out/lib/libcrypto.a" for arch in archs]),
+    out = "openssl",
+    visibility = [
+        "PUBLIC",
+    ]
+)
+
+openssl_header_targets = gen_header_targets(openssl_header_paths, "openssl_header_", "", "openssl_build_arm64", "out/include")
+
+apple_library(
+    name = "openssl",
+    visibility = [
+        "PUBLIC",
+    ],
+    header_namespace = "openssl",
+    exported_headers = openssl_header_targets,
+    linker_flags = [
+        "-L$(location :openssl_build_merged)/lib",
+        "-lcrypto",
+    ],
+    exported_linker_flags = [
+        "-L$(location :openssl_build_merged)/lib",
+        "-lcrypto",
+    ],
+    deps = [":openssl_build_" + arch for arch in ["arm64"]],
+)
diff --git a/submodules/openssl/build-openssl.sh b/submodules/openssl/build-openssl.sh
new file mode 100644
index 0000000000..f2b2c487c4
--- /dev/null
+++ b/submodules/openssl/build-openssl.sh
@@ -0,0 +1,195 @@
+#!/bin/bash
+
+OUT_DIR="$1"
+SRC_DIR="$2"
+ARCH="$3"
+
+if [ "$ARCH" != "arm64" ] && [ "$ARCH" != "armv7" ] && [ "$ARCH" != "x86_64" ]; then
+  echo "Invalid architecture $ARCH"
+  exit 1
+fi
+
+if [ -z "$OUT_DIR" ]; then
+  echo "Usage: sh build-openssl.sh OUT_DIR SRC_DIR ARCH"
+  exit 1
+fi
+
+if [ -z "$SRC_DIR" ]; then
+  echo "Usage: sh build-openssl.sh OUT_DIR SRC_DIR ARCH"
+  exit 1
+fi
+
+if [ ! -d "$SRC_DIR" ]; then
+  echo "$SRC_DIR does not exist"
+  exit 1
+fi
+
+mkdir -p "$OUT_DIR"
+
+TMP_DIR="$OUT_DIR/build"
+rm -rf "$TMP_DIR"
+mkdir -p "$TMP_DIR"
+
+CROSS_TOP_SIM="`xcode-select --print-path`/Platforms/iPhoneSimulator.platform/Developer"
+CROSS_SDK_SIM="iPhoneSimulator.sdk"
+
+CROSS_TOP_IOS="`xcode-select --print-path`/Platforms/iPhoneOS.platform/Developer"
+CROSS_SDK_IOS="iPhoneOS.sdk"
+
+SOURCE_DIR="$OUT_DIR/openssl-1.1.1d"
+SOURCE_ARCHIVE="$SRC_DIR/openssl-1.1.1d.tar.gz"
+
+rm -rf "$SOURCE_DIR"
+
+tar -xzf "$SOURCE_ARCHIVE" --directory "$OUT_DIR"
+
+export CROSS_COMPILE=`xcode-select --print-path`/Toolchains/XcodeDefault.xctoolchain/usr/bin/
+
+function build_for ()
+{
+  DIR="$(pwd)"
+  cd "$SOURCE_DIR"
+
+  PLATFORM="$1"
+  ARCH="$2"
+  CROSS_TOP_ENV="CROSS_TOP_$3"
+  CROSS_SDK_ENV="CROSS_SDK_$3"
+
+  make clean
+
+  export CROSS_TOP="${!CROSS_TOP_ENV}"
+  export CROSS_SDK="${!CROSS_SDK_ENV}"
+
+  MINIMAL_FLAGS=(\
+    "no-afalgeng" \
+    "no-aria" \
+    "no-asan" \
+    "no-async" \
+    "no-autoalginit" \
+    "no-autoerrinit" \
+    "no-autoload-config" \
+    "no-bf" \
+    "no-blake2" \
+    "no-buildtest-c++" \
+    "no-camellia" \
+    "no-capieng" \
+    "no-cast" \
+    "no-chacha" \
+    "no-cmac" \
+    "no-cms" \
+    "no-comp" \
+    "no-crypto-mdebug" \
+    "no-crypto-mdebug-backtrace" \
+    "no-ct" \
+    "no-deprecated" \
+    "no-des" \
+    "no-devcryptoeng" \
+    "no-dgram" \
+    "no-dh" \
+    "no-dsa" \
+    "no-dtls" \
+    "no-dynamic-engine" \
+    "no-ec" \
+    "no-ec2m" \
+    "no-ecdh" \
+    "no-ecdsa" \
+    "no-ec_nistp_64_gcc_128" \
+    "no-egd" \
+    "no-engine" \
+    "no-err" \
+    "no-external-tests" \
+    "no-filenames" \
+    "no-fuzz-libfuzzer" \
+    "no-fuzz-afl" \
+    "no-gost" \
+    "no-heartbeats" \
+    "no-idea" \
+    "no-makedepend" \
+    "no-md2" \
+    "no-md4" \
+    "no-mdc2" \
+    "no-msan" \
+    "no-multiblock" \
+    "no-nextprotoneg" \
+    "no-pinshared" \
+    "no-ocb" \
+    "no-ocsp" \
+    "no-pic" \
+    "no-poly1305" \
+    "no-posix-io" \
+    "no-psk" \
+    "no-rc2" \
+    "no-rc4" \
+    "no-rc5" \
+    "no-rfc3779" \
+    "no-rmd160" \
+    "no-scrypt" \
+    "no-sctp" \
+    "no-shared" \
+    "no-siphash" \
+    "no-sm2" \
+    "no-sm3" \
+    "no-sm4" \
+    "no-sock" \
+    "no-srp" \
+    "no-srtp" \
+    "no-sse2" \
+    "no-ssl" \
+    "no-ssl-trace" \
+    "no-static-engine" \
+    "no-stdio" \
+    "no-tests" \
+    "no-tls" \
+    "no-ts" \
+    "no-ubsan" \
+    "no-ui-console" \
+    "no-unit-test" \
+    "no-whirlpool" \
+    "no-weak-ssl-ciphers" \
+    "no-zlib" \
+    "no-zlib-dynamic" \
+  )
+
+  DEFAULT_FLAGS=(\
+    "no-asm" \
+    "no-ssl3" \
+    "no-comp" \
+    "no-hw" \
+    "no-engine" \
+    "no-async" \
+  )
+
+  ADDITIONAL_FLAGS=$DEFAULT_FLAGS
+
+  ./Configure $PLATFORM "-arch $ARCH" ${ADDITIONAL_FLAGS[@]} --prefix=${TMP_DIR}/${ARCH} || exit 1
+  
+  make && make install_sw || exit 2
+  unset CROSS_TOP
+  unset CROSS_SDK
+
+  cd "$DIR"
+}
+
+patch "$SOURCE_DIR/Configurations/10-main.conf" < patch-conf.patch || exit 1
+
+if [ "$ARCH" == "x86_64" ]; then
+  build_for ios64sim-cross x86_64 SIM || exit 2
+elif [ "$ARCH" == "armv7" ]; then
+  build_for ios-cross armv7 IOS || exit 4
+elif [ "$ARCH" == "arm64" ]; then
+  build_for ios64-cross arm64 IOS || exit 5
+else
+  echo "Invalid architecture $ARCH"
+  exit 1
+fi
+
+cp -r "${TMP_DIR}/$ARCH/include" "${TMP_DIR}/"
+patch -p3 "${TMP_DIR}/include/openssl/opensslconf.h" < patch-include.patch
+
+DFT_DIST_DIR="$OUT_DIR/out"
+rm -rf "$DFT_DIST_DIR"
+mkdir -p "$DFT_DIST_DIR"
+
+DIST_DIR="${DIST_DIR:-$DFT_DIST_DIR}"
+mkdir -p "${DIST_DIR}"
+cp -r "${TMP_DIR}/include" "${TMP_DIR}/$ARCH/lib" "${DIST_DIR}"
\ No newline at end of file
diff --git a/submodules/openssl/openssl-1.1.1d.tar.gz b/submodules/openssl/openssl-1.1.1d.tar.gz
new file mode 100644
index 0000000000..216017a51b
Binary files /dev/null and b/submodules/openssl/openssl-1.1.1d.tar.gz differ
diff --git a/submodules/openssl/openssl.xcodeproj/project.pbxproj b/submodules/openssl/openssl.xcodeproj/project.pbxproj
new file mode 100644
index 0000000000..d8fb540584
--- /dev/null
+++ b/submodules/openssl/openssl.xcodeproj/project.pbxproj
@@ -0,0 +1,3393 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>archiveVersion</key>
+	<string>1</string>
+	<key>classes</key>
+	<dict>
+	</dict>
+	<key>objectVersion</key>
+	<string>46</string>
+	<key>objects</key>
+	<dict>
+		<key>1DD70E29F2B988F300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl-Debug.xcconfig</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl-Debug.xcconfig</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>explicitFileType</key>
+			<string>text.xcconfig</string>
+		</dict>
+		<key>1DD70E290F9DAF9D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl-Profile.xcconfig</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl-Profile.xcconfig</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>explicitFileType</key>
+			<string>text.xcconfig</string>
+		</dict>
+		<key>1DD70E2983345AFF00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl-Release.xcconfig</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl-Release.xcconfig</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>explicitFileType</key>
+			<string>text.xcconfig</string>
+		</dict>
+		<key>B401C9792F7F325000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>Buck (Do Not Modify)</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29F2B988F300000000</string>
+				<string>1DD70E290F9DAF9D00000000</string>
+				<string>1DD70E2983345AFF00000000</string>
+			</array>
+		</dict>
+		<key>B401C979B781F65D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>Configurations</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>B401C9792F7F325000000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2927456D0000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>build-openssl.sh</string>
+			<key>path</key>
+			<string>build-openssl.sh</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>explicitFileType</key>
+			<string>text.script.sh</string>
+		</dict>
+		<key>1DD70E29454E291200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl-1.1.1d.tar.gz</string>
+			<key>path</key>
+			<string>openssl-1.1.1d.tar.gz</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>explicitFileType</key>
+			<string>archive.gzip</string>
+		</dict>
+		<key>1DD70E29D077687500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>pack-openssl.sh</string>
+			<key>path</key>
+			<string>pack-openssl.sh</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>explicitFileType</key>
+			<string>text.script.sh</string>
+		</dict>
+		<key>1DD70E296AE49FA300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>patch-conf.patch</string>
+			<key>path</key>
+			<string>patch-conf.patch</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+		</dict>
+		<key>1DD70E29C3BAB6BD00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>patch-include.patch</string>
+			<key>path</key>
+			<string>patch-include.patch</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+		</dict>
+		<key>B401C979048F8EF000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>Other</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2927456D0000000000</string>
+				<string>1DD70E29454E291200000000</string>
+				<string>1DD70E29D077687500000000</string>
+				<string>1DD70E296AE49FA300000000</string>
+				<string>1DD70E29C3BAB6BD00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2932210C1000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>libopenssl.a</string>
+			<key>path</key>
+			<string>libopenssl.a</string>
+			<key>sourceTree</key>
+			<string>BUILT_PRODUCTS_DIR</string>
+			<key>explicitFileType</key>
+			<string>archive.ar</string>
+		</dict>
+		<key>B401C979C806358400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>Products</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2932210C1000000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29001F47FB00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>BUCK</string>
+			<key>path</key>
+			<string>BUCK</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>explicitFileType</key>
+			<string>text.script.python</string>
+		</dict>
+		<key>1DD70E29A7C744B800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_aes.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_aes.h/openssl_header_openssl_sub_aes.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A7C744B800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_aes.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_aes.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A7C744B800000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2951E45A2000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_asn1.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_asn1.h/openssl_header_openssl_sub_asn1.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97951E45A2000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_asn1.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_asn1.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2951E45A2000000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2909FBC7B000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_asn1_mac.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_asn1_mac.h/openssl_header_openssl_sub_asn1_mac.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97909FBC7B000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_asn1_mac.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_asn1_mac.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2909FBC7B000000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29DFA13C3900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_asn1err.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_asn1err.h/openssl_header_openssl_sub_asn1err.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979DFA13C3900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_asn1err.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_asn1err.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29DFA13C3900000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29EAA7EA0800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_asn1t.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_asn1t.h/openssl_header_openssl_sub_asn1t.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979EAA7EA0800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_asn1t.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_asn1t.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29EAA7EA0800000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29EB5E676500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_async.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_async.h/openssl_header_openssl_sub_async.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979EB5E676500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_async.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_async.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29EB5E676500000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2921EF6CD400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_asyncerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_asyncerr.h/openssl_header_openssl_sub_asyncerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97921EF6CD400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_asyncerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_asyncerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2921EF6CD400000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A7D71EB100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_bio.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_bio.h/openssl_header_openssl_sub_bio.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A7D71EB100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_bio.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_bio.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A7D71EB100000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29C5C9E20800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_bioerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_bioerr.h/openssl_header_openssl_sub_bioerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979C5C9E20800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_bioerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_bioerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29C5C9E20800000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29DAFD603500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_blowfish.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_blowfish.h/openssl_header_openssl_sub_blowfish.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979DAFD603500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_blowfish.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_blowfish.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29DAFD603500000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29BB177FB700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_bn.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_bn.h/openssl_header_openssl_sub_bn.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979BB177FB700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_bn.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_bn.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29BB177FB700000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2916A49B4200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_bnerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_bnerr.h/openssl_header_openssl_sub_bnerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97916A49B4200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_bnerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_bnerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2916A49B4200000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2931413A2B00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_buffer.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_buffer.h/openssl_header_openssl_sub_buffer.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97931413A2B00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_buffer.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_buffer.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2931413A2B00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29D89D5C4E00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_buffererr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_buffererr.h/openssl_header_openssl_sub_buffererr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979D89D5C4E00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_buffererr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_buffererr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29D89D5C4E00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29F2C63C3900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_camellia.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_camellia.h/openssl_header_openssl_sub_camellia.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979F2C63C3900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_camellia.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_camellia.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29F2C63C3900000000</string>
+			</array>
+		</dict>
+		<key>1DD70E295453A5AA00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_cast.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_cast.h/openssl_header_openssl_sub_cast.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9795453A5AA00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_cast.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_cast.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E295453A5AA00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2954F4513700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_cmac.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_cmac.h/openssl_header_openssl_sub_cmac.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97954F4513700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_cmac.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_cmac.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2954F4513700000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A7E716B200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_cms.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_cms.h/openssl_header_openssl_sub_cms.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A7E716B200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_cms.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_cms.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A7E716B200000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2908175E6700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_cmserr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_cmserr.h/openssl_header_openssl_sub_cmserr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97908175E6700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_cmserr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_cmserr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2908175E6700000000</string>
+			</array>
+		</dict>
+		<key>1DD70E295516257A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_comp.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_comp.h/openssl_header_openssl_sub_comp.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9795516257A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_comp.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_comp.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E295516257A00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E299F407A9F00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_comperr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_comperr.h/openssl_header_openssl_sub_comperr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9799F407A9F00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_comperr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_comperr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E299F407A9F00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E295516744F00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_conf.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_conf.h/openssl_header_openssl_sub_conf.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9795516744F00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_conf.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_conf.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E295516744F00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E299485006A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_conf_api.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_conf_api.h/openssl_header_openssl_sub_conf_api.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9799485006A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_conf_api.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_conf_api.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E299485006A00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29C3163FAA00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_conferr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_conferr.h/openssl_header_openssl_sub_conferr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979C3163FAA00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_conferr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_conferr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29C3163FAA00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E291B6F7A6C00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_crypto.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_crypto.h/openssl_header_openssl_sub_crypto.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9791B6F7A6C00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_crypto.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_crypto.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E291B6F7A6C00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29B4E4A86D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_cryptoerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_cryptoerr.h/openssl_header_openssl_sub_cryptoerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979B4E4A86D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_cryptoerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_cryptoerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29B4E4A86D00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29BB180A9C00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ct.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ct.h/openssl_header_openssl_sub_ct.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979BB180A9C00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ct.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ct.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29BB180A9C00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2955C7EA3D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_cterr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_cterr.h/openssl_header_openssl_sub_cterr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97955C7EA3D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_cterr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_cterr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2955C7EA3D00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A7F18B3B00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_des.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_des.h/openssl_header_openssl_sub_des.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A7F18B3B00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_des.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_des.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A7F18B3B00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29BB1851EF00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_dh.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_dh.h/openssl_header_openssl_sub_dh.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979BB1851EF00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_dh.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_dh.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29BB1851EF00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E297633FE0A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_dherr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_dherr.h/openssl_header_openssl_sub_dherr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9797633FE0A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_dherr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_dherr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E297633FE0A00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A7F7A4DB00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_dsa.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_dsa.h/openssl_header_openssl_sub_dsa.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A7F7A4DB00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_dsa.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_dsa.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A7F7A4DB00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E298EA6B39E00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_dsaerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_dsaerr.h/openssl_header_openssl_sub_dsaerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9798EA6B39E00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_dsaerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_dsaerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E298EA6B39E00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E298B104A6300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_dtls1.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_dtls1.h/openssl_header_openssl_sub_dtls1.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9798B104A6300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_dtls1.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_dtls1.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E298B104A6300000000</string>
+			</array>
+		</dict>
+		<key>1DD70E299C4B0ADD00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_e_os2.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_e_os2.h/openssl_header_openssl_sub_e_os2.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9799C4B0ADD00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_e_os2.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_e_os2.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E299C4B0ADD00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2976953B4300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ebcdic.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ebcdic.h/openssl_header_openssl_sub_ebcdic.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97976953B4300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ebcdic.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ebcdic.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2976953B4300000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29BB18B38900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ec.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ec.h/openssl_header_openssl_sub_ec.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979BB18B38900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ec.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ec.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29BB18B38900000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2957D2874D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ecdh.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ecdh.h/openssl_header_openssl_sub_ecdh.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97957D2874D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ecdh.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ecdh.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2957D2874D00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A2841B3D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ecdsa.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ecdsa.h/openssl_header_openssl_sub_ecdsa.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A2841B3D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ecdsa.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ecdsa.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A2841B3D00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A291FE3000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ecerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ecerr.h/openssl_header_openssl_sub_ecerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A291FE3000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ecerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ecerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A291FE3000000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29F87C27AD00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_engine.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_engine.h/openssl_header_openssl_sub_engine.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979F87C27AD00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_engine.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_engine.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29F87C27AD00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E297B1A678C00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_engineerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_engineerr.h/openssl_header_openssl_sub_engineerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9797B1A678C00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_engineerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_engineerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E297B1A678C00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A80587CE00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_err.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_err.h/openssl_header_openssl_sub_err.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A80587CE00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_err.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_err.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A80587CE00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A80751C800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_evp.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_evp.h/openssl_header_openssl_sub_evp.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A80751C800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_evp.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_evp.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A80751C800000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29AED3439100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_evperr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_evperr.h/openssl_header_openssl_sub_evperr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979AED3439100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_evperr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_evperr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29AED3439100000000</string>
+			</array>
+		</dict>
+		<key>1DD70E295D7C8C5200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_hmac.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_hmac.h/openssl_header_openssl_sub_hmac.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9795D7C8C5200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_hmac.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_hmac.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E295D7C8C5200000000</string>
+			</array>
+		</dict>
+		<key>1DD70E295EB45B6200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_idea.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_idea.h/openssl_header_openssl_sub_idea.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9795EB45B6200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_idea.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_idea.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E295EB45B6200000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A8538A9600000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_kdf.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_kdf.h/openssl_header_openssl_sub_kdf.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A8538A9600000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_kdf.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_kdf.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A8538A9600000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2954D9B00300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_kdferr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_kdferr.h/openssl_header_openssl_sub_kdferr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97954D9B00300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_kdferr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_kdferr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2954D9B00300000000</string>
+			</array>
+		</dict>
+		<key>1DD70E291D2DC8E300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_lhash.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_lhash.h/openssl_header_openssl_sub_lhash.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9791D2DC8E300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_lhash.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_lhash.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E291D2DC8E300000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A86EF66400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_md2.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_md2.h/openssl_header_openssl_sub_md2.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A86EF66400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_md2.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_md2.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A86EF66400000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A86EFDE600000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_md4.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_md4.h/openssl_header_openssl_sub_md4.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A86EFDE600000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_md4.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_md4.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A86EFDE600000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A86F01A700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_md5.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_md5.h/openssl_header_openssl_sub_md5.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A86F01A700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_md5.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_md5.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A86F01A700000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29658624B100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_mdc2.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_mdc2.h/openssl_header_openssl_sub_mdc2.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979658624B100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_mdc2.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_mdc2.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29658624B100000000</string>
+			</array>
+		</dict>
+		<key>1DD70E295E2A031900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_modes.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_modes.h/openssl_header_openssl_sub_modes.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9795E2A031900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_modes.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_modes.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E295E2A031900000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2990BA1C7000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_obj_mac.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_obj_mac.h/openssl_header_openssl_sub_obj_mac.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97990BA1C7000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_obj_mac.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_obj_mac.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2990BA1C7000000000</string>
+			</array>
+		</dict>
+		<key>1DD70E299A73243D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_objects.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_objects.h/openssl_header_openssl_sub_objects.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9799A73243D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_objects.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_objects.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E299A73243D00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29803360FC00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_objectserr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_objectserr.h/openssl_header_openssl_sub_objectserr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979803360FC00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_objectserr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_objectserr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29803360FC00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2968E9ED1C00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ocsp.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ocsp.h/openssl_header_openssl_sub_ocsp.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97968E9ED1C00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ocsp.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ocsp.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2968E9ED1C00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29F14CF7BD00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ocsperr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ocsperr.h/openssl_header_openssl_sub_ocsperr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979F14CF7BD00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ocsperr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ocsperr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29F14CF7BD00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2906926CCF00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_opensslconf.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_opensslconf.h/openssl_header_openssl_sub_opensslconf.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97906926CCF00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_opensslconf.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_opensslconf.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2906926CCF00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29BF9EF5DF00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_opensslv.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_opensslv.h/openssl_header_openssl_sub_opensslv.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979BF9EF5DF00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_opensslv.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_opensslv.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29BF9EF5DF00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E299EE33DF400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ossl_typ.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ossl_typ.h/openssl_header_openssl_sub_ossl_typ.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9799EE33DF400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ossl_typ.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ossl_typ.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E299EE33DF400000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A89A8EC100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pem.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pem.h/openssl_header_openssl_sub_pem.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A89A8EC100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pem.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pem.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A89A8EC100000000</string>
+			</array>
+		</dict>
+		<key>1DD70E296AB751C500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pem2.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pem2.h/openssl_header_openssl_sub_pem2.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9796AB751C500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pem2.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pem2.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E296AB751C500000000</string>
+			</array>
+		</dict>
+		<key>1DD70E299D17B7F800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pemerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pemerr.h/openssl_header_openssl_sub_pemerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9799D17B7F800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pemerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pemerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E299D17B7F800000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29CA1371F700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pkcs12.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pkcs12.h/openssl_header_openssl_sub_pkcs12.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979CA1371F700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pkcs12.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pkcs12.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29CA1371F700000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29CFE8810200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pkcs12err.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pkcs12err.h/openssl_header_openssl_sub_pkcs12err.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979CFE8810200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pkcs12err.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pkcs12err.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29CFE8810200000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29F600B6D500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pkcs7.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pkcs7.h/openssl_header_openssl_sub_pkcs7.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979F600B6D500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pkcs7.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pkcs7.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29F600B6D500000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A029A76400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pkcs7err.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pkcs7err.h/openssl_header_openssl_sub_pkcs7err.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A029A76400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_pkcs7err.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_pkcs7err.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A029A76400000000</string>
+			</array>
+		</dict>
+		<key>1DD70E296DE9D51000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rand.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rand.h/openssl_header_openssl_sub_rand.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9796DE9D51000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rand.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rand.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E296DE9D51000000000</string>
+			</array>
+		</dict>
+		<key>1DD70E298EF3565600000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rand_drbg.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rand_drbg.h/openssl_header_openssl_sub_rand_drbg.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9798EF3565600000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rand_drbg.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rand_drbg.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E298EF3565600000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29C15E9B4900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_randerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_randerr.h/openssl_header_openssl_sub_randerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979C15E9B4900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_randerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_randerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29C15E9B4900000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A8B4F78A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rc2.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rc2.h/openssl_header_openssl_sub_rc2.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A8B4F78A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rc2.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rc2.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A8B4F78A00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A8B4FF0C00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rc4.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rc4.h/openssl_header_openssl_sub_rc4.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A8B4FF0C00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rc4.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rc4.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A8B4FF0C00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A8B502CD00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rc5.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rc5.h/openssl_header_openssl_sub_rc5.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A8B502CD00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rc5.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rc5.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A8B502CD00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29458F0E2E00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ripemd.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ripemd.h/openssl_header_openssl_sub_ripemd.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979458F0E2E00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ripemd.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ripemd.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29458F0E2E00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A8BCEDE900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rsa.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rsa.h/openssl_header_openssl_sub_rsa.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A8BCEDE900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rsa.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rsa.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A8BCEDE900000000</string>
+			</array>
+		</dict>
+		<key>1DD70E293CF727D000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rsaerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rsaerr.h/openssl_header_openssl_sub_rsaerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9793CF727D000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_rsaerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_rsaerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E293CF727D000000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2925F0DCC400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_safestack.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_safestack.h/openssl_header_openssl_sub_safestack.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97925F0DCC400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_safestack.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_safestack.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2925F0DCC400000000</string>
+			</array>
+		</dict>
+		<key>1DD70E296FD2F45C00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_seed.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_seed.h/openssl_header_openssl_sub_seed.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9796FD2F45C00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_seed.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_seed.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E296FD2F45C00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A8C6055500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_sha.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_sha.h/openssl_header_openssl_sub_sha.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A8C6055500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_sha.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_sha.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A8C6055500000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A8CAC95A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_srp.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_srp.h/openssl_header_openssl_sub_srp.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A8CAC95A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_srp.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_srp.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A8CAC95A00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E297091248600000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_srtp.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_srtp.h/openssl_header_openssl_sub_srtp.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9797091248600000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_srtp.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_srtp.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E297091248600000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A8CB2EB500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ssl.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ssl.h/openssl_header_openssl_sub_ssl.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A8CB2EB500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ssl.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ssl.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A8CB2EB500000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29709AB05100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ssl2.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ssl2.h/openssl_header_openssl_sub_ssl2.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979709AB05100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ssl2.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ssl2.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29709AB05100000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29709AB41200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ssl3.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ssl3.h/openssl_header_openssl_sub_ssl3.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979709AB41200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ssl3.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ssl3.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29709AB41200000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29B79DA38400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_sslerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_sslerr.h/openssl_header_openssl_sub_sslerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979B79DA38400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_sslerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_sslerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29B79DA38400000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A3EC547100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_stack.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_stack.h/openssl_header_openssl_sub_stack.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A3EC547100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_stack.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_stack.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A3EC547100000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A4B8588A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_store.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_store.h/openssl_header_openssl_sub_store.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A4B8588A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_store.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_store.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A4B8588A00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29AB94AD8F00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_storeerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_storeerr.h/openssl_header_openssl_sub_storeerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979AB94AD8F00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_storeerr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_storeerr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29AB94AD8F00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A93771F600000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_symhacks.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_symhacks.h/openssl_header_openssl_sub_symhacks.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A93771F600000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_symhacks.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_symhacks.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A93771F600000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2971F00F4100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_tls1.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_tls1.h/openssl_header_openssl_sub_tls1.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97971F00F4100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_tls1.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_tls1.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2971F00F4100000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29BB1FC12A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ts.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ts.h/openssl_header_openssl_sub_ts.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979BB1FC12A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ts.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ts.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29BB1FC12A00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29D75D00EF00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_tserr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_tserr.h/openssl_header_openssl_sub_tserr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979D75D00EF00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_tserr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_tserr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29D75D00EF00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E293549975800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_txt_db.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_txt_db.h/openssl_header_openssl_sub_txt_db.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9793549975800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_txt_db.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_txt_db.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E293549975800000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29BB200FFF00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ui.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ui.h/openssl_header_openssl_sub_ui.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979BB200FFF00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_ui.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_ui.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29BB200FFF00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29FB32C5FA00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_uierr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_uierr.h/openssl_header_openssl_sub_uierr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979FB32C5FA00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_uierr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_uierr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29FB32C5FA00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E299714275200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_whrlpool.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_whrlpool.h/openssl_header_openssl_sub_whrlpool.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9799714275200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_whrlpool.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_whrlpool.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E299714275200000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29759E0E3100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_x509.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_x509.h/openssl_header_openssl_sub_x509.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979759E0E3100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_x509.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_x509.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29759E0E3100000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29932C773B00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_x509_vfy.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_x509_vfy.h/openssl_header_openssl_sub_x509_vfy.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979932C773B00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_x509_vfy.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_x509_vfy.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29932C773B00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E294722C28800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_x509err.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_x509err.h/openssl_header_openssl_sub_x509err.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9794722C28800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_x509err.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_x509err.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E294722C28800000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2986733FAE00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_x509v3.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_x509v3.h/openssl_header_openssl_sub_x509v3.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97986733FAE00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_x509v3.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_x509v3.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2986733FAE00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2920ACC3EB00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_x509v3err.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_x509v3err.h/openssl_header_openssl_sub_x509v3err.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97920ACC3EB00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl_header_openssl_sub_x509v3err.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/openssl/openssl_header_openssl_sub_x509v3err.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2920ACC3EB00000000</string>
+			</array>
+		</dict>
+		<key>B401C979EAB5339800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>Sources</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>B401C979A7C744B800000000</string>
+				<string>B401C97951E45A2000000000</string>
+				<string>B401C97909FBC7B000000000</string>
+				<string>B401C979DFA13C3900000000</string>
+				<string>B401C979EAA7EA0800000000</string>
+				<string>B401C979EB5E676500000000</string>
+				<string>B401C97921EF6CD400000000</string>
+				<string>B401C979A7D71EB100000000</string>
+				<string>B401C979C5C9E20800000000</string>
+				<string>B401C979DAFD603500000000</string>
+				<string>B401C979BB177FB700000000</string>
+				<string>B401C97916A49B4200000000</string>
+				<string>B401C97931413A2B00000000</string>
+				<string>B401C979D89D5C4E00000000</string>
+				<string>B401C979F2C63C3900000000</string>
+				<string>B401C9795453A5AA00000000</string>
+				<string>B401C97954F4513700000000</string>
+				<string>B401C979A7E716B200000000</string>
+				<string>B401C97908175E6700000000</string>
+				<string>B401C9795516257A00000000</string>
+				<string>B401C9799F407A9F00000000</string>
+				<string>B401C9795516744F00000000</string>
+				<string>B401C9799485006A00000000</string>
+				<string>B401C979C3163FAA00000000</string>
+				<string>B401C9791B6F7A6C00000000</string>
+				<string>B401C979B4E4A86D00000000</string>
+				<string>B401C979BB180A9C00000000</string>
+				<string>B401C97955C7EA3D00000000</string>
+				<string>B401C979A7F18B3B00000000</string>
+				<string>B401C979BB1851EF00000000</string>
+				<string>B401C9797633FE0A00000000</string>
+				<string>B401C979A7F7A4DB00000000</string>
+				<string>B401C9798EA6B39E00000000</string>
+				<string>B401C9798B104A6300000000</string>
+				<string>B401C9799C4B0ADD00000000</string>
+				<string>B401C97976953B4300000000</string>
+				<string>B401C979BB18B38900000000</string>
+				<string>B401C97957D2874D00000000</string>
+				<string>B401C979A2841B3D00000000</string>
+				<string>B401C979A291FE3000000000</string>
+				<string>B401C979F87C27AD00000000</string>
+				<string>B401C9797B1A678C00000000</string>
+				<string>B401C979A80587CE00000000</string>
+				<string>B401C979A80751C800000000</string>
+				<string>B401C979AED3439100000000</string>
+				<string>B401C9795D7C8C5200000000</string>
+				<string>B401C9795EB45B6200000000</string>
+				<string>B401C979A8538A9600000000</string>
+				<string>B401C97954D9B00300000000</string>
+				<string>B401C9791D2DC8E300000000</string>
+				<string>B401C979A86EF66400000000</string>
+				<string>B401C979A86EFDE600000000</string>
+				<string>B401C979A86F01A700000000</string>
+				<string>B401C979658624B100000000</string>
+				<string>B401C9795E2A031900000000</string>
+				<string>B401C97990BA1C7000000000</string>
+				<string>B401C9799A73243D00000000</string>
+				<string>B401C979803360FC00000000</string>
+				<string>B401C97968E9ED1C00000000</string>
+				<string>B401C979F14CF7BD00000000</string>
+				<string>B401C97906926CCF00000000</string>
+				<string>B401C979BF9EF5DF00000000</string>
+				<string>B401C9799EE33DF400000000</string>
+				<string>B401C979A89A8EC100000000</string>
+				<string>B401C9796AB751C500000000</string>
+				<string>B401C9799D17B7F800000000</string>
+				<string>B401C979CA1371F700000000</string>
+				<string>B401C979CFE8810200000000</string>
+				<string>B401C979F600B6D500000000</string>
+				<string>B401C979A029A76400000000</string>
+				<string>B401C9796DE9D51000000000</string>
+				<string>B401C9798EF3565600000000</string>
+				<string>B401C979C15E9B4900000000</string>
+				<string>B401C979A8B4F78A00000000</string>
+				<string>B401C979A8B4FF0C00000000</string>
+				<string>B401C979A8B502CD00000000</string>
+				<string>B401C979458F0E2E00000000</string>
+				<string>B401C979A8BCEDE900000000</string>
+				<string>B401C9793CF727D000000000</string>
+				<string>B401C97925F0DCC400000000</string>
+				<string>B401C9796FD2F45C00000000</string>
+				<string>B401C979A8C6055500000000</string>
+				<string>B401C979A8CAC95A00000000</string>
+				<string>B401C9797091248600000000</string>
+				<string>B401C979A8CB2EB500000000</string>
+				<string>B401C979709AB05100000000</string>
+				<string>B401C979709AB41200000000</string>
+				<string>B401C979B79DA38400000000</string>
+				<string>B401C979A3EC547100000000</string>
+				<string>B401C979A4B8588A00000000</string>
+				<string>B401C979AB94AD8F00000000</string>
+				<string>B401C979A93771F600000000</string>
+				<string>B401C97971F00F4100000000</string>
+				<string>B401C979BB1FC12A00000000</string>
+				<string>B401C979D75D00EF00000000</string>
+				<string>B401C9793549975800000000</string>
+				<string>B401C979BB200FFF00000000</string>
+				<string>B401C979FB32C5FA00000000</string>
+				<string>B401C9799714275200000000</string>
+				<string>B401C979759E0E3100000000</string>
+				<string>B401C979932C773B00000000</string>
+				<string>B401C9794722C28800000000</string>
+				<string>B401C97986733FAE00000000</string>
+				<string>B401C97920ACC3EB00000000</string>
+			</array>
+		</dict>
+		<key>B401C979B4B57B8200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>openssl</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29001F47FB00000000</string>
+				<string>B401C979EAB5339800000000</string>
+			</array>
+		</dict>
+		<key>B401C979EFB6AC4600000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>mainGroup</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>B401C979B781F65D00000000</string>
+				<string>B401C979048F8EF000000000</string>
+				<string>B401C979C806358400000000</string>
+				<string>B401C979B4B57B8200000000</string>
+			</array>
+		</dict>
+		<key>4952437303EDA63300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>XCBuildConfiguration</string>
+			<key>name</key>
+			<string>Debug</string>
+			<key>buildSettings</key>
+			<dict>
+			</dict>
+			<key>baseConfigurationReference</key>
+			<string>1DD70E29F2B988F300000000</string>
+		</dict>
+		<key>4952437350C7218900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>XCBuildConfiguration</string>
+			<key>name</key>
+			<string>Profile</string>
+			<key>buildSettings</key>
+			<dict>
+			</dict>
+			<key>baseConfigurationReference</key>
+			<string>1DD70E290F9DAF9D00000000</string>
+		</dict>
+		<key>49524373A439BFE700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>XCBuildConfiguration</string>
+			<key>name</key>
+			<string>Release</string>
+			<key>buildSettings</key>
+			<dict>
+			</dict>
+			<key>baseConfigurationReference</key>
+			<string>1DD70E2983345AFF00000000</string>
+		</dict>
+		<key>218C37090000000000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>XCConfigurationList</string>
+			<key>buildConfigurations</key>
+			<array>
+				<string>4952437303EDA63300000000</string>
+				<string>4952437350C7218900000000</string>
+				<string>49524373A439BFE700000000</string>
+			</array>
+			<key>defaultConfigurationIsVisible</key>
+			<false/>
+		</dict>
+		<key>E66DC04EB4B57B8200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXNativeTarget</string>
+			<key>name</key>
+			<string>openssl</string>
+			<key>productName</key>
+			<string>openssl</string>
+			<key>productReference</key>
+			<string>1DD70E2932210C1000000000</string>
+			<key>productType</key>
+			<string>com.apple.product-type.library.static</string>
+			<key>dependencies</key>
+			<array>
+			</array>
+			<key>buildPhases</key>
+			<array>
+			</array>
+			<key>buildConfigurationList</key>
+			<string>218C37090000000000000000</string>
+		</dict>
+		<key>4952437303EDA63300000001</key>
+		<dict>
+			<key>isa</key>
+			<string>XCBuildConfiguration</string>
+			<key>name</key>
+			<string>Debug</string>
+			<key>buildSettings</key>
+			<dict>
+			</dict>
+		</dict>
+		<key>4952437350C7218900000001</key>
+		<dict>
+			<key>isa</key>
+			<string>XCBuildConfiguration</string>
+			<key>name</key>
+			<string>Profile</string>
+			<key>buildSettings</key>
+			<dict>
+			</dict>
+		</dict>
+		<key>49524373A439BFE700000001</key>
+		<dict>
+			<key>isa</key>
+			<string>XCBuildConfiguration</string>
+			<key>name</key>
+			<string>Release</string>
+			<key>buildSettings</key>
+			<dict>
+			</dict>
+		</dict>
+		<key>218C37090000000000000001</key>
+		<dict>
+			<key>isa</key>
+			<string>XCConfigurationList</string>
+			<key>buildConfigurations</key>
+			<array>
+				<string>4952437303EDA63300000001</string>
+				<string>4952437350C7218900000001</string>
+				<string>49524373A439BFE700000001</string>
+			</array>
+			<key>defaultConfigurationIsVisible</key>
+			<false/>
+		</dict>
+		<key>96C84793B4B57B8200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXProject</string>
+			<key>mainGroup</key>
+			<string>B401C979EFB6AC4600000000</string>
+			<key>targets</key>
+			<array>
+				<string>E66DC04EB4B57B8200000000</string>
+			</array>
+			<key>buildConfigurationList</key>
+			<string>218C37090000000000000001</string>
+			<key>compatibilityVersion</key>
+			<string>Xcode 3.2</string>
+			<key>attributes</key>
+			<dict>
+				<key>LastUpgradeCheck</key>
+				<string>9999</string>
+			</dict>
+		</dict>
+	</dict>
+	<key>rootObject</key>
+	<string>96C84793B4B57B8200000000</string>
+</dict>
+</plist>
\ No newline at end of file
diff --git a/submodules/openssl/openssl.xcodeproj/xcshareddata/xcschemes/openssl.xcscheme b/submodules/openssl/openssl.xcodeproj/xcshareddata/xcschemes/openssl.xcscheme
new file mode 100644
index 0000000000..df0794edce
--- /dev/null
+++ b/submodules/openssl/openssl.xcodeproj/xcshareddata/xcschemes/openssl.xcscheme
@@ -0,0 +1 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?><Scheme LastUpgradeVersion="9999" version="1.7"><BuildAction buildImplicitDependencies="YES" parallelizeBuildables="YES"><BuildActionEntries><BuildActionEntry buildForAnalyzing="YES" buildForArchiving="YES" buildForProfiling="YES" buildForRunning="YES" buildForTesting="YES"><BuildableReference BlueprintIdentifier="E66DC04EB4B57B8200000000" BlueprintName="openssl" BuildableIdentifier="primary" BuildableName="libopenssl.a" ReferencedContainer="container:openssl.xcodeproj"/></BuildActionEntry></BuildActionEntries></BuildAction><TestAction buildConfiguration="Debug" shouldUseLaunchSchemeArgsEnv="YES"><Testables/></TestAction><LaunchAction buildConfiguration="Debug"/><ProfileAction buildConfiguration="Release"/><AnalyzeAction buildConfiguration="Debug"/><ArchiveAction buildConfiguration="Release" revealArchiveInOrganizer="YES"/></Scheme>
\ No newline at end of file
diff --git a/submodules/openssl/pack-openssl.sh b/submodules/openssl/pack-openssl.sh
new file mode 100644
index 0000000000..5b1c632dd2
--- /dev/null
+++ b/submodules/openssl/pack-openssl.sh
@@ -0,0 +1,16 @@
+#!/bin/bash
+
+set -e
+set -x
+
+OUT_DIR="$1"
+INCLUDE_DIR="$2"
+shift
+shift
+LIBS="$@"
+
+mkdir -p "$OUT_DIR/lib"
+
+/usr/bin/lipo $LIBS -output "$OUT_DIR/lib/libcrypto.a" -create
+cp -r "$INCLUDE_DIR" "$OUT_DIR/"
+
diff --git a/submodules/openssl/patch-conf.patch b/submodules/openssl/patch-conf.patch
new file mode 100644
index 0000000000..385a800c7a
--- /dev/null
+++ b/submodules/openssl/patch-conf.patch
@@ -0,0 +1,17 @@
+diff --git a/Configurations/10-main.conf b/Configurations/10-main.conf
+--- a/Configurations/10-main.conf
++++ b/Configurations/10-main.conf
+@@ -1640,6 +1640,13 @@ my %targets = (
+         sys_id           => "VXWORKS",
+         lflags           => add("-r"),
+     },
++    "ios64sim-cross" => {
++        inherit_from     => [ "darwin-common", asm("no_asm") ],
++        cflags           => add("-arch x86_64 -DOPENSSL_NO_ASM -mios-version-min=8.0.0 -isysroot \$(CROSS_TOP)/SDKs/\$(CROSS_SDK) -fno-common"),
++        sys_id           => "iOS",
++        bn_ops           => "SIXTY_FOUR_BIT_LONG RC4_CHAR",
++        perlasm_scheme   => "ios64",
++    },
+     "vxworks-simlinux" => {
+         inherit_from     => [ "BASE_unix" ],
+         CC               => "ccpentium",
diff --git a/submodules/openssl/patch-include.patch b/submodules/openssl/patch-include.patch
new file mode 100644
index 0000000000..3b177feac6
--- /dev/null
+++ b/submodules/openssl/patch-include.patch
@@ -0,0 +1,28 @@
+--- armv7s/include/openssl/opensslconf.h	2017-01-08 02:25:43.000000000 -0800
++++ arm64/include/openssl/opensslconf.h	2017-01-08 03:44:44.000000000 -0800
+@@ -158,11 +158,21 @@
+  * The following are cipher-specific, but are part of the public API.
+  */
+ #if !defined(OPENSSL_SYS_UEFI)
+-# define BN_LLONG
++# ifdef __LP64__
++#  undef BN_LLONG
++# else
++#  define BN_LLONG
++# endif
+ /* Only one for the following should be defined */
+-# undef SIXTY_FOUR_BIT_LONG
+-# undef SIXTY_FOUR_BIT
+-# define THIRTY_TWO_BIT
++# ifdef __LP64__
++#  define SIXTY_FOUR_BIT_LONG
++#  undef SIXTY_FOUR_BIT
++#  undef THIRTY_TWO_BIT
++# else
++#  undef SIXTY_FOUR_BIT_LONG
++#  undef SIXTY_FOUR_BIT
++#  define THIRTY_TWO_BIT
++# endif
+ #endif
+ 
+ #define RC4_INT unsigned char
diff --git a/submodules/ton/BUCK b/submodules/ton/BUCK
new file mode 100644
index 0000000000..9ddff5e11f
--- /dev/null
+++ b/submodules/ton/BUCK
@@ -0,0 +1,73 @@
+load("//Config:buck_rule_macros.bzl", "static_library", "gen_header_targets")
+
+ton_header_paths = [
+    "auto/tl/tonlib_api.h",
+    "tl/TlObject.h",
+    "tonlib/tonlib_client_json.h",
+    "tonlib/tonlibjson_export.h",
+    "tonlib/Client.h",
+    "td/utils/Slice-decl.h",
+    "td/utils/config.h",
+    "td/utils/SharedSlice.h",
+    "td/utils/Slice.h",
+    "td/utils/int_types.h",
+    "td/utils/common.h",
+    "td/utils/check.h",
+    "td/utils/unique_ptr.h",
+    "td/utils/port/platform.h",
+]
+
+ton_lib_names = [
+    "adnllite",
+    "crc32c",
+    "keys",
+    "lite-client-common",
+    "tdactor",
+    "tddb",
+    "tdnet",
+    "tdutils",
+    "tl-lite-utils",
+    "tl-utils",
+    "tl_api",
+    "tl_lite_api",
+    "tl_tonlib_api",
+    "ton_block",
+    "ton_crypto",
+    "tonlib",
+]
+
+ton_lib_flags = ["-l" + name for name in ton_lib_names]
+
+genrule(
+    name = "ton_build",
+    srcs = [
+        "build-ton.sh",
+        "tonlib-src",
+        "iOS.cmake"
+    ],
+    bash = "sh $SRCDIR/build-ton.sh $OUT $SRCDIR $(location //submodules/openssl:openssl_build_merged)",
+    out = "ton",
+    visibility = [
+        "//submodules/ton:...",
+    ]
+)
+
+ton_header_targets = gen_header_targets(ton_header_paths, "ton_header_", "", "ton_build", "build/out/include")
+
+apple_library(
+    name = "ton",
+    visibility = [
+        "PUBLIC",
+    ],
+    exported_headers = ton_header_targets,
+    linker_flags = [
+        "-L$(location :ton_build)/build/out/lib",
+    ] + ton_lib_flags,
+    exported_linker_flags = [
+        "-L$(location :ton_build)/build/out/lib",
+        "-lcrypto",
+    ] + ton_lib_flags,
+    deps = [
+        ":ton_build"
+    ],
+)
diff --git a/submodules/ton/build-ton.sh b/submodules/ton/build-ton.sh
new file mode 100755
index 0000000000..1de7b17d9d
--- /dev/null
+++ b/submodules/ton/build-ton.sh
@@ -0,0 +1,76 @@
+#/bin/sh
+
+set -x
+set -e
+
+OUT_DIR="$1"
+SOURCE_DIR="$2"
+openssl_base_path="$3"
+
+if [ -z "$openssl_base_path" ]; then
+  echo "Usage: sh build-ton.sh path/to/openssl"
+  exit 1
+fi
+
+if [ ! -d "$openssl_base_path" ]; then
+  echo "$openssl_base_path not found"
+  exit 1
+fi
+
+ARCHIVE_PATH="$SOURCE_DIR/tonlib.zip"
+td_path="$SOURCE_DIR/tonlib-src"
+TOOLCHAIN="$SOURCE_DIR/iOS.cmake"
+
+mkdir -p "$OUT_DIR"
+mkdir -p "$OUT_DIR/build"
+cd "$OUT_DIR/build"
+
+platforms="iOS"
+for platform in $platforms; do
+  openssl_path="$openssl_base_path"
+  echo "OpenSSL path = ${openssl_path}"
+  openssl_crypto_library="${openssl_path}/lib/libcrypto.a"
+  openssl_ssl_library="${openssl_path}/lib/libssl.a"
+  options="$options -DOPENSSL_FOUND=1"
+  options="$options -DOPENSSL_CRYPTO_LIBRARY=${openssl_crypto_library}"
+  options="$options -DOPENSSL_INCLUDE_DIR=${openssl_path}/include"
+  options="$options -DOPENSSL_LIBRARIES=${openssl_crypto_library}"
+  options="$options -DCMAKE_BUILD_TYPE=Release"
+  if [[ $skip_build = "" ]]; then
+    simulators="0 1"
+  else
+    simulators=""
+  fi
+  for simulator in $simulators;
+  do
+    build="build-${platform}"
+    install="install-${platform}"
+    if [[ $simulator = "1" ]]; then
+      build="${build}-simulator"
+      install="${install}-simulator"
+      ios_platform="SIMULATOR"
+    else
+      ios_platform="OS"
+    fi
+    echo "Platform = ${platform} Simulator = ${simulator}"
+    echo $ios_platform
+    rm -rf $build
+    mkdir -p $build
+    mkdir -p $install
+    cd $build
+    cmake $td_path $options -DCMAKE_TOOLCHAIN_FILE="$TOOLCHAIN" -DIOS_PLATFORM=${ios_platform} -DTON_ARCH= -DCMAKE_INSTALL_PREFIX=../${install}
+    CORE_COUNT=`sysctl -n hw.logicalcpu`
+    make -j$CORE_COUNT install || exit
+    cd ..
+  done
+  mkdir -p $platform
+
+  mkdir -p "out"
+  cp -r "install-iOS/include" "out/"
+  mkdir -p "out/lib"
+
+  for f in install-iOS/lib/*.a; do
+    lib_name=$(basename "$f")
+    lipo -create "install-iOS/lib/$lib_name" "install-iOS-simulator/lib/$lib_name" -o "out/lib/$lib_name"
+  done
+done
diff --git a/submodules/ton/iOS.cmake b/submodules/ton/iOS.cmake
new file mode 100644
index 0000000000..cc344484e3
--- /dev/null
+++ b/submodules/ton/iOS.cmake
@@ -0,0 +1,250 @@
+# This file is based off of the Platform/Darwin.cmake and Platform/UnixPaths.cmake
+# files which are included with CMake 2.8.4
+# It has been altered for iOS development
+
+# Options:
+#
+# IOS_PLATFORM = OS (default) or SIMULATOR
+#   This decides if SDKS will be selected from the iPhoneOS.platform or iPhoneSimulator.platform folders
+#   OS - the default, used to build for iPhone and iPad physical devices, which have an arm arch.
+#   SIMULATOR - used to build for the Simulator platforms, which have an x86 arch.
+#
+# CMAKE_IOS_DEVELOPER_ROOT = automatic(default) or /path/to/platform/Developer folder
+#   By default this location is automatcially chosen based on the IOS_PLATFORM value above.
+#   If set manually, it will override the default location and force the user of a particular Developer Platform
+#
+# CMAKE_IOS_SDK_ROOT = automatic(default) or /path/to/platform/Developer/SDKs/SDK folder
+#   By default this location is automatcially chosen based on the CMAKE_IOS_DEVELOPER_ROOT value.
+#   In this case it will always be the most up-to-date SDK found in the CMAKE_IOS_DEVELOPER_ROOT path.
+#   If set manually, this will force the use of a specific SDK version
+
+# Macros:
+#
+# set_xcode_property (TARGET XCODE_PROPERTY XCODE_VALUE)
+#  A convenience macro for setting xcode specific properties on targets
+#  example: set_xcode_property (myioslib IPHONEOS_DEPLOYMENT_TARGET "3.1")
+#
+# find_host_package (PROGRAM ARGS)
+#  A macro used to find executable programs on the host system, not within the iOS environment.
+#  Thanks to the android-cmake project for providing the command
+
+# Standard settings
+set (CMAKE_SYSTEM_NAME Darwin)
+set (CMAKE_SYSTEM_VERSION 1)
+set (UNIX True)
+set (APPLE True)
+set (IOS True)
+
+# Required as of cmake 2.8.10
+set (CMAKE_OSX_DEPLOYMENT_TARGET "" CACHE STRING "Force unset of the deployment target for iOS" FORCE)
+
+# Determine the cmake host system version so we know where to find the iOS SDKs
+find_program (CMAKE_UNAME uname /bin /usr/bin /usr/local/bin)
+if (CMAKE_UNAME)
+    exec_program(uname ARGS -r OUTPUT_VARIABLE CMAKE_HOST_SYSTEM_VERSION)
+    string (REGEX REPLACE "^([0-9]+)\\.([0-9]+).*$" "\\1" DARWIN_MAJOR_VERSION "${CMAKE_HOST_SYSTEM_VERSION}")
+endif (CMAKE_UNAME)
+
+# Force the compilers to gcc for iOS
+set (CMAKE_C_COMPILER /usr/bin/gcc)
+set (CMAKE_CXX_COMPILER /usr/bin/g++)
+set(CMAKE_AR ar CACHE FILEPATH "" FORCE)
+set(CMAKE_RANLIB ranlib CACHE FILEPATH "" FORCE)
+set(PKG_CONFIG_EXECUTABLE pkg-config CACHE FILEPATH "" FORCE)
+
+# Setup iOS platform unless specified manually with IOS_PLATFORM
+if (NOT DEFINED IOS_PLATFORM)
+    set (IOS_PLATFORM "OS")
+endif (NOT DEFINED IOS_PLATFORM)
+set (IOS_PLATFORM ${IOS_PLATFORM} CACHE STRING "Type of iOS Platform")
+
+# Check the platform selection and setup for developer root
+if (${IOS_PLATFORM} STREQUAL "OS")
+    set (IOS_PLATFORM_LOCATION "iPhoneOS.platform")
+    set (XCODE_IOS_PLATFORM iphoneos)
+
+    # This causes the installers to properly locate the output libraries
+    set (CMAKE_XCODE_EFFECTIVE_PLATFORMS "-iphoneos")
+
+    set (APPLE_IOS True)
+elseif (${IOS_PLATFORM} STREQUAL "SIMULATOR")
+    set (SIMULATOR_FLAG true)
+    set (IOS_PLATFORM_LOCATION "iPhoneSimulator.platform")
+    set (XCODE_IOS_PLATFORM iphonesimulator)
+
+    # This causes the installers to properly locate the output libraries
+    set (CMAKE_XCODE_EFFECTIVE_PLATFORMS "-iphonesimulator")
+
+    set (APPLE_IOS True)
+elseif (${IOS_PLATFORM} STREQUAL "WATCHOS")
+    set (IOS_PLATFORM_LOCATION "WatchOS.platform")
+    set (XCODE_IOS_PLATFORM watchos)
+
+    # This causes the installers to properly locate the output libraries
+    set (CMAKE_XCODE_EFFECTIVE_PLATFORMS "-watchos")
+
+    set (APPLE_WATCH True)
+elseif (${IOS_PLATFORM} STREQUAL "WATCHSIMULATOR")
+    set (SIMULATOR_FLAG true)
+    set (IOS_PLATFORM_LOCATION "WatchSimulator.platform")
+    set (XCODE_IOS_PLATFORM watchsimulator)
+
+    # This causes the installers to properly locate the output libraries
+    set (CMAKE_XCODE_EFFECTIVE_PLATFORMS "-watchsimulator")
+
+    set (APPLE_WATCH True)
+elseif (${IOS_PLATFORM} STREQUAL "TVOS")
+    set (IOS_PLATFORM_LOCATION "AppleTvOS.platform")
+    set (XCODE_IOS_PLATFORM tvos)
+
+    # This causes the installers to properly locate the output libraries
+    set (CMAKE_XCODE_EFFECTIVE_PLATFORMS "-appletvos")
+
+    set (APPLE_TV True)
+elseif (${IOS_PLATFORM} STREQUAL "TVSIMULATOR")
+    set (SIMULATOR_FLAG true)
+    set (IOS_PLATFORM_LOCATION "AppleTvSimulator.platform")
+    set (XCODE_IOS_PLATFORM tvsimulator)
+
+    # This causes the installers to properly locate the output libraries
+    set (CMAKE_XCODE_EFFECTIVE_PLATFORMS "-tvsimulator")
+
+    set (APPLE_TV True)
+else (${IOS_PLATFORM} STREQUAL "OS")
+    message (FATAL_ERROR "Unsupported IOS_PLATFORM value selected. Please choose OS, SIMULATOR, or WATCHOS.")
+endif ()
+
+# All iOS/Darwin specific settings - some may be redundant
+set (CMAKE_SHARED_LIBRARY_PREFIX "lib")
+set (CMAKE_SHARED_LIBRARY_SUFFIX ".dylib")
+set (CMAKE_SHARED_MODULE_PREFIX "lib")
+set (CMAKE_SHARED_MODULE_SUFFIX ".so")
+set (CMAKE_MODULE_EXISTS 1)
+set (CMAKE_DL_LIBS "")
+
+set (CMAKE_C_OSX_COMPATIBILITY_VERSION_FLAG "-compatibility_version ")
+set (CMAKE_C_OSX_CURRENT_VERSION_FLAG "-current_version ")
+set (CMAKE_CXX_OSX_COMPATIBILITY_VERSION_FLAG "${CMAKE_C_OSX_COMPATIBILITY_VERSION_FLAG}")
+set (CMAKE_CXX_OSX_CURRENT_VERSION_FLAG "${CMAKE_C_OSX_CURRENT_VERSION_FLAG}")
+
+if (IOS_DEPLOYMENT_TARGET)
+    set (XCODE_IOS_PLATFORM_VERSION_FLAGS "-m${XCODE_IOS_PLATFORM}-version-min=${IOS_DEPLOYMENT_TARGET}")
+endif()
+
+set (CMAKE_SHARED_LINKER_FLAGS_INIT "-fapplication-extension")
+#if (NOT SIMULATOR_FLAG)
+#    set (BITCODE "-fembed-bitcode")
+#endif()
+set (CMAKE_C_FLAGS_INIT "${XCODE_IOS_PLATFORM_VERSION_FLAGS} ${BITCODE}")
+# Hidden visibilty is required for cxx on iOS
+set (CMAKE_CXX_FLAGS_INIT "${XCODE_IOS_PLATFORM_VERSION_FLAGS} ${BITCODE} -fvisibility-inlines-hidden")
+
+set (CMAKE_C_LINK_FLAGS   "${XCODE_IOS_PLATFORM_VERSION_FLAGS} -fapplication-extension -Wl,-search_paths_first ${CMAKE_C_LINK_FLAGS}")
+set (CMAKE_CXX_LINK_FLAGS "${XCODE_IOS_PLATFORM_VERSION_FLAGS} -fapplication-extension -Wl,-search_paths_first ${CMAKE_CXX_LINK_FLAGS}")
+
+set (CMAKE_PLATFORM_HAS_INSTALLNAME 1)
+set (CMAKE_SHARED_LIBRARY_CREATE_C_FLAGS "-dynamiclib -headerpad_max_install_names")
+set (CMAKE_SHARED_MODULE_CREATE_C_FLAGS "-bundle -headerpad_max_install_names")
+set (CMAKE_SHARED_MODULE_LOADER_C_FLAG "-Wl,-bundle_loader,")
+set (CMAKE_SHARED_MODULE_LOADER_CXX_FLAG "-Wl,-bundle_loader,")
+set (CMAKE_FIND_LIBRARY_SUFFIXES ".dylib" ".so" ".a")
+
+# hack: if a new cmake (which uses CMAKE_INSTALL_NAME_TOOL) runs on an old build tree
+# (where install_name_tool was hardcoded) and where CMAKE_INSTALL_NAME_TOOL isn't in the cache
+# and still cmake didn't fail in CMakeFindBinUtils.cmake (because it isn't rerun)
+# hardcode CMAKE_INSTALL_NAME_TOOL here to install_name_tool, so it behaves as it did before, Alex
+if (NOT DEFINED CMAKE_INSTALL_NAME_TOOL)
+    find_program(CMAKE_INSTALL_NAME_TOOL install_name_tool)
+endif (NOT DEFINED CMAKE_INSTALL_NAME_TOOL)
+
+# Setup iOS deployment target
+set (IOS_DEPLOYMENT_TARGET ${IOS_DEPLOYMENT_TARGET} CACHE STRING "Minimum iOS version")
+
+# Setup iOS developer location unless specified manually with CMAKE_IOS_DEVELOPER_ROOT
+# Note Xcode 4.3 changed the installation location, choose the most recent one available
+exec_program(/usr/bin/xcode-select ARGS -print-path OUTPUT_VARIABLE CMAKE_XCODE_DEVELOPER_DIR)
+set (XCODE_POST_43_ROOT "${CMAKE_XCODE_DEVELOPER_DIR}/Platforms/${IOS_PLATFORM_LOCATION}/Developer")
+set (XCODE_PRE_43_ROOT "/Developer/Platforms/${IOS_PLATFORM_LOCATION}/Developer")
+if (NOT DEFINED CMAKE_IOS_DEVELOPER_ROOT)
+    if (EXISTS ${XCODE_POST_43_ROOT})
+        set (CMAKE_IOS_DEVELOPER_ROOT ${XCODE_POST_43_ROOT})
+    elseif(EXISTS ${XCODE_PRE_43_ROOT})
+        set (CMAKE_IOS_DEVELOPER_ROOT ${XCODE_PRE_43_ROOT})
+    endif (EXISTS ${XCODE_POST_43_ROOT})
+endif (NOT DEFINED CMAKE_IOS_DEVELOPER_ROOT)
+set (CMAKE_IOS_DEVELOPER_ROOT ${CMAKE_IOS_DEVELOPER_ROOT} CACHE PATH "Location of iOS Platform")
+
+# Find and use the most recent iOS sdk unless specified manually with CMAKE_IOS_SDK_ROOT
+if (NOT DEFINED CMAKE_IOS_SDK_ROOT)
+    file (GLOB _CMAKE_IOS_SDKS "${CMAKE_IOS_DEVELOPER_ROOT}/SDKs/*")
+    if (_CMAKE_IOS_SDKS)
+        list (SORT _CMAKE_IOS_SDKS)
+        list (REVERSE _CMAKE_IOS_SDKS)
+        list (GET _CMAKE_IOS_SDKS 0 CMAKE_IOS_SDK_ROOT)
+    else (_CMAKE_IOS_SDKS)
+        message (FATAL_ERROR "No iOS SDK's found in default search path ${CMAKE_IOS_DEVELOPER_ROOT}. Manually set CMAKE_IOS_SDK_ROOT or install the iOS SDK.")
+    endif (_CMAKE_IOS_SDKS)
+    message (STATUS "Toolchain using default iOS SDK: ${CMAKE_IOS_SDK_ROOT}")
+endif (NOT DEFINED CMAKE_IOS_SDK_ROOT)
+set (CMAKE_IOS_SDK_ROOT ${CMAKE_IOS_SDK_ROOT} CACHE PATH "Location of the selected iOS SDK")
+
+# Set the sysroot default to the most recent SDK
+set (CMAKE_OSX_SYSROOT ${CMAKE_IOS_SDK_ROOT} CACHE PATH "Sysroot used for iOS support")
+
+# set the architecture for iOS
+if (IOS_PLATFORM STREQUAL "OS")
+    set (IOS_ARCH "armv7;arm64")
+elseif (IOS_PLATFORM STREQUAL "SIMULATOR")
+    set (IOS_ARCH "x86_64")
+elseif (IOS_PLATFORM STREQUAL "WATCHOS")
+    set (IOS_ARCH "armv7k")
+elseif (IOS_PLATFORM STREQUAL "WATCHSIMULATOR")
+    set (IOS_ARCH "i386")
+elseif (IOS_PLATFORM STREQUAL "TVOS")
+    set (IOS_ARCH "arm64")
+elseif (IOS_PLATFORM STREQUAL "TVSIMULATOR")
+    set (IOS_ARCH "x86_64")
+else()
+    message (WARNING "Unknown IOS_PLATFORM=<${IOS_PLATFORM}>")
+endif()
+message (STATUS ${IOS_ARCH})
+
+set (CMAKE_OSX_ARCHITECTURES ${IOS_ARCH} CACHE STRING "Build architecture for iOS")
+
+# Set the find root to the iOS developer roots and to user defined paths
+set (CMAKE_FIND_ROOT_PATH ${CMAKE_IOS_DEVELOPER_ROOT} ${CMAKE_IOS_SDK_ROOT} ${CMAKE_PREFIX_PATH} CACHE STRING "iOS find search path root")
+
+# default to searching for frameworks first
+set (CMAKE_FIND_FRAMEWORK FIRST)
+
+# set up the default search directories for frameworks
+set (CMAKE_SYSTEM_FRAMEWORK_PATH
+    ${CMAKE_IOS_SDK_ROOT}/System/Library/Frameworks
+    ${CMAKE_IOS_SDK_ROOT}/System/Library/PrivateFrameworks
+    ${CMAKE_IOS_SDK_ROOT}/Developer/Library/Frameworks
+)
+
+# only search the iOS sdks, not the remainder of the host filesystem
+set (CMAKE_FIND_ROOT_PATH_MODE_PROGRAM ONLY)
+set (CMAKE_FIND_ROOT_PATH_MODE_LIBRARY ONLY)
+set (CMAKE_FIND_ROOT_PATH_MODE_INCLUDE ONLY)
+
+# This little macro lets you set any Xcode specific property
+macro (set_xcode_property TARGET XCODE_PROPERTY XCODE_VALUE)
+    set_property (TARGET ${TARGET} PROPERTY XCODE_ATTRIBUTE_${XCODE_PROPERTY} ${XCODE_VALUE})
+endmacro (set_xcode_property)
+
+# This macro lets you find executable programs on the host system
+macro (find_host_package)
+    set (CMAKE_FIND_ROOT_PATH_MODE_PROGRAM NEVER)
+    set (CMAKE_FIND_ROOT_PATH_MODE_LIBRARY NEVER)
+    set (CMAKE_FIND_ROOT_PATH_MODE_INCLUDE NEVER)
+    set (IOS FALSE)
+
+    find_package(${ARGN})
+
+    set (IOS TRUE)
+    set (CMAKE_FIND_ROOT_PATH_MODE_PROGRAM ONLY)
+    set (CMAKE_FIND_ROOT_PATH_MODE_LIBRARY ONLY)
+    set (CMAKE_FIND_ROOT_PATH_MODE_INCLUDE ONLY)
+endmacro (find_host_package)
diff --git a/submodules/ton/ton.xcodeproj/project.pbxproj b/submodules/ton/ton.xcodeproj/project.pbxproj
new file mode 100644
index 0000000000..d3aa5e630a
--- /dev/null
+++ b/submodules/ton/ton.xcodeproj/project.pbxproj
@@ -0,0 +1,755 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>archiveVersion</key>
+	<string>1</string>
+	<key>classes</key>
+	<dict>
+	</dict>
+	<key>objectVersion</key>
+	<string>46</string>
+	<key>objects</key>
+	<dict>
+		<key>1DD70E299ED0C70200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton-Debug.xcconfig</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton-Debug.xcconfig</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>explicitFileType</key>
+			<string>text.xcconfig</string>
+		</dict>
+		<key>1DD70E2912DDA5EC00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton-Profile.xcconfig</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton-Profile.xcconfig</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>explicitFileType</key>
+			<string>text.xcconfig</string>
+		</dict>
+		<key>1DD70E298674514E00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton-Release.xcconfig</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton-Release.xcconfig</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>explicitFileType</key>
+			<string>text.xcconfig</string>
+		</dict>
+		<key>B401C9792F7F325000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>Buck (Do Not Modify)</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>1DD70E299ED0C70200000000</string>
+				<string>1DD70E2912DDA5EC00000000</string>
+				<string>1DD70E298674514E00000000</string>
+			</array>
+		</dict>
+		<key>B401C979B781F65D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>Configurations</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>B401C9792F7F325000000000</string>
+			</array>
+		</dict>
+		<key>1DD70E296A34410F00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>build-ton.sh</string>
+			<key>path</key>
+			<string>build-ton.sh</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>explicitFileType</key>
+			<string>text.script.sh</string>
+		</dict>
+		<key>1DD70E2959589FB000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>iOS.cmake</string>
+			<key>path</key>
+			<string>iOS.cmake</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+		</dict>
+		<key>1DD70E29A77DB5E900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>tonlib-src</string>
+			<key>path</key>
+			<string>tonlib-src</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+		</dict>
+		<key>B401C979048F8EF000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>Other</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>1DD70E296A34410F00000000</string>
+				<string>1DD70E2959589FB000000000</string>
+				<string>1DD70E29A77DB5E900000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29333EE72100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>libton.a</string>
+			<key>path</key>
+			<string>libton.a</string>
+			<key>sourceTree</key>
+			<string>BUILT_PRODUCTS_DIR</string>
+			<key>explicitFileType</key>
+			<string>archive.ar</string>
+		</dict>
+		<key>B401C979C806358400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>Products</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29333EE72100000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29001F47FB00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>BUCK</string>
+			<key>path</key>
+			<string>BUCK</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>explicitFileType</key>
+			<string>text.script.python</string>
+		</dict>
+		<key>1DD70E29B9FF426400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_auto_sub_tl_sub_tonlib_api.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_auto_sub_tl_sub_tonlib_api.h/ton_header_auto_sub_tl_sub_tonlib_api.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979B9FF426400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_auto_sub_tl_sub_tonlib_api.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_auto_sub_tl_sub_tonlib_api.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29B9FF426400000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29813112B200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_SharedSlice.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_SharedSlice.h/ton_header_td_sub_utils_sub_SharedSlice.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979813112B200000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_SharedSlice.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_SharedSlice.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29813112B200000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29D7A0B39400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_Slice-decl.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_Slice-decl.h/ton_header_td_sub_utils_sub_Slice-decl.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979D7A0B39400000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_Slice-decl.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_Slice-decl.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29D7A0B39400000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29EFAB671700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_Slice.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_Slice.h/ton_header_td_sub_utils_sub_Slice.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979EFAB671700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_Slice.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_Slice.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29EFAB671700000000</string>
+			</array>
+		</dict>
+		<key>1DD70E293703712D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_check.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_check.h/ton_header_td_sub_utils_sub_check.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9793703712D00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_check.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_check.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E293703712D00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E2929ECBE5A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_common.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_common.h/ton_header_td_sub_utils_sub_common.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C97929ECBE5A00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_common.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_common.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E2929ECBE5A00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E292B3C1DF100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_config.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_config.h/ton_header_td_sub_utils_sub_config.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9792B3C1DF100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_config.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_config.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E292B3C1DF100000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29DCA39E8E00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_int_types.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_int_types.h/ton_header_td_sub_utils_sub_int_types.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979DCA39E8E00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_int_types.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_int_types.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29DCA39E8E00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29E268B03500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_port_sub_platform.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_port_sub_platform.h/ton_header_td_sub_utils_sub_port_sub_platform.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979E268B03500000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_port_sub_platform.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_port_sub_platform.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29E268B03500000000</string>
+			</array>
+		</dict>
+		<key>1DD70E292B4A7E2F00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_unique_ptr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_unique_ptr.h/ton_header_td_sub_utils_sub_unique_ptr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C9792B4A7E2F00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_td_sub_utils_sub_unique_ptr.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_td_sub_utils_sub_unique_ptr.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E292B4A7E2F00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29C030047100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_tl_sub_TlObject.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_tl_sub_TlObject.h/ton_header_tl_sub_TlObject.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979C030047100000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_tl_sub_TlObject.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_tl_sub_TlObject.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29C030047100000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29525C76CB00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_tonlib_sub_Client.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_tonlib_sub_Client.h/ton_header_tonlib_sub_Client.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979525C76CB00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_tonlib_sub_Client.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_tonlib_sub_Client.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29525C76CB00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29A95A054F00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_tonlib_sub_tonlib_client_json.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_tonlib_sub_tonlib_client_json.h/ton_header_tonlib_sub_tonlib_client_json.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979A95A054F00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_tonlib_sub_tonlib_client_json.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_tonlib_sub_tonlib_client_json.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29A95A054F00000000</string>
+			</array>
+		</dict>
+		<key>1DD70E29F3A35BAD00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXFileReference</string>
+			<key>name</key>
+			<string>ton_header_tonlib_sub_tonlibjson_export.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_tonlib_sub_tonlibjson_export.h/ton_header_tonlib_sub_tonlibjson_export.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>lastKnownFileType</key>
+			<string>sourcecode.c.h</string>
+		</dict>
+		<key>B401C979F3A35BAD00000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton_header_tonlib_sub_tonlibjson_export.h</string>
+			<key>path</key>
+			<string>../../buck-out/gen/submodules/ton/ton_header_tonlib_sub_tonlibjson_export.h</string>
+			<key>sourceTree</key>
+			<string>SOURCE_ROOT</string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29F3A35BAD00000000</string>
+			</array>
+		</dict>
+		<key>B401C979EAB5339800000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>Sources</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>B401C979B9FF426400000000</string>
+				<string>B401C979813112B200000000</string>
+				<string>B401C979D7A0B39400000000</string>
+				<string>B401C979EFAB671700000000</string>
+				<string>B401C9793703712D00000000</string>
+				<string>B401C97929ECBE5A00000000</string>
+				<string>B401C9792B3C1DF100000000</string>
+				<string>B401C979DCA39E8E00000000</string>
+				<string>B401C979E268B03500000000</string>
+				<string>B401C9792B4A7E2F00000000</string>
+				<string>B401C979C030047100000000</string>
+				<string>B401C979525C76CB00000000</string>
+				<string>B401C979A95A054F00000000</string>
+				<string>B401C979F3A35BAD00000000</string>
+			</array>
+		</dict>
+		<key>B401C9790001C15300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>ton</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>1DD70E29001F47FB00000000</string>
+				<string>B401C979EAB5339800000000</string>
+			</array>
+		</dict>
+		<key>B401C979EFB6AC4600000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXGroup</string>
+			<key>name</key>
+			<string>mainGroup</string>
+			<key>sourceTree</key>
+			<string><![CDATA[<group>]]></string>
+			<key>children</key>
+			<array>
+				<string>B401C979B781F65D00000000</string>
+				<string>B401C979048F8EF000000000</string>
+				<string>B401C979C806358400000000</string>
+				<string>B401C9790001C15300000000</string>
+			</array>
+		</dict>
+		<key>4952437303EDA63300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>XCBuildConfiguration</string>
+			<key>name</key>
+			<string>Debug</string>
+			<key>buildSettings</key>
+			<dict>
+			</dict>
+			<key>baseConfigurationReference</key>
+			<string>1DD70E299ED0C70200000000</string>
+		</dict>
+		<key>4952437350C7218900000000</key>
+		<dict>
+			<key>isa</key>
+			<string>XCBuildConfiguration</string>
+			<key>name</key>
+			<string>Profile</string>
+			<key>buildSettings</key>
+			<dict>
+			</dict>
+			<key>baseConfigurationReference</key>
+			<string>1DD70E2912DDA5EC00000000</string>
+		</dict>
+		<key>49524373A439BFE700000000</key>
+		<dict>
+			<key>isa</key>
+			<string>XCBuildConfiguration</string>
+			<key>name</key>
+			<string>Release</string>
+			<key>buildSettings</key>
+			<dict>
+			</dict>
+			<key>baseConfigurationReference</key>
+			<string>1DD70E298674514E00000000</string>
+		</dict>
+		<key>218C37090000000000000000</key>
+		<dict>
+			<key>isa</key>
+			<string>XCConfigurationList</string>
+			<key>buildConfigurations</key>
+			<array>
+				<string>4952437303EDA63300000000</string>
+				<string>4952437350C7218900000000</string>
+				<string>49524373A439BFE700000000</string>
+			</array>
+			<key>defaultConfigurationIsVisible</key>
+			<false/>
+		</dict>
+		<key>E66DC04E0001C15300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXNativeTarget</string>
+			<key>name</key>
+			<string>ton</string>
+			<key>productName</key>
+			<string>ton</string>
+			<key>productReference</key>
+			<string>1DD70E29333EE72100000000</string>
+			<key>productType</key>
+			<string>com.apple.product-type.library.static</string>
+			<key>dependencies</key>
+			<array>
+			</array>
+			<key>buildPhases</key>
+			<array>
+			</array>
+			<key>buildConfigurationList</key>
+			<string>218C37090000000000000000</string>
+		</dict>
+		<key>4952437303EDA63300000001</key>
+		<dict>
+			<key>isa</key>
+			<string>XCBuildConfiguration</string>
+			<key>name</key>
+			<string>Debug</string>
+			<key>buildSettings</key>
+			<dict>
+			</dict>
+		</dict>
+		<key>4952437350C7218900000001</key>
+		<dict>
+			<key>isa</key>
+			<string>XCBuildConfiguration</string>
+			<key>name</key>
+			<string>Profile</string>
+			<key>buildSettings</key>
+			<dict>
+			</dict>
+		</dict>
+		<key>49524373A439BFE700000001</key>
+		<dict>
+			<key>isa</key>
+			<string>XCBuildConfiguration</string>
+			<key>name</key>
+			<string>Release</string>
+			<key>buildSettings</key>
+			<dict>
+			</dict>
+		</dict>
+		<key>218C37090000000000000001</key>
+		<dict>
+			<key>isa</key>
+			<string>XCConfigurationList</string>
+			<key>buildConfigurations</key>
+			<array>
+				<string>4952437303EDA63300000001</string>
+				<string>4952437350C7218900000001</string>
+				<string>49524373A439BFE700000001</string>
+			</array>
+			<key>defaultConfigurationIsVisible</key>
+			<false/>
+		</dict>
+		<key>96C847930001C15300000000</key>
+		<dict>
+			<key>isa</key>
+			<string>PBXProject</string>
+			<key>mainGroup</key>
+			<string>B401C979EFB6AC4600000000</string>
+			<key>targets</key>
+			<array>
+				<string>E66DC04E0001C15300000000</string>
+			</array>
+			<key>buildConfigurationList</key>
+			<string>218C37090000000000000001</string>
+			<key>compatibilityVersion</key>
+			<string>Xcode 3.2</string>
+			<key>attributes</key>
+			<dict>
+				<key>LastUpgradeCheck</key>
+				<string>9999</string>
+			</dict>
+		</dict>
+	</dict>
+	<key>rootObject</key>
+	<string>96C847930001C15300000000</string>
+</dict>
+</plist>
\ No newline at end of file
diff --git a/submodules/ton/ton.xcodeproj/xcshareddata/xcschemes/ton.xcscheme b/submodules/ton/ton.xcodeproj/xcshareddata/xcschemes/ton.xcscheme
new file mode 100644
index 0000000000..3f9bd1e815
--- /dev/null
+++ b/submodules/ton/ton.xcodeproj/xcshareddata/xcschemes/ton.xcscheme
@@ -0,0 +1 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?><Scheme LastUpgradeVersion="9999" version="1.7"><BuildAction buildImplicitDependencies="YES" parallelizeBuildables="YES"><BuildActionEntries><BuildActionEntry buildForAnalyzing="YES" buildForArchiving="YES" buildForProfiling="YES" buildForRunning="YES" buildForTesting="YES"><BuildableReference BlueprintIdentifier="E66DC04E0001C15300000000" BlueprintName="ton" BuildableIdentifier="primary" BuildableName="libton.a" ReferencedContainer="container:ton.xcodeproj"/></BuildActionEntry></BuildActionEntries></BuildAction><TestAction buildConfiguration="Debug" shouldUseLaunchSchemeArgsEnv="YES"><Testables/></TestAction><LaunchAction buildConfiguration="Debug"/><ProfileAction buildConfiguration="Release"/><AnalyzeAction buildConfiguration="Debug"/><ArchiveAction buildConfiguration="Release" revealArchiveInOrganizer="YES"/></Scheme>
\ No newline at end of file
diff --git a/submodules/ton/tonlib-src/CMake/AddCXXCompilerFlag.cmake b/submodules/ton/tonlib-src/CMake/AddCXXCompilerFlag.cmake
new file mode 100644
index 0000000000..6fb615a1f7
--- /dev/null
+++ b/submodules/ton/tonlib-src/CMake/AddCXXCompilerFlag.cmake
@@ -0,0 +1,74 @@
+# - Adds a compiler flag if it is supported by the compiler
+#
+# This function checks that the supplied compiler flag is supported and then
+# adds it to the corresponding compiler flags
+#
+#  add_cxx_compiler_flag(<FLAG> [<VARIANT>])
+#
+# - Example
+#
+# include(AddCXXCompilerFlag)
+# add_cxx_compiler_flag(-Wall)
+# add_cxx_compiler_flag(-no-strict-aliasing RELEASE)
+# Requires CMake 2.6+
+
+if (__add_cxx_compiler_flag)
+  return()
+endif()
+set(__add_cxx_compiler_flag INCLUDED)
+
+include(CheckCXXCompilerFlag)
+
+function(mangle_compiler_flag FLAG OUTPUT)
+  string(TOUPPER "HAVE_CXX_FLAG_${FLAG}" SANITIZED_FLAG)
+  string(REPLACE "+" "X" SANITIZED_FLAG ${SANITIZED_FLAG})
+  string(REGEX REPLACE "[^A-Za-z_0-9]" "_" SANITIZED_FLAG ${SANITIZED_FLAG})
+  string(REGEX REPLACE "_+" "_" SANITIZED_FLAG ${SANITIZED_FLAG})
+  set(${OUTPUT} "${SANITIZED_FLAG}" PARENT_SCOPE)
+endfunction(mangle_compiler_flag)
+
+function(add_cxx_compiler_flag FLAG)
+  string(REPLACE "-Wno-" "-W" MAIN_FLAG ${FLAG})
+  mangle_compiler_flag("${MAIN_FLAG}" MANGLED_FLAG_NAME)
+  if (DEFINED CMAKE_REQUIRED_FLAGS)
+    set(OLD_CMAKE_REQUIRED_FLAGS "${CMAKE_REQUIRED_FLAGS}")
+    set(CMAKE_REQUIRED_FLAGS "${CMAKE_REQUIRED_FLAGS} ${FLAG}")
+  else()
+    set(CMAKE_REQUIRED_FLAGS "${FLAG}")
+  endif()
+  check_cxx_compiler_flag("${MAIN_FLAG}" ${MANGLED_FLAG_NAME})
+  if (DEFINED OLD_CMAKE_REQUIRED_FLAGS)
+    set(CMAKE_REQUIRED_FLAGS "${OLD_CMAKE_REQUIRED_FLAGS}")
+  else()
+    unset(CMAKE_REQUIRED_FLAGS)
+  endif()
+  if (${MANGLED_FLAG_NAME})
+    set(VARIANT ${ARGV1})
+    if (ARGV1)
+      string(TOUPPER "_${VARIANT}" VARIANT)
+    endif()
+    set(CMAKE_CXX_FLAGS${VARIANT} "${CMAKE_CXX_FLAGS${VARIANT}} ${FLAG}" PARENT_SCOPE)
+  endif()
+endfunction()
+
+function(add_required_cxx_compiler_flag FLAG)
+  string(REPLACE "-Wno-" "-W" MAIN_FLAG ${FLAG})
+  mangle_compiler_flag("${MAIN_FLAG}" MANGLED_FLAG_NAME)
+  set(OLD_CMAKE_REQUIRED_FLAGS "${CMAKE_REQUIRED_FLAGS}")
+  set(CMAKE_REQUIRED_FLAGS "${CMAKE_REQUIRED_FLAGS} ${FLAG}")
+  check_cxx_compiler_flag("${MAIN_FLAG}" ${MANGLED_FLAG_NAME})
+  set(CMAKE_REQUIRED_FLAGS "${OLD_CMAKE_REQUIRED_FLAGS}")
+  if (${MANGLED_FLAG_NAME})
+    set(VARIANT ${ARGV1})
+    if (ARGV1)
+      string(TOUPPER "_${VARIANT}" VARIANT)
+    endif()
+    set(CMAKE_CXX_FLAGS${VARIANT} "${CMAKE_CXX_FLAGS${VARIANT}} ${FLAG}" PARENT_SCOPE)
+    set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} ${FLAG}" PARENT_SCOPE)
+    set(CMAKE_SHARED_LINKER_FLAGS "${CMAKE_SHARED_LINKER_FLAGS} ${FLAG}" PARENT_SCOPE)
+    set(CMAKE_MODULE_LINKER_FLAGS "${CMAKE_MODULE_LINKER_FLAGS} ${FLAG}" PARENT_SCOPE)
+    set(CMAKE_REQUIRED_FLAGS "${CMAKE_REQUIRED_FLAGS} ${FLAG}" PARENT_SCOPE)
+  else()
+    message(FATAL_ERROR "Required flag '${FLAG}' is not supported by the compiler")
+  endif()
+endfunction()
diff --git a/submodules/ton/tonlib-src/CMake/FindJeMalloc.cmake b/submodules/ton/tonlib-src/CMake/FindJeMalloc.cmake
new file mode 100644
index 0000000000..7911f77c4c
--- /dev/null
+++ b/submodules/ton/tonlib-src/CMake/FindJeMalloc.cmake
@@ -0,0 +1,21 @@
+# - Find JeMalloc library
+# Find the native JeMalloc includes and library
+#
+# JEMALLOC_INCLUDE_DIR - where to find jemalloc.h, etc.
+# JEMALLOC_LIBRARIES - List of libraries when using jemalloc.
+# JEMALLOC_FOUND - True if jemalloc found.
+
+find_path(JEMALLOC_INCLUDE_DIR
+  NAMES jemalloc/jemalloc.h
+  HINTS ${JEMALLOC_ROOT_DIR}/include)
+
+find_library(JEMALLOC_LIBRARIES
+  NAMES jemalloc
+  HINTS ${JEMALLOC_ROOT_DIR}/lib)
+
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(jemalloc DEFAULT_MSG JEMALLOC_LIBRARIES JEMALLOC_INCLUDE_DIR)
+
+mark_as_advanced(
+  JEMALLOC_LIBRARIES
+  JEMALLOC_INCLUDE_DIR)
diff --git a/submodules/ton/tonlib-src/CMake/FindMHD.cmake b/submodules/ton/tonlib-src/CMake/FindMHD.cmake
new file mode 100644
index 0000000000..822714a2c5
--- /dev/null
+++ b/submodules/ton/tonlib-src/CMake/FindMHD.cmake
@@ -0,0 +1,38 @@
+# - Try to find MHD
+# Once done this will define
+#
+#  MHD_FOUND - system has MHD
+#  MHD_INCLUDE_DIRS - the MHD include directory
+#  MHD_LIBRARY - Link these to use MHD
+
+find_path(
+    MHD_INCLUDE_DIR
+    NAMES microhttpd.h
+    DOC "microhttpd include dir"
+)
+
+find_library(
+    MHD_LIBRARY
+    NAMES microhttpd microhttpd-10 libmicrohttpd libmicrohttpd-dll
+    DOC "microhttpd library"
+)
+
+set(MHD_INCLUDE_DIRS ${MHD_INCLUDE_DIR})
+set(MHD_LIBRARIES ${MHD_LIBRARY})
+
+# debug library on windows
+# same naming convention as in qt (appending debug library with d)
+# boost is using the same "hack" as us with "optimized" and "debug"
+# official MHD project actually uses _d suffix
+if (MSVC)
+    find_library(
+        MHD_LIBRARY_DEBUG
+        NAMES microhttpd_d microhttpd-10_d libmicrohttpd_d libmicrohttpd-dll_d
+        DOC "mhd debug library"
+    )
+    set(MHD_LIBRARIES optimized ${MHD_LIBRARIES} debug ${MHD_LIBRARY_DEBUG})
+endif()
+
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(mhd DEFAULT_MSG MHD_INCLUDE_DIR MHD_LIBRARY)
+mark_as_advanced(MHD_INCLUDE_DIR MHD_LIBRARY)
diff --git a/submodules/ton/tonlib-src/CMake/FindReadline.cmake b/submodules/ton/tonlib-src/CMake/FindReadline.cmake
new file mode 100644
index 0000000000..3b1892cbc2
--- /dev/null
+++ b/submodules/ton/tonlib-src/CMake/FindReadline.cmake
@@ -0,0 +1,25 @@
+if (APPLE)
+  find_path(READLINE_INCLUDE_DIR readline/readline.h /usr/local/opt/readline/include /opt/local/include /opt/include /usr/local/include /usr/include NO_DEFAULT_PATH)
+endif()
+find_path(READLINE_INCLUDE_DIR readline/readline.h)
+
+if (APPLE)
+  find_library(READLINE_LIBRARY readline /usr/local/opt/readline/lib /opt/local/lib /opt/lib /usr/local/lib /usr/lib NO_DEFAULT_PATH)
+endif()
+find_library(READLINE_LIBRARY readline)
+
+if (READLINE_INCLUDE_DIR AND READLINE_LIBRARY AND NOT GNU_READLINE_FOUND)
+  set(CMAKE_REQUIRED_INCLUDES "${READLINE_INCLUDE_DIR}")
+  set(CMAKE_REQUIRED_LIBRARIES "${READLINE_LIBRARY}")
+  include(CheckCXXSourceCompiles)
+  unset(GNU_READLINE_FOUND CACHE)
+  check_cxx_source_compiles("#include <stdio.h>\n#include <readline/readline.h>\nint main() { rl_replace_line(\"\", 0); }" GNU_READLINE_FOUND)
+  if (NOT GNU_READLINE_FOUND)
+    unset(READLINE_INCLUDE_DIR CACHE)
+    unset(READLINE_LIBRARY CACHE)
+  endif()
+endif()
+
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(Readline DEFAULT_MSG READLINE_INCLUDE_DIR READLINE_LIBRARY)
+mark_as_advanced(READLINE_INCLUDE_DIR READLINE_LIBRARY)
diff --git a/submodules/ton/tonlib-src/CMake/UseLATEX.cmake b/submodules/ton/tonlib-src/CMake/UseLATEX.cmake
new file mode 100644
index 0000000000..5380522525
--- /dev/null
+++ b/submodules/ton/tonlib-src/CMake/UseLATEX.cmake
@@ -0,0 +1,1936 @@
+# File: UseLATEX.cmake
+# CMAKE commands to actually use the LaTeX compiler
+# Version: 2.4.6
+# Author: Kenneth Moreland <kmorel@sandia.gov>
+#
+# Copyright 2004, 2015 Sandia Corporation.
+# Under the terms of Contract DE-AC04-94AL85000, there is a non-exclusive
+# license for use of this work by or on behalf of the U.S. Government.
+#
+# This software is released under the BSD 3-Clause License.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions are
+# met:
+#
+# 1. Redistributions of source code must retain the above copyright notice,
+# this list of conditions and the following disclaimer.
+#
+# 2. Redistributions in binary form must reproduce the above copyright
+# notice, this list of conditions and the following disclaimer in the
+# documentation and/or other materials provided with the distribution.
+#
+# 3. Neither the name of the copyright holder nor the names of its
+# contributors may be used to endorse or promote products derived from this
+# software without specific prior written permission.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
+# IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
+# THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+# PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
+# CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+# EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+# PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+# PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+# LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+# NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+#
+#
+# The following function is defined:
+#
+# add_latex_document(<tex_file>
+#                    [BIBFILES <bib_files>]
+#                    [INPUTS <input_tex_files>]
+#                    [IMAGE_DIRS] <image_directories>
+#                    [IMAGES] <image_files>
+#                    [CONFIGURE] <tex_files>
+#                    [DEPENDS] <tex_files>
+#                    [MULTIBIB_NEWCITES] <suffix_list>
+#                    [USE_BIBLATEX]
+#                    [USE_INDEX]
+#                    [INDEX_NAMES <index_names>]
+#                    [USE_GLOSSARY] [USE_NOMENCL]
+#                    [FORCE_PDF] [FORCE_DVI] [FORCE_HTML]
+#                    [TARGET_NAME] <name>
+#                    [EXCLUDE_FROM_ALL]
+#                    [EXCLUDE_FROM_DEFAULTS])
+#       Adds targets that compile <tex_file>.  The latex output is placed
+#       in LATEX_OUTPUT_PATH or CMAKE_CURRENT_BINARY_DIR if the former is
+#       not set.  The latex program is picky about where files are located,
+#       so all input files are copied from the source directory to the
+#       output directory.  This includes the target tex file, any tex file
+#       listed with the INPUTS option, the bibliography files listed with
+#       the BIBFILES option, and any .cls, .bst, .clo, .sty, .ist, and .fd
+#       files found in the current source directory.  Images found in the
+#       IMAGE_DIRS directories or listed by IMAGES are also copied to the
+#       output directory and converted to an appropriate format if necessary.
+#       Any tex files also listed with the CONFIGURE option are also processed
+#       with the CMake CONFIGURE_FILE command (with the @ONLY flag).  Any file
+#       listed in CONFIGURE but not the target tex file or listed with INPUTS
+#       has no effect. DEPENDS can be used to specify generated files that are
+#       needed to compile the latex target.
+#
+#       The following targets are made. The name prefix is based off of the
+#       base name of the tex file unless TARGET_NAME is specified. If
+#       TARGET_NAME is specified, then that name is used for the targets.
+#
+#               name_dvi: Makes <name>.dvi
+#               name_pdf: Makes <name>.pdf using pdflatex.
+#               name_safepdf: Makes <name>.pdf using ps2pdf.  If using the
+#                       default program arguments, this will ensure all fonts
+#                       are embedded and no lossy compression has been
+#                       performed on images.
+#               name_ps: Makes <name>.ps
+#               name_html: Makes <name>.html
+#               name_auxclean: Deletes <name>.aux and other auxiliary files.
+#                       This is sometimes necessary if a LaTeX error occurs
+#                       and writes a bad aux file.  Unlike the regular clean
+#                       target, it does not delete other input files, such as
+#                       converted images, to save time on the rebuild.
+#
+#       Unless the EXCLUDE_FROM_ALL option is given, one of these targets
+#       is added to the ALL target and built by default. Which target is
+#       determined by the LATEX_DEFAULT_BUILD CMake variable. See the
+#       documentation of that variable for more details.
+#
+#       Unless the EXCLUDE_FROM_DEFAULTS option is given, all these targets
+#       are added as dependencies to targets named dvi, pdf, safepdf, ps,
+#       html, and auxclean, respectively.
+#
+#       USE_BIBLATEX enables the use of biblatex/biber as an alternative to
+#       bibtex. Bibtex remains the default if USE_BIBLATEX is not
+#       specified.
+#
+#       If the argument USE_INDEX is given, then commands to build an index
+#       are made. If the argument INDEX_NAMES is given, an index file is
+#       generated for each name in this list. See the LaTeX package multind
+#       for more information about how to generate multiple indices.
+#
+#       If the argument USE_GLOSSARY is given, then commands to
+#       build a glossary are made.  If the argument MULTIBIB_NEWCITES is
+#       given, then additional bibtex calls are added to the build to
+#       support the extra auxiliary files created with the \newcite command
+#       in the multibib package.
+#
+# History:
+#
+# 2.4.6 Fix parse issue with older versions of CMake.
+#
+# 2.4.5 Fix issues with files and paths containing spaces.
+#
+# 2.4.4 Improve error reporting message when LaTeX fails.
+#
+#       When LaTeX fails, delete the output file, which is invalid.
+#
+#       Add warnings for "missing characters." These usually mean that a
+#       non-ASCII character is in the document and will not be printed
+#       correctly.
+#
+# 2.4.3 Check for warnings from the natbib package. When using natbib,
+#       warnings for missing bibliography references look different. So
+#       far, natbib seems to be quiet unless something is important, so
+#       look for all natbib warnings. (We can change this later if
+#       necessary.)
+#
+# 2.4.2 Fix an issue where new versions of ImageMagick expect the order of
+#       options in command line execution of magick/convert. (See, for
+#       example, http://www.imagemagick.org/Usage/basics/#why.)
+#
+# 2.4.1 Add ability to dump LaTeX log file when using batch mode. Batch
+#       mode suppresses most output, often including error messages. To
+#       make sure critical error messages get displayed, show the full log
+#       on failures.
+#
+# 2.4.0 Remove "-r 600" from the default PDFTOPS_CONVERTER_FLAGS. The -r flag
+#       is available from the Poppler version of pdftops, but not the Xpdf
+#       version.
+#
+#       Fix an issue with the flags for the different programs not being
+#       properly separated.
+#
+#       Fix an issue on windows where the = character is not allowed for
+#       ps2pdf arguments.
+#
+#       Change default arguments for latex and pdflatex commands. Makes the
+#       output more quiet and prints out the file/line where errors occur.
+#       (Thanks to Nikos Koukis.)
+#
+#       After a LaTeX build, check the log file for warnings that are
+#       indicative of problems with the build.
+#
+#       Remove support for latex2html. Instead, use the htlatex program.
+#       This is now part of TeX Live and most other distributions. It also
+#       behaves much more like the other LaTeX programs. Also fixed some
+#       nasty issues with the htlatex arguments.
+#
+# 2.3.2 Declare LaTeX input files as sources for targets so that they show
+#       up in IDEs like QtCreator.
+#
+#       Fix issue where main tex files in subdirectories were creating
+#       invalid targets for building HTML. Just disable the HTML targets in
+#       this case.
+#
+# 2.3.1 Support use of magick command instead of convert command for
+#       ImageMagick 7.
+#
+# 2.3.0 Add USE_BIBLATEX option to support the biblatex package, which
+#       requires using the program biber as a replacement for bibtex
+#       (thanks to David Tracey).
+#
+# 2.2.1 Add STRINGS property to LATEX_DEFAULT_BUILD to make it easier to
+#       select the default build in the CMake GUI.
+#
+# 2.2.0 Add TARGET_NAME option.
+#
+# 2.1.1 Support for finding bmp, ppm, and other image files.
+#
+# 2.1.0 Fix an error where the pdf target and others were defined multiple
+#       times if UseLATEX.cmake was included multiple times.
+#
+#       Added INDEX_NAMES option to support multiple indexes in a single
+#       document from the multind package (thanks to Dan Lipsa).
+#
+# 2.0.0 First major revision of UseLATEX.cmake updates to more recent features
+#       of CMake and some non-backward compatible changes.
+#
+#       Changed all function and macro names to lower case. CMake's identifiers
+#       are case insensitive, but the convention moved from all upper case to
+#       all lower case somewhere around the release of CMake 2. (The original
+#       version of UseLATEX.cmake predates that.)
+#
+#       Remove condition matching in if statements. They are no longer necessary
+#       and are even discouraged (because else clauses get confusing).
+#
+#       Use "new" features available in CMake such as list and argument parsing.
+#
+#       Remove some code that has been deprecated for a while.
+#
+#       Mark variables for compiler and converter executables as advanced to
+#       match the more conventional CMake behavior.
+#
+#       Changed how default builds are specified and add the ability to force
+#       a particular build.
+#
+#       Made the base targets (pdf, dvi, etc.) global. add_latex_document
+#       always mangles its target names and these base targets depend on
+#       the targets with mangled names.
+#
+# 1.10.5 Fix for Window's convert check (thanks to Martin Baute).
+#
+# 1.10.4 Copy font files to binary directory for packages that come with
+#       their own fonts.
+#
+# 1.10.3 Check for Windows version of convert being used instead of
+#       ImageMagick's version (thanks to Martin Baute).
+#
+# 1.10.2 Use htlatex as a fallback when latex2html is not available (thanks
+#       to Tomasz Grzegurzko).
+#
+# 1.10.1 Make convert program mandatory only if actually used (thanks to
+#       Julien Schueller).
+#
+# 1.10.0 Added NO_DEFAULT and DEFAULT_PS options.
+#       Fixed issue with cleaning files for LaTeX documents originating in
+#       a subdirectory.
+#
+# 1.9.6 Fixed problem with LATEX_SMALL_IMAGES.
+#       Strengthened check to make sure the output directory does not contain
+#       the source files.
+#
+# 1.9.5 Add support for image types not directly supported by either latex
+#       or pdflatex.  (Thanks to Jorge Gerardo Pena Pastor for SVG support.)
+#
+# 1.9.4 Fix issues with filenames containing multiple periods.
+#
+# 1.9.3 Hide some variables that are now cached but should not show up in
+#       the ccmake list of variables.
+#
+# 1.9.2 Changed MACRO declarations to FUNCTION declarations.  The better
+#       FUNCTION scoping will hopefully avoid some common but subtle bugs.
+#       This implicitly increases the minimum CMake version to 4.6 (although
+#       I honestly only test it with the latest 4.8 version).
+#
+#       Since we are updating the minimum CMake version, I'm going to start
+#       using the builtin LIST commands that are now available.
+#
+#       Favor using pdftops from the Poppler package to convert from pdf to
+#       eps.  It does a much better job than ImageMagick or ghostscript.
+#
+# 1.9.1 Fixed typo that caused the LATEX_SMALL_IMAGES option to fail to
+#       activate.
+#
+# 1.9.0 Add support for the multibib package (thanks to Antonio LaTorre).
+#
+# 1.8.2 Fix corner case when an argument name was also a variable containing
+#       the text of an argument.  In this case, the CMake IF was matching
+#       the argument text with the contents of the variable with the same
+#       argument name.
+#
+# 1.8.1 Fix problem where ps2pdf was not getting the appropriate arguments.
+#
+# 1.8.0 Add support for synctex.
+#
+# 1.7.7 Support calling xindy when making glossaries.
+#
+#       Improved make clean support.
+#
+# 1.7.6 Add support for the nomencl package (thanks to Myles English).
+#
+# 1.7.5 Fix issue with bibfiles being copied two different ways, which causes
+#       Problems with dependencies (thanks to Edwin van Leeuwen).
+#
+# 1.7.4 Added the DEFAULT_SAFEPDF option (thanks to Raymond Wan).
+#
+#       Added warnings when image directories are not found (and were
+#       probably not given relative to the source directory).
+#
+# 1.7.3 Fix some issues with interactions between makeglossaries and bibtex
+#       (thanks to Mark de Wever).
+#
+# 1.7.2 Use ps2pdf to convert eps to pdf to get around the problem with
+#       ImageMagick dropping the bounding box (thanks to Lukasz Lis).
+#
+# 1.7.1 Fixed some dependency issues.
+#
+# 1.7.0 Added DEPENDS options (thanks to Theodore Papadopoulo).
+#
+# 1.6.1 Ported the makeglossaries command to CMake and embedded the port
+#       into UseLATEX.cmake.
+#
+# 1.6.0 Allow the use of the makeglossaries command.  Thanks to Oystein
+#       S. Haaland for the patch.
+#
+# 1.5.0 Allow any type of file in the INPUTS lists, not just tex file
+#       (suggested by Eric Noulard).  As a consequence, the ability to
+#       specify tex files without the .tex extension is removed.  The removed
+#       function is of dubious value anyway.
+#
+#       When copying input files, skip over any file that exists in the
+#       binary directory but does not exist in the source directory with the
+#       assumption that these files were added by some other mechanism.  I
+#       find this useful when creating large documents with multiple
+#       chapters that I want to build separately (for speed) as I work on
+#       them.  I use the same boilerplate as the starting point for all
+#       and just copy it with different configurations.  This was what the
+#       separate ADD_LATEX_DOCUMENT method was supposed to originally be for.
+#       Since its external use is pretty much deprecated, I removed that
+#       documentation.
+#
+# 1.4.1 Copy .sty files along with the other class and package files.
+#
+# 1.4.0 Added a MANGLE_TARGET_NAMES option that will mangle the target names.
+#
+#       Fixed problem with copying bib files that became apparent with
+#       CMake 2.4.
+#
+# 1.3.0 Added a LATEX_OUTPUT_PATH variable that allows you or the user to
+#       specify where the built latex documents to go.  This is especially
+#       handy if you want to do in-source builds.
+#
+#       Removed the ADD_LATEX_IMAGES macro and absorbed the functionality
+#       into ADD_LATEX_DOCUMENT.  The old interface was always kind of
+#       clunky anyway since you had to specify the image directory in both
+#       places.  It also made supporting LATEX_OUTPUT_PATH problematic.
+#
+#       Added support for jpeg files.
+#
+# 1.2.0 Changed the configuration options yet again.  Removed the NO_CONFIGURE
+#       Replaced it with a CONFIGURE option that lists input files for which
+#       configure should be run.
+#
+#       The pdf target no longer depends on the dvi target.  This allows you
+#       to build latex documents that require pdflatex.  Also added an option
+#       to make the pdf target the default one.
+#
+# 1.1.1 Added the NO_CONFIGURE option.  The @ character can be used when
+#       specifying table column separators.  If two or more are used, then
+#       will incorrectly substitute them.
+#
+# 1.1.0 Added ability include multiple bib files.  Added ability to do copy
+#       sub-tex files for multipart tex files.
+#
+# 1.0.0 If both ps and pdf type images exist, just copy the one that
+#       matches the current render mode.  Replaced a bunch of STRING
+#       commands with GET_FILENAME_COMPONENT commands that were made to do
+#       the desired function.
+#
+# 0.4.0 First version posted to CMake Wiki.
+#
+
+if(__USE_LATEX_INCLUDED)
+  return()
+endif()
+set(__USE_LATEX_INCLUDED TRUE)
+
+#############################################################################
+# Find the location of myself while originally executing.  If you do this
+# inside of a macro, it will recode where the macro was invoked.
+#############################################################################
+set(LATEX_USE_LATEX_LOCATION ${CMAKE_CURRENT_LIST_FILE}
+  CACHE INTERNAL "Location of UseLATEX.cmake file." FORCE
+  )
+
+#############################################################################
+# Generic helper functions
+#############################################################################
+
+include(CMakeParseArguments)
+
+function(latex_list_contains var value)
+  set(input_list ${ARGN})
+  list(FIND input_list "${value}" index)
+  if(index GREATER -1)
+    set(${var} TRUE PARENT_SCOPE)
+  else()
+    set(${var} PARENT_SCOPE)
+  endif()
+endfunction(latex_list_contains)
+
+# Match the contents of a file to a regular expression.
+function(latex_file_match variable filename regexp default)
+  # The FILE STRINGS command would be a bit better, but I'm not totally sure
+  # the match will always be to a whole line, and I don't want to break things.
+  file(READ ${filename} file_contents)
+  string(REGEX MATCHALL "${regexp}"
+    match_result ${file_contents}
+    )
+  if(match_result)
+    set(${variable} "${match_result}" PARENT_SCOPE)
+  else()
+    set(${variable} "${default}" PARENT_SCOPE)
+  endif()
+endfunction(latex_file_match)
+
+# A version of GET_FILENAME_COMPONENT that treats extensions after the last
+# period rather than the first.  To the best of my knowledge, all filenames
+# typically used by LaTeX, including image files, have small extensions
+# after the last dot.
+function(latex_get_filename_component varname filename type)
+  set(result)
+  if("${type}" STREQUAL "NAME_WE")
+    get_filename_component(name ${filename} NAME)
+    string(REGEX REPLACE "\\.[^.]*\$" "" result "${name}")
+  elseif("${type}" STREQUAL "EXT")
+    get_filename_component(name ${filename} NAME)
+    string(REGEX MATCH "\\.[^.]*\$" result "${name}")
+  else()
+    get_filename_component(result ${filename} ${type})
+  endif()
+  set(${varname} "${result}" PARENT_SCOPE)
+endfunction(latex_get_filename_component)
+
+#############################################################################
+# Functions that perform processing during a LaTeX build.
+#############################################################################
+function(latex_execute_latex)
+  if(NOT LATEX_TARGET)
+    message(SEND_ERROR "Need to define LATEX_TARGET")
+  endif()
+
+  if(NOT LATEX_WORKING_DIRECTORY)
+    message(SEND_ERROR "Need to define LATEX_WORKING_DIRECTORY")
+  endif()
+
+  if(NOT LATEX_FULL_COMMAND)
+    message(SEND_ERROR "Need to define LATEX_FULL_COMMAND")
+  endif()
+
+  if(NOT LATEX_OUTPUT_FILE)
+    message(SEND_ERROR "Need to define LATEX_OUTPUT_FILE")
+  endif()
+
+  set(full_command_original "${LATEX_FULL_COMMAND}")
+
+  # Chose the native method for parsing command arguments. Newer versions of
+  # CMake allow you to just use NATIVE_COMMAND.
+  if (CMAKE_VERSION VERSION_GREATER 3.8)
+    set(separate_arguments_mode NATIVE_COMMAND)
+  else()
+    if (WIN32)
+      set(separate_arguments_mode WINDOWS_COMMAND)
+    else()
+      set(separate_arguments_mode UNIX_COMMAND)
+    endif()
+  endif()
+
+  # Preps variables for use in execute_process.
+  # Even though we expect LATEX_WORKING_DIRECTORY to have a single "argument,"
+  # we also want to make sure that we strip out any escape characters that can
+  # foul up the WORKING_DIRECTORY argument.
+  separate_arguments(LATEX_FULL_COMMAND UNIX_COMMAND "${LATEX_FULL_COMMAND}")
+  separate_arguments(LATEX_WORKING_DIRECTORY UNIX_COMMAND "${LATEX_WORKING_DIRECTORY}")
+
+  execute_process(
+    COMMAND ${LATEX_FULL_COMMAND}
+    WORKING_DIRECTORY ${LATEX_WORKING_DIRECTORY}
+    RESULT_VARIABLE execute_result
+    )
+
+  if(NOT ${execute_result} EQUAL 0)
+    # LaTeX tends to write a file when a failure happens. Delete that file so
+    # that LaTeX will run again.
+    file(REMOVE "${LATEX_WORKING_DIRECTORY}/${LATEX_OUTPUT_FILE}")
+
+    message("\n\nLaTeX command failed")
+    message("${full_command_original}")
+    message("Log output:")
+    file(READ ${LATEX_WORKING_DIRECTORY}/${LATEX_TARGET}.log log_output)
+    message("${log_output}")
+    message(FATAL_ERROR
+      "Successfully executed LaTeX, but LaTeX returned an error.")
+  endif()
+endfunction(latex_execute_latex)
+
+function(latex_makeglossaries)
+  # This is really a bare bones port of the makeglossaries perl script into
+  # CMake scripting.
+  message("**************************** In makeglossaries")
+  if(NOT LATEX_TARGET)
+    message(SEND_ERROR "Need to define LATEX_TARGET")
+  endif()
+
+  set(aux_file ${LATEX_TARGET}.aux)
+
+  if(NOT EXISTS ${aux_file})
+    message(SEND_ERROR "${aux_file} does not exist.  Run latex on your target file.")
+  endif()
+
+  latex_file_match(newglossary_lines ${aux_file}
+    "@newglossary[ \t]*{([^}]*)}{([^}]*)}{([^}]*)}{([^}]*)}"
+    "@newglossary{main}{glg}{gls}{glo}"
+    )
+
+  latex_file_match(istfile_line ${aux_file}
+    "@istfilename[ \t]*{([^}]*)}"
+    "@istfilename{${LATEX_TARGET}.ist}"
+    )
+  string(REGEX REPLACE "@istfilename[ \t]*{([^}]*)}" "\\1"
+    istfile ${istfile_line}
+    )
+
+  string(REGEX MATCH ".*\\.xdy" use_xindy "${istfile}")
+  if(use_xindy)
+    message("*************** Using xindy")
+    if(NOT XINDY_COMPILER)
+      message(SEND_ERROR "Need to define XINDY_COMPILER")
+    endif()
+  else()
+    message("*************** Using makeindex")
+    if(NOT MAKEINDEX_COMPILER)
+      message(SEND_ERROR "Need to define MAKEINDEX_COMPILER")
+    endif()
+  endif()
+
+  foreach(newglossary ${newglossary_lines})
+    string(REGEX REPLACE
+      "@newglossary[ \t]*{([^}]*)}{([^}]*)}{([^}]*)}{([^}]*)}"
+      "\\1" glossary_name ${newglossary}
+      )
+    string(REGEX REPLACE
+      "@newglossary[ \t]*{([^}]*)}{([^}]*)}{([^}]*)}{([^}]*)}"
+      "${LATEX_TARGET}.\\2" glossary_log ${newglossary}
+      )
+    string(REGEX REPLACE
+      "@newglossary[ \t]*{([^}]*)}{([^}]*)}{([^}]*)}{([^}]*)}"
+      "${LATEX_TARGET}.\\3" glossary_out ${newglossary}
+      )
+    string(REGEX REPLACE
+      "@newglossary[ \t]*{([^}]*)}{([^}]*)}{([^}]*)}{([^}]*)}"
+      "${LATEX_TARGET}.\\4" glossary_in ${newglossary}
+      )
+
+    if(use_xindy)
+      latex_file_match(xdylanguage_line ${aux_file}
+        "@xdylanguage[ \t]*{${glossary_name}}{([^}]*)}"
+        "@xdylanguage{${glossary_name}}{english}"
+        )
+      string(REGEX REPLACE
+        "@xdylanguage[ \t]*{${glossary_name}}{([^}]*)}"
+        "\\1"
+        language
+        ${xdylanguage_line}
+        )
+      # What crazy person makes a LaTeX index generator that uses different
+      # identifiers for language than babel (or at least does not support
+      # the old ones)?
+      if(${language} STREQUAL "frenchb")
+        set(language "french")
+      elseif(${language} MATCHES "^n?germanb?$")
+        set(language "german")
+      elseif(${language} STREQUAL "magyar")
+        set(language "hungarian")
+      elseif(${language} STREQUAL "lsorbian")
+        set(language "lower-sorbian")
+      elseif(${language} STREQUAL "norsk")
+        set(language "norwegian")
+      elseif(${language} STREQUAL "portuges")
+        set(language "portuguese")
+      elseif(${language} STREQUAL "russianb")
+        set(language "russian")
+      elseif(${language} STREQUAL "slovene")
+        set(language "slovenian")
+      elseif(${language} STREQUAL "ukraineb")
+        set(language "ukrainian")
+      elseif(${language} STREQUAL "usorbian")
+        set(language "upper-sorbian")
+      endif()
+      if(language)
+        set(language_flags "-L ${language}")
+      else()
+        set(language_flags "")
+      endif()
+
+      latex_file_match(codepage_line ${aux_file}
+        "@gls@codepage[ \t]*{${glossary_name}}{([^}]*)}"
+        "@gls@codepage{${glossary_name}}{utf}"
+        )
+      string(REGEX REPLACE
+        "@gls@codepage[ \t]*{${glossary_name}}{([^}]*)}"
+        "\\1"
+        codepage
+        ${codepage_line}
+        )
+      if(codepage)
+        set(codepage_flags "-C ${codepage}")
+      else()
+        # Ideally, we would check that the language is compatible with the
+        # default codepage, but I'm hoping that distributions will be smart
+        # enough to specify their own codepage.  I know, it's asking a lot.
+        set(codepage_flags "")
+      endif()
+
+      message("${XINDY_COMPILER} ${MAKEGLOSSARIES_COMPILER_ARGS} ${language_flags} ${codepage_flags} -I xindy -M ${glossary_name} -t ${glossary_log} -o ${glossary_out} ${glossary_in}"
+        )
+      exec_program(${XINDY_COMPILER}
+        ARGS ${MAKEGLOSSARIES_COMPILER_ARGS}
+          ${language_flags}
+          ${codepage_flags}
+          -I xindy
+          -M ${glossary_name}
+          -t ${glossary_log}
+          -o ${glossary_out}
+          ${glossary_in}
+        OUTPUT_VARIABLE xindy_output
+        )
+      message("${xindy_output}")
+
+      # So, it is possible (perhaps common?) for aux files to specify a
+      # language and codepage that are incompatible with each other.  Check
+      # for that condition, and if it happens run again with the default
+      # codepage.
+      if("${xindy_output}" MATCHES "^Cannot locate xindy module for language (.+) in codepage (.+)\\.$")
+        message("*************** Retrying xindy with default codepage.")
+        exec_program(${XINDY_COMPILER}
+          ARGS ${MAKEGLOSSARIES_COMPILER_ARGS}
+            ${language_flags}
+            -I xindy
+            -M ${glossary_name}
+            -t ${glossary_log}
+            -o ${glossary_out}
+            ${glossary_in}
+          )
+      endif()
+
+    else()
+      message("${MAKEINDEX_COMPILER} ${MAKEGLOSSARIES_COMPILER_ARGS} -s ${istfile} -t ${glossary_log} -o ${glossary_out} ${glossary_in}")
+      exec_program(${MAKEINDEX_COMPILER} ARGS ${MAKEGLOSSARIES_COMPILER_ARGS}
+        -s ${istfile} -t ${glossary_log} -o ${glossary_out} ${glossary_in}
+        )
+    endif()
+
+  endforeach(newglossary)
+endfunction(latex_makeglossaries)
+
+function(latex_makenomenclature)
+  message("**************************** In makenomenclature")
+  if(NOT LATEX_TARGET)
+    message(SEND_ERROR "Need to define LATEX_TARGET")
+  endif()
+
+  if(NOT MAKEINDEX_COMPILER)
+    message(SEND_ERROR "Need to define MAKEINDEX_COMPILER")
+  endif()
+
+  set(nomencl_out ${LATEX_TARGET}.nls)
+  set(nomencl_in ${LATEX_TARGET}.nlo)
+
+  exec_program(${MAKEINDEX_COMPILER} ARGS ${MAKENOMENCLATURE_COMPILER_ARGS}
+    ${nomencl_in} -s "nomencl.ist" -o ${nomencl_out}
+    )
+endfunction(latex_makenomenclature)
+
+function(latex_correct_synctex)
+  message("**************************** In correct SyncTeX")
+  if(NOT LATEX_TARGET)
+    message(SEND_ERROR "Need to define LATEX_TARGET")
+  endif()
+
+  if(NOT GZIP)
+    message(SEND_ERROR "Need to define GZIP")
+  endif()
+
+  if(NOT LATEX_SOURCE_DIRECTORY)
+    message(SEND_ERROR "Need to define LATEX_SOURCE_DIRECTORY")
+  endif()
+
+  if(NOT LATEX_BINARY_DIRECTORY)
+    message(SEND_ERROR "Need to define LATEX_BINARY_DIRECTORY")
+  endif()
+
+  set(synctex_file ${LATEX_BINARY_DIRECTORY}/${LATEX_TARGET}.synctex)
+  set(synctex_file_gz ${synctex_file}.gz)
+
+  if(EXISTS ${synctex_file_gz})
+
+    message("Making backup of synctex file.")
+    configure_file(${synctex_file_gz} ${synctex_file}.bak.gz COPYONLY)
+
+    message("Uncompressing synctex file.")
+    exec_program(${GZIP}
+      ARGS --decompress ${synctex_file_gz}
+      )
+
+    message("Reading synctex file.")
+    file(READ ${synctex_file} synctex_data)
+
+    message("Replacing relative with absolute paths.")
+    string(REGEX REPLACE
+      "(Input:[0-9]+:)([^/\n][^\n]*)"
+      "\\1${LATEX_SOURCE_DIRECTORY}/\\2"
+      synctex_data
+      "${synctex_data}"
+      )
+
+    message("Writing synctex file.")
+    file(WRITE ${synctex_file} "${synctex_data}")
+
+    message("Compressing synctex file.")
+    exec_program(${GZIP}
+      ARGS ${synctex_file}
+      )
+
+  else()
+
+    message(SEND_ERROR "File ${synctex_file_gz} not found.  Perhaps synctex is not supported by your LaTeX compiler.")
+
+  endif()
+
+endfunction(latex_correct_synctex)
+
+function(latex_check_important_warnings)
+  set(log_file ${LATEX_TARGET}.log)
+
+  message("\nChecking ${log_file} for important warnings.")
+  if(NOT LATEX_TARGET)
+    message(SEND_ERROR "Need to define LATEX_TARGET")
+  endif()
+
+  if(NOT EXISTS ${log_file})
+    message("Could not find log file: ${log_file}")
+    return()
+  endif()
+
+  set(found_error)
+
+  file(READ ${log_file} log)
+
+  # Check for undefined references
+  string(REGEX MATCHALL
+    "\n[^\n]*Reference[^\n]*undefined[^\n]*"
+    reference_warnings
+    "${log}")
+  if(reference_warnings)
+    set(found_error TRUE)
+    message("\nFound missing reference warnings.")
+    foreach(warning ${reference_warnings})
+      string(STRIP "${warning}" warning_no_newline)
+      message("${warning_no_newline}")
+    endforeach(warning)
+  endif()
+
+  # Check for natbib warnings
+  string(REGEX MATCHALL
+    "\nPackage natbib Warning:[^\n]*"
+    natbib_warnings
+    "${log}")
+  if(natbib_warnings)
+    set(found_error TRUE)
+    message("\nFound natbib package warnings.")
+    foreach(warning ${natbib_warnings})
+      string(STRIP "${warning}" warning_no_newline)
+      message("${warning_no_newline}")
+    endforeach(warning)
+  endif()
+
+  # Check for overfull
+  string(REGEX MATCHALL
+    "\nOverfull[^\n]*"
+    overfull_warnings
+    "${log}")
+  if(overfull_warnings)
+    set(found_error TRUE)
+    message("\nFound overfull warnings. These are indicative of layout errors.")
+    foreach(warning ${overfull_warnings})
+      string(STRIP "${warning}" warning_no_newline)
+      message("${warning_no_newline}")
+    endforeach(warning)
+  endif()
+
+  # Check for invalid characters
+  string(REGEX MATCHALL
+    "\nMissing character:[^\n]*"
+    invalid_character_warnings
+    "${log}")
+  if(invalid_character_warnings)
+    set(found_error TRUE)
+    message("\nFound invalid character warnings. These characters are likely not printed correctly.")
+    foreach(warning ${invalid_character_warnings})
+      string(STRIP "${warning}" warning_no_newline)
+      message("${warning_no_newline}")
+    endforeach(warning)
+  endif()
+
+  if(found_error)
+    latex_get_filename_component(log_file_path ${log_file} ABSOLUTE)
+    message("\nConsult ${log_file_path} for more information on LaTeX build.")
+  else()
+    message("No known important warnings found.")
+  endif(found_error)
+endfunction(latex_check_important_warnings)
+
+#############################################################################
+# Helper functions for establishing LaTeX build.
+#############################################################################
+
+function(latex_needit VAR NAME)
+  if(NOT ${VAR})
+    message(SEND_ERROR "I need the ${NAME} command.")
+  endif()
+endfunction(latex_needit)
+
+function(latex_wantit VAR NAME)
+  if(NOT ${VAR})
+    message(STATUS "I could not find the ${NAME} command.")
+  endif()
+endfunction(latex_wantit)
+
+function(latex_setup_variables)
+  set(LATEX_OUTPUT_PATH "${LATEX_OUTPUT_PATH}"
+    CACHE PATH "If non empty, specifies the location to place LaTeX output."
+    )
+
+  find_package(LATEX)
+
+  find_program(XINDY_COMPILER
+    NAME xindy
+    PATHS ${MIKTEX_BINARY_PATH} /usr/bin
+    )
+
+  find_package(UnixCommands)
+
+  find_program(PDFTOPS_CONVERTER
+    NAMES pdftops
+    DOC "The pdf to ps converter program from the Poppler package."
+    )
+
+  find_program(HTLATEX_COMPILER
+    NAMES htlatex
+    PATHS ${MIKTEX_BINARY_PATH}
+      /usr/bin
+    )
+
+  mark_as_advanced(
+    LATEX_COMPILER
+    PDFLATEX_COMPILER
+    BIBTEX_COMPILER
+    BIBER_COMPILER
+    MAKEINDEX_COMPILER
+    XINDY_COMPILER
+    DVIPS_CONVERTER
+    PS2PDF_CONVERTER
+    PDFTOPS_CONVERTER
+    LATEX2HTML_CONVERTER
+    HTLATEX_COMPILER
+    )
+
+  latex_needit(LATEX_COMPILER latex)
+  latex_wantit(PDFLATEX_COMPILER pdflatex)
+  latex_wantit(HTLATEX_COMPILER htlatex)
+  latex_needit(BIBTEX_COMPILER bibtex)
+  latex_wantit(BIBER_COMPILER biber)
+  latex_needit(MAKEINDEX_COMPILER makeindex)
+  latex_wantit(DVIPS_CONVERTER dvips)
+  latex_wantit(PS2PDF_CONVERTER ps2pdf)
+  latex_wantit(PDFTOPS_CONVERTER pdftops)
+
+  set(LATEX_COMPILER_FLAGS "-interaction=batchmode -file-line-error"
+    CACHE STRING "Flags passed to latex.")
+  set(PDFLATEX_COMPILER_FLAGS ${LATEX_COMPILER_FLAGS}
+    CACHE STRING "Flags passed to pdflatex.")
+  set(HTLATEX_COMPILER_TEX4HT_FLAGS "html"
+    CACHE STRING "Options for the tex4ht.sty and *.4ht style files.")
+  set(HTLATEX_COMPILER_TEX4HT_POSTPROCESSOR_FLAGS ""
+    CACHE STRING "Options for the text4ht postprocessor.")
+  set(HTLATEX_COMPILER_T4HT_POSTPROCESSOR_FLAGS ""
+    CACHE STRING "Options for the t4ht postprocessor.")
+  set(HTLATEX_COMPILER_LATEX_FLAGS ${LATEX_COMPILER_FLAGS}
+    CACHE STRING "Flags passed from htlatex to the LaTeX compiler.")
+  set(LATEX_SYNCTEX_FLAGS "-synctex=1"
+    CACHE STRING "latex/pdflatex flags used to create synctex file.")
+  set(BIBTEX_COMPILER_FLAGS ""
+    CACHE STRING "Flags passed to bibtex.")
+  set(BIBER_COMPILER_FLAGS ""
+    CACHE STRING "Flags passed to biber.")
+  set(MAKEINDEX_COMPILER_FLAGS ""
+    CACHE STRING "Flags passed to makeindex.")
+  set(MAKEGLOSSARIES_COMPILER_FLAGS ""
+    CACHE STRING "Flags passed to makeglossaries.")
+  set(MAKENOMENCLATURE_COMPILER_FLAGS ""
+    CACHE STRING "Flags passed to makenomenclature.")
+  set(DVIPS_CONVERTER_FLAGS "-Ppdf -G0 -t letter"
+    CACHE STRING "Flags passed to dvips.")
+  if(NOT WIN32)
+    set(PS2PDF_CONVERTER_FLAGS "-dMaxSubsetPct=100 -dCompatibilityLevel=1.3 -dSubsetFonts=true -dEmbedAllFonts=true -dAutoFilterColorImages=false -dAutoFilterGrayImages=false -dColorImageFilter=/FlateEncode -dGrayImageFilter=/FlateEncode -dMonoImageFilter=/FlateEncode"
+      CACHE STRING "Flags passed to ps2pdf.")
+  else()
+    # Most windows ports of ghostscript utilities use .bat files for ps2pdf
+    # commands. bat scripts interpret "=" as a special character and separate
+    # those arguments. To get around this, the ghostscript utilities also
+    # support using "#" in place of "=".
+    set(PS2PDF_CONVERTER_FLAGS "-dMaxSubsetPct#100 -dCompatibilityLevel#1.3 -dSubsetFonts#true -dEmbedAllFonts#true -dAutoFilterColorImages#false -dAutoFilterGrayImages#false -dColorImageFilter#/FlateEncode -dGrayImageFilter#/FlateEncode -dMonoImageFilter#/FlateEncode"
+      CACHE STRING "Flags passed to ps2pdf.")
+  endif()
+  set(PDFTOPS_CONVERTER_FLAGS ""
+    CACHE STRING "Flags passed to pdftops.")
+  mark_as_advanced(
+    LATEX_COMPILER_FLAGS
+    PDFLATEX_COMPILER_FLAGS
+    HTLATEX_COMPILER_TEX4HT_FLAGS
+    HTLATEX_COMPILER_TEX4HT_POSTPROCESSOR_FLAGS
+    HTLATEX_COMPILER_T4HT_POSTPROCESSOR_FLAGS
+    HTLATEX_COMPILER_LATEX_FLAGS
+    LATEX_SYNCTEX_FLAGS
+    BIBTEX_COMPILER_FLAGS
+    BIBER_COMPILER_FLAGS
+    MAKEINDEX_COMPILER_FLAGS
+    MAKEGLOSSARIES_COMPILER_FLAGS
+    MAKENOMENCLATURE_COMPILER_FLAGS
+    DVIPS_CONVERTER_FLAGS
+    PS2PDF_CONVERTER_FLAGS
+    PDFTOPS_CONVERTER_FLAGS
+    )
+
+  # Because it is easier to type, the flags variables are entered as
+  # space-separated strings much like you would in a shell. However, when
+  # using a CMake command to execute a program, it works better to hold the
+  # arguments in semicolon-separated lists (otherwise the whole string will
+  # be interpreted as a single argument). Use the separate_arguments to
+  # convert the space-separated strings to semicolon-separated lists.
+  separate_arguments(LATEX_COMPILER_FLAGS)
+  separate_arguments(PDFLATEX_COMPILER_FLAGS)
+  separate_arguments(HTLATEX_COMPILER_LATEX_FLAGS)
+  separate_arguments(LATEX_SYNCTEX_FLAGS)
+  separate_arguments(BIBTEX_COMPILER_FLAGS)
+  separate_arguments(BIBER_COMPILER_FLAGS)
+  separate_arguments(MAKEINDEX_COMPILER_FLAGS)
+  separate_arguments(MAKEGLOSSARIES_COMPILER_FLAGS)
+  separate_arguments(MAKENOMENCLATURE_COMPILER_FLAGS)
+  separate_arguments(DVIPS_CONVERTER_FLAGS)
+  separate_arguments(PS2PDF_CONVERTER_FLAGS)
+  separate_arguments(PDFTOPS_CONVERTER_FLAGS)
+
+  # Not quite done. When you call separate_arguments on a cache variable,
+  # the result is written to a local variable. That local variable goes
+  # away when this function returns (which is before any of them are used).
+  # So, copy these variables with local scope to cache variables with
+  # global scope.
+  set(LATEX_COMPILER_ARGS "${LATEX_COMPILER_FLAGS}" CACHE INTERNAL "")
+  set(PDFLATEX_COMPILER_ARGS "${PDFLATEX_COMPILER_FLAGS}" CACHE INTERNAL "")
+  set(HTLATEX_COMPILER_ARGS "${HTLATEX_COMPILER_LATEX_FLAGS}" CACHE INTERNAL "")
+  set(LATEX_SYNCTEX_ARGS "${LATEX_SYNCTEX_FLAGS}" CACHE INTERNAL "")
+  set(BIBTEX_COMPILER_ARGS "${BIBTEX_COMPILER_FLAGS}" CACHE INTERNAL "")
+  set(BIBER_COMPILER_ARGS "${BIBER_COMPILER_FLAGS}" CACHE INTERNAL "")
+  set(MAKEINDEX_COMPILER_ARGS "${MAKEINDEX_COMPILER_FLAGS}" CACHE INTERNAL "")
+  set(MAKEGLOSSARIES_COMPILER_ARGS "${MAKEGLOSSARIES_COMPILER_FLAGS}" CACHE INTERNAL "")
+  set(MAKENOMENCLATURE_COMPILER_ARGS "${MAKENOMENCLATURE_COMPILER_FLAGS}" CACHE INTERNAL "")
+  set(DVIPS_CONVERTER_ARGS "${DVIPS_CONVERTER_FLAGS}" CACHE INTERNAL "")
+  set(PS2PDF_CONVERTER_ARGS "${PS2PDF_CONVERTER_FLAGS}" CACHE INTERNAL "")
+  set(PDFTOPS_CONVERTER_ARGS "${PDFTOPS_CONVERTER_FLAGS}" CACHE INTERNAL "")
+
+  find_program(IMAGEMAGICK_CONVERT
+    NAMES magick convert
+    DOC "The convert program that comes with ImageMagick (available at http://www.imagemagick.org)."
+    )
+  mark_as_advanced(IMAGEMAGICK_CONVERT)
+
+  if(DEFINED ENV{LATEX_DEFAULT_BUILD})
+    set(default_build $ENV{LATEX_DEFAULT_BUILD})
+  else()
+    set(default_build pdf)
+  endif()
+
+  set(LATEX_DEFAULT_BUILD "${default_build}" CACHE STRING
+    "Choose the default type of LaTeX build. Valid options are pdf, dvi, ps, safepdf, html"
+    )
+  set_property(CACHE LATEX_DEFAULT_BUILD
+    PROPERTY STRINGS pdf dvi ps safepdf html
+    )
+
+  option(LATEX_USE_SYNCTEX
+    "If on, have LaTeX generate a synctex file, which WYSIWYG editors can use to correlate output files like dvi and pdf with the lines of LaTeX source that generates them.  In addition to adding the LATEX_SYNCTEX_FLAGS to the command line, this option also adds build commands that \"corrects\" the resulting synctex file to point to the original LaTeX files rather than those generated by UseLATEX.cmake."
+    OFF
+    )
+
+  option(LATEX_SMALL_IMAGES
+    "If on, the raster images will be converted to 1/6 the original size.  This is because papers usually require 600 dpi images whereas most monitors only require at most 96 dpi.  Thus, smaller images make smaller files for web distribution and can make it faster to read dvi files."
+    OFF)
+  if(LATEX_SMALL_IMAGES)
+    set(LATEX_RASTER_SCALE 16 PARENT_SCOPE)
+    set(LATEX_OPPOSITE_RASTER_SCALE 100 PARENT_SCOPE)
+  else()
+    set(LATEX_RASTER_SCALE 100 PARENT_SCOPE)
+    set(LATEX_OPPOSITE_RASTER_SCALE 16 PARENT_SCOPE)
+  endif()
+
+  # Just holds extensions for known image types.  They should all be lower case.
+  # For historical reasons, these are all declared in the global scope.
+  set(LATEX_DVI_VECTOR_IMAGE_EXTENSIONS .eps CACHE INTERNAL "")
+  set(LATEX_DVI_RASTER_IMAGE_EXTENSIONS CACHE INTERNAL "")
+  set(LATEX_DVI_IMAGE_EXTENSIONS
+    ${LATEX_DVI_VECTOR_IMAGE_EXTENSIONS}
+    ${LATEX_DVI_RASTER_IMAGE_EXTENSIONS}
+    CACHE INTERNAL ""
+    )
+
+  set(LATEX_PDF_VECTOR_IMAGE_EXTENSIONS .pdf CACHE INTERNAL "")
+  set(LATEX_PDF_RASTER_IMAGE_EXTENSIONS .jpeg .jpg .png CACHE INTERNAL "")
+  set(LATEX_PDF_IMAGE_EXTENSIONS
+    ${LATEX_PDF_VECTOR_IMAGE_EXTENSIONS}
+    ${LATEX_PDF_RASTER_IMAGE_EXTENSIONS}
+    CACHE INTERNAL ""
+    )
+
+  set(LATEX_OTHER_VECTOR_IMAGE_EXTENSIONS .ai .dot .svg CACHE INTERNAL "")
+  set(LATEX_OTHER_RASTER_IMAGE_EXTENSIONS
+    .bmp .bmp2 .bmp3 .dcm .dcx .ico .gif .pict .ppm .tif .tiff
+    CACHE INTERNAL "")
+  set(LATEX_OTHER_IMAGE_EXTENSIONS
+    ${LATEX_OTHER_VECTOR_IMAGE_EXTENSIONS}
+    ${LATEX_OTHER_RASTER_IMAGE_EXTENSIONS}
+    CACHE INTERNAL ""
+    )
+
+  set(LATEX_VECTOR_IMAGE_EXTENSIONS
+    ${LATEX_DVI_VECTOR_IMAGE_EXTENSIONS}
+    ${LATEX_PDF_VECTOR_IMAGE_EXTENSIONS}
+    ${LATEX_OTHER_VECTOR_IMAGE_EXTENSIONS}
+    CACHE INTERNAL ""
+    )
+  set(LATEX_RASTER_IMAGE_EXTENSIONS
+    ${LATEX_DVI_RASTER_IMAGE_EXTENSIONS}
+    ${LATEX_PDF_RASTER_IMAGE_EXTENSIONS}
+    ${LATEX_OTHER_RASTER_IMAGE_EXTENSIONS}
+    CACHE INTERNAL ""
+    )
+  set(LATEX_IMAGE_EXTENSIONS
+    ${LATEX_DVI_IMAGE_EXTENSIONS}
+    ${LATEX_PDF_IMAGE_EXTENSIONS}
+    ${LATEX_OTHER_IMAGE_EXTENSIONS}
+    CACHE INTERNAL ""
+    )
+endfunction(latex_setup_variables)
+
+function(latex_setup_targets)
+  if(NOT TARGET pdf)
+    add_custom_target(pdf)
+  endif()
+  if(NOT TARGET dvi)
+    add_custom_target(dvi)
+  endif()
+  if(NOT TARGET ps)
+    add_custom_target(ps)
+  endif()
+  if(NOT TARGET safepdf)
+    add_custom_target(safepdf)
+  endif()
+  if(NOT TARGET html)
+    add_custom_target(html)
+  endif()
+  if(NOT TARGET auxclean)
+    add_custom_target(auxclean)
+  endif()
+endfunction(latex_setup_targets)
+
+function(latex_get_output_path var)
+  set(latex_output_path)
+  if(LATEX_OUTPUT_PATH)
+    get_filename_component(
+      LATEX_OUTPUT_PATH_FULL "${LATEX_OUTPUT_PATH}" ABSOLUTE
+      )
+    if("${LATEX_OUTPUT_PATH_FULL}" STREQUAL "${CMAKE_CURRENT_SOURCE_DIR}")
+      message(SEND_ERROR "You cannot set LATEX_OUTPUT_PATH to the same directory that contains LaTeX input files.")
+    else()
+      set(latex_output_path "${LATEX_OUTPUT_PATH_FULL}")
+    endif()
+  else()
+    if("${CMAKE_CURRENT_BINARY_DIR}" STREQUAL "${CMAKE_CURRENT_SOURCE_DIR}")
+      message(SEND_ERROR "LaTeX files must be built out of source or you must set LATEX_OUTPUT_PATH.")
+    else()
+      set(latex_output_path "${CMAKE_CURRENT_BINARY_DIR}")
+    endif()
+  endif()
+  set(${var} ${latex_output_path} PARENT_SCOPE)
+endfunction(latex_get_output_path)
+
+function(latex_add_convert_command
+    output_path
+    input_path
+    output_extension
+    input_extension
+    flags
+    )
+  set(require_imagemagick_convert TRUE)
+  set(convert_flags "")
+  if(${input_extension} STREQUAL ".eps" AND ${output_extension} STREQUAL ".pdf")
+    # ImageMagick has broken eps to pdf conversion
+    # use ps2pdf instead
+    if(PS2PDF_CONVERTER)
+      set(require_imagemagick_convert FALSE)
+      set(converter ${PS2PDF_CONVERTER})
+      set(convert_flags -dEPSCrop ${PS2PDF_CONVERTER_ARGS})
+    else()
+      message(SEND_ERROR "Using postscript files with pdflatex requires ps2pdf for conversion.")
+    endif()
+  elseif(${input_extension} STREQUAL ".pdf" AND ${output_extension} STREQUAL ".eps")
+    # ImageMagick can also be sketchy on pdf to eps conversion.  Not good with
+    # color spaces and tends to unnecessarily rasterize.
+    # use pdftops instead
+    if(PDFTOPS_CONVERTER)
+      set(require_imagemagick_convert FALSE)
+      set(converter ${PDFTOPS_CONVERTER})
+      set(convert_flags -eps ${PDFTOPS_CONVERTER_ARGS})
+    else()
+      message(STATUS "Consider getting pdftops from Poppler to convert PDF images to EPS images.")
+      set(convert_flags ${flags})
+    endif()
+  else()
+    set(convert_flags ${flags})
+  endif()
+
+  if(require_imagemagick_convert)
+    if(IMAGEMAGICK_CONVERT)
+      string(TOLOWER ${IMAGEMAGICK_CONVERT} IMAGEMAGICK_CONVERT_LOWERCASE)
+      if(${IMAGEMAGICK_CONVERT_LOWERCASE} MATCHES "system32[/\\\\]convert\\.exe")
+        message(SEND_ERROR "IMAGEMAGICK_CONVERT set to Window's convert.exe for changing file systems rather than ImageMagick's convert for changing image formats. Please make sure ImageMagick is installed (available at http://www.imagemagick.org). If you have a recent version of ImageMagick (7.0 or higher), use the magick program instead of convert for IMAGEMAGICK_CONVERT.")
+      else()
+        set(converter ${IMAGEMAGICK_CONVERT})
+        # ImageMagick requires a special order of arguments where resize and
+        # arguments of that nature must be placed after the input image path.
+        add_custom_command(OUTPUT ${output_path}
+          COMMAND ${converter}
+            ARGS ${input_path} ${convert_flags} ${output_path}
+          DEPENDS ${input_path}
+          )
+      endif()
+    else()
+      message(SEND_ERROR "Could not find convert program. Please download ImageMagick from http://www.imagemagick.org and install.")
+    endif()
+  else() # Not ImageMagick convert
+    add_custom_command(OUTPUT ${output_path}
+      COMMAND ${converter}
+        ARGS ${convert_flags} ${input_path} ${output_path}
+      DEPENDS ${input_path}
+      )
+  endif()
+endfunction(latex_add_convert_command)
+
+# Makes custom commands to convert a file to a particular type.
+function(latex_convert_image
+    output_files_var
+    input_file
+    output_extension
+    convert_flags
+    output_extensions
+    other_files
+    )
+  set(output_file_list)
+  set(input_dir ${CMAKE_CURRENT_SOURCE_DIR})
+  latex_get_output_path(output_dir)
+
+  latex_get_filename_component(extension "${input_file}" EXT)
+
+  # Check input filename for potential problems with LaTeX.
+  latex_get_filename_component(name "${input_file}" NAME_WE)
+  set(suggested_name "${name}")
+  if(suggested_name MATCHES ".*\\..*")
+    string(REPLACE "." "-" suggested_name "${suggested_name}")
+  endif()
+  if(suggested_name MATCHES ".* .*")
+    string(REPLACE " " "-" suggested_name "${suggested_name}")
+  endif()
+  if(NOT suggested_name STREQUAL name)
+    message(WARNING "Some LaTeX distributions have problems with image file names with multiple extensions or spaces. Consider changing ${name}${extension} to something like ${suggested_name}${extension}.")
+  endif()
+
+  string(REGEX REPLACE "\\.[^.]*\$" ${output_extension} output_file
+    "${input_file}")
+
+  latex_list_contains(is_type ${extension} ${output_extensions})
+  if(is_type)
+    if(convert_flags)
+      latex_add_convert_command(${output_dir}/${output_file}
+        ${input_dir}/${input_file} ${output_extension} ${extension}
+        "${convert_flags}")
+      set(output_file_list ${output_dir}/${output_file})
+    else()
+      # As a shortcut, we can just copy the file.
+      add_custom_command(OUTPUT ${output_dir}/${input_file}
+        COMMAND ${CMAKE_COMMAND}
+        ARGS -E copy ${input_dir}/${input_file} ${output_dir}/${input_file}
+        DEPENDS ${input_dir}/${input_file}
+        )
+      set(output_file_list ${output_dir}/${input_file})
+    endif()
+  else()
+    set(do_convert TRUE)
+    # Check to see if there is another input file of the appropriate type.
+    foreach(valid_extension ${output_extensions})
+      string(REGEX REPLACE "\\.[^.]*\$" ${output_extension} try_file
+        "${input_file}")
+      latex_list_contains(has_native_file "${try_file}" ${other_files})
+      if(has_native_file)
+        set(do_convert FALSE)
+      endif()
+    endforeach(valid_extension)
+
+    # If we still need to convert, do it.
+    if(do_convert)
+      latex_add_convert_command(${output_dir}/${output_file}
+        ${input_dir}/${input_file} ${output_extension} ${extension}
+        "${convert_flags}")
+      set(output_file_list ${output_dir}/${output_file})
+    endif()
+  endif()
+
+  set(${output_files_var} ${output_file_list} PARENT_SCOPE)
+endfunction(latex_convert_image)
+
+# Adds custom commands to process the given files for dvi and pdf builds.
+# Adds the output files to the given variables (does not replace).
+function(latex_process_images dvi_outputs_var pdf_outputs_var)
+  latex_get_output_path(output_dir)
+  set(dvi_outputs)
+  set(pdf_outputs)
+  foreach(file ${ARGN})
+    if(EXISTS "${CMAKE_CURRENT_SOURCE_DIR}/${file}")
+      latex_get_filename_component(extension "${file}" EXT)
+      set(convert_flags)
+
+      # Check to see if we need to downsample the image.
+      latex_list_contains(is_raster "${extension}"
+        ${LATEX_RASTER_IMAGE_EXTENSIONS})
+      if(LATEX_SMALL_IMAGES)
+        if(is_raster)
+          set(convert_flags -resize ${LATEX_RASTER_SCALE}%)
+        endif()
+      endif()
+
+      # Make sure the output directory exists.
+      latex_get_filename_component(path "${output_dir}/${file}" PATH)
+      make_directory("${path}")
+
+      # Do conversions for dvi.
+      latex_convert_image(output_files "${file}" .eps "${convert_flags}"
+        "${LATEX_DVI_IMAGE_EXTENSIONS}" "${ARGN}")
+      list(APPEND dvi_outputs ${output_files})
+
+      # Do conversions for pdf.
+      if(is_raster)
+        latex_convert_image(output_files "${file}" .png "${convert_flags}"
+          "${LATEX_PDF_IMAGE_EXTENSIONS}" "${ARGN}")
+        list(APPEND pdf_outputs ${output_files})
+      else()
+        latex_convert_image(output_files "${file}" .pdf "${convert_flags}"
+          "${LATEX_PDF_IMAGE_EXTENSIONS}" "${ARGN}")
+        list(APPEND pdf_outputs ${output_files})
+      endif()
+    else()
+      message(WARNING "Could not find file ${CMAKE_CURRENT_SOURCE_DIR}/${file}.  Are you sure you gave relative paths to IMAGES?")
+    endif()
+  endforeach(file)
+
+  set(${dvi_outputs_var} ${dvi_outputs} PARENT_SCOPE)
+  set(${pdf_outputs_var} ${pdf_outputs} PARENT_SCOPE)
+endfunction(latex_process_images)
+
+function(latex_copy_globbed_files pattern dest)
+  file(GLOB file_list ${pattern})
+  foreach(in_file ${file_list})
+    latex_get_filename_component(out_file ${in_file} NAME)
+    configure_file(${in_file} ${dest}/${out_file} COPYONLY)
+  endforeach(in_file)
+endfunction(latex_copy_globbed_files)
+
+function(latex_copy_input_file file)
+  latex_get_output_path(output_dir)
+
+  if(EXISTS ${CMAKE_CURRENT_SOURCE_DIR}/${file})
+    latex_get_filename_component(path ${file} PATH)
+    file(MAKE_DIRECTORY ${output_dir}/${path})
+
+    latex_list_contains(use_config ${file} ${LATEX_CONFIGURE})
+    if(use_config)
+      configure_file(${CMAKE_CURRENT_SOURCE_DIR}/${file}
+        ${output_dir}/${file}
+        @ONLY
+        )
+      add_custom_command(OUTPUT ${output_dir}/${file}
+        COMMAND ${CMAKE_COMMAND}
+        ARGS ${CMAKE_BINARY_DIR}
+        DEPENDS ${CMAKE_CURRENT_SOURCE_DIR}/${file}
+        )
+    else()
+      add_custom_command(OUTPUT ${output_dir}/${file}
+        COMMAND ${CMAKE_COMMAND}
+        ARGS -E copy ${CMAKE_CURRENT_SOURCE_DIR}/${file} ${output_dir}/${file}
+        DEPENDS ${CMAKE_CURRENT_SOURCE_DIR}/${file}
+        )
+    endif()
+  else()
+    if(EXISTS ${output_dir}/${file})
+      # Special case: output exists but input does not.  Assume that it was
+      # created elsewhere and skip the input file copy.
+    else()
+      message("Could not find input file ${CMAKE_CURRENT_SOURCE_DIR}/${file}")
+    endif()
+  endif()
+endfunction(latex_copy_input_file)
+
+#############################################################################
+# Commands provided by the UseLATEX.cmake "package"
+#############################################################################
+
+function(latex_usage command message)
+  message(SEND_ERROR
+      "${message}\n  Usage: ${command}(<tex_file>\n           [BIBFILES <bib_file> <bib_file> ...]\n           [INPUTS <tex_file> <tex_file> ...]\n           [IMAGE_DIRS <directory1> <directory2> ...]\n           [IMAGES <image_file1> <image_file2>\n           [CONFIGURE <tex_file> <tex_file> ...]\n           [DEPENDS <tex_file> <tex_file> ...]\n           [MULTIBIB_NEWCITES] <suffix_list>\n           [USE_BIBLATEX] [USE_INDEX] [USE_GLOSSARY] [USE_NOMENCL]\n           [FORCE_PDF] [FORCE_DVI] [FORCE_HTML]\n           [TARGET_NAME] <name>\n           [EXCLUDE_FROM_ALL]\n           [EXCLUDE_FROM_DEFAULTS])"
+    )
+endfunction(latex_usage command message)
+
+# Parses arguments to add_latex_document and ADD_LATEX_TARGETS and sets the
+# variables LATEX_TARGET, LATEX_IMAGE_DIR, LATEX_BIBFILES, LATEX_DEPENDS, and
+# LATEX_INPUTS.
+function(parse_add_latex_arguments command latex_main_input)
+  set(options
+    USE_BIBLATEX
+    USE_INDEX
+    USE_GLOSSARY
+    USE_NOMENCL
+    FORCE_PDF
+    FORCE_DVI
+    FORCE_HTML
+    EXCLUDE_FROM_ALL
+    EXCLUDE_FROM_DEFAULTS
+    # Deprecated options
+    USE_GLOSSARIES
+    DEFAULT_PDF
+    DEFAULT_SAFEPDF
+    DEFAULT_PS
+    NO_DEFAULT
+    MANGLE_TARGET_NAMES
+    )
+  set(oneValueArgs
+    TARGET_NAME
+    )
+  set(multiValueArgs
+    BIBFILES
+    MULTIBIB_NEWCITES
+    INPUTS
+    IMAGE_DIRS
+    IMAGES
+    CONFIGURE
+    DEPENDS
+    INDEX_NAMES
+    )
+  cmake_parse_arguments(
+    LATEX "${options}" "${oneValueArgs}" "${multiValueArgs}" ${ARGN})
+
+  # Handle invalid and deprecated arguments
+  if(LATEX_UNPARSED_ARGUMENTS)
+    latex_usage(${command} "Invalid or deprecated arguments: ${LATEX_UNPARSED_ARGUMENTS}")
+  endif()
+  if(LATEX_USE_GLOSSARIES)
+    latex_usage(${command} "USE_GLOSSARIES option removed in version 1.6.1. Use USE_GLOSSARY instead.")
+  endif()
+  if(LATEX_DEFAULT_PDF)
+    latex_usage(${command} "DEFAULT_PDF option removed in version 2.0. Use FORCE_PDF option or LATEX_DEFAULT_BUILD CMake variable instead.")
+  endif()
+  if(LATEX_DEFAULT_SAFEPDF)
+    latex_usage(${command} "DEFAULT_SAFEPDF option removed in version 2.0. Use LATEX_DEFAULT_BUILD CMake variable instead.")
+  endif()
+  if(LATEX_DEFAULT_DVI)
+    latex_usage(${command} "DEFAULT_DVI option removed in version 2.0. Use FORCE_DVI option or LATEX_DEFAULT_BUILD CMake variable instead.")
+  endif()
+  if(LATEX_NO_DEFAULT)
+    latex_usage(${command} "NO_DEFAULT option removed in version 2.0. Use EXCLUDE_FROM_ALL instead.")
+  endif()
+  if(LATEX_MANGLE_TARGET_NAMES)
+    latex_usage(${command} "MANGLE_TARGET_NAMES option removed in version 2.0. All LaTeX targets use mangled names now.")
+  endif()
+
+  # Capture the first argument, which is the main LaTeX input.
+  latex_get_filename_component(latex_target ${latex_main_input} NAME_WE)
+  set(LATEX_MAIN_INPUT ${latex_main_input} PARENT_SCOPE)
+  set(LATEX_TARGET ${latex_target} PARENT_SCOPE)
+
+  # Propagate the result variables to the caller
+  foreach(arg_name ${options} ${oneValueArgs} ${multiValueArgs})
+    set(var_name LATEX_${arg_name})
+    set(${var_name} ${${var_name}} PARENT_SCOPE)
+  endforeach(arg_name)
+endfunction(parse_add_latex_arguments)
+
+function(add_latex_targets_internal)
+  latex_get_output_path(output_dir)
+
+  if(LATEX_USE_SYNCTEX)
+    set(synctex_flags ${LATEX_SYNCTEX_ARGS})
+  else()
+    set(synctex_flags)
+  endif()
+
+  # The commands to run LaTeX.  They are repeated multiple times.
+  set(latex_build_command
+    ${LATEX_COMPILER} ${LATEX_COMPILER_ARGS} ${synctex_flags} ${LATEX_MAIN_INPUT}
+    )
+  if(LATEX_COMPILER_ARGS MATCHES ".*batchmode.*")
+    # Wrap command in script that dumps the log file on error. This makes sure
+    # errors can be seen.
+    set(latex_build_command
+      ${CMAKE_COMMAND}
+        -D LATEX_BUILD_COMMAND=execute_latex
+        -D LATEX_TARGET=${LATEX_TARGET}
+        -D LATEX_WORKING_DIRECTORY="${output_dir}"
+        -D LATEX_FULL_COMMAND="${latex_build_command}"
+        -D LATEX_OUTPUT_FILE="${LATEX_TARGET}.dvi"
+        -P "${LATEX_USE_LATEX_LOCATION}"
+      )
+  endif()
+  set(pdflatex_build_command
+    ${PDFLATEX_COMPILER} ${PDFLATEX_COMPILER_ARGS} ${synctex_flags} ${LATEX_MAIN_INPUT}
+    )
+  if(PDFLATEX_COMPILER_ARGS MATCHES ".*batchmode.*")
+    # Wrap command in script that dumps the log file on error. This makes sure
+    # errors can be seen.
+    set(pdflatex_build_command
+      ${CMAKE_COMMAND}
+        -D LATEX_BUILD_COMMAND=execute_latex
+        -D LATEX_TARGET=${LATEX_TARGET}
+        -D LATEX_WORKING_DIRECTORY="${output_dir}"
+        -D LATEX_FULL_COMMAND="${pdflatex_build_command}"
+        -D LATEX_OUTPUT_FILE="${LATEX_TARGET}.pdf"
+        -P "${LATEX_USE_LATEX_LOCATION}"
+      )
+  endif()
+
+  if(NOT LATEX_TARGET_NAME)
+    # Use the main filename (minus the .tex) as the target name. Remove any
+    # spaces since CMake cannot have spaces in its target names.
+    string(REPLACE " " "_" LATEX_TARGET_NAME ${LATEX_TARGET})
+  endif()
+
+  # Some LaTeX commands may need to be modified (or may not work) if the main
+  # tex file is in a subdirectory. Make a flag for that.
+  get_filename_component(LATEX_MAIN_INPUT_SUBDIR ${LATEX_MAIN_INPUT} DIRECTORY)
+
+  # Set up target names.
+  set(dvi_target      ${LATEX_TARGET_NAME}_dvi)
+  set(pdf_target      ${LATEX_TARGET_NAME}_pdf)
+  set(ps_target       ${LATEX_TARGET_NAME}_ps)
+  set(safepdf_target  ${LATEX_TARGET_NAME}_safepdf)
+  set(html_target     ${LATEX_TARGET_NAME}_html)
+  set(auxclean_target ${LATEX_TARGET_NAME}_auxclean)
+
+  # Probably not all of these will be generated, but they could be.
+  # Note that the aux file is added later.
+  set(auxiliary_clean_files
+    ${output_dir}/${LATEX_TARGET}.aux
+    ${output_dir}/${LATEX_TARGET}.bbl
+    ${output_dir}/${LATEX_TARGET}.blg
+    ${output_dir}/${LATEX_TARGET}-blx.bib
+    ${output_dir}/${LATEX_TARGET}.glg
+    ${output_dir}/${LATEX_TARGET}.glo
+    ${output_dir}/${LATEX_TARGET}.gls
+    ${output_dir}/${LATEX_TARGET}.idx
+    ${output_dir}/${LATEX_TARGET}.ilg
+    ${output_dir}/${LATEX_TARGET}.ind
+    ${output_dir}/${LATEX_TARGET}.ist
+    ${output_dir}/${LATEX_TARGET}.log
+    ${output_dir}/${LATEX_TARGET}.out
+    ${output_dir}/${LATEX_TARGET}.toc
+    ${output_dir}/${LATEX_TARGET}.lof
+    ${output_dir}/${LATEX_TARGET}.xdy
+    ${output_dir}/${LATEX_TARGET}.synctex.gz
+    ${output_dir}/${LATEX_TARGET}.synctex.bak.gz
+    ${output_dir}/${LATEX_TARGET}.dvi
+    ${output_dir}/${LATEX_TARGET}.ps
+    ${output_dir}/${LATEX_TARGET}.pdf
+    )
+
+  set(image_list ${LATEX_IMAGES})
+
+  # For each directory in LATEX_IMAGE_DIRS, glob all the image files and
+  # place them in LATEX_IMAGES.
+  foreach(dir ${LATEX_IMAGE_DIRS})
+    if(NOT EXISTS ${CMAKE_CURRENT_SOURCE_DIR}/${dir})
+      message(WARNING "Image directory ${CMAKE_CURRENT_SOURCE_DIR}/${dir} does not exist.  Are you sure you gave relative directories to IMAGE_DIRS?")
+    endif()
+    foreach(extension ${LATEX_IMAGE_EXTENSIONS})
+      file(GLOB files ${CMAKE_CURRENT_SOURCE_DIR}/${dir}/*${extension})
+      foreach(file ${files})
+        latex_get_filename_component(filename ${file} NAME)
+        list(APPEND image_list ${dir}/${filename})
+      endforeach(file)
+    endforeach(extension)
+  endforeach(dir)
+
+  latex_process_images(dvi_images pdf_images ${image_list})
+
+  set(make_dvi_command
+    ${CMAKE_COMMAND} -E chdir ${output_dir}
+    ${latex_build_command})
+  set(make_pdf_command
+    ${CMAKE_COMMAND} -E chdir ${output_dir}
+    ${pdflatex_build_command}
+    )
+
+  set(make_dvi_depends ${LATEX_DEPENDS} ${dvi_images})
+  set(make_pdf_depends ${LATEX_DEPENDS} ${pdf_images})
+  foreach(input ${LATEX_MAIN_INPUT} ${LATEX_INPUTS})
+    list(APPEND make_dvi_depends ${output_dir}/${input})
+    list(APPEND make_pdf_depends ${output_dir}/${input})
+    if(${input} MATCHES "\\.tex$")
+      # Dependent .tex files might have their own .aux files created.  Make
+      # sure these get cleaned as well.  This might replicate the cleaning
+      # of the main .aux file, which is OK.
+      string(REGEX REPLACE "\\.tex$" "" input_we ${input})
+      list(APPEND auxiliary_clean_files
+        ${output_dir}/${input_we}.aux
+        ${output_dir}/${input}.aux
+        )
+    endif()
+  endforeach(input)
+
+  set(all_latex_sources ${LATEX_MAIN_INPUT} ${LATEX_INPUTS} ${image_list})
+
+  if(LATEX_USE_GLOSSARY)
+    foreach(dummy 0 1)   # Repeat these commands twice.
+      set(make_dvi_command ${make_dvi_command}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${CMAKE_COMMAND}
+        -D LATEX_BUILD_COMMAND=makeglossaries
+        -D LATEX_TARGET=${LATEX_TARGET}
+        -D MAKEINDEX_COMPILER=${MAKEINDEX_COMPILER}
+        -D XINDY_COMPILER=${XINDY_COMPILER}
+        -D MAKEGLOSSARIES_COMPILER_ARGS=${MAKEGLOSSARIES_COMPILER_ARGS}
+        -P ${LATEX_USE_LATEX_LOCATION}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${latex_build_command}
+        )
+      set(make_pdf_command ${make_pdf_command}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${CMAKE_COMMAND}
+        -D LATEX_BUILD_COMMAND=makeglossaries
+        -D LATEX_TARGET=${LATEX_TARGET}
+        -D MAKEINDEX_COMPILER=${MAKEINDEX_COMPILER}
+        -D XINDY_COMPILER=${XINDY_COMPILER}
+        -D MAKEGLOSSARIES_COMPILER_ARGS=${MAKEGLOSSARIES_COMPILER_ARGS}
+        -P ${LATEX_USE_LATEX_LOCATION}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${pdflatex_build_command}
+        )
+    endforeach(dummy)
+  endif()
+
+  if(LATEX_USE_NOMENCL)
+    foreach(dummy 0 1)   # Repeat these commands twice.
+      set(make_dvi_command ${make_dvi_command}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${CMAKE_COMMAND}
+        -D LATEX_BUILD_COMMAND=makenomenclature
+        -D LATEX_TARGET=${LATEX_TARGET}
+        -D MAKEINDEX_COMPILER=${MAKEINDEX_COMPILER}
+        -D MAKENOMENCLATURE_COMPILER_ARGS=${MAKENOMENCLATURE_COMPILER_ARGS}
+        -P ${LATEX_USE_LATEX_LOCATION}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${latex_build_command}
+        )
+      set(make_pdf_command ${make_pdf_command}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${CMAKE_COMMAND}
+        -D LATEX_BUILD_COMMAND=makenomenclature
+        -D LATEX_TARGET=${LATEX_TARGET}
+        -D MAKEINDEX_COMPILER=${MAKEINDEX_COMPILER}
+        -D MAKENOMENCLATURE_COMPILER_ARGS=${MAKENOMENCLATURE_COMPILER_ARGS}
+        -P ${LATEX_USE_LATEX_LOCATION}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${pdflatex_build_command}
+        )
+    endforeach(dummy)
+  endif()
+
+  if(LATEX_BIBFILES)
+    if(LATEX_USE_BIBLATEX)
+      if(NOT BIBER_COMPILER)
+        message(SEND_ERROR "I need the biber command.")
+      endif()
+      set(bib_compiler ${BIBER_COMPILER})
+      set(bib_compiler_flags ${BIBER_COMPILER_ARGS})
+    else()
+      set(bib_compiler ${BIBTEX_COMPILER})
+      set(bib_compiler_flags ${BIBTEX_COMPILER_ARGS})
+    endif() 
+    if(LATEX_MULTIBIB_NEWCITES)
+      foreach (multibib_auxfile ${LATEX_MULTIBIB_NEWCITES})
+        latex_get_filename_component(multibib_target ${multibib_auxfile} NAME_WE)
+        set(make_dvi_command ${make_dvi_command}
+          COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+          ${bib_compiler} ${bib_compiler_flags} ${multibib_target})
+        set(make_pdf_command ${make_pdf_command}
+          COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+          ${bib_compiler} ${bib_compiler_flags} ${multibib_target})
+        set(auxiliary_clean_files ${auxiliary_clean_files}
+          ${output_dir}/${multibib_target}.aux)
+      endforeach (multibib_auxfile ${LATEX_MULTIBIB_NEWCITES})
+    else()
+      set(make_dvi_command ${make_dvi_command}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${bib_compiler} ${bib_compiler_flags} ${LATEX_TARGET})
+      set(make_pdf_command ${make_pdf_command}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${bib_compiler} ${bib_compiler_flags} ${LATEX_TARGET})
+    endif()
+
+    foreach (bibfile ${LATEX_BIBFILES})
+      list(APPEND make_dvi_depends ${output_dir}/${bibfile})
+      list(APPEND make_pdf_depends ${output_dir}/${bibfile})
+    endforeach (bibfile ${LATEX_BIBFILES})
+  else()
+    if(LATEX_MULTIBIB_NEWCITES)
+      message(WARNING "MULTIBIB_NEWCITES has no effect without BIBFILES option.")
+    endif()
+  endif()
+
+  if(LATEX_USE_INDEX)
+    if(LATEX_INDEX_NAMES)
+      set(INDEX_NAMES ${LATEX_INDEX_NAMES})
+    else()
+      set(INDEX_NAMES ${LATEX_TARGET})
+    endif()
+    foreach(idx_name ${INDEX_NAMES})
+      set(make_dvi_command ${make_dvi_command}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${latex_build_command}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${MAKEINDEX_COMPILER} ${MAKEINDEX_COMPILER_ARGS} ${idx_name}.idx)
+      set(make_pdf_command ${make_pdf_command}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${pdflatex_build_command}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${MAKEINDEX_COMPILER} ${MAKEINDEX_COMPILER_ARGS} ${idx_name}.idx)
+      set(auxiliary_clean_files ${auxiliary_clean_files}
+        ${output_dir}/${idx_name}.idx
+        ${output_dir}/${idx_name}.ilg
+        ${output_dir}/${idx_name}.ind)
+    endforeach()
+  else()
+    if(LATEX_INDEX_NAMES)
+      message(WARNING "INDEX_NAMES has no effect without USE_INDEX option.")
+    endif()
+  endif()
+
+  set(make_dvi_command ${make_dvi_command}
+    COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+    ${latex_build_command}
+    COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+    ${latex_build_command})
+  set(make_pdf_command ${make_pdf_command}
+    COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+    ${pdflatex_build_command}
+    COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+    ${pdflatex_build_command})
+
+  # Need to run one more time to remove biblatex' warning
+  # about page breaks that have changed.
+  if(LATEX_USE_BIBLATEX)
+    set(make_dvi_command ${make_dvi_command}
+      COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+      ${latex_build_command})
+    set(make_pdf_command ${make_pdf_command}
+      COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+      ${pdflatex_build_command})
+  endif()
+
+  if(LATEX_USE_SYNCTEX)
+    if(NOT GZIP)
+      message(SEND_ERROR "UseLATEX.cmake: USE_SYNTEX option requires gzip program.  Set GZIP variable.")
+    endif()
+    set(make_dvi_command ${make_dvi_command}
+      COMMAND ${CMAKE_COMMAND}
+      -D LATEX_BUILD_COMMAND=correct_synctex
+      -D LATEX_TARGET=${LATEX_TARGET}
+      -D GZIP=${GZIP}
+      -D "LATEX_SOURCE_DIRECTORY=${CMAKE_CURRENT_SOURCE_DIR}"
+      -D "LATEX_BINARY_DIRECTORY=${output_dir}"
+      -P ${LATEX_USE_LATEX_LOCATION}
+      )
+    set(make_pdf_command ${make_pdf_command}
+      COMMAND ${CMAKE_COMMAND}
+      -D LATEX_BUILD_COMMAND=correct_synctex
+      -D LATEX_TARGET=${LATEX_TARGET}
+      -D GZIP=${GZIP}
+      -D "LATEX_SOURCE_DIRECTORY=${CMAKE_CURRENT_SOURCE_DIR}"
+      -D "LATEX_BINARY_DIRECTORY=${output_dir}"
+      -P ${LATEX_USE_LATEX_LOCATION}
+      )
+  endif()
+
+  # Check LaTeX output for important warnings at end of build
+  set(make_dvi_command ${make_dvi_command}
+    COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+    ${CMAKE_COMMAND}
+      -D LATEX_BUILD_COMMAND=check_important_warnings
+      -D LATEX_TARGET=${LATEX_TARGET}
+      -P ${LATEX_USE_LATEX_LOCATION}
+    )
+  set(make_pdf_command ${make_pdf_command}
+    COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+    ${CMAKE_COMMAND}
+      -D LATEX_BUILD_COMMAND=check_important_warnings
+      -D LATEX_TARGET=${LATEX_TARGET}
+      -P ${LATEX_USE_LATEX_LOCATION}
+    )
+
+  # Capture the default build.
+  string(TOLOWER "${LATEX_DEFAULT_BUILD}" default_build)
+
+  if((NOT LATEX_FORCE_PDF) AND (NOT LATEX_FORCE_DVI) AND (NOT LATEX_FORCE_HTML))
+    set(no_force TRUE)
+  endif()
+
+  # Add commands and targets for building pdf outputs (with pdflatex).
+  if(LATEX_FORCE_PDF OR no_force)
+    if(LATEX_FORCE_PDF)
+      set(default_build pdf)
+    endif()
+
+    if(PDFLATEX_COMPILER)
+      add_custom_command(OUTPUT ${output_dir}/${LATEX_TARGET}.pdf
+        COMMAND ${make_pdf_command}
+        DEPENDS ${make_pdf_depends}
+        )
+      add_custom_target(${pdf_target}
+        DEPENDS ${output_dir}/${LATEX_TARGET}.pdf
+        SOURCES ${all_latex_sources}
+        )
+      if(NOT LATEX_EXCLUDE_FROM_DEFAULTS)
+        add_dependencies(pdf ${pdf_target})
+      endif()
+    endif()
+  endif()
+
+  # Add commands and targets for building dvi outputs.
+  if(LATEX_FORCE_DVI OR LATEX_FORCE_HTML OR no_force)
+    if(LATEX_FORCE_DVI)
+      if((NOT default_build STREQUAL dvi) AND
+          (NOT default_build STREQUAL ps) AND
+          (NOT default_build STREQUAL safepdf))
+        set(default_build dvi)
+      endif()
+    endif()
+
+    add_custom_command(OUTPUT ${output_dir}/${LATEX_TARGET}.dvi
+      COMMAND ${make_dvi_command}
+      DEPENDS ${make_dvi_depends}
+      )
+    add_custom_target(${dvi_target}
+      DEPENDS ${output_dir}/${LATEX_TARGET}.dvi
+      SOURCES ${all_latex_sources}
+      )
+    if(NOT LATEX_EXCLUDE_FROM_DEFAULTS)
+      add_dependencies(dvi ${dvi_target})
+    endif()
+
+    if(DVIPS_CONVERTER)
+      add_custom_command(OUTPUT ${output_dir}/${LATEX_TARGET}.ps
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+        ${DVIPS_CONVERTER} ${DVIPS_CONVERTER_ARGS} -o ${LATEX_TARGET}.ps ${LATEX_TARGET}.dvi
+        DEPENDS ${output_dir}/${LATEX_TARGET}.dvi)
+      add_custom_target(${ps_target}
+        DEPENDS ${output_dir}/${LATEX_TARGET}.ps
+        SOURCES ${all_latex_sources}
+        )
+      if(NOT LATEX_EXCLUDE_FROM_DEFAULTS)
+        add_dependencies(ps ${ps_target})
+      endif()
+      if(PS2PDF_CONVERTER)
+        # Since both the pdf and safepdf targets have the same output, we
+        # cannot properly do the dependencies for both.  When selecting safepdf,
+        # simply force a recompile every time.
+        add_custom_target(${safepdf_target}
+          ${CMAKE_COMMAND} -E chdir ${output_dir}
+          ${PS2PDF_CONVERTER} ${PS2PDF_CONVERTER_ARGS} ${LATEX_TARGET}.ps ${LATEX_TARGET}.pdf
+          DEPENDS ${ps_target}
+          )
+        if(NOT LATEX_EXCLUDE_FROM_DEFAULTS)
+          add_dependencies(safepdf ${safepdf_target})
+        endif()
+      endif()
+    endif()
+  endif()
+
+  if(LATEX_FORCE_HTML OR no_force)
+    if (LATEX_FORCE_HTML)
+      set(default_build html)
+    endif()
+
+    if(HTLATEX_COMPILER AND LATEX_MAIN_INPUT_SUBDIR)
+      message(STATUS
+        "Disabling HTML build for ${LATEX_TARGET_NAME}.tex because the main file is in subdirectory ${LATEX_MAIN_INPUT_SUBDIR}"
+        )
+      # The code below to run HTML assumes that LATEX_TARGET.tex is in the
+      # current directory. I have tried to specify that LATEX_TARGET.tex is
+      # in a subdirectory. That makes the build targets correct, but the
+      # HTML build still fails (at least for htlatex) because files are not
+      # generated where expected. I am getting around the problem by simply
+      # disabling HTML in this case. If someone really cares, they can fix
+      # this, but make sure it runs on many platforms and build programs.
+    elseif(HTLATEX_COMPILER)
+      # htlatex places the output in a different location
+      set(HTML_OUTPUT "${output_dir}/${LATEX_TARGET}.html")
+      add_custom_command(OUTPUT ${HTML_OUTPUT}
+        COMMAND ${CMAKE_COMMAND} -E chdir ${output_dir}
+          ${HTLATEX_COMPILER} ${LATEX_MAIN_INPUT}
+          "${HTLATEX_COMPILER_TEX4HT_FLAGS}"
+          "${HTLATEX_COMPILER_TEX4HT_POSTPROCESSOR_FLAGS}"
+          "${HTLATEX_COMPILER_T4HT_POSTPROCESSOR_FLAGS}"
+          ${HTLATEX_COMPILER_ARGS}
+        DEPENDS
+          ${output_dir}/${LATEX_TARGET}.tex
+          ${output_dir}/${LATEX_TARGET}.dvi
+        VERBATIM
+        )
+      add_custom_target(${html_target}
+        DEPENDS ${HTML_OUTPUT} ${dvi_target}
+        SOURCES ${all_latex_sources}
+        )
+      if(NOT LATEX_EXCLUDE_FROM_DEFAULTS)
+        add_dependencies(html ${html_target})
+      endif()
+    endif()
+  endif()
+
+  # Set default targets.
+  if("${default_build}" STREQUAL "pdf")
+    add_custom_target(${LATEX_TARGET_NAME} DEPENDS ${pdf_target})
+  elseif("${default_build}" STREQUAL "dvi")
+    add_custom_target(${LATEX_TARGET_NAME} DEPENDS ${dvi_target})
+  elseif("${default_build}" STREQUAL "ps")
+    add_custom_target(${LATEX_TARGET_NAME} DEPENDS ${ps_target})
+  elseif("${default_build}" STREQUAL "safepdf")
+    add_custom_target(${LATEX_TARGET_NAME} DEPENDS ${safepdf_target})
+  elseif("${default_build}" STREQUAL "html")
+    add_custom_target(${LATEX_TARGET_NAME} DEPENDS ${html_target})
+  else()
+    message(SEND_ERROR "LATEX_DEFAULT_BUILD set to an invalid value. See the documentation for that variable.")
+  endif()
+
+  if(NOT LATEX_EXCLUDE_FROM_ALL)
+    add_custom_target(_${LATEX_TARGET_NAME} ALL DEPENDS ${LATEX_TARGET_NAME})
+  endif()
+
+  set_directory_properties(.
+    ADDITIONAL_MAKE_CLEAN_FILES "${auxiliary_clean_files}"
+    )
+
+  add_custom_target(${auxclean_target}
+    COMMENT "Cleaning auxiliary LaTeX files."
+    COMMAND ${CMAKE_COMMAND} -E remove ${auxiliary_clean_files}
+    )
+  add_dependencies(auxclean ${auxclean_target})
+endfunction(add_latex_targets_internal)
+
+function(add_latex_targets latex_main_input)
+  latex_get_output_path(output_dir)
+  parse_add_latex_arguments(ADD_LATEX_TARGETS ${latex_main_input} ${ARGN})
+
+  add_latex_targets_internal()
+endfunction(add_latex_targets)
+
+function(add_latex_document latex_main_input)
+  latex_get_output_path(output_dir)
+  if(output_dir)
+    parse_add_latex_arguments(add_latex_document ${latex_main_input} ${ARGN})
+
+    latex_copy_input_file(${LATEX_MAIN_INPUT})
+
+    foreach (bib_file ${LATEX_BIBFILES})
+      latex_copy_input_file(${bib_file})
+    endforeach (bib_file)
+
+    foreach (input ${LATEX_INPUTS})
+      latex_copy_input_file(${input})
+    endforeach(input)
+
+    latex_copy_globbed_files(${CMAKE_CURRENT_SOURCE_DIR}/*.cls ${output_dir})
+    latex_copy_globbed_files(${CMAKE_CURRENT_SOURCE_DIR}/*.bst ${output_dir})
+    latex_copy_globbed_files(${CMAKE_CURRENT_SOURCE_DIR}/*.clo ${output_dir})
+    latex_copy_globbed_files(${CMAKE_CURRENT_SOURCE_DIR}/*.sty ${output_dir})
+    latex_copy_globbed_files(${CMAKE_CURRENT_SOURCE_DIR}/*.ist ${output_dir})
+    latex_copy_globbed_files(${CMAKE_CURRENT_SOURCE_DIR}/*.fd  ${output_dir})
+
+    add_latex_targets_internal()
+  endif()
+endfunction(add_latex_document)
+
+#############################################################################
+# Actually do stuff
+#############################################################################
+
+if(LATEX_BUILD_COMMAND)
+  set(command_handled)
+
+  if("${LATEX_BUILD_COMMAND}" STREQUAL execute_latex)
+    latex_execute_latex()
+    set(command_handled TRUE)
+  endif()
+
+  if("${LATEX_BUILD_COMMAND}" STREQUAL makeglossaries)
+    latex_makeglossaries()
+    set(command_handled TRUE)
+  endif()
+
+  if("${LATEX_BUILD_COMMAND}" STREQUAL makenomenclature)
+    latex_makenomenclature()
+    set(command_handled TRUE)
+  endif()
+
+  if("${LATEX_BUILD_COMMAND}" STREQUAL correct_synctex)
+    latex_correct_synctex()
+    set(command_handled TRUE)
+  endif()
+
+  if("${LATEX_BUILD_COMMAND}" STREQUAL check_important_warnings)
+    latex_check_important_warnings()
+    set(command_handled TRUE)
+  endif()
+
+  if(NOT command_handled)
+    message(SEND_ERROR "Unknown command: ${LATEX_BUILD_COMMAND}")
+  endif()
+
+else()
+  # Must be part of the actual configure (included from CMakeLists.txt).
+  latex_setup_variables()
+  latex_setup_targets()
+endif()
diff --git a/submodules/ton/tonlib-src/CMakeLists.txt b/submodules/ton/tonlib-src/CMakeLists.txt
new file mode 100644
index 0000000000..a200d1010a
--- /dev/null
+++ b/submodules/ton/tonlib-src/CMakeLists.txt
@@ -0,0 +1,392 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+project(TON VERSION 0.5 LANGUAGES C CXX)
+set(CMAKE_POSITION_INDEPENDENT_CODE ON)
+#set(OPENSSL_USE_STATIC_LIBS TRUE)
+
+# Prevent in-source build
+get_filename_component(TON_REAL_SOURCE_DIR "${CMAKE_CURRENT_SOURCE_DIR}" REALPATH)
+get_filename_component(TON_REAL_BINARY_DIR "${CMAKE_CURRENT_BINARY_DIR}" REALPATH)
+
+if (TON_REAL_BINARY_DIR STREQUAL TON_REAL_SOURCE_DIR)
+  message("  Out-of-source build should be used to build TDLib.")
+  message("  You need to remove the files already created by CMake and")
+  message("  rerun CMake from a new directory:")
+  message("  rm -rf CMakeFiles CMakeCache.txt")
+  message("  mkdir build")
+  message("  cd build")
+  message("  cmake ..")
+  message(FATAL_ERROR "In-source build failed.")
+endif()
+
+# HAVE_SSE42 for crc32c and rocksdb
+include(CheckCXXSourceCompiles)
+# Check for SSE4.2 support in the compiler.
+set(OLD_CMAKE_REQURED_FLAGS ${CMAKE_REQUIRED_FLAGS})
+if(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+  set(CMAKE_REQUIRED_FLAGS "${CMAKE_REQUIRED_FLAGS} /arch:AVX")
+else(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+  set(CMAKE_REQUIRED_FLAGS "${CMAKE_REQUIRED_FLAGS} -msse4.2")
+endif(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+check_cxx_source_compiles("
+#if defined(_MSC_VER)
+#include <intrin.h>
+#else  // !defined(_MSC_VER)
+#include <cpuid.h>
+#include <nmmintrin.h>
+#endif  // defined(_MSC_VER)
+
+int main() {
+  _mm_crc32_u8(0, 0); _mm_crc32_u32(0, 0);
+#if defined(_M_X64) || defined(__x86_64__)
+   _mm_crc32_u64(0, 0);
+#endif // defined(_M_X64) || defined(__x86_64__)
+  return 0;
+}
+"  CRC32C_HAVE_SSE42)
+set(CMAKE_REQUIRED_FLAGS ${OLD_CMAKE_REQURED_FLAGS})
+
+if(NOT MSVC)
+  set(CMAKE_REQUIRED_FLAGS "-msse4.2 -mpclmul")
+endif()
+CHECK_CXX_SOURCE_COMPILES("
+#include <cstdint>
+#include <nmmintrin.h>
+#include <wmmintrin.h>
+int main() {
+  volatile uint32_t x = _mm_crc32_u32(0, 0);
+  const auto a = _mm_set_epi64x(0, 0);
+  const auto b = _mm_set_epi64x(0, 0);
+  const auto c = _mm_clmulepi64_si128(a, b, 0x00);
+  auto d = _mm_cvtsi128_si64(c);
+}
+" ROCKSDB_HAVE_SSE42)
+unset(CMAKE_REQUIRED_FLAGS)
+
+if (ROCKSDB_HAVE_SSE42 AND CRC32C_HAVE_SSE42)
+  set(HAVE_SSE42 TRUE)
+else()
+  set(HAVE_SSE42 FALSE)
+endif()
+
+
+option(TONLIB_ENABLE_JNI "Use \"ON\" to enable JNI-compatible TonLib API.")
+option(TON_USE_ASAN "Use \"ON\" to enable AddressSanitizer." OFF)
+option(TON_USE_TSAN "Use \"ON\" to enable ThreadSanitizer." OFF)
+option(TON_USE_UBSAN "Use \"ON\" to enable UndefinedBehaviorSanitizer." OFF)
+set(TON_ARCH "native" CACHE STRING "Architecture, will be passed to -march=")
+
+if (TON_USE_ABSEIL)
+  message("Add abseil-cpp")
+  add_subdirectory(third-party/abseil-cpp EXCLUDE_FROM_ALL)
+  set(ABSL_FOUND 1)
+endif()
+
+#add_subdirectory(third-party/libcuckoo EXCLUDE_FROM_ALL)
+#add_subdirectory(third-party/junction EXCLUDE_FROM_ALL)
+
+if (WIN32)
+  message("Add wingetopt")
+  add_subdirectory(third-party/wingetopt EXCLUDE_FROM_ALL)
+  set(WINGETOPT_FOUND 1)
+  message(STATUS "Use wingetopt")
+endif()
+
+set(CRC32C_BUILD_TESTS OFF CACHE BOOL "Build CRC32C's unit tests")
+set(CRC32C_BUILD_BENCHMARKS OFF CACHE BOOL "Build CRC32C's benchmarks")
+set(CRC32C_USE_GLOG OFF CACHE BOOL "Build CRC32C's tests with Google Logging")
+set(CRC32C_INSTALL OFF CACHE BOOL "Install CRC32C's header and library")
+message("Add crc32c")
+add_subdirectory(third-party/crc32c EXCLUDE_FROM_ALL)
+set(CRC32C_FOUND 1)
+
+if (TON_USE_ROCKSDB)
+  if (ANDROID) 
+    set(PORTABLE ON CACHE BOOL "portable")
+  endif()
+  set(WITH_TESTS OFF CACHE BOOL "build with tests")
+  set(WITH_TOOLS OFF CACHE BOOL "build with tools")
+  set(FAIL_ON_WARNINGS OFF CACHE BOOL "fail on warnings")
+  message("Add rocksdb")
+  add_subdirectory(third-party/rocksdb EXCLUDE_FROM_ALL)
+endif()
+
+option(USE_COROUTINES "experimental support of coroutines" OFF)
+if (USE_COROUTINES)
+  if (CMAKE_CXX_COMPILER_ID MATCHES "Clang")
+    set(TD_HAVE_COROUTINES 1)
+    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fcoroutines-ts")
+    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -stdlib=libc++")
+  endif()
+endif()
+
+option(USE_LIBRAPTORQ "use libraptorq for tests" OFF)
+if (USE_LIBRAPTORQ)
+  set(USE_LZ4 OFF CACHE BOOL "use lz4")
+  if (CMAKE_CXX_COMPILER_ID MATCHES "Clang")
+    set(CLANG_STDLIB "ON") # for libraptorq
+  endif()
+  message("Add libraptorq")
+  add_subdirectory(third-party/libraptorq EXCLUDE_FROM_ALL)
+endif()
+
+message("Add ton")
+set(CMAKE_MODULE_PATH "${CMAKE_CURRENT_SOURCE_DIR}/CMake" ${CMAKE_MODULE_PATH})
+
+# Configure CCache if available
+find_program(CCACHE_FOUND ccache)
+#set(CCACHE_FOUND 0)
+if (CCACHE_FOUND)
+  message(STATUS "Found ccache")
+  set_property(GLOBAL PROPERTY RULE_LAUNCH_COMPILE ccache)
+  set_property(GLOBAL PROPERTY RULE_LAUNCH_LINK ccache)
+else()
+  message(STATUS "Could NOT find ccache")
+endif()
+
+if (CMAKE_CXX_COMPILER_ID STREQUAL "GNU")
+  set(GCC 1)
+elseif (CMAKE_CXX_COMPILER_ID MATCHES "Clang")
+  set(CLANG 1)
+elseif (CMAKE_CXX_COMPILER_ID STREQUAL "Intel")
+  set(INTEL 1)
+elseif (NOT MSVC)
+  message(FATAL_ERROR "Compiler isn't supported")
+endif()
+
+include(CheckCXXCompilerFlag)
+
+if (GCC OR CLANG OR INTEL)
+  if (WIN32 AND INTEL)
+    set(STD14_FLAG /Qstd=c++14)
+  else()
+    set(STD14_FLAG -std=c++14)
+  endif()
+  check_cxx_compiler_flag(${STD14_FLAG} HAVE_STD14)
+  if (NOT HAVE_STD14)
+    string(REPLACE "c++14" "c++1y" STD14_FLAG "${STD14_FLAG}")
+    check_cxx_compiler_flag(${STD14_FLAG} HAVE_STD1Y)
+    set(HAVE_STD14 ${HAVE_STD1Y})
+  endif()
+elseif (MSVC)
+  set(HAVE_STD14 MSVC_VERSION>=1900)
+endif()
+
+if (NOT HAVE_STD14)
+  message(FATAL_ERROR "No C++14 support in the compiler. Please upgrade the compiler.")
+endif()
+
+set(CMAKE_THREAD_PREFER_PTHREAD ON)
+set(THREADS_PREFER_PTHREAD_FLAG ON)
+find_package(Threads REQUIRED)
+
+if (TON_ARCH AND NOT MSVC)
+  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -march=${TON_ARCH}")
+endif()
+if (THREADS_HAVE_PTHREAD_ARG)
+  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -pthread")
+endif()
+
+if (TON_USE_JEMALLOC)
+  find_package(JeMalloc REQUIRED)
+endif()
+
+set(MEMPROF "" CACHE STRING "Use one of \"ON\", \"FAST\" or \"SAFE\" to enable memory profiling. \
+Works under macOS and Linux when compiled using glibc. \
+In FAST mode stack is unwinded only using frame pointers, which may fail. \
+In SAFE mode stack is unwinded using backtrace function from execinfo.h, which may be very slow. \
+By default both methods are used to achieve maximum speed and accuracy")
+
+if (CLANG OR GCC)
+  if (MEMPROF)
+    check_cxx_compiler_flag(-no-pie CXX_NO_PIE_FLAG)
+    if (CXX_NO_PIE_FLAG)
+      set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -no-pie")
+    elseif (APPLE)
+      set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -Wl,-no_pie")
+    endif()
+  endif()
+endif()
+
+if (MSVC)
+  if (CMAKE_CXX_FLAGS_DEBUG MATCHES "/RTC1")
+    string(REPLACE "/RTC1" " " CMAKE_CXX_FLAGS_DEBUG "${CMAKE_CXX_FLAGS_DEBUG}")
+  endif()
+  add_definitions(-D_SCL_SECURE_NO_WARNINGS -D_CRT_SECURE_NO_WARNINGS)
+  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /MP /W4 /wd4100 /wd4127 /wd4324 /wd4456 /wd4457 /wd4458 /wd4505 /wd4702")
+elseif (CLANG OR GCC)
+  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${STD14_FLAG} -fno-omit-frame-pointer")
+  if (APPLE)
+    #use "-Wl,-exported_symbols_list,${CMAKE_CURRENT_SOURCE_DIR}/export_list" for exported symbols
+    set(CMAKE_SHARED_LINKER_FLAGS "${CMAKE_SHARED_LINKER_FLAGS} -fvisibility=hidden -Wl,-dead_strip,-x,-S")
+    set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -fvisibility=hidden -Wl,-dead_strip,-x,-S")
+  else()
+    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -ffunction-sections -fdata-sections")
+    set(CMAKE_SHARED_LINKER_FLAGS "${CMAKE_SHARED_LINKER_FLAGS} -Wl,--gc-sections -Wl,--exclude-libs,ALL")
+    set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -Wl,--gc-sections")
+    if (NOT TON_USE_ASAN AND NOT TON_USE_TSAN AND NOT MEMPROF)
+      set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -Wl,--exclude-libs,ALL")
+    endif()
+  endif()
+elseif (INTEL)
+  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${STD14_FLAG}")
+endif()
+
+if (WIN32)
+  add_definitions(-DNTDDI_VERSION=0x06020000 -DWINVER=0x0602 -D_WIN32_WINNT=0x0602 -DNOMINMAX -DUNICODE -D_UNICODE)
+endif()
+if (CYGWIN)
+  add_definitions(-D_DEFAULT_SOURCE=1 -DFD_SETSIZE=4096)
+endif()
+
+if (NOT ANDROID) # _FILE_OFFSET_BITS is broken in ndk r15 and r15b and doesn't work prior to Android 7.0
+  add_definitions(-D_FILE_OFFSET_BITS=64)
+endif()
+
+include(AddCXXCompilerFlag)
+if (MSVC)
+  add_cxx_compiler_flag("/experimental:external /external:anglebrackets /external:W0")
+endif()
+if (NOT MSVC)
+  add_cxx_compiler_flag("-Wall")
+endif()
+add_cxx_compiler_flag("-Wextra")
+add_cxx_compiler_flag("-Wimplicit-fallthrough=2")
+add_cxx_compiler_flag("-Wpointer-arith")
+add_cxx_compiler_flag("-Wcast-qual")
+add_cxx_compiler_flag("-Wsign-compare")
+add_cxx_compiler_flag("-Wduplicated-branches")
+add_cxx_compiler_flag("-Wduplicated-cond")
+add_cxx_compiler_flag("-Walloc-zero")
+add_cxx_compiler_flag("-Wlogical-op")
+add_cxx_compiler_flag("-Wno-tautological-compare")
+add_cxx_compiler_flag("-Wpointer-arith")
+add_cxx_compiler_flag("-Wvla")
+add_cxx_compiler_flag("-Wnon-virtual-dtor")
+add_cxx_compiler_flag("-Wno-unused-parameter")
+add_cxx_compiler_flag("-Wconversion")
+add_cxx_compiler_flag("-Wno-sign-conversion")
+add_cxx_compiler_flag("-Qunused-arguments")
+add_cxx_compiler_flag("-Wno-unused-private-field")
+add_cxx_compiler_flag("-Wno-redundant-move")
+#add_cxx_compiler_flag("-Werror")
+
+#set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -isystem /usr/include/c++/v1")
+if (CLANG)
+  #set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -stdlib=libc++")
+endif()
+if (TON_USE_ASAN)
+  if (CLANG)
+    add_cxx_compiler_flag("-stdlib=libc++")
+  endif()
+  add_cxx_compiler_flag("-fsanitize=address")
+  add_definitions(-DTD_USE_ASAN=1)
+endif()
+if (TON_USE_TSAN)
+  if (CLANG)
+    add_cxx_compiler_flag("-stdlib=libc++")
+  endif()
+  add_cxx_compiler_flag("-fsanitize=thread")
+endif()
+if (TON_USE_UBSAN)
+  if (CLANG)
+    add_cxx_compiler_flag("-stdlib=libc++")
+  endif()
+  add_cxx_compiler_flag("-fsanitize=undefined")
+endif()
+#set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fsanitize=thread")
+#set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fsanitize=address")
+#set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fsanitize=undefined")
+#set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fsanitize=leak")
+#set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -finstrument-functions")
+
+#Compilation database
+set(CMAKE_EXPORT_COMPILE_COMMANDS 1)
+
+
+function(target_link_libraries_system target)
+  set(libs ${ARGN})
+  foreach(lib ${libs})
+    get_target_property(lib_include_dirs ${lib} INTERFACE_INCLUDE_DIRECTORIES)
+    target_include_directories(${target} SYSTEM PUBLIC ${lib_include_dirs})
+    target_link_libraries(${target} PUBLIC ${lib})
+  endforeach(lib)
+endfunction(target_link_libraries_system)
+
+add_subdirectory(tdutils)
+add_subdirectory(memprof)
+add_subdirectory(tdactor)
+add_subdirectory(tdnet)
+if (TON_USE_ROCKSDB)
+  option(TDDB_USE_ROCKSDB "Use rockdb" ON)
+endif()
+add_subdirectory(tddb)
+add_subdirectory(tdtl)
+add_subdirectory(tl)
+add_subdirectory(terminal)
+add_subdirectory(keys)
+add_subdirectory(tl-utils)
+add_subdirectory(adnl)
+add_subdirectory(crypto)
+add_subdirectory(lite-client)
+
+#BEGIN tonlib
+add_subdirectory(tonlib)
+#END tonlib
+
+
+if (NOT CMAKE_CROSSCOMPILING)
+  add_custom_target(prepare_cross_compiling DEPENDS tl_generate_common tdmime_auto tlb_generate_block)
+endif()
+
+#TESTS
+add_executable(test-ed25519 test/test-td-main.cpp ${ED25519_TEST_SOURCE})
+target_link_libraries(test-ed25519 PRIVATE ton_crypto)
+
+add_executable(test-vm test/test-td-main.cpp ${TONVM_TEST_SOURCE})
+target_link_libraries(test-vm PRIVATE ton_crypto fift-lib)
+
+add_executable(test-cells test/test-td-main.cpp ${CELLS_TEST_SOURCE})
+target_link_libraries(test-cells PRIVATE ton_crypto)
+
+add_executable(test-fift test/test-td-main.cpp ${FIFT_TEST_SOURCE})
+target_link_libraries(test-fift PRIVATE fift-lib)
+
+add_executable(test-tdutils test/test-td-main.cpp ${TDUTILS_TEST_SOURCE})
+target_link_libraries(test-tdutils PRIVATE tdutils ${CMAKE_THREAD_LIBS_INIT} memprof ${JEMALLOC_LIBRARIES})
+#target_link_libraries_system(test-tdutils absl::base absl::container absl::hash )
+#target_link_libraries_system(test-tdutils libcuckoo)
+#target_include_directories(test-tdutils PRIVATE SYSTEM ${JUNCTION_ALL_INCLUDE_DIRS})
+#target_link_libraries(test-tdutils PRIVATE ${JUNCTION_ALL_LIBRARIES})
+
+add_executable(test-tdactor test/test-td-main.cpp ${TDACTOR_TEST_SOURCE})
+target_link_libraries(test-tdactor PRIVATE tdactor ${CMAKE_THREAD_LIBS_INIT})
+
+add_executable(test-net test/test-td-main.cpp ${NET_TEST_SOURCE})
+target_link_libraries(test-net PRIVATE tdnet tdutils ${CMAKE_THREAD_LIBS_INIT})
+
+#BEGIN tonlib
+add_executable(test-tonlib ${TONLIB_ONLINE_TEST_SOURCE})
+target_link_libraries(test-tonlib tdutils tdactor adnllite tl_api ton_crypto ton_block tl_tonlib_api tonlib)
+
+add_executable(test-tonlib-offline test/test-td-main.cpp ${TONLIB_OFFLINE_TEST_SOURCE})
+target_link_libraries(test-tonlib-offline tdutils tdactor adnllite tl_api ton_crypto ton_block fift-lib tl_tonlib_api tonlib)
+#END tonlib
+
+
+enable_testing()
+set(TEST_OPTIONS "--regression ${CMAKE_CURRENT_SOURCE_DIR}/test/regression-tests.ans --filter -Bench")
+separate_arguments(TEST_OPTIONS)
+add_test(test-ed25519 test-ed25519)
+add_test(test-vm test-vm ${TEST_OPTIONS})
+add_test(test-fift test-fift ${TEST_OPTIONS})
+add_test(test-cells test-cells ${TEST_OPTIONS})
+add_test(test-net test-net)
+add_test(test-actors test-tdactor)
+
+#BEGIN tonlib
+add_test(test-tdutils test-tdutils)
+add_test(test-tonlib-offline test-tonlib-offline)
+#END tonlib
+
+
diff --git a/submodules/ton/tonlib-src/DISCLAIMER b/submodules/ton/tonlib-src/DISCLAIMER
new file mode 100644
index 0000000000..acddc25d07
--- /dev/null
+++ b/submodules/ton/tonlib-src/DISCLAIMER
@@ -0,0 +1,9 @@
+Please read the following before you download the TON Blockchain Lite Client and connect to the TON Test Network.  By downloading the TON Blockchain Lite Client and associated software and connecting to the TON Test Network, you accept and agree to be bound and abide by the following terms:
+
+    1. You agree to use the TON Test Network only for lawful purposes and only for testing and development purposes.
+
+    2. YOUR USE OF THE TON TEST NETWORK IS AT YOUR OWN RISK. THE TON TEST NETWORK IS PROVIDED ON AN "AS IS" AND "AS AVAILABLE" BASIS, WITHOUT ANY WARRANTIES OF ANY KIND, EITHER EXPRESS OR IMPLIED. YOU UNDERSTAND AND ACKNOWLEDGE THAT THE TON TEST NETWORK IS STILL UNDER DEVELOPMENT AND TESTING.
+
+    3. NEITHER TELEGRAM NOR ANY PERSON ASSOCIATED WITH TELEGRAM MAKES, AND HEREBY DISCLAIMS, ANY WARRANTY OR REPRESENTATION WITH RESPECT TO THE COMPLETENESS, SECURITY, RELIABILITY, QUALITY, ACCURACY,  AVAILABILITY, MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR NON-INFRINGEMENT OF THE TON TEST NETWORK. WITHOUT LIMITING THE FOREGOING, NEITHER TELEGRAM NOR ANYONE ASSOCIATED WITH TELEGRAM REPRESENTS OR WARRANTS THAT THE TON TEST NETWORK WILL BE ACCURATE, RELIABLE, ERROR-FREE OR UNINTERRUPTED, THAT DEFECTS WILL BE CORRECTED, THAT THE TON TEST NETWORK IS FREE OF VIRUSES OR OTHER HARMFUL COMPONENTS OR THAT THE TON TEST NETWORK WILL OTHERWISE MEET YOUR NEEDS OR EXPECTATIONS.  SOME JURISDICTIONS DO NOT ALLOW EXCLUSION OF WARRANTIES OR LIMITATIONS ON THE DURATION OF IMPLIED WARRANTIES, SO THE ABOVE DISCLAIMER MAY NOT APPLY TO YOU IN ITS ENTIRETY, BUT WILL APPLY TO THE MAXIMUM EXTENT PERMITTED BY APPLICABLE LAW.
+
+    4. TO THE MAXIMUM EXTENT PERMITTED BY LAW, IN NO EVENT WILL TELEGRAM NOR ANY PERSON ASSOCIATED WITH TELEGRAM BE LIABLE FOR ANY LOSS OF USE, LOST DATA, FAILURE OF SECURITY MECHANISMS, INTERRUPTION OF BUSINESS, OR ANY INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES OF ANY KIND (INCLUDING LOST PROFITS), REGARDLESS OF THE FORM OF ACTION, WHETHER IN CONTRACT, TORT (INCLUDING NEGLIGENCE), STRICT LIABILITY OR OTHERWISE, EVEN IF INFORMED OF THE POSSIBILITY OF SUCH DAMAGES IN ADVANCE. NOTWITHSTANDING ANY OTHER PROVISION OF THIS TERMS OF USE, NEITHER TELEGRAM NOR ANY PERSON ASSOCIATED WITH TELEGRAM SHALL HAVE ANY LIABILITY UNDER THIS TERMS OF USE.
diff --git a/submodules/ton/tonlib-src/HOWTO b/submodules/ton/tonlib-src/HOWTO
new file mode 100644
index 0000000000..a4aacbb0f0
--- /dev/null
+++ b/submodules/ton/tonlib-src/HOWTO
@@ -0,0 +1,541 @@
+The aim of this document is to provide step-by-step instructions for compiling and creating a simple smart contract (a simple wallet) in the TON Blockchain Test Network using the TON Blockchain Lite Client and associated software.
+
+Download and installation instructions may be found in README. We assume here that the Lite Client is already properly downloaded, compiled and installed.
+
+1. Smart-contract addresses
+~~~~~~~~~~~~~~~~~~~~~~~~~~~
+
+Smart-contract addresses in the TON Network consist of two parts: (a) the workchain ID (a signed 32-bit integer) and (b) the address inside the workchain (64-512 bits depending on the workchain). Currently, only the masterchain (workchain_id=-1) and occasionally the basic workchain (workchain_id=0) are running in the TON Blockchain Test Network. Both of them have 256-bit addresses, so we henceforth assume that workchain_id is either 0 or -1 and that the address inside the workchain is exactly 256-bit.
+
+Under the conditions stated above, the smart-contract address can be represented in the following forms:
+
+A) "Raw": <decimal workchain_id>:<64 hexadecimal digits with address>
+B) "User-friendly", which is obtained by first generating:
+- one tag byte (0x11 for "bounceable" addresses, 0x51 for "non-bounceable"; add +0x80 if the address should not be accepted by software running in the production network)
+- one byte containing a signed 8-bit integer with the workchain_id (0x00 for the basic workchain, 0xff for the masterchain)
+- 32 bytes containing 256 bits of the smart-contract address inside the workchain (big-endian)
+- 2 bytes containing CRC16-CCITT of the previous 34 bytes
+
+In case B), the 36 bytes thus obtained are then encoded using base64 (i.e., with digits, upper- and lowercase Latin letters, '/' and '+') or base64url (with '_' and '-' instead of '/' and '+'), yielding 48 printable non-space characters.
+
+Example:
+
+The "test giver" (a special smart contract residing in the masterchain of the Test Network that gives up to 20 test Grams to anybody who asks) has the address
+
+-1:8156775b79325e5d62e742d9b96c30b6515a5cd2f1f64c5da4b193c03f070e0d
+
+in the "raw" form (notice that uppercase Latin letters 'A'..'F' may be used instead of 'a'..'f')
+
+and
+
+Ef+BVndbeTJeXWLnQtm5bDC2UVpc0vH2TF2ksZPAPwcODSkb (base64) or
+Ef-BVndbeTJeXWLnQtm5bDC2UVpc0vH2TF2ksZPAPwcODSkb (base64url)
+
+in the "user-friendly" form (to be displayed by user-friendly clients). Notice that both forms (base64 and base64url) are valid and must be accepted.
+
+Incidentally, other binary data related to the TON Blockchain have similar "armored" base64 representations, differing by their first bytes. For example, the ubiquitious 256-bit Ed25519 public keys are represented by first creating a 36-byte sequence as follows:
+- one tag byte 0x3E, meaning that this is a public key
+- one tag byte 0xE6, meaning that this is a Ed25519 public key
+- 32 bytes containing the standard binary representation of the Ed25519 public key
+- 2 bytes containing the big-endian representation of CRC16-CCITT of the previous 34 bytes.
+
+The resulting 36-byte sequence is converted into a 48-character base64 or base64url string in the standard fashion. For example, the Ed25519 public key E39ECDA0A7B0C60A7107EC43967829DBE8BC356A49B9DFC6186B3EAC74B5477D (usually represented by a sequence of 32 bytes 0xE3, 0x9E, ..., 0x7D) has the following "armored" representation:
+
+Pubjns2gp7DGCnEH7EOWeCnb6Lw1akm538YYaz6sdLVHfRB2
+
+2. Inspecting the state of a smart contract
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+
+Inspecting the state of smart contracts with the aid of the TON Lite Client is easy. For the sample smart contract described above, you would run the Lite Client and enter the following commands:
+
+> last
+...
+> getaccount -1:8156775b79325e5d62e742d9b96c30b6515a5cd2f1f64c5da4b193c03f070e0d
+or
+> getaccount Ef-BVndbeTJeXWLnQtm5bDC2UVpc0vH2TF2ksZPAPwcODSkb
+
+You will see something like this:
+
+------------------------------------
+got account state for -1:8156775B79325E5D62E742D9B96C30B6515A5CD2F1F64C5DA4B193C03F070E0D with respect to blocks (-1,8000000000000000,1645):4D5E1B928490BE34A4F03C9BC996661B8AD4E988F1460DB69BE3634B1E843DAF:9D85BB116D1DA4BFD999E9092BBD43B3A9F96EC9C9ED7AFDC81B27B08D3861A0 and (-1,8000000000000000,1645):4D5E1B928490BE34A4F03C9BC996661B8AD4E988F1460DB69BE3634B1E843DAF:9D85BB116D1DA4BFD999E9092BBD43B3A9F96EC9C9ED7AFDC81B27B08D3861A0
+account state is (account
+  addr:(addr_std
+    anycast:nothing workchain_id:-1 address:x8156775B79325E5D62E742D9B96C30B6515A5CD2F1F64C5DA4B193C03F070E0D)
+  storage_stat:(storage_info
+    used:(storage_used
+      cells:(var_uint len:1 value:3)
+      bits:(var_uint len:2 value:539)
+      public_cells:(var_uint len:0 value:0)) last_paid:0
+    due_payment:nothing)
+  storage:(account_storage last_trans_lt:0
+    balance:(currencies
+      grams:(nanograms
+        amount:(var_uint len:7 value:1000000000000000))
+      other:(extra_currencies
+        dict:hme_empty))
+    state:(account_active
+      (
+        split_depth:nothing
+        special:nothing
+        code:(just
+          value:(raw@^Cell 
+            x{}
+             x{FF0020DDA4F260D31F01ED44D0D31FD166BAF2A1F80001D307D4D1821804A817C80073FB0201FB00A4C8CB1FC9ED54}
+            ))
+        data:(just
+          value:(raw@^Cell 
+            x{}
+             x{00009A15}
+            ))
+        library:hme_empty))))
+x{CFF8156775B79325E5D62E742D9B96C30B6515A5CD2F1F64C5DA4B193C03F070E0D2068086C0000000000000000000000001C0E35FA931A000134_}
+ x{FF0020DDA4F260D31F01ED44D0D31FD166BAF2A1F80001D307D4D1821804A817C80073FB0201FB00A4C8CB1FC9ED54}
+ x{00000000}
+------------------------------------
+
+The first information line "got account state ... for ..." shows the account address and the masterchain block identifier with respect to which the account state has been dumped. Notice that even if the account state changes in a subsequent block, the `getaccount xxx` command will return the same result until the reference block is updated to a newer value by a `last` command. In this way one can study the state of all accounts and obtain consistent results.
+
+The "account state is (account ... " line begins the pretty-printed deserialized view of the account state. It is a deserialization of TL-B data type Account, used to represent account states in the TON Blockchain as explained in the TON Blockchain documentation. (You can find the TL-B scheme used for deserialization in the source file crypto/block/block.tlb; notice that if the scheme is out of date, the deserialization may break down.)
+
+Finally, the last several lines beginning with x{CFF538... (the "raw dump") contain the same information displayed as a tree of cells. In this case, we have one root cell containing the data bits CFF...134_ (the underscore means that the last binary one and all subsequent binary zeroes are to be removed, so hexadecimal "4_" corresponds to binary "0"), and two cells that are its children (displayed with one-space indentation).
+
+We can see that x{FF0020DDA4F260...} is the code of this smart contract. If we consult the Appendix A of the TON Virtual Machine documentation, we can even disassemble this code: FF00 is SETCP 0, 20 is DUP, DD is IFNOTRET, A4 is INC, F260 is THROWIF 32, and so on. (Incidentally, you can find the source code of this smartcontract in the source file crypto/block/mc0.fif .)
+
+We can also see that x{00009A15} (the actual value you see may be different) is the persistent data of this smart contract. It is actually an unsigned 32-bit integer, used by the smart contract as the counter of operations performed so far. Notice that this value is big-endian (i.e., 3 is encoded as x{00000003}, not as x{03000000}), as are all integers inside the TON Blockchain. In this case the counter is equal to 0x9A15 = 39445.
+
+The current balance of the smart contract is easily seen in the pretty-printed portion of the output. In this case, we see ... balance:(currencies:(grams:(nanograms:(... value:1000000000000000...)))), which is the balance of the account in (test) nanograms (a million test Grams in this example; the actual number you see may be smaller). If you study the TL-B scheme provided in crypto/block/scheme.tlb, you will be able to find this number (10^15) in binary big-endian form in the raw dump portion as well (it is located near the end of the data bits of the root cell).
+
+3. Compiling a new smart contract
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+
+Before uploading a new smart contract into the TON Blockchain, you need to determine its code and data and save them in serialized form into a file (called a "bag-of-cells" or BOC file, usually with a .boc suffix). Let us consider the case of a simple wallet smart contract, which stores a 32-bit operations counter and a 256-bit Ed25519 public key of its owner in its persistent data.
+
+Obviously, you'll need some tools for developing smart contracts - namely, a TON smart contract compiler. Basically, a TON smart contract compiler is a program that reads the source of a smart contract in a specialized high-level programming language and creates a .boc file from this source.
+
+One such tool is the Fift interpreter, which is included in this distribution and can help create simple smart contracts. Larger smart contracts should be developed using more sophisticated tools (such as the FunC compiler included in this distribution, that creates Fift assembler files from FunC source files; you can find some FunC smart-contract sources in the directory `crypto/smartcont`). However, Fift is sufficient for demonstration purposes.
+
+Consider the file `new-wallet.fif` (usually located as `crypto/smartcont/new-wallet.fif` with respect to the source directory) containing the source of a simple wallet smart contract:
+
+------------------------------------
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+"Asm.fif" include
+
+{ ."usage: " @' $0 type ." <workchain-id> [<filename-base>]" cr
+  ."Creates a new wallet in specified workchain, with private key saved to or loaded from <filename-base>.pk" cr
+  ."('new-wallet.pk' by default)" cr 1 halt
+} : usage
+$# 1- -2 and ' usage if
+
+$1 parse-workchain-id =: wc    // set workchain id from command line argument
+def? $2 { @' $2 } { "new-wallet" } cond constant file-base
+
+."Creating new wallet in workchain " wc . cr
+
+// Create new simple wallet
+<{ SETCP0 DUP IFNOTRET // return if recv_internal
+   DUP 85143 INT EQUAL IFJMP:<{ // "seqno" get-method
+     DROP c4 PUSHCTR CTOS 32 PLDU  // cnt
+   }>
+   INC 32 THROWIF  // fail unless recv_external
+   512 INT LDSLICEX DUP 32 PLDU   // sign cs cnt
+   c4 PUSHCTR CTOS 32 LDU 256 LDU ENDS  // sign cs cnt cnt' pubk
+   s1 s2 XCPU            // sign cs cnt pubk cnt' cnt
+   EQUAL 33 THROWIFNOT   // ( seqno mismatch? )
+   s2 PUSH HASHSU        // sign cs cnt pubk hash
+   s0 s4 s4 XC2PU        // pubk cs cnt hash sign pubk
+   CHKSIGNU              // pubk cs cnt ?
+   34 THROWIFNOT         // signature mismatch
+   ACCEPT
+   SWAP 32 LDU NIP 
+   DUP SREFS IF:<{
+     // 3 INT 35 LSHIFT# 3 INT RAWRESERVE    // reserve all but 103 Grams from the balance
+     8 LDU LDREF         // pubk cnt mode msg cs
+     s0 s2 XCHG SENDRAWMSG  // pubk cnt cs ; ( message sent )
+   }>
+   ENDS
+   INC NEWC 32 STU 256 STU ENDC c4 POPCTR
+}>c // >libref
+// code
+<b 0 32 u, 
+   file-base +".pk" load-generate-keypair
+   constant wallet_pk
+   B, 
+b> // data
+null // no libraries
+// Libs{ x{ABACABADABACABA} drop x{AAAA} s>c public_lib x{1234} x{5678} |_ s>c public_lib }Libs
+<b b{0011} s, 3 roll ref, rot ref, swap dict, b>  // create StateInit
+dup ."StateInit: " <s csr. cr
+dup hash wc swap 2dup 2constant wallet_addr
+."new wallet address = " 2dup .addr cr
+2dup file-base +".addr" save-address-verbose
+."Non-bounceable address (for init): " 2dup 7 .Addr cr
+."Bounceable address (for later access): " 6 .Addr cr
+<b 0 32 u, b>
+dup ."signing message: " <s csr. cr
+dup hash wallet_pk ed25519_sign_uint rot
+<b b{1000100} s, wallet_addr addr, b{000010} s, swap <s s, b{0} s, swap B, swap <s s, b>
+dup ."External message for initialization is " <s csr. cr
+2 boc+>B dup Bx. cr
+file-base +"-query.boc" tuck B>file
+."(Saved wallet creating query to file " type .")" cr
+--------------------------------------------
+
+(The actual source file in your distribution may be slighly different.) Essentially, it is a complete Fift script for creating a new instance of this smart contract controlled by a newly-generated keypair. The script accepts command-line arguments, so you don't need to edit the source file each time you want to create a new wallet.
+
+Now, provided that you have compiled Fift binary (usually located as "crypto/fift" with respect to the build directory), you can run
+
+$ crypto/fift -I<source-directory>/crypto/fift/lib -s <source-directory>/crypto/smartcont/new-wallet.fif 0 my_wallet_name
+
+where 0 is the workchain to contain the new wallet (0 = basechain, -1 = masterchain), `my_wallet_name` is any identifier you wish to be associated with this wallet. The address of the new wallet will be saved into file `my_wallet_name.addr`, its newly-generated private key will be saved to `my_wallet_name.pk` (unless this file already exists; then the key will be loaded from this file instead), and the external message will be saved into my_wallet_name-query.boc. If you do not indicate the name of your wallet (`my_wallet_name` in the example above), the default name `new-wallet` is used.
+
+You may opt to set the FIFTPATH environment variable to <source-directory>/crypto/fift/lib:<source-directory>/crypto/smartcont, the directories containing Fift.fif and Asm.fif library files, and the sample smart-contract sources, respectively; then you can omit the -I argument to the Fift interpreter. If you install the Fift binary `crypto/fift` to a directory included in your PATH (e.g., /usr/bin/fift), you can simply invoke
+
+$ fift -s new-wallet.fif 0 my_wallet_name
+
+instead of indicating the complete search paths in the command line.
+
+If everything worked, you'll see something like the following
+
+--------------------------------------------
+Creating new wallet in workchain 0 
+Saved new private key to file my_wallet_name.pk
+StateInit: x{34_}
+ x{FF0020DD2082014C97BA9730ED44D0D70B1FE0A4F260810200D71820D70B1FED44D0D31FD3FFD15112BAF2A122F901541044F910F2A2F80001D31F3120D74A96D307D402FB00DED1A4C8CB1FCBFFC9ED54}
+ x{00000000C59DC52962CC568AC5E72735EABB025C5BDF457D029AEEA6C2FFA5EB2A945446}
+
+new wallet address = 0:2ee9b4fd4f077c9b223280c35763df9edab0b41ac20d36f4009677df95c3afe2 
+(Saving address to file my_wallet_name.addr)
+Non-bounceable address (for init): 0QAu6bT9Twd8myIygMNXY9-e2rC0GsINNvQAlnfflcOv4uVb
+Bounceable address (for later access): kQAu6bT9Twd8myIygMNXY9-e2rC0GsINNvQAlnfflcOv4rie
+signing message: x{00000000}
+
+External message for initialization is x{88005DD369FA9E0EF93644650186AEC7BF3DB5616835841A6DE8012CEFBF2B875FC41190260D403E40B2EE8BEB2855D0F4447679D9B9519BE64BE421166ABA2C66BEAAAF4EBAF8E162886430243216DDA10FCE68C07B6D7DDAA3E372478D711E3E1041C00000001_}
+ x{FF0020DD2082014C97BA9730ED44D0D70B1FE0A4F260810200D71820D70B1FED44D0D31FD3FFD15112BAF2A122F901541044F910F2A2F80001D31F3120D74A96D307D402FB00DED1A4C8CB1FCBFFC9ED54}
+ x{00000000C59DC52962CC568AC5E72735EABB025C5BDF457D029AEEA6C2FFA5EB2A945446}
+
+B5EE9C724104030100000000E50002CF88005DD369FA9E0EF93644650186AEC7BF3DB5616835841A6DE8012CEFBF2B875FC41190260D403E40B2EE8BEB2855D0F4447679D9B9519BE64BE421166ABA2C66BEAAAF4EBAF8E162886430243216DDA10FCE68C07B6D7DDAA3E372478D711E3E1041C000000010010200A2FF0020DD2082014C97BA9730ED44D0D70B1FE0A4F260810200D71820D70B1FED44D0D31FD3FFD15112BAF2A122F901541044F910F2A2F80001D31F3120D74A96D307D402FB00DED1A4C8CB1FCBFFC9ED54004800000000C59DC52962CC568AC5E72735EABB025C5BDF457D029AEEA6C2FFA5EB2A945446BCF59C17
+(Saved wallet creating query to file my_wallet_name-query.boc)
+--------------------------------------------
+
+In a nutshell, the Fift assembler (loaded by the "Asm.fif" include line) is used to compile the source code of the smart contract (contained in <{ SETCP0 ... c4 POPCTR }> lines) into its internal representation. The initial data of the smart contract is also created (by <b 0 32 u, ... b> lines), containing a 32-bit sequence number (equal to zero) and a 256-bit public key from a newly-generated Ed25519 keypair. The corresponding private key is saved into the file `my_wallet_name.pk` unless it already exists (if you run this code twice in the same directory, the private key will be loaded from this file instead).
+
+The code and data for the new smart contract are combined into a StateInit structure (in the next lines), the address of the new smart contract (equal to the hash of this StateInit structure) is computed and output, and then an external message with a destination address equal to that of the new smart contract is created. This external message contains both the correct StateInit for the new smart contract and a non-trivial payload (signed by the correct private key).
+
+Finally, the external message is serialized into a bag of cells (represented by B5EE...BE63) and saved into the file `my_wallet_name-query.boc`. Essentially, this file is your compiled smart contract with all additional information necessary to upload it into the TON Blockchain.
+
+4. Transferring some funds to the new smart contract
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+
+You might try to upload the new smart contract immediately by running the Lite Client and typing
+
+> sendfile new-wallet-query.boc
+
+or
+
+> sendfile my_wallet_name-query.boc
+
+if you chose to name your wallet `my_wallet_name`.
+
+Unfortunately, this won't work, because smart contracts must have a positive balance to be able to pay for storing and processing their data in the blockchain. So you have to transfer some funds to your new smart contract address first, displayed during its generation as -1:60c0...c0d0 (in raw form) and 0f9..EKD (in user-friendly form).
+
+In a real scenario, you would either transfer some Grams from your already existing wallet, ask a friend to do so, or buy some Grams at a cryptocurrency exchange, indicating 0f9...EKD as the account to transfer the new Grams to.
+
+In the Test Network, you have another option: you can ask the "test giver" to give you some test Grams (up to 20). Let us explain how to do it.
+
+5. Using the test giver smart contract
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+
+You need to know the address of the test giver smart contract. We'll assume that it is -1:8156775b79325e5d62e742d9b96c30b6515a5cd2f1f64c5da4b193c03f070e0d, or, equivalently, Ef-BVndbeTJeXWLnQtm5bDC2UVpc0vH2TF2ksZPAPwcODSkb, as indicated in one of the previous examples. You inspect the state of this smart contract in the Lite Client by typing
+
+> last
+> getaccount Ef-BVndbeTJeXWLnQtm5bDC2UVpc0vH2TF2ksZPAPwcODSkb
+
+as explained above in Section 2. The only number you need from the output is the 32-bit sequence number stored in the smart contract data (it is zero in the example above, but generally it will be non-zero).
+
+Next, you create an external message to the test giver asking it to send another message to your (uninitialized) smart contract carrying a specified amount of test Grams. There is a special Fift script for generating this external message located at crypto/smartcont/testgiver.fif:
+
+--------------------------------------------
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+
+{ ."usage: " @' $0 type ." <dest-addr> <seqno> <amount> [<savefile>]" cr
+  ."Creates a request to TestGiver and saves it into <savefile>.boc" cr
+  ."('testgiver-query.boc' by default)" cr 1 halt
+} : usage
+
+$# 3 - -2 and ' usage if
+
+// "testgiver.addr" load-address 
+Masterchain 0x8156775b79325e5d62e742d9b96c30b6515a5cd2f1f64c5da4b193c03f070e0d
+2constant giver_addr
+ ."Test giver address = " giver_addr 2dup .addr cr 6 .Addr cr
+
+$1 true parse-load-address =: bounce 2=: dest_addr
+$2 parse-int =: seqno
+$3 $>GR =: amount
+def? $4 { @' $4 } { "testgiver-query" } cond constant savefile
+
+."Requesting " amount .GR ."to account "
+dest_addr 2dup bounce 7 + .Addr ." = " .addr
+."seqno=0x" seqno x. ."bounce=" bounce . cr
+
+// create a message (NB: 01b00.., b = bounce)
+<b b{01} s, bounce 1 i, b{000100} s, dest_addr addr, 
+   amount Gram, 0 9 64 32 + + 1+ 1+ u, "GIFT" $, b>
+<b seqno 32 u, 1 8 u, swap ref, b>
+dup ."enveloping message: " <s csr. cr
+<b b{1000100} s, giver_addr addr, 0 Gram, b{00} s,
+   swap <s s, b>
+dup ."resulting external message: " <s csr. cr
+2 boc+>B dup Bx. cr
+savefile +".boc" tuck B>file
+."(Saved to file " type .")" cr
+---------------------------------------------
+
+You can pass the required parameters as command-line arguments to this script
+
+$ crypto/fift -I<include-path> -s <path-to-testgiver-fif> <dest-addr> <testgiver-seqno> <gram-amount> [<savefile>]
+
+For instance,
+
+$ crypto/fift -I<source-directory>/crypto/fift/lib:<source-directory>/crypto/smartcont -s testgiver.fif 0QAu6bT9Twd8myIygMNXY9-e2rC0GsINNvQAlnfflcOv4uVb 0x9A15 6.666 wallet-query
+
+or simply
+
+$ fift -s testgiver.fif 0QAu6bT9Twd8myIygMNXY9-e2rC0GsINNvQAlnfflcOv4uVb 0x9A15 6.666 wallet-query
+
+provided you have set up the environment variable FIFTPATH to <source-directory>/crypto/fift/lib:<source-directory>/crypto/smartcont and installed the fift binary as /usr/bin/fift (or anywhere else in your PATH).
+
+The newly-created message to the new smart contract must have its bounce bit clear, otherwise the transfer will be "bounced" to its sender. This is the reason we have passed the "non-bounceable" address 0QAu6bT9Twd8myIygMNXY9-e2rC0GsINNvQAlnfflcOv4uVb of our new wallet smart contract.
+
+This Fift code creates an internal message from the test giver smart contract to the address of our new smart contract carrying 6.666 test Grams (you can enter any other amount here up to approximately 20 Grams). Then this message is enveloped into an external message addressed to the test giver; this external message must also contain the correct sequence number of the test giver. When the test giver receives such an external message, it checks whether the sequence number matches the one stored in its persistent data, and if it does, sends the embedded internal message with the required amount of test Grams to its destination (our smart contract in this case).
+
+The external message is serialized and saved into the file `wallet-query.boc`. Some output is generated in the process:
+
+---------------------------------------------
+Test giver address = -1:8156775b79325e5d62e742d9b96c30b6515a5cd2f1f64c5da4b193c03f070e0d 
+kf-BVndbeTJeXWLnQtm5bDC2UVpc0vH2TF2ksZPAPwcODZKR
+Requesting GR$6.666 to account 0QAu6bT9Twd8myIygMNXY9-e2rC0GsINNvQAlnfflcOv4uVb = 0:2ee9b4fd4f077c9b223280c35763df9edab0b41ac20d36f4009677df95c3afe2 seqno=0x9a15 bounce=0 
+enveloping message: x{00009A1501}
+ x{42001774DA7EA783BE4D91194061ABB1EFCF6D585A0D61069B7A004B3BEFCAE1D7F1280C6A98B4000000000000000000000000000047494654}
+
+resulting external message: x{89FF02ACEEB6F264BCBAC5CE85B372D8616CA2B4B9A5E3EC98BB496327807E0E1C1A000004D0A80C_}
+ x{42001774DA7EA783BE4D91194061ABB1EFCF6D585A0D61069B7A004B3BEFCAE1D7F1280C6A98B4000000000000000000000000000047494654}
+
+B5EE9C7241040201000000006600014F89FF02ACEEB6F264BCBAC5CE85B372D8616CA2B4B9A5E3EC98BB496327807E0E1C1A000004D0A80C01007242001774DA7EA783BE4D91194061ABB1EFCF6D585A0D61069B7A004B3BEFCAE1D7F1280C6A98B4000000000000000000000000000047494654AFC17FA4
+(Saved to file wallet-query.boc)
+---------------------------------------------
+
+6. Uploading the external message to the test giver smart contract
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+
+Now we can invoke the Lite Client, check the state of the test giver (if the sequence number has changed, our external message will fail), and then type
+
+> sendfile wallet-query.boc
+
+We will see some output:
+... external message status is 1
+
+which means that the external message has been delivered to the collator pool. Afterwards one of the collators might choose to include this external message in a block, creating a transaction for the test giver smart contract to process this external message. We can check whether the state of the test giver has changed:
+
+> last
+> getaccount Ef-BVndbeTJeXWLnQtm5bDC2UVpc0vH2TF2ksZPAPwcODSkb
+
+(If you forget to type `last`, you are likely to see the unchanged state of the test giver smart contract.) The resulting output would be:
+
+---------------------------------------------
+got account state for -1:8156775B79325E5D62E742D9B96C30B6515A5CD2F1F64C5DA4B193C03F070E0D with respect to blocks (-1,8000000000000000,10441):2DCFB7F734913261B85B8866DFF7CBEF07205EAA0769F4EE15E242AB520A2CC5:4F96F417BCD74D5DAE0CC3CCC285E513B85652002D9AD8CC884781D8465E3591 and (-1,8000000000000000,10441):2DCFB7F734913261B85B8866DFF7CBEF07205EAA0769F4EE15E242AB520A2CC5:4F96F417BCD74D5DAE0CC3CCC285E513B85652002D9AD8CC884781D8465E3591
+account state is (account
+  addr:(addr_std
+    anycast:nothing workchain_id:-1 address:x8156775B79325E5D62E742D9B96C30B6515A5CD2F1F64C5DA4B193C03F070E0D)
+  storage_stat:(storage_info
+    used:(storage_used
+      cells:(var_uint len:1 value:3)
+      bits:(var_uint len:2 value:539)
+      public_cells:(var_uint len:0 value:0)) last_paid:0
+    due_payment:nothing)
+  storage:(account_storage last_trans_lt:10697000003
+    balance:(currencies
+      grams:(nanograms
+        amount:(var_uint len:7 value:999993280210000))
+      other:(extra_currencies
+        dict:hme_empty))
+    state:(account_active
+      (
+        split_depth:nothing
+        special:nothing
+        code:(just
+          value:(raw@^Cell 
+            x{}
+             x{FF0020DDA4F260D31F01ED44D0D31FD166BAF2A1F80001D307D4D1821804A817C80073FB0201FB00A4C8CB1FC9ED54}
+            ))
+        data:(just
+          value:(raw@^Cell 
+            x{}
+             x{00009A16}
+            ))
+        library:hme_empty))))
+x{CFF8156775B79325E5D62E742D9B96C30B6515A5CD2F1F64C5DA4B193C03F070E0D2068086C00000000000000009F65D110DC0E35F450FA914134_}
+ x{FF0020DDA4F260D31F01ED44D0D31FD166BAF2A1F80001D307D4D1821804A817C80073FB0201FB00A4C8CB1FC9ED54}
+ x{00000001}
+---------------------------------------------
+
+You may notice that the sequence number stored in the persistent data has changed (in our example, to 0x9A16 = 39446), and the last_trans_lt field (the logical time of the last transaction of this account) has been increased.
+
+Now we can inspect the state of our new smart contract:
+
+> getaccount 0QAu6bT9Twd8myIygMNXY9-e2rC0GsINNvQAlnfflcOv4uVb
+or
+> getaccount 0:2ee9b4fd4f077c9b223280c35763df9edab0b41ac20d36f4009677df95c3afe2
+Now we see
+
+---------------------------------------------
+got account state for 0:2EE9B4FD4F077C9B223280C35763DF9EDAB0B41AC20D36F4009677DF95C3AFE2 with respect to blocks (-1,8000000000000000,16481):890F4D549428B2929F5D5E0C5719FBCDA60B308BA4B907797C9E846E644ADF26:22387176928F7BCEF654411CA820D858D57A10BBF1A0E153E1F77DE2EFB2A3FB and (-1,8000000000000000,16481):890F4D549428B2929F5D5E0C5719FBCDA60B308BA4B907797C9E846E644ADF26:22387176928F7BCEF654411CA820D858D57A10BBF1A0E153E1F77DE2EFB2A3FB
+account state is (account
+  addr:(addr_std
+    anycast:nothing workchain_id:0 address:x2EE9B4FD4F077C9B223280C35763DF9EDAB0B41AC20D36F4009677DF95C3AFE2)
+  storage_stat:(storage_info
+    used:(storage_used
+      cells:(var_uint len:1 value:1)
+      bits:(var_uint len:1 value:111)
+      public_cells:(var_uint len:0 value:0)) last_paid:1553210152
+    due_payment:nothing)
+  storage:(account_storage last_trans_lt:16413000004
+    balance:(currencies
+      grams:(nanograms
+        amount:(var_uint len:5 value:6666000000))
+      other:(extra_currencies
+        dict:hme_empty))
+    state:account_uninit))
+x{CFF60C04141C6A7B96D68615E7A91D265AD0F3A9A922E9AE9C901D4FA83F5D3C0D02025BC2E4A0D9400000000F492A0511406354C5A004_}
+---------------------------------------------
+
+Our new smart contract has some positive balance (of 6.666 test Grams), but has no code or data (reflected by `state:account_uninit`).
+
+7. Uploading the code and data of the new smart contract
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+
+Now you can finally upload the external message with the StateInit of the new smart contract, containing its code and data:
+
+---------------------------------------------
+> sendfile my_wallet_name-query.boc
+... external message status is 1
+> last
+...
+> getaccount 0QAu6bT9Twd8myIygMNXY9-e2rC0GsINNvQAlnfflcOv4uVb
+...
+got account state for 0:2EE9B4FD4F077C9B223280C35763DF9EDAB0B41AC20D36F4009677DF95C3AFE2 with respect to blocks (-1,8000000000000000,16709):D223B25D8D68401B4AA19893C00221CF9AB6B4E5BFECC75FD6048C27E001E0E2:4C184191CE996CF6F91F59CAD9B99B2FD5F3AA6F55B0B6135069AB432264358E and (-1,8000000000000000,16709):D223B25D8D68401B4AA19893C00221CF9AB6B4E5BFECC75FD6048C27E001E0E2:4C184191CE996CF6F91F59CAD9B99B2FD5F3AA6F55B0B6135069AB432264358E
+account state is (account
+  addr:(addr_std
+    anycast:nothing workchain_id:0 address:x2EE9B4FD4F077C9B223280C35763DF9EDAB0B41AC20D36F4009677DF95C3AFE2)
+  storage_stat:(storage_info
+    used:(storage_used
+      cells:(var_uint len:1 value:3)
+      bits:(var_uint len:2 value:963)
+      public_cells:(var_uint len:0 value:0)) last_paid:1553210725
+    due_payment:nothing)
+  storage:(account_storage last_trans_lt:16625000002
+    balance:(currencies
+      grams:(nanograms
+        amount:(var_uint len:5 value:5983177000))
+      other:(extra_currencies
+        dict:hme_empty))
+    state:(account_active
+      (
+        split_depth:nothing
+        special:nothing
+        code:(just
+          value:(raw@^Cell 
+            x{}
+             x{FF0020DDA4F260810200D71820D70B1FED44D0D7091FD709FFD15112BAF2A122F901541044F910F2A2F80001D7091F3120D74A97D70907D402FB00DED1A4C8CB1FCBFFC9ED54}
+            ))
+        data:(just
+          value:(raw@^Cell 
+            x{}
+             x{00000001F61CF0BC8E891AD7636E0CD35229D579323AA2DA827EB85D8071407464DC2FA3}
+            ))
+        library:hme_empty))))
+x{CFF60C04141C6A7B96D68615E7A91D265AD0F3A9A922E9AE9C901D4FA83F5D3C0D020680F0C2E4A0EB280000000F7BB57909405928024A134_}
+ x{FF0020DDA4F260810200D71820D70B1FED44D0D7091FD709FFD15112BAF2A122F901541044F910F2A2F80001D7091F3120D74A97D70907D402FB00DED1A4C8CB1FCBFFC9ED54}
+ x{00000001F61CF0BC8E891AD7636E0CD35229D579323AA2DA827EB85D8071407464DC2FA3}
+---------------------------------------------
+
+You will see that the smart contract has been initialized using code and data from the StateInit of the external message, and its balance has been slightly decreased because of the processing fees. Now it is up and running, and you can activate it by generating new external messages and uploading them to the TON Blockchain using the "sendfile" command of the Lite Client.
+
+8. Using the simple wallet smart contract
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+
+Actually, the simple wallet smart contract used in this example can be used to transfer test Grams to any other accounts. It is in this respect similar to the test giver smart contract discussed above, with the difference that it processes only external messages signed by the correct private key (of its owner). In our case, it is the private key saved into the file "my_wallet_name.pk" during the compilation of the smart contract (see Section 3).
+
+An example of how you might use this smart contract is provided in sample file crypto/smartcont/wallet.fif :
+
+--------------------------------------------------------
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+
+{ ."usage: " @' $0 type ." <filename-base> <dest-addr> <seqno> <amount> [-B <body-boc>] [<savefile>]" cr
+  ."Creates a request to simple wallet created by new-wallet.fif, with private key loaded from file <filename-base>.pk "
+  ."and address from <filename-base>.addr, and saves it into <savefile>.boc ('wallet-query.boc' by default)" cr 1 halt
+} : usage
+$# dup 4 < swap 5 > or ' usage if
+def? $6 { @' $5 "-B" $= { @' $6 =: body-boc-file [forget] $6 def? $7 { @' $7 =: $5 [forget] $7 } { [forget] $5 } cond
+  @' $# 2- =: $# } if } if
+
+true constant bounce
+
+$1 =: file-base
+$2 bounce parse-load-address =: bounce 2=: dest_addr
+$3 parse-int =: seqno
+$4 $>GR =: amount
+def? $5 { @' $5 } { "wallet-query" } cond constant savefile
+
+file-base +".addr" load-address
+2dup 2constant wallet_addr
+."Source wallet address = " 2dup .addr cr 6 .Addr cr
+file-base +".pk" load-keypair nip constant wallet_pk
+
+def? body-boc-file { @' body-boc-file file>B B>boc } { <b "TEST" $, b> } cond
+constant body-cell
+
+."Transferring " amount .GR ."to account "
+dest_addr 2dup bounce 7 + .Addr ." = " .addr 
+."seqno=0x" seqno x. ."bounce=" bounce . cr
+."Body of transfer message is " body-cell <s csr. cr
+  
+// create a message
+<b b{01} s, bounce 1 i, b{000100} s, dest_addr addr, amount Gram, 0 9 64 32 + + 1+ u, 
+  body-cell <s 2dup s-fits? not rot over 1 i, -rot { drop body-cell ref, } { s, } cond
+b>
+<b seqno 32 u, 1 8 u, swap ref, b>
+dup ."signing message: " <s csr. cr
+dup hash wallet_pk ed25519_sign_uint
+<b b{1000100} s, wallet_addr addr, 0 Gram, b{00} s,
+   swap B, swap <s s, b>
+dup ."resulting external message: " <s csr. cr
+2 boc+>B dup Bx. cr
+savefile +".boc" tuck B>file
+."(Saved to file " type .")" cr
+-------------------------------------
+
+You can invoke this script as follows:
+
+$ fift -I<source-directory>/crypto/fift/lib:<source-directory>/crypto/smartcont -s wallet.fif <your-wallet-id> <destination-addr> <your-wallet-seqno> <gram-amount>
+
+or simply
+
+$ fift -s wallet.fif <your-wallet-id> <destination-addr> <your-wallet-seqno> <gram-amount>
+
+if you have correctly set up PATH and FIFTPATH.
+
+For example,
+
+$ fift -s wallet.fif my_wallet_name kf8Ty2EqAKfAksff0upF1gOptUWRukyI9x5wfgCbh58Pss9j 1 .666
+
+Here `my_wallet_name` is the identifier of your wallet used before with new-wallet.fif; the address and the private key of your test wallet will be loaded from files `my_wallet_name.addr` and `my_wallet_name.pk` in the current directory.
+
+When you run this code (by invoking the Fift interpreter), you create an external message with a destination equal to the address of your wallet smart contract, containing a correct Ed25519 signature, a sequence number, and an enveloped internal message from your wallet smart contract to the smart contract indicated in dest_addr, with an arbitrary value attached and an arbitrary payload. When your smart contract receives and processes this external message, it first checks the signature and the sequence number. If they are correct, it accepts the external message, sends the embedded internal message from itself to the intended destination, and increases the sequence number in its persistent data (this is a simple measure to prevent replay attacks, in case this sample wallet smart contract code ends up used in a real wallet application).
+
+Of course, a true TON Blockchain wallet application would hide all the intermediate steps explained above. It would first communicate the address of the new smart contract to the user, asking them to transfer some funds to the indicated address (displayed in its non-bounceable user-friendly form) from another wallet or a cryptocurrency exchange, and then would provide a simple interface to display the current balance and to transfer funds to whatever other addresses the user wants. (The aim of this document is to explain how to create new non-trivial smart contracts and experiment with the TON Blockchain Test Network, rather than to explain how one could use the Lite Client instead of a more user-friendly wallet application.)
+
+One final remark: The above examples used smart contracts in the basic workchain (workchain 0). They would work in exactly the same way in the masterchain (workchain -1), if one passes workchain identifier -1 instead of 0 as the first argument to `new-wallet.fif`. The only difference is that the processing and storage fees in the basic workchain are 100-1000 times lower than in the masterchain. Some smart contracts (such as the validator election smart contract) accept transfers only from masterchain smart contracts, so you'll need a wallet in the masterchain if you wish to make stakes on behalf of your own validator and participate in the elections.
diff --git a/submodules/ton/tonlib-src/LGPLv2 b/submodules/ton/tonlib-src/LGPLv2
new file mode 100644
index 0000000000..d93ab1b9a3
--- /dev/null
+++ b/submodules/ton/tonlib-src/LGPLv2
@@ -0,0 +1,18 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
diff --git a/submodules/ton/tonlib-src/LICENSE.LGPL b/submodules/ton/tonlib-src/LICENSE.LGPL
new file mode 100644
index 0000000000..b482fc4ed4
--- /dev/null
+++ b/submodules/ton/tonlib-src/LICENSE.LGPL
@@ -0,0 +1,481 @@
+                 GNU LIBRARY GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
+
+ Copyright (C) 1991 Free Software Foundation, Inc.
+ 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the library GPL.  It is
+ numbered 2 because it goes with version 2 of the ordinary GPL.]
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+  This license, the Library General Public License, applies to some
+specially designated Free Software Foundation software, and to any
+other libraries whose authors decide to use it.  You can use it for
+your libraries, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if
+you distribute copies of the library, or if you modify it.
+
+  For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you.  You must make sure that they, too, receive or can get the source
+code.  If you link a program with the library, you must provide
+complete object files to the recipients so that they can relink them
+with the library, after making changes to the library and recompiling
+it.  And you must show them these terms so they know their rights.
+
+  Our method of protecting your rights has two steps: (1) copyright
+the library, and (2) offer you this license which gives you legal
+permission to copy, distribute and/or modify the library.
+
+  Also, for each distributor's protection, we want to make certain
+that everyone understands that there is no warranty for this free
+library.  If the library is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original
+version, so that any problems introduced by others will not reflect on
+the original authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that companies distributing free
+software will individually obtain patent licenses, thus in effect
+transforming the program into proprietary software.  To prevent this,
+we have made it clear that any patent must be licensed for everyone's
+free use or not licensed at all.
+
+  Most GNU software, including some libraries, is covered by the ordinary
+GNU General Public License, which was designed for utility programs.  This
+license, the GNU Library General Public License, applies to certain
+designated libraries.  This license is quite different from the ordinary
+one; be sure to read it in full, and don't assume that anything in it is
+the same as in the ordinary license.
+
+  The reason we have a separate public license for some libraries is that
+they blur the distinction we usually make between modifying or adding to a
+program and simply using it.  Linking a program with a library, without
+changing the library, is in some sense simply using the library, and is
+analogous to running a utility program or application program.  However, in
+a textual and legal sense, the linked executable is a combined work, a
+derivative of the original library, and the ordinary General Public License
+treats it as such.
+
+  Because of this blurred distinction, using the ordinary General
+Public License for libraries did not effectively promote software
+sharing, because most developers did not use the libraries.  We
+concluded that weaker conditions might promote sharing better.
+
+  However, unrestricted linking of non-free programs would deprive the
+users of those programs of all benefit from the free status of the
+libraries themselves.  This Library General Public License is intended to
+permit developers of non-free programs to use free libraries, while
+preserving your freedom as a user of such programs to change the free
+libraries that are incorporated in them.  (We have not seen how to achieve
+this as regards changes in header files, but we have achieved it as regards
+changes in the actual functions of the Library.)  The hope is that this
+will lead to faster development of free libraries.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.  Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library".  The
+former contains code derived from the library, while the latter only
+works together with the library.
+
+  Note that it is possible for a library to be covered by the ordinary
+General Public License rather than by this special one.
+
+                  GNU LIBRARY GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License Agreement applies to any software library which
+contains a notice placed by the copyright holder or other authorized
+party saying it may be distributed under the terms of this Library
+General Public License (also called "this License").  Each licensee is
+addressed as "you".
+
+  A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+  The "Library", below, refers to any such software library or work
+which has been distributed under these terms.  A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language.  (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+  "Source code" for a work means the preferred form of the work for
+making modifications to it.  For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control compilation
+and installation of the library.
+
+  Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it).  Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+  
+  1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+  You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+  2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+
+    b) You must cause the files modified to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    c) You must cause the whole of the work to be licensed at no
+    charge to all third parties under the terms of this License.
+
+    d) If a facility in the modified Library refers to a function or a
+    table of data to be supplied by an application program that uses
+    the facility, other than as an argument passed when the facility
+    is invoked, then you must make a good faith effort to ensure that,
+    in the event an application does not supply such function or
+    table, the facility still operates, and performs whatever part of
+    its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has
+    a purpose that is entirely well-defined independent of the
+    application.  Therefore, Subsection 2d requires that any
+    application-supplied function or table used by this function must
+    be optional: if the application does not supply it, the square
+    root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library.  To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License.  (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.)  Do not make any other change in
+these notices.
+
+  Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+  This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+  4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+  If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library".  Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+  However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library".  The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+  When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library.  The
+threshold for this to be true is not precisely defined by law.
+
+  If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work.  (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+  Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+  6. As an exception to the Sections above, you may also compile or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+  You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License.  You must supply a copy of this License.  If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License.  Also, you must do one
+of these things:
+
+    a) Accompany the work with the complete corresponding
+    machine-readable source code for the Library including whatever
+    changes were used in the work (which must be distributed under
+    Sections 1 and 2 above); and, if the work is an executable linked
+    with the Library, with the complete machine-readable "work that
+    uses the Library", as object code and/or source code, so that the
+    user can modify the Library and then relink to produce a modified
+    executable containing the modified Library.  (It is understood
+    that the user who changes the contents of definitions files in the
+    Library will not necessarily be able to recompile the application
+    to use the modified definitions.)
+
+    b) Accompany the work with a written offer, valid for at
+    least three years, to give the same user the materials
+    specified in Subsection 6a, above, for a charge no more
+    than the cost of performing this distribution.
+
+    c) If distribution of the work is made by offering access to copy
+    from a designated place, offer equivalent access to copy the above
+    specified materials from the same place.
+
+    d) Verify that the user has already received a copy of these
+    materials or that you have already sent this user a copy.
+
+  For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it.  However, as a special exception,
+the source code distributed need not include anything that is normally
+distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+  It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system.  Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+  7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work
+    based on the Library, uncombined with any other library
+    facilities.  This must be distributed under the terms of the
+    Sections above.
+
+    b) Give prominent notice with the combined library of the fact
+    that part of it is a work based on the Library, and explaining
+    where to find the accompanying uncombined form of the same work.
+
+  8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License.  Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License.  However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+  9. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Library or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+  10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any
+particular circumstance, the balance of the section is intended to apply,
+and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License may add
+an explicit geographical distribution limitation excluding those countries,
+so that distribution is permitted only in or among countries not thus
+excluded.  In such case, this License incorporates the limitation as if
+written in the body of this License.
+
+  13. The Free Software Foundation may publish revised and/or new
+versions of the Library General Public License from time to time.
+Such new versions will be similar in spirit to the present version,
+but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation.  If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+  14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission.  For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this.  Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+                            NO WARRANTY
+
+  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
+LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
+FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+           How to Apply These Terms to Your New Libraries
+
+  If you develop a new library, and you want it to be of the greatest
+possible use to the public, we recommend making it free software that
+everyone can redistribute and change.  You can do so by permitting
+redistribution under these terms (or, alternatively, under the terms of the
+ordinary General Public License).
+
+  To apply these terms, attach the following notices to the library.  It is
+safest to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least the
+"copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the library's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Library General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Library General Public License for more details.
+
+    You should have received a copy of the GNU Library General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the library, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the
+  library `Frob' (a library for tweaking knobs) written by James Random Hacker.
+
+  <signature of Ty Coon>, 1 April 1990
+  Ty Coon, President of Vice
+
+That's all there is to it!
diff --git a/submodules/ton/tonlib-src/README b/submodules/ton/tonlib-src/README
new file mode 100644
index 0000000000..7379d91e51
--- /dev/null
+++ b/submodules/ton/tonlib-src/README
@@ -0,0 +1,49 @@
+This archive is a distribution of a preliminary version of the TON Blockchain Lite Client along with the relevant portions of the TON Blockchain Library. It is not necessarily representative of the totality of the TON Blockchain code developed so far; rather it is a simplified stable version, containing only those files that are necessary for compiling the Lite Client, and sometimes outdated versions of these files sufficient for this purpose.
+
+Use this software at your own risk; consult the DISCLAIMER for more information.
+
+The software is licensed under GNU Lesser General Public License version 2 or later; consult LICENSE.LGPL and LGPL.v2 for more information. If you ever use any of these source files to develop your own versions of this or other software, you must attach a comment with the contents of LGPL.v2 to the beginning of each source file taken from this archive.
+
+The software is likely to compile and work properly on most Linux systems. It should work on macOS and even Windows; however, we do not guarantee this for this preliminary version.
+
+BASIC COMPILATION AND INSTALLATION INSTRUCTIONS
+
+1) Download and unpack the newest version of this archive, available at
+
+https://test.ton.org/download
+
+The TON Blockchain Test Network is updated quite often, so we cannot guarantee that older versions of the Lite Client will always work. Backward compatibility is not enforced at this development stage.
+
+2) Install the newest versions of make, cmake (version 3.0.2 or later), OpenSSL (including C header files), and g++ or clang (or another C++14-compatible compiler as appropriate for your operating system). We strongly recommend installing OpenSSL version 1.1.1 or later for better performance, especially if you intend to run a Full Node or a Validator as well.
+
+3) Suppose that you have unpacked this archive to directory ~/lite-client, where ~ is your home directory, and that you have created an empty directory ~/liteclient-build. Then run the following in a terminal on a Linux system:
+
+cd ~/liteclient-build
+cmake ~/lite-client
+cmake --build . --target lite-client
+
+You might also build some extra utilities useful for smart-contract development:
+
+cmake --build . --target fift
+cmake --build . --target func
+
+4) Download the newest configuration file from https://test.ton.org/ton-lite-client-test1.config.json :
+
+wget https://test.ton.org/ton-lite-client-test1.config.json
+
+5) Run the Lite Client:
+
+./lite-client/lite-client -C ton-lite-client-test1.config.json
+
+If everything was installed successfully, the Lite Client will connect to a special server (a full node for the TON Blockchain Test Network #1) and will send some queries to the server.
+If you indicate a writeable "database" directory as an extra argument to the client, it will download and save the block and the state corresponding to the newest masterchain block:
+
+./lite-client/lite-client -C ton-lite-client-test1.config.json -D ~/ton-db-dir
+
+Basic help info can be obtained by typing "help" into the Lite Client. Type "quit" or press Ctrl-C to exit.
+
+6) Now you can create new smart contracts, examine the state of existing smart contracts, send external messages to smart contracts and so on. You can also use Fift (if you have compiled it) to compile, execute, and debug your smart contracts locally.
+
+More details on these activities, including step-by-step instructions for creating a simple wallet smart contract (along with its source code), may be found in the HOWTO file included in this archive.
+
+7) Some documentation on the TON Blockchain and TON Virtual Machine may be found at the download page https://test.ton.org/download . Be aware that this documentation may not be completely in sync with the version currently employed by the Test Network, because some minor implementation details are likely to be changed during the final development and testing phases.
diff --git a/submodules/ton/tonlib-src/adnl/CMakeLists.txt b/submodules/ton/tonlib-src/adnl/CMakeLists.txt
new file mode 100644
index 0000000000..06254160e3
--- /dev/null
+++ b/submodules/ton/tonlib-src/adnl/CMakeLists.txt
@@ -0,0 +1,16 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+
+set(ADNL_LITE_SOURCE
+  adnl-ext-client.cpp
+  adnl-ext-connection.cpp
+  adnl-query.cpp
+
+  ${ADNL_LITE_HEADERS}
+)
+
+
+add_library(adnllite STATIC ${ADNL_LITE_SOURCE})
+
+target_include_directories(adnllite PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/..>)
+target_link_libraries(adnllite PUBLIC tdactor ton_crypto tl_lite_api tdnet keys )
diff --git a/submodules/ton/tonlib-src/adnl/adnl-ext-client.cpp b/submodules/ton/tonlib-src/adnl/adnl-ext-client.cpp
new file mode 100644
index 0000000000..efc71e6f27
--- /dev/null
+++ b/submodules/ton/tonlib-src/adnl/adnl-ext-client.cpp
@@ -0,0 +1,181 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "adnl-ext-client.hpp"
+#include "adnl-ext-client.h"
+
+namespace ton {
+
+namespace adnl {
+
+void AdnlExtClientImpl::alarm() {
+  if (is_closing_) {
+    return;
+  }
+  if (conn_.empty() || !conn_.is_alive()) {
+    next_create_at_ = td::Timestamp::in(10.0);
+    alarm_timestamp() = next_create_at_;
+
+    auto fd = td::SocketFd::open(dst_addr_);
+    if (fd.is_error()) {
+      LOG(INFO) << "failed to connect to " << dst_addr_ << ": " << fd.move_as_error();
+      return;
+    }
+
+    class Cb : public AdnlExtConnection::Callback {
+     private:
+      td::actor::ActorId<AdnlExtClientImpl> id_;
+
+     public:
+      void on_ready(td::actor::ActorId<AdnlExtConnection> conn) {
+        td::actor::send_closure(id_, &AdnlExtClientImpl::conn_ready, conn);
+      }
+      void on_close(td::actor::ActorId<AdnlExtConnection> conn) {
+        td::actor::send_closure(id_, &AdnlExtClientImpl::conn_stopped, conn);
+      }
+      Cb(td::actor::ActorId<AdnlExtClientImpl> id) : id_(id) {
+      }
+    };
+
+    conn_ = td::actor::create_actor<AdnlOutboundConnection>(td::actor::ActorOptions().with_name("outconn").with_poll(),
+                                                            fd.move_as_ok(), std::make_unique<Cb>(actor_id(this)), dst_,
+                                                            local_id_, actor_id(this));
+  }
+}
+
+void AdnlExtClientImpl::hangup() {
+  conn_ = {};
+  is_closing_ = true;
+  ref_cnt_--;
+  try_stop();
+}
+
+void AdnlExtClientImpl::try_stop() {
+  if (is_closing_ && ref_cnt_ == 0 && out_queries_.empty()) {
+    stop();
+  }
+}
+
+td::Status AdnlOutboundConnection::process_custom_packet(td::BufferSlice &data, bool &processed) {
+  if (data.size() == 12) {
+    auto F = fetch_tl_object<ton_api::tcp_pong>(data.clone(), true);
+    if (F.is_ok()) {
+      processed = true;
+      return td::Status::OK();
+    }
+  }
+  if (!local_id_.empty() && nonce_.size() != 0) {
+    auto F = fetch_tl_object<ton_api::tcp_authentificationNonce>(data.clone(), true);
+    if (F.is_ok()) {
+      auto f = F.move_as_ok();
+      if (f->nonce_.size() == 0 || f->nonce_.size() > 512) {
+        return td::Status::Error(ErrorCode::protoviolation, "bad nonce size");
+      }
+      td::SecureString ss{nonce_.size() + f->nonce_.size()};
+      ss.as_mutable_slice().copy_from(nonce_.as_slice());
+      ss.as_mutable_slice().remove_prefix(nonce_.size()).copy_from(f->nonce_.as_slice());
+
+      TRY_RESULT(dec, local_id_.create_decryptor());
+      TRY_RESULT(B, dec->sign(ss.as_slice()));
+
+      auto obj =
+          create_tl_object<ton_api::tcp_authentificationComplete>(local_id_.compute_public_key().tl(), std::move(B));
+      send(serialize_tl_object(obj, true));
+
+      nonce_.clear();
+
+      processed = true;
+      authorization_complete_ = true;
+      return td::Status::OK();
+    }
+  }
+  return td::Status::OK();
+}
+
+void AdnlOutboundConnection::start_up() {
+  AdnlExtConnection::start_up();
+  auto X = dst_.pubkey().create_encryptor();
+  if (X.is_error()) {
+    LOG(ERROR) << "failed to init encryptor: " << X.move_as_error();
+    stop();
+    return;
+  }
+  auto enc = X.move_as_ok();
+
+  td::BufferSlice d{256};
+  auto id = dst_.compute_short_id();
+  auto S = d.as_slice();
+  S.copy_from(id.as_slice());
+  S.remove_prefix(32);
+  S.truncate(256 - 64 - 32);
+  td::Random::secure_bytes(S);
+  init_crypto(S);
+
+  auto R = enc->encrypt(S);
+  if (R.is_error()) {
+    LOG(ERROR) << "failed to  encrypt: " << R.move_as_error();
+    stop();
+    return;
+  }
+  auto data = R.move_as_ok();
+  LOG_CHECK(data.size() == 256 - 32) << "size=" << data.size();
+  S = d.as_slice();
+  S.remove_prefix(32);
+  CHECK(S.size() == data.size());
+  S.copy_from(data.as_slice());
+
+  send_uninit(std::move(d));
+
+  if (!local_id_.empty()) {
+    nonce_ = td::SecureString{32};
+    td::Random::secure_bytes(nonce_.as_mutable_slice());
+    auto obj = create_tl_object<ton_api::tcp_authentificate>(td::BufferSlice{nonce_.as_slice()});
+    send(serialize_tl_object(obj, true));
+  }
+}
+
+void AdnlExtClientImpl::check_ready(td::Promise<td::Unit> promise) {
+  if (conn_.empty() || !conn_.is_alive()) {
+    promise.set_error(td::Status::Error(ErrorCode::notready, "not ready"));
+    return;
+  }
+  td::actor::send_closure(td::actor::ActorId<AdnlExtConnection>{conn_.get()}, &AdnlExtConnection::check_ready_async,
+                          std::move(promise));
+}
+
+td::actor::ActorOwn<AdnlExtClient> AdnlExtClient::create(AdnlNodeIdFull dst, td::IPAddress dst_addr,
+                                                         std::unique_ptr<AdnlExtClient::Callback> callback) {
+  return td::actor::create_actor<AdnlExtClientImpl>("extclient", std::move(dst), dst_addr, std::move(callback));
+}
+
+td::actor::ActorOwn<AdnlExtClient> AdnlExtClient::create(AdnlNodeIdFull dst, PrivateKey local_id,
+                                                         td::IPAddress dst_addr,
+                                                         std::unique_ptr<AdnlExtClient::Callback> callback) {
+  return td::actor::create_actor<AdnlExtClientImpl>("extclient", std::move(dst), std::move(local_id), dst_addr,
+                                                    std::move(callback));
+}
+
+td::Status AdnlOutboundConnection::process_packet(td::BufferSlice data) {
+  TRY_RESULT(F, fetch_tl_object<lite_api::adnl_message_answer>(std::move(data), true));
+  td::actor::send_closure(ext_client_, &AdnlExtClientImpl::answer_query, F->query_id_, std::move(F->answer_));
+  return td::Status::OK();
+}
+
+}  // namespace adnl
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/adnl/adnl-ext-client.h b/submodules/ton/tonlib-src/adnl/adnl-ext-client.h
new file mode 100644
index 0000000000..babccced5e
--- /dev/null
+++ b/submodules/ton/tonlib-src/adnl/adnl-ext-client.h
@@ -0,0 +1,48 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "adnl-node-id.hpp"
+#include "td/utils/port/IPAddress.h"
+
+namespace ton {
+
+namespace adnl {
+
+class AdnlExtClient : public td::actor::Actor {
+ public:
+  class Callback {
+   public:
+    virtual ~Callback() = default;
+    virtual void on_ready() = 0;
+    virtual void on_stop_ready() = 0;
+  };
+  virtual ~AdnlExtClient() = default;
+  virtual void check_ready(td::Promise<td::Unit> promise) = 0;
+  virtual void send_query(std::string name, td::BufferSlice data, td::Timestamp timeout,
+                          td::Promise<td::BufferSlice> promise) = 0;
+  static td::actor::ActorOwn<AdnlExtClient> create(AdnlNodeIdFull dst, td::IPAddress dst_addr,
+                                                   std::unique_ptr<AdnlExtClient::Callback> callback);
+  static td::actor::ActorOwn<AdnlExtClient> create(AdnlNodeIdFull dst, PrivateKey local_id, td::IPAddress dst_addr,
+                                                   std::unique_ptr<AdnlExtClient::Callback> callback);
+};
+
+}  // namespace adnl
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/adnl/adnl-ext-client.hpp b/submodules/ton/tonlib-src/adnl/adnl-ext-client.hpp
new file mode 100644
index 0000000000..95348135ca
--- /dev/null
+++ b/submodules/ton/tonlib-src/adnl/adnl-ext-client.hpp
@@ -0,0 +1,145 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "auto/tl/lite_api.h"
+#include "adnl-ext-connection.hpp"
+#include "tl-utils/lite-utils.hpp"
+#include "td/utils/Random.h"
+#include "adnl-query.h"
+#include "keys/encryptor.h"
+#include "adnl-ext-client.h"
+
+namespace ton {
+
+namespace adnl {
+
+class AdnlExtClientImpl;
+
+class AdnlOutboundConnection : public AdnlExtConnection {
+ private:
+  AdnlNodeIdFull dst_;
+  PrivateKey local_id_;
+  td::actor::ActorId<AdnlExtClientImpl> ext_client_;
+  td::SecureString nonce_;
+  bool authorization_complete_ = false;
+
+ public:
+  AdnlOutboundConnection(td::SocketFd fd, std::unique_ptr<AdnlExtConnection::Callback> callback, AdnlNodeIdFull dst,
+                         td::actor::ActorId<AdnlExtClientImpl> ext_client)
+      : AdnlExtConnection(std::move(fd), std::move(callback), true), dst_(std::move(dst)), ext_client_(ext_client) {
+  }
+  AdnlOutboundConnection(td::SocketFd fd, std::unique_ptr<AdnlExtConnection::Callback> callback, AdnlNodeIdFull dst,
+                         PrivateKey local_id, td::actor::ActorId<AdnlExtClientImpl> ext_client)
+      : AdnlExtConnection(std::move(fd), std::move(callback), true)
+      , dst_(std::move(dst))
+      , local_id_(local_id)
+      , ext_client_(ext_client) {
+  }
+  td::Status process_packet(td::BufferSlice data) override;
+  td::Status process_init_packet(td::BufferSlice data) override {
+    UNREACHABLE();
+  }
+  td::Status process_custom_packet(td::BufferSlice &data, bool &processed) override;
+  void start_up() override;
+  bool authorized() const override {
+    return local_id_.empty() ? true : authorization_complete_;
+  }
+};
+
+class AdnlExtClientImpl : public AdnlExtClient {
+ public:
+  AdnlExtClientImpl(AdnlNodeIdFull dst_id, td::IPAddress dst_addr, std::unique_ptr<Callback> callback)
+      : dst_(std::move(dst_id)), dst_addr_(dst_addr), callback_(std::move(callback)) {
+  }
+  AdnlExtClientImpl(AdnlNodeIdFull dst_id, PrivateKey local_id, td::IPAddress dst_addr,
+                    std::unique_ptr<Callback> callback)
+      : dst_(std::move(dst_id)), local_id_(local_id), dst_addr_(dst_addr), callback_(std::move(callback)) {
+  }
+
+  void start_up() override {
+    alarm();
+  }
+  void conn_stopped(td::actor::ActorId<AdnlExtConnection> conn) {
+    if (!conn_.empty() && conn_.get() == conn) {
+      callback_->on_stop_ready();
+      conn_ = {};
+      alarm_timestamp() = next_create_at_;
+      try_stop();
+    }
+  }
+  void conn_ready(td::actor::ActorId<AdnlExtConnection> conn) {
+    if (!conn_.empty() && conn_.get() == conn) {
+      callback_->on_ready();
+    }
+  }
+  void check_ready(td::Promise<td::Unit> promise) override;
+  void send_query(std::string name, td::BufferSlice data, td::Timestamp timeout,
+                  td::Promise<td::BufferSlice> promise) override {
+    auto P = [SelfId = actor_id(this)](AdnlQueryId id) {
+      td::actor::send_closure(SelfId, &AdnlExtClientImpl::destroy_query, id);
+    };
+    auto q_id = generate_next_query_id();
+    out_queries_.emplace(q_id, AdnlQuery::create(std::move(promise), std::move(P), name, timeout, q_id));
+    if (!conn_.empty()) {
+      auto obj = create_tl_object<lite_api::adnl_message_query>(q_id, std::move(data));
+      td::actor::send_closure(conn_, &AdnlOutboundConnection::send, serialize_tl_object(obj, true));
+    }
+  }
+  void destroy_query(AdnlQueryId id) {
+    out_queries_.erase(id);
+    try_stop();
+  }
+  void answer_query(AdnlQueryId id, td::BufferSlice data) {
+    auto it = out_queries_.find(id);
+    if (it != out_queries_.end()) {
+      td::actor::send_closure(it->second, &AdnlQuery::result, std::move(data));
+    }
+  }
+  void alarm() override;
+  void hangup() override;
+  AdnlQueryId generate_next_query_id() {
+    while (true) {
+      AdnlQueryId q_id = AdnlQuery::random_query_id();
+      if (out_queries_.count(q_id) == 0) {
+        return q_id;
+      }
+    }
+  }
+
+ private:
+  AdnlNodeIdFull dst_;
+  PrivateKey local_id_;
+  td::IPAddress dst_addr_;
+
+  std::unique_ptr<Callback> callback_;
+
+  td::actor::ActorOwn<AdnlOutboundConnection> conn_;
+  td::Timestamp next_create_at_ = td::Timestamp::now_cached();
+
+  std::map<AdnlQueryId, td::actor::ActorId<AdnlQuery>> out_queries_;
+
+  bool is_closing_{false};
+  td::uint32 ref_cnt_{1};
+  void try_stop();
+};
+
+}  // namespace adnl
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/adnl/adnl-ext-connection.cpp b/submodules/ton/tonlib-src/adnl/adnl-ext-connection.cpp
new file mode 100644
index 0000000000..ffae186b11
--- /dev/null
+++ b/submodules/ton/tonlib-src/adnl/adnl-ext-connection.cpp
@@ -0,0 +1,192 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "adnl-ext-connection.hpp"
+
+namespace ton {
+
+namespace adnl {
+
+void AdnlExtConnection::send_uninit(td::BufferSlice data) {
+  buffered_fd_.output_buffer().append(std::move(data));
+  loop();
+}
+
+void AdnlExtConnection::send(td::BufferSlice data) {
+  LOG(DEBUG) << "sending packet of size " << data.size();
+  auto data_size = td::narrow_cast<td::uint32>(data.size()) + 32 + 32;
+  if (data_size < 32 || data_size > (1 << 24)) {
+    LOG(WARNING) << "bad packet size " << data_size;
+    return;
+  }
+
+  td::BufferSlice d{data.size() + 4 + 32 + 32};
+  auto S = d.as_slice();
+
+  S.copy_from(td::Slice(reinterpret_cast<const td::uint8 *>(&data_size), 4));
+  S.remove_prefix(4);
+  auto Sc = S;
+  td::Random::secure_bytes(S.copy().truncate(32));
+  S.remove_prefix(32);
+  S.copy_from(data.as_slice());
+  S.remove_prefix(data.size());
+
+  td::sha256(Sc.truncate(32 + data.size()), S);
+
+  td::BufferSlice e{d.size()};
+
+  out_ctr_.encrypt(d.as_slice(), e.as_slice());
+
+  buffered_fd_.output_buffer().append(std::move(e));
+  loop();
+}
+
+td::Status AdnlExtConnection::receive(td::ChainBufferReader &input, bool &exit_loop) {
+  if (stop_read_) {
+    exit_loop = true;
+    return td::Status::OK();
+  }
+  if (input.size() > 0) {
+    received_bytes_ = 1;
+  }
+  if (inited_) {
+    if (!read_len_) {
+      if (input.size() < 4) {
+        exit_loop = true;
+        return td::Status::OK();
+      }
+
+      char x[4];
+      td::MutableSlice s{x, 4};
+      input.advance(4, s);
+
+      td::MutableSlice e{reinterpret_cast<td::uint8 *>(&len_), 4};
+      in_ctr_.encrypt(s, e);
+      LOG(DEBUG) << "len=" << len_;
+      if (len_ > (1 << 24) || len_ < 32) {
+        return td::Status::Error("Too big packet");
+      }
+      read_len_ = true;
+    }
+    if (input.size() < len_) {
+      exit_loop = true;
+      return td::Status::OK();
+    }
+    auto data = input.cut_head(len_).move_as_buffer_slice();
+    update_timer();
+
+    td::BufferSlice dec_data{data.size()};
+    in_ctr_.encrypt(data.as_slice(), dec_data.as_slice());
+
+    exit_loop = false;
+    read_len_ = false;
+    len_ = 0;
+    return receive_packet(std::move(dec_data));
+  } else {
+    if (input.size() < 256) {
+      exit_loop = true;
+      return td::Status::OK();
+    }
+
+    auto data = input.cut_head(256).move_as_buffer_slice();
+    update_timer();
+
+    exit_loop = false;
+    return process_init_packet(std::move(data));
+  }
+}
+
+void AdnlExtConnection::loop() {
+  auto status = [&] {
+    TRY_STATUS(buffered_fd_.flush_read());
+    auto &input = buffered_fd_.input_buffer();
+    bool exit_loop = false;
+    while (!exit_loop) {
+      TRY_STATUS(receive(input, exit_loop));
+    }
+    TRY_STATUS(buffered_fd_.flush_write());
+    if (td::can_close(buffered_fd_)) {
+      stop();
+    }
+    return td::Status::OK();
+  }();
+  if (status.is_error()) {
+    LOG(ERROR) << "Client got error " << status;
+    stop();
+  } else {
+    send_ready();
+  }
+}
+
+td::Status AdnlExtConnection::init_crypto(td::Slice S) {
+  if (S.size() < 96) {
+    return td::Status::Error(ErrorCode::protoviolation, "too small enc data");
+  }
+  CHECK(S.size() >= 96);
+  td::SecureString s1(32), s2(32);
+  td::SecureString v1(16), v2(16);
+  s1.as_mutable_slice().copy_from(S.copy().truncate(32));
+  S.remove_prefix(32);
+  s2.as_mutable_slice().copy_from(S.copy().truncate(32));
+  S.remove_prefix(32);
+  v1.as_mutable_slice().copy_from(S.copy().truncate(16));
+  S.remove_prefix(16);
+  v2.as_mutable_slice().copy_from(S.copy().truncate(16));
+  S.remove_prefix(16);
+  if (is_client_) {
+    in_ctr_.init(s1, v1);
+    out_ctr_.init(s2, v2);
+  } else {
+    in_ctr_.init(s2, v2);
+    out_ctr_.init(s1, v1);
+  }
+  inited_ = true;
+  return td::Status::OK();
+}
+
+td::Status AdnlExtConnection::receive_packet(td::BufferSlice data) {
+  LOG(DEBUG) << "received packet of size " << data.size();
+  auto S = data.as_slice();
+  S.truncate(data.size() - 32);
+  auto D = data.as_slice();
+  D.remove_prefix(data.size() - 32);
+
+  if (td::sha256(S) != D) {
+    return td::Status::Error(ErrorCode::protoviolation, "sha256 mismatch");
+  }
+
+  data.truncate(data.size() - 32);
+  data.confirm_read(32);
+
+  if (data.size() == 0) {
+    // keepalive
+    return td::Status::OK();
+  }
+
+  bool processed = false;
+  TRY_STATUS(process_custom_packet(data, processed));
+  if (processed) {
+    return td::Status::OK();
+  }
+
+  return process_packet(std::move(data));
+}
+
+}  // namespace adnl
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/adnl/adnl-ext-connection.hpp b/submodules/ton/tonlib-src/adnl/adnl-ext-connection.hpp
new file mode 100644
index 0000000000..0b7f101201
--- /dev/null
+++ b/submodules/ton/tonlib-src/adnl/adnl-ext-connection.hpp
@@ -0,0 +1,163 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/net/TcpListener.h"
+#include "td/utils/crypto.h"
+#include "td/utils/BufferedFd.h"
+#include "tl-utils/tl-utils.hpp"
+#include "td/utils/Random.h"
+#include "common/errorcode.h"
+
+#include <map>
+#include <set>
+
+namespace ton {
+
+namespace adnl {
+
+class AdnlExtConnection : public td::actor::Actor, public td::ObserverBase {
+ public:
+  class Callback {
+   public:
+    virtual ~Callback() = default;
+    virtual void on_close(td::actor::ActorId<AdnlExtConnection> conn) = 0;
+    virtual void on_ready(td::actor::ActorId<AdnlExtConnection> conn) = 0;
+  };
+
+  double timeout() {
+    return is_client_ ? 20.0 : 60.0;
+  }
+
+  AdnlExtConnection(td::SocketFd fd, std::unique_ptr<Callback> callback, bool is_client)
+      : buffered_fd_(std::move(fd)), callback_(std::move(callback)), is_client_(is_client) {
+  }
+  void send(td::BufferSlice data);
+  void send_uninit(td::BufferSlice data);
+  td::Status receive(td::ChainBufferReader &input, bool &exit_loop);
+  virtual td::Status process_packet(td::BufferSlice data) = 0;
+  td::Status receive_packet(td::BufferSlice data);
+  virtual td::Status process_custom_packet(td::BufferSlice &data, bool &processed) = 0;
+  virtual td::Status process_init_packet(td::BufferSlice data) = 0;
+  virtual bool authorized() const {
+    return false;
+  }
+  td::Status init_crypto(td::Slice data);
+  void stop_read() {
+    stop_read_ = true;
+  }
+  void resume_read() {
+    stop_read_ = false;
+  }
+  bool check_ready() const {
+    return received_bytes_ && inited_ && authorized() && !td::can_close(buffered_fd_);
+  }
+  void check_ready_async(td::Promise<td::Unit> promise) {
+    if (check_ready()) {
+      promise.set_value(td::Unit());
+    } else {
+      promise.set_error(td::Status::Error(ErrorCode::notready, "not ready"));
+    }
+  }
+  void send_ready() {
+    if (check_ready() && !sent_ready_ && callback_) {
+      callback_->on_ready(actor_id(this));
+      sent_ready_ = true;
+    }
+  }
+
+ protected:
+  td::BufferedFd<td::SocketFd> buffered_fd_;
+  td::actor::ActorId<AdnlExtConnection> self_;
+  std::unique_ptr<Callback> callback_;
+  bool sent_ready_ = false;
+  bool is_client_;
+
+  void notify() override {
+    // NB: Interface will be changed
+    td::actor::send_closure_later(self_, &AdnlExtConnection::on_net);
+  }
+
+  void start_up() override {
+    self_ = actor_id(this);
+    // Subscribe for socket updates
+    // NB: Interface will be changed
+    td::actor::SchedulerContext::get()->get_poll().subscribe(buffered_fd_.get_poll_info().extract_pollable_fd(this),
+                                                             td::PollFlags::ReadWrite());
+    update_timer();
+    notify();
+  }
+
+ private:
+  td::AesCtrState in_ctr_;
+  td::AesCtrState out_ctr_;
+  bool inited_ = false;
+  bool stop_read_ = false;
+  bool read_len_ = false;
+  td::uint32 len_;
+  td::uint32 received_bytes_ = 0;
+  td::Timestamp fail_at_;
+  td::Timestamp send_ping_at_;
+  bool ping_sent_ = false;
+
+  void on_net() {
+    loop();
+  }
+
+  void tear_down() override {
+    if (callback_) {
+      callback_->on_close(actor_id(this));
+      callback_ = nullptr;
+    }
+    // unsubscribe from socket updates
+    // nb: interface will be changed
+    td::actor::SchedulerContext::get()->get_poll().unsubscribe(buffered_fd_.get_poll_info().get_pollable_fd_ref());
+  }
+
+  void update_timer() {
+    fail_at_ = td::Timestamp::in(timeout());
+    alarm_timestamp() = fail_at_;
+    if (is_client_) {
+      ping_sent_ = false;
+      send_ping_at_ = td::Timestamp::in(timeout() / 2);
+      alarm_timestamp().relax(send_ping_at_);
+    }
+  }
+
+  void loop() override;
+
+  void alarm() override {
+    alarm_timestamp() = fail_at_;
+    if (fail_at_.is_in_past()) {
+      stop();
+    } else if (is_client_ && !ping_sent_) {
+      if (send_ping_at_.is_in_past()) {
+        auto obj = create_tl_object<ton_api::tcp_ping>(td::Random::fast_uint64());
+        send(serialize_tl_object(obj, true));
+        ping_sent_ = true;
+      } else {
+        alarm_timestamp().relax(send_ping_at_);
+      }
+    }
+  }
+};
+
+}  // namespace adnl
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/adnl/adnl-node-id.hpp b/submodules/ton/tonlib-src/adnl/adnl-node-id.hpp
new file mode 100644
index 0000000000..84f425f8a2
--- /dev/null
+++ b/submodules/ton/tonlib-src/adnl/adnl-node-id.hpp
@@ -0,0 +1,130 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "keys/keys.hpp"
+#include "common/io.hpp"
+
+namespace ton {
+
+namespace adnl {
+
+class AdnlNodeIdShort {
+ public:
+  explicit AdnlNodeIdShort(const PublicKeyHash &hash) : hash_(hash) {
+  }
+  explicit AdnlNodeIdShort(PublicKeyHash &&hash) : hash_(std::move(hash)) {
+  }
+  AdnlNodeIdShort() {
+  }
+  explicit AdnlNodeIdShort(td::Slice data) : hash_(data) {
+  }
+  explicit AdnlNodeIdShort(td::Bits256 value) : hash_(value) {
+  }
+  explicit AdnlNodeIdShort(tl_object_ptr<ton_api::adnl_id_short> obj) : hash_(obj->id_) {
+  }
+
+  const auto &pubkey_hash() const {
+    return hash_;
+  }
+
+  bool operator==(const AdnlNodeIdShort &with) const {
+    return hash_ == with.hash_;
+  }
+  bool operator!=(const AdnlNodeIdShort &with) const {
+    return hash_ != with.hash_;
+  }
+  bool operator<(const AdnlNodeIdShort &with) const {
+    return hash_ < with.hash_;
+  }
+  tl_object_ptr<ton_api::adnl_id_short> tl() const {
+    return create_tl_object<ton_api::adnl_id_short>(hash_.tl());
+  }
+  auto as_slice() {
+    return hash_.as_slice();
+  }
+  auto as_slice() const {
+    return hash_.as_slice();
+  }
+  auto uint256_value() const {
+    return hash_.uint256_value();
+  }
+  auto bits256_value() const {
+    return hash_.bits256_value();
+  }
+  static AdnlNodeIdShort zero() {
+    return AdnlNodeIdShort{PublicKeyHash::zero()};
+  }
+  bool is_zero() const {
+    return hash_.is_zero();
+  }
+
+ private:
+  PublicKeyHash hash_;
+};
+
+class AdnlNodeIdFull {
+ private:
+  explicit AdnlNodeIdFull(const tl_object_ptr<ton_api::PublicKey> &pub) : pub_(pub) {
+  }
+
+ public:
+  explicit AdnlNodeIdFull(const PublicKey &pub) : pub_(pub) {
+  }
+  explicit AdnlNodeIdFull(PublicKey &&pub) : pub_(std::move(pub)) {
+  }
+  static td::Result<AdnlNodeIdFull> create(const tl_object_ptr<ton_api::PublicKey> &pub) {
+    return AdnlNodeIdFull{pub};
+  }
+  AdnlNodeIdFull() {
+  }
+  const auto &pubkey() const {
+    return pub_;
+  }
+  bool empty() const {
+    return pub_.empty();
+  }
+  bool operator==(const AdnlNodeIdFull &with) const {
+    return pub_ == with.pub_;
+  }
+  bool operator!=(const AdnlNodeIdFull &with) const {
+    return pub_ != with.pub_;
+  }
+  auto tl() const {
+    return pub_.tl();
+  }
+  AdnlNodeIdShort compute_short_id() const {
+    return AdnlNodeIdShort{pub_.compute_short_id()};
+  }
+
+ private:
+  PublicKey pub_;
+};
+
+}  // namespace adnl
+
+}  // namespace ton
+
+namespace td {
+
+inline StringBuilder &operator<<(StringBuilder &stream, const ton::adnl::AdnlNodeIdShort &value) {
+  return stream << value.bits256_value();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/adnl/adnl-query.cpp b/submodules/ton/tonlib-src/adnl/adnl-query.cpp
new file mode 100644
index 0000000000..d2f0f52d48
--- /dev/null
+++ b/submodules/ton/tonlib-src/adnl/adnl-query.cpp
@@ -0,0 +1,44 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "adnl-query.h"
+#include "common/errorcode.h"
+#include "td/utils/Random.h"
+
+namespace ton {
+
+namespace adnl {
+
+void AdnlQuery::alarm() {
+  promise_.set_error(td::Status::Error(ErrorCode::timeout, "adnl query timeout"));
+  stop();
+}
+void AdnlQuery::result(td::BufferSlice data) {
+  promise_.set_value(std::move(data));
+  stop();
+}
+
+AdnlQueryId AdnlQuery::random_query_id() {
+  AdnlQueryId q_id;
+  td::Random::secure_bytes(q_id.as_slice());
+  return q_id;
+}
+
+}  // namespace adnl
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/adnl/adnl-query.h b/submodules/ton/tonlib-src/adnl/adnl-query.h
new file mode 100644
index 0000000000..e900c69987
--- /dev/null
+++ b/submodules/ton/tonlib-src/adnl/adnl-query.h
@@ -0,0 +1,67 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/actor.h"
+#include "common/bitstring.h"
+#include "td/utils/buffer.h"
+
+#include <functional>
+
+namespace ton {
+
+namespace adnl {
+
+class AdnlPeerPair;
+
+using AdnlQueryId = td::Bits256;
+
+class AdnlQuery : public td::actor::Actor {
+ public:
+  static td::actor::ActorId<AdnlQuery> create(td::Promise<td::BufferSlice> promise,
+                                              std::function<void(AdnlQueryId)> destroy, std::string name,
+                                              td::Timestamp timeout, AdnlQueryId id) {
+    return td::actor::create_actor<AdnlQuery>("query", name, std::move(promise), std::move(destroy), timeout, id)
+        .release();
+  }
+  static AdnlQueryId random_query_id();
+  AdnlQuery(std::string name, td::Promise<td::BufferSlice> promise, std::function<void(AdnlQueryId)> destroy,
+            td::Timestamp timeout, AdnlQueryId id)
+      : name_(std::move(name)), timeout_(timeout), promise_(std::move(promise)), destroy_(std::move(destroy)), id_(id) {
+  }
+  void alarm() override;
+  void result(td::BufferSlice data);
+  void start_up() override {
+    alarm_timestamp() = timeout_;
+  }
+  void tear_down() override {
+    destroy_(id_);
+  }
+
+ private:
+  std::string name_;
+  td::Timestamp timeout_;
+  td::Promise<td::BufferSlice> promise_;
+  std::function<void(AdnlQueryId)> destroy_;
+  AdnlQueryId id_;
+};
+
+}  // namespace adnl
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/common/CMakeLists.txt b/submodules/ton/tonlib-src/common/CMakeLists.txt
new file mode 100644
index 0000000000..8fd70f7b00
--- /dev/null
+++ b/submodules/ton/tonlib-src/common/CMakeLists.txt
@@ -0,0 +1,21 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+set(COMMON_SOURCE
+  checksum.h
+  errorcode.h 
+  status.h
+  io.hpp
+
+  errorlog.h
+  errorlog.cpp
+)
+
+
+add_library(common STATIC ${COMMON_SOURCE})
+
+target_include_directories(common PUBLIC 
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}> 
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>/.. 
+  ${OPENSSL_INCLUDE_DIR}
+)
+target_link_libraries(common PRIVATE tdutils ton_crypto )
diff --git a/submodules/ton/tonlib-src/common/checksum.h b/submodules/ton/tonlib-src/common/checksum.h
new file mode 100644
index 0000000000..440d935969
--- /dev/null
+++ b/submodules/ton/tonlib-src/common/checksum.h
@@ -0,0 +1,33 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/int_types.h"
+#include "crypto/common/bitstring.h"
+#include "td/utils/crypto.h"
+
+namespace td {
+
+inline Bits256 sha256_bits256(Slice data) {
+  Bits256 id;
+  sha256(data, id.as_slice());
+  return id;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/common/delay.h b/submodules/ton/tonlib-src/common/delay.h
new file mode 100644
index 0000000000..111a9f3585
--- /dev/null
+++ b/submodules/ton/tonlib-src/common/delay.h
@@ -0,0 +1,52 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/actor.h"
+
+namespace ton {
+
+template <typename T>
+class DelayedAction : public td::actor::Actor {
+ public:
+  DelayedAction(T promise) : promise_(std::move(promise)) {
+  }
+  void set_timer(td::Timestamp t) {
+    alarm_timestamp() = t;
+  }
+  void alarm() override {
+    promise_();
+    stop();
+  }
+
+  static void create(T promise, td::Timestamp t) {
+    auto A = td::actor::create_actor<DelayedAction>("delayed", std::move(promise));
+    td::actor::send_closure(A, &DelayedAction::set_timer, t);
+    A.release();
+  }
+
+ private:
+  T promise_;
+};
+
+template <typename T>
+void delay_action(T promise, td::Timestamp timeout) {
+  DelayedAction<T>::create(std::move(promise), timeout);
+}
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/common/errorcode.h b/submodules/ton/tonlib-src/common/errorcode.h
new file mode 100644
index 0000000000..71eee62b65
--- /dev/null
+++ b/submodules/ton/tonlib-src/common/errorcode.h
@@ -0,0 +1,33 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace ton {
+
+enum ErrorCode : int {
+  failure = 601,
+  error = 602,
+  warning = 603,
+  protoviolation = 621,
+  notready = 651,
+  timeout = 652,
+  cancelled = 653
+};
+
+}
diff --git a/submodules/ton/tonlib-src/common/errorlog.cpp b/submodules/ton/tonlib-src/common/errorlog.cpp
new file mode 100644
index 0000000000..3dfcf9c87b
--- /dev/null
+++ b/submodules/ton/tonlib-src/common/errorlog.cpp
@@ -0,0 +1,74 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "errorlog.h"
+#include "checksum.h"
+
+#include "td/utils/port/FileFd.h"
+#include "td/utils/filesystem.h"
+#include "td/utils/port/path.h"
+#include "td/utils/Time.h"
+
+#include <mutex>
+
+namespace ton {
+
+namespace errorlog {
+
+td::FileFd fd;
+std::mutex init_mutex_;
+std::string files_path_;
+
+void ErrorLog::create(std::string db_root) {
+  init_mutex_.lock();
+  if (!fd.empty()) {
+    init_mutex_.unlock();
+    return;
+  }
+  auto path = db_root + "/error";
+  td::mkdir(path).ensure();
+  files_path_ = path + "/files";
+  td::mkdir(files_path_).ensure();
+  auto R = td::FileFd::open(path + "/log.txt",
+                            td::FileFd::Flags::Write | td::FileFd::Flags::Append | td::FileFd::Flags::Create);
+  R.ensure();
+  fd = R.move_as_ok();
+  init_mutex_.unlock();
+}
+
+void ErrorLog::log(std::string error) {
+  error = PSTRING() << "[" << td::Clocks::system() << "] " << error << "\n";
+  CHECK(!fd.empty());
+  auto s = td::Slice{error};
+  while (s.size() > 0) {
+    auto R = fd.write(s);
+    R.ensure();
+    s.remove_prefix(R.move_as_ok());
+  }
+}
+
+void ErrorLog::log_file(td::BufferSlice data) {
+  auto filename = sha256_bits256(data.as_slice());
+  auto path = files_path_ + "/" + filename.to_hex();
+
+  td::write_file(path, data.as_slice()).ensure();
+}
+
+}  // namespace errorlog
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/common/errorlog.h b/submodules/ton/tonlib-src/common/errorlog.h
new file mode 100644
index 0000000000..ed2330007a
--- /dev/null
+++ b/submodules/ton/tonlib-src/common/errorlog.h
@@ -0,0 +1,37 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <string>
+#include "td/utils/buffer.h"
+
+namespace ton {
+
+namespace errorlog {
+
+class ErrorLog {
+ public:
+  static void create(std::string db_root);
+  static void log(std::string error);
+  static void log_file(td::BufferSlice data);
+};
+
+}  // namespace errorlog
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/common/io.hpp b/submodules/ton/tonlib-src/common/io.hpp
new file mode 100644
index 0000000000..c222e95a4d
--- /dev/null
+++ b/submodules/ton/tonlib-src/common/io.hpp
@@ -0,0 +1,45 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/buffer.h"
+#include "td/utils/misc.h"
+#include "td/utils/crypto.h"
+#include "td/utils/format.h"
+#include "td/utils/base64.h"
+#include "tl-utils/tl-utils.hpp"
+
+#include "common/errorcode.h"
+#include "common/status.h"
+#include "keys/keys.hpp"
+
+#include "crypto/common/bitstring.h"
+
+namespace td {
+
+template <unsigned size>
+StringBuilder &operator<<(StringBuilder &stream, const td::BitArray<size> &x) {
+  return stream << td::base64_encode(as_slice(x));
+}
+
+inline StringBuilder &operator<<(StringBuilder &stream, const ton::PublicKeyHash &value) {
+  return stream << value.bits256_value();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/common/status.h b/submodules/ton/tonlib-src/common/status.h
new file mode 100644
index 0000000000..ddcdbfb9dd
--- /dev/null
+++ b/submodules/ton/tonlib-src/common/status.h
@@ -0,0 +1,33 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/Status.h"
+
+namespace td {
+
+inline td::Status status_prefix(td::Status &&status, std::string prefix) {
+  if (status.is_ok()) {
+    return std::move(status);
+  } else {
+    return td::Status::Error(status.code(), prefix + status.message().str());
+  }
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/CMakeLists.txt b/submodules/ton/tonlib-src/crypto/CMakeLists.txt
new file mode 100644
index 0000000000..bbb1e92dc6
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/CMakeLists.txt
@@ -0,0 +1,335 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+if (NOT OPENSSL_FOUND)
+  find_package(OpenSSL REQUIRED)
+endif()
+
+set(TON_CRYPTO_SOURCE
+  Ed25519.cpp
+  common/bigint.cpp
+  common/refcnt.cpp
+  common/refint.cpp
+  common/bigexp.cpp
+  common/bitstring.cpp
+  common/util.cpp
+  ellcurve/Ed25519.cpp
+  ellcurve/Fp25519.cpp
+  ellcurve/Montgomery.cpp
+  ellcurve/TwEdwards.cpp
+  openssl/bignum.cpp
+  openssl/residue.cpp
+  openssl/rand.cpp
+  vm/stack.cpp
+  vm/atom.cpp
+  vm/continuation.cpp
+  vm/dict.cpp
+  vm/dispatch.cpp
+  vm/opctable.cpp
+  vm/cp0.cpp
+  vm/stackops.cpp
+  vm/tupleops.cpp
+  vm/arithops.cpp
+  vm/cellops.cpp
+  vm/contops.cpp
+  vm/dictops.cpp
+  vm/debugops.cpp
+  vm/tonops.cpp
+  vm/boc.cpp
+  tl/tlblib.cpp
+
+  Ed25519.h
+  common/AtomicRef.h
+  common/bigint.hpp
+  common/bitstring.h
+  common/refcnt.hpp
+  common/refint.h
+  common/bigexp.h
+  common/util.h
+
+  ellcurve/Ed25519.h
+  ellcurve/Fp25519.h
+  ellcurve/Montgomery.h
+  ellcurve/TwEdwards.h
+
+  openssl/bignum.h
+  openssl/digest.h
+  openssl/rand.hpp
+  openssl/residue.h
+
+  tl/tlbc-aux.h
+  tl/tlbc-data.h
+  tl/tlblib.hpp
+
+  vm/arithops.h
+  vm/atom.h
+  vm/boc.h
+  vm/box.hpp
+  vm/cellops.h
+  vm/continuation.h
+  vm/contops.h
+  vm/cp0.h
+  vm/debugops.h
+  vm/dict.h
+  vm/dictops.h
+  vm/excno.hpp
+  vm/fmt.hpp
+  vm/log.h
+  vm/opctable.h
+  vm/stack.hpp
+  vm/stackops.h
+  vm/tupleops.h
+  vm/tonops.h
+  vm/vmstate.h
+
+  vm/cells.h
+  vm/cellslice.h
+
+  vm/cells/Cell.cpp
+  vm/cells/CellBuilder.cpp
+  vm/cells/CellHash.cpp
+  vm/cells/CellSlice.cpp
+  vm/cells/CellTraits.cpp
+  vm/cells/CellUsageTree.cpp
+  vm/cells/DataCell.cpp
+  vm/cells/LevelMask.cpp
+  vm/cells/MerkleProof.cpp
+  vm/cells/MerkleUpdate.cpp
+
+  vm/cells/Cell.h
+  vm/cells/CellBuilder.h
+  vm/cells/CellHash.h
+  vm/cells/CellSlice.h
+  vm/cells/CellTraits.h
+  vm/cells/CellUsageTree.h
+  vm/cells/CellWithStorage.h
+  vm/cells/DataCell.h
+  vm/cells/ExtCell.h
+  vm/cells/LevelMask.h
+  vm/cells/MerkleProof.h
+  vm/cells/MerkleUpdate.h
+  vm/cells/PrunnedCell.h
+  vm/cells/UsageCell.h
+  vm/cells/VirtualCell.h
+  vm/cells/VirtualizationParameters.h
+
+  vm/db/StaticBagOfCellsDb.h
+  vm/db/StaticBagOfCellsDb.cpp
+
+  vm/db/BlobView.h
+  vm/db/BlobView.cpp
+)
+
+set(TON_DB_SOURCE
+  vm/db/DynamicBagOfCellsDb.cpp
+  vm/db/CellStorage.cpp
+  vm/db/TonDb.cpp
+
+  vm/db/DynamicBagOfCellsDb.h
+  vm/db/CellHashTable.h
+  vm/db/CellStorage.h
+  vm/db/TonDb.h
+)
+
+set(FIFT_SOURCE
+  fift/Dictionary.cpp
+  fift/Fift.cpp
+  fift/IntCtx.cpp
+  fift/SourceLookup.cpp
+  fift/utils.cpp
+  fift/words.cpp
+
+  fift/Dictionary.h
+  fift/Fift.h
+  fift/IntCtx.h
+  fift/SourceLookup.h
+  fift/utils.h
+  fift/words.h
+)
+
+set(PARSER_SOURCE
+  parser/srcread.cpp
+  parser/lexer.cpp
+  parser/symtable.cpp
+
+  parser/srcread.h
+  parser/lexer.h
+  parser/symtable.h
+)
+
+set(FUNC_LIB_SOURCE
+  func/keywords.cpp
+  func/unify-types.cpp
+  func/parse-func.cpp
+  func/abscode.cpp
+  func/gen-abscode.cpp
+  func/analyzer.cpp
+  func/asmops.cpp
+  func/builtins.cpp
+  func/stack-transform.cpp
+  func/optimize.cpp
+  func/codegen.cpp
+)
+
+set(TLB_BLOCK_AUTO
+  ${CMAKE_CURRENT_SOURCE_DIR}/block/block-auto.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/block/block-auto.h
+)
+
+set(BLOCK_SOURCE
+  block/Binlog.h
+  block/Binlog.cpp
+  block/block.cpp
+  block/block-db.cpp
+  block/block-parse.cpp
+  block/check-proof.cpp
+  block/mc-config.cpp
+  block/output-queue-merger.cpp
+  block/transaction.cpp
+  ${TLB_BLOCK_AUTO}
+
+  block/block-binlog.h
+  block/block-db-impl.h
+  block/block-db.h
+  block/block.h
+  block/block-parse.h
+  block/check-proof.h
+  block/output-queue-merger.h
+  block/transaction.h
+)
+
+set(ED25519_TEST_SOURCE
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/Ed25519.cpp
+  PARENT_SCOPE
+)
+
+set(TONDB_TEST_SOURCE
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/test-db.cpp
+  PARENT_SCOPE
+)
+
+set(CELLS_TEST_SOURCE
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/test-cells.cpp
+  PARENT_SCOPE
+)
+
+set(TONVM_TEST_SOURCE
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/vm.cpp
+  PARENT_SCOPE
+)
+
+set(FIFT_TEST_SOURCE
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/fift.cpp
+  PARENT_SCOPE
+)
+
+add_library(ton_crypto STATIC ${TON_CRYPTO_SOURCE})
+target_include_directories(ton_crypto PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>
+	$<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/..>)
+target_link_libraries(ton_crypto PUBLIC ${OPENSSL_CRYPTO_LIBRARY} tdutils)
+if (NOT WIN32)
+  target_link_libraries(ton_crypto PUBLIC dl z)
+endif()
+target_include_directories(ton_crypto SYSTEM PUBLIC $<BUILD_INTERFACE:${OPENSSL_INCLUDE_DIR}>)
+
+add_library(ton_db STATIC ${TON_DB_SOURCE})
+target_include_directories(ton_db PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>
+	$<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/..>)
+target_link_libraries(ton_db PUBLIC tdutils tddb ton_crypto)
+
+add_executable(test-ed25519-crypto test/test-ed25519-crypto.cpp)
+target_include_directories(test-ed25519-crypto PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+target_link_libraries(test-ed25519-crypto PUBLIC ton_crypto)
+
+add_library(fift-lib ${FIFT_SOURCE})
+target_include_directories(fift-lib PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+target_link_libraries(fift-lib PUBLIC ton_crypto ton_db tdutils ton_block)
+set_target_properties(fift-lib PROPERTIES OUTPUT_NAME fift)
+
+add_executable(fift fift/fift-main.cpp)
+target_link_libraries(fift PUBLIC fift-lib)
+if (WINGETOPT_FOUND)
+  target_link_libraries_system(fift wingetopt)
+endif()
+
+add_library(src_parser ${PARSER_SOURCE})
+target_include_directories(src_parser PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+target_link_libraries(src_parser PUBLIC ton_crypto)
+
+add_executable(func func/func.cpp ${FUNC_LIB_SOURCE})
+target_include_directories(func PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+target_link_libraries(func PUBLIC ton_crypto src_parser)
+if (WINGETOPT_FOUND)
+  target_link_libraries_system(func wingetopt)
+endif()
+
+add_executable(tlbc tl/tlbc.cpp)
+target_include_directories(tlbc PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+target_link_libraries(tlbc PUBLIC ton_crypto src_parser)
+if (WINGETOPT_FOUND)
+  target_link_libraries_system(tlbc wingetopt)
+endif()
+
+add_library(ton_block ${BLOCK_SOURCE})
+target_include_directories(ton_block PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/block> $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/..>)
+target_link_libraries(ton_block PUBLIC ton_crypto tdutils tdactor tl_api)
+
+set(TURN_OFF_LSAN cd .)
+if (TON_USE_ASAN AND NOT WIN32)
+  set(TURN_OFF_LSAN export LSAN_OPTIONS=detect_leaks=0)
+endif()
+
+if (NOT CMAKE_CROSSCOMPILING)
+  set(GENERATE_TLB_CMD tlbc)
+  add_custom_command(
+    WORKING_DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR}/block
+    COMMAND ${TURN_OFF_LSAN}
+    COMMAND ${GENERATE_TLB_CMD} -o block-auto -n block::gen -z block.tlb
+    COMMENT "Generate block tlb source files"
+    OUTPUT ${TLB_BLOCK_AUTO}
+    DEPENDS tlbc block/block.tlb
+  )
+  add_custom_target(tlb_generate_block DEPENDS ${TLB_BLOCK_AUTO})
+  add_dependencies(ton_block tlb_generate_block)
+
+  add_custom_target(gen_fif ALL)
+  function(GenFif)
+    set(options )
+    set(oneValueArgs DEST)
+    set(multiValueArgs SOURCE)
+    set(FUNC_LIB_SOURCE smartcont/stdlib.fc)
+    cmake_parse_arguments(ARG "${options}" "${oneValueArgs}" "${multiValueArgs}" ${ARGN} )
+    string(REGEX REPLACE "[^a-zA-Z_]" "_" ID ${ARG_DEST})
+    add_custom_command(
+      COMMENT "Generate ${ARG_DEST}"
+      WORKING_DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR}
+      COMMAND func -PS -o ${ARG_DEST} ${FUNC_LIB_SOURCE} ${ARG_SOURCE}
+      MAIN_DEPENDENCY ${ARG_SOURCE}
+      DEPENDS func ${FUNC_LIB_SOURCE}
+      OUTPUT ${CMAKE_CURRENT_SOURCE_DIR}/${ARG_DEST}
+    )
+    add_custom_target(gen_fif_${ID} DEPENDS ${ARG_DEST})
+    add_dependencies(gen_fif gen_fif_${ID})
+  endfunction()
+
+  GenFif(DEST smartcont/config-code.fif SOURCE smartcont/config-code.fc)
+  GenFif(DEST smartcont/wallet-code.fif SOURCE smartcont/wallet-code.fc)
+  GenFif(DEST smartcont/simple-wallet-code.fif SOURCE smartcont/simple-wallet-code.fc)
+  GenFif(DEST smartcont/elector-code.fif SOURCE smartcont/elector-code.fc)
+endif()
+
+add_executable(create-state block/create-state.cpp)
+target_include_directories(create-state PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/..>)
+target_link_libraries(create-state PUBLIC ton_crypto fift-lib ton_block)
+if (WINGETOPT_FOUND)
+  target_link_libraries_system(create-state wingetopt)
+endif()
+
+add_executable(test-block block/test-block.cpp)
+target_include_directories(test-block PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/..>)
+target_link_libraries(test-block PUBLIC ton_crypto fift-lib ton_block)
+if (WINGETOPT_FOUND)
+  target_link_libraries_system(test-block wingetopt)
+endif()
diff --git a/submodules/ton/tonlib-src/crypto/Ed25519.cpp b/submodules/ton/tonlib-src/crypto/Ed25519.cpp
new file mode 100644
index 0000000000..6a21f83f66
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/Ed25519.cpp
@@ -0,0 +1,394 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "crypto/Ed25519.h"
+
+#if TD_HAVE_OPENSSL
+
+#include <openssl/opensslv.h>
+
+#if OPENSSL_VERSION_NUMBER >= 0x10101000L && OPENSSL_VERSION_NUMBER != 0x20000000L
+
+#include "td/utils/base64.h"
+#include "td/utils/BigNum.h"
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/ScopeGuard.h"
+
+#include <openssl/evp.h>
+#include <openssl/pem.h>
+#include <openssl/x509.h>
+
+#else
+
+#include "crypto/ellcurve/Ed25519.h"
+
+#endif
+
+namespace td {
+
+Ed25519::PublicKey::PublicKey(SecureString octet_string) : octet_string_(std::move(octet_string)) {
+}
+
+SecureString Ed25519::PublicKey::as_octet_string() const {
+  return octet_string_.copy();
+}
+
+Ed25519::PrivateKey::PrivateKey(SecureString octet_string) : octet_string_(std::move(octet_string)) {
+}
+
+SecureString Ed25519::PrivateKey::as_octet_string() const {
+  return octet_string_.copy();
+}
+
+#if OPENSSL_VERSION_NUMBER >= 0x10101000L && OPENSSL_VERSION_NUMBER != 0x20000000L
+
+namespace detail {
+
+static Result<SecureString> X25519_key_from_PKEY(EVP_PKEY *pkey, bool is_private) {
+  auto func = is_private ? &EVP_PKEY_get_raw_private_key : &EVP_PKEY_get_raw_public_key;
+  size_t len = 0;
+  if (func(pkey, nullptr, &len) == 0) {
+    return Status::Error("Failed to get raw key length");
+  }
+  CHECK(len == 32);
+
+  SecureString result(len);
+  if (func(pkey, result.as_mutable_slice().ubegin(), &len) == 0) {
+    return Status::Error("Failed to get raw key");
+  }
+  return std::move(result);
+}
+
+static EVP_PKEY *X25519_key_to_PKEY(Slice key, bool is_private) {
+  auto func = is_private ? &EVP_PKEY_new_raw_private_key : &EVP_PKEY_new_raw_public_key;
+  return func(EVP_PKEY_ED25519, nullptr, key.ubegin(), key.size());
+}
+
+static Result<SecureString> X25519_pem_from_PKEY(EVP_PKEY *pkey, bool is_private, Slice password) {
+  BIO *mem_bio = BIO_new(BIO_s_mem());
+  SCOPE_EXIT {
+    BIO_vfree(mem_bio);
+  };
+  if (is_private) {
+    PEM_write_bio_PrivateKey(mem_bio, pkey, EVP_aes_256_cbc(), const_cast<unsigned char *>(password.ubegin()),
+                             narrow_cast<int>(password.size()), nullptr, nullptr);
+  } else {
+    PEM_write_bio_PUBKEY(mem_bio, pkey);
+  }
+  char *data_ptr = nullptr;
+  auto data_size = BIO_get_mem_data(mem_bio, &data_ptr);
+  return std::string(data_ptr, data_size);
+}
+
+static int password_cb(char *buf, int size, int rwflag, void *u) {
+  auto &password = *reinterpret_cast<Slice *>(u);
+  auto password_size = narrow_cast<int>(password.size());
+  if (size < password_size) {
+    return -1;
+  }
+  if (rwflag == 0) {
+    MutableSlice(buf, size).copy_from(password);
+  }
+  return password_size;
+}
+
+static EVP_PKEY *X25519_pem_to_PKEY(Slice pem, Slice password) {
+  BIO *mem_bio = BIO_new_mem_buf(pem.ubegin(), narrow_cast<int>(pem.size()));
+  SCOPE_EXIT {
+    BIO_vfree(mem_bio);
+  };
+
+  return PEM_read_bio_PrivateKey(mem_bio, nullptr, password_cb, &password);
+}
+
+}  // namespace detail
+
+Result<Ed25519::PrivateKey> Ed25519::generate_private_key() {
+  EVP_PKEY_CTX *pctx = EVP_PKEY_CTX_new_id(NID_ED25519, nullptr);
+  if (pctx == nullptr) {
+    return Status::Error("Can't create EVP_PKEY_CTX");
+  }
+  SCOPE_EXIT {
+    EVP_PKEY_CTX_free(pctx);
+  };
+
+  if (EVP_PKEY_keygen_init(pctx) <= 0) {
+    return Status::Error("Can't init keygen");
+  }
+
+  EVP_PKEY *pkey = nullptr;
+  if (EVP_PKEY_keygen(pctx, &pkey) <= 0) {
+    return Status::Error("Can't generate random private key");
+  }
+  SCOPE_EXIT {
+    EVP_PKEY_free(pkey);
+  };
+
+  TRY_RESULT(private_key, detail::X25519_key_from_PKEY(pkey, true));
+  return std::move(private_key);
+}
+
+Result<Ed25519::PublicKey> Ed25519::PrivateKey::get_public_key() const {
+  auto pkey = detail::X25519_key_to_PKEY(octet_string_, true);
+  if (pkey == nullptr) {
+    return Status::Error("Can't import private key");
+  }
+  SCOPE_EXIT {
+    EVP_PKEY_free(pkey);
+  };
+
+  TRY_RESULT(key, detail::X25519_key_from_PKEY(pkey, false));
+  return Ed25519::PublicKey(std::move(key));
+}
+
+Result<SecureString> Ed25519::PrivateKey::as_pem(Slice password) const {
+  auto pkey = detail::X25519_key_to_PKEY(octet_string_, true);
+  if (pkey == nullptr) {
+    return Status::Error("Can't import private key");
+  }
+  SCOPE_EXIT {
+    EVP_PKEY_free(pkey);
+  };
+
+  return detail::X25519_pem_from_PKEY(pkey, true, password);
+}
+
+Result<Ed25519::PrivateKey> Ed25519::PrivateKey::from_pem(Slice pem, Slice password) {
+  auto pkey = detail::X25519_pem_to_PKEY(pem, password);
+  if (pkey == nullptr) {
+    return Status::Error("Can't import private key from pem");
+  }
+  TRY_RESULT(key, detail::X25519_key_from_PKEY(pkey, true));
+  return Ed25519::PrivateKey(std::move(key));
+}
+
+Result<SecureString> Ed25519::PrivateKey::sign(Slice data) const {
+  auto pkey = detail::X25519_key_to_PKEY(octet_string_, true);
+  if (pkey == nullptr) {
+    return Status::Error("Can't import private key");
+  }
+  SCOPE_EXIT {
+    EVP_PKEY_free(pkey);
+  };
+
+  EVP_MD_CTX *md_ctx = EVP_MD_CTX_new();
+  if (md_ctx == nullptr) {
+    return Status::Error("Can't create EVP_MD_CTX");
+  }
+  SCOPE_EXIT {
+    EVP_MD_CTX_free(md_ctx);
+  };
+
+  if (EVP_DigestSignInit(md_ctx, nullptr, nullptr, nullptr, pkey) <= 0) {
+    return Status::Error("Can't init DigestSign");
+  }
+
+  SecureString res(64, '\0');
+  size_t len = 64;
+  if (EVP_DigestSign(md_ctx, res.as_mutable_slice().ubegin(), &len, data.ubegin(), data.size()) <= 0) {
+    return Status::Error("Can't sign data");
+  }
+  return std::move(res);
+}
+
+Status Ed25519::PublicKey::verify_signature(Slice data, Slice signature) const {
+  auto pkey = detail::X25519_key_to_PKEY(octet_string_, false);
+  if (pkey == nullptr) {
+    return Status::Error("Can't import public key");
+  }
+  SCOPE_EXIT {
+    EVP_PKEY_free(pkey);
+  };
+
+  EVP_MD_CTX *md_ctx = EVP_MD_CTX_new();
+  if (md_ctx == nullptr) {
+    return Status::Error("Can't create EVP_MD_CTX");
+  }
+  SCOPE_EXIT {
+    EVP_MD_CTX_free(md_ctx);
+  };
+
+  if (EVP_DigestVerifyInit(md_ctx, nullptr, nullptr, nullptr, pkey) <= 0) {
+    return Status::Error("Can't init DigestVerify");
+  }
+
+  if (EVP_DigestVerify(md_ctx, signature.ubegin(), signature.size(), data.ubegin(), data.size())) {
+    return Status::OK();
+  }
+  return Status::Error("Wrong signature");
+}
+
+Result<SecureString> Ed25519::compute_shared_secret(const PublicKey &public_key, const PrivateKey &private_key) {
+  BigNum p = BigNum::from_hex("7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed").move_as_ok();
+  auto public_y = public_key.as_octet_string();
+  public_y.as_mutable_slice()[31] = static_cast<char>(public_y[31] & 127);
+  BigNum y = BigNum::from_le_binary(public_y);
+  BigNum y2 = y.clone();
+  y += 1;
+  y2 -= 1;
+
+  BigNumContext context;
+
+  BigNum::mod_sub(y2, p, y2, p, context);
+
+  BigNum inverse_y_plus_1;
+  BigNum::mod_inverse(inverse_y_plus_1, y2, p, context);
+
+  BigNum u;
+  BigNum::mod_mul(u, y, inverse_y_plus_1, p, context);
+
+  auto pr_key = private_key.as_octet_string();
+  unsigned char buf[64];
+  SHA512(Slice(pr_key).ubegin(), 32, buf);
+  buf[0] &= 248;
+  buf[31] &= 127;
+  buf[31] |= 64;
+
+  auto pkey_private = EVP_PKEY_new_raw_private_key(EVP_PKEY_X25519, nullptr, buf, 32);
+  if (pkey_private == nullptr) {
+    return Status::Error("Can't import private key");
+  }
+  SCOPE_EXIT {
+    EVP_PKEY_free(pkey_private);
+  };
+  // LOG(ERROR) << buffer_to_hex(Slice(buf, 32));
+
+  auto pub_key = u.to_le_binary(32);
+  auto pkey_public = EVP_PKEY_new_raw_public_key(EVP_PKEY_X25519, nullptr, Slice(pub_key).ubegin(), pub_key.size());
+  if (pkey_public == nullptr) {
+    return Status::Error("Can't import public key");
+  }
+  SCOPE_EXIT {
+    EVP_PKEY_free(pkey_public);
+  };
+  // LOG(ERROR) << buffer_to_hex(pub_key);
+
+  EVP_PKEY_CTX *ctx = EVP_PKEY_CTX_new(pkey_private, nullptr);
+  if (ctx == nullptr) {
+    return Status::Error("Can't create EVP_PKEY_CTX");
+  }
+  SCOPE_EXIT {
+    EVP_PKEY_CTX_free(ctx);
+  };
+
+  if (EVP_PKEY_derive_init(ctx) <= 0) {
+    return Status::Error("Can't init derive");
+  }
+  if (EVP_PKEY_derive_set_peer(ctx, pkey_public) <= 0) {
+    return Status::Error("Can't init derive");
+  }
+
+  size_t result_len = 0;
+  if (EVP_PKEY_derive(ctx, nullptr, &result_len) <= 0) {
+    return Status::Error("Can't get result length");
+  }
+  if (result_len != 32) {
+    return Status::Error("Unexpected result length");
+  }
+
+  SecureString result(result_len, '\0');
+  if (EVP_PKEY_derive(ctx, result.as_mutable_slice().ubegin(), &result_len) <= 0) {
+    return Status::Error("Failed to compute shared secret");
+  }
+  return std::move(result);
+}
+
+#else
+
+Result<Ed25519::PrivateKey> Ed25519::generate_private_key() {
+  crypto::Ed25519::PrivateKey private_key;
+  if (!private_key.random_private_key(true)) {
+    return Status::Error("Can't generate random private key");
+  }
+  SecureString private_key_buf(32);
+  if (!private_key.export_private_key(private_key_buf.as_mutable_slice())) {
+    return Status::Error("Failed to export private key");
+  }
+  return PrivateKey(std::move(private_key_buf));
+}
+
+Result<Ed25519::PublicKey> Ed25519::PrivateKey::get_public_key() const {
+  crypto::Ed25519::PrivateKey private_key;
+  if (!private_key.import_private_key(Slice(octet_string_).ubegin())) {
+    return Status::Error("Bad private key");
+  }
+  SecureString public_key(32);
+  if (!private_key.get_public_key().export_public_key(public_key.as_mutable_slice())) {
+    return Status::Error("Failed to export public key");
+  }
+  return PublicKey(std::move(public_key));
+}
+
+Result<SecureString> Ed25519::PrivateKey::as_pem(Slice password) const {
+  return Status::Error("Not supported");
+}
+
+Result<Ed25519::PrivateKey> Ed25519::PrivateKey::from_pem(Slice pem, Slice password) {
+  return Status::Error("Not supported");
+}
+
+Result<SecureString> Ed25519::PrivateKey::sign(Slice data) const {
+  crypto::Ed25519::PrivateKey private_key;
+  if (!private_key.import_private_key(Slice(octet_string_).ubegin())) {
+    return Status::Error("Bad private key");
+  }
+  SecureString signature(crypto::Ed25519::sign_bytes, '\0');
+  if (!private_key.sign_message(signature.as_mutable_slice(), data)) {
+    return Status::Error("Failed to sign message");
+  }
+  return std::move(signature);
+}
+
+Status Ed25519::PublicKey::verify_signature(Slice data, Slice signature) const {
+  if (signature.size() != crypto::Ed25519::sign_bytes) {
+    return Status::Error("Signature has invalid length");
+  }
+
+  crypto::Ed25519::PublicKey public_key;
+  if (!public_key.import_public_key(Slice(octet_string_).ubegin())) {
+    return Status::Error("Bad public key");
+  }
+  if (public_key.check_message_signature(signature, data)) {
+    return Status::OK();
+  }
+  return Status::Error("Wrong signature");
+}
+
+Result<SecureString> Ed25519::compute_shared_secret(const PublicKey &public_key, const PrivateKey &private_key) {
+  crypto::Ed25519::PrivateKey tmp_private_key;
+  if (!tmp_private_key.import_private_key(Slice(private_key.as_octet_string()).ubegin())) {
+    return Status::Error("Bad private key");
+  }
+  crypto::Ed25519::PublicKey tmp_public_key;
+  if (!tmp_public_key.import_public_key(Slice(public_key.as_octet_string()).ubegin())) {
+    return Status::Error("Bad public key");
+  }
+  SecureString shared_secret(32, '\0');
+  if (!tmp_private_key.compute_shared_secret(shared_secret.as_mutable_slice(), tmp_public_key)) {
+    return Status::Error("Failed to compute shared secret");
+  }
+  return std::move(shared_secret);
+}
+
+#endif
+
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/crypto/Ed25519.h b/submodules/ton/tonlib-src/crypto/Ed25519.h
new file mode 100644
index 0000000000..21dcf7dd37
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/Ed25519.h
@@ -0,0 +1,72 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/SharedSlice.h"
+#include "td/utils/Status.h"
+
+#if TD_HAVE_OPENSSL
+
+namespace td {
+
+class Ed25519 {
+ public:
+  class PublicKey {
+   public:
+    static constexpr size_t LENGTH = 32;
+
+    explicit PublicKey(SecureString octet_string);
+
+    SecureString as_octet_string() const;
+
+    Status verify_signature(Slice data, Slice signature) const;
+
+   private:
+    SecureString octet_string_;
+  };
+
+  class PrivateKey {
+   public:
+    static constexpr size_t LENGTH = 32;
+
+    explicit PrivateKey(SecureString octet_string);
+
+    SecureString as_octet_string() const;
+
+    Result<PublicKey> get_public_key() const;
+
+    Result<SecureString> sign(Slice data) const;
+
+    Result<SecureString> as_pem(Slice password) const;
+
+    static Result<PrivateKey> from_pem(Slice pem, Slice password);
+
+   private:
+    SecureString octet_string_;
+  };
+
+  static Result<PrivateKey> generate_private_key();
+
+  static Result<SecureString> compute_shared_secret(const PublicKey &public_key, const PrivateKey &private_key);
+};
+
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/crypto/block/Binlog.cpp b/submodules/ton/tonlib-src/crypto/block/Binlog.cpp
new file mode 100644
index 0000000000..ac1f14159c
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/Binlog.cpp
@@ -0,0 +1,493 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "crypto/block/Binlog.h"
+
+#include "td/utils/as.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/path.h"
+
+#include <sstream>
+
+namespace block {
+/*
+ * 
+ *    GENERIC BINLOG (move to separate file)
+ * 
+ */
+
+BinlogBuffer::BinlogBuffer(std::unique_ptr<BinlogCallback> cb, std::size_t _max_size, td::FileFd fd)
+    : cb(std::move(cb))
+    , need_more_bytes(0)
+    , eptr(nullptr)
+    , log_rpos(0)
+    , log_cpos(0)
+    , log_wpos(0)
+    , fd(std::move(fd))
+    , replica(false)
+    , writing(false)
+    , dirty(false)
+    , created(false)
+    , ok(false) {
+  max_size = _max_size;
+  start = static_cast<unsigned char*>(std::malloc(max_size));
+  DCHECK(start);
+  rptr = wptr = cptr = start;
+  end = start + max_size;
+}
+
+unsigned char* BinlogBuffer::alloc_log_event_force(std::size_t size) {
+  unsigned char* res = alloc_log_event(size);
+  if (!res) {
+    throw LevAllocError{size};
+  }
+  return res;
+}
+
+unsigned char* BinlogBuffer::try_alloc_log_event(std::size_t size) {
+  if (!eptr) {
+    if (end - wptr >= (long)size) {
+      unsigned char* res = wptr;
+      wptr += size;
+      log_wpos += size;
+      return res;
+    }
+    eptr = wptr;
+    wptr = start;
+    if (rptr == eptr) {
+      rptr = start;
+    }
+    if (cptr == eptr) {
+      cptr = start;
+    }
+  }
+  if (rptr - wptr > (long)size) {
+    unsigned char* res = wptr;
+    wptr += size;
+    log_wpos += size;
+    return res;
+  }
+  return nullptr;
+}
+
+bool BinlogBuffer::flush(int mode) {
+  auto r_res = try_flush(mode);
+  if (r_res.is_ok()) {
+    return r_res.ok();
+  }
+  std::string msg = PSTRING() << "cannot flush binlog file " << binlog_name << " at position " << log_rpos << " "
+                              << r_res.error();
+  LOG(ERROR) << msg;
+  throw BinlogError{msg};
+}
+
+td::Result<bool> BinlogBuffer::try_flush(int mode) {
+  LOG(DEBUG) << "in flush: writing=" << writing << " r=" << rptr - start << " c=" << cptr - start
+             << " w=" << wptr - start << "; rp=" << log_rpos << " cp=" << log_cpos << " wp=" << log_wpos;
+  if (!writing || rptr == cptr) {
+    return false;  // nothing to flush
+  }
+  DCHECK(!fd.empty());  // must have an open binlog file
+  while (rptr != cptr) {
+    unsigned char* tptr = (cptr >= rptr ? cptr : eptr);
+    DCHECK(rptr <= tptr);
+    auto sz = tptr - rptr;
+    if (sz) {
+      LOG(INFO) << "writing " << sz << " bytes to binlog " << binlog_name << " at position " << log_rpos;
+      TRY_RESULT(res, fd.pwrite(td::Slice(rptr, sz), log_rpos));
+      if (static_cast<td::int64>(res) != sz) {
+        return td::Status::Error(PSLICE() << "written " << res << " bytes instead of " << sz);
+      }
+      log_rpos += sz;
+      rptr += sz;
+    }
+    if (rptr == eptr) {
+      rptr = start;
+      eptr = nullptr;
+    }
+  }
+  if (mode >= 3) {
+    LOG(INFO) << "syncing binlog " << binlog_name << " (position " << log_rpos << ")";
+    TRY_STATUS(fd.sync());
+  }
+  return true;
+}
+
+unsigned char* BinlogBuffer::alloc_log_event(std::size_t size) {
+  if (!writing) {
+    throw BinlogError{"cannot create new binlog event: binlog not open for writing"};
+  }
+  if (size >= max_size || size > max_event_size) {
+    return nullptr;
+  }
+  size = (size + 3) & -4;
+  unsigned char* res = try_alloc_log_event(size);
+  if (!res) {
+    flush();
+    return try_alloc_log_event(size);
+  } else {
+    return res;
+  }
+}
+
+bool BinlogBuffer::commit_range(unsigned long long pos_start, unsigned long long pos_end) {
+  // TODO: make something more clever, with partially committed/uncommitted segments in [cpos..wpos] range
+  if (pos_start != log_cpos || pos_end < pos_start || pos_end > log_wpos) {
+    return false;
+  }
+  if (!pos_start && pos_end >= pos_start + 4 && td::as<unsigned>(cptr) != 0x0442446b) {
+    throw BinlogError{"incorrect magic"};
+  }
+  long long size = pos_end - pos_start;
+  replay_range(cptr, pos_start, pos_end);
+  log_cpos = pos_end;
+  cptr += size;
+  if (eptr && cptr >= eptr) {
+    cptr -= eptr - start;
+  }
+  return true;
+}
+
+bool BinlogBuffer::rollback_range(unsigned long long pos_start, unsigned long long pos_end) {
+  if (pos_start < log_cpos || pos_end < pos_start || pos_end != log_wpos) {
+    return false;
+  }
+  long long size = pos_end - pos_start;
+  log_wpos = pos_end;
+  if (size >= wptr - start) {
+    wptr -= size;
+  } else {
+    DCHECK(eptr);
+    wptr += eptr - start - size;
+  }
+  return true;
+}
+
+void BinlogBuffer::NewBinlogEvent::commit() {
+  //LOG(DEBUG) << "in NewBinlogEvent::commit (status = " << status << ")";
+  if (!(status & 4)) {
+    throw BinlogError{"cannot commit new binlog event: already committed or rolled back"};
+  }
+  if (!bb.commit_range(pos, pos + size)) {
+    throw BinlogError{"cannot commit new binlog event: possibly some earlier log events are not committed yet"};
+  }
+  status = 1;
+  //LOG(DEBUG) << "after NewBinlogEvent::commit (status = " << status << ")";
+}
+
+void BinlogBuffer::NewBinlogEvent::rollback() {
+  if (!(status & 4)) {
+    throw BinlogError{"cannot roll back new binlog event: already committed or rolled back"};
+  }
+  if (!bb.rollback_range(pos, pos + size)) {
+    throw BinlogError{"cannot roll back new binlog event: possibly some later log event are already committed"};
+  }
+  status = 2;
+}
+
+BinlogBuffer::NewBinlogEvent::~NewBinlogEvent() {
+  if (status & 4) {
+    if (status == 5) {
+      status = 4;
+      commit();
+    } else if (status == 6) {
+      status = 4;
+      rollback();
+    } else {
+      LOG(ERROR) << "newly-allocated binlog event is neither committed nor rolled back (automatically rolling back)";
+      rollback();
+    }
+  }
+}
+
+void BinlogBuffer::replay_range(unsigned char* ptr, unsigned long long pos_start, unsigned long long pos_end) {
+  unsigned char* tptr = (ptr <= wptr ? wptr : eptr);
+  long long avail = tptr - ptr;
+  while (pos_start < pos_end) {
+    if (ptr == eptr) {
+      ptr = start;
+      tptr = wptr;
+      avail = tptr - ptr;
+      if (avail > (long long)(pos_end - pos_start)) {
+        avail = pos_end - pos_start;
+      }
+    }
+    int res = (avail >= 4 ? cb->replay_log_event(*this, reinterpret_cast<const unsigned*>(ptr),
+                                                 td::narrow_cast<size_t>(avail), pos_start)
+                          : -0x7ffffffc);
+    if (res <= 0 || res > avail) {
+      std::ostringstream ss;
+      ss << "cannot interpret newly-committed binlog event 0x" << std::hex
+         << (avail >= 4 ? (unsigned)td::as<unsigned>(ptr) : 0u) << std::dec << ": error " << res;
+      throw BinlogError{ss.str()};
+    }
+    ptr += res;
+    pos_start += res;
+    avail -= res;
+  }
+}
+
+int BinlogBuffer::replay_pending(bool allow_partial) {
+  if (rptr == cptr) {
+    return 0;
+  }
+  unsigned char* tptr = (rptr <= cptr ? cptr : eptr);
+  long long avail = tptr - rptr;
+  DCHECK(tptr && avail >= 0);
+  while (rptr != cptr) {
+    int res = (avail >= 4 ? cb->replay_log_event(*this, reinterpret_cast<const unsigned*>(rptr),
+                                                 td::narrow_cast<size_t>(avail), log_rpos)
+                          : -0x7ffffffc);
+    if (res > 0) {
+      if (res > avail) {
+        throw BinlogError{"binlog event used more bytes than available"};
+      }
+      avail -= res;
+      log_rpos += res;
+      rptr += res;
+      if (rptr != eptr) {
+        continue;
+      }
+      rptr = start;
+      tptr = cptr;
+      avail = tptr - rptr;
+      continue;
+    }
+    long long prev_need = 0;
+    while (res < -0x40000000) {
+      long long need = res - 0x80000000;
+      need = (need + 3) & -4;
+      if (need > (long long)max_event_size) {
+        throw BinlogError{"binlog event requires too many bytes"};
+      }
+      if (need <= avail) {
+        throw BinlogError{"binlog event requires more bytes, but we already had them"};
+      }
+      if (need <= prev_need) {
+        throw BinlogError{"binlog event requires more bytes, but we already had them"};
+      }
+      prev_need = need;
+      long long total_avail = avail + (rptr > cptr ? cptr - start : 0);
+      if (need > total_avail) {
+        if (allow_partial) {
+          need_more_bytes = td::narrow_cast<size_t>(need - total_avail);
+          return 2;
+        } else {
+          throw BinlogError{"binlog event extends past end of buffer"};
+        }
+      }
+      if (need <= 1024) {
+        unsigned char tmp[1024];
+        std::memcpy(tmp, rptr, td::narrow_cast<size_t>(avail));
+        std::memcpy(tmp + avail, start, td::narrow_cast<size_t>(need - avail));
+        res = cb->replay_log_event(*this, reinterpret_cast<const unsigned*>(tmp), td::narrow_cast<size_t>(need),
+                                   log_rpos);
+      } else {
+        unsigned char* tmp = static_cast<unsigned char*>(std::malloc(td::narrow_cast<size_t>(need)));
+        std::memcpy(tmp, rptr, td::narrow_cast<size_t>(avail));
+        std::memcpy(tmp + avail, start, td::narrow_cast<size_t>(need - avail));
+        res = cb->replay_log_event(*this, reinterpret_cast<const unsigned*>(tmp), td::narrow_cast<size_t>(need),
+                                   log_rpos);
+        std::free(tmp);
+      }
+      if (res > need) {
+        throw BinlogError{"binlog event used more bytes than available"};
+      }
+    }
+    if (res < 0) {
+      return res;
+    }
+    if (!res) {
+      throw BinlogError{"unknown error while interpreting binlog event"};
+    }
+    if (res < avail) {
+      avail -= res;
+      log_rpos += res;
+      rptr += res;
+      continue;
+    }
+    DCHECK(eptr);
+    log_rpos += res;
+    rptr += res;
+    rptr = start + (rptr - eptr);
+    eptr = nullptr;
+    DCHECK(start <= rptr && rptr <= cptr && cptr <= wptr && wptr <= end);
+  }
+  return 1;
+}
+
+BinlogBuffer::~BinlogBuffer() {
+  if (start) {
+    if (writing) {
+      flush(2);
+    }
+    std::free(start);
+  }
+}
+
+td::Status BinlogBuffer::set_binlog(std::string new_binlog_name, int mode) {
+  if (!binlog_name.empty() || !fd.empty()) {
+    return td::Status::Error("binlog buffer already attached to a file");
+  }
+  td::int32 flags = td::FileFd::Read;
+  if ((mode & 1) != 0) {
+    flags |= td::FileFd::Write;
+  }
+  auto r_fd = td::FileFd::open(new_binlog_name, flags, 0640);
+  if (r_fd.is_error()) {
+    if (!(~mode & 3)) {
+      TRY_RESULT(new_fd, td::FileFd::open(new_binlog_name, flags | td::FileFd::CreateNew, 0640));
+      fd = std::move(new_fd);
+      created = true;
+    } else {
+      return r_fd.move_as_error();
+    }
+  } else {
+    fd = r_fd.move_as_ok();
+  }
+  replica = !(mode & 1);
+  if (!replica) {
+    TRY_STATUS(fd.lock(td::FileFd::LockFlags::Write, new_binlog_name, 100));
+  }
+  if (created) {
+    writing = true;
+    td::Status res;
+    try {
+      res = cb->init_new_binlog(*this);
+    } catch (BinlogBuffer::BinlogError& err) {
+      res = td::Status::Error(err.msg);
+    }
+    if (res.is_error()) {
+      fd.close();
+      td::unlink(new_binlog_name).ignore();
+      writing = false;
+      return res;
+    }
+    binlog_name = new_binlog_name;
+    ok = true;
+    return td::Status::OK();
+  }
+  binlog_name = new_binlog_name;
+  auto res = replay_binlog(replica);
+  if (res.is_error()) {
+    return res.move_as_error();
+  }
+  if (!replica) {
+    if (log_rpos != log_wpos || log_rpos != log_cpos || rptr != wptr || rptr != cptr) {
+      std::string msg = (PSLICE() << "error while interpreting binlog `" << binlog_name << "`: " << log_wpos - log_rpos
+                                  << " bytes left uninterpreted at position " << log_rpos << ", truncated binlog?")
+                            .c_str();
+      LOG(ERROR) << msg;
+      return td::Status::Error(msg);
+    }
+    //rptr = wptr = cptr = start;
+    //eptr = nullptr;
+    LOG(INFO) << "read and interpreted " << res.move_as_ok() << " bytes from binlog `" << binlog_name
+              << "`, final position " << log_rpos << ", reopening in write mode";
+    writing = true;
+    if (!log_rpos) {
+      td::Status status;
+      try {
+        status = cb->init_new_binlog(*this);
+      } catch (BinlogBuffer::BinlogError& err) {
+        status = td::Status::Error(err.msg);
+      }
+      if (status.is_error()) {
+        fd.close();
+        td::unlink(new_binlog_name).ignore();
+        writing = false;
+        return status;
+      }
+    }
+  }
+  ok = true;
+  return td::Status::OK();
+}
+
+td::Result<long long> BinlogBuffer::replay_binlog(bool allow_partial) {
+  if (writing) {
+    return 0;
+  }
+  long long total = 0;
+  while (true) {
+    auto res = read_file();
+    if (res.is_error()) {
+      return res.move_as_error();
+    }
+    long long sz = res.move_as_ok();
+    total += sz;
+    try {
+      cptr = wptr;
+      log_cpos = log_wpos;
+      if (!log_rpos && rptr == start && wptr >= rptr + 4 && td::as<unsigned>(rptr) != 0x0442446b) {
+        throw BinlogError{"incorrect magic"};
+      }
+      int r = replay_pending(allow_partial || sz != 0);
+      if (r < 0 && r >= -0x40000000) {
+        throw InterpretError{(PSLICE() << "binlog error " << r).c_str()};
+      }
+    } catch (BinlogError err) {
+      LOG(ERROR) << "error reading binlog " << binlog_name << ": " << err.msg << " at position " << log_rpos;
+      return td::Status::Error(PSLICE() << "error reading binlog " << binlog_name << ": " << err.msg << " at position "
+                                        << log_rpos);
+    } catch (InterpretError err) {
+      LOG(ERROR) << "error interpreting binlog " << binlog_name << ": " << err.msg << " at position " << log_rpos;
+      return td::Status::Error(PSLICE() << "error interpreting binlog " << binlog_name << ": " << err.msg
+                                        << " at position " << log_rpos);
+    }
+    if (!sz) {
+      break;
+    }
+  };
+  return total;
+}
+
+td::Result<int> BinlogBuffer::read_file() {
+  unsigned char* ptr = wptr;
+  std::size_t sz = end - wptr;
+  if (rptr > wptr) {
+    DCHECK(eptr);
+    sz = rptr - wptr;
+    if (sz <= 4) {
+      return 0;  // buffer full
+    }
+    sz -= 4;
+  } else if (!sz) {
+    DCHECK(!eptr);
+    if (rptr <= start + 4) {
+      return 0;  // buffer full
+    }
+    eptr = end;
+    ptr = wptr = start;
+    sz = rptr - start - 4;
+  }
+  auto r_res = fd.pread(td::MutableSlice(ptr, sz), log_wpos);
+  if (r_res.is_error()) {
+    std::string msg = PSTRING() << "error reading binlog file `" << binlog_name << "` at position " << log_wpos << " : "
+                                << r_res.error();
+    LOG(ERROR) << msg;
+    return td::Status::Error(msg);
+  }
+  auto res = r_res.move_as_ok();
+  DCHECK(std::size_t(res) <= sz);
+  LOG(INFO) << "read " << res << " bytes from binlog `" << binlog_name << "` at position " << log_wpos;
+  log_wpos += res;
+  wptr += res;
+  return (int)res;
+}
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/Binlog.h b/submodules/ton/tonlib-src/crypto/block/Binlog.h
new file mode 100644
index 0000000000..f5b6606028
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/Binlog.h
@@ -0,0 +1,157 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/Status.h"
+#include "td/utils/port/FileFd.h"
+
+namespace block {
+/*
+ * 
+ *   BINLOG (BUFFERS) -- move to separate file
+ * 
+ */
+
+class BinlogBuffer;
+
+class BinlogCallback {
+ public:
+  virtual ~BinlogCallback() = default;
+  virtual td::Status init_new_binlog(BinlogBuffer& bb) = 0;
+  virtual int replay_log_event(BinlogBuffer& bb, const unsigned* ptr, std::size_t len, unsigned long long pos) = 0;
+};
+
+class BinlogBuffer {
+  static constexpr std::size_t max_event_size = 0xfffc;
+  std::unique_ptr<BinlogCallback> cb;
+  std::size_t max_size;
+  std::size_t need_more_bytes;
+  unsigned char *start, *rptr, *cptr, *wptr, *eptr, *end;
+  unsigned long long log_rpos, log_cpos, log_wpos;
+  std::string binlog_name;
+  td::FileFd fd;
+  bool replica;
+  bool writing;
+  bool dirty;
+  bool created;
+  bool ok;
+  td::Result<int> read_file();
+  td::Result<long long> replay_binlog(bool allow_partial);
+  unsigned char* try_alloc_log_event(std::size_t size);
+  int replay_pending(bool allow_partial = false);
+  void replay_range(unsigned char* ptr, unsigned long long pos_start, unsigned long long pos_end);
+  td::Status set_fd(td::FileFd fd);
+
+ public:
+  struct LevAllocError {
+    std::size_t size;
+    explicit LevAllocError(std::size_t _size) : size(_size) {
+    }
+  };
+  struct InterpretError {
+    std::string msg;
+    explicit InterpretError(std::string _msg) : msg(_msg) {
+    }
+  };
+  struct BinlogError {
+    std::string msg;
+    explicit BinlogError(std::string _msg) : msg(_msg) {
+    }
+  };
+  BinlogBuffer(std::unique_ptr<BinlogCallback> _cb, std::size_t _max_size = (1 << 24), td::FileFd fd = {});
+  BinlogBuffer(const BinlogBuffer&) = delete;
+  BinlogBuffer& operator=(const BinlogBuffer&) = delete;
+  BinlogBuffer(BinlogBuffer&&) = delete;
+  BinlogBuffer& operator=(BinlogBuffer&&) = delete;
+  ~BinlogBuffer();
+  td::Status set_binlog(std::string _binlog_name, int mode = 0);
+  unsigned char* alloc_log_event(std::size_t size);
+  unsigned char* alloc_log_event_force(std::size_t size);
+  bool flush(int mode = 0);
+  td::Result<bool> try_flush(int mode);
+  unsigned long long get_rpos() const {
+    return log_rpos;
+  }
+  //
+  class NewBinlogEvent {
+   protected:
+    BinlogBuffer& bb;
+    unsigned long long pos;
+    unsigned size;
+    int status;
+
+   public:
+    NewBinlogEvent(BinlogBuffer& _bb, unsigned long long _pos, unsigned _size)
+        : bb(_bb), pos(_pos), size(_size), status(4) {
+    }
+    ~NewBinlogEvent();
+    unsigned long long get_log_pos() const {
+      return pos;
+    }
+    void commit();
+    void commit_later() {
+      if (status & 4) {
+        status = 5;
+      }
+    }
+    void rollback();
+    void rollback_later() {
+      if (status & 4) {
+        status = 6;
+      }
+    };
+  };
+  template <typename T>
+  class NewEvent : public NewBinlogEvent {
+    T* ptr;
+
+   protected:
+    friend class BinlogBuffer;
+    NewEvent(BinlogBuffer& _bb, unsigned long long _pos, unsigned _size, T* _ptr)
+        : NewBinlogEvent(_bb, _pos, _size), ptr(_ptr) {
+    }
+
+   public:
+    T* operator->() const {
+      return ptr;
+    }
+    T& operator*() const {
+      return *ptr;
+    }
+    void commit() {
+      NewBinlogEvent::commit();
+      ptr = nullptr;
+    }
+    void rollback() {
+      NewBinlogEvent::rollback();
+      ptr = nullptr;
+    }
+  };
+  template <typename T, typename... Args>
+  NewEvent<T> alloc(Args... args) {
+    unsigned long long pos = log_wpos;
+    return NewEvent<T>(*this, pos, sizeof(T), new (alloc_log_event_force(sizeof(T))) T(args...));
+  }
+
+ protected:
+  friend class NewBinlogEvent;
+  bool commit_range(unsigned long long pos_start, unsigned long long pos_end);
+  bool rollback_range(unsigned long long pos_start, unsigned long long pos_end);
+};
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/block-auto.cpp b/submodules/ton/tonlib-src/crypto/block/block-auto.cpp
new file mode 100644
index 0000000000..14b34ee6bf
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/block-auto.cpp
@@ -0,0 +1,17246 @@
+#include "block-auto.h"
+/*
+ *
+ *  AUTO-GENERATED FROM `block.tlb`
+ *
+ */
+// uses built-in type `#`
+// uses built-in type `##`
+// uses built-in type `#<`
+// uses built-in type `#<=`
+// uses built-in type `Any`
+// uses built-in type `Cell`
+// uses built-in type `int`
+// uses built-in type `uint`
+// uses built-in type `bits`
+// uses built-in type `int8`
+// uses built-in type `uint15`
+// uses built-in type `uint16`
+// uses built-in type `int32`
+// uses built-in type `uint32`
+// uses built-in type `uint64`
+// uses built-in type `bits256`
+
+namespace block {
+
+namespace gen {
+using namespace ::tlb;
+using td::Ref;
+using vm::CellSlice;
+using vm::Cell;
+using td::RefInt256;
+
+//
+// code for type `Unit`
+//
+
+int Unit::check_tag(const vm::CellSlice& cs) const {
+  return unit;
+}
+
+bool Unit::fetch_enum_to(vm::CellSlice& cs, char& value) const {
+  value = 0;
+  return true;
+}
+
+bool Unit::store_enum_from(vm::CellBuilder& cb, int value) const {
+  return !value;
+}
+
+bool Unit::unpack(vm::CellSlice& cs, Unit::Record& data) const {
+  return true;
+}
+
+bool Unit::unpack_unit(vm::CellSlice& cs) const {
+  return true;
+}
+
+bool Unit::cell_unpack(Ref<vm::Cell> cell_ref, Unit::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Unit::cell_unpack_unit(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_unit(cs) && cs.empty_ext();
+}
+
+bool Unit::pack(vm::CellBuilder& cb, const Unit::Record& data) const {
+  return true;
+}
+
+bool Unit::pack_unit(vm::CellBuilder& cb) const {
+  return true;
+}
+
+bool Unit::cell_pack(Ref<vm::Cell>& cell_ref, const Unit::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Unit::cell_pack_unit(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_unit(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Unit::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.cons("unit");
+}
+
+const Unit t_Unit;
+
+//
+// code for type `True`
+//
+
+int True::check_tag(const vm::CellSlice& cs) const {
+  return true1;
+}
+
+bool True::fetch_enum_to(vm::CellSlice& cs, char& value) const {
+  value = 0;
+  return true;
+}
+
+bool True::store_enum_from(vm::CellBuilder& cb, int value) const {
+  return !value;
+}
+
+bool True::unpack(vm::CellSlice& cs, True::Record& data) const {
+  return true;
+}
+
+bool True::unpack_true1(vm::CellSlice& cs) const {
+  return true;
+}
+
+bool True::cell_unpack(Ref<vm::Cell> cell_ref, True::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool True::cell_unpack_true1(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_true1(cs) && cs.empty_ext();
+}
+
+bool True::pack(vm::CellBuilder& cb, const True::Record& data) const {
+  return true;
+}
+
+bool True::pack_true1(vm::CellBuilder& cb) const {
+  return true;
+}
+
+bool True::cell_pack(Ref<vm::Cell>& cell_ref, const True::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool True::cell_pack_true1(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_true1(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool True::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.cons("true");
+}
+
+const True t_True;
+
+//
+// code for type `Bool`
+//
+
+int Bool::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case bool_false:
+    return cs.have(1) ? bool_false : -1;
+  case bool_true:
+    return cs.have(1) ? bool_true : -1;
+  }
+  return -1;
+}
+
+bool Bool::fetch_enum_to(vm::CellSlice& cs, char& value) const {
+  value = (char)cs.fetch_ulong(1);
+  return value >= 0;
+}
+
+bool Bool::store_enum_from(vm::CellBuilder& cb, int value) const {
+  return cb.store_long_rchk_bool(value, 1);
+}
+
+bool Bool::unpack(vm::CellSlice& cs, Bool::Record_bool_false& data) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool Bool::unpack_bool_false(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool Bool::cell_unpack(Ref<vm::Cell> cell_ref, Bool::Record_bool_false& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Bool::cell_unpack_bool_false(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_bool_false(cs) && cs.empty_ext();
+}
+
+bool Bool::unpack(vm::CellSlice& cs, Bool::Record_bool_true& data) const {
+  return cs.fetch_ulong(1) == 1;
+}
+
+bool Bool::unpack_bool_true(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(1) == 1;
+}
+
+bool Bool::cell_unpack(Ref<vm::Cell> cell_ref, Bool::Record_bool_true& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Bool::cell_unpack_bool_true(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_bool_true(cs) && cs.empty_ext();
+}
+
+bool Bool::pack(vm::CellBuilder& cb, const Bool::Record_bool_false& data) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool Bool::pack_bool_false(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool Bool::cell_pack(Ref<vm::Cell>& cell_ref, const Bool::Record_bool_false& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Bool::cell_pack_bool_false(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_bool_false(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Bool::pack(vm::CellBuilder& cb, const Bool::Record_bool_true& data) const {
+  return cb.store_long_bool(1, 1);
+}
+
+bool Bool::pack_bool_true(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(1, 1);
+}
+
+bool Bool::cell_pack(Ref<vm::Cell>& cell_ref, const Bool::Record_bool_true& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Bool::cell_pack_bool_true(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_bool_true(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Bool::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case bool_false:
+    return cs.advance(1)
+        && pp.cons("bool_false");
+  case bool_true:
+    return cs.advance(1)
+        && pp.cons("bool_true");
+  }
+  return pp.fail("unknown constructor for Bool");
+}
+
+const Bool t_Bool;
+
+//
+// code for type `BoolFalse`
+//
+
+int BoolFalse::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(1) == 0 ? bool_false : -1;
+}
+
+bool BoolFalse::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool BoolFalse::fetch_enum_to(vm::CellSlice& cs, char& value) const {
+  value = (cs.fetch_ulong(1) == 0) ? 0 : -1;
+  return !value;
+}
+
+bool BoolFalse::store_enum_from(vm::CellBuilder& cb, int value) const {
+  return !value && cb.store_long_bool(0, 1);
+}
+
+bool BoolFalse::unpack(vm::CellSlice& cs, BoolFalse::Record& data) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool BoolFalse::unpack_bool_false(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool BoolFalse::cell_unpack(Ref<vm::Cell> cell_ref, BoolFalse::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BoolFalse::cell_unpack_bool_false(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_bool_false(cs) && cs.empty_ext();
+}
+
+bool BoolFalse::pack(vm::CellBuilder& cb, const BoolFalse::Record& data) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool BoolFalse::pack_bool_false(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool BoolFalse::cell_pack(Ref<vm::Cell>& cell_ref, const BoolFalse::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BoolFalse::cell_pack_bool_false(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_bool_false(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BoolFalse::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(1) == 0
+      && pp.cons("bool_false");
+}
+
+const BoolFalse t_BoolFalse;
+
+//
+// code for type `BoolTrue`
+//
+constexpr unsigned char BoolTrue::cons_tag[1];
+
+int BoolTrue::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(1) == 1 ? bool_true : -1;
+}
+
+bool BoolTrue::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(1) == 1;
+}
+
+bool BoolTrue::fetch_enum_to(vm::CellSlice& cs, char& value) const {
+  value = (cs.fetch_ulong(1) == 1) ? 0 : -1;
+  return !value;
+}
+
+bool BoolTrue::store_enum_from(vm::CellBuilder& cb, int value) const {
+  return !value && cb.store_long_bool(1, 1);
+}
+
+bool BoolTrue::unpack(vm::CellSlice& cs, BoolTrue::Record& data) const {
+  return cs.fetch_ulong(1) == 1;
+}
+
+bool BoolTrue::unpack_bool_true(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(1) == 1;
+}
+
+bool BoolTrue::cell_unpack(Ref<vm::Cell> cell_ref, BoolTrue::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BoolTrue::cell_unpack_bool_true(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_bool_true(cs) && cs.empty_ext();
+}
+
+bool BoolTrue::pack(vm::CellBuilder& cb, const BoolTrue::Record& data) const {
+  return cb.store_long_bool(1, 1);
+}
+
+bool BoolTrue::pack_bool_true(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(1, 1);
+}
+
+bool BoolTrue::cell_pack(Ref<vm::Cell>& cell_ref, const BoolTrue::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BoolTrue::cell_pack_bool_true(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_bool_true(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BoolTrue::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(1) == 1
+      && pp.cons("bool_true");
+}
+
+const BoolTrue t_BoolTrue;
+
+//
+// code for type `Maybe`
+//
+
+int Maybe::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case nothing:
+    return cs.have(1) ? nothing : -1;
+  case just:
+    return cs.have(1) ? just : -1;
+  }
+  return -1;
+}
+
+bool Maybe::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case nothing:
+    return cs.advance(1);
+  case just:
+    return cs.advance(1)
+        && X_.skip(cs);
+  }
+  return false;
+}
+
+bool Maybe::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case nothing:
+    return cs.advance(1);
+  case just:
+    return cs.advance(1)
+        && X_.validate_skip(cs, weak);
+  }
+  return false;
+}
+
+bool Maybe::unpack(vm::CellSlice& cs, Maybe::Record_nothing& data) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool Maybe::unpack_nothing(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool Maybe::cell_unpack(Ref<vm::Cell> cell_ref, Maybe::Record_nothing& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Maybe::cell_unpack_nothing(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_nothing(cs) && cs.empty_ext();
+}
+
+bool Maybe::unpack(vm::CellSlice& cs, Maybe::Record_just& data) const {
+  return cs.fetch_ulong(1) == 1
+      && X_.fetch_to(cs, data.value);
+}
+
+bool Maybe::unpack_just(vm::CellSlice& cs, Ref<CellSlice>& value) const {
+  return cs.fetch_ulong(1) == 1
+      && X_.fetch_to(cs, value);
+}
+
+bool Maybe::cell_unpack(Ref<vm::Cell> cell_ref, Maybe::Record_just& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Maybe::cell_unpack_just(Ref<vm::Cell> cell_ref, Ref<CellSlice>& value) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_just(cs, value) && cs.empty_ext();
+}
+
+bool Maybe::pack(vm::CellBuilder& cb, const Maybe::Record_nothing& data) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool Maybe::pack_nothing(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool Maybe::cell_pack(Ref<vm::Cell>& cell_ref, const Maybe::Record_nothing& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Maybe::cell_pack_nothing(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_nothing(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Maybe::pack(vm::CellBuilder& cb, const Maybe::Record_just& data) const {
+  return cb.store_long_bool(1, 1)
+      && X_.store_from(cb, data.value);
+}
+
+bool Maybe::pack_just(vm::CellBuilder& cb, Ref<CellSlice> value) const {
+  return cb.store_long_bool(1, 1)
+      && X_.store_from(cb, value);
+}
+
+bool Maybe::cell_pack(Ref<vm::Cell>& cell_ref, const Maybe::Record_just& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Maybe::cell_pack_just(Ref<vm::Cell>& cell_ref, Ref<CellSlice> value) const {
+  vm::CellBuilder cb;
+  return pack_just(cb, std::move(value)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Maybe::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case nothing:
+    return cs.advance(1)
+        && pp.cons("nothing");
+  case just:
+    return cs.advance(1)
+        && pp.open("just")
+        && pp.field("value")
+        && X_.print_skip(pp, cs)
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for Maybe");
+}
+
+
+//
+// code for type `Either`
+//
+
+int Either::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case left:
+    return cs.have(1) ? left : -1;
+  case right:
+    return cs.have(1) ? right : -1;
+  }
+  return -1;
+}
+
+bool Either::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case left:
+    return cs.advance(1)
+        && X_.skip(cs);
+  case right:
+    return cs.advance(1)
+        && Y_.skip(cs);
+  }
+  return false;
+}
+
+bool Either::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case left:
+    return cs.advance(1)
+        && X_.validate_skip(cs, weak);
+  case right:
+    return cs.advance(1)
+        && Y_.validate_skip(cs, weak);
+  }
+  return false;
+}
+
+bool Either::unpack(vm::CellSlice& cs, Either::Record_left& data) const {
+  return cs.fetch_ulong(1) == 0
+      && X_.fetch_to(cs, data.value);
+}
+
+bool Either::unpack_left(vm::CellSlice& cs, Ref<CellSlice>& value) const {
+  return cs.fetch_ulong(1) == 0
+      && X_.fetch_to(cs, value);
+}
+
+bool Either::cell_unpack(Ref<vm::Cell> cell_ref, Either::Record_left& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Either::cell_unpack_left(Ref<vm::Cell> cell_ref, Ref<CellSlice>& value) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_left(cs, value) && cs.empty_ext();
+}
+
+bool Either::unpack(vm::CellSlice& cs, Either::Record_right& data) const {
+  return cs.fetch_ulong(1) == 1
+      && Y_.fetch_to(cs, data.value);
+}
+
+bool Either::unpack_right(vm::CellSlice& cs, Ref<CellSlice>& value) const {
+  return cs.fetch_ulong(1) == 1
+      && Y_.fetch_to(cs, value);
+}
+
+bool Either::cell_unpack(Ref<vm::Cell> cell_ref, Either::Record_right& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Either::cell_unpack_right(Ref<vm::Cell> cell_ref, Ref<CellSlice>& value) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_right(cs, value) && cs.empty_ext();
+}
+
+bool Either::pack(vm::CellBuilder& cb, const Either::Record_left& data) const {
+  return cb.store_long_bool(0, 1)
+      && X_.store_from(cb, data.value);
+}
+
+bool Either::pack_left(vm::CellBuilder& cb, Ref<CellSlice> value) const {
+  return cb.store_long_bool(0, 1)
+      && X_.store_from(cb, value);
+}
+
+bool Either::cell_pack(Ref<vm::Cell>& cell_ref, const Either::Record_left& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Either::cell_pack_left(Ref<vm::Cell>& cell_ref, Ref<CellSlice> value) const {
+  vm::CellBuilder cb;
+  return pack_left(cb, std::move(value)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Either::pack(vm::CellBuilder& cb, const Either::Record_right& data) const {
+  return cb.store_long_bool(1, 1)
+      && Y_.store_from(cb, data.value);
+}
+
+bool Either::pack_right(vm::CellBuilder& cb, Ref<CellSlice> value) const {
+  return cb.store_long_bool(1, 1)
+      && Y_.store_from(cb, value);
+}
+
+bool Either::cell_pack(Ref<vm::Cell>& cell_ref, const Either::Record_right& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Either::cell_pack_right(Ref<vm::Cell>& cell_ref, Ref<CellSlice> value) const {
+  vm::CellBuilder cb;
+  return pack_right(cb, std::move(value)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Either::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case left:
+    return cs.advance(1)
+        && pp.open("left")
+        && pp.field("value")
+        && X_.print_skip(pp, cs)
+        && pp.close();
+  case right:
+    return cs.advance(1)
+        && pp.open("right")
+        && pp.field("value")
+        && Y_.print_skip(pp, cs)
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for Either");
+}
+
+
+//
+// code for type `Both`
+//
+
+int Both::check_tag(const vm::CellSlice& cs) const {
+  return pair;
+}
+
+bool Both::skip(vm::CellSlice& cs) const {
+  return X_.skip(cs)
+      && Y_.skip(cs);
+}
+
+bool Both::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return X_.validate_skip(cs, weak)
+      && Y_.validate_skip(cs, weak);
+}
+
+bool Both::unpack(vm::CellSlice& cs, Both::Record& data) const {
+  return X_.fetch_to(cs, data.first)
+      && Y_.fetch_to(cs, data.second);
+}
+
+bool Both::unpack_pair(vm::CellSlice& cs, Ref<CellSlice>& first, Ref<CellSlice>& second) const {
+  return X_.fetch_to(cs, first)
+      && Y_.fetch_to(cs, second);
+}
+
+bool Both::cell_unpack(Ref<vm::Cell> cell_ref, Both::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Both::cell_unpack_pair(Ref<vm::Cell> cell_ref, Ref<CellSlice>& first, Ref<CellSlice>& second) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_pair(cs, first, second) && cs.empty_ext();
+}
+
+bool Both::pack(vm::CellBuilder& cb, const Both::Record& data) const {
+  return X_.store_from(cb, data.first)
+      && Y_.store_from(cb, data.second);
+}
+
+bool Both::pack_pair(vm::CellBuilder& cb, Ref<CellSlice> first, Ref<CellSlice> second) const {
+  return X_.store_from(cb, first)
+      && Y_.store_from(cb, second);
+}
+
+bool Both::cell_pack(Ref<vm::Cell>& cell_ref, const Both::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Both::cell_pack_pair(Ref<vm::Cell>& cell_ref, Ref<CellSlice> first, Ref<CellSlice> second) const {
+  vm::CellBuilder cb;
+  return pack_pair(cb, std::move(first), std::move(second)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Both::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("pair")
+      && pp.field("first")
+      && X_.print_skip(pp, cs)
+      && pp.field("second")
+      && Y_.print_skip(pp, cs)
+      && pp.close();
+}
+
+
+//
+// code for type `Bit`
+//
+
+int Bit::check_tag(const vm::CellSlice& cs) const {
+  return bit;
+}
+
+bool Bit::unpack(vm::CellSlice& cs, Bit::Record& data) const {
+  return cs.fetch_bool_to(data.x);
+}
+
+bool Bit::unpack_bit(vm::CellSlice& cs, bool& x) const {
+  return cs.fetch_bool_to(x);
+}
+
+bool Bit::cell_unpack(Ref<vm::Cell> cell_ref, Bit::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Bit::cell_unpack_bit(Ref<vm::Cell> cell_ref, bool& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_bit(cs, x) && cs.empty_ext();
+}
+
+bool Bit::pack(vm::CellBuilder& cb, const Bit::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.x, 1);
+}
+
+bool Bit::pack_bit(vm::CellBuilder& cb, bool x) const {
+  return cb.store_ulong_rchk_bool(x, 1);
+}
+
+bool Bit::cell_pack(Ref<vm::Cell>& cell_ref, const Bit::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Bit::cell_pack_bit(Ref<vm::Cell>& cell_ref, bool x) const {
+  vm::CellBuilder cb;
+  return pack_bit(cb, x) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Bit::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int t1;
+  return pp.open("bit")
+      && cs.fetch_bool_to(t1)
+      && pp.field_int(t1)
+      && pp.close();
+}
+
+const Bit t_Bit;
+
+//
+// code for type `Hashmap`
+//
+
+int Hashmap::check_tag(const vm::CellSlice& cs) const {
+  return hm_edge;
+}
+
+bool Hashmap::skip(vm::CellSlice& cs) const {
+  int l, m;
+  return HmLabel{m_}.skip(cs, l)
+      && add_r1(m, l, m_)
+      && HashmapNode{m, X_}.skip(cs);
+}
+
+bool Hashmap::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int l, m;
+  return HmLabel{m_}.validate_skip(cs, weak, l)
+      && add_r1(m, l, m_)
+      && HashmapNode{m, X_}.validate_skip(cs, weak);
+}
+
+bool Hashmap::unpack(vm::CellSlice& cs, Hashmap::Record& data) const {
+  return (data.n = m_) >= 0
+      && HmLabel{m_}.fetch_to(cs, data.label, data.l)
+      && add_r1(data.m, data.l, m_)
+      && HashmapNode{data.m, X_}.fetch_to(cs, data.node);
+}
+
+bool Hashmap::cell_unpack(Ref<vm::Cell> cell_ref, Hashmap::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Hashmap::pack(vm::CellBuilder& cb, const Hashmap::Record& data) const {
+  int l, m;
+  return tlb::store_from(cb, HmLabel{m_}, data.label, l)
+      && add_r1(m, l, m_)
+      && HashmapNode{m, X_}.store_from(cb, data.node);
+}
+
+bool Hashmap::cell_pack(Ref<vm::Cell>& cell_ref, const Hashmap::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Hashmap::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int l, m;
+  return pp.open("hm_edge")
+      && pp.field("label")
+      && HmLabel{m_}.print_skip(pp, cs, l)
+      && add_r1(m, l, m_)
+      && pp.field("node")
+      && HashmapNode{m, X_}.print_skip(pp, cs)
+      && pp.close();
+}
+
+
+//
+// code for type `HashmapNode`
+//
+
+int HashmapNode::get_tag(const vm::CellSlice& cs) const {
+  // distinguish by parameter `m_` using 1 2 2 2
+  return m_ ? hmn_fork : hmn_leaf;
+}
+
+int HashmapNode::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case hmn_leaf:
+    return hmn_leaf;
+  case hmn_fork:
+    return hmn_fork;
+  }
+  return -1;
+}
+
+bool HashmapNode::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case hmn_leaf:
+    return m_ == 0
+        && X_.skip(cs);
+  case hmn_fork: {
+    int n;
+    return add_r1(n, 1, m_)
+        && cs.advance_refs(2);
+    }
+  }
+  return false;
+}
+
+bool HashmapNode::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case hmn_leaf:
+    return m_ == 0
+        && X_.validate_skip(cs, weak);
+  case hmn_fork: {
+    int n;
+    return add_r1(n, 1, m_)
+        && Hashmap{n, X_}.validate_skip_ref(cs, weak)
+        && Hashmap{n, X_}.validate_skip_ref(cs, weak);
+    }
+  }
+  return false;
+}
+
+bool HashmapNode::unpack(vm::CellSlice& cs, HashmapNode::Record_hmn_leaf& data) const {
+  return m_ == 0
+      && X_.fetch_to(cs, data.value);
+}
+
+bool HashmapNode::unpack_hmn_leaf(vm::CellSlice& cs, Ref<CellSlice>& value) const {
+  return m_ == 0
+      && X_.fetch_to(cs, value);
+}
+
+bool HashmapNode::cell_unpack(Ref<vm::Cell> cell_ref, HashmapNode::Record_hmn_leaf& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool HashmapNode::cell_unpack_hmn_leaf(Ref<vm::Cell> cell_ref, Ref<CellSlice>& value) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_hmn_leaf(cs, value) && cs.empty_ext();
+}
+
+bool HashmapNode::unpack(vm::CellSlice& cs, HashmapNode::Record_hmn_fork& data) const {
+  return add_r1(data.n, 1, m_)
+      && cs.fetch_ref_to(data.left)
+      && cs.fetch_ref_to(data.right);
+}
+
+bool HashmapNode::unpack_hmn_fork(vm::CellSlice& cs, int& n, Ref<Cell>& left, Ref<Cell>& right) const {
+  return add_r1(n, 1, m_)
+      && cs.fetch_ref_to(left)
+      && cs.fetch_ref_to(right);
+}
+
+bool HashmapNode::cell_unpack(Ref<vm::Cell> cell_ref, HashmapNode::Record_hmn_fork& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool HashmapNode::cell_unpack_hmn_fork(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& left, Ref<Cell>& right) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_hmn_fork(cs, n, left, right) && cs.empty_ext();
+}
+
+bool HashmapNode::pack(vm::CellBuilder& cb, const HashmapNode::Record_hmn_leaf& data) const {
+  return m_ == 0
+      && X_.store_from(cb, data.value);
+}
+
+bool HashmapNode::pack_hmn_leaf(vm::CellBuilder& cb, Ref<CellSlice> value) const {
+  return m_ == 0
+      && X_.store_from(cb, value);
+}
+
+bool HashmapNode::cell_pack(Ref<vm::Cell>& cell_ref, const HashmapNode::Record_hmn_leaf& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapNode::cell_pack_hmn_leaf(Ref<vm::Cell>& cell_ref, Ref<CellSlice> value) const {
+  vm::CellBuilder cb;
+  return pack_hmn_leaf(cb, std::move(value)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapNode::pack(vm::CellBuilder& cb, const HashmapNode::Record_hmn_fork& data) const {
+  int n;
+  return add_r1(n, 1, m_)
+      && cb.store_ref_bool(data.left)
+      && cb.store_ref_bool(data.right);
+}
+
+bool HashmapNode::pack_hmn_fork(vm::CellBuilder& cb, Ref<Cell> left, Ref<Cell> right) const {
+  int n;
+  return add_r1(n, 1, m_)
+      && cb.store_ref_bool(left)
+      && cb.store_ref_bool(right);
+}
+
+bool HashmapNode::cell_pack(Ref<vm::Cell>& cell_ref, const HashmapNode::Record_hmn_fork& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapNode::cell_pack_hmn_fork(Ref<vm::Cell>& cell_ref, Ref<Cell> left, Ref<Cell> right) const {
+  vm::CellBuilder cb;
+  return pack_hmn_fork(cb, std::move(left), std::move(right)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapNode::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case hmn_leaf:
+    return pp.open("hmn_leaf")
+        && m_ == 0
+        && pp.field("value")
+        && X_.print_skip(pp, cs)
+        && pp.close();
+  case hmn_fork: {
+    int n;
+    return pp.open("hmn_fork")
+        && add_r1(n, 1, m_)
+        && pp.field("left")
+        && Hashmap{n, X_}.print_ref(pp, cs.fetch_ref())
+        && pp.field("right")
+        && Hashmap{n, X_}.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+    }
+  }
+  return pp.fail("unknown constructor for HashmapNode");
+}
+
+
+//
+// code for type `HmLabel`
+//
+constexpr char HmLabel::cons_len[3];
+constexpr unsigned char HmLabel::cons_tag[3];
+
+int HmLabel::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case hml_short:
+    return cs.have(1) ? hml_short : -1;
+  case hml_long:
+    return cs.have(2) ? hml_long : -1;
+  case hml_same:
+    return cs.have(2) ? hml_same : -1;
+  }
+  return -1;
+}
+
+bool HmLabel::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case hml_short: {
+    int m_;
+    return cs.advance(1)
+        && t_Unary.skip(cs, m_)
+        && m_ <= n_
+        && cs.advance(m_);
+    }
+  case hml_long: {
+    int m_;
+    return cs.advance(2)
+        && cs.fetch_uint_leq(n_, m_)
+        && cs.advance(m_);
+    }
+  case hml_same: {
+    int m_;
+    return cs.advance(3)
+        && cs.fetch_uint_leq(n_, m_);
+    }
+  }
+  return false;
+}
+
+bool HmLabel::skip(vm::CellSlice& cs, int& m_) const {
+  switch (get_tag(cs)) {
+  case hml_short:
+    return cs.advance(1)
+        && t_Unary.skip(cs, m_)
+        && m_ <= n_
+        && cs.advance(m_);
+  case hml_long:
+    return cs.advance(2)
+        && cs.fetch_uint_leq(n_, m_)
+        && cs.advance(m_);
+  case hml_same:
+    return cs.advance(3)
+        && cs.fetch_uint_leq(n_, m_);
+  }
+  return false;
+}
+
+bool HmLabel::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case hml_short: {
+    int m_;
+    return cs.advance(1)
+        && t_Unary.validate_skip(cs, weak, m_)
+        && m_ <= n_
+        && cs.advance(m_);
+    }
+  case hml_long: {
+    int m_;
+    return cs.advance(2)
+        && cs.fetch_uint_leq(n_, m_)
+        && cs.advance(m_);
+    }
+  case hml_same: {
+    int m_;
+    return cs.advance(3)
+        && cs.fetch_uint_leq(n_, m_);
+    }
+  }
+  return false;
+}
+
+bool HmLabel::validate_skip(vm::CellSlice& cs, bool weak, int& m_) const {
+  switch (get_tag(cs)) {
+  case hml_short:
+    return cs.advance(1)
+        && t_Unary.validate_skip(cs, weak, m_)
+        && m_ <= n_
+        && cs.advance(m_);
+  case hml_long:
+    return cs.advance(2)
+        && cs.fetch_uint_leq(n_, m_)
+        && cs.advance(m_);
+  case hml_same:
+    return cs.advance(3)
+        && cs.fetch_uint_leq(n_, m_);
+  }
+  return false;
+}
+
+bool HmLabel::fetch_to(vm::CellSlice& cs, Ref<vm::CellSlice>& res, int& m_) const {
+  res = Ref<vm::CellSlice>{true, cs};
+  return skip(cs, m_) && res.unique_write().cut_tail(cs);
+}
+
+bool HmLabel::unpack(vm::CellSlice& cs, HmLabel::Record_hml_short& data, int& m_) const {
+  return cs.fetch_ulong(1) == 0
+      && (data.m = n_) >= 0
+      && t_Unary.fetch_to(cs, data.len, data.n)
+      && data.n <= n_
+      && cs.fetch_bitstring_to(data.n, data.s)
+      && (m_ = data.n) >= 0;
+}
+
+bool HmLabel::cell_unpack(Ref<vm::Cell> cell_ref, HmLabel::Record_hml_short& data, int& m_) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data, m_) && cs.empty_ext();
+}
+
+bool HmLabel::unpack(vm::CellSlice& cs, HmLabel::Record_hml_long& data, int& m_) const {
+  return cs.fetch_ulong(2) == 2
+      && (data.m = n_) >= 0
+      && cs.fetch_uint_leq(n_, data.n)
+      && cs.fetch_bitstring_to(data.n, data.s)
+      && (m_ = data.n) >= 0;
+}
+
+bool HmLabel::unpack_hml_long(vm::CellSlice& cs, int& m, int& n, Ref<td::BitString>& s, int& m_) const {
+  return cs.fetch_ulong(2) == 2
+      && (m = n_) >= 0
+      && cs.fetch_uint_leq(n_, n)
+      && cs.fetch_bitstring_to(n, s)
+      && (m_ = n) >= 0;
+}
+
+bool HmLabel::cell_unpack(Ref<vm::Cell> cell_ref, HmLabel::Record_hml_long& data, int& m_) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data, m_) && cs.empty_ext();
+}
+
+bool HmLabel::cell_unpack_hml_long(Ref<vm::Cell> cell_ref, int& m, int& n, Ref<td::BitString>& s, int& m_) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_hml_long(cs, m, n, s, m_) && cs.empty_ext();
+}
+
+bool HmLabel::unpack(vm::CellSlice& cs, HmLabel::Record_hml_same& data, int& m_) const {
+  return cs.fetch_ulong(2) == 3
+      && (data.m = n_) >= 0
+      && cs.fetch_bool_to(data.v)
+      && cs.fetch_uint_leq(n_, data.n)
+      && (m_ = data.n) >= 0;
+}
+
+bool HmLabel::unpack_hml_same(vm::CellSlice& cs, int& m, bool& v, int& n, int& m_) const {
+  return cs.fetch_ulong(2) == 3
+      && (m = n_) >= 0
+      && cs.fetch_bool_to(v)
+      && cs.fetch_uint_leq(n_, n)
+      && (m_ = n) >= 0;
+}
+
+bool HmLabel::cell_unpack(Ref<vm::Cell> cell_ref, HmLabel::Record_hml_same& data, int& m_) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data, m_) && cs.empty_ext();
+}
+
+bool HmLabel::cell_unpack_hml_same(Ref<vm::Cell> cell_ref, int& m, bool& v, int& n, int& m_) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_hml_same(cs, m, v, n, m_) && cs.empty_ext();
+}
+
+bool HmLabel::pack(vm::CellBuilder& cb, const HmLabel::Record_hml_short& data, int& m_) const {
+  return cb.store_long_bool(0, 1)
+      && tlb::store_from(cb, t_Unary, data.len, m_)
+      && m_ <= n_
+      && cb.append_bitstring_chk(data.s, m_);
+}
+
+bool HmLabel::cell_pack(Ref<vm::Cell>& cell_ref, const HmLabel::Record_hml_short& data, int& m_) const {
+  vm::CellBuilder cb;
+  return pack(cb, data, m_) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HmLabel::pack(vm::CellBuilder& cb, const HmLabel::Record_hml_long& data, int& m_) const {
+  return cb.store_long_bool(2, 2)
+      && cb.store_uint_leq(n_, data.n)
+      && cb.append_bitstring_chk(data.s, data.n)
+      && (m_ = data.n) >= 0;
+}
+
+bool HmLabel::pack_hml_long(vm::CellBuilder& cb, int n, Ref<td::BitString> s, int& m_) const {
+  return cb.store_long_bool(2, 2)
+      && cb.store_uint_leq(n_, n)
+      && cb.append_bitstring_chk(s, n)
+      && (m_ = n) >= 0;
+}
+
+bool HmLabel::cell_pack(Ref<vm::Cell>& cell_ref, const HmLabel::Record_hml_long& data, int& m_) const {
+  vm::CellBuilder cb;
+  return pack(cb, data, m_) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HmLabel::cell_pack_hml_long(Ref<vm::Cell>& cell_ref, int n, Ref<td::BitString> s, int& m_) const {
+  vm::CellBuilder cb;
+  return pack_hml_long(cb, n, std::move(s), m_) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HmLabel::pack(vm::CellBuilder& cb, const HmLabel::Record_hml_same& data, int& m_) const {
+  return cb.store_long_bool(3, 2)
+      && cb.store_ulong_rchk_bool(data.v, 1)
+      && cb.store_uint_leq(n_, data.n)
+      && (m_ = data.n) >= 0;
+}
+
+bool HmLabel::pack_hml_same(vm::CellBuilder& cb, bool v, int n, int& m_) const {
+  return cb.store_long_bool(3, 2)
+      && cb.store_ulong_rchk_bool(v, 1)
+      && cb.store_uint_leq(n_, n)
+      && (m_ = n) >= 0;
+}
+
+bool HmLabel::cell_pack(Ref<vm::Cell>& cell_ref, const HmLabel::Record_hml_same& data, int& m_) const {
+  vm::CellBuilder cb;
+  return pack(cb, data, m_) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HmLabel::cell_pack_hml_same(Ref<vm::Cell>& cell_ref, bool v, int n, int& m_) const {
+  vm::CellBuilder cb;
+  return pack_hml_same(cb, v, n, m_) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HmLabel::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case hml_short: {
+    int m_;
+    return cs.advance(1)
+        && pp.open("hml_short")
+        && pp.field("len")
+        && t_Unary.print_skip(pp, cs, m_)
+        && m_ <= n_
+        && pp.fetch_bits_field(cs, m_, "s")
+        && pp.close();
+    }
+  case hml_long: {
+    int m_;
+    return cs.advance(2)
+        && pp.open("hml_long")
+        && cs.fetch_uint_leq(n_, m_)
+        && pp.field_int(m_, "n")
+        && pp.fetch_bits_field(cs, m_, "s")
+        && pp.close();
+    }
+  case hml_same: {
+    int m_;
+    return cs.advance(2)
+        && pp.open("hml_same")
+        && pp.fetch_uint_field(cs, 1, "v")
+        && cs.fetch_uint_leq(n_, m_)
+        && pp.field_int(m_, "n")
+        && pp.close();
+    }
+  }
+  return pp.fail("unknown constructor for HmLabel");
+}
+
+bool HmLabel::print_skip(PrettyPrinter& pp, vm::CellSlice& cs, int& m_) const {
+  switch (get_tag(cs)) {
+  case hml_short:
+    return cs.advance(1)
+        && pp.open("hml_short")
+        && pp.field("len")
+        && t_Unary.print_skip(pp, cs, m_)
+        && m_ <= n_
+        && pp.fetch_bits_field(cs, m_, "s")
+        && pp.close();
+  case hml_long:
+    return cs.advance(2)
+        && pp.open("hml_long")
+        && cs.fetch_uint_leq(n_, m_)
+        && pp.field_int(m_, "n")
+        && pp.fetch_bits_field(cs, m_, "s")
+        && pp.close();
+  case hml_same:
+    return cs.advance(2)
+        && pp.open("hml_same")
+        && pp.fetch_uint_field(cs, 1, "v")
+        && cs.fetch_uint_leq(n_, m_)
+        && pp.field_int(m_, "n")
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for HmLabel");
+}
+
+
+//
+// code for type `Unary`
+//
+
+int Unary::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case unary_zero:
+    return cs.have(1) ? unary_zero : -1;
+  case unary_succ:
+    return cs.have(1) ? unary_succ : -1;
+  }
+  return -1;
+}
+
+bool Unary::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case unary_zero:
+    return cs.advance(1);
+  case unary_succ: {
+    int n;
+    return cs.advance(1)
+        && skip(cs, n);
+    }
+  }
+  return false;
+}
+
+bool Unary::skip(vm::CellSlice& cs, int& m_) const {
+  switch (get_tag(cs)) {
+  case unary_zero:
+    return (m_ = 0) >= 0
+        && cs.advance(1);
+  case unary_succ: {
+    int n;
+    return cs.advance(1)
+        && skip(cs, n)
+        && (m_ = n + 1) >= 0;
+    }
+  }
+  return false;
+}
+
+bool Unary::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case unary_zero:
+    return cs.advance(1);
+  case unary_succ: {
+    int n;
+    return cs.advance(1)
+        && validate_skip(cs, weak, n);
+    }
+  }
+  return false;
+}
+
+bool Unary::validate_skip(vm::CellSlice& cs, bool weak, int& m_) const {
+  switch (get_tag(cs)) {
+  case unary_zero:
+    return (m_ = 0) >= 0
+        && cs.advance(1);
+  case unary_succ: {
+    int n;
+    return cs.advance(1)
+        && validate_skip(cs, weak, n)
+        && (m_ = n + 1) >= 0;
+    }
+  }
+  return false;
+}
+
+bool Unary::fetch_to(vm::CellSlice& cs, Ref<vm::CellSlice>& res, int& m_) const {
+  res = Ref<vm::CellSlice>{true, cs};
+  return skip(cs, m_) && res.unique_write().cut_tail(cs);
+}
+
+bool Unary::unpack(vm::CellSlice& cs, Unary::Record_unary_zero& data, int& m_) const {
+  return cs.fetch_ulong(1) == 0
+      && (m_ = 0) >= 0;
+}
+
+bool Unary::unpack_unary_zero(vm::CellSlice& cs, int& m_) const {
+  return cs.fetch_ulong(1) == 0
+      && (m_ = 0) >= 0;
+}
+
+bool Unary::cell_unpack(Ref<vm::Cell> cell_ref, Unary::Record_unary_zero& data, int& m_) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data, m_) && cs.empty_ext();
+}
+
+bool Unary::cell_unpack_unary_zero(Ref<vm::Cell> cell_ref, int& m_) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_unary_zero(cs, m_) && cs.empty_ext();
+}
+
+bool Unary::unpack(vm::CellSlice& cs, Unary::Record_unary_succ& data, int& m_) const {
+  return cs.fetch_ulong(1) == 1
+      && fetch_to(cs, data.x, data.n)
+      && (m_ = data.n + 1) >= 0;
+}
+
+bool Unary::unpack_unary_succ(vm::CellSlice& cs, int& n, Ref<CellSlice>& x, int& m_) const {
+  return cs.fetch_ulong(1) == 1
+      && fetch_to(cs, x, n)
+      && (m_ = n + 1) >= 0;
+}
+
+bool Unary::cell_unpack(Ref<vm::Cell> cell_ref, Unary::Record_unary_succ& data, int& m_) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data, m_) && cs.empty_ext();
+}
+
+bool Unary::cell_unpack_unary_succ(Ref<vm::Cell> cell_ref, int& n, Ref<CellSlice>& x, int& m_) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_unary_succ(cs, n, x, m_) && cs.empty_ext();
+}
+
+bool Unary::pack(vm::CellBuilder& cb, const Unary::Record_unary_zero& data, int& m_) const {
+  return cb.store_long_bool(0, 1)
+      && (m_ = 0) >= 0;
+}
+
+bool Unary::pack_unary_zero(vm::CellBuilder& cb, int& m_) const {
+  return cb.store_long_bool(0, 1)
+      && (m_ = 0) >= 0;
+}
+
+bool Unary::cell_pack(Ref<vm::Cell>& cell_ref, const Unary::Record_unary_zero& data, int& m_) const {
+  vm::CellBuilder cb;
+  return pack(cb, data, m_) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Unary::cell_pack_unary_zero(Ref<vm::Cell>& cell_ref, int& m_) const {
+  vm::CellBuilder cb;
+  return pack_unary_zero(cb, m_) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Unary::pack(vm::CellBuilder& cb, const Unary::Record_unary_succ& data, int& m_) const {
+  int n;
+  return cb.store_long_bool(1, 1)
+      && tlb::store_from(cb, *this, data.x, n)
+      && (m_ = n + 1) >= 0;
+}
+
+bool Unary::pack_unary_succ(vm::CellBuilder& cb, Ref<CellSlice> x, int& m_) const {
+  int n;
+  return cb.store_long_bool(1, 1)
+      && tlb::store_from(cb, *this, x, n)
+      && (m_ = n + 1) >= 0;
+}
+
+bool Unary::cell_pack(Ref<vm::Cell>& cell_ref, const Unary::Record_unary_succ& data, int& m_) const {
+  vm::CellBuilder cb;
+  return pack(cb, data, m_) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Unary::cell_pack_unary_succ(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x, int& m_) const {
+  vm::CellBuilder cb;
+  return pack_unary_succ(cb, std::move(x), m_) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Unary::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case unary_zero:
+    return cs.advance(1)
+        && pp.cons("unary_zero");
+  case unary_succ: {
+    int n;
+    return cs.advance(1)
+        && pp.open("unary_succ")
+        && pp.field("x")
+        && print_skip(pp, cs, n)
+        && pp.close();
+    }
+  }
+  return pp.fail("unknown constructor for Unary");
+}
+
+bool Unary::print_skip(PrettyPrinter& pp, vm::CellSlice& cs, int& m_) const {
+  switch (get_tag(cs)) {
+  case unary_zero:
+    return cs.advance(1)
+        && pp.cons("unary_zero")
+        && (m_ = 0) >= 0;
+  case unary_succ: {
+    int n;
+    return cs.advance(1)
+        && pp.open("unary_succ")
+        && pp.field("x")
+        && print_skip(pp, cs, n)
+        && (m_ = n + 1) >= 0
+        && pp.close();
+    }
+  }
+  return pp.fail("unknown constructor for Unary");
+}
+
+const Unary t_Unary;
+
+//
+// code for type `HashmapE`
+//
+
+int HashmapE::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case hme_empty:
+    return cs.have(1) ? hme_empty : -1;
+  case hme_root:
+    return cs.have(1) ? hme_root : -1;
+  }
+  return -1;
+}
+
+bool HashmapE::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case hme_empty:
+    return cs.advance(1);
+  case hme_root:
+    return cs.advance_ext(0x10001);
+  }
+  return false;
+}
+
+bool HashmapE::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case hme_empty:
+    return cs.advance(1);
+  case hme_root:
+    return cs.advance(1)
+        && Hashmap{m_, X_}.validate_skip_ref(cs, weak);
+  }
+  return false;
+}
+
+bool HashmapE::unpack(vm::CellSlice& cs, HashmapE::Record_hme_empty& data) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool HashmapE::unpack_hme_empty(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool HashmapE::cell_unpack(Ref<vm::Cell> cell_ref, HashmapE::Record_hme_empty& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool HashmapE::cell_unpack_hme_empty(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_hme_empty(cs) && cs.empty_ext();
+}
+
+bool HashmapE::unpack(vm::CellSlice& cs, HashmapE::Record_hme_root& data) const {
+  return cs.fetch_ulong(1) == 1
+      && (data.n = m_) >= 0
+      && cs.fetch_ref_to(data.root);
+}
+
+bool HashmapE::unpack_hme_root(vm::CellSlice& cs, int& n, Ref<Cell>& root) const {
+  return cs.fetch_ulong(1) == 1
+      && (n = m_) >= 0
+      && cs.fetch_ref_to(root);
+}
+
+bool HashmapE::cell_unpack(Ref<vm::Cell> cell_ref, HashmapE::Record_hme_root& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool HashmapE::cell_unpack_hme_root(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& root) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_hme_root(cs, n, root) && cs.empty_ext();
+}
+
+bool HashmapE::pack(vm::CellBuilder& cb, const HashmapE::Record_hme_empty& data) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool HashmapE::pack_hme_empty(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool HashmapE::cell_pack(Ref<vm::Cell>& cell_ref, const HashmapE::Record_hme_empty& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapE::cell_pack_hme_empty(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_hme_empty(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapE::pack(vm::CellBuilder& cb, const HashmapE::Record_hme_root& data) const {
+  return cb.store_long_bool(1, 1)
+      && cb.store_ref_bool(data.root);
+}
+
+bool HashmapE::pack_hme_root(vm::CellBuilder& cb, Ref<Cell> root) const {
+  return cb.store_long_bool(1, 1)
+      && cb.store_ref_bool(root);
+}
+
+bool HashmapE::cell_pack(Ref<vm::Cell>& cell_ref, const HashmapE::Record_hme_root& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapE::cell_pack_hme_root(Ref<vm::Cell>& cell_ref, Ref<Cell> root) const {
+  vm::CellBuilder cb;
+  return pack_hme_root(cb, std::move(root)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapE::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case hme_empty:
+    return cs.advance(1)
+        && pp.cons("hme_empty");
+  case hme_root:
+    return cs.advance(1)
+        && pp.open("hme_root")
+        && pp.field("root")
+        && Hashmap{m_, X_}.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for HashmapE");
+}
+
+
+//
+// code for type `BitstringSet`
+//
+
+int BitstringSet::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool BitstringSet::skip(vm::CellSlice& cs) const {
+  return Hashmap{m_, t_True}.skip(cs);
+}
+
+bool BitstringSet::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return Hashmap{m_, t_True}.validate_skip(cs, weak);
+}
+
+bool BitstringSet::unpack(vm::CellSlice& cs, BitstringSet::Record& data) const {
+  return (data.n = m_) >= 0
+      && Hashmap{m_, t_True}.fetch_to(cs, data.x);
+}
+
+bool BitstringSet::unpack_cons1(vm::CellSlice& cs, int& n, Ref<CellSlice>& x) const {
+  return (n = m_) >= 0
+      && Hashmap{m_, t_True}.fetch_to(cs, x);
+}
+
+bool BitstringSet::cell_unpack(Ref<vm::Cell> cell_ref, BitstringSet::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BitstringSet::cell_unpack_cons1(Ref<vm::Cell> cell_ref, int& n, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, n, x) && cs.empty_ext();
+}
+
+bool BitstringSet::pack(vm::CellBuilder& cb, const BitstringSet::Record& data) const {
+  return Hashmap{m_, t_True}.store_from(cb, data.x);
+}
+
+bool BitstringSet::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return Hashmap{m_, t_True}.store_from(cb, x);
+}
+
+bool BitstringSet::cell_pack(Ref<vm::Cell>& cell_ref, const BitstringSet::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BitstringSet::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BitstringSet::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field()
+      && Hashmap{m_, t_True}.print_skip(pp, cs)
+      && pp.close();
+}
+
+
+//
+// code for type `HashmapAug`
+//
+
+int HashmapAug::check_tag(const vm::CellSlice& cs) const {
+  return ahm_edge;
+}
+
+bool HashmapAug::skip(vm::CellSlice& cs) const {
+  int l, m;
+  return HmLabel{m_}.skip(cs, l)
+      && add_r1(m, l, m_)
+      && HashmapAugNode{m, X_, Y_}.skip(cs);
+}
+
+bool HashmapAug::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int l, m;
+  return HmLabel{m_}.validate_skip(cs, weak, l)
+      && add_r1(m, l, m_)
+      && HashmapAugNode{m, X_, Y_}.validate_skip(cs, weak);
+}
+
+bool HashmapAug::unpack(vm::CellSlice& cs, HashmapAug::Record& data) const {
+  return (data.n = m_) >= 0
+      && HmLabel{m_}.fetch_to(cs, data.label, data.l)
+      && add_r1(data.m, data.l, m_)
+      && HashmapAugNode{data.m, X_, Y_}.fetch_to(cs, data.node);
+}
+
+bool HashmapAug::cell_unpack(Ref<vm::Cell> cell_ref, HashmapAug::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool HashmapAug::pack(vm::CellBuilder& cb, const HashmapAug::Record& data) const {
+  int l, m;
+  return tlb::store_from(cb, HmLabel{m_}, data.label, l)
+      && add_r1(m, l, m_)
+      && HashmapAugNode{m, X_, Y_}.store_from(cb, data.node);
+}
+
+bool HashmapAug::cell_pack(Ref<vm::Cell>& cell_ref, const HashmapAug::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapAug::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int l, m;
+  return pp.open("ahm_edge")
+      && pp.field("label")
+      && HmLabel{m_}.print_skip(pp, cs, l)
+      && add_r1(m, l, m_)
+      && pp.field("node")
+      && HashmapAugNode{m, X_, Y_}.print_skip(pp, cs)
+      && pp.close();
+}
+
+
+//
+// code for type `HashmapAugNode`
+//
+
+int HashmapAugNode::get_tag(const vm::CellSlice& cs) const {
+  // distinguish by parameter `m_` using 1 2 2 2
+  return m_ ? ahmn_fork : ahmn_leaf;
+}
+
+int HashmapAugNode::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case ahmn_leaf:
+    return ahmn_leaf;
+  case ahmn_fork:
+    return ahmn_fork;
+  }
+  return -1;
+}
+
+bool HashmapAugNode::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case ahmn_leaf:
+    return m_ == 0
+        && Y_.skip(cs)
+        && X_.skip(cs);
+  case ahmn_fork: {
+    int n;
+    return add_r1(n, 1, m_)
+        && cs.advance_refs(2)
+        && Y_.skip(cs);
+    }
+  }
+  return false;
+}
+
+bool HashmapAugNode::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case ahmn_leaf:
+    return m_ == 0
+        && Y_.validate_skip(cs, weak)
+        && X_.validate_skip(cs, weak);
+  case ahmn_fork: {
+    int n;
+    return add_r1(n, 1, m_)
+        && HashmapAug{n, X_, Y_}.validate_skip_ref(cs, weak)
+        && HashmapAug{n, X_, Y_}.validate_skip_ref(cs, weak)
+        && Y_.validate_skip(cs, weak);
+    }
+  }
+  return false;
+}
+
+bool HashmapAugNode::unpack(vm::CellSlice& cs, HashmapAugNode::Record_ahmn_leaf& data) const {
+  return m_ == 0
+      && Y_.fetch_to(cs, data.extra)
+      && X_.fetch_to(cs, data.value);
+}
+
+bool HashmapAugNode::unpack_ahmn_leaf(vm::CellSlice& cs, Ref<CellSlice>& extra, Ref<CellSlice>& value) const {
+  return m_ == 0
+      && Y_.fetch_to(cs, extra)
+      && X_.fetch_to(cs, value);
+}
+
+bool HashmapAugNode::cell_unpack(Ref<vm::Cell> cell_ref, HashmapAugNode::Record_ahmn_leaf& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool HashmapAugNode::cell_unpack_ahmn_leaf(Ref<vm::Cell> cell_ref, Ref<CellSlice>& extra, Ref<CellSlice>& value) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_ahmn_leaf(cs, extra, value) && cs.empty_ext();
+}
+
+bool HashmapAugNode::unpack(vm::CellSlice& cs, HashmapAugNode::Record_ahmn_fork& data) const {
+  return add_r1(data.n, 1, m_)
+      && cs.fetch_ref_to(data.left)
+      && cs.fetch_ref_to(data.right)
+      && Y_.fetch_to(cs, data.extra);
+}
+
+bool HashmapAugNode::cell_unpack(Ref<vm::Cell> cell_ref, HashmapAugNode::Record_ahmn_fork& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool HashmapAugNode::pack(vm::CellBuilder& cb, const HashmapAugNode::Record_ahmn_leaf& data) const {
+  return m_ == 0
+      && Y_.store_from(cb, data.extra)
+      && X_.store_from(cb, data.value);
+}
+
+bool HashmapAugNode::pack_ahmn_leaf(vm::CellBuilder& cb, Ref<CellSlice> extra, Ref<CellSlice> value) const {
+  return m_ == 0
+      && Y_.store_from(cb, extra)
+      && X_.store_from(cb, value);
+}
+
+bool HashmapAugNode::cell_pack(Ref<vm::Cell>& cell_ref, const HashmapAugNode::Record_ahmn_leaf& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapAugNode::cell_pack_ahmn_leaf(Ref<vm::Cell>& cell_ref, Ref<CellSlice> extra, Ref<CellSlice> value) const {
+  vm::CellBuilder cb;
+  return pack_ahmn_leaf(cb, std::move(extra), std::move(value)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapAugNode::pack(vm::CellBuilder& cb, const HashmapAugNode::Record_ahmn_fork& data) const {
+  int n;
+  return add_r1(n, 1, m_)
+      && cb.store_ref_bool(data.left)
+      && cb.store_ref_bool(data.right)
+      && Y_.store_from(cb, data.extra);
+}
+
+bool HashmapAugNode::cell_pack(Ref<vm::Cell>& cell_ref, const HashmapAugNode::Record_ahmn_fork& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapAugNode::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case ahmn_leaf:
+    return pp.open("ahmn_leaf")
+        && m_ == 0
+        && pp.field("extra")
+        && Y_.print_skip(pp, cs)
+        && pp.field("value")
+        && X_.print_skip(pp, cs)
+        && pp.close();
+  case ahmn_fork: {
+    int n;
+    return pp.open("ahmn_fork")
+        && add_r1(n, 1, m_)
+        && pp.field("left")
+        && HashmapAug{n, X_, Y_}.print_ref(pp, cs.fetch_ref())
+        && pp.field("right")
+        && HashmapAug{n, X_, Y_}.print_ref(pp, cs.fetch_ref())
+        && pp.field("extra")
+        && Y_.print_skip(pp, cs)
+        && pp.close();
+    }
+  }
+  return pp.fail("unknown constructor for HashmapAugNode");
+}
+
+
+//
+// code for type `HashmapAugE`
+//
+
+int HashmapAugE::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case ahme_empty:
+    return cs.have(1) ? ahme_empty : -1;
+  case ahme_root:
+    return cs.have(1) ? ahme_root : -1;
+  }
+  return -1;
+}
+
+bool HashmapAugE::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case ahme_empty:
+    return cs.advance(1)
+        && Y_.skip(cs);
+  case ahme_root:
+    return cs.advance_ext(0x10001)
+        && Y_.skip(cs);
+  }
+  return false;
+}
+
+bool HashmapAugE::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case ahme_empty:
+    return cs.advance(1)
+        && Y_.validate_skip(cs, weak);
+  case ahme_root:
+    return cs.advance(1)
+        && HashmapAug{m_, X_, Y_}.validate_skip_ref(cs, weak)
+        && Y_.validate_skip(cs, weak);
+  }
+  return false;
+}
+
+bool HashmapAugE::unpack(vm::CellSlice& cs, HashmapAugE::Record_ahme_empty& data) const {
+  return cs.fetch_ulong(1) == 0
+      && Y_.fetch_to(cs, data.extra);
+}
+
+bool HashmapAugE::unpack_ahme_empty(vm::CellSlice& cs, Ref<CellSlice>& extra) const {
+  return cs.fetch_ulong(1) == 0
+      && Y_.fetch_to(cs, extra);
+}
+
+bool HashmapAugE::cell_unpack(Ref<vm::Cell> cell_ref, HashmapAugE::Record_ahme_empty& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool HashmapAugE::cell_unpack_ahme_empty(Ref<vm::Cell> cell_ref, Ref<CellSlice>& extra) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_ahme_empty(cs, extra) && cs.empty_ext();
+}
+
+bool HashmapAugE::unpack(vm::CellSlice& cs, HashmapAugE::Record_ahme_root& data) const {
+  return cs.fetch_ulong(1) == 1
+      && (data.n = m_) >= 0
+      && cs.fetch_ref_to(data.root)
+      && Y_.fetch_to(cs, data.extra);
+}
+
+bool HashmapAugE::unpack_ahme_root(vm::CellSlice& cs, int& n, Ref<Cell>& root, Ref<CellSlice>& extra) const {
+  return cs.fetch_ulong(1) == 1
+      && (n = m_) >= 0
+      && cs.fetch_ref_to(root)
+      && Y_.fetch_to(cs, extra);
+}
+
+bool HashmapAugE::cell_unpack(Ref<vm::Cell> cell_ref, HashmapAugE::Record_ahme_root& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool HashmapAugE::cell_unpack_ahme_root(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& root, Ref<CellSlice>& extra) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_ahme_root(cs, n, root, extra) && cs.empty_ext();
+}
+
+bool HashmapAugE::pack(vm::CellBuilder& cb, const HashmapAugE::Record_ahme_empty& data) const {
+  return cb.store_long_bool(0, 1)
+      && Y_.store_from(cb, data.extra);
+}
+
+bool HashmapAugE::pack_ahme_empty(vm::CellBuilder& cb, Ref<CellSlice> extra) const {
+  return cb.store_long_bool(0, 1)
+      && Y_.store_from(cb, extra);
+}
+
+bool HashmapAugE::cell_pack(Ref<vm::Cell>& cell_ref, const HashmapAugE::Record_ahme_empty& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapAugE::cell_pack_ahme_empty(Ref<vm::Cell>& cell_ref, Ref<CellSlice> extra) const {
+  vm::CellBuilder cb;
+  return pack_ahme_empty(cb, std::move(extra)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapAugE::pack(vm::CellBuilder& cb, const HashmapAugE::Record_ahme_root& data) const {
+  return cb.store_long_bool(1, 1)
+      && cb.store_ref_bool(data.root)
+      && Y_.store_from(cb, data.extra);
+}
+
+bool HashmapAugE::pack_ahme_root(vm::CellBuilder& cb, Ref<Cell> root, Ref<CellSlice> extra) const {
+  return cb.store_long_bool(1, 1)
+      && cb.store_ref_bool(root)
+      && Y_.store_from(cb, extra);
+}
+
+bool HashmapAugE::cell_pack(Ref<vm::Cell>& cell_ref, const HashmapAugE::Record_ahme_root& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapAugE::cell_pack_ahme_root(Ref<vm::Cell>& cell_ref, Ref<Cell> root, Ref<CellSlice> extra) const {
+  vm::CellBuilder cb;
+  return pack_ahme_root(cb, std::move(root), std::move(extra)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HashmapAugE::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case ahme_empty:
+    return cs.advance(1)
+        && pp.open("ahme_empty")
+        && pp.field("extra")
+        && Y_.print_skip(pp, cs)
+        && pp.close();
+  case ahme_root:
+    return cs.advance(1)
+        && pp.open("ahme_root")
+        && pp.field("root")
+        && HashmapAug{m_, X_, Y_}.print_ref(pp, cs.fetch_ref())
+        && pp.field("extra")
+        && Y_.print_skip(pp, cs)
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for HashmapAugE");
+}
+
+
+//
+// code for type `VarHashmap`
+//
+
+int VarHashmap::check_tag(const vm::CellSlice& cs) const {
+  return vhm_edge;
+}
+
+bool VarHashmap::skip(vm::CellSlice& cs) const {
+  int l, m;
+  return HmLabel{m_}.skip(cs, l)
+      && add_r1(m, l, m_)
+      && VarHashmapNode{m, X_}.skip(cs);
+}
+
+bool VarHashmap::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int l, m;
+  return HmLabel{m_}.validate_skip(cs, weak, l)
+      && add_r1(m, l, m_)
+      && VarHashmapNode{m, X_}.validate_skip(cs, weak);
+}
+
+bool VarHashmap::unpack(vm::CellSlice& cs, VarHashmap::Record& data) const {
+  return (data.n = m_) >= 0
+      && HmLabel{m_}.fetch_to(cs, data.label, data.l)
+      && add_r1(data.m, data.l, m_)
+      && VarHashmapNode{data.m, X_}.fetch_to(cs, data.node);
+}
+
+bool VarHashmap::cell_unpack(Ref<vm::Cell> cell_ref, VarHashmap::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool VarHashmap::pack(vm::CellBuilder& cb, const VarHashmap::Record& data) const {
+  int l, m;
+  return tlb::store_from(cb, HmLabel{m_}, data.label, l)
+      && add_r1(m, l, m_)
+      && VarHashmapNode{m, X_}.store_from(cb, data.node);
+}
+
+bool VarHashmap::cell_pack(Ref<vm::Cell>& cell_ref, const VarHashmap::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool VarHashmap::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int l, m;
+  return pp.open("vhm_edge")
+      && pp.field("label")
+      && HmLabel{m_}.print_skip(pp, cs, l)
+      && add_r1(m, l, m_)
+      && pp.field("node")
+      && VarHashmapNode{m, X_}.print_skip(pp, cs)
+      && pp.close();
+}
+
+
+//
+// code for type `VarHashmapNode`
+//
+constexpr char VarHashmapNode::cons_len[3];
+constexpr unsigned char VarHashmapNode::cons_tag[3];
+
+int VarHashmapNode::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case vhmn_leaf:
+    return cs.have(2) ? vhmn_leaf : -1;
+  case vhmn_fork:
+    return cs.have(2) ? vhmn_fork : -1;
+  case vhmn_cont:
+    return cs.have(1) ? vhmn_cont : -1;
+  }
+  return -1;
+}
+
+bool VarHashmapNode::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case vhmn_leaf:
+    return cs.advance(2)
+        && X_.skip(cs);
+  case vhmn_fork: {
+    int n;
+    return add_r1(n, 1, m_)
+        && cs.advance_ext(0x20002)
+        && Maybe{X_}.skip(cs);
+    }
+  case vhmn_cont: {
+    int n;
+    return add_r1(n, 1, m_)
+        && cs.advance_ext(0x10002)
+        && X_.skip(cs);
+    }
+  }
+  return false;
+}
+
+bool VarHashmapNode::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case vhmn_leaf:
+    return cs.advance(2)
+        && X_.validate_skip(cs, weak);
+  case vhmn_fork: {
+    int n;
+    return add_r1(n, 1, m_)
+        && cs.advance(2)
+        && VarHashmap{n, X_}.validate_skip_ref(cs, weak)
+        && VarHashmap{n, X_}.validate_skip_ref(cs, weak)
+        && Maybe{X_}.validate_skip(cs, weak);
+    }
+  case vhmn_cont: {
+    int n;
+    return add_r1(n, 1, m_)
+        && cs.advance(2)
+        && VarHashmap{n, X_}.validate_skip_ref(cs, weak)
+        && X_.validate_skip(cs, weak);
+    }
+  }
+  return false;
+}
+
+bool VarHashmapNode::unpack(vm::CellSlice& cs, VarHashmapNode::Record_vhmn_leaf& data) const {
+  return cs.fetch_ulong(2) == 0
+      && X_.fetch_to(cs, data.value);
+}
+
+bool VarHashmapNode::unpack_vhmn_leaf(vm::CellSlice& cs, Ref<CellSlice>& value) const {
+  return cs.fetch_ulong(2) == 0
+      && X_.fetch_to(cs, value);
+}
+
+bool VarHashmapNode::cell_unpack(Ref<vm::Cell> cell_ref, VarHashmapNode::Record_vhmn_leaf& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool VarHashmapNode::cell_unpack_vhmn_leaf(Ref<vm::Cell> cell_ref, Ref<CellSlice>& value) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_vhmn_leaf(cs, value) && cs.empty_ext();
+}
+
+bool VarHashmapNode::unpack(vm::CellSlice& cs, VarHashmapNode::Record_vhmn_fork& data) const {
+  return cs.fetch_ulong(2) == 1
+      && add_r1(data.n, 1, m_)
+      && cs.fetch_ref_to(data.left)
+      && cs.fetch_ref_to(data.right)
+      && Maybe{X_}.fetch_to(cs, data.value);
+}
+
+bool VarHashmapNode::cell_unpack(Ref<vm::Cell> cell_ref, VarHashmapNode::Record_vhmn_fork& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool VarHashmapNode::unpack(vm::CellSlice& cs, VarHashmapNode::Record_vhmn_cont& data) const {
+  return cs.fetch_ulong(1) == 1
+      && add_r1(data.n, 1, m_)
+      && cs.fetch_bool_to(data.branch)
+      && cs.fetch_ref_to(data.child)
+      && X_.fetch_to(cs, data.value);
+}
+
+bool VarHashmapNode::cell_unpack(Ref<vm::Cell> cell_ref, VarHashmapNode::Record_vhmn_cont& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool VarHashmapNode::pack(vm::CellBuilder& cb, const VarHashmapNode::Record_vhmn_leaf& data) const {
+  return cb.store_long_bool(0, 2)
+      && X_.store_from(cb, data.value);
+}
+
+bool VarHashmapNode::pack_vhmn_leaf(vm::CellBuilder& cb, Ref<CellSlice> value) const {
+  return cb.store_long_bool(0, 2)
+      && X_.store_from(cb, value);
+}
+
+bool VarHashmapNode::cell_pack(Ref<vm::Cell>& cell_ref, const VarHashmapNode::Record_vhmn_leaf& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool VarHashmapNode::cell_pack_vhmn_leaf(Ref<vm::Cell>& cell_ref, Ref<CellSlice> value) const {
+  vm::CellBuilder cb;
+  return pack_vhmn_leaf(cb, std::move(value)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool VarHashmapNode::pack(vm::CellBuilder& cb, const VarHashmapNode::Record_vhmn_fork& data) const {
+  int n;
+  return cb.store_long_bool(1, 2)
+      && add_r1(n, 1, m_)
+      && cb.store_ref_bool(data.left)
+      && cb.store_ref_bool(data.right)
+      && Maybe{X_}.store_from(cb, data.value);
+}
+
+bool VarHashmapNode::cell_pack(Ref<vm::Cell>& cell_ref, const VarHashmapNode::Record_vhmn_fork& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool VarHashmapNode::pack(vm::CellBuilder& cb, const VarHashmapNode::Record_vhmn_cont& data) const {
+  int n;
+  return cb.store_long_bool(1, 1)
+      && add_r1(n, 1, m_)
+      && cb.store_ulong_rchk_bool(data.branch, 1)
+      && cb.store_ref_bool(data.child)
+      && X_.store_from(cb, data.value);
+}
+
+bool VarHashmapNode::cell_pack(Ref<vm::Cell>& cell_ref, const VarHashmapNode::Record_vhmn_cont& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool VarHashmapNode::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case vhmn_leaf:
+    return cs.advance(2)
+        && pp.open("vhmn_leaf")
+        && pp.field("value")
+        && X_.print_skip(pp, cs)
+        && pp.close();
+  case vhmn_fork: {
+    int n;
+    return cs.advance(2)
+        && pp.open("vhmn_fork")
+        && add_r1(n, 1, m_)
+        && pp.field("left")
+        && VarHashmap{n, X_}.print_ref(pp, cs.fetch_ref())
+        && pp.field("right")
+        && VarHashmap{n, X_}.print_ref(pp, cs.fetch_ref())
+        && pp.field("value")
+        && Maybe{X_}.print_skip(pp, cs)
+        && pp.close();
+    }
+  case vhmn_cont: {
+    int n;
+    return cs.advance(1)
+        && pp.open("vhmn_cont")
+        && add_r1(n, 1, m_)
+        && pp.fetch_uint_field(cs, 1, "branch")
+        && pp.field("child")
+        && VarHashmap{n, X_}.print_ref(pp, cs.fetch_ref())
+        && pp.field("value")
+        && X_.print_skip(pp, cs)
+        && pp.close();
+    }
+  }
+  return pp.fail("unknown constructor for VarHashmapNode");
+}
+
+
+//
+// code for type `VarHashmapE`
+//
+
+int VarHashmapE::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case vhme_empty:
+    return cs.have(1) ? vhme_empty : -1;
+  case vhme_root:
+    return cs.have(1) ? vhme_root : -1;
+  }
+  return -1;
+}
+
+bool VarHashmapE::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case vhme_empty:
+    return cs.advance(1);
+  case vhme_root:
+    return cs.advance_ext(0x10001);
+  }
+  return false;
+}
+
+bool VarHashmapE::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case vhme_empty:
+    return cs.advance(1);
+  case vhme_root:
+    return cs.advance(1)
+        && VarHashmap{m_, X_}.validate_skip_ref(cs, weak);
+  }
+  return false;
+}
+
+bool VarHashmapE::unpack(vm::CellSlice& cs, VarHashmapE::Record_vhme_empty& data) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool VarHashmapE::unpack_vhme_empty(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool VarHashmapE::cell_unpack(Ref<vm::Cell> cell_ref, VarHashmapE::Record_vhme_empty& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool VarHashmapE::cell_unpack_vhme_empty(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_vhme_empty(cs) && cs.empty_ext();
+}
+
+bool VarHashmapE::unpack(vm::CellSlice& cs, VarHashmapE::Record_vhme_root& data) const {
+  return cs.fetch_ulong(1) == 1
+      && (data.n = m_) >= 0
+      && cs.fetch_ref_to(data.root);
+}
+
+bool VarHashmapE::unpack_vhme_root(vm::CellSlice& cs, int& n, Ref<Cell>& root) const {
+  return cs.fetch_ulong(1) == 1
+      && (n = m_) >= 0
+      && cs.fetch_ref_to(root);
+}
+
+bool VarHashmapE::cell_unpack(Ref<vm::Cell> cell_ref, VarHashmapE::Record_vhme_root& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool VarHashmapE::cell_unpack_vhme_root(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& root) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_vhme_root(cs, n, root) && cs.empty_ext();
+}
+
+bool VarHashmapE::pack(vm::CellBuilder& cb, const VarHashmapE::Record_vhme_empty& data) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool VarHashmapE::pack_vhme_empty(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool VarHashmapE::cell_pack(Ref<vm::Cell>& cell_ref, const VarHashmapE::Record_vhme_empty& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool VarHashmapE::cell_pack_vhme_empty(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_vhme_empty(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool VarHashmapE::pack(vm::CellBuilder& cb, const VarHashmapE::Record_vhme_root& data) const {
+  return cb.store_long_bool(1, 1)
+      && cb.store_ref_bool(data.root);
+}
+
+bool VarHashmapE::pack_vhme_root(vm::CellBuilder& cb, Ref<Cell> root) const {
+  return cb.store_long_bool(1, 1)
+      && cb.store_ref_bool(root);
+}
+
+bool VarHashmapE::cell_pack(Ref<vm::Cell>& cell_ref, const VarHashmapE::Record_vhme_root& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool VarHashmapE::cell_pack_vhme_root(Ref<vm::Cell>& cell_ref, Ref<Cell> root) const {
+  vm::CellBuilder cb;
+  return pack_vhme_root(cb, std::move(root)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool VarHashmapE::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case vhme_empty:
+    return cs.advance(1)
+        && pp.cons("vhme_empty");
+  case vhme_root:
+    return cs.advance(1)
+        && pp.open("vhme_root")
+        && pp.field("root")
+        && VarHashmap{m_, X_}.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for VarHashmapE");
+}
+
+
+//
+// code for type `PfxHashmap`
+//
+
+int PfxHashmap::check_tag(const vm::CellSlice& cs) const {
+  return phm_edge;
+}
+
+bool PfxHashmap::skip(vm::CellSlice& cs) const {
+  int l, m;
+  return HmLabel{m_}.skip(cs, l)
+      && add_r1(m, l, m_)
+      && PfxHashmapNode{m, X_}.skip(cs);
+}
+
+bool PfxHashmap::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int l, m;
+  return HmLabel{m_}.validate_skip(cs, weak, l)
+      && add_r1(m, l, m_)
+      && PfxHashmapNode{m, X_}.validate_skip(cs, weak);
+}
+
+bool PfxHashmap::unpack(vm::CellSlice& cs, PfxHashmap::Record& data) const {
+  return (data.n = m_) >= 0
+      && HmLabel{m_}.fetch_to(cs, data.label, data.l)
+      && add_r1(data.m, data.l, m_)
+      && PfxHashmapNode{data.m, X_}.fetch_to(cs, data.node);
+}
+
+bool PfxHashmap::cell_unpack(Ref<vm::Cell> cell_ref, PfxHashmap::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool PfxHashmap::pack(vm::CellBuilder& cb, const PfxHashmap::Record& data) const {
+  int l, m;
+  return tlb::store_from(cb, HmLabel{m_}, data.label, l)
+      && add_r1(m, l, m_)
+      && PfxHashmapNode{m, X_}.store_from(cb, data.node);
+}
+
+bool PfxHashmap::cell_pack(Ref<vm::Cell>& cell_ref, const PfxHashmap::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool PfxHashmap::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int l, m;
+  return pp.open("phm_edge")
+      && pp.field("label")
+      && HmLabel{m_}.print_skip(pp, cs, l)
+      && add_r1(m, l, m_)
+      && pp.field("node")
+      && PfxHashmapNode{m, X_}.print_skip(pp, cs)
+      && pp.close();
+}
+
+
+//
+// code for type `PfxHashmapNode`
+//
+
+int PfxHashmapNode::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case phmn_leaf:
+    return cs.have(1) ? phmn_leaf : -1;
+  case phmn_fork:
+    return cs.have(1) ? phmn_fork : -1;
+  }
+  return -1;
+}
+
+bool PfxHashmapNode::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case phmn_leaf:
+    return cs.advance(1)
+        && X_.skip(cs);
+  case phmn_fork: {
+    int n;
+    return add_r1(n, 1, m_)
+        && cs.advance_ext(0x20001);
+    }
+  }
+  return false;
+}
+
+bool PfxHashmapNode::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case phmn_leaf:
+    return cs.advance(1)
+        && X_.validate_skip(cs, weak);
+  case phmn_fork: {
+    int n;
+    return add_r1(n, 1, m_)
+        && cs.advance(1)
+        && PfxHashmap{n, X_}.validate_skip_ref(cs, weak)
+        && PfxHashmap{n, X_}.validate_skip_ref(cs, weak);
+    }
+  }
+  return false;
+}
+
+bool PfxHashmapNode::unpack(vm::CellSlice& cs, PfxHashmapNode::Record_phmn_leaf& data) const {
+  return cs.fetch_ulong(1) == 0
+      && X_.fetch_to(cs, data.value);
+}
+
+bool PfxHashmapNode::unpack_phmn_leaf(vm::CellSlice& cs, Ref<CellSlice>& value) const {
+  return cs.fetch_ulong(1) == 0
+      && X_.fetch_to(cs, value);
+}
+
+bool PfxHashmapNode::cell_unpack(Ref<vm::Cell> cell_ref, PfxHashmapNode::Record_phmn_leaf& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool PfxHashmapNode::cell_unpack_phmn_leaf(Ref<vm::Cell> cell_ref, Ref<CellSlice>& value) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_phmn_leaf(cs, value) && cs.empty_ext();
+}
+
+bool PfxHashmapNode::unpack(vm::CellSlice& cs, PfxHashmapNode::Record_phmn_fork& data) const {
+  return cs.fetch_ulong(1) == 1
+      && add_r1(data.n, 1, m_)
+      && cs.fetch_ref_to(data.left)
+      && cs.fetch_ref_to(data.right);
+}
+
+bool PfxHashmapNode::unpack_phmn_fork(vm::CellSlice& cs, int& n, Ref<Cell>& left, Ref<Cell>& right) const {
+  return cs.fetch_ulong(1) == 1
+      && add_r1(n, 1, m_)
+      && cs.fetch_ref_to(left)
+      && cs.fetch_ref_to(right);
+}
+
+bool PfxHashmapNode::cell_unpack(Ref<vm::Cell> cell_ref, PfxHashmapNode::Record_phmn_fork& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool PfxHashmapNode::cell_unpack_phmn_fork(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& left, Ref<Cell>& right) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_phmn_fork(cs, n, left, right) && cs.empty_ext();
+}
+
+bool PfxHashmapNode::pack(vm::CellBuilder& cb, const PfxHashmapNode::Record_phmn_leaf& data) const {
+  return cb.store_long_bool(0, 1)
+      && X_.store_from(cb, data.value);
+}
+
+bool PfxHashmapNode::pack_phmn_leaf(vm::CellBuilder& cb, Ref<CellSlice> value) const {
+  return cb.store_long_bool(0, 1)
+      && X_.store_from(cb, value);
+}
+
+bool PfxHashmapNode::cell_pack(Ref<vm::Cell>& cell_ref, const PfxHashmapNode::Record_phmn_leaf& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool PfxHashmapNode::cell_pack_phmn_leaf(Ref<vm::Cell>& cell_ref, Ref<CellSlice> value) const {
+  vm::CellBuilder cb;
+  return pack_phmn_leaf(cb, std::move(value)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool PfxHashmapNode::pack(vm::CellBuilder& cb, const PfxHashmapNode::Record_phmn_fork& data) const {
+  int n;
+  return cb.store_long_bool(1, 1)
+      && add_r1(n, 1, m_)
+      && cb.store_ref_bool(data.left)
+      && cb.store_ref_bool(data.right);
+}
+
+bool PfxHashmapNode::pack_phmn_fork(vm::CellBuilder& cb, Ref<Cell> left, Ref<Cell> right) const {
+  int n;
+  return cb.store_long_bool(1, 1)
+      && add_r1(n, 1, m_)
+      && cb.store_ref_bool(left)
+      && cb.store_ref_bool(right);
+}
+
+bool PfxHashmapNode::cell_pack(Ref<vm::Cell>& cell_ref, const PfxHashmapNode::Record_phmn_fork& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool PfxHashmapNode::cell_pack_phmn_fork(Ref<vm::Cell>& cell_ref, Ref<Cell> left, Ref<Cell> right) const {
+  vm::CellBuilder cb;
+  return pack_phmn_fork(cb, std::move(left), std::move(right)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool PfxHashmapNode::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case phmn_leaf:
+    return cs.advance(1)
+        && pp.open("phmn_leaf")
+        && pp.field("value")
+        && X_.print_skip(pp, cs)
+        && pp.close();
+  case phmn_fork: {
+    int n;
+    return cs.advance(1)
+        && pp.open("phmn_fork")
+        && add_r1(n, 1, m_)
+        && pp.field("left")
+        && PfxHashmap{n, X_}.print_ref(pp, cs.fetch_ref())
+        && pp.field("right")
+        && PfxHashmap{n, X_}.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+    }
+  }
+  return pp.fail("unknown constructor for PfxHashmapNode");
+}
+
+
+//
+// code for type `PfxHashmapE`
+//
+
+int PfxHashmapE::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case phme_empty:
+    return cs.have(1) ? phme_empty : -1;
+  case phme_root:
+    return cs.have(1) ? phme_root : -1;
+  }
+  return -1;
+}
+
+bool PfxHashmapE::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case phme_empty:
+    return cs.advance(1);
+  case phme_root:
+    return cs.advance_ext(0x10001);
+  }
+  return false;
+}
+
+bool PfxHashmapE::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case phme_empty:
+    return cs.advance(1);
+  case phme_root:
+    return cs.advance(1)
+        && PfxHashmap{m_, X_}.validate_skip_ref(cs, weak);
+  }
+  return false;
+}
+
+bool PfxHashmapE::unpack(vm::CellSlice& cs, PfxHashmapE::Record_phme_empty& data) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool PfxHashmapE::unpack_phme_empty(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool PfxHashmapE::cell_unpack(Ref<vm::Cell> cell_ref, PfxHashmapE::Record_phme_empty& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool PfxHashmapE::cell_unpack_phme_empty(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_phme_empty(cs) && cs.empty_ext();
+}
+
+bool PfxHashmapE::unpack(vm::CellSlice& cs, PfxHashmapE::Record_phme_root& data) const {
+  return cs.fetch_ulong(1) == 1
+      && (data.n = m_) >= 0
+      && cs.fetch_ref_to(data.root);
+}
+
+bool PfxHashmapE::unpack_phme_root(vm::CellSlice& cs, int& n, Ref<Cell>& root) const {
+  return cs.fetch_ulong(1) == 1
+      && (n = m_) >= 0
+      && cs.fetch_ref_to(root);
+}
+
+bool PfxHashmapE::cell_unpack(Ref<vm::Cell> cell_ref, PfxHashmapE::Record_phme_root& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool PfxHashmapE::cell_unpack_phme_root(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& root) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_phme_root(cs, n, root) && cs.empty_ext();
+}
+
+bool PfxHashmapE::pack(vm::CellBuilder& cb, const PfxHashmapE::Record_phme_empty& data) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool PfxHashmapE::pack_phme_empty(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool PfxHashmapE::cell_pack(Ref<vm::Cell>& cell_ref, const PfxHashmapE::Record_phme_empty& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool PfxHashmapE::cell_pack_phme_empty(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_phme_empty(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool PfxHashmapE::pack(vm::CellBuilder& cb, const PfxHashmapE::Record_phme_root& data) const {
+  return cb.store_long_bool(1, 1)
+      && cb.store_ref_bool(data.root);
+}
+
+bool PfxHashmapE::pack_phme_root(vm::CellBuilder& cb, Ref<Cell> root) const {
+  return cb.store_long_bool(1, 1)
+      && cb.store_ref_bool(root);
+}
+
+bool PfxHashmapE::cell_pack(Ref<vm::Cell>& cell_ref, const PfxHashmapE::Record_phme_root& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool PfxHashmapE::cell_pack_phme_root(Ref<vm::Cell>& cell_ref, Ref<Cell> root) const {
+  vm::CellBuilder cb;
+  return pack_phme_root(cb, std::move(root)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool PfxHashmapE::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case phme_empty:
+    return cs.advance(1)
+        && pp.cons("phme_empty");
+  case phme_root:
+    return cs.advance(1)
+        && pp.open("phme_root")
+        && pp.field("root")
+        && PfxHashmap{m_, X_}.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for PfxHashmapE");
+}
+
+
+//
+// code for type `MsgAddressExt`
+//
+
+int MsgAddressExt::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case addr_none:
+    return cs.have(2) ? addr_none : -1;
+  case addr_extern:
+    return cs.prefetch_ulong(2) == 1 ? addr_extern : -1;
+  }
+  return -1;
+}
+
+bool MsgAddressExt::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case addr_none:
+    return cs.advance(2);
+  case addr_extern: {
+    int len;
+    return cs.advance(2)
+        && cs.fetch_uint_to(9, len)
+        && cs.advance(len);
+    }
+  }
+  return false;
+}
+
+bool MsgAddressExt::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case addr_none:
+    return cs.advance(2);
+  case addr_extern: {
+    int len;
+    return cs.fetch_ulong(2) == 1
+        && cs.fetch_uint_to(9, len)
+        && cs.advance(len);
+    }
+  }
+  return false;
+}
+
+bool MsgAddressExt::unpack(vm::CellSlice& cs, MsgAddressExt::Record_addr_none& data) const {
+  return cs.fetch_ulong(2) == 0;
+}
+
+bool MsgAddressExt::unpack_addr_none(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(2) == 0;
+}
+
+bool MsgAddressExt::cell_unpack(Ref<vm::Cell> cell_ref, MsgAddressExt::Record_addr_none& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool MsgAddressExt::cell_unpack_addr_none(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_addr_none(cs) && cs.empty_ext();
+}
+
+bool MsgAddressExt::unpack(vm::CellSlice& cs, MsgAddressExt::Record_addr_extern& data) const {
+  return cs.fetch_ulong(2) == 1
+      && cs.fetch_uint_to(9, data.len)
+      && cs.fetch_bitstring_to(data.len, data.external_address);
+}
+
+bool MsgAddressExt::unpack_addr_extern(vm::CellSlice& cs, int& len, Ref<td::BitString>& external_address) const {
+  return cs.fetch_ulong(2) == 1
+      && cs.fetch_uint_to(9, len)
+      && cs.fetch_bitstring_to(len, external_address);
+}
+
+bool MsgAddressExt::cell_unpack(Ref<vm::Cell> cell_ref, MsgAddressExt::Record_addr_extern& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool MsgAddressExt::cell_unpack_addr_extern(Ref<vm::Cell> cell_ref, int& len, Ref<td::BitString>& external_address) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_addr_extern(cs, len, external_address) && cs.empty_ext();
+}
+
+bool MsgAddressExt::pack(vm::CellBuilder& cb, const MsgAddressExt::Record_addr_none& data) const {
+  return cb.store_long_bool(0, 2);
+}
+
+bool MsgAddressExt::pack_addr_none(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 2);
+}
+
+bool MsgAddressExt::cell_pack(Ref<vm::Cell>& cell_ref, const MsgAddressExt::Record_addr_none& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MsgAddressExt::cell_pack_addr_none(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_addr_none(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MsgAddressExt::pack(vm::CellBuilder& cb, const MsgAddressExt::Record_addr_extern& data) const {
+  return cb.store_long_bool(1, 2)
+      && cb.store_ulong_rchk_bool(data.len, 9)
+      && cb.append_bitstring_chk(data.external_address, data.len);
+}
+
+bool MsgAddressExt::pack_addr_extern(vm::CellBuilder& cb, int len, Ref<td::BitString> external_address) const {
+  return cb.store_long_bool(1, 2)
+      && cb.store_ulong_rchk_bool(len, 9)
+      && cb.append_bitstring_chk(external_address, len);
+}
+
+bool MsgAddressExt::cell_pack(Ref<vm::Cell>& cell_ref, const MsgAddressExt::Record_addr_extern& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MsgAddressExt::cell_pack_addr_extern(Ref<vm::Cell>& cell_ref, int len, Ref<td::BitString> external_address) const {
+  vm::CellBuilder cb;
+  return pack_addr_extern(cb, len, std::move(external_address)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MsgAddressExt::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case addr_none:
+    return cs.advance(2)
+        && pp.cons("addr_none");
+  case addr_extern: {
+    int len;
+    return cs.fetch_ulong(2) == 1
+        && pp.open("addr_extern")
+        && cs.fetch_uint_to(9, len)
+        && pp.field_int(len, "len")
+        && pp.fetch_bits_field(cs, len, "external_address")
+        && pp.close();
+    }
+  }
+  return pp.fail("unknown constructor for MsgAddressExt");
+}
+
+const MsgAddressExt t_MsgAddressExt;
+
+//
+// code for type `Anycast`
+//
+
+int Anycast::check_tag(const vm::CellSlice& cs) const {
+  return anycast_info;
+}
+
+bool Anycast::skip(vm::CellSlice& cs) const {
+  int depth;
+  return cs.fetch_uint_leq(30, depth)
+      && 1 <= depth
+      && cs.advance(depth);
+}
+
+bool Anycast::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int depth;
+  return cs.fetch_uint_leq(30, depth)
+      && 1 <= depth
+      && cs.advance(depth);
+}
+
+bool Anycast::unpack(vm::CellSlice& cs, Anycast::Record& data) const {
+  return cs.fetch_uint_leq(30, data.depth)
+      && 1 <= data.depth
+      && cs.fetch_bitstring_to(data.depth, data.rewrite_pfx);
+}
+
+bool Anycast::unpack_anycast_info(vm::CellSlice& cs, int& depth, Ref<td::BitString>& rewrite_pfx) const {
+  return cs.fetch_uint_leq(30, depth)
+      && 1 <= depth
+      && cs.fetch_bitstring_to(depth, rewrite_pfx);
+}
+
+bool Anycast::cell_unpack(Ref<vm::Cell> cell_ref, Anycast::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Anycast::cell_unpack_anycast_info(Ref<vm::Cell> cell_ref, int& depth, Ref<td::BitString>& rewrite_pfx) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_anycast_info(cs, depth, rewrite_pfx) && cs.empty_ext();
+}
+
+bool Anycast::pack(vm::CellBuilder& cb, const Anycast::Record& data) const {
+  return cb.store_uint_leq(30, data.depth)
+      && 1 <= data.depth
+      && cb.append_bitstring_chk(data.rewrite_pfx, data.depth);
+}
+
+bool Anycast::pack_anycast_info(vm::CellBuilder& cb, int depth, Ref<td::BitString> rewrite_pfx) const {
+  return cb.store_uint_leq(30, depth)
+      && 1 <= depth
+      && cb.append_bitstring_chk(rewrite_pfx, depth);
+}
+
+bool Anycast::cell_pack(Ref<vm::Cell>& cell_ref, const Anycast::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Anycast::cell_pack_anycast_info(Ref<vm::Cell>& cell_ref, int depth, Ref<td::BitString> rewrite_pfx) const {
+  vm::CellBuilder cb;
+  return pack_anycast_info(cb, depth, std::move(rewrite_pfx)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Anycast::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int depth;
+  return pp.open("anycast_info")
+      && cs.fetch_uint_leq(30, depth)
+      && pp.field_int(depth, "depth")
+      && 1 <= depth
+      && pp.fetch_bits_field(cs, depth, "rewrite_pfx")
+      && pp.close();
+}
+
+const Anycast t_Anycast;
+
+//
+// code for type `MsgAddressInt`
+//
+constexpr unsigned char MsgAddressInt::cons_tag[2];
+
+int MsgAddressInt::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case addr_std:
+    return cs.have(2) ? addr_std : -1;
+  case addr_var:
+    return cs.have(2) ? addr_var : -1;
+  }
+  return -1;
+}
+
+bool MsgAddressInt::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case addr_std:
+    return cs.advance(2)
+        && t_Maybe_Anycast.skip(cs)
+        && cs.advance(264);
+  case addr_var: {
+    int addr_len;
+    return cs.advance(2)
+        && t_Maybe_Anycast.skip(cs)
+        && cs.fetch_uint_to(9, addr_len)
+        && cs.advance(32)
+        && cs.advance(addr_len);
+    }
+  }
+  return false;
+}
+
+bool MsgAddressInt::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case addr_std:
+    return cs.advance(2)
+        && t_Maybe_Anycast.validate_skip(cs, weak)
+        && cs.advance(264);
+  case addr_var: {
+    int addr_len;
+    return cs.advance(2)
+        && t_Maybe_Anycast.validate_skip(cs, weak)
+        && cs.fetch_uint_to(9, addr_len)
+        && cs.advance(32)
+        && cs.advance(addr_len);
+    }
+  }
+  return false;
+}
+
+bool MsgAddressInt::unpack(vm::CellSlice& cs, MsgAddressInt::Record_addr_std& data) const {
+  return cs.fetch_ulong(2) == 2
+      && t_Maybe_Anycast.fetch_to(cs, data.anycast)
+      && cs.fetch_int_to(8, data.workchain_id)
+      && cs.fetch_bits_to(data.address.bits(), 256);
+}
+
+bool MsgAddressInt::unpack_addr_std(vm::CellSlice& cs, Ref<CellSlice>& anycast, int& workchain_id, td::BitArray<256>& address) const {
+  return cs.fetch_ulong(2) == 2
+      && t_Maybe_Anycast.fetch_to(cs, anycast)
+      && cs.fetch_int_to(8, workchain_id)
+      && cs.fetch_bits_to(address.bits(), 256);
+}
+
+bool MsgAddressInt::cell_unpack(Ref<vm::Cell> cell_ref, MsgAddressInt::Record_addr_std& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool MsgAddressInt::cell_unpack_addr_std(Ref<vm::Cell> cell_ref, Ref<CellSlice>& anycast, int& workchain_id, td::BitArray<256>& address) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_addr_std(cs, anycast, workchain_id, address) && cs.empty_ext();
+}
+
+bool MsgAddressInt::unpack(vm::CellSlice& cs, MsgAddressInt::Record_addr_var& data) const {
+  return cs.fetch_ulong(2) == 3
+      && t_Maybe_Anycast.fetch_to(cs, data.anycast)
+      && cs.fetch_uint_to(9, data.addr_len)
+      && cs.fetch_int_to(32, data.workchain_id)
+      && cs.fetch_bitstring_to(data.addr_len, data.address);
+}
+
+bool MsgAddressInt::cell_unpack(Ref<vm::Cell> cell_ref, MsgAddressInt::Record_addr_var& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool MsgAddressInt::pack(vm::CellBuilder& cb, const MsgAddressInt::Record_addr_std& data) const {
+  return cb.store_long_bool(2, 2)
+      && t_Maybe_Anycast.store_from(cb, data.anycast)
+      && cb.store_long_rchk_bool(data.workchain_id, 8)
+      && cb.store_bits_bool(data.address.cbits(), 256);
+}
+
+bool MsgAddressInt::pack_addr_std(vm::CellBuilder& cb, Ref<CellSlice> anycast, int workchain_id, td::BitArray<256> address) const {
+  return cb.store_long_bool(2, 2)
+      && t_Maybe_Anycast.store_from(cb, anycast)
+      && cb.store_long_rchk_bool(workchain_id, 8)
+      && cb.store_bits_bool(address.cbits(), 256);
+}
+
+bool MsgAddressInt::cell_pack(Ref<vm::Cell>& cell_ref, const MsgAddressInt::Record_addr_std& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MsgAddressInt::cell_pack_addr_std(Ref<vm::Cell>& cell_ref, Ref<CellSlice> anycast, int workchain_id, td::BitArray<256> address) const {
+  vm::CellBuilder cb;
+  return pack_addr_std(cb, std::move(anycast), workchain_id, address) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MsgAddressInt::pack(vm::CellBuilder& cb, const MsgAddressInt::Record_addr_var& data) const {
+  return cb.store_long_bool(3, 2)
+      && t_Maybe_Anycast.store_from(cb, data.anycast)
+      && cb.store_ulong_rchk_bool(data.addr_len, 9)
+      && cb.store_long_rchk_bool(data.workchain_id, 32)
+      && cb.append_bitstring_chk(data.address, data.addr_len);
+}
+
+bool MsgAddressInt::cell_pack(Ref<vm::Cell>& cell_ref, const MsgAddressInt::Record_addr_var& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MsgAddressInt::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case addr_std:
+    return cs.advance(2)
+        && pp.open("addr_std")
+        && pp.field("anycast")
+        && t_Maybe_Anycast.print_skip(pp, cs)
+        && pp.fetch_int_field(cs, 8, "workchain_id")
+        && pp.fetch_bits_field(cs, 256, "address")
+        && pp.close();
+  case addr_var: {
+    int addr_len;
+    return cs.advance(2)
+        && pp.open("addr_var")
+        && pp.field("anycast")
+        && t_Maybe_Anycast.print_skip(pp, cs)
+        && cs.fetch_uint_to(9, addr_len)
+        && pp.field_int(addr_len, "addr_len")
+        && pp.fetch_int_field(cs, 32, "workchain_id")
+        && pp.fetch_bits_field(cs, addr_len, "address")
+        && pp.close();
+    }
+  }
+  return pp.fail("unknown constructor for MsgAddressInt");
+}
+
+const MsgAddressInt t_MsgAddressInt;
+
+//
+// code for type `MsgAddress`
+//
+
+int MsgAddress::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cons1:
+    return cons1;
+  case cons2:
+    return cons2;
+  }
+  return -1;
+}
+
+bool MsgAddress::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cons1:
+    return t_MsgAddressInt.skip(cs);
+  case cons2:
+    return t_MsgAddressExt.skip(cs);
+  }
+  return false;
+}
+
+bool MsgAddress::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case cons1:
+    return t_MsgAddressInt.validate_skip(cs, weak);
+  case cons2:
+    return t_MsgAddressExt.validate_skip(cs, weak);
+  }
+  return false;
+}
+
+bool MsgAddress::unpack(vm::CellSlice& cs, MsgAddress::Record_cons1& data) const {
+  return t_MsgAddressInt.fetch_to(cs, data.x);
+}
+
+bool MsgAddress::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_MsgAddressInt.fetch_to(cs, x);
+}
+
+bool MsgAddress::cell_unpack(Ref<vm::Cell> cell_ref, MsgAddress::Record_cons1& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool MsgAddress::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, x) && cs.empty_ext();
+}
+
+bool MsgAddress::unpack(vm::CellSlice& cs, MsgAddress::Record_cons2& data) const {
+  return t_MsgAddressExt.fetch_to(cs, data.x);
+}
+
+bool MsgAddress::unpack_cons2(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_MsgAddressExt.fetch_to(cs, x);
+}
+
+bool MsgAddress::cell_unpack(Ref<vm::Cell> cell_ref, MsgAddress::Record_cons2& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool MsgAddress::cell_unpack_cons2(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons2(cs, x) && cs.empty_ext();
+}
+
+bool MsgAddress::pack(vm::CellBuilder& cb, const MsgAddress::Record_cons1& data) const {
+  return t_MsgAddressInt.store_from(cb, data.x);
+}
+
+bool MsgAddress::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_MsgAddressInt.store_from(cb, x);
+}
+
+bool MsgAddress::cell_pack(Ref<vm::Cell>& cell_ref, const MsgAddress::Record_cons1& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MsgAddress::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MsgAddress::pack(vm::CellBuilder& cb, const MsgAddress::Record_cons2& data) const {
+  return t_MsgAddressExt.store_from(cb, data.x);
+}
+
+bool MsgAddress::pack_cons2(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_MsgAddressExt.store_from(cb, x);
+}
+
+bool MsgAddress::cell_pack(Ref<vm::Cell>& cell_ref, const MsgAddress::Record_cons2& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MsgAddress::cell_pack_cons2(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons2(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MsgAddress::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cons1:
+    return pp.open()
+        && pp.field()
+        && t_MsgAddressInt.print_skip(pp, cs)
+        && pp.close();
+  case cons2:
+    return pp.open()
+        && pp.field()
+        && t_MsgAddressExt.print_skip(pp, cs)
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for MsgAddress");
+}
+
+const MsgAddress t_MsgAddress;
+
+//
+// code for type `VarUInteger`
+//
+
+int VarUInteger::check_tag(const vm::CellSlice& cs) const {
+  return var_uint;
+}
+
+bool VarUInteger::skip(vm::CellSlice& cs) const {
+  int len;
+  return cs.fetch_uint_less(m_, len)
+      && cs.advance(8 * len);
+}
+
+bool VarUInteger::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int len;
+  return cs.fetch_uint_less(m_, len)
+      && cs.advance(8 * len);
+}
+
+bool VarUInteger::unpack(vm::CellSlice& cs, VarUInteger::Record& data) const {
+  return (data.n = m_) >= 0
+      && cs.fetch_uint_less(m_, data.len)
+      && cs.fetch_uint256_to(8 * data.len, data.value);
+}
+
+bool VarUInteger::unpack_var_uint(vm::CellSlice& cs, int& n, int& len, RefInt256& value) const {
+  return (n = m_) >= 0
+      && cs.fetch_uint_less(m_, len)
+      && cs.fetch_uint256_to(8 * len, value);
+}
+
+bool VarUInteger::cell_unpack(Ref<vm::Cell> cell_ref, VarUInteger::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool VarUInteger::cell_unpack_var_uint(Ref<vm::Cell> cell_ref, int& n, int& len, RefInt256& value) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_var_uint(cs, n, len, value) && cs.empty_ext();
+}
+
+bool VarUInteger::pack(vm::CellBuilder& cb, const VarUInteger::Record& data) const {
+  return cb.store_uint_less(m_, data.len)
+      && cb.store_int256_bool(data.value, 8 * data.len, false);
+}
+
+bool VarUInteger::pack_var_uint(vm::CellBuilder& cb, int len, RefInt256 value) const {
+  return cb.store_uint_less(m_, len)
+      && cb.store_int256_bool(value, 8 * len, false);
+}
+
+bool VarUInteger::cell_pack(Ref<vm::Cell>& cell_ref, const VarUInteger::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool VarUInteger::cell_pack_var_uint(Ref<vm::Cell>& cell_ref, int len, RefInt256 value) const {
+  vm::CellBuilder cb;
+  return pack_var_uint(cb, len, std::move(value)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool VarUInteger::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int len;
+  return pp.open("var_uint")
+      && cs.fetch_uint_less(m_, len)
+      && pp.field_int(len, "len")
+      && pp.fetch_uint256_field(cs, 8 * len, "value")
+      && pp.close();
+}
+
+
+//
+// code for type `VarInteger`
+//
+
+int VarInteger::check_tag(const vm::CellSlice& cs) const {
+  return var_int;
+}
+
+bool VarInteger::skip(vm::CellSlice& cs) const {
+  int len;
+  return cs.fetch_uint_less(m_, len)
+      && cs.advance(8 * len);
+}
+
+bool VarInteger::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int len;
+  return cs.fetch_uint_less(m_, len)
+      && cs.advance(8 * len);
+}
+
+bool VarInteger::unpack(vm::CellSlice& cs, VarInteger::Record& data) const {
+  return (data.n = m_) >= 0
+      && cs.fetch_uint_less(m_, data.len)
+      && cs.fetch_int256_to(8 * data.len, data.value);
+}
+
+bool VarInteger::unpack_var_int(vm::CellSlice& cs, int& n, int& len, RefInt256& value) const {
+  return (n = m_) >= 0
+      && cs.fetch_uint_less(m_, len)
+      && cs.fetch_int256_to(8 * len, value);
+}
+
+bool VarInteger::cell_unpack(Ref<vm::Cell> cell_ref, VarInteger::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool VarInteger::cell_unpack_var_int(Ref<vm::Cell> cell_ref, int& n, int& len, RefInt256& value) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_var_int(cs, n, len, value) && cs.empty_ext();
+}
+
+bool VarInteger::pack(vm::CellBuilder& cb, const VarInteger::Record& data) const {
+  return cb.store_uint_less(m_, data.len)
+      && cb.store_int256_bool(data.value, 8 * data.len);
+}
+
+bool VarInteger::pack_var_int(vm::CellBuilder& cb, int len, RefInt256 value) const {
+  return cb.store_uint_less(m_, len)
+      && cb.store_int256_bool(value, 8 * len);
+}
+
+bool VarInteger::cell_pack(Ref<vm::Cell>& cell_ref, const VarInteger::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool VarInteger::cell_pack_var_int(Ref<vm::Cell>& cell_ref, int len, RefInt256 value) const {
+  vm::CellBuilder cb;
+  return pack_var_int(cb, len, std::move(value)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool VarInteger::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int len;
+  return pp.open("var_int")
+      && cs.fetch_uint_less(m_, len)
+      && pp.field_int(len, "len")
+      && pp.fetch_int256_field(cs, 8 * len, "value")
+      && pp.close();
+}
+
+
+//
+// code for type `Grams`
+//
+
+int Grams::check_tag(const vm::CellSlice& cs) const {
+  return nanograms;
+}
+
+bool Grams::skip(vm::CellSlice& cs) const {
+  return t_VarUInteger_16.skip(cs);
+}
+
+bool Grams::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_VarUInteger_16.validate_skip(cs, weak);
+}
+
+bool Grams::unpack(vm::CellSlice& cs, Grams::Record& data) const {
+  return t_VarUInteger_16.fetch_to(cs, data.amount);
+}
+
+bool Grams::unpack_nanograms(vm::CellSlice& cs, Ref<CellSlice>& amount) const {
+  return t_VarUInteger_16.fetch_to(cs, amount);
+}
+
+bool Grams::cell_unpack(Ref<vm::Cell> cell_ref, Grams::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Grams::cell_unpack_nanograms(Ref<vm::Cell> cell_ref, Ref<CellSlice>& amount) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_nanograms(cs, amount) && cs.empty_ext();
+}
+
+bool Grams::pack(vm::CellBuilder& cb, const Grams::Record& data) const {
+  return t_VarUInteger_16.store_from(cb, data.amount);
+}
+
+bool Grams::pack_nanograms(vm::CellBuilder& cb, Ref<CellSlice> amount) const {
+  return t_VarUInteger_16.store_from(cb, amount);
+}
+
+bool Grams::cell_pack(Ref<vm::Cell>& cell_ref, const Grams::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Grams::cell_pack_nanograms(Ref<vm::Cell>& cell_ref, Ref<CellSlice> amount) const {
+  vm::CellBuilder cb;
+  return pack_nanograms(cb, std::move(amount)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Grams::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("nanograms")
+      && pp.field("amount")
+      && t_VarUInteger_16.print_skip(pp, cs)
+      && pp.close();
+}
+
+const Grams t_Grams;
+
+//
+// code for type `ExtraCurrencyCollection`
+//
+
+int ExtraCurrencyCollection::check_tag(const vm::CellSlice& cs) const {
+  return extra_currencies;
+}
+
+bool ExtraCurrencyCollection::skip(vm::CellSlice& cs) const {
+  return t_HashmapE_32_VarUInteger_32.skip(cs);
+}
+
+bool ExtraCurrencyCollection::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_HashmapE_32_VarUInteger_32.validate_skip(cs, weak);
+}
+
+bool ExtraCurrencyCollection::unpack(vm::CellSlice& cs, ExtraCurrencyCollection::Record& data) const {
+  return t_HashmapE_32_VarUInteger_32.fetch_to(cs, data.dict);
+}
+
+bool ExtraCurrencyCollection::unpack_extra_currencies(vm::CellSlice& cs, Ref<CellSlice>& dict) const {
+  return t_HashmapE_32_VarUInteger_32.fetch_to(cs, dict);
+}
+
+bool ExtraCurrencyCollection::cell_unpack(Ref<vm::Cell> cell_ref, ExtraCurrencyCollection::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ExtraCurrencyCollection::cell_unpack_extra_currencies(Ref<vm::Cell> cell_ref, Ref<CellSlice>& dict) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_extra_currencies(cs, dict) && cs.empty_ext();
+}
+
+bool ExtraCurrencyCollection::pack(vm::CellBuilder& cb, const ExtraCurrencyCollection::Record& data) const {
+  return t_HashmapE_32_VarUInteger_32.store_from(cb, data.dict);
+}
+
+bool ExtraCurrencyCollection::pack_extra_currencies(vm::CellBuilder& cb, Ref<CellSlice> dict) const {
+  return t_HashmapE_32_VarUInteger_32.store_from(cb, dict);
+}
+
+bool ExtraCurrencyCollection::cell_pack(Ref<vm::Cell>& cell_ref, const ExtraCurrencyCollection::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ExtraCurrencyCollection::cell_pack_extra_currencies(Ref<vm::Cell>& cell_ref, Ref<CellSlice> dict) const {
+  vm::CellBuilder cb;
+  return pack_extra_currencies(cb, std::move(dict)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ExtraCurrencyCollection::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("extra_currencies")
+      && pp.field("dict")
+      && t_HashmapE_32_VarUInteger_32.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ExtraCurrencyCollection t_ExtraCurrencyCollection;
+
+//
+// code for type `CurrencyCollection`
+//
+
+int CurrencyCollection::check_tag(const vm::CellSlice& cs) const {
+  return currencies;
+}
+
+bool CurrencyCollection::skip(vm::CellSlice& cs) const {
+  return t_Grams.skip(cs)
+      && t_ExtraCurrencyCollection.skip(cs);
+}
+
+bool CurrencyCollection::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_Grams.validate_skip(cs, weak)
+      && t_ExtraCurrencyCollection.validate_skip(cs, weak);
+}
+
+bool CurrencyCollection::unpack(vm::CellSlice& cs, CurrencyCollection::Record& data) const {
+  return t_Grams.fetch_to(cs, data.grams)
+      && t_ExtraCurrencyCollection.fetch_to(cs, data.other);
+}
+
+bool CurrencyCollection::unpack_currencies(vm::CellSlice& cs, Ref<CellSlice>& grams, Ref<CellSlice>& other) const {
+  return t_Grams.fetch_to(cs, grams)
+      && t_ExtraCurrencyCollection.fetch_to(cs, other);
+}
+
+bool CurrencyCollection::cell_unpack(Ref<vm::Cell> cell_ref, CurrencyCollection::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool CurrencyCollection::cell_unpack_currencies(Ref<vm::Cell> cell_ref, Ref<CellSlice>& grams, Ref<CellSlice>& other) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_currencies(cs, grams, other) && cs.empty_ext();
+}
+
+bool CurrencyCollection::pack(vm::CellBuilder& cb, const CurrencyCollection::Record& data) const {
+  return t_Grams.store_from(cb, data.grams)
+      && t_ExtraCurrencyCollection.store_from(cb, data.other);
+}
+
+bool CurrencyCollection::pack_currencies(vm::CellBuilder& cb, Ref<CellSlice> grams, Ref<CellSlice> other) const {
+  return t_Grams.store_from(cb, grams)
+      && t_ExtraCurrencyCollection.store_from(cb, other);
+}
+
+bool CurrencyCollection::cell_pack(Ref<vm::Cell>& cell_ref, const CurrencyCollection::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CurrencyCollection::cell_pack_currencies(Ref<vm::Cell>& cell_ref, Ref<CellSlice> grams, Ref<CellSlice> other) const {
+  vm::CellBuilder cb;
+  return pack_currencies(cb, std::move(grams), std::move(other)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CurrencyCollection::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("currencies")
+      && pp.field("grams")
+      && t_Grams.print_skip(pp, cs)
+      && pp.field("other")
+      && t_ExtraCurrencyCollection.print_skip(pp, cs)
+      && pp.close();
+}
+
+const CurrencyCollection t_CurrencyCollection;
+
+//
+// code for type `CommonMsgInfo`
+//
+constexpr char CommonMsgInfo::cons_len[3];
+constexpr unsigned char CommonMsgInfo::cons_tag[3];
+
+int CommonMsgInfo::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case int_msg_info:
+    return cs.have(1) ? int_msg_info : -1;
+  case ext_in_msg_info:
+    return cs.have(2) ? ext_in_msg_info : -1;
+  case ext_out_msg_info:
+    return cs.have(2) ? ext_out_msg_info : -1;
+  }
+  return -1;
+}
+
+bool CommonMsgInfo::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case int_msg_info:
+    return cs.advance(4)
+        && t_MsgAddressInt.skip(cs)
+        && t_MsgAddressInt.skip(cs)
+        && t_CurrencyCollection.skip(cs)
+        && t_Grams.skip(cs)
+        && t_Grams.skip(cs)
+        && cs.advance(96);
+  case ext_in_msg_info:
+    return cs.advance(2)
+        && t_MsgAddressExt.skip(cs)
+        && t_MsgAddressInt.skip(cs)
+        && t_Grams.skip(cs);
+  case ext_out_msg_info:
+    return cs.advance(2)
+        && t_MsgAddressInt.skip(cs)
+        && t_MsgAddressExt.skip(cs)
+        && cs.advance(96);
+  }
+  return false;
+}
+
+bool CommonMsgInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case int_msg_info:
+    return cs.advance(4)
+        && t_MsgAddressInt.validate_skip(cs, weak)
+        && t_MsgAddressInt.validate_skip(cs, weak)
+        && t_CurrencyCollection.validate_skip(cs, weak)
+        && t_Grams.validate_skip(cs, weak)
+        && t_Grams.validate_skip(cs, weak)
+        && cs.advance(96);
+  case ext_in_msg_info:
+    return cs.advance(2)
+        && t_MsgAddressExt.validate_skip(cs, weak)
+        && t_MsgAddressInt.validate_skip(cs, weak)
+        && t_Grams.validate_skip(cs, weak);
+  case ext_out_msg_info:
+    return cs.advance(2)
+        && t_MsgAddressInt.validate_skip(cs, weak)
+        && t_MsgAddressExt.validate_skip(cs, weak)
+        && cs.advance(96);
+  }
+  return false;
+}
+
+bool CommonMsgInfo::unpack(vm::CellSlice& cs, CommonMsgInfo::Record_int_msg_info& data) const {
+  return cs.fetch_ulong(1) == 0
+      && cs.fetch_bool_to(data.ihr_disabled)
+      && cs.fetch_bool_to(data.bounce)
+      && cs.fetch_bool_to(data.bounced)
+      && t_MsgAddressInt.fetch_to(cs, data.src)
+      && t_MsgAddressInt.fetch_to(cs, data.dest)
+      && t_CurrencyCollection.fetch_to(cs, data.value)
+      && t_Grams.fetch_to(cs, data.ihr_fee)
+      && t_Grams.fetch_to(cs, data.fwd_fee)
+      && cs.fetch_uint_to(64, data.created_lt)
+      && cs.fetch_uint_to(32, data.created_at);
+}
+
+bool CommonMsgInfo::cell_unpack(Ref<vm::Cell> cell_ref, CommonMsgInfo::Record_int_msg_info& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool CommonMsgInfo::unpack(vm::CellSlice& cs, CommonMsgInfo::Record_ext_in_msg_info& data) const {
+  return cs.fetch_ulong(2) == 2
+      && t_MsgAddressExt.fetch_to(cs, data.src)
+      && t_MsgAddressInt.fetch_to(cs, data.dest)
+      && t_Grams.fetch_to(cs, data.import_fee);
+}
+
+bool CommonMsgInfo::unpack_ext_in_msg_info(vm::CellSlice& cs, Ref<CellSlice>& src, Ref<CellSlice>& dest, Ref<CellSlice>& import_fee) const {
+  return cs.fetch_ulong(2) == 2
+      && t_MsgAddressExt.fetch_to(cs, src)
+      && t_MsgAddressInt.fetch_to(cs, dest)
+      && t_Grams.fetch_to(cs, import_fee);
+}
+
+bool CommonMsgInfo::cell_unpack(Ref<vm::Cell> cell_ref, CommonMsgInfo::Record_ext_in_msg_info& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool CommonMsgInfo::cell_unpack_ext_in_msg_info(Ref<vm::Cell> cell_ref, Ref<CellSlice>& src, Ref<CellSlice>& dest, Ref<CellSlice>& import_fee) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_ext_in_msg_info(cs, src, dest, import_fee) && cs.empty_ext();
+}
+
+bool CommonMsgInfo::unpack(vm::CellSlice& cs, CommonMsgInfo::Record_ext_out_msg_info& data) const {
+  return cs.fetch_ulong(2) == 3
+      && t_MsgAddressInt.fetch_to(cs, data.src)
+      && t_MsgAddressExt.fetch_to(cs, data.dest)
+      && cs.fetch_uint_to(64, data.created_lt)
+      && cs.fetch_uint_to(32, data.created_at);
+}
+
+bool CommonMsgInfo::cell_unpack(Ref<vm::Cell> cell_ref, CommonMsgInfo::Record_ext_out_msg_info& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool CommonMsgInfo::pack(vm::CellBuilder& cb, const CommonMsgInfo::Record_int_msg_info& data) const {
+  return cb.store_long_bool(0, 1)
+      && cb.store_ulong_rchk_bool(data.ihr_disabled, 1)
+      && cb.store_ulong_rchk_bool(data.bounce, 1)
+      && cb.store_ulong_rchk_bool(data.bounced, 1)
+      && t_MsgAddressInt.store_from(cb, data.src)
+      && t_MsgAddressInt.store_from(cb, data.dest)
+      && t_CurrencyCollection.store_from(cb, data.value)
+      && t_Grams.store_from(cb, data.ihr_fee)
+      && t_Grams.store_from(cb, data.fwd_fee)
+      && cb.store_ulong_rchk_bool(data.created_lt, 64)
+      && cb.store_ulong_rchk_bool(data.created_at, 32);
+}
+
+bool CommonMsgInfo::cell_pack(Ref<vm::Cell>& cell_ref, const CommonMsgInfo::Record_int_msg_info& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CommonMsgInfo::pack(vm::CellBuilder& cb, const CommonMsgInfo::Record_ext_in_msg_info& data) const {
+  return cb.store_long_bool(2, 2)
+      && t_MsgAddressExt.store_from(cb, data.src)
+      && t_MsgAddressInt.store_from(cb, data.dest)
+      && t_Grams.store_from(cb, data.import_fee);
+}
+
+bool CommonMsgInfo::pack_ext_in_msg_info(vm::CellBuilder& cb, Ref<CellSlice> src, Ref<CellSlice> dest, Ref<CellSlice> import_fee) const {
+  return cb.store_long_bool(2, 2)
+      && t_MsgAddressExt.store_from(cb, src)
+      && t_MsgAddressInt.store_from(cb, dest)
+      && t_Grams.store_from(cb, import_fee);
+}
+
+bool CommonMsgInfo::cell_pack(Ref<vm::Cell>& cell_ref, const CommonMsgInfo::Record_ext_in_msg_info& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CommonMsgInfo::cell_pack_ext_in_msg_info(Ref<vm::Cell>& cell_ref, Ref<CellSlice> src, Ref<CellSlice> dest, Ref<CellSlice> import_fee) const {
+  vm::CellBuilder cb;
+  return pack_ext_in_msg_info(cb, std::move(src), std::move(dest), std::move(import_fee)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CommonMsgInfo::pack(vm::CellBuilder& cb, const CommonMsgInfo::Record_ext_out_msg_info& data) const {
+  return cb.store_long_bool(3, 2)
+      && t_MsgAddressInt.store_from(cb, data.src)
+      && t_MsgAddressExt.store_from(cb, data.dest)
+      && cb.store_ulong_rchk_bool(data.created_lt, 64)
+      && cb.store_ulong_rchk_bool(data.created_at, 32);
+}
+
+bool CommonMsgInfo::cell_pack(Ref<vm::Cell>& cell_ref, const CommonMsgInfo::Record_ext_out_msg_info& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CommonMsgInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case int_msg_info:
+    return cs.advance(1)
+        && pp.open("int_msg_info")
+        && pp.fetch_uint_field(cs, 1, "ihr_disabled")
+        && pp.fetch_uint_field(cs, 1, "bounce")
+        && pp.fetch_uint_field(cs, 1, "bounced")
+        && pp.field("src")
+        && t_MsgAddressInt.print_skip(pp, cs)
+        && pp.field("dest")
+        && t_MsgAddressInt.print_skip(pp, cs)
+        && pp.field("value")
+        && t_CurrencyCollection.print_skip(pp, cs)
+        && pp.field("ihr_fee")
+        && t_Grams.print_skip(pp, cs)
+        && pp.field("fwd_fee")
+        && t_Grams.print_skip(pp, cs)
+        && pp.fetch_uint_field(cs, 64, "created_lt")
+        && pp.fetch_uint_field(cs, 32, "created_at")
+        && pp.close();
+  case ext_in_msg_info:
+    return cs.advance(2)
+        && pp.open("ext_in_msg_info")
+        && pp.field("src")
+        && t_MsgAddressExt.print_skip(pp, cs)
+        && pp.field("dest")
+        && t_MsgAddressInt.print_skip(pp, cs)
+        && pp.field("import_fee")
+        && t_Grams.print_skip(pp, cs)
+        && pp.close();
+  case ext_out_msg_info:
+    return cs.advance(2)
+        && pp.open("ext_out_msg_info")
+        && pp.field("src")
+        && t_MsgAddressInt.print_skip(pp, cs)
+        && pp.field("dest")
+        && t_MsgAddressExt.print_skip(pp, cs)
+        && pp.fetch_uint_field(cs, 64, "created_lt")
+        && pp.fetch_uint_field(cs, 32, "created_at")
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for CommonMsgInfo");
+}
+
+const CommonMsgInfo t_CommonMsgInfo;
+
+//
+// code for type `CommonMsgInfoRelaxed`
+//
+constexpr char CommonMsgInfoRelaxed::cons_len[2];
+constexpr unsigned char CommonMsgInfoRelaxed::cons_tag[2];
+
+int CommonMsgInfoRelaxed::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case int_msg_info:
+    return cs.have(1) ? int_msg_info : -1;
+  case ext_out_msg_info:
+    return cs.prefetch_ulong(2) == 3 ? ext_out_msg_info : -1;
+  }
+  return -1;
+}
+
+bool CommonMsgInfoRelaxed::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case int_msg_info:
+    return cs.advance(4)
+        && t_MsgAddress.skip(cs)
+        && t_MsgAddressInt.skip(cs)
+        && t_CurrencyCollection.skip(cs)
+        && t_Grams.skip(cs)
+        && t_Grams.skip(cs)
+        && cs.advance(96);
+  case ext_out_msg_info:
+    return cs.advance(2)
+        && t_MsgAddress.skip(cs)
+        && t_MsgAddressExt.skip(cs)
+        && cs.advance(96);
+  }
+  return false;
+}
+
+bool CommonMsgInfoRelaxed::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case int_msg_info:
+    return cs.advance(4)
+        && t_MsgAddress.validate_skip(cs, weak)
+        && t_MsgAddressInt.validate_skip(cs, weak)
+        && t_CurrencyCollection.validate_skip(cs, weak)
+        && t_Grams.validate_skip(cs, weak)
+        && t_Grams.validate_skip(cs, weak)
+        && cs.advance(96);
+  case ext_out_msg_info:
+    return cs.fetch_ulong(2) == 3
+        && t_MsgAddress.validate_skip(cs, weak)
+        && t_MsgAddressExt.validate_skip(cs, weak)
+        && cs.advance(96);
+  }
+  return false;
+}
+
+bool CommonMsgInfoRelaxed::unpack(vm::CellSlice& cs, CommonMsgInfoRelaxed::Record_int_msg_info& data) const {
+  return cs.fetch_ulong(1) == 0
+      && cs.fetch_bool_to(data.ihr_disabled)
+      && cs.fetch_bool_to(data.bounce)
+      && cs.fetch_bool_to(data.bounced)
+      && t_MsgAddress.fetch_to(cs, data.src)
+      && t_MsgAddressInt.fetch_to(cs, data.dest)
+      && t_CurrencyCollection.fetch_to(cs, data.value)
+      && t_Grams.fetch_to(cs, data.ihr_fee)
+      && t_Grams.fetch_to(cs, data.fwd_fee)
+      && cs.fetch_uint_to(64, data.created_lt)
+      && cs.fetch_uint_to(32, data.created_at);
+}
+
+bool CommonMsgInfoRelaxed::cell_unpack(Ref<vm::Cell> cell_ref, CommonMsgInfoRelaxed::Record_int_msg_info& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool CommonMsgInfoRelaxed::unpack(vm::CellSlice& cs, CommonMsgInfoRelaxed::Record_ext_out_msg_info& data) const {
+  return cs.fetch_ulong(2) == 3
+      && t_MsgAddress.fetch_to(cs, data.src)
+      && t_MsgAddressExt.fetch_to(cs, data.dest)
+      && cs.fetch_uint_to(64, data.created_lt)
+      && cs.fetch_uint_to(32, data.created_at);
+}
+
+bool CommonMsgInfoRelaxed::cell_unpack(Ref<vm::Cell> cell_ref, CommonMsgInfoRelaxed::Record_ext_out_msg_info& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool CommonMsgInfoRelaxed::pack(vm::CellBuilder& cb, const CommonMsgInfoRelaxed::Record_int_msg_info& data) const {
+  return cb.store_long_bool(0, 1)
+      && cb.store_ulong_rchk_bool(data.ihr_disabled, 1)
+      && cb.store_ulong_rchk_bool(data.bounce, 1)
+      && cb.store_ulong_rchk_bool(data.bounced, 1)
+      && t_MsgAddress.store_from(cb, data.src)
+      && t_MsgAddressInt.store_from(cb, data.dest)
+      && t_CurrencyCollection.store_from(cb, data.value)
+      && t_Grams.store_from(cb, data.ihr_fee)
+      && t_Grams.store_from(cb, data.fwd_fee)
+      && cb.store_ulong_rchk_bool(data.created_lt, 64)
+      && cb.store_ulong_rchk_bool(data.created_at, 32);
+}
+
+bool CommonMsgInfoRelaxed::cell_pack(Ref<vm::Cell>& cell_ref, const CommonMsgInfoRelaxed::Record_int_msg_info& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CommonMsgInfoRelaxed::pack(vm::CellBuilder& cb, const CommonMsgInfoRelaxed::Record_ext_out_msg_info& data) const {
+  return cb.store_long_bool(3, 2)
+      && t_MsgAddress.store_from(cb, data.src)
+      && t_MsgAddressExt.store_from(cb, data.dest)
+      && cb.store_ulong_rchk_bool(data.created_lt, 64)
+      && cb.store_ulong_rchk_bool(data.created_at, 32);
+}
+
+bool CommonMsgInfoRelaxed::cell_pack(Ref<vm::Cell>& cell_ref, const CommonMsgInfoRelaxed::Record_ext_out_msg_info& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CommonMsgInfoRelaxed::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case int_msg_info:
+    return cs.advance(1)
+        && pp.open("int_msg_info")
+        && pp.fetch_uint_field(cs, 1, "ihr_disabled")
+        && pp.fetch_uint_field(cs, 1, "bounce")
+        && pp.fetch_uint_field(cs, 1, "bounced")
+        && pp.field("src")
+        && t_MsgAddress.print_skip(pp, cs)
+        && pp.field("dest")
+        && t_MsgAddressInt.print_skip(pp, cs)
+        && pp.field("value")
+        && t_CurrencyCollection.print_skip(pp, cs)
+        && pp.field("ihr_fee")
+        && t_Grams.print_skip(pp, cs)
+        && pp.field("fwd_fee")
+        && t_Grams.print_skip(pp, cs)
+        && pp.fetch_uint_field(cs, 64, "created_lt")
+        && pp.fetch_uint_field(cs, 32, "created_at")
+        && pp.close();
+  case ext_out_msg_info:
+    return cs.fetch_ulong(2) == 3
+        && pp.open("ext_out_msg_info")
+        && pp.field("src")
+        && t_MsgAddress.print_skip(pp, cs)
+        && pp.field("dest")
+        && t_MsgAddressExt.print_skip(pp, cs)
+        && pp.fetch_uint_field(cs, 64, "created_lt")
+        && pp.fetch_uint_field(cs, 32, "created_at")
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for CommonMsgInfoRelaxed");
+}
+
+const CommonMsgInfoRelaxed t_CommonMsgInfoRelaxed;
+
+//
+// code for type `TickTock`
+//
+
+int TickTock::check_tag(const vm::CellSlice& cs) const {
+  return tick_tock;
+}
+
+bool TickTock::unpack(vm::CellSlice& cs, TickTock::Record& data) const {
+  return cs.fetch_bool_to(data.tick)
+      && cs.fetch_bool_to(data.tock);
+}
+
+bool TickTock::unpack_tick_tock(vm::CellSlice& cs, bool& tick, bool& tock) const {
+  return cs.fetch_bool_to(tick)
+      && cs.fetch_bool_to(tock);
+}
+
+bool TickTock::cell_unpack(Ref<vm::Cell> cell_ref, TickTock::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TickTock::cell_unpack_tick_tock(Ref<vm::Cell> cell_ref, bool& tick, bool& tock) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_tick_tock(cs, tick, tock) && cs.empty_ext();
+}
+
+bool TickTock::pack(vm::CellBuilder& cb, const TickTock::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.tick, 1)
+      && cb.store_ulong_rchk_bool(data.tock, 1);
+}
+
+bool TickTock::pack_tick_tock(vm::CellBuilder& cb, bool tick, bool tock) const {
+  return cb.store_ulong_rchk_bool(tick, 1)
+      && cb.store_ulong_rchk_bool(tock, 1);
+}
+
+bool TickTock::cell_pack(Ref<vm::Cell>& cell_ref, const TickTock::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TickTock::cell_pack_tick_tock(Ref<vm::Cell>& cell_ref, bool tick, bool tock) const {
+  vm::CellBuilder cb;
+  return pack_tick_tock(cb, tick, tock) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TickTock::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("tick_tock")
+      && pp.fetch_uint_field(cs, 1, "tick")
+      && pp.fetch_uint_field(cs, 1, "tock")
+      && pp.close();
+}
+
+const TickTock t_TickTock;
+
+//
+// code for type `StateInit`
+//
+
+int StateInit::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool StateInit::skip(vm::CellSlice& cs) const {
+  return t_Maybe_natwidth_5.skip(cs)
+      && t_Maybe_TickTock.skip(cs)
+      && t_Maybe_Ref_Cell.skip(cs)
+      && t_Maybe_Ref_Cell.skip(cs)
+      && t_HashmapE_256_SimpleLib.skip(cs);
+}
+
+bool StateInit::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_Maybe_natwidth_5.validate_skip(cs, weak)
+      && t_Maybe_TickTock.validate_skip(cs, weak)
+      && t_Maybe_Ref_Cell.validate_skip(cs, weak)
+      && t_Maybe_Ref_Cell.validate_skip(cs, weak)
+      && t_HashmapE_256_SimpleLib.validate_skip(cs, weak);
+}
+
+bool StateInit::unpack(vm::CellSlice& cs, StateInit::Record& data) const {
+  return t_Maybe_natwidth_5.fetch_to(cs, data.split_depth)
+      && t_Maybe_TickTock.fetch_to(cs, data.special)
+      && t_Maybe_Ref_Cell.fetch_to(cs, data.code)
+      && t_Maybe_Ref_Cell.fetch_to(cs, data.data)
+      && t_HashmapE_256_SimpleLib.fetch_to(cs, data.library);
+}
+
+bool StateInit::cell_unpack(Ref<vm::Cell> cell_ref, StateInit::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool StateInit::pack(vm::CellBuilder& cb, const StateInit::Record& data) const {
+  return t_Maybe_natwidth_5.store_from(cb, data.split_depth)
+      && t_Maybe_TickTock.store_from(cb, data.special)
+      && t_Maybe_Ref_Cell.store_from(cb, data.code)
+      && t_Maybe_Ref_Cell.store_from(cb, data.data)
+      && t_HashmapE_256_SimpleLib.store_from(cb, data.library);
+}
+
+bool StateInit::cell_pack(Ref<vm::Cell>& cell_ref, const StateInit::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool StateInit::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field("split_depth")
+      && t_Maybe_natwidth_5.print_skip(pp, cs)
+      && pp.field("special")
+      && t_Maybe_TickTock.print_skip(pp, cs)
+      && pp.field("code")
+      && t_Maybe_Ref_Cell.print_skip(pp, cs)
+      && pp.field("data")
+      && t_Maybe_Ref_Cell.print_skip(pp, cs)
+      && pp.field("library")
+      && t_HashmapE_256_SimpleLib.print_skip(pp, cs)
+      && pp.close();
+}
+
+const StateInit t_StateInit;
+
+//
+// code for type `SimpleLib`
+//
+
+int SimpleLib::check_tag(const vm::CellSlice& cs) const {
+  return simple_lib;
+}
+
+bool SimpleLib::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.advance_ext(0x10001);
+}
+
+bool SimpleLib::unpack(vm::CellSlice& cs, SimpleLib::Record& data) const {
+  return cs.fetch_bool_to(data.public1)
+      && cs.fetch_ref_to(data.root);
+}
+
+bool SimpleLib::unpack_simple_lib(vm::CellSlice& cs, bool& public1, Ref<Cell>& root) const {
+  return cs.fetch_bool_to(public1)
+      && cs.fetch_ref_to(root);
+}
+
+bool SimpleLib::cell_unpack(Ref<vm::Cell> cell_ref, SimpleLib::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool SimpleLib::cell_unpack_simple_lib(Ref<vm::Cell> cell_ref, bool& public1, Ref<Cell>& root) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_simple_lib(cs, public1, root) && cs.empty_ext();
+}
+
+bool SimpleLib::pack(vm::CellBuilder& cb, const SimpleLib::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.public1, 1)
+      && cb.store_ref_bool(data.root);
+}
+
+bool SimpleLib::pack_simple_lib(vm::CellBuilder& cb, bool public1, Ref<Cell> root) const {
+  return cb.store_ulong_rchk_bool(public1, 1)
+      && cb.store_ref_bool(root);
+}
+
+bool SimpleLib::cell_pack(Ref<vm::Cell>& cell_ref, const SimpleLib::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool SimpleLib::cell_pack_simple_lib(Ref<vm::Cell>& cell_ref, bool public1, Ref<Cell> root) const {
+  vm::CellBuilder cb;
+  return pack_simple_lib(cb, public1, std::move(root)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool SimpleLib::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("simple_lib")
+      && pp.fetch_uint_field(cs, 1, "public")
+      && pp.field("root")
+      && t_Anything.print_ref(pp, cs.fetch_ref())
+      && pp.close();
+}
+
+const SimpleLib t_SimpleLib;
+
+//
+// code for type `Message`
+//
+
+int Message::check_tag(const vm::CellSlice& cs) const {
+  return message;
+}
+
+bool Message::skip(vm::CellSlice& cs) const {
+  return t_CommonMsgInfo.skip(cs)
+      && t_Maybe_Either_StateInit_Ref_StateInit.skip(cs)
+      && Either{X_, RefT{X_}}.skip(cs);
+}
+
+bool Message::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_CommonMsgInfo.validate_skip(cs, weak)
+      && t_Maybe_Either_StateInit_Ref_StateInit.validate_skip(cs, weak)
+      && Either{X_, RefT{X_}}.validate_skip(cs, weak);
+}
+
+bool Message::unpack(vm::CellSlice& cs, Message::Record& data) const {
+  return t_CommonMsgInfo.fetch_to(cs, data.info)
+      && t_Maybe_Either_StateInit_Ref_StateInit.fetch_to(cs, data.init)
+      && Either{X_, RefT{X_}}.fetch_to(cs, data.body);
+}
+
+bool Message::unpack_message(vm::CellSlice& cs, Ref<CellSlice>& info, Ref<CellSlice>& init, Ref<CellSlice>& body) const {
+  return t_CommonMsgInfo.fetch_to(cs, info)
+      && t_Maybe_Either_StateInit_Ref_StateInit.fetch_to(cs, init)
+      && Either{X_, RefT{X_}}.fetch_to(cs, body);
+}
+
+bool Message::cell_unpack(Ref<vm::Cell> cell_ref, Message::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Message::cell_unpack_message(Ref<vm::Cell> cell_ref, Ref<CellSlice>& info, Ref<CellSlice>& init, Ref<CellSlice>& body) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_message(cs, info, init, body) && cs.empty_ext();
+}
+
+bool Message::pack(vm::CellBuilder& cb, const Message::Record& data) const {
+  return t_CommonMsgInfo.store_from(cb, data.info)
+      && t_Maybe_Either_StateInit_Ref_StateInit.store_from(cb, data.init)
+      && Either{X_, RefT{X_}}.store_from(cb, data.body);
+}
+
+bool Message::pack_message(vm::CellBuilder& cb, Ref<CellSlice> info, Ref<CellSlice> init, Ref<CellSlice> body) const {
+  return t_CommonMsgInfo.store_from(cb, info)
+      && t_Maybe_Either_StateInit_Ref_StateInit.store_from(cb, init)
+      && Either{X_, RefT{X_}}.store_from(cb, body);
+}
+
+bool Message::cell_pack(Ref<vm::Cell>& cell_ref, const Message::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Message::cell_pack_message(Ref<vm::Cell>& cell_ref, Ref<CellSlice> info, Ref<CellSlice> init, Ref<CellSlice> body) const {
+  vm::CellBuilder cb;
+  return pack_message(cb, std::move(info), std::move(init), std::move(body)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Message::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("message")
+      && pp.field("info")
+      && t_CommonMsgInfo.print_skip(pp, cs)
+      && pp.field("init")
+      && t_Maybe_Either_StateInit_Ref_StateInit.print_skip(pp, cs)
+      && pp.field("body")
+      && Either{X_, RefT{X_}}.print_skip(pp, cs)
+      && pp.close();
+}
+
+
+//
+// code for type `MessageRelaxed`
+//
+
+int MessageRelaxed::check_tag(const vm::CellSlice& cs) const {
+  return message;
+}
+
+bool MessageRelaxed::skip(vm::CellSlice& cs) const {
+  return t_CommonMsgInfoRelaxed.skip(cs)
+      && t_Maybe_Either_StateInit_Ref_StateInit.skip(cs)
+      && Either{X_, RefT{X_}}.skip(cs);
+}
+
+bool MessageRelaxed::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_CommonMsgInfoRelaxed.validate_skip(cs, weak)
+      && t_Maybe_Either_StateInit_Ref_StateInit.validate_skip(cs, weak)
+      && Either{X_, RefT{X_}}.validate_skip(cs, weak);
+}
+
+bool MessageRelaxed::unpack(vm::CellSlice& cs, MessageRelaxed::Record& data) const {
+  return t_CommonMsgInfoRelaxed.fetch_to(cs, data.info)
+      && t_Maybe_Either_StateInit_Ref_StateInit.fetch_to(cs, data.init)
+      && Either{X_, RefT{X_}}.fetch_to(cs, data.body);
+}
+
+bool MessageRelaxed::unpack_message(vm::CellSlice& cs, Ref<CellSlice>& info, Ref<CellSlice>& init, Ref<CellSlice>& body) const {
+  return t_CommonMsgInfoRelaxed.fetch_to(cs, info)
+      && t_Maybe_Either_StateInit_Ref_StateInit.fetch_to(cs, init)
+      && Either{X_, RefT{X_}}.fetch_to(cs, body);
+}
+
+bool MessageRelaxed::cell_unpack(Ref<vm::Cell> cell_ref, MessageRelaxed::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool MessageRelaxed::cell_unpack_message(Ref<vm::Cell> cell_ref, Ref<CellSlice>& info, Ref<CellSlice>& init, Ref<CellSlice>& body) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_message(cs, info, init, body) && cs.empty_ext();
+}
+
+bool MessageRelaxed::pack(vm::CellBuilder& cb, const MessageRelaxed::Record& data) const {
+  return t_CommonMsgInfoRelaxed.store_from(cb, data.info)
+      && t_Maybe_Either_StateInit_Ref_StateInit.store_from(cb, data.init)
+      && Either{X_, RefT{X_}}.store_from(cb, data.body);
+}
+
+bool MessageRelaxed::pack_message(vm::CellBuilder& cb, Ref<CellSlice> info, Ref<CellSlice> init, Ref<CellSlice> body) const {
+  return t_CommonMsgInfoRelaxed.store_from(cb, info)
+      && t_Maybe_Either_StateInit_Ref_StateInit.store_from(cb, init)
+      && Either{X_, RefT{X_}}.store_from(cb, body);
+}
+
+bool MessageRelaxed::cell_pack(Ref<vm::Cell>& cell_ref, const MessageRelaxed::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MessageRelaxed::cell_pack_message(Ref<vm::Cell>& cell_ref, Ref<CellSlice> info, Ref<CellSlice> init, Ref<CellSlice> body) const {
+  vm::CellBuilder cb;
+  return pack_message(cb, std::move(info), std::move(init), std::move(body)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MessageRelaxed::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("message")
+      && pp.field("info")
+      && t_CommonMsgInfoRelaxed.print_skip(pp, cs)
+      && pp.field("init")
+      && t_Maybe_Either_StateInit_Ref_StateInit.print_skip(pp, cs)
+      && pp.field("body")
+      && Either{X_, RefT{X_}}.print_skip(pp, cs)
+      && pp.close();
+}
+
+
+//
+// code for type `IntermediateAddress`
+//
+constexpr char IntermediateAddress::cons_len[3];
+constexpr unsigned char IntermediateAddress::cons_tag[3];
+
+int IntermediateAddress::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case interm_addr_regular:
+    return cs.have(1) ? interm_addr_regular : -1;
+  case interm_addr_simple:
+    return cs.have(2) ? interm_addr_simple : -1;
+  case interm_addr_ext:
+    return cs.have(2) ? interm_addr_ext : -1;
+  }
+  return -1;
+}
+
+bool IntermediateAddress::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case interm_addr_regular:
+    return cs.advance(8);
+  case interm_addr_simple:
+    return cs.advance(74);
+  case interm_addr_ext:
+    return cs.advance(98);
+  }
+  return false;
+}
+
+bool IntermediateAddress::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case interm_addr_regular: {
+    int use_dest_bits;
+    return cs.advance(1)
+        && cs.fetch_uint_leq(96, use_dest_bits);
+    }
+  case interm_addr_simple:
+    return cs.advance(74);
+  case interm_addr_ext:
+    return cs.advance(98);
+  }
+  return false;
+}
+
+bool IntermediateAddress::unpack(vm::CellSlice& cs, IntermediateAddress::Record_interm_addr_regular& data) const {
+  return cs.fetch_ulong(1) == 0
+      && cs.fetch_uint_leq(96, data.use_dest_bits);
+}
+
+bool IntermediateAddress::unpack_interm_addr_regular(vm::CellSlice& cs, int& use_dest_bits) const {
+  return cs.fetch_ulong(1) == 0
+      && cs.fetch_uint_leq(96, use_dest_bits);
+}
+
+bool IntermediateAddress::cell_unpack(Ref<vm::Cell> cell_ref, IntermediateAddress::Record_interm_addr_regular& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool IntermediateAddress::cell_unpack_interm_addr_regular(Ref<vm::Cell> cell_ref, int& use_dest_bits) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_interm_addr_regular(cs, use_dest_bits) && cs.empty_ext();
+}
+
+bool IntermediateAddress::unpack(vm::CellSlice& cs, IntermediateAddress::Record_interm_addr_simple& data) const {
+  return cs.fetch_ulong(2) == 2
+      && cs.fetch_int_to(8, data.workchain_id)
+      && cs.fetch_uint_to(64, data.addr_pfx);
+}
+
+bool IntermediateAddress::unpack_interm_addr_simple(vm::CellSlice& cs, int& workchain_id, unsigned long long& addr_pfx) const {
+  return cs.fetch_ulong(2) == 2
+      && cs.fetch_int_to(8, workchain_id)
+      && cs.fetch_uint_to(64, addr_pfx);
+}
+
+bool IntermediateAddress::cell_unpack(Ref<vm::Cell> cell_ref, IntermediateAddress::Record_interm_addr_simple& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool IntermediateAddress::cell_unpack_interm_addr_simple(Ref<vm::Cell> cell_ref, int& workchain_id, unsigned long long& addr_pfx) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_interm_addr_simple(cs, workchain_id, addr_pfx) && cs.empty_ext();
+}
+
+bool IntermediateAddress::unpack(vm::CellSlice& cs, IntermediateAddress::Record_interm_addr_ext& data) const {
+  return cs.fetch_ulong(2) == 3
+      && cs.fetch_int_to(32, data.workchain_id)
+      && cs.fetch_uint_to(64, data.addr_pfx);
+}
+
+bool IntermediateAddress::unpack_interm_addr_ext(vm::CellSlice& cs, int& workchain_id, unsigned long long& addr_pfx) const {
+  return cs.fetch_ulong(2) == 3
+      && cs.fetch_int_to(32, workchain_id)
+      && cs.fetch_uint_to(64, addr_pfx);
+}
+
+bool IntermediateAddress::cell_unpack(Ref<vm::Cell> cell_ref, IntermediateAddress::Record_interm_addr_ext& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool IntermediateAddress::cell_unpack_interm_addr_ext(Ref<vm::Cell> cell_ref, int& workchain_id, unsigned long long& addr_pfx) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_interm_addr_ext(cs, workchain_id, addr_pfx) && cs.empty_ext();
+}
+
+bool IntermediateAddress::pack(vm::CellBuilder& cb, const IntermediateAddress::Record_interm_addr_regular& data) const {
+  return cb.store_long_bool(0, 1)
+      && cb.store_uint_leq(96, data.use_dest_bits);
+}
+
+bool IntermediateAddress::pack_interm_addr_regular(vm::CellBuilder& cb, int use_dest_bits) const {
+  return cb.store_long_bool(0, 1)
+      && cb.store_uint_leq(96, use_dest_bits);
+}
+
+bool IntermediateAddress::cell_pack(Ref<vm::Cell>& cell_ref, const IntermediateAddress::Record_interm_addr_regular& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool IntermediateAddress::cell_pack_interm_addr_regular(Ref<vm::Cell>& cell_ref, int use_dest_bits) const {
+  vm::CellBuilder cb;
+  return pack_interm_addr_regular(cb, use_dest_bits) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool IntermediateAddress::pack(vm::CellBuilder& cb, const IntermediateAddress::Record_interm_addr_simple& data) const {
+  return cb.store_long_bool(2, 2)
+      && cb.store_long_rchk_bool(data.workchain_id, 8)
+      && cb.store_ulong_rchk_bool(data.addr_pfx, 64);
+}
+
+bool IntermediateAddress::pack_interm_addr_simple(vm::CellBuilder& cb, int workchain_id, unsigned long long addr_pfx) const {
+  return cb.store_long_bool(2, 2)
+      && cb.store_long_rchk_bool(workchain_id, 8)
+      && cb.store_ulong_rchk_bool(addr_pfx, 64);
+}
+
+bool IntermediateAddress::cell_pack(Ref<vm::Cell>& cell_ref, const IntermediateAddress::Record_interm_addr_simple& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool IntermediateAddress::cell_pack_interm_addr_simple(Ref<vm::Cell>& cell_ref, int workchain_id, unsigned long long addr_pfx) const {
+  vm::CellBuilder cb;
+  return pack_interm_addr_simple(cb, workchain_id, addr_pfx) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool IntermediateAddress::pack(vm::CellBuilder& cb, const IntermediateAddress::Record_interm_addr_ext& data) const {
+  return cb.store_long_bool(3, 2)
+      && cb.store_long_rchk_bool(data.workchain_id, 32)
+      && cb.store_ulong_rchk_bool(data.addr_pfx, 64);
+}
+
+bool IntermediateAddress::pack_interm_addr_ext(vm::CellBuilder& cb, int workchain_id, unsigned long long addr_pfx) const {
+  return cb.store_long_bool(3, 2)
+      && cb.store_long_rchk_bool(workchain_id, 32)
+      && cb.store_ulong_rchk_bool(addr_pfx, 64);
+}
+
+bool IntermediateAddress::cell_pack(Ref<vm::Cell>& cell_ref, const IntermediateAddress::Record_interm_addr_ext& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool IntermediateAddress::cell_pack_interm_addr_ext(Ref<vm::Cell>& cell_ref, int workchain_id, unsigned long long addr_pfx) const {
+  vm::CellBuilder cb;
+  return pack_interm_addr_ext(cb, workchain_id, addr_pfx) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool IntermediateAddress::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case interm_addr_regular: {
+    int use_dest_bits;
+    return cs.advance(1)
+        && pp.open("interm_addr_regular")
+        && cs.fetch_uint_leq(96, use_dest_bits)
+        && pp.field_int(use_dest_bits, "use_dest_bits")
+        && pp.close();
+    }
+  case interm_addr_simple:
+    return cs.advance(2)
+        && pp.open("interm_addr_simple")
+        && pp.fetch_int_field(cs, 8, "workchain_id")
+        && pp.fetch_uint_field(cs, 64, "addr_pfx")
+        && pp.close();
+  case interm_addr_ext:
+    return cs.advance(2)
+        && pp.open("interm_addr_ext")
+        && pp.fetch_int_field(cs, 32, "workchain_id")
+        && pp.fetch_uint_field(cs, 64, "addr_pfx")
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for IntermediateAddress");
+}
+
+const IntermediateAddress t_IntermediateAddress;
+
+//
+// code for type `MsgEnvelope`
+//
+constexpr unsigned char MsgEnvelope::cons_tag[1];
+
+int MsgEnvelope::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(4) == 4 ? msg_envelope : -1;
+}
+
+bool MsgEnvelope::skip(vm::CellSlice& cs) const {
+  return cs.advance(4)
+      && t_IntermediateAddress.skip(cs)
+      && t_IntermediateAddress.skip(cs)
+      && t_Grams.skip(cs)
+      && cs.advance_refs(1);
+}
+
+bool MsgEnvelope::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(4) == 4
+      && t_IntermediateAddress.validate_skip(cs, weak)
+      && t_IntermediateAddress.validate_skip(cs, weak)
+      && t_Grams.validate_skip(cs, weak)
+      && t_Message_Any.validate_skip_ref(cs, weak);
+}
+
+bool MsgEnvelope::unpack(vm::CellSlice& cs, MsgEnvelope::Record& data) const {
+  return cs.fetch_ulong(4) == 4
+      && t_IntermediateAddress.fetch_to(cs, data.cur_addr)
+      && t_IntermediateAddress.fetch_to(cs, data.next_addr)
+      && t_Grams.fetch_to(cs, data.fwd_fee_remaining)
+      && cs.fetch_ref_to(data.msg);
+}
+
+bool MsgEnvelope::cell_unpack(Ref<vm::Cell> cell_ref, MsgEnvelope::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool MsgEnvelope::pack(vm::CellBuilder& cb, const MsgEnvelope::Record& data) const {
+  return cb.store_long_bool(4, 4)
+      && t_IntermediateAddress.store_from(cb, data.cur_addr)
+      && t_IntermediateAddress.store_from(cb, data.next_addr)
+      && t_Grams.store_from(cb, data.fwd_fee_remaining)
+      && cb.store_ref_bool(data.msg);
+}
+
+bool MsgEnvelope::cell_pack(Ref<vm::Cell>& cell_ref, const MsgEnvelope::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MsgEnvelope::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(4) == 4
+      && pp.open("msg_envelope")
+      && pp.field("cur_addr")
+      && t_IntermediateAddress.print_skip(pp, cs)
+      && pp.field("next_addr")
+      && t_IntermediateAddress.print_skip(pp, cs)
+      && pp.field("fwd_fee_remaining")
+      && t_Grams.print_skip(pp, cs)
+      && pp.field("msg")
+      && t_Message_Any.print_ref(pp, cs.fetch_ref())
+      && pp.close();
+}
+
+const MsgEnvelope t_MsgEnvelope;
+
+//
+// code for type `InMsg`
+//
+constexpr unsigned char InMsg::cons_tag[7];
+
+int InMsg::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case msg_import_ext:
+    return cs.prefetch_ulong(3) == 0 ? msg_import_ext : -1;
+  case msg_import_ihr:
+    return cs.have(3) ? msg_import_ihr : -1;
+  case msg_import_imm:
+    return cs.have(3) ? msg_import_imm : -1;
+  case msg_import_fin:
+    return cs.have(3) ? msg_import_fin : -1;
+  case msg_import_tr:
+    return cs.have(3) ? msg_import_tr : -1;
+  case msg_discard_fin:
+    return cs.have(3) ? msg_discard_fin : -1;
+  case msg_discard_tr:
+    return cs.have(3) ? msg_discard_tr : -1;
+  }
+  return -1;
+}
+
+bool InMsg::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case msg_import_ext:
+    return cs.advance_ext(0x20003);
+  case msg_import_ihr:
+    return cs.advance_ext(0x20003)
+        && t_Grams.skip(cs)
+        && cs.advance_refs(1);
+  case msg_import_imm:
+    return cs.advance_ext(0x20003)
+        && t_Grams.skip(cs);
+  case msg_import_fin:
+    return cs.advance_ext(0x20003)
+        && t_Grams.skip(cs);
+  case msg_import_tr:
+    return cs.advance_ext(0x20003)
+        && t_Grams.skip(cs);
+  case msg_discard_fin:
+    return cs.advance_ext(0x10043)
+        && t_Grams.skip(cs);
+  case msg_discard_tr:
+    return cs.advance_ext(0x10043)
+        && t_Grams.skip(cs)
+        && cs.advance_refs(1);
+  }
+  return false;
+}
+
+bool InMsg::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case msg_import_ext:
+    return cs.fetch_ulong(3) == 0
+        && t_Message_Any.validate_skip_ref(cs, weak)
+        && t_Transaction.validate_skip_ref(cs, weak);
+  case msg_import_ihr:
+    return cs.advance(3)
+        && t_Message_Any.validate_skip_ref(cs, weak)
+        && t_Transaction.validate_skip_ref(cs, weak)
+        && t_Grams.validate_skip(cs, weak)
+        && cs.advance_refs(1);
+  case msg_import_imm:
+    return cs.advance(3)
+        && t_MsgEnvelope.validate_skip_ref(cs, weak)
+        && t_Transaction.validate_skip_ref(cs, weak)
+        && t_Grams.validate_skip(cs, weak);
+  case msg_import_fin:
+    return cs.advance(3)
+        && t_MsgEnvelope.validate_skip_ref(cs, weak)
+        && t_Transaction.validate_skip_ref(cs, weak)
+        && t_Grams.validate_skip(cs, weak);
+  case msg_import_tr:
+    return cs.advance(3)
+        && t_MsgEnvelope.validate_skip_ref(cs, weak)
+        && t_MsgEnvelope.validate_skip_ref(cs, weak)
+        && t_Grams.validate_skip(cs, weak);
+  case msg_discard_fin:
+    return cs.advance(3)
+        && t_MsgEnvelope.validate_skip_ref(cs, weak)
+        && cs.advance(64)
+        && t_Grams.validate_skip(cs, weak);
+  case msg_discard_tr:
+    return cs.advance(3)
+        && t_MsgEnvelope.validate_skip_ref(cs, weak)
+        && cs.advance(64)
+        && t_Grams.validate_skip(cs, weak)
+        && cs.advance_refs(1);
+  }
+  return false;
+}
+
+bool InMsg::unpack(vm::CellSlice& cs, InMsg::Record_msg_import_ext& data) const {
+  return cs.fetch_ulong(3) == 0
+      && cs.fetch_ref_to(data.msg)
+      && cs.fetch_ref_to(data.transaction);
+}
+
+bool InMsg::unpack_msg_import_ext(vm::CellSlice& cs, Ref<Cell>& msg, Ref<Cell>& transaction) const {
+  return cs.fetch_ulong(3) == 0
+      && cs.fetch_ref_to(msg)
+      && cs.fetch_ref_to(transaction);
+}
+
+bool InMsg::cell_unpack(Ref<vm::Cell> cell_ref, InMsg::Record_msg_import_ext& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool InMsg::cell_unpack_msg_import_ext(Ref<vm::Cell> cell_ref, Ref<Cell>& msg, Ref<Cell>& transaction) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_msg_import_ext(cs, msg, transaction) && cs.empty_ext();
+}
+
+bool InMsg::unpack(vm::CellSlice& cs, InMsg::Record_msg_import_ihr& data) const {
+  return cs.fetch_ulong(3) == 2
+      && cs.fetch_ref_to(data.msg)
+      && cs.fetch_ref_to(data.transaction)
+      && t_Grams.fetch_to(cs, data.ihr_fee)
+      && cs.fetch_ref_to(data.proof_created);
+}
+
+bool InMsg::cell_unpack(Ref<vm::Cell> cell_ref, InMsg::Record_msg_import_ihr& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool InMsg::unpack(vm::CellSlice& cs, InMsg::Record_msg_import_imm& data) const {
+  return cs.fetch_ulong(3) == 3
+      && cs.fetch_ref_to(data.in_msg)
+      && cs.fetch_ref_to(data.transaction)
+      && t_Grams.fetch_to(cs, data.fwd_fee);
+}
+
+bool InMsg::unpack_msg_import_imm(vm::CellSlice& cs, Ref<Cell>& in_msg, Ref<Cell>& transaction, Ref<CellSlice>& fwd_fee) const {
+  return cs.fetch_ulong(3) == 3
+      && cs.fetch_ref_to(in_msg)
+      && cs.fetch_ref_to(transaction)
+      && t_Grams.fetch_to(cs, fwd_fee);
+}
+
+bool InMsg::cell_unpack(Ref<vm::Cell> cell_ref, InMsg::Record_msg_import_imm& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool InMsg::cell_unpack_msg_import_imm(Ref<vm::Cell> cell_ref, Ref<Cell>& in_msg, Ref<Cell>& transaction, Ref<CellSlice>& fwd_fee) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_msg_import_imm(cs, in_msg, transaction, fwd_fee) && cs.empty_ext();
+}
+
+bool InMsg::unpack(vm::CellSlice& cs, InMsg::Record_msg_import_fin& data) const {
+  return cs.fetch_ulong(3) == 4
+      && cs.fetch_ref_to(data.in_msg)
+      && cs.fetch_ref_to(data.transaction)
+      && t_Grams.fetch_to(cs, data.fwd_fee);
+}
+
+bool InMsg::unpack_msg_import_fin(vm::CellSlice& cs, Ref<Cell>& in_msg, Ref<Cell>& transaction, Ref<CellSlice>& fwd_fee) const {
+  return cs.fetch_ulong(3) == 4
+      && cs.fetch_ref_to(in_msg)
+      && cs.fetch_ref_to(transaction)
+      && t_Grams.fetch_to(cs, fwd_fee);
+}
+
+bool InMsg::cell_unpack(Ref<vm::Cell> cell_ref, InMsg::Record_msg_import_fin& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool InMsg::cell_unpack_msg_import_fin(Ref<vm::Cell> cell_ref, Ref<Cell>& in_msg, Ref<Cell>& transaction, Ref<CellSlice>& fwd_fee) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_msg_import_fin(cs, in_msg, transaction, fwd_fee) && cs.empty_ext();
+}
+
+bool InMsg::unpack(vm::CellSlice& cs, InMsg::Record_msg_import_tr& data) const {
+  return cs.fetch_ulong(3) == 5
+      && cs.fetch_ref_to(data.in_msg)
+      && cs.fetch_ref_to(data.out_msg)
+      && t_Grams.fetch_to(cs, data.transit_fee);
+}
+
+bool InMsg::unpack_msg_import_tr(vm::CellSlice& cs, Ref<Cell>& in_msg, Ref<Cell>& out_msg, Ref<CellSlice>& transit_fee) const {
+  return cs.fetch_ulong(3) == 5
+      && cs.fetch_ref_to(in_msg)
+      && cs.fetch_ref_to(out_msg)
+      && t_Grams.fetch_to(cs, transit_fee);
+}
+
+bool InMsg::cell_unpack(Ref<vm::Cell> cell_ref, InMsg::Record_msg_import_tr& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool InMsg::cell_unpack_msg_import_tr(Ref<vm::Cell> cell_ref, Ref<Cell>& in_msg, Ref<Cell>& out_msg, Ref<CellSlice>& transit_fee) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_msg_import_tr(cs, in_msg, out_msg, transit_fee) && cs.empty_ext();
+}
+
+bool InMsg::unpack(vm::CellSlice& cs, InMsg::Record_msg_discard_fin& data) const {
+  return cs.fetch_ulong(3) == 6
+      && cs.fetch_ref_to(data.in_msg)
+      && cs.fetch_uint_to(64, data.transaction_id)
+      && t_Grams.fetch_to(cs, data.fwd_fee);
+}
+
+bool InMsg::unpack_msg_discard_fin(vm::CellSlice& cs, Ref<Cell>& in_msg, unsigned long long& transaction_id, Ref<CellSlice>& fwd_fee) const {
+  return cs.fetch_ulong(3) == 6
+      && cs.fetch_ref_to(in_msg)
+      && cs.fetch_uint_to(64, transaction_id)
+      && t_Grams.fetch_to(cs, fwd_fee);
+}
+
+bool InMsg::cell_unpack(Ref<vm::Cell> cell_ref, InMsg::Record_msg_discard_fin& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool InMsg::cell_unpack_msg_discard_fin(Ref<vm::Cell> cell_ref, Ref<Cell>& in_msg, unsigned long long& transaction_id, Ref<CellSlice>& fwd_fee) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_msg_discard_fin(cs, in_msg, transaction_id, fwd_fee) && cs.empty_ext();
+}
+
+bool InMsg::unpack(vm::CellSlice& cs, InMsg::Record_msg_discard_tr& data) const {
+  return cs.fetch_ulong(3) == 7
+      && cs.fetch_ref_to(data.in_msg)
+      && cs.fetch_uint_to(64, data.transaction_id)
+      && t_Grams.fetch_to(cs, data.fwd_fee)
+      && cs.fetch_ref_to(data.proof_delivered);
+}
+
+bool InMsg::cell_unpack(Ref<vm::Cell> cell_ref, InMsg::Record_msg_discard_tr& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool InMsg::pack(vm::CellBuilder& cb, const InMsg::Record_msg_import_ext& data) const {
+  return cb.store_long_bool(0, 3)
+      && cb.store_ref_bool(data.msg)
+      && cb.store_ref_bool(data.transaction);
+}
+
+bool InMsg::pack_msg_import_ext(vm::CellBuilder& cb, Ref<Cell> msg, Ref<Cell> transaction) const {
+  return cb.store_long_bool(0, 3)
+      && cb.store_ref_bool(msg)
+      && cb.store_ref_bool(transaction);
+}
+
+bool InMsg::cell_pack(Ref<vm::Cell>& cell_ref, const InMsg::Record_msg_import_ext& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsg::cell_pack_msg_import_ext(Ref<vm::Cell>& cell_ref, Ref<Cell> msg, Ref<Cell> transaction) const {
+  vm::CellBuilder cb;
+  return pack_msg_import_ext(cb, std::move(msg), std::move(transaction)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsg::pack(vm::CellBuilder& cb, const InMsg::Record_msg_import_ihr& data) const {
+  return cb.store_long_bool(2, 3)
+      && cb.store_ref_bool(data.msg)
+      && cb.store_ref_bool(data.transaction)
+      && t_Grams.store_from(cb, data.ihr_fee)
+      && cb.store_ref_bool(data.proof_created);
+}
+
+bool InMsg::cell_pack(Ref<vm::Cell>& cell_ref, const InMsg::Record_msg_import_ihr& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsg::pack(vm::CellBuilder& cb, const InMsg::Record_msg_import_imm& data) const {
+  return cb.store_long_bool(3, 3)
+      && cb.store_ref_bool(data.in_msg)
+      && cb.store_ref_bool(data.transaction)
+      && t_Grams.store_from(cb, data.fwd_fee);
+}
+
+bool InMsg::pack_msg_import_imm(vm::CellBuilder& cb, Ref<Cell> in_msg, Ref<Cell> transaction, Ref<CellSlice> fwd_fee) const {
+  return cb.store_long_bool(3, 3)
+      && cb.store_ref_bool(in_msg)
+      && cb.store_ref_bool(transaction)
+      && t_Grams.store_from(cb, fwd_fee);
+}
+
+bool InMsg::cell_pack(Ref<vm::Cell>& cell_ref, const InMsg::Record_msg_import_imm& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsg::cell_pack_msg_import_imm(Ref<vm::Cell>& cell_ref, Ref<Cell> in_msg, Ref<Cell> transaction, Ref<CellSlice> fwd_fee) const {
+  vm::CellBuilder cb;
+  return pack_msg_import_imm(cb, std::move(in_msg), std::move(transaction), std::move(fwd_fee)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsg::pack(vm::CellBuilder& cb, const InMsg::Record_msg_import_fin& data) const {
+  return cb.store_long_bool(4, 3)
+      && cb.store_ref_bool(data.in_msg)
+      && cb.store_ref_bool(data.transaction)
+      && t_Grams.store_from(cb, data.fwd_fee);
+}
+
+bool InMsg::pack_msg_import_fin(vm::CellBuilder& cb, Ref<Cell> in_msg, Ref<Cell> transaction, Ref<CellSlice> fwd_fee) const {
+  return cb.store_long_bool(4, 3)
+      && cb.store_ref_bool(in_msg)
+      && cb.store_ref_bool(transaction)
+      && t_Grams.store_from(cb, fwd_fee);
+}
+
+bool InMsg::cell_pack(Ref<vm::Cell>& cell_ref, const InMsg::Record_msg_import_fin& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsg::cell_pack_msg_import_fin(Ref<vm::Cell>& cell_ref, Ref<Cell> in_msg, Ref<Cell> transaction, Ref<CellSlice> fwd_fee) const {
+  vm::CellBuilder cb;
+  return pack_msg_import_fin(cb, std::move(in_msg), std::move(transaction), std::move(fwd_fee)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsg::pack(vm::CellBuilder& cb, const InMsg::Record_msg_import_tr& data) const {
+  return cb.store_long_bool(5, 3)
+      && cb.store_ref_bool(data.in_msg)
+      && cb.store_ref_bool(data.out_msg)
+      && t_Grams.store_from(cb, data.transit_fee);
+}
+
+bool InMsg::pack_msg_import_tr(vm::CellBuilder& cb, Ref<Cell> in_msg, Ref<Cell> out_msg, Ref<CellSlice> transit_fee) const {
+  return cb.store_long_bool(5, 3)
+      && cb.store_ref_bool(in_msg)
+      && cb.store_ref_bool(out_msg)
+      && t_Grams.store_from(cb, transit_fee);
+}
+
+bool InMsg::cell_pack(Ref<vm::Cell>& cell_ref, const InMsg::Record_msg_import_tr& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsg::cell_pack_msg_import_tr(Ref<vm::Cell>& cell_ref, Ref<Cell> in_msg, Ref<Cell> out_msg, Ref<CellSlice> transit_fee) const {
+  vm::CellBuilder cb;
+  return pack_msg_import_tr(cb, std::move(in_msg), std::move(out_msg), std::move(transit_fee)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsg::pack(vm::CellBuilder& cb, const InMsg::Record_msg_discard_fin& data) const {
+  return cb.store_long_bool(6, 3)
+      && cb.store_ref_bool(data.in_msg)
+      && cb.store_ulong_rchk_bool(data.transaction_id, 64)
+      && t_Grams.store_from(cb, data.fwd_fee);
+}
+
+bool InMsg::pack_msg_discard_fin(vm::CellBuilder& cb, Ref<Cell> in_msg, unsigned long long transaction_id, Ref<CellSlice> fwd_fee) const {
+  return cb.store_long_bool(6, 3)
+      && cb.store_ref_bool(in_msg)
+      && cb.store_ulong_rchk_bool(transaction_id, 64)
+      && t_Grams.store_from(cb, fwd_fee);
+}
+
+bool InMsg::cell_pack(Ref<vm::Cell>& cell_ref, const InMsg::Record_msg_discard_fin& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsg::cell_pack_msg_discard_fin(Ref<vm::Cell>& cell_ref, Ref<Cell> in_msg, unsigned long long transaction_id, Ref<CellSlice> fwd_fee) const {
+  vm::CellBuilder cb;
+  return pack_msg_discard_fin(cb, std::move(in_msg), transaction_id, std::move(fwd_fee)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsg::pack(vm::CellBuilder& cb, const InMsg::Record_msg_discard_tr& data) const {
+  return cb.store_long_bool(7, 3)
+      && cb.store_ref_bool(data.in_msg)
+      && cb.store_ulong_rchk_bool(data.transaction_id, 64)
+      && t_Grams.store_from(cb, data.fwd_fee)
+      && cb.store_ref_bool(data.proof_delivered);
+}
+
+bool InMsg::cell_pack(Ref<vm::Cell>& cell_ref, const InMsg::Record_msg_discard_tr& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsg::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case msg_import_ext:
+    return cs.fetch_ulong(3) == 0
+        && pp.open("msg_import_ext")
+        && pp.field("msg")
+        && t_Message_Any.print_ref(pp, cs.fetch_ref())
+        && pp.field("transaction")
+        && t_Transaction.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  case msg_import_ihr:
+    return cs.advance(3)
+        && pp.open("msg_import_ihr")
+        && pp.field("msg")
+        && t_Message_Any.print_ref(pp, cs.fetch_ref())
+        && pp.field("transaction")
+        && t_Transaction.print_ref(pp, cs.fetch_ref())
+        && pp.field("ihr_fee")
+        && t_Grams.print_skip(pp, cs)
+        && pp.field("proof_created")
+        && t_Anything.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  case msg_import_imm:
+    return cs.advance(3)
+        && pp.open("msg_import_imm")
+        && pp.field("in_msg")
+        && t_MsgEnvelope.print_ref(pp, cs.fetch_ref())
+        && pp.field("transaction")
+        && t_Transaction.print_ref(pp, cs.fetch_ref())
+        && pp.field("fwd_fee")
+        && t_Grams.print_skip(pp, cs)
+        && pp.close();
+  case msg_import_fin:
+    return cs.advance(3)
+        && pp.open("msg_import_fin")
+        && pp.field("in_msg")
+        && t_MsgEnvelope.print_ref(pp, cs.fetch_ref())
+        && pp.field("transaction")
+        && t_Transaction.print_ref(pp, cs.fetch_ref())
+        && pp.field("fwd_fee")
+        && t_Grams.print_skip(pp, cs)
+        && pp.close();
+  case msg_import_tr:
+    return cs.advance(3)
+        && pp.open("msg_import_tr")
+        && pp.field("in_msg")
+        && t_MsgEnvelope.print_ref(pp, cs.fetch_ref())
+        && pp.field("out_msg")
+        && t_MsgEnvelope.print_ref(pp, cs.fetch_ref())
+        && pp.field("transit_fee")
+        && t_Grams.print_skip(pp, cs)
+        && pp.close();
+  case msg_discard_fin:
+    return cs.advance(3)
+        && pp.open("msg_discard_fin")
+        && pp.field("in_msg")
+        && t_MsgEnvelope.print_ref(pp, cs.fetch_ref())
+        && pp.fetch_uint_field(cs, 64, "transaction_id")
+        && pp.field("fwd_fee")
+        && t_Grams.print_skip(pp, cs)
+        && pp.close();
+  case msg_discard_tr:
+    return cs.advance(3)
+        && pp.open("msg_discard_tr")
+        && pp.field("in_msg")
+        && t_MsgEnvelope.print_ref(pp, cs.fetch_ref())
+        && pp.fetch_uint_field(cs, 64, "transaction_id")
+        && pp.field("fwd_fee")
+        && t_Grams.print_skip(pp, cs)
+        && pp.field("proof_delivered")
+        && t_Anything.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for InMsg");
+}
+
+const InMsg t_InMsg;
+
+//
+// code for type `ImportFees`
+//
+
+int ImportFees::check_tag(const vm::CellSlice& cs) const {
+  return import_fees;
+}
+
+bool ImportFees::skip(vm::CellSlice& cs) const {
+  return t_Grams.skip(cs)
+      && t_CurrencyCollection.skip(cs);
+}
+
+bool ImportFees::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_Grams.validate_skip(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak);
+}
+
+bool ImportFees::unpack(vm::CellSlice& cs, ImportFees::Record& data) const {
+  return t_Grams.fetch_to(cs, data.fees_collected)
+      && t_CurrencyCollection.fetch_to(cs, data.value_imported);
+}
+
+bool ImportFees::unpack_import_fees(vm::CellSlice& cs, Ref<CellSlice>& fees_collected, Ref<CellSlice>& value_imported) const {
+  return t_Grams.fetch_to(cs, fees_collected)
+      && t_CurrencyCollection.fetch_to(cs, value_imported);
+}
+
+bool ImportFees::cell_unpack(Ref<vm::Cell> cell_ref, ImportFees::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ImportFees::cell_unpack_import_fees(Ref<vm::Cell> cell_ref, Ref<CellSlice>& fees_collected, Ref<CellSlice>& value_imported) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_import_fees(cs, fees_collected, value_imported) && cs.empty_ext();
+}
+
+bool ImportFees::pack(vm::CellBuilder& cb, const ImportFees::Record& data) const {
+  return t_Grams.store_from(cb, data.fees_collected)
+      && t_CurrencyCollection.store_from(cb, data.value_imported);
+}
+
+bool ImportFees::pack_import_fees(vm::CellBuilder& cb, Ref<CellSlice> fees_collected, Ref<CellSlice> value_imported) const {
+  return t_Grams.store_from(cb, fees_collected)
+      && t_CurrencyCollection.store_from(cb, value_imported);
+}
+
+bool ImportFees::cell_pack(Ref<vm::Cell>& cell_ref, const ImportFees::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ImportFees::cell_pack_import_fees(Ref<vm::Cell>& cell_ref, Ref<CellSlice> fees_collected, Ref<CellSlice> value_imported) const {
+  vm::CellBuilder cb;
+  return pack_import_fees(cb, std::move(fees_collected), std::move(value_imported)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ImportFees::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("import_fees")
+      && pp.field("fees_collected")
+      && t_Grams.print_skip(pp, cs)
+      && pp.field("value_imported")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ImportFees t_ImportFees;
+
+//
+// code for type `InMsgDescr`
+//
+
+int InMsgDescr::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool InMsgDescr::skip(vm::CellSlice& cs) const {
+  return t_HashmapAugE_256_InMsg_ImportFees.skip(cs);
+}
+
+bool InMsgDescr::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_HashmapAugE_256_InMsg_ImportFees.validate_skip(cs, weak);
+}
+
+bool InMsgDescr::unpack(vm::CellSlice& cs, InMsgDescr::Record& data) const {
+  return t_HashmapAugE_256_InMsg_ImportFees.fetch_to(cs, data.x);
+}
+
+bool InMsgDescr::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_HashmapAugE_256_InMsg_ImportFees.fetch_to(cs, x);
+}
+
+bool InMsgDescr::cell_unpack(Ref<vm::Cell> cell_ref, InMsgDescr::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool InMsgDescr::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, x) && cs.empty_ext();
+}
+
+bool InMsgDescr::pack(vm::CellBuilder& cb, const InMsgDescr::Record& data) const {
+  return t_HashmapAugE_256_InMsg_ImportFees.store_from(cb, data.x);
+}
+
+bool InMsgDescr::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_HashmapAugE_256_InMsg_ImportFees.store_from(cb, x);
+}
+
+bool InMsgDescr::cell_pack(Ref<vm::Cell>& cell_ref, const InMsgDescr::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsgDescr::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool InMsgDescr::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field()
+      && t_HashmapAugE_256_InMsg_ImportFees.print_skip(pp, cs)
+      && pp.close();
+}
+
+const InMsgDescr t_InMsgDescr;
+
+//
+// code for type `OutMsg`
+//
+constexpr unsigned char OutMsg::cons_tag[7];
+
+int OutMsg::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case msg_export_ext:
+    return cs.have(3) ? msg_export_ext : -1;
+  case msg_export_imm:
+    return cs.have(3) ? msg_export_imm : -1;
+  case msg_export_new:
+    return cs.have(3) ? msg_export_new : -1;
+  case msg_export_tr:
+    return cs.have(3) ? msg_export_tr : -1;
+  case msg_export_deq:
+    return cs.have(3) ? msg_export_deq : -1;
+  case msg_export_tr_req:
+    return cs.have(3) ? msg_export_tr_req : -1;
+  case msg_export_deq_imm:
+    return cs.prefetch_ulong(3) == 4 ? msg_export_deq_imm : -1;
+  }
+  return -1;
+}
+
+bool OutMsg::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case msg_export_ext:
+    return cs.advance_ext(0x20003);
+  case msg_export_imm:
+    return cs.advance_ext(0x30003);
+  case msg_export_new:
+    return cs.advance_ext(0x20003);
+  case msg_export_tr:
+    return cs.advance_ext(0x20003);
+  case msg_export_deq:
+    return cs.advance_ext(0x10043);
+  case msg_export_tr_req:
+    return cs.advance_ext(0x20003);
+  case msg_export_deq_imm:
+    return cs.advance_ext(0x20003);
+  }
+  return false;
+}
+
+bool OutMsg::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case msg_export_ext:
+    return cs.advance(3)
+        && t_Message_Any.validate_skip_ref(cs, weak)
+        && t_Transaction.validate_skip_ref(cs, weak);
+  case msg_export_imm:
+    return cs.advance(3)
+        && t_MsgEnvelope.validate_skip_ref(cs, weak)
+        && t_Transaction.validate_skip_ref(cs, weak)
+        && t_InMsg.validate_skip_ref(cs, weak);
+  case msg_export_new:
+    return cs.advance(3)
+        && t_MsgEnvelope.validate_skip_ref(cs, weak)
+        && t_Transaction.validate_skip_ref(cs, weak);
+  case msg_export_tr:
+    return cs.advance(3)
+        && t_MsgEnvelope.validate_skip_ref(cs, weak)
+        && t_InMsg.validate_skip_ref(cs, weak);
+  case msg_export_deq:
+    return cs.advance(3)
+        && t_MsgEnvelope.validate_skip_ref(cs, weak)
+        && cs.advance(64);
+  case msg_export_tr_req:
+    return cs.advance(3)
+        && t_MsgEnvelope.validate_skip_ref(cs, weak)
+        && t_InMsg.validate_skip_ref(cs, weak);
+  case msg_export_deq_imm:
+    return cs.fetch_ulong(3) == 4
+        && t_MsgEnvelope.validate_skip_ref(cs, weak)
+        && t_InMsg.validate_skip_ref(cs, weak);
+  }
+  return false;
+}
+
+bool OutMsg::unpack(vm::CellSlice& cs, OutMsg::Record_msg_export_ext& data) const {
+  return cs.fetch_ulong(3) == 0
+      && cs.fetch_ref_to(data.msg)
+      && cs.fetch_ref_to(data.transaction);
+}
+
+bool OutMsg::unpack_msg_export_ext(vm::CellSlice& cs, Ref<Cell>& msg, Ref<Cell>& transaction) const {
+  return cs.fetch_ulong(3) == 0
+      && cs.fetch_ref_to(msg)
+      && cs.fetch_ref_to(transaction);
+}
+
+bool OutMsg::cell_unpack(Ref<vm::Cell> cell_ref, OutMsg::Record_msg_export_ext& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutMsg::cell_unpack_msg_export_ext(Ref<vm::Cell> cell_ref, Ref<Cell>& msg, Ref<Cell>& transaction) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_msg_export_ext(cs, msg, transaction) && cs.empty_ext();
+}
+
+bool OutMsg::unpack(vm::CellSlice& cs, OutMsg::Record_msg_export_imm& data) const {
+  return cs.fetch_ulong(3) == 2
+      && cs.fetch_ref_to(data.out_msg)
+      && cs.fetch_ref_to(data.transaction)
+      && cs.fetch_ref_to(data.reimport);
+}
+
+bool OutMsg::unpack_msg_export_imm(vm::CellSlice& cs, Ref<Cell>& out_msg, Ref<Cell>& transaction, Ref<Cell>& reimport) const {
+  return cs.fetch_ulong(3) == 2
+      && cs.fetch_ref_to(out_msg)
+      && cs.fetch_ref_to(transaction)
+      && cs.fetch_ref_to(reimport);
+}
+
+bool OutMsg::cell_unpack(Ref<vm::Cell> cell_ref, OutMsg::Record_msg_export_imm& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutMsg::cell_unpack_msg_export_imm(Ref<vm::Cell> cell_ref, Ref<Cell>& out_msg, Ref<Cell>& transaction, Ref<Cell>& reimport) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_msg_export_imm(cs, out_msg, transaction, reimport) && cs.empty_ext();
+}
+
+bool OutMsg::unpack(vm::CellSlice& cs, OutMsg::Record_msg_export_new& data) const {
+  return cs.fetch_ulong(3) == 1
+      && cs.fetch_ref_to(data.out_msg)
+      && cs.fetch_ref_to(data.transaction);
+}
+
+bool OutMsg::unpack_msg_export_new(vm::CellSlice& cs, Ref<Cell>& out_msg, Ref<Cell>& transaction) const {
+  return cs.fetch_ulong(3) == 1
+      && cs.fetch_ref_to(out_msg)
+      && cs.fetch_ref_to(transaction);
+}
+
+bool OutMsg::cell_unpack(Ref<vm::Cell> cell_ref, OutMsg::Record_msg_export_new& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutMsg::cell_unpack_msg_export_new(Ref<vm::Cell> cell_ref, Ref<Cell>& out_msg, Ref<Cell>& transaction) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_msg_export_new(cs, out_msg, transaction) && cs.empty_ext();
+}
+
+bool OutMsg::unpack(vm::CellSlice& cs, OutMsg::Record_msg_export_tr& data) const {
+  return cs.fetch_ulong(3) == 3
+      && cs.fetch_ref_to(data.out_msg)
+      && cs.fetch_ref_to(data.imported);
+}
+
+bool OutMsg::unpack_msg_export_tr(vm::CellSlice& cs, Ref<Cell>& out_msg, Ref<Cell>& imported) const {
+  return cs.fetch_ulong(3) == 3
+      && cs.fetch_ref_to(out_msg)
+      && cs.fetch_ref_to(imported);
+}
+
+bool OutMsg::cell_unpack(Ref<vm::Cell> cell_ref, OutMsg::Record_msg_export_tr& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutMsg::cell_unpack_msg_export_tr(Ref<vm::Cell> cell_ref, Ref<Cell>& out_msg, Ref<Cell>& imported) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_msg_export_tr(cs, out_msg, imported) && cs.empty_ext();
+}
+
+bool OutMsg::unpack(vm::CellSlice& cs, OutMsg::Record_msg_export_deq& data) const {
+  return cs.fetch_ulong(3) == 6
+      && cs.fetch_ref_to(data.out_msg)
+      && cs.fetch_uint_to(64, data.import_block_lt);
+}
+
+bool OutMsg::unpack_msg_export_deq(vm::CellSlice& cs, Ref<Cell>& out_msg, unsigned long long& import_block_lt) const {
+  return cs.fetch_ulong(3) == 6
+      && cs.fetch_ref_to(out_msg)
+      && cs.fetch_uint_to(64, import_block_lt);
+}
+
+bool OutMsg::cell_unpack(Ref<vm::Cell> cell_ref, OutMsg::Record_msg_export_deq& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutMsg::cell_unpack_msg_export_deq(Ref<vm::Cell> cell_ref, Ref<Cell>& out_msg, unsigned long long& import_block_lt) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_msg_export_deq(cs, out_msg, import_block_lt) && cs.empty_ext();
+}
+
+bool OutMsg::unpack(vm::CellSlice& cs, OutMsg::Record_msg_export_tr_req& data) const {
+  return cs.fetch_ulong(3) == 7
+      && cs.fetch_ref_to(data.out_msg)
+      && cs.fetch_ref_to(data.imported);
+}
+
+bool OutMsg::unpack_msg_export_tr_req(vm::CellSlice& cs, Ref<Cell>& out_msg, Ref<Cell>& imported) const {
+  return cs.fetch_ulong(3) == 7
+      && cs.fetch_ref_to(out_msg)
+      && cs.fetch_ref_to(imported);
+}
+
+bool OutMsg::cell_unpack(Ref<vm::Cell> cell_ref, OutMsg::Record_msg_export_tr_req& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutMsg::cell_unpack_msg_export_tr_req(Ref<vm::Cell> cell_ref, Ref<Cell>& out_msg, Ref<Cell>& imported) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_msg_export_tr_req(cs, out_msg, imported) && cs.empty_ext();
+}
+
+bool OutMsg::unpack(vm::CellSlice& cs, OutMsg::Record_msg_export_deq_imm& data) const {
+  return cs.fetch_ulong(3) == 4
+      && cs.fetch_ref_to(data.out_msg)
+      && cs.fetch_ref_to(data.reimport);
+}
+
+bool OutMsg::unpack_msg_export_deq_imm(vm::CellSlice& cs, Ref<Cell>& out_msg, Ref<Cell>& reimport) const {
+  return cs.fetch_ulong(3) == 4
+      && cs.fetch_ref_to(out_msg)
+      && cs.fetch_ref_to(reimport);
+}
+
+bool OutMsg::cell_unpack(Ref<vm::Cell> cell_ref, OutMsg::Record_msg_export_deq_imm& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutMsg::cell_unpack_msg_export_deq_imm(Ref<vm::Cell> cell_ref, Ref<Cell>& out_msg, Ref<Cell>& reimport) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_msg_export_deq_imm(cs, out_msg, reimport) && cs.empty_ext();
+}
+
+bool OutMsg::pack(vm::CellBuilder& cb, const OutMsg::Record_msg_export_ext& data) const {
+  return cb.store_long_bool(0, 3)
+      && cb.store_ref_bool(data.msg)
+      && cb.store_ref_bool(data.transaction);
+}
+
+bool OutMsg::pack_msg_export_ext(vm::CellBuilder& cb, Ref<Cell> msg, Ref<Cell> transaction) const {
+  return cb.store_long_bool(0, 3)
+      && cb.store_ref_bool(msg)
+      && cb.store_ref_bool(transaction);
+}
+
+bool OutMsg::cell_pack(Ref<vm::Cell>& cell_ref, const OutMsg::Record_msg_export_ext& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::cell_pack_msg_export_ext(Ref<vm::Cell>& cell_ref, Ref<Cell> msg, Ref<Cell> transaction) const {
+  vm::CellBuilder cb;
+  return pack_msg_export_ext(cb, std::move(msg), std::move(transaction)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::pack(vm::CellBuilder& cb, const OutMsg::Record_msg_export_imm& data) const {
+  return cb.store_long_bool(2, 3)
+      && cb.store_ref_bool(data.out_msg)
+      && cb.store_ref_bool(data.transaction)
+      && cb.store_ref_bool(data.reimport);
+}
+
+bool OutMsg::pack_msg_export_imm(vm::CellBuilder& cb, Ref<Cell> out_msg, Ref<Cell> transaction, Ref<Cell> reimport) const {
+  return cb.store_long_bool(2, 3)
+      && cb.store_ref_bool(out_msg)
+      && cb.store_ref_bool(transaction)
+      && cb.store_ref_bool(reimport);
+}
+
+bool OutMsg::cell_pack(Ref<vm::Cell>& cell_ref, const OutMsg::Record_msg_export_imm& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::cell_pack_msg_export_imm(Ref<vm::Cell>& cell_ref, Ref<Cell> out_msg, Ref<Cell> transaction, Ref<Cell> reimport) const {
+  vm::CellBuilder cb;
+  return pack_msg_export_imm(cb, std::move(out_msg), std::move(transaction), std::move(reimport)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::pack(vm::CellBuilder& cb, const OutMsg::Record_msg_export_new& data) const {
+  return cb.store_long_bool(1, 3)
+      && cb.store_ref_bool(data.out_msg)
+      && cb.store_ref_bool(data.transaction);
+}
+
+bool OutMsg::pack_msg_export_new(vm::CellBuilder& cb, Ref<Cell> out_msg, Ref<Cell> transaction) const {
+  return cb.store_long_bool(1, 3)
+      && cb.store_ref_bool(out_msg)
+      && cb.store_ref_bool(transaction);
+}
+
+bool OutMsg::cell_pack(Ref<vm::Cell>& cell_ref, const OutMsg::Record_msg_export_new& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::cell_pack_msg_export_new(Ref<vm::Cell>& cell_ref, Ref<Cell> out_msg, Ref<Cell> transaction) const {
+  vm::CellBuilder cb;
+  return pack_msg_export_new(cb, std::move(out_msg), std::move(transaction)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::pack(vm::CellBuilder& cb, const OutMsg::Record_msg_export_tr& data) const {
+  return cb.store_long_bool(3, 3)
+      && cb.store_ref_bool(data.out_msg)
+      && cb.store_ref_bool(data.imported);
+}
+
+bool OutMsg::pack_msg_export_tr(vm::CellBuilder& cb, Ref<Cell> out_msg, Ref<Cell> imported) const {
+  return cb.store_long_bool(3, 3)
+      && cb.store_ref_bool(out_msg)
+      && cb.store_ref_bool(imported);
+}
+
+bool OutMsg::cell_pack(Ref<vm::Cell>& cell_ref, const OutMsg::Record_msg_export_tr& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::cell_pack_msg_export_tr(Ref<vm::Cell>& cell_ref, Ref<Cell> out_msg, Ref<Cell> imported) const {
+  vm::CellBuilder cb;
+  return pack_msg_export_tr(cb, std::move(out_msg), std::move(imported)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::pack(vm::CellBuilder& cb, const OutMsg::Record_msg_export_deq& data) const {
+  return cb.store_long_bool(6, 3)
+      && cb.store_ref_bool(data.out_msg)
+      && cb.store_ulong_rchk_bool(data.import_block_lt, 64);
+}
+
+bool OutMsg::pack_msg_export_deq(vm::CellBuilder& cb, Ref<Cell> out_msg, unsigned long long import_block_lt) const {
+  return cb.store_long_bool(6, 3)
+      && cb.store_ref_bool(out_msg)
+      && cb.store_ulong_rchk_bool(import_block_lt, 64);
+}
+
+bool OutMsg::cell_pack(Ref<vm::Cell>& cell_ref, const OutMsg::Record_msg_export_deq& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::cell_pack_msg_export_deq(Ref<vm::Cell>& cell_ref, Ref<Cell> out_msg, unsigned long long import_block_lt) const {
+  vm::CellBuilder cb;
+  return pack_msg_export_deq(cb, std::move(out_msg), import_block_lt) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::pack(vm::CellBuilder& cb, const OutMsg::Record_msg_export_tr_req& data) const {
+  return cb.store_long_bool(7, 3)
+      && cb.store_ref_bool(data.out_msg)
+      && cb.store_ref_bool(data.imported);
+}
+
+bool OutMsg::pack_msg_export_tr_req(vm::CellBuilder& cb, Ref<Cell> out_msg, Ref<Cell> imported) const {
+  return cb.store_long_bool(7, 3)
+      && cb.store_ref_bool(out_msg)
+      && cb.store_ref_bool(imported);
+}
+
+bool OutMsg::cell_pack(Ref<vm::Cell>& cell_ref, const OutMsg::Record_msg_export_tr_req& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::cell_pack_msg_export_tr_req(Ref<vm::Cell>& cell_ref, Ref<Cell> out_msg, Ref<Cell> imported) const {
+  vm::CellBuilder cb;
+  return pack_msg_export_tr_req(cb, std::move(out_msg), std::move(imported)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::pack(vm::CellBuilder& cb, const OutMsg::Record_msg_export_deq_imm& data) const {
+  return cb.store_long_bool(4, 3)
+      && cb.store_ref_bool(data.out_msg)
+      && cb.store_ref_bool(data.reimport);
+}
+
+bool OutMsg::pack_msg_export_deq_imm(vm::CellBuilder& cb, Ref<Cell> out_msg, Ref<Cell> reimport) const {
+  return cb.store_long_bool(4, 3)
+      && cb.store_ref_bool(out_msg)
+      && cb.store_ref_bool(reimport);
+}
+
+bool OutMsg::cell_pack(Ref<vm::Cell>& cell_ref, const OutMsg::Record_msg_export_deq_imm& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::cell_pack_msg_export_deq_imm(Ref<vm::Cell>& cell_ref, Ref<Cell> out_msg, Ref<Cell> reimport) const {
+  vm::CellBuilder cb;
+  return pack_msg_export_deq_imm(cb, std::move(out_msg), std::move(reimport)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsg::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case msg_export_ext:
+    return cs.advance(3)
+        && pp.open("msg_export_ext")
+        && pp.field("msg")
+        && t_Message_Any.print_ref(pp, cs.fetch_ref())
+        && pp.field("transaction")
+        && t_Transaction.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  case msg_export_imm:
+    return cs.advance(3)
+        && pp.open("msg_export_imm")
+        && pp.field("out_msg")
+        && t_MsgEnvelope.print_ref(pp, cs.fetch_ref())
+        && pp.field("transaction")
+        && t_Transaction.print_ref(pp, cs.fetch_ref())
+        && pp.field("reimport")
+        && t_InMsg.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  case msg_export_new:
+    return cs.advance(3)
+        && pp.open("msg_export_new")
+        && pp.field("out_msg")
+        && t_MsgEnvelope.print_ref(pp, cs.fetch_ref())
+        && pp.field("transaction")
+        && t_Transaction.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  case msg_export_tr:
+    return cs.advance(3)
+        && pp.open("msg_export_tr")
+        && pp.field("out_msg")
+        && t_MsgEnvelope.print_ref(pp, cs.fetch_ref())
+        && pp.field("imported")
+        && t_InMsg.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  case msg_export_deq:
+    return cs.advance(3)
+        && pp.open("msg_export_deq")
+        && pp.field("out_msg")
+        && t_MsgEnvelope.print_ref(pp, cs.fetch_ref())
+        && pp.fetch_uint_field(cs, 64, "import_block_lt")
+        && pp.close();
+  case msg_export_tr_req:
+    return cs.advance(3)
+        && pp.open("msg_export_tr_req")
+        && pp.field("out_msg")
+        && t_MsgEnvelope.print_ref(pp, cs.fetch_ref())
+        && pp.field("imported")
+        && t_InMsg.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  case msg_export_deq_imm:
+    return cs.fetch_ulong(3) == 4
+        && pp.open("msg_export_deq_imm")
+        && pp.field("out_msg")
+        && t_MsgEnvelope.print_ref(pp, cs.fetch_ref())
+        && pp.field("reimport")
+        && t_InMsg.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for OutMsg");
+}
+
+const OutMsg t_OutMsg;
+
+//
+// code for type `EnqueuedMsg`
+//
+
+int EnqueuedMsg::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool EnqueuedMsg::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.advance(64)
+      && t_MsgEnvelope.validate_skip_ref(cs, weak);
+}
+
+bool EnqueuedMsg::unpack(vm::CellSlice& cs, EnqueuedMsg::Record& data) const {
+  return cs.fetch_uint_to(64, data.enqueued_lt)
+      && cs.fetch_ref_to(data.out_msg);
+}
+
+bool EnqueuedMsg::unpack_cons1(vm::CellSlice& cs, unsigned long long& enqueued_lt, Ref<Cell>& out_msg) const {
+  return cs.fetch_uint_to(64, enqueued_lt)
+      && cs.fetch_ref_to(out_msg);
+}
+
+bool EnqueuedMsg::cell_unpack(Ref<vm::Cell> cell_ref, EnqueuedMsg::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool EnqueuedMsg::cell_unpack_cons1(Ref<vm::Cell> cell_ref, unsigned long long& enqueued_lt, Ref<Cell>& out_msg) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, enqueued_lt, out_msg) && cs.empty_ext();
+}
+
+bool EnqueuedMsg::pack(vm::CellBuilder& cb, const EnqueuedMsg::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.enqueued_lt, 64)
+      && cb.store_ref_bool(data.out_msg);
+}
+
+bool EnqueuedMsg::pack_cons1(vm::CellBuilder& cb, unsigned long long enqueued_lt, Ref<Cell> out_msg) const {
+  return cb.store_ulong_rchk_bool(enqueued_lt, 64)
+      && cb.store_ref_bool(out_msg);
+}
+
+bool EnqueuedMsg::cell_pack(Ref<vm::Cell>& cell_ref, const EnqueuedMsg::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool EnqueuedMsg::cell_pack_cons1(Ref<vm::Cell>& cell_ref, unsigned long long enqueued_lt, Ref<Cell> out_msg) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, enqueued_lt, std::move(out_msg)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool EnqueuedMsg::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.fetch_uint_field(cs, 64, "enqueued_lt")
+      && pp.field("out_msg")
+      && t_MsgEnvelope.print_ref(pp, cs.fetch_ref())
+      && pp.close();
+}
+
+const EnqueuedMsg t_EnqueuedMsg;
+
+//
+// code for type `OutMsgDescr`
+//
+
+int OutMsgDescr::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool OutMsgDescr::skip(vm::CellSlice& cs) const {
+  return t_HashmapAugE_256_OutMsg_CurrencyCollection.skip(cs);
+}
+
+bool OutMsgDescr::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_HashmapAugE_256_OutMsg_CurrencyCollection.validate_skip(cs, weak);
+}
+
+bool OutMsgDescr::unpack(vm::CellSlice& cs, OutMsgDescr::Record& data) const {
+  return t_HashmapAugE_256_OutMsg_CurrencyCollection.fetch_to(cs, data.x);
+}
+
+bool OutMsgDescr::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_HashmapAugE_256_OutMsg_CurrencyCollection.fetch_to(cs, x);
+}
+
+bool OutMsgDescr::cell_unpack(Ref<vm::Cell> cell_ref, OutMsgDescr::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutMsgDescr::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, x) && cs.empty_ext();
+}
+
+bool OutMsgDescr::pack(vm::CellBuilder& cb, const OutMsgDescr::Record& data) const {
+  return t_HashmapAugE_256_OutMsg_CurrencyCollection.store_from(cb, data.x);
+}
+
+bool OutMsgDescr::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_HashmapAugE_256_OutMsg_CurrencyCollection.store_from(cb, x);
+}
+
+bool OutMsgDescr::cell_pack(Ref<vm::Cell>& cell_ref, const OutMsgDescr::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsgDescr::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsgDescr::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field()
+      && t_HashmapAugE_256_OutMsg_CurrencyCollection.print_skip(pp, cs)
+      && pp.close();
+}
+
+const OutMsgDescr t_OutMsgDescr;
+
+//
+// code for type `OutMsgQueue`
+//
+
+int OutMsgQueue::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool OutMsgQueue::skip(vm::CellSlice& cs) const {
+  return t_HashmapAugE_352_EnqueuedMsg_uint64.skip(cs);
+}
+
+bool OutMsgQueue::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_HashmapAugE_352_EnqueuedMsg_uint64.validate_skip(cs, weak);
+}
+
+bool OutMsgQueue::unpack(vm::CellSlice& cs, OutMsgQueue::Record& data) const {
+  return t_HashmapAugE_352_EnqueuedMsg_uint64.fetch_to(cs, data.x);
+}
+
+bool OutMsgQueue::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_HashmapAugE_352_EnqueuedMsg_uint64.fetch_to(cs, x);
+}
+
+bool OutMsgQueue::cell_unpack(Ref<vm::Cell> cell_ref, OutMsgQueue::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutMsgQueue::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, x) && cs.empty_ext();
+}
+
+bool OutMsgQueue::pack(vm::CellBuilder& cb, const OutMsgQueue::Record& data) const {
+  return t_HashmapAugE_352_EnqueuedMsg_uint64.store_from(cb, data.x);
+}
+
+bool OutMsgQueue::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_HashmapAugE_352_EnqueuedMsg_uint64.store_from(cb, x);
+}
+
+bool OutMsgQueue::cell_pack(Ref<vm::Cell>& cell_ref, const OutMsgQueue::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsgQueue::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsgQueue::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field()
+      && t_HashmapAugE_352_EnqueuedMsg_uint64.print_skip(pp, cs)
+      && pp.close();
+}
+
+const OutMsgQueue t_OutMsgQueue;
+
+//
+// code for type `ProcessedUpto`
+//
+
+int ProcessedUpto::check_tag(const vm::CellSlice& cs) const {
+  return processed_upto;
+}
+
+bool ProcessedUpto::unpack(vm::CellSlice& cs, ProcessedUpto::Record& data) const {
+  return cs.fetch_uint_to(64, data.last_msg_lt)
+      && cs.fetch_bits_to(data.last_msg_hash.bits(), 256);
+}
+
+bool ProcessedUpto::unpack_processed_upto(vm::CellSlice& cs, unsigned long long& last_msg_lt, td::BitArray<256>& last_msg_hash) const {
+  return cs.fetch_uint_to(64, last_msg_lt)
+      && cs.fetch_bits_to(last_msg_hash.bits(), 256);
+}
+
+bool ProcessedUpto::cell_unpack(Ref<vm::Cell> cell_ref, ProcessedUpto::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ProcessedUpto::cell_unpack_processed_upto(Ref<vm::Cell> cell_ref, unsigned long long& last_msg_lt, td::BitArray<256>& last_msg_hash) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_processed_upto(cs, last_msg_lt, last_msg_hash) && cs.empty_ext();
+}
+
+bool ProcessedUpto::pack(vm::CellBuilder& cb, const ProcessedUpto::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.last_msg_lt, 64)
+      && cb.store_bits_bool(data.last_msg_hash.cbits(), 256);
+}
+
+bool ProcessedUpto::pack_processed_upto(vm::CellBuilder& cb, unsigned long long last_msg_lt, td::BitArray<256> last_msg_hash) const {
+  return cb.store_ulong_rchk_bool(last_msg_lt, 64)
+      && cb.store_bits_bool(last_msg_hash.cbits(), 256);
+}
+
+bool ProcessedUpto::cell_pack(Ref<vm::Cell>& cell_ref, const ProcessedUpto::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ProcessedUpto::cell_pack_processed_upto(Ref<vm::Cell>& cell_ref, unsigned long long last_msg_lt, td::BitArray<256> last_msg_hash) const {
+  vm::CellBuilder cb;
+  return pack_processed_upto(cb, last_msg_lt, last_msg_hash) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ProcessedUpto::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("processed_upto")
+      && pp.fetch_uint_field(cs, 64, "last_msg_lt")
+      && pp.fetch_bits_field(cs, 256, "last_msg_hash")
+      && pp.close();
+}
+
+const ProcessedUpto t_ProcessedUpto;
+
+//
+// code for type `ProcessedInfo`
+//
+
+int ProcessedInfo::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool ProcessedInfo::skip(vm::CellSlice& cs) const {
+  return t_HashmapE_96_ProcessedUpto.skip(cs);
+}
+
+bool ProcessedInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_HashmapE_96_ProcessedUpto.validate_skip(cs, weak);
+}
+
+bool ProcessedInfo::unpack(vm::CellSlice& cs, ProcessedInfo::Record& data) const {
+  return t_HashmapE_96_ProcessedUpto.fetch_to(cs, data.x);
+}
+
+bool ProcessedInfo::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_HashmapE_96_ProcessedUpto.fetch_to(cs, x);
+}
+
+bool ProcessedInfo::cell_unpack(Ref<vm::Cell> cell_ref, ProcessedInfo::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ProcessedInfo::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, x) && cs.empty_ext();
+}
+
+bool ProcessedInfo::pack(vm::CellBuilder& cb, const ProcessedInfo::Record& data) const {
+  return t_HashmapE_96_ProcessedUpto.store_from(cb, data.x);
+}
+
+bool ProcessedInfo::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_HashmapE_96_ProcessedUpto.store_from(cb, x);
+}
+
+bool ProcessedInfo::cell_pack(Ref<vm::Cell>& cell_ref, const ProcessedInfo::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ProcessedInfo::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ProcessedInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field()
+      && t_HashmapE_96_ProcessedUpto.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ProcessedInfo t_ProcessedInfo;
+
+//
+// code for type `IhrPendingSince`
+//
+
+int IhrPendingSince::check_tag(const vm::CellSlice& cs) const {
+  return ihr_pending;
+}
+
+bool IhrPendingSince::unpack(vm::CellSlice& cs, IhrPendingSince::Record& data) const {
+  return cs.fetch_uint_to(64, data.import_lt);
+}
+
+bool IhrPendingSince::unpack_ihr_pending(vm::CellSlice& cs, unsigned long long& import_lt) const {
+  return cs.fetch_uint_to(64, import_lt);
+}
+
+bool IhrPendingSince::cell_unpack(Ref<vm::Cell> cell_ref, IhrPendingSince::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool IhrPendingSince::cell_unpack_ihr_pending(Ref<vm::Cell> cell_ref, unsigned long long& import_lt) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_ihr_pending(cs, import_lt) && cs.empty_ext();
+}
+
+bool IhrPendingSince::pack(vm::CellBuilder& cb, const IhrPendingSince::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.import_lt, 64);
+}
+
+bool IhrPendingSince::pack_ihr_pending(vm::CellBuilder& cb, unsigned long long import_lt) const {
+  return cb.store_ulong_rchk_bool(import_lt, 64);
+}
+
+bool IhrPendingSince::cell_pack(Ref<vm::Cell>& cell_ref, const IhrPendingSince::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool IhrPendingSince::cell_pack_ihr_pending(Ref<vm::Cell>& cell_ref, unsigned long long import_lt) const {
+  vm::CellBuilder cb;
+  return pack_ihr_pending(cb, import_lt) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool IhrPendingSince::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("ihr_pending")
+      && pp.fetch_uint_field(cs, 64, "import_lt")
+      && pp.close();
+}
+
+const IhrPendingSince t_IhrPendingSince;
+
+//
+// code for type `IhrPendingInfo`
+//
+
+int IhrPendingInfo::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool IhrPendingInfo::skip(vm::CellSlice& cs) const {
+  return t_HashmapE_320_IhrPendingSince.skip(cs);
+}
+
+bool IhrPendingInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_HashmapE_320_IhrPendingSince.validate_skip(cs, weak);
+}
+
+bool IhrPendingInfo::unpack(vm::CellSlice& cs, IhrPendingInfo::Record& data) const {
+  return t_HashmapE_320_IhrPendingSince.fetch_to(cs, data.x);
+}
+
+bool IhrPendingInfo::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_HashmapE_320_IhrPendingSince.fetch_to(cs, x);
+}
+
+bool IhrPendingInfo::cell_unpack(Ref<vm::Cell> cell_ref, IhrPendingInfo::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool IhrPendingInfo::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, x) && cs.empty_ext();
+}
+
+bool IhrPendingInfo::pack(vm::CellBuilder& cb, const IhrPendingInfo::Record& data) const {
+  return t_HashmapE_320_IhrPendingSince.store_from(cb, data.x);
+}
+
+bool IhrPendingInfo::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_HashmapE_320_IhrPendingSince.store_from(cb, x);
+}
+
+bool IhrPendingInfo::cell_pack(Ref<vm::Cell>& cell_ref, const IhrPendingInfo::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool IhrPendingInfo::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool IhrPendingInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field()
+      && t_HashmapE_320_IhrPendingSince.print_skip(pp, cs)
+      && pp.close();
+}
+
+const IhrPendingInfo t_IhrPendingInfo;
+
+//
+// code for type `OutMsgQueueInfo`
+//
+
+int OutMsgQueueInfo::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool OutMsgQueueInfo::skip(vm::CellSlice& cs) const {
+  return t_OutMsgQueue.skip(cs)
+      && t_ProcessedInfo.skip(cs)
+      && t_IhrPendingInfo.skip(cs);
+}
+
+bool OutMsgQueueInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_OutMsgQueue.validate_skip(cs, weak)
+      && t_ProcessedInfo.validate_skip(cs, weak)
+      && t_IhrPendingInfo.validate_skip(cs, weak);
+}
+
+bool OutMsgQueueInfo::unpack(vm::CellSlice& cs, OutMsgQueueInfo::Record& data) const {
+  return t_OutMsgQueue.fetch_to(cs, data.out_queue)
+      && t_ProcessedInfo.fetch_to(cs, data.proc_info)
+      && t_IhrPendingInfo.fetch_to(cs, data.ihr_pending);
+}
+
+bool OutMsgQueueInfo::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& out_queue, Ref<CellSlice>& proc_info, Ref<CellSlice>& ihr_pending) const {
+  return t_OutMsgQueue.fetch_to(cs, out_queue)
+      && t_ProcessedInfo.fetch_to(cs, proc_info)
+      && t_IhrPendingInfo.fetch_to(cs, ihr_pending);
+}
+
+bool OutMsgQueueInfo::cell_unpack(Ref<vm::Cell> cell_ref, OutMsgQueueInfo::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutMsgQueueInfo::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& out_queue, Ref<CellSlice>& proc_info, Ref<CellSlice>& ihr_pending) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, out_queue, proc_info, ihr_pending) && cs.empty_ext();
+}
+
+bool OutMsgQueueInfo::pack(vm::CellBuilder& cb, const OutMsgQueueInfo::Record& data) const {
+  return t_OutMsgQueue.store_from(cb, data.out_queue)
+      && t_ProcessedInfo.store_from(cb, data.proc_info)
+      && t_IhrPendingInfo.store_from(cb, data.ihr_pending);
+}
+
+bool OutMsgQueueInfo::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> out_queue, Ref<CellSlice> proc_info, Ref<CellSlice> ihr_pending) const {
+  return t_OutMsgQueue.store_from(cb, out_queue)
+      && t_ProcessedInfo.store_from(cb, proc_info)
+      && t_IhrPendingInfo.store_from(cb, ihr_pending);
+}
+
+bool OutMsgQueueInfo::cell_pack(Ref<vm::Cell>& cell_ref, const OutMsgQueueInfo::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsgQueueInfo::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> out_queue, Ref<CellSlice> proc_info, Ref<CellSlice> ihr_pending) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(out_queue), std::move(proc_info), std::move(ihr_pending)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutMsgQueueInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field("out_queue")
+      && t_OutMsgQueue.print_skip(pp, cs)
+      && pp.field("proc_info")
+      && t_ProcessedInfo.print_skip(pp, cs)
+      && pp.field("ihr_pending")
+      && t_IhrPendingInfo.print_skip(pp, cs)
+      && pp.close();
+}
+
+const OutMsgQueueInfo t_OutMsgQueueInfo;
+
+//
+// code for type `StorageUsed`
+//
+
+int StorageUsed::check_tag(const vm::CellSlice& cs) const {
+  return storage_used;
+}
+
+bool StorageUsed::skip(vm::CellSlice& cs) const {
+  return t_VarUInteger_7.skip(cs)
+      && t_VarUInteger_7.skip(cs)
+      && t_VarUInteger_7.skip(cs);
+}
+
+bool StorageUsed::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_VarUInteger_7.validate_skip(cs, weak)
+      && t_VarUInteger_7.validate_skip(cs, weak)
+      && t_VarUInteger_7.validate_skip(cs, weak);
+}
+
+bool StorageUsed::unpack(vm::CellSlice& cs, StorageUsed::Record& data) const {
+  return t_VarUInteger_7.fetch_to(cs, data.cells)
+      && t_VarUInteger_7.fetch_to(cs, data.bits)
+      && t_VarUInteger_7.fetch_to(cs, data.public_cells);
+}
+
+bool StorageUsed::unpack_storage_used(vm::CellSlice& cs, Ref<CellSlice>& cells, Ref<CellSlice>& bits, Ref<CellSlice>& public_cells) const {
+  return t_VarUInteger_7.fetch_to(cs, cells)
+      && t_VarUInteger_7.fetch_to(cs, bits)
+      && t_VarUInteger_7.fetch_to(cs, public_cells);
+}
+
+bool StorageUsed::cell_unpack(Ref<vm::Cell> cell_ref, StorageUsed::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool StorageUsed::cell_unpack_storage_used(Ref<vm::Cell> cell_ref, Ref<CellSlice>& cells, Ref<CellSlice>& bits, Ref<CellSlice>& public_cells) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_storage_used(cs, cells, bits, public_cells) && cs.empty_ext();
+}
+
+bool StorageUsed::pack(vm::CellBuilder& cb, const StorageUsed::Record& data) const {
+  return t_VarUInteger_7.store_from(cb, data.cells)
+      && t_VarUInteger_7.store_from(cb, data.bits)
+      && t_VarUInteger_7.store_from(cb, data.public_cells);
+}
+
+bool StorageUsed::pack_storage_used(vm::CellBuilder& cb, Ref<CellSlice> cells, Ref<CellSlice> bits, Ref<CellSlice> public_cells) const {
+  return t_VarUInteger_7.store_from(cb, cells)
+      && t_VarUInteger_7.store_from(cb, bits)
+      && t_VarUInteger_7.store_from(cb, public_cells);
+}
+
+bool StorageUsed::cell_pack(Ref<vm::Cell>& cell_ref, const StorageUsed::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool StorageUsed::cell_pack_storage_used(Ref<vm::Cell>& cell_ref, Ref<CellSlice> cells, Ref<CellSlice> bits, Ref<CellSlice> public_cells) const {
+  vm::CellBuilder cb;
+  return pack_storage_used(cb, std::move(cells), std::move(bits), std::move(public_cells)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool StorageUsed::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("storage_used")
+      && pp.field("cells")
+      && t_VarUInteger_7.print_skip(pp, cs)
+      && pp.field("bits")
+      && t_VarUInteger_7.print_skip(pp, cs)
+      && pp.field("public_cells")
+      && t_VarUInteger_7.print_skip(pp, cs)
+      && pp.close();
+}
+
+const StorageUsed t_StorageUsed;
+
+//
+// code for type `StorageUsedShort`
+//
+
+int StorageUsedShort::check_tag(const vm::CellSlice& cs) const {
+  return storage_used_short;
+}
+
+bool StorageUsedShort::skip(vm::CellSlice& cs) const {
+  return t_VarUInteger_7.skip(cs)
+      && t_VarUInteger_7.skip(cs);
+}
+
+bool StorageUsedShort::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_VarUInteger_7.validate_skip(cs, weak)
+      && t_VarUInteger_7.validate_skip(cs, weak);
+}
+
+bool StorageUsedShort::unpack(vm::CellSlice& cs, StorageUsedShort::Record& data) const {
+  return t_VarUInteger_7.fetch_to(cs, data.cells)
+      && t_VarUInteger_7.fetch_to(cs, data.bits);
+}
+
+bool StorageUsedShort::unpack_storage_used_short(vm::CellSlice& cs, Ref<CellSlice>& cells, Ref<CellSlice>& bits) const {
+  return t_VarUInteger_7.fetch_to(cs, cells)
+      && t_VarUInteger_7.fetch_to(cs, bits);
+}
+
+bool StorageUsedShort::cell_unpack(Ref<vm::Cell> cell_ref, StorageUsedShort::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool StorageUsedShort::cell_unpack_storage_used_short(Ref<vm::Cell> cell_ref, Ref<CellSlice>& cells, Ref<CellSlice>& bits) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_storage_used_short(cs, cells, bits) && cs.empty_ext();
+}
+
+bool StorageUsedShort::pack(vm::CellBuilder& cb, const StorageUsedShort::Record& data) const {
+  return t_VarUInteger_7.store_from(cb, data.cells)
+      && t_VarUInteger_7.store_from(cb, data.bits);
+}
+
+bool StorageUsedShort::pack_storage_used_short(vm::CellBuilder& cb, Ref<CellSlice> cells, Ref<CellSlice> bits) const {
+  return t_VarUInteger_7.store_from(cb, cells)
+      && t_VarUInteger_7.store_from(cb, bits);
+}
+
+bool StorageUsedShort::cell_pack(Ref<vm::Cell>& cell_ref, const StorageUsedShort::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool StorageUsedShort::cell_pack_storage_used_short(Ref<vm::Cell>& cell_ref, Ref<CellSlice> cells, Ref<CellSlice> bits) const {
+  vm::CellBuilder cb;
+  return pack_storage_used_short(cb, std::move(cells), std::move(bits)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool StorageUsedShort::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("storage_used_short")
+      && pp.field("cells")
+      && t_VarUInteger_7.print_skip(pp, cs)
+      && pp.field("bits")
+      && t_VarUInteger_7.print_skip(pp, cs)
+      && pp.close();
+}
+
+const StorageUsedShort t_StorageUsedShort;
+
+//
+// code for type `StorageInfo`
+//
+
+int StorageInfo::check_tag(const vm::CellSlice& cs) const {
+  return storage_info;
+}
+
+bool StorageInfo::skip(vm::CellSlice& cs) const {
+  return t_StorageUsed.skip(cs)
+      && cs.advance(32)
+      && t_Maybe_Grams.skip(cs);
+}
+
+bool StorageInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_StorageUsed.validate_skip(cs, weak)
+      && cs.advance(32)
+      && t_Maybe_Grams.validate_skip(cs, weak);
+}
+
+bool StorageInfo::unpack(vm::CellSlice& cs, StorageInfo::Record& data) const {
+  return t_StorageUsed.fetch_to(cs, data.used)
+      && cs.fetch_uint_to(32, data.last_paid)
+      && t_Maybe_Grams.fetch_to(cs, data.due_payment);
+}
+
+bool StorageInfo::unpack_storage_info(vm::CellSlice& cs, Ref<CellSlice>& used, unsigned& last_paid, Ref<CellSlice>& due_payment) const {
+  return t_StorageUsed.fetch_to(cs, used)
+      && cs.fetch_uint_to(32, last_paid)
+      && t_Maybe_Grams.fetch_to(cs, due_payment);
+}
+
+bool StorageInfo::cell_unpack(Ref<vm::Cell> cell_ref, StorageInfo::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool StorageInfo::cell_unpack_storage_info(Ref<vm::Cell> cell_ref, Ref<CellSlice>& used, unsigned& last_paid, Ref<CellSlice>& due_payment) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_storage_info(cs, used, last_paid, due_payment) && cs.empty_ext();
+}
+
+bool StorageInfo::pack(vm::CellBuilder& cb, const StorageInfo::Record& data) const {
+  return t_StorageUsed.store_from(cb, data.used)
+      && cb.store_ulong_rchk_bool(data.last_paid, 32)
+      && t_Maybe_Grams.store_from(cb, data.due_payment);
+}
+
+bool StorageInfo::pack_storage_info(vm::CellBuilder& cb, Ref<CellSlice> used, unsigned last_paid, Ref<CellSlice> due_payment) const {
+  return t_StorageUsed.store_from(cb, used)
+      && cb.store_ulong_rchk_bool(last_paid, 32)
+      && t_Maybe_Grams.store_from(cb, due_payment);
+}
+
+bool StorageInfo::cell_pack(Ref<vm::Cell>& cell_ref, const StorageInfo::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool StorageInfo::cell_pack_storage_info(Ref<vm::Cell>& cell_ref, Ref<CellSlice> used, unsigned last_paid, Ref<CellSlice> due_payment) const {
+  vm::CellBuilder cb;
+  return pack_storage_info(cb, std::move(used), last_paid, std::move(due_payment)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool StorageInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("storage_info")
+      && pp.field("used")
+      && t_StorageUsed.print_skip(pp, cs)
+      && pp.fetch_uint_field(cs, 32, "last_paid")
+      && pp.field("due_payment")
+      && t_Maybe_Grams.print_skip(pp, cs)
+      && pp.close();
+}
+
+const StorageInfo t_StorageInfo;
+
+//
+// code for type `Account`
+//
+
+int Account::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case account_none:
+    return cs.have(1) ? account_none : -1;
+  case account:
+    return cs.have(1) ? account : -1;
+  }
+  return -1;
+}
+
+bool Account::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case account_none:
+    return cs.advance(1);
+  case account:
+    return cs.advance(1)
+        && t_MsgAddressInt.skip(cs)
+        && t_StorageInfo.skip(cs)
+        && t_AccountStorage.skip(cs);
+  }
+  return false;
+}
+
+bool Account::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case account_none:
+    return cs.advance(1);
+  case account:
+    return cs.advance(1)
+        && t_MsgAddressInt.validate_skip(cs, weak)
+        && t_StorageInfo.validate_skip(cs, weak)
+        && t_AccountStorage.validate_skip(cs, weak);
+  }
+  return false;
+}
+
+bool Account::unpack(vm::CellSlice& cs, Account::Record_account_none& data) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool Account::unpack_account_none(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool Account::cell_unpack(Ref<vm::Cell> cell_ref, Account::Record_account_none& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Account::cell_unpack_account_none(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_account_none(cs) && cs.empty_ext();
+}
+
+bool Account::unpack(vm::CellSlice& cs, Account::Record_account& data) const {
+  return cs.fetch_ulong(1) == 1
+      && t_MsgAddressInt.fetch_to(cs, data.addr)
+      && t_StorageInfo.fetch_to(cs, data.storage_stat)
+      && t_AccountStorage.fetch_to(cs, data.storage);
+}
+
+bool Account::unpack_account(vm::CellSlice& cs, Ref<CellSlice>& addr, Ref<CellSlice>& storage_stat, Ref<CellSlice>& storage) const {
+  return cs.fetch_ulong(1) == 1
+      && t_MsgAddressInt.fetch_to(cs, addr)
+      && t_StorageInfo.fetch_to(cs, storage_stat)
+      && t_AccountStorage.fetch_to(cs, storage);
+}
+
+bool Account::cell_unpack(Ref<vm::Cell> cell_ref, Account::Record_account& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Account::cell_unpack_account(Ref<vm::Cell> cell_ref, Ref<CellSlice>& addr, Ref<CellSlice>& storage_stat, Ref<CellSlice>& storage) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_account(cs, addr, storage_stat, storage) && cs.empty_ext();
+}
+
+bool Account::pack(vm::CellBuilder& cb, const Account::Record_account_none& data) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool Account::pack_account_none(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool Account::cell_pack(Ref<vm::Cell>& cell_ref, const Account::Record_account_none& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Account::cell_pack_account_none(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_account_none(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Account::pack(vm::CellBuilder& cb, const Account::Record_account& data) const {
+  return cb.store_long_bool(1, 1)
+      && t_MsgAddressInt.store_from(cb, data.addr)
+      && t_StorageInfo.store_from(cb, data.storage_stat)
+      && t_AccountStorage.store_from(cb, data.storage);
+}
+
+bool Account::pack_account(vm::CellBuilder& cb, Ref<CellSlice> addr, Ref<CellSlice> storage_stat, Ref<CellSlice> storage) const {
+  return cb.store_long_bool(1, 1)
+      && t_MsgAddressInt.store_from(cb, addr)
+      && t_StorageInfo.store_from(cb, storage_stat)
+      && t_AccountStorage.store_from(cb, storage);
+}
+
+bool Account::cell_pack(Ref<vm::Cell>& cell_ref, const Account::Record_account& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Account::cell_pack_account(Ref<vm::Cell>& cell_ref, Ref<CellSlice> addr, Ref<CellSlice> storage_stat, Ref<CellSlice> storage) const {
+  vm::CellBuilder cb;
+  return pack_account(cb, std::move(addr), std::move(storage_stat), std::move(storage)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Account::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case account_none:
+    return cs.advance(1)
+        && pp.cons("account_none");
+  case account:
+    return cs.advance(1)
+        && pp.open("account")
+        && pp.field("addr")
+        && t_MsgAddressInt.print_skip(pp, cs)
+        && pp.field("storage_stat")
+        && t_StorageInfo.print_skip(pp, cs)
+        && pp.field("storage")
+        && t_AccountStorage.print_skip(pp, cs)
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for Account");
+}
+
+const Account t_Account;
+
+//
+// code for type `AccountStorage`
+//
+
+int AccountStorage::check_tag(const vm::CellSlice& cs) const {
+  return account_storage;
+}
+
+bool AccountStorage::skip(vm::CellSlice& cs) const {
+  return cs.advance(64)
+      && t_CurrencyCollection.skip(cs)
+      && t_AccountState.skip(cs);
+}
+
+bool AccountStorage::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.advance(64)
+      && t_CurrencyCollection.validate_skip(cs, weak)
+      && t_AccountState.validate_skip(cs, weak);
+}
+
+bool AccountStorage::unpack(vm::CellSlice& cs, AccountStorage::Record& data) const {
+  return cs.fetch_uint_to(64, data.last_trans_lt)
+      && t_CurrencyCollection.fetch_to(cs, data.balance)
+      && t_AccountState.fetch_to(cs, data.state);
+}
+
+bool AccountStorage::unpack_account_storage(vm::CellSlice& cs, unsigned long long& last_trans_lt, Ref<CellSlice>& balance, Ref<CellSlice>& state) const {
+  return cs.fetch_uint_to(64, last_trans_lt)
+      && t_CurrencyCollection.fetch_to(cs, balance)
+      && t_AccountState.fetch_to(cs, state);
+}
+
+bool AccountStorage::cell_unpack(Ref<vm::Cell> cell_ref, AccountStorage::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool AccountStorage::cell_unpack_account_storage(Ref<vm::Cell> cell_ref, unsigned long long& last_trans_lt, Ref<CellSlice>& balance, Ref<CellSlice>& state) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_account_storage(cs, last_trans_lt, balance, state) && cs.empty_ext();
+}
+
+bool AccountStorage::pack(vm::CellBuilder& cb, const AccountStorage::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.last_trans_lt, 64)
+      && t_CurrencyCollection.store_from(cb, data.balance)
+      && t_AccountState.store_from(cb, data.state);
+}
+
+bool AccountStorage::pack_account_storage(vm::CellBuilder& cb, unsigned long long last_trans_lt, Ref<CellSlice> balance, Ref<CellSlice> state) const {
+  return cb.store_ulong_rchk_bool(last_trans_lt, 64)
+      && t_CurrencyCollection.store_from(cb, balance)
+      && t_AccountState.store_from(cb, state);
+}
+
+bool AccountStorage::cell_pack(Ref<vm::Cell>& cell_ref, const AccountStorage::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountStorage::cell_pack_account_storage(Ref<vm::Cell>& cell_ref, unsigned long long last_trans_lt, Ref<CellSlice> balance, Ref<CellSlice> state) const {
+  vm::CellBuilder cb;
+  return pack_account_storage(cb, last_trans_lt, std::move(balance), std::move(state)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountStorage::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("account_storage")
+      && pp.fetch_uint_field(cs, 64, "last_trans_lt")
+      && pp.field("balance")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("state")
+      && t_AccountState.print_skip(pp, cs)
+      && pp.close();
+}
+
+const AccountStorage t_AccountStorage;
+
+//
+// code for type `AccountState`
+//
+constexpr char AccountState::cons_len[3];
+constexpr unsigned char AccountState::cons_tag[3];
+
+int AccountState::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case account_uninit:
+    return cs.have(2) ? account_uninit : -1;
+  case account_active:
+    return cs.have(1) ? account_active : -1;
+  case account_frozen:
+    return cs.have(2) ? account_frozen : -1;
+  }
+  return -1;
+}
+
+bool AccountState::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case account_uninit:
+    return cs.advance(2);
+  case account_active:
+    return cs.advance(1)
+        && t_StateInit.skip(cs);
+  case account_frozen:
+    return cs.advance(258);
+  }
+  return false;
+}
+
+bool AccountState::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case account_uninit:
+    return cs.advance(2);
+  case account_active:
+    return cs.advance(1)
+        && t_StateInit.validate_skip(cs, weak);
+  case account_frozen:
+    return cs.advance(258);
+  }
+  return false;
+}
+
+bool AccountState::unpack(vm::CellSlice& cs, AccountState::Record_account_uninit& data) const {
+  return cs.fetch_ulong(2) == 0;
+}
+
+bool AccountState::unpack_account_uninit(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(2) == 0;
+}
+
+bool AccountState::cell_unpack(Ref<vm::Cell> cell_ref, AccountState::Record_account_uninit& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool AccountState::cell_unpack_account_uninit(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_account_uninit(cs) && cs.empty_ext();
+}
+
+bool AccountState::unpack(vm::CellSlice& cs, AccountState::Record_account_active& data) const {
+  return cs.fetch_ulong(1) == 1
+      && t_StateInit.fetch_to(cs, data.x);
+}
+
+bool AccountState::unpack_account_active(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return cs.fetch_ulong(1) == 1
+      && t_StateInit.fetch_to(cs, x);
+}
+
+bool AccountState::cell_unpack(Ref<vm::Cell> cell_ref, AccountState::Record_account_active& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool AccountState::cell_unpack_account_active(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_account_active(cs, x) && cs.empty_ext();
+}
+
+bool AccountState::unpack(vm::CellSlice& cs, AccountState::Record_account_frozen& data) const {
+  return cs.fetch_ulong(2) == 1
+      && cs.fetch_bits_to(data.state_hash.bits(), 256);
+}
+
+bool AccountState::unpack_account_frozen(vm::CellSlice& cs, td::BitArray<256>& state_hash) const {
+  return cs.fetch_ulong(2) == 1
+      && cs.fetch_bits_to(state_hash.bits(), 256);
+}
+
+bool AccountState::cell_unpack(Ref<vm::Cell> cell_ref, AccountState::Record_account_frozen& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool AccountState::cell_unpack_account_frozen(Ref<vm::Cell> cell_ref, td::BitArray<256>& state_hash) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_account_frozen(cs, state_hash) && cs.empty_ext();
+}
+
+bool AccountState::pack(vm::CellBuilder& cb, const AccountState::Record_account_uninit& data) const {
+  return cb.store_long_bool(0, 2);
+}
+
+bool AccountState::pack_account_uninit(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 2);
+}
+
+bool AccountState::cell_pack(Ref<vm::Cell>& cell_ref, const AccountState::Record_account_uninit& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountState::cell_pack_account_uninit(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_account_uninit(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountState::pack(vm::CellBuilder& cb, const AccountState::Record_account_active& data) const {
+  return cb.store_long_bool(1, 1)
+      && t_StateInit.store_from(cb, data.x);
+}
+
+bool AccountState::pack_account_active(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return cb.store_long_bool(1, 1)
+      && t_StateInit.store_from(cb, x);
+}
+
+bool AccountState::cell_pack(Ref<vm::Cell>& cell_ref, const AccountState::Record_account_active& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountState::cell_pack_account_active(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_account_active(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountState::pack(vm::CellBuilder& cb, const AccountState::Record_account_frozen& data) const {
+  return cb.store_long_bool(1, 2)
+      && cb.store_bits_bool(data.state_hash.cbits(), 256);
+}
+
+bool AccountState::pack_account_frozen(vm::CellBuilder& cb, td::BitArray<256> state_hash) const {
+  return cb.store_long_bool(1, 2)
+      && cb.store_bits_bool(state_hash.cbits(), 256);
+}
+
+bool AccountState::cell_pack(Ref<vm::Cell>& cell_ref, const AccountState::Record_account_frozen& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountState::cell_pack_account_frozen(Ref<vm::Cell>& cell_ref, td::BitArray<256> state_hash) const {
+  vm::CellBuilder cb;
+  return pack_account_frozen(cb, state_hash) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountState::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case account_uninit:
+    return cs.advance(2)
+        && pp.cons("account_uninit");
+  case account_active:
+    return cs.advance(1)
+        && pp.open("account_active")
+        && pp.field()
+        && t_StateInit.print_skip(pp, cs)
+        && pp.close();
+  case account_frozen:
+    return cs.advance(2)
+        && pp.open("account_frozen")
+        && pp.fetch_bits_field(cs, 256, "state_hash")
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for AccountState");
+}
+
+const AccountState t_AccountState;
+
+//
+// code for type `AccountStatus`
+//
+
+int AccountStatus::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case acc_state_uninit:
+    return cs.have(2) ? acc_state_uninit : -1;
+  case acc_state_frozen:
+    return cs.have(2) ? acc_state_frozen : -1;
+  case acc_state_active:
+    return cs.have(2) ? acc_state_active : -1;
+  case acc_state_nonexist:
+    return cs.have(2) ? acc_state_nonexist : -1;
+  }
+  return -1;
+}
+
+bool AccountStatus::fetch_enum_to(vm::CellSlice& cs, char& value) const {
+  value = (char)cs.fetch_ulong(2);
+  return value >= 0;
+}
+
+bool AccountStatus::store_enum_from(vm::CellBuilder& cb, int value) const {
+  return cb.store_long_rchk_bool(value, 2);
+}
+
+bool AccountStatus::unpack(vm::CellSlice& cs, AccountStatus::Record_acc_state_uninit& data) const {
+  return cs.fetch_ulong(2) == 0;
+}
+
+bool AccountStatus::unpack_acc_state_uninit(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(2) == 0;
+}
+
+bool AccountStatus::cell_unpack(Ref<vm::Cell> cell_ref, AccountStatus::Record_acc_state_uninit& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool AccountStatus::cell_unpack_acc_state_uninit(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_acc_state_uninit(cs) && cs.empty_ext();
+}
+
+bool AccountStatus::unpack(vm::CellSlice& cs, AccountStatus::Record_acc_state_frozen& data) const {
+  return cs.fetch_ulong(2) == 1;
+}
+
+bool AccountStatus::unpack_acc_state_frozen(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(2) == 1;
+}
+
+bool AccountStatus::cell_unpack(Ref<vm::Cell> cell_ref, AccountStatus::Record_acc_state_frozen& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool AccountStatus::cell_unpack_acc_state_frozen(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_acc_state_frozen(cs) && cs.empty_ext();
+}
+
+bool AccountStatus::unpack(vm::CellSlice& cs, AccountStatus::Record_acc_state_active& data) const {
+  return cs.fetch_ulong(2) == 2;
+}
+
+bool AccountStatus::unpack_acc_state_active(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(2) == 2;
+}
+
+bool AccountStatus::cell_unpack(Ref<vm::Cell> cell_ref, AccountStatus::Record_acc_state_active& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool AccountStatus::cell_unpack_acc_state_active(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_acc_state_active(cs) && cs.empty_ext();
+}
+
+bool AccountStatus::unpack(vm::CellSlice& cs, AccountStatus::Record_acc_state_nonexist& data) const {
+  return cs.fetch_ulong(2) == 3;
+}
+
+bool AccountStatus::unpack_acc_state_nonexist(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(2) == 3;
+}
+
+bool AccountStatus::cell_unpack(Ref<vm::Cell> cell_ref, AccountStatus::Record_acc_state_nonexist& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool AccountStatus::cell_unpack_acc_state_nonexist(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_acc_state_nonexist(cs) && cs.empty_ext();
+}
+
+bool AccountStatus::pack(vm::CellBuilder& cb, const AccountStatus::Record_acc_state_uninit& data) const {
+  return cb.store_long_bool(0, 2);
+}
+
+bool AccountStatus::pack_acc_state_uninit(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 2);
+}
+
+bool AccountStatus::cell_pack(Ref<vm::Cell>& cell_ref, const AccountStatus::Record_acc_state_uninit& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountStatus::cell_pack_acc_state_uninit(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_acc_state_uninit(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountStatus::pack(vm::CellBuilder& cb, const AccountStatus::Record_acc_state_frozen& data) const {
+  return cb.store_long_bool(1, 2);
+}
+
+bool AccountStatus::pack_acc_state_frozen(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(1, 2);
+}
+
+bool AccountStatus::cell_pack(Ref<vm::Cell>& cell_ref, const AccountStatus::Record_acc_state_frozen& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountStatus::cell_pack_acc_state_frozen(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_acc_state_frozen(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountStatus::pack(vm::CellBuilder& cb, const AccountStatus::Record_acc_state_active& data) const {
+  return cb.store_long_bool(2, 2);
+}
+
+bool AccountStatus::pack_acc_state_active(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(2, 2);
+}
+
+bool AccountStatus::cell_pack(Ref<vm::Cell>& cell_ref, const AccountStatus::Record_acc_state_active& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountStatus::cell_pack_acc_state_active(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_acc_state_active(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountStatus::pack(vm::CellBuilder& cb, const AccountStatus::Record_acc_state_nonexist& data) const {
+  return cb.store_long_bool(3, 2);
+}
+
+bool AccountStatus::pack_acc_state_nonexist(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(3, 2);
+}
+
+bool AccountStatus::cell_pack(Ref<vm::Cell>& cell_ref, const AccountStatus::Record_acc_state_nonexist& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountStatus::cell_pack_acc_state_nonexist(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_acc_state_nonexist(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountStatus::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case acc_state_uninit:
+    return cs.advance(2)
+        && pp.cons("acc_state_uninit");
+  case acc_state_frozen:
+    return cs.advance(2)
+        && pp.cons("acc_state_frozen");
+  case acc_state_active:
+    return cs.advance(2)
+        && pp.cons("acc_state_active");
+  case acc_state_nonexist:
+    return cs.advance(2)
+        && pp.cons("acc_state_nonexist");
+  }
+  return pp.fail("unknown constructor for AccountStatus");
+}
+
+const AccountStatus t_AccountStatus;
+
+//
+// code for type `ShardAccount`
+//
+
+int ShardAccount::check_tag(const vm::CellSlice& cs) const {
+  return account_descr;
+}
+
+bool ShardAccount::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_Account.validate_skip_ref(cs, weak)
+      && cs.advance(320);
+}
+
+bool ShardAccount::unpack(vm::CellSlice& cs, ShardAccount::Record& data) const {
+  return cs.fetch_ref_to(data.account)
+      && cs.fetch_bits_to(data.last_trans_hash.bits(), 256)
+      && cs.fetch_uint_to(64, data.last_trans_lt);
+}
+
+bool ShardAccount::unpack_account_descr(vm::CellSlice& cs, Ref<Cell>& account, td::BitArray<256>& last_trans_hash, unsigned long long& last_trans_lt) const {
+  return cs.fetch_ref_to(account)
+      && cs.fetch_bits_to(last_trans_hash.bits(), 256)
+      && cs.fetch_uint_to(64, last_trans_lt);
+}
+
+bool ShardAccount::cell_unpack(Ref<vm::Cell> cell_ref, ShardAccount::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ShardAccount::cell_unpack_account_descr(Ref<vm::Cell> cell_ref, Ref<Cell>& account, td::BitArray<256>& last_trans_hash, unsigned long long& last_trans_lt) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_account_descr(cs, account, last_trans_hash, last_trans_lt) && cs.empty_ext();
+}
+
+bool ShardAccount::pack(vm::CellBuilder& cb, const ShardAccount::Record& data) const {
+  return cb.store_ref_bool(data.account)
+      && cb.store_bits_bool(data.last_trans_hash.cbits(), 256)
+      && cb.store_ulong_rchk_bool(data.last_trans_lt, 64);
+}
+
+bool ShardAccount::pack_account_descr(vm::CellBuilder& cb, Ref<Cell> account, td::BitArray<256> last_trans_hash, unsigned long long last_trans_lt) const {
+  return cb.store_ref_bool(account)
+      && cb.store_bits_bool(last_trans_hash.cbits(), 256)
+      && cb.store_ulong_rchk_bool(last_trans_lt, 64);
+}
+
+bool ShardAccount::cell_pack(Ref<vm::Cell>& cell_ref, const ShardAccount::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardAccount::cell_pack_account_descr(Ref<vm::Cell>& cell_ref, Ref<Cell> account, td::BitArray<256> last_trans_hash, unsigned long long last_trans_lt) const {
+  vm::CellBuilder cb;
+  return pack_account_descr(cb, std::move(account), last_trans_hash, last_trans_lt) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardAccount::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("account_descr")
+      && pp.field("account")
+      && t_Account.print_ref(pp, cs.fetch_ref())
+      && pp.fetch_bits_field(cs, 256, "last_trans_hash")
+      && pp.fetch_uint_field(cs, 64, "last_trans_lt")
+      && pp.close();
+}
+
+const ShardAccount t_ShardAccount;
+
+//
+// code for type `DepthBalanceInfo`
+//
+
+int DepthBalanceInfo::check_tag(const vm::CellSlice& cs) const {
+  return depth_balance;
+}
+
+bool DepthBalanceInfo::skip(vm::CellSlice& cs) const {
+  return cs.advance(5)
+      && t_CurrencyCollection.skip(cs);
+}
+
+bool DepthBalanceInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int split_depth;
+  return cs.fetch_uint_leq(30, split_depth)
+      && t_CurrencyCollection.validate_skip(cs, weak);
+}
+
+bool DepthBalanceInfo::unpack(vm::CellSlice& cs, DepthBalanceInfo::Record& data) const {
+  return cs.fetch_uint_leq(30, data.split_depth)
+      && t_CurrencyCollection.fetch_to(cs, data.balance);
+}
+
+bool DepthBalanceInfo::unpack_depth_balance(vm::CellSlice& cs, int& split_depth, Ref<CellSlice>& balance) const {
+  return cs.fetch_uint_leq(30, split_depth)
+      && t_CurrencyCollection.fetch_to(cs, balance);
+}
+
+bool DepthBalanceInfo::cell_unpack(Ref<vm::Cell> cell_ref, DepthBalanceInfo::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool DepthBalanceInfo::cell_unpack_depth_balance(Ref<vm::Cell> cell_ref, int& split_depth, Ref<CellSlice>& balance) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_depth_balance(cs, split_depth, balance) && cs.empty_ext();
+}
+
+bool DepthBalanceInfo::pack(vm::CellBuilder& cb, const DepthBalanceInfo::Record& data) const {
+  return cb.store_uint_leq(30, data.split_depth)
+      && t_CurrencyCollection.store_from(cb, data.balance);
+}
+
+bool DepthBalanceInfo::pack_depth_balance(vm::CellBuilder& cb, int split_depth, Ref<CellSlice> balance) const {
+  return cb.store_uint_leq(30, split_depth)
+      && t_CurrencyCollection.store_from(cb, balance);
+}
+
+bool DepthBalanceInfo::cell_pack(Ref<vm::Cell>& cell_ref, const DepthBalanceInfo::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool DepthBalanceInfo::cell_pack_depth_balance(Ref<vm::Cell>& cell_ref, int split_depth, Ref<CellSlice> balance) const {
+  vm::CellBuilder cb;
+  return pack_depth_balance(cb, split_depth, std::move(balance)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool DepthBalanceInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int split_depth;
+  return pp.open("depth_balance")
+      && cs.fetch_uint_leq(30, split_depth)
+      && pp.field_int(split_depth, "split_depth")
+      && pp.field("balance")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.close();
+}
+
+const DepthBalanceInfo t_DepthBalanceInfo;
+
+//
+// code for type `ShardAccounts`
+//
+
+int ShardAccounts::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool ShardAccounts::skip(vm::CellSlice& cs) const {
+  return t_HashmapAugE_256_ShardAccount_DepthBalanceInfo.skip(cs);
+}
+
+bool ShardAccounts::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_HashmapAugE_256_ShardAccount_DepthBalanceInfo.validate_skip(cs, weak);
+}
+
+bool ShardAccounts::unpack(vm::CellSlice& cs, ShardAccounts::Record& data) const {
+  return t_HashmapAugE_256_ShardAccount_DepthBalanceInfo.fetch_to(cs, data.x);
+}
+
+bool ShardAccounts::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_HashmapAugE_256_ShardAccount_DepthBalanceInfo.fetch_to(cs, x);
+}
+
+bool ShardAccounts::cell_unpack(Ref<vm::Cell> cell_ref, ShardAccounts::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ShardAccounts::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, x) && cs.empty_ext();
+}
+
+bool ShardAccounts::pack(vm::CellBuilder& cb, const ShardAccounts::Record& data) const {
+  return t_HashmapAugE_256_ShardAccount_DepthBalanceInfo.store_from(cb, data.x);
+}
+
+bool ShardAccounts::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_HashmapAugE_256_ShardAccount_DepthBalanceInfo.store_from(cb, x);
+}
+
+bool ShardAccounts::cell_pack(Ref<vm::Cell>& cell_ref, const ShardAccounts::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardAccounts::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardAccounts::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field()
+      && t_HashmapAugE_256_ShardAccount_DepthBalanceInfo.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ShardAccounts t_ShardAccounts;
+
+//
+// code for auxiliary type `Transaction_aux`
+//
+
+int Transaction_aux::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool Transaction_aux::skip(vm::CellSlice& cs) const {
+  return t_Maybe_Ref_Message_Any.skip(cs)
+      && t_HashmapE_15_Ref_Message_Any.skip(cs);
+}
+
+bool Transaction_aux::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_Maybe_Ref_Message_Any.validate_skip(cs, weak)
+      && t_HashmapE_15_Ref_Message_Any.validate_skip(cs, weak);
+}
+
+bool Transaction_aux::unpack(vm::CellSlice& cs, Transaction_aux::Record& data) const {
+  return t_Maybe_Ref_Message_Any.fetch_to(cs, data.in_msg)
+      && t_HashmapE_15_Ref_Message_Any.fetch_to(cs, data.out_msgs);
+}
+
+bool Transaction_aux::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& in_msg, Ref<CellSlice>& out_msgs) const {
+  return t_Maybe_Ref_Message_Any.fetch_to(cs, in_msg)
+      && t_HashmapE_15_Ref_Message_Any.fetch_to(cs, out_msgs);
+}
+
+bool Transaction_aux::cell_unpack(Ref<vm::Cell> cell_ref, Transaction_aux::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Transaction_aux::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& in_msg, Ref<CellSlice>& out_msgs) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, in_msg, out_msgs) && cs.empty_ext();
+}
+
+bool Transaction_aux::pack(vm::CellBuilder& cb, const Transaction_aux::Record& data) const {
+  return t_Maybe_Ref_Message_Any.store_from(cb, data.in_msg)
+      && t_HashmapE_15_Ref_Message_Any.store_from(cb, data.out_msgs);
+}
+
+bool Transaction_aux::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> in_msg, Ref<CellSlice> out_msgs) const {
+  return t_Maybe_Ref_Message_Any.store_from(cb, in_msg)
+      && t_HashmapE_15_Ref_Message_Any.store_from(cb, out_msgs);
+}
+
+bool Transaction_aux::cell_pack(Ref<vm::Cell>& cell_ref, const Transaction_aux::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Transaction_aux::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> in_msg, Ref<CellSlice> out_msgs) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(in_msg), std::move(out_msgs)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Transaction_aux::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field("in_msg")
+      && t_Maybe_Ref_Message_Any.print_skip(pp, cs)
+      && pp.field("out_msgs")
+      && t_HashmapE_15_Ref_Message_Any.print_skip(pp, cs)
+      && pp.close();
+}
+
+const Transaction_aux t_Transaction_aux;
+
+//
+// code for type `Transaction`
+//
+constexpr unsigned char Transaction::cons_tag[1];
+
+int Transaction::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(4) == 7 ? transaction : -1;
+}
+
+bool Transaction::skip(vm::CellSlice& cs) const {
+  return cs.advance_ext(0x102b7)
+      && t_CurrencyCollection.skip(cs)
+      && cs.advance_refs(2);
+}
+
+bool Transaction::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(4) == 7
+      && cs.advance(691)
+      && t_Transaction_aux.validate_skip_ref(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak)
+      && t_HASH_UPDATE_Account.validate_skip_ref(cs, weak)
+      && t_TransactionDescr.validate_skip_ref(cs, weak);
+}
+
+bool Transaction::unpack(vm::CellSlice& cs, Transaction::Record& data) const {
+  return cs.fetch_ulong(4) == 7
+      && cs.fetch_bits_to(data.account_addr.bits(), 256)
+      && cs.fetch_uint_to(64, data.lt)
+      && cs.fetch_bits_to(data.prev_trans_hash.bits(), 256)
+      && cs.fetch_uint_to(64, data.prev_trans_lt)
+      && cs.fetch_uint_to(32, data.now)
+      && cs.fetch_uint_to(15, data.outmsg_cnt)
+      && t_AccountStatus.fetch_enum_to(cs, data.orig_status)
+      && t_AccountStatus.fetch_enum_to(cs, data.end_status)
+      && t_Transaction_aux.cell_unpack(cs.fetch_ref(), data.r1)
+      && t_CurrencyCollection.fetch_to(cs, data.total_fees)
+      && cs.fetch_ref_to(data.state_update)
+      && cs.fetch_ref_to(data.description);
+}
+
+bool Transaction::cell_unpack(Ref<vm::Cell> cell_ref, Transaction::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Transaction::pack(vm::CellBuilder& cb, const Transaction::Record& data) const {
+  Ref<vm::Cell> tmp_cell;
+  return cb.store_long_bool(7, 4)
+      && cb.store_bits_bool(data.account_addr.cbits(), 256)
+      && cb.store_ulong_rchk_bool(data.lt, 64)
+      && cb.store_bits_bool(data.prev_trans_hash.cbits(), 256)
+      && cb.store_ulong_rchk_bool(data.prev_trans_lt, 64)
+      && cb.store_ulong_rchk_bool(data.now, 32)
+      && cb.store_ulong_rchk_bool(data.outmsg_cnt, 15)
+      && t_AccountStatus.store_enum_from(cb, data.orig_status)
+      && t_AccountStatus.store_enum_from(cb, data.end_status)
+      && t_Transaction_aux.cell_pack(tmp_cell, data.r1)
+      && cb.store_ref_bool(std::move(tmp_cell))
+      && t_CurrencyCollection.store_from(cb, data.total_fees)
+      && cb.store_ref_bool(data.state_update)
+      && cb.store_ref_bool(data.description);
+}
+
+bool Transaction::cell_pack(Ref<vm::Cell>& cell_ref, const Transaction::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Transaction::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(4) == 7
+      && pp.open("transaction")
+      && pp.fetch_bits_field(cs, 256, "account_addr")
+      && pp.fetch_uint_field(cs, 64, "lt")
+      && pp.fetch_bits_field(cs, 256, "prev_trans_hash")
+      && pp.fetch_uint_field(cs, 64, "prev_trans_lt")
+      && pp.fetch_uint_field(cs, 32, "now")
+      && pp.fetch_uint_field(cs, 15, "outmsg_cnt")
+      && pp.field("orig_status")
+      && t_AccountStatus.print_skip(pp, cs)
+      && pp.field("end_status")
+      && t_AccountStatus.print_skip(pp, cs)
+      && pp.field()
+      && t_Transaction_aux.print_ref(pp, cs.fetch_ref())
+      && pp.field("total_fees")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("state_update")
+      && t_HASH_UPDATE_Account.print_ref(pp, cs.fetch_ref())
+      && pp.field("description")
+      && t_TransactionDescr.print_ref(pp, cs.fetch_ref())
+      && pp.close();
+}
+
+const Transaction t_Transaction;
+
+//
+// code for type `MERKLE_UPDATE`
+//
+constexpr unsigned char MERKLE_UPDATE::cons_tag[1];
+
+int MERKLE_UPDATE::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 2 ? _merkle_update : -1;
+}
+
+bool MERKLE_UPDATE::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(8) == 2
+      && cs.advance(512)
+      && X_.validate_skip_ref(cs, weak)
+      && X_.validate_skip_ref(cs, weak);
+}
+
+bool MERKLE_UPDATE::unpack(vm::CellSlice& cs, MERKLE_UPDATE::Record& data) const {
+  return cs.fetch_ulong(8) == 2
+      && cs.fetch_bits_to(data.old_hash.bits(), 256)
+      && cs.fetch_bits_to(data.new_hash.bits(), 256)
+      && cs.fetch_ref_to(data.old)
+      && cs.fetch_ref_to(data.new1);
+}
+
+bool MERKLE_UPDATE::cell_unpack(Ref<vm::Cell> cell_ref, MERKLE_UPDATE::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool MERKLE_UPDATE::pack(vm::CellBuilder& cb, const MERKLE_UPDATE::Record& data) const {
+  return cb.store_long_bool(2, 8)
+      && cb.store_bits_bool(data.old_hash.cbits(), 256)
+      && cb.store_bits_bool(data.new_hash.cbits(), 256)
+      && cb.store_ref_bool(data.old)
+      && cb.store_ref_bool(data.new1);
+}
+
+bool MERKLE_UPDATE::cell_pack(Ref<vm::Cell>& cell_ref, const MERKLE_UPDATE::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MERKLE_UPDATE::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(8) == 2
+      && pp.open("!merkle_update")
+      && pp.fetch_bits_field(cs, 256, "old_hash")
+      && pp.fetch_bits_field(cs, 256, "new_hash")
+      && pp.field("old")
+      && X_.print_ref(pp, cs.fetch_ref())
+      && pp.field("new")
+      && X_.print_ref(pp, cs.fetch_ref())
+      && pp.close();
+}
+
+
+//
+// code for type `HASH_UPDATE`
+//
+constexpr unsigned char HASH_UPDATE::cons_tag[1];
+
+int HASH_UPDATE::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 0x72 ? update_hashes : -1;
+}
+
+bool HASH_UPDATE::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(8) == 0x72
+      && cs.advance(512);
+}
+
+bool HASH_UPDATE::unpack(vm::CellSlice& cs, HASH_UPDATE::Record& data) const {
+  return cs.fetch_ulong(8) == 0x72
+      && cs.fetch_bits_to(data.old_hash.bits(), 256)
+      && cs.fetch_bits_to(data.new_hash.bits(), 256);
+}
+
+bool HASH_UPDATE::unpack_update_hashes(vm::CellSlice& cs, td::BitArray<256>& old_hash, td::BitArray<256>& new_hash) const {
+  return cs.fetch_ulong(8) == 0x72
+      && cs.fetch_bits_to(old_hash.bits(), 256)
+      && cs.fetch_bits_to(new_hash.bits(), 256);
+}
+
+bool HASH_UPDATE::cell_unpack(Ref<vm::Cell> cell_ref, HASH_UPDATE::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool HASH_UPDATE::cell_unpack_update_hashes(Ref<vm::Cell> cell_ref, td::BitArray<256>& old_hash, td::BitArray<256>& new_hash) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_update_hashes(cs, old_hash, new_hash) && cs.empty_ext();
+}
+
+bool HASH_UPDATE::pack(vm::CellBuilder& cb, const HASH_UPDATE::Record& data) const {
+  return cb.store_long_bool(0x72, 8)
+      && cb.store_bits_bool(data.old_hash.cbits(), 256)
+      && cb.store_bits_bool(data.new_hash.cbits(), 256);
+}
+
+bool HASH_UPDATE::pack_update_hashes(vm::CellBuilder& cb, td::BitArray<256> old_hash, td::BitArray<256> new_hash) const {
+  return cb.store_long_bool(0x72, 8)
+      && cb.store_bits_bool(old_hash.cbits(), 256)
+      && cb.store_bits_bool(new_hash.cbits(), 256);
+}
+
+bool HASH_UPDATE::cell_pack(Ref<vm::Cell>& cell_ref, const HASH_UPDATE::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HASH_UPDATE::cell_pack_update_hashes(Ref<vm::Cell>& cell_ref, td::BitArray<256> old_hash, td::BitArray<256> new_hash) const {
+  vm::CellBuilder cb;
+  return pack_update_hashes(cb, old_hash, new_hash) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool HASH_UPDATE::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(8) == 0x72
+      && pp.open("update_hashes")
+      && pp.fetch_bits_field(cs, 256, "old_hash")
+      && pp.fetch_bits_field(cs, 256, "new_hash")
+      && pp.close();
+}
+
+
+//
+// code for type `AccountBlock`
+//
+constexpr unsigned char AccountBlock::cons_tag[1];
+
+int AccountBlock::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(4) == 5 ? acc_trans : -1;
+}
+
+bool AccountBlock::skip(vm::CellSlice& cs) const {
+  return cs.advance(260)
+      && t_HashmapAug_64_Ref_Transaction_CurrencyCollection.skip(cs)
+      && cs.advance_refs(1);
+}
+
+bool AccountBlock::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(4) == 5
+      && cs.advance(256)
+      && t_HashmapAug_64_Ref_Transaction_CurrencyCollection.validate_skip(cs, weak)
+      && t_HASH_UPDATE_Account.validate_skip_ref(cs, weak);
+}
+
+bool AccountBlock::unpack(vm::CellSlice& cs, AccountBlock::Record& data) const {
+  return cs.fetch_ulong(4) == 5
+      && cs.fetch_bits_to(data.account_addr.bits(), 256)
+      && t_HashmapAug_64_Ref_Transaction_CurrencyCollection.fetch_to(cs, data.transactions)
+      && cs.fetch_ref_to(data.state_update);
+}
+
+bool AccountBlock::unpack_acc_trans(vm::CellSlice& cs, td::BitArray<256>& account_addr, Ref<CellSlice>& transactions, Ref<Cell>& state_update) const {
+  return cs.fetch_ulong(4) == 5
+      && cs.fetch_bits_to(account_addr.bits(), 256)
+      && t_HashmapAug_64_Ref_Transaction_CurrencyCollection.fetch_to(cs, transactions)
+      && cs.fetch_ref_to(state_update);
+}
+
+bool AccountBlock::cell_unpack(Ref<vm::Cell> cell_ref, AccountBlock::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool AccountBlock::cell_unpack_acc_trans(Ref<vm::Cell> cell_ref, td::BitArray<256>& account_addr, Ref<CellSlice>& transactions, Ref<Cell>& state_update) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_acc_trans(cs, account_addr, transactions, state_update) && cs.empty_ext();
+}
+
+bool AccountBlock::pack(vm::CellBuilder& cb, const AccountBlock::Record& data) const {
+  return cb.store_long_bool(5, 4)
+      && cb.store_bits_bool(data.account_addr.cbits(), 256)
+      && t_HashmapAug_64_Ref_Transaction_CurrencyCollection.store_from(cb, data.transactions)
+      && cb.store_ref_bool(data.state_update);
+}
+
+bool AccountBlock::pack_acc_trans(vm::CellBuilder& cb, td::BitArray<256> account_addr, Ref<CellSlice> transactions, Ref<Cell> state_update) const {
+  return cb.store_long_bool(5, 4)
+      && cb.store_bits_bool(account_addr.cbits(), 256)
+      && t_HashmapAug_64_Ref_Transaction_CurrencyCollection.store_from(cb, transactions)
+      && cb.store_ref_bool(state_update);
+}
+
+bool AccountBlock::cell_pack(Ref<vm::Cell>& cell_ref, const AccountBlock::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountBlock::cell_pack_acc_trans(Ref<vm::Cell>& cell_ref, td::BitArray<256> account_addr, Ref<CellSlice> transactions, Ref<Cell> state_update) const {
+  vm::CellBuilder cb;
+  return pack_acc_trans(cb, account_addr, std::move(transactions), std::move(state_update)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccountBlock::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(4) == 5
+      && pp.open("acc_trans")
+      && pp.fetch_bits_field(cs, 256, "account_addr")
+      && pp.field("transactions")
+      && t_HashmapAug_64_Ref_Transaction_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("state_update")
+      && t_HASH_UPDATE_Account.print_ref(pp, cs.fetch_ref())
+      && pp.close();
+}
+
+const AccountBlock t_AccountBlock;
+
+//
+// code for type `ShardAccountBlocks`
+//
+
+int ShardAccountBlocks::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool ShardAccountBlocks::skip(vm::CellSlice& cs) const {
+  return t_HashmapAugE_256_AccountBlock_CurrencyCollection.skip(cs);
+}
+
+bool ShardAccountBlocks::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_HashmapAugE_256_AccountBlock_CurrencyCollection.validate_skip(cs, weak);
+}
+
+bool ShardAccountBlocks::unpack(vm::CellSlice& cs, ShardAccountBlocks::Record& data) const {
+  return t_HashmapAugE_256_AccountBlock_CurrencyCollection.fetch_to(cs, data.x);
+}
+
+bool ShardAccountBlocks::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_HashmapAugE_256_AccountBlock_CurrencyCollection.fetch_to(cs, x);
+}
+
+bool ShardAccountBlocks::cell_unpack(Ref<vm::Cell> cell_ref, ShardAccountBlocks::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ShardAccountBlocks::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, x) && cs.empty_ext();
+}
+
+bool ShardAccountBlocks::pack(vm::CellBuilder& cb, const ShardAccountBlocks::Record& data) const {
+  return t_HashmapAugE_256_AccountBlock_CurrencyCollection.store_from(cb, data.x);
+}
+
+bool ShardAccountBlocks::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_HashmapAugE_256_AccountBlock_CurrencyCollection.store_from(cb, x);
+}
+
+bool ShardAccountBlocks::cell_pack(Ref<vm::Cell>& cell_ref, const ShardAccountBlocks::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardAccountBlocks::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardAccountBlocks::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field()
+      && t_HashmapAugE_256_AccountBlock_CurrencyCollection.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ShardAccountBlocks t_ShardAccountBlocks;
+
+//
+// code for type `TrStoragePhase`
+//
+
+int TrStoragePhase::check_tag(const vm::CellSlice& cs) const {
+  return tr_phase_storage;
+}
+
+bool TrStoragePhase::skip(vm::CellSlice& cs) const {
+  return t_Grams.skip(cs)
+      && t_Maybe_Grams.skip(cs)
+      && t_AccStatusChange.skip(cs);
+}
+
+bool TrStoragePhase::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_Grams.validate_skip(cs, weak)
+      && t_Maybe_Grams.validate_skip(cs, weak)
+      && t_AccStatusChange.validate_skip(cs, weak);
+}
+
+bool TrStoragePhase::unpack(vm::CellSlice& cs, TrStoragePhase::Record& data) const {
+  return t_Grams.fetch_to(cs, data.storage_fees_collected)
+      && t_Maybe_Grams.fetch_to(cs, data.storage_fees_due)
+      && t_AccStatusChange.fetch_enum_to(cs, data.status_change);
+}
+
+bool TrStoragePhase::unpack_tr_phase_storage(vm::CellSlice& cs, Ref<CellSlice>& storage_fees_collected, Ref<CellSlice>& storage_fees_due, char& status_change) const {
+  return t_Grams.fetch_to(cs, storage_fees_collected)
+      && t_Maybe_Grams.fetch_to(cs, storage_fees_due)
+      && t_AccStatusChange.fetch_enum_to(cs, status_change);
+}
+
+bool TrStoragePhase::cell_unpack(Ref<vm::Cell> cell_ref, TrStoragePhase::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TrStoragePhase::cell_unpack_tr_phase_storage(Ref<vm::Cell> cell_ref, Ref<CellSlice>& storage_fees_collected, Ref<CellSlice>& storage_fees_due, char& status_change) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_tr_phase_storage(cs, storage_fees_collected, storage_fees_due, status_change) && cs.empty_ext();
+}
+
+bool TrStoragePhase::pack(vm::CellBuilder& cb, const TrStoragePhase::Record& data) const {
+  return t_Grams.store_from(cb, data.storage_fees_collected)
+      && t_Maybe_Grams.store_from(cb, data.storage_fees_due)
+      && t_AccStatusChange.store_enum_from(cb, data.status_change);
+}
+
+bool TrStoragePhase::pack_tr_phase_storage(vm::CellBuilder& cb, Ref<CellSlice> storage_fees_collected, Ref<CellSlice> storage_fees_due, char status_change) const {
+  return t_Grams.store_from(cb, storage_fees_collected)
+      && t_Maybe_Grams.store_from(cb, storage_fees_due)
+      && t_AccStatusChange.store_enum_from(cb, status_change);
+}
+
+bool TrStoragePhase::cell_pack(Ref<vm::Cell>& cell_ref, const TrStoragePhase::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrStoragePhase::cell_pack_tr_phase_storage(Ref<vm::Cell>& cell_ref, Ref<CellSlice> storage_fees_collected, Ref<CellSlice> storage_fees_due, char status_change) const {
+  vm::CellBuilder cb;
+  return pack_tr_phase_storage(cb, std::move(storage_fees_collected), std::move(storage_fees_due), status_change) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrStoragePhase::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("tr_phase_storage")
+      && pp.field("storage_fees_collected")
+      && t_Grams.print_skip(pp, cs)
+      && pp.field("storage_fees_due")
+      && t_Maybe_Grams.print_skip(pp, cs)
+      && pp.field("status_change")
+      && t_AccStatusChange.print_skip(pp, cs)
+      && pp.close();
+}
+
+const TrStoragePhase t_TrStoragePhase;
+
+//
+// code for type `AccStatusChange`
+//
+constexpr char AccStatusChange::cons_len[3];
+constexpr unsigned char AccStatusChange::cons_tag[3];
+
+int AccStatusChange::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case acst_unchanged:
+    return cs.have(1) ? acst_unchanged : -1;
+  case acst_frozen:
+    return cs.have(2) ? acst_frozen : -1;
+  case acst_deleted:
+    return cs.have(2) ? acst_deleted : -1;
+  }
+  return -1;
+}
+
+bool AccStatusChange::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case acst_unchanged:
+    return cs.advance(1);
+  case acst_frozen:
+    return cs.advance(2);
+  case acst_deleted:
+    return cs.advance(2);
+  }
+  return false;
+}
+
+bool AccStatusChange::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case acst_unchanged:
+    return cs.advance(1);
+  case acst_frozen:
+    return cs.advance(2);
+  case acst_deleted:
+    return cs.advance(2);
+  }
+  return false;
+}
+
+bool AccStatusChange::fetch_enum_to(vm::CellSlice& cs, char& value) const {
+  int t = get_tag(cs);
+  value = (char)t;
+  return t >= 0 && cs.advance(cons_len[t]);
+}
+
+bool AccStatusChange::store_enum_from(vm::CellBuilder& cb, int value) const {
+  return (unsigned)value < 3 && cb.store_long_bool(cons_tag[value], cons_len[value]);
+}
+
+bool AccStatusChange::unpack(vm::CellSlice& cs, AccStatusChange::Record_acst_unchanged& data) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool AccStatusChange::unpack_acst_unchanged(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool AccStatusChange::cell_unpack(Ref<vm::Cell> cell_ref, AccStatusChange::Record_acst_unchanged& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool AccStatusChange::cell_unpack_acst_unchanged(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_acst_unchanged(cs) && cs.empty_ext();
+}
+
+bool AccStatusChange::unpack(vm::CellSlice& cs, AccStatusChange::Record_acst_frozen& data) const {
+  return cs.fetch_ulong(2) == 2;
+}
+
+bool AccStatusChange::unpack_acst_frozen(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(2) == 2;
+}
+
+bool AccStatusChange::cell_unpack(Ref<vm::Cell> cell_ref, AccStatusChange::Record_acst_frozen& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool AccStatusChange::cell_unpack_acst_frozen(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_acst_frozen(cs) && cs.empty_ext();
+}
+
+bool AccStatusChange::unpack(vm::CellSlice& cs, AccStatusChange::Record_acst_deleted& data) const {
+  return cs.fetch_ulong(2) == 3;
+}
+
+bool AccStatusChange::unpack_acst_deleted(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(2) == 3;
+}
+
+bool AccStatusChange::cell_unpack(Ref<vm::Cell> cell_ref, AccStatusChange::Record_acst_deleted& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool AccStatusChange::cell_unpack_acst_deleted(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_acst_deleted(cs) && cs.empty_ext();
+}
+
+bool AccStatusChange::pack(vm::CellBuilder& cb, const AccStatusChange::Record_acst_unchanged& data) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool AccStatusChange::pack_acst_unchanged(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool AccStatusChange::cell_pack(Ref<vm::Cell>& cell_ref, const AccStatusChange::Record_acst_unchanged& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccStatusChange::cell_pack_acst_unchanged(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_acst_unchanged(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccStatusChange::pack(vm::CellBuilder& cb, const AccStatusChange::Record_acst_frozen& data) const {
+  return cb.store_long_bool(2, 2);
+}
+
+bool AccStatusChange::pack_acst_frozen(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(2, 2);
+}
+
+bool AccStatusChange::cell_pack(Ref<vm::Cell>& cell_ref, const AccStatusChange::Record_acst_frozen& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccStatusChange::cell_pack_acst_frozen(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_acst_frozen(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccStatusChange::pack(vm::CellBuilder& cb, const AccStatusChange::Record_acst_deleted& data) const {
+  return cb.store_long_bool(3, 2);
+}
+
+bool AccStatusChange::pack_acst_deleted(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(3, 2);
+}
+
+bool AccStatusChange::cell_pack(Ref<vm::Cell>& cell_ref, const AccStatusChange::Record_acst_deleted& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccStatusChange::cell_pack_acst_deleted(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_acst_deleted(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool AccStatusChange::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case acst_unchanged:
+    return cs.advance(1)
+        && pp.cons("acst_unchanged");
+  case acst_frozen:
+    return cs.advance(2)
+        && pp.cons("acst_frozen");
+  case acst_deleted:
+    return cs.advance(2)
+        && pp.cons("acst_deleted");
+  }
+  return pp.fail("unknown constructor for AccStatusChange");
+}
+
+const AccStatusChange t_AccStatusChange;
+
+//
+// code for type `TrCreditPhase`
+//
+
+int TrCreditPhase::check_tag(const vm::CellSlice& cs) const {
+  return tr_phase_credit;
+}
+
+bool TrCreditPhase::skip(vm::CellSlice& cs) const {
+  return t_Maybe_Grams.skip(cs)
+      && t_CurrencyCollection.skip(cs);
+}
+
+bool TrCreditPhase::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_Maybe_Grams.validate_skip(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak);
+}
+
+bool TrCreditPhase::unpack(vm::CellSlice& cs, TrCreditPhase::Record& data) const {
+  return t_Maybe_Grams.fetch_to(cs, data.due_fees_collected)
+      && t_CurrencyCollection.fetch_to(cs, data.credit);
+}
+
+bool TrCreditPhase::unpack_tr_phase_credit(vm::CellSlice& cs, Ref<CellSlice>& due_fees_collected, Ref<CellSlice>& credit) const {
+  return t_Maybe_Grams.fetch_to(cs, due_fees_collected)
+      && t_CurrencyCollection.fetch_to(cs, credit);
+}
+
+bool TrCreditPhase::cell_unpack(Ref<vm::Cell> cell_ref, TrCreditPhase::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TrCreditPhase::cell_unpack_tr_phase_credit(Ref<vm::Cell> cell_ref, Ref<CellSlice>& due_fees_collected, Ref<CellSlice>& credit) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_tr_phase_credit(cs, due_fees_collected, credit) && cs.empty_ext();
+}
+
+bool TrCreditPhase::pack(vm::CellBuilder& cb, const TrCreditPhase::Record& data) const {
+  return t_Maybe_Grams.store_from(cb, data.due_fees_collected)
+      && t_CurrencyCollection.store_from(cb, data.credit);
+}
+
+bool TrCreditPhase::pack_tr_phase_credit(vm::CellBuilder& cb, Ref<CellSlice> due_fees_collected, Ref<CellSlice> credit) const {
+  return t_Maybe_Grams.store_from(cb, due_fees_collected)
+      && t_CurrencyCollection.store_from(cb, credit);
+}
+
+bool TrCreditPhase::cell_pack(Ref<vm::Cell>& cell_ref, const TrCreditPhase::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrCreditPhase::cell_pack_tr_phase_credit(Ref<vm::Cell>& cell_ref, Ref<CellSlice> due_fees_collected, Ref<CellSlice> credit) const {
+  vm::CellBuilder cb;
+  return pack_tr_phase_credit(cb, std::move(due_fees_collected), std::move(credit)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrCreditPhase::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("tr_phase_credit")
+      && pp.field("due_fees_collected")
+      && t_Maybe_Grams.print_skip(pp, cs)
+      && pp.field("credit")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.close();
+}
+
+const TrCreditPhase t_TrCreditPhase;
+
+//
+// code for auxiliary type `TrComputePhase_aux`
+//
+
+int TrComputePhase_aux::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool TrComputePhase_aux::skip(vm::CellSlice& cs) const {
+  return t_VarUInteger_7.skip(cs)
+      && t_VarUInteger_7.skip(cs)
+      && t_Maybe_VarUInteger_3.skip(cs)
+      && cs.advance(40)
+      && t_Maybe_int32.skip(cs)
+      && cs.advance(544);
+}
+
+bool TrComputePhase_aux::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_VarUInteger_7.validate_skip(cs, weak)
+      && t_VarUInteger_7.validate_skip(cs, weak)
+      && t_Maybe_VarUInteger_3.validate_skip(cs, weak)
+      && cs.advance(40)
+      && t_Maybe_int32.validate_skip(cs, weak)
+      && cs.advance(544);
+}
+
+bool TrComputePhase_aux::unpack(vm::CellSlice& cs, TrComputePhase_aux::Record& data) const {
+  return t_VarUInteger_7.fetch_to(cs, data.gas_used)
+      && t_VarUInteger_7.fetch_to(cs, data.gas_limit)
+      && t_Maybe_VarUInteger_3.fetch_to(cs, data.gas_credit)
+      && cs.fetch_int_to(8, data.mode)
+      && cs.fetch_int_to(32, data.exit_code)
+      && t_Maybe_int32.fetch_to(cs, data.exit_arg)
+      && cs.fetch_uint_to(32, data.vm_steps)
+      && cs.fetch_bits_to(data.vm_init_state_hash.bits(), 256)
+      && cs.fetch_bits_to(data.vm_final_state_hash.bits(), 256);
+}
+
+bool TrComputePhase_aux::cell_unpack(Ref<vm::Cell> cell_ref, TrComputePhase_aux::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TrComputePhase_aux::pack(vm::CellBuilder& cb, const TrComputePhase_aux::Record& data) const {
+  return t_VarUInteger_7.store_from(cb, data.gas_used)
+      && t_VarUInteger_7.store_from(cb, data.gas_limit)
+      && t_Maybe_VarUInteger_3.store_from(cb, data.gas_credit)
+      && cb.store_long_rchk_bool(data.mode, 8)
+      && cb.store_long_rchk_bool(data.exit_code, 32)
+      && t_Maybe_int32.store_from(cb, data.exit_arg)
+      && cb.store_ulong_rchk_bool(data.vm_steps, 32)
+      && cb.store_bits_bool(data.vm_init_state_hash.cbits(), 256)
+      && cb.store_bits_bool(data.vm_final_state_hash.cbits(), 256);
+}
+
+bool TrComputePhase_aux::cell_pack(Ref<vm::Cell>& cell_ref, const TrComputePhase_aux::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrComputePhase_aux::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field("gas_used")
+      && t_VarUInteger_7.print_skip(pp, cs)
+      && pp.field("gas_limit")
+      && t_VarUInteger_7.print_skip(pp, cs)
+      && pp.field("gas_credit")
+      && t_Maybe_VarUInteger_3.print_skip(pp, cs)
+      && pp.fetch_int_field(cs, 8, "mode")
+      && pp.fetch_int_field(cs, 32, "exit_code")
+      && pp.field("exit_arg")
+      && t_Maybe_int32.print_skip(pp, cs)
+      && pp.fetch_uint_field(cs, 32, "vm_steps")
+      && pp.fetch_bits_field(cs, 256, "vm_init_state_hash")
+      && pp.fetch_bits_field(cs, 256, "vm_final_state_hash")
+      && pp.close();
+}
+
+const TrComputePhase_aux t_TrComputePhase_aux;
+
+//
+// code for type `TrComputePhase`
+//
+
+int TrComputePhase::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case tr_phase_compute_skipped:
+    return cs.have(1) ? tr_phase_compute_skipped : -1;
+  case tr_phase_compute_vm:
+    return cs.have(1) ? tr_phase_compute_vm : -1;
+  }
+  return -1;
+}
+
+bool TrComputePhase::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case tr_phase_compute_skipped:
+    return cs.advance(3);
+  case tr_phase_compute_vm:
+    return cs.advance(4)
+        && t_Grams.skip(cs)
+        && cs.advance_refs(1);
+  }
+  return false;
+}
+
+bool TrComputePhase::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case tr_phase_compute_skipped:
+    return cs.advance(1)
+        && t_ComputeSkipReason.validate_skip(cs, weak);
+  case tr_phase_compute_vm:
+    return cs.advance(4)
+        && t_Grams.validate_skip(cs, weak)
+        && t_TrComputePhase_aux.validate_skip_ref(cs, weak);
+  }
+  return false;
+}
+
+bool TrComputePhase::unpack(vm::CellSlice& cs, TrComputePhase::Record_tr_phase_compute_skipped& data) const {
+  return cs.fetch_ulong(1) == 0
+      && t_ComputeSkipReason.fetch_enum_to(cs, data.reason);
+}
+
+bool TrComputePhase::unpack_tr_phase_compute_skipped(vm::CellSlice& cs, char& reason) const {
+  return cs.fetch_ulong(1) == 0
+      && t_ComputeSkipReason.fetch_enum_to(cs, reason);
+}
+
+bool TrComputePhase::cell_unpack(Ref<vm::Cell> cell_ref, TrComputePhase::Record_tr_phase_compute_skipped& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TrComputePhase::cell_unpack_tr_phase_compute_skipped(Ref<vm::Cell> cell_ref, char& reason) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_tr_phase_compute_skipped(cs, reason) && cs.empty_ext();
+}
+
+bool TrComputePhase::unpack(vm::CellSlice& cs, TrComputePhase::Record_tr_phase_compute_vm& data) const {
+  return cs.fetch_ulong(1) == 1
+      && cs.fetch_bool_to(data.success)
+      && cs.fetch_bool_to(data.msg_state_used)
+      && cs.fetch_bool_to(data.account_activated)
+      && t_Grams.fetch_to(cs, data.gas_fees)
+      && t_TrComputePhase_aux.cell_unpack(cs.fetch_ref(), data.r1);
+}
+
+bool TrComputePhase::cell_unpack(Ref<vm::Cell> cell_ref, TrComputePhase::Record_tr_phase_compute_vm& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TrComputePhase::pack(vm::CellBuilder& cb, const TrComputePhase::Record_tr_phase_compute_skipped& data) const {
+  return cb.store_long_bool(0, 1)
+      && t_ComputeSkipReason.store_enum_from(cb, data.reason);
+}
+
+bool TrComputePhase::pack_tr_phase_compute_skipped(vm::CellBuilder& cb, char reason) const {
+  return cb.store_long_bool(0, 1)
+      && t_ComputeSkipReason.store_enum_from(cb, reason);
+}
+
+bool TrComputePhase::cell_pack(Ref<vm::Cell>& cell_ref, const TrComputePhase::Record_tr_phase_compute_skipped& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrComputePhase::cell_pack_tr_phase_compute_skipped(Ref<vm::Cell>& cell_ref, char reason) const {
+  vm::CellBuilder cb;
+  return pack_tr_phase_compute_skipped(cb, reason) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrComputePhase::pack(vm::CellBuilder& cb, const TrComputePhase::Record_tr_phase_compute_vm& data) const {
+  Ref<vm::Cell> tmp_cell;
+  return cb.store_long_bool(1, 1)
+      && cb.store_ulong_rchk_bool(data.success, 1)
+      && cb.store_ulong_rchk_bool(data.msg_state_used, 1)
+      && cb.store_ulong_rchk_bool(data.account_activated, 1)
+      && t_Grams.store_from(cb, data.gas_fees)
+      && t_TrComputePhase_aux.cell_pack(tmp_cell, data.r1)
+      && cb.store_ref_bool(std::move(tmp_cell));
+}
+
+bool TrComputePhase::cell_pack(Ref<vm::Cell>& cell_ref, const TrComputePhase::Record_tr_phase_compute_vm& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrComputePhase::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case tr_phase_compute_skipped:
+    return cs.advance(1)
+        && pp.open("tr_phase_compute_skipped")
+        && pp.field("reason")
+        && t_ComputeSkipReason.print_skip(pp, cs)
+        && pp.close();
+  case tr_phase_compute_vm:
+    return cs.advance(1)
+        && pp.open("tr_phase_compute_vm")
+        && pp.fetch_uint_field(cs, 1, "success")
+        && pp.fetch_uint_field(cs, 1, "msg_state_used")
+        && pp.fetch_uint_field(cs, 1, "account_activated")
+        && pp.field("gas_fees")
+        && t_Grams.print_skip(pp, cs)
+        && pp.field()
+        && t_TrComputePhase_aux.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for TrComputePhase");
+}
+
+const TrComputePhase t_TrComputePhase;
+
+//
+// code for type `ComputeSkipReason`
+//
+
+int ComputeSkipReason::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cskip_no_state:
+    return cs.have(2) ? cskip_no_state : -1;
+  case cskip_bad_state:
+    return cs.have(2) ? cskip_bad_state : -1;
+  case cskip_no_gas:
+    return cs.prefetch_ulong(2) == 2 ? cskip_no_gas : -1;
+  }
+  return -1;
+}
+
+bool ComputeSkipReason::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case cskip_no_state:
+    return cs.advance(2);
+  case cskip_bad_state:
+    return cs.advance(2);
+  case cskip_no_gas:
+    return cs.fetch_ulong(2) == 2;
+  }
+  return false;
+}
+
+bool ComputeSkipReason::fetch_enum_to(vm::CellSlice& cs, char& value) const {
+  int t = get_tag(cs);
+  value = (char)t;
+  return t >= 0 && cs.fetch_ulong(2) == (unsigned)t;
+}
+
+bool ComputeSkipReason::store_enum_from(vm::CellBuilder& cb, int value) const {
+  return cb.store_uint_less(3, value);
+}
+
+bool ComputeSkipReason::unpack(vm::CellSlice& cs, ComputeSkipReason::Record_cskip_no_state& data) const {
+  return cs.fetch_ulong(2) == 0;
+}
+
+bool ComputeSkipReason::unpack_cskip_no_state(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(2) == 0;
+}
+
+bool ComputeSkipReason::cell_unpack(Ref<vm::Cell> cell_ref, ComputeSkipReason::Record_cskip_no_state& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ComputeSkipReason::cell_unpack_cskip_no_state(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cskip_no_state(cs) && cs.empty_ext();
+}
+
+bool ComputeSkipReason::unpack(vm::CellSlice& cs, ComputeSkipReason::Record_cskip_bad_state& data) const {
+  return cs.fetch_ulong(2) == 1;
+}
+
+bool ComputeSkipReason::unpack_cskip_bad_state(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(2) == 1;
+}
+
+bool ComputeSkipReason::cell_unpack(Ref<vm::Cell> cell_ref, ComputeSkipReason::Record_cskip_bad_state& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ComputeSkipReason::cell_unpack_cskip_bad_state(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cskip_bad_state(cs) && cs.empty_ext();
+}
+
+bool ComputeSkipReason::unpack(vm::CellSlice& cs, ComputeSkipReason::Record_cskip_no_gas& data) const {
+  return cs.fetch_ulong(2) == 2;
+}
+
+bool ComputeSkipReason::unpack_cskip_no_gas(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(2) == 2;
+}
+
+bool ComputeSkipReason::cell_unpack(Ref<vm::Cell> cell_ref, ComputeSkipReason::Record_cskip_no_gas& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ComputeSkipReason::cell_unpack_cskip_no_gas(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cskip_no_gas(cs) && cs.empty_ext();
+}
+
+bool ComputeSkipReason::pack(vm::CellBuilder& cb, const ComputeSkipReason::Record_cskip_no_state& data) const {
+  return cb.store_long_bool(0, 2);
+}
+
+bool ComputeSkipReason::pack_cskip_no_state(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 2);
+}
+
+bool ComputeSkipReason::cell_pack(Ref<vm::Cell>& cell_ref, const ComputeSkipReason::Record_cskip_no_state& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ComputeSkipReason::cell_pack_cskip_no_state(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_cskip_no_state(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ComputeSkipReason::pack(vm::CellBuilder& cb, const ComputeSkipReason::Record_cskip_bad_state& data) const {
+  return cb.store_long_bool(1, 2);
+}
+
+bool ComputeSkipReason::pack_cskip_bad_state(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(1, 2);
+}
+
+bool ComputeSkipReason::cell_pack(Ref<vm::Cell>& cell_ref, const ComputeSkipReason::Record_cskip_bad_state& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ComputeSkipReason::cell_pack_cskip_bad_state(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_cskip_bad_state(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ComputeSkipReason::pack(vm::CellBuilder& cb, const ComputeSkipReason::Record_cskip_no_gas& data) const {
+  return cb.store_long_bool(2, 2);
+}
+
+bool ComputeSkipReason::pack_cskip_no_gas(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(2, 2);
+}
+
+bool ComputeSkipReason::cell_pack(Ref<vm::Cell>& cell_ref, const ComputeSkipReason::Record_cskip_no_gas& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ComputeSkipReason::cell_pack_cskip_no_gas(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_cskip_no_gas(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ComputeSkipReason::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cskip_no_state:
+    return cs.advance(2)
+        && pp.cons("cskip_no_state");
+  case cskip_bad_state:
+    return cs.advance(2)
+        && pp.cons("cskip_bad_state");
+  case cskip_no_gas:
+    return cs.fetch_ulong(2) == 2
+        && pp.cons("cskip_no_gas");
+  }
+  return pp.fail("unknown constructor for ComputeSkipReason");
+}
+
+const ComputeSkipReason t_ComputeSkipReason;
+
+//
+// code for type `TrActionPhase`
+//
+
+int TrActionPhase::check_tag(const vm::CellSlice& cs) const {
+  return tr_phase_action;
+}
+
+bool TrActionPhase::skip(vm::CellSlice& cs) const {
+  return cs.advance(3)
+      && t_AccStatusChange.skip(cs)
+      && t_Maybe_Grams.skip(cs)
+      && t_Maybe_Grams.skip(cs)
+      && cs.advance(32)
+      && t_Maybe_int32.skip(cs)
+      && cs.advance(320)
+      && t_StorageUsedShort.skip(cs);
+}
+
+bool TrActionPhase::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.advance(3)
+      && t_AccStatusChange.validate_skip(cs, weak)
+      && t_Maybe_Grams.validate_skip(cs, weak)
+      && t_Maybe_Grams.validate_skip(cs, weak)
+      && cs.advance(32)
+      && t_Maybe_int32.validate_skip(cs, weak)
+      && cs.advance(320)
+      && t_StorageUsedShort.validate_skip(cs, weak);
+}
+
+bool TrActionPhase::unpack(vm::CellSlice& cs, TrActionPhase::Record& data) const {
+  return cs.fetch_bool_to(data.success)
+      && cs.fetch_bool_to(data.valid)
+      && cs.fetch_bool_to(data.no_funds)
+      && t_AccStatusChange.fetch_enum_to(cs, data.status_change)
+      && t_Maybe_Grams.fetch_to(cs, data.total_fwd_fees)
+      && t_Maybe_Grams.fetch_to(cs, data.total_action_fees)
+      && cs.fetch_int_to(32, data.result_code)
+      && t_Maybe_int32.fetch_to(cs, data.result_arg)
+      && cs.fetch_uint_to(16, data.tot_actions)
+      && cs.fetch_uint_to(16, data.spec_actions)
+      && cs.fetch_uint_to(16, data.skipped_actions)
+      && cs.fetch_uint_to(16, data.msgs_created)
+      && cs.fetch_bits_to(data.action_list_hash.bits(), 256)
+      && t_StorageUsedShort.fetch_to(cs, data.tot_msg_size);
+}
+
+bool TrActionPhase::cell_unpack(Ref<vm::Cell> cell_ref, TrActionPhase::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TrActionPhase::pack(vm::CellBuilder& cb, const TrActionPhase::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.success, 1)
+      && cb.store_ulong_rchk_bool(data.valid, 1)
+      && cb.store_ulong_rchk_bool(data.no_funds, 1)
+      && t_AccStatusChange.store_enum_from(cb, data.status_change)
+      && t_Maybe_Grams.store_from(cb, data.total_fwd_fees)
+      && t_Maybe_Grams.store_from(cb, data.total_action_fees)
+      && cb.store_long_rchk_bool(data.result_code, 32)
+      && t_Maybe_int32.store_from(cb, data.result_arg)
+      && cb.store_ulong_rchk_bool(data.tot_actions, 16)
+      && cb.store_ulong_rchk_bool(data.spec_actions, 16)
+      && cb.store_ulong_rchk_bool(data.skipped_actions, 16)
+      && cb.store_ulong_rchk_bool(data.msgs_created, 16)
+      && cb.store_bits_bool(data.action_list_hash.cbits(), 256)
+      && t_StorageUsedShort.store_from(cb, data.tot_msg_size);
+}
+
+bool TrActionPhase::cell_pack(Ref<vm::Cell>& cell_ref, const TrActionPhase::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrActionPhase::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("tr_phase_action")
+      && pp.fetch_uint_field(cs, 1, "success")
+      && pp.fetch_uint_field(cs, 1, "valid")
+      && pp.fetch_uint_field(cs, 1, "no_funds")
+      && pp.field("status_change")
+      && t_AccStatusChange.print_skip(pp, cs)
+      && pp.field("total_fwd_fees")
+      && t_Maybe_Grams.print_skip(pp, cs)
+      && pp.field("total_action_fees")
+      && t_Maybe_Grams.print_skip(pp, cs)
+      && pp.fetch_int_field(cs, 32, "result_code")
+      && pp.field("result_arg")
+      && t_Maybe_int32.print_skip(pp, cs)
+      && pp.fetch_uint_field(cs, 16, "tot_actions")
+      && pp.fetch_uint_field(cs, 16, "spec_actions")
+      && pp.fetch_uint_field(cs, 16, "skipped_actions")
+      && pp.fetch_uint_field(cs, 16, "msgs_created")
+      && pp.fetch_bits_field(cs, 256, "action_list_hash")
+      && pp.field("tot_msg_size")
+      && t_StorageUsedShort.print_skip(pp, cs)
+      && pp.close();
+}
+
+const TrActionPhase t_TrActionPhase;
+
+//
+// code for type `TrBouncePhase`
+//
+constexpr char TrBouncePhase::cons_len[3];
+constexpr unsigned char TrBouncePhase::cons_tag[3];
+
+int TrBouncePhase::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case tr_phase_bounce_negfunds:
+    return cs.have(2) ? tr_phase_bounce_negfunds : -1;
+  case tr_phase_bounce_nofunds:
+    return cs.have(2) ? tr_phase_bounce_nofunds : -1;
+  case tr_phase_bounce_ok:
+    return cs.have(1) ? tr_phase_bounce_ok : -1;
+  }
+  return -1;
+}
+
+bool TrBouncePhase::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case tr_phase_bounce_negfunds:
+    return cs.advance(2);
+  case tr_phase_bounce_nofunds:
+    return cs.advance(2)
+        && t_StorageUsedShort.skip(cs)
+        && t_Grams.skip(cs);
+  case tr_phase_bounce_ok:
+    return cs.advance(1)
+        && t_StorageUsedShort.skip(cs)
+        && t_Grams.skip(cs)
+        && t_Grams.skip(cs);
+  }
+  return false;
+}
+
+bool TrBouncePhase::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case tr_phase_bounce_negfunds:
+    return cs.advance(2);
+  case tr_phase_bounce_nofunds:
+    return cs.advance(2)
+        && t_StorageUsedShort.validate_skip(cs, weak)
+        && t_Grams.validate_skip(cs, weak);
+  case tr_phase_bounce_ok:
+    return cs.advance(1)
+        && t_StorageUsedShort.validate_skip(cs, weak)
+        && t_Grams.validate_skip(cs, weak)
+        && t_Grams.validate_skip(cs, weak);
+  }
+  return false;
+}
+
+bool TrBouncePhase::unpack(vm::CellSlice& cs, TrBouncePhase::Record_tr_phase_bounce_negfunds& data) const {
+  return cs.fetch_ulong(2) == 0;
+}
+
+bool TrBouncePhase::unpack_tr_phase_bounce_negfunds(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(2) == 0;
+}
+
+bool TrBouncePhase::cell_unpack(Ref<vm::Cell> cell_ref, TrBouncePhase::Record_tr_phase_bounce_negfunds& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TrBouncePhase::cell_unpack_tr_phase_bounce_negfunds(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_tr_phase_bounce_negfunds(cs) && cs.empty_ext();
+}
+
+bool TrBouncePhase::unpack(vm::CellSlice& cs, TrBouncePhase::Record_tr_phase_bounce_nofunds& data) const {
+  return cs.fetch_ulong(2) == 1
+      && t_StorageUsedShort.fetch_to(cs, data.msg_size)
+      && t_Grams.fetch_to(cs, data.req_fwd_fees);
+}
+
+bool TrBouncePhase::unpack_tr_phase_bounce_nofunds(vm::CellSlice& cs, Ref<CellSlice>& msg_size, Ref<CellSlice>& req_fwd_fees) const {
+  return cs.fetch_ulong(2) == 1
+      && t_StorageUsedShort.fetch_to(cs, msg_size)
+      && t_Grams.fetch_to(cs, req_fwd_fees);
+}
+
+bool TrBouncePhase::cell_unpack(Ref<vm::Cell> cell_ref, TrBouncePhase::Record_tr_phase_bounce_nofunds& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TrBouncePhase::cell_unpack_tr_phase_bounce_nofunds(Ref<vm::Cell> cell_ref, Ref<CellSlice>& msg_size, Ref<CellSlice>& req_fwd_fees) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_tr_phase_bounce_nofunds(cs, msg_size, req_fwd_fees) && cs.empty_ext();
+}
+
+bool TrBouncePhase::unpack(vm::CellSlice& cs, TrBouncePhase::Record_tr_phase_bounce_ok& data) const {
+  return cs.fetch_ulong(1) == 1
+      && t_StorageUsedShort.fetch_to(cs, data.msg_size)
+      && t_Grams.fetch_to(cs, data.msg_fees)
+      && t_Grams.fetch_to(cs, data.fwd_fees);
+}
+
+bool TrBouncePhase::unpack_tr_phase_bounce_ok(vm::CellSlice& cs, Ref<CellSlice>& msg_size, Ref<CellSlice>& msg_fees, Ref<CellSlice>& fwd_fees) const {
+  return cs.fetch_ulong(1) == 1
+      && t_StorageUsedShort.fetch_to(cs, msg_size)
+      && t_Grams.fetch_to(cs, msg_fees)
+      && t_Grams.fetch_to(cs, fwd_fees);
+}
+
+bool TrBouncePhase::cell_unpack(Ref<vm::Cell> cell_ref, TrBouncePhase::Record_tr_phase_bounce_ok& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TrBouncePhase::cell_unpack_tr_phase_bounce_ok(Ref<vm::Cell> cell_ref, Ref<CellSlice>& msg_size, Ref<CellSlice>& msg_fees, Ref<CellSlice>& fwd_fees) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_tr_phase_bounce_ok(cs, msg_size, msg_fees, fwd_fees) && cs.empty_ext();
+}
+
+bool TrBouncePhase::pack(vm::CellBuilder& cb, const TrBouncePhase::Record_tr_phase_bounce_negfunds& data) const {
+  return cb.store_long_bool(0, 2);
+}
+
+bool TrBouncePhase::pack_tr_phase_bounce_negfunds(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 2);
+}
+
+bool TrBouncePhase::cell_pack(Ref<vm::Cell>& cell_ref, const TrBouncePhase::Record_tr_phase_bounce_negfunds& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrBouncePhase::cell_pack_tr_phase_bounce_negfunds(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_tr_phase_bounce_negfunds(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrBouncePhase::pack(vm::CellBuilder& cb, const TrBouncePhase::Record_tr_phase_bounce_nofunds& data) const {
+  return cb.store_long_bool(1, 2)
+      && t_StorageUsedShort.store_from(cb, data.msg_size)
+      && t_Grams.store_from(cb, data.req_fwd_fees);
+}
+
+bool TrBouncePhase::pack_tr_phase_bounce_nofunds(vm::CellBuilder& cb, Ref<CellSlice> msg_size, Ref<CellSlice> req_fwd_fees) const {
+  return cb.store_long_bool(1, 2)
+      && t_StorageUsedShort.store_from(cb, msg_size)
+      && t_Grams.store_from(cb, req_fwd_fees);
+}
+
+bool TrBouncePhase::cell_pack(Ref<vm::Cell>& cell_ref, const TrBouncePhase::Record_tr_phase_bounce_nofunds& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrBouncePhase::cell_pack_tr_phase_bounce_nofunds(Ref<vm::Cell>& cell_ref, Ref<CellSlice> msg_size, Ref<CellSlice> req_fwd_fees) const {
+  vm::CellBuilder cb;
+  return pack_tr_phase_bounce_nofunds(cb, std::move(msg_size), std::move(req_fwd_fees)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrBouncePhase::pack(vm::CellBuilder& cb, const TrBouncePhase::Record_tr_phase_bounce_ok& data) const {
+  return cb.store_long_bool(1, 1)
+      && t_StorageUsedShort.store_from(cb, data.msg_size)
+      && t_Grams.store_from(cb, data.msg_fees)
+      && t_Grams.store_from(cb, data.fwd_fees);
+}
+
+bool TrBouncePhase::pack_tr_phase_bounce_ok(vm::CellBuilder& cb, Ref<CellSlice> msg_size, Ref<CellSlice> msg_fees, Ref<CellSlice> fwd_fees) const {
+  return cb.store_long_bool(1, 1)
+      && t_StorageUsedShort.store_from(cb, msg_size)
+      && t_Grams.store_from(cb, msg_fees)
+      && t_Grams.store_from(cb, fwd_fees);
+}
+
+bool TrBouncePhase::cell_pack(Ref<vm::Cell>& cell_ref, const TrBouncePhase::Record_tr_phase_bounce_ok& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrBouncePhase::cell_pack_tr_phase_bounce_ok(Ref<vm::Cell>& cell_ref, Ref<CellSlice> msg_size, Ref<CellSlice> msg_fees, Ref<CellSlice> fwd_fees) const {
+  vm::CellBuilder cb;
+  return pack_tr_phase_bounce_ok(cb, std::move(msg_size), std::move(msg_fees), std::move(fwd_fees)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TrBouncePhase::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case tr_phase_bounce_negfunds:
+    return cs.advance(2)
+        && pp.cons("tr_phase_bounce_negfunds");
+  case tr_phase_bounce_nofunds:
+    return cs.advance(2)
+        && pp.open("tr_phase_bounce_nofunds")
+        && pp.field("msg_size")
+        && t_StorageUsedShort.print_skip(pp, cs)
+        && pp.field("req_fwd_fees")
+        && t_Grams.print_skip(pp, cs)
+        && pp.close();
+  case tr_phase_bounce_ok:
+    return cs.advance(1)
+        && pp.open("tr_phase_bounce_ok")
+        && pp.field("msg_size")
+        && t_StorageUsedShort.print_skip(pp, cs)
+        && pp.field("msg_fees")
+        && t_Grams.print_skip(pp, cs)
+        && pp.field("fwd_fees")
+        && t_Grams.print_skip(pp, cs)
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for TrBouncePhase");
+}
+
+const TrBouncePhase t_TrBouncePhase;
+
+//
+// code for type `SplitMergeInfo`
+//
+
+int SplitMergeInfo::check_tag(const vm::CellSlice& cs) const {
+  return split_merge_info;
+}
+
+bool SplitMergeInfo::unpack(vm::CellSlice& cs, SplitMergeInfo::Record& data) const {
+  return cs.fetch_uint_to(6, data.cur_shard_pfx_len)
+      && cs.fetch_uint_to(6, data.acc_split_depth)
+      && cs.fetch_bits_to(data.this_addr.bits(), 256)
+      && cs.fetch_bits_to(data.sibling_addr.bits(), 256);
+}
+
+bool SplitMergeInfo::cell_unpack(Ref<vm::Cell> cell_ref, SplitMergeInfo::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool SplitMergeInfo::pack(vm::CellBuilder& cb, const SplitMergeInfo::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.cur_shard_pfx_len, 6)
+      && cb.store_ulong_rchk_bool(data.acc_split_depth, 6)
+      && cb.store_bits_bool(data.this_addr.cbits(), 256)
+      && cb.store_bits_bool(data.sibling_addr.cbits(), 256);
+}
+
+bool SplitMergeInfo::cell_pack(Ref<vm::Cell>& cell_ref, const SplitMergeInfo::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool SplitMergeInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int cur_shard_pfx_len, acc_split_depth;
+  return pp.open("split_merge_info")
+      && cs.fetch_uint_to(6, cur_shard_pfx_len)
+      && pp.field_int(cur_shard_pfx_len, "cur_shard_pfx_len")
+      && cs.fetch_uint_to(6, acc_split_depth)
+      && pp.field_int(acc_split_depth, "acc_split_depth")
+      && pp.fetch_bits_field(cs, 256, "this_addr")
+      && pp.fetch_bits_field(cs, 256, "sibling_addr")
+      && pp.close();
+}
+
+const SplitMergeInfo t_SplitMergeInfo;
+
+//
+// code for type `TransactionDescr`
+//
+constexpr char TransactionDescr::cons_len[7];
+constexpr unsigned char TransactionDescr::cons_tag[7];
+
+int TransactionDescr::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case trans_ord:
+    return cs.have(4) ? trans_ord : -1;
+  case trans_storage:
+    return cs.have(4) ? trans_storage : -1;
+  case trans_tick_tock:
+    return cs.have(3) ? trans_tick_tock : -1;
+  case trans_split_prepare:
+    return cs.have(4) ? trans_split_prepare : -1;
+  case trans_split_install:
+    return cs.have(4) ? trans_split_install : -1;
+  case trans_merge_prepare:
+    return cs.have(4) ? trans_merge_prepare : -1;
+  case trans_merge_install:
+    return cs.prefetch_ulong(4) == 7 ? trans_merge_install : -1;
+  }
+  return -1;
+}
+
+bool TransactionDescr::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case trans_ord:
+    return cs.advance(5)
+        && t_Maybe_TrStoragePhase.skip(cs)
+        && t_Maybe_TrCreditPhase.skip(cs)
+        && t_TrComputePhase.skip(cs)
+        && t_Maybe_Ref_TrActionPhase.skip(cs)
+        && cs.advance(1)
+        && t_Maybe_TrBouncePhase.skip(cs)
+        && cs.advance(1);
+  case trans_storage:
+    return cs.advance(4)
+        && t_TrStoragePhase.skip(cs);
+  case trans_tick_tock:
+    return cs.advance(4)
+        && t_TrStoragePhase.skip(cs)
+        && t_TrComputePhase.skip(cs)
+        && t_Maybe_Ref_TrActionPhase.skip(cs)
+        && cs.advance(2);
+  case trans_split_prepare:
+    return cs.advance(528)
+        && t_TrComputePhase.skip(cs)
+        && t_Maybe_Ref_TrActionPhase.skip(cs)
+        && cs.advance(2);
+  case trans_split_install:
+    return cs.advance_ext(0x10211);
+  case trans_merge_prepare:
+    return cs.advance(528)
+        && t_TrStoragePhase.skip(cs)
+        && cs.advance(1);
+  case trans_merge_install:
+    return cs.advance_ext(0x10210)
+        && t_Maybe_TrCreditPhase.skip(cs)
+        && t_TrComputePhase.skip(cs)
+        && t_Maybe_Ref_TrActionPhase.skip(cs)
+        && cs.advance(2);
+  }
+  return false;
+}
+
+bool TransactionDescr::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case trans_ord:
+    return cs.advance(5)
+        && t_Maybe_TrStoragePhase.validate_skip(cs, weak)
+        && t_Maybe_TrCreditPhase.validate_skip(cs, weak)
+        && t_TrComputePhase.validate_skip(cs, weak)
+        && t_Maybe_Ref_TrActionPhase.validate_skip(cs, weak)
+        && cs.advance(1)
+        && t_Maybe_TrBouncePhase.validate_skip(cs, weak)
+        && cs.advance(1);
+  case trans_storage:
+    return cs.advance(4)
+        && t_TrStoragePhase.validate_skip(cs, weak);
+  case trans_tick_tock:
+    return cs.advance(4)
+        && t_TrStoragePhase.validate_skip(cs, weak)
+        && t_TrComputePhase.validate_skip(cs, weak)
+        && t_Maybe_Ref_TrActionPhase.validate_skip(cs, weak)
+        && cs.advance(2);
+  case trans_split_prepare:
+    return cs.advance(528)
+        && t_TrComputePhase.validate_skip(cs, weak)
+        && t_Maybe_Ref_TrActionPhase.validate_skip(cs, weak)
+        && cs.advance(2);
+  case trans_split_install:
+    return cs.advance(528)
+        && t_Transaction.validate_skip_ref(cs, weak)
+        && cs.advance(1);
+  case trans_merge_prepare:
+    return cs.advance(528)
+        && t_TrStoragePhase.validate_skip(cs, weak)
+        && cs.advance(1);
+  case trans_merge_install:
+    return cs.fetch_ulong(4) == 7
+        && cs.advance(524)
+        && t_Transaction.validate_skip_ref(cs, weak)
+        && t_Maybe_TrCreditPhase.validate_skip(cs, weak)
+        && t_TrComputePhase.validate_skip(cs, weak)
+        && t_Maybe_Ref_TrActionPhase.validate_skip(cs, weak)
+        && cs.advance(2);
+  }
+  return false;
+}
+
+bool TransactionDescr::unpack(vm::CellSlice& cs, TransactionDescr::Record_trans_ord& data) const {
+  return cs.fetch_ulong(4) == 0
+      && cs.fetch_bool_to(data.credit_first)
+      && t_Maybe_TrStoragePhase.fetch_to(cs, data.storage_ph)
+      && t_Maybe_TrCreditPhase.fetch_to(cs, data.credit_ph)
+      && t_TrComputePhase.fetch_to(cs, data.compute_ph)
+      && t_Maybe_Ref_TrActionPhase.fetch_to(cs, data.action)
+      && cs.fetch_bool_to(data.aborted)
+      && t_Maybe_TrBouncePhase.fetch_to(cs, data.bounce)
+      && cs.fetch_bool_to(data.destroyed);
+}
+
+bool TransactionDescr::cell_unpack(Ref<vm::Cell> cell_ref, TransactionDescr::Record_trans_ord& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TransactionDescr::unpack(vm::CellSlice& cs, TransactionDescr::Record_trans_storage& data) const {
+  return cs.fetch_ulong(4) == 1
+      && t_TrStoragePhase.fetch_to(cs, data.storage_ph);
+}
+
+bool TransactionDescr::unpack_trans_storage(vm::CellSlice& cs, Ref<CellSlice>& storage_ph) const {
+  return cs.fetch_ulong(4) == 1
+      && t_TrStoragePhase.fetch_to(cs, storage_ph);
+}
+
+bool TransactionDescr::cell_unpack(Ref<vm::Cell> cell_ref, TransactionDescr::Record_trans_storage& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TransactionDescr::cell_unpack_trans_storage(Ref<vm::Cell> cell_ref, Ref<CellSlice>& storage_ph) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_trans_storage(cs, storage_ph) && cs.empty_ext();
+}
+
+bool TransactionDescr::unpack(vm::CellSlice& cs, TransactionDescr::Record_trans_tick_tock& data) const {
+  return cs.fetch_ulong(3) == 1
+      && cs.fetch_bool_to(data.is_tock)
+      && t_TrStoragePhase.fetch_to(cs, data.storage)
+      && t_TrComputePhase.fetch_to(cs, data.compute_ph)
+      && t_Maybe_Ref_TrActionPhase.fetch_to(cs, data.action)
+      && cs.fetch_bool_to(data.aborted)
+      && cs.fetch_bool_to(data.destroyed);
+}
+
+bool TransactionDescr::cell_unpack(Ref<vm::Cell> cell_ref, TransactionDescr::Record_trans_tick_tock& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TransactionDescr::unpack(vm::CellSlice& cs, TransactionDescr::Record_trans_split_prepare& data) const {
+  return cs.fetch_ulong(4) == 4
+      && cs.fetch_subslice_to(524, data.split_info)
+      && t_TrComputePhase.fetch_to(cs, data.compute_ph)
+      && t_Maybe_Ref_TrActionPhase.fetch_to(cs, data.action)
+      && cs.fetch_bool_to(data.aborted)
+      && cs.fetch_bool_to(data.destroyed);
+}
+
+bool TransactionDescr::cell_unpack(Ref<vm::Cell> cell_ref, TransactionDescr::Record_trans_split_prepare& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TransactionDescr::unpack(vm::CellSlice& cs, TransactionDescr::Record_trans_split_install& data) const {
+  return cs.fetch_ulong(4) == 5
+      && cs.fetch_subslice_to(524, data.split_info)
+      && cs.fetch_ref_to(data.prepare_transaction)
+      && cs.fetch_bool_to(data.installed);
+}
+
+bool TransactionDescr::unpack_trans_split_install(vm::CellSlice& cs, Ref<CellSlice>& split_info, Ref<Cell>& prepare_transaction, bool& installed) const {
+  return cs.fetch_ulong(4) == 5
+      && cs.fetch_subslice_to(524, split_info)
+      && cs.fetch_ref_to(prepare_transaction)
+      && cs.fetch_bool_to(installed);
+}
+
+bool TransactionDescr::cell_unpack(Ref<vm::Cell> cell_ref, TransactionDescr::Record_trans_split_install& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TransactionDescr::cell_unpack_trans_split_install(Ref<vm::Cell> cell_ref, Ref<CellSlice>& split_info, Ref<Cell>& prepare_transaction, bool& installed) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_trans_split_install(cs, split_info, prepare_transaction, installed) && cs.empty_ext();
+}
+
+bool TransactionDescr::unpack(vm::CellSlice& cs, TransactionDescr::Record_trans_merge_prepare& data) const {
+  return cs.fetch_ulong(4) == 6
+      && cs.fetch_subslice_to(524, data.split_info)
+      && t_TrStoragePhase.fetch_to(cs, data.storage_ph)
+      && cs.fetch_bool_to(data.aborted);
+}
+
+bool TransactionDescr::unpack_trans_merge_prepare(vm::CellSlice& cs, Ref<CellSlice>& split_info, Ref<CellSlice>& storage_ph, bool& aborted) const {
+  return cs.fetch_ulong(4) == 6
+      && cs.fetch_subslice_to(524, split_info)
+      && t_TrStoragePhase.fetch_to(cs, storage_ph)
+      && cs.fetch_bool_to(aborted);
+}
+
+bool TransactionDescr::cell_unpack(Ref<vm::Cell> cell_ref, TransactionDescr::Record_trans_merge_prepare& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TransactionDescr::cell_unpack_trans_merge_prepare(Ref<vm::Cell> cell_ref, Ref<CellSlice>& split_info, Ref<CellSlice>& storage_ph, bool& aborted) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_trans_merge_prepare(cs, split_info, storage_ph, aborted) && cs.empty_ext();
+}
+
+bool TransactionDescr::unpack(vm::CellSlice& cs, TransactionDescr::Record_trans_merge_install& data) const {
+  return cs.fetch_ulong(4) == 7
+      && cs.fetch_subslice_to(524, data.split_info)
+      && cs.fetch_ref_to(data.prepare_transaction)
+      && t_Maybe_TrCreditPhase.fetch_to(cs, data.credit_ph)
+      && t_TrComputePhase.fetch_to(cs, data.compute_ph)
+      && t_Maybe_Ref_TrActionPhase.fetch_to(cs, data.action)
+      && cs.fetch_bool_to(data.aborted)
+      && cs.fetch_bool_to(data.destroyed);
+}
+
+bool TransactionDescr::cell_unpack(Ref<vm::Cell> cell_ref, TransactionDescr::Record_trans_merge_install& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TransactionDescr::pack(vm::CellBuilder& cb, const TransactionDescr::Record_trans_ord& data) const {
+  return cb.store_long_bool(0, 4)
+      && cb.store_ulong_rchk_bool(data.credit_first, 1)
+      && t_Maybe_TrStoragePhase.store_from(cb, data.storage_ph)
+      && t_Maybe_TrCreditPhase.store_from(cb, data.credit_ph)
+      && t_TrComputePhase.store_from(cb, data.compute_ph)
+      && t_Maybe_Ref_TrActionPhase.store_from(cb, data.action)
+      && cb.store_ulong_rchk_bool(data.aborted, 1)
+      && t_Maybe_TrBouncePhase.store_from(cb, data.bounce)
+      && cb.store_ulong_rchk_bool(data.destroyed, 1);
+}
+
+bool TransactionDescr::cell_pack(Ref<vm::Cell>& cell_ref, const TransactionDescr::Record_trans_ord& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TransactionDescr::pack(vm::CellBuilder& cb, const TransactionDescr::Record_trans_storage& data) const {
+  return cb.store_long_bool(1, 4)
+      && t_TrStoragePhase.store_from(cb, data.storage_ph);
+}
+
+bool TransactionDescr::pack_trans_storage(vm::CellBuilder& cb, Ref<CellSlice> storage_ph) const {
+  return cb.store_long_bool(1, 4)
+      && t_TrStoragePhase.store_from(cb, storage_ph);
+}
+
+bool TransactionDescr::cell_pack(Ref<vm::Cell>& cell_ref, const TransactionDescr::Record_trans_storage& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TransactionDescr::cell_pack_trans_storage(Ref<vm::Cell>& cell_ref, Ref<CellSlice> storage_ph) const {
+  vm::CellBuilder cb;
+  return pack_trans_storage(cb, std::move(storage_ph)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TransactionDescr::pack(vm::CellBuilder& cb, const TransactionDescr::Record_trans_tick_tock& data) const {
+  return cb.store_long_bool(1, 3)
+      && cb.store_ulong_rchk_bool(data.is_tock, 1)
+      && t_TrStoragePhase.store_from(cb, data.storage)
+      && t_TrComputePhase.store_from(cb, data.compute_ph)
+      && t_Maybe_Ref_TrActionPhase.store_from(cb, data.action)
+      && cb.store_ulong_rchk_bool(data.aborted, 1)
+      && cb.store_ulong_rchk_bool(data.destroyed, 1);
+}
+
+bool TransactionDescr::cell_pack(Ref<vm::Cell>& cell_ref, const TransactionDescr::Record_trans_tick_tock& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TransactionDescr::pack(vm::CellBuilder& cb, const TransactionDescr::Record_trans_split_prepare& data) const {
+  return cb.store_long_bool(4, 4)
+      && cb.append_cellslice_chk(data.split_info, 524)
+      && t_TrComputePhase.store_from(cb, data.compute_ph)
+      && t_Maybe_Ref_TrActionPhase.store_from(cb, data.action)
+      && cb.store_ulong_rchk_bool(data.aborted, 1)
+      && cb.store_ulong_rchk_bool(data.destroyed, 1);
+}
+
+bool TransactionDescr::cell_pack(Ref<vm::Cell>& cell_ref, const TransactionDescr::Record_trans_split_prepare& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TransactionDescr::pack(vm::CellBuilder& cb, const TransactionDescr::Record_trans_split_install& data) const {
+  return cb.store_long_bool(5, 4)
+      && cb.append_cellslice_chk(data.split_info, 524)
+      && cb.store_ref_bool(data.prepare_transaction)
+      && cb.store_ulong_rchk_bool(data.installed, 1);
+}
+
+bool TransactionDescr::pack_trans_split_install(vm::CellBuilder& cb, Ref<CellSlice> split_info, Ref<Cell> prepare_transaction, bool installed) const {
+  return cb.store_long_bool(5, 4)
+      && cb.append_cellslice_chk(split_info, 524)
+      && cb.store_ref_bool(prepare_transaction)
+      && cb.store_ulong_rchk_bool(installed, 1);
+}
+
+bool TransactionDescr::cell_pack(Ref<vm::Cell>& cell_ref, const TransactionDescr::Record_trans_split_install& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TransactionDescr::cell_pack_trans_split_install(Ref<vm::Cell>& cell_ref, Ref<CellSlice> split_info, Ref<Cell> prepare_transaction, bool installed) const {
+  vm::CellBuilder cb;
+  return pack_trans_split_install(cb, std::move(split_info), std::move(prepare_transaction), installed) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TransactionDescr::pack(vm::CellBuilder& cb, const TransactionDescr::Record_trans_merge_prepare& data) const {
+  return cb.store_long_bool(6, 4)
+      && cb.append_cellslice_chk(data.split_info, 524)
+      && t_TrStoragePhase.store_from(cb, data.storage_ph)
+      && cb.store_ulong_rchk_bool(data.aborted, 1);
+}
+
+bool TransactionDescr::pack_trans_merge_prepare(vm::CellBuilder& cb, Ref<CellSlice> split_info, Ref<CellSlice> storage_ph, bool aborted) const {
+  return cb.store_long_bool(6, 4)
+      && cb.append_cellslice_chk(split_info, 524)
+      && t_TrStoragePhase.store_from(cb, storage_ph)
+      && cb.store_ulong_rchk_bool(aborted, 1);
+}
+
+bool TransactionDescr::cell_pack(Ref<vm::Cell>& cell_ref, const TransactionDescr::Record_trans_merge_prepare& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TransactionDescr::cell_pack_trans_merge_prepare(Ref<vm::Cell>& cell_ref, Ref<CellSlice> split_info, Ref<CellSlice> storage_ph, bool aborted) const {
+  vm::CellBuilder cb;
+  return pack_trans_merge_prepare(cb, std::move(split_info), std::move(storage_ph), aborted) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TransactionDescr::pack(vm::CellBuilder& cb, const TransactionDescr::Record_trans_merge_install& data) const {
+  return cb.store_long_bool(7, 4)
+      && cb.append_cellslice_chk(data.split_info, 524)
+      && cb.store_ref_bool(data.prepare_transaction)
+      && t_Maybe_TrCreditPhase.store_from(cb, data.credit_ph)
+      && t_TrComputePhase.store_from(cb, data.compute_ph)
+      && t_Maybe_Ref_TrActionPhase.store_from(cb, data.action)
+      && cb.store_ulong_rchk_bool(data.aborted, 1)
+      && cb.store_ulong_rchk_bool(data.destroyed, 1);
+}
+
+bool TransactionDescr::cell_pack(Ref<vm::Cell>& cell_ref, const TransactionDescr::Record_trans_merge_install& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TransactionDescr::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case trans_ord:
+    return cs.advance(4)
+        && pp.open("trans_ord")
+        && pp.fetch_uint_field(cs, 1, "credit_first")
+        && pp.field("storage_ph")
+        && t_Maybe_TrStoragePhase.print_skip(pp, cs)
+        && pp.field("credit_ph")
+        && t_Maybe_TrCreditPhase.print_skip(pp, cs)
+        && pp.field("compute_ph")
+        && t_TrComputePhase.print_skip(pp, cs)
+        && pp.field("action")
+        && t_Maybe_Ref_TrActionPhase.print_skip(pp, cs)
+        && pp.fetch_uint_field(cs, 1, "aborted")
+        && pp.field("bounce")
+        && t_Maybe_TrBouncePhase.print_skip(pp, cs)
+        && pp.fetch_uint_field(cs, 1, "destroyed")
+        && pp.close();
+  case trans_storage:
+    return cs.advance(4)
+        && pp.open("trans_storage")
+        && pp.field("storage_ph")
+        && t_TrStoragePhase.print_skip(pp, cs)
+        && pp.close();
+  case trans_tick_tock:
+    return cs.advance(3)
+        && pp.open("trans_tick_tock")
+        && pp.fetch_uint_field(cs, 1, "is_tock")
+        && pp.field("storage")
+        && t_TrStoragePhase.print_skip(pp, cs)
+        && pp.field("compute_ph")
+        && t_TrComputePhase.print_skip(pp, cs)
+        && pp.field("action")
+        && t_Maybe_Ref_TrActionPhase.print_skip(pp, cs)
+        && pp.fetch_uint_field(cs, 1, "aborted")
+        && pp.fetch_uint_field(cs, 1, "destroyed")
+        && pp.close();
+  case trans_split_prepare:
+    return cs.advance(4)
+        && pp.open("trans_split_prepare")
+        && pp.field("split_info")
+        && t_SplitMergeInfo.print_skip(pp, cs)
+        && pp.field("compute_ph")
+        && t_TrComputePhase.print_skip(pp, cs)
+        && pp.field("action")
+        && t_Maybe_Ref_TrActionPhase.print_skip(pp, cs)
+        && pp.fetch_uint_field(cs, 1, "aborted")
+        && pp.fetch_uint_field(cs, 1, "destroyed")
+        && pp.close();
+  case trans_split_install:
+    return cs.advance(4)
+        && pp.open("trans_split_install")
+        && pp.field("split_info")
+        && t_SplitMergeInfo.print_skip(pp, cs)
+        && pp.field("prepare_transaction")
+        && t_Transaction.print_ref(pp, cs.fetch_ref())
+        && pp.fetch_uint_field(cs, 1, "installed")
+        && pp.close();
+  case trans_merge_prepare:
+    return cs.advance(4)
+        && pp.open("trans_merge_prepare")
+        && pp.field("split_info")
+        && t_SplitMergeInfo.print_skip(pp, cs)
+        && pp.field("storage_ph")
+        && t_TrStoragePhase.print_skip(pp, cs)
+        && pp.fetch_uint_field(cs, 1, "aborted")
+        && pp.close();
+  case trans_merge_install:
+    return cs.fetch_ulong(4) == 7
+        && pp.open("trans_merge_install")
+        && pp.field("split_info")
+        && t_SplitMergeInfo.print_skip(pp, cs)
+        && pp.field("prepare_transaction")
+        && t_Transaction.print_ref(pp, cs.fetch_ref())
+        && pp.field("credit_ph")
+        && t_Maybe_TrCreditPhase.print_skip(pp, cs)
+        && pp.field("compute_ph")
+        && t_TrComputePhase.print_skip(pp, cs)
+        && pp.field("action")
+        && t_Maybe_Ref_TrActionPhase.print_skip(pp, cs)
+        && pp.fetch_uint_field(cs, 1, "aborted")
+        && pp.fetch_uint_field(cs, 1, "destroyed")
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for TransactionDescr");
+}
+
+const TransactionDescr t_TransactionDescr;
+
+//
+// code for type `SmartContractInfo`
+//
+constexpr unsigned SmartContractInfo::cons_tag[1];
+
+int SmartContractInfo::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(32) == 0x76ef1ea ? smc_info : -1;
+}
+
+bool SmartContractInfo::skip(vm::CellSlice& cs) const {
+  return cs.advance(480)
+      && t_CurrencyCollection.skip(cs)
+      && t_MsgAddressInt.skip(cs);
+}
+
+bool SmartContractInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(32) == 0x76ef1ea
+      && cs.advance(448)
+      && t_CurrencyCollection.validate_skip(cs, weak)
+      && t_MsgAddressInt.validate_skip(cs, weak);
+}
+
+bool SmartContractInfo::unpack(vm::CellSlice& cs, SmartContractInfo::Record& data) const {
+  return cs.fetch_ulong(32) == 0x76ef1ea
+      && cs.fetch_uint_to(16, data.actions)
+      && cs.fetch_uint_to(16, data.msgs_sent)
+      && cs.fetch_uint_to(32, data.unixtime)
+      && cs.fetch_uint_to(64, data.block_lt)
+      && cs.fetch_uint_to(64, data.trans_lt)
+      && cs.fetch_bits_to(data.rand_seed.bits(), 256)
+      && t_CurrencyCollection.fetch_to(cs, data.balance_remaining)
+      && t_MsgAddressInt.fetch_to(cs, data.myself);
+}
+
+bool SmartContractInfo::cell_unpack(Ref<vm::Cell> cell_ref, SmartContractInfo::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool SmartContractInfo::pack(vm::CellBuilder& cb, const SmartContractInfo::Record& data) const {
+  return cb.store_long_bool(0x76ef1ea, 32)
+      && cb.store_ulong_rchk_bool(data.actions, 16)
+      && cb.store_ulong_rchk_bool(data.msgs_sent, 16)
+      && cb.store_ulong_rchk_bool(data.unixtime, 32)
+      && cb.store_ulong_rchk_bool(data.block_lt, 64)
+      && cb.store_ulong_rchk_bool(data.trans_lt, 64)
+      && cb.store_bits_bool(data.rand_seed.cbits(), 256)
+      && t_CurrencyCollection.store_from(cb, data.balance_remaining)
+      && t_MsgAddressInt.store_from(cb, data.myself);
+}
+
+bool SmartContractInfo::cell_pack(Ref<vm::Cell>& cell_ref, const SmartContractInfo::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool SmartContractInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(32) == 0x76ef1ea
+      && pp.open("smc_info")
+      && pp.fetch_uint_field(cs, 16, "actions")
+      && pp.fetch_uint_field(cs, 16, "msgs_sent")
+      && pp.fetch_uint_field(cs, 32, "unixtime")
+      && pp.fetch_uint_field(cs, 64, "block_lt")
+      && pp.fetch_uint_field(cs, 64, "trans_lt")
+      && pp.fetch_bits_field(cs, 256, "rand_seed")
+      && pp.field("balance_remaining")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("myself")
+      && t_MsgAddressInt.print_skip(pp, cs)
+      && pp.close();
+}
+
+const SmartContractInfo t_SmartContractInfo;
+
+//
+// code for type `OutList`
+//
+
+int OutList::get_tag(const vm::CellSlice& cs) const {
+  // distinguish by parameter `m_` using 1 2 2 2
+  return m_ ? out_list : out_list_empty;
+}
+
+int OutList::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case out_list_empty:
+    return out_list_empty;
+  case out_list:
+    return out_list;
+  }
+  return -1;
+}
+
+bool OutList::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case out_list_empty:
+    return m_ == 0;
+  case out_list: {
+    int n;
+    return add_r1(n, 1, m_)
+        && cs.advance_refs(1)
+        && t_OutAction.skip(cs);
+    }
+  }
+  return false;
+}
+
+bool OutList::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case out_list_empty:
+    return m_ == 0;
+  case out_list: {
+    int n;
+    return add_r1(n, 1, m_)
+        && OutList{n}.validate_skip_ref(cs, weak)
+        && t_OutAction.validate_skip(cs, weak);
+    }
+  }
+  return false;
+}
+
+bool OutList::unpack(vm::CellSlice& cs, OutList::Record_out_list_empty& data) const {
+  return m_ == 0;
+}
+
+bool OutList::unpack_out_list_empty(vm::CellSlice& cs) const {
+  return m_ == 0;
+}
+
+bool OutList::cell_unpack(Ref<vm::Cell> cell_ref, OutList::Record_out_list_empty& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutList::cell_unpack_out_list_empty(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_out_list_empty(cs) && cs.empty_ext();
+}
+
+bool OutList::unpack(vm::CellSlice& cs, OutList::Record_out_list& data) const {
+  return add_r1(data.n, 1, m_)
+      && cs.fetch_ref_to(data.prev)
+      && t_OutAction.fetch_to(cs, data.action);
+}
+
+bool OutList::unpack_out_list(vm::CellSlice& cs, int& n, Ref<Cell>& prev, Ref<CellSlice>& action) const {
+  return add_r1(n, 1, m_)
+      && cs.fetch_ref_to(prev)
+      && t_OutAction.fetch_to(cs, action);
+}
+
+bool OutList::cell_unpack(Ref<vm::Cell> cell_ref, OutList::Record_out_list& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutList::cell_unpack_out_list(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& prev, Ref<CellSlice>& action) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_out_list(cs, n, prev, action) && cs.empty_ext();
+}
+
+bool OutList::pack(vm::CellBuilder& cb, const OutList::Record_out_list_empty& data) const {
+  return m_ == 0;
+}
+
+bool OutList::pack_out_list_empty(vm::CellBuilder& cb) const {
+  return m_ == 0;
+}
+
+bool OutList::cell_pack(Ref<vm::Cell>& cell_ref, const OutList::Record_out_list_empty& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutList::cell_pack_out_list_empty(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_out_list_empty(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutList::pack(vm::CellBuilder& cb, const OutList::Record_out_list& data) const {
+  int n;
+  return add_r1(n, 1, m_)
+      && cb.store_ref_bool(data.prev)
+      && t_OutAction.store_from(cb, data.action);
+}
+
+bool OutList::pack_out_list(vm::CellBuilder& cb, Ref<Cell> prev, Ref<CellSlice> action) const {
+  int n;
+  return add_r1(n, 1, m_)
+      && cb.store_ref_bool(prev)
+      && t_OutAction.store_from(cb, action);
+}
+
+bool OutList::cell_pack(Ref<vm::Cell>& cell_ref, const OutList::Record_out_list& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutList::cell_pack_out_list(Ref<vm::Cell>& cell_ref, Ref<Cell> prev, Ref<CellSlice> action) const {
+  vm::CellBuilder cb;
+  return pack_out_list(cb, std::move(prev), std::move(action)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutList::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case out_list_empty:
+    return pp.cons("out_list_empty")
+        && m_ == 0;
+  case out_list: {
+    int n;
+    return pp.open("out_list")
+        && add_r1(n, 1, m_)
+        && pp.field("prev")
+        && OutList{n}.print_ref(pp, cs.fetch_ref())
+        && pp.field("action")
+        && t_OutAction.print_skip(pp, cs)
+        && pp.close();
+    }
+  }
+  return pp.fail("unknown constructor for OutList");
+}
+
+
+//
+// code for type `OutAction`
+//
+constexpr unsigned OutAction::cons_tag[3];
+
+int OutAction::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case action_send_msg:
+    return cs.prefetch_ulong(32) == 0xec3c86d ? action_send_msg : -1;
+  case action_set_code:
+    return cs.prefetch_ulong(32) == 0xad4de08eU ? action_set_code : -1;
+  case action_reserve_currency:
+    return cs.prefetch_ulong(32) == 0x36e6b809 ? action_reserve_currency : -1;
+  }
+  return -1;
+}
+
+bool OutAction::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case action_send_msg:
+    return cs.advance_ext(0x10028);
+  case action_set_code:
+    return cs.advance_ext(0x10020);
+  case action_reserve_currency:
+    return cs.advance(40)
+        && t_CurrencyCollection.skip(cs);
+  }
+  return false;
+}
+
+bool OutAction::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case action_send_msg:
+    return cs.fetch_ulong(32) == 0xec3c86d
+        && cs.advance(8)
+        && t_MessageRelaxed_Any.validate_skip_ref(cs, weak);
+  case action_set_code:
+    return cs.fetch_ulong(32) == 0xad4de08eU
+        && cs.advance_refs(1);
+  case action_reserve_currency:
+    return cs.fetch_ulong(32) == 0x36e6b809
+        && cs.advance(8)
+        && t_CurrencyCollection.validate_skip(cs, weak);
+  }
+  return false;
+}
+
+bool OutAction::unpack(vm::CellSlice& cs, OutAction::Record_action_send_msg& data) const {
+  return cs.fetch_ulong(32) == 0xec3c86d
+      && cs.fetch_uint_to(8, data.mode)
+      && cs.fetch_ref_to(data.out_msg);
+}
+
+bool OutAction::unpack_action_send_msg(vm::CellSlice& cs, int& mode, Ref<Cell>& out_msg) const {
+  return cs.fetch_ulong(32) == 0xec3c86d
+      && cs.fetch_uint_to(8, mode)
+      && cs.fetch_ref_to(out_msg);
+}
+
+bool OutAction::cell_unpack(Ref<vm::Cell> cell_ref, OutAction::Record_action_send_msg& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutAction::cell_unpack_action_send_msg(Ref<vm::Cell> cell_ref, int& mode, Ref<Cell>& out_msg) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_action_send_msg(cs, mode, out_msg) && cs.empty_ext();
+}
+
+bool OutAction::unpack(vm::CellSlice& cs, OutAction::Record_action_set_code& data) const {
+  return cs.fetch_ulong(32) == 0xad4de08eU
+      && cs.fetch_ref_to(data.new_code);
+}
+
+bool OutAction::unpack_action_set_code(vm::CellSlice& cs, Ref<Cell>& new_code) const {
+  return cs.fetch_ulong(32) == 0xad4de08eU
+      && cs.fetch_ref_to(new_code);
+}
+
+bool OutAction::cell_unpack(Ref<vm::Cell> cell_ref, OutAction::Record_action_set_code& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutAction::cell_unpack_action_set_code(Ref<vm::Cell> cell_ref, Ref<Cell>& new_code) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_action_set_code(cs, new_code) && cs.empty_ext();
+}
+
+bool OutAction::unpack(vm::CellSlice& cs, OutAction::Record_action_reserve_currency& data) const {
+  return cs.fetch_ulong(32) == 0x36e6b809
+      && cs.fetch_uint_to(8, data.mode)
+      && t_CurrencyCollection.fetch_to(cs, data.currency);
+}
+
+bool OutAction::unpack_action_reserve_currency(vm::CellSlice& cs, int& mode, Ref<CellSlice>& currency) const {
+  return cs.fetch_ulong(32) == 0x36e6b809
+      && cs.fetch_uint_to(8, mode)
+      && t_CurrencyCollection.fetch_to(cs, currency);
+}
+
+bool OutAction::cell_unpack(Ref<vm::Cell> cell_ref, OutAction::Record_action_reserve_currency& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutAction::cell_unpack_action_reserve_currency(Ref<vm::Cell> cell_ref, int& mode, Ref<CellSlice>& currency) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_action_reserve_currency(cs, mode, currency) && cs.empty_ext();
+}
+
+bool OutAction::pack(vm::CellBuilder& cb, const OutAction::Record_action_send_msg& data) const {
+  return cb.store_long_bool(0xec3c86d, 32)
+      && cb.store_ulong_rchk_bool(data.mode, 8)
+      && cb.store_ref_bool(data.out_msg);
+}
+
+bool OutAction::pack_action_send_msg(vm::CellBuilder& cb, int mode, Ref<Cell> out_msg) const {
+  return cb.store_long_bool(0xec3c86d, 32)
+      && cb.store_ulong_rchk_bool(mode, 8)
+      && cb.store_ref_bool(out_msg);
+}
+
+bool OutAction::cell_pack(Ref<vm::Cell>& cell_ref, const OutAction::Record_action_send_msg& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutAction::cell_pack_action_send_msg(Ref<vm::Cell>& cell_ref, int mode, Ref<Cell> out_msg) const {
+  vm::CellBuilder cb;
+  return pack_action_send_msg(cb, mode, std::move(out_msg)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutAction::pack(vm::CellBuilder& cb, const OutAction::Record_action_set_code& data) const {
+  return cb.store_long_bool(0xad4de08eU, 32)
+      && cb.store_ref_bool(data.new_code);
+}
+
+bool OutAction::pack_action_set_code(vm::CellBuilder& cb, Ref<Cell> new_code) const {
+  return cb.store_long_bool(0xad4de08eU, 32)
+      && cb.store_ref_bool(new_code);
+}
+
+bool OutAction::cell_pack(Ref<vm::Cell>& cell_ref, const OutAction::Record_action_set_code& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutAction::cell_pack_action_set_code(Ref<vm::Cell>& cell_ref, Ref<Cell> new_code) const {
+  vm::CellBuilder cb;
+  return pack_action_set_code(cb, std::move(new_code)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutAction::pack(vm::CellBuilder& cb, const OutAction::Record_action_reserve_currency& data) const {
+  return cb.store_long_bool(0x36e6b809, 32)
+      && cb.store_ulong_rchk_bool(data.mode, 8)
+      && t_CurrencyCollection.store_from(cb, data.currency);
+}
+
+bool OutAction::pack_action_reserve_currency(vm::CellBuilder& cb, int mode, Ref<CellSlice> currency) const {
+  return cb.store_long_bool(0x36e6b809, 32)
+      && cb.store_ulong_rchk_bool(mode, 8)
+      && t_CurrencyCollection.store_from(cb, currency);
+}
+
+bool OutAction::cell_pack(Ref<vm::Cell>& cell_ref, const OutAction::Record_action_reserve_currency& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutAction::cell_pack_action_reserve_currency(Ref<vm::Cell>& cell_ref, int mode, Ref<CellSlice> currency) const {
+  vm::CellBuilder cb;
+  return pack_action_reserve_currency(cb, mode, std::move(currency)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutAction::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case action_send_msg: {
+    int mode;
+    return cs.fetch_ulong(32) == 0xec3c86d
+        && pp.open("action_send_msg")
+        && cs.fetch_uint_to(8, mode)
+        && pp.field_int(mode, "mode")
+        && pp.field("out_msg")
+        && t_MessageRelaxed_Any.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+    }
+  case action_set_code:
+    return cs.fetch_ulong(32) == 0xad4de08eU
+        && pp.open("action_set_code")
+        && pp.field("new_code")
+        && t_Anything.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  case action_reserve_currency: {
+    int mode;
+    return cs.fetch_ulong(32) == 0x36e6b809
+        && pp.open("action_reserve_currency")
+        && cs.fetch_uint_to(8, mode)
+        && pp.field_int(mode, "mode")
+        && pp.field("currency")
+        && t_CurrencyCollection.print_skip(pp, cs)
+        && pp.close();
+    }
+  }
+  return pp.fail("unknown constructor for OutAction");
+}
+
+const OutAction t_OutAction;
+
+//
+// code for type `OutListNode`
+//
+
+int OutListNode::check_tag(const vm::CellSlice& cs) const {
+  return out_list_node;
+}
+
+bool OutListNode::skip(vm::CellSlice& cs) const {
+  return cs.advance_refs(1)
+      && t_OutAction.skip(cs);
+}
+
+bool OutListNode::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.advance_refs(1)
+      && t_OutAction.validate_skip(cs, weak);
+}
+
+bool OutListNode::unpack(vm::CellSlice& cs, OutListNode::Record& data) const {
+  return cs.fetch_ref_to(data.prev)
+      && t_OutAction.fetch_to(cs, data.action);
+}
+
+bool OutListNode::unpack_out_list_node(vm::CellSlice& cs, Ref<Cell>& prev, Ref<CellSlice>& action) const {
+  return cs.fetch_ref_to(prev)
+      && t_OutAction.fetch_to(cs, action);
+}
+
+bool OutListNode::cell_unpack(Ref<vm::Cell> cell_ref, OutListNode::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OutListNode::cell_unpack_out_list_node(Ref<vm::Cell> cell_ref, Ref<Cell>& prev, Ref<CellSlice>& action) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_out_list_node(cs, prev, action) && cs.empty_ext();
+}
+
+bool OutListNode::pack(vm::CellBuilder& cb, const OutListNode::Record& data) const {
+  return cb.store_ref_bool(data.prev)
+      && t_OutAction.store_from(cb, data.action);
+}
+
+bool OutListNode::pack_out_list_node(vm::CellBuilder& cb, Ref<Cell> prev, Ref<CellSlice> action) const {
+  return cb.store_ref_bool(prev)
+      && t_OutAction.store_from(cb, action);
+}
+
+bool OutListNode::cell_pack(Ref<vm::Cell>& cell_ref, const OutListNode::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutListNode::cell_pack_out_list_node(Ref<vm::Cell>& cell_ref, Ref<Cell> prev, Ref<CellSlice> action) const {
+  vm::CellBuilder cb;
+  return pack_out_list_node(cb, std::move(prev), std::move(action)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OutListNode::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("out_list_node")
+      && pp.field("prev")
+      && t_Anything.print_ref(pp, cs.fetch_ref())
+      && pp.field("action")
+      && t_OutAction.print_skip(pp, cs)
+      && pp.close();
+}
+
+const OutListNode t_OutListNode;
+
+//
+// code for type `ShardIdent`
+//
+
+int ShardIdent::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(2) == 0 ? shard_ident : -1;
+}
+
+bool ShardIdent::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int shard_pfx_bits;
+  return cs.fetch_ulong(2) == 0
+      && cs.fetch_uint_leq(60, shard_pfx_bits)
+      && cs.advance(96);
+}
+
+bool ShardIdent::unpack(vm::CellSlice& cs, ShardIdent::Record& data) const {
+  return cs.fetch_ulong(2) == 0
+      && cs.fetch_uint_leq(60, data.shard_pfx_bits)
+      && cs.fetch_int_to(32, data.workchain_id)
+      && cs.fetch_uint_to(64, data.shard_prefix);
+}
+
+bool ShardIdent::unpack_shard_ident(vm::CellSlice& cs, int& shard_pfx_bits, int& workchain_id, unsigned long long& shard_prefix) const {
+  return cs.fetch_ulong(2) == 0
+      && cs.fetch_uint_leq(60, shard_pfx_bits)
+      && cs.fetch_int_to(32, workchain_id)
+      && cs.fetch_uint_to(64, shard_prefix);
+}
+
+bool ShardIdent::cell_unpack(Ref<vm::Cell> cell_ref, ShardIdent::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ShardIdent::cell_unpack_shard_ident(Ref<vm::Cell> cell_ref, int& shard_pfx_bits, int& workchain_id, unsigned long long& shard_prefix) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_shard_ident(cs, shard_pfx_bits, workchain_id, shard_prefix) && cs.empty_ext();
+}
+
+bool ShardIdent::pack(vm::CellBuilder& cb, const ShardIdent::Record& data) const {
+  return cb.store_long_bool(0, 2)
+      && cb.store_uint_leq(60, data.shard_pfx_bits)
+      && cb.store_long_rchk_bool(data.workchain_id, 32)
+      && cb.store_ulong_rchk_bool(data.shard_prefix, 64);
+}
+
+bool ShardIdent::pack_shard_ident(vm::CellBuilder& cb, int shard_pfx_bits, int workchain_id, unsigned long long shard_prefix) const {
+  return cb.store_long_bool(0, 2)
+      && cb.store_uint_leq(60, shard_pfx_bits)
+      && cb.store_long_rchk_bool(workchain_id, 32)
+      && cb.store_ulong_rchk_bool(shard_prefix, 64);
+}
+
+bool ShardIdent::cell_pack(Ref<vm::Cell>& cell_ref, const ShardIdent::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardIdent::cell_pack_shard_ident(Ref<vm::Cell>& cell_ref, int shard_pfx_bits, int workchain_id, unsigned long long shard_prefix) const {
+  vm::CellBuilder cb;
+  return pack_shard_ident(cb, shard_pfx_bits, workchain_id, shard_prefix) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardIdent::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int shard_pfx_bits;
+  return cs.fetch_ulong(2) == 0
+      && pp.open("shard_ident")
+      && cs.fetch_uint_leq(60, shard_pfx_bits)
+      && pp.field_int(shard_pfx_bits, "shard_pfx_bits")
+      && pp.fetch_int_field(cs, 32, "workchain_id")
+      && pp.fetch_uint_field(cs, 64, "shard_prefix")
+      && pp.close();
+}
+
+const ShardIdent t_ShardIdent;
+
+//
+// code for type `ExtBlkRef`
+//
+
+int ExtBlkRef::check_tag(const vm::CellSlice& cs) const {
+  return ext_blk_ref;
+}
+
+bool ExtBlkRef::unpack(vm::CellSlice& cs, ExtBlkRef::Record& data) const {
+  return cs.fetch_uint_to(64, data.end_lt)
+      && cs.fetch_uint_to(32, data.seq_no)
+      && cs.fetch_bits_to(data.root_hash.bits(), 256)
+      && cs.fetch_bits_to(data.file_hash.bits(), 256);
+}
+
+bool ExtBlkRef::cell_unpack(Ref<vm::Cell> cell_ref, ExtBlkRef::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ExtBlkRef::pack(vm::CellBuilder& cb, const ExtBlkRef::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.end_lt, 64)
+      && cb.store_ulong_rchk_bool(data.seq_no, 32)
+      && cb.store_bits_bool(data.root_hash.cbits(), 256)
+      && cb.store_bits_bool(data.file_hash.cbits(), 256);
+}
+
+bool ExtBlkRef::cell_pack(Ref<vm::Cell>& cell_ref, const ExtBlkRef::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ExtBlkRef::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("ext_blk_ref")
+      && pp.fetch_uint_field(cs, 64, "end_lt")
+      && pp.fetch_uint_field(cs, 32, "seq_no")
+      && pp.fetch_bits_field(cs, 256, "root_hash")
+      && pp.fetch_bits_field(cs, 256, "file_hash")
+      && pp.close();
+}
+
+const ExtBlkRef t_ExtBlkRef;
+
+//
+// code for type `BlockIdExt`
+//
+
+int BlockIdExt::check_tag(const vm::CellSlice& cs) const {
+  return block_id_ext;
+}
+
+bool BlockIdExt::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_ShardIdent.validate_skip(cs, weak)
+      && cs.advance(544);
+}
+
+bool BlockIdExt::unpack(vm::CellSlice& cs, BlockIdExt::Record& data) const {
+  return cs.fetch_subslice_to(104, data.shard_id)
+      && cs.fetch_uint_to(32, data.seq_no)
+      && cs.fetch_bits_to(data.root_hash.bits(), 256)
+      && cs.fetch_bits_to(data.file_hash.bits(), 256);
+}
+
+bool BlockIdExt::cell_unpack(Ref<vm::Cell> cell_ref, BlockIdExt::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BlockIdExt::pack(vm::CellBuilder& cb, const BlockIdExt::Record& data) const {
+  return cb.append_cellslice_chk(data.shard_id, 104)
+      && cb.store_ulong_rchk_bool(data.seq_no, 32)
+      && cb.store_bits_bool(data.root_hash.cbits(), 256)
+      && cb.store_bits_bool(data.file_hash.cbits(), 256);
+}
+
+bool BlockIdExt::cell_pack(Ref<vm::Cell>& cell_ref, const BlockIdExt::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockIdExt::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("block_id_ext")
+      && pp.field("shard_id")
+      && t_ShardIdent.print_skip(pp, cs)
+      && pp.fetch_uint_field(cs, 32, "seq_no")
+      && pp.fetch_bits_field(cs, 256, "root_hash")
+      && pp.fetch_bits_field(cs, 256, "file_hash")
+      && pp.close();
+}
+
+const BlockIdExt t_BlockIdExt;
+
+//
+// code for type `BlkMasterInfo`
+//
+
+int BlkMasterInfo::check_tag(const vm::CellSlice& cs) const {
+  return master_info;
+}
+
+bool BlkMasterInfo::unpack(vm::CellSlice& cs, BlkMasterInfo::Record& data) const {
+  return cs.fetch_subslice_to(608, data.master);
+}
+
+bool BlkMasterInfo::unpack_master_info(vm::CellSlice& cs, Ref<CellSlice>& master) const {
+  return cs.fetch_subslice_to(608, master);
+}
+
+bool BlkMasterInfo::cell_unpack(Ref<vm::Cell> cell_ref, BlkMasterInfo::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BlkMasterInfo::cell_unpack_master_info(Ref<vm::Cell> cell_ref, Ref<CellSlice>& master) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_master_info(cs, master) && cs.empty_ext();
+}
+
+bool BlkMasterInfo::pack(vm::CellBuilder& cb, const BlkMasterInfo::Record& data) const {
+  return cb.append_cellslice_chk(data.master, 608);
+}
+
+bool BlkMasterInfo::pack_master_info(vm::CellBuilder& cb, Ref<CellSlice> master) const {
+  return cb.append_cellslice_chk(master, 608);
+}
+
+bool BlkMasterInfo::cell_pack(Ref<vm::Cell>& cell_ref, const BlkMasterInfo::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlkMasterInfo::cell_pack_master_info(Ref<vm::Cell>& cell_ref, Ref<CellSlice> master) const {
+  vm::CellBuilder cb;
+  return pack_master_info(cb, std::move(master)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlkMasterInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("master_info")
+      && pp.field("master")
+      && t_ExtBlkRef.print_skip(pp, cs)
+      && pp.close();
+}
+
+const BlkMasterInfo t_BlkMasterInfo;
+
+//
+// code for auxiliary type `ShardStateUnsplit_aux`
+//
+
+int ShardStateUnsplit_aux::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool ShardStateUnsplit_aux::skip(vm::CellSlice& cs) const {
+  return cs.advance(128)
+      && t_CurrencyCollection.skip(cs)
+      && t_CurrencyCollection.skip(cs)
+      && t_HashmapE_256_LibDescr.skip(cs)
+      && t_Maybe_BlkMasterInfo.skip(cs);
+}
+
+bool ShardStateUnsplit_aux::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.advance(128)
+      && t_CurrencyCollection.validate_skip(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak)
+      && t_HashmapE_256_LibDescr.validate_skip(cs, weak)
+      && t_Maybe_BlkMasterInfo.validate_skip(cs, weak);
+}
+
+bool ShardStateUnsplit_aux::unpack(vm::CellSlice& cs, ShardStateUnsplit_aux::Record& data) const {
+  return cs.fetch_uint_to(64, data.overload_history)
+      && cs.fetch_uint_to(64, data.underload_history)
+      && t_CurrencyCollection.fetch_to(cs, data.total_balance)
+      && t_CurrencyCollection.fetch_to(cs, data.total_validator_fees)
+      && t_HashmapE_256_LibDescr.fetch_to(cs, data.libraries)
+      && t_Maybe_BlkMasterInfo.fetch_to(cs, data.master_ref);
+}
+
+bool ShardStateUnsplit_aux::cell_unpack(Ref<vm::Cell> cell_ref, ShardStateUnsplit_aux::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ShardStateUnsplit_aux::pack(vm::CellBuilder& cb, const ShardStateUnsplit_aux::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.overload_history, 64)
+      && cb.store_ulong_rchk_bool(data.underload_history, 64)
+      && t_CurrencyCollection.store_from(cb, data.total_balance)
+      && t_CurrencyCollection.store_from(cb, data.total_validator_fees)
+      && t_HashmapE_256_LibDescr.store_from(cb, data.libraries)
+      && t_Maybe_BlkMasterInfo.store_from(cb, data.master_ref);
+}
+
+bool ShardStateUnsplit_aux::cell_pack(Ref<vm::Cell>& cell_ref, const ShardStateUnsplit_aux::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardStateUnsplit_aux::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.fetch_uint_field(cs, 64, "overload_history")
+      && pp.fetch_uint_field(cs, 64, "underload_history")
+      && pp.field("total_balance")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("total_validator_fees")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("libraries")
+      && t_HashmapE_256_LibDescr.print_skip(pp, cs)
+      && pp.field("master_ref")
+      && t_Maybe_BlkMasterInfo.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ShardStateUnsplit_aux t_ShardStateUnsplit_aux;
+
+//
+// code for type `ShardStateUnsplit`
+//
+constexpr unsigned ShardStateUnsplit::cons_tag[1];
+
+int ShardStateUnsplit::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(32) == 0x9023afe2U ? shard_state : -1;
+}
+
+bool ShardStateUnsplit::skip(vm::CellSlice& cs) const {
+  return cs.advance_ext(0x30169)
+      && t_Maybe_Ref_McStateExtra.skip(cs);
+}
+
+bool ShardStateUnsplit::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(32) == 0x9023afe2U
+      && cs.advance(32)
+      && t_ShardIdent.validate_skip(cs, weak)
+      && cs.advance(192)
+      && t_OutMsgQueueInfo.validate_skip_ref(cs, weak)
+      && cs.advance(1)
+      && t_ShardAccounts.validate_skip_ref(cs, weak)
+      && t_ShardStateUnsplit_aux.validate_skip_ref(cs, weak)
+      && t_Maybe_Ref_McStateExtra.validate_skip(cs, weak);
+}
+
+bool ShardStateUnsplit::unpack(vm::CellSlice& cs, ShardStateUnsplit::Record& data) const {
+  return cs.fetch_ulong(32) == 0x9023afe2U
+      && cs.fetch_int_to(32, data.global_id)
+      && cs.fetch_subslice_to(104, data.shard_id)
+      && cs.fetch_uint_to(32, data.seq_no)
+      && cs.fetch_uint_to(32, data.vert_seq_no)
+      && cs.fetch_uint_to(32, data.gen_utime)
+      && cs.fetch_uint_to(64, data.gen_lt)
+      && cs.fetch_uint_to(32, data.min_ref_mc_seqno)
+      && cs.fetch_ref_to(data.out_msg_queue_info)
+      && cs.fetch_bool_to(data.before_split)
+      && cs.fetch_ref_to(data.accounts)
+      && t_ShardStateUnsplit_aux.cell_unpack(cs.fetch_ref(), data.r1)
+      && t_Maybe_Ref_McStateExtra.fetch_to(cs, data.custom);
+}
+
+bool ShardStateUnsplit::cell_unpack(Ref<vm::Cell> cell_ref, ShardStateUnsplit::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ShardStateUnsplit::pack(vm::CellBuilder& cb, const ShardStateUnsplit::Record& data) const {
+  Ref<vm::Cell> tmp_cell;
+  return cb.store_long_bool(0x9023afe2U, 32)
+      && cb.store_long_rchk_bool(data.global_id, 32)
+      && cb.append_cellslice_chk(data.shard_id, 104)
+      && cb.store_ulong_rchk_bool(data.seq_no, 32)
+      && cb.store_ulong_rchk_bool(data.vert_seq_no, 32)
+      && cb.store_ulong_rchk_bool(data.gen_utime, 32)
+      && cb.store_ulong_rchk_bool(data.gen_lt, 64)
+      && cb.store_ulong_rchk_bool(data.min_ref_mc_seqno, 32)
+      && cb.store_ref_bool(data.out_msg_queue_info)
+      && cb.store_ulong_rchk_bool(data.before_split, 1)
+      && cb.store_ref_bool(data.accounts)
+      && t_ShardStateUnsplit_aux.cell_pack(tmp_cell, data.r1)
+      && cb.store_ref_bool(std::move(tmp_cell))
+      && t_Maybe_Ref_McStateExtra.store_from(cb, data.custom);
+}
+
+bool ShardStateUnsplit::cell_pack(Ref<vm::Cell>& cell_ref, const ShardStateUnsplit::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardStateUnsplit::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int vert_seq_no, before_split;
+  return cs.fetch_ulong(32) == 0x9023afe2U
+      && pp.open("shard_state")
+      && pp.fetch_int_field(cs, 32, "global_id")
+      && pp.field("shard_id")
+      && t_ShardIdent.print_skip(pp, cs)
+      && pp.fetch_uint_field(cs, 32, "seq_no")
+      && cs.fetch_uint_to(32, vert_seq_no)
+      && pp.field_int(vert_seq_no, "vert_seq_no")
+      && pp.fetch_uint_field(cs, 32, "gen_utime")
+      && pp.fetch_uint_field(cs, 64, "gen_lt")
+      && pp.fetch_uint_field(cs, 32, "min_ref_mc_seqno")
+      && pp.field("out_msg_queue_info")
+      && t_OutMsgQueueInfo.print_ref(pp, cs.fetch_ref())
+      && cs.fetch_bool_to(before_split)
+      && pp.field_int(before_split, "before_split")
+      && pp.field("accounts")
+      && t_ShardAccounts.print_ref(pp, cs.fetch_ref())
+      && pp.field()
+      && t_ShardStateUnsplit_aux.print_ref(pp, cs.fetch_ref())
+      && pp.field("custom")
+      && t_Maybe_Ref_McStateExtra.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ShardStateUnsplit t_ShardStateUnsplit;
+
+//
+// code for type `ShardState`
+//
+constexpr char ShardState::cons_len[2];
+constexpr unsigned ShardState::cons_tag[2];
+
+int ShardState::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cons1:
+    return cons1;
+  case split_state:
+    return cs.prefetch_ulong(32) == 0x5f327da5 ? split_state : -1;
+  }
+  return -1;
+}
+
+bool ShardState::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cons1:
+    return t_ShardStateUnsplit.skip(cs);
+  case split_state:
+    return cs.advance_ext(0x20020);
+  }
+  return false;
+}
+
+bool ShardState::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case cons1:
+    return t_ShardStateUnsplit.validate_skip(cs, weak);
+  case split_state:
+    return cs.fetch_ulong(32) == 0x5f327da5
+        && t_ShardStateUnsplit.validate_skip_ref(cs, weak)
+        && t_ShardStateUnsplit.validate_skip_ref(cs, weak);
+  }
+  return false;
+}
+
+bool ShardState::unpack(vm::CellSlice& cs, ShardState::Record_cons1& data) const {
+  return t_ShardStateUnsplit.fetch_to(cs, data.x);
+}
+
+bool ShardState::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_ShardStateUnsplit.fetch_to(cs, x);
+}
+
+bool ShardState::cell_unpack(Ref<vm::Cell> cell_ref, ShardState::Record_cons1& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ShardState::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, x) && cs.empty_ext();
+}
+
+bool ShardState::unpack(vm::CellSlice& cs, ShardState::Record_split_state& data) const {
+  return cs.fetch_ulong(32) == 0x5f327da5
+      && cs.fetch_ref_to(data.left)
+      && cs.fetch_ref_to(data.right);
+}
+
+bool ShardState::unpack_split_state(vm::CellSlice& cs, Ref<Cell>& left, Ref<Cell>& right) const {
+  return cs.fetch_ulong(32) == 0x5f327da5
+      && cs.fetch_ref_to(left)
+      && cs.fetch_ref_to(right);
+}
+
+bool ShardState::cell_unpack(Ref<vm::Cell> cell_ref, ShardState::Record_split_state& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ShardState::cell_unpack_split_state(Ref<vm::Cell> cell_ref, Ref<Cell>& left, Ref<Cell>& right) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_split_state(cs, left, right) && cs.empty_ext();
+}
+
+bool ShardState::pack(vm::CellBuilder& cb, const ShardState::Record_cons1& data) const {
+  return t_ShardStateUnsplit.store_from(cb, data.x);
+}
+
+bool ShardState::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_ShardStateUnsplit.store_from(cb, x);
+}
+
+bool ShardState::cell_pack(Ref<vm::Cell>& cell_ref, const ShardState::Record_cons1& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardState::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardState::pack(vm::CellBuilder& cb, const ShardState::Record_split_state& data) const {
+  return cb.store_long_bool(0x5f327da5, 32)
+      && cb.store_ref_bool(data.left)
+      && cb.store_ref_bool(data.right);
+}
+
+bool ShardState::pack_split_state(vm::CellBuilder& cb, Ref<Cell> left, Ref<Cell> right) const {
+  return cb.store_long_bool(0x5f327da5, 32)
+      && cb.store_ref_bool(left)
+      && cb.store_ref_bool(right);
+}
+
+bool ShardState::cell_pack(Ref<vm::Cell>& cell_ref, const ShardState::Record_split_state& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardState::cell_pack_split_state(Ref<vm::Cell>& cell_ref, Ref<Cell> left, Ref<Cell> right) const {
+  vm::CellBuilder cb;
+  return pack_split_state(cb, std::move(left), std::move(right)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardState::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cons1:
+    return pp.open()
+        && pp.field()
+        && t_ShardStateUnsplit.print_skip(pp, cs)
+        && pp.close();
+  case split_state:
+    return cs.fetch_ulong(32) == 0x5f327da5
+        && pp.open("split_state")
+        && pp.field("left")
+        && t_ShardStateUnsplit.print_ref(pp, cs.fetch_ref())
+        && pp.field("right")
+        && t_ShardStateUnsplit.print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for ShardState");
+}
+
+const ShardState t_ShardState;
+
+//
+// code for type `LibDescr`
+//
+
+int LibDescr::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(2) == 0 ? shared_lib_descr : -1;
+}
+
+bool LibDescr::skip(vm::CellSlice& cs) const {
+  return cs.advance_ext(0x10002)
+      && t_Hashmap_256_True.skip(cs);
+}
+
+bool LibDescr::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(2) == 0
+      && cs.advance_refs(1)
+      && t_Hashmap_256_True.validate_skip(cs, weak);
+}
+
+bool LibDescr::unpack(vm::CellSlice& cs, LibDescr::Record& data) const {
+  return cs.fetch_ulong(2) == 0
+      && cs.fetch_ref_to(data.lib)
+      && t_Hashmap_256_True.fetch_to(cs, data.publishers);
+}
+
+bool LibDescr::unpack_shared_lib_descr(vm::CellSlice& cs, Ref<Cell>& lib, Ref<CellSlice>& publishers) const {
+  return cs.fetch_ulong(2) == 0
+      && cs.fetch_ref_to(lib)
+      && t_Hashmap_256_True.fetch_to(cs, publishers);
+}
+
+bool LibDescr::cell_unpack(Ref<vm::Cell> cell_ref, LibDescr::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool LibDescr::cell_unpack_shared_lib_descr(Ref<vm::Cell> cell_ref, Ref<Cell>& lib, Ref<CellSlice>& publishers) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_shared_lib_descr(cs, lib, publishers) && cs.empty_ext();
+}
+
+bool LibDescr::pack(vm::CellBuilder& cb, const LibDescr::Record& data) const {
+  return cb.store_long_bool(0, 2)
+      && cb.store_ref_bool(data.lib)
+      && t_Hashmap_256_True.store_from(cb, data.publishers);
+}
+
+bool LibDescr::pack_shared_lib_descr(vm::CellBuilder& cb, Ref<Cell> lib, Ref<CellSlice> publishers) const {
+  return cb.store_long_bool(0, 2)
+      && cb.store_ref_bool(lib)
+      && t_Hashmap_256_True.store_from(cb, publishers);
+}
+
+bool LibDescr::cell_pack(Ref<vm::Cell>& cell_ref, const LibDescr::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool LibDescr::cell_pack_shared_lib_descr(Ref<vm::Cell>& cell_ref, Ref<Cell> lib, Ref<CellSlice> publishers) const {
+  vm::CellBuilder cb;
+  return pack_shared_lib_descr(cb, std::move(lib), std::move(publishers)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool LibDescr::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(2) == 0
+      && pp.open("shared_lib_descr")
+      && pp.field("lib")
+      && t_Anything.print_ref(pp, cs.fetch_ref())
+      && pp.field("publishers")
+      && t_Hashmap_256_True.print_skip(pp, cs)
+      && pp.close();
+}
+
+const LibDescr t_LibDescr;
+
+//
+// code for type `BlockInfo`
+//
+constexpr unsigned BlockInfo::cons_tag[1];
+
+int BlockInfo::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(32) == 0x9bc7a987U ? block_info : -1;
+}
+
+bool BlockInfo::skip(vm::CellSlice& cs) const {
+  int not_master, after_merge, vert_seqno_incr, seq_no, vert_seq_no, prev_seq_no;
+  return cs.advance(64)
+      && cs.fetch_bool_to(not_master)
+      && cs.fetch_bool_to(after_merge)
+      && cs.advance(5)
+      && cs.fetch_bool_to(vert_seqno_incr)
+      && cs.advance(8)
+      && cs.fetch_uint_to(32, seq_no)
+      && cs.fetch_uint_to(32, vert_seq_no)
+      && vert_seqno_incr <= vert_seq_no
+      && add_r1(prev_seq_no, 1, seq_no)
+      && cs.advance(392)
+      && (!not_master || cs.advance_refs(1))
+      && cs.advance_refs(1)
+      && (!vert_seq_no || cs.advance_refs(1));
+}
+
+bool BlockInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int not_master, after_merge, vert_seqno_incr, seq_no, vert_seq_no, prev_seq_no;
+  return cs.fetch_ulong(32) == 0x9bc7a987U
+      && cs.advance(32)
+      && cs.fetch_bool_to(not_master)
+      && cs.fetch_bool_to(after_merge)
+      && cs.advance(5)
+      && cs.fetch_bool_to(vert_seqno_incr)
+      && cs.advance(8)
+      && cs.fetch_uint_to(32, seq_no)
+      && cs.fetch_uint_to(32, vert_seq_no)
+      && vert_seqno_incr <= vert_seq_no
+      && add_r1(prev_seq_no, 1, seq_no)
+      && t_ShardIdent.validate_skip(cs, weak)
+      && cs.advance(288)
+      && (!not_master || t_BlkMasterInfo.validate_skip_ref(cs, weak))
+      && BlkPrevInfo{after_merge}.validate_skip_ref(cs, weak)
+      && (!vert_seq_no || t_BlkPrevInfo_0.validate_skip_ref(cs, weak));
+}
+
+bool BlockInfo::unpack(vm::CellSlice& cs, BlockInfo::Record& data) const {
+  int prev_seq_no;
+  return cs.fetch_ulong(32) == 0x9bc7a987U
+      && cs.fetch_uint_to(32, data.version)
+      && cs.fetch_bool_to(data.not_master)
+      && cs.fetch_bool_to(data.after_merge)
+      && cs.fetch_bool_to(data.before_split)
+      && cs.fetch_bool_to(data.after_split)
+      && cs.fetch_bool_to(data.want_split)
+      && cs.fetch_bool_to(data.want_merge)
+      && cs.fetch_bool_to(data.key_block)
+      && cs.fetch_bool_to(data.vert_seqno_incr)
+      && cs.fetch_uint_to(8, data.flags)
+      && cs.fetch_uint_to(32, data.seq_no)
+      && cs.fetch_uint_to(32, data.vert_seq_no)
+      && data.vert_seqno_incr <= data.vert_seq_no
+      && add_r1(prev_seq_no, 1, data.seq_no)
+      && cs.fetch_subslice_to(104, data.shard)
+      && cs.fetch_uint_to(32, data.gen_utime)
+      && cs.fetch_uint_to(64, data.start_lt)
+      && cs.fetch_uint_to(64, data.end_lt)
+      && cs.fetch_uint_to(32, data.gen_validator_list_hash_short)
+      && cs.fetch_uint_to(32, data.gen_catchain_seqno)
+      && cs.fetch_uint_to(32, data.min_ref_mc_seqno)
+      && cs.fetch_uint_to(32, data.prev_key_block_seqno)
+      && (!data.not_master || cs.fetch_ref_to(data.master_ref))
+      && cs.fetch_ref_to(data.prev_ref)
+      && (!data.vert_seq_no || cs.fetch_ref_to(data.prev_vert_ref));
+}
+
+bool BlockInfo::cell_unpack(Ref<vm::Cell> cell_ref, BlockInfo::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BlockInfo::pack(vm::CellBuilder& cb, const BlockInfo::Record& data) const {
+  int prev_seq_no;
+  return cb.store_long_bool(0x9bc7a987U, 32)
+      && cb.store_ulong_rchk_bool(data.version, 32)
+      && cb.store_ulong_rchk_bool(data.not_master, 1)
+      && cb.store_ulong_rchk_bool(data.after_merge, 1)
+      && cb.store_ulong_rchk_bool(data.before_split, 1)
+      && cb.store_ulong_rchk_bool(data.after_split, 1)
+      && cb.store_ulong_rchk_bool(data.want_split, 1)
+      && cb.store_ulong_rchk_bool(data.want_merge, 1)
+      && cb.store_ulong_rchk_bool(data.key_block, 1)
+      && cb.store_ulong_rchk_bool(data.vert_seqno_incr, 1)
+      && cb.store_ulong_rchk_bool(data.flags, 8)
+      && cb.store_ulong_rchk_bool(data.seq_no, 32)
+      && cb.store_ulong_rchk_bool(data.vert_seq_no, 32)
+      && data.vert_seqno_incr <= data.vert_seq_no
+      && add_r1(prev_seq_no, 1, data.seq_no)
+      && cb.append_cellslice_chk(data.shard, 104)
+      && cb.store_ulong_rchk_bool(data.gen_utime, 32)
+      && cb.store_ulong_rchk_bool(data.start_lt, 64)
+      && cb.store_ulong_rchk_bool(data.end_lt, 64)
+      && cb.store_ulong_rchk_bool(data.gen_validator_list_hash_short, 32)
+      && cb.store_ulong_rchk_bool(data.gen_catchain_seqno, 32)
+      && cb.store_ulong_rchk_bool(data.min_ref_mc_seqno, 32)
+      && cb.store_ulong_rchk_bool(data.prev_key_block_seqno, 32)
+      && (!data.not_master || cb.store_ref_bool(data.master_ref))
+      && cb.store_ref_bool(data.prev_ref)
+      && (!data.vert_seq_no || cb.store_ref_bool(data.prev_vert_ref));
+}
+
+bool BlockInfo::cell_pack(Ref<vm::Cell>& cell_ref, const BlockInfo::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int not_master, after_merge, before_split, after_split, vert_seqno_incr, flags, seq_no, vert_seq_no, prev_seq_no;
+  return cs.fetch_ulong(32) == 0x9bc7a987U
+      && pp.open("block_info")
+      && pp.fetch_uint_field(cs, 32, "version")
+      && cs.fetch_bool_to(not_master)
+      && pp.field_int(not_master, "not_master")
+      && cs.fetch_bool_to(after_merge)
+      && pp.field_int(after_merge, "after_merge")
+      && cs.fetch_bool_to(before_split)
+      && pp.field_int(before_split, "before_split")
+      && cs.fetch_bool_to(after_split)
+      && pp.field_int(after_split, "after_split")
+      && pp.fetch_uint_field(cs, 1, "want_split")
+      && pp.fetch_uint_field(cs, 1, "want_merge")
+      && pp.fetch_uint_field(cs, 1, "key_block")
+      && cs.fetch_bool_to(vert_seqno_incr)
+      && pp.field_int(vert_seqno_incr, "vert_seqno_incr")
+      && cs.fetch_uint_to(8, flags)
+      && pp.field_int(flags, "flags")
+      && cs.fetch_uint_to(32, seq_no)
+      && pp.field_int(seq_no, "seq_no")
+      && cs.fetch_uint_to(32, vert_seq_no)
+      && pp.field_int(vert_seq_no, "vert_seq_no")
+      && vert_seqno_incr <= vert_seq_no
+      && add_r1(prev_seq_no, 1, seq_no)
+      && pp.field("shard")
+      && t_ShardIdent.print_skip(pp, cs)
+      && pp.fetch_uint_field(cs, 32, "gen_utime")
+      && pp.fetch_uint_field(cs, 64, "start_lt")
+      && pp.fetch_uint_field(cs, 64, "end_lt")
+      && pp.fetch_uint_field(cs, 32, "gen_validator_list_hash_short")
+      && pp.fetch_uint_field(cs, 32, "gen_catchain_seqno")
+      && pp.fetch_uint_field(cs, 32, "min_ref_mc_seqno")
+      && pp.fetch_uint_field(cs, 32, "prev_key_block_seqno")
+      && (!not_master || (pp.field("master_ref") && t_BlkMasterInfo.print_ref(pp, cs.fetch_ref())))
+      && pp.field("prev_ref")
+      && BlkPrevInfo{after_merge}.print_ref(pp, cs.fetch_ref())
+      && (!vert_seq_no || (pp.field("prev_vert_ref") && t_BlkPrevInfo_0.print_ref(pp, cs.fetch_ref())))
+      && pp.close();
+}
+
+const BlockInfo t_BlockInfo;
+
+//
+// code for type `BlkPrevInfo`
+//
+
+int BlkPrevInfo::get_tag(const vm::CellSlice& cs) const {
+  switch (m_) {
+  case 0:
+    return prev_blk_info;
+  case 1:
+    return prev_blks_info;
+  default:
+    return -1;
+  }
+}
+
+int BlkPrevInfo::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case prev_blk_info:
+    return prev_blk_info;
+  case prev_blks_info:
+    return prev_blks_info;
+  }
+  return -1;
+}
+
+bool BlkPrevInfo::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case prev_blk_info:
+    return cs.advance(608)
+        && m_ == 0;
+  case prev_blks_info:
+    return cs.advance_refs(2)
+        && m_ == 1;
+  }
+  return false;
+}
+
+bool BlkPrevInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case prev_blk_info:
+    return cs.advance(608)
+        && m_ == 0;
+  case prev_blks_info:
+    return t_ExtBlkRef.validate_skip_ref(cs, weak)
+        && t_ExtBlkRef.validate_skip_ref(cs, weak)
+        && m_ == 1;
+  }
+  return false;
+}
+
+bool BlkPrevInfo::unpack(vm::CellSlice& cs, BlkPrevInfo::Record_prev_blk_info& data) const {
+  return cs.fetch_subslice_to(608, data.prev)
+      && m_ == 0;
+}
+
+bool BlkPrevInfo::unpack_prev_blk_info(vm::CellSlice& cs, Ref<CellSlice>& prev) const {
+  return cs.fetch_subslice_to(608, prev)
+      && m_ == 0;
+}
+
+bool BlkPrevInfo::cell_unpack(Ref<vm::Cell> cell_ref, BlkPrevInfo::Record_prev_blk_info& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BlkPrevInfo::cell_unpack_prev_blk_info(Ref<vm::Cell> cell_ref, Ref<CellSlice>& prev) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_prev_blk_info(cs, prev) && cs.empty_ext();
+}
+
+bool BlkPrevInfo::unpack(vm::CellSlice& cs, BlkPrevInfo::Record_prev_blks_info& data) const {
+  return cs.fetch_ref_to(data.prev1)
+      && cs.fetch_ref_to(data.prev2)
+      && m_ == 1;
+}
+
+bool BlkPrevInfo::unpack_prev_blks_info(vm::CellSlice& cs, Ref<Cell>& prev1, Ref<Cell>& prev2) const {
+  return cs.fetch_ref_to(prev1)
+      && cs.fetch_ref_to(prev2)
+      && m_ == 1;
+}
+
+bool BlkPrevInfo::cell_unpack(Ref<vm::Cell> cell_ref, BlkPrevInfo::Record_prev_blks_info& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BlkPrevInfo::cell_unpack_prev_blks_info(Ref<vm::Cell> cell_ref, Ref<Cell>& prev1, Ref<Cell>& prev2) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_prev_blks_info(cs, prev1, prev2) && cs.empty_ext();
+}
+
+bool BlkPrevInfo::pack(vm::CellBuilder& cb, const BlkPrevInfo::Record_prev_blk_info& data) const {
+  return cb.append_cellslice_chk(data.prev, 608)
+      && m_ == 0;
+}
+
+bool BlkPrevInfo::pack_prev_blk_info(vm::CellBuilder& cb, Ref<CellSlice> prev) const {
+  return cb.append_cellslice_chk(prev, 608)
+      && m_ == 0;
+}
+
+bool BlkPrevInfo::cell_pack(Ref<vm::Cell>& cell_ref, const BlkPrevInfo::Record_prev_blk_info& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlkPrevInfo::cell_pack_prev_blk_info(Ref<vm::Cell>& cell_ref, Ref<CellSlice> prev) const {
+  vm::CellBuilder cb;
+  return pack_prev_blk_info(cb, std::move(prev)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlkPrevInfo::pack(vm::CellBuilder& cb, const BlkPrevInfo::Record_prev_blks_info& data) const {
+  return cb.store_ref_bool(data.prev1)
+      && cb.store_ref_bool(data.prev2)
+      && m_ == 1;
+}
+
+bool BlkPrevInfo::pack_prev_blks_info(vm::CellBuilder& cb, Ref<Cell> prev1, Ref<Cell> prev2) const {
+  return cb.store_ref_bool(prev1)
+      && cb.store_ref_bool(prev2)
+      && m_ == 1;
+}
+
+bool BlkPrevInfo::cell_pack(Ref<vm::Cell>& cell_ref, const BlkPrevInfo::Record_prev_blks_info& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlkPrevInfo::cell_pack_prev_blks_info(Ref<vm::Cell>& cell_ref, Ref<Cell> prev1, Ref<Cell> prev2) const {
+  vm::CellBuilder cb;
+  return pack_prev_blks_info(cb, std::move(prev1), std::move(prev2)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlkPrevInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case prev_blk_info:
+    return pp.open("prev_blk_info")
+        && pp.field("prev")
+        && t_ExtBlkRef.print_skip(pp, cs)
+        && m_ == 0
+        && pp.close();
+  case prev_blks_info:
+    return pp.open("prev_blks_info")
+        && pp.field("prev1")
+        && t_ExtBlkRef.print_ref(pp, cs.fetch_ref())
+        && pp.field("prev2")
+        && t_ExtBlkRef.print_ref(pp, cs.fetch_ref())
+        && m_ == 1
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for BlkPrevInfo");
+}
+
+
+//
+// code for type `Block`
+//
+constexpr unsigned Block::cons_tag[1];
+
+int Block::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(32) == 0x11ef55aa ? block : -1;
+}
+
+bool Block::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(32) == 0x11ef55aa
+      && cs.advance(32)
+      && t_BlockInfo.validate_skip_ref(cs, weak)
+      && t_ValueFlow.validate_skip_ref(cs, weak)
+      && t_MERKLE_UPDATE_ShardState.validate_skip_ref(cs, weak)
+      && t_BlockExtra.validate_skip_ref(cs, weak);
+}
+
+bool Block::unpack(vm::CellSlice& cs, Block::Record& data) const {
+  return cs.fetch_ulong(32) == 0x11ef55aa
+      && cs.fetch_int_to(32, data.global_id)
+      && cs.fetch_ref_to(data.info)
+      && cs.fetch_ref_to(data.value_flow)
+      && cs.fetch_ref_to(data.state_update)
+      && cs.fetch_ref_to(data.extra);
+}
+
+bool Block::cell_unpack(Ref<vm::Cell> cell_ref, Block::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Block::pack(vm::CellBuilder& cb, const Block::Record& data) const {
+  return cb.store_long_bool(0x11ef55aa, 32)
+      && cb.store_long_rchk_bool(data.global_id, 32)
+      && cb.store_ref_bool(data.info)
+      && cb.store_ref_bool(data.value_flow)
+      && cb.store_ref_bool(data.state_update)
+      && cb.store_ref_bool(data.extra);
+}
+
+bool Block::cell_pack(Ref<vm::Cell>& cell_ref, const Block::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Block::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(32) == 0x11ef55aa
+      && pp.open("block")
+      && pp.fetch_int_field(cs, 32, "global_id")
+      && pp.field("info")
+      && t_BlockInfo.print_ref(pp, cs.fetch_ref())
+      && pp.field("value_flow")
+      && t_ValueFlow.print_ref(pp, cs.fetch_ref())
+      && pp.field("state_update")
+      && t_MERKLE_UPDATE_ShardState.print_ref(pp, cs.fetch_ref())
+      && pp.field("extra")
+      && t_BlockExtra.print_ref(pp, cs.fetch_ref())
+      && pp.close();
+}
+
+const Block t_Block;
+
+//
+// code for type `BlockExtra`
+//
+constexpr unsigned BlockExtra::cons_tag[1];
+
+int BlockExtra::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(32) == 0x4a33f6fd ? block_extra : -1;
+}
+
+bool BlockExtra::skip(vm::CellSlice& cs) const {
+  return cs.advance_ext(0x30220)
+      && t_Maybe_Ref_McBlockExtra.skip(cs);
+}
+
+bool BlockExtra::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(32) == 0x4a33f6fd
+      && t_InMsgDescr.validate_skip_ref(cs, weak)
+      && t_OutMsgDescr.validate_skip_ref(cs, weak)
+      && t_ShardAccountBlocks.validate_skip_ref(cs, weak)
+      && cs.advance(512)
+      && t_Maybe_Ref_McBlockExtra.validate_skip(cs, weak);
+}
+
+bool BlockExtra::unpack(vm::CellSlice& cs, BlockExtra::Record& data) const {
+  return cs.fetch_ulong(32) == 0x4a33f6fd
+      && cs.fetch_ref_to(data.in_msg_descr)
+      && cs.fetch_ref_to(data.out_msg_descr)
+      && cs.fetch_ref_to(data.account_blocks)
+      && cs.fetch_bits_to(data.rand_seed.bits(), 256)
+      && cs.fetch_bits_to(data.created_by.bits(), 256)
+      && t_Maybe_Ref_McBlockExtra.fetch_to(cs, data.custom);
+}
+
+bool BlockExtra::cell_unpack(Ref<vm::Cell> cell_ref, BlockExtra::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BlockExtra::pack(vm::CellBuilder& cb, const BlockExtra::Record& data) const {
+  return cb.store_long_bool(0x4a33f6fd, 32)
+      && cb.store_ref_bool(data.in_msg_descr)
+      && cb.store_ref_bool(data.out_msg_descr)
+      && cb.store_ref_bool(data.account_blocks)
+      && cb.store_bits_bool(data.rand_seed.cbits(), 256)
+      && cb.store_bits_bool(data.created_by.cbits(), 256)
+      && t_Maybe_Ref_McBlockExtra.store_from(cb, data.custom);
+}
+
+bool BlockExtra::cell_pack(Ref<vm::Cell>& cell_ref, const BlockExtra::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockExtra::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(32) == 0x4a33f6fd
+      && pp.open("block_extra")
+      && pp.field("in_msg_descr")
+      && t_InMsgDescr.print_ref(pp, cs.fetch_ref())
+      && pp.field("out_msg_descr")
+      && t_OutMsgDescr.print_ref(pp, cs.fetch_ref())
+      && pp.field("account_blocks")
+      && t_ShardAccountBlocks.print_ref(pp, cs.fetch_ref())
+      && pp.fetch_bits_field(cs, 256, "rand_seed")
+      && pp.fetch_bits_field(cs, 256, "created_by")
+      && pp.field("custom")
+      && t_Maybe_Ref_McBlockExtra.print_skip(pp, cs)
+      && pp.close();
+}
+
+const BlockExtra t_BlockExtra;
+
+//
+// code for auxiliary type `ValueFlow_aux`
+//
+
+int ValueFlow_aux::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool ValueFlow_aux::skip(vm::CellSlice& cs) const {
+  return t_CurrencyCollection.skip(cs)
+      && t_CurrencyCollection.skip(cs)
+      && t_CurrencyCollection.skip(cs)
+      && t_CurrencyCollection.skip(cs);
+}
+
+bool ValueFlow_aux::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_CurrencyCollection.validate_skip(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak);
+}
+
+bool ValueFlow_aux::unpack(vm::CellSlice& cs, ValueFlow_aux::Record& data) const {
+  return t_CurrencyCollection.fetch_to(cs, data.from_prev_blk)
+      && t_CurrencyCollection.fetch_to(cs, data.to_next_blk)
+      && t_CurrencyCollection.fetch_to(cs, data.imported)
+      && t_CurrencyCollection.fetch_to(cs, data.exported);
+}
+
+bool ValueFlow_aux::cell_unpack(Ref<vm::Cell> cell_ref, ValueFlow_aux::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ValueFlow_aux::pack(vm::CellBuilder& cb, const ValueFlow_aux::Record& data) const {
+  return t_CurrencyCollection.store_from(cb, data.from_prev_blk)
+      && t_CurrencyCollection.store_from(cb, data.to_next_blk)
+      && t_CurrencyCollection.store_from(cb, data.imported)
+      && t_CurrencyCollection.store_from(cb, data.exported);
+}
+
+bool ValueFlow_aux::cell_pack(Ref<vm::Cell>& cell_ref, const ValueFlow_aux::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValueFlow_aux::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field("from_prev_blk")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("to_next_blk")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("imported")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("exported")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ValueFlow_aux t_ValueFlow_aux;
+
+//
+// code for auxiliary type `ValueFlow_aux1`
+//
+
+int ValueFlow_aux1::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool ValueFlow_aux1::skip(vm::CellSlice& cs) const {
+  return t_CurrencyCollection.skip(cs)
+      && t_CurrencyCollection.skip(cs)
+      && t_CurrencyCollection.skip(cs)
+      && t_CurrencyCollection.skip(cs);
+}
+
+bool ValueFlow_aux1::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_CurrencyCollection.validate_skip(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak);
+}
+
+bool ValueFlow_aux1::unpack(vm::CellSlice& cs, ValueFlow_aux1::Record& data) const {
+  return t_CurrencyCollection.fetch_to(cs, data.fees_imported)
+      && t_CurrencyCollection.fetch_to(cs, data.recovered)
+      && t_CurrencyCollection.fetch_to(cs, data.created)
+      && t_CurrencyCollection.fetch_to(cs, data.minted);
+}
+
+bool ValueFlow_aux1::cell_unpack(Ref<vm::Cell> cell_ref, ValueFlow_aux1::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ValueFlow_aux1::pack(vm::CellBuilder& cb, const ValueFlow_aux1::Record& data) const {
+  return t_CurrencyCollection.store_from(cb, data.fees_imported)
+      && t_CurrencyCollection.store_from(cb, data.recovered)
+      && t_CurrencyCollection.store_from(cb, data.created)
+      && t_CurrencyCollection.store_from(cb, data.minted);
+}
+
+bool ValueFlow_aux1::cell_pack(Ref<vm::Cell>& cell_ref, const ValueFlow_aux1::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValueFlow_aux1::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field("fees_imported")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("recovered")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("created")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("minted")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ValueFlow_aux1 t_ValueFlow_aux1;
+
+//
+// code for type `ValueFlow`
+//
+constexpr unsigned ValueFlow::cons_tag[1];
+
+int ValueFlow::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(32) == 0xb8e48dfbU ? value_flow : -1;
+}
+
+bool ValueFlow::skip(vm::CellSlice& cs) const {
+  return cs.advance_ext(0x10020)
+      && t_CurrencyCollection.skip(cs)
+      && cs.advance_refs(1);
+}
+
+bool ValueFlow::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(32) == 0xb8e48dfbU
+      && t_ValueFlow_aux.validate_skip_ref(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak)
+      && t_ValueFlow_aux1.validate_skip_ref(cs, weak);
+}
+
+bool ValueFlow::unpack(vm::CellSlice& cs, ValueFlow::Record& data) const {
+  return cs.fetch_ulong(32) == 0xb8e48dfbU
+      && t_ValueFlow_aux.cell_unpack(cs.fetch_ref(), data.r1)
+      && t_CurrencyCollection.fetch_to(cs, data.fees_collected)
+      && t_ValueFlow_aux1.cell_unpack(cs.fetch_ref(), data.r2);
+}
+
+bool ValueFlow::cell_unpack(Ref<vm::Cell> cell_ref, ValueFlow::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ValueFlow::pack(vm::CellBuilder& cb, const ValueFlow::Record& data) const {
+  Ref<vm::Cell> tmp_cell;
+  return cb.store_long_bool(0xb8e48dfbU, 32)
+      && t_ValueFlow_aux.cell_pack(tmp_cell, data.r1)
+      && cb.store_ref_bool(std::move(tmp_cell))
+      && t_CurrencyCollection.store_from(cb, data.fees_collected)
+      && t_ValueFlow_aux1.cell_pack(tmp_cell, data.r2)
+      && cb.store_ref_bool(std::move(tmp_cell));
+}
+
+bool ValueFlow::cell_pack(Ref<vm::Cell>& cell_ref, const ValueFlow::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValueFlow::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(32) == 0xb8e48dfbU
+      && pp.open("value_flow")
+      && pp.field()
+      && t_ValueFlow_aux.print_ref(pp, cs.fetch_ref())
+      && pp.field("fees_collected")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field()
+      && t_ValueFlow_aux1.print_ref(pp, cs.fetch_ref())
+      && pp.close();
+}
+
+const ValueFlow t_ValueFlow;
+
+//
+// code for type `BinTree`
+//
+
+int BinTree::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case bt_leaf:
+    return cs.have(1) ? bt_leaf : -1;
+  case bt_fork:
+    return cs.have(1) ? bt_fork : -1;
+  }
+  return -1;
+}
+
+bool BinTree::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case bt_leaf:
+    return cs.advance(1)
+        && X_.skip(cs);
+  case bt_fork:
+    return cs.advance_ext(0x20001);
+  }
+  return false;
+}
+
+bool BinTree::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case bt_leaf:
+    return cs.advance(1)
+        && X_.validate_skip(cs, weak);
+  case bt_fork:
+    return cs.advance(1)
+        && validate_skip_ref(cs, weak)
+        && validate_skip_ref(cs, weak);
+  }
+  return false;
+}
+
+bool BinTree::unpack(vm::CellSlice& cs, BinTree::Record_bt_leaf& data) const {
+  return cs.fetch_ulong(1) == 0
+      && X_.fetch_to(cs, data.leaf);
+}
+
+bool BinTree::unpack_bt_leaf(vm::CellSlice& cs, Ref<CellSlice>& leaf) const {
+  return cs.fetch_ulong(1) == 0
+      && X_.fetch_to(cs, leaf);
+}
+
+bool BinTree::cell_unpack(Ref<vm::Cell> cell_ref, BinTree::Record_bt_leaf& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BinTree::cell_unpack_bt_leaf(Ref<vm::Cell> cell_ref, Ref<CellSlice>& leaf) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_bt_leaf(cs, leaf) && cs.empty_ext();
+}
+
+bool BinTree::unpack(vm::CellSlice& cs, BinTree::Record_bt_fork& data) const {
+  return cs.fetch_ulong(1) == 1
+      && cs.fetch_ref_to(data.left)
+      && cs.fetch_ref_to(data.right);
+}
+
+bool BinTree::unpack_bt_fork(vm::CellSlice& cs, Ref<Cell>& left, Ref<Cell>& right) const {
+  return cs.fetch_ulong(1) == 1
+      && cs.fetch_ref_to(left)
+      && cs.fetch_ref_to(right);
+}
+
+bool BinTree::cell_unpack(Ref<vm::Cell> cell_ref, BinTree::Record_bt_fork& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BinTree::cell_unpack_bt_fork(Ref<vm::Cell> cell_ref, Ref<Cell>& left, Ref<Cell>& right) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_bt_fork(cs, left, right) && cs.empty_ext();
+}
+
+bool BinTree::pack(vm::CellBuilder& cb, const BinTree::Record_bt_leaf& data) const {
+  return cb.store_long_bool(0, 1)
+      && X_.store_from(cb, data.leaf);
+}
+
+bool BinTree::pack_bt_leaf(vm::CellBuilder& cb, Ref<CellSlice> leaf) const {
+  return cb.store_long_bool(0, 1)
+      && X_.store_from(cb, leaf);
+}
+
+bool BinTree::cell_pack(Ref<vm::Cell>& cell_ref, const BinTree::Record_bt_leaf& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BinTree::cell_pack_bt_leaf(Ref<vm::Cell>& cell_ref, Ref<CellSlice> leaf) const {
+  vm::CellBuilder cb;
+  return pack_bt_leaf(cb, std::move(leaf)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BinTree::pack(vm::CellBuilder& cb, const BinTree::Record_bt_fork& data) const {
+  return cb.store_long_bool(1, 1)
+      && cb.store_ref_bool(data.left)
+      && cb.store_ref_bool(data.right);
+}
+
+bool BinTree::pack_bt_fork(vm::CellBuilder& cb, Ref<Cell> left, Ref<Cell> right) const {
+  return cb.store_long_bool(1, 1)
+      && cb.store_ref_bool(left)
+      && cb.store_ref_bool(right);
+}
+
+bool BinTree::cell_pack(Ref<vm::Cell>& cell_ref, const BinTree::Record_bt_fork& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BinTree::cell_pack_bt_fork(Ref<vm::Cell>& cell_ref, Ref<Cell> left, Ref<Cell> right) const {
+  vm::CellBuilder cb;
+  return pack_bt_fork(cb, std::move(left), std::move(right)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BinTree::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case bt_leaf:
+    return cs.advance(1)
+        && pp.open("bt_leaf")
+        && pp.field("leaf")
+        && X_.print_skip(pp, cs)
+        && pp.close();
+  case bt_fork:
+    return cs.advance(1)
+        && pp.open("bt_fork")
+        && pp.field("left")
+        && print_ref(pp, cs.fetch_ref())
+        && pp.field("right")
+        && print_ref(pp, cs.fetch_ref())
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for BinTree");
+}
+
+
+//
+// code for type `FutureSplitMerge`
+//
+constexpr char FutureSplitMerge::cons_len[3];
+constexpr unsigned char FutureSplitMerge::cons_tag[3];
+
+int FutureSplitMerge::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case fsm_none:
+    return cs.have(1) ? fsm_none : -1;
+  case fsm_split:
+    return cs.have(2) ? fsm_split : -1;
+  case fsm_merge:
+    return cs.have(2) ? fsm_merge : -1;
+  }
+  return -1;
+}
+
+bool FutureSplitMerge::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case fsm_none:
+    return cs.advance(1);
+  case fsm_split:
+    return cs.advance(66);
+  case fsm_merge:
+    return cs.advance(66);
+  }
+  return false;
+}
+
+bool FutureSplitMerge::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case fsm_none:
+    return cs.advance(1);
+  case fsm_split:
+    return cs.advance(66);
+  case fsm_merge:
+    return cs.advance(66);
+  }
+  return false;
+}
+
+bool FutureSplitMerge::unpack(vm::CellSlice& cs, FutureSplitMerge::Record_fsm_none& data) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool FutureSplitMerge::unpack_fsm_none(vm::CellSlice& cs) const {
+  return cs.fetch_ulong(1) == 0;
+}
+
+bool FutureSplitMerge::cell_unpack(Ref<vm::Cell> cell_ref, FutureSplitMerge::Record_fsm_none& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool FutureSplitMerge::cell_unpack_fsm_none(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_fsm_none(cs) && cs.empty_ext();
+}
+
+bool FutureSplitMerge::unpack(vm::CellSlice& cs, FutureSplitMerge::Record_fsm_split& data) const {
+  return cs.fetch_ulong(2) == 2
+      && cs.fetch_uint_to(32, data.split_utime)
+      && cs.fetch_uint_to(32, data.interval);
+}
+
+bool FutureSplitMerge::unpack_fsm_split(vm::CellSlice& cs, unsigned& split_utime, unsigned& interval) const {
+  return cs.fetch_ulong(2) == 2
+      && cs.fetch_uint_to(32, split_utime)
+      && cs.fetch_uint_to(32, interval);
+}
+
+bool FutureSplitMerge::cell_unpack(Ref<vm::Cell> cell_ref, FutureSplitMerge::Record_fsm_split& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool FutureSplitMerge::cell_unpack_fsm_split(Ref<vm::Cell> cell_ref, unsigned& split_utime, unsigned& interval) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_fsm_split(cs, split_utime, interval) && cs.empty_ext();
+}
+
+bool FutureSplitMerge::unpack(vm::CellSlice& cs, FutureSplitMerge::Record_fsm_merge& data) const {
+  return cs.fetch_ulong(2) == 3
+      && cs.fetch_uint_to(32, data.merge_utime)
+      && cs.fetch_uint_to(32, data.interval);
+}
+
+bool FutureSplitMerge::unpack_fsm_merge(vm::CellSlice& cs, unsigned& merge_utime, unsigned& interval) const {
+  return cs.fetch_ulong(2) == 3
+      && cs.fetch_uint_to(32, merge_utime)
+      && cs.fetch_uint_to(32, interval);
+}
+
+bool FutureSplitMerge::cell_unpack(Ref<vm::Cell> cell_ref, FutureSplitMerge::Record_fsm_merge& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool FutureSplitMerge::cell_unpack_fsm_merge(Ref<vm::Cell> cell_ref, unsigned& merge_utime, unsigned& interval) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_fsm_merge(cs, merge_utime, interval) && cs.empty_ext();
+}
+
+bool FutureSplitMerge::pack(vm::CellBuilder& cb, const FutureSplitMerge::Record_fsm_none& data) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool FutureSplitMerge::pack_fsm_none(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 1);
+}
+
+bool FutureSplitMerge::cell_pack(Ref<vm::Cell>& cell_ref, const FutureSplitMerge::Record_fsm_none& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool FutureSplitMerge::cell_pack_fsm_none(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_fsm_none(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool FutureSplitMerge::pack(vm::CellBuilder& cb, const FutureSplitMerge::Record_fsm_split& data) const {
+  return cb.store_long_bool(2, 2)
+      && cb.store_ulong_rchk_bool(data.split_utime, 32)
+      && cb.store_ulong_rchk_bool(data.interval, 32);
+}
+
+bool FutureSplitMerge::pack_fsm_split(vm::CellBuilder& cb, unsigned split_utime, unsigned interval) const {
+  return cb.store_long_bool(2, 2)
+      && cb.store_ulong_rchk_bool(split_utime, 32)
+      && cb.store_ulong_rchk_bool(interval, 32);
+}
+
+bool FutureSplitMerge::cell_pack(Ref<vm::Cell>& cell_ref, const FutureSplitMerge::Record_fsm_split& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool FutureSplitMerge::cell_pack_fsm_split(Ref<vm::Cell>& cell_ref, unsigned split_utime, unsigned interval) const {
+  vm::CellBuilder cb;
+  return pack_fsm_split(cb, split_utime, interval) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool FutureSplitMerge::pack(vm::CellBuilder& cb, const FutureSplitMerge::Record_fsm_merge& data) const {
+  return cb.store_long_bool(3, 2)
+      && cb.store_ulong_rchk_bool(data.merge_utime, 32)
+      && cb.store_ulong_rchk_bool(data.interval, 32);
+}
+
+bool FutureSplitMerge::pack_fsm_merge(vm::CellBuilder& cb, unsigned merge_utime, unsigned interval) const {
+  return cb.store_long_bool(3, 2)
+      && cb.store_ulong_rchk_bool(merge_utime, 32)
+      && cb.store_ulong_rchk_bool(interval, 32);
+}
+
+bool FutureSplitMerge::cell_pack(Ref<vm::Cell>& cell_ref, const FutureSplitMerge::Record_fsm_merge& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool FutureSplitMerge::cell_pack_fsm_merge(Ref<vm::Cell>& cell_ref, unsigned merge_utime, unsigned interval) const {
+  vm::CellBuilder cb;
+  return pack_fsm_merge(cb, merge_utime, interval) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool FutureSplitMerge::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case fsm_none:
+    return cs.advance(1)
+        && pp.cons("fsm_none");
+  case fsm_split:
+    return cs.advance(2)
+        && pp.open("fsm_split")
+        && pp.fetch_uint_field(cs, 32, "split_utime")
+        && pp.fetch_uint_field(cs, 32, "interval")
+        && pp.close();
+  case fsm_merge:
+    return cs.advance(2)
+        && pp.open("fsm_merge")
+        && pp.fetch_uint_field(cs, 32, "merge_utime")
+        && pp.fetch_uint_field(cs, 32, "interval")
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for FutureSplitMerge");
+}
+
+const FutureSplitMerge t_FutureSplitMerge;
+
+//
+// code for type `ShardDescr`
+//
+constexpr unsigned char ShardDescr::cons_tag[1];
+
+int ShardDescr::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(4) == 11 ? shard_descr : -1;
+}
+
+bool ShardDescr::skip(vm::CellSlice& cs) const {
+  int flags;
+  return cs.advance(713)
+      && cs.fetch_uint_to(3, flags)
+      && flags == 0
+      && cs.advance(160)
+      && t_FutureSplitMerge.skip(cs)
+      && t_CurrencyCollection.skip(cs)
+      && t_CurrencyCollection.skip(cs);
+}
+
+bool ShardDescr::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int flags;
+  return cs.fetch_ulong(4) == 11
+      && cs.advance(709)
+      && cs.fetch_uint_to(3, flags)
+      && flags == 0
+      && cs.advance(160)
+      && t_FutureSplitMerge.validate_skip(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak);
+}
+
+bool ShardDescr::unpack(vm::CellSlice& cs, ShardDescr::Record& data) const {
+  return cs.fetch_ulong(4) == 11
+      && cs.fetch_uint_to(32, data.seq_no)
+      && cs.fetch_uint_to(32, data.reg_mc_seqno)
+      && cs.fetch_uint_to(64, data.start_lt)
+      && cs.fetch_uint_to(64, data.end_lt)
+      && cs.fetch_bits_to(data.root_hash.bits(), 256)
+      && cs.fetch_bits_to(data.file_hash.bits(), 256)
+      && cs.fetch_bool_to(data.before_split)
+      && cs.fetch_bool_to(data.before_merge)
+      && cs.fetch_bool_to(data.want_split)
+      && cs.fetch_bool_to(data.want_merge)
+      && cs.fetch_bool_to(data.nx_cc_updated)
+      && cs.fetch_uint_to(3, data.flags)
+      && data.flags == 0
+      && cs.fetch_uint_to(32, data.next_catchain_seqno)
+      && cs.fetch_uint_to(64, data.next_validator_shard)
+      && cs.fetch_uint_to(32, data.min_ref_mc_seqno)
+      && cs.fetch_uint_to(32, data.gen_utime)
+      && t_FutureSplitMerge.fetch_to(cs, data.split_merge_at)
+      && t_CurrencyCollection.fetch_to(cs, data.fees_collected)
+      && t_CurrencyCollection.fetch_to(cs, data.funds_created);
+}
+
+bool ShardDescr::cell_unpack(Ref<vm::Cell> cell_ref, ShardDescr::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ShardDescr::pack(vm::CellBuilder& cb, const ShardDescr::Record& data) const {
+  return cb.store_long_bool(11, 4)
+      && cb.store_ulong_rchk_bool(data.seq_no, 32)
+      && cb.store_ulong_rchk_bool(data.reg_mc_seqno, 32)
+      && cb.store_ulong_rchk_bool(data.start_lt, 64)
+      && cb.store_ulong_rchk_bool(data.end_lt, 64)
+      && cb.store_bits_bool(data.root_hash.cbits(), 256)
+      && cb.store_bits_bool(data.file_hash.cbits(), 256)
+      && cb.store_ulong_rchk_bool(data.before_split, 1)
+      && cb.store_ulong_rchk_bool(data.before_merge, 1)
+      && cb.store_ulong_rchk_bool(data.want_split, 1)
+      && cb.store_ulong_rchk_bool(data.want_merge, 1)
+      && cb.store_ulong_rchk_bool(data.nx_cc_updated, 1)
+      && cb.store_ulong_rchk_bool(data.flags, 3)
+      && data.flags == 0
+      && cb.store_ulong_rchk_bool(data.next_catchain_seqno, 32)
+      && cb.store_ulong_rchk_bool(data.next_validator_shard, 64)
+      && cb.store_ulong_rchk_bool(data.min_ref_mc_seqno, 32)
+      && cb.store_ulong_rchk_bool(data.gen_utime, 32)
+      && t_FutureSplitMerge.store_from(cb, data.split_merge_at)
+      && t_CurrencyCollection.store_from(cb, data.fees_collected)
+      && t_CurrencyCollection.store_from(cb, data.funds_created);
+}
+
+bool ShardDescr::cell_pack(Ref<vm::Cell>& cell_ref, const ShardDescr::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardDescr::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int flags;
+  return cs.fetch_ulong(4) == 11
+      && pp.open("shard_descr")
+      && pp.fetch_uint_field(cs, 32, "seq_no")
+      && pp.fetch_uint_field(cs, 32, "reg_mc_seqno")
+      && pp.fetch_uint_field(cs, 64, "start_lt")
+      && pp.fetch_uint_field(cs, 64, "end_lt")
+      && pp.fetch_bits_field(cs, 256, "root_hash")
+      && pp.fetch_bits_field(cs, 256, "file_hash")
+      && pp.fetch_uint_field(cs, 1, "before_split")
+      && pp.fetch_uint_field(cs, 1, "before_merge")
+      && pp.fetch_uint_field(cs, 1, "want_split")
+      && pp.fetch_uint_field(cs, 1, "want_merge")
+      && pp.fetch_uint_field(cs, 1, "nx_cc_updated")
+      && cs.fetch_uint_to(3, flags)
+      && pp.field_int(flags, "flags")
+      && flags == 0
+      && pp.fetch_uint_field(cs, 32, "next_catchain_seqno")
+      && pp.fetch_uint_field(cs, 64, "next_validator_shard")
+      && pp.fetch_uint_field(cs, 32, "min_ref_mc_seqno")
+      && pp.fetch_uint_field(cs, 32, "gen_utime")
+      && pp.field("split_merge_at")
+      && t_FutureSplitMerge.print_skip(pp, cs)
+      && pp.field("fees_collected")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("funds_created")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ShardDescr t_ShardDescr;
+
+//
+// code for type `ShardHashes`
+//
+
+int ShardHashes::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool ShardHashes::skip(vm::CellSlice& cs) const {
+  return t_HashmapE_32_Ref_BinTree_ShardDescr.skip(cs);
+}
+
+bool ShardHashes::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_HashmapE_32_Ref_BinTree_ShardDescr.validate_skip(cs, weak);
+}
+
+bool ShardHashes::unpack(vm::CellSlice& cs, ShardHashes::Record& data) const {
+  return t_HashmapE_32_Ref_BinTree_ShardDescr.fetch_to(cs, data.x);
+}
+
+bool ShardHashes::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_HashmapE_32_Ref_BinTree_ShardDescr.fetch_to(cs, x);
+}
+
+bool ShardHashes::cell_unpack(Ref<vm::Cell> cell_ref, ShardHashes::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ShardHashes::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, x) && cs.empty_ext();
+}
+
+bool ShardHashes::pack(vm::CellBuilder& cb, const ShardHashes::Record& data) const {
+  return t_HashmapE_32_Ref_BinTree_ShardDescr.store_from(cb, data.x);
+}
+
+bool ShardHashes::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_HashmapE_32_Ref_BinTree_ShardDescr.store_from(cb, x);
+}
+
+bool ShardHashes::cell_pack(Ref<vm::Cell>& cell_ref, const ShardHashes::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardHashes::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardHashes::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field()
+      && t_HashmapE_32_Ref_BinTree_ShardDescr.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ShardHashes t_ShardHashes;
+
+//
+// code for type `BinTreeAug`
+//
+
+int BinTreeAug::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case bta_leaf:
+    return cs.have(1) ? bta_leaf : -1;
+  case bta_fork:
+    return cs.have(1) ? bta_fork : -1;
+  }
+  return -1;
+}
+
+bool BinTreeAug::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case bta_leaf:
+    return cs.advance(1)
+        && Y_.skip(cs)
+        && X_.skip(cs);
+  case bta_fork:
+    return cs.advance_ext(0x20001)
+        && Y_.skip(cs);
+  }
+  return false;
+}
+
+bool BinTreeAug::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case bta_leaf:
+    return cs.advance(1)
+        && Y_.validate_skip(cs, weak)
+        && X_.validate_skip(cs, weak);
+  case bta_fork:
+    return cs.advance(1)
+        && validate_skip_ref(cs, weak)
+        && validate_skip_ref(cs, weak)
+        && Y_.validate_skip(cs, weak);
+  }
+  return false;
+}
+
+bool BinTreeAug::unpack(vm::CellSlice& cs, BinTreeAug::Record_bta_leaf& data) const {
+  return cs.fetch_ulong(1) == 0
+      && Y_.fetch_to(cs, data.extra)
+      && X_.fetch_to(cs, data.leaf);
+}
+
+bool BinTreeAug::unpack_bta_leaf(vm::CellSlice& cs, Ref<CellSlice>& extra, Ref<CellSlice>& leaf) const {
+  return cs.fetch_ulong(1) == 0
+      && Y_.fetch_to(cs, extra)
+      && X_.fetch_to(cs, leaf);
+}
+
+bool BinTreeAug::cell_unpack(Ref<vm::Cell> cell_ref, BinTreeAug::Record_bta_leaf& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BinTreeAug::cell_unpack_bta_leaf(Ref<vm::Cell> cell_ref, Ref<CellSlice>& extra, Ref<CellSlice>& leaf) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_bta_leaf(cs, extra, leaf) && cs.empty_ext();
+}
+
+bool BinTreeAug::unpack(vm::CellSlice& cs, BinTreeAug::Record_bta_fork& data) const {
+  return cs.fetch_ulong(1) == 1
+      && cs.fetch_ref_to(data.left)
+      && cs.fetch_ref_to(data.right)
+      && Y_.fetch_to(cs, data.extra);
+}
+
+bool BinTreeAug::unpack_bta_fork(vm::CellSlice& cs, Ref<Cell>& left, Ref<Cell>& right, Ref<CellSlice>& extra) const {
+  return cs.fetch_ulong(1) == 1
+      && cs.fetch_ref_to(left)
+      && cs.fetch_ref_to(right)
+      && Y_.fetch_to(cs, extra);
+}
+
+bool BinTreeAug::cell_unpack(Ref<vm::Cell> cell_ref, BinTreeAug::Record_bta_fork& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BinTreeAug::cell_unpack_bta_fork(Ref<vm::Cell> cell_ref, Ref<Cell>& left, Ref<Cell>& right, Ref<CellSlice>& extra) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_bta_fork(cs, left, right, extra) && cs.empty_ext();
+}
+
+bool BinTreeAug::pack(vm::CellBuilder& cb, const BinTreeAug::Record_bta_leaf& data) const {
+  return cb.store_long_bool(0, 1)
+      && Y_.store_from(cb, data.extra)
+      && X_.store_from(cb, data.leaf);
+}
+
+bool BinTreeAug::pack_bta_leaf(vm::CellBuilder& cb, Ref<CellSlice> extra, Ref<CellSlice> leaf) const {
+  return cb.store_long_bool(0, 1)
+      && Y_.store_from(cb, extra)
+      && X_.store_from(cb, leaf);
+}
+
+bool BinTreeAug::cell_pack(Ref<vm::Cell>& cell_ref, const BinTreeAug::Record_bta_leaf& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BinTreeAug::cell_pack_bta_leaf(Ref<vm::Cell>& cell_ref, Ref<CellSlice> extra, Ref<CellSlice> leaf) const {
+  vm::CellBuilder cb;
+  return pack_bta_leaf(cb, std::move(extra), std::move(leaf)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BinTreeAug::pack(vm::CellBuilder& cb, const BinTreeAug::Record_bta_fork& data) const {
+  return cb.store_long_bool(1, 1)
+      && cb.store_ref_bool(data.left)
+      && cb.store_ref_bool(data.right)
+      && Y_.store_from(cb, data.extra);
+}
+
+bool BinTreeAug::pack_bta_fork(vm::CellBuilder& cb, Ref<Cell> left, Ref<Cell> right, Ref<CellSlice> extra) const {
+  return cb.store_long_bool(1, 1)
+      && cb.store_ref_bool(left)
+      && cb.store_ref_bool(right)
+      && Y_.store_from(cb, extra);
+}
+
+bool BinTreeAug::cell_pack(Ref<vm::Cell>& cell_ref, const BinTreeAug::Record_bta_fork& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BinTreeAug::cell_pack_bta_fork(Ref<vm::Cell>& cell_ref, Ref<Cell> left, Ref<Cell> right, Ref<CellSlice> extra) const {
+  vm::CellBuilder cb;
+  return pack_bta_fork(cb, std::move(left), std::move(right), std::move(extra)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BinTreeAug::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case bta_leaf:
+    return cs.advance(1)
+        && pp.open("bta_leaf")
+        && pp.field("extra")
+        && Y_.print_skip(pp, cs)
+        && pp.field("leaf")
+        && X_.print_skip(pp, cs)
+        && pp.close();
+  case bta_fork:
+    return cs.advance(1)
+        && pp.open("bta_fork")
+        && pp.field("left")
+        && print_ref(pp, cs.fetch_ref())
+        && pp.field("right")
+        && print_ref(pp, cs.fetch_ref())
+        && pp.field("extra")
+        && Y_.print_skip(pp, cs)
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for BinTreeAug");
+}
+
+
+//
+// code for type `ShardFeeCreated`
+//
+
+int ShardFeeCreated::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool ShardFeeCreated::skip(vm::CellSlice& cs) const {
+  return t_CurrencyCollection.skip(cs)
+      && t_CurrencyCollection.skip(cs);
+}
+
+bool ShardFeeCreated::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_CurrencyCollection.validate_skip(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak);
+}
+
+bool ShardFeeCreated::unpack(vm::CellSlice& cs, ShardFeeCreated::Record& data) const {
+  return t_CurrencyCollection.fetch_to(cs, data.fees)
+      && t_CurrencyCollection.fetch_to(cs, data.create);
+}
+
+bool ShardFeeCreated::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& fees, Ref<CellSlice>& create) const {
+  return t_CurrencyCollection.fetch_to(cs, fees)
+      && t_CurrencyCollection.fetch_to(cs, create);
+}
+
+bool ShardFeeCreated::cell_unpack(Ref<vm::Cell> cell_ref, ShardFeeCreated::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ShardFeeCreated::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& fees, Ref<CellSlice>& create) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, fees, create) && cs.empty_ext();
+}
+
+bool ShardFeeCreated::pack(vm::CellBuilder& cb, const ShardFeeCreated::Record& data) const {
+  return t_CurrencyCollection.store_from(cb, data.fees)
+      && t_CurrencyCollection.store_from(cb, data.create);
+}
+
+bool ShardFeeCreated::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> fees, Ref<CellSlice> create) const {
+  return t_CurrencyCollection.store_from(cb, fees)
+      && t_CurrencyCollection.store_from(cb, create);
+}
+
+bool ShardFeeCreated::cell_pack(Ref<vm::Cell>& cell_ref, const ShardFeeCreated::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardFeeCreated::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> fees, Ref<CellSlice> create) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(fees), std::move(create)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardFeeCreated::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field("fees")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.field("create")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ShardFeeCreated t_ShardFeeCreated;
+
+//
+// code for type `ShardFees`
+//
+
+int ShardFees::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool ShardFees::skip(vm::CellSlice& cs) const {
+  return t_HashmapAugE_96_ShardFeeCreated_ShardFeeCreated.skip(cs);
+}
+
+bool ShardFees::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_HashmapAugE_96_ShardFeeCreated_ShardFeeCreated.validate_skip(cs, weak);
+}
+
+bool ShardFees::unpack(vm::CellSlice& cs, ShardFees::Record& data) const {
+  return t_HashmapAugE_96_ShardFeeCreated_ShardFeeCreated.fetch_to(cs, data.x);
+}
+
+bool ShardFees::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_HashmapAugE_96_ShardFeeCreated_ShardFeeCreated.fetch_to(cs, x);
+}
+
+bool ShardFees::cell_unpack(Ref<vm::Cell> cell_ref, ShardFees::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ShardFees::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, x) && cs.empty_ext();
+}
+
+bool ShardFees::pack(vm::CellBuilder& cb, const ShardFees::Record& data) const {
+  return t_HashmapAugE_96_ShardFeeCreated_ShardFeeCreated.store_from(cb, data.x);
+}
+
+bool ShardFees::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_HashmapAugE_96_ShardFeeCreated_ShardFeeCreated.store_from(cb, x);
+}
+
+bool ShardFees::cell_pack(Ref<vm::Cell>& cell_ref, const ShardFees::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardFees::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ShardFees::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field()
+      && t_HashmapAugE_96_ShardFeeCreated_ShardFeeCreated.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ShardFees t_ShardFees;
+
+//
+// code for type `ConfigParams`
+//
+
+int ConfigParams::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool ConfigParams::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.advance(256)
+      && t_Hashmap_32_Ref_Cell.validate_skip_ref(cs, weak);
+}
+
+bool ConfigParams::unpack(vm::CellSlice& cs, ConfigParams::Record& data) const {
+  return cs.fetch_bits_to(data.config_addr.bits(), 256)
+      && cs.fetch_ref_to(data.config);
+}
+
+bool ConfigParams::unpack_cons1(vm::CellSlice& cs, td::BitArray<256>& config_addr, Ref<Cell>& config) const {
+  return cs.fetch_bits_to(config_addr.bits(), 256)
+      && cs.fetch_ref_to(config);
+}
+
+bool ConfigParams::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParams::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParams::cell_unpack_cons1(Ref<vm::Cell> cell_ref, td::BitArray<256>& config_addr, Ref<Cell>& config) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, config_addr, config) && cs.empty_ext();
+}
+
+bool ConfigParams::pack(vm::CellBuilder& cb, const ConfigParams::Record& data) const {
+  return cb.store_bits_bool(data.config_addr.cbits(), 256)
+      && cb.store_ref_bool(data.config);
+}
+
+bool ConfigParams::pack_cons1(vm::CellBuilder& cb, td::BitArray<256> config_addr, Ref<Cell> config) const {
+  return cb.store_bits_bool(config_addr.cbits(), 256)
+      && cb.store_ref_bool(config);
+}
+
+bool ConfigParams::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParams::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParams::cell_pack_cons1(Ref<vm::Cell>& cell_ref, td::BitArray<256> config_addr, Ref<Cell> config) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, config_addr, std::move(config)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParams::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.fetch_bits_field(cs, 256, "config_addr")
+      && pp.field("config")
+      && t_Hashmap_32_Ref_Cell.print_ref(pp, cs.fetch_ref())
+      && pp.close();
+}
+
+const ConfigParams t_ConfigParams;
+
+//
+// code for type `ValidatorInfo`
+//
+
+int ValidatorInfo::check_tag(const vm::CellSlice& cs) const {
+  return validator_info;
+}
+
+bool ValidatorInfo::unpack(vm::CellSlice& cs, ValidatorInfo::Record& data) const {
+  return cs.fetch_uint_to(32, data.validator_list_hash_short)
+      && cs.fetch_uint_to(32, data.catchain_seqno)
+      && cs.fetch_bool_to(data.nx_cc_updated);
+}
+
+bool ValidatorInfo::unpack_validator_info(vm::CellSlice& cs, unsigned& validator_list_hash_short, unsigned& catchain_seqno, bool& nx_cc_updated) const {
+  return cs.fetch_uint_to(32, validator_list_hash_short)
+      && cs.fetch_uint_to(32, catchain_seqno)
+      && cs.fetch_bool_to(nx_cc_updated);
+}
+
+bool ValidatorInfo::cell_unpack(Ref<vm::Cell> cell_ref, ValidatorInfo::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ValidatorInfo::cell_unpack_validator_info(Ref<vm::Cell> cell_ref, unsigned& validator_list_hash_short, unsigned& catchain_seqno, bool& nx_cc_updated) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_validator_info(cs, validator_list_hash_short, catchain_seqno, nx_cc_updated) && cs.empty_ext();
+}
+
+bool ValidatorInfo::pack(vm::CellBuilder& cb, const ValidatorInfo::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.validator_list_hash_short, 32)
+      && cb.store_ulong_rchk_bool(data.catchain_seqno, 32)
+      && cb.store_ulong_rchk_bool(data.nx_cc_updated, 1);
+}
+
+bool ValidatorInfo::pack_validator_info(vm::CellBuilder& cb, unsigned validator_list_hash_short, unsigned catchain_seqno, bool nx_cc_updated) const {
+  return cb.store_ulong_rchk_bool(validator_list_hash_short, 32)
+      && cb.store_ulong_rchk_bool(catchain_seqno, 32)
+      && cb.store_ulong_rchk_bool(nx_cc_updated, 1);
+}
+
+bool ValidatorInfo::cell_pack(Ref<vm::Cell>& cell_ref, const ValidatorInfo::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValidatorInfo::cell_pack_validator_info(Ref<vm::Cell>& cell_ref, unsigned validator_list_hash_short, unsigned catchain_seqno, bool nx_cc_updated) const {
+  vm::CellBuilder cb;
+  return pack_validator_info(cb, validator_list_hash_short, catchain_seqno, nx_cc_updated) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValidatorInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("validator_info")
+      && pp.fetch_uint_field(cs, 32, "validator_list_hash_short")
+      && pp.fetch_uint_field(cs, 32, "catchain_seqno")
+      && pp.fetch_uint_field(cs, 1, "nx_cc_updated")
+      && pp.close();
+}
+
+const ValidatorInfo t_ValidatorInfo;
+
+//
+// code for type `ValidatorBaseInfo`
+//
+
+int ValidatorBaseInfo::check_tag(const vm::CellSlice& cs) const {
+  return validator_base_info;
+}
+
+bool ValidatorBaseInfo::unpack(vm::CellSlice& cs, ValidatorBaseInfo::Record& data) const {
+  return cs.fetch_uint_to(32, data.validator_list_hash_short)
+      && cs.fetch_uint_to(32, data.catchain_seqno);
+}
+
+bool ValidatorBaseInfo::unpack_validator_base_info(vm::CellSlice& cs, unsigned& validator_list_hash_short, unsigned& catchain_seqno) const {
+  return cs.fetch_uint_to(32, validator_list_hash_short)
+      && cs.fetch_uint_to(32, catchain_seqno);
+}
+
+bool ValidatorBaseInfo::cell_unpack(Ref<vm::Cell> cell_ref, ValidatorBaseInfo::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ValidatorBaseInfo::cell_unpack_validator_base_info(Ref<vm::Cell> cell_ref, unsigned& validator_list_hash_short, unsigned& catchain_seqno) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_validator_base_info(cs, validator_list_hash_short, catchain_seqno) && cs.empty_ext();
+}
+
+bool ValidatorBaseInfo::pack(vm::CellBuilder& cb, const ValidatorBaseInfo::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.validator_list_hash_short, 32)
+      && cb.store_ulong_rchk_bool(data.catchain_seqno, 32);
+}
+
+bool ValidatorBaseInfo::pack_validator_base_info(vm::CellBuilder& cb, unsigned validator_list_hash_short, unsigned catchain_seqno) const {
+  return cb.store_ulong_rchk_bool(validator_list_hash_short, 32)
+      && cb.store_ulong_rchk_bool(catchain_seqno, 32);
+}
+
+bool ValidatorBaseInfo::cell_pack(Ref<vm::Cell>& cell_ref, const ValidatorBaseInfo::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValidatorBaseInfo::cell_pack_validator_base_info(Ref<vm::Cell>& cell_ref, unsigned validator_list_hash_short, unsigned catchain_seqno) const {
+  vm::CellBuilder cb;
+  return pack_validator_base_info(cb, validator_list_hash_short, catchain_seqno) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValidatorBaseInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("validator_base_info")
+      && pp.fetch_uint_field(cs, 32, "validator_list_hash_short")
+      && pp.fetch_uint_field(cs, 32, "catchain_seqno")
+      && pp.close();
+}
+
+const ValidatorBaseInfo t_ValidatorBaseInfo;
+
+//
+// code for type `KeyMaxLt`
+//
+
+int KeyMaxLt::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool KeyMaxLt::unpack(vm::CellSlice& cs, KeyMaxLt::Record& data) const {
+  return cs.fetch_bool_to(data.key)
+      && cs.fetch_uint_to(64, data.max_end_lt);
+}
+
+bool KeyMaxLt::unpack_cons1(vm::CellSlice& cs, bool& key, unsigned long long& max_end_lt) const {
+  return cs.fetch_bool_to(key)
+      && cs.fetch_uint_to(64, max_end_lt);
+}
+
+bool KeyMaxLt::cell_unpack(Ref<vm::Cell> cell_ref, KeyMaxLt::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool KeyMaxLt::cell_unpack_cons1(Ref<vm::Cell> cell_ref, bool& key, unsigned long long& max_end_lt) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, key, max_end_lt) && cs.empty_ext();
+}
+
+bool KeyMaxLt::pack(vm::CellBuilder& cb, const KeyMaxLt::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.key, 1)
+      && cb.store_ulong_rchk_bool(data.max_end_lt, 64);
+}
+
+bool KeyMaxLt::pack_cons1(vm::CellBuilder& cb, bool key, unsigned long long max_end_lt) const {
+  return cb.store_ulong_rchk_bool(key, 1)
+      && cb.store_ulong_rchk_bool(max_end_lt, 64);
+}
+
+bool KeyMaxLt::cell_pack(Ref<vm::Cell>& cell_ref, const KeyMaxLt::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool KeyMaxLt::cell_pack_cons1(Ref<vm::Cell>& cell_ref, bool key, unsigned long long max_end_lt) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, key, max_end_lt) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool KeyMaxLt::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.fetch_uint_field(cs, 1, "key")
+      && pp.fetch_uint_field(cs, 64, "max_end_lt")
+      && pp.close();
+}
+
+const KeyMaxLt t_KeyMaxLt;
+
+//
+// code for type `KeyExtBlkRef`
+//
+
+int KeyExtBlkRef::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool KeyExtBlkRef::unpack(vm::CellSlice& cs, KeyExtBlkRef::Record& data) const {
+  return cs.fetch_bool_to(data.key)
+      && cs.fetch_subslice_to(608, data.blk_ref);
+}
+
+bool KeyExtBlkRef::unpack_cons1(vm::CellSlice& cs, bool& key, Ref<CellSlice>& blk_ref) const {
+  return cs.fetch_bool_to(key)
+      && cs.fetch_subslice_to(608, blk_ref);
+}
+
+bool KeyExtBlkRef::cell_unpack(Ref<vm::Cell> cell_ref, KeyExtBlkRef::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool KeyExtBlkRef::cell_unpack_cons1(Ref<vm::Cell> cell_ref, bool& key, Ref<CellSlice>& blk_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, key, blk_ref) && cs.empty_ext();
+}
+
+bool KeyExtBlkRef::pack(vm::CellBuilder& cb, const KeyExtBlkRef::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.key, 1)
+      && cb.append_cellslice_chk(data.blk_ref, 608);
+}
+
+bool KeyExtBlkRef::pack_cons1(vm::CellBuilder& cb, bool key, Ref<CellSlice> blk_ref) const {
+  return cb.store_ulong_rchk_bool(key, 1)
+      && cb.append_cellslice_chk(blk_ref, 608);
+}
+
+bool KeyExtBlkRef::cell_pack(Ref<vm::Cell>& cell_ref, const KeyExtBlkRef::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool KeyExtBlkRef::cell_pack_cons1(Ref<vm::Cell>& cell_ref, bool key, Ref<CellSlice> blk_ref) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, key, std::move(blk_ref)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool KeyExtBlkRef::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.fetch_uint_field(cs, 1, "key")
+      && pp.field("blk_ref")
+      && t_ExtBlkRef.print_skip(pp, cs)
+      && pp.close();
+}
+
+const KeyExtBlkRef t_KeyExtBlkRef;
+
+//
+// code for type `OldMcBlocksInfo`
+//
+
+int OldMcBlocksInfo::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool OldMcBlocksInfo::skip(vm::CellSlice& cs) const {
+  return t_HashmapAugE_32_KeyExtBlkRef_KeyMaxLt.skip(cs);
+}
+
+bool OldMcBlocksInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_HashmapAugE_32_KeyExtBlkRef_KeyMaxLt.validate_skip(cs, weak);
+}
+
+bool OldMcBlocksInfo::unpack(vm::CellSlice& cs, OldMcBlocksInfo::Record& data) const {
+  return t_HashmapAugE_32_KeyExtBlkRef_KeyMaxLt.fetch_to(cs, data.x);
+}
+
+bool OldMcBlocksInfo::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_HashmapAugE_32_KeyExtBlkRef_KeyMaxLt.fetch_to(cs, x);
+}
+
+bool OldMcBlocksInfo::cell_unpack(Ref<vm::Cell> cell_ref, OldMcBlocksInfo::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool OldMcBlocksInfo::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, x) && cs.empty_ext();
+}
+
+bool OldMcBlocksInfo::pack(vm::CellBuilder& cb, const OldMcBlocksInfo::Record& data) const {
+  return t_HashmapAugE_32_KeyExtBlkRef_KeyMaxLt.store_from(cb, data.x);
+}
+
+bool OldMcBlocksInfo::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_HashmapAugE_32_KeyExtBlkRef_KeyMaxLt.store_from(cb, x);
+}
+
+bool OldMcBlocksInfo::cell_pack(Ref<vm::Cell>& cell_ref, const OldMcBlocksInfo::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OldMcBlocksInfo::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool OldMcBlocksInfo::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field()
+      && t_HashmapAugE_32_KeyExtBlkRef_KeyMaxLt.print_skip(pp, cs)
+      && pp.close();
+}
+
+const OldMcBlocksInfo t_OldMcBlocksInfo;
+
+//
+// code for type `Counters`
+//
+
+int Counters::check_tag(const vm::CellSlice& cs) const {
+  return counters;
+}
+
+bool Counters::unpack(vm::CellSlice& cs, Counters::Record& data) const {
+  return cs.fetch_uint_to(32, data.last_updated)
+      && cs.fetch_uint_to(64, data.total)
+      && cs.fetch_uint_to(64, data.cnt2048)
+      && cs.fetch_uint_to(64, data.cnt65536);
+}
+
+bool Counters::cell_unpack(Ref<vm::Cell> cell_ref, Counters::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Counters::pack(vm::CellBuilder& cb, const Counters::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.last_updated, 32)
+      && cb.store_ulong_rchk_bool(data.total, 64)
+      && cb.store_ulong_rchk_bool(data.cnt2048, 64)
+      && cb.store_ulong_rchk_bool(data.cnt65536, 64);
+}
+
+bool Counters::cell_pack(Ref<vm::Cell>& cell_ref, const Counters::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Counters::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("counters")
+      && pp.fetch_uint_field(cs, 32, "last_updated")
+      && pp.fetch_uint_field(cs, 64, "total")
+      && pp.fetch_uint_field(cs, 64, "cnt2048")
+      && pp.fetch_uint_field(cs, 64, "cnt65536")
+      && pp.close();
+}
+
+const Counters t_Counters;
+
+//
+// code for type `CreatorStats`
+//
+constexpr unsigned char CreatorStats::cons_tag[1];
+
+int CreatorStats::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(4) == 4 ? creator_info : -1;
+}
+
+bool CreatorStats::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(4) == 4
+      && cs.advance(448);
+}
+
+bool CreatorStats::unpack(vm::CellSlice& cs, CreatorStats::Record& data) const {
+  return cs.fetch_ulong(4) == 4
+      && cs.fetch_subslice_to(224, data.mc_blocks)
+      && cs.fetch_subslice_to(224, data.shard_blocks);
+}
+
+bool CreatorStats::unpack_creator_info(vm::CellSlice& cs, Ref<CellSlice>& mc_blocks, Ref<CellSlice>& shard_blocks) const {
+  return cs.fetch_ulong(4) == 4
+      && cs.fetch_subslice_to(224, mc_blocks)
+      && cs.fetch_subslice_to(224, shard_blocks);
+}
+
+bool CreatorStats::cell_unpack(Ref<vm::Cell> cell_ref, CreatorStats::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool CreatorStats::cell_unpack_creator_info(Ref<vm::Cell> cell_ref, Ref<CellSlice>& mc_blocks, Ref<CellSlice>& shard_blocks) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_creator_info(cs, mc_blocks, shard_blocks) && cs.empty_ext();
+}
+
+bool CreatorStats::pack(vm::CellBuilder& cb, const CreatorStats::Record& data) const {
+  return cb.store_long_bool(4, 4)
+      && cb.append_cellslice_chk(data.mc_blocks, 224)
+      && cb.append_cellslice_chk(data.shard_blocks, 224);
+}
+
+bool CreatorStats::pack_creator_info(vm::CellBuilder& cb, Ref<CellSlice> mc_blocks, Ref<CellSlice> shard_blocks) const {
+  return cb.store_long_bool(4, 4)
+      && cb.append_cellslice_chk(mc_blocks, 224)
+      && cb.append_cellslice_chk(shard_blocks, 224);
+}
+
+bool CreatorStats::cell_pack(Ref<vm::Cell>& cell_ref, const CreatorStats::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CreatorStats::cell_pack_creator_info(Ref<vm::Cell>& cell_ref, Ref<CellSlice> mc_blocks, Ref<CellSlice> shard_blocks) const {
+  vm::CellBuilder cb;
+  return pack_creator_info(cb, std::move(mc_blocks), std::move(shard_blocks)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CreatorStats::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(4) == 4
+      && pp.open("creator_info")
+      && pp.field("mc_blocks")
+      && t_Counters.print_skip(pp, cs)
+      && pp.field("shard_blocks")
+      && t_Counters.print_skip(pp, cs)
+      && pp.close();
+}
+
+const CreatorStats t_CreatorStats;
+
+//
+// code for type `BlockCreateStats`
+//
+constexpr unsigned char BlockCreateStats::cons_tag[1];
+
+int BlockCreateStats::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 23 ? block_create_stats : -1;
+}
+
+bool BlockCreateStats::skip(vm::CellSlice& cs) const {
+  return cs.advance(8)
+      && t_HashmapE_256_CreatorStats.skip(cs);
+}
+
+bool BlockCreateStats::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(8) == 23
+      && t_HashmapE_256_CreatorStats.validate_skip(cs, weak);
+}
+
+bool BlockCreateStats::unpack(vm::CellSlice& cs, BlockCreateStats::Record& data) const {
+  return cs.fetch_ulong(8) == 23
+      && t_HashmapE_256_CreatorStats.fetch_to(cs, data.counters);
+}
+
+bool BlockCreateStats::unpack_block_create_stats(vm::CellSlice& cs, Ref<CellSlice>& counters) const {
+  return cs.fetch_ulong(8) == 23
+      && t_HashmapE_256_CreatorStats.fetch_to(cs, counters);
+}
+
+bool BlockCreateStats::cell_unpack(Ref<vm::Cell> cell_ref, BlockCreateStats::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BlockCreateStats::cell_unpack_block_create_stats(Ref<vm::Cell> cell_ref, Ref<CellSlice>& counters) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_block_create_stats(cs, counters) && cs.empty_ext();
+}
+
+bool BlockCreateStats::pack(vm::CellBuilder& cb, const BlockCreateStats::Record& data) const {
+  return cb.store_long_bool(23, 8)
+      && t_HashmapE_256_CreatorStats.store_from(cb, data.counters);
+}
+
+bool BlockCreateStats::pack_block_create_stats(vm::CellBuilder& cb, Ref<CellSlice> counters) const {
+  return cb.store_long_bool(23, 8)
+      && t_HashmapE_256_CreatorStats.store_from(cb, counters);
+}
+
+bool BlockCreateStats::cell_pack(Ref<vm::Cell>& cell_ref, const BlockCreateStats::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockCreateStats::cell_pack_block_create_stats(Ref<vm::Cell>& cell_ref, Ref<CellSlice> counters) const {
+  vm::CellBuilder cb;
+  return pack_block_create_stats(cb, std::move(counters)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockCreateStats::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(8) == 23
+      && pp.open("block_create_stats")
+      && pp.field("counters")
+      && t_HashmapE_256_CreatorStats.print_skip(pp, cs)
+      && pp.close();
+}
+
+const BlockCreateStats t_BlockCreateStats;
+
+//
+// code for auxiliary type `McStateExtra_aux`
+//
+
+int McStateExtra_aux::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool McStateExtra_aux::skip(vm::CellSlice& cs) const {
+  int flags;
+  return cs.fetch_uint_to(16, flags)
+      && flags <= 1
+      && cs.advance(65)
+      && t_OldMcBlocksInfo.skip(cs)
+      && cs.advance(1)
+      && t_Maybe_ExtBlkRef.skip(cs)
+      && (!(flags & 1) || t_BlockCreateStats.skip(cs));
+}
+
+bool McStateExtra_aux::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int flags;
+  return cs.fetch_uint_to(16, flags)
+      && flags <= 1
+      && cs.advance(65)
+      && t_OldMcBlocksInfo.validate_skip(cs, weak)
+      && cs.advance(1)
+      && t_Maybe_ExtBlkRef.validate_skip(cs, weak)
+      && (!(flags & 1) || t_BlockCreateStats.validate_skip(cs, weak));
+}
+
+bool McStateExtra_aux::unpack(vm::CellSlice& cs, McStateExtra_aux::Record& data) const {
+  return cs.fetch_uint_to(16, data.flags)
+      && data.flags <= 1
+      && cs.fetch_subslice_to(65, data.validator_info)
+      && t_OldMcBlocksInfo.fetch_to(cs, data.prev_blocks)
+      && cs.fetch_bool_to(data.after_key_block)
+      && t_Maybe_ExtBlkRef.fetch_to(cs, data.last_key_block)
+      && (!(data.flags & 1) || t_BlockCreateStats.fetch_to(cs, data.block_create_stats));
+}
+
+bool McStateExtra_aux::cell_unpack(Ref<vm::Cell> cell_ref, McStateExtra_aux::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool McStateExtra_aux::pack(vm::CellBuilder& cb, const McStateExtra_aux::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.flags, 16)
+      && data.flags <= 1
+      && cb.append_cellslice_chk(data.validator_info, 65)
+      && t_OldMcBlocksInfo.store_from(cb, data.prev_blocks)
+      && cb.store_ulong_rchk_bool(data.after_key_block, 1)
+      && t_Maybe_ExtBlkRef.store_from(cb, data.last_key_block)
+      && (!(data.flags & 1) || t_BlockCreateStats.store_from(cb, data.block_create_stats));
+}
+
+bool McStateExtra_aux::cell_pack(Ref<vm::Cell>& cell_ref, const McStateExtra_aux::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool McStateExtra_aux::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int flags;
+  return pp.open()
+      && cs.fetch_uint_to(16, flags)
+      && pp.field_int(flags, "flags")
+      && flags <= 1
+      && pp.field("validator_info")
+      && t_ValidatorInfo.print_skip(pp, cs)
+      && pp.field("prev_blocks")
+      && t_OldMcBlocksInfo.print_skip(pp, cs)
+      && pp.fetch_uint_field(cs, 1, "after_key_block")
+      && pp.field("last_key_block")
+      && t_Maybe_ExtBlkRef.print_skip(pp, cs)
+      && (!(flags & 1) || (pp.field("block_create_stats") && t_BlockCreateStats.print_skip(pp, cs)))
+      && pp.close();
+}
+
+const McStateExtra_aux t_McStateExtra_aux;
+
+//
+// code for type `McStateExtra`
+//
+constexpr unsigned short McStateExtra::cons_tag[1];
+
+int McStateExtra::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(16) == 0xcc26 ? masterchain_state_extra : -1;
+}
+
+bool McStateExtra::skip(vm::CellSlice& cs) const {
+  return cs.advance(16)
+      && t_ShardHashes.skip(cs)
+      && cs.advance_ext(0x20100)
+      && t_CurrencyCollection.skip(cs);
+}
+
+bool McStateExtra::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(16) == 0xcc26
+      && t_ShardHashes.validate_skip(cs, weak)
+      && t_ConfigParams.validate_skip(cs, weak)
+      && t_McStateExtra_aux.validate_skip_ref(cs, weak)
+      && t_CurrencyCollection.validate_skip(cs, weak);
+}
+
+bool McStateExtra::unpack(vm::CellSlice& cs, McStateExtra::Record& data) const {
+  return cs.fetch_ulong(16) == 0xcc26
+      && t_ShardHashes.fetch_to(cs, data.shard_hashes)
+      && cs.fetch_subslice_ext_to(0x10100, data.config)
+      && t_McStateExtra_aux.cell_unpack(cs.fetch_ref(), data.r1)
+      && t_CurrencyCollection.fetch_to(cs, data.global_balance);
+}
+
+bool McStateExtra::cell_unpack(Ref<vm::Cell> cell_ref, McStateExtra::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool McStateExtra::pack(vm::CellBuilder& cb, const McStateExtra::Record& data) const {
+  Ref<vm::Cell> tmp_cell;
+  return cb.store_long_bool(0xcc26, 16)
+      && t_ShardHashes.store_from(cb, data.shard_hashes)
+      && cb.append_cellslice_chk(data.config, 0x10100)
+      && t_McStateExtra_aux.cell_pack(tmp_cell, data.r1)
+      && cb.store_ref_bool(std::move(tmp_cell))
+      && t_CurrencyCollection.store_from(cb, data.global_balance);
+}
+
+bool McStateExtra::cell_pack(Ref<vm::Cell>& cell_ref, const McStateExtra::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool McStateExtra::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(16) == 0xcc26
+      && pp.open("masterchain_state_extra")
+      && pp.field("shard_hashes")
+      && t_ShardHashes.print_skip(pp, cs)
+      && pp.field("config")
+      && t_ConfigParams.print_skip(pp, cs)
+      && pp.field()
+      && t_McStateExtra_aux.print_ref(pp, cs.fetch_ref())
+      && pp.field("global_balance")
+      && t_CurrencyCollection.print_skip(pp, cs)
+      && pp.close();
+}
+
+const McStateExtra t_McStateExtra;
+
+//
+// code for type `SigPubKey`
+//
+constexpr unsigned SigPubKey::cons_tag[1];
+
+int SigPubKey::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(32) == 0x8e81278aU ? ed25519_pubkey : -1;
+}
+
+bool SigPubKey::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(32) == 0x8e81278aU
+      && cs.advance(256);
+}
+
+bool SigPubKey::unpack(vm::CellSlice& cs, SigPubKey::Record& data) const {
+  return cs.fetch_ulong(32) == 0x8e81278aU
+      && cs.fetch_bits_to(data.pubkey.bits(), 256);
+}
+
+bool SigPubKey::unpack_ed25519_pubkey(vm::CellSlice& cs, td::BitArray<256>& pubkey) const {
+  return cs.fetch_ulong(32) == 0x8e81278aU
+      && cs.fetch_bits_to(pubkey.bits(), 256);
+}
+
+bool SigPubKey::cell_unpack(Ref<vm::Cell> cell_ref, SigPubKey::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool SigPubKey::cell_unpack_ed25519_pubkey(Ref<vm::Cell> cell_ref, td::BitArray<256>& pubkey) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_ed25519_pubkey(cs, pubkey) && cs.empty_ext();
+}
+
+bool SigPubKey::pack(vm::CellBuilder& cb, const SigPubKey::Record& data) const {
+  return cb.store_long_bool(0x8e81278aU, 32)
+      && cb.store_bits_bool(data.pubkey.cbits(), 256);
+}
+
+bool SigPubKey::pack_ed25519_pubkey(vm::CellBuilder& cb, td::BitArray<256> pubkey) const {
+  return cb.store_long_bool(0x8e81278aU, 32)
+      && cb.store_bits_bool(pubkey.cbits(), 256);
+}
+
+bool SigPubKey::cell_pack(Ref<vm::Cell>& cell_ref, const SigPubKey::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool SigPubKey::cell_pack_ed25519_pubkey(Ref<vm::Cell>& cell_ref, td::BitArray<256> pubkey) const {
+  vm::CellBuilder cb;
+  return pack_ed25519_pubkey(cb, pubkey) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool SigPubKey::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(32) == 0x8e81278aU
+      && pp.open("ed25519_pubkey")
+      && pp.fetch_bits_field(cs, 256, "pubkey")
+      && pp.close();
+}
+
+const SigPubKey t_SigPubKey;
+
+//
+// code for type `CryptoSignatureSimple`
+//
+constexpr unsigned char CryptoSignatureSimple::cons_tag[1];
+
+int CryptoSignatureSimple::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(4) == 5 ? ed25519_signature : -1;
+}
+
+bool CryptoSignatureSimple::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(4) == 5
+      && cs.advance(512);
+}
+
+bool CryptoSignatureSimple::unpack(vm::CellSlice& cs, CryptoSignatureSimple::Record& data) const {
+  return cs.fetch_ulong(4) == 5
+      && cs.fetch_bits_to(data.R.bits(), 256)
+      && cs.fetch_bits_to(data.s.bits(), 256);
+}
+
+bool CryptoSignatureSimple::unpack_ed25519_signature(vm::CellSlice& cs, td::BitArray<256>& R, td::BitArray<256>& s) const {
+  return cs.fetch_ulong(4) == 5
+      && cs.fetch_bits_to(R.bits(), 256)
+      && cs.fetch_bits_to(s.bits(), 256);
+}
+
+bool CryptoSignatureSimple::cell_unpack(Ref<vm::Cell> cell_ref, CryptoSignatureSimple::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool CryptoSignatureSimple::cell_unpack_ed25519_signature(Ref<vm::Cell> cell_ref, td::BitArray<256>& R, td::BitArray<256>& s) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_ed25519_signature(cs, R, s) && cs.empty_ext();
+}
+
+bool CryptoSignatureSimple::pack(vm::CellBuilder& cb, const CryptoSignatureSimple::Record& data) const {
+  return cb.store_long_bool(5, 4)
+      && cb.store_bits_bool(data.R.cbits(), 256)
+      && cb.store_bits_bool(data.s.cbits(), 256);
+}
+
+bool CryptoSignatureSimple::pack_ed25519_signature(vm::CellBuilder& cb, td::BitArray<256> R, td::BitArray<256> s) const {
+  return cb.store_long_bool(5, 4)
+      && cb.store_bits_bool(R.cbits(), 256)
+      && cb.store_bits_bool(s.cbits(), 256);
+}
+
+bool CryptoSignatureSimple::cell_pack(Ref<vm::Cell>& cell_ref, const CryptoSignatureSimple::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CryptoSignatureSimple::cell_pack_ed25519_signature(Ref<vm::Cell>& cell_ref, td::BitArray<256> R, td::BitArray<256> s) const {
+  vm::CellBuilder cb;
+  return pack_ed25519_signature(cb, R, s) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CryptoSignatureSimple::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(4) == 5
+      && pp.open("ed25519_signature")
+      && pp.fetch_bits_field(cs, 256, "R")
+      && pp.fetch_bits_field(cs, 256, "s")
+      && pp.close();
+}
+
+const CryptoSignatureSimple t_CryptoSignatureSimple;
+
+//
+// code for type `CryptoSignaturePair`
+//
+
+int CryptoSignaturePair::check_tag(const vm::CellSlice& cs) const {
+  return sig_pair;
+}
+
+bool CryptoSignaturePair::skip(vm::CellSlice& cs) const {
+  return cs.advance(256)
+      && t_CryptoSignature.skip(cs);
+}
+
+bool CryptoSignaturePair::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.advance(256)
+      && t_CryptoSignature.validate_skip(cs, weak);
+}
+
+bool CryptoSignaturePair::unpack(vm::CellSlice& cs, CryptoSignaturePair::Record& data) const {
+  return cs.fetch_bits_to(data.node_id_short.bits(), 256)
+      && t_CryptoSignature.fetch_to(cs, data.sign);
+}
+
+bool CryptoSignaturePair::unpack_sig_pair(vm::CellSlice& cs, td::BitArray<256>& node_id_short, Ref<CellSlice>& sign) const {
+  return cs.fetch_bits_to(node_id_short.bits(), 256)
+      && t_CryptoSignature.fetch_to(cs, sign);
+}
+
+bool CryptoSignaturePair::cell_unpack(Ref<vm::Cell> cell_ref, CryptoSignaturePair::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool CryptoSignaturePair::cell_unpack_sig_pair(Ref<vm::Cell> cell_ref, td::BitArray<256>& node_id_short, Ref<CellSlice>& sign) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_sig_pair(cs, node_id_short, sign) && cs.empty_ext();
+}
+
+bool CryptoSignaturePair::pack(vm::CellBuilder& cb, const CryptoSignaturePair::Record& data) const {
+  return cb.store_bits_bool(data.node_id_short.cbits(), 256)
+      && t_CryptoSignature.store_from(cb, data.sign);
+}
+
+bool CryptoSignaturePair::pack_sig_pair(vm::CellBuilder& cb, td::BitArray<256> node_id_short, Ref<CellSlice> sign) const {
+  return cb.store_bits_bool(node_id_short.cbits(), 256)
+      && t_CryptoSignature.store_from(cb, sign);
+}
+
+bool CryptoSignaturePair::cell_pack(Ref<vm::Cell>& cell_ref, const CryptoSignaturePair::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CryptoSignaturePair::cell_pack_sig_pair(Ref<vm::Cell>& cell_ref, td::BitArray<256> node_id_short, Ref<CellSlice> sign) const {
+  vm::CellBuilder cb;
+  return pack_sig_pair(cb, node_id_short, std::move(sign)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CryptoSignaturePair::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("sig_pair")
+      && pp.fetch_bits_field(cs, 256, "node_id_short")
+      && pp.field("sign")
+      && t_CryptoSignature.print_skip(pp, cs)
+      && pp.close();
+}
+
+const CryptoSignaturePair t_CryptoSignaturePair;
+
+//
+// code for type `Certificate`
+//
+constexpr unsigned char Certificate::cons_tag[1];
+
+int Certificate::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(4) == 4 ? certificate : -1;
+}
+
+bool Certificate::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(4) == 4
+      && t_SigPubKey.validate_skip(cs, weak)
+      && cs.advance(64);
+}
+
+bool Certificate::unpack(vm::CellSlice& cs, Certificate::Record& data) const {
+  return cs.fetch_ulong(4) == 4
+      && cs.fetch_subslice_to(288, data.temp_key)
+      && cs.fetch_uint_to(32, data.valid_since)
+      && cs.fetch_uint_to(32, data.valid_until);
+}
+
+bool Certificate::unpack_certificate(vm::CellSlice& cs, Ref<CellSlice>& temp_key, unsigned& valid_since, unsigned& valid_until) const {
+  return cs.fetch_ulong(4) == 4
+      && cs.fetch_subslice_to(288, temp_key)
+      && cs.fetch_uint_to(32, valid_since)
+      && cs.fetch_uint_to(32, valid_until);
+}
+
+bool Certificate::cell_unpack(Ref<vm::Cell> cell_ref, Certificate::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool Certificate::cell_unpack_certificate(Ref<vm::Cell> cell_ref, Ref<CellSlice>& temp_key, unsigned& valid_since, unsigned& valid_until) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_certificate(cs, temp_key, valid_since, valid_until) && cs.empty_ext();
+}
+
+bool Certificate::pack(vm::CellBuilder& cb, const Certificate::Record& data) const {
+  return cb.store_long_bool(4, 4)
+      && cb.append_cellslice_chk(data.temp_key, 288)
+      && cb.store_ulong_rchk_bool(data.valid_since, 32)
+      && cb.store_ulong_rchk_bool(data.valid_until, 32);
+}
+
+bool Certificate::pack_certificate(vm::CellBuilder& cb, Ref<CellSlice> temp_key, unsigned valid_since, unsigned valid_until) const {
+  return cb.store_long_bool(4, 4)
+      && cb.append_cellslice_chk(temp_key, 288)
+      && cb.store_ulong_rchk_bool(valid_since, 32)
+      && cb.store_ulong_rchk_bool(valid_until, 32);
+}
+
+bool Certificate::cell_pack(Ref<vm::Cell>& cell_ref, const Certificate::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Certificate::cell_pack_certificate(Ref<vm::Cell>& cell_ref, Ref<CellSlice> temp_key, unsigned valid_since, unsigned valid_until) const {
+  vm::CellBuilder cb;
+  return pack_certificate(cb, std::move(temp_key), valid_since, valid_until) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool Certificate::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(4) == 4
+      && pp.open("certificate")
+      && pp.field("temp_key")
+      && t_SigPubKey.print_skip(pp, cs)
+      && pp.fetch_uint_field(cs, 32, "valid_since")
+      && pp.fetch_uint_field(cs, 32, "valid_until")
+      && pp.close();
+}
+
+const Certificate t_Certificate;
+
+//
+// code for type `CertificateEnv`
+//
+constexpr unsigned CertificateEnv::cons_tag[1];
+
+int CertificateEnv::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(28) == 0xa419b7d ? certificate_env : -1;
+}
+
+bool CertificateEnv::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(28) == 0xa419b7d
+      && t_Certificate.validate_skip(cs, weak);
+}
+
+bool CertificateEnv::unpack(vm::CellSlice& cs, CertificateEnv::Record& data) const {
+  return cs.fetch_ulong(28) == 0xa419b7d
+      && cs.fetch_subslice_to(356, data.certificate);
+}
+
+bool CertificateEnv::unpack_certificate_env(vm::CellSlice& cs, Ref<CellSlice>& certificate) const {
+  return cs.fetch_ulong(28) == 0xa419b7d
+      && cs.fetch_subslice_to(356, certificate);
+}
+
+bool CertificateEnv::cell_unpack(Ref<vm::Cell> cell_ref, CertificateEnv::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool CertificateEnv::cell_unpack_certificate_env(Ref<vm::Cell> cell_ref, Ref<CellSlice>& certificate) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_certificate_env(cs, certificate) && cs.empty_ext();
+}
+
+bool CertificateEnv::pack(vm::CellBuilder& cb, const CertificateEnv::Record& data) const {
+  return cb.store_long_bool(0xa419b7d, 28)
+      && cb.append_cellslice_chk(data.certificate, 356);
+}
+
+bool CertificateEnv::pack_certificate_env(vm::CellBuilder& cb, Ref<CellSlice> certificate) const {
+  return cb.store_long_bool(0xa419b7d, 28)
+      && cb.append_cellslice_chk(certificate, 356);
+}
+
+bool CertificateEnv::cell_pack(Ref<vm::Cell>& cell_ref, const CertificateEnv::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CertificateEnv::cell_pack_certificate_env(Ref<vm::Cell>& cell_ref, Ref<CellSlice> certificate) const {
+  vm::CellBuilder cb;
+  return pack_certificate_env(cb, std::move(certificate)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CertificateEnv::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(28) == 0xa419b7d
+      && pp.open("certificate_env")
+      && pp.field("certificate")
+      && t_Certificate.print_skip(pp, cs)
+      && pp.close();
+}
+
+const CertificateEnv t_CertificateEnv;
+
+//
+// code for type `SignedCertificate`
+//
+
+int SignedCertificate::check_tag(const vm::CellSlice& cs) const {
+  return signed_certificate;
+}
+
+bool SignedCertificate::skip(vm::CellSlice& cs) const {
+  return cs.advance(356)
+      && t_CryptoSignature.skip(cs);
+}
+
+bool SignedCertificate::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_Certificate.validate_skip(cs, weak)
+      && t_CryptoSignature.validate_skip(cs, weak);
+}
+
+bool SignedCertificate::unpack(vm::CellSlice& cs, SignedCertificate::Record& data) const {
+  return cs.fetch_subslice_to(356, data.certificate)
+      && t_CryptoSignature.fetch_to(cs, data.certificate_signature);
+}
+
+bool SignedCertificate::unpack_signed_certificate(vm::CellSlice& cs, Ref<CellSlice>& certificate, Ref<CellSlice>& certificate_signature) const {
+  return cs.fetch_subslice_to(356, certificate)
+      && t_CryptoSignature.fetch_to(cs, certificate_signature);
+}
+
+bool SignedCertificate::cell_unpack(Ref<vm::Cell> cell_ref, SignedCertificate::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool SignedCertificate::cell_unpack_signed_certificate(Ref<vm::Cell> cell_ref, Ref<CellSlice>& certificate, Ref<CellSlice>& certificate_signature) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_signed_certificate(cs, certificate, certificate_signature) && cs.empty_ext();
+}
+
+bool SignedCertificate::pack(vm::CellBuilder& cb, const SignedCertificate::Record& data) const {
+  return cb.append_cellslice_chk(data.certificate, 356)
+      && t_CryptoSignature.store_from(cb, data.certificate_signature);
+}
+
+bool SignedCertificate::pack_signed_certificate(vm::CellBuilder& cb, Ref<CellSlice> certificate, Ref<CellSlice> certificate_signature) const {
+  return cb.append_cellslice_chk(certificate, 356)
+      && t_CryptoSignature.store_from(cb, certificate_signature);
+}
+
+bool SignedCertificate::cell_pack(Ref<vm::Cell>& cell_ref, const SignedCertificate::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool SignedCertificate::cell_pack_signed_certificate(Ref<vm::Cell>& cell_ref, Ref<CellSlice> certificate, Ref<CellSlice> certificate_signature) const {
+  vm::CellBuilder cb;
+  return pack_signed_certificate(cb, std::move(certificate), std::move(certificate_signature)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool SignedCertificate::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("signed_certificate")
+      && pp.field("certificate")
+      && t_Certificate.print_skip(pp, cs)
+      && pp.field("certificate_signature")
+      && t_CryptoSignature.print_skip(pp, cs)
+      && pp.close();
+}
+
+const SignedCertificate t_SignedCertificate;
+
+//
+// code for type `CryptoSignature`
+//
+constexpr char CryptoSignature::cons_len[2];
+constexpr unsigned char CryptoSignature::cons_tag[2];
+
+int CryptoSignature::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cons1:
+    return cons1;
+  case chained_signature:
+    return cs.prefetch_ulong(4) == 15 ? chained_signature : -1;
+  }
+  return -1;
+}
+
+bool CryptoSignature::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cons1:
+    return cs.advance(516);
+  case chained_signature:
+    return cs.advance_ext(0x10208);
+  }
+  return false;
+}
+
+bool CryptoSignature::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case cons1:
+    return t_CryptoSignatureSimple.validate_skip(cs, weak);
+  case chained_signature:
+    return cs.fetch_ulong(4) == 15
+        && t_SignedCertificate.validate_skip_ref(cs, weak)
+        && t_CryptoSignatureSimple.validate_skip(cs, weak);
+  }
+  return false;
+}
+
+bool CryptoSignature::unpack(vm::CellSlice& cs, CryptoSignature::Record_cons1& data) const {
+  return cs.fetch_subslice_to(516, data.x);
+}
+
+bool CryptoSignature::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return cs.fetch_subslice_to(516, x);
+}
+
+bool CryptoSignature::cell_unpack(Ref<vm::Cell> cell_ref, CryptoSignature::Record_cons1& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool CryptoSignature::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, x) && cs.empty_ext();
+}
+
+bool CryptoSignature::unpack(vm::CellSlice& cs, CryptoSignature::Record_chained_signature& data) const {
+  return cs.fetch_ulong(4) == 15
+      && cs.fetch_ref_to(data.signed_cert)
+      && cs.fetch_subslice_to(516, data.temp_key_signature);
+}
+
+bool CryptoSignature::unpack_chained_signature(vm::CellSlice& cs, Ref<Cell>& signed_cert, Ref<CellSlice>& temp_key_signature) const {
+  return cs.fetch_ulong(4) == 15
+      && cs.fetch_ref_to(signed_cert)
+      && cs.fetch_subslice_to(516, temp_key_signature);
+}
+
+bool CryptoSignature::cell_unpack(Ref<vm::Cell> cell_ref, CryptoSignature::Record_chained_signature& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool CryptoSignature::cell_unpack_chained_signature(Ref<vm::Cell> cell_ref, Ref<Cell>& signed_cert, Ref<CellSlice>& temp_key_signature) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_chained_signature(cs, signed_cert, temp_key_signature) && cs.empty_ext();
+}
+
+bool CryptoSignature::pack(vm::CellBuilder& cb, const CryptoSignature::Record_cons1& data) const {
+  return cb.append_cellslice_chk(data.x, 516);
+}
+
+bool CryptoSignature::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return cb.append_cellslice_chk(x, 516);
+}
+
+bool CryptoSignature::cell_pack(Ref<vm::Cell>& cell_ref, const CryptoSignature::Record_cons1& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CryptoSignature::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CryptoSignature::pack(vm::CellBuilder& cb, const CryptoSignature::Record_chained_signature& data) const {
+  return cb.store_long_bool(15, 4)
+      && cb.store_ref_bool(data.signed_cert)
+      && cb.append_cellslice_chk(data.temp_key_signature, 516);
+}
+
+bool CryptoSignature::pack_chained_signature(vm::CellBuilder& cb, Ref<Cell> signed_cert, Ref<CellSlice> temp_key_signature) const {
+  return cb.store_long_bool(15, 4)
+      && cb.store_ref_bool(signed_cert)
+      && cb.append_cellslice_chk(temp_key_signature, 516);
+}
+
+bool CryptoSignature::cell_pack(Ref<vm::Cell>& cell_ref, const CryptoSignature::Record_chained_signature& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CryptoSignature::cell_pack_chained_signature(Ref<vm::Cell>& cell_ref, Ref<Cell> signed_cert, Ref<CellSlice> temp_key_signature) const {
+  vm::CellBuilder cb;
+  return pack_chained_signature(cb, std::move(signed_cert), std::move(temp_key_signature)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CryptoSignature::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cons1:
+    return pp.open()
+        && pp.field()
+        && t_CryptoSignatureSimple.print_skip(pp, cs)
+        && pp.close();
+  case chained_signature:
+    return cs.fetch_ulong(4) == 15
+        && pp.open("chained_signature")
+        && pp.field("signed_cert")
+        && t_SignedCertificate.print_ref(pp, cs.fetch_ref())
+        && pp.field("temp_key_signature")
+        && t_CryptoSignatureSimple.print_skip(pp, cs)
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for CryptoSignature");
+}
+
+const CryptoSignature t_CryptoSignature;
+
+//
+// code for auxiliary type `McBlockExtra_aux`
+//
+
+int McBlockExtra_aux::check_tag(const vm::CellSlice& cs) const {
+  return cons1;
+}
+
+bool McBlockExtra_aux::skip(vm::CellSlice& cs) const {
+  return t_HashmapE_16_CryptoSignaturePair.skip(cs)
+      && t_Maybe_Ref_InMsg.skip(cs)
+      && t_Maybe_Ref_InMsg.skip(cs);
+}
+
+bool McBlockExtra_aux::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_HashmapE_16_CryptoSignaturePair.validate_skip(cs, weak)
+      && t_Maybe_Ref_InMsg.validate_skip(cs, weak)
+      && t_Maybe_Ref_InMsg.validate_skip(cs, weak);
+}
+
+bool McBlockExtra_aux::unpack(vm::CellSlice& cs, McBlockExtra_aux::Record& data) const {
+  return t_HashmapE_16_CryptoSignaturePair.fetch_to(cs, data.prev_blk_signatures)
+      && t_Maybe_Ref_InMsg.fetch_to(cs, data.recover_create_msg)
+      && t_Maybe_Ref_InMsg.fetch_to(cs, data.mint_msg);
+}
+
+bool McBlockExtra_aux::unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& prev_blk_signatures, Ref<CellSlice>& recover_create_msg, Ref<CellSlice>& mint_msg) const {
+  return t_HashmapE_16_CryptoSignaturePair.fetch_to(cs, prev_blk_signatures)
+      && t_Maybe_Ref_InMsg.fetch_to(cs, recover_create_msg)
+      && t_Maybe_Ref_InMsg.fetch_to(cs, mint_msg);
+}
+
+bool McBlockExtra_aux::cell_unpack(Ref<vm::Cell> cell_ref, McBlockExtra_aux::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool McBlockExtra_aux::cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& prev_blk_signatures, Ref<CellSlice>& recover_create_msg, Ref<CellSlice>& mint_msg) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, prev_blk_signatures, recover_create_msg, mint_msg) && cs.empty_ext();
+}
+
+bool McBlockExtra_aux::pack(vm::CellBuilder& cb, const McBlockExtra_aux::Record& data) const {
+  return t_HashmapE_16_CryptoSignaturePair.store_from(cb, data.prev_blk_signatures)
+      && t_Maybe_Ref_InMsg.store_from(cb, data.recover_create_msg)
+      && t_Maybe_Ref_InMsg.store_from(cb, data.mint_msg);
+}
+
+bool McBlockExtra_aux::pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> prev_blk_signatures, Ref<CellSlice> recover_create_msg, Ref<CellSlice> mint_msg) const {
+  return t_HashmapE_16_CryptoSignaturePair.store_from(cb, prev_blk_signatures)
+      && t_Maybe_Ref_InMsg.store_from(cb, recover_create_msg)
+      && t_Maybe_Ref_InMsg.store_from(cb, mint_msg);
+}
+
+bool McBlockExtra_aux::cell_pack(Ref<vm::Cell>& cell_ref, const McBlockExtra_aux::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool McBlockExtra_aux::cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> prev_blk_signatures, Ref<CellSlice> recover_create_msg, Ref<CellSlice> mint_msg) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, std::move(prev_blk_signatures), std::move(recover_create_msg), std::move(mint_msg)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool McBlockExtra_aux::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open()
+      && pp.field("prev_blk_signatures")
+      && t_HashmapE_16_CryptoSignaturePair.print_skip(pp, cs)
+      && pp.field("recover_create_msg")
+      && t_Maybe_Ref_InMsg.print_skip(pp, cs)
+      && pp.field("mint_msg")
+      && t_Maybe_Ref_InMsg.print_skip(pp, cs)
+      && pp.close();
+}
+
+const McBlockExtra_aux t_McBlockExtra_aux;
+
+//
+// code for type `McBlockExtra`
+//
+constexpr unsigned short McBlockExtra::cons_tag[1];
+
+int McBlockExtra::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(16) == 0xcca5 ? masterchain_block_extra : -1;
+}
+
+bool McBlockExtra::skip(vm::CellSlice& cs) const {
+  int key_block;
+  return cs.advance(16)
+      && cs.fetch_bool_to(key_block)
+      && t_ShardHashes.skip(cs)
+      && t_ShardFees.skip(cs)
+      && cs.advance_refs(1)
+      && (!key_block || t_ConfigParams.skip(cs));
+}
+
+bool McBlockExtra::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int key_block;
+  return cs.fetch_ulong(16) == 0xcca5
+      && cs.fetch_bool_to(key_block)
+      && t_ShardHashes.validate_skip(cs, weak)
+      && t_ShardFees.validate_skip(cs, weak)
+      && t_McBlockExtra_aux.validate_skip_ref(cs, weak)
+      && (!key_block || t_ConfigParams.validate_skip(cs, weak));
+}
+
+bool McBlockExtra::unpack(vm::CellSlice& cs, McBlockExtra::Record& data) const {
+  return cs.fetch_ulong(16) == 0xcca5
+      && cs.fetch_bool_to(data.key_block)
+      && t_ShardHashes.fetch_to(cs, data.shard_hashes)
+      && t_ShardFees.fetch_to(cs, data.shard_fees)
+      && t_McBlockExtra_aux.cell_unpack(cs.fetch_ref(), data.r1)
+      && (!data.key_block || t_ConfigParams.fetch_to(cs, data.config));
+}
+
+bool McBlockExtra::cell_unpack(Ref<vm::Cell> cell_ref, McBlockExtra::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool McBlockExtra::pack(vm::CellBuilder& cb, const McBlockExtra::Record& data) const {
+  Ref<vm::Cell> tmp_cell;
+  return cb.store_long_bool(0xcca5, 16)
+      && cb.store_ulong_rchk_bool(data.key_block, 1)
+      && t_ShardHashes.store_from(cb, data.shard_hashes)
+      && t_ShardFees.store_from(cb, data.shard_fees)
+      && t_McBlockExtra_aux.cell_pack(tmp_cell, data.r1)
+      && cb.store_ref_bool(std::move(tmp_cell))
+      && (!data.key_block || t_ConfigParams.store_from(cb, data.config));
+}
+
+bool McBlockExtra::cell_pack(Ref<vm::Cell>& cell_ref, const McBlockExtra::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool McBlockExtra::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int key_block;
+  return cs.fetch_ulong(16) == 0xcca5
+      && pp.open("masterchain_block_extra")
+      && cs.fetch_bool_to(key_block)
+      && pp.field_int(key_block, "key_block")
+      && pp.field("shard_hashes")
+      && t_ShardHashes.print_skip(pp, cs)
+      && pp.field("shard_fees")
+      && t_ShardFees.print_skip(pp, cs)
+      && pp.field()
+      && t_McBlockExtra_aux.print_ref(pp, cs.fetch_ref())
+      && (!key_block || (pp.field("config") && t_ConfigParams.print_skip(pp, cs)))
+      && pp.close();
+}
+
+const McBlockExtra t_McBlockExtra;
+
+//
+// code for type `ValidatorDescr`
+//
+constexpr unsigned char ValidatorDescr::cons_tag[2];
+
+int ValidatorDescr::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case validator:
+    return cs.prefetch_ulong(8) == 0x53 ? validator : -1;
+  case validator_addr:
+    return cs.prefetch_ulong(8) == 0x73 ? validator_addr : -1;
+  }
+  return -1;
+}
+
+bool ValidatorDescr::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case validator:
+    return cs.advance(360);
+  case validator_addr:
+    return cs.advance(616);
+  }
+  return false;
+}
+
+bool ValidatorDescr::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case validator:
+    return cs.fetch_ulong(8) == 0x53
+        && t_SigPubKey.validate_skip(cs, weak)
+        && cs.advance(64);
+  case validator_addr:
+    return cs.fetch_ulong(8) == 0x73
+        && t_SigPubKey.validate_skip(cs, weak)
+        && cs.advance(320);
+  }
+  return false;
+}
+
+bool ValidatorDescr::unpack(vm::CellSlice& cs, ValidatorDescr::Record_validator& data) const {
+  return cs.fetch_ulong(8) == 0x53
+      && cs.fetch_subslice_to(288, data.public_key)
+      && cs.fetch_uint_to(64, data.weight);
+}
+
+bool ValidatorDescr::unpack_validator(vm::CellSlice& cs, Ref<CellSlice>& public_key, unsigned long long& weight) const {
+  return cs.fetch_ulong(8) == 0x53
+      && cs.fetch_subslice_to(288, public_key)
+      && cs.fetch_uint_to(64, weight);
+}
+
+bool ValidatorDescr::cell_unpack(Ref<vm::Cell> cell_ref, ValidatorDescr::Record_validator& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ValidatorDescr::cell_unpack_validator(Ref<vm::Cell> cell_ref, Ref<CellSlice>& public_key, unsigned long long& weight) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_validator(cs, public_key, weight) && cs.empty_ext();
+}
+
+bool ValidatorDescr::unpack(vm::CellSlice& cs, ValidatorDescr::Record_validator_addr& data) const {
+  return cs.fetch_ulong(8) == 0x73
+      && cs.fetch_subslice_to(288, data.public_key)
+      && cs.fetch_uint_to(64, data.weight)
+      && cs.fetch_bits_to(data.adnl_addr.bits(), 256);
+}
+
+bool ValidatorDescr::unpack_validator_addr(vm::CellSlice& cs, Ref<CellSlice>& public_key, unsigned long long& weight, td::BitArray<256>& adnl_addr) const {
+  return cs.fetch_ulong(8) == 0x73
+      && cs.fetch_subslice_to(288, public_key)
+      && cs.fetch_uint_to(64, weight)
+      && cs.fetch_bits_to(adnl_addr.bits(), 256);
+}
+
+bool ValidatorDescr::cell_unpack(Ref<vm::Cell> cell_ref, ValidatorDescr::Record_validator_addr& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ValidatorDescr::cell_unpack_validator_addr(Ref<vm::Cell> cell_ref, Ref<CellSlice>& public_key, unsigned long long& weight, td::BitArray<256>& adnl_addr) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_validator_addr(cs, public_key, weight, adnl_addr) && cs.empty_ext();
+}
+
+bool ValidatorDescr::pack(vm::CellBuilder& cb, const ValidatorDescr::Record_validator& data) const {
+  return cb.store_long_bool(0x53, 8)
+      && cb.append_cellslice_chk(data.public_key, 288)
+      && cb.store_ulong_rchk_bool(data.weight, 64);
+}
+
+bool ValidatorDescr::pack_validator(vm::CellBuilder& cb, Ref<CellSlice> public_key, unsigned long long weight) const {
+  return cb.store_long_bool(0x53, 8)
+      && cb.append_cellslice_chk(public_key, 288)
+      && cb.store_ulong_rchk_bool(weight, 64);
+}
+
+bool ValidatorDescr::cell_pack(Ref<vm::Cell>& cell_ref, const ValidatorDescr::Record_validator& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValidatorDescr::cell_pack_validator(Ref<vm::Cell>& cell_ref, Ref<CellSlice> public_key, unsigned long long weight) const {
+  vm::CellBuilder cb;
+  return pack_validator(cb, std::move(public_key), weight) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValidatorDescr::pack(vm::CellBuilder& cb, const ValidatorDescr::Record_validator_addr& data) const {
+  return cb.store_long_bool(0x73, 8)
+      && cb.append_cellslice_chk(data.public_key, 288)
+      && cb.store_ulong_rchk_bool(data.weight, 64)
+      && cb.store_bits_bool(data.adnl_addr.cbits(), 256);
+}
+
+bool ValidatorDescr::pack_validator_addr(vm::CellBuilder& cb, Ref<CellSlice> public_key, unsigned long long weight, td::BitArray<256> adnl_addr) const {
+  return cb.store_long_bool(0x73, 8)
+      && cb.append_cellslice_chk(public_key, 288)
+      && cb.store_ulong_rchk_bool(weight, 64)
+      && cb.store_bits_bool(adnl_addr.cbits(), 256);
+}
+
+bool ValidatorDescr::cell_pack(Ref<vm::Cell>& cell_ref, const ValidatorDescr::Record_validator_addr& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValidatorDescr::cell_pack_validator_addr(Ref<vm::Cell>& cell_ref, Ref<CellSlice> public_key, unsigned long long weight, td::BitArray<256> adnl_addr) const {
+  vm::CellBuilder cb;
+  return pack_validator_addr(cb, std::move(public_key), weight, adnl_addr) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValidatorDescr::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case validator:
+    return cs.fetch_ulong(8) == 0x53
+        && pp.open("validator")
+        && pp.field("public_key")
+        && t_SigPubKey.print_skip(pp, cs)
+        && pp.fetch_uint_field(cs, 64, "weight")
+        && pp.close();
+  case validator_addr:
+    return cs.fetch_ulong(8) == 0x73
+        && pp.open("validator_addr")
+        && pp.field("public_key")
+        && t_SigPubKey.print_skip(pp, cs)
+        && pp.fetch_uint_field(cs, 64, "weight")
+        && pp.fetch_bits_field(cs, 256, "adnl_addr")
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for ValidatorDescr");
+}
+
+const ValidatorDescr t_ValidatorDescr;
+
+//
+// code for type `ValidatorSet`
+//
+constexpr unsigned char ValidatorSet::cons_tag[1];
+
+int ValidatorSet::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 17 ? validators : -1;
+}
+
+bool ValidatorSet::skip(vm::CellSlice& cs) const {
+  int total, main;
+  return cs.advance(72)
+      && cs.fetch_uint_to(16, total)
+      && cs.fetch_uint_to(16, main)
+      && main <= total
+      && 1 <= main
+      && t_Hashmap_16_ValidatorDescr.skip(cs);
+}
+
+bool ValidatorSet::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int total, main;
+  return cs.fetch_ulong(8) == 17
+      && cs.advance(64)
+      && cs.fetch_uint_to(16, total)
+      && cs.fetch_uint_to(16, main)
+      && main <= total
+      && 1 <= main
+      && t_Hashmap_16_ValidatorDescr.validate_skip(cs, weak);
+}
+
+bool ValidatorSet::unpack(vm::CellSlice& cs, ValidatorSet::Record& data) const {
+  return cs.fetch_ulong(8) == 17
+      && cs.fetch_uint_to(32, data.utime_since)
+      && cs.fetch_uint_to(32, data.utime_until)
+      && cs.fetch_uint_to(16, data.total)
+      && cs.fetch_uint_to(16, data.main)
+      && data.main <= data.total
+      && 1 <= data.main
+      && t_Hashmap_16_ValidatorDescr.fetch_to(cs, data.list);
+}
+
+bool ValidatorSet::cell_unpack(Ref<vm::Cell> cell_ref, ValidatorSet::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ValidatorSet::pack(vm::CellBuilder& cb, const ValidatorSet::Record& data) const {
+  return cb.store_long_bool(17, 8)
+      && cb.store_ulong_rchk_bool(data.utime_since, 32)
+      && cb.store_ulong_rchk_bool(data.utime_until, 32)
+      && cb.store_ulong_rchk_bool(data.total, 16)
+      && cb.store_ulong_rchk_bool(data.main, 16)
+      && data.main <= data.total
+      && 1 <= data.main
+      && t_Hashmap_16_ValidatorDescr.store_from(cb, data.list);
+}
+
+bool ValidatorSet::cell_pack(Ref<vm::Cell>& cell_ref, const ValidatorSet::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValidatorSet::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int total, main;
+  return cs.fetch_ulong(8) == 17
+      && pp.open("validators")
+      && pp.fetch_uint_field(cs, 32, "utime_since")
+      && pp.fetch_uint_field(cs, 32, "utime_until")
+      && cs.fetch_uint_to(16, total)
+      && pp.field_int(total, "total")
+      && cs.fetch_uint_to(16, main)
+      && pp.field_int(main, "main")
+      && main <= total
+      && 1 <= main
+      && pp.field("list")
+      && t_Hashmap_16_ValidatorDescr.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ValidatorSet t_ValidatorSet;
+
+//
+// code for type `GlobalVersion`
+//
+constexpr unsigned char GlobalVersion::cons_tag[1];
+
+int GlobalVersion::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 0xc4 ? capabilities : -1;
+}
+
+bool GlobalVersion::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(8) == 0xc4
+      && cs.advance(96);
+}
+
+bool GlobalVersion::unpack(vm::CellSlice& cs, GlobalVersion::Record& data) const {
+  return cs.fetch_ulong(8) == 0xc4
+      && cs.fetch_uint_to(32, data.version)
+      && cs.fetch_uint_to(64, data.capabilities);
+}
+
+bool GlobalVersion::unpack_capabilities(vm::CellSlice& cs, unsigned& version, unsigned long long& capabilities) const {
+  return cs.fetch_ulong(8) == 0xc4
+      && cs.fetch_uint_to(32, version)
+      && cs.fetch_uint_to(64, capabilities);
+}
+
+bool GlobalVersion::cell_unpack(Ref<vm::Cell> cell_ref, GlobalVersion::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool GlobalVersion::cell_unpack_capabilities(Ref<vm::Cell> cell_ref, unsigned& version, unsigned long long& capabilities) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_capabilities(cs, version, capabilities) && cs.empty_ext();
+}
+
+bool GlobalVersion::pack(vm::CellBuilder& cb, const GlobalVersion::Record& data) const {
+  return cb.store_long_bool(0xc4, 8)
+      && cb.store_ulong_rchk_bool(data.version, 32)
+      && cb.store_ulong_rchk_bool(data.capabilities, 64);
+}
+
+bool GlobalVersion::pack_capabilities(vm::CellBuilder& cb, unsigned version, unsigned long long capabilities) const {
+  return cb.store_long_bool(0xc4, 8)
+      && cb.store_ulong_rchk_bool(version, 32)
+      && cb.store_ulong_rchk_bool(capabilities, 64);
+}
+
+bool GlobalVersion::cell_pack(Ref<vm::Cell>& cell_ref, const GlobalVersion::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool GlobalVersion::cell_pack_capabilities(Ref<vm::Cell>& cell_ref, unsigned version, unsigned long long capabilities) const {
+  vm::CellBuilder cb;
+  return pack_capabilities(cb, version, capabilities) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool GlobalVersion::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(8) == 0xc4
+      && pp.open("capabilities")
+      && pp.fetch_uint_field(cs, 32, "version")
+      && pp.fetch_uint_field(cs, 64, "capabilities")
+      && pp.close();
+}
+
+const GlobalVersion t_GlobalVersion;
+
+//
+// code for type `WorkchainFormat`
+//
+
+int WorkchainFormat::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case wfmt_basic:
+    return cs.prefetch_ulong(4) == 1 ? wfmt_basic : -1;
+  case wfmt_ext:
+    return cs.have(4) ? wfmt_ext : -1;
+  }
+  return -1;
+}
+
+bool WorkchainFormat::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case wfmt_basic:
+    return cs.advance(100)
+        && m_ == 1;
+  case wfmt_ext: {
+    int min_addr_len, max_addr_len, addr_len_step, workchain_type_id;
+    return cs.advance(4)
+        && cs.fetch_uint_to(12, min_addr_len)
+        && cs.fetch_uint_to(12, max_addr_len)
+        && cs.fetch_uint_to(12, addr_len_step)
+        && 64 <= min_addr_len
+        && min_addr_len <= max_addr_len
+        && max_addr_len <= 1023
+        && addr_len_step <= 1023
+        && cs.fetch_uint_to(32, workchain_type_id)
+        && 1 <= workchain_type_id
+        && m_ == 0;
+    }
+  }
+  return false;
+}
+
+bool WorkchainFormat::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case wfmt_basic:
+    return cs.fetch_ulong(4) == 1
+        && cs.advance(96)
+        && m_ == 1;
+  case wfmt_ext: {
+    int min_addr_len, max_addr_len, addr_len_step, workchain_type_id;
+    return cs.advance(4)
+        && cs.fetch_uint_to(12, min_addr_len)
+        && cs.fetch_uint_to(12, max_addr_len)
+        && cs.fetch_uint_to(12, addr_len_step)
+        && 64 <= min_addr_len
+        && min_addr_len <= max_addr_len
+        && max_addr_len <= 1023
+        && addr_len_step <= 1023
+        && cs.fetch_uint_to(32, workchain_type_id)
+        && 1 <= workchain_type_id
+        && m_ == 0;
+    }
+  }
+  return false;
+}
+
+bool WorkchainFormat::unpack(vm::CellSlice& cs, WorkchainFormat::Record_wfmt_basic& data) const {
+  return cs.fetch_ulong(4) == 1
+      && cs.fetch_int_to(32, data.vm_version)
+      && cs.fetch_uint_to(64, data.vm_mode)
+      && m_ == 1;
+}
+
+bool WorkchainFormat::unpack_wfmt_basic(vm::CellSlice& cs, int& vm_version, unsigned long long& vm_mode) const {
+  return cs.fetch_ulong(4) == 1
+      && cs.fetch_int_to(32, vm_version)
+      && cs.fetch_uint_to(64, vm_mode)
+      && m_ == 1;
+}
+
+bool WorkchainFormat::cell_unpack(Ref<vm::Cell> cell_ref, WorkchainFormat::Record_wfmt_basic& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool WorkchainFormat::cell_unpack_wfmt_basic(Ref<vm::Cell> cell_ref, int& vm_version, unsigned long long& vm_mode) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_wfmt_basic(cs, vm_version, vm_mode) && cs.empty_ext();
+}
+
+bool WorkchainFormat::unpack(vm::CellSlice& cs, WorkchainFormat::Record_wfmt_ext& data) const {
+  return cs.fetch_ulong(4) == 0
+      && cs.fetch_uint_to(12, data.min_addr_len)
+      && cs.fetch_uint_to(12, data.max_addr_len)
+      && cs.fetch_uint_to(12, data.addr_len_step)
+      && 64 <= data.min_addr_len
+      && data.min_addr_len <= data.max_addr_len
+      && data.max_addr_len <= 1023
+      && data.addr_len_step <= 1023
+      && cs.fetch_uint_to(32, data.workchain_type_id)
+      && 1 <= data.workchain_type_id
+      && m_ == 0;
+}
+
+bool WorkchainFormat::cell_unpack(Ref<vm::Cell> cell_ref, WorkchainFormat::Record_wfmt_ext& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool WorkchainFormat::pack(vm::CellBuilder& cb, const WorkchainFormat::Record_wfmt_basic& data) const {
+  return cb.store_long_bool(1, 4)
+      && cb.store_long_rchk_bool(data.vm_version, 32)
+      && cb.store_ulong_rchk_bool(data.vm_mode, 64)
+      && m_ == 1;
+}
+
+bool WorkchainFormat::pack_wfmt_basic(vm::CellBuilder& cb, int vm_version, unsigned long long vm_mode) const {
+  return cb.store_long_bool(1, 4)
+      && cb.store_long_rchk_bool(vm_version, 32)
+      && cb.store_ulong_rchk_bool(vm_mode, 64)
+      && m_ == 1;
+}
+
+bool WorkchainFormat::cell_pack(Ref<vm::Cell>& cell_ref, const WorkchainFormat::Record_wfmt_basic& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool WorkchainFormat::cell_pack_wfmt_basic(Ref<vm::Cell>& cell_ref, int vm_version, unsigned long long vm_mode) const {
+  vm::CellBuilder cb;
+  return pack_wfmt_basic(cb, vm_version, vm_mode) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool WorkchainFormat::pack(vm::CellBuilder& cb, const WorkchainFormat::Record_wfmt_ext& data) const {
+  return cb.store_long_bool(0, 4)
+      && cb.store_ulong_rchk_bool(data.min_addr_len, 12)
+      && cb.store_ulong_rchk_bool(data.max_addr_len, 12)
+      && cb.store_ulong_rchk_bool(data.addr_len_step, 12)
+      && 64 <= data.min_addr_len
+      && data.min_addr_len <= data.max_addr_len
+      && data.max_addr_len <= 1023
+      && data.addr_len_step <= 1023
+      && cb.store_ulong_rchk_bool(data.workchain_type_id, 32)
+      && 1 <= data.workchain_type_id
+      && m_ == 0;
+}
+
+bool WorkchainFormat::cell_pack(Ref<vm::Cell>& cell_ref, const WorkchainFormat::Record_wfmt_ext& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool WorkchainFormat::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case wfmt_basic:
+    return cs.fetch_ulong(4) == 1
+        && pp.open("wfmt_basic")
+        && pp.fetch_int_field(cs, 32, "vm_version")
+        && pp.fetch_uint_field(cs, 64, "vm_mode")
+        && m_ == 1
+        && pp.close();
+  case wfmt_ext: {
+    int min_addr_len, max_addr_len, addr_len_step, workchain_type_id;
+    return cs.advance(4)
+        && pp.open("wfmt_ext")
+        && cs.fetch_uint_to(12, min_addr_len)
+        && pp.field_int(min_addr_len, "min_addr_len")
+        && cs.fetch_uint_to(12, max_addr_len)
+        && pp.field_int(max_addr_len, "max_addr_len")
+        && cs.fetch_uint_to(12, addr_len_step)
+        && pp.field_int(addr_len_step, "addr_len_step")
+        && 64 <= min_addr_len
+        && min_addr_len <= max_addr_len
+        && max_addr_len <= 1023
+        && addr_len_step <= 1023
+        && cs.fetch_uint_to(32, workchain_type_id)
+        && pp.field_int(workchain_type_id, "workchain_type_id")
+        && 1 <= workchain_type_id
+        && m_ == 0
+        && pp.close();
+    }
+  }
+  return pp.fail("unknown constructor for WorkchainFormat");
+}
+
+
+//
+// code for type `WorkchainDescr`
+//
+constexpr unsigned char WorkchainDescr::cons_tag[1];
+
+int WorkchainDescr::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 0xa6 ? workchain : -1;
+}
+
+bool WorkchainDescr::skip(vm::CellSlice& cs) const {
+  int actual_min_split, min_split, basic, flags;
+  return cs.advance(40)
+      && cs.fetch_uint_to(8, actual_min_split)
+      && cs.fetch_uint_to(8, min_split)
+      && actual_min_split <= min_split
+      && cs.advance(8)
+      && cs.fetch_bool_to(basic)
+      && cs.advance(2)
+      && cs.fetch_uint_to(13, flags)
+      && flags == 0
+      && cs.advance(544)
+      && WorkchainFormat{basic}.skip(cs);
+}
+
+bool WorkchainDescr::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int actual_min_split, min_split, basic, flags;
+  return cs.fetch_ulong(8) == 0xa6
+      && cs.advance(32)
+      && cs.fetch_uint_to(8, actual_min_split)
+      && cs.fetch_uint_to(8, min_split)
+      && actual_min_split <= min_split
+      && cs.advance(8)
+      && cs.fetch_bool_to(basic)
+      && cs.advance(2)
+      && cs.fetch_uint_to(13, flags)
+      && flags == 0
+      && cs.advance(544)
+      && WorkchainFormat{basic}.validate_skip(cs, weak);
+}
+
+bool WorkchainDescr::unpack(vm::CellSlice& cs, WorkchainDescr::Record& data) const {
+  return cs.fetch_ulong(8) == 0xa6
+      && cs.fetch_uint_to(32, data.enabled_since)
+      && cs.fetch_uint_to(8, data.actual_min_split)
+      && cs.fetch_uint_to(8, data.min_split)
+      && cs.fetch_uint_to(8, data.max_split)
+      && data.actual_min_split <= data.min_split
+      && cs.fetch_bool_to(data.basic)
+      && cs.fetch_bool_to(data.active)
+      && cs.fetch_bool_to(data.accept_msgs)
+      && cs.fetch_uint_to(13, data.flags)
+      && data.flags == 0
+      && cs.fetch_bits_to(data.zerostate_root_hash.bits(), 256)
+      && cs.fetch_bits_to(data.zerostate_file_hash.bits(), 256)
+      && cs.fetch_uint_to(32, data.version)
+      && WorkchainFormat{data.basic}.fetch_to(cs, data.format);
+}
+
+bool WorkchainDescr::cell_unpack(Ref<vm::Cell> cell_ref, WorkchainDescr::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool WorkchainDescr::pack(vm::CellBuilder& cb, const WorkchainDescr::Record& data) const {
+  return cb.store_long_bool(0xa6, 8)
+      && cb.store_ulong_rchk_bool(data.enabled_since, 32)
+      && cb.store_ulong_rchk_bool(data.actual_min_split, 8)
+      && cb.store_ulong_rchk_bool(data.min_split, 8)
+      && cb.store_ulong_rchk_bool(data.max_split, 8)
+      && data.actual_min_split <= data.min_split
+      && cb.store_ulong_rchk_bool(data.basic, 1)
+      && cb.store_ulong_rchk_bool(data.active, 1)
+      && cb.store_ulong_rchk_bool(data.accept_msgs, 1)
+      && cb.store_ulong_rchk_bool(data.flags, 13)
+      && data.flags == 0
+      && cb.store_bits_bool(data.zerostate_root_hash.cbits(), 256)
+      && cb.store_bits_bool(data.zerostate_file_hash.cbits(), 256)
+      && cb.store_ulong_rchk_bool(data.version, 32)
+      && WorkchainFormat{data.basic}.store_from(cb, data.format);
+}
+
+bool WorkchainDescr::cell_pack(Ref<vm::Cell>& cell_ref, const WorkchainDescr::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool WorkchainDescr::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int actual_min_split, min_split, max_split, basic, flags;
+  return cs.fetch_ulong(8) == 0xa6
+      && pp.open("workchain")
+      && pp.fetch_uint_field(cs, 32, "enabled_since")
+      && cs.fetch_uint_to(8, actual_min_split)
+      && pp.field_int(actual_min_split, "actual_min_split")
+      && cs.fetch_uint_to(8, min_split)
+      && pp.field_int(min_split, "min_split")
+      && cs.fetch_uint_to(8, max_split)
+      && pp.field_int(max_split, "max_split")
+      && actual_min_split <= min_split
+      && cs.fetch_bool_to(basic)
+      && pp.field_int(basic, "basic")
+      && pp.fetch_uint_field(cs, 1, "active")
+      && pp.fetch_uint_field(cs, 1, "accept_msgs")
+      && cs.fetch_uint_to(13, flags)
+      && pp.field_int(flags, "flags")
+      && flags == 0
+      && pp.fetch_bits_field(cs, 256, "zerostate_root_hash")
+      && pp.fetch_bits_field(cs, 256, "zerostate_file_hash")
+      && pp.fetch_uint_field(cs, 32, "version")
+      && pp.field("format")
+      && WorkchainFormat{basic}.print_skip(pp, cs)
+      && pp.close();
+}
+
+const WorkchainDescr t_WorkchainDescr;
+
+//
+// code for type `BlockCreateFees`
+//
+constexpr unsigned char BlockCreateFees::cons_tag[1];
+
+int BlockCreateFees::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 0x6b ? block_grams_created : -1;
+}
+
+bool BlockCreateFees::skip(vm::CellSlice& cs) const {
+  return cs.advance(8)
+      && t_Grams.skip(cs)
+      && t_Grams.skip(cs);
+}
+
+bool BlockCreateFees::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(8) == 0x6b
+      && t_Grams.validate_skip(cs, weak)
+      && t_Grams.validate_skip(cs, weak);
+}
+
+bool BlockCreateFees::unpack(vm::CellSlice& cs, BlockCreateFees::Record& data) const {
+  return cs.fetch_ulong(8) == 0x6b
+      && t_Grams.fetch_to(cs, data.masterchain_block_fee)
+      && t_Grams.fetch_to(cs, data.basechain_block_fee);
+}
+
+bool BlockCreateFees::unpack_block_grams_created(vm::CellSlice& cs, Ref<CellSlice>& masterchain_block_fee, Ref<CellSlice>& basechain_block_fee) const {
+  return cs.fetch_ulong(8) == 0x6b
+      && t_Grams.fetch_to(cs, masterchain_block_fee)
+      && t_Grams.fetch_to(cs, basechain_block_fee);
+}
+
+bool BlockCreateFees::cell_unpack(Ref<vm::Cell> cell_ref, BlockCreateFees::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BlockCreateFees::cell_unpack_block_grams_created(Ref<vm::Cell> cell_ref, Ref<CellSlice>& masterchain_block_fee, Ref<CellSlice>& basechain_block_fee) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_block_grams_created(cs, masterchain_block_fee, basechain_block_fee) && cs.empty_ext();
+}
+
+bool BlockCreateFees::pack(vm::CellBuilder& cb, const BlockCreateFees::Record& data) const {
+  return cb.store_long_bool(0x6b, 8)
+      && t_Grams.store_from(cb, data.masterchain_block_fee)
+      && t_Grams.store_from(cb, data.basechain_block_fee);
+}
+
+bool BlockCreateFees::pack_block_grams_created(vm::CellBuilder& cb, Ref<CellSlice> masterchain_block_fee, Ref<CellSlice> basechain_block_fee) const {
+  return cb.store_long_bool(0x6b, 8)
+      && t_Grams.store_from(cb, masterchain_block_fee)
+      && t_Grams.store_from(cb, basechain_block_fee);
+}
+
+bool BlockCreateFees::cell_pack(Ref<vm::Cell>& cell_ref, const BlockCreateFees::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockCreateFees::cell_pack_block_grams_created(Ref<vm::Cell>& cell_ref, Ref<CellSlice> masterchain_block_fee, Ref<CellSlice> basechain_block_fee) const {
+  vm::CellBuilder cb;
+  return pack_block_grams_created(cb, std::move(masterchain_block_fee), std::move(basechain_block_fee)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockCreateFees::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(8) == 0x6b
+      && pp.open("block_grams_created")
+      && pp.field("masterchain_block_fee")
+      && t_Grams.print_skip(pp, cs)
+      && pp.field("basechain_block_fee")
+      && t_Grams.print_skip(pp, cs)
+      && pp.close();
+}
+
+const BlockCreateFees t_BlockCreateFees;
+
+//
+// code for type `StoragePrices`
+//
+constexpr unsigned char StoragePrices::cons_tag[1];
+
+int StoragePrices::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 0xcc ? cons1 : -1;
+}
+
+bool StoragePrices::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(8) == 0xcc
+      && cs.advance(288);
+}
+
+bool StoragePrices::unpack(vm::CellSlice& cs, StoragePrices::Record& data) const {
+  return cs.fetch_ulong(8) == 0xcc
+      && cs.fetch_uint_to(32, data.utime_since)
+      && cs.fetch_uint_to(64, data.bit_price_ps)
+      && cs.fetch_uint_to(64, data.cell_price_ps)
+      && cs.fetch_uint_to(64, data.mc_bit_price_ps)
+      && cs.fetch_uint_to(64, data.mc_cell_price_ps);
+}
+
+bool StoragePrices::cell_unpack(Ref<vm::Cell> cell_ref, StoragePrices::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool StoragePrices::pack(vm::CellBuilder& cb, const StoragePrices::Record& data) const {
+  return cb.store_long_bool(0xcc, 8)
+      && cb.store_ulong_rchk_bool(data.utime_since, 32)
+      && cb.store_ulong_rchk_bool(data.bit_price_ps, 64)
+      && cb.store_ulong_rchk_bool(data.cell_price_ps, 64)
+      && cb.store_ulong_rchk_bool(data.mc_bit_price_ps, 64)
+      && cb.store_ulong_rchk_bool(data.mc_cell_price_ps, 64);
+}
+
+bool StoragePrices::cell_pack(Ref<vm::Cell>& cell_ref, const StoragePrices::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool StoragePrices::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(8) == 0xcc
+      && pp.open()
+      && pp.fetch_uint_field(cs, 32, "utime_since")
+      && pp.fetch_uint_field(cs, 64, "bit_price_ps")
+      && pp.fetch_uint_field(cs, 64, "cell_price_ps")
+      && pp.fetch_uint_field(cs, 64, "mc_bit_price_ps")
+      && pp.fetch_uint_field(cs, 64, "mc_cell_price_ps")
+      && pp.close();
+}
+
+const StoragePrices t_StoragePrices;
+
+//
+// code for type `GasLimitsPrices`
+//
+constexpr unsigned char GasLimitsPrices::cons_tag[2];
+
+int GasLimitsPrices::get_tag(const vm::CellSlice& cs) const {
+  switch (cs.bselect(6, 0x180000000000000ULL)) {
+  case 0:
+    return cs.bit_at(6) ? gas_prices_ext : gas_prices;
+  default:
+    return -1;
+  }
+}
+
+int GasLimitsPrices::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case gas_prices:
+    return cs.prefetch_ulong(8) == 0xdd ? gas_prices : -1;
+  case gas_prices_ext:
+    return cs.prefetch_ulong(8) == 0xde ? gas_prices_ext : -1;
+  }
+  return -1;
+}
+
+bool GasLimitsPrices::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case gas_prices:
+    return cs.advance(392);
+  case gas_prices_ext:
+    return cs.advance(456);
+  }
+  return false;
+}
+
+bool GasLimitsPrices::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case gas_prices:
+    return cs.fetch_ulong(8) == 0xdd
+        && cs.advance(384);
+  case gas_prices_ext:
+    return cs.fetch_ulong(8) == 0xde
+        && cs.advance(448);
+  }
+  return false;
+}
+
+bool GasLimitsPrices::unpack(vm::CellSlice& cs, GasLimitsPrices::Record_gas_prices& data) const {
+  return cs.fetch_ulong(8) == 0xdd
+      && cs.fetch_uint_to(64, data.gas_price)
+      && cs.fetch_uint_to(64, data.gas_limit)
+      && cs.fetch_uint_to(64, data.gas_credit)
+      && cs.fetch_uint_to(64, data.block_gas_limit)
+      && cs.fetch_uint_to(64, data.freeze_due_limit)
+      && cs.fetch_uint_to(64, data.delete_due_limit);
+}
+
+bool GasLimitsPrices::cell_unpack(Ref<vm::Cell> cell_ref, GasLimitsPrices::Record_gas_prices& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool GasLimitsPrices::unpack(vm::CellSlice& cs, GasLimitsPrices::Record_gas_prices_ext& data) const {
+  return cs.fetch_ulong(8) == 0xde
+      && cs.fetch_uint_to(64, data.gas_price)
+      && cs.fetch_uint_to(64, data.gas_limit)
+      && cs.fetch_uint_to(64, data.special_gas_limit)
+      && cs.fetch_uint_to(64, data.gas_credit)
+      && cs.fetch_uint_to(64, data.block_gas_limit)
+      && cs.fetch_uint_to(64, data.freeze_due_limit)
+      && cs.fetch_uint_to(64, data.delete_due_limit);
+}
+
+bool GasLimitsPrices::cell_unpack(Ref<vm::Cell> cell_ref, GasLimitsPrices::Record_gas_prices_ext& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool GasLimitsPrices::pack(vm::CellBuilder& cb, const GasLimitsPrices::Record_gas_prices& data) const {
+  return cb.store_long_bool(0xdd, 8)
+      && cb.store_ulong_rchk_bool(data.gas_price, 64)
+      && cb.store_ulong_rchk_bool(data.gas_limit, 64)
+      && cb.store_ulong_rchk_bool(data.gas_credit, 64)
+      && cb.store_ulong_rchk_bool(data.block_gas_limit, 64)
+      && cb.store_ulong_rchk_bool(data.freeze_due_limit, 64)
+      && cb.store_ulong_rchk_bool(data.delete_due_limit, 64);
+}
+
+bool GasLimitsPrices::cell_pack(Ref<vm::Cell>& cell_ref, const GasLimitsPrices::Record_gas_prices& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool GasLimitsPrices::pack(vm::CellBuilder& cb, const GasLimitsPrices::Record_gas_prices_ext& data) const {
+  return cb.store_long_bool(0xde, 8)
+      && cb.store_ulong_rchk_bool(data.gas_price, 64)
+      && cb.store_ulong_rchk_bool(data.gas_limit, 64)
+      && cb.store_ulong_rchk_bool(data.special_gas_limit, 64)
+      && cb.store_ulong_rchk_bool(data.gas_credit, 64)
+      && cb.store_ulong_rchk_bool(data.block_gas_limit, 64)
+      && cb.store_ulong_rchk_bool(data.freeze_due_limit, 64)
+      && cb.store_ulong_rchk_bool(data.delete_due_limit, 64);
+}
+
+bool GasLimitsPrices::cell_pack(Ref<vm::Cell>& cell_ref, const GasLimitsPrices::Record_gas_prices_ext& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool GasLimitsPrices::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case gas_prices:
+    return cs.fetch_ulong(8) == 0xdd
+        && pp.open("gas_prices")
+        && pp.fetch_uint_field(cs, 64, "gas_price")
+        && pp.fetch_uint_field(cs, 64, "gas_limit")
+        && pp.fetch_uint_field(cs, 64, "gas_credit")
+        && pp.fetch_uint_field(cs, 64, "block_gas_limit")
+        && pp.fetch_uint_field(cs, 64, "freeze_due_limit")
+        && pp.fetch_uint_field(cs, 64, "delete_due_limit")
+        && pp.close();
+  case gas_prices_ext:
+    return cs.fetch_ulong(8) == 0xde
+        && pp.open("gas_prices_ext")
+        && pp.fetch_uint_field(cs, 64, "gas_price")
+        && pp.fetch_uint_field(cs, 64, "gas_limit")
+        && pp.fetch_uint_field(cs, 64, "special_gas_limit")
+        && pp.fetch_uint_field(cs, 64, "gas_credit")
+        && pp.fetch_uint_field(cs, 64, "block_gas_limit")
+        && pp.fetch_uint_field(cs, 64, "freeze_due_limit")
+        && pp.fetch_uint_field(cs, 64, "delete_due_limit")
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for GasLimitsPrices");
+}
+
+const GasLimitsPrices t_GasLimitsPrices;
+
+//
+// code for type `ParamLimits`
+//
+constexpr unsigned char ParamLimits::cons_tag[1];
+
+int ParamLimits::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 0xc3 ? param_limits : -1;
+}
+
+bool ParamLimits::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int underload, soft_limit, hard_limit;
+  return cs.fetch_ulong(8) == 0xc3
+      && cs.fetch_uint_to(32, underload)
+      && cs.fetch_uint_to(32, soft_limit)
+      && underload <= soft_limit
+      && cs.fetch_uint_to(32, hard_limit)
+      && soft_limit <= hard_limit;
+}
+
+bool ParamLimits::unpack(vm::CellSlice& cs, ParamLimits::Record& data) const {
+  return cs.fetch_ulong(8) == 0xc3
+      && cs.fetch_uint_to(32, data.underload)
+      && cs.fetch_uint_to(32, data.soft_limit)
+      && data.underload <= data.soft_limit
+      && cs.fetch_uint_to(32, data.hard_limit)
+      && data.soft_limit <= data.hard_limit;
+}
+
+bool ParamLimits::unpack_param_limits(vm::CellSlice& cs, int& underload, int& soft_limit, int& hard_limit) const {
+  return cs.fetch_ulong(8) == 0xc3
+      && cs.fetch_uint_to(32, underload)
+      && cs.fetch_uint_to(32, soft_limit)
+      && underload <= soft_limit
+      && cs.fetch_uint_to(32, hard_limit)
+      && soft_limit <= hard_limit;
+}
+
+bool ParamLimits::cell_unpack(Ref<vm::Cell> cell_ref, ParamLimits::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ParamLimits::cell_unpack_param_limits(Ref<vm::Cell> cell_ref, int& underload, int& soft_limit, int& hard_limit) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_param_limits(cs, underload, soft_limit, hard_limit) && cs.empty_ext();
+}
+
+bool ParamLimits::pack(vm::CellBuilder& cb, const ParamLimits::Record& data) const {
+  return cb.store_long_bool(0xc3, 8)
+      && cb.store_ulong_rchk_bool(data.underload, 32)
+      && cb.store_ulong_rchk_bool(data.soft_limit, 32)
+      && data.underload <= data.soft_limit
+      && cb.store_ulong_rchk_bool(data.hard_limit, 32)
+      && data.soft_limit <= data.hard_limit;
+}
+
+bool ParamLimits::pack_param_limits(vm::CellBuilder& cb, int underload, int soft_limit, int hard_limit) const {
+  return cb.store_long_bool(0xc3, 8)
+      && cb.store_ulong_rchk_bool(underload, 32)
+      && cb.store_ulong_rchk_bool(soft_limit, 32)
+      && underload <= soft_limit
+      && cb.store_ulong_rchk_bool(hard_limit, 32)
+      && soft_limit <= hard_limit;
+}
+
+bool ParamLimits::cell_pack(Ref<vm::Cell>& cell_ref, const ParamLimits::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ParamLimits::cell_pack_param_limits(Ref<vm::Cell>& cell_ref, int underload, int soft_limit, int hard_limit) const {
+  vm::CellBuilder cb;
+  return pack_param_limits(cb, underload, soft_limit, hard_limit) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ParamLimits::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int underload, soft_limit, hard_limit;
+  return cs.fetch_ulong(8) == 0xc3
+      && pp.open("param_limits")
+      && cs.fetch_uint_to(32, underload)
+      && pp.field_int(underload, "underload")
+      && cs.fetch_uint_to(32, soft_limit)
+      && pp.field_int(soft_limit, "soft_limit")
+      && underload <= soft_limit
+      && cs.fetch_uint_to(32, hard_limit)
+      && pp.field_int(hard_limit, "hard_limit")
+      && soft_limit <= hard_limit
+      && pp.close();
+}
+
+const ParamLimits t_ParamLimits;
+
+//
+// code for type `BlockLimits`
+//
+constexpr unsigned char BlockLimits::cons_tag[1];
+
+int BlockLimits::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 0x5d ? block_limits : -1;
+}
+
+bool BlockLimits::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(8) == 0x5d
+      && t_ParamLimits.validate_skip(cs, weak)
+      && t_ParamLimits.validate_skip(cs, weak)
+      && t_ParamLimits.validate_skip(cs, weak);
+}
+
+bool BlockLimits::unpack(vm::CellSlice& cs, BlockLimits::Record& data) const {
+  return cs.fetch_ulong(8) == 0x5d
+      && cs.fetch_subslice_to(104, data.bytes)
+      && cs.fetch_subslice_to(104, data.gas)
+      && cs.fetch_subslice_to(104, data.lt_delta);
+}
+
+bool BlockLimits::unpack_block_limits(vm::CellSlice& cs, Ref<CellSlice>& bytes, Ref<CellSlice>& gas, Ref<CellSlice>& lt_delta) const {
+  return cs.fetch_ulong(8) == 0x5d
+      && cs.fetch_subslice_to(104, bytes)
+      && cs.fetch_subslice_to(104, gas)
+      && cs.fetch_subslice_to(104, lt_delta);
+}
+
+bool BlockLimits::cell_unpack(Ref<vm::Cell> cell_ref, BlockLimits::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BlockLimits::cell_unpack_block_limits(Ref<vm::Cell> cell_ref, Ref<CellSlice>& bytes, Ref<CellSlice>& gas, Ref<CellSlice>& lt_delta) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_block_limits(cs, bytes, gas, lt_delta) && cs.empty_ext();
+}
+
+bool BlockLimits::pack(vm::CellBuilder& cb, const BlockLimits::Record& data) const {
+  return cb.store_long_bool(0x5d, 8)
+      && cb.append_cellslice_chk(data.bytes, 104)
+      && cb.append_cellslice_chk(data.gas, 104)
+      && cb.append_cellslice_chk(data.lt_delta, 104);
+}
+
+bool BlockLimits::pack_block_limits(vm::CellBuilder& cb, Ref<CellSlice> bytes, Ref<CellSlice> gas, Ref<CellSlice> lt_delta) const {
+  return cb.store_long_bool(0x5d, 8)
+      && cb.append_cellslice_chk(bytes, 104)
+      && cb.append_cellslice_chk(gas, 104)
+      && cb.append_cellslice_chk(lt_delta, 104);
+}
+
+bool BlockLimits::cell_pack(Ref<vm::Cell>& cell_ref, const BlockLimits::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockLimits::cell_pack_block_limits(Ref<vm::Cell>& cell_ref, Ref<CellSlice> bytes, Ref<CellSlice> gas, Ref<CellSlice> lt_delta) const {
+  vm::CellBuilder cb;
+  return pack_block_limits(cb, std::move(bytes), std::move(gas), std::move(lt_delta)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockLimits::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(8) == 0x5d
+      && pp.open("block_limits")
+      && pp.field("bytes")
+      && t_ParamLimits.print_skip(pp, cs)
+      && pp.field("gas")
+      && t_ParamLimits.print_skip(pp, cs)
+      && pp.field("lt_delta")
+      && t_ParamLimits.print_skip(pp, cs)
+      && pp.close();
+}
+
+const BlockLimits t_BlockLimits;
+
+//
+// code for type `MsgForwardPrices`
+//
+constexpr unsigned char MsgForwardPrices::cons_tag[1];
+
+int MsgForwardPrices::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 0xea ? msg_forward_prices : -1;
+}
+
+bool MsgForwardPrices::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(8) == 0xea
+      && cs.advance(256);
+}
+
+bool MsgForwardPrices::unpack(vm::CellSlice& cs, MsgForwardPrices::Record& data) const {
+  return cs.fetch_ulong(8) == 0xea
+      && cs.fetch_uint_to(64, data.lump_price)
+      && cs.fetch_uint_to(64, data.bit_price)
+      && cs.fetch_uint_to(64, data.cell_price)
+      && cs.fetch_uint_to(32, data.ihr_price_factor)
+      && cs.fetch_uint_to(16, data.first_frac)
+      && cs.fetch_uint_to(16, data.next_frac);
+}
+
+bool MsgForwardPrices::cell_unpack(Ref<vm::Cell> cell_ref, MsgForwardPrices::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool MsgForwardPrices::pack(vm::CellBuilder& cb, const MsgForwardPrices::Record& data) const {
+  return cb.store_long_bool(0xea, 8)
+      && cb.store_ulong_rchk_bool(data.lump_price, 64)
+      && cb.store_ulong_rchk_bool(data.bit_price, 64)
+      && cb.store_ulong_rchk_bool(data.cell_price, 64)
+      && cb.store_ulong_rchk_bool(data.ihr_price_factor, 32)
+      && cb.store_ulong_rchk_bool(data.first_frac, 16)
+      && cb.store_ulong_rchk_bool(data.next_frac, 16);
+}
+
+bool MsgForwardPrices::cell_pack(Ref<vm::Cell>& cell_ref, const MsgForwardPrices::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool MsgForwardPrices::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(8) == 0xea
+      && pp.open("msg_forward_prices")
+      && pp.fetch_uint_field(cs, 64, "lump_price")
+      && pp.fetch_uint_field(cs, 64, "bit_price")
+      && pp.fetch_uint_field(cs, 64, "cell_price")
+      && pp.fetch_uint_field(cs, 32, "ihr_price_factor")
+      && pp.fetch_uint_field(cs, 16, "first_frac")
+      && pp.fetch_uint_field(cs, 16, "next_frac")
+      && pp.close();
+}
+
+const MsgForwardPrices t_MsgForwardPrices;
+
+//
+// code for type `CatchainConfig`
+//
+constexpr unsigned char CatchainConfig::cons_tag[1];
+
+int CatchainConfig::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 0xc1 ? catchain_config : -1;
+}
+
+bool CatchainConfig::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(8) == 0xc1
+      && cs.advance(128);
+}
+
+bool CatchainConfig::unpack(vm::CellSlice& cs, CatchainConfig::Record& data) const {
+  return cs.fetch_ulong(8) == 0xc1
+      && cs.fetch_uint_to(32, data.mc_catchain_lifetime)
+      && cs.fetch_uint_to(32, data.shard_catchain_lifetime)
+      && cs.fetch_uint_to(32, data.shard_validators_lifetime)
+      && cs.fetch_uint_to(32, data.shard_validators_num);
+}
+
+bool CatchainConfig::cell_unpack(Ref<vm::Cell> cell_ref, CatchainConfig::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool CatchainConfig::pack(vm::CellBuilder& cb, const CatchainConfig::Record& data) const {
+  return cb.store_long_bool(0xc1, 8)
+      && cb.store_ulong_rchk_bool(data.mc_catchain_lifetime, 32)
+      && cb.store_ulong_rchk_bool(data.shard_catchain_lifetime, 32)
+      && cb.store_ulong_rchk_bool(data.shard_validators_lifetime, 32)
+      && cb.store_ulong_rchk_bool(data.shard_validators_num, 32);
+}
+
+bool CatchainConfig::cell_pack(Ref<vm::Cell>& cell_ref, const CatchainConfig::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool CatchainConfig::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(8) == 0xc1
+      && pp.open("catchain_config")
+      && pp.fetch_uint_field(cs, 32, "mc_catchain_lifetime")
+      && pp.fetch_uint_field(cs, 32, "shard_catchain_lifetime")
+      && pp.fetch_uint_field(cs, 32, "shard_validators_lifetime")
+      && pp.fetch_uint_field(cs, 32, "shard_validators_num")
+      && pp.close();
+}
+
+const CatchainConfig t_CatchainConfig;
+
+//
+// code for type `ConsensusConfig`
+//
+constexpr unsigned char ConsensusConfig::cons_tag[1];
+
+int ConsensusConfig::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 0xd6 ? consensus_config : -1;
+}
+
+bool ConsensusConfig::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int round_candidates;
+  return cs.fetch_ulong(8) == 0xd6
+      && cs.fetch_uint_to(32, round_candidates)
+      && 1 <= round_candidates
+      && cs.advance(224);
+}
+
+bool ConsensusConfig::unpack(vm::CellSlice& cs, ConsensusConfig::Record& data) const {
+  return cs.fetch_ulong(8) == 0xd6
+      && cs.fetch_uint_to(32, data.round_candidates)
+      && 1 <= data.round_candidates
+      && cs.fetch_uint_to(32, data.next_candidate_delay_ms)
+      && cs.fetch_uint_to(32, data.consensus_timeout_ms)
+      && cs.fetch_uint_to(32, data.fast_attempts)
+      && cs.fetch_uint_to(32, data.attempt_duration)
+      && cs.fetch_uint_to(32, data.catchain_max_deps)
+      && cs.fetch_uint_to(32, data.max_block_bytes)
+      && cs.fetch_uint_to(32, data.max_collated_bytes);
+}
+
+bool ConsensusConfig::cell_unpack(Ref<vm::Cell> cell_ref, ConsensusConfig::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConsensusConfig::pack(vm::CellBuilder& cb, const ConsensusConfig::Record& data) const {
+  return cb.store_long_bool(0xd6, 8)
+      && cb.store_ulong_rchk_bool(data.round_candidates, 32)
+      && 1 <= data.round_candidates
+      && cb.store_ulong_rchk_bool(data.next_candidate_delay_ms, 32)
+      && cb.store_ulong_rchk_bool(data.consensus_timeout_ms, 32)
+      && cb.store_ulong_rchk_bool(data.fast_attempts, 32)
+      && cb.store_ulong_rchk_bool(data.attempt_duration, 32)
+      && cb.store_ulong_rchk_bool(data.catchain_max_deps, 32)
+      && cb.store_ulong_rchk_bool(data.max_block_bytes, 32)
+      && cb.store_ulong_rchk_bool(data.max_collated_bytes, 32);
+}
+
+bool ConsensusConfig::cell_pack(Ref<vm::Cell>& cell_ref, const ConsensusConfig::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConsensusConfig::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int round_candidates;
+  return cs.fetch_ulong(8) == 0xd6
+      && pp.open("consensus_config")
+      && cs.fetch_uint_to(32, round_candidates)
+      && pp.field_int(round_candidates, "round_candidates")
+      && 1 <= round_candidates
+      && pp.fetch_uint_field(cs, 32, "next_candidate_delay_ms")
+      && pp.fetch_uint_field(cs, 32, "consensus_timeout_ms")
+      && pp.fetch_uint_field(cs, 32, "fast_attempts")
+      && pp.fetch_uint_field(cs, 32, "attempt_duration")
+      && pp.fetch_uint_field(cs, 32, "catchain_max_deps")
+      && pp.fetch_uint_field(cs, 32, "max_block_bytes")
+      && pp.fetch_uint_field(cs, 32, "max_collated_bytes")
+      && pp.close();
+}
+
+const ConsensusConfig t_ConsensusConfig;
+
+//
+// code for type `ValidatorTempKey`
+//
+constexpr unsigned char ValidatorTempKey::cons_tag[1];
+
+int ValidatorTempKey::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(4) == 3 ? validator_temp_key : -1;
+}
+
+bool ValidatorTempKey::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(4) == 3
+      && cs.advance(256)
+      && t_SigPubKey.validate_skip(cs, weak)
+      && cs.advance(64);
+}
+
+bool ValidatorTempKey::unpack(vm::CellSlice& cs, ValidatorTempKey::Record& data) const {
+  return cs.fetch_ulong(4) == 3
+      && cs.fetch_bits_to(data.adnl_addr.bits(), 256)
+      && cs.fetch_subslice_to(288, data.temp_public_key)
+      && cs.fetch_uint_to(32, data.seqno)
+      && cs.fetch_uint_to(32, data.valid_until);
+}
+
+bool ValidatorTempKey::cell_unpack(Ref<vm::Cell> cell_ref, ValidatorTempKey::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ValidatorTempKey::pack(vm::CellBuilder& cb, const ValidatorTempKey::Record& data) const {
+  return cb.store_long_bool(3, 4)
+      && cb.store_bits_bool(data.adnl_addr.cbits(), 256)
+      && cb.append_cellslice_chk(data.temp_public_key, 288)
+      && cb.store_ulong_rchk_bool(data.seqno, 32)
+      && cb.store_ulong_rchk_bool(data.valid_until, 32);
+}
+
+bool ValidatorTempKey::cell_pack(Ref<vm::Cell>& cell_ref, const ValidatorTempKey::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValidatorTempKey::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int seqno;
+  return cs.fetch_ulong(4) == 3
+      && pp.open("validator_temp_key")
+      && pp.fetch_bits_field(cs, 256, "adnl_addr")
+      && pp.field("temp_public_key")
+      && t_SigPubKey.print_skip(pp, cs)
+      && cs.fetch_uint_to(32, seqno)
+      && pp.field_int(seqno, "seqno")
+      && pp.fetch_uint_field(cs, 32, "valid_until")
+      && pp.close();
+}
+
+const ValidatorTempKey t_ValidatorTempKey;
+
+//
+// code for type `ValidatorSignedTempKey`
+//
+constexpr unsigned char ValidatorSignedTempKey::cons_tag[1];
+
+int ValidatorSignedTempKey::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(4) == 4 ? signed_temp_key : -1;
+}
+
+bool ValidatorSignedTempKey::skip(vm::CellSlice& cs) const {
+  return cs.advance_ext(0x10004)
+      && t_CryptoSignature.skip(cs);
+}
+
+bool ValidatorSignedTempKey::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(4) == 4
+      && t_ValidatorTempKey.validate_skip_ref(cs, weak)
+      && t_CryptoSignature.validate_skip(cs, weak);
+}
+
+bool ValidatorSignedTempKey::unpack(vm::CellSlice& cs, ValidatorSignedTempKey::Record& data) const {
+  return cs.fetch_ulong(4) == 4
+      && cs.fetch_ref_to(data.key)
+      && t_CryptoSignature.fetch_to(cs, data.signature);
+}
+
+bool ValidatorSignedTempKey::unpack_signed_temp_key(vm::CellSlice& cs, Ref<Cell>& key, Ref<CellSlice>& signature) const {
+  return cs.fetch_ulong(4) == 4
+      && cs.fetch_ref_to(key)
+      && t_CryptoSignature.fetch_to(cs, signature);
+}
+
+bool ValidatorSignedTempKey::cell_unpack(Ref<vm::Cell> cell_ref, ValidatorSignedTempKey::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ValidatorSignedTempKey::cell_unpack_signed_temp_key(Ref<vm::Cell> cell_ref, Ref<Cell>& key, Ref<CellSlice>& signature) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_signed_temp_key(cs, key, signature) && cs.empty_ext();
+}
+
+bool ValidatorSignedTempKey::pack(vm::CellBuilder& cb, const ValidatorSignedTempKey::Record& data) const {
+  return cb.store_long_bool(4, 4)
+      && cb.store_ref_bool(data.key)
+      && t_CryptoSignature.store_from(cb, data.signature);
+}
+
+bool ValidatorSignedTempKey::pack_signed_temp_key(vm::CellBuilder& cb, Ref<Cell> key, Ref<CellSlice> signature) const {
+  return cb.store_long_bool(4, 4)
+      && cb.store_ref_bool(key)
+      && t_CryptoSignature.store_from(cb, signature);
+}
+
+bool ValidatorSignedTempKey::cell_pack(Ref<vm::Cell>& cell_ref, const ValidatorSignedTempKey::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValidatorSignedTempKey::cell_pack_signed_temp_key(Ref<vm::Cell>& cell_ref, Ref<Cell> key, Ref<CellSlice> signature) const {
+  vm::CellBuilder cb;
+  return pack_signed_temp_key(cb, std::move(key), std::move(signature)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ValidatorSignedTempKey::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(4) == 4
+      && pp.open("signed_temp_key")
+      && pp.field("key")
+      && t_ValidatorTempKey.print_ref(pp, cs.fetch_ref())
+      && pp.field("signature")
+      && t_CryptoSignature.print_skip(pp, cs)
+      && pp.close();
+}
+
+const ValidatorSignedTempKey t_ValidatorSignedTempKey;
+
+//
+// code for type `ConfigParam`
+//
+
+int ConfigParam::get_tag(const vm::CellSlice& cs) const {
+  switch (m_) {
+  case 0:
+    return cons0;
+  case 1:
+    return cons1;
+  case 2:
+    return cons2;
+  case 3:
+    return cons3;
+  case 4:
+    return cons4;
+  case 6:
+    return cons6;
+  case 7:
+    return cons7;
+  case 8:
+    return cons8;
+  case 9:
+    return cons9;
+  case 12:
+    return cons12;
+  case 14:
+    return cons14;
+  case 15:
+    return cons15;
+  case 16:
+    return cons16;
+  case 17:
+    return cons17;
+  case 18:
+    return cons18;
+  case 20:
+    return config_mc_gas_prices;
+  case 21:
+    return config_gas_prices;
+  case 22:
+    return config_mc_block_limits;
+  case 23:
+    return config_block_limits;
+  case 24:
+    return config_mc_fwd_prices;
+  case 25:
+    return config_fwd_prices;
+  case 28:
+    return cons28;
+  case 29:
+    return cons29;
+  case 31:
+    return cons31;
+  case 32:
+    return cons32;
+  case 33:
+    return cons33;
+  case 34:
+    return cons34;
+  case 35:
+    return cons35;
+  case 36:
+    return cons36;
+  case 37:
+    return cons37;
+  case 39:
+    return cons39;
+  default:
+    return -1;
+  }
+}
+
+int ConfigParam::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cons0:
+    return cons0;
+  case cons1:
+    return cons1;
+  case cons2:
+    return cons2;
+  case cons3:
+    return cons3;
+  case cons4:
+    return cons4;
+  case cons6:
+    return cons6;
+  case cons7:
+    return cons7;
+  case cons8:
+    return cons8;
+  case cons9:
+    return cons9;
+  case cons12:
+    return cons12;
+  case cons14:
+    return cons14;
+  case cons15:
+    return cons15;
+  case cons16:
+    return cons16;
+  case cons17:
+    return cons17;
+  case cons18:
+    return cons18;
+  case config_mc_gas_prices:
+    return config_mc_gas_prices;
+  case config_gas_prices:
+    return config_gas_prices;
+  case config_mc_block_limits:
+    return config_mc_block_limits;
+  case config_block_limits:
+    return config_block_limits;
+  case config_mc_fwd_prices:
+    return config_mc_fwd_prices;
+  case config_fwd_prices:
+    return config_fwd_prices;
+  case cons28:
+    return cons28;
+  case cons29:
+    return cons29;
+  case cons31:
+    return cons31;
+  case cons32:
+    return cons32;
+  case cons33:
+    return cons33;
+  case cons34:
+    return cons34;
+  case cons35:
+    return cons35;
+  case cons36:
+    return cons36;
+  case cons37:
+    return cons37;
+  case cons39:
+    return cons39;
+  }
+  return -1;
+}
+
+bool ConfigParam::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cons0:
+    return cs.advance(256)
+        && m_ == 0;
+  case cons1:
+    return cs.advance(256)
+        && m_ == 1;
+  case cons2:
+    return cs.advance(256)
+        && m_ == 2;
+  case cons3:
+    return cs.advance(256)
+        && m_ == 3;
+  case cons4:
+    return cs.advance(256)
+        && m_ == 4;
+  case cons6:
+    return t_Grams.skip(cs)
+        && t_Grams.skip(cs)
+        && m_ == 6;
+  case cons7:
+    return t_ExtraCurrencyCollection.skip(cs)
+        && m_ == 7;
+  case cons8:
+    return cs.advance(104)
+        && m_ == 8;
+  case cons9:
+    return t_Hashmap_32_True.skip(cs)
+        && m_ == 9;
+  case cons12:
+    return t_HashmapE_32_WorkchainDescr.skip(cs)
+        && m_ == 12;
+  case cons14:
+    return t_BlockCreateFees.skip(cs)
+        && m_ == 14;
+  case cons15:
+    return cs.advance(128)
+        && m_ == 15;
+  case cons16: {
+    int max_validators, max_main_validators, min_validators;
+    return cs.fetch_uint_to(16, max_validators)
+        && cs.fetch_uint_to(16, max_main_validators)
+        && cs.fetch_uint_to(16, min_validators)
+        && max_main_validators <= max_validators
+        && min_validators <= max_main_validators
+        && 1 <= min_validators
+        && m_ == 16;
+    }
+  case cons17:
+    return t_Grams.skip(cs)
+        && t_Grams.skip(cs)
+        && t_Grams.skip(cs)
+        && cs.advance(32)
+        && m_ == 17;
+  case cons18:
+    return t_Hashmap_32_StoragePrices.skip(cs)
+        && m_ == 18;
+  case config_mc_gas_prices:
+    return t_GasLimitsPrices.skip(cs)
+        && m_ == 20;
+  case config_gas_prices:
+    return t_GasLimitsPrices.skip(cs)
+        && m_ == 21;
+  case config_mc_block_limits:
+    return cs.advance(320)
+        && m_ == 22;
+  case config_block_limits:
+    return cs.advance(320)
+        && m_ == 23;
+  case config_mc_fwd_prices:
+    return cs.advance(264)
+        && m_ == 24;
+  case config_fwd_prices:
+    return cs.advance(264)
+        && m_ == 25;
+  case cons28:
+    return cs.advance(136)
+        && m_ == 28;
+  case cons29:
+    return cs.advance(264)
+        && m_ == 29;
+  case cons31:
+    return t_HashmapE_256_True.skip(cs)
+        && m_ == 31;
+  case cons32:
+    return t_ValidatorSet.skip(cs)
+        && m_ == 32;
+  case cons33:
+    return t_ValidatorSet.skip(cs)
+        && m_ == 33;
+  case cons34:
+    return t_ValidatorSet.skip(cs)
+        && m_ == 34;
+  case cons35:
+    return t_ValidatorSet.skip(cs)
+        && m_ == 35;
+  case cons36:
+    return t_ValidatorSet.skip(cs)
+        && m_ == 36;
+  case cons37:
+    return t_ValidatorSet.skip(cs)
+        && m_ == 37;
+  case cons39:
+    return t_HashmapE_256_ValidatorSignedTempKey.skip(cs)
+        && m_ == 39;
+  }
+  return false;
+}
+
+bool ConfigParam::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case cons0:
+    return cs.advance(256)
+        && m_ == 0;
+  case cons1:
+    return cs.advance(256)
+        && m_ == 1;
+  case cons2:
+    return cs.advance(256)
+        && m_ == 2;
+  case cons3:
+    return cs.advance(256)
+        && m_ == 3;
+  case cons4:
+    return cs.advance(256)
+        && m_ == 4;
+  case cons6:
+    return t_Grams.validate_skip(cs, weak)
+        && t_Grams.validate_skip(cs, weak)
+        && m_ == 6;
+  case cons7:
+    return t_ExtraCurrencyCollection.validate_skip(cs, weak)
+        && m_ == 7;
+  case cons8:
+    return t_GlobalVersion.validate_skip(cs, weak)
+        && m_ == 8;
+  case cons9:
+    return t_Hashmap_32_True.validate_skip(cs, weak)
+        && m_ == 9;
+  case cons12:
+    return t_HashmapE_32_WorkchainDescr.validate_skip(cs, weak)
+        && m_ == 12;
+  case cons14:
+    return t_BlockCreateFees.validate_skip(cs, weak)
+        && m_ == 14;
+  case cons15:
+    return cs.advance(128)
+        && m_ == 15;
+  case cons16: {
+    int max_validators, max_main_validators, min_validators;
+    return cs.fetch_uint_to(16, max_validators)
+        && cs.fetch_uint_to(16, max_main_validators)
+        && cs.fetch_uint_to(16, min_validators)
+        && max_main_validators <= max_validators
+        && min_validators <= max_main_validators
+        && 1 <= min_validators
+        && m_ == 16;
+    }
+  case cons17:
+    return t_Grams.validate_skip(cs, weak)
+        && t_Grams.validate_skip(cs, weak)
+        && t_Grams.validate_skip(cs, weak)
+        && cs.advance(32)
+        && m_ == 17;
+  case cons18:
+    return t_Hashmap_32_StoragePrices.validate_skip(cs, weak)
+        && m_ == 18;
+  case config_mc_gas_prices:
+    return t_GasLimitsPrices.validate_skip(cs, weak)
+        && m_ == 20;
+  case config_gas_prices:
+    return t_GasLimitsPrices.validate_skip(cs, weak)
+        && m_ == 21;
+  case config_mc_block_limits:
+    return t_BlockLimits.validate_skip(cs, weak)
+        && m_ == 22;
+  case config_block_limits:
+    return t_BlockLimits.validate_skip(cs, weak)
+        && m_ == 23;
+  case config_mc_fwd_prices:
+    return t_MsgForwardPrices.validate_skip(cs, weak)
+        && m_ == 24;
+  case config_fwd_prices:
+    return t_MsgForwardPrices.validate_skip(cs, weak)
+        && m_ == 25;
+  case cons28:
+    return t_CatchainConfig.validate_skip(cs, weak)
+        && m_ == 28;
+  case cons29:
+    return t_ConsensusConfig.validate_skip(cs, weak)
+        && m_ == 29;
+  case cons31:
+    return t_HashmapE_256_True.validate_skip(cs, weak)
+        && m_ == 31;
+  case cons32:
+    return t_ValidatorSet.validate_skip(cs, weak)
+        && m_ == 32;
+  case cons33:
+    return t_ValidatorSet.validate_skip(cs, weak)
+        && m_ == 33;
+  case cons34:
+    return t_ValidatorSet.validate_skip(cs, weak)
+        && m_ == 34;
+  case cons35:
+    return t_ValidatorSet.validate_skip(cs, weak)
+        && m_ == 35;
+  case cons36:
+    return t_ValidatorSet.validate_skip(cs, weak)
+        && m_ == 36;
+  case cons37:
+    return t_ValidatorSet.validate_skip(cs, weak)
+        && m_ == 37;
+  case cons39:
+    return t_HashmapE_256_ValidatorSignedTempKey.validate_skip(cs, weak)
+        && m_ == 39;
+  }
+  return false;
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons0& data) const {
+  return cs.fetch_bits_to(data.config_addr.bits(), 256)
+      && m_ == 0;
+}
+
+bool ConfigParam::unpack_cons0(vm::CellSlice& cs, td::BitArray<256>& config_addr) const {
+  return cs.fetch_bits_to(config_addr.bits(), 256)
+      && m_ == 0;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons0& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons0(Ref<vm::Cell> cell_ref, td::BitArray<256>& config_addr) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons0(cs, config_addr) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons1& data) const {
+  return cs.fetch_bits_to(data.elector_addr.bits(), 256)
+      && m_ == 1;
+}
+
+bool ConfigParam::unpack_cons1(vm::CellSlice& cs, td::BitArray<256>& elector_addr) const {
+  return cs.fetch_bits_to(elector_addr.bits(), 256)
+      && m_ == 1;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons1& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons1(Ref<vm::Cell> cell_ref, td::BitArray<256>& elector_addr) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons1(cs, elector_addr) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons2& data) const {
+  return cs.fetch_bits_to(data.minter_addr.bits(), 256)
+      && m_ == 2;
+}
+
+bool ConfigParam::unpack_cons2(vm::CellSlice& cs, td::BitArray<256>& minter_addr) const {
+  return cs.fetch_bits_to(minter_addr.bits(), 256)
+      && m_ == 2;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons2& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons2(Ref<vm::Cell> cell_ref, td::BitArray<256>& minter_addr) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons2(cs, minter_addr) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons3& data) const {
+  return cs.fetch_bits_to(data.fee_collector_addr.bits(), 256)
+      && m_ == 3;
+}
+
+bool ConfigParam::unpack_cons3(vm::CellSlice& cs, td::BitArray<256>& fee_collector_addr) const {
+  return cs.fetch_bits_to(fee_collector_addr.bits(), 256)
+      && m_ == 3;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons3& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons3(Ref<vm::Cell> cell_ref, td::BitArray<256>& fee_collector_addr) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons3(cs, fee_collector_addr) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons4& data) const {
+  return cs.fetch_bits_to(data.dns_root_addr.bits(), 256)
+      && m_ == 4;
+}
+
+bool ConfigParam::unpack_cons4(vm::CellSlice& cs, td::BitArray<256>& dns_root_addr) const {
+  return cs.fetch_bits_to(dns_root_addr.bits(), 256)
+      && m_ == 4;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons4& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons4(Ref<vm::Cell> cell_ref, td::BitArray<256>& dns_root_addr) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons4(cs, dns_root_addr) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons6& data) const {
+  return t_Grams.fetch_to(cs, data.mint_new_price)
+      && t_Grams.fetch_to(cs, data.mint_add_price)
+      && m_ == 6;
+}
+
+bool ConfigParam::unpack_cons6(vm::CellSlice& cs, Ref<CellSlice>& mint_new_price, Ref<CellSlice>& mint_add_price) const {
+  return t_Grams.fetch_to(cs, mint_new_price)
+      && t_Grams.fetch_to(cs, mint_add_price)
+      && m_ == 6;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons6& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons6(Ref<vm::Cell> cell_ref, Ref<CellSlice>& mint_new_price, Ref<CellSlice>& mint_add_price) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons6(cs, mint_new_price, mint_add_price) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons7& data) const {
+  return t_ExtraCurrencyCollection.fetch_to(cs, data.to_mint)
+      && m_ == 7;
+}
+
+bool ConfigParam::unpack_cons7(vm::CellSlice& cs, Ref<CellSlice>& to_mint) const {
+  return t_ExtraCurrencyCollection.fetch_to(cs, to_mint)
+      && m_ == 7;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons7& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons7(Ref<vm::Cell> cell_ref, Ref<CellSlice>& to_mint) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons7(cs, to_mint) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons8& data) const {
+  return cs.fetch_subslice_to(104, data.x)
+      && m_ == 8;
+}
+
+bool ConfigParam::unpack_cons8(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return cs.fetch_subslice_to(104, x)
+      && m_ == 8;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons8& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons8(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons8(cs, x) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons9& data) const {
+  return t_Hashmap_32_True.fetch_to(cs, data.mandatory_params)
+      && m_ == 9;
+}
+
+bool ConfigParam::unpack_cons9(vm::CellSlice& cs, Ref<CellSlice>& mandatory_params) const {
+  return t_Hashmap_32_True.fetch_to(cs, mandatory_params)
+      && m_ == 9;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons9& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons9(Ref<vm::Cell> cell_ref, Ref<CellSlice>& mandatory_params) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons9(cs, mandatory_params) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons12& data) const {
+  return t_HashmapE_32_WorkchainDescr.fetch_to(cs, data.workchains)
+      && m_ == 12;
+}
+
+bool ConfigParam::unpack_cons12(vm::CellSlice& cs, Ref<CellSlice>& workchains) const {
+  return t_HashmapE_32_WorkchainDescr.fetch_to(cs, workchains)
+      && m_ == 12;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons12& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons12(Ref<vm::Cell> cell_ref, Ref<CellSlice>& workchains) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons12(cs, workchains) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons14& data) const {
+  return t_BlockCreateFees.fetch_to(cs, data.x)
+      && m_ == 14;
+}
+
+bool ConfigParam::unpack_cons14(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_BlockCreateFees.fetch_to(cs, x)
+      && m_ == 14;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons14& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons14(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons14(cs, x) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons15& data) const {
+  return cs.fetch_uint_to(32, data.validators_elected_for)
+      && cs.fetch_uint_to(32, data.elections_start_before)
+      && cs.fetch_uint_to(32, data.elections_end_before)
+      && cs.fetch_uint_to(32, data.stake_held_for)
+      && m_ == 15;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons15& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons16& data) const {
+  return cs.fetch_uint_to(16, data.max_validators)
+      && cs.fetch_uint_to(16, data.max_main_validators)
+      && cs.fetch_uint_to(16, data.min_validators)
+      && data.max_main_validators <= data.max_validators
+      && data.min_validators <= data.max_main_validators
+      && 1 <= data.min_validators
+      && m_ == 16;
+}
+
+bool ConfigParam::unpack_cons16(vm::CellSlice& cs, int& max_validators, int& max_main_validators, int& min_validators) const {
+  return cs.fetch_uint_to(16, max_validators)
+      && cs.fetch_uint_to(16, max_main_validators)
+      && cs.fetch_uint_to(16, min_validators)
+      && max_main_validators <= max_validators
+      && min_validators <= max_main_validators
+      && 1 <= min_validators
+      && m_ == 16;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons16& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons16(Ref<vm::Cell> cell_ref, int& max_validators, int& max_main_validators, int& min_validators) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons16(cs, max_validators, max_main_validators, min_validators) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons17& data) const {
+  return t_Grams.fetch_to(cs, data.min_stake)
+      && t_Grams.fetch_to(cs, data.max_stake)
+      && t_Grams.fetch_to(cs, data.min_total_stake)
+      && cs.fetch_uint_to(32, data.max_stake_factor)
+      && m_ == 17;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons17& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons18& data) const {
+  return t_Hashmap_32_StoragePrices.fetch_to(cs, data.x)
+      && m_ == 18;
+}
+
+bool ConfigParam::unpack_cons18(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_Hashmap_32_StoragePrices.fetch_to(cs, x)
+      && m_ == 18;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons18& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons18(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons18(cs, x) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_config_mc_gas_prices& data) const {
+  return t_GasLimitsPrices.fetch_to(cs, data.x)
+      && m_ == 20;
+}
+
+bool ConfigParam::unpack_config_mc_gas_prices(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_GasLimitsPrices.fetch_to(cs, x)
+      && m_ == 20;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_config_mc_gas_prices& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_config_mc_gas_prices(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_config_mc_gas_prices(cs, x) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_config_gas_prices& data) const {
+  return t_GasLimitsPrices.fetch_to(cs, data.x)
+      && m_ == 21;
+}
+
+bool ConfigParam::unpack_config_gas_prices(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_GasLimitsPrices.fetch_to(cs, x)
+      && m_ == 21;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_config_gas_prices& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_config_gas_prices(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_config_gas_prices(cs, x) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_config_mc_block_limits& data) const {
+  return cs.fetch_subslice_to(320, data.x)
+      && m_ == 22;
+}
+
+bool ConfigParam::unpack_config_mc_block_limits(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return cs.fetch_subslice_to(320, x)
+      && m_ == 22;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_config_mc_block_limits& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_config_mc_block_limits(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_config_mc_block_limits(cs, x) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_config_block_limits& data) const {
+  return cs.fetch_subslice_to(320, data.x)
+      && m_ == 23;
+}
+
+bool ConfigParam::unpack_config_block_limits(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return cs.fetch_subslice_to(320, x)
+      && m_ == 23;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_config_block_limits& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_config_block_limits(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_config_block_limits(cs, x) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_config_mc_fwd_prices& data) const {
+  return cs.fetch_subslice_to(264, data.x)
+      && m_ == 24;
+}
+
+bool ConfigParam::unpack_config_mc_fwd_prices(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return cs.fetch_subslice_to(264, x)
+      && m_ == 24;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_config_mc_fwd_prices& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_config_mc_fwd_prices(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_config_mc_fwd_prices(cs, x) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_config_fwd_prices& data) const {
+  return cs.fetch_subslice_to(264, data.x)
+      && m_ == 25;
+}
+
+bool ConfigParam::unpack_config_fwd_prices(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return cs.fetch_subslice_to(264, x)
+      && m_ == 25;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_config_fwd_prices& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_config_fwd_prices(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_config_fwd_prices(cs, x) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons28& data) const {
+  return cs.fetch_subslice_to(136, data.x)
+      && m_ == 28;
+}
+
+bool ConfigParam::unpack_cons28(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return cs.fetch_subslice_to(136, x)
+      && m_ == 28;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons28& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons28(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons28(cs, x) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons29& data) const {
+  return cs.fetch_subslice_to(264, data.x)
+      && m_ == 29;
+}
+
+bool ConfigParam::unpack_cons29(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return cs.fetch_subslice_to(264, x)
+      && m_ == 29;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons29& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons29(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons29(cs, x) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons31& data) const {
+  return t_HashmapE_256_True.fetch_to(cs, data.fundamental_smc_addr)
+      && m_ == 31;
+}
+
+bool ConfigParam::unpack_cons31(vm::CellSlice& cs, Ref<CellSlice>& fundamental_smc_addr) const {
+  return t_HashmapE_256_True.fetch_to(cs, fundamental_smc_addr)
+      && m_ == 31;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons31& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons31(Ref<vm::Cell> cell_ref, Ref<CellSlice>& fundamental_smc_addr) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons31(cs, fundamental_smc_addr) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons32& data) const {
+  return t_ValidatorSet.fetch_to(cs, data.prev_validators)
+      && m_ == 32;
+}
+
+bool ConfigParam::unpack_cons32(vm::CellSlice& cs, Ref<CellSlice>& prev_validators) const {
+  return t_ValidatorSet.fetch_to(cs, prev_validators)
+      && m_ == 32;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons32& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons32(Ref<vm::Cell> cell_ref, Ref<CellSlice>& prev_validators) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons32(cs, prev_validators) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons33& data) const {
+  return t_ValidatorSet.fetch_to(cs, data.prev_temp_validators)
+      && m_ == 33;
+}
+
+bool ConfigParam::unpack_cons33(vm::CellSlice& cs, Ref<CellSlice>& prev_temp_validators) const {
+  return t_ValidatorSet.fetch_to(cs, prev_temp_validators)
+      && m_ == 33;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons33& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons33(Ref<vm::Cell> cell_ref, Ref<CellSlice>& prev_temp_validators) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons33(cs, prev_temp_validators) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons34& data) const {
+  return t_ValidatorSet.fetch_to(cs, data.cur_validators)
+      && m_ == 34;
+}
+
+bool ConfigParam::unpack_cons34(vm::CellSlice& cs, Ref<CellSlice>& cur_validators) const {
+  return t_ValidatorSet.fetch_to(cs, cur_validators)
+      && m_ == 34;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons34& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons34(Ref<vm::Cell> cell_ref, Ref<CellSlice>& cur_validators) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons34(cs, cur_validators) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons35& data) const {
+  return t_ValidatorSet.fetch_to(cs, data.cur_temp_validators)
+      && m_ == 35;
+}
+
+bool ConfigParam::unpack_cons35(vm::CellSlice& cs, Ref<CellSlice>& cur_temp_validators) const {
+  return t_ValidatorSet.fetch_to(cs, cur_temp_validators)
+      && m_ == 35;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons35& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons35(Ref<vm::Cell> cell_ref, Ref<CellSlice>& cur_temp_validators) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons35(cs, cur_temp_validators) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons36& data) const {
+  return t_ValidatorSet.fetch_to(cs, data.next_validators)
+      && m_ == 36;
+}
+
+bool ConfigParam::unpack_cons36(vm::CellSlice& cs, Ref<CellSlice>& next_validators) const {
+  return t_ValidatorSet.fetch_to(cs, next_validators)
+      && m_ == 36;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons36& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons36(Ref<vm::Cell> cell_ref, Ref<CellSlice>& next_validators) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons36(cs, next_validators) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons37& data) const {
+  return t_ValidatorSet.fetch_to(cs, data.next_temp_validators)
+      && m_ == 37;
+}
+
+bool ConfigParam::unpack_cons37(vm::CellSlice& cs, Ref<CellSlice>& next_temp_validators) const {
+  return t_ValidatorSet.fetch_to(cs, next_temp_validators)
+      && m_ == 37;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons37& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons37(Ref<vm::Cell> cell_ref, Ref<CellSlice>& next_temp_validators) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons37(cs, next_temp_validators) && cs.empty_ext();
+}
+
+bool ConfigParam::unpack(vm::CellSlice& cs, ConfigParam::Record_cons39& data) const {
+  return t_HashmapE_256_ValidatorSignedTempKey.fetch_to(cs, data.x)
+      && m_ == 39;
+}
+
+bool ConfigParam::unpack_cons39(vm::CellSlice& cs, Ref<CellSlice>& x) const {
+  return t_HashmapE_256_ValidatorSignedTempKey.fetch_to(cs, x)
+      && m_ == 39;
+}
+
+bool ConfigParam::cell_unpack(Ref<vm::Cell> cell_ref, ConfigParam::Record_cons39& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ConfigParam::cell_unpack_cons39(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_cons39(cs, x) && cs.empty_ext();
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons0& data) const {
+  return cb.store_bits_bool(data.config_addr.cbits(), 256)
+      && m_ == 0;
+}
+
+bool ConfigParam::pack_cons0(vm::CellBuilder& cb, td::BitArray<256> config_addr) const {
+  return cb.store_bits_bool(config_addr.cbits(), 256)
+      && m_ == 0;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons0& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons0(Ref<vm::Cell>& cell_ref, td::BitArray<256> config_addr) const {
+  vm::CellBuilder cb;
+  return pack_cons0(cb, config_addr) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons1& data) const {
+  return cb.store_bits_bool(data.elector_addr.cbits(), 256)
+      && m_ == 1;
+}
+
+bool ConfigParam::pack_cons1(vm::CellBuilder& cb, td::BitArray<256> elector_addr) const {
+  return cb.store_bits_bool(elector_addr.cbits(), 256)
+      && m_ == 1;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons1& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons1(Ref<vm::Cell>& cell_ref, td::BitArray<256> elector_addr) const {
+  vm::CellBuilder cb;
+  return pack_cons1(cb, elector_addr) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons2& data) const {
+  return cb.store_bits_bool(data.minter_addr.cbits(), 256)
+      && m_ == 2;
+}
+
+bool ConfigParam::pack_cons2(vm::CellBuilder& cb, td::BitArray<256> minter_addr) const {
+  return cb.store_bits_bool(minter_addr.cbits(), 256)
+      && m_ == 2;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons2& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons2(Ref<vm::Cell>& cell_ref, td::BitArray<256> minter_addr) const {
+  vm::CellBuilder cb;
+  return pack_cons2(cb, minter_addr) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons3& data) const {
+  return cb.store_bits_bool(data.fee_collector_addr.cbits(), 256)
+      && m_ == 3;
+}
+
+bool ConfigParam::pack_cons3(vm::CellBuilder& cb, td::BitArray<256> fee_collector_addr) const {
+  return cb.store_bits_bool(fee_collector_addr.cbits(), 256)
+      && m_ == 3;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons3& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons3(Ref<vm::Cell>& cell_ref, td::BitArray<256> fee_collector_addr) const {
+  vm::CellBuilder cb;
+  return pack_cons3(cb, fee_collector_addr) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons4& data) const {
+  return cb.store_bits_bool(data.dns_root_addr.cbits(), 256)
+      && m_ == 4;
+}
+
+bool ConfigParam::pack_cons4(vm::CellBuilder& cb, td::BitArray<256> dns_root_addr) const {
+  return cb.store_bits_bool(dns_root_addr.cbits(), 256)
+      && m_ == 4;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons4& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons4(Ref<vm::Cell>& cell_ref, td::BitArray<256> dns_root_addr) const {
+  vm::CellBuilder cb;
+  return pack_cons4(cb, dns_root_addr) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons6& data) const {
+  return t_Grams.store_from(cb, data.mint_new_price)
+      && t_Grams.store_from(cb, data.mint_add_price)
+      && m_ == 6;
+}
+
+bool ConfigParam::pack_cons6(vm::CellBuilder& cb, Ref<CellSlice> mint_new_price, Ref<CellSlice> mint_add_price) const {
+  return t_Grams.store_from(cb, mint_new_price)
+      && t_Grams.store_from(cb, mint_add_price)
+      && m_ == 6;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons6& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons6(Ref<vm::Cell>& cell_ref, Ref<CellSlice> mint_new_price, Ref<CellSlice> mint_add_price) const {
+  vm::CellBuilder cb;
+  return pack_cons6(cb, std::move(mint_new_price), std::move(mint_add_price)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons7& data) const {
+  return t_ExtraCurrencyCollection.store_from(cb, data.to_mint)
+      && m_ == 7;
+}
+
+bool ConfigParam::pack_cons7(vm::CellBuilder& cb, Ref<CellSlice> to_mint) const {
+  return t_ExtraCurrencyCollection.store_from(cb, to_mint)
+      && m_ == 7;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons7& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons7(Ref<vm::Cell>& cell_ref, Ref<CellSlice> to_mint) const {
+  vm::CellBuilder cb;
+  return pack_cons7(cb, std::move(to_mint)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons8& data) const {
+  return cb.append_cellslice_chk(data.x, 104)
+      && m_ == 8;
+}
+
+bool ConfigParam::pack_cons8(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return cb.append_cellslice_chk(x, 104)
+      && m_ == 8;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons8& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons8(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons8(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons9& data) const {
+  return t_Hashmap_32_True.store_from(cb, data.mandatory_params)
+      && m_ == 9;
+}
+
+bool ConfigParam::pack_cons9(vm::CellBuilder& cb, Ref<CellSlice> mandatory_params) const {
+  return t_Hashmap_32_True.store_from(cb, mandatory_params)
+      && m_ == 9;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons9& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons9(Ref<vm::Cell>& cell_ref, Ref<CellSlice> mandatory_params) const {
+  vm::CellBuilder cb;
+  return pack_cons9(cb, std::move(mandatory_params)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons12& data) const {
+  return t_HashmapE_32_WorkchainDescr.store_from(cb, data.workchains)
+      && m_ == 12;
+}
+
+bool ConfigParam::pack_cons12(vm::CellBuilder& cb, Ref<CellSlice> workchains) const {
+  return t_HashmapE_32_WorkchainDescr.store_from(cb, workchains)
+      && m_ == 12;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons12& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons12(Ref<vm::Cell>& cell_ref, Ref<CellSlice> workchains) const {
+  vm::CellBuilder cb;
+  return pack_cons12(cb, std::move(workchains)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons14& data) const {
+  return t_BlockCreateFees.store_from(cb, data.x)
+      && m_ == 14;
+}
+
+bool ConfigParam::pack_cons14(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_BlockCreateFees.store_from(cb, x)
+      && m_ == 14;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons14& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons14(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons14(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons15& data) const {
+  return cb.store_ulong_rchk_bool(data.validators_elected_for, 32)
+      && cb.store_ulong_rchk_bool(data.elections_start_before, 32)
+      && cb.store_ulong_rchk_bool(data.elections_end_before, 32)
+      && cb.store_ulong_rchk_bool(data.stake_held_for, 32)
+      && m_ == 15;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons15& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons16& data) const {
+  return cb.store_ulong_rchk_bool(data.max_validators, 16)
+      && cb.store_ulong_rchk_bool(data.max_main_validators, 16)
+      && cb.store_ulong_rchk_bool(data.min_validators, 16)
+      && data.max_main_validators <= data.max_validators
+      && data.min_validators <= data.max_main_validators
+      && 1 <= data.min_validators
+      && m_ == 16;
+}
+
+bool ConfigParam::pack_cons16(vm::CellBuilder& cb, int max_validators, int max_main_validators, int min_validators) const {
+  return cb.store_ulong_rchk_bool(max_validators, 16)
+      && cb.store_ulong_rchk_bool(max_main_validators, 16)
+      && cb.store_ulong_rchk_bool(min_validators, 16)
+      && max_main_validators <= max_validators
+      && min_validators <= max_main_validators
+      && 1 <= min_validators
+      && m_ == 16;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons16& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons16(Ref<vm::Cell>& cell_ref, int max_validators, int max_main_validators, int min_validators) const {
+  vm::CellBuilder cb;
+  return pack_cons16(cb, max_validators, max_main_validators, min_validators) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons17& data) const {
+  return t_Grams.store_from(cb, data.min_stake)
+      && t_Grams.store_from(cb, data.max_stake)
+      && t_Grams.store_from(cb, data.min_total_stake)
+      && cb.store_ulong_rchk_bool(data.max_stake_factor, 32)
+      && m_ == 17;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons17& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons18& data) const {
+  return t_Hashmap_32_StoragePrices.store_from(cb, data.x)
+      && m_ == 18;
+}
+
+bool ConfigParam::pack_cons18(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_Hashmap_32_StoragePrices.store_from(cb, x)
+      && m_ == 18;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons18& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons18(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons18(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_config_mc_gas_prices& data) const {
+  return t_GasLimitsPrices.store_from(cb, data.x)
+      && m_ == 20;
+}
+
+bool ConfigParam::pack_config_mc_gas_prices(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_GasLimitsPrices.store_from(cb, x)
+      && m_ == 20;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_config_mc_gas_prices& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_config_mc_gas_prices(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_config_mc_gas_prices(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_config_gas_prices& data) const {
+  return t_GasLimitsPrices.store_from(cb, data.x)
+      && m_ == 21;
+}
+
+bool ConfigParam::pack_config_gas_prices(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_GasLimitsPrices.store_from(cb, x)
+      && m_ == 21;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_config_gas_prices& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_config_gas_prices(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_config_gas_prices(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_config_mc_block_limits& data) const {
+  return cb.append_cellslice_chk(data.x, 320)
+      && m_ == 22;
+}
+
+bool ConfigParam::pack_config_mc_block_limits(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return cb.append_cellslice_chk(x, 320)
+      && m_ == 22;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_config_mc_block_limits& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_config_mc_block_limits(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_config_mc_block_limits(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_config_block_limits& data) const {
+  return cb.append_cellslice_chk(data.x, 320)
+      && m_ == 23;
+}
+
+bool ConfigParam::pack_config_block_limits(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return cb.append_cellslice_chk(x, 320)
+      && m_ == 23;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_config_block_limits& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_config_block_limits(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_config_block_limits(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_config_mc_fwd_prices& data) const {
+  return cb.append_cellslice_chk(data.x, 264)
+      && m_ == 24;
+}
+
+bool ConfigParam::pack_config_mc_fwd_prices(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return cb.append_cellslice_chk(x, 264)
+      && m_ == 24;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_config_mc_fwd_prices& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_config_mc_fwd_prices(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_config_mc_fwd_prices(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_config_fwd_prices& data) const {
+  return cb.append_cellslice_chk(data.x, 264)
+      && m_ == 25;
+}
+
+bool ConfigParam::pack_config_fwd_prices(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return cb.append_cellslice_chk(x, 264)
+      && m_ == 25;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_config_fwd_prices& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_config_fwd_prices(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_config_fwd_prices(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons28& data) const {
+  return cb.append_cellslice_chk(data.x, 136)
+      && m_ == 28;
+}
+
+bool ConfigParam::pack_cons28(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return cb.append_cellslice_chk(x, 136)
+      && m_ == 28;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons28& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons28(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons28(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons29& data) const {
+  return cb.append_cellslice_chk(data.x, 264)
+      && m_ == 29;
+}
+
+bool ConfigParam::pack_cons29(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return cb.append_cellslice_chk(x, 264)
+      && m_ == 29;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons29& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons29(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons29(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons31& data) const {
+  return t_HashmapE_256_True.store_from(cb, data.fundamental_smc_addr)
+      && m_ == 31;
+}
+
+bool ConfigParam::pack_cons31(vm::CellBuilder& cb, Ref<CellSlice> fundamental_smc_addr) const {
+  return t_HashmapE_256_True.store_from(cb, fundamental_smc_addr)
+      && m_ == 31;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons31& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons31(Ref<vm::Cell>& cell_ref, Ref<CellSlice> fundamental_smc_addr) const {
+  vm::CellBuilder cb;
+  return pack_cons31(cb, std::move(fundamental_smc_addr)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons32& data) const {
+  return t_ValidatorSet.store_from(cb, data.prev_validators)
+      && m_ == 32;
+}
+
+bool ConfigParam::pack_cons32(vm::CellBuilder& cb, Ref<CellSlice> prev_validators) const {
+  return t_ValidatorSet.store_from(cb, prev_validators)
+      && m_ == 32;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons32& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons32(Ref<vm::Cell>& cell_ref, Ref<CellSlice> prev_validators) const {
+  vm::CellBuilder cb;
+  return pack_cons32(cb, std::move(prev_validators)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons33& data) const {
+  return t_ValidatorSet.store_from(cb, data.prev_temp_validators)
+      && m_ == 33;
+}
+
+bool ConfigParam::pack_cons33(vm::CellBuilder& cb, Ref<CellSlice> prev_temp_validators) const {
+  return t_ValidatorSet.store_from(cb, prev_temp_validators)
+      && m_ == 33;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons33& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons33(Ref<vm::Cell>& cell_ref, Ref<CellSlice> prev_temp_validators) const {
+  vm::CellBuilder cb;
+  return pack_cons33(cb, std::move(prev_temp_validators)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons34& data) const {
+  return t_ValidatorSet.store_from(cb, data.cur_validators)
+      && m_ == 34;
+}
+
+bool ConfigParam::pack_cons34(vm::CellBuilder& cb, Ref<CellSlice> cur_validators) const {
+  return t_ValidatorSet.store_from(cb, cur_validators)
+      && m_ == 34;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons34& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons34(Ref<vm::Cell>& cell_ref, Ref<CellSlice> cur_validators) const {
+  vm::CellBuilder cb;
+  return pack_cons34(cb, std::move(cur_validators)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons35& data) const {
+  return t_ValidatorSet.store_from(cb, data.cur_temp_validators)
+      && m_ == 35;
+}
+
+bool ConfigParam::pack_cons35(vm::CellBuilder& cb, Ref<CellSlice> cur_temp_validators) const {
+  return t_ValidatorSet.store_from(cb, cur_temp_validators)
+      && m_ == 35;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons35& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons35(Ref<vm::Cell>& cell_ref, Ref<CellSlice> cur_temp_validators) const {
+  vm::CellBuilder cb;
+  return pack_cons35(cb, std::move(cur_temp_validators)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons36& data) const {
+  return t_ValidatorSet.store_from(cb, data.next_validators)
+      && m_ == 36;
+}
+
+bool ConfigParam::pack_cons36(vm::CellBuilder& cb, Ref<CellSlice> next_validators) const {
+  return t_ValidatorSet.store_from(cb, next_validators)
+      && m_ == 36;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons36& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons36(Ref<vm::Cell>& cell_ref, Ref<CellSlice> next_validators) const {
+  vm::CellBuilder cb;
+  return pack_cons36(cb, std::move(next_validators)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons37& data) const {
+  return t_ValidatorSet.store_from(cb, data.next_temp_validators)
+      && m_ == 37;
+}
+
+bool ConfigParam::pack_cons37(vm::CellBuilder& cb, Ref<CellSlice> next_temp_validators) const {
+  return t_ValidatorSet.store_from(cb, next_temp_validators)
+      && m_ == 37;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons37& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons37(Ref<vm::Cell>& cell_ref, Ref<CellSlice> next_temp_validators) const {
+  vm::CellBuilder cb;
+  return pack_cons37(cb, std::move(next_temp_validators)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::pack(vm::CellBuilder& cb, const ConfigParam::Record_cons39& data) const {
+  return t_HashmapE_256_ValidatorSignedTempKey.store_from(cb, data.x)
+      && m_ == 39;
+}
+
+bool ConfigParam::pack_cons39(vm::CellBuilder& cb, Ref<CellSlice> x) const {
+  return t_HashmapE_256_ValidatorSignedTempKey.store_from(cb, x)
+      && m_ == 39;
+}
+
+bool ConfigParam::cell_pack(Ref<vm::Cell>& cell_ref, const ConfigParam::Record_cons39& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::cell_pack_cons39(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const {
+  vm::CellBuilder cb;
+  return pack_cons39(cb, std::move(x)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ConfigParam::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case cons0:
+    return pp.open()
+        && pp.fetch_bits_field(cs, 256, "config_addr")
+        && m_ == 0
+        && pp.close();
+  case cons1:
+    return pp.open()
+        && pp.fetch_bits_field(cs, 256, "elector_addr")
+        && m_ == 1
+        && pp.close();
+  case cons2:
+    return pp.open()
+        && pp.fetch_bits_field(cs, 256, "minter_addr")
+        && m_ == 2
+        && pp.close();
+  case cons3:
+    return pp.open()
+        && pp.fetch_bits_field(cs, 256, "fee_collector_addr")
+        && m_ == 3
+        && pp.close();
+  case cons4:
+    return pp.open()
+        && pp.fetch_bits_field(cs, 256, "dns_root_addr")
+        && m_ == 4
+        && pp.close();
+  case cons6:
+    return pp.open()
+        && pp.field("mint_new_price")
+        && t_Grams.print_skip(pp, cs)
+        && pp.field("mint_add_price")
+        && t_Grams.print_skip(pp, cs)
+        && m_ == 6
+        && pp.close();
+  case cons7:
+    return pp.open()
+        && pp.field("to_mint")
+        && t_ExtraCurrencyCollection.print_skip(pp, cs)
+        && m_ == 7
+        && pp.close();
+  case cons8:
+    return pp.open()
+        && pp.field()
+        && t_GlobalVersion.print_skip(pp, cs)
+        && m_ == 8
+        && pp.close();
+  case cons9:
+    return pp.open()
+        && pp.field("mandatory_params")
+        && t_Hashmap_32_True.print_skip(pp, cs)
+        && m_ == 9
+        && pp.close();
+  case cons12:
+    return pp.open()
+        && pp.field("workchains")
+        && t_HashmapE_32_WorkchainDescr.print_skip(pp, cs)
+        && m_ == 12
+        && pp.close();
+  case cons14:
+    return pp.open()
+        && pp.field()
+        && t_BlockCreateFees.print_skip(pp, cs)
+        && m_ == 14
+        && pp.close();
+  case cons15:
+    return pp.open()
+        && pp.fetch_uint_field(cs, 32, "validators_elected_for")
+        && pp.fetch_uint_field(cs, 32, "elections_start_before")
+        && pp.fetch_uint_field(cs, 32, "elections_end_before")
+        && pp.fetch_uint_field(cs, 32, "stake_held_for")
+        && m_ == 15
+        && pp.close();
+  case cons16: {
+    int max_validators, max_main_validators, min_validators;
+    return pp.open()
+        && cs.fetch_uint_to(16, max_validators)
+        && pp.field_int(max_validators, "max_validators")
+        && cs.fetch_uint_to(16, max_main_validators)
+        && pp.field_int(max_main_validators, "max_main_validators")
+        && cs.fetch_uint_to(16, min_validators)
+        && pp.field_int(min_validators, "min_validators")
+        && max_main_validators <= max_validators
+        && min_validators <= max_main_validators
+        && 1 <= min_validators
+        && m_ == 16
+        && pp.close();
+    }
+  case cons17:
+    return pp.open()
+        && pp.field("min_stake")
+        && t_Grams.print_skip(pp, cs)
+        && pp.field("max_stake")
+        && t_Grams.print_skip(pp, cs)
+        && pp.field("min_total_stake")
+        && t_Grams.print_skip(pp, cs)
+        && pp.fetch_uint_field(cs, 32, "max_stake_factor")
+        && m_ == 17
+        && pp.close();
+  case cons18:
+    return pp.open()
+        && pp.field()
+        && t_Hashmap_32_StoragePrices.print_skip(pp, cs)
+        && m_ == 18
+        && pp.close();
+  case config_mc_gas_prices:
+    return pp.open("config_mc_gas_prices")
+        && pp.field()
+        && t_GasLimitsPrices.print_skip(pp, cs)
+        && m_ == 20
+        && pp.close();
+  case config_gas_prices:
+    return pp.open("config_gas_prices")
+        && pp.field()
+        && t_GasLimitsPrices.print_skip(pp, cs)
+        && m_ == 21
+        && pp.close();
+  case config_mc_block_limits:
+    return pp.open("config_mc_block_limits")
+        && pp.field()
+        && t_BlockLimits.print_skip(pp, cs)
+        && m_ == 22
+        && pp.close();
+  case config_block_limits:
+    return pp.open("config_block_limits")
+        && pp.field()
+        && t_BlockLimits.print_skip(pp, cs)
+        && m_ == 23
+        && pp.close();
+  case config_mc_fwd_prices:
+    return pp.open("config_mc_fwd_prices")
+        && pp.field()
+        && t_MsgForwardPrices.print_skip(pp, cs)
+        && m_ == 24
+        && pp.close();
+  case config_fwd_prices:
+    return pp.open("config_fwd_prices")
+        && pp.field()
+        && t_MsgForwardPrices.print_skip(pp, cs)
+        && m_ == 25
+        && pp.close();
+  case cons28:
+    return pp.open()
+        && pp.field()
+        && t_CatchainConfig.print_skip(pp, cs)
+        && m_ == 28
+        && pp.close();
+  case cons29:
+    return pp.open()
+        && pp.field()
+        && t_ConsensusConfig.print_skip(pp, cs)
+        && m_ == 29
+        && pp.close();
+  case cons31:
+    return pp.open()
+        && pp.field("fundamental_smc_addr")
+        && t_HashmapE_256_True.print_skip(pp, cs)
+        && m_ == 31
+        && pp.close();
+  case cons32:
+    return pp.open()
+        && pp.field("prev_validators")
+        && t_ValidatorSet.print_skip(pp, cs)
+        && m_ == 32
+        && pp.close();
+  case cons33:
+    return pp.open()
+        && pp.field("prev_temp_validators")
+        && t_ValidatorSet.print_skip(pp, cs)
+        && m_ == 33
+        && pp.close();
+  case cons34:
+    return pp.open()
+        && pp.field("cur_validators")
+        && t_ValidatorSet.print_skip(pp, cs)
+        && m_ == 34
+        && pp.close();
+  case cons35:
+    return pp.open()
+        && pp.field("cur_temp_validators")
+        && t_ValidatorSet.print_skip(pp, cs)
+        && m_ == 35
+        && pp.close();
+  case cons36:
+    return pp.open()
+        && pp.field("next_validators")
+        && t_ValidatorSet.print_skip(pp, cs)
+        && m_ == 36
+        && pp.close();
+  case cons37:
+    return pp.open()
+        && pp.field("next_temp_validators")
+        && t_ValidatorSet.print_skip(pp, cs)
+        && m_ == 37
+        && pp.close();
+  case cons39:
+    return pp.open()
+        && pp.field()
+        && t_HashmapE_256_ValidatorSignedTempKey.print_skip(pp, cs)
+        && m_ == 39
+        && pp.close();
+  }
+  return pp.fail("unknown constructor for ConfigParam");
+}
+
+
+//
+// code for type `BlockSignaturesPure`
+//
+
+int BlockSignaturesPure::check_tag(const vm::CellSlice& cs) const {
+  return block_signatures_pure;
+}
+
+bool BlockSignaturesPure::skip(vm::CellSlice& cs) const {
+  return cs.advance(96)
+      && t_HashmapE_16_CryptoSignaturePair.skip(cs);
+}
+
+bool BlockSignaturesPure::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.advance(96)
+      && t_HashmapE_16_CryptoSignaturePair.validate_skip(cs, weak);
+}
+
+bool BlockSignaturesPure::unpack(vm::CellSlice& cs, BlockSignaturesPure::Record& data) const {
+  return cs.fetch_uint_to(32, data.sig_count)
+      && cs.fetch_uint_to(64, data.sig_weight)
+      && t_HashmapE_16_CryptoSignaturePair.fetch_to(cs, data.signatures);
+}
+
+bool BlockSignaturesPure::unpack_block_signatures_pure(vm::CellSlice& cs, unsigned& sig_count, unsigned long long& sig_weight, Ref<CellSlice>& signatures) const {
+  return cs.fetch_uint_to(32, sig_count)
+      && cs.fetch_uint_to(64, sig_weight)
+      && t_HashmapE_16_CryptoSignaturePair.fetch_to(cs, signatures);
+}
+
+bool BlockSignaturesPure::cell_unpack(Ref<vm::Cell> cell_ref, BlockSignaturesPure::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BlockSignaturesPure::cell_unpack_block_signatures_pure(Ref<vm::Cell> cell_ref, unsigned& sig_count, unsigned long long& sig_weight, Ref<CellSlice>& signatures) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_block_signatures_pure(cs, sig_count, sig_weight, signatures) && cs.empty_ext();
+}
+
+bool BlockSignaturesPure::pack(vm::CellBuilder& cb, const BlockSignaturesPure::Record& data) const {
+  return cb.store_ulong_rchk_bool(data.sig_count, 32)
+      && cb.store_ulong_rchk_bool(data.sig_weight, 64)
+      && t_HashmapE_16_CryptoSignaturePair.store_from(cb, data.signatures);
+}
+
+bool BlockSignaturesPure::pack_block_signatures_pure(vm::CellBuilder& cb, unsigned sig_count, unsigned long long sig_weight, Ref<CellSlice> signatures) const {
+  return cb.store_ulong_rchk_bool(sig_count, 32)
+      && cb.store_ulong_rchk_bool(sig_weight, 64)
+      && t_HashmapE_16_CryptoSignaturePair.store_from(cb, signatures);
+}
+
+bool BlockSignaturesPure::cell_pack(Ref<vm::Cell>& cell_ref, const BlockSignaturesPure::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockSignaturesPure::cell_pack_block_signatures_pure(Ref<vm::Cell>& cell_ref, unsigned sig_count, unsigned long long sig_weight, Ref<CellSlice> signatures) const {
+  vm::CellBuilder cb;
+  return pack_block_signatures_pure(cb, sig_count, sig_weight, std::move(signatures)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockSignaturesPure::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return pp.open("block_signatures_pure")
+      && pp.fetch_uint_field(cs, 32, "sig_count")
+      && pp.fetch_uint_field(cs, 64, "sig_weight")
+      && pp.field("signatures")
+      && t_HashmapE_16_CryptoSignaturePair.print_skip(pp, cs)
+      && pp.close();
+}
+
+const BlockSignaturesPure t_BlockSignaturesPure;
+
+//
+// code for type `BlockSignatures`
+//
+constexpr unsigned char BlockSignatures::cons_tag[1];
+
+int BlockSignatures::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 17 ? block_signatures : -1;
+}
+
+bool BlockSignatures::skip(vm::CellSlice& cs) const {
+  return cs.advance(72)
+      && t_BlockSignaturesPure.skip(cs);
+}
+
+bool BlockSignatures::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(8) == 17
+      && cs.advance(64)
+      && t_BlockSignaturesPure.validate_skip(cs, weak);
+}
+
+bool BlockSignatures::unpack(vm::CellSlice& cs, BlockSignatures::Record& data) const {
+  return cs.fetch_ulong(8) == 17
+      && cs.fetch_subslice_to(64, data.validator_info)
+      && t_BlockSignaturesPure.fetch_to(cs, data.pure_signatures);
+}
+
+bool BlockSignatures::unpack_block_signatures(vm::CellSlice& cs, Ref<CellSlice>& validator_info, Ref<CellSlice>& pure_signatures) const {
+  return cs.fetch_ulong(8) == 17
+      && cs.fetch_subslice_to(64, validator_info)
+      && t_BlockSignaturesPure.fetch_to(cs, pure_signatures);
+}
+
+bool BlockSignatures::cell_unpack(Ref<vm::Cell> cell_ref, BlockSignatures::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BlockSignatures::cell_unpack_block_signatures(Ref<vm::Cell> cell_ref, Ref<CellSlice>& validator_info, Ref<CellSlice>& pure_signatures) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_block_signatures(cs, validator_info, pure_signatures) && cs.empty_ext();
+}
+
+bool BlockSignatures::pack(vm::CellBuilder& cb, const BlockSignatures::Record& data) const {
+  return cb.store_long_bool(17, 8)
+      && cb.append_cellslice_chk(data.validator_info, 64)
+      && t_BlockSignaturesPure.store_from(cb, data.pure_signatures);
+}
+
+bool BlockSignatures::pack_block_signatures(vm::CellBuilder& cb, Ref<CellSlice> validator_info, Ref<CellSlice> pure_signatures) const {
+  return cb.store_long_bool(17, 8)
+      && cb.append_cellslice_chk(validator_info, 64)
+      && t_BlockSignaturesPure.store_from(cb, pure_signatures);
+}
+
+bool BlockSignatures::cell_pack(Ref<vm::Cell>& cell_ref, const BlockSignatures::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockSignatures::cell_pack_block_signatures(Ref<vm::Cell>& cell_ref, Ref<CellSlice> validator_info, Ref<CellSlice> pure_signatures) const {
+  vm::CellBuilder cb;
+  return pack_block_signatures(cb, std::move(validator_info), std::move(pure_signatures)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockSignatures::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(8) == 17
+      && pp.open("block_signatures")
+      && pp.field("validator_info")
+      && t_ValidatorBaseInfo.print_skip(pp, cs)
+      && pp.field("pure_signatures")
+      && t_BlockSignaturesPure.print_skip(pp, cs)
+      && pp.close();
+}
+
+const BlockSignatures t_BlockSignatures;
+
+//
+// code for type `BlockProof`
+//
+constexpr unsigned char BlockProof::cons_tag[1];
+
+int BlockProof::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 0xc3 ? block_proof : -1;
+}
+
+bool BlockProof::skip(vm::CellSlice& cs) const {
+  return cs.advance_ext(0x10290)
+      && t_Maybe_Ref_BlockSignatures.skip(cs);
+}
+
+bool BlockProof::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(8) == 0xc3
+      && t_BlockIdExt.validate_skip(cs, weak)
+      && cs.advance_refs(1)
+      && t_Maybe_Ref_BlockSignatures.validate_skip(cs, weak);
+}
+
+bool BlockProof::unpack(vm::CellSlice& cs, BlockProof::Record& data) const {
+  return cs.fetch_ulong(8) == 0xc3
+      && cs.fetch_subslice_to(648, data.proof_for)
+      && cs.fetch_ref_to(data.root)
+      && t_Maybe_Ref_BlockSignatures.fetch_to(cs, data.signatures);
+}
+
+bool BlockProof::unpack_block_proof(vm::CellSlice& cs, Ref<CellSlice>& proof_for, Ref<Cell>& root, Ref<CellSlice>& signatures) const {
+  return cs.fetch_ulong(8) == 0xc3
+      && cs.fetch_subslice_to(648, proof_for)
+      && cs.fetch_ref_to(root)
+      && t_Maybe_Ref_BlockSignatures.fetch_to(cs, signatures);
+}
+
+bool BlockProof::cell_unpack(Ref<vm::Cell> cell_ref, BlockProof::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool BlockProof::cell_unpack_block_proof(Ref<vm::Cell> cell_ref, Ref<CellSlice>& proof_for, Ref<Cell>& root, Ref<CellSlice>& signatures) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_block_proof(cs, proof_for, root, signatures) && cs.empty_ext();
+}
+
+bool BlockProof::pack(vm::CellBuilder& cb, const BlockProof::Record& data) const {
+  return cb.store_long_bool(0xc3, 8)
+      && cb.append_cellslice_chk(data.proof_for, 648)
+      && cb.store_ref_bool(data.root)
+      && t_Maybe_Ref_BlockSignatures.store_from(cb, data.signatures);
+}
+
+bool BlockProof::pack_block_proof(vm::CellBuilder& cb, Ref<CellSlice> proof_for, Ref<Cell> root, Ref<CellSlice> signatures) const {
+  return cb.store_long_bool(0xc3, 8)
+      && cb.append_cellslice_chk(proof_for, 648)
+      && cb.store_ref_bool(root)
+      && t_Maybe_Ref_BlockSignatures.store_from(cb, signatures);
+}
+
+bool BlockProof::cell_pack(Ref<vm::Cell>& cell_ref, const BlockProof::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockProof::cell_pack_block_proof(Ref<vm::Cell>& cell_ref, Ref<CellSlice> proof_for, Ref<Cell> root, Ref<CellSlice> signatures) const {
+  vm::CellBuilder cb;
+  return pack_block_proof(cb, std::move(proof_for), std::move(root), std::move(signatures)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool BlockProof::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(8) == 0xc3
+      && pp.open("block_proof")
+      && pp.field("proof_for")
+      && t_BlockIdExt.print_skip(pp, cs)
+      && pp.field("root")
+      && t_Anything.print_ref(pp, cs.fetch_ref())
+      && pp.field("signatures")
+      && t_Maybe_Ref_BlockSignatures.print_skip(pp, cs)
+      && pp.close();
+}
+
+const BlockProof t_BlockProof;
+
+//
+// code for type `ProofChain`
+//
+
+int ProofChain::get_tag(const vm::CellSlice& cs) const {
+  // distinguish by parameter `m_` using 1 2 2 2
+  return m_ ? chain_link : chain_empty;
+}
+
+int ProofChain::check_tag(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case chain_empty:
+    return chain_empty;
+  case chain_link:
+    return chain_link;
+  }
+  return -1;
+}
+
+bool ProofChain::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case chain_empty:
+    return m_ == 0;
+  case chain_link: {
+    int n;
+    return add_r1(n, 1, m_)
+        && cs.advance_refs(1)
+        && (!n || cs.advance_refs(1));
+    }
+  }
+  return false;
+}
+
+bool ProofChain::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+  case chain_empty:
+    return m_ == 0;
+  case chain_link: {
+    int n;
+    return add_r1(n, 1, m_)
+        && cs.advance_refs(1)
+        && (!n || ProofChain{n}.validate_skip_ref(cs, weak));
+    }
+  }
+  return false;
+}
+
+bool ProofChain::unpack(vm::CellSlice& cs, ProofChain::Record_chain_empty& data) const {
+  return m_ == 0;
+}
+
+bool ProofChain::unpack_chain_empty(vm::CellSlice& cs) const {
+  return m_ == 0;
+}
+
+bool ProofChain::cell_unpack(Ref<vm::Cell> cell_ref, ProofChain::Record_chain_empty& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ProofChain::cell_unpack_chain_empty(Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_chain_empty(cs) && cs.empty_ext();
+}
+
+bool ProofChain::unpack(vm::CellSlice& cs, ProofChain::Record_chain_link& data) const {
+  return add_r1(data.n, 1, m_)
+      && cs.fetch_ref_to(data.root)
+      && (!data.n || cs.fetch_ref_to(data.prev));
+}
+
+bool ProofChain::unpack_chain_link(vm::CellSlice& cs, int& n, Ref<Cell>& root, Ref<Cell>& prev) const {
+  return add_r1(n, 1, m_)
+      && cs.fetch_ref_to(root)
+      && (!n || cs.fetch_ref_to(prev));
+}
+
+bool ProofChain::cell_unpack(Ref<vm::Cell> cell_ref, ProofChain::Record_chain_link& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool ProofChain::cell_unpack_chain_link(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& root, Ref<Cell>& prev) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_chain_link(cs, n, root, prev) && cs.empty_ext();
+}
+
+bool ProofChain::pack(vm::CellBuilder& cb, const ProofChain::Record_chain_empty& data) const {
+  return m_ == 0;
+}
+
+bool ProofChain::pack_chain_empty(vm::CellBuilder& cb) const {
+  return m_ == 0;
+}
+
+bool ProofChain::cell_pack(Ref<vm::Cell>& cell_ref, const ProofChain::Record_chain_empty& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ProofChain::cell_pack_chain_empty(Ref<vm::Cell>& cell_ref) const {
+  vm::CellBuilder cb;
+  return pack_chain_empty(cb) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ProofChain::pack(vm::CellBuilder& cb, const ProofChain::Record_chain_link& data) const {
+  int n;
+  return add_r1(n, 1, m_)
+      && cb.store_ref_bool(data.root)
+      && (!n || cb.store_ref_bool(data.prev));
+}
+
+bool ProofChain::pack_chain_link(vm::CellBuilder& cb, Ref<Cell> root, Ref<Cell> prev) const {
+  int n;
+  return add_r1(n, 1, m_)
+      && cb.store_ref_bool(root)
+      && (!n || cb.store_ref_bool(prev));
+}
+
+bool ProofChain::cell_pack(Ref<vm::Cell>& cell_ref, const ProofChain::Record_chain_link& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ProofChain::cell_pack_chain_link(Ref<vm::Cell>& cell_ref, Ref<Cell> root, Ref<Cell> prev) const {
+  vm::CellBuilder cb;
+  return pack_chain_link(cb, std::move(root), std::move(prev)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool ProofChain::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+  case chain_empty:
+    return pp.cons("chain_empty")
+        && m_ == 0;
+  case chain_link: {
+    int n;
+    return pp.open("chain_link")
+        && add_r1(n, 1, m_)
+        && pp.field("root")
+        && t_Anything.print_ref(pp, cs.fetch_ref())
+        && (!n || (pp.field("prev") && ProofChain{n}.print_ref(pp, cs.fetch_ref())))
+        && pp.close();
+    }
+  }
+  return pp.fail("unknown constructor for ProofChain");
+}
+
+
+//
+// code for type `TopBlockDescr`
+//
+constexpr unsigned char TopBlockDescr::cons_tag[1];
+
+int TopBlockDescr::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(8) == 0xd5 ? top_block_descr : -1;
+}
+
+bool TopBlockDescr::skip(vm::CellSlice& cs) const {
+  int len;
+  return cs.advance(656)
+      && t_Maybe_Ref_BlockSignatures.skip(cs)
+      && cs.fetch_uint_to(8, len)
+      && 1 <= len
+      && len <= 8
+      && ProofChain{len}.skip(cs);
+}
+
+bool TopBlockDescr::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int len;
+  return cs.fetch_ulong(8) == 0xd5
+      && t_BlockIdExt.validate_skip(cs, weak)
+      && t_Maybe_Ref_BlockSignatures.validate_skip(cs, weak)
+      && cs.fetch_uint_to(8, len)
+      && 1 <= len
+      && len <= 8
+      && ProofChain{len}.validate_skip(cs, weak);
+}
+
+bool TopBlockDescr::unpack(vm::CellSlice& cs, TopBlockDescr::Record& data) const {
+  return cs.fetch_ulong(8) == 0xd5
+      && cs.fetch_subslice_to(648, data.proof_for)
+      && t_Maybe_Ref_BlockSignatures.fetch_to(cs, data.signatures)
+      && cs.fetch_uint_to(8, data.len)
+      && 1 <= data.len
+      && data.len <= 8
+      && ProofChain{data.len}.fetch_to(cs, data.chain);
+}
+
+bool TopBlockDescr::cell_unpack(Ref<vm::Cell> cell_ref, TopBlockDescr::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TopBlockDescr::pack(vm::CellBuilder& cb, const TopBlockDescr::Record& data) const {
+  return cb.store_long_bool(0xd5, 8)
+      && cb.append_cellslice_chk(data.proof_for, 648)
+      && t_Maybe_Ref_BlockSignatures.store_from(cb, data.signatures)
+      && cb.store_ulong_rchk_bool(data.len, 8)
+      && 1 <= data.len
+      && data.len <= 8
+      && ProofChain{data.len}.store_from(cb, data.chain);
+}
+
+bool TopBlockDescr::cell_pack(Ref<vm::Cell>& cell_ref, const TopBlockDescr::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TopBlockDescr::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int len;
+  return cs.fetch_ulong(8) == 0xd5
+      && pp.open("top_block_descr")
+      && pp.field("proof_for")
+      && t_BlockIdExt.print_skip(pp, cs)
+      && pp.field("signatures")
+      && t_Maybe_Ref_BlockSignatures.print_skip(pp, cs)
+      && cs.fetch_uint_to(8, len)
+      && pp.field_int(len, "len")
+      && 1 <= len
+      && len <= 8
+      && pp.field("chain")
+      && ProofChain{len}.print_skip(pp, cs)
+      && pp.close();
+}
+
+const TopBlockDescr t_TopBlockDescr;
+
+//
+// code for type `TopBlockDescrSet`
+//
+constexpr unsigned TopBlockDescrSet::cons_tag[1];
+
+int TopBlockDescrSet::check_tag(const vm::CellSlice& cs) const {
+  return cs.prefetch_ulong(32) == 0x4ac789f3 ? top_block_descr_set : -1;
+}
+
+bool TopBlockDescrSet::skip(vm::CellSlice& cs) const {
+  return cs.advance(32)
+      && t_HashmapE_96_Ref_TopBlockDescr.skip(cs);
+}
+
+bool TopBlockDescrSet::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(32) == 0x4ac789f3
+      && t_HashmapE_96_Ref_TopBlockDescr.validate_skip(cs, weak);
+}
+
+bool TopBlockDescrSet::unpack(vm::CellSlice& cs, TopBlockDescrSet::Record& data) const {
+  return cs.fetch_ulong(32) == 0x4ac789f3
+      && t_HashmapE_96_Ref_TopBlockDescr.fetch_to(cs, data.collection);
+}
+
+bool TopBlockDescrSet::unpack_top_block_descr_set(vm::CellSlice& cs, Ref<CellSlice>& collection) const {
+  return cs.fetch_ulong(32) == 0x4ac789f3
+      && t_HashmapE_96_Ref_TopBlockDescr.fetch_to(cs, collection);
+}
+
+bool TopBlockDescrSet::cell_unpack(Ref<vm::Cell> cell_ref, TopBlockDescrSet::Record& data) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack(cs, data) && cs.empty_ext();
+}
+
+bool TopBlockDescrSet::cell_unpack_top_block_descr_set(Ref<vm::Cell> cell_ref, Ref<CellSlice>& collection) const {
+  if (cell_ref.is_null()) { return false; }
+  auto cs = load_cell_slice(std::move(cell_ref));
+  return unpack_top_block_descr_set(cs, collection) && cs.empty_ext();
+}
+
+bool TopBlockDescrSet::pack(vm::CellBuilder& cb, const TopBlockDescrSet::Record& data) const {
+  return cb.store_long_bool(0x4ac789f3, 32)
+      && t_HashmapE_96_Ref_TopBlockDescr.store_from(cb, data.collection);
+}
+
+bool TopBlockDescrSet::pack_top_block_descr_set(vm::CellBuilder& cb, Ref<CellSlice> collection) const {
+  return cb.store_long_bool(0x4ac789f3, 32)
+      && t_HashmapE_96_Ref_TopBlockDescr.store_from(cb, collection);
+}
+
+bool TopBlockDescrSet::cell_pack(Ref<vm::Cell>& cell_ref, const TopBlockDescrSet::Record& data) const {
+  vm::CellBuilder cb;
+  return pack(cb, data) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TopBlockDescrSet::cell_pack_top_block_descr_set(Ref<vm::Cell>& cell_ref, Ref<CellSlice> collection) const {
+  vm::CellBuilder cb;
+  return pack_top_block_descr_set(cb, std::move(collection)) && std::move(cb).finalize_to(cell_ref);
+}
+
+bool TopBlockDescrSet::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return cs.fetch_ulong(32) == 0x4ac789f3
+      && pp.open("top_block_descr_set")
+      && pp.field("collection")
+      && t_HashmapE_96_Ref_TopBlockDescr.print_skip(pp, cs)
+      && pp.close();
+}
+
+const TopBlockDescrSet t_TopBlockDescrSet;
+
+// definitions of constant types used
+
+const NatWidth t_natwidth_1{1};
+const NatWidth t_natwidth_9{9};
+const NatLeq t_natleq_30{30};
+const Maybe t_Maybe_Anycast{t_Anycast};
+const Int t_int8{8};
+const Bits t_bits256{256};
+const Int t_int32{32};
+const VarUInteger t_VarUInteger_16{16};
+const VarUInteger t_VarUInteger_32{32};
+const HashmapE t_HashmapE_32_VarUInteger_32{32, t_VarUInteger_32};
+const UInt t_uint64{64};
+const UInt t_uint32{32};
+const NatWidth t_natwidth_5{5};
+const Maybe t_Maybe_natwidth_5{t_natwidth_5};
+const Maybe t_Maybe_TickTock{t_TickTock};
+const Maybe t_Maybe_Ref_Cell{t_RefCell};
+const HashmapE t_HashmapE_256_SimpleLib{256, t_SimpleLib};
+const RefT t_Ref_StateInit{t_StateInit};
+const Either t_Either_StateInit_Ref_StateInit{t_StateInit, t_Ref_StateInit};
+const Maybe t_Maybe_Either_StateInit_Ref_StateInit{t_Either_StateInit_Ref_StateInit};
+const NatLeq t_natleq_96{96};
+const Message t_Message_Any{t_Anything};
+const RefT t_Ref_Message_Any{t_Message_Any};
+const RefT t_Ref_Transaction{t_Transaction};
+const RefT t_Ref_MsgEnvelope{t_MsgEnvelope};
+const HashmapAugE t_HashmapAugE_256_InMsg_ImportFees{256, t_InMsg, t_ImportFees};
+const RefT t_Ref_InMsg{t_InMsg};
+const HashmapAugE t_HashmapAugE_256_OutMsg_CurrencyCollection{256, t_OutMsg, t_CurrencyCollection};
+const HashmapAugE t_HashmapAugE_352_EnqueuedMsg_uint64{352, t_EnqueuedMsg, t_uint64};
+const HashmapE t_HashmapE_96_ProcessedUpto{96, t_ProcessedUpto};
+const HashmapE t_HashmapE_320_IhrPendingSince{320, t_IhrPendingSince};
+const VarUInteger t_VarUInteger_7{7};
+const Maybe t_Maybe_Grams{t_Grams};
+const RefT t_Ref_Account{t_Account};
+const HashmapAugE t_HashmapAugE_256_ShardAccount_DepthBalanceInfo{256, t_ShardAccount, t_DepthBalanceInfo};
+const UInt t_uint15{15};
+const Maybe t_Maybe_Ref_Message_Any{t_Ref_Message_Any};
+const HashmapE t_HashmapE_15_Ref_Message_Any{15, t_Ref_Message_Any};
+const RefT t_Ref_TYPE_1613{t_Transaction_aux};
+const HASH_UPDATE t_HASH_UPDATE_Account{t_Account};
+const RefT t_Ref_HASH_UPDATE_Account{t_HASH_UPDATE_Account};
+const RefT t_Ref_TransactionDescr{t_TransactionDescr};
+const HashmapAug t_HashmapAug_64_Ref_Transaction_CurrencyCollection{64, t_Ref_Transaction, t_CurrencyCollection};
+const HashmapAugE t_HashmapAugE_256_AccountBlock_CurrencyCollection{256, t_AccountBlock, t_CurrencyCollection};
+const VarUInteger t_VarUInteger_3{3};
+const Maybe t_Maybe_VarUInteger_3{t_VarUInteger_3};
+const Maybe t_Maybe_int32{t_int32};
+const RefT t_Ref_TYPE_1624{t_TrComputePhase_aux};
+const UInt t_uint16{16};
+const Maybe t_Maybe_TrStoragePhase{t_TrStoragePhase};
+const Maybe t_Maybe_TrCreditPhase{t_TrCreditPhase};
+const RefT t_Ref_TrActionPhase{t_TrActionPhase};
+const Maybe t_Maybe_Ref_TrActionPhase{t_Ref_TrActionPhase};
+const Maybe t_Maybe_TrBouncePhase{t_TrBouncePhase};
+const NatWidth t_natwidth_6{6};
+const NatWidth t_natwidth_8{8};
+const MessageRelaxed t_MessageRelaxed_Any{t_Anything};
+const RefT t_Ref_MessageRelaxed_Any{t_MessageRelaxed_Any};
+const NatLeq t_natleq_60{60};
+const RefT t_Ref_OutMsgQueueInfo{t_OutMsgQueueInfo};
+const RefT t_Ref_ShardAccounts{t_ShardAccounts};
+const HashmapE t_HashmapE_256_LibDescr{256, t_LibDescr};
+const Maybe t_Maybe_BlkMasterInfo{t_BlkMasterInfo};
+const RefT t_Ref_TYPE_1637{t_ShardStateUnsplit_aux};
+const RefT t_Ref_McStateExtra{t_McStateExtra};
+const Maybe t_Maybe_Ref_McStateExtra{t_Ref_McStateExtra};
+const RefT t_Ref_ShardStateUnsplit{t_ShardStateUnsplit};
+const Hashmap t_Hashmap_256_True{256, t_True};
+const RefT t_Ref_BlkMasterInfo{t_BlkMasterInfo};
+const BlkPrevInfo t_BlkPrevInfo_0{0};
+const RefT t_Ref_BlkPrevInfo_0{t_BlkPrevInfo_0};
+const RefT t_Ref_ExtBlkRef{t_ExtBlkRef};
+const RefT t_Ref_BlockInfo{t_BlockInfo};
+const RefT t_Ref_ValueFlow{t_ValueFlow};
+const MERKLE_UPDATE t_MERKLE_UPDATE_ShardState{t_ShardState};
+const RefT t_Ref_MERKLE_UPDATE_ShardState{t_MERKLE_UPDATE_ShardState};
+const RefT t_Ref_BlockExtra{t_BlockExtra};
+const RefT t_Ref_InMsgDescr{t_InMsgDescr};
+const RefT t_Ref_OutMsgDescr{t_OutMsgDescr};
+const RefT t_Ref_ShardAccountBlocks{t_ShardAccountBlocks};
+const RefT t_Ref_McBlockExtra{t_McBlockExtra};
+const Maybe t_Maybe_Ref_McBlockExtra{t_Ref_McBlockExtra};
+const RefT t_Ref_TYPE_1647{t_ValueFlow_aux};
+const RefT t_Ref_TYPE_1648{t_ValueFlow_aux1};
+const NatWidth t_natwidth_3{3};
+const BinTree t_BinTree_ShardDescr{t_ShardDescr};
+const RefT t_Ref_BinTree_ShardDescr{t_BinTree_ShardDescr};
+const HashmapE t_HashmapE_32_Ref_BinTree_ShardDescr{32, t_Ref_BinTree_ShardDescr};
+const HashmapAugE t_HashmapAugE_96_ShardFeeCreated_ShardFeeCreated{96, t_ShardFeeCreated, t_ShardFeeCreated};
+const Hashmap t_Hashmap_32_Ref_Cell{32, t_RefCell};
+const RefT t_Ref_Hashmap_32_Ref_Cell{t_Hashmap_32_Ref_Cell};
+const HashmapAugE t_HashmapAugE_32_KeyExtBlkRef_KeyMaxLt{32, t_KeyExtBlkRef, t_KeyMaxLt};
+const HashmapE t_HashmapE_256_CreatorStats{256, t_CreatorStats};
+const NatWidth t_natwidth_16{16};
+const Maybe t_Maybe_ExtBlkRef{t_ExtBlkRef};
+const RefT t_Ref_TYPE_1665{t_McStateExtra_aux};
+const RefT t_Ref_SignedCertificate{t_SignedCertificate};
+const HashmapE t_HashmapE_16_CryptoSignaturePair{16, t_CryptoSignaturePair};
+const Maybe t_Maybe_Ref_InMsg{t_Ref_InMsg};
+const RefT t_Ref_TYPE_1673{t_McBlockExtra_aux};
+const Hashmap t_Hashmap_16_ValidatorDescr{16, t_ValidatorDescr};
+const Hashmap t_Hashmap_32_True{32, t_True};
+const NatWidth t_natwidth_12{12};
+const NatWidth t_natwidth_32{32};
+const NatWidth t_natwidth_13{13};
+const HashmapE t_HashmapE_32_WorkchainDescr{32, t_WorkchainDescr};
+const Hashmap t_Hashmap_32_StoragePrices{32, t_StoragePrices};
+const HashmapE t_HashmapE_256_True{256, t_True};
+const RefT t_Ref_ValidatorTempKey{t_ValidatorTempKey};
+const HashmapE t_HashmapE_256_ValidatorSignedTempKey{256, t_ValidatorSignedTempKey};
+const RefT t_Ref_BlockSignatures{t_BlockSignatures};
+const Maybe t_Maybe_Ref_BlockSignatures{t_Ref_BlockSignatures};
+const RefT t_Ref_TopBlockDescr{t_TopBlockDescr};
+const HashmapE t_HashmapE_96_Ref_TopBlockDescr{96, t_Ref_TopBlockDescr};
+
+} // namespace gen
+
+} // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/block-auto.h b/submodules/ton/tonlib-src/crypto/block/block-auto.h
new file mode 100644
index 0000000000..66b9700333
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/block-auto.h
@@ -0,0 +1,7450 @@
+#pragma once
+#include <tl/tlblib.hpp>
+/*
+ *
+ *  AUTO-GENERATED FROM `block.tlb`
+ *
+ */
+// uses built-in type `#`
+// uses built-in type `##`
+// uses built-in type `#<`
+// uses built-in type `#<=`
+// uses built-in type `Any`
+// uses built-in type `Cell`
+// uses built-in type `int`
+// uses built-in type `uint`
+// uses built-in type `bits`
+// uses built-in type `int8`
+// uses built-in type `uint15`
+// uses built-in type `uint16`
+// uses built-in type `int32`
+// uses built-in type `uint32`
+// uses built-in type `uint64`
+// uses built-in type `bits256`
+
+namespace block {
+
+namespace gen {
+using namespace ::tlb;
+using td::Ref;
+using vm::CellSlice;
+using vm::Cell;
+using td::RefInt256;
+
+//
+// headers for type `Unit`
+//
+
+struct Unit final : TLB_Complex {
+  enum { unit };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef Unit type_class;
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return true;
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return true;
+  }
+  bool fetch_enum_to(vm::CellSlice& cs, char& value) const;
+  bool store_enum_from(vm::CellBuilder& cb, int value) const;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_unit(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_unit(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_unit(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_unit(Ref<vm::Cell>& cell_ref) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Unit";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const Unit t_Unit;
+
+//
+// headers for type `True`
+//
+
+struct True final : TLB_Complex {
+  enum { true1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef True type_class;
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return true;
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return true;
+  }
+  bool fetch_enum_to(vm::CellSlice& cs, char& value) const;
+  bool store_enum_from(vm::CellBuilder& cb, int value) const;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_true1(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_true1(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_true1(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_true1(Ref<vm::Cell>& cell_ref) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "True";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const True t_True;
+
+//
+// headers for type `Bool`
+//
+
+struct Bool final : TLB_Complex {
+  enum { bool_false, bool_true };
+  static constexpr int cons_len_exact = 1;
+  struct Record_bool_false {
+    typedef Bool type_class;
+  };
+  struct Record_bool_true {
+    typedef Bool type_class;
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 1;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(1);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(1);
+  }
+  bool fetch_enum_to(vm::CellSlice& cs, char& value) const;
+  bool store_enum_from(vm::CellBuilder& cb, int value) const;
+  bool unpack(vm::CellSlice& cs, Record_bool_false& data) const;
+  bool unpack_bool_false(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_bool_false& data) const;
+  bool cell_unpack_bool_false(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_bool_false& data) const;
+  bool pack_bool_false(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_bool_false& data) const;
+  bool cell_pack_bool_false(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_bool_true& data) const;
+  bool unpack_bool_true(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_bool_true& data) const;
+  bool cell_unpack_bool_true(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_bool_true& data) const;
+  bool pack_bool_true(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_bool_true& data) const;
+  bool cell_pack_bool_true(Ref<vm::Cell>& cell_ref) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Bool";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+extern const Bool t_Bool;
+
+//
+// headers for type `BoolFalse`
+//
+
+struct BoolFalse final : TLB_Complex {
+  enum { bool_false };
+  static constexpr int cons_len_exact = 1;
+  struct Record {
+    typedef BoolFalse type_class;
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 1;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(1);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool fetch_enum_to(vm::CellSlice& cs, char& value) const;
+  bool store_enum_from(vm::CellBuilder& cb, int value) const;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_bool_false(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_bool_false(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_bool_false(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_bool_false(Ref<vm::Cell>& cell_ref) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "BoolFalse";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const BoolFalse t_BoolFalse;
+
+//
+// headers for type `BoolTrue`
+//
+
+struct BoolTrue final : TLB_Complex {
+  enum { bool_true };
+  static constexpr int cons_len_exact = 1;
+  static constexpr unsigned char cons_tag[1] = { 1 };
+  struct Record {
+    typedef BoolTrue type_class;
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 1;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(1);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool fetch_enum_to(vm::CellSlice& cs, char& value) const;
+  bool store_enum_from(vm::CellBuilder& cb, int value) const;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_bool_true(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_bool_true(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_bool_true(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_bool_true(Ref<vm::Cell>& cell_ref) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "BoolTrue";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const BoolTrue t_BoolTrue;
+
+//
+// headers for type `Maybe`
+//
+
+struct Maybe final : TLB_Complex {
+  enum { nothing, just };
+  static constexpr int cons_len_exact = 1;
+  const TLB &X_;
+  Maybe(const TLB& X) : X_(X) {}
+  struct Record_nothing {
+    typedef Maybe type_class;
+  };
+  struct Record_just {
+    typedef Maybe type_class;
+    Ref<CellSlice> value;  	// value : X
+    Record_just() = default;
+    Record_just(Ref<CellSlice> _value) : value(std::move(_value)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_nothing& data) const;
+  bool unpack_nothing(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_nothing& data) const;
+  bool cell_unpack_nothing(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_nothing& data) const;
+  bool pack_nothing(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_nothing& data) const;
+  bool cell_pack_nothing(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_just& data) const;
+  bool unpack_just(vm::CellSlice& cs, Ref<CellSlice>& value) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_just& data) const;
+  bool cell_unpack_just(Ref<vm::Cell> cell_ref, Ref<CellSlice>& value) const;
+  bool pack(vm::CellBuilder& cb, const Record_just& data) const;
+  bool pack_just(vm::CellBuilder& cb, Ref<CellSlice> value) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_just& data) const;
+  bool cell_pack_just(Ref<vm::Cell>& cell_ref, Ref<CellSlice> value) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(Maybe " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+//
+// headers for type `Either`
+//
+
+struct Either final : TLB_Complex {
+  enum { left, right };
+  static constexpr int cons_len_exact = 1;
+  const TLB &X_, &Y_;
+  Either(const TLB& X, const TLB& Y) : X_(X), Y_(Y) {}
+  struct Record_left {
+    typedef Either type_class;
+    Ref<CellSlice> value;  	// value : X
+    Record_left() = default;
+    Record_left(Ref<CellSlice> _value) : value(std::move(_value)) {}
+  };
+  struct Record_right {
+    typedef Either type_class;
+    Ref<CellSlice> value;  	// value : Y
+    Record_right() = default;
+    Record_right(Ref<CellSlice> _value) : value(std::move(_value)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_left& data) const;
+  bool unpack_left(vm::CellSlice& cs, Ref<CellSlice>& value) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_left& data) const;
+  bool cell_unpack_left(Ref<vm::Cell> cell_ref, Ref<CellSlice>& value) const;
+  bool pack(vm::CellBuilder& cb, const Record_left& data) const;
+  bool pack_left(vm::CellBuilder& cb, Ref<CellSlice> value) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_left& data) const;
+  bool cell_pack_left(Ref<vm::Cell>& cell_ref, Ref<CellSlice> value) const;
+  bool unpack(vm::CellSlice& cs, Record_right& data) const;
+  bool unpack_right(vm::CellSlice& cs, Ref<CellSlice>& value) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_right& data) const;
+  bool cell_unpack_right(Ref<vm::Cell> cell_ref, Ref<CellSlice>& value) const;
+  bool pack(vm::CellBuilder& cb, const Record_right& data) const;
+  bool pack_right(vm::CellBuilder& cb, Ref<CellSlice> value) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_right& data) const;
+  bool cell_pack_right(Ref<vm::Cell>& cell_ref, Ref<CellSlice> value) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(Either " << X_ << " " << Y_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+//
+// headers for type `Both`
+//
+
+struct Both final : TLB_Complex {
+  enum { pair };
+  static constexpr int cons_len_exact = 0;
+  const TLB &X_, &Y_;
+  Both(const TLB& X, const TLB& Y) : X_(X), Y_(Y) {}
+  struct Record {
+    typedef Both type_class;
+    Ref<CellSlice> first;  	// first : X
+    Ref<CellSlice> second;  	// second : Y
+    Record() = default;
+    Record(Ref<CellSlice> _first, Ref<CellSlice> _second) : first(std::move(_first)), second(std::move(_second)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_pair(vm::CellSlice& cs, Ref<CellSlice>& first, Ref<CellSlice>& second) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_pair(Ref<vm::Cell> cell_ref, Ref<CellSlice>& first, Ref<CellSlice>& second) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_pair(vm::CellBuilder& cb, Ref<CellSlice> first, Ref<CellSlice> second) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_pair(Ref<vm::Cell>& cell_ref, Ref<CellSlice> first, Ref<CellSlice> second) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(Both " << X_ << " " << Y_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+//
+// headers for type `Bit`
+//
+
+struct Bit final : TLB_Complex {
+  enum { bit };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef Bit type_class;
+    bool x;  	// ## 1
+    Record() = default;
+    Record(bool _x) : x(_x) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 1;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(1);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(1);
+  }
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_bit(vm::CellSlice& cs, bool& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_bit(Ref<vm::Cell> cell_ref, bool& x) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_bit(vm::CellBuilder& cb, bool x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_bit(Ref<vm::Cell>& cell_ref, bool x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Bit";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const Bit t_Bit;
+
+//
+// headers for type `Hashmap`
+//
+
+struct Hashmap final : TLB_Complex {
+  enum { hm_edge };
+  static constexpr int cons_len_exact = 0;
+  int m_;
+  const TLB &X_;
+  Hashmap(int m, const TLB& X) : m_(m), X_(X) {}
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(Hashmap " << m_ << " " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct Hashmap::Record {
+  typedef Hashmap type_class;
+  int n;  	// n : #
+  int l;  	// l : #
+  int m;  	// m : #
+  Ref<CellSlice> label;  	// label : HmLabel ~l n
+  Ref<CellSlice> node;  	// node : HashmapNode m X
+  Record() = default;
+  Record(Ref<CellSlice> _label, Ref<CellSlice> _node) : n(-1), l(-1), m(-1), label(std::move(_label)), node(std::move(_node)) {}
+};
+
+//
+// headers for type `HashmapNode`
+//
+
+struct HashmapNode final : TLB_Complex {
+  enum { hmn_leaf, hmn_fork };
+  static constexpr int cons_len_exact = 0;
+  int m_;
+  const TLB &X_;
+  HashmapNode(int m, const TLB& X) : m_(m), X_(X) {}
+  struct Record_hmn_leaf {
+    typedef HashmapNode type_class;
+    Ref<CellSlice> value;  	// value : X
+    Record_hmn_leaf() = default;
+    Record_hmn_leaf(Ref<CellSlice> _value) : value(std::move(_value)) {}
+  };
+  struct Record_hmn_fork;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_hmn_leaf& data) const;
+  bool unpack_hmn_leaf(vm::CellSlice& cs, Ref<CellSlice>& value) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_hmn_leaf& data) const;
+  bool cell_unpack_hmn_leaf(Ref<vm::Cell> cell_ref, Ref<CellSlice>& value) const;
+  bool pack(vm::CellBuilder& cb, const Record_hmn_leaf& data) const;
+  bool pack_hmn_leaf(vm::CellBuilder& cb, Ref<CellSlice> value) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_hmn_leaf& data) const;
+  bool cell_pack_hmn_leaf(Ref<vm::Cell>& cell_ref, Ref<CellSlice> value) const;
+  bool unpack(vm::CellSlice& cs, Record_hmn_fork& data) const;
+  bool unpack_hmn_fork(vm::CellSlice& cs, int& n, Ref<Cell>& left, Ref<Cell>& right) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_hmn_fork& data) const;
+  bool cell_unpack_hmn_fork(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& left, Ref<Cell>& right) const;
+  bool pack(vm::CellBuilder& cb, const Record_hmn_fork& data) const;
+  bool pack_hmn_fork(vm::CellBuilder& cb, Ref<Cell> left, Ref<Cell> right) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_hmn_fork& data) const;
+  bool cell_pack_hmn_fork(Ref<vm::Cell>& cell_ref, Ref<Cell> left, Ref<Cell> right) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(HashmapNode " << m_ << " " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override;
+};
+
+struct HashmapNode::Record_hmn_fork {
+  typedef HashmapNode type_class;
+  int n;  	// n : #
+  Ref<Cell> left;  	// left : ^(Hashmap n X)
+  Ref<Cell> right;  	// right : ^(Hashmap n X)
+  Record_hmn_fork() = default;
+  Record_hmn_fork(Ref<Cell> _left, Ref<Cell> _right) : n(-1), left(std::move(_left)), right(std::move(_right)) {}
+};
+
+//
+// headers for type `HmLabel`
+//
+
+struct HmLabel final : TLB_Complex {
+  enum { hml_short, hml_long, hml_same };
+  static constexpr char cons_len[3] = { 1, 2, 2 };
+  static constexpr unsigned char cons_tag[3] = { 0, 2, 3 };
+  int n_;
+  HmLabel(int n) : n_(n) {}
+  struct Record_hml_short;
+  struct Record_hml_long;
+  struct Record_hml_same;
+  bool skip(vm::CellSlice& cs) const override;
+  bool skip(vm::CellSlice& cs, int& m_) const;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak, int& m_) const;
+  bool fetch_to(vm::CellSlice& cs, Ref<vm::CellSlice>& res, int& m_) const;
+  bool unpack(vm::CellSlice& cs, Record_hml_short& data, int& m_) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_hml_short& data, int& m_) const;
+  bool pack(vm::CellBuilder& cb, const Record_hml_short& data, int& m_) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_hml_short& data, int& m_) const;
+  bool unpack(vm::CellSlice& cs, Record_hml_long& data, int& m_) const;
+  bool unpack_hml_long(vm::CellSlice& cs, int& m, int& n, Ref<td::BitString>& s, int& m_) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_hml_long& data, int& m_) const;
+  bool cell_unpack_hml_long(Ref<vm::Cell> cell_ref, int& m, int& n, Ref<td::BitString>& s, int& m_) const;
+  bool pack(vm::CellBuilder& cb, const Record_hml_long& data, int& m_) const;
+  bool pack_hml_long(vm::CellBuilder& cb, int n, Ref<td::BitString> s, int& m_) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_hml_long& data, int& m_) const;
+  bool cell_pack_hml_long(Ref<vm::Cell>& cell_ref, int n, Ref<td::BitString> s, int& m_) const;
+  bool unpack(vm::CellSlice& cs, Record_hml_same& data, int& m_) const;
+  bool unpack_hml_same(vm::CellSlice& cs, int& m, bool& v, int& n, int& m_) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_hml_same& data, int& m_) const;
+  bool cell_unpack_hml_same(Ref<vm::Cell> cell_ref, int& m, bool& v, int& n, int& m_) const;
+  bool pack(vm::CellBuilder& cb, const Record_hml_same& data, int& m_) const;
+  bool pack_hml_same(vm::CellBuilder& cb, bool v, int n, int& m_) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_hml_same& data, int& m_) const;
+  bool cell_pack_hml_same(Ref<vm::Cell>& cell_ref, bool v, int n, int& m_) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs, int& m_) const;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(HmLabel ~m_ " << n_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(2, 13);
+  }
+};
+
+struct HmLabel::Record_hml_short {
+  typedef HmLabel type_class;
+  int m;  	// m : #
+  int n;  	// n : #
+  Ref<CellSlice> len;  	// len : Unary ~n
+  Ref<td::BitString> s;  	// s : n * Bit
+  Record_hml_short() = default;
+  Record_hml_short(Ref<CellSlice> _len, Ref<td::BitString> _s) : m(-1), n(-1), len(std::move(_len)), s(std::move(_s)) {}
+};
+
+struct HmLabel::Record_hml_long {
+  typedef HmLabel type_class;
+  int m;  	// m : #
+  int n;  	// n : #<= m
+  Ref<td::BitString> s;  	// s : n * Bit
+  Record_hml_long() = default;
+  Record_hml_long(int _n, Ref<td::BitString> _s) : m(-1), n(_n), s(std::move(_s)) {}
+};
+
+struct HmLabel::Record_hml_same {
+  typedef HmLabel type_class;
+  int m;  	// m : #
+  bool v;  	// v : Bit
+  int n;  	// n : #<= m
+  Record_hml_same() = default;
+  Record_hml_same(bool _v, int _n) : m(-1), v(_v), n(_n) {}
+};
+
+//
+// headers for type `Unary`
+//
+
+struct Unary final : TLB_Complex {
+  enum { unary_zero, unary_succ };
+  static constexpr int cons_len_exact = 1;
+  struct Record_unary_zero {
+    typedef Unary type_class;
+  };
+  struct Record_unary_succ {
+    typedef Unary type_class;
+    int n;  	// n : #
+    Ref<CellSlice> x;  	// x : Unary ~n
+    Record_unary_succ() = default;
+    Record_unary_succ(Ref<CellSlice> _x) : n(-1), x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool skip(vm::CellSlice& cs, int& m_) const;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak, int& m_) const;
+  bool fetch_to(vm::CellSlice& cs, Ref<vm::CellSlice>& res, int& m_) const;
+  bool unpack(vm::CellSlice& cs, Record_unary_zero& data, int& m_) const;
+  bool unpack_unary_zero(vm::CellSlice& cs, int& m_) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_unary_zero& data, int& m_) const;
+  bool cell_unpack_unary_zero(Ref<vm::Cell> cell_ref, int& m_) const;
+  bool pack(vm::CellBuilder& cb, const Record_unary_zero& data, int& m_) const;
+  bool pack_unary_zero(vm::CellBuilder& cb, int& m_) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_unary_zero& data, int& m_) const;
+  bool cell_pack_unary_zero(Ref<vm::Cell>& cell_ref, int& m_) const;
+  bool unpack(vm::CellSlice& cs, Record_unary_succ& data, int& m_) const;
+  bool unpack_unary_succ(vm::CellSlice& cs, int& n, Ref<CellSlice>& x, int& m_) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_unary_succ& data, int& m_) const;
+  bool cell_unpack_unary_succ(Ref<vm::Cell> cell_ref, int& n, Ref<CellSlice>& x, int& m_) const;
+  bool pack(vm::CellBuilder& cb, const Record_unary_succ& data, int& m_) const;
+  bool pack_unary_succ(vm::CellBuilder& cb, Ref<CellSlice> x, int& m_) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_unary_succ& data, int& m_) const;
+  bool cell_pack_unary_succ(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x, int& m_) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs, int& m_) const;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(Unary ~m_)";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+extern const Unary t_Unary;
+
+//
+// headers for type `HashmapE`
+//
+
+struct HashmapE final : TLB_Complex {
+  enum { hme_empty, hme_root };
+  static constexpr int cons_len_exact = 1;
+  int m_;
+  const TLB &X_;
+  HashmapE(int m, const TLB& X) : m_(m), X_(X) {}
+  struct Record_hme_empty {
+    typedef HashmapE type_class;
+  };
+  struct Record_hme_root {
+    typedef HashmapE type_class;
+    int n;  	// n : #
+    Ref<Cell> root;  	// root : ^(Hashmap n X)
+    Record_hme_root() = default;
+    Record_hme_root(Ref<Cell> _root) : n(-1), root(std::move(_root)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_hme_empty& data) const;
+  bool unpack_hme_empty(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_hme_empty& data) const;
+  bool cell_unpack_hme_empty(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_hme_empty& data) const;
+  bool pack_hme_empty(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_hme_empty& data) const;
+  bool cell_pack_hme_empty(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_hme_root& data) const;
+  bool unpack_hme_root(vm::CellSlice& cs, int& n, Ref<Cell>& root) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_hme_root& data) const;
+  bool cell_unpack_hme_root(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& root) const;
+  bool pack(vm::CellBuilder& cb, const Record_hme_root& data) const;
+  bool pack_hme_root(vm::CellBuilder& cb, Ref<Cell> root) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_hme_root& data) const;
+  bool cell_pack_hme_root(Ref<vm::Cell>& cell_ref, Ref<Cell> root) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(HashmapE " << m_ << " " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+//
+// headers for type `BitstringSet`
+//
+
+struct BitstringSet final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  int m_;
+  BitstringSet(int m) : m_(m) {}
+  struct Record {
+    typedef BitstringSet type_class;
+    int n;  	// n : #
+    Ref<CellSlice> x;  	// Hashmap n True
+    Record() = default;
+    Record(Ref<CellSlice> _x) : n(-1), x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, int& n, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, int& n, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(BitstringSet " << m_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+//
+// headers for type `HashmapAug`
+//
+
+struct HashmapAug final : TLB_Complex {
+  enum { ahm_edge };
+  static constexpr int cons_len_exact = 0;
+  int m_;
+  const TLB &X_, &Y_;
+  HashmapAug(int m, const TLB& X, const TLB& Y) : m_(m), X_(X), Y_(Y) {}
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(HashmapAug " << m_ << " " << X_ << " " << Y_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct HashmapAug::Record {
+  typedef HashmapAug type_class;
+  int n;  	// n : #
+  int l;  	// l : #
+  int m;  	// m : #
+  Ref<CellSlice> label;  	// label : HmLabel ~l n
+  Ref<CellSlice> node;  	// node : HashmapAugNode m X Y
+  Record() = default;
+  Record(Ref<CellSlice> _label, Ref<CellSlice> _node) : n(-1), l(-1), m(-1), label(std::move(_label)), node(std::move(_node)) {}
+};
+
+//
+// headers for type `HashmapAugNode`
+//
+
+struct HashmapAugNode final : TLB_Complex {
+  enum { ahmn_leaf, ahmn_fork };
+  static constexpr int cons_len_exact = 0;
+  int m_;
+  const TLB &X_, &Y_;
+  HashmapAugNode(int m, const TLB& X, const TLB& Y) : m_(m), X_(X), Y_(Y) {}
+  struct Record_ahmn_leaf {
+    typedef HashmapAugNode type_class;
+    Ref<CellSlice> extra;  	// extra : Y
+    Ref<CellSlice> value;  	// value : X
+    Record_ahmn_leaf() = default;
+    Record_ahmn_leaf(Ref<CellSlice> _extra, Ref<CellSlice> _value) : extra(std::move(_extra)), value(std::move(_value)) {}
+  };
+  struct Record_ahmn_fork;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_ahmn_leaf& data) const;
+  bool unpack_ahmn_leaf(vm::CellSlice& cs, Ref<CellSlice>& extra, Ref<CellSlice>& value) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_ahmn_leaf& data) const;
+  bool cell_unpack_ahmn_leaf(Ref<vm::Cell> cell_ref, Ref<CellSlice>& extra, Ref<CellSlice>& value) const;
+  bool pack(vm::CellBuilder& cb, const Record_ahmn_leaf& data) const;
+  bool pack_ahmn_leaf(vm::CellBuilder& cb, Ref<CellSlice> extra, Ref<CellSlice> value) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_ahmn_leaf& data) const;
+  bool cell_pack_ahmn_leaf(Ref<vm::Cell>& cell_ref, Ref<CellSlice> extra, Ref<CellSlice> value) const;
+  bool unpack(vm::CellSlice& cs, Record_ahmn_fork& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_ahmn_fork& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_ahmn_fork& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_ahmn_fork& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(HashmapAugNode " << m_ << " " << X_ << " " << Y_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override;
+};
+
+struct HashmapAugNode::Record_ahmn_fork {
+  typedef HashmapAugNode type_class;
+  int n;  	// n : #
+  Ref<Cell> left;  	// left : ^(HashmapAug n X Y)
+  Ref<Cell> right;  	// right : ^(HashmapAug n X Y)
+  Ref<CellSlice> extra;  	// extra : Y
+  Record_ahmn_fork() = default;
+  Record_ahmn_fork(Ref<Cell> _left, Ref<Cell> _right, Ref<CellSlice> _extra) : n(-1), left(std::move(_left)), right(std::move(_right)), extra(std::move(_extra)) {}
+};
+
+//
+// headers for type `HashmapAugE`
+//
+
+struct HashmapAugE final : TLB_Complex {
+  enum { ahme_empty, ahme_root };
+  static constexpr int cons_len_exact = 1;
+  int m_;
+  const TLB &X_, &Y_;
+  HashmapAugE(int m, const TLB& X, const TLB& Y) : m_(m), X_(X), Y_(Y) {}
+  struct Record_ahme_empty {
+    typedef HashmapAugE type_class;
+    Ref<CellSlice> extra;  	// extra : Y
+    Record_ahme_empty() = default;
+    Record_ahme_empty(Ref<CellSlice> _extra) : extra(std::move(_extra)) {}
+  };
+  struct Record_ahme_root;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_ahme_empty& data) const;
+  bool unpack_ahme_empty(vm::CellSlice& cs, Ref<CellSlice>& extra) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_ahme_empty& data) const;
+  bool cell_unpack_ahme_empty(Ref<vm::Cell> cell_ref, Ref<CellSlice>& extra) const;
+  bool pack(vm::CellBuilder& cb, const Record_ahme_empty& data) const;
+  bool pack_ahme_empty(vm::CellBuilder& cb, Ref<CellSlice> extra) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_ahme_empty& data) const;
+  bool cell_pack_ahme_empty(Ref<vm::Cell>& cell_ref, Ref<CellSlice> extra) const;
+  bool unpack(vm::CellSlice& cs, Record_ahme_root& data) const;
+  bool unpack_ahme_root(vm::CellSlice& cs, int& n, Ref<Cell>& root, Ref<CellSlice>& extra) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_ahme_root& data) const;
+  bool cell_unpack_ahme_root(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& root, Ref<CellSlice>& extra) const;
+  bool pack(vm::CellBuilder& cb, const Record_ahme_root& data) const;
+  bool pack_ahme_root(vm::CellBuilder& cb, Ref<Cell> root, Ref<CellSlice> extra) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_ahme_root& data) const;
+  bool cell_pack_ahme_root(Ref<vm::Cell>& cell_ref, Ref<Cell> root, Ref<CellSlice> extra) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(HashmapAugE " << m_ << " " << X_ << " " << Y_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+struct HashmapAugE::Record_ahme_root {
+  typedef HashmapAugE type_class;
+  int n;  	// n : #
+  Ref<Cell> root;  	// root : ^(HashmapAug n X Y)
+  Ref<CellSlice> extra;  	// extra : Y
+  Record_ahme_root() = default;
+  Record_ahme_root(Ref<Cell> _root, Ref<CellSlice> _extra) : n(-1), root(std::move(_root)), extra(std::move(_extra)) {}
+};
+
+//
+// headers for type `VarHashmap`
+//
+
+struct VarHashmap final : TLB_Complex {
+  enum { vhm_edge };
+  static constexpr int cons_len_exact = 0;
+  int m_;
+  const TLB &X_;
+  VarHashmap(int m, const TLB& X) : m_(m), X_(X) {}
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(VarHashmap " << m_ << " " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct VarHashmap::Record {
+  typedef VarHashmap type_class;
+  int n;  	// n : #
+  int l;  	// l : #
+  int m;  	// m : #
+  Ref<CellSlice> label;  	// label : HmLabel ~l n
+  Ref<CellSlice> node;  	// node : VarHashmapNode m X
+  Record() = default;
+  Record(Ref<CellSlice> _label, Ref<CellSlice> _node) : n(-1), l(-1), m(-1), label(std::move(_label)), node(std::move(_node)) {}
+};
+
+//
+// headers for type `VarHashmapNode`
+//
+
+struct VarHashmapNode final : TLB_Complex {
+  enum { vhmn_leaf, vhmn_fork, vhmn_cont };
+  static constexpr char cons_len[3] = { 2, 2, 1 };
+  static constexpr unsigned char cons_tag[3] = { 0, 1, 1 };
+  int m_;
+  const TLB &X_;
+  VarHashmapNode(int m, const TLB& X) : m_(m), X_(X) {}
+  struct Record_vhmn_leaf {
+    typedef VarHashmapNode type_class;
+    Ref<CellSlice> value;  	// value : X
+    Record_vhmn_leaf() = default;
+    Record_vhmn_leaf(Ref<CellSlice> _value) : value(std::move(_value)) {}
+  };
+  struct Record_vhmn_fork;
+  struct Record_vhmn_cont;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_vhmn_leaf& data) const;
+  bool unpack_vhmn_leaf(vm::CellSlice& cs, Ref<CellSlice>& value) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_vhmn_leaf& data) const;
+  bool cell_unpack_vhmn_leaf(Ref<vm::Cell> cell_ref, Ref<CellSlice>& value) const;
+  bool pack(vm::CellBuilder& cb, const Record_vhmn_leaf& data) const;
+  bool pack_vhmn_leaf(vm::CellBuilder& cb, Ref<CellSlice> value) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_vhmn_leaf& data) const;
+  bool cell_pack_vhmn_leaf(Ref<vm::Cell>& cell_ref, Ref<CellSlice> value) const;
+  bool unpack(vm::CellSlice& cs, Record_vhmn_fork& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_vhmn_fork& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_vhmn_fork& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_vhmn_fork& data) const;
+  bool unpack(vm::CellSlice& cs, Record_vhmn_cont& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_vhmn_cont& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_vhmn_cont& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_vhmn_cont& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(VarHashmapNode " << m_ << " " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(2, 7);
+  }
+};
+
+struct VarHashmapNode::Record_vhmn_fork {
+  typedef VarHashmapNode type_class;
+  int n;  	// n : #
+  Ref<Cell> left;  	// left : ^(VarHashmap n X)
+  Ref<Cell> right;  	// right : ^(VarHashmap n X)
+  Ref<CellSlice> value;  	// value : Maybe X
+  Record_vhmn_fork() = default;
+  Record_vhmn_fork(Ref<Cell> _left, Ref<Cell> _right, Ref<CellSlice> _value) : n(-1), left(std::move(_left)), right(std::move(_right)), value(std::move(_value)) {}
+};
+
+struct VarHashmapNode::Record_vhmn_cont {
+  typedef VarHashmapNode type_class;
+  int n;  	// n : #
+  bool branch;  	// branch : Bit
+  Ref<Cell> child;  	// child : ^(VarHashmap n X)
+  Ref<CellSlice> value;  	// value : X
+  Record_vhmn_cont() = default;
+  Record_vhmn_cont(bool _branch, Ref<Cell> _child, Ref<CellSlice> _value) : n(-1), branch(_branch), child(std::move(_child)), value(std::move(_value)) {}
+};
+
+//
+// headers for type `VarHashmapE`
+//
+
+struct VarHashmapE final : TLB_Complex {
+  enum { vhme_empty, vhme_root };
+  static constexpr int cons_len_exact = 1;
+  int m_;
+  const TLB &X_;
+  VarHashmapE(int m, const TLB& X) : m_(m), X_(X) {}
+  struct Record_vhme_empty {
+    typedef VarHashmapE type_class;
+  };
+  struct Record_vhme_root {
+    typedef VarHashmapE type_class;
+    int n;  	// n : #
+    Ref<Cell> root;  	// root : ^(VarHashmap n X)
+    Record_vhme_root() = default;
+    Record_vhme_root(Ref<Cell> _root) : n(-1), root(std::move(_root)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_vhme_empty& data) const;
+  bool unpack_vhme_empty(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_vhme_empty& data) const;
+  bool cell_unpack_vhme_empty(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_vhme_empty& data) const;
+  bool pack_vhme_empty(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_vhme_empty& data) const;
+  bool cell_pack_vhme_empty(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_vhme_root& data) const;
+  bool unpack_vhme_root(vm::CellSlice& cs, int& n, Ref<Cell>& root) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_vhme_root& data) const;
+  bool cell_unpack_vhme_root(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& root) const;
+  bool pack(vm::CellBuilder& cb, const Record_vhme_root& data) const;
+  bool pack_vhme_root(vm::CellBuilder& cb, Ref<Cell> root) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_vhme_root& data) const;
+  bool cell_pack_vhme_root(Ref<vm::Cell>& cell_ref, Ref<Cell> root) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(VarHashmapE " << m_ << " " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+//
+// headers for type `PfxHashmap`
+//
+
+struct PfxHashmap final : TLB_Complex {
+  enum { phm_edge };
+  static constexpr int cons_len_exact = 0;
+  int m_;
+  const TLB &X_;
+  PfxHashmap(int m, const TLB& X) : m_(m), X_(X) {}
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(PfxHashmap " << m_ << " " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct PfxHashmap::Record {
+  typedef PfxHashmap type_class;
+  int n;  	// n : #
+  int l;  	// l : #
+  int m;  	// m : #
+  Ref<CellSlice> label;  	// label : HmLabel ~l n
+  Ref<CellSlice> node;  	// node : PfxHashmapNode m X
+  Record() = default;
+  Record(Ref<CellSlice> _label, Ref<CellSlice> _node) : n(-1), l(-1), m(-1), label(std::move(_label)), node(std::move(_node)) {}
+};
+
+//
+// headers for type `PfxHashmapNode`
+//
+
+struct PfxHashmapNode final : TLB_Complex {
+  enum { phmn_leaf, phmn_fork };
+  static constexpr int cons_len_exact = 1;
+  int m_;
+  const TLB &X_;
+  PfxHashmapNode(int m, const TLB& X) : m_(m), X_(X) {}
+  struct Record_phmn_leaf {
+    typedef PfxHashmapNode type_class;
+    Ref<CellSlice> value;  	// value : X
+    Record_phmn_leaf() = default;
+    Record_phmn_leaf(Ref<CellSlice> _value) : value(std::move(_value)) {}
+  };
+  struct Record_phmn_fork;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_phmn_leaf& data) const;
+  bool unpack_phmn_leaf(vm::CellSlice& cs, Ref<CellSlice>& value) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_phmn_leaf& data) const;
+  bool cell_unpack_phmn_leaf(Ref<vm::Cell> cell_ref, Ref<CellSlice>& value) const;
+  bool pack(vm::CellBuilder& cb, const Record_phmn_leaf& data) const;
+  bool pack_phmn_leaf(vm::CellBuilder& cb, Ref<CellSlice> value) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_phmn_leaf& data) const;
+  bool cell_pack_phmn_leaf(Ref<vm::Cell>& cell_ref, Ref<CellSlice> value) const;
+  bool unpack(vm::CellSlice& cs, Record_phmn_fork& data) const;
+  bool unpack_phmn_fork(vm::CellSlice& cs, int& n, Ref<Cell>& left, Ref<Cell>& right) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_phmn_fork& data) const;
+  bool cell_unpack_phmn_fork(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& left, Ref<Cell>& right) const;
+  bool pack(vm::CellBuilder& cb, const Record_phmn_fork& data) const;
+  bool pack_phmn_fork(vm::CellBuilder& cb, Ref<Cell> left, Ref<Cell> right) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_phmn_fork& data) const;
+  bool cell_pack_phmn_fork(Ref<vm::Cell>& cell_ref, Ref<Cell> left, Ref<Cell> right) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(PfxHashmapNode " << m_ << " " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+struct PfxHashmapNode::Record_phmn_fork {
+  typedef PfxHashmapNode type_class;
+  int n;  	// n : #
+  Ref<Cell> left;  	// left : ^(PfxHashmap n X)
+  Ref<Cell> right;  	// right : ^(PfxHashmap n X)
+  Record_phmn_fork() = default;
+  Record_phmn_fork(Ref<Cell> _left, Ref<Cell> _right) : n(-1), left(std::move(_left)), right(std::move(_right)) {}
+};
+
+//
+// headers for type `PfxHashmapE`
+//
+
+struct PfxHashmapE final : TLB_Complex {
+  enum { phme_empty, phme_root };
+  static constexpr int cons_len_exact = 1;
+  int m_;
+  const TLB &X_;
+  PfxHashmapE(int m, const TLB& X) : m_(m), X_(X) {}
+  struct Record_phme_empty {
+    typedef PfxHashmapE type_class;
+  };
+  struct Record_phme_root {
+    typedef PfxHashmapE type_class;
+    int n;  	// n : #
+    Ref<Cell> root;  	// root : ^(PfxHashmap n X)
+    Record_phme_root() = default;
+    Record_phme_root(Ref<Cell> _root) : n(-1), root(std::move(_root)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_phme_empty& data) const;
+  bool unpack_phme_empty(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_phme_empty& data) const;
+  bool cell_unpack_phme_empty(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_phme_empty& data) const;
+  bool pack_phme_empty(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_phme_empty& data) const;
+  bool cell_pack_phme_empty(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_phme_root& data) const;
+  bool unpack_phme_root(vm::CellSlice& cs, int& n, Ref<Cell>& root) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_phme_root& data) const;
+  bool cell_unpack_phme_root(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& root) const;
+  bool pack(vm::CellBuilder& cb, const Record_phme_root& data) const;
+  bool pack_phme_root(vm::CellBuilder& cb, Ref<Cell> root) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_phme_root& data) const;
+  bool cell_pack_phme_root(Ref<vm::Cell>& cell_ref, Ref<Cell> root) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(PfxHashmapE " << m_ << " " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+//
+// headers for type `MsgAddressExt`
+//
+
+struct MsgAddressExt final : TLB_Complex {
+  enum { addr_none, addr_extern };
+  static constexpr int cons_len_exact = 2;
+  struct Record_addr_none {
+    typedef MsgAddressExt type_class;
+  };
+  struct Record_addr_extern {
+    typedef MsgAddressExt type_class;
+    int len;  	// len : ## 9
+    Ref<td::BitString> external_address;  	// external_address : bits len
+    Record_addr_extern() = default;
+    Record_addr_extern(int _len, Ref<td::BitString> _external_address) : len(_len), external_address(std::move(_external_address)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_addr_none& data) const;
+  bool unpack_addr_none(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_addr_none& data) const;
+  bool cell_unpack_addr_none(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_addr_none& data) const;
+  bool pack_addr_none(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_addr_none& data) const;
+  bool cell_pack_addr_none(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_addr_extern& data) const;
+  bool unpack_addr_extern(vm::CellSlice& cs, int& len, Ref<td::BitString>& external_address) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_addr_extern& data) const;
+  bool cell_unpack_addr_extern(Ref<vm::Cell> cell_ref, int& len, Ref<td::BitString>& external_address) const;
+  bool pack(vm::CellBuilder& cb, const Record_addr_extern& data) const;
+  bool pack_addr_extern(vm::CellBuilder& cb, int len, Ref<td::BitString> external_address) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_addr_extern& data) const;
+  bool cell_pack_addr_extern(Ref<vm::Cell>& cell_ref, int len, Ref<td::BitString> external_address) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "MsgAddressExt";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(2, 3);
+  }
+};
+
+extern const MsgAddressExt t_MsgAddressExt;
+
+//
+// headers for type `Anycast`
+//
+
+struct Anycast final : TLB_Complex {
+  enum { anycast_info };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef Anycast type_class;
+    int depth;  	// depth : #<= 30
+    Ref<td::BitString> rewrite_pfx;  	// rewrite_pfx : bits depth
+    Record() = default;
+    Record(int _depth, Ref<td::BitString> _rewrite_pfx) : depth(_depth), rewrite_pfx(std::move(_rewrite_pfx)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_anycast_info(vm::CellSlice& cs, int& depth, Ref<td::BitString>& rewrite_pfx) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_anycast_info(Ref<vm::Cell> cell_ref, int& depth, Ref<td::BitString>& rewrite_pfx) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_anycast_info(vm::CellBuilder& cb, int depth, Ref<td::BitString> rewrite_pfx) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_anycast_info(Ref<vm::Cell>& cell_ref, int depth, Ref<td::BitString> rewrite_pfx) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Anycast";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const Anycast t_Anycast;
+
+//
+// headers for type `MsgAddressInt`
+//
+
+struct MsgAddressInt final : TLB_Complex {
+  enum { addr_std, addr_var };
+  static constexpr int cons_len_exact = 2;
+  static constexpr unsigned char cons_tag[2] = { 2, 3 };
+  struct Record_addr_std;
+  struct Record_addr_var;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_addr_std& data) const;
+  bool unpack_addr_std(vm::CellSlice& cs, Ref<CellSlice>& anycast, int& workchain_id, td::BitArray<256>& address) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_addr_std& data) const;
+  bool cell_unpack_addr_std(Ref<vm::Cell> cell_ref, Ref<CellSlice>& anycast, int& workchain_id, td::BitArray<256>& address) const;
+  bool pack(vm::CellBuilder& cb, const Record_addr_std& data) const;
+  bool pack_addr_std(vm::CellBuilder& cb, Ref<CellSlice> anycast, int workchain_id, td::BitArray<256> address) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_addr_std& data) const;
+  bool cell_pack_addr_std(Ref<vm::Cell>& cell_ref, Ref<CellSlice> anycast, int workchain_id, td::BitArray<256> address) const;
+  bool unpack(vm::CellSlice& cs, Record_addr_var& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_addr_var& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_addr_var& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_addr_var& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "MsgAddressInt";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(2, 12);
+  }
+};
+
+struct MsgAddressInt::Record_addr_std {
+  typedef MsgAddressInt type_class;
+  Ref<CellSlice> anycast;  	// anycast : Maybe Anycast
+  int workchain_id;  	// workchain_id : int8
+  td::BitArray<256> address;  	// address : bits256
+  Record_addr_std() = default;
+  Record_addr_std(Ref<CellSlice> _anycast, int _workchain_id, const td::BitArray<256>& _address) : anycast(std::move(_anycast)), workchain_id(_workchain_id), address(_address) {}
+};
+
+struct MsgAddressInt::Record_addr_var {
+  typedef MsgAddressInt type_class;
+  Ref<CellSlice> anycast;  	// anycast : Maybe Anycast
+  int addr_len;  	// addr_len : ## 9
+  int workchain_id;  	// workchain_id : int32
+  Ref<td::BitString> address;  	// address : bits addr_len
+  Record_addr_var() = default;
+  Record_addr_var(Ref<CellSlice> _anycast, int _addr_len, int _workchain_id, Ref<td::BitString> _address) : anycast(std::move(_anycast)), addr_len(_addr_len), workchain_id(_workchain_id), address(std::move(_address)) {}
+};
+
+extern const MsgAddressInt t_MsgAddressInt;
+
+//
+// headers for type `MsgAddress`
+//
+
+struct MsgAddress final : TLB_Complex {
+  enum { cons2, cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record_cons1 {
+    typedef MsgAddress type_class;
+    Ref<CellSlice> x;  	// MsgAddressInt
+    Record_cons1() = default;
+    Record_cons1(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_cons2 {
+    typedef MsgAddress type_class;
+    Ref<CellSlice> x;  	// MsgAddressExt
+    Record_cons2() = default;
+    Record_cons2(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_cons1& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons1& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons1& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons1& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_cons2& data) const;
+  bool unpack_cons2(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons2& data) const;
+  bool cell_unpack_cons2(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons2& data) const;
+  bool pack_cons2(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons2& data) const;
+  bool cell_pack_cons2(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "MsgAddress";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+extern const MsgAddress t_MsgAddress;
+
+//
+// headers for type `VarUInteger`
+//
+
+struct VarUInteger final : TLB_Complex {
+  enum { var_uint };
+  static constexpr int cons_len_exact = 0;
+  int m_;
+  VarUInteger(int m) : m_(m) {}
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_var_uint(vm::CellSlice& cs, int& n, int& len, RefInt256& value) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_var_uint(Ref<vm::Cell> cell_ref, int& n, int& len, RefInt256& value) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_var_uint(vm::CellBuilder& cb, int len, RefInt256 value) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_var_uint(Ref<vm::Cell>& cell_ref, int len, RefInt256 value) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(VarUInteger " << m_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct VarUInteger::Record {
+  typedef VarUInteger type_class;
+  int n;  	// n : #
+  int len;  	// len : #< n
+  RefInt256 value;  	// value : uint (8 * len)
+  Record() = default;
+  Record(int _len, RefInt256 _value) : n(-1), len(_len), value(std::move(_value)) {}
+};
+
+//
+// headers for type `VarInteger`
+//
+
+struct VarInteger final : TLB_Complex {
+  enum { var_int };
+  static constexpr int cons_len_exact = 0;
+  int m_;
+  VarInteger(int m) : m_(m) {}
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_var_int(vm::CellSlice& cs, int& n, int& len, RefInt256& value) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_var_int(Ref<vm::Cell> cell_ref, int& n, int& len, RefInt256& value) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_var_int(vm::CellBuilder& cb, int len, RefInt256 value) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_var_int(Ref<vm::Cell>& cell_ref, int len, RefInt256 value) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(VarInteger " << m_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct VarInteger::Record {
+  typedef VarInteger type_class;
+  int n;  	// n : #
+  int len;  	// len : #< n
+  RefInt256 value;  	// value : int (8 * len)
+  Record() = default;
+  Record(int _len, RefInt256 _value) : n(-1), len(_len), value(std::move(_value)) {}
+};
+
+//
+// headers for type `Grams`
+//
+
+struct Grams final : TLB_Complex {
+  enum { nanograms };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef Grams type_class;
+    Ref<CellSlice> amount;  	// amount : VarUInteger 16
+    Record() = default;
+    Record(Ref<CellSlice> _amount) : amount(std::move(_amount)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_nanograms(vm::CellSlice& cs, Ref<CellSlice>& amount) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_nanograms(Ref<vm::Cell> cell_ref, Ref<CellSlice>& amount) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_nanograms(vm::CellBuilder& cb, Ref<CellSlice> amount) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_nanograms(Ref<vm::Cell>& cell_ref, Ref<CellSlice> amount) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Grams";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const Grams t_Grams;
+
+//
+// headers for type `ExtraCurrencyCollection`
+//
+
+struct ExtraCurrencyCollection final : TLB_Complex {
+  enum { extra_currencies };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef ExtraCurrencyCollection type_class;
+    Ref<CellSlice> dict;  	// dict : HashmapE 32 (VarUInteger 32)
+    Record() = default;
+    Record(Ref<CellSlice> _dict) : dict(std::move(_dict)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_extra_currencies(vm::CellSlice& cs, Ref<CellSlice>& dict) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_extra_currencies(Ref<vm::Cell> cell_ref, Ref<CellSlice>& dict) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_extra_currencies(vm::CellBuilder& cb, Ref<CellSlice> dict) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_extra_currencies(Ref<vm::Cell>& cell_ref, Ref<CellSlice> dict) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ExtraCurrencyCollection";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const ExtraCurrencyCollection t_ExtraCurrencyCollection;
+
+//
+// headers for type `CurrencyCollection`
+//
+
+struct CurrencyCollection final : TLB_Complex {
+  enum { currencies };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef CurrencyCollection type_class;
+    Ref<CellSlice> grams;  	// grams : Grams
+    Ref<CellSlice> other;  	// other : ExtraCurrencyCollection
+    Record() = default;
+    Record(Ref<CellSlice> _grams, Ref<CellSlice> _other) : grams(std::move(_grams)), other(std::move(_other)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_currencies(vm::CellSlice& cs, Ref<CellSlice>& grams, Ref<CellSlice>& other) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_currencies(Ref<vm::Cell> cell_ref, Ref<CellSlice>& grams, Ref<CellSlice>& other) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_currencies(vm::CellBuilder& cb, Ref<CellSlice> grams, Ref<CellSlice> other) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_currencies(Ref<vm::Cell>& cell_ref, Ref<CellSlice> grams, Ref<CellSlice> other) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "CurrencyCollection";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const CurrencyCollection t_CurrencyCollection;
+
+//
+// headers for type `CommonMsgInfo`
+//
+
+struct CommonMsgInfo final : TLB_Complex {
+  enum { int_msg_info, ext_in_msg_info, ext_out_msg_info };
+  static constexpr char cons_len[3] = { 1, 2, 2 };
+  static constexpr unsigned char cons_tag[3] = { 0, 2, 3 };
+  struct Record_int_msg_info;
+  struct Record_ext_in_msg_info;
+  struct Record_ext_out_msg_info;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_int_msg_info& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_int_msg_info& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_int_msg_info& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_int_msg_info& data) const;
+  bool unpack(vm::CellSlice& cs, Record_ext_in_msg_info& data) const;
+  bool unpack_ext_in_msg_info(vm::CellSlice& cs, Ref<CellSlice>& src, Ref<CellSlice>& dest, Ref<CellSlice>& import_fee) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_ext_in_msg_info& data) const;
+  bool cell_unpack_ext_in_msg_info(Ref<vm::Cell> cell_ref, Ref<CellSlice>& src, Ref<CellSlice>& dest, Ref<CellSlice>& import_fee) const;
+  bool pack(vm::CellBuilder& cb, const Record_ext_in_msg_info& data) const;
+  bool pack_ext_in_msg_info(vm::CellBuilder& cb, Ref<CellSlice> src, Ref<CellSlice> dest, Ref<CellSlice> import_fee) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_ext_in_msg_info& data) const;
+  bool cell_pack_ext_in_msg_info(Ref<vm::Cell>& cell_ref, Ref<CellSlice> src, Ref<CellSlice> dest, Ref<CellSlice> import_fee) const;
+  bool unpack(vm::CellSlice& cs, Record_ext_out_msg_info& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_ext_out_msg_info& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_ext_out_msg_info& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_ext_out_msg_info& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "CommonMsgInfo";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(2, 13);
+  }
+};
+
+struct CommonMsgInfo::Record_int_msg_info {
+  typedef CommonMsgInfo type_class;
+  bool ihr_disabled;  	// ihr_disabled : Bool
+  bool bounce;  	// bounce : Bool
+  bool bounced;  	// bounced : Bool
+  Ref<CellSlice> src;  	// src : MsgAddressInt
+  Ref<CellSlice> dest;  	// dest : MsgAddressInt
+  Ref<CellSlice> value;  	// value : CurrencyCollection
+  Ref<CellSlice> ihr_fee;  	// ihr_fee : Grams
+  Ref<CellSlice> fwd_fee;  	// fwd_fee : Grams
+  unsigned long long created_lt;  	// created_lt : uint64
+  unsigned created_at;  	// created_at : uint32
+  Record_int_msg_info() = default;
+  Record_int_msg_info(bool _ihr_disabled, bool _bounce, bool _bounced, Ref<CellSlice> _src, Ref<CellSlice> _dest, Ref<CellSlice> _value, Ref<CellSlice> _ihr_fee, Ref<CellSlice> _fwd_fee, unsigned long long _created_lt, unsigned _created_at) : ihr_disabled(_ihr_disabled), bounce(_bounce), bounced(_bounced), src(std::move(_src)), dest(std::move(_dest)), value(std::move(_value)), ihr_fee(std::move(_ihr_fee)), fwd_fee(std::move(_fwd_fee)), created_lt(_created_lt), created_at(_created_at) {}
+};
+
+struct CommonMsgInfo::Record_ext_in_msg_info {
+  typedef CommonMsgInfo type_class;
+  Ref<CellSlice> src;  	// src : MsgAddressExt
+  Ref<CellSlice> dest;  	// dest : MsgAddressInt
+  Ref<CellSlice> import_fee;  	// import_fee : Grams
+  Record_ext_in_msg_info() = default;
+  Record_ext_in_msg_info(Ref<CellSlice> _src, Ref<CellSlice> _dest, Ref<CellSlice> _import_fee) : src(std::move(_src)), dest(std::move(_dest)), import_fee(std::move(_import_fee)) {}
+};
+
+struct CommonMsgInfo::Record_ext_out_msg_info {
+  typedef CommonMsgInfo type_class;
+  Ref<CellSlice> src;  	// src : MsgAddressInt
+  Ref<CellSlice> dest;  	// dest : MsgAddressExt
+  unsigned long long created_lt;  	// created_lt : uint64
+  unsigned created_at;  	// created_at : uint32
+  Record_ext_out_msg_info() = default;
+  Record_ext_out_msg_info(Ref<CellSlice> _src, Ref<CellSlice> _dest, unsigned long long _created_lt, unsigned _created_at) : src(std::move(_src)), dest(std::move(_dest)), created_lt(_created_lt), created_at(_created_at) {}
+};
+
+extern const CommonMsgInfo t_CommonMsgInfo;
+
+//
+// headers for type `CommonMsgInfoRelaxed`
+//
+
+struct CommonMsgInfoRelaxed final : TLB_Complex {
+  enum { int_msg_info, ext_out_msg_info };
+  static constexpr char cons_len[2] = { 1, 2 };
+  static constexpr unsigned char cons_tag[2] = { 0, 3 };
+  struct Record_int_msg_info;
+  struct Record_ext_out_msg_info;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_int_msg_info& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_int_msg_info& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_int_msg_info& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_int_msg_info& data) const;
+  bool unpack(vm::CellSlice& cs, Record_ext_out_msg_info& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_ext_out_msg_info& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_ext_out_msg_info& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_ext_out_msg_info& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "CommonMsgInfoRelaxed";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+struct CommonMsgInfoRelaxed::Record_int_msg_info {
+  typedef CommonMsgInfoRelaxed type_class;
+  bool ihr_disabled;  	// ihr_disabled : Bool
+  bool bounce;  	// bounce : Bool
+  bool bounced;  	// bounced : Bool
+  Ref<CellSlice> src;  	// src : MsgAddress
+  Ref<CellSlice> dest;  	// dest : MsgAddressInt
+  Ref<CellSlice> value;  	// value : CurrencyCollection
+  Ref<CellSlice> ihr_fee;  	// ihr_fee : Grams
+  Ref<CellSlice> fwd_fee;  	// fwd_fee : Grams
+  unsigned long long created_lt;  	// created_lt : uint64
+  unsigned created_at;  	// created_at : uint32
+  Record_int_msg_info() = default;
+  Record_int_msg_info(bool _ihr_disabled, bool _bounce, bool _bounced, Ref<CellSlice> _src, Ref<CellSlice> _dest, Ref<CellSlice> _value, Ref<CellSlice> _ihr_fee, Ref<CellSlice> _fwd_fee, unsigned long long _created_lt, unsigned _created_at) : ihr_disabled(_ihr_disabled), bounce(_bounce), bounced(_bounced), src(std::move(_src)), dest(std::move(_dest)), value(std::move(_value)), ihr_fee(std::move(_ihr_fee)), fwd_fee(std::move(_fwd_fee)), created_lt(_created_lt), created_at(_created_at) {}
+};
+
+struct CommonMsgInfoRelaxed::Record_ext_out_msg_info {
+  typedef CommonMsgInfoRelaxed type_class;
+  Ref<CellSlice> src;  	// src : MsgAddress
+  Ref<CellSlice> dest;  	// dest : MsgAddressExt
+  unsigned long long created_lt;  	// created_lt : uint64
+  unsigned created_at;  	// created_at : uint32
+  Record_ext_out_msg_info() = default;
+  Record_ext_out_msg_info(Ref<CellSlice> _src, Ref<CellSlice> _dest, unsigned long long _created_lt, unsigned _created_at) : src(std::move(_src)), dest(std::move(_dest)), created_lt(_created_lt), created_at(_created_at) {}
+};
+
+extern const CommonMsgInfoRelaxed t_CommonMsgInfoRelaxed;
+
+//
+// headers for type `TickTock`
+//
+
+struct TickTock final : TLB_Complex {
+  enum { tick_tock };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef TickTock type_class;
+    bool tick;  	// tick : Bool
+    bool tock;  	// tock : Bool
+    Record() = default;
+    Record(bool _tick, bool _tock) : tick(_tick), tock(_tock) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 2;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(2);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(2);
+  }
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_tick_tock(vm::CellSlice& cs, bool& tick, bool& tock) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_tick_tock(Ref<vm::Cell> cell_ref, bool& tick, bool& tock) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_tick_tock(vm::CellBuilder& cb, bool tick, bool tock) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_tick_tock(Ref<vm::Cell>& cell_ref, bool tick, bool tock) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "TickTock";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const TickTock t_TickTock;
+
+//
+// headers for type `StateInit`
+//
+
+struct StateInit final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "StateInit";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct StateInit::Record {
+  typedef StateInit type_class;
+  Ref<CellSlice> split_depth;  	// split_depth : Maybe (## 5)
+  Ref<CellSlice> special;  	// special : Maybe TickTock
+  Ref<CellSlice> code;  	// code : Maybe ^Cell
+  Ref<CellSlice> data;  	// data : Maybe ^Cell
+  Ref<CellSlice> library;  	// library : HashmapE 256 SimpleLib
+  Record() = default;
+  Record(Ref<CellSlice> _split_depth, Ref<CellSlice> _special, Ref<CellSlice> _code, Ref<CellSlice> _data, Ref<CellSlice> _library) : split_depth(std::move(_split_depth)), special(std::move(_special)), code(std::move(_code)), data(std::move(_data)), library(std::move(_library)) {}
+};
+
+extern const StateInit t_StateInit;
+
+//
+// headers for type `SimpleLib`
+//
+
+struct SimpleLib final : TLB_Complex {
+  enum { simple_lib };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef SimpleLib type_class;
+    bool public1;  	// public : Bool
+    Ref<Cell> root;  	// root : ^Cell
+    Record() = default;
+    Record(bool _public1, Ref<Cell> _root) : public1(_public1), root(std::move(_root)) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0x10001;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance_ext(0x10001);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_simple_lib(vm::CellSlice& cs, bool& public1, Ref<Cell>& root) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_simple_lib(Ref<vm::Cell> cell_ref, bool& public1, Ref<Cell>& root) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_simple_lib(vm::CellBuilder& cb, bool public1, Ref<Cell> root) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_simple_lib(Ref<vm::Cell>& cell_ref, bool public1, Ref<Cell> root) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "SimpleLib";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const SimpleLib t_SimpleLib;
+
+//
+// headers for type `Message`
+//
+
+struct Message final : TLB_Complex {
+  enum { message };
+  static constexpr int cons_len_exact = 0;
+  const TLB &X_;
+  Message(const TLB& X) : X_(X) {}
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_message(vm::CellSlice& cs, Ref<CellSlice>& info, Ref<CellSlice>& init, Ref<CellSlice>& body) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_message(Ref<vm::Cell> cell_ref, Ref<CellSlice>& info, Ref<CellSlice>& init, Ref<CellSlice>& body) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_message(vm::CellBuilder& cb, Ref<CellSlice> info, Ref<CellSlice> init, Ref<CellSlice> body) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_message(Ref<vm::Cell>& cell_ref, Ref<CellSlice> info, Ref<CellSlice> init, Ref<CellSlice> body) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(Message " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct Message::Record {
+  typedef Message type_class;
+  Ref<CellSlice> info;  	// info : CommonMsgInfo
+  Ref<CellSlice> init;  	// init : Maybe (Either StateInit ^StateInit)
+  Ref<CellSlice> body;  	// body : Either X ^X
+  Record() = default;
+  Record(Ref<CellSlice> _info, Ref<CellSlice> _init, Ref<CellSlice> _body) : info(std::move(_info)), init(std::move(_init)), body(std::move(_body)) {}
+};
+
+//
+// headers for type `MessageRelaxed`
+//
+
+struct MessageRelaxed final : TLB_Complex {
+  enum { message };
+  static constexpr int cons_len_exact = 0;
+  const TLB &X_;
+  MessageRelaxed(const TLB& X) : X_(X) {}
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_message(vm::CellSlice& cs, Ref<CellSlice>& info, Ref<CellSlice>& init, Ref<CellSlice>& body) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_message(Ref<vm::Cell> cell_ref, Ref<CellSlice>& info, Ref<CellSlice>& init, Ref<CellSlice>& body) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_message(vm::CellBuilder& cb, Ref<CellSlice> info, Ref<CellSlice> init, Ref<CellSlice> body) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_message(Ref<vm::Cell>& cell_ref, Ref<CellSlice> info, Ref<CellSlice> init, Ref<CellSlice> body) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(MessageRelaxed " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct MessageRelaxed::Record {
+  typedef MessageRelaxed type_class;
+  Ref<CellSlice> info;  	// info : CommonMsgInfoRelaxed
+  Ref<CellSlice> init;  	// init : Maybe (Either StateInit ^StateInit)
+  Ref<CellSlice> body;  	// body : Either X ^X
+  Record() = default;
+  Record(Ref<CellSlice> _info, Ref<CellSlice> _init, Ref<CellSlice> _body) : info(std::move(_info)), init(std::move(_init)), body(std::move(_body)) {}
+};
+
+//
+// headers for type `IntermediateAddress`
+//
+
+struct IntermediateAddress final : TLB_Complex {
+  enum { interm_addr_regular, interm_addr_simple, interm_addr_ext };
+  static constexpr char cons_len[3] = { 1, 2, 2 };
+  static constexpr unsigned char cons_tag[3] = { 0, 2, 3 };
+  struct Record_interm_addr_regular {
+    typedef IntermediateAddress type_class;
+    int use_dest_bits;  	// use_dest_bits : #<= 96
+    Record_interm_addr_regular() = default;
+    Record_interm_addr_regular(int _use_dest_bits) : use_dest_bits(_use_dest_bits) {}
+  };
+  struct Record_interm_addr_simple {
+    typedef IntermediateAddress type_class;
+    int workchain_id;  	// workchain_id : int8
+    unsigned long long addr_pfx;  	// addr_pfx : uint64
+    Record_interm_addr_simple() = default;
+    Record_interm_addr_simple(int _workchain_id, unsigned long long _addr_pfx) : workchain_id(_workchain_id), addr_pfx(_addr_pfx) {}
+  };
+  struct Record_interm_addr_ext {
+    typedef IntermediateAddress type_class;
+    int workchain_id;  	// workchain_id : int32
+    unsigned long long addr_pfx;  	// addr_pfx : uint64
+    Record_interm_addr_ext() = default;
+    Record_interm_addr_ext(int _workchain_id, unsigned long long _addr_pfx) : workchain_id(_workchain_id), addr_pfx(_addr_pfx) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_interm_addr_regular& data) const;
+  bool unpack_interm_addr_regular(vm::CellSlice& cs, int& use_dest_bits) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_interm_addr_regular& data) const;
+  bool cell_unpack_interm_addr_regular(Ref<vm::Cell> cell_ref, int& use_dest_bits) const;
+  bool pack(vm::CellBuilder& cb, const Record_interm_addr_regular& data) const;
+  bool pack_interm_addr_regular(vm::CellBuilder& cb, int use_dest_bits) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_interm_addr_regular& data) const;
+  bool cell_pack_interm_addr_regular(Ref<vm::Cell>& cell_ref, int use_dest_bits) const;
+  bool unpack(vm::CellSlice& cs, Record_interm_addr_simple& data) const;
+  bool unpack_interm_addr_simple(vm::CellSlice& cs, int& workchain_id, unsigned long long& addr_pfx) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_interm_addr_simple& data) const;
+  bool cell_unpack_interm_addr_simple(Ref<vm::Cell> cell_ref, int& workchain_id, unsigned long long& addr_pfx) const;
+  bool pack(vm::CellBuilder& cb, const Record_interm_addr_simple& data) const;
+  bool pack_interm_addr_simple(vm::CellBuilder& cb, int workchain_id, unsigned long long addr_pfx) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_interm_addr_simple& data) const;
+  bool cell_pack_interm_addr_simple(Ref<vm::Cell>& cell_ref, int workchain_id, unsigned long long addr_pfx) const;
+  bool unpack(vm::CellSlice& cs, Record_interm_addr_ext& data) const;
+  bool unpack_interm_addr_ext(vm::CellSlice& cs, int& workchain_id, unsigned long long& addr_pfx) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_interm_addr_ext& data) const;
+  bool cell_unpack_interm_addr_ext(Ref<vm::Cell> cell_ref, int& workchain_id, unsigned long long& addr_pfx) const;
+  bool pack(vm::CellBuilder& cb, const Record_interm_addr_ext& data) const;
+  bool pack_interm_addr_ext(vm::CellBuilder& cb, int workchain_id, unsigned long long addr_pfx) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_interm_addr_ext& data) const;
+  bool cell_pack_interm_addr_ext(Ref<vm::Cell>& cell_ref, int workchain_id, unsigned long long addr_pfx) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "IntermediateAddress";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(2, 13);
+  }
+};
+
+extern const IntermediateAddress t_IntermediateAddress;
+
+//
+// headers for type `MsgEnvelope`
+//
+
+struct MsgEnvelope final : TLB_Complex {
+  enum { msg_envelope };
+  static constexpr int cons_len_exact = 4;
+  static constexpr unsigned char cons_tag[1] = { 4 };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "MsgEnvelope";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct MsgEnvelope::Record {
+  typedef MsgEnvelope type_class;
+  Ref<CellSlice> cur_addr;  	// cur_addr : IntermediateAddress
+  Ref<CellSlice> next_addr;  	// next_addr : IntermediateAddress
+  Ref<CellSlice> fwd_fee_remaining;  	// fwd_fee_remaining : Grams
+  Ref<Cell> msg;  	// msg : ^(Message Any)
+  Record() = default;
+  Record(Ref<CellSlice> _cur_addr, Ref<CellSlice> _next_addr, Ref<CellSlice> _fwd_fee_remaining, Ref<Cell> _msg) : cur_addr(std::move(_cur_addr)), next_addr(std::move(_next_addr)), fwd_fee_remaining(std::move(_fwd_fee_remaining)), msg(std::move(_msg)) {}
+};
+
+extern const MsgEnvelope t_MsgEnvelope;
+
+//
+// headers for type `InMsg`
+//
+
+struct InMsg final : TLB_Complex {
+  enum { msg_import_ext, msg_import_ihr, msg_import_imm, msg_import_fin, msg_import_tr, msg_discard_fin, msg_discard_tr };
+  static constexpr int cons_len_exact = 3;
+  static constexpr unsigned char cons_tag[7] = { 0, 2, 3, 4, 5, 6, 7 };
+  struct Record_msg_import_ext {
+    typedef InMsg type_class;
+    Ref<Cell> msg;  	// msg : ^(Message Any)
+    Ref<Cell> transaction;  	// transaction : ^Transaction
+    Record_msg_import_ext() = default;
+    Record_msg_import_ext(Ref<Cell> _msg, Ref<Cell> _transaction) : msg(std::move(_msg)), transaction(std::move(_transaction)) {}
+  };
+  struct Record_msg_import_ihr;
+  struct Record_msg_import_imm;
+  struct Record_msg_import_fin;
+  struct Record_msg_import_tr;
+  struct Record_msg_discard_fin;
+  struct Record_msg_discard_tr;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_msg_import_ext& data) const;
+  bool unpack_msg_import_ext(vm::CellSlice& cs, Ref<Cell>& msg, Ref<Cell>& transaction) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_import_ext& data) const;
+  bool cell_unpack_msg_import_ext(Ref<vm::Cell> cell_ref, Ref<Cell>& msg, Ref<Cell>& transaction) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_import_ext& data) const;
+  bool pack_msg_import_ext(vm::CellBuilder& cb, Ref<Cell> msg, Ref<Cell> transaction) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_import_ext& data) const;
+  bool cell_pack_msg_import_ext(Ref<vm::Cell>& cell_ref, Ref<Cell> msg, Ref<Cell> transaction) const;
+  bool unpack(vm::CellSlice& cs, Record_msg_import_ihr& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_import_ihr& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_import_ihr& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_import_ihr& data) const;
+  bool unpack(vm::CellSlice& cs, Record_msg_import_imm& data) const;
+  bool unpack_msg_import_imm(vm::CellSlice& cs, Ref<Cell>& in_msg, Ref<Cell>& transaction, Ref<CellSlice>& fwd_fee) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_import_imm& data) const;
+  bool cell_unpack_msg_import_imm(Ref<vm::Cell> cell_ref, Ref<Cell>& in_msg, Ref<Cell>& transaction, Ref<CellSlice>& fwd_fee) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_import_imm& data) const;
+  bool pack_msg_import_imm(vm::CellBuilder& cb, Ref<Cell> in_msg, Ref<Cell> transaction, Ref<CellSlice> fwd_fee) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_import_imm& data) const;
+  bool cell_pack_msg_import_imm(Ref<vm::Cell>& cell_ref, Ref<Cell> in_msg, Ref<Cell> transaction, Ref<CellSlice> fwd_fee) const;
+  bool unpack(vm::CellSlice& cs, Record_msg_import_fin& data) const;
+  bool unpack_msg_import_fin(vm::CellSlice& cs, Ref<Cell>& in_msg, Ref<Cell>& transaction, Ref<CellSlice>& fwd_fee) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_import_fin& data) const;
+  bool cell_unpack_msg_import_fin(Ref<vm::Cell> cell_ref, Ref<Cell>& in_msg, Ref<Cell>& transaction, Ref<CellSlice>& fwd_fee) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_import_fin& data) const;
+  bool pack_msg_import_fin(vm::CellBuilder& cb, Ref<Cell> in_msg, Ref<Cell> transaction, Ref<CellSlice> fwd_fee) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_import_fin& data) const;
+  bool cell_pack_msg_import_fin(Ref<vm::Cell>& cell_ref, Ref<Cell> in_msg, Ref<Cell> transaction, Ref<CellSlice> fwd_fee) const;
+  bool unpack(vm::CellSlice& cs, Record_msg_import_tr& data) const;
+  bool unpack_msg_import_tr(vm::CellSlice& cs, Ref<Cell>& in_msg, Ref<Cell>& out_msg, Ref<CellSlice>& transit_fee) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_import_tr& data) const;
+  bool cell_unpack_msg_import_tr(Ref<vm::Cell> cell_ref, Ref<Cell>& in_msg, Ref<Cell>& out_msg, Ref<CellSlice>& transit_fee) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_import_tr& data) const;
+  bool pack_msg_import_tr(vm::CellBuilder& cb, Ref<Cell> in_msg, Ref<Cell> out_msg, Ref<CellSlice> transit_fee) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_import_tr& data) const;
+  bool cell_pack_msg_import_tr(Ref<vm::Cell>& cell_ref, Ref<Cell> in_msg, Ref<Cell> out_msg, Ref<CellSlice> transit_fee) const;
+  bool unpack(vm::CellSlice& cs, Record_msg_discard_fin& data) const;
+  bool unpack_msg_discard_fin(vm::CellSlice& cs, Ref<Cell>& in_msg, unsigned long long& transaction_id, Ref<CellSlice>& fwd_fee) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_discard_fin& data) const;
+  bool cell_unpack_msg_discard_fin(Ref<vm::Cell> cell_ref, Ref<Cell>& in_msg, unsigned long long& transaction_id, Ref<CellSlice>& fwd_fee) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_discard_fin& data) const;
+  bool pack_msg_discard_fin(vm::CellBuilder& cb, Ref<Cell> in_msg, unsigned long long transaction_id, Ref<CellSlice> fwd_fee) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_discard_fin& data) const;
+  bool cell_pack_msg_discard_fin(Ref<vm::Cell>& cell_ref, Ref<Cell> in_msg, unsigned long long transaction_id, Ref<CellSlice> fwd_fee) const;
+  bool unpack(vm::CellSlice& cs, Record_msg_discard_tr& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_discard_tr& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_discard_tr& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_discard_tr& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "InMsg";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(3, 0xfd);
+  }
+};
+
+struct InMsg::Record_msg_import_ihr {
+  typedef InMsg type_class;
+  Ref<Cell> msg;  	// msg : ^(Message Any)
+  Ref<Cell> transaction;  	// transaction : ^Transaction
+  Ref<CellSlice> ihr_fee;  	// ihr_fee : Grams
+  Ref<Cell> proof_created;  	// proof_created : ^Cell
+  Record_msg_import_ihr() = default;
+  Record_msg_import_ihr(Ref<Cell> _msg, Ref<Cell> _transaction, Ref<CellSlice> _ihr_fee, Ref<Cell> _proof_created) : msg(std::move(_msg)), transaction(std::move(_transaction)), ihr_fee(std::move(_ihr_fee)), proof_created(std::move(_proof_created)) {}
+};
+
+struct InMsg::Record_msg_import_imm {
+  typedef InMsg type_class;
+  Ref<Cell> in_msg;  	// in_msg : ^MsgEnvelope
+  Ref<Cell> transaction;  	// transaction : ^Transaction
+  Ref<CellSlice> fwd_fee;  	// fwd_fee : Grams
+  Record_msg_import_imm() = default;
+  Record_msg_import_imm(Ref<Cell> _in_msg, Ref<Cell> _transaction, Ref<CellSlice> _fwd_fee) : in_msg(std::move(_in_msg)), transaction(std::move(_transaction)), fwd_fee(std::move(_fwd_fee)) {}
+};
+
+struct InMsg::Record_msg_import_fin {
+  typedef InMsg type_class;
+  Ref<Cell> in_msg;  	// in_msg : ^MsgEnvelope
+  Ref<Cell> transaction;  	// transaction : ^Transaction
+  Ref<CellSlice> fwd_fee;  	// fwd_fee : Grams
+  Record_msg_import_fin() = default;
+  Record_msg_import_fin(Ref<Cell> _in_msg, Ref<Cell> _transaction, Ref<CellSlice> _fwd_fee) : in_msg(std::move(_in_msg)), transaction(std::move(_transaction)), fwd_fee(std::move(_fwd_fee)) {}
+};
+
+struct InMsg::Record_msg_import_tr {
+  typedef InMsg type_class;
+  Ref<Cell> in_msg;  	// in_msg : ^MsgEnvelope
+  Ref<Cell> out_msg;  	// out_msg : ^MsgEnvelope
+  Ref<CellSlice> transit_fee;  	// transit_fee : Grams
+  Record_msg_import_tr() = default;
+  Record_msg_import_tr(Ref<Cell> _in_msg, Ref<Cell> _out_msg, Ref<CellSlice> _transit_fee) : in_msg(std::move(_in_msg)), out_msg(std::move(_out_msg)), transit_fee(std::move(_transit_fee)) {}
+};
+
+struct InMsg::Record_msg_discard_fin {
+  typedef InMsg type_class;
+  Ref<Cell> in_msg;  	// in_msg : ^MsgEnvelope
+  unsigned long long transaction_id;  	// transaction_id : uint64
+  Ref<CellSlice> fwd_fee;  	// fwd_fee : Grams
+  Record_msg_discard_fin() = default;
+  Record_msg_discard_fin(Ref<Cell> _in_msg, unsigned long long _transaction_id, Ref<CellSlice> _fwd_fee) : in_msg(std::move(_in_msg)), transaction_id(_transaction_id), fwd_fee(std::move(_fwd_fee)) {}
+};
+
+struct InMsg::Record_msg_discard_tr {
+  typedef InMsg type_class;
+  Ref<Cell> in_msg;  	// in_msg : ^MsgEnvelope
+  unsigned long long transaction_id;  	// transaction_id : uint64
+  Ref<CellSlice> fwd_fee;  	// fwd_fee : Grams
+  Ref<Cell> proof_delivered;  	// proof_delivered : ^Cell
+  Record_msg_discard_tr() = default;
+  Record_msg_discard_tr(Ref<Cell> _in_msg, unsigned long long _transaction_id, Ref<CellSlice> _fwd_fee, Ref<Cell> _proof_delivered) : in_msg(std::move(_in_msg)), transaction_id(_transaction_id), fwd_fee(std::move(_fwd_fee)), proof_delivered(std::move(_proof_delivered)) {}
+};
+
+extern const InMsg t_InMsg;
+
+//
+// headers for type `ImportFees`
+//
+
+struct ImportFees final : TLB_Complex {
+  enum { import_fees };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef ImportFees type_class;
+    Ref<CellSlice> fees_collected;  	// fees_collected : Grams
+    Ref<CellSlice> value_imported;  	// value_imported : CurrencyCollection
+    Record() = default;
+    Record(Ref<CellSlice> _fees_collected, Ref<CellSlice> _value_imported) : fees_collected(std::move(_fees_collected)), value_imported(std::move(_value_imported)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_import_fees(vm::CellSlice& cs, Ref<CellSlice>& fees_collected, Ref<CellSlice>& value_imported) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_import_fees(Ref<vm::Cell> cell_ref, Ref<CellSlice>& fees_collected, Ref<CellSlice>& value_imported) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_import_fees(vm::CellBuilder& cb, Ref<CellSlice> fees_collected, Ref<CellSlice> value_imported) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_import_fees(Ref<vm::Cell>& cell_ref, Ref<CellSlice> fees_collected, Ref<CellSlice> value_imported) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ImportFees";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const ImportFees t_ImportFees;
+
+//
+// headers for type `InMsgDescr`
+//
+
+struct InMsgDescr final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef InMsgDescr type_class;
+    Ref<CellSlice> x;  	// HashmapAugE 256 InMsg ImportFees
+    Record() = default;
+    Record(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "InMsgDescr";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const InMsgDescr t_InMsgDescr;
+
+//
+// headers for type `OutMsg`
+//
+
+struct OutMsg final : TLB_Complex {
+  enum { msg_export_ext, msg_export_new, msg_export_imm, msg_export_tr, msg_export_deq_imm, msg_export_deq, msg_export_tr_req };
+  static constexpr int cons_len_exact = 3;
+  static constexpr unsigned char cons_tag[7] = { 0, 1, 2, 3, 4, 6, 7 };
+  struct Record_msg_export_ext {
+    typedef OutMsg type_class;
+    Ref<Cell> msg;  	// msg : ^(Message Any)
+    Ref<Cell> transaction;  	// transaction : ^Transaction
+    Record_msg_export_ext() = default;
+    Record_msg_export_ext(Ref<Cell> _msg, Ref<Cell> _transaction) : msg(std::move(_msg)), transaction(std::move(_transaction)) {}
+  };
+  struct Record_msg_export_imm;
+  struct Record_msg_export_new {
+    typedef OutMsg type_class;
+    Ref<Cell> out_msg;  	// out_msg : ^MsgEnvelope
+    Ref<Cell> transaction;  	// transaction : ^Transaction
+    Record_msg_export_new() = default;
+    Record_msg_export_new(Ref<Cell> _out_msg, Ref<Cell> _transaction) : out_msg(std::move(_out_msg)), transaction(std::move(_transaction)) {}
+  };
+  struct Record_msg_export_tr {
+    typedef OutMsg type_class;
+    Ref<Cell> out_msg;  	// out_msg : ^MsgEnvelope
+    Ref<Cell> imported;  	// imported : ^InMsg
+    Record_msg_export_tr() = default;
+    Record_msg_export_tr(Ref<Cell> _out_msg, Ref<Cell> _imported) : out_msg(std::move(_out_msg)), imported(std::move(_imported)) {}
+  };
+  struct Record_msg_export_deq {
+    typedef OutMsg type_class;
+    Ref<Cell> out_msg;  	// out_msg : ^MsgEnvelope
+    unsigned long long import_block_lt;  	// import_block_lt : uint64
+    Record_msg_export_deq() = default;
+    Record_msg_export_deq(Ref<Cell> _out_msg, unsigned long long _import_block_lt) : out_msg(std::move(_out_msg)), import_block_lt(_import_block_lt) {}
+  };
+  struct Record_msg_export_tr_req {
+    typedef OutMsg type_class;
+    Ref<Cell> out_msg;  	// out_msg : ^MsgEnvelope
+    Ref<Cell> imported;  	// imported : ^InMsg
+    Record_msg_export_tr_req() = default;
+    Record_msg_export_tr_req(Ref<Cell> _out_msg, Ref<Cell> _imported) : out_msg(std::move(_out_msg)), imported(std::move(_imported)) {}
+  };
+  struct Record_msg_export_deq_imm {
+    typedef OutMsg type_class;
+    Ref<Cell> out_msg;  	// out_msg : ^MsgEnvelope
+    Ref<Cell> reimport;  	// reimport : ^InMsg
+    Record_msg_export_deq_imm() = default;
+    Record_msg_export_deq_imm(Ref<Cell> _out_msg, Ref<Cell> _reimport) : out_msg(std::move(_out_msg)), reimport(std::move(_reimport)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_msg_export_ext& data) const;
+  bool unpack_msg_export_ext(vm::CellSlice& cs, Ref<Cell>& msg, Ref<Cell>& transaction) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_export_ext& data) const;
+  bool cell_unpack_msg_export_ext(Ref<vm::Cell> cell_ref, Ref<Cell>& msg, Ref<Cell>& transaction) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_export_ext& data) const;
+  bool pack_msg_export_ext(vm::CellBuilder& cb, Ref<Cell> msg, Ref<Cell> transaction) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_export_ext& data) const;
+  bool cell_pack_msg_export_ext(Ref<vm::Cell>& cell_ref, Ref<Cell> msg, Ref<Cell> transaction) const;
+  bool unpack(vm::CellSlice& cs, Record_msg_export_imm& data) const;
+  bool unpack_msg_export_imm(vm::CellSlice& cs, Ref<Cell>& out_msg, Ref<Cell>& transaction, Ref<Cell>& reimport) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_export_imm& data) const;
+  bool cell_unpack_msg_export_imm(Ref<vm::Cell> cell_ref, Ref<Cell>& out_msg, Ref<Cell>& transaction, Ref<Cell>& reimport) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_export_imm& data) const;
+  bool pack_msg_export_imm(vm::CellBuilder& cb, Ref<Cell> out_msg, Ref<Cell> transaction, Ref<Cell> reimport) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_export_imm& data) const;
+  bool cell_pack_msg_export_imm(Ref<vm::Cell>& cell_ref, Ref<Cell> out_msg, Ref<Cell> transaction, Ref<Cell> reimport) const;
+  bool unpack(vm::CellSlice& cs, Record_msg_export_new& data) const;
+  bool unpack_msg_export_new(vm::CellSlice& cs, Ref<Cell>& out_msg, Ref<Cell>& transaction) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_export_new& data) const;
+  bool cell_unpack_msg_export_new(Ref<vm::Cell> cell_ref, Ref<Cell>& out_msg, Ref<Cell>& transaction) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_export_new& data) const;
+  bool pack_msg_export_new(vm::CellBuilder& cb, Ref<Cell> out_msg, Ref<Cell> transaction) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_export_new& data) const;
+  bool cell_pack_msg_export_new(Ref<vm::Cell>& cell_ref, Ref<Cell> out_msg, Ref<Cell> transaction) const;
+  bool unpack(vm::CellSlice& cs, Record_msg_export_tr& data) const;
+  bool unpack_msg_export_tr(vm::CellSlice& cs, Ref<Cell>& out_msg, Ref<Cell>& imported) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_export_tr& data) const;
+  bool cell_unpack_msg_export_tr(Ref<vm::Cell> cell_ref, Ref<Cell>& out_msg, Ref<Cell>& imported) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_export_tr& data) const;
+  bool pack_msg_export_tr(vm::CellBuilder& cb, Ref<Cell> out_msg, Ref<Cell> imported) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_export_tr& data) const;
+  bool cell_pack_msg_export_tr(Ref<vm::Cell>& cell_ref, Ref<Cell> out_msg, Ref<Cell> imported) const;
+  bool unpack(vm::CellSlice& cs, Record_msg_export_deq& data) const;
+  bool unpack_msg_export_deq(vm::CellSlice& cs, Ref<Cell>& out_msg, unsigned long long& import_block_lt) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_export_deq& data) const;
+  bool cell_unpack_msg_export_deq(Ref<vm::Cell> cell_ref, Ref<Cell>& out_msg, unsigned long long& import_block_lt) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_export_deq& data) const;
+  bool pack_msg_export_deq(vm::CellBuilder& cb, Ref<Cell> out_msg, unsigned long long import_block_lt) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_export_deq& data) const;
+  bool cell_pack_msg_export_deq(Ref<vm::Cell>& cell_ref, Ref<Cell> out_msg, unsigned long long import_block_lt) const;
+  bool unpack(vm::CellSlice& cs, Record_msg_export_tr_req& data) const;
+  bool unpack_msg_export_tr_req(vm::CellSlice& cs, Ref<Cell>& out_msg, Ref<Cell>& imported) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_export_tr_req& data) const;
+  bool cell_unpack_msg_export_tr_req(Ref<vm::Cell> cell_ref, Ref<Cell>& out_msg, Ref<Cell>& imported) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_export_tr_req& data) const;
+  bool pack_msg_export_tr_req(vm::CellBuilder& cb, Ref<Cell> out_msg, Ref<Cell> imported) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_export_tr_req& data) const;
+  bool cell_pack_msg_export_tr_req(Ref<vm::Cell>& cell_ref, Ref<Cell> out_msg, Ref<Cell> imported) const;
+  bool unpack(vm::CellSlice& cs, Record_msg_export_deq_imm& data) const;
+  bool unpack_msg_export_deq_imm(vm::CellSlice& cs, Ref<Cell>& out_msg, Ref<Cell>& reimport) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_msg_export_deq_imm& data) const;
+  bool cell_unpack_msg_export_deq_imm(Ref<vm::Cell> cell_ref, Ref<Cell>& out_msg, Ref<Cell>& reimport) const;
+  bool pack(vm::CellBuilder& cb, const Record_msg_export_deq_imm& data) const;
+  bool pack_msg_export_deq_imm(vm::CellBuilder& cb, Ref<Cell> out_msg, Ref<Cell> reimport) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_msg_export_deq_imm& data) const;
+  bool cell_pack_msg_export_deq_imm(Ref<vm::Cell>& cell_ref, Ref<Cell> out_msg, Ref<Cell> reimport) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "OutMsg";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(3, 0xdf);
+  }
+};
+
+struct OutMsg::Record_msg_export_imm {
+  typedef OutMsg type_class;
+  Ref<Cell> out_msg;  	// out_msg : ^MsgEnvelope
+  Ref<Cell> transaction;  	// transaction : ^Transaction
+  Ref<Cell> reimport;  	// reimport : ^InMsg
+  Record_msg_export_imm() = default;
+  Record_msg_export_imm(Ref<Cell> _out_msg, Ref<Cell> _transaction, Ref<Cell> _reimport) : out_msg(std::move(_out_msg)), transaction(std::move(_transaction)), reimport(std::move(_reimport)) {}
+};
+
+extern const OutMsg t_OutMsg;
+
+//
+// headers for type `EnqueuedMsg`
+//
+
+struct EnqueuedMsg final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef EnqueuedMsg type_class;
+    unsigned long long enqueued_lt;  	// enqueued_lt : uint64
+    Ref<Cell> out_msg;  	// out_msg : ^MsgEnvelope
+    Record() = default;
+    Record(unsigned long long _enqueued_lt, Ref<Cell> _out_msg) : enqueued_lt(_enqueued_lt), out_msg(std::move(_out_msg)) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0x10040;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance_ext(0x10040);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, unsigned long long& enqueued_lt, Ref<Cell>& out_msg) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, unsigned long long& enqueued_lt, Ref<Cell>& out_msg) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, unsigned long long enqueued_lt, Ref<Cell> out_msg) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, unsigned long long enqueued_lt, Ref<Cell> out_msg) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "EnqueuedMsg";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const EnqueuedMsg t_EnqueuedMsg;
+
+//
+// headers for type `OutMsgDescr`
+//
+
+struct OutMsgDescr final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef OutMsgDescr type_class;
+    Ref<CellSlice> x;  	// HashmapAugE 256 OutMsg CurrencyCollection
+    Record() = default;
+    Record(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "OutMsgDescr";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const OutMsgDescr t_OutMsgDescr;
+
+//
+// headers for type `OutMsgQueue`
+//
+
+struct OutMsgQueue final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef OutMsgQueue type_class;
+    Ref<CellSlice> x;  	// HashmapAugE 352 EnqueuedMsg uint64
+    Record() = default;
+    Record(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "OutMsgQueue";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const OutMsgQueue t_OutMsgQueue;
+
+//
+// headers for type `ProcessedUpto`
+//
+
+struct ProcessedUpto final : TLB_Complex {
+  enum { processed_upto };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef ProcessedUpto type_class;
+    unsigned long long last_msg_lt;  	// last_msg_lt : uint64
+    td::BitArray<256> last_msg_hash;  	// last_msg_hash : bits256
+    Record() = default;
+    Record(unsigned long long _last_msg_lt, const td::BitArray<256>& _last_msg_hash) : last_msg_lt(_last_msg_lt), last_msg_hash(_last_msg_hash) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 320;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(320);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(320);
+  }
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_processed_upto(vm::CellSlice& cs, unsigned long long& last_msg_lt, td::BitArray<256>& last_msg_hash) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_processed_upto(Ref<vm::Cell> cell_ref, unsigned long long& last_msg_lt, td::BitArray<256>& last_msg_hash) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_processed_upto(vm::CellBuilder& cb, unsigned long long last_msg_lt, td::BitArray<256> last_msg_hash) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_processed_upto(Ref<vm::Cell>& cell_ref, unsigned long long last_msg_lt, td::BitArray<256> last_msg_hash) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ProcessedUpto";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const ProcessedUpto t_ProcessedUpto;
+
+//
+// headers for type `ProcessedInfo`
+//
+
+struct ProcessedInfo final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef ProcessedInfo type_class;
+    Ref<CellSlice> x;  	// HashmapE 96 ProcessedUpto
+    Record() = default;
+    Record(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ProcessedInfo";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const ProcessedInfo t_ProcessedInfo;
+
+//
+// headers for type `IhrPendingSince`
+//
+
+struct IhrPendingSince final : TLB_Complex {
+  enum { ihr_pending };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef IhrPendingSince type_class;
+    unsigned long long import_lt;  	// import_lt : uint64
+    Record() = default;
+    Record(unsigned long long _import_lt) : import_lt(_import_lt) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 64;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(64);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(64);
+  }
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_ihr_pending(vm::CellSlice& cs, unsigned long long& import_lt) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_ihr_pending(Ref<vm::Cell> cell_ref, unsigned long long& import_lt) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_ihr_pending(vm::CellBuilder& cb, unsigned long long import_lt) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_ihr_pending(Ref<vm::Cell>& cell_ref, unsigned long long import_lt) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "IhrPendingSince";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const IhrPendingSince t_IhrPendingSince;
+
+//
+// headers for type `IhrPendingInfo`
+//
+
+struct IhrPendingInfo final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef IhrPendingInfo type_class;
+    Ref<CellSlice> x;  	// HashmapE 320 IhrPendingSince
+    Record() = default;
+    Record(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "IhrPendingInfo";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const IhrPendingInfo t_IhrPendingInfo;
+
+//
+// headers for type `OutMsgQueueInfo`
+//
+
+struct OutMsgQueueInfo final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& out_queue, Ref<CellSlice>& proc_info, Ref<CellSlice>& ihr_pending) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& out_queue, Ref<CellSlice>& proc_info, Ref<CellSlice>& ihr_pending) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> out_queue, Ref<CellSlice> proc_info, Ref<CellSlice> ihr_pending) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> out_queue, Ref<CellSlice> proc_info, Ref<CellSlice> ihr_pending) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "OutMsgQueueInfo";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct OutMsgQueueInfo::Record {
+  typedef OutMsgQueueInfo type_class;
+  Ref<CellSlice> out_queue;  	// out_queue : OutMsgQueue
+  Ref<CellSlice> proc_info;  	// proc_info : ProcessedInfo
+  Ref<CellSlice> ihr_pending;  	// ihr_pending : IhrPendingInfo
+  Record() = default;
+  Record(Ref<CellSlice> _out_queue, Ref<CellSlice> _proc_info, Ref<CellSlice> _ihr_pending) : out_queue(std::move(_out_queue)), proc_info(std::move(_proc_info)), ihr_pending(std::move(_ihr_pending)) {}
+};
+
+extern const OutMsgQueueInfo t_OutMsgQueueInfo;
+
+//
+// headers for type `StorageUsed`
+//
+
+struct StorageUsed final : TLB_Complex {
+  enum { storage_used };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_storage_used(vm::CellSlice& cs, Ref<CellSlice>& cells, Ref<CellSlice>& bits, Ref<CellSlice>& public_cells) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_storage_used(Ref<vm::Cell> cell_ref, Ref<CellSlice>& cells, Ref<CellSlice>& bits, Ref<CellSlice>& public_cells) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_storage_used(vm::CellBuilder& cb, Ref<CellSlice> cells, Ref<CellSlice> bits, Ref<CellSlice> public_cells) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_storage_used(Ref<vm::Cell>& cell_ref, Ref<CellSlice> cells, Ref<CellSlice> bits, Ref<CellSlice> public_cells) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "StorageUsed";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct StorageUsed::Record {
+  typedef StorageUsed type_class;
+  Ref<CellSlice> cells;  	// cells : VarUInteger 7
+  Ref<CellSlice> bits;  	// bits : VarUInteger 7
+  Ref<CellSlice> public_cells;  	// public_cells : VarUInteger 7
+  Record() = default;
+  Record(Ref<CellSlice> _cells, Ref<CellSlice> _bits, Ref<CellSlice> _public_cells) : cells(std::move(_cells)), bits(std::move(_bits)), public_cells(std::move(_public_cells)) {}
+};
+
+extern const StorageUsed t_StorageUsed;
+
+//
+// headers for type `StorageUsedShort`
+//
+
+struct StorageUsedShort final : TLB_Complex {
+  enum { storage_used_short };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef StorageUsedShort type_class;
+    Ref<CellSlice> cells;  	// cells : VarUInteger 7
+    Ref<CellSlice> bits;  	// bits : VarUInteger 7
+    Record() = default;
+    Record(Ref<CellSlice> _cells, Ref<CellSlice> _bits) : cells(std::move(_cells)), bits(std::move(_bits)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_storage_used_short(vm::CellSlice& cs, Ref<CellSlice>& cells, Ref<CellSlice>& bits) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_storage_used_short(Ref<vm::Cell> cell_ref, Ref<CellSlice>& cells, Ref<CellSlice>& bits) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_storage_used_short(vm::CellBuilder& cb, Ref<CellSlice> cells, Ref<CellSlice> bits) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_storage_used_short(Ref<vm::Cell>& cell_ref, Ref<CellSlice> cells, Ref<CellSlice> bits) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "StorageUsedShort";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const StorageUsedShort t_StorageUsedShort;
+
+//
+// headers for type `StorageInfo`
+//
+
+struct StorageInfo final : TLB_Complex {
+  enum { storage_info };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_storage_info(vm::CellSlice& cs, Ref<CellSlice>& used, unsigned& last_paid, Ref<CellSlice>& due_payment) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_storage_info(Ref<vm::Cell> cell_ref, Ref<CellSlice>& used, unsigned& last_paid, Ref<CellSlice>& due_payment) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_storage_info(vm::CellBuilder& cb, Ref<CellSlice> used, unsigned last_paid, Ref<CellSlice> due_payment) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_storage_info(Ref<vm::Cell>& cell_ref, Ref<CellSlice> used, unsigned last_paid, Ref<CellSlice> due_payment) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "StorageInfo";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct StorageInfo::Record {
+  typedef StorageInfo type_class;
+  Ref<CellSlice> used;  	// used : StorageUsed
+  unsigned last_paid;  	// last_paid : uint32
+  Ref<CellSlice> due_payment;  	// due_payment : Maybe Grams
+  Record() = default;
+  Record(Ref<CellSlice> _used, unsigned _last_paid, Ref<CellSlice> _due_payment) : used(std::move(_used)), last_paid(_last_paid), due_payment(std::move(_due_payment)) {}
+};
+
+extern const StorageInfo t_StorageInfo;
+
+//
+// headers for type `Account`
+//
+
+struct Account final : TLB_Complex {
+  enum { account_none, account };
+  static constexpr int cons_len_exact = 1;
+  struct Record_account_none {
+    typedef Account type_class;
+  };
+  struct Record_account;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_account_none& data) const;
+  bool unpack_account_none(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_account_none& data) const;
+  bool cell_unpack_account_none(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_account_none& data) const;
+  bool pack_account_none(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_account_none& data) const;
+  bool cell_pack_account_none(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_account& data) const;
+  bool unpack_account(vm::CellSlice& cs, Ref<CellSlice>& addr, Ref<CellSlice>& storage_stat, Ref<CellSlice>& storage) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_account& data) const;
+  bool cell_unpack_account(Ref<vm::Cell> cell_ref, Ref<CellSlice>& addr, Ref<CellSlice>& storage_stat, Ref<CellSlice>& storage) const;
+  bool pack(vm::CellBuilder& cb, const Record_account& data) const;
+  bool pack_account(vm::CellBuilder& cb, Ref<CellSlice> addr, Ref<CellSlice> storage_stat, Ref<CellSlice> storage) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_account& data) const;
+  bool cell_pack_account(Ref<vm::Cell>& cell_ref, Ref<CellSlice> addr, Ref<CellSlice> storage_stat, Ref<CellSlice> storage) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Account";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+struct Account::Record_account {
+  typedef Account type_class;
+  Ref<CellSlice> addr;  	// addr : MsgAddressInt
+  Ref<CellSlice> storage_stat;  	// storage_stat : StorageInfo
+  Ref<CellSlice> storage;  	// storage : AccountStorage
+  Record_account() = default;
+  Record_account(Ref<CellSlice> _addr, Ref<CellSlice> _storage_stat, Ref<CellSlice> _storage) : addr(std::move(_addr)), storage_stat(std::move(_storage_stat)), storage(std::move(_storage)) {}
+};
+
+extern const Account t_Account;
+
+//
+// headers for type `AccountStorage`
+//
+
+struct AccountStorage final : TLB_Complex {
+  enum { account_storage };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_account_storage(vm::CellSlice& cs, unsigned long long& last_trans_lt, Ref<CellSlice>& balance, Ref<CellSlice>& state) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_account_storage(Ref<vm::Cell> cell_ref, unsigned long long& last_trans_lt, Ref<CellSlice>& balance, Ref<CellSlice>& state) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_account_storage(vm::CellBuilder& cb, unsigned long long last_trans_lt, Ref<CellSlice> balance, Ref<CellSlice> state) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_account_storage(Ref<vm::Cell>& cell_ref, unsigned long long last_trans_lt, Ref<CellSlice> balance, Ref<CellSlice> state) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "AccountStorage";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct AccountStorage::Record {
+  typedef AccountStorage type_class;
+  unsigned long long last_trans_lt;  	// last_trans_lt : uint64
+  Ref<CellSlice> balance;  	// balance : CurrencyCollection
+  Ref<CellSlice> state;  	// state : AccountState
+  Record() = default;
+  Record(unsigned long long _last_trans_lt, Ref<CellSlice> _balance, Ref<CellSlice> _state) : last_trans_lt(_last_trans_lt), balance(std::move(_balance)), state(std::move(_state)) {}
+};
+
+extern const AccountStorage t_AccountStorage;
+
+//
+// headers for type `AccountState`
+//
+
+struct AccountState final : TLB_Complex {
+  enum { account_uninit, account_frozen, account_active };
+  static constexpr char cons_len[3] = { 2, 2, 1 };
+  static constexpr unsigned char cons_tag[3] = { 0, 1, 1 };
+  struct Record_account_uninit {
+    typedef AccountState type_class;
+  };
+  struct Record_account_active {
+    typedef AccountState type_class;
+    Ref<CellSlice> x;  	// StateInit
+    Record_account_active() = default;
+    Record_account_active(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_account_frozen {
+    typedef AccountState type_class;
+    td::BitArray<256> state_hash;  	// state_hash : bits256
+    Record_account_frozen() = default;
+    Record_account_frozen(const td::BitArray<256>& _state_hash) : state_hash(_state_hash) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_account_uninit& data) const;
+  bool unpack_account_uninit(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_account_uninit& data) const;
+  bool cell_unpack_account_uninit(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_account_uninit& data) const;
+  bool pack_account_uninit(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_account_uninit& data) const;
+  bool cell_pack_account_uninit(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_account_active& data) const;
+  bool unpack_account_active(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_account_active& data) const;
+  bool cell_unpack_account_active(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_account_active& data) const;
+  bool pack_account_active(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_account_active& data) const;
+  bool cell_pack_account_active(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_account_frozen& data) const;
+  bool unpack_account_frozen(vm::CellSlice& cs, td::BitArray<256>& state_hash) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_account_frozen& data) const;
+  bool cell_unpack_account_frozen(Ref<vm::Cell> cell_ref, td::BitArray<256>& state_hash) const;
+  bool pack(vm::CellBuilder& cb, const Record_account_frozen& data) const;
+  bool pack_account_frozen(vm::CellBuilder& cb, td::BitArray<256> state_hash) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_account_frozen& data) const;
+  bool cell_pack_account_frozen(Ref<vm::Cell>& cell_ref, td::BitArray<256> state_hash) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "AccountState";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(2, 7);
+  }
+};
+
+extern const AccountState t_AccountState;
+
+//
+// headers for type `AccountStatus`
+//
+
+struct AccountStatus final : TLB_Complex {
+  enum { acc_state_uninit, acc_state_frozen, acc_state_active, acc_state_nonexist };
+  static constexpr int cons_len_exact = 2;
+  struct Record_acc_state_uninit {
+    typedef AccountStatus type_class;
+  };
+  struct Record_acc_state_frozen {
+    typedef AccountStatus type_class;
+  };
+  struct Record_acc_state_active {
+    typedef AccountStatus type_class;
+  };
+  struct Record_acc_state_nonexist {
+    typedef AccountStatus type_class;
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 2;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(2);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(2);
+  }
+  bool fetch_enum_to(vm::CellSlice& cs, char& value) const;
+  bool store_enum_from(vm::CellBuilder& cb, int value) const;
+  bool unpack(vm::CellSlice& cs, Record_acc_state_uninit& data) const;
+  bool unpack_acc_state_uninit(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_acc_state_uninit& data) const;
+  bool cell_unpack_acc_state_uninit(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_acc_state_uninit& data) const;
+  bool pack_acc_state_uninit(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_acc_state_uninit& data) const;
+  bool cell_pack_acc_state_uninit(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_acc_state_frozen& data) const;
+  bool unpack_acc_state_frozen(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_acc_state_frozen& data) const;
+  bool cell_unpack_acc_state_frozen(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_acc_state_frozen& data) const;
+  bool pack_acc_state_frozen(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_acc_state_frozen& data) const;
+  bool cell_pack_acc_state_frozen(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_acc_state_active& data) const;
+  bool unpack_acc_state_active(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_acc_state_active& data) const;
+  bool cell_unpack_acc_state_active(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_acc_state_active& data) const;
+  bool pack_acc_state_active(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_acc_state_active& data) const;
+  bool cell_pack_acc_state_active(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_acc_state_nonexist& data) const;
+  bool unpack_acc_state_nonexist(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_acc_state_nonexist& data) const;
+  bool cell_unpack_acc_state_nonexist(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_acc_state_nonexist& data) const;
+  bool pack_acc_state_nonexist(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_acc_state_nonexist& data) const;
+  bool cell_pack_acc_state_nonexist(Ref<vm::Cell>& cell_ref) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "AccountStatus";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(2);
+  }
+};
+
+extern const AccountStatus t_AccountStatus;
+
+//
+// headers for type `ShardAccount`
+//
+
+struct ShardAccount final : TLB_Complex {
+  enum { account_descr };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0x10140;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance_ext(0x10140);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_account_descr(vm::CellSlice& cs, Ref<Cell>& account, td::BitArray<256>& last_trans_hash, unsigned long long& last_trans_lt) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_account_descr(Ref<vm::Cell> cell_ref, Ref<Cell>& account, td::BitArray<256>& last_trans_hash, unsigned long long& last_trans_lt) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_account_descr(vm::CellBuilder& cb, Ref<Cell> account, td::BitArray<256> last_trans_hash, unsigned long long last_trans_lt) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_account_descr(Ref<vm::Cell>& cell_ref, Ref<Cell> account, td::BitArray<256> last_trans_hash, unsigned long long last_trans_lt) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ShardAccount";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ShardAccount::Record {
+  typedef ShardAccount type_class;
+  Ref<Cell> account;  	// account : ^Account
+  td::BitArray<256> last_trans_hash;  	// last_trans_hash : bits256
+  unsigned long long last_trans_lt;  	// last_trans_lt : uint64
+  Record() = default;
+  Record(Ref<Cell> _account, const td::BitArray<256>& _last_trans_hash, unsigned long long _last_trans_lt) : account(std::move(_account)), last_trans_hash(_last_trans_hash), last_trans_lt(_last_trans_lt) {}
+};
+
+extern const ShardAccount t_ShardAccount;
+
+//
+// headers for type `DepthBalanceInfo`
+//
+
+struct DepthBalanceInfo final : TLB_Complex {
+  enum { depth_balance };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef DepthBalanceInfo type_class;
+    int split_depth;  	// split_depth : #<= 30
+    Ref<CellSlice> balance;  	// balance : CurrencyCollection
+    Record() = default;
+    Record(int _split_depth, Ref<CellSlice> _balance) : split_depth(_split_depth), balance(std::move(_balance)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_depth_balance(vm::CellSlice& cs, int& split_depth, Ref<CellSlice>& balance) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_depth_balance(Ref<vm::Cell> cell_ref, int& split_depth, Ref<CellSlice>& balance) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_depth_balance(vm::CellBuilder& cb, int split_depth, Ref<CellSlice> balance) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_depth_balance(Ref<vm::Cell>& cell_ref, int split_depth, Ref<CellSlice> balance) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "DepthBalanceInfo";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const DepthBalanceInfo t_DepthBalanceInfo;
+
+//
+// headers for type `ShardAccounts`
+//
+
+struct ShardAccounts final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef ShardAccounts type_class;
+    Ref<CellSlice> x;  	// HashmapAugE 256 ShardAccount DepthBalanceInfo
+    Record() = default;
+    Record(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ShardAccounts";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const ShardAccounts t_ShardAccounts;
+
+//
+// headers for auxiliary type `Transaction_aux`
+//
+
+struct Transaction_aux final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef Transaction_aux type_class;
+    Ref<CellSlice> in_msg;  	// in_msg : Maybe ^(Message Any)
+    Ref<CellSlice> out_msgs;  	// out_msgs : HashmapE 15 ^(Message Any)
+    Record() = default;
+    Record(Ref<CellSlice> _in_msg, Ref<CellSlice> _out_msgs) : in_msg(std::move(_in_msg)), out_msgs(std::move(_out_msgs)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& in_msg, Ref<CellSlice>& out_msgs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& in_msg, Ref<CellSlice>& out_msgs) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> in_msg, Ref<CellSlice> out_msgs) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> in_msg, Ref<CellSlice> out_msgs) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Transaction_aux";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const Transaction_aux t_Transaction_aux;
+
+//
+// headers for type `Transaction`
+//
+
+struct Transaction final : TLB_Complex {
+  enum { transaction };
+  static constexpr int cons_len_exact = 4;
+  static constexpr unsigned char cons_tag[1] = { 7 };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Transaction";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct Transaction::Record {
+  typedef Transaction type_class;
+  td::BitArray<256> account_addr;  	// account_addr : bits256
+  unsigned long long lt;  	// lt : uint64
+  td::BitArray<256> prev_trans_hash;  	// prev_trans_hash : bits256
+  unsigned long long prev_trans_lt;  	// prev_trans_lt : uint64
+  unsigned now;  	// now : uint32
+  int outmsg_cnt;  	// outmsg_cnt : uint15
+  char orig_status;  	// orig_status : AccountStatus
+  char end_status;  	// end_status : AccountStatus
+  Transaction_aux::Record r1;  	// ^[$_ in_msg:(Maybe ^(Message Any)) out_msgs:(HashmapE 15 ^(Message Any)) ]
+  Ref<CellSlice> total_fees;  	// total_fees : CurrencyCollection
+  Ref<Cell> state_update;  	// state_update : ^(HASH_UPDATE Account)
+  Ref<Cell> description;  	// description : ^TransactionDescr
+  Record() = default;
+  Record(const td::BitArray<256>& _account_addr, unsigned long long _lt, const td::BitArray<256>& _prev_trans_hash, unsigned long long _prev_trans_lt, unsigned _now, int _outmsg_cnt, char _orig_status, char _end_status, const Transaction_aux::Record& _r1, Ref<CellSlice> _total_fees, Ref<Cell> _state_update, Ref<Cell> _description) : account_addr(_account_addr), lt(_lt), prev_trans_hash(_prev_trans_hash), prev_trans_lt(_prev_trans_lt), now(_now), outmsg_cnt(_outmsg_cnt), orig_status(_orig_status), end_status(_end_status), r1(_r1), total_fees(std::move(_total_fees)), state_update(std::move(_state_update)), description(std::move(_description)) {}
+};
+
+extern const Transaction t_Transaction;
+
+//
+// headers for type `MERKLE_UPDATE`
+//
+
+struct MERKLE_UPDATE final : TLB_Complex {
+  enum { _merkle_update };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 2 };
+  const TLB &X_;
+  MERKLE_UPDATE(const TLB& X) : X_(X) {}
+  struct Record;
+  bool always_special() const override {
+    return true;
+  }
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0x20208;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance_ext(0x20208);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(MERKLE_UPDATE " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct MERKLE_UPDATE::Record {
+  typedef MERKLE_UPDATE type_class;
+  td::BitArray<256> old_hash;  	// old_hash : bits256
+  td::BitArray<256> new_hash;  	// new_hash : bits256
+  Ref<Cell> old;  	// old : ^X
+  Ref<Cell> new1;  	// new : ^X
+  Record() = default;
+  Record(const td::BitArray<256>& _old_hash, const td::BitArray<256>& _new_hash, Ref<Cell> _old, Ref<Cell> _new1) : old_hash(_old_hash), new_hash(_new_hash), old(std::move(_old)), new1(std::move(_new1)) {}
+};
+
+//
+// headers for type `HASH_UPDATE`
+//
+
+struct HASH_UPDATE final : TLB_Complex {
+  enum { update_hashes };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 0x72 };
+  const TLB &X_;
+  HASH_UPDATE(const TLB& X) : X_(X) {}
+  struct Record {
+    typedef HASH_UPDATE type_class;
+    td::BitArray<256> old_hash;  	// old_hash : bits256
+    td::BitArray<256> new_hash;  	// new_hash : bits256
+    Record() = default;
+    Record(const td::BitArray<256>& _old_hash, const td::BitArray<256>& _new_hash) : old_hash(_old_hash), new_hash(_new_hash) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 520;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(520);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_update_hashes(vm::CellSlice& cs, td::BitArray<256>& old_hash, td::BitArray<256>& new_hash) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_update_hashes(Ref<vm::Cell> cell_ref, td::BitArray<256>& old_hash, td::BitArray<256>& new_hash) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_update_hashes(vm::CellBuilder& cb, td::BitArray<256> old_hash, td::BitArray<256> new_hash) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_update_hashes(Ref<vm::Cell>& cell_ref, td::BitArray<256> old_hash, td::BitArray<256> new_hash) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(HASH_UPDATE " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+//
+// headers for type `AccountBlock`
+//
+
+struct AccountBlock final : TLB_Complex {
+  enum { acc_trans };
+  static constexpr int cons_len_exact = 4;
+  static constexpr unsigned char cons_tag[1] = { 5 };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_acc_trans(vm::CellSlice& cs, td::BitArray<256>& account_addr, Ref<CellSlice>& transactions, Ref<Cell>& state_update) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_acc_trans(Ref<vm::Cell> cell_ref, td::BitArray<256>& account_addr, Ref<CellSlice>& transactions, Ref<Cell>& state_update) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_acc_trans(vm::CellBuilder& cb, td::BitArray<256> account_addr, Ref<CellSlice> transactions, Ref<Cell> state_update) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_acc_trans(Ref<vm::Cell>& cell_ref, td::BitArray<256> account_addr, Ref<CellSlice> transactions, Ref<Cell> state_update) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "AccountBlock";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct AccountBlock::Record {
+  typedef AccountBlock type_class;
+  td::BitArray<256> account_addr;  	// account_addr : bits256
+  Ref<CellSlice> transactions;  	// transactions : HashmapAug 64 ^Transaction CurrencyCollection
+  Ref<Cell> state_update;  	// state_update : ^(HASH_UPDATE Account)
+  Record() = default;
+  Record(const td::BitArray<256>& _account_addr, Ref<CellSlice> _transactions, Ref<Cell> _state_update) : account_addr(_account_addr), transactions(std::move(_transactions)), state_update(std::move(_state_update)) {}
+};
+
+extern const AccountBlock t_AccountBlock;
+
+//
+// headers for type `ShardAccountBlocks`
+//
+
+struct ShardAccountBlocks final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef ShardAccountBlocks type_class;
+    Ref<CellSlice> x;  	// HashmapAugE 256 AccountBlock CurrencyCollection
+    Record() = default;
+    Record(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ShardAccountBlocks";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const ShardAccountBlocks t_ShardAccountBlocks;
+
+//
+// headers for type `TrStoragePhase`
+//
+
+struct TrStoragePhase final : TLB_Complex {
+  enum { tr_phase_storage };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_tr_phase_storage(vm::CellSlice& cs, Ref<CellSlice>& storage_fees_collected, Ref<CellSlice>& storage_fees_due, char& status_change) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_tr_phase_storage(Ref<vm::Cell> cell_ref, Ref<CellSlice>& storage_fees_collected, Ref<CellSlice>& storage_fees_due, char& status_change) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_tr_phase_storage(vm::CellBuilder& cb, Ref<CellSlice> storage_fees_collected, Ref<CellSlice> storage_fees_due, char status_change) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_tr_phase_storage(Ref<vm::Cell>& cell_ref, Ref<CellSlice> storage_fees_collected, Ref<CellSlice> storage_fees_due, char status_change) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "TrStoragePhase";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct TrStoragePhase::Record {
+  typedef TrStoragePhase type_class;
+  Ref<CellSlice> storage_fees_collected;  	// storage_fees_collected : Grams
+  Ref<CellSlice> storage_fees_due;  	// storage_fees_due : Maybe Grams
+  char status_change;  	// status_change : AccStatusChange
+  Record() = default;
+  Record(Ref<CellSlice> _storage_fees_collected, Ref<CellSlice> _storage_fees_due, char _status_change) : storage_fees_collected(std::move(_storage_fees_collected)), storage_fees_due(std::move(_storage_fees_due)), status_change(_status_change) {}
+};
+
+extern const TrStoragePhase t_TrStoragePhase;
+
+//
+// headers for type `AccStatusChange`
+//
+
+struct AccStatusChange final : TLB_Complex {
+  enum { acst_unchanged, acst_frozen, acst_deleted };
+  static constexpr char cons_len[3] = { 1, 2, 2 };
+  static constexpr unsigned char cons_tag[3] = { 0, 2, 3 };
+  struct Record_acst_unchanged {
+    typedef AccStatusChange type_class;
+  };
+  struct Record_acst_frozen {
+    typedef AccStatusChange type_class;
+  };
+  struct Record_acst_deleted {
+    typedef AccStatusChange type_class;
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool fetch_enum_to(vm::CellSlice& cs, char& value) const;
+  bool store_enum_from(vm::CellBuilder& cb, int value) const;
+  bool unpack(vm::CellSlice& cs, Record_acst_unchanged& data) const;
+  bool unpack_acst_unchanged(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_acst_unchanged& data) const;
+  bool cell_unpack_acst_unchanged(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_acst_unchanged& data) const;
+  bool pack_acst_unchanged(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_acst_unchanged& data) const;
+  bool cell_pack_acst_unchanged(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_acst_frozen& data) const;
+  bool unpack_acst_frozen(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_acst_frozen& data) const;
+  bool cell_unpack_acst_frozen(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_acst_frozen& data) const;
+  bool pack_acst_frozen(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_acst_frozen& data) const;
+  bool cell_pack_acst_frozen(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_acst_deleted& data) const;
+  bool unpack_acst_deleted(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_acst_deleted& data) const;
+  bool cell_unpack_acst_deleted(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_acst_deleted& data) const;
+  bool pack_acst_deleted(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_acst_deleted& data) const;
+  bool cell_pack_acst_deleted(Ref<vm::Cell>& cell_ref) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "AccStatusChange";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect_ext(2, 13);
+  }
+};
+
+extern const AccStatusChange t_AccStatusChange;
+
+//
+// headers for type `TrCreditPhase`
+//
+
+struct TrCreditPhase final : TLB_Complex {
+  enum { tr_phase_credit };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef TrCreditPhase type_class;
+    Ref<CellSlice> due_fees_collected;  	// due_fees_collected : Maybe Grams
+    Ref<CellSlice> credit;  	// credit : CurrencyCollection
+    Record() = default;
+    Record(Ref<CellSlice> _due_fees_collected, Ref<CellSlice> _credit) : due_fees_collected(std::move(_due_fees_collected)), credit(std::move(_credit)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_tr_phase_credit(vm::CellSlice& cs, Ref<CellSlice>& due_fees_collected, Ref<CellSlice>& credit) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_tr_phase_credit(Ref<vm::Cell> cell_ref, Ref<CellSlice>& due_fees_collected, Ref<CellSlice>& credit) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_tr_phase_credit(vm::CellBuilder& cb, Ref<CellSlice> due_fees_collected, Ref<CellSlice> credit) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_tr_phase_credit(Ref<vm::Cell>& cell_ref, Ref<CellSlice> due_fees_collected, Ref<CellSlice> credit) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "TrCreditPhase";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const TrCreditPhase t_TrCreditPhase;
+
+//
+// headers for auxiliary type `TrComputePhase_aux`
+//
+
+struct TrComputePhase_aux final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "TrComputePhase_aux";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct TrComputePhase_aux::Record {
+  typedef TrComputePhase_aux type_class;
+  Ref<CellSlice> gas_used;  	// gas_used : VarUInteger 7
+  Ref<CellSlice> gas_limit;  	// gas_limit : VarUInteger 7
+  Ref<CellSlice> gas_credit;  	// gas_credit : Maybe (VarUInteger 3)
+  int mode;  	// mode : int8
+  int exit_code;  	// exit_code : int32
+  Ref<CellSlice> exit_arg;  	// exit_arg : Maybe int32
+  unsigned vm_steps;  	// vm_steps : uint32
+  td::BitArray<256> vm_init_state_hash;  	// vm_init_state_hash : bits256
+  td::BitArray<256> vm_final_state_hash;  	// vm_final_state_hash : bits256
+  Record() = default;
+  Record(Ref<CellSlice> _gas_used, Ref<CellSlice> _gas_limit, Ref<CellSlice> _gas_credit, int _mode, int _exit_code, Ref<CellSlice> _exit_arg, unsigned _vm_steps, const td::BitArray<256>& _vm_init_state_hash, const td::BitArray<256>& _vm_final_state_hash) : gas_used(std::move(_gas_used)), gas_limit(std::move(_gas_limit)), gas_credit(std::move(_gas_credit)), mode(_mode), exit_code(_exit_code), exit_arg(std::move(_exit_arg)), vm_steps(_vm_steps), vm_init_state_hash(_vm_init_state_hash), vm_final_state_hash(_vm_final_state_hash) {}
+};
+
+extern const TrComputePhase_aux t_TrComputePhase_aux;
+
+//
+// headers for type `TrComputePhase`
+//
+
+struct TrComputePhase final : TLB_Complex {
+  enum { tr_phase_compute_skipped, tr_phase_compute_vm };
+  static constexpr int cons_len_exact = 1;
+  struct Record_tr_phase_compute_skipped {
+    typedef TrComputePhase type_class;
+    char reason;  	// reason : ComputeSkipReason
+    Record_tr_phase_compute_skipped() = default;
+    Record_tr_phase_compute_skipped(char _reason) : reason(_reason) {}
+  };
+  struct Record_tr_phase_compute_vm;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_tr_phase_compute_skipped& data) const;
+  bool unpack_tr_phase_compute_skipped(vm::CellSlice& cs, char& reason) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_tr_phase_compute_skipped& data) const;
+  bool cell_unpack_tr_phase_compute_skipped(Ref<vm::Cell> cell_ref, char& reason) const;
+  bool pack(vm::CellBuilder& cb, const Record_tr_phase_compute_skipped& data) const;
+  bool pack_tr_phase_compute_skipped(vm::CellBuilder& cb, char reason) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_tr_phase_compute_skipped& data) const;
+  bool cell_pack_tr_phase_compute_skipped(Ref<vm::Cell>& cell_ref, char reason) const;
+  bool unpack(vm::CellSlice& cs, Record_tr_phase_compute_vm& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_tr_phase_compute_vm& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_tr_phase_compute_vm& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_tr_phase_compute_vm& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "TrComputePhase";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+struct TrComputePhase::Record_tr_phase_compute_vm {
+  typedef TrComputePhase type_class;
+  bool success;  	// success : Bool
+  bool msg_state_used;  	// msg_state_used : Bool
+  bool account_activated;  	// account_activated : Bool
+  Ref<CellSlice> gas_fees;  	// gas_fees : Grams
+  TrComputePhase_aux::Record r1;  	// ^[$_ gas_used:(VarUInteger 7) gas_limit:(VarUInteger 7) gas_credit:(Maybe (VarUInteger 3)) mode:int8 exit_code:int32 exit_arg:(Maybe int32) vm_steps:uint32 vm_init_state_hash:bits256 vm_final_state_hash:bits256 ]
+  Record_tr_phase_compute_vm() = default;
+  Record_tr_phase_compute_vm(bool _success, bool _msg_state_used, bool _account_activated, Ref<CellSlice> _gas_fees, const TrComputePhase_aux::Record& _r1) : success(_success), msg_state_used(_msg_state_used), account_activated(_account_activated), gas_fees(std::move(_gas_fees)), r1(_r1) {}
+};
+
+extern const TrComputePhase t_TrComputePhase;
+
+//
+// headers for type `ComputeSkipReason`
+//
+
+struct ComputeSkipReason final : TLB_Complex {
+  enum { cskip_no_state, cskip_bad_state, cskip_no_gas };
+  static constexpr int cons_len_exact = 2;
+  struct Record_cskip_no_state {
+    typedef ComputeSkipReason type_class;
+  };
+  struct Record_cskip_bad_state {
+    typedef ComputeSkipReason type_class;
+  };
+  struct Record_cskip_no_gas {
+    typedef ComputeSkipReason type_class;
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 2;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(2);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool fetch_enum_to(vm::CellSlice& cs, char& value) const;
+  bool store_enum_from(vm::CellBuilder& cb, int value) const;
+  bool unpack(vm::CellSlice& cs, Record_cskip_no_state& data) const;
+  bool unpack_cskip_no_state(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cskip_no_state& data) const;
+  bool cell_unpack_cskip_no_state(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_cskip_no_state& data) const;
+  bool pack_cskip_no_state(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cskip_no_state& data) const;
+  bool cell_pack_cskip_no_state(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_cskip_bad_state& data) const;
+  bool unpack_cskip_bad_state(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cskip_bad_state& data) const;
+  bool cell_unpack_cskip_bad_state(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_cskip_bad_state& data) const;
+  bool pack_cskip_bad_state(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cskip_bad_state& data) const;
+  bool cell_pack_cskip_bad_state(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_cskip_no_gas& data) const;
+  bool unpack_cskip_no_gas(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cskip_no_gas& data) const;
+  bool cell_unpack_cskip_no_gas(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_cskip_no_gas& data) const;
+  bool pack_cskip_no_gas(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cskip_no_gas& data) const;
+  bool cell_pack_cskip_no_gas(Ref<vm::Cell>& cell_ref) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ComputeSkipReason";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(2, 7);
+  }
+};
+
+extern const ComputeSkipReason t_ComputeSkipReason;
+
+//
+// headers for type `TrActionPhase`
+//
+
+struct TrActionPhase final : TLB_Complex {
+  enum { tr_phase_action };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "TrActionPhase";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct TrActionPhase::Record {
+  typedef TrActionPhase type_class;
+  bool success;  	// success : Bool
+  bool valid;  	// valid : Bool
+  bool no_funds;  	// no_funds : Bool
+  char status_change;  	// status_change : AccStatusChange
+  Ref<CellSlice> total_fwd_fees;  	// total_fwd_fees : Maybe Grams
+  Ref<CellSlice> total_action_fees;  	// total_action_fees : Maybe Grams
+  int result_code;  	// result_code : int32
+  Ref<CellSlice> result_arg;  	// result_arg : Maybe int32
+  int tot_actions;  	// tot_actions : uint16
+  int spec_actions;  	// spec_actions : uint16
+  int skipped_actions;  	// skipped_actions : uint16
+  int msgs_created;  	// msgs_created : uint16
+  td::BitArray<256> action_list_hash;  	// action_list_hash : bits256
+  Ref<CellSlice> tot_msg_size;  	// tot_msg_size : StorageUsedShort
+  Record() = default;
+  Record(bool _success, bool _valid, bool _no_funds, char _status_change, Ref<CellSlice> _total_fwd_fees, Ref<CellSlice> _total_action_fees, int _result_code, Ref<CellSlice> _result_arg, int _tot_actions, int _spec_actions, int _skipped_actions, int _msgs_created, const td::BitArray<256>& _action_list_hash, Ref<CellSlice> _tot_msg_size) : success(_success), valid(_valid), no_funds(_no_funds), status_change(_status_change), total_fwd_fees(std::move(_total_fwd_fees)), total_action_fees(std::move(_total_action_fees)), result_code(_result_code), result_arg(std::move(_result_arg)), tot_actions(_tot_actions), spec_actions(_spec_actions), skipped_actions(_skipped_actions), msgs_created(_msgs_created), action_list_hash(_action_list_hash), tot_msg_size(std::move(_tot_msg_size)) {}
+};
+
+extern const TrActionPhase t_TrActionPhase;
+
+//
+// headers for type `TrBouncePhase`
+//
+
+struct TrBouncePhase final : TLB_Complex {
+  enum { tr_phase_bounce_negfunds, tr_phase_bounce_nofunds, tr_phase_bounce_ok };
+  static constexpr char cons_len[3] = { 2, 2, 1 };
+  static constexpr unsigned char cons_tag[3] = { 0, 1, 1 };
+  struct Record_tr_phase_bounce_negfunds {
+    typedef TrBouncePhase type_class;
+  };
+  struct Record_tr_phase_bounce_nofunds {
+    typedef TrBouncePhase type_class;
+    Ref<CellSlice> msg_size;  	// msg_size : StorageUsedShort
+    Ref<CellSlice> req_fwd_fees;  	// req_fwd_fees : Grams
+    Record_tr_phase_bounce_nofunds() = default;
+    Record_tr_phase_bounce_nofunds(Ref<CellSlice> _msg_size, Ref<CellSlice> _req_fwd_fees) : msg_size(std::move(_msg_size)), req_fwd_fees(std::move(_req_fwd_fees)) {}
+  };
+  struct Record_tr_phase_bounce_ok;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_tr_phase_bounce_negfunds& data) const;
+  bool unpack_tr_phase_bounce_negfunds(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_tr_phase_bounce_negfunds& data) const;
+  bool cell_unpack_tr_phase_bounce_negfunds(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_tr_phase_bounce_negfunds& data) const;
+  bool pack_tr_phase_bounce_negfunds(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_tr_phase_bounce_negfunds& data) const;
+  bool cell_pack_tr_phase_bounce_negfunds(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_tr_phase_bounce_nofunds& data) const;
+  bool unpack_tr_phase_bounce_nofunds(vm::CellSlice& cs, Ref<CellSlice>& msg_size, Ref<CellSlice>& req_fwd_fees) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_tr_phase_bounce_nofunds& data) const;
+  bool cell_unpack_tr_phase_bounce_nofunds(Ref<vm::Cell> cell_ref, Ref<CellSlice>& msg_size, Ref<CellSlice>& req_fwd_fees) const;
+  bool pack(vm::CellBuilder& cb, const Record_tr_phase_bounce_nofunds& data) const;
+  bool pack_tr_phase_bounce_nofunds(vm::CellBuilder& cb, Ref<CellSlice> msg_size, Ref<CellSlice> req_fwd_fees) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_tr_phase_bounce_nofunds& data) const;
+  bool cell_pack_tr_phase_bounce_nofunds(Ref<vm::Cell>& cell_ref, Ref<CellSlice> msg_size, Ref<CellSlice> req_fwd_fees) const;
+  bool unpack(vm::CellSlice& cs, Record_tr_phase_bounce_ok& data) const;
+  bool unpack_tr_phase_bounce_ok(vm::CellSlice& cs, Ref<CellSlice>& msg_size, Ref<CellSlice>& msg_fees, Ref<CellSlice>& fwd_fees) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_tr_phase_bounce_ok& data) const;
+  bool cell_unpack_tr_phase_bounce_ok(Ref<vm::Cell> cell_ref, Ref<CellSlice>& msg_size, Ref<CellSlice>& msg_fees, Ref<CellSlice>& fwd_fees) const;
+  bool pack(vm::CellBuilder& cb, const Record_tr_phase_bounce_ok& data) const;
+  bool pack_tr_phase_bounce_ok(vm::CellBuilder& cb, Ref<CellSlice> msg_size, Ref<CellSlice> msg_fees, Ref<CellSlice> fwd_fees) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_tr_phase_bounce_ok& data) const;
+  bool cell_pack_tr_phase_bounce_ok(Ref<vm::Cell>& cell_ref, Ref<CellSlice> msg_size, Ref<CellSlice> msg_fees, Ref<CellSlice> fwd_fees) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "TrBouncePhase";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect_ext(2, 7);
+  }
+};
+
+struct TrBouncePhase::Record_tr_phase_bounce_ok {
+  typedef TrBouncePhase type_class;
+  Ref<CellSlice> msg_size;  	// msg_size : StorageUsedShort
+  Ref<CellSlice> msg_fees;  	// msg_fees : Grams
+  Ref<CellSlice> fwd_fees;  	// fwd_fees : Grams
+  Record_tr_phase_bounce_ok() = default;
+  Record_tr_phase_bounce_ok(Ref<CellSlice> _msg_size, Ref<CellSlice> _msg_fees, Ref<CellSlice> _fwd_fees) : msg_size(std::move(_msg_size)), msg_fees(std::move(_msg_fees)), fwd_fees(std::move(_fwd_fees)) {}
+};
+
+extern const TrBouncePhase t_TrBouncePhase;
+
+//
+// headers for type `SplitMergeInfo`
+//
+
+struct SplitMergeInfo final : TLB_Complex {
+  enum { split_merge_info };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 524;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(524);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(524);
+  }
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "SplitMergeInfo";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct SplitMergeInfo::Record {
+  typedef SplitMergeInfo type_class;
+  int cur_shard_pfx_len;  	// cur_shard_pfx_len : ## 6
+  int acc_split_depth;  	// acc_split_depth : ## 6
+  td::BitArray<256> this_addr;  	// this_addr : bits256
+  td::BitArray<256> sibling_addr;  	// sibling_addr : bits256
+  Record() = default;
+  Record(int _cur_shard_pfx_len, int _acc_split_depth, const td::BitArray<256>& _this_addr, const td::BitArray<256>& _sibling_addr) : cur_shard_pfx_len(_cur_shard_pfx_len), acc_split_depth(_acc_split_depth), this_addr(_this_addr), sibling_addr(_sibling_addr) {}
+};
+
+extern const SplitMergeInfo t_SplitMergeInfo;
+
+//
+// headers for type `TransactionDescr`
+//
+
+struct TransactionDescr final : TLB_Complex {
+  enum { trans_ord, trans_storage, trans_tick_tock, trans_split_prepare, trans_split_install, trans_merge_prepare, trans_merge_install };
+  static constexpr char cons_len[7] = { 4, 4, 3, 4, 4, 4, 4 };
+  static constexpr unsigned char cons_tag[7] = { 0, 1, 1, 4, 5, 6, 7 };
+  struct Record_trans_ord;
+  struct Record_trans_storage {
+    typedef TransactionDescr type_class;
+    Ref<CellSlice> storage_ph;  	// storage_ph : TrStoragePhase
+    Record_trans_storage() = default;
+    Record_trans_storage(Ref<CellSlice> _storage_ph) : storage_ph(std::move(_storage_ph)) {}
+  };
+  struct Record_trans_tick_tock;
+  struct Record_trans_split_prepare;
+  struct Record_trans_split_install;
+  struct Record_trans_merge_prepare;
+  struct Record_trans_merge_install;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_trans_ord& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_trans_ord& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_trans_ord& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_trans_ord& data) const;
+  bool unpack(vm::CellSlice& cs, Record_trans_storage& data) const;
+  bool unpack_trans_storage(vm::CellSlice& cs, Ref<CellSlice>& storage_ph) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_trans_storage& data) const;
+  bool cell_unpack_trans_storage(Ref<vm::Cell> cell_ref, Ref<CellSlice>& storage_ph) const;
+  bool pack(vm::CellBuilder& cb, const Record_trans_storage& data) const;
+  bool pack_trans_storage(vm::CellBuilder& cb, Ref<CellSlice> storage_ph) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_trans_storage& data) const;
+  bool cell_pack_trans_storage(Ref<vm::Cell>& cell_ref, Ref<CellSlice> storage_ph) const;
+  bool unpack(vm::CellSlice& cs, Record_trans_tick_tock& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_trans_tick_tock& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_trans_tick_tock& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_trans_tick_tock& data) const;
+  bool unpack(vm::CellSlice& cs, Record_trans_split_prepare& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_trans_split_prepare& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_trans_split_prepare& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_trans_split_prepare& data) const;
+  bool unpack(vm::CellSlice& cs, Record_trans_split_install& data) const;
+  bool unpack_trans_split_install(vm::CellSlice& cs, Ref<CellSlice>& split_info, Ref<Cell>& prepare_transaction, bool& installed) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_trans_split_install& data) const;
+  bool cell_unpack_trans_split_install(Ref<vm::Cell> cell_ref, Ref<CellSlice>& split_info, Ref<Cell>& prepare_transaction, bool& installed) const;
+  bool pack(vm::CellBuilder& cb, const Record_trans_split_install& data) const;
+  bool pack_trans_split_install(vm::CellBuilder& cb, Ref<CellSlice> split_info, Ref<Cell> prepare_transaction, bool installed) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_trans_split_install& data) const;
+  bool cell_pack_trans_split_install(Ref<vm::Cell>& cell_ref, Ref<CellSlice> split_info, Ref<Cell> prepare_transaction, bool installed) const;
+  bool unpack(vm::CellSlice& cs, Record_trans_merge_prepare& data) const;
+  bool unpack_trans_merge_prepare(vm::CellSlice& cs, Ref<CellSlice>& split_info, Ref<CellSlice>& storage_ph, bool& aborted) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_trans_merge_prepare& data) const;
+  bool cell_unpack_trans_merge_prepare(Ref<vm::Cell> cell_ref, Ref<CellSlice>& split_info, Ref<CellSlice>& storage_ph, bool& aborted) const;
+  bool pack(vm::CellBuilder& cb, const Record_trans_merge_prepare& data) const;
+  bool pack_trans_merge_prepare(vm::CellBuilder& cb, Ref<CellSlice> split_info, Ref<CellSlice> storage_ph, bool aborted) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_trans_merge_prepare& data) const;
+  bool cell_pack_trans_merge_prepare(Ref<vm::Cell>& cell_ref, Ref<CellSlice> split_info, Ref<CellSlice> storage_ph, bool aborted) const;
+  bool unpack(vm::CellSlice& cs, Record_trans_merge_install& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_trans_merge_install& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_trans_merge_install& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_trans_merge_install& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "TransactionDescr";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(4, 0xf7);
+  }
+};
+
+struct TransactionDescr::Record_trans_ord {
+  typedef TransactionDescr type_class;
+  bool credit_first;  	// credit_first : Bool
+  Ref<CellSlice> storage_ph;  	// storage_ph : Maybe TrStoragePhase
+  Ref<CellSlice> credit_ph;  	// credit_ph : Maybe TrCreditPhase
+  Ref<CellSlice> compute_ph;  	// compute_ph : TrComputePhase
+  Ref<CellSlice> action;  	// action : Maybe ^TrActionPhase
+  bool aborted;  	// aborted : Bool
+  Ref<CellSlice> bounce;  	// bounce : Maybe TrBouncePhase
+  bool destroyed;  	// destroyed : Bool
+  Record_trans_ord() = default;
+  Record_trans_ord(bool _credit_first, Ref<CellSlice> _storage_ph, Ref<CellSlice> _credit_ph, Ref<CellSlice> _compute_ph, Ref<CellSlice> _action, bool _aborted, Ref<CellSlice> _bounce, bool _destroyed) : credit_first(_credit_first), storage_ph(std::move(_storage_ph)), credit_ph(std::move(_credit_ph)), compute_ph(std::move(_compute_ph)), action(std::move(_action)), aborted(_aborted), bounce(std::move(_bounce)), destroyed(_destroyed) {}
+};
+
+struct TransactionDescr::Record_trans_tick_tock {
+  typedef TransactionDescr type_class;
+  bool is_tock;  	// is_tock : Bool
+  Ref<CellSlice> storage;  	// storage : TrStoragePhase
+  Ref<CellSlice> compute_ph;  	// compute_ph : TrComputePhase
+  Ref<CellSlice> action;  	// action : Maybe ^TrActionPhase
+  bool aborted;  	// aborted : Bool
+  bool destroyed;  	// destroyed : Bool
+  Record_trans_tick_tock() = default;
+  Record_trans_tick_tock(bool _is_tock, Ref<CellSlice> _storage, Ref<CellSlice> _compute_ph, Ref<CellSlice> _action, bool _aborted, bool _destroyed) : is_tock(_is_tock), storage(std::move(_storage)), compute_ph(std::move(_compute_ph)), action(std::move(_action)), aborted(_aborted), destroyed(_destroyed) {}
+};
+
+struct TransactionDescr::Record_trans_split_prepare {
+  typedef TransactionDescr type_class;
+  Ref<CellSlice> split_info;  	// split_info : SplitMergeInfo
+  Ref<CellSlice> compute_ph;  	// compute_ph : TrComputePhase
+  Ref<CellSlice> action;  	// action : Maybe ^TrActionPhase
+  bool aborted;  	// aborted : Bool
+  bool destroyed;  	// destroyed : Bool
+  Record_trans_split_prepare() = default;
+  Record_trans_split_prepare(Ref<CellSlice> _split_info, Ref<CellSlice> _compute_ph, Ref<CellSlice> _action, bool _aborted, bool _destroyed) : split_info(std::move(_split_info)), compute_ph(std::move(_compute_ph)), action(std::move(_action)), aborted(_aborted), destroyed(_destroyed) {}
+};
+
+struct TransactionDescr::Record_trans_split_install {
+  typedef TransactionDescr type_class;
+  Ref<CellSlice> split_info;  	// split_info : SplitMergeInfo
+  Ref<Cell> prepare_transaction;  	// prepare_transaction : ^Transaction
+  bool installed;  	// installed : Bool
+  Record_trans_split_install() = default;
+  Record_trans_split_install(Ref<CellSlice> _split_info, Ref<Cell> _prepare_transaction, bool _installed) : split_info(std::move(_split_info)), prepare_transaction(std::move(_prepare_transaction)), installed(_installed) {}
+};
+
+struct TransactionDescr::Record_trans_merge_prepare {
+  typedef TransactionDescr type_class;
+  Ref<CellSlice> split_info;  	// split_info : SplitMergeInfo
+  Ref<CellSlice> storage_ph;  	// storage_ph : TrStoragePhase
+  bool aborted;  	// aborted : Bool
+  Record_trans_merge_prepare() = default;
+  Record_trans_merge_prepare(Ref<CellSlice> _split_info, Ref<CellSlice> _storage_ph, bool _aborted) : split_info(std::move(_split_info)), storage_ph(std::move(_storage_ph)), aborted(_aborted) {}
+};
+
+struct TransactionDescr::Record_trans_merge_install {
+  typedef TransactionDescr type_class;
+  Ref<CellSlice> split_info;  	// split_info : SplitMergeInfo
+  Ref<Cell> prepare_transaction;  	// prepare_transaction : ^Transaction
+  Ref<CellSlice> credit_ph;  	// credit_ph : Maybe TrCreditPhase
+  Ref<CellSlice> compute_ph;  	// compute_ph : TrComputePhase
+  Ref<CellSlice> action;  	// action : Maybe ^TrActionPhase
+  bool aborted;  	// aborted : Bool
+  bool destroyed;  	// destroyed : Bool
+  Record_trans_merge_install() = default;
+  Record_trans_merge_install(Ref<CellSlice> _split_info, Ref<Cell> _prepare_transaction, Ref<CellSlice> _credit_ph, Ref<CellSlice> _compute_ph, Ref<CellSlice> _action, bool _aborted, bool _destroyed) : split_info(std::move(_split_info)), prepare_transaction(std::move(_prepare_transaction)), credit_ph(std::move(_credit_ph)), compute_ph(std::move(_compute_ph)), action(std::move(_action)), aborted(_aborted), destroyed(_destroyed) {}
+};
+
+extern const TransactionDescr t_TransactionDescr;
+
+//
+// headers for type `SmartContractInfo`
+//
+
+struct SmartContractInfo final : TLB_Complex {
+  enum { smc_info };
+  static constexpr int cons_len_exact = 32;
+  static constexpr unsigned cons_tag[1] = { 0x76ef1ea };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "SmartContractInfo";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct SmartContractInfo::Record {
+  typedef SmartContractInfo type_class;
+  int actions;  	// actions : uint16
+  int msgs_sent;  	// msgs_sent : uint16
+  unsigned unixtime;  	// unixtime : uint32
+  unsigned long long block_lt;  	// block_lt : uint64
+  unsigned long long trans_lt;  	// trans_lt : uint64
+  td::BitArray<256> rand_seed;  	// rand_seed : bits256
+  Ref<CellSlice> balance_remaining;  	// balance_remaining : CurrencyCollection
+  Ref<CellSlice> myself;  	// myself : MsgAddressInt
+  Record() = default;
+  Record(int _actions, int _msgs_sent, unsigned _unixtime, unsigned long long _block_lt, unsigned long long _trans_lt, const td::BitArray<256>& _rand_seed, Ref<CellSlice> _balance_remaining, Ref<CellSlice> _myself) : actions(_actions), msgs_sent(_msgs_sent), unixtime(_unixtime), block_lt(_block_lt), trans_lt(_trans_lt), rand_seed(_rand_seed), balance_remaining(std::move(_balance_remaining)), myself(std::move(_myself)) {}
+};
+
+extern const SmartContractInfo t_SmartContractInfo;
+
+//
+// headers for type `OutList`
+//
+
+struct OutList final : TLB_Complex {
+  enum { out_list, out_list_empty };
+  static constexpr int cons_len_exact = 0;
+  int m_;
+  OutList(int m) : m_(m) {}
+  struct Record_out_list_empty {
+    typedef OutList type_class;
+  };
+  struct Record_out_list;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_out_list_empty& data) const;
+  bool unpack_out_list_empty(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_out_list_empty& data) const;
+  bool cell_unpack_out_list_empty(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_out_list_empty& data) const;
+  bool pack_out_list_empty(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_out_list_empty& data) const;
+  bool cell_pack_out_list_empty(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_out_list& data) const;
+  bool unpack_out_list(vm::CellSlice& cs, int& n, Ref<Cell>& prev, Ref<CellSlice>& action) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_out_list& data) const;
+  bool cell_unpack_out_list(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& prev, Ref<CellSlice>& action) const;
+  bool pack(vm::CellBuilder& cb, const Record_out_list& data) const;
+  bool pack_out_list(vm::CellBuilder& cb, Ref<Cell> prev, Ref<CellSlice> action) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_out_list& data) const;
+  bool cell_pack_out_list(Ref<vm::Cell>& cell_ref, Ref<Cell> prev, Ref<CellSlice> action) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(OutList " << m_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override;
+};
+
+struct OutList::Record_out_list {
+  typedef OutList type_class;
+  int n;  	// n : #
+  Ref<Cell> prev;  	// prev : ^(OutList n)
+  Ref<CellSlice> action;  	// action : OutAction
+  Record_out_list() = default;
+  Record_out_list(Ref<Cell> _prev, Ref<CellSlice> _action) : n(-1), prev(std::move(_prev)), action(std::move(_action)) {}
+};
+
+//
+// headers for type `OutAction`
+//
+
+struct OutAction final : TLB_Complex {
+  enum { action_send_msg, action_reserve_currency, action_set_code };
+  static constexpr int cons_len_exact = 32;
+  static constexpr unsigned cons_tag[3] = { 0xec3c86d, 0x36e6b809, 0xad4de08eU };
+  struct Record_action_send_msg {
+    typedef OutAction type_class;
+    int mode;  	// mode : ## 8
+    Ref<Cell> out_msg;  	// out_msg : ^(MessageRelaxed Any)
+    Record_action_send_msg() = default;
+    Record_action_send_msg(int _mode, Ref<Cell> _out_msg) : mode(_mode), out_msg(std::move(_out_msg)) {}
+  };
+  struct Record_action_set_code {
+    typedef OutAction type_class;
+    Ref<Cell> new_code;  	// new_code : ^Cell
+    Record_action_set_code() = default;
+    Record_action_set_code(Ref<Cell> _new_code) : new_code(std::move(_new_code)) {}
+  };
+  struct Record_action_reserve_currency {
+    typedef OutAction type_class;
+    int mode;  	// mode : ## 8
+    Ref<CellSlice> currency;  	// currency : CurrencyCollection
+    Record_action_reserve_currency() = default;
+    Record_action_reserve_currency(int _mode, Ref<CellSlice> _currency) : mode(_mode), currency(std::move(_currency)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_action_send_msg& data) const;
+  bool unpack_action_send_msg(vm::CellSlice& cs, int& mode, Ref<Cell>& out_msg) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_action_send_msg& data) const;
+  bool cell_unpack_action_send_msg(Ref<vm::Cell> cell_ref, int& mode, Ref<Cell>& out_msg) const;
+  bool pack(vm::CellBuilder& cb, const Record_action_send_msg& data) const;
+  bool pack_action_send_msg(vm::CellBuilder& cb, int mode, Ref<Cell> out_msg) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_action_send_msg& data) const;
+  bool cell_pack_action_send_msg(Ref<vm::Cell>& cell_ref, int mode, Ref<Cell> out_msg) const;
+  bool unpack(vm::CellSlice& cs, Record_action_set_code& data) const;
+  bool unpack_action_set_code(vm::CellSlice& cs, Ref<Cell>& new_code) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_action_set_code& data) const;
+  bool cell_unpack_action_set_code(Ref<vm::Cell> cell_ref, Ref<Cell>& new_code) const;
+  bool pack(vm::CellBuilder& cb, const Record_action_set_code& data) const;
+  bool pack_action_set_code(vm::CellBuilder& cb, Ref<Cell> new_code) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_action_set_code& data) const;
+  bool cell_pack_action_set_code(Ref<vm::Cell>& cell_ref, Ref<Cell> new_code) const;
+  bool unpack(vm::CellSlice& cs, Record_action_reserve_currency& data) const;
+  bool unpack_action_reserve_currency(vm::CellSlice& cs, int& mode, Ref<CellSlice>& currency) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_action_reserve_currency& data) const;
+  bool cell_unpack_action_reserve_currency(Ref<vm::Cell> cell_ref, int& mode, Ref<CellSlice>& currency) const;
+  bool pack(vm::CellBuilder& cb, const Record_action_reserve_currency& data) const;
+  bool pack_action_reserve_currency(vm::CellBuilder& cb, int mode, Ref<CellSlice> currency) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_action_reserve_currency& data) const;
+  bool cell_pack_action_reserve_currency(Ref<vm::Cell>& cell_ref, int mode, Ref<CellSlice> currency) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "OutAction";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(3, 0x23);
+  }
+};
+
+extern const OutAction t_OutAction;
+
+//
+// headers for type `OutListNode`
+//
+
+struct OutListNode final : TLB_Complex {
+  enum { out_list_node };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef OutListNode type_class;
+    Ref<Cell> prev;  	// prev : ^Cell
+    Ref<CellSlice> action;  	// action : OutAction
+    Record() = default;
+    Record(Ref<Cell> _prev, Ref<CellSlice> _action) : prev(std::move(_prev)), action(std::move(_action)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_out_list_node(vm::CellSlice& cs, Ref<Cell>& prev, Ref<CellSlice>& action) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_out_list_node(Ref<vm::Cell> cell_ref, Ref<Cell>& prev, Ref<CellSlice>& action) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_out_list_node(vm::CellBuilder& cb, Ref<Cell> prev, Ref<CellSlice> action) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_out_list_node(Ref<vm::Cell>& cell_ref, Ref<Cell> prev, Ref<CellSlice> action) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "OutListNode";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const OutListNode t_OutListNode;
+
+//
+// headers for type `ShardIdent`
+//
+
+struct ShardIdent final : TLB_Complex {
+  enum { shard_ident };
+  static constexpr int cons_len_exact = 2;
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 104;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(104);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_shard_ident(vm::CellSlice& cs, int& shard_pfx_bits, int& workchain_id, unsigned long long& shard_prefix) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_shard_ident(Ref<vm::Cell> cell_ref, int& shard_pfx_bits, int& workchain_id, unsigned long long& shard_prefix) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_shard_ident(vm::CellBuilder& cb, int shard_pfx_bits, int workchain_id, unsigned long long shard_prefix) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_shard_ident(Ref<vm::Cell>& cell_ref, int shard_pfx_bits, int workchain_id, unsigned long long shard_prefix) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ShardIdent";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ShardIdent::Record {
+  typedef ShardIdent type_class;
+  int shard_pfx_bits;  	// shard_pfx_bits : #<= 60
+  int workchain_id;  	// workchain_id : int32
+  unsigned long long shard_prefix;  	// shard_prefix : uint64
+  Record() = default;
+  Record(int _shard_pfx_bits, int _workchain_id, unsigned long long _shard_prefix) : shard_pfx_bits(_shard_pfx_bits), workchain_id(_workchain_id), shard_prefix(_shard_prefix) {}
+};
+
+extern const ShardIdent t_ShardIdent;
+
+//
+// headers for type `ExtBlkRef`
+//
+
+struct ExtBlkRef final : TLB_Complex {
+  enum { ext_blk_ref };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 608;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(608);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(608);
+  }
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ExtBlkRef";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ExtBlkRef::Record {
+  typedef ExtBlkRef type_class;
+  unsigned long long end_lt;  	// end_lt : uint64
+  unsigned seq_no;  	// seq_no : uint32
+  td::BitArray<256> root_hash;  	// root_hash : bits256
+  td::BitArray<256> file_hash;  	// file_hash : bits256
+  Record() = default;
+  Record(unsigned long long _end_lt, unsigned _seq_no, const td::BitArray<256>& _root_hash, const td::BitArray<256>& _file_hash) : end_lt(_end_lt), seq_no(_seq_no), root_hash(_root_hash), file_hash(_file_hash) {}
+};
+
+extern const ExtBlkRef t_ExtBlkRef;
+
+//
+// headers for type `BlockIdExt`
+//
+
+struct BlockIdExt final : TLB_Complex {
+  enum { block_id_ext };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 648;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(648);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "BlockIdExt";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct BlockIdExt::Record {
+  typedef BlockIdExt type_class;
+  Ref<CellSlice> shard_id;  	// shard_id : ShardIdent
+  unsigned seq_no;  	// seq_no : uint32
+  td::BitArray<256> root_hash;  	// root_hash : bits256
+  td::BitArray<256> file_hash;  	// file_hash : bits256
+  Record() = default;
+  Record(Ref<CellSlice> _shard_id, unsigned _seq_no, const td::BitArray<256>& _root_hash, const td::BitArray<256>& _file_hash) : shard_id(std::move(_shard_id)), seq_no(_seq_no), root_hash(_root_hash), file_hash(_file_hash) {}
+};
+
+extern const BlockIdExt t_BlockIdExt;
+
+//
+// headers for type `BlkMasterInfo`
+//
+
+struct BlkMasterInfo final : TLB_Complex {
+  enum { master_info };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef BlkMasterInfo type_class;
+    Ref<CellSlice> master;  	// master : ExtBlkRef
+    Record() = default;
+    Record(Ref<CellSlice> _master) : master(std::move(_master)) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 608;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(608);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(608);
+  }
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_master_info(vm::CellSlice& cs, Ref<CellSlice>& master) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_master_info(Ref<vm::Cell> cell_ref, Ref<CellSlice>& master) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_master_info(vm::CellBuilder& cb, Ref<CellSlice> master) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_master_info(Ref<vm::Cell>& cell_ref, Ref<CellSlice> master) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "BlkMasterInfo";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const BlkMasterInfo t_BlkMasterInfo;
+
+//
+// headers for auxiliary type `ShardStateUnsplit_aux`
+//
+
+struct ShardStateUnsplit_aux final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ShardStateUnsplit_aux";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ShardStateUnsplit_aux::Record {
+  typedef ShardStateUnsplit_aux type_class;
+  unsigned long long overload_history;  	// overload_history : uint64
+  unsigned long long underload_history;  	// underload_history : uint64
+  Ref<CellSlice> total_balance;  	// total_balance : CurrencyCollection
+  Ref<CellSlice> total_validator_fees;  	// total_validator_fees : CurrencyCollection
+  Ref<CellSlice> libraries;  	// libraries : HashmapE 256 LibDescr
+  Ref<CellSlice> master_ref;  	// master_ref : Maybe BlkMasterInfo
+  Record() = default;
+  Record(unsigned long long _overload_history, unsigned long long _underload_history, Ref<CellSlice> _total_balance, Ref<CellSlice> _total_validator_fees, Ref<CellSlice> _libraries, Ref<CellSlice> _master_ref) : overload_history(_overload_history), underload_history(_underload_history), total_balance(std::move(_total_balance)), total_validator_fees(std::move(_total_validator_fees)), libraries(std::move(_libraries)), master_ref(std::move(_master_ref)) {}
+};
+
+extern const ShardStateUnsplit_aux t_ShardStateUnsplit_aux;
+
+//
+// headers for type `ShardStateUnsplit`
+//
+
+struct ShardStateUnsplit final : TLB_Complex {
+  enum { shard_state };
+  static constexpr int cons_len_exact = 32;
+  static constexpr unsigned cons_tag[1] = { 0x9023afe2U };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ShardStateUnsplit";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ShardStateUnsplit::Record {
+  typedef ShardStateUnsplit type_class;
+  int global_id;  	// global_id : int32
+  Ref<CellSlice> shard_id;  	// shard_id : ShardIdent
+  unsigned seq_no;  	// seq_no : uint32
+  int vert_seq_no;  	// vert_seq_no : #
+  unsigned gen_utime;  	// gen_utime : uint32
+  unsigned long long gen_lt;  	// gen_lt : uint64
+  unsigned min_ref_mc_seqno;  	// min_ref_mc_seqno : uint32
+  Ref<Cell> out_msg_queue_info;  	// out_msg_queue_info : ^OutMsgQueueInfo
+  bool before_split;  	// before_split : ## 1
+  Ref<Cell> accounts;  	// accounts : ^ShardAccounts
+  ShardStateUnsplit_aux::Record r1;  	// ^[$_ overload_history:uint64 underload_history:uint64 total_balance:CurrencyCollection total_validator_fees:CurrencyCollection libraries:(HashmapE 256 LibDescr) master_ref:(Maybe BlkMasterInfo) ]
+  Ref<CellSlice> custom;  	// custom : Maybe ^McStateExtra
+  Record() = default;
+  Record(int _global_id, Ref<CellSlice> _shard_id, unsigned _seq_no, int _vert_seq_no, unsigned _gen_utime, unsigned long long _gen_lt, unsigned _min_ref_mc_seqno, Ref<Cell> _out_msg_queue_info, bool _before_split, Ref<Cell> _accounts, const ShardStateUnsplit_aux::Record& _r1, Ref<CellSlice> _custom) : global_id(_global_id), shard_id(std::move(_shard_id)), seq_no(_seq_no), vert_seq_no(_vert_seq_no), gen_utime(_gen_utime), gen_lt(_gen_lt), min_ref_mc_seqno(_min_ref_mc_seqno), out_msg_queue_info(std::move(_out_msg_queue_info)), before_split(_before_split), accounts(std::move(_accounts)), r1(_r1), custom(std::move(_custom)) {}
+};
+
+extern const ShardStateUnsplit t_ShardStateUnsplit;
+
+//
+// headers for type `ShardState`
+//
+
+struct ShardState final : TLB_Complex {
+  enum { split_state, cons1 };
+  static constexpr char cons_len[2] = { 32, 0 };
+  static constexpr unsigned cons_tag[2] = { 0x5f327da5, 0 };
+  struct Record_cons1 {
+    typedef ShardState type_class;
+    Ref<CellSlice> x;  	// ShardStateUnsplit
+    Record_cons1() = default;
+    Record_cons1(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_split_state {
+    typedef ShardState type_class;
+    Ref<Cell> left;  	// left : ^ShardStateUnsplit
+    Ref<Cell> right;  	// right : ^ShardStateUnsplit
+    Record_split_state() = default;
+    Record_split_state(Ref<Cell> _left, Ref<Cell> _right) : left(std::move(_left)), right(std::move(_right)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_cons1& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons1& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons1& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons1& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_split_state& data) const;
+  bool unpack_split_state(vm::CellSlice& cs, Ref<Cell>& left, Ref<Cell>& right) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_split_state& data) const;
+  bool cell_unpack_split_state(Ref<vm::Cell> cell_ref, Ref<Cell>& left, Ref<Cell>& right) const;
+  bool pack(vm::CellBuilder& cb, const Record_split_state& data) const;
+  bool pack_split_state(vm::CellBuilder& cb, Ref<Cell> left, Ref<Cell> right) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_split_state& data) const;
+  bool cell_pack_split_state(Ref<vm::Cell>& cell_ref, Ref<Cell> left, Ref<Cell> right) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ShardState";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+extern const ShardState t_ShardState;
+
+//
+// headers for type `LibDescr`
+//
+
+struct LibDescr final : TLB_Complex {
+  enum { shared_lib_descr };
+  static constexpr int cons_len_exact = 2;
+  struct Record {
+    typedef LibDescr type_class;
+    Ref<Cell> lib;  	// lib : ^Cell
+    Ref<CellSlice> publishers;  	// publishers : Hashmap 256 True
+    Record() = default;
+    Record(Ref<Cell> _lib, Ref<CellSlice> _publishers) : lib(std::move(_lib)), publishers(std::move(_publishers)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_shared_lib_descr(vm::CellSlice& cs, Ref<Cell>& lib, Ref<CellSlice>& publishers) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_shared_lib_descr(Ref<vm::Cell> cell_ref, Ref<Cell>& lib, Ref<CellSlice>& publishers) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_shared_lib_descr(vm::CellBuilder& cb, Ref<Cell> lib, Ref<CellSlice> publishers) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_shared_lib_descr(Ref<vm::Cell>& cell_ref, Ref<Cell> lib, Ref<CellSlice> publishers) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "LibDescr";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const LibDescr t_LibDescr;
+
+//
+// headers for type `BlockInfo`
+//
+
+struct BlockInfo final : TLB_Complex {
+  enum { block_info };
+  static constexpr int cons_len_exact = 32;
+  static constexpr unsigned cons_tag[1] = { 0x9bc7a987U };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "BlockInfo";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct BlockInfo::Record {
+  typedef BlockInfo type_class;
+  unsigned version;  	// version : uint32
+  bool not_master;  	// not_master : ## 1
+  bool after_merge;  	// after_merge : ## 1
+  bool before_split;  	// before_split : ## 1
+  bool after_split;  	// after_split : ## 1
+  bool want_split;  	// want_split : Bool
+  bool want_merge;  	// want_merge : Bool
+  bool key_block;  	// key_block : Bool
+  bool vert_seqno_incr;  	// vert_seqno_incr : ## 1
+  int flags;  	// flags : ## 8
+  int seq_no;  	// seq_no : #
+  int vert_seq_no;  	// vert_seq_no : #
+  Ref<CellSlice> shard;  	// shard : ShardIdent
+  unsigned gen_utime;  	// gen_utime : uint32
+  unsigned long long start_lt;  	// start_lt : uint64
+  unsigned long long end_lt;  	// end_lt : uint64
+  unsigned gen_validator_list_hash_short;  	// gen_validator_list_hash_short : uint32
+  unsigned gen_catchain_seqno;  	// gen_catchain_seqno : uint32
+  unsigned min_ref_mc_seqno;  	// min_ref_mc_seqno : uint32
+  unsigned prev_key_block_seqno;  	// prev_key_block_seqno : uint32
+  Ref<Cell> master_ref;  	// master_ref : not_master?^BlkMasterInfo
+  Ref<Cell> prev_ref;  	// prev_ref : ^(BlkPrevInfo after_merge)
+  Ref<Cell> prev_vert_ref;  	// prev_vert_ref : vert_seq_no?^(BlkPrevInfo 0)
+  Record() = default;
+  Record(unsigned _version, bool _not_master, bool _after_merge, bool _before_split, bool _after_split, bool _want_split, bool _want_merge, bool _key_block, bool _vert_seqno_incr, int _flags, int _seq_no, int _vert_seq_no, Ref<CellSlice> _shard, unsigned _gen_utime, unsigned long long _start_lt, unsigned long long _end_lt, unsigned _gen_validator_list_hash_short, unsigned _gen_catchain_seqno, unsigned _min_ref_mc_seqno, unsigned _prev_key_block_seqno, Ref<Cell> _master_ref, Ref<Cell> _prev_ref, Ref<Cell> _prev_vert_ref) : version(_version), not_master(_not_master), after_merge(_after_merge), before_split(_before_split), after_split(_after_split), want_split(_want_split), want_merge(_want_merge), key_block(_key_block), vert_seqno_incr(_vert_seqno_incr), flags(_flags), seq_no(_seq_no), vert_seq_no(_vert_seq_no), shard(std::move(_shard)), gen_utime(_gen_utime), start_lt(_start_lt), end_lt(_end_lt), gen_validator_list_hash_short(_gen_validator_list_hash_short), gen_catchain_seqno(_gen_catchain_seqno), min_ref_mc_seqno(_min_ref_mc_seqno), prev_key_block_seqno(_prev_key_block_seqno), master_ref(std::move(_master_ref)), prev_ref(std::move(_prev_ref)), prev_vert_ref(std::move(_prev_vert_ref)) {}
+};
+
+extern const BlockInfo t_BlockInfo;
+
+//
+// headers for type `BlkPrevInfo`
+//
+
+struct BlkPrevInfo final : TLB_Complex {
+  enum { prev_blk_info, prev_blks_info };
+  static constexpr int cons_len_exact = 0;
+  int m_;
+  BlkPrevInfo(int m) : m_(m) {}
+  struct Record_prev_blk_info {
+    typedef BlkPrevInfo type_class;
+    Ref<CellSlice> prev;  	// prev : ExtBlkRef
+    Record_prev_blk_info() = default;
+    Record_prev_blk_info(Ref<CellSlice> _prev) : prev(std::move(_prev)) {}
+  };
+  struct Record_prev_blks_info {
+    typedef BlkPrevInfo type_class;
+    Ref<Cell> prev1;  	// prev1 : ^ExtBlkRef
+    Ref<Cell> prev2;  	// prev2 : ^ExtBlkRef
+    Record_prev_blks_info() = default;
+    Record_prev_blks_info(Ref<Cell> _prev1, Ref<Cell> _prev2) : prev1(std::move(_prev1)), prev2(std::move(_prev2)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_prev_blk_info& data) const;
+  bool unpack_prev_blk_info(vm::CellSlice& cs, Ref<CellSlice>& prev) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_prev_blk_info& data) const;
+  bool cell_unpack_prev_blk_info(Ref<vm::Cell> cell_ref, Ref<CellSlice>& prev) const;
+  bool pack(vm::CellBuilder& cb, const Record_prev_blk_info& data) const;
+  bool pack_prev_blk_info(vm::CellBuilder& cb, Ref<CellSlice> prev) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_prev_blk_info& data) const;
+  bool cell_pack_prev_blk_info(Ref<vm::Cell>& cell_ref, Ref<CellSlice> prev) const;
+  bool unpack(vm::CellSlice& cs, Record_prev_blks_info& data) const;
+  bool unpack_prev_blks_info(vm::CellSlice& cs, Ref<Cell>& prev1, Ref<Cell>& prev2) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_prev_blks_info& data) const;
+  bool cell_unpack_prev_blks_info(Ref<vm::Cell> cell_ref, Ref<Cell>& prev1, Ref<Cell>& prev2) const;
+  bool pack(vm::CellBuilder& cb, const Record_prev_blks_info& data) const;
+  bool pack_prev_blks_info(vm::CellBuilder& cb, Ref<Cell> prev1, Ref<Cell> prev2) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_prev_blks_info& data) const;
+  bool cell_pack_prev_blks_info(Ref<vm::Cell>& cell_ref, Ref<Cell> prev1, Ref<Cell> prev2) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(BlkPrevInfo " << m_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override;
+};
+
+//
+// headers for type `Block`
+//
+
+struct Block final : TLB_Complex {
+  enum { block };
+  static constexpr int cons_len_exact = 32;
+  static constexpr unsigned cons_tag[1] = { 0x11ef55aa };
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0x40040;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance_ext(0x40040);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Block";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct Block::Record {
+  typedef Block type_class;
+  int global_id;  	// global_id : int32
+  Ref<Cell> info;  	// info : ^BlockInfo
+  Ref<Cell> value_flow;  	// value_flow : ^ValueFlow
+  Ref<Cell> state_update;  	// state_update : ^(MERKLE_UPDATE ShardState)
+  Ref<Cell> extra;  	// extra : ^BlockExtra
+  Record() = default;
+  Record(int _global_id, Ref<Cell> _info, Ref<Cell> _value_flow, Ref<Cell> _state_update, Ref<Cell> _extra) : global_id(_global_id), info(std::move(_info)), value_flow(std::move(_value_flow)), state_update(std::move(_state_update)), extra(std::move(_extra)) {}
+};
+
+extern const Block t_Block;
+
+//
+// headers for type `BlockExtra`
+//
+
+struct BlockExtra final : TLB_Complex {
+  enum { block_extra };
+  static constexpr int cons_len_exact = 32;
+  static constexpr unsigned cons_tag[1] = { 0x4a33f6fd };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "BlockExtra";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct BlockExtra::Record {
+  typedef BlockExtra type_class;
+  Ref<Cell> in_msg_descr;  	// in_msg_descr : ^InMsgDescr
+  Ref<Cell> out_msg_descr;  	// out_msg_descr : ^OutMsgDescr
+  Ref<Cell> account_blocks;  	// account_blocks : ^ShardAccountBlocks
+  td::BitArray<256> rand_seed;  	// rand_seed : bits256
+  td::BitArray<256> created_by;  	// created_by : bits256
+  Ref<CellSlice> custom;  	// custom : Maybe ^McBlockExtra
+  Record() = default;
+  Record(Ref<Cell> _in_msg_descr, Ref<Cell> _out_msg_descr, Ref<Cell> _account_blocks, const td::BitArray<256>& _rand_seed, const td::BitArray<256>& _created_by, Ref<CellSlice> _custom) : in_msg_descr(std::move(_in_msg_descr)), out_msg_descr(std::move(_out_msg_descr)), account_blocks(std::move(_account_blocks)), rand_seed(_rand_seed), created_by(_created_by), custom(std::move(_custom)) {}
+};
+
+extern const BlockExtra t_BlockExtra;
+
+//
+// headers for auxiliary type `ValueFlow_aux`
+//
+
+struct ValueFlow_aux final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ValueFlow_aux";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ValueFlow_aux::Record {
+  typedef ValueFlow_aux type_class;
+  Ref<CellSlice> from_prev_blk;  	// from_prev_blk : CurrencyCollection
+  Ref<CellSlice> to_next_blk;  	// to_next_blk : CurrencyCollection
+  Ref<CellSlice> imported;  	// imported : CurrencyCollection
+  Ref<CellSlice> exported;  	// exported : CurrencyCollection
+  Record() = default;
+  Record(Ref<CellSlice> _from_prev_blk, Ref<CellSlice> _to_next_blk, Ref<CellSlice> _imported, Ref<CellSlice> _exported) : from_prev_blk(std::move(_from_prev_blk)), to_next_blk(std::move(_to_next_blk)), imported(std::move(_imported)), exported(std::move(_exported)) {}
+};
+
+extern const ValueFlow_aux t_ValueFlow_aux;
+
+//
+// headers for auxiliary type `ValueFlow_aux1`
+//
+
+struct ValueFlow_aux1 final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ValueFlow_aux1";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ValueFlow_aux1::Record {
+  typedef ValueFlow_aux1 type_class;
+  Ref<CellSlice> fees_imported;  	// fees_imported : CurrencyCollection
+  Ref<CellSlice> recovered;  	// recovered : CurrencyCollection
+  Ref<CellSlice> created;  	// created : CurrencyCollection
+  Ref<CellSlice> minted;  	// minted : CurrencyCollection
+  Record() = default;
+  Record(Ref<CellSlice> _fees_imported, Ref<CellSlice> _recovered, Ref<CellSlice> _created, Ref<CellSlice> _minted) : fees_imported(std::move(_fees_imported)), recovered(std::move(_recovered)), created(std::move(_created)), minted(std::move(_minted)) {}
+};
+
+extern const ValueFlow_aux1 t_ValueFlow_aux1;
+
+//
+// headers for type `ValueFlow`
+//
+
+struct ValueFlow final : TLB_Complex {
+  enum { value_flow };
+  static constexpr int cons_len_exact = 32;
+  static constexpr unsigned cons_tag[1] = { 0xb8e48dfbU };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ValueFlow";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ValueFlow::Record {
+  typedef ValueFlow type_class;
+  ValueFlow_aux::Record r1;  	// ^[$_ from_prev_blk:CurrencyCollection to_next_blk:CurrencyCollection imported:CurrencyCollection exported:CurrencyCollection ]
+  Ref<CellSlice> fees_collected;  	// fees_collected : CurrencyCollection
+  ValueFlow_aux1::Record r2;  	// ^[$_ fees_imported:CurrencyCollection recovered:CurrencyCollection created:CurrencyCollection minted:CurrencyCollection ]
+  Record() = default;
+  Record(const ValueFlow_aux::Record& _r1, Ref<CellSlice> _fees_collected, const ValueFlow_aux1::Record& _r2) : r1(_r1), fees_collected(std::move(_fees_collected)), r2(_r2) {}
+};
+
+extern const ValueFlow t_ValueFlow;
+
+//
+// headers for type `BinTree`
+//
+
+struct BinTree final : TLB_Complex {
+  enum { bt_leaf, bt_fork };
+  static constexpr int cons_len_exact = 1;
+  const TLB &X_;
+  BinTree(const TLB& X) : X_(X) {}
+  struct Record_bt_leaf {
+    typedef BinTree type_class;
+    Ref<CellSlice> leaf;  	// leaf : X
+    Record_bt_leaf() = default;
+    Record_bt_leaf(Ref<CellSlice> _leaf) : leaf(std::move(_leaf)) {}
+  };
+  struct Record_bt_fork {
+    typedef BinTree type_class;
+    Ref<Cell> left;  	// left : ^(BinTree X)
+    Ref<Cell> right;  	// right : ^(BinTree X)
+    Record_bt_fork() = default;
+    Record_bt_fork(Ref<Cell> _left, Ref<Cell> _right) : left(std::move(_left)), right(std::move(_right)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_bt_leaf& data) const;
+  bool unpack_bt_leaf(vm::CellSlice& cs, Ref<CellSlice>& leaf) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_bt_leaf& data) const;
+  bool cell_unpack_bt_leaf(Ref<vm::Cell> cell_ref, Ref<CellSlice>& leaf) const;
+  bool pack(vm::CellBuilder& cb, const Record_bt_leaf& data) const;
+  bool pack_bt_leaf(vm::CellBuilder& cb, Ref<CellSlice> leaf) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_bt_leaf& data) const;
+  bool cell_pack_bt_leaf(Ref<vm::Cell>& cell_ref, Ref<CellSlice> leaf) const;
+  bool unpack(vm::CellSlice& cs, Record_bt_fork& data) const;
+  bool unpack_bt_fork(vm::CellSlice& cs, Ref<Cell>& left, Ref<Cell>& right) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_bt_fork& data) const;
+  bool cell_unpack_bt_fork(Ref<vm::Cell> cell_ref, Ref<Cell>& left, Ref<Cell>& right) const;
+  bool pack(vm::CellBuilder& cb, const Record_bt_fork& data) const;
+  bool pack_bt_fork(vm::CellBuilder& cb, Ref<Cell> left, Ref<Cell> right) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_bt_fork& data) const;
+  bool cell_pack_bt_fork(Ref<vm::Cell>& cell_ref, Ref<Cell> left, Ref<Cell> right) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(BinTree " << X_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+//
+// headers for type `FutureSplitMerge`
+//
+
+struct FutureSplitMerge final : TLB_Complex {
+  enum { fsm_none, fsm_split, fsm_merge };
+  static constexpr char cons_len[3] = { 1, 2, 2 };
+  static constexpr unsigned char cons_tag[3] = { 0, 2, 3 };
+  struct Record_fsm_none {
+    typedef FutureSplitMerge type_class;
+  };
+  struct Record_fsm_split {
+    typedef FutureSplitMerge type_class;
+    unsigned split_utime;  	// split_utime : uint32
+    unsigned interval;  	// interval : uint32
+    Record_fsm_split() = default;
+    Record_fsm_split(unsigned _split_utime, unsigned _interval) : split_utime(_split_utime), interval(_interval) {}
+  };
+  struct Record_fsm_merge {
+    typedef FutureSplitMerge type_class;
+    unsigned merge_utime;  	// merge_utime : uint32
+    unsigned interval;  	// interval : uint32
+    Record_fsm_merge() = default;
+    Record_fsm_merge(unsigned _merge_utime, unsigned _interval) : merge_utime(_merge_utime), interval(_interval) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_fsm_none& data) const;
+  bool unpack_fsm_none(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_fsm_none& data) const;
+  bool cell_unpack_fsm_none(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_fsm_none& data) const;
+  bool pack_fsm_none(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_fsm_none& data) const;
+  bool cell_pack_fsm_none(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_fsm_split& data) const;
+  bool unpack_fsm_split(vm::CellSlice& cs, unsigned& split_utime, unsigned& interval) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_fsm_split& data) const;
+  bool cell_unpack_fsm_split(Ref<vm::Cell> cell_ref, unsigned& split_utime, unsigned& interval) const;
+  bool pack(vm::CellBuilder& cb, const Record_fsm_split& data) const;
+  bool pack_fsm_split(vm::CellBuilder& cb, unsigned split_utime, unsigned interval) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_fsm_split& data) const;
+  bool cell_pack_fsm_split(Ref<vm::Cell>& cell_ref, unsigned split_utime, unsigned interval) const;
+  bool unpack(vm::CellSlice& cs, Record_fsm_merge& data) const;
+  bool unpack_fsm_merge(vm::CellSlice& cs, unsigned& merge_utime, unsigned& interval) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_fsm_merge& data) const;
+  bool cell_unpack_fsm_merge(Ref<vm::Cell> cell_ref, unsigned& merge_utime, unsigned& interval) const;
+  bool pack(vm::CellBuilder& cb, const Record_fsm_merge& data) const;
+  bool pack_fsm_merge(vm::CellBuilder& cb, unsigned merge_utime, unsigned interval) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_fsm_merge& data) const;
+  bool cell_pack_fsm_merge(Ref<vm::Cell>& cell_ref, unsigned merge_utime, unsigned interval) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "FutureSplitMerge";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect_ext(2, 13);
+  }
+};
+
+extern const FutureSplitMerge t_FutureSplitMerge;
+
+//
+// headers for type `ShardDescr`
+//
+
+struct ShardDescr final : TLB_Complex {
+  enum { shard_descr };
+  static constexpr int cons_len_exact = 4;
+  static constexpr unsigned char cons_tag[1] = { 11 };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ShardDescr";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ShardDescr::Record {
+  typedef ShardDescr type_class;
+  unsigned seq_no;  	// seq_no : uint32
+  unsigned reg_mc_seqno;  	// reg_mc_seqno : uint32
+  unsigned long long start_lt;  	// start_lt : uint64
+  unsigned long long end_lt;  	// end_lt : uint64
+  td::BitArray<256> root_hash;  	// root_hash : bits256
+  td::BitArray<256> file_hash;  	// file_hash : bits256
+  bool before_split;  	// before_split : Bool
+  bool before_merge;  	// before_merge : Bool
+  bool want_split;  	// want_split : Bool
+  bool want_merge;  	// want_merge : Bool
+  bool nx_cc_updated;  	// nx_cc_updated : Bool
+  int flags;  	// flags : ## 3
+  unsigned next_catchain_seqno;  	// next_catchain_seqno : uint32
+  unsigned long long next_validator_shard;  	// next_validator_shard : uint64
+  unsigned min_ref_mc_seqno;  	// min_ref_mc_seqno : uint32
+  unsigned gen_utime;  	// gen_utime : uint32
+  Ref<CellSlice> split_merge_at;  	// split_merge_at : FutureSplitMerge
+  Ref<CellSlice> fees_collected;  	// fees_collected : CurrencyCollection
+  Ref<CellSlice> funds_created;  	// funds_created : CurrencyCollection
+  Record() = default;
+  Record(unsigned _seq_no, unsigned _reg_mc_seqno, unsigned long long _start_lt, unsigned long long _end_lt, const td::BitArray<256>& _root_hash, const td::BitArray<256>& _file_hash, bool _before_split, bool _before_merge, bool _want_split, bool _want_merge, bool _nx_cc_updated, int _flags, unsigned _next_catchain_seqno, unsigned long long _next_validator_shard, unsigned _min_ref_mc_seqno, unsigned _gen_utime, Ref<CellSlice> _split_merge_at, Ref<CellSlice> _fees_collected, Ref<CellSlice> _funds_created) : seq_no(_seq_no), reg_mc_seqno(_reg_mc_seqno), start_lt(_start_lt), end_lt(_end_lt), root_hash(_root_hash), file_hash(_file_hash), before_split(_before_split), before_merge(_before_merge), want_split(_want_split), want_merge(_want_merge), nx_cc_updated(_nx_cc_updated), flags(_flags), next_catchain_seqno(_next_catchain_seqno), next_validator_shard(_next_validator_shard), min_ref_mc_seqno(_min_ref_mc_seqno), gen_utime(_gen_utime), split_merge_at(std::move(_split_merge_at)), fees_collected(std::move(_fees_collected)), funds_created(std::move(_funds_created)) {}
+};
+
+extern const ShardDescr t_ShardDescr;
+
+//
+// headers for type `ShardHashes`
+//
+
+struct ShardHashes final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef ShardHashes type_class;
+    Ref<CellSlice> x;  	// HashmapE 32 ^(BinTree ShardDescr)
+    Record() = default;
+    Record(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ShardHashes";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const ShardHashes t_ShardHashes;
+
+//
+// headers for type `BinTreeAug`
+//
+
+struct BinTreeAug final : TLB_Complex {
+  enum { bta_leaf, bta_fork };
+  static constexpr int cons_len_exact = 1;
+  const TLB &X_, &Y_;
+  BinTreeAug(const TLB& X, const TLB& Y) : X_(X), Y_(Y) {}
+  struct Record_bta_leaf {
+    typedef BinTreeAug type_class;
+    Ref<CellSlice> extra;  	// extra : Y
+    Ref<CellSlice> leaf;  	// leaf : X
+    Record_bta_leaf() = default;
+    Record_bta_leaf(Ref<CellSlice> _extra, Ref<CellSlice> _leaf) : extra(std::move(_extra)), leaf(std::move(_leaf)) {}
+  };
+  struct Record_bta_fork;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_bta_leaf& data) const;
+  bool unpack_bta_leaf(vm::CellSlice& cs, Ref<CellSlice>& extra, Ref<CellSlice>& leaf) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_bta_leaf& data) const;
+  bool cell_unpack_bta_leaf(Ref<vm::Cell> cell_ref, Ref<CellSlice>& extra, Ref<CellSlice>& leaf) const;
+  bool pack(vm::CellBuilder& cb, const Record_bta_leaf& data) const;
+  bool pack_bta_leaf(vm::CellBuilder& cb, Ref<CellSlice> extra, Ref<CellSlice> leaf) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_bta_leaf& data) const;
+  bool cell_pack_bta_leaf(Ref<vm::Cell>& cell_ref, Ref<CellSlice> extra, Ref<CellSlice> leaf) const;
+  bool unpack(vm::CellSlice& cs, Record_bta_fork& data) const;
+  bool unpack_bta_fork(vm::CellSlice& cs, Ref<Cell>& left, Ref<Cell>& right, Ref<CellSlice>& extra) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_bta_fork& data) const;
+  bool cell_unpack_bta_fork(Ref<vm::Cell> cell_ref, Ref<Cell>& left, Ref<Cell>& right, Ref<CellSlice>& extra) const;
+  bool pack(vm::CellBuilder& cb, const Record_bta_fork& data) const;
+  bool pack_bta_fork(vm::CellBuilder& cb, Ref<Cell> left, Ref<Cell> right, Ref<CellSlice> extra) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_bta_fork& data) const;
+  bool cell_pack_bta_fork(Ref<vm::Cell>& cell_ref, Ref<Cell> left, Ref<Cell> right, Ref<CellSlice> extra) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(BinTreeAug " << X_ << " " << Y_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+struct BinTreeAug::Record_bta_fork {
+  typedef BinTreeAug type_class;
+  Ref<Cell> left;  	// left : ^(BinTreeAug X Y)
+  Ref<Cell> right;  	// right : ^(BinTreeAug X Y)
+  Ref<CellSlice> extra;  	// extra : Y
+  Record_bta_fork() = default;
+  Record_bta_fork(Ref<Cell> _left, Ref<Cell> _right, Ref<CellSlice> _extra) : left(std::move(_left)), right(std::move(_right)), extra(std::move(_extra)) {}
+};
+
+//
+// headers for type `ShardFeeCreated`
+//
+
+struct ShardFeeCreated final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef ShardFeeCreated type_class;
+    Ref<CellSlice> fees;  	// fees : CurrencyCollection
+    Ref<CellSlice> create;  	// create : CurrencyCollection
+    Record() = default;
+    Record(Ref<CellSlice> _fees, Ref<CellSlice> _create) : fees(std::move(_fees)), create(std::move(_create)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& fees, Ref<CellSlice>& create) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& fees, Ref<CellSlice>& create) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> fees, Ref<CellSlice> create) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> fees, Ref<CellSlice> create) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ShardFeeCreated";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const ShardFeeCreated t_ShardFeeCreated;
+
+//
+// headers for type `ShardFees`
+//
+
+struct ShardFees final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef ShardFees type_class;
+    Ref<CellSlice> x;  	// HashmapAugE 96 ShardFeeCreated ShardFeeCreated
+    Record() = default;
+    Record(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ShardFees";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const ShardFees t_ShardFees;
+
+//
+// headers for type `ConfigParams`
+//
+
+struct ConfigParams final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef ConfigParams type_class;
+    td::BitArray<256> config_addr;  	// config_addr : bits256
+    Ref<Cell> config;  	// config : ^(Hashmap 32 ^Cell)
+    Record() = default;
+    Record(const td::BitArray<256>& _config_addr, Ref<Cell> _config) : config_addr(_config_addr), config(std::move(_config)) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0x10100;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance_ext(0x10100);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, td::BitArray<256>& config_addr, Ref<Cell>& config) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, td::BitArray<256>& config_addr, Ref<Cell>& config) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, td::BitArray<256> config_addr, Ref<Cell> config) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, td::BitArray<256> config_addr, Ref<Cell> config) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ConfigParams";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const ConfigParams t_ConfigParams;
+
+//
+// headers for type `ValidatorInfo`
+//
+
+struct ValidatorInfo final : TLB_Complex {
+  enum { validator_info };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 65;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(65);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(65);
+  }
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_validator_info(vm::CellSlice& cs, unsigned& validator_list_hash_short, unsigned& catchain_seqno, bool& nx_cc_updated) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_validator_info(Ref<vm::Cell> cell_ref, unsigned& validator_list_hash_short, unsigned& catchain_seqno, bool& nx_cc_updated) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_validator_info(vm::CellBuilder& cb, unsigned validator_list_hash_short, unsigned catchain_seqno, bool nx_cc_updated) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_validator_info(Ref<vm::Cell>& cell_ref, unsigned validator_list_hash_short, unsigned catchain_seqno, bool nx_cc_updated) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ValidatorInfo";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ValidatorInfo::Record {
+  typedef ValidatorInfo type_class;
+  unsigned validator_list_hash_short;  	// validator_list_hash_short : uint32
+  unsigned catchain_seqno;  	// catchain_seqno : uint32
+  bool nx_cc_updated;  	// nx_cc_updated : Bool
+  Record() = default;
+  Record(unsigned _validator_list_hash_short, unsigned _catchain_seqno, bool _nx_cc_updated) : validator_list_hash_short(_validator_list_hash_short), catchain_seqno(_catchain_seqno), nx_cc_updated(_nx_cc_updated) {}
+};
+
+extern const ValidatorInfo t_ValidatorInfo;
+
+//
+// headers for type `ValidatorBaseInfo`
+//
+
+struct ValidatorBaseInfo final : TLB_Complex {
+  enum { validator_base_info };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef ValidatorBaseInfo type_class;
+    unsigned validator_list_hash_short;  	// validator_list_hash_short : uint32
+    unsigned catchain_seqno;  	// catchain_seqno : uint32
+    Record() = default;
+    Record(unsigned _validator_list_hash_short, unsigned _catchain_seqno) : validator_list_hash_short(_validator_list_hash_short), catchain_seqno(_catchain_seqno) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 64;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(64);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(64);
+  }
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_validator_base_info(vm::CellSlice& cs, unsigned& validator_list_hash_short, unsigned& catchain_seqno) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_validator_base_info(Ref<vm::Cell> cell_ref, unsigned& validator_list_hash_short, unsigned& catchain_seqno) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_validator_base_info(vm::CellBuilder& cb, unsigned validator_list_hash_short, unsigned catchain_seqno) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_validator_base_info(Ref<vm::Cell>& cell_ref, unsigned validator_list_hash_short, unsigned catchain_seqno) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ValidatorBaseInfo";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const ValidatorBaseInfo t_ValidatorBaseInfo;
+
+//
+// headers for type `KeyMaxLt`
+//
+
+struct KeyMaxLt final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef KeyMaxLt type_class;
+    bool key;  	// key : Bool
+    unsigned long long max_end_lt;  	// max_end_lt : uint64
+    Record() = default;
+    Record(bool _key, unsigned long long _max_end_lt) : key(_key), max_end_lt(_max_end_lt) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 65;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(65);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(65);
+  }
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, bool& key, unsigned long long& max_end_lt) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, bool& key, unsigned long long& max_end_lt) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, bool key, unsigned long long max_end_lt) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, bool key, unsigned long long max_end_lt) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "KeyMaxLt";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const KeyMaxLt t_KeyMaxLt;
+
+//
+// headers for type `KeyExtBlkRef`
+//
+
+struct KeyExtBlkRef final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef KeyExtBlkRef type_class;
+    bool key;  	// key : Bool
+    Ref<CellSlice> blk_ref;  	// blk_ref : ExtBlkRef
+    Record() = default;
+    Record(bool _key, Ref<CellSlice> _blk_ref) : key(_key), blk_ref(std::move(_blk_ref)) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 609;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(609);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(609);
+  }
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, bool& key, Ref<CellSlice>& blk_ref) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, bool& key, Ref<CellSlice>& blk_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, bool key, Ref<CellSlice> blk_ref) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, bool key, Ref<CellSlice> blk_ref) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "KeyExtBlkRef";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const KeyExtBlkRef t_KeyExtBlkRef;
+
+//
+// headers for type `OldMcBlocksInfo`
+//
+
+struct OldMcBlocksInfo final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef OldMcBlocksInfo type_class;
+    Ref<CellSlice> x;  	// HashmapAugE 32 KeyExtBlkRef KeyMaxLt
+    Record() = default;
+    Record(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "OldMcBlocksInfo";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const OldMcBlocksInfo t_OldMcBlocksInfo;
+
+//
+// headers for type `Counters`
+//
+
+struct Counters final : TLB_Complex {
+  enum { counters };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 224;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(224);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(224);
+  }
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Counters";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct Counters::Record {
+  typedef Counters type_class;
+  unsigned last_updated;  	// last_updated : uint32
+  unsigned long long total;  	// total : uint64
+  unsigned long long cnt2048;  	// cnt2048 : uint64
+  unsigned long long cnt65536;  	// cnt65536 : uint64
+  Record() = default;
+  Record(unsigned _last_updated, unsigned long long _total, unsigned long long _cnt2048, unsigned long long _cnt65536) : last_updated(_last_updated), total(_total), cnt2048(_cnt2048), cnt65536(_cnt65536) {}
+};
+
+extern const Counters t_Counters;
+
+//
+// headers for type `CreatorStats`
+//
+
+struct CreatorStats final : TLB_Complex {
+  enum { creator_info };
+  static constexpr int cons_len_exact = 4;
+  static constexpr unsigned char cons_tag[1] = { 4 };
+  struct Record {
+    typedef CreatorStats type_class;
+    Ref<CellSlice> mc_blocks;  	// mc_blocks : Counters
+    Ref<CellSlice> shard_blocks;  	// shard_blocks : Counters
+    Record() = default;
+    Record(Ref<CellSlice> _mc_blocks, Ref<CellSlice> _shard_blocks) : mc_blocks(std::move(_mc_blocks)), shard_blocks(std::move(_shard_blocks)) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 452;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(452);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_creator_info(vm::CellSlice& cs, Ref<CellSlice>& mc_blocks, Ref<CellSlice>& shard_blocks) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_creator_info(Ref<vm::Cell> cell_ref, Ref<CellSlice>& mc_blocks, Ref<CellSlice>& shard_blocks) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_creator_info(vm::CellBuilder& cb, Ref<CellSlice> mc_blocks, Ref<CellSlice> shard_blocks) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_creator_info(Ref<vm::Cell>& cell_ref, Ref<CellSlice> mc_blocks, Ref<CellSlice> shard_blocks) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "CreatorStats";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const CreatorStats t_CreatorStats;
+
+//
+// headers for type `BlockCreateStats`
+//
+
+struct BlockCreateStats final : TLB_Complex {
+  enum { block_create_stats };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 23 };
+  struct Record {
+    typedef BlockCreateStats type_class;
+    Ref<CellSlice> counters;  	// counters : HashmapE 256 CreatorStats
+    Record() = default;
+    Record(Ref<CellSlice> _counters) : counters(std::move(_counters)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_block_create_stats(vm::CellSlice& cs, Ref<CellSlice>& counters) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_block_create_stats(Ref<vm::Cell> cell_ref, Ref<CellSlice>& counters) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_block_create_stats(vm::CellBuilder& cb, Ref<CellSlice> counters) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_block_create_stats(Ref<vm::Cell>& cell_ref, Ref<CellSlice> counters) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "BlockCreateStats";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const BlockCreateStats t_BlockCreateStats;
+
+//
+// headers for auxiliary type `McStateExtra_aux`
+//
+
+struct McStateExtra_aux final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "McStateExtra_aux";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct McStateExtra_aux::Record {
+  typedef McStateExtra_aux type_class;
+  int flags;  	// flags : ## 16
+  Ref<CellSlice> validator_info;  	// validator_info : ValidatorInfo
+  Ref<CellSlice> prev_blocks;  	// prev_blocks : OldMcBlocksInfo
+  bool after_key_block;  	// after_key_block : Bool
+  Ref<CellSlice> last_key_block;  	// last_key_block : Maybe ExtBlkRef
+  Ref<CellSlice> block_create_stats;  	// block_create_stats : flags.0?BlockCreateStats
+  Record() = default;
+  Record(int _flags, Ref<CellSlice> _validator_info, Ref<CellSlice> _prev_blocks, bool _after_key_block, Ref<CellSlice> _last_key_block, Ref<CellSlice> _block_create_stats) : flags(_flags), validator_info(std::move(_validator_info)), prev_blocks(std::move(_prev_blocks)), after_key_block(_after_key_block), last_key_block(std::move(_last_key_block)), block_create_stats(std::move(_block_create_stats)) {}
+};
+
+extern const McStateExtra_aux t_McStateExtra_aux;
+
+//
+// headers for type `McStateExtra`
+//
+
+struct McStateExtra final : TLB_Complex {
+  enum { masterchain_state_extra };
+  static constexpr int cons_len_exact = 16;
+  static constexpr unsigned short cons_tag[1] = { 0xcc26 };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "McStateExtra";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct McStateExtra::Record {
+  typedef McStateExtra type_class;
+  Ref<CellSlice> shard_hashes;  	// shard_hashes : ShardHashes
+  Ref<CellSlice> config;  	// config : ConfigParams
+  McStateExtra_aux::Record r1;  	// ^[$_ flags:(## 16) {<= flags 1} validator_info:ValidatorInfo prev_blocks:OldMcBlocksInfo after_key_block:Bool last_key_block:(Maybe ExtBlkRef) block_create_stats:flags.0?BlockCreateStats ]
+  Ref<CellSlice> global_balance;  	// global_balance : CurrencyCollection
+  Record() = default;
+  Record(Ref<CellSlice> _shard_hashes, Ref<CellSlice> _config, const McStateExtra_aux::Record& _r1, Ref<CellSlice> _global_balance) : shard_hashes(std::move(_shard_hashes)), config(std::move(_config)), r1(_r1), global_balance(std::move(_global_balance)) {}
+};
+
+extern const McStateExtra t_McStateExtra;
+
+//
+// headers for type `SigPubKey`
+//
+
+struct SigPubKey final : TLB_Complex {
+  enum { ed25519_pubkey };
+  static constexpr int cons_len_exact = 32;
+  static constexpr unsigned cons_tag[1] = { 0x8e81278aU };
+  struct Record {
+    typedef SigPubKey type_class;
+    td::BitArray<256> pubkey;  	// pubkey : bits256
+    Record() = default;
+    Record(const td::BitArray<256>& _pubkey) : pubkey(_pubkey) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 288;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(288);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_ed25519_pubkey(vm::CellSlice& cs, td::BitArray<256>& pubkey) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_ed25519_pubkey(Ref<vm::Cell> cell_ref, td::BitArray<256>& pubkey) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_ed25519_pubkey(vm::CellBuilder& cb, td::BitArray<256> pubkey) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_ed25519_pubkey(Ref<vm::Cell>& cell_ref, td::BitArray<256> pubkey) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "SigPubKey";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const SigPubKey t_SigPubKey;
+
+//
+// headers for type `CryptoSignatureSimple`
+//
+
+struct CryptoSignatureSimple final : TLB_Complex {
+  enum { ed25519_signature };
+  static constexpr int cons_len_exact = 4;
+  static constexpr unsigned char cons_tag[1] = { 5 };
+  struct Record {
+    typedef CryptoSignatureSimple type_class;
+    td::BitArray<256> R;  	// R : bits256
+    td::BitArray<256> s;  	// s : bits256
+    Record() = default;
+    Record(const td::BitArray<256>& _R, const td::BitArray<256>& _s) : R(_R), s(_s) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 516;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(516);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_ed25519_signature(vm::CellSlice& cs, td::BitArray<256>& R, td::BitArray<256>& s) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_ed25519_signature(Ref<vm::Cell> cell_ref, td::BitArray<256>& R, td::BitArray<256>& s) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_ed25519_signature(vm::CellBuilder& cb, td::BitArray<256> R, td::BitArray<256> s) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_ed25519_signature(Ref<vm::Cell>& cell_ref, td::BitArray<256> R, td::BitArray<256> s) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "CryptoSignatureSimple";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const CryptoSignatureSimple t_CryptoSignatureSimple;
+
+//
+// headers for type `CryptoSignaturePair`
+//
+
+struct CryptoSignaturePair final : TLB_Complex {
+  enum { sig_pair };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef CryptoSignaturePair type_class;
+    td::BitArray<256> node_id_short;  	// node_id_short : bits256
+    Ref<CellSlice> sign;  	// sign : CryptoSignature
+    Record() = default;
+    Record(const td::BitArray<256>& _node_id_short, Ref<CellSlice> _sign) : node_id_short(_node_id_short), sign(std::move(_sign)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_sig_pair(vm::CellSlice& cs, td::BitArray<256>& node_id_short, Ref<CellSlice>& sign) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_sig_pair(Ref<vm::Cell> cell_ref, td::BitArray<256>& node_id_short, Ref<CellSlice>& sign) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_sig_pair(vm::CellBuilder& cb, td::BitArray<256> node_id_short, Ref<CellSlice> sign) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_sig_pair(Ref<vm::Cell>& cell_ref, td::BitArray<256> node_id_short, Ref<CellSlice> sign) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "CryptoSignaturePair";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const CryptoSignaturePair t_CryptoSignaturePair;
+
+//
+// headers for type `Certificate`
+//
+
+struct Certificate final : TLB_Complex {
+  enum { certificate };
+  static constexpr int cons_len_exact = 4;
+  static constexpr unsigned char cons_tag[1] = { 4 };
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 356;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(356);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_certificate(vm::CellSlice& cs, Ref<CellSlice>& temp_key, unsigned& valid_since, unsigned& valid_until) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_certificate(Ref<vm::Cell> cell_ref, Ref<CellSlice>& temp_key, unsigned& valid_since, unsigned& valid_until) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_certificate(vm::CellBuilder& cb, Ref<CellSlice> temp_key, unsigned valid_since, unsigned valid_until) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_certificate(Ref<vm::Cell>& cell_ref, Ref<CellSlice> temp_key, unsigned valid_since, unsigned valid_until) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Certificate";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct Certificate::Record {
+  typedef Certificate type_class;
+  Ref<CellSlice> temp_key;  	// temp_key : SigPubKey
+  unsigned valid_since;  	// valid_since : uint32
+  unsigned valid_until;  	// valid_until : uint32
+  Record() = default;
+  Record(Ref<CellSlice> _temp_key, unsigned _valid_since, unsigned _valid_until) : temp_key(std::move(_temp_key)), valid_since(_valid_since), valid_until(_valid_until) {}
+};
+
+extern const Certificate t_Certificate;
+
+//
+// headers for type `CertificateEnv`
+//
+
+struct CertificateEnv final : TLB_Complex {
+  enum { certificate_env };
+  static constexpr int cons_len_exact = 28;
+  static constexpr unsigned cons_tag[1] = { 0xa419b7d };
+  struct Record {
+    typedef CertificateEnv type_class;
+    Ref<CellSlice> certificate;  	// certificate : Certificate
+    Record() = default;
+    Record(Ref<CellSlice> _certificate) : certificate(std::move(_certificate)) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 384;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(384);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_certificate_env(vm::CellSlice& cs, Ref<CellSlice>& certificate) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_certificate_env(Ref<vm::Cell> cell_ref, Ref<CellSlice>& certificate) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_certificate_env(vm::CellBuilder& cb, Ref<CellSlice> certificate) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_certificate_env(Ref<vm::Cell>& cell_ref, Ref<CellSlice> certificate) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "CertificateEnv";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const CertificateEnv t_CertificateEnv;
+
+//
+// headers for type `SignedCertificate`
+//
+
+struct SignedCertificate final : TLB_Complex {
+  enum { signed_certificate };
+  static constexpr int cons_len_exact = 0;
+  struct Record {
+    typedef SignedCertificate type_class;
+    Ref<CellSlice> certificate;  	// certificate : Certificate
+    Ref<CellSlice> certificate_signature;  	// certificate_signature : CryptoSignature
+    Record() = default;
+    Record(Ref<CellSlice> _certificate, Ref<CellSlice> _certificate_signature) : certificate(std::move(_certificate)), certificate_signature(std::move(_certificate_signature)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_signed_certificate(vm::CellSlice& cs, Ref<CellSlice>& certificate, Ref<CellSlice>& certificate_signature) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_signed_certificate(Ref<vm::Cell> cell_ref, Ref<CellSlice>& certificate, Ref<CellSlice>& certificate_signature) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_signed_certificate(vm::CellBuilder& cb, Ref<CellSlice> certificate, Ref<CellSlice> certificate_signature) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_signed_certificate(Ref<vm::Cell>& cell_ref, Ref<CellSlice> certificate, Ref<CellSlice> certificate_signature) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "SignedCertificate";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const SignedCertificate t_SignedCertificate;
+
+//
+// headers for type `CryptoSignature`
+//
+
+struct CryptoSignature final : TLB_Complex {
+  enum { cons1, chained_signature };
+  static constexpr char cons_len[2] = { 0, 4 };
+  static constexpr unsigned char cons_tag[2] = { 0, 15 };
+  struct Record_cons1 {
+    typedef CryptoSignature type_class;
+    Ref<CellSlice> x;  	// CryptoSignatureSimple
+    Record_cons1() = default;
+    Record_cons1(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_chained_signature {
+    typedef CryptoSignature type_class;
+    Ref<Cell> signed_cert;  	// signed_cert : ^SignedCertificate
+    Ref<CellSlice> temp_key_signature;  	// temp_key_signature : CryptoSignatureSimple
+    Record_chained_signature() = default;
+    Record_chained_signature(Ref<Cell> _signed_cert, Ref<CellSlice> _temp_key_signature) : signed_cert(std::move(_signed_cert)), temp_key_signature(std::move(_temp_key_signature)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_cons1& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons1& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons1& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons1& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_chained_signature& data) const;
+  bool unpack_chained_signature(vm::CellSlice& cs, Ref<Cell>& signed_cert, Ref<CellSlice>& temp_key_signature) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_chained_signature& data) const;
+  bool cell_unpack_chained_signature(Ref<vm::Cell> cell_ref, Ref<Cell>& signed_cert, Ref<CellSlice>& temp_key_signature) const;
+  bool pack(vm::CellBuilder& cb, const Record_chained_signature& data) const;
+  bool pack_chained_signature(vm::CellBuilder& cb, Ref<Cell> signed_cert, Ref<CellSlice> temp_key_signature) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_chained_signature& data) const;
+  bool cell_pack_chained_signature(Ref<vm::Cell>& cell_ref, Ref<Cell> signed_cert, Ref<CellSlice> temp_key_signature) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "CryptoSignature";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+extern const CryptoSignature t_CryptoSignature;
+
+//
+// headers for auxiliary type `McBlockExtra_aux`
+//
+
+struct McBlockExtra_aux final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, Ref<CellSlice>& prev_blk_signatures, Ref<CellSlice>& recover_create_msg, Ref<CellSlice>& mint_msg) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, Ref<CellSlice>& prev_blk_signatures, Ref<CellSlice>& recover_create_msg, Ref<CellSlice>& mint_msg) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, Ref<CellSlice> prev_blk_signatures, Ref<CellSlice> recover_create_msg, Ref<CellSlice> mint_msg) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, Ref<CellSlice> prev_blk_signatures, Ref<CellSlice> recover_create_msg, Ref<CellSlice> mint_msg) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "McBlockExtra_aux";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct McBlockExtra_aux::Record {
+  typedef McBlockExtra_aux type_class;
+  Ref<CellSlice> prev_blk_signatures;  	// prev_blk_signatures : HashmapE 16 CryptoSignaturePair
+  Ref<CellSlice> recover_create_msg;  	// recover_create_msg : Maybe ^InMsg
+  Ref<CellSlice> mint_msg;  	// mint_msg : Maybe ^InMsg
+  Record() = default;
+  Record(Ref<CellSlice> _prev_blk_signatures, Ref<CellSlice> _recover_create_msg, Ref<CellSlice> _mint_msg) : prev_blk_signatures(std::move(_prev_blk_signatures)), recover_create_msg(std::move(_recover_create_msg)), mint_msg(std::move(_mint_msg)) {}
+};
+
+extern const McBlockExtra_aux t_McBlockExtra_aux;
+
+//
+// headers for type `McBlockExtra`
+//
+
+struct McBlockExtra final : TLB_Complex {
+  enum { masterchain_block_extra };
+  static constexpr int cons_len_exact = 16;
+  static constexpr unsigned short cons_tag[1] = { 0xcca5 };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "McBlockExtra";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct McBlockExtra::Record {
+  typedef McBlockExtra type_class;
+  bool key_block;  	// key_block : ## 1
+  Ref<CellSlice> shard_hashes;  	// shard_hashes : ShardHashes
+  Ref<CellSlice> shard_fees;  	// shard_fees : ShardFees
+  McBlockExtra_aux::Record r1;  	// ^[$_ prev_blk_signatures:(HashmapE 16 CryptoSignaturePair) recover_create_msg:(Maybe ^InMsg) mint_msg:(Maybe ^InMsg) ]
+  Ref<CellSlice> config;  	// config : key_block?ConfigParams
+  Record() = default;
+  Record(bool _key_block, Ref<CellSlice> _shard_hashes, Ref<CellSlice> _shard_fees, const McBlockExtra_aux::Record& _r1, Ref<CellSlice> _config) : key_block(_key_block), shard_hashes(std::move(_shard_hashes)), shard_fees(std::move(_shard_fees)), r1(_r1), config(std::move(_config)) {}
+};
+
+extern const McBlockExtra t_McBlockExtra;
+
+//
+// headers for type `ValidatorDescr`
+//
+
+struct ValidatorDescr final : TLB_Complex {
+  enum { validator, validator_addr };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[2] = { 0x53, 0x73 };
+  struct Record_validator {
+    typedef ValidatorDescr type_class;
+    Ref<CellSlice> public_key;  	// public_key : SigPubKey
+    unsigned long long weight;  	// weight : uint64
+    Record_validator() = default;
+    Record_validator(Ref<CellSlice> _public_key, unsigned long long _weight) : public_key(std::move(_public_key)), weight(_weight) {}
+  };
+  struct Record_validator_addr;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_validator& data) const;
+  bool unpack_validator(vm::CellSlice& cs, Ref<CellSlice>& public_key, unsigned long long& weight) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_validator& data) const;
+  bool cell_unpack_validator(Ref<vm::Cell> cell_ref, Ref<CellSlice>& public_key, unsigned long long& weight) const;
+  bool pack(vm::CellBuilder& cb, const Record_validator& data) const;
+  bool pack_validator(vm::CellBuilder& cb, Ref<CellSlice> public_key, unsigned long long weight) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_validator& data) const;
+  bool cell_pack_validator(Ref<vm::Cell>& cell_ref, Ref<CellSlice> public_key, unsigned long long weight) const;
+  bool unpack(vm::CellSlice& cs, Record_validator_addr& data) const;
+  bool unpack_validator_addr(vm::CellSlice& cs, Ref<CellSlice>& public_key, unsigned long long& weight, td::BitArray<256>& adnl_addr) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_validator_addr& data) const;
+  bool cell_unpack_validator_addr(Ref<vm::Cell> cell_ref, Ref<CellSlice>& public_key, unsigned long long& weight, td::BitArray<256>& adnl_addr) const;
+  bool pack(vm::CellBuilder& cb, const Record_validator_addr& data) const;
+  bool pack_validator_addr(vm::CellBuilder& cb, Ref<CellSlice> public_key, unsigned long long weight, td::BitArray<256> adnl_addr) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_validator_addr& data) const;
+  bool cell_pack_validator_addr(Ref<vm::Cell>& cell_ref, Ref<CellSlice> public_key, unsigned long long weight, td::BitArray<256> adnl_addr) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ValidatorDescr";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(3, 12);
+  }
+};
+
+struct ValidatorDescr::Record_validator_addr {
+  typedef ValidatorDescr type_class;
+  Ref<CellSlice> public_key;  	// public_key : SigPubKey
+  unsigned long long weight;  	// weight : uint64
+  td::BitArray<256> adnl_addr;  	// adnl_addr : bits256
+  Record_validator_addr() = default;
+  Record_validator_addr(Ref<CellSlice> _public_key, unsigned long long _weight, const td::BitArray<256>& _adnl_addr) : public_key(std::move(_public_key)), weight(_weight), adnl_addr(_adnl_addr) {}
+};
+
+extern const ValidatorDescr t_ValidatorDescr;
+
+//
+// headers for type `ValidatorSet`
+//
+
+struct ValidatorSet final : TLB_Complex {
+  enum { validators };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 17 };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ValidatorSet";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ValidatorSet::Record {
+  typedef ValidatorSet type_class;
+  unsigned utime_since;  	// utime_since : uint32
+  unsigned utime_until;  	// utime_until : uint32
+  int total;  	// total : ## 16
+  int main;  	// main : ## 16
+  Ref<CellSlice> list;  	// list : Hashmap 16 ValidatorDescr
+  Record() = default;
+  Record(unsigned _utime_since, unsigned _utime_until, int _total, int _main, Ref<CellSlice> _list) : utime_since(_utime_since), utime_until(_utime_until), total(_total), main(_main), list(std::move(_list)) {}
+};
+
+extern const ValidatorSet t_ValidatorSet;
+
+//
+// headers for type `GlobalVersion`
+//
+
+struct GlobalVersion final : TLB_Complex {
+  enum { capabilities };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 0xc4 };
+  struct Record {
+    typedef GlobalVersion type_class;
+    unsigned version;  	// version : uint32
+    unsigned long long capabilities;  	// capabilities : uint64
+    Record() = default;
+    Record(unsigned _version, unsigned long long _capabilities) : version(_version), capabilities(_capabilities) {}
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 104;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(104);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_capabilities(vm::CellSlice& cs, unsigned& version, unsigned long long& capabilities) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_capabilities(Ref<vm::Cell> cell_ref, unsigned& version, unsigned long long& capabilities) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_capabilities(vm::CellBuilder& cb, unsigned version, unsigned long long capabilities) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_capabilities(Ref<vm::Cell>& cell_ref, unsigned version, unsigned long long capabilities) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "GlobalVersion";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const GlobalVersion t_GlobalVersion;
+
+//
+// headers for type `WorkchainFormat`
+//
+
+struct WorkchainFormat final : TLB_Complex {
+  enum { wfmt_ext, wfmt_basic };
+  static constexpr int cons_len_exact = 4;
+  int m_;
+  WorkchainFormat(int m) : m_(m) {}
+  struct Record_wfmt_basic {
+    typedef WorkchainFormat type_class;
+    int vm_version;  	// vm_version : int32
+    unsigned long long vm_mode;  	// vm_mode : uint64
+    Record_wfmt_basic() = default;
+    Record_wfmt_basic(int _vm_version, unsigned long long _vm_mode) : vm_version(_vm_version), vm_mode(_vm_mode) {}
+  };
+  struct Record_wfmt_ext;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_wfmt_basic& data) const;
+  bool unpack_wfmt_basic(vm::CellSlice& cs, int& vm_version, unsigned long long& vm_mode) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_wfmt_basic& data) const;
+  bool cell_unpack_wfmt_basic(Ref<vm::Cell> cell_ref, int& vm_version, unsigned long long& vm_mode) const;
+  bool pack(vm::CellBuilder& cb, const Record_wfmt_basic& data) const;
+  bool pack_wfmt_basic(vm::CellBuilder& cb, int vm_version, unsigned long long vm_mode) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_wfmt_basic& data) const;
+  bool cell_pack_wfmt_basic(Ref<vm::Cell>& cell_ref, int vm_version, unsigned long long vm_mode) const;
+  bool unpack(vm::CellSlice& cs, Record_wfmt_ext& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_wfmt_ext& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_wfmt_ext& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_wfmt_ext& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(WorkchainFormat " << m_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.bselect(4, 3);
+  }
+};
+
+struct WorkchainFormat::Record_wfmt_ext {
+  typedef WorkchainFormat type_class;
+  int min_addr_len;  	// min_addr_len : ## 12
+  int max_addr_len;  	// max_addr_len : ## 12
+  int addr_len_step;  	// addr_len_step : ## 12
+  int workchain_type_id;  	// workchain_type_id : ## 32
+  Record_wfmt_ext() = default;
+  Record_wfmt_ext(int _min_addr_len, int _max_addr_len, int _addr_len_step, int _workchain_type_id) : min_addr_len(_min_addr_len), max_addr_len(_max_addr_len), addr_len_step(_addr_len_step), workchain_type_id(_workchain_type_id) {}
+};
+
+//
+// headers for type `WorkchainDescr`
+//
+
+struct WorkchainDescr final : TLB_Complex {
+  enum { workchain };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 0xa6 };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "WorkchainDescr";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct WorkchainDescr::Record {
+  typedef WorkchainDescr type_class;
+  unsigned enabled_since;  	// enabled_since : uint32
+  int actual_min_split;  	// actual_min_split : ## 8
+  int min_split;  	// min_split : ## 8
+  int max_split;  	// max_split : ## 8
+  bool basic;  	// basic : ## 1
+  bool active;  	// active : Bool
+  bool accept_msgs;  	// accept_msgs : Bool
+  int flags;  	// flags : ## 13
+  td::BitArray<256> zerostate_root_hash;  	// zerostate_root_hash : bits256
+  td::BitArray<256> zerostate_file_hash;  	// zerostate_file_hash : bits256
+  unsigned version;  	// version : uint32
+  Ref<CellSlice> format;  	// format : WorkchainFormat basic
+  Record() = default;
+  Record(unsigned _enabled_since, int _actual_min_split, int _min_split, int _max_split, bool _basic, bool _active, bool _accept_msgs, int _flags, const td::BitArray<256>& _zerostate_root_hash, const td::BitArray<256>& _zerostate_file_hash, unsigned _version, Ref<CellSlice> _format) : enabled_since(_enabled_since), actual_min_split(_actual_min_split), min_split(_min_split), max_split(_max_split), basic(_basic), active(_active), accept_msgs(_accept_msgs), flags(_flags), zerostate_root_hash(_zerostate_root_hash), zerostate_file_hash(_zerostate_file_hash), version(_version), format(std::move(_format)) {}
+};
+
+extern const WorkchainDescr t_WorkchainDescr;
+
+//
+// headers for type `BlockCreateFees`
+//
+
+struct BlockCreateFees final : TLB_Complex {
+  enum { block_grams_created };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 0x6b };
+  struct Record {
+    typedef BlockCreateFees type_class;
+    Ref<CellSlice> masterchain_block_fee;  	// masterchain_block_fee : Grams
+    Ref<CellSlice> basechain_block_fee;  	// basechain_block_fee : Grams
+    Record() = default;
+    Record(Ref<CellSlice> _masterchain_block_fee, Ref<CellSlice> _basechain_block_fee) : masterchain_block_fee(std::move(_masterchain_block_fee)), basechain_block_fee(std::move(_basechain_block_fee)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_block_grams_created(vm::CellSlice& cs, Ref<CellSlice>& masterchain_block_fee, Ref<CellSlice>& basechain_block_fee) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_block_grams_created(Ref<vm::Cell> cell_ref, Ref<CellSlice>& masterchain_block_fee, Ref<CellSlice>& basechain_block_fee) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_block_grams_created(vm::CellBuilder& cb, Ref<CellSlice> masterchain_block_fee, Ref<CellSlice> basechain_block_fee) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_block_grams_created(Ref<vm::Cell>& cell_ref, Ref<CellSlice> masterchain_block_fee, Ref<CellSlice> basechain_block_fee) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "BlockCreateFees";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const BlockCreateFees t_BlockCreateFees;
+
+//
+// headers for type `StoragePrices`
+//
+
+struct StoragePrices final : TLB_Complex {
+  enum { cons1 };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 0xcc };
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 296;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(296);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "StoragePrices";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct StoragePrices::Record {
+  typedef StoragePrices type_class;
+  unsigned utime_since;  	// utime_since : uint32
+  unsigned long long bit_price_ps;  	// bit_price_ps : uint64
+  unsigned long long cell_price_ps;  	// cell_price_ps : uint64
+  unsigned long long mc_bit_price_ps;  	// mc_bit_price_ps : uint64
+  unsigned long long mc_cell_price_ps;  	// mc_cell_price_ps : uint64
+  Record() = default;
+  Record(unsigned _utime_since, unsigned long long _bit_price_ps, unsigned long long _cell_price_ps, unsigned long long _mc_bit_price_ps, unsigned long long _mc_cell_price_ps) : utime_since(_utime_since), bit_price_ps(_bit_price_ps), cell_price_ps(_cell_price_ps), mc_bit_price_ps(_mc_bit_price_ps), mc_cell_price_ps(_mc_cell_price_ps) {}
+};
+
+extern const StoragePrices t_StoragePrices;
+
+//
+// headers for type `GasLimitsPrices`
+//
+
+struct GasLimitsPrices final : TLB_Complex {
+  enum { gas_prices, gas_prices_ext };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[2] = { 0xdd, 0xde };
+  struct Record_gas_prices;
+  struct Record_gas_prices_ext;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_gas_prices& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_gas_prices& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_gas_prices& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_gas_prices& data) const;
+  bool unpack(vm::CellSlice& cs, Record_gas_prices_ext& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_gas_prices_ext& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_gas_prices_ext& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_gas_prices_ext& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "GasLimitsPrices";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override;
+};
+
+struct GasLimitsPrices::Record_gas_prices {
+  typedef GasLimitsPrices type_class;
+  unsigned long long gas_price;  	// gas_price : uint64
+  unsigned long long gas_limit;  	// gas_limit : uint64
+  unsigned long long gas_credit;  	// gas_credit : uint64
+  unsigned long long block_gas_limit;  	// block_gas_limit : uint64
+  unsigned long long freeze_due_limit;  	// freeze_due_limit : uint64
+  unsigned long long delete_due_limit;  	// delete_due_limit : uint64
+  Record_gas_prices() = default;
+  Record_gas_prices(unsigned long long _gas_price, unsigned long long _gas_limit, unsigned long long _gas_credit, unsigned long long _block_gas_limit, unsigned long long _freeze_due_limit, unsigned long long _delete_due_limit) : gas_price(_gas_price), gas_limit(_gas_limit), gas_credit(_gas_credit), block_gas_limit(_block_gas_limit), freeze_due_limit(_freeze_due_limit), delete_due_limit(_delete_due_limit) {}
+};
+
+struct GasLimitsPrices::Record_gas_prices_ext {
+  typedef GasLimitsPrices type_class;
+  unsigned long long gas_price;  	// gas_price : uint64
+  unsigned long long gas_limit;  	// gas_limit : uint64
+  unsigned long long special_gas_limit;  	// special_gas_limit : uint64
+  unsigned long long gas_credit;  	// gas_credit : uint64
+  unsigned long long block_gas_limit;  	// block_gas_limit : uint64
+  unsigned long long freeze_due_limit;  	// freeze_due_limit : uint64
+  unsigned long long delete_due_limit;  	// delete_due_limit : uint64
+  Record_gas_prices_ext() = default;
+  Record_gas_prices_ext(unsigned long long _gas_price, unsigned long long _gas_limit, unsigned long long _special_gas_limit, unsigned long long _gas_credit, unsigned long long _block_gas_limit, unsigned long long _freeze_due_limit, unsigned long long _delete_due_limit) : gas_price(_gas_price), gas_limit(_gas_limit), special_gas_limit(_special_gas_limit), gas_credit(_gas_credit), block_gas_limit(_block_gas_limit), freeze_due_limit(_freeze_due_limit), delete_due_limit(_delete_due_limit) {}
+};
+
+extern const GasLimitsPrices t_GasLimitsPrices;
+
+//
+// headers for type `ParamLimits`
+//
+
+struct ParamLimits final : TLB_Complex {
+  enum { param_limits };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 0xc3 };
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 104;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(104);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_param_limits(vm::CellSlice& cs, int& underload, int& soft_limit, int& hard_limit) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_param_limits(Ref<vm::Cell> cell_ref, int& underload, int& soft_limit, int& hard_limit) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_param_limits(vm::CellBuilder& cb, int underload, int soft_limit, int hard_limit) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_param_limits(Ref<vm::Cell>& cell_ref, int underload, int soft_limit, int hard_limit) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ParamLimits";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ParamLimits::Record {
+  typedef ParamLimits type_class;
+  int underload;  	// underload : #
+  int soft_limit;  	// soft_limit : #
+  int hard_limit;  	// hard_limit : #
+  Record() = default;
+  Record(int _underload, int _soft_limit, int _hard_limit) : underload(_underload), soft_limit(_soft_limit), hard_limit(_hard_limit) {}
+};
+
+extern const ParamLimits t_ParamLimits;
+
+//
+// headers for type `BlockLimits`
+//
+
+struct BlockLimits final : TLB_Complex {
+  enum { block_limits };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 0x5d };
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 320;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(320);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_block_limits(vm::CellSlice& cs, Ref<CellSlice>& bytes, Ref<CellSlice>& gas, Ref<CellSlice>& lt_delta) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_block_limits(Ref<vm::Cell> cell_ref, Ref<CellSlice>& bytes, Ref<CellSlice>& gas, Ref<CellSlice>& lt_delta) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_block_limits(vm::CellBuilder& cb, Ref<CellSlice> bytes, Ref<CellSlice> gas, Ref<CellSlice> lt_delta) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_block_limits(Ref<vm::Cell>& cell_ref, Ref<CellSlice> bytes, Ref<CellSlice> gas, Ref<CellSlice> lt_delta) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "BlockLimits";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct BlockLimits::Record {
+  typedef BlockLimits type_class;
+  Ref<CellSlice> bytes;  	// bytes : ParamLimits
+  Ref<CellSlice> gas;  	// gas : ParamLimits
+  Ref<CellSlice> lt_delta;  	// lt_delta : ParamLimits
+  Record() = default;
+  Record(Ref<CellSlice> _bytes, Ref<CellSlice> _gas, Ref<CellSlice> _lt_delta) : bytes(std::move(_bytes)), gas(std::move(_gas)), lt_delta(std::move(_lt_delta)) {}
+};
+
+extern const BlockLimits t_BlockLimits;
+
+//
+// headers for type `MsgForwardPrices`
+//
+
+struct MsgForwardPrices final : TLB_Complex {
+  enum { msg_forward_prices };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 0xea };
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 264;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(264);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "MsgForwardPrices";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct MsgForwardPrices::Record {
+  typedef MsgForwardPrices type_class;
+  unsigned long long lump_price;  	// lump_price : uint64
+  unsigned long long bit_price;  	// bit_price : uint64
+  unsigned long long cell_price;  	// cell_price : uint64
+  unsigned ihr_price_factor;  	// ihr_price_factor : uint32
+  int first_frac;  	// first_frac : uint16
+  int next_frac;  	// next_frac : uint16
+  Record() = default;
+  Record(unsigned long long _lump_price, unsigned long long _bit_price, unsigned long long _cell_price, unsigned _ihr_price_factor, int _first_frac, int _next_frac) : lump_price(_lump_price), bit_price(_bit_price), cell_price(_cell_price), ihr_price_factor(_ihr_price_factor), first_frac(_first_frac), next_frac(_next_frac) {}
+};
+
+extern const MsgForwardPrices t_MsgForwardPrices;
+
+//
+// headers for type `CatchainConfig`
+//
+
+struct CatchainConfig final : TLB_Complex {
+  enum { catchain_config };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 0xc1 };
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 136;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(136);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "CatchainConfig";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct CatchainConfig::Record {
+  typedef CatchainConfig type_class;
+  unsigned mc_catchain_lifetime;  	// mc_catchain_lifetime : uint32
+  unsigned shard_catchain_lifetime;  	// shard_catchain_lifetime : uint32
+  unsigned shard_validators_lifetime;  	// shard_validators_lifetime : uint32
+  unsigned shard_validators_num;  	// shard_validators_num : uint32
+  Record() = default;
+  Record(unsigned _mc_catchain_lifetime, unsigned _shard_catchain_lifetime, unsigned _shard_validators_lifetime, unsigned _shard_validators_num) : mc_catchain_lifetime(_mc_catchain_lifetime), shard_catchain_lifetime(_shard_catchain_lifetime), shard_validators_lifetime(_shard_validators_lifetime), shard_validators_num(_shard_validators_num) {}
+};
+
+extern const CatchainConfig t_CatchainConfig;
+
+//
+// headers for type `ConsensusConfig`
+//
+
+struct ConsensusConfig final : TLB_Complex {
+  enum { consensus_config };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 0xd6 };
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 264;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(264);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ConsensusConfig";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ConsensusConfig::Record {
+  typedef ConsensusConfig type_class;
+  int round_candidates;  	// round_candidates : #
+  unsigned next_candidate_delay_ms;  	// next_candidate_delay_ms : uint32
+  unsigned consensus_timeout_ms;  	// consensus_timeout_ms : uint32
+  unsigned fast_attempts;  	// fast_attempts : uint32
+  unsigned attempt_duration;  	// attempt_duration : uint32
+  unsigned catchain_max_deps;  	// catchain_max_deps : uint32
+  unsigned max_block_bytes;  	// max_block_bytes : uint32
+  unsigned max_collated_bytes;  	// max_collated_bytes : uint32
+  Record() = default;
+  Record(int _round_candidates, unsigned _next_candidate_delay_ms, unsigned _consensus_timeout_ms, unsigned _fast_attempts, unsigned _attempt_duration, unsigned _catchain_max_deps, unsigned _max_block_bytes, unsigned _max_collated_bytes) : round_candidates(_round_candidates), next_candidate_delay_ms(_next_candidate_delay_ms), consensus_timeout_ms(_consensus_timeout_ms), fast_attempts(_fast_attempts), attempt_duration(_attempt_duration), catchain_max_deps(_catchain_max_deps), max_block_bytes(_max_block_bytes), max_collated_bytes(_max_collated_bytes) {}
+};
+
+extern const ConsensusConfig t_ConsensusConfig;
+
+//
+// headers for type `ValidatorTempKey`
+//
+
+struct ValidatorTempKey final : TLB_Complex {
+  enum { validator_temp_key };
+  static constexpr int cons_len_exact = 4;
+  static constexpr unsigned char cons_tag[1] = { 3 };
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 612;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(612);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ValidatorTempKey";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct ValidatorTempKey::Record {
+  typedef ValidatorTempKey type_class;
+  td::BitArray<256> adnl_addr;  	// adnl_addr : bits256
+  Ref<CellSlice> temp_public_key;  	// temp_public_key : SigPubKey
+  int seqno;  	// seqno : #
+  unsigned valid_until;  	// valid_until : uint32
+  Record() = default;
+  Record(const td::BitArray<256>& _adnl_addr, Ref<CellSlice> _temp_public_key, int _seqno, unsigned _valid_until) : adnl_addr(_adnl_addr), temp_public_key(std::move(_temp_public_key)), seqno(_seqno), valid_until(_valid_until) {}
+};
+
+extern const ValidatorTempKey t_ValidatorTempKey;
+
+//
+// headers for type `ValidatorSignedTempKey`
+//
+
+struct ValidatorSignedTempKey final : TLB_Complex {
+  enum { signed_temp_key };
+  static constexpr int cons_len_exact = 4;
+  static constexpr unsigned char cons_tag[1] = { 4 };
+  struct Record {
+    typedef ValidatorSignedTempKey type_class;
+    Ref<Cell> key;  	// key : ^ValidatorTempKey
+    Ref<CellSlice> signature;  	// signature : CryptoSignature
+    Record() = default;
+    Record(Ref<Cell> _key, Ref<CellSlice> _signature) : key(std::move(_key)), signature(std::move(_signature)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_signed_temp_key(vm::CellSlice& cs, Ref<Cell>& key, Ref<CellSlice>& signature) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_signed_temp_key(Ref<vm::Cell> cell_ref, Ref<Cell>& key, Ref<CellSlice>& signature) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_signed_temp_key(vm::CellBuilder& cb, Ref<Cell> key, Ref<CellSlice> signature) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_signed_temp_key(Ref<vm::Cell>& cell_ref, Ref<Cell> key, Ref<CellSlice> signature) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "ValidatorSignedTempKey";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const ValidatorSignedTempKey t_ValidatorSignedTempKey;
+
+//
+// headers for type `ConfigParam`
+//
+
+struct ConfigParam final : TLB_Complex {
+  enum { cons32, cons33, cons34, cons35, cons36, cons37, config_mc_block_limits, config_block_limits, cons14, cons0, cons1, cons2, cons3, cons4, cons6, cons7, cons9, cons12, cons15, cons16, cons17, cons18, cons31, cons39, cons28, cons8, cons29, config_mc_gas_prices, config_gas_prices, config_mc_fwd_prices, config_fwd_prices };
+  static constexpr int cons_len_exact = 0;
+  int m_;
+  ConfigParam(int m) : m_(m) {}
+  struct Record_cons0 {
+    typedef ConfigParam type_class;
+    td::BitArray<256> config_addr;  	// config_addr : bits256
+    Record_cons0() = default;
+    Record_cons0(const td::BitArray<256>& _config_addr) : config_addr(_config_addr) {}
+  };
+  struct Record_cons1 {
+    typedef ConfigParam type_class;
+    td::BitArray<256> elector_addr;  	// elector_addr : bits256
+    Record_cons1() = default;
+    Record_cons1(const td::BitArray<256>& _elector_addr) : elector_addr(_elector_addr) {}
+  };
+  struct Record_cons2 {
+    typedef ConfigParam type_class;
+    td::BitArray<256> minter_addr;  	// minter_addr : bits256
+    Record_cons2() = default;
+    Record_cons2(const td::BitArray<256>& _minter_addr) : minter_addr(_minter_addr) {}
+  };
+  struct Record_cons3 {
+    typedef ConfigParam type_class;
+    td::BitArray<256> fee_collector_addr;  	// fee_collector_addr : bits256
+    Record_cons3() = default;
+    Record_cons3(const td::BitArray<256>& _fee_collector_addr) : fee_collector_addr(_fee_collector_addr) {}
+  };
+  struct Record_cons4 {
+    typedef ConfigParam type_class;
+    td::BitArray<256> dns_root_addr;  	// dns_root_addr : bits256
+    Record_cons4() = default;
+    Record_cons4(const td::BitArray<256>& _dns_root_addr) : dns_root_addr(_dns_root_addr) {}
+  };
+  struct Record_cons6 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> mint_new_price;  	// mint_new_price : Grams
+    Ref<CellSlice> mint_add_price;  	// mint_add_price : Grams
+    Record_cons6() = default;
+    Record_cons6(Ref<CellSlice> _mint_new_price, Ref<CellSlice> _mint_add_price) : mint_new_price(std::move(_mint_new_price)), mint_add_price(std::move(_mint_add_price)) {}
+  };
+  struct Record_cons7 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> to_mint;  	// to_mint : ExtraCurrencyCollection
+    Record_cons7() = default;
+    Record_cons7(Ref<CellSlice> _to_mint) : to_mint(std::move(_to_mint)) {}
+  };
+  struct Record_cons8 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> x;  	// GlobalVersion
+    Record_cons8() = default;
+    Record_cons8(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_cons9 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> mandatory_params;  	// mandatory_params : Hashmap 32 True
+    Record_cons9() = default;
+    Record_cons9(Ref<CellSlice> _mandatory_params) : mandatory_params(std::move(_mandatory_params)) {}
+  };
+  struct Record_cons12 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> workchains;  	// workchains : HashmapE 32 WorkchainDescr
+    Record_cons12() = default;
+    Record_cons12(Ref<CellSlice> _workchains) : workchains(std::move(_workchains)) {}
+  };
+  struct Record_cons14 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> x;  	// BlockCreateFees
+    Record_cons14() = default;
+    Record_cons14(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_cons15;
+  struct Record_cons16;
+  struct Record_cons17;
+  struct Record_cons18 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> x;  	// Hashmap 32 StoragePrices
+    Record_cons18() = default;
+    Record_cons18(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_config_mc_gas_prices {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> x;  	// GasLimitsPrices
+    Record_config_mc_gas_prices() = default;
+    Record_config_mc_gas_prices(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_config_gas_prices {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> x;  	// GasLimitsPrices
+    Record_config_gas_prices() = default;
+    Record_config_gas_prices(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_config_mc_block_limits {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> x;  	// BlockLimits
+    Record_config_mc_block_limits() = default;
+    Record_config_mc_block_limits(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_config_block_limits {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> x;  	// BlockLimits
+    Record_config_block_limits() = default;
+    Record_config_block_limits(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_config_mc_fwd_prices {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> x;  	// MsgForwardPrices
+    Record_config_mc_fwd_prices() = default;
+    Record_config_mc_fwd_prices(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_config_fwd_prices {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> x;  	// MsgForwardPrices
+    Record_config_fwd_prices() = default;
+    Record_config_fwd_prices(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_cons28 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> x;  	// CatchainConfig
+    Record_cons28() = default;
+    Record_cons28(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_cons29 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> x;  	// ConsensusConfig
+    Record_cons29() = default;
+    Record_cons29(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  struct Record_cons31 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> fundamental_smc_addr;  	// fundamental_smc_addr : HashmapE 256 True
+    Record_cons31() = default;
+    Record_cons31(Ref<CellSlice> _fundamental_smc_addr) : fundamental_smc_addr(std::move(_fundamental_smc_addr)) {}
+  };
+  struct Record_cons32 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> prev_validators;  	// prev_validators : ValidatorSet
+    Record_cons32() = default;
+    Record_cons32(Ref<CellSlice> _prev_validators) : prev_validators(std::move(_prev_validators)) {}
+  };
+  struct Record_cons33 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> prev_temp_validators;  	// prev_temp_validators : ValidatorSet
+    Record_cons33() = default;
+    Record_cons33(Ref<CellSlice> _prev_temp_validators) : prev_temp_validators(std::move(_prev_temp_validators)) {}
+  };
+  struct Record_cons34 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> cur_validators;  	// cur_validators : ValidatorSet
+    Record_cons34() = default;
+    Record_cons34(Ref<CellSlice> _cur_validators) : cur_validators(std::move(_cur_validators)) {}
+  };
+  struct Record_cons35 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> cur_temp_validators;  	// cur_temp_validators : ValidatorSet
+    Record_cons35() = default;
+    Record_cons35(Ref<CellSlice> _cur_temp_validators) : cur_temp_validators(std::move(_cur_temp_validators)) {}
+  };
+  struct Record_cons36 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> next_validators;  	// next_validators : ValidatorSet
+    Record_cons36() = default;
+    Record_cons36(Ref<CellSlice> _next_validators) : next_validators(std::move(_next_validators)) {}
+  };
+  struct Record_cons37 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> next_temp_validators;  	// next_temp_validators : ValidatorSet
+    Record_cons37() = default;
+    Record_cons37(Ref<CellSlice> _next_temp_validators) : next_temp_validators(std::move(_next_temp_validators)) {}
+  };
+  struct Record_cons39 {
+    typedef ConfigParam type_class;
+    Ref<CellSlice> x;  	// HashmapE 256 ValidatorSignedTempKey
+    Record_cons39() = default;
+    Record_cons39(Ref<CellSlice> _x) : x(std::move(_x)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_cons0& data) const;
+  bool unpack_cons0(vm::CellSlice& cs, td::BitArray<256>& config_addr) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons0& data) const;
+  bool cell_unpack_cons0(Ref<vm::Cell> cell_ref, td::BitArray<256>& config_addr) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons0& data) const;
+  bool pack_cons0(vm::CellBuilder& cb, td::BitArray<256> config_addr) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons0& data) const;
+  bool cell_pack_cons0(Ref<vm::Cell>& cell_ref, td::BitArray<256> config_addr) const;
+  bool unpack(vm::CellSlice& cs, Record_cons1& data) const;
+  bool unpack_cons1(vm::CellSlice& cs, td::BitArray<256>& elector_addr) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons1& data) const;
+  bool cell_unpack_cons1(Ref<vm::Cell> cell_ref, td::BitArray<256>& elector_addr) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons1& data) const;
+  bool pack_cons1(vm::CellBuilder& cb, td::BitArray<256> elector_addr) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons1& data) const;
+  bool cell_pack_cons1(Ref<vm::Cell>& cell_ref, td::BitArray<256> elector_addr) const;
+  bool unpack(vm::CellSlice& cs, Record_cons2& data) const;
+  bool unpack_cons2(vm::CellSlice& cs, td::BitArray<256>& minter_addr) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons2& data) const;
+  bool cell_unpack_cons2(Ref<vm::Cell> cell_ref, td::BitArray<256>& minter_addr) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons2& data) const;
+  bool pack_cons2(vm::CellBuilder& cb, td::BitArray<256> minter_addr) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons2& data) const;
+  bool cell_pack_cons2(Ref<vm::Cell>& cell_ref, td::BitArray<256> minter_addr) const;
+  bool unpack(vm::CellSlice& cs, Record_cons3& data) const;
+  bool unpack_cons3(vm::CellSlice& cs, td::BitArray<256>& fee_collector_addr) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons3& data) const;
+  bool cell_unpack_cons3(Ref<vm::Cell> cell_ref, td::BitArray<256>& fee_collector_addr) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons3& data) const;
+  bool pack_cons3(vm::CellBuilder& cb, td::BitArray<256> fee_collector_addr) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons3& data) const;
+  bool cell_pack_cons3(Ref<vm::Cell>& cell_ref, td::BitArray<256> fee_collector_addr) const;
+  bool unpack(vm::CellSlice& cs, Record_cons4& data) const;
+  bool unpack_cons4(vm::CellSlice& cs, td::BitArray<256>& dns_root_addr) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons4& data) const;
+  bool cell_unpack_cons4(Ref<vm::Cell> cell_ref, td::BitArray<256>& dns_root_addr) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons4& data) const;
+  bool pack_cons4(vm::CellBuilder& cb, td::BitArray<256> dns_root_addr) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons4& data) const;
+  bool cell_pack_cons4(Ref<vm::Cell>& cell_ref, td::BitArray<256> dns_root_addr) const;
+  bool unpack(vm::CellSlice& cs, Record_cons6& data) const;
+  bool unpack_cons6(vm::CellSlice& cs, Ref<CellSlice>& mint_new_price, Ref<CellSlice>& mint_add_price) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons6& data) const;
+  bool cell_unpack_cons6(Ref<vm::Cell> cell_ref, Ref<CellSlice>& mint_new_price, Ref<CellSlice>& mint_add_price) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons6& data) const;
+  bool pack_cons6(vm::CellBuilder& cb, Ref<CellSlice> mint_new_price, Ref<CellSlice> mint_add_price) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons6& data) const;
+  bool cell_pack_cons6(Ref<vm::Cell>& cell_ref, Ref<CellSlice> mint_new_price, Ref<CellSlice> mint_add_price) const;
+  bool unpack(vm::CellSlice& cs, Record_cons7& data) const;
+  bool unpack_cons7(vm::CellSlice& cs, Ref<CellSlice>& to_mint) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons7& data) const;
+  bool cell_unpack_cons7(Ref<vm::Cell> cell_ref, Ref<CellSlice>& to_mint) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons7& data) const;
+  bool pack_cons7(vm::CellBuilder& cb, Ref<CellSlice> to_mint) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons7& data) const;
+  bool cell_pack_cons7(Ref<vm::Cell>& cell_ref, Ref<CellSlice> to_mint) const;
+  bool unpack(vm::CellSlice& cs, Record_cons8& data) const;
+  bool unpack_cons8(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons8& data) const;
+  bool cell_unpack_cons8(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons8& data) const;
+  bool pack_cons8(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons8& data) const;
+  bool cell_pack_cons8(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_cons9& data) const;
+  bool unpack_cons9(vm::CellSlice& cs, Ref<CellSlice>& mandatory_params) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons9& data) const;
+  bool cell_unpack_cons9(Ref<vm::Cell> cell_ref, Ref<CellSlice>& mandatory_params) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons9& data) const;
+  bool pack_cons9(vm::CellBuilder& cb, Ref<CellSlice> mandatory_params) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons9& data) const;
+  bool cell_pack_cons9(Ref<vm::Cell>& cell_ref, Ref<CellSlice> mandatory_params) const;
+  bool unpack(vm::CellSlice& cs, Record_cons12& data) const;
+  bool unpack_cons12(vm::CellSlice& cs, Ref<CellSlice>& workchains) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons12& data) const;
+  bool cell_unpack_cons12(Ref<vm::Cell> cell_ref, Ref<CellSlice>& workchains) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons12& data) const;
+  bool pack_cons12(vm::CellBuilder& cb, Ref<CellSlice> workchains) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons12& data) const;
+  bool cell_pack_cons12(Ref<vm::Cell>& cell_ref, Ref<CellSlice> workchains) const;
+  bool unpack(vm::CellSlice& cs, Record_cons14& data) const;
+  bool unpack_cons14(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons14& data) const;
+  bool cell_unpack_cons14(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons14& data) const;
+  bool pack_cons14(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons14& data) const;
+  bool cell_pack_cons14(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_cons15& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons15& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons15& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons15& data) const;
+  bool unpack(vm::CellSlice& cs, Record_cons16& data) const;
+  bool unpack_cons16(vm::CellSlice& cs, int& max_validators, int& max_main_validators, int& min_validators) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons16& data) const;
+  bool cell_unpack_cons16(Ref<vm::Cell> cell_ref, int& max_validators, int& max_main_validators, int& min_validators) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons16& data) const;
+  bool pack_cons16(vm::CellBuilder& cb, int max_validators, int max_main_validators, int min_validators) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons16& data) const;
+  bool cell_pack_cons16(Ref<vm::Cell>& cell_ref, int max_validators, int max_main_validators, int min_validators) const;
+  bool unpack(vm::CellSlice& cs, Record_cons17& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons17& data) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons17& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons17& data) const;
+  bool unpack(vm::CellSlice& cs, Record_cons18& data) const;
+  bool unpack_cons18(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons18& data) const;
+  bool cell_unpack_cons18(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons18& data) const;
+  bool pack_cons18(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons18& data) const;
+  bool cell_pack_cons18(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_config_mc_gas_prices& data) const;
+  bool unpack_config_mc_gas_prices(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_config_mc_gas_prices& data) const;
+  bool cell_unpack_config_mc_gas_prices(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_config_mc_gas_prices& data) const;
+  bool pack_config_mc_gas_prices(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_config_mc_gas_prices& data) const;
+  bool cell_pack_config_mc_gas_prices(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_config_gas_prices& data) const;
+  bool unpack_config_gas_prices(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_config_gas_prices& data) const;
+  bool cell_unpack_config_gas_prices(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_config_gas_prices& data) const;
+  bool pack_config_gas_prices(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_config_gas_prices& data) const;
+  bool cell_pack_config_gas_prices(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_config_mc_block_limits& data) const;
+  bool unpack_config_mc_block_limits(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_config_mc_block_limits& data) const;
+  bool cell_unpack_config_mc_block_limits(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_config_mc_block_limits& data) const;
+  bool pack_config_mc_block_limits(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_config_mc_block_limits& data) const;
+  bool cell_pack_config_mc_block_limits(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_config_block_limits& data) const;
+  bool unpack_config_block_limits(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_config_block_limits& data) const;
+  bool cell_unpack_config_block_limits(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_config_block_limits& data) const;
+  bool pack_config_block_limits(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_config_block_limits& data) const;
+  bool cell_pack_config_block_limits(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_config_mc_fwd_prices& data) const;
+  bool unpack_config_mc_fwd_prices(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_config_mc_fwd_prices& data) const;
+  bool cell_unpack_config_mc_fwd_prices(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_config_mc_fwd_prices& data) const;
+  bool pack_config_mc_fwd_prices(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_config_mc_fwd_prices& data) const;
+  bool cell_pack_config_mc_fwd_prices(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_config_fwd_prices& data) const;
+  bool unpack_config_fwd_prices(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_config_fwd_prices& data) const;
+  bool cell_unpack_config_fwd_prices(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_config_fwd_prices& data) const;
+  bool pack_config_fwd_prices(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_config_fwd_prices& data) const;
+  bool cell_pack_config_fwd_prices(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_cons28& data) const;
+  bool unpack_cons28(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons28& data) const;
+  bool cell_unpack_cons28(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons28& data) const;
+  bool pack_cons28(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons28& data) const;
+  bool cell_pack_cons28(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_cons29& data) const;
+  bool unpack_cons29(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons29& data) const;
+  bool cell_unpack_cons29(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons29& data) const;
+  bool pack_cons29(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons29& data) const;
+  bool cell_pack_cons29(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool unpack(vm::CellSlice& cs, Record_cons31& data) const;
+  bool unpack_cons31(vm::CellSlice& cs, Ref<CellSlice>& fundamental_smc_addr) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons31& data) const;
+  bool cell_unpack_cons31(Ref<vm::Cell> cell_ref, Ref<CellSlice>& fundamental_smc_addr) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons31& data) const;
+  bool pack_cons31(vm::CellBuilder& cb, Ref<CellSlice> fundamental_smc_addr) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons31& data) const;
+  bool cell_pack_cons31(Ref<vm::Cell>& cell_ref, Ref<CellSlice> fundamental_smc_addr) const;
+  bool unpack(vm::CellSlice& cs, Record_cons32& data) const;
+  bool unpack_cons32(vm::CellSlice& cs, Ref<CellSlice>& prev_validators) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons32& data) const;
+  bool cell_unpack_cons32(Ref<vm::Cell> cell_ref, Ref<CellSlice>& prev_validators) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons32& data) const;
+  bool pack_cons32(vm::CellBuilder& cb, Ref<CellSlice> prev_validators) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons32& data) const;
+  bool cell_pack_cons32(Ref<vm::Cell>& cell_ref, Ref<CellSlice> prev_validators) const;
+  bool unpack(vm::CellSlice& cs, Record_cons33& data) const;
+  bool unpack_cons33(vm::CellSlice& cs, Ref<CellSlice>& prev_temp_validators) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons33& data) const;
+  bool cell_unpack_cons33(Ref<vm::Cell> cell_ref, Ref<CellSlice>& prev_temp_validators) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons33& data) const;
+  bool pack_cons33(vm::CellBuilder& cb, Ref<CellSlice> prev_temp_validators) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons33& data) const;
+  bool cell_pack_cons33(Ref<vm::Cell>& cell_ref, Ref<CellSlice> prev_temp_validators) const;
+  bool unpack(vm::CellSlice& cs, Record_cons34& data) const;
+  bool unpack_cons34(vm::CellSlice& cs, Ref<CellSlice>& cur_validators) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons34& data) const;
+  bool cell_unpack_cons34(Ref<vm::Cell> cell_ref, Ref<CellSlice>& cur_validators) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons34& data) const;
+  bool pack_cons34(vm::CellBuilder& cb, Ref<CellSlice> cur_validators) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons34& data) const;
+  bool cell_pack_cons34(Ref<vm::Cell>& cell_ref, Ref<CellSlice> cur_validators) const;
+  bool unpack(vm::CellSlice& cs, Record_cons35& data) const;
+  bool unpack_cons35(vm::CellSlice& cs, Ref<CellSlice>& cur_temp_validators) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons35& data) const;
+  bool cell_unpack_cons35(Ref<vm::Cell> cell_ref, Ref<CellSlice>& cur_temp_validators) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons35& data) const;
+  bool pack_cons35(vm::CellBuilder& cb, Ref<CellSlice> cur_temp_validators) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons35& data) const;
+  bool cell_pack_cons35(Ref<vm::Cell>& cell_ref, Ref<CellSlice> cur_temp_validators) const;
+  bool unpack(vm::CellSlice& cs, Record_cons36& data) const;
+  bool unpack_cons36(vm::CellSlice& cs, Ref<CellSlice>& next_validators) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons36& data) const;
+  bool cell_unpack_cons36(Ref<vm::Cell> cell_ref, Ref<CellSlice>& next_validators) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons36& data) const;
+  bool pack_cons36(vm::CellBuilder& cb, Ref<CellSlice> next_validators) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons36& data) const;
+  bool cell_pack_cons36(Ref<vm::Cell>& cell_ref, Ref<CellSlice> next_validators) const;
+  bool unpack(vm::CellSlice& cs, Record_cons37& data) const;
+  bool unpack_cons37(vm::CellSlice& cs, Ref<CellSlice>& next_temp_validators) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons37& data) const;
+  bool cell_unpack_cons37(Ref<vm::Cell> cell_ref, Ref<CellSlice>& next_temp_validators) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons37& data) const;
+  bool pack_cons37(vm::CellBuilder& cb, Ref<CellSlice> next_temp_validators) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons37& data) const;
+  bool cell_pack_cons37(Ref<vm::Cell>& cell_ref, Ref<CellSlice> next_temp_validators) const;
+  bool unpack(vm::CellSlice& cs, Record_cons39& data) const;
+  bool unpack_cons39(vm::CellSlice& cs, Ref<CellSlice>& x) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_cons39& data) const;
+  bool cell_unpack_cons39(Ref<vm::Cell> cell_ref, Ref<CellSlice>& x) const;
+  bool pack(vm::CellBuilder& cb, const Record_cons39& data) const;
+  bool pack_cons39(vm::CellBuilder& cb, Ref<CellSlice> x) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_cons39& data) const;
+  bool cell_pack_cons39(Ref<vm::Cell>& cell_ref, Ref<CellSlice> x) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(ConfigParam " << m_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override;
+};
+
+struct ConfigParam::Record_cons15 {
+  typedef ConfigParam type_class;
+  unsigned validators_elected_for;  	// validators_elected_for : uint32
+  unsigned elections_start_before;  	// elections_start_before : uint32
+  unsigned elections_end_before;  	// elections_end_before : uint32
+  unsigned stake_held_for;  	// stake_held_for : uint32
+  Record_cons15() = default;
+  Record_cons15(unsigned _validators_elected_for, unsigned _elections_start_before, unsigned _elections_end_before, unsigned _stake_held_for) : validators_elected_for(_validators_elected_for), elections_start_before(_elections_start_before), elections_end_before(_elections_end_before), stake_held_for(_stake_held_for) {}
+};
+
+struct ConfigParam::Record_cons16 {
+  typedef ConfigParam type_class;
+  int max_validators;  	// max_validators : ## 16
+  int max_main_validators;  	// max_main_validators : ## 16
+  int min_validators;  	// min_validators : ## 16
+  Record_cons16() = default;
+  Record_cons16(int _max_validators, int _max_main_validators, int _min_validators) : max_validators(_max_validators), max_main_validators(_max_main_validators), min_validators(_min_validators) {}
+};
+
+struct ConfigParam::Record_cons17 {
+  typedef ConfigParam type_class;
+  Ref<CellSlice> min_stake;  	// min_stake : Grams
+  Ref<CellSlice> max_stake;  	// max_stake : Grams
+  Ref<CellSlice> min_total_stake;  	// min_total_stake : Grams
+  unsigned max_stake_factor;  	// max_stake_factor : uint32
+  Record_cons17() = default;
+  Record_cons17(Ref<CellSlice> _min_stake, Ref<CellSlice> _max_stake, Ref<CellSlice> _min_total_stake, unsigned _max_stake_factor) : min_stake(std::move(_min_stake)), max_stake(std::move(_max_stake)), min_total_stake(std::move(_min_total_stake)), max_stake_factor(_max_stake_factor) {}
+};
+
+//
+// headers for type `BlockSignaturesPure`
+//
+
+struct BlockSignaturesPure final : TLB_Complex {
+  enum { block_signatures_pure };
+  static constexpr int cons_len_exact = 0;
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_block_signatures_pure(vm::CellSlice& cs, unsigned& sig_count, unsigned long long& sig_weight, Ref<CellSlice>& signatures) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_block_signatures_pure(Ref<vm::Cell> cell_ref, unsigned& sig_count, unsigned long long& sig_weight, Ref<CellSlice>& signatures) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_block_signatures_pure(vm::CellBuilder& cb, unsigned sig_count, unsigned long long sig_weight, Ref<CellSlice> signatures) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_block_signatures_pure(Ref<vm::Cell>& cell_ref, unsigned sig_count, unsigned long long sig_weight, Ref<CellSlice> signatures) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "BlockSignaturesPure";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct BlockSignaturesPure::Record {
+  typedef BlockSignaturesPure type_class;
+  unsigned sig_count;  	// sig_count : uint32
+  unsigned long long sig_weight;  	// sig_weight : uint64
+  Ref<CellSlice> signatures;  	// signatures : HashmapE 16 CryptoSignaturePair
+  Record() = default;
+  Record(unsigned _sig_count, unsigned long long _sig_weight, Ref<CellSlice> _signatures) : sig_count(_sig_count), sig_weight(_sig_weight), signatures(std::move(_signatures)) {}
+};
+
+extern const BlockSignaturesPure t_BlockSignaturesPure;
+
+//
+// headers for type `BlockSignatures`
+//
+
+struct BlockSignatures final : TLB_Complex {
+  enum { block_signatures };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 17 };
+  struct Record {
+    typedef BlockSignatures type_class;
+    Ref<CellSlice> validator_info;  	// validator_info : ValidatorBaseInfo
+    Ref<CellSlice> pure_signatures;  	// pure_signatures : BlockSignaturesPure
+    Record() = default;
+    Record(Ref<CellSlice> _validator_info, Ref<CellSlice> _pure_signatures) : validator_info(std::move(_validator_info)), pure_signatures(std::move(_pure_signatures)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_block_signatures(vm::CellSlice& cs, Ref<CellSlice>& validator_info, Ref<CellSlice>& pure_signatures) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_block_signatures(Ref<vm::Cell> cell_ref, Ref<CellSlice>& validator_info, Ref<CellSlice>& pure_signatures) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_block_signatures(vm::CellBuilder& cb, Ref<CellSlice> validator_info, Ref<CellSlice> pure_signatures) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_block_signatures(Ref<vm::Cell>& cell_ref, Ref<CellSlice> validator_info, Ref<CellSlice> pure_signatures) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "BlockSignatures";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const BlockSignatures t_BlockSignatures;
+
+//
+// headers for type `BlockProof`
+//
+
+struct BlockProof final : TLB_Complex {
+  enum { block_proof };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 0xc3 };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_block_proof(vm::CellSlice& cs, Ref<CellSlice>& proof_for, Ref<Cell>& root, Ref<CellSlice>& signatures) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_block_proof(Ref<vm::Cell> cell_ref, Ref<CellSlice>& proof_for, Ref<Cell>& root, Ref<CellSlice>& signatures) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_block_proof(vm::CellBuilder& cb, Ref<CellSlice> proof_for, Ref<Cell> root, Ref<CellSlice> signatures) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_block_proof(Ref<vm::Cell>& cell_ref, Ref<CellSlice> proof_for, Ref<Cell> root, Ref<CellSlice> signatures) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "BlockProof";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct BlockProof::Record {
+  typedef BlockProof type_class;
+  Ref<CellSlice> proof_for;  	// proof_for : BlockIdExt
+  Ref<Cell> root;  	// root : ^Cell
+  Ref<CellSlice> signatures;  	// signatures : Maybe ^BlockSignatures
+  Record() = default;
+  Record(Ref<CellSlice> _proof_for, Ref<Cell> _root, Ref<CellSlice> _signatures) : proof_for(std::move(_proof_for)), root(std::move(_root)), signatures(std::move(_signatures)) {}
+};
+
+extern const BlockProof t_BlockProof;
+
+//
+// headers for type `ProofChain`
+//
+
+struct ProofChain final : TLB_Complex {
+  enum { chain_empty, chain_link };
+  static constexpr int cons_len_exact = 0;
+  int m_;
+  ProofChain(int m) : m_(m) {}
+  struct Record_chain_empty {
+    typedef ProofChain type_class;
+  };
+  struct Record_chain_link;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record_chain_empty& data) const;
+  bool unpack_chain_empty(vm::CellSlice& cs) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_chain_empty& data) const;
+  bool cell_unpack_chain_empty(Ref<vm::Cell> cell_ref) const;
+  bool pack(vm::CellBuilder& cb, const Record_chain_empty& data) const;
+  bool pack_chain_empty(vm::CellBuilder& cb) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_chain_empty& data) const;
+  bool cell_pack_chain_empty(Ref<vm::Cell>& cell_ref) const;
+  bool unpack(vm::CellSlice& cs, Record_chain_link& data) const;
+  bool unpack_chain_link(vm::CellSlice& cs, int& n, Ref<Cell>& root, Ref<Cell>& prev) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record_chain_link& data) const;
+  bool cell_unpack_chain_link(Ref<vm::Cell> cell_ref, int& n, Ref<Cell>& root, Ref<Cell>& prev) const;
+  bool pack(vm::CellBuilder& cb, const Record_chain_link& data) const;
+  bool pack_chain_link(vm::CellBuilder& cb, Ref<Cell> root, Ref<Cell> prev) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record_chain_link& data) const;
+  bool cell_pack_chain_link(Ref<vm::Cell>& cell_ref, Ref<Cell> root, Ref<Cell> prev) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(ProofChain " << m_ << ")";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override;
+};
+
+struct ProofChain::Record_chain_link {
+  typedef ProofChain type_class;
+  int n;  	// n : #
+  Ref<Cell> root;  	// root : ^Cell
+  Ref<Cell> prev;  	// prev : n?^(ProofChain n)
+  Record_chain_link() = default;
+  Record_chain_link(Ref<Cell> _root, Ref<Cell> _prev) : n(-1), root(std::move(_root)), prev(std::move(_prev)) {}
+};
+
+//
+// headers for type `TopBlockDescr`
+//
+
+struct TopBlockDescr final : TLB_Complex {
+  enum { top_block_descr };
+  static constexpr int cons_len_exact = 8;
+  static constexpr unsigned char cons_tag[1] = { 0xd5 };
+  struct Record;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "TopBlockDescr";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+struct TopBlockDescr::Record {
+  typedef TopBlockDescr type_class;
+  Ref<CellSlice> proof_for;  	// proof_for : BlockIdExt
+  Ref<CellSlice> signatures;  	// signatures : Maybe ^BlockSignatures
+  int len;  	// len : ## 8
+  Ref<CellSlice> chain;  	// chain : ProofChain len
+  Record() = default;
+  Record(Ref<CellSlice> _proof_for, Ref<CellSlice> _signatures, int _len, Ref<CellSlice> _chain) : proof_for(std::move(_proof_for)), signatures(std::move(_signatures)), len(_len), chain(std::move(_chain)) {}
+};
+
+extern const TopBlockDescr t_TopBlockDescr;
+
+//
+// headers for type `TopBlockDescrSet`
+//
+
+struct TopBlockDescrSet final : TLB_Complex {
+  enum { top_block_descr_set };
+  static constexpr int cons_len_exact = 32;
+  static constexpr unsigned cons_tag[1] = { 0x4ac789f3 };
+  struct Record {
+    typedef TopBlockDescrSet type_class;
+    Ref<CellSlice> collection;  	// collection : HashmapE 96 ^TopBlockDescr
+    Record() = default;
+    Record(Ref<CellSlice> _collection) : collection(std::move(_collection)) {}
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack_top_block_descr_set(vm::CellSlice& cs, Ref<CellSlice>& collection) const;
+  bool cell_unpack(Ref<vm::Cell> cell_ref, Record& data) const;
+  bool cell_unpack_top_block_descr_set(Ref<vm::Cell> cell_ref, Ref<CellSlice>& collection) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool pack_top_block_descr_set(vm::CellBuilder& cb, Ref<CellSlice> collection) const;
+  bool cell_pack(Ref<vm::Cell>& cell_ref, const Record& data) const;
+  bool cell_pack_top_block_descr_set(Ref<vm::Cell>& cell_ref, Ref<CellSlice> collection) const;
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "TopBlockDescrSet";
+  }
+  int check_tag(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const TopBlockDescrSet t_TopBlockDescrSet;
+
+// declarations of constant types used
+
+// ## 1
+extern const NatWidth t_natwidth_1;
+// ## 9
+extern const NatWidth t_natwidth_9;
+// #<= 30
+extern const NatLeq t_natleq_30;
+// Maybe Anycast
+extern const Maybe t_Maybe_Anycast;
+// int8
+extern const Int t_int8;
+// bits256
+extern const Bits t_bits256;
+// int32
+extern const Int t_int32;
+// VarUInteger 16
+extern const VarUInteger t_VarUInteger_16;
+// VarUInteger 32
+extern const VarUInteger t_VarUInteger_32;
+// HashmapE 32 (VarUInteger 32)
+extern const HashmapE t_HashmapE_32_VarUInteger_32;
+// uint64
+extern const UInt t_uint64;
+// uint32
+extern const UInt t_uint32;
+// ## 5
+extern const NatWidth t_natwidth_5;
+// Maybe (## 5)
+extern const Maybe t_Maybe_natwidth_5;
+// Maybe TickTock
+extern const Maybe t_Maybe_TickTock;
+// Maybe ^Cell
+extern const Maybe t_Maybe_Ref_Cell;
+// HashmapE 256 SimpleLib
+extern const HashmapE t_HashmapE_256_SimpleLib;
+// ^StateInit
+extern const RefT t_Ref_StateInit;
+// Either StateInit ^StateInit
+extern const Either t_Either_StateInit_Ref_StateInit;
+// Maybe (Either StateInit ^StateInit)
+extern const Maybe t_Maybe_Either_StateInit_Ref_StateInit;
+// #<= 96
+extern const NatLeq t_natleq_96;
+// Message Any
+extern const Message t_Message_Any;
+// ^(Message Any)
+extern const RefT t_Ref_Message_Any;
+// ^Transaction
+extern const RefT t_Ref_Transaction;
+// ^MsgEnvelope
+extern const RefT t_Ref_MsgEnvelope;
+// HashmapAugE 256 InMsg ImportFees
+extern const HashmapAugE t_HashmapAugE_256_InMsg_ImportFees;
+// ^InMsg
+extern const RefT t_Ref_InMsg;
+// HashmapAugE 256 OutMsg CurrencyCollection
+extern const HashmapAugE t_HashmapAugE_256_OutMsg_CurrencyCollection;
+// HashmapAugE 352 EnqueuedMsg uint64
+extern const HashmapAugE t_HashmapAugE_352_EnqueuedMsg_uint64;
+// HashmapE 96 ProcessedUpto
+extern const HashmapE t_HashmapE_96_ProcessedUpto;
+// HashmapE 320 IhrPendingSince
+extern const HashmapE t_HashmapE_320_IhrPendingSince;
+// VarUInteger 7
+extern const VarUInteger t_VarUInteger_7;
+// Maybe Grams
+extern const Maybe t_Maybe_Grams;
+// ^Account
+extern const RefT t_Ref_Account;
+// HashmapAugE 256 ShardAccount DepthBalanceInfo
+extern const HashmapAugE t_HashmapAugE_256_ShardAccount_DepthBalanceInfo;
+// uint15
+extern const UInt t_uint15;
+// Maybe ^(Message Any)
+extern const Maybe t_Maybe_Ref_Message_Any;
+// HashmapE 15 ^(Message Any)
+extern const HashmapE t_HashmapE_15_Ref_Message_Any;
+// ^[$_ in_msg:(Maybe ^(Message Any)) out_msgs:(HashmapE 15 ^(Message Any)) ]
+extern const RefT t_Ref_TYPE_1613;
+// HASH_UPDATE Account
+extern const HASH_UPDATE t_HASH_UPDATE_Account;
+// ^(HASH_UPDATE Account)
+extern const RefT t_Ref_HASH_UPDATE_Account;
+// ^TransactionDescr
+extern const RefT t_Ref_TransactionDescr;
+// HashmapAug 64 ^Transaction CurrencyCollection
+extern const HashmapAug t_HashmapAug_64_Ref_Transaction_CurrencyCollection;
+// HashmapAugE 256 AccountBlock CurrencyCollection
+extern const HashmapAugE t_HashmapAugE_256_AccountBlock_CurrencyCollection;
+// VarUInteger 3
+extern const VarUInteger t_VarUInteger_3;
+// Maybe (VarUInteger 3)
+extern const Maybe t_Maybe_VarUInteger_3;
+// Maybe int32
+extern const Maybe t_Maybe_int32;
+// ^[$_ gas_used:(VarUInteger 7) gas_limit:(VarUInteger 7) gas_credit:(Maybe (VarUInteger 3)) mode:int8 exit_code:int32 exit_arg:(Maybe int32) vm_steps:uint32 vm_init_state_hash:bits256 vm_final_state_hash:bits256 ]
+extern const RefT t_Ref_TYPE_1624;
+// uint16
+extern const UInt t_uint16;
+// Maybe TrStoragePhase
+extern const Maybe t_Maybe_TrStoragePhase;
+// Maybe TrCreditPhase
+extern const Maybe t_Maybe_TrCreditPhase;
+// ^TrActionPhase
+extern const RefT t_Ref_TrActionPhase;
+// Maybe ^TrActionPhase
+extern const Maybe t_Maybe_Ref_TrActionPhase;
+// Maybe TrBouncePhase
+extern const Maybe t_Maybe_TrBouncePhase;
+// ## 6
+extern const NatWidth t_natwidth_6;
+// ## 8
+extern const NatWidth t_natwidth_8;
+// MessageRelaxed Any
+extern const MessageRelaxed t_MessageRelaxed_Any;
+// ^(MessageRelaxed Any)
+extern const RefT t_Ref_MessageRelaxed_Any;
+// #<= 60
+extern const NatLeq t_natleq_60;
+// ^OutMsgQueueInfo
+extern const RefT t_Ref_OutMsgQueueInfo;
+// ^ShardAccounts
+extern const RefT t_Ref_ShardAccounts;
+// HashmapE 256 LibDescr
+extern const HashmapE t_HashmapE_256_LibDescr;
+// Maybe BlkMasterInfo
+extern const Maybe t_Maybe_BlkMasterInfo;
+// ^[$_ overload_history:uint64 underload_history:uint64 total_balance:CurrencyCollection total_validator_fees:CurrencyCollection libraries:(HashmapE 256 LibDescr) master_ref:(Maybe BlkMasterInfo) ]
+extern const RefT t_Ref_TYPE_1637;
+// ^McStateExtra
+extern const RefT t_Ref_McStateExtra;
+// Maybe ^McStateExtra
+extern const Maybe t_Maybe_Ref_McStateExtra;
+// ^ShardStateUnsplit
+extern const RefT t_Ref_ShardStateUnsplit;
+// Hashmap 256 True
+extern const Hashmap t_Hashmap_256_True;
+// ^BlkMasterInfo
+extern const RefT t_Ref_BlkMasterInfo;
+// BlkPrevInfo 0
+extern const BlkPrevInfo t_BlkPrevInfo_0;
+// ^(BlkPrevInfo 0)
+extern const RefT t_Ref_BlkPrevInfo_0;
+// ^ExtBlkRef
+extern const RefT t_Ref_ExtBlkRef;
+// ^BlockInfo
+extern const RefT t_Ref_BlockInfo;
+// ^ValueFlow
+extern const RefT t_Ref_ValueFlow;
+// MERKLE_UPDATE ShardState
+extern const MERKLE_UPDATE t_MERKLE_UPDATE_ShardState;
+// ^(MERKLE_UPDATE ShardState)
+extern const RefT t_Ref_MERKLE_UPDATE_ShardState;
+// ^BlockExtra
+extern const RefT t_Ref_BlockExtra;
+// ^InMsgDescr
+extern const RefT t_Ref_InMsgDescr;
+// ^OutMsgDescr
+extern const RefT t_Ref_OutMsgDescr;
+// ^ShardAccountBlocks
+extern const RefT t_Ref_ShardAccountBlocks;
+// ^McBlockExtra
+extern const RefT t_Ref_McBlockExtra;
+// Maybe ^McBlockExtra
+extern const Maybe t_Maybe_Ref_McBlockExtra;
+// ^[$_ from_prev_blk:CurrencyCollection to_next_blk:CurrencyCollection imported:CurrencyCollection exported:CurrencyCollection ]
+extern const RefT t_Ref_TYPE_1647;
+// ^[$_ fees_imported:CurrencyCollection recovered:CurrencyCollection created:CurrencyCollection minted:CurrencyCollection ]
+extern const RefT t_Ref_TYPE_1648;
+// ## 3
+extern const NatWidth t_natwidth_3;
+// BinTree ShardDescr
+extern const BinTree t_BinTree_ShardDescr;
+// ^(BinTree ShardDescr)
+extern const RefT t_Ref_BinTree_ShardDescr;
+// HashmapE 32 ^(BinTree ShardDescr)
+extern const HashmapE t_HashmapE_32_Ref_BinTree_ShardDescr;
+// HashmapAugE 96 ShardFeeCreated ShardFeeCreated
+extern const HashmapAugE t_HashmapAugE_96_ShardFeeCreated_ShardFeeCreated;
+// Hashmap 32 ^Cell
+extern const Hashmap t_Hashmap_32_Ref_Cell;
+// ^(Hashmap 32 ^Cell)
+extern const RefT t_Ref_Hashmap_32_Ref_Cell;
+// HashmapAugE 32 KeyExtBlkRef KeyMaxLt
+extern const HashmapAugE t_HashmapAugE_32_KeyExtBlkRef_KeyMaxLt;
+// HashmapE 256 CreatorStats
+extern const HashmapE t_HashmapE_256_CreatorStats;
+// ## 16
+extern const NatWidth t_natwidth_16;
+// Maybe ExtBlkRef
+extern const Maybe t_Maybe_ExtBlkRef;
+// ^[$_ flags:(## 16) {<= flags 1} validator_info:ValidatorInfo prev_blocks:OldMcBlocksInfo after_key_block:Bool last_key_block:(Maybe ExtBlkRef) block_create_stats:flags.0?BlockCreateStats ]
+extern const RefT t_Ref_TYPE_1665;
+// ^SignedCertificate
+extern const RefT t_Ref_SignedCertificate;
+// HashmapE 16 CryptoSignaturePair
+extern const HashmapE t_HashmapE_16_CryptoSignaturePair;
+// Maybe ^InMsg
+extern const Maybe t_Maybe_Ref_InMsg;
+// ^[$_ prev_blk_signatures:(HashmapE 16 CryptoSignaturePair) recover_create_msg:(Maybe ^InMsg) mint_msg:(Maybe ^InMsg) ]
+extern const RefT t_Ref_TYPE_1673;
+// Hashmap 16 ValidatorDescr
+extern const Hashmap t_Hashmap_16_ValidatorDescr;
+// Hashmap 32 True
+extern const Hashmap t_Hashmap_32_True;
+// ## 12
+extern const NatWidth t_natwidth_12;
+// ## 32
+extern const NatWidth t_natwidth_32;
+// ## 13
+extern const NatWidth t_natwidth_13;
+// HashmapE 32 WorkchainDescr
+extern const HashmapE t_HashmapE_32_WorkchainDescr;
+// Hashmap 32 StoragePrices
+extern const Hashmap t_Hashmap_32_StoragePrices;
+// HashmapE 256 True
+extern const HashmapE t_HashmapE_256_True;
+// ^ValidatorTempKey
+extern const RefT t_Ref_ValidatorTempKey;
+// HashmapE 256 ValidatorSignedTempKey
+extern const HashmapE t_HashmapE_256_ValidatorSignedTempKey;
+// ^BlockSignatures
+extern const RefT t_Ref_BlockSignatures;
+// Maybe ^BlockSignatures
+extern const Maybe t_Maybe_Ref_BlockSignatures;
+// ^TopBlockDescr
+extern const RefT t_Ref_TopBlockDescr;
+// HashmapE 96 ^TopBlockDescr
+extern const HashmapE t_HashmapE_96_Ref_TopBlockDescr;
+
+} // namespace gen
+
+} // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/block-binlog.h b/submodules/ton/tonlib-src/crypto/block/block-binlog.h
new file mode 100644
index 0000000000..48346e77fc
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/block-binlog.h
@@ -0,0 +1,111 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/utils/int_types.h"
+#include "ton/ton-types.h"
+
+#include <ctime>
+
+namespace block {
+
+namespace log {
+
+#pragma pack(push, 4)
+
+struct Start {
+  static constexpr unsigned tag = 0x0442446b;
+  static constexpr unsigned log_type = 0x290100;
+  unsigned tag_field;
+  unsigned type_field;
+  unsigned created_at;
+  unsigned char zerostate_root_hash[32];
+  Start(const RootHash& hash, unsigned _now = 0)
+      : tag_field(tag), type_field(log_type), created_at(_now ? _now : (unsigned)std::time(nullptr)) {
+    td::as<RootHash>(zerostate_root_hash) = hash;
+  }
+};
+
+struct SetZeroState {
+  static constexpr unsigned tag = 0x63ab3cd9;
+  unsigned tag_field;
+  unsigned flags;
+  long long file_size;
+  unsigned char file_hash[32];
+  unsigned char root_hash[32];
+  SetZeroState(const RootHash& rhash, const FileHash& fhash, unsigned long long _fsize, unsigned _flags = 0)
+      : tag_field(tag), flags(_flags), file_size(_fsize) {
+    td::as<FileHash>(file_hash) = fhash;
+    td::as<RootHash>(root_hash) = rhash;
+  }
+};
+
+struct NewBlock {
+  static constexpr unsigned tag = 0x19f4bc63;
+  unsigned tag_field;
+  unsigned flags;  // lower 8 bits = authority
+  int workchain;
+  unsigned seqno;
+  unsigned long long shard;
+  long long file_size;
+  unsigned char file_hash[32];
+  unsigned char root_hash[32];
+  unsigned char last_bytes[8];
+  NewBlock(const ton::BlockId& block, const RootHash& rhash, const FileHash& fhash, unsigned long long _fsize,
+           unsigned _flags)
+      : tag_field(tag)
+      , flags(_flags)
+      , workchain(block.workchain)
+      , seqno(block.seqno)
+      , shard(block.shard)
+      , file_size(_fsize) {
+    td::as<FileHash>(file_hash) = fhash;
+    td::as<RootHash>(root_hash) = rhash;
+    td::as<unsigned long long>(last_bytes) = 0;
+  }
+};
+
+struct NewState {
+  static constexpr unsigned tag = 0x4190a21f;
+  unsigned tag_field;
+  unsigned flags;  // lower 8 bits = authority
+  int workchain;
+  unsigned seqno;
+  unsigned long long shard;
+  long long file_size;
+  unsigned char file_hash[32];
+  unsigned char root_hash[32];
+  unsigned char last_bytes[8];
+  NewState(const ton::BlockId& state, const RootHash& rhash, const FileHash& fhash, unsigned long long _fsize,
+           unsigned _flags)
+      : tag_field(tag)
+      , flags(_flags)
+      , workchain(state.workchain)
+      , seqno(state.seqno)
+      , shard(state.shard)
+      , file_size(_fsize) {
+    td::as<FileHash>(file_hash) = fhash;
+    td::as<RootHash>(root_hash) = rhash;
+    td::as<unsigned long long>(last_bytes) = 0;
+  }
+};
+
+#pragma pack(pop)
+
+}  // namespace log
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/block-db-impl.h b/submodules/ton/tonlib-src/crypto/block/block-db-impl.h
new file mode 100644
index 0000000000..868206d84d
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/block-db-impl.h
@@ -0,0 +1,135 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <string>
+#include <map>
+#include "vm/cells.h"
+#include "block/Binlog.h"
+#include "block/block-db.h"
+#include "block/block-binlog.h"
+
+namespace block {
+using td::Ref;
+
+/*
+ * 
+ *   BLOCK DATABASE
+ * 
+ */
+
+class BlockDbImpl;
+
+class BlockBinlogCallback : public BinlogCallback {
+  BlockDbImpl& db;
+  td::Status init_new_binlog(BinlogBuffer& bb) override;
+  int replay_log_event(BinlogBuffer& bb, const unsigned* ptr, std::size_t len, unsigned long long log_pos) override;
+  int replay(const block::log::Start& lev, unsigned long long log_pos) const;
+  int replay(const block::log::SetZeroState& lev, unsigned long long log_pos) const;
+  int replay(const block::log::NewBlock& lev, unsigned long long log_pos) const;
+  int replay(const block::log::NewState& lev, unsigned long long log_pos) const;
+  template <typename T>
+  inline int try_interpret(const unsigned* ptr, std::size_t len, unsigned long long log_pos);
+
+ public:
+  BlockBinlogCallback(BlockDbImpl& _db) : db(_db) {
+  }
+};
+
+template <typename T>
+inline int BlockBinlogCallback::try_interpret(const unsigned* ptr, std::size_t len, unsigned long long log_pos) {
+  if (len < sizeof(T)) {
+    return 0x80000000 + sizeof(T);
+  } else {
+    int res = replay(*reinterpret_cast<const T*>(ptr), log_pos);
+    return res >= 0 ? sizeof(T) : res;
+  }
+}
+
+class BlockDbImpl final : public BlockDb {
+  int status;
+  bool allow_uninit;
+  bool created;
+  int depth;
+  std::unique_ptr<ZerostateInfo> zstate;
+  std::string base_dir;
+  std::string binlog_name;
+  BinlogBuffer bb;
+  ton::Bits256 zstate_rhash, zstate_fhash;
+  unsigned created_at;
+  std::map<ton::FileHash, td::BufferSlice> file_cache;
+  std::map<ton::BlockId, Ref<FileInfo>> block_info;
+  std::map<ton::BlockId, Ref<FileInfo>> state_info;
+  //
+  td::Result<int> do_init();
+
+ public:
+  enum FMode {
+    chk_none = 0,
+    chk_if_exists = 1,
+    fail_if_exists = 2,
+    overwrite = 4,
+    chk_size_only = 16,
+    chk_file_hash = 32
+  };
+  static constexpr const char* default_binlog_name = "blockdb";
+  static constexpr const char* default_binlog_suffix = ".bin";
+  static constexpr int default_depth = 4;
+  BlockDbImpl(td::Result<int>& _res, std::string _base_dir, std::unique_ptr<ZerostateInfo> _zstate = nullptr,
+              bool _allow_uninit = false, int _depth = 4, std::string _binlog_name = "");
+  ~BlockDbImpl();
+  bool ok() const {
+    return status >= 0;
+  }
+  bool initialized() const {
+    return status != 0;
+  }
+  bool init_ok() const {
+    return status > 0;
+  }
+
+ protected:
+  friend class BlockBinlogCallback;
+  td::Ref<FileInfo> zerostate;
+  td::Status init_from_zstate();
+  td::Status update_block_info(Ref<FileInfo> blk_info);
+  td::Status update_state_info(Ref<FileInfo> state);
+
+ private:
+  std::string compute_db_filename(const FileHash& file_hash) const;
+  std::string compute_db_tmp_filename(const FileHash& file_hash, int i, bool makedirs) const;
+  td::Status save_db_file(const FileHash& file_hash, const td::BufferSlice& data, int fmode = 0);
+  td::Status load_data(FileInfo& file_info, bool force = false);
+  // actor BlockDb implementation
+  void get_top_block_id(ton::ShardIdFull shard, int authority, td::Promise<ton::BlockIdExt> promise) override;
+  void get_top_block_state_id(ton::ShardIdFull shard, int authority, td::Promise<ton::BlockIdExt> promise) override;
+  void get_block_by_id(ton::BlockId blk_id, bool need_data, td::Promise<td::Ref<FileInfo>> promise) override;
+  void get_state_by_id(ton::BlockId blk_id, bool need_data, td::Promise<td::Ref<FileInfo>> promise) override;
+  void get_out_queue_info_by_id(ton::BlockId blk_id, td::Promise<td::Ref<OutputQueueInfoDescr>> promise) override;
+  void get_object_by_file_hash(FileHash file_hash, bool need_data, bool force_file_load,
+                               td::Promise<td::Ref<FileInfo>> promise) override;
+  void get_object_by_root_hash(RootHash root_hash, bool need_data, bool force_file_load,
+                               td::Promise<td::Ref<FileInfo>> promise) override;
+  void save_new_block(ton::BlockIdExt blk_id, td::BufferSlice data, int authority,
+                      td::Promise<td::Unit> promise) override;
+  void save_new_state(ton::BlockIdExt state_id, td::BufferSlice data, int authority,
+                      td::Promise<td::Unit> promise) override;
+  bool file_cache_insert(const FileHash& file_hash, const td::BufferSlice& data, int mode = 0);
+};
+
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/block-db.cpp b/submodules/ton/tonlib-src/crypto/block/block-db.cpp
new file mode 100644
index 0000000000..f2018b8087
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/block-db.cpp
@@ -0,0 +1,835 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "block-db.h"
+#include "block-db-impl.h"
+#include "block-binlog.h"
+#include "td/utils/common.h"
+#include "td/utils/crypto.h"
+#include "td/utils/format.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/FileFd.h"
+#include "td/utils/port/path.h"
+#include "td/utils/filesystem.h"
+#include "vm/cellslice.h"
+#include "vm/boc.h"
+#include "vm/db/StaticBagOfCellsDb.h"
+
+#include <limits>
+
+namespace block {
+
+//static constexpr std::string default_binlog_name = "blockdb";
+//static constexpr std::string default_binlog_suffix = ".bin";
+
+bool parse_hash_string(std::string arg, RootHash& res) {
+  if (arg.size() != 64) {
+    res.set_zero();
+    return false;
+  }
+  int f = 1;
+  unsigned char* ptr = res.data();
+  for (char c : arg) {
+    f <<= 4;
+    if (c >= '0' && c <= '9') {
+      f += c - '0';
+    } else {
+      c |= 0x20;
+      if (c >= 'a' && c <= 'f') {
+        f += c - ('a' - 10);
+      } else {
+        res.set_zero();
+        return false;
+      }
+    }
+    if (f >= 0x100) {
+      *ptr++ = (unsigned char)f;
+      f = 1;
+    }
+  }
+  return true;
+}
+
+td::Result<td::BufferSlice> load_binary_file(std::string filename, td::int64 max_size) {
+  //TODO: use td::read_file
+  auto res = [&]() -> td::Result<td::BufferSlice> {
+    TRY_RESULT(fd, td::FileFd::open(filename, td::FileFd::Read));
+    TRY_RESULT(stat, fd.stat());
+    if (!stat.is_reg_) {
+      return td::Status::Error("file is not regular");
+    }
+    td::int64 size = stat.size_;
+    if (!size) {
+      return td::Status::Error("file is empty");
+    }
+    if ((max_size && size > max_size) || static_cast<td::uint64>(size) > std::numeric_limits<std::size_t>::max()) {
+      return td::Status::Error("file is too long");
+    }
+    td::BufferSlice res(td::narrow_cast<std::size_t>(size));
+    TRY_RESULT(r, fd.read(res.as_slice()));
+    if (r != static_cast<td::uint64>(size)) {
+      return td::Status::Error(PSLICE() << "read " << r << " bytes out of " << size);
+    }
+    return std::move(res);
+  }();
+  LOG_IF(ERROR, res.is_error()) << "error reading file `" << filename << "` : " << res.error();
+  return res;
+}
+
+td::Status save_binary_file(std::string filename, const td::BufferSlice& data, unsigned long long max_size) {
+  //TODO: use td::write_file
+  auto status = [&]() {
+    if (max_size && data.size() > max_size) {
+      return td::Status::Error("contents too long");
+    }
+    auto size = data.size();
+    TRY_RESULT(to_file, td::FileFd::open(filename, td::FileFd::CreateNew | td::FileFd::Write));
+    TRY_RESULT(written, to_file.write(data));
+    if (written != static_cast<size_t>(size)) {
+      return td::Status::Error(PSLICE() << "written " << written << " bytes instead of " << size);
+    }
+    to_file.close();
+    return td::Status::OK();
+  }();
+  LOG_IF(ERROR, status.is_error()) << "error writing new file `" << filename << "` : " << status;
+  return status;
+}
+
+FileHash compute_file_hash(const td::BufferSlice& data) {
+  ton::Bits256 data_hash;
+  td::sha256(data, td::MutableSlice{data_hash.data(), 32});
+  return data_hash;
+}
+
+FileHash compute_file_hash(td::Slice data) {
+  ton::Bits256 data_hash;
+  td::sha256(data, td::MutableSlice{data_hash.data(), 32});
+  return data_hash;
+}
+
+/*
+ * 
+ *   ZEROSTATE CONFIGURATION
+ * 
+ */
+
+td::Status ZerostateInfo::base_check() {
+  if (!has_data()) {
+    return td::Status::OK();
+  }
+  auto data_hash = compute_file_hash(data);
+  if (!has_file_hash()) {
+    file_hash = data_hash;
+  } else if (file_hash != data_hash) {
+    return td::Status::Error("zerostate file hash mismatch");
+  }
+  vm::BagOfCells boc;
+  auto res = boc.deserialize(data);
+  if (!res.is_ok() || boc.get_root_count() != 1) {
+    return td::Status::Error("zerostate is not a valid bag of cells");  // not a valid bag-of-Cells
+  }
+  data_hash = boc.get_root_cell()->get_hash().bits();
+  if (!has_root_hash()) {
+    root_hash = data_hash;
+  } else if (root_hash != data_hash) {
+    return td::Status::Error("zerostate root hash mismatch");
+  }
+  return td::Status::OK();
+}
+
+/*
+ * 
+ *   BLOCK DATABASE 
+ * 
+ */
+
+std::string compute_db_filename(std::string base_dir, const FileHash& file_hash, int depth) {
+  static const char hex_digits[] = "0123456789ABCDEF";
+  assert(depth >= 0 && depth <= 8);
+  std::string res = std::move(base_dir);
+  res.reserve(res.size() + 32 + depth * 3 + 4);
+  for (int i = 0; i < depth; i++) {
+    unsigned u = file_hash.data()[i];
+    res.push_back(hex_digits[u >> 4]);
+    res.push_back(hex_digits[u & 15]);
+    res.push_back('/');
+  }
+  for (int i = 0; i < 32; i++) {
+    unsigned u = file_hash.data()[i];
+    res.push_back(hex_digits[u >> 4]);
+    res.push_back(hex_digits[u & 15]);
+  }
+  res += ".boc";
+  return res;
+}
+
+std::string BlockDbImpl::compute_db_filename(const FileHash& file_hash) const {
+  return block::compute_db_filename(base_dir, file_hash, depth);
+}
+
+std::string compute_db_tmp_filename(std::string base_dir, const FileHash& file_hash, int i, bool makedirs, int depth) {
+  static const char hex_digits[] = "0123456789ABCDEF";
+  assert(depth >= 0 && depth <= 8);
+  std::string res = std::move(base_dir);
+  res.reserve(res.size() + 32 + depth * 3 + 4);
+  for (int j = 0; j < depth; j++) {
+    unsigned u = file_hash.data()[j];
+    res.push_back(hex_digits[u >> 4]);
+    res.push_back(hex_digits[u & 15]);
+    res.push_back('/');
+    if (makedirs) {
+      td::mkdir(res, 0755).ignore();
+    }
+  }
+  for (int j = 0; j < 32; j++) {
+    unsigned u = file_hash.data()[j];
+    res.push_back(hex_digits[u >> 4]);
+    res.push_back(hex_digits[u & 15]);
+  }
+  res += ".tmp";
+  if (i > 0) {
+    if (i < 10) {
+      res.push_back((char)('0' + i));
+    } else {
+      res.push_back((char)('0' + i / 10));
+      res.push_back((char)('0' + i % 10));
+    }
+  }
+  return res;
+}
+
+std::string BlockDbImpl::compute_db_tmp_filename(const FileHash& file_hash, int i, bool makedirs) const {
+  return block::compute_db_tmp_filename(base_dir, file_hash, i, makedirs, depth);
+}
+
+bool BlockDbImpl::file_cache_insert(const FileHash& file_hash, const td::BufferSlice& data, int mode) {
+  auto it = file_cache.find(file_hash);
+  if (it != file_cache.end()) {
+    // found
+    return true;
+  }
+  auto res = file_cache.emplace(file_hash, data.clone());
+  return res.second;
+}
+
+td::Status BlockDbImpl::save_db_file(const FileHash& file_hash, const td::BufferSlice& data, int fmode) {
+  if (fmode & FMode::chk_file_hash && file_hash != compute_file_hash(data)) {
+    return td::Status::Error("file hash passed for creation of a new file does not match contents");
+  }
+  std::string filename = compute_db_filename(file_hash);
+  bool overwrite = false;
+  auto r_stat = td::stat(filename);
+  if (r_stat.is_ok()) {
+    auto stat = r_stat.move_as_ok();
+    // file exists
+    if (fmode & FMode::fail_if_exists) {
+      return td::Status::Error(PSLICE() << "file " << filename << " cannot be created, it already exists");
+    }
+    if (!(fmode & (FMode::chk_if_exists | FMode::overwrite))) {
+      file_cache_insert(file_hash, data);
+      return td::Status::OK();
+    }
+    if (fmode & FMode::chk_if_exists) {
+      if (stat.size_ != (long long)data.size()) {
+        LOG(ERROR) << "file " << filename << " already exists with wrong content";
+        if (!(fmode & FMode::overwrite)) {
+          return td::Status::Error(PSLICE() << "file " << filename << " already exists with wrong content");
+        }
+      } else if (fmode & FMode::chk_size_only) {
+        file_cache_insert(file_hash, data);
+        return td::Status::OK();
+      } else {
+        auto res = load_binary_file(filename);
+        if (res.is_error()) {
+          return res.move_as_error();
+        }
+        auto old_contents = res.move_as_ok();
+        if (old_contents.size() != data.size() || old_contents.as_slice() != data.as_slice()) {
+          LOG(ERROR) << "file " << filename << " already exists with wrong content";
+          if (!(fmode & FMode::overwrite)) {
+            return td::Status::Error(PSLICE() << "file " << filename << " already exists with wrong content");
+          }
+        } else {
+          file_cache_insert(file_hash, data);
+          return td::Status::OK();
+        }
+      }
+    }
+    overwrite = true;
+  }
+  std::string tmp_filename;
+  for (int i = 0; i < 10; i++) {
+    tmp_filename = compute_db_tmp_filename(file_hash, i, true);
+    auto res = save_binary_file(tmp_filename, data);
+    if (res.is_ok()) {
+      break;
+    }
+    if (i == 9) {
+      return res;
+    }
+  }
+  auto rename_status = td::rename(tmp_filename, filename);
+  if (rename_status.is_error()) {
+    td::unlink(tmp_filename).ignore();
+    LOG(ERROR) << rename_status;
+    return rename_status;
+  }
+  if (overwrite) {
+    LOG(DEBUG) << "database file `" << filename << "` overwritten, " << data.size() << " bytes";
+  } else {
+    LOG(DEBUG) << "new database file `" << filename << "` created, " << data.size() << " bytes";
+  }
+  file_cache_insert(file_hash, data);
+  return td::Status::OK();
+}
+
+td::Result<td::actor::ActorOwn<BlockDb>> BlockDb::create_block_db(std::string base_dir,
+                                                                  std::unique_ptr<ZerostateInfo> zstate,
+                                                                  bool allow_uninit, int depth,
+                                                                  std::string binlog_name) {
+  using td::actor::ActorId;
+  using td::actor::ActorOwn;
+  td::Result<int> res;
+  ActorOwn<BlockDbImpl> actor =
+      td::actor::create_actor<BlockDbImpl>(td::actor::ActorOptions().with_name("BlockDB"), res, base_dir,
+                                           std::move(zstate), allow_uninit, depth, binlog_name);
+  if (res.is_error()) {
+    return std::move(res).move_as_error();
+  } else {
+    return std::move(actor);
+  }
+}
+
+BlockDbImpl::BlockDbImpl(td::Result<int>& _res, std::string _base_dir, std::unique_ptr<ZerostateInfo> _zstate,
+                         bool _allow_uninit, int _depth, std::string _binlog_name)
+    : status(0)
+    , allow_uninit(_allow_uninit)
+    , created(false)
+    , depth(_depth)
+    , zstate(std::move(_zstate))
+    , base_dir(_base_dir)
+    , binlog_name(_binlog_name)
+    , bb(std::unique_ptr<BinlogCallback>(new BlockBinlogCallback(*this)))
+    , created_at(0) {
+  auto res = do_init();
+  status = (res.is_ok() && res.ok() > 0 ? res.ok() : -1);
+  if (res.is_error()) {
+    _res = std::move(res);
+  } else {
+    _res = res.move_as_ok();
+  }
+}
+
+td::Result<int> BlockDbImpl::do_init() {
+  if (base_dir.empty()) {
+    return td::Status::Error("block database cannot have empty base directory");
+  }
+  if (depth < 0 || depth >= 8) {
+    return td::Status::Error("block database directory tree depth must be in range 0..8");
+  }
+  if (base_dir.back() != '/') {
+    base_dir.push_back('/');
+  }
+  if (binlog_name.empty()) {
+    binlog_name = default_binlog_name;
+  }
+  bool f = true;
+  for (char c : binlog_name) {
+    if (c == '.') {
+      f = false;
+    } else if (c == '/') {
+      f = true;
+    }
+  }
+  if (f) {
+    binlog_name += default_binlog_suffix;
+  }
+  if (binlog_name.at(0) != '/') {
+    binlog_name = base_dir + binlog_name;
+  }
+  if (zstate) {
+    if (!zstate->has_data() && zstate->has_filename()) {
+      auto data = load_binary_file(zstate->filename, 1 << 20);
+      if (data.is_error()) {
+        return data.move_as_error();
+      }
+      zstate->data = data.move_as_ok();
+    }
+    auto res = zstate->base_check();
+    if (res.is_error()) {
+      return res;
+    }
+  }
+  try {
+    auto res = bb.set_binlog(binlog_name, allow_uninit ? 3 : 1);
+    if (res.is_error()) {
+      return res;
+    }
+  } catch (BinlogBuffer::BinlogError& err) {
+    return td::Status::Error(-2, std::string{"error while initializing block database binlog: "} + err.msg);
+  } catch (BinlogBuffer::InterpretError& err) {
+    return td::Status::Error(-3, std::string{"error while interpreting block database binlog: "} + err.msg);
+  }
+  return created;
+}
+
+BlockDbImpl::~BlockDbImpl() {
+}
+
+td::Status BlockDbImpl::init_from_zstate() {
+  if (!zstate) {
+    return td::Status::Error("no zero state provided, cannot initialize from scratch");
+  }
+  if (!zstate->has_data()) {
+    if (zstate->has_filename() || zstate->has_file_hash()) {
+      if (!zstate->has_filename()) {
+        zstate->filename = compute_db_filename(zstate->file_hash);
+      }
+      auto res = load_binary_file(zstate->filename, 1 << 20);
+      if (res.is_error()) {
+        return res.move_as_error();
+      }
+      zstate->data = res.move_as_ok();
+    } else {
+      return td::Status::Error("cannot load zero state for block DB creation");
+    }
+  }
+  auto res = zstate->base_check();
+  if (res.is_error()) {
+    return res;
+  }
+  assert(zstate->has_file_hash() && zstate->has_root_hash());
+  res = save_db_file(zstate->file_hash, zstate->data, FMode::chk_if_exists | FMode::chk_file_hash);
+  if (res.is_error()) {
+    return res;
+  }
+  return res;
+}
+
+td::Status BlockBinlogCallback::init_new_binlog(BinlogBuffer& bb) {
+  auto res = db.init_from_zstate();
+  if (res.is_error()) {
+    return res;
+  }
+  auto lev = bb.alloc<log::Start>(db.zstate->root_hash);
+  assert(!lev.get_log_pos());
+  auto lev2 = bb.alloc<log::SetZeroState>(db.zstate->root_hash, db.zstate->file_hash, db.zstate->data.size());
+  lev.commit();
+  lev2.commit();  // TODO: introduce multi-commit bb.commit(lev, lev2)
+  bb.flush(3);
+  db.created = true;
+  return td::Status::OK();
+}
+
+#define REPLAY_CASE(__T) \
+  case __T::tag:         \
+    return try_interpret<__T>(ptr, len, log_pos);
+
+int BlockBinlogCallback::replay_log_event(BinlogBuffer& bb, const unsigned* ptr, std::size_t len,
+                                          unsigned long long log_pos) {
+  assert(len >= 4);
+  LOG(DEBUG) << "replay_log_event(" << len << ", " << log_pos << ", " << *ptr << ")";
+  switch (*ptr) {
+    REPLAY_CASE(log::Start);
+    REPLAY_CASE(log::SetZeroState);
+    REPLAY_CASE(log::NewBlock);
+    REPLAY_CASE(log::NewState);
+  }
+  std::ostringstream ss;
+  ss << "unknown binlog event 0x" << std::hex << *ptr << std::dec;
+  LOG(ERROR) << ss.str() << " at position " << log_pos;
+  throw BinlogBuffer::InterpretError{ss.str()};
+}
+
+#undef REPLAY_CASE
+
+int BlockBinlogCallback::replay(const log::Start& lev, unsigned long long log_pos) const {
+  LOG(DEBUG) << "in replay(Start{" << lev.tag_field << ", " << lev.type_field << ", " << lev.created_at << "})";
+  if (lev.type_field != lev.log_type) {
+    throw BinlogBuffer::InterpretError{(PSLICE() << "unsupported binlog type " << lev.type_field).str()};
+  }
+  if (log_pos) {
+    throw BinlogBuffer::InterpretError{"LEV_START can only be the very first record in a binlog"};
+  }
+  db.zstate_rhash = lev.zerostate_root_hash;
+  db.created_at = lev.created_at;
+  if (db.zstate) {
+    if (!db.zstate->has_root_hash()) {
+      db.zstate->root_hash = db.zstate_rhash;
+    } else if (db.zstate->root_hash != db.zstate_rhash) {
+      throw BinlogBuffer::InterpretError{PSTRING() << "zerostate hash mismatch: in binlog " << db.zstate_rhash.to_hex()
+                                                   << ", required " << db.zstate->root_hash.to_hex()};
+    }
+  }
+  return 0;  // ok
+}
+
+int BlockBinlogCallback::replay(const log::SetZeroState& lev, unsigned long long log_pos) const {
+  LOG(DEBUG) << "in replay(SetZeroState)";
+  // LOG(DEBUG) << "db.zstate_rhash = " << db.zstate_rhash.to_hex();
+  if (db.zstate_rhash != td::ConstBitPtr{lev.root_hash}) {
+    throw BinlogBuffer::InterpretError{std::string{"SetZeroState: zerostate root hash mismatch: in binlog "} +
+                                       ton::Bits256{lev.root_hash}.to_hex() + ", required " + db.zstate_rhash.to_hex()};
+  }
+  db.zerostate = td::Ref<FileInfo>{true,
+                                   FileType::state,
+                                   ton::BlockId{ton::masterchainId, 1ULL << 63, 0},
+                                   0,
+                                   td::as<FileHash>(lev.file_hash),
+                                   td::as<RootHash>(lev.root_hash),
+                                   lev.file_size};
+  return 0;  // ok
+}
+
+int BlockBinlogCallback::replay(const log::NewBlock& lev, unsigned long long log_pos) const {
+  LOG(DEBUG) << "in replay(NewBlock)";
+  if (!lev.seqno || lev.workchain == ton::workchainInvalid) {
+    return -1;
+  }
+  ton::BlockId blkid{lev.workchain, lev.shard, lev.seqno};
+  auto blk_info = td::Ref<FileInfo>{true,
+                                    FileType::block,
+                                    blkid,
+                                    lev.flags & 0xff,
+                                    td::as<FileHash>(lev.file_hash),
+                                    td::as<RootHash>(lev.root_hash),
+                                    lev.file_size};
+  auto res = db.update_block_info(blk_info);
+  if (res.is_error()) {
+    LOG(ERROR) << "cannot update block information in the local DB: " << res.to_string();
+    return -1;
+  } else {
+    return 0;  // ok
+  }
+}
+
+int BlockBinlogCallback::replay(const log::NewState& lev, unsigned long long log_pos) const {
+  LOG(DEBUG) << "in replay(NewState)";
+  if (!lev.seqno || lev.workchain == ton::workchainInvalid) {
+    return -1;
+  }
+  ton::BlockId id{lev.workchain, lev.shard, lev.seqno};
+  auto state_info = td::Ref<FileInfo>{true,
+                                      FileType::state,
+                                      id,
+                                      lev.flags & 0xff,
+                                      td::as<FileHash>(lev.file_hash),
+                                      td::as<RootHash>(lev.root_hash),
+                                      lev.file_size};
+  auto res = db.update_state_info(state_info);
+  if (res.is_error()) {
+    LOG(ERROR) << "cannot update shardchain state information in the local DB: " << res.to_string();
+    return -1;
+  } else {
+    return 0;  // ok
+  }
+}
+
+td::Status BlockDbImpl::update_block_info(Ref<FileInfo> blk_info) {
+  auto it = block_info.find(blk_info->blk.id);
+  if (it != block_info.end()) {
+    // already exists
+    if (it->second->blk.file_hash != blk_info->blk.file_hash || it->second->blk.root_hash != blk_info->blk.root_hash) {
+      return td::Status::Error(-666, std::string{"fatal error in block DB: block "} + blk_info->blk.id.to_str() +
+                                         " has two records with different file or root hashes");
+    } else {
+      return td::Status::OK();
+    }
+  } else {
+    auto id = blk_info->blk.id;
+    auto res = block_info.emplace(std::move(id), std::move(blk_info));
+    if (res.second) {
+      return td::Status::OK();
+    } else {
+      return td::Status::Error(-666, "cannot insert block information into DB");
+    }
+  }
+}
+
+td::Status BlockDbImpl::update_state_info(Ref<FileInfo> state) {
+  auto it = state_info.find(state->blk.id);
+  if (it != state_info.end()) {
+    // already exists
+    if (it->second->blk.root_hash != state->blk.root_hash) {
+      return td::Status::Error(-666, std::string{"fatal error in block DB: state for block "} + state->blk.id.to_str() +
+                                         " has two records with different root hashes");
+    } else {
+      return td::Status::OK();
+    }
+  } else {
+    auto id = state->blk.id;
+    auto res = state_info.emplace(std::move(id), std::move(state));
+    if (res.second) {
+      return td::Status::OK();
+    } else {
+      return td::Status::Error(-666, "cannot insert state information into DB");
+    }
+  }
+}
+
+void BlockDbImpl::get_top_block_id(ton::ShardIdFull shard, int authority, td::Promise<ton::BlockIdExt> promise) {
+  LOG(DEBUG) << "in BlockDb::get_top_block_id()";
+  auto it = block_info.upper_bound(ton::BlockId{shard, std::numeric_limits<td::uint32>::max()});
+  if (it != block_info.begin() && ton::ShardIdFull{(--it)->first} == shard) {
+    promise(it->second->blk);
+    return;
+  }
+  if (shard.is_masterchain()) {
+    promise(ton::BlockIdExt{ton::BlockId{ton::masterchainId, 1ULL << 63, 0}});
+    return;
+  }
+  promise(td::Status::Error(-666));
+}
+
+void BlockDbImpl::get_top_block_state_id(ton::ShardIdFull shard, int authority, td::Promise<ton::BlockIdExt> promise) {
+  LOG(DEBUG) << "in BlockDb::get_top_block_state_id()";
+  auto it = state_info.upper_bound(ton::BlockId{shard, std::numeric_limits<td::uint32>::max()});
+  if (it != state_info.begin() && ton::ShardIdFull{(--it)->first} == shard) {
+    promise(it->second->blk);
+    return;
+  }
+  if (shard.is_masterchain() && zerostate.not_null()) {
+    promise(zerostate->blk);
+    return;
+  }
+  promise(td::Status::Error(-666, "no state for given workchain found in database"));
+}
+
+void BlockDbImpl::get_block_by_id(ton::BlockId blk_id, bool need_data, td::Promise<td::Ref<FileInfo>> promise) {
+  LOG(DEBUG) << "in BlockDb::get_block_by_id({" << blk_id.workchain << ", " << blk_id.shard << ", " << blk_id.seqno
+             << "}, " << need_data << ")";
+  auto it = block_info.find(blk_id);
+  if (it != block_info.end()) {
+    if (need_data && it->second->data.is_null()) {
+      LOG(DEBUG) << "loading data for block " << blk_id.to_str();
+      auto res = load_data(it->second.write());
+      if (res.is_error()) {
+        promise(std::move(res));
+        return;
+      }
+    }
+    promise(it->second);
+  }
+  promise(td::Status::Error(-666, "block not found in database"));
+}
+
+void BlockDbImpl::get_state_by_id(ton::BlockId blk_id, bool need_data, td::Promise<td::Ref<FileInfo>> promise) {
+  LOG(DEBUG) << "in BlockDb::get_state_by_id({" << blk_id.workchain << ", " << blk_id.shard << ", " << blk_id.seqno
+             << "}, " << need_data << ")";
+  auto it = state_info.find(blk_id);
+  if (it != state_info.end()) {
+    if (need_data && it->second->data.is_null()) {
+      LOG(DEBUG) << "loading data for state " << blk_id.to_str();
+      auto res = load_data(it->second.write());
+      if (res.is_error()) {
+        promise(std::move(res));
+        return;
+      }
+    }
+    promise(it->second);
+  }
+  if (zerostate.not_null() && blk_id == zerostate->blk.id) {
+    LOG(DEBUG) << "get_state_by_id(): zerostate requested";
+    if (need_data && zerostate->data.is_null()) {
+      LOG(DEBUG) << "loading data for zerostate";
+      auto res = load_data(zerostate.write());
+      if (res.is_error()) {
+        promise(std::move(res));
+        return;
+      }
+    }
+    promise(zerostate);
+    return;
+  }
+  promise(td::Status::Error(-666, "requested state not found in database"));
+}
+
+void BlockDbImpl::get_out_queue_info_by_id(ton::BlockId blk_id, td::Promise<td::Ref<OutputQueueInfoDescr>> promise) {
+  LOG(DEBUG) << "in BlockDb::get_out_queue_info_by_id({" << blk_id.workchain << ", " << blk_id.shard << ", "
+             << blk_id.seqno << ")";
+  auto it = state_info.find(blk_id);
+  if (it == state_info.end()) {
+    promise(td::Status::Error(
+        -666, std::string{"cannot obtain output queue info for block "} + blk_id.to_str() + " : cannot load state"));
+  }
+  if (it->second->data.is_null()) {
+    LOG(DEBUG) << "loading data for state " << blk_id.to_str();
+    auto res = load_data(it->second.write());
+    if (res.is_error()) {
+      promise(std::move(res));
+      return;
+    }
+  }
+  auto it2 = block_info.find(blk_id);
+  if (it2 == block_info.end()) {
+    promise(td::Status::Error(-666, std::string{"cannot obtain output queue info for block "} + blk_id.to_str() +
+                                        " : cannot load block description"));
+  }
+  vm::StaticBagOfCellsDbLazy::Options options;
+  auto res = vm::StaticBagOfCellsDbLazy::create(it->second->data.clone(), options);
+  if (res.is_error()) {
+    td::Status err = res.move_as_error();
+    LOG(ERROR) << "cannot deserialize state for block " << blk_id.to_str() << " : " << err.to_string();
+    promise(std::move(err));
+    return;
+  }
+  auto static_boc = res.move_as_ok();
+  auto rc = static_boc->get_root_count();
+  if (rc.is_error()) {
+    promise(rc.move_as_error());
+    return;
+  }
+  if (rc.move_as_ok() != 1) {
+    promise(td::Status::Error(-668, std::string{"state for block "} + blk_id.to_str() + " is invalid"));
+    return;
+  }
+  auto res3 = static_boc->get_root_cell(0);
+  if (res3.is_error()) {
+    promise(res3.move_as_error());
+    return;
+  }
+  auto state_root = res3.move_as_ok();
+  if (it->second->blk.root_hash != state_root->get_hash().bits()) {
+    promise(td::Status::Error(
+        -668, std::string{"state for block "} + blk_id.to_str() + " is invalid : state root hash mismatch"));
+  }
+  vm::CellSlice cs = vm::load_cell_slice(state_root);
+  if (!cs.have(64, 1) || cs.prefetch_ulong(32) != 0x9023afde) {
+    promise(td::Status::Error(-668, std::string{"state for block "} + blk_id.to_str() + " is invalid"));
+  }
+  auto out_queue_info = cs.prefetch_ref();
+  promise(Ref<OutputQueueInfoDescr>{true, blk_id, it2->second->blk.root_hash.cbits(), state_root->get_hash().bits(),
+                                    std::move(out_queue_info)});
+}
+
+void BlockDbImpl::get_object_by_file_hash(FileHash file_hash, bool need_data, bool force_file_load,
+                                          td::Promise<td::Ref<FileInfo>> promise) {
+  if (zerostate.not_null() && zerostate->blk.file_hash == file_hash) {
+    if (need_data && zerostate->data.is_null()) {
+      auto res = load_data(zerostate.write());
+      if (res.is_error()) {
+        promise(std::move(res));
+        return;
+      }
+    }
+    promise(zerostate);
+    return;
+  }
+  promise(td::Status::Error(-666));
+}
+
+void BlockDbImpl::get_object_by_root_hash(RootHash root_hash, bool need_data, bool force_file_load,
+                                          td::Promise<td::Ref<FileInfo>> promise) {
+  if (zerostate.not_null() && zerostate->blk.root_hash == root_hash) {
+    if (need_data && zerostate->data.is_null()) {
+      auto res = load_data(zerostate.write());
+      if (res.is_error()) {
+        promise(std::move(res));
+        return;
+      }
+    }
+    promise(zerostate);
+    return;
+  }
+  promise(td::Status::Error(-666));
+}
+
+void BlockDbImpl::save_new_block(ton::BlockIdExt id, td::BufferSlice data, int authority,
+                                 td::Promise<td::Unit> promise) {
+  // TODO: add verification that data is a BoC with correct root hash, and that it is a Block corresponding to blk_id
+  // ...
+  // TODO: check whether we already have a block with blk_id
+  // ...
+  auto save_res = save_db_file(id.file_hash, data, FMode::chk_if_exists | FMode::overwrite | FMode::chk_file_hash);
+  if (save_res.is_error()) {
+    promise(std::move(save_res));
+  }
+  auto sz = data.size();
+  auto lev = bb.alloc<log::NewBlock>(id.id, id.root_hash, id.file_hash, data.size(), authority & 0xff);
+  if (sz <= 8) {
+    std::memcpy(lev->last_bytes, data.data(), sz);
+  } else {
+    std::memcpy(lev->last_bytes, data.data() + sz - 8, 8);
+  }
+  lev.commit();
+  bb.flush();
+  promise(td::Unit{});
+}
+
+void BlockDbImpl::save_new_state(ton::BlockIdExt id, td::BufferSlice data, int authority,
+                                 td::Promise<td::Unit> promise) {
+  // TODO: add verification that data is a BoC with correct root hash, and that it is a Block corresponding to blk_id
+  // ...
+  // TODO: check whether we already have a block with blk_id
+  // ...
+  auto save_res = save_db_file(id.file_hash, data, FMode::chk_if_exists | FMode::overwrite | FMode::chk_file_hash);
+  if (save_res.is_error()) {
+    promise(std::move(save_res));
+  }
+  auto sz = data.size();
+  auto lev = bb.alloc<log::NewState>(id.id, id.root_hash, id.file_hash, data.size(), authority & 0xff);
+  if (sz <= 8) {
+    std::memcpy(lev->last_bytes, data.data(), sz);
+  } else {
+    std::memcpy(lev->last_bytes, data.data() + sz - 8, 8);
+  }
+  lev.commit();
+  bb.flush();
+  promise(td::Unit{});
+}
+
+td::Status BlockDbImpl::load_data(FileInfo& file_info, bool force) {
+  if (!file_info.data.is_null() && !force) {
+    return td::Status::OK();
+  }
+  if (file_info.blk.file_hash.is_zero()) {
+    return td::Status::Error("cannot load a block file without knowing its file hash");
+  }
+  auto it = file_cache.find(file_info.blk.file_hash);
+  if (it != file_cache.end() && !force) {
+    file_info.data = it->second.clone();
+    return td::Status::OK();
+  }
+  std::string filename = compute_db_filename(file_info.blk.file_hash);
+  auto res = load_binary_file(filename);
+  if (res.is_error()) {
+    return res.move_as_error();
+  }
+  file_info.data = res.move_as_ok();
+  file_cache_insert(file_info.blk.file_hash, file_info.data);
+  return td::Status::OK();
+}
+
+FileInfo FileInfo::clone() const {
+  return FileInfo{*this};
+}
+
+FileInfo::FileInfo(const FileInfo& other)
+    : td::CntObject()
+    , blk(other.blk)
+    , type(other.type)
+    , status(other.status)
+    , file_size(other.file_size)
+    , data(other.data.clone()) {
+}
+
+FileInfo* FileInfo::make_copy() const {
+  return new FileInfo(*this);
+}
+
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/block-db.h b/submodules/ton/tonlib-src/crypto/block/block-db.h
new file mode 100644
index 0000000000..755403c181
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/block-db.h
@@ -0,0 +1,164 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/utils/int_types.h"
+#include "td/utils/buffer.h"
+#include "td/actor/actor.h"
+#include "ton/ton-types.h"
+#include "crypto/common/refcnt.hpp"
+#include "crypto/vm/cells.h"
+
+namespace block {
+
+using FileHash = ton::Bits256;
+using RootHash = ton::Bits256;
+using td::Ref;
+
+struct ZerostateInfo {
+  td::BufferSlice data;
+  std::string filename;
+  FileHash file_hash;
+  RootHash root_hash;
+  ZerostateInfo() {
+    file_hash.set_zero();
+    root_hash.set_zero();
+  }
+  ZerostateInfo(RootHash hash, std::string _filename) : filename(_filename), root_hash(std::move(hash)) {
+    file_hash.set_zero();
+  }
+  ZerostateInfo(std::string _filename) : filename(_filename) {
+    file_hash.set_zero();
+    root_hash.set_zero();
+  }
+  ZerostateInfo(RootHash hash, FileHash fhash) : file_hash(std::move(fhash)), root_hash(std::move(hash)) {
+  }
+  bool has_file_hash() const {
+    return !file_hash.is_zero();
+  }
+  bool has_root_hash() const {
+    return !root_hash.is_zero();
+  }
+  bool has_filename() const {
+    return !filename.empty();
+  }
+  bool has_data() const {
+    return !data.empty();
+  }
+  td::Status base_check();
+};
+
+enum class FileType {
+  unknown = 0,
+  unknown_boc = 1,
+  block = 2,
+  block_candidate = 3,
+  collated_data = 4,
+  block_signatures = 5,
+  state = 6,
+  out_queue = 7
+};
+
+struct FileInfo : public td::CntObject {
+  ton::BlockIdExt blk;
+  FileType type;
+  int status;
+  long long file_size;
+  td::BufferSlice data;
+  FileInfo() : type(FileType::unknown), status(0), file_size(-1) {
+    blk.file_hash.set_zero();
+    blk.root_hash.set_zero();
+  }
+  FileInfo(FileType _type, const ton::BlockId& _id, int _status, const FileHash& _fhash, long long _fsize = -1)
+      : blk(_id, _fhash), type(_type), status(_status), file_size(_fsize) {
+    blk.root_hash.set_zero();
+  }
+  FileInfo(FileType _type, const ton::BlockId& _id, int _status, const FileHash& _fhash, const RootHash& _rhash,
+           long long _fsize = -1)
+      : blk(_id, _rhash, _fhash), type(_type), status(_status), file_size(_fsize) {
+  }
+  FileInfo(FileType _type, const ton::BlockId& _id, int _status, const FileHash& _fhash, const RootHash& _rhash,
+           td::BufferSlice _data)
+      : blk(_id, _rhash, _fhash), type(_type), status(_status), file_size(_data.size()), data(std::move(_data)) {
+  }
+  FileInfo(FileInfo&& other) = default;
+  FileInfo clone() const;
+  FileInfo* make_copy() const override;
+
+ private:
+  FileInfo(const FileInfo& other);
+};
+
+struct OutputQueueInfoDescr : public td::CntObject {
+  ton::BlockId id;
+  RootHash block_hash;
+  RootHash state_hash;
+  RootHash output_queue_info_hash;
+  td::Ref<vm::Cell> queue_info;
+  OutputQueueInfoDescr(ton::BlockId _id, const RootHash& _bhash, const RootHash& _shash, Ref<vm::Cell> _qinfo)
+      : id(_id)
+      , block_hash(_bhash)
+      , state_hash(_shash)
+      , output_queue_info_hash(_qinfo->get_hash().bits())
+      , queue_info(std::move(_qinfo)) {
+  }
+  OutputQueueInfoDescr(ton::BlockId _id, td::ConstBitPtr _bhash, td::ConstBitPtr _shash, Ref<vm::Cell> _qinfo)
+      : id(_id)
+      , block_hash(_bhash)
+      , state_hash(_shash)
+      , output_queue_info_hash(_qinfo->get_hash().bits())
+      , queue_info(std::move(_qinfo)) {
+  }
+};
+
+class BlockDb : public td::actor::Actor {
+ public:
+  BlockDb() = default;
+  virtual ~BlockDb() = default;
+  static td::Result<td::actor::ActorOwn<BlockDb>> create_block_db(std::string _base_dir,
+                                                                  std::unique_ptr<ZerostateInfo> _zstate = nullptr,
+                                                                  bool _allow_uninit = false, int _depth = 4,
+                                                                  std::string _binlog_name = "");
+  // authority: 0 = standard (inclusion in mc block), 1 = validator (by 2/3 validator signatures)
+  virtual void get_top_block_id(ton::ShardIdFull shard, int authority, td::Promise<ton::BlockIdExt> promise) = 0;
+  virtual void get_top_block_state_id(ton::ShardIdFull shard, int authority, td::Promise<ton::BlockIdExt> promise) = 0;
+  virtual void get_block_by_id(ton::BlockId blk_id, bool need_data, td::Promise<td::Ref<FileInfo>> promise) = 0;
+  virtual void get_state_by_id(ton::BlockId blk_id, bool need_data, td::Promise<td::Ref<FileInfo>> promise) = 0;
+  virtual void get_out_queue_info_by_id(ton::BlockId blk_id, td::Promise<td::Ref<OutputQueueInfoDescr>> promise) = 0;
+  virtual void get_object_by_file_hash(FileHash file_hash, bool need_data, bool force_file_load,
+                                       td::Promise<td::Ref<FileInfo>> promise) = 0;
+  virtual void get_object_by_root_hash(RootHash root_hash, bool need_data, bool force_file_load,
+                                       td::Promise<td::Ref<FileInfo>> promise) = 0;
+  virtual void save_new_block(ton::BlockIdExt blk_id, td::BufferSlice data, int authority,
+                              td::Promise<td::Unit> promise) = 0;
+  virtual void save_new_state(ton::BlockIdExt state_id, td::BufferSlice data, int authority,
+                              td::Promise<td::Unit> promise) = 0;
+};
+
+bool parse_hash_string(std::string arg, RootHash& res);
+
+FileHash compute_file_hash(const td::BufferSlice& data);
+FileHash compute_file_hash(td::Slice data);
+td::Result<td::BufferSlice> load_binary_file(std::string filename, td::int64 max_size = 0);
+td::Status save_binary_file(std::string filename, const td::BufferSlice& data, unsigned long long max_size = 0);
+
+std::string compute_db_filename(std::string base_dir, const FileHash& file_hash, int depth = 4);
+std::string compute_db_tmp_filename(std::string base_dir, const FileHash& file_hash, int i = 0, bool makedirs = true,
+                                    int depth = 4);
+
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/block-parse.cpp b/submodules/ton/tonlib-src/crypto/block/block-parse.cpp
new file mode 100644
index 0000000000..89fc3d6f02
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/block-parse.cpp
@@ -0,0 +1,2135 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/bits.h"
+#include "block/block-parse.h"
+#include "block/block-auto.h"
+#include "ton/ton-shard.h"
+#include "common/util.h"
+#include "td/utils/crypto.h"
+
+namespace block {
+using namespace std::literals::string_literals;
+
+using CombineError = vm::CombineError;
+
+namespace {
+bool debug(const char* str) TD_UNUSED;
+bool debug(const char* str) {
+  std::cerr << str;
+  return true;
+}
+
+bool debug(int x) TD_UNUSED;
+bool debug(int x) {
+  if (x < 100) {
+    std::cerr << '[' << (char)(64 + x) << ']';
+  } else {
+    std::cerr << '[' << (char)(64 + x / 100) << x % 100 << ']';
+  }
+  return true;
+}
+}  // namespace
+
+#define DBG_START int dbg = 0;
+#define DBG debug(++dbg)&&
+#define DEB_START DBG_START
+#define DEB DBG
+
+namespace tlb {
+
+using namespace ::tlb;
+
+int MsgAddressExt::get_size(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+    case addr_none:  // 00, addr_none
+      return 2;
+    case addr_ext:  // 01, addr_extern
+      if (cs.have(2 + 9)) {
+        int len = cs.prefetch_long(2 + 9) & 0x1ff;
+        return 2 + 9 + len;
+      }
+  }
+  return -1;
+}
+
+const MsgAddressExt t_MsgAddressExt;
+
+const Anycast t_Anycast;
+
+bool Maybe_Anycast::skip_get_depth(vm::CellSlice& cs, int& depth) const {
+  depth = 0;
+  bool have;
+  return cs.fetch_bool_to(have) && (!have || t_Anycast.skip_get_depth(cs, depth));
+}
+
+const Maybe_Anycast t_Maybe_Anycast;
+
+bool MsgAddressInt::validate_skip(vm::CellSlice& cs, bool weak) const {
+  if (!cs.have(3)) {
+    return false;
+  }
+  switch (get_tag(cs)) {
+    case addr_std:
+      return cs.advance(2) && t_Maybe_Anycast.skip(cs) && cs.advance(8 + 256);
+    case addr_var:
+      if (cs.advance(2) && t_Maybe_Anycast.skip(cs) && cs.have(9 + 32)) {
+        int addr_len = (int)cs.fetch_ulong(9);
+        int workchain_id = (int)cs.fetch_long(32);
+        return cs.advance(addr_len) && (workchain_id < -0x80 || workchain_id > 0x7f || addr_len != 256) &&
+               (workchain_id != 0 && workchain_id != -1);
+      }
+  }
+  return false;
+}
+
+bool MsgAddressInt::skip_get_depth(vm::CellSlice& cs, int& depth) const {
+  if (!cs.have(3)) {
+    return false;
+  }
+  switch (get_tag(cs)) {
+    case addr_std:
+      return cs.advance(2) && t_Maybe_Anycast.skip_get_depth(cs, depth) && cs.advance(8 + 256);
+    case addr_var:
+      if (cs.advance(2) && t_Maybe_Anycast.skip_get_depth(cs, depth) && cs.have(9 + 32)) {
+        int addr_len = (int)cs.fetch_ulong(9);
+        return cs.advance(32 + addr_len);
+      }
+  }
+  return false;
+}
+
+ton::AccountIdPrefixFull MsgAddressInt::get_prefix(vm::CellSlice&& cs) {
+  if (!cs.have(3 + 8 + 64)) {
+    return {};
+  }
+  ton::WorkchainId workchain;
+  unsigned long long prefix;
+  int t = (int)cs.prefetch_ulong(2 + 1 + 5);
+  switch (t >> 5) {
+    case 4: {  // addr_std$10, anycast=nothing$0
+      if (cs.advance(3) && cs.fetch_int_to(8, workchain) && cs.fetch_uint_to(64, prefix)) {
+        return {workchain, prefix};
+      }
+      break;
+    }
+    case 5: {   // addr_std$10, anycast=just$1 (Anycast)
+      t &= 31;  // depth:(## 5)
+      unsigned long long rewrite;
+      if (cs.advance(8) && cs.fetch_uint_to(t, rewrite)  // rewrite_pfx:(bits depth)
+          && cs.fetch_int_to(8, workchain)               // workchain_id:int8
+          && cs.fetch_uint_to(64, prefix)) {             // address:bits256
+        rewrite <<= 64 - t;
+        return {workchain, (prefix & (std::numeric_limits<td::uint64>::max() >> t)) | rewrite};
+      }
+      break;
+    }
+    case 6: {  // addr_var$11, anycast=nothing$0
+      int len;
+      if (cs.advance(3) && cs.fetch_uint_to(9, len)  // addr_len:(## 9)
+          && len >= 64                               // { len >= 64 }
+          && cs.fetch_int_to(32, workchain)          // workchain_id:int32
+          && cs.fetch_uint_to(64, prefix)) {         // address:(bits addr_len)
+        return {workchain, prefix};
+      }
+      break;
+    }
+    case 7: {   // addr_var$11, anycast=just$1 (Anycast)
+      t &= 31;  // depth:(## 5)
+      int len;
+      unsigned long long rewrite;
+      if (cs.advance(8) && cs.fetch_uint_to(t, rewrite)  // rewrite_pfx:(bits depth)
+          && cs.fetch_uint_to(9, len)                    // addr_len:(## 9)
+          && len >= 64                                   // { len >= 64 }
+          && cs.fetch_int_to(32, workchain)              // workchain_id:int32
+          && cs.fetch_uint_to(64, prefix)) {             // address:bits256
+        rewrite <<= 64 - t;
+        return {workchain, (prefix & (std::numeric_limits<td::uint64>::max() >> t)) | rewrite};
+      }
+      break;
+    }
+  }
+  return {};
+}
+
+ton::AccountIdPrefixFull MsgAddressInt::get_prefix(const vm::CellSlice& cs) {
+  return get_prefix(vm::CellSlice{cs});
+}
+
+ton::AccountIdPrefixFull MsgAddressInt::get_prefix(Ref<vm::CellSlice> cs_ref) {
+  if (cs_ref->is_unique()) {
+    return get_prefix(std::move(cs_ref.unique_write()));
+  } else {
+    return get_prefix(vm::CellSlice{*cs_ref});
+  }
+}
+
+bool MsgAddressInt::extract_std_address(Ref<vm::CellSlice> cs_ref, ton::WorkchainId& workchain,
+                                        ton::StdSmcAddress& addr, bool rewrite) const {
+  if (cs_ref.is_null()) {
+    return false;
+  } else if (cs_ref->is_unique()) {
+    return extract_std_address(cs_ref.unique_write(), workchain, addr, rewrite);
+  } else {
+    vm::CellSlice cs{*cs_ref};
+    return extract_std_address(cs, workchain, addr, rewrite);
+  }
+}
+
+bool MsgAddressInt::extract_std_address(vm::CellSlice& cs, ton::WorkchainId& workchain, ton::StdSmcAddress& addr,
+                                        bool do_rewrite) const {
+  if (!cs.have(3 + 8 + 64)) {
+    return {};
+  }
+  int t = (int)cs.prefetch_ulong(2 + 1 + 5);
+  switch (t >> 5) {
+    case 4: {  // addr_std$10, anycast=nothing$0
+      return cs.advance(3) && cs.fetch_int_to(8, workchain) && cs.fetch_bits_to(addr);
+    }
+    case 5: {   // addr_std$10, anycast=just$1 (Anycast)
+      t &= 31;  // depth:(## 5)
+      unsigned long long rewrite;
+      if (cs.advance(8) && cs.fetch_uint_to(t, rewrite)  // rewrite_pfx:(bits depth)
+          && cs.fetch_int_to(8, workchain)               // workchain_id:int8
+          && cs.fetch_bits_to(addr)) {                   // address:bits256
+        if (do_rewrite) {
+          addr.bits().store_uint(rewrite, t);
+        }
+        return true;
+      }
+      break;
+    }
+    case 6: {  // addr_var$11, anycast=nothing$0
+      int len;
+      return cs.advance(3) && cs.fetch_uint_to(9, len)  // addr_len:(## 9)
+             && len == 256                              // only 256-bit addresses are standard
+             && cs.fetch_int_to(32, workchain)          // workchain_id:int32
+             && cs.fetch_bits_to(addr);                 // address:(bits addr_len)
+    }
+    case 7: {   // addr_var$11, anycast=just$1 (Anycast)
+      t &= 31;  // depth:(## 5)
+      int len;
+      unsigned long long rewrite;
+      if (cs.advance(8) && cs.fetch_uint_to(t, rewrite)  // rewrite_pfx:(bits depth)
+          && cs.fetch_uint_to(9, len)                    // addr_len:(## 9)
+          && len == 256                                  // only 256-bit addresses are standard
+          && cs.fetch_int_to(32, workchain)              // workchain_id:int32
+          && cs.fetch_bits_to(addr)) {                   // address:bits256
+        if (do_rewrite) {
+          addr.bits().store_uint(rewrite, t);
+        }
+        return true;
+      }
+      break;
+    }
+  }
+  return false;
+}
+
+const MsgAddressInt t_MsgAddressInt;
+
+bool MsgAddress::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+    case addr_none:
+    case addr_ext:
+      return t_MsgAddressExt.validate_skip(cs, weak);
+    case addr_std:
+    case addr_var:
+      return t_MsgAddressInt.validate_skip(cs, weak);
+  }
+  return false;
+}
+
+const MsgAddress t_MsgAddress;
+
+bool VarUInteger::skip(vm::CellSlice& cs) const {
+  int len = (int)cs.fetch_ulong(ln);
+  return len >= 0 && len < n && cs.advance(len * 8);
+}
+
+bool VarUInteger::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int len = (int)cs.fetch_ulong(ln);
+  return len >= 0 && len < n && (!len || cs.prefetch_ulong(8)) && cs.advance(len * 8);
+}
+
+td::RefInt256 VarUInteger::as_integer_skip(vm::CellSlice& cs) const {
+  int len = (int)cs.fetch_ulong(ln);
+  return (len >= 0 && len < n && (!len || cs.prefetch_ulong(8))) ? cs.fetch_int256(len * 8, false) : td::RefInt256{};
+}
+
+unsigned long long VarUInteger::as_uint(const vm::CellSlice& cs) const {
+  int len = (int)cs.prefetch_ulong(ln);
+  return len >= 0 && len <= 8 && cs.have(ln + len * 8) ? td::bitstring::bits_load_ulong(cs.data_bits() + ln, len * 8)
+                                                       : std::numeric_limits<td::uint64>::max();
+}
+
+bool VarUInteger::store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const {
+  int k = value.bit_size(false);
+  return k <= (n - 1) * 8 && cb.store_long_bool((k + 7) >> 3, ln) && cb.store_int256_bool(value, (k + 7) & -8, false);
+}
+
+unsigned VarUInteger::precompute_integer_size(const td::BigInt256& value) const {
+  int k = value.bit_size(false);
+  return k <= (n - 1) * 8 ? ln + ((k + 7) & -8) : 0xfff;
+}
+
+unsigned VarUInteger::precompute_integer_size(td::RefInt256 value) const {
+  if (value.is_null()) {
+    return 0xfff;
+  }
+  int k = value->bit_size(false);
+  return k <= (n - 1) * 8 ? ln + ((k + 7) & -8) : 0xfff;
+}
+
+const VarUInteger t_VarUInteger_3{3}, t_VarUInteger_7{7}, t_VarUInteger_16{16}, t_VarUInteger_32{32};
+
+bool VarUIntegerPos::skip(vm::CellSlice& cs) const {
+  int len = (int)cs.fetch_ulong(ln);
+  return len > 0 && len < n && cs.advance(len * 8);
+}
+
+bool VarUIntegerPos::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int len = (int)cs.fetch_ulong(ln);
+  return len > 0 && len < n && cs.prefetch_ulong(8) && cs.advance(len * 8);
+}
+
+td::RefInt256 VarUIntegerPos::as_integer_skip(vm::CellSlice& cs) const {
+  int len = (int)cs.fetch_ulong(ln);
+  return (len > 0 && len < n && cs.prefetch_ulong(8)) ? cs.fetch_int256(len * 8, false) : td::RefInt256{};
+}
+
+unsigned long long VarUIntegerPos::as_uint(const vm::CellSlice& cs) const {
+  int len = (int)cs.prefetch_ulong(ln);
+  return len > 0 && len <= 8 && cs.have(ln + len * 8) && cs.prefetch_ulong(8)
+             ? td::bitstring::bits_load_ulong(cs.data_bits() + ln, len * 8)
+             : std::numeric_limits<td::uint64>::max();
+}
+
+bool VarUIntegerPos::store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const {
+  int k = value.bit_size(false);
+  return k <= (n - 1) * 8 && value.sgn() > 0 && cb.store_long_bool((k + 7) >> 3, ln) &&
+         cb.store_int256_bool(value, (k + 7) & -8, false);
+}
+
+const VarUIntegerPos t_VarUIntegerPos_16{16}, t_VarUIntegerPos_32{32};
+
+static inline bool redundant_int(const vm::CellSlice& cs) {
+  int t = (int)cs.prefetch_long(9);
+  return t == 0 || t == -1;
+}
+
+bool VarInteger::skip(vm::CellSlice& cs) const {
+  int len = (int)cs.fetch_ulong(ln);
+  return len >= 0 && len < n && cs.advance(len * 8);
+}
+
+bool VarInteger::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int len = (int)cs.fetch_ulong(ln);
+  return len >= 0 && len < n && (!len || !redundant_int(cs)) && cs.advance(len * 8);
+}
+
+td::RefInt256 VarInteger::as_integer_skip(vm::CellSlice& cs) const {
+  int len = (int)cs.fetch_ulong(ln);
+  return (len >= 0 && len < n && (!len || !redundant_int(cs))) ? cs.fetch_int256(len * 8, true) : td::RefInt256{};
+}
+
+long long VarInteger::as_int(const vm::CellSlice& cs) const {
+  int len = (int)cs.prefetch_ulong(ln);
+  return len >= 0 && len <= 8 && cs.have(ln + len * 8) ? td::bitstring::bits_load_long(cs.data_bits() + ln, len * 8)
+                                                       : (1ULL << 63);
+}
+
+bool VarInteger::store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const {
+  int k = value.bit_size(true);
+  return k <= (n - 1) * 8 && cb.store_long_bool((k + 7) >> 3, ln) && cb.store_int256_bool(value, (k + 7) & -8, true);
+}
+
+bool VarIntegerNz::skip(vm::CellSlice& cs) const {
+  int len = (int)cs.fetch_ulong(ln);
+  return len > 0 && len < n && cs.advance(len * 8);
+}
+
+bool VarIntegerNz::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int len = (int)cs.fetch_ulong(ln);
+  return len > 0 && len < n && !redundant_int(cs) && cs.advance(len * 8);
+}
+
+td::RefInt256 VarIntegerNz::as_integer_skip(vm::CellSlice& cs) const {
+  int len = (int)cs.fetch_ulong(ln);
+  return (len > 0 && len < n && !redundant_int(cs)) ? cs.fetch_int256(len * 8, true) : td::RefInt256{};
+}
+
+long long VarIntegerNz::as_int(const vm::CellSlice& cs) const {
+  int len = (int)cs.prefetch_ulong(ln);
+  return len > 0 && len <= 8 && cs.have(ln + len * 8) && !redundant_int(cs)
+             ? td::bitstring::bits_load_long(cs.data_bits() + ln, len * 8)
+             : (1ULL << 63);
+}
+
+bool VarIntegerNz::store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const {
+  int k = value.bit_size(true);
+  return k <= (n - 1) * 8 && value.sgn() != 0 && cb.store_long_bool((k + 7) >> 3, ln) &&
+         cb.store_int256_bool(value, (k + 7) & -8, true);
+}
+
+bool Grams::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_VarUInteger_16.validate_skip(cs, weak);
+}
+
+td::RefInt256 Grams::as_integer_skip(vm::CellSlice& cs) const {
+  return t_VarUInteger_16.as_integer_skip(cs);
+}
+
+bool Grams::null_value(vm::CellBuilder& cb) const {
+  return t_VarUInteger_16.null_value(cb);
+}
+
+bool Grams::store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const {
+  return t_VarUInteger_16.store_integer_value(cb, value);
+}
+
+unsigned Grams::precompute_size(const td::BigInt256& value) const {
+  return t_VarUInteger_16.precompute_integer_size(value);
+}
+
+unsigned Grams::precompute_size(td::RefInt256 value) const {
+  return t_VarUInteger_16.precompute_integer_size(std::move(value));
+}
+
+const Grams t_Grams;
+
+const Unary t_Unary;
+
+bool HmLabel::validate_skip(vm::CellSlice& cs, bool weak, int& n) const {
+  switch (get_tag(cs)) {
+    case hml_short:
+      return cs.advance(1) && (n = cs.count_leading(1)) <= m && cs.advance(2 * n + 1);
+    case hml_long:
+      return cs.advance(2) && cs.fetch_uint_leq(m, n) && cs.advance(n);
+    case hml_same:
+      return cs.advance(3) && cs.fetch_uint_leq(m, n);
+  }
+  return false;
+}
+
+int HmLabel::get_tag(const vm::CellSlice& cs) const {
+  int tag = (int)cs.prefetch_ulong(2);
+  return tag != 1 ? tag : hml_short;
+}
+
+int HashmapNode::get_size(const vm::CellSlice& cs) const {
+  assert(n >= 0);
+  return n ? 0x20000 : value_type.get_size(cs);
+}
+
+bool HashmapNode::skip(vm::CellSlice& cs) const {
+  assert(n >= 0);
+  return n ? cs.advance_refs(2) : value_type.skip(cs);
+}
+
+bool HashmapNode::validate_skip(vm::CellSlice& cs, bool weak) const {
+  assert(n >= 0);
+  if (!n) {
+    // hmn_leaf
+    return value_type.validate_skip(cs, weak);
+  } else {
+    // hmn_fork
+    Hashmap branch_type{n - 1, value_type};
+    return branch_type.validate_ref(cs.fetch_ref(), weak) && branch_type.validate_ref(cs.fetch_ref(), weak);
+  }
+}
+
+bool Hashmap::skip(vm::CellSlice& cs) const {
+  int l;
+  return HmLabel{n}.skip(cs, l) && HashmapNode{n - l, value_type}.skip(cs);
+}
+
+bool Hashmap::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int l;
+  return HmLabel{n}.validate_skip(cs, weak, l) && HashmapNode{n - l, value_type}.validate_skip(cs, weak);
+}
+
+int HashmapE::get_size(const vm::CellSlice& cs) const {
+  int tag = get_tag(cs);
+  return (tag >= 0 ? (tag > 0 ? 0x10001 : 1) : -1);
+}
+
+bool HashmapE::validate(const vm::CellSlice& cs, bool weak) const {
+  int tag = get_tag(cs);
+  return tag <= 0 ? !tag : root_type.validate_ref(cs.prefetch_ref(), weak);
+}
+
+bool HashmapE::add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const {
+  int n = root_type.n;
+  vm::Dictionary dict1{vm::DictAdvance(), cs1, n}, dict2{vm::DictAdvance(), cs2, n};
+  const TLB& vt = root_type.value_type;
+  vm::Dictionary::simple_combine_func_t combine = [vt](vm::CellBuilder& cb, Ref<vm::CellSlice> cs1_ref,
+                                                       Ref<vm::CellSlice> cs2_ref) -> bool {
+    if (!vt.add_values(cb, cs1_ref.write(), cs2_ref.write())) {
+      throw CombineError{};
+    }
+    return true;
+  };
+  return dict1.combine_with(dict2, combine) && std::move(dict1).append_dict_to_bool(cb);
+}
+
+bool HashmapE::add_values_ref(Ref<vm::Cell>& res, Ref<vm::Cell> arg1, Ref<vm::Cell> arg2) const {
+  int n = root_type.n;
+  vm::Dictionary dict1{std::move(arg1), n}, dict2{std::move(arg2), n};
+  const TLB& vt = root_type.value_type;
+  vm::Dictionary::simple_combine_func_t combine = [vt](vm::CellBuilder& cb, Ref<vm::CellSlice> cs1_ref,
+                                                       Ref<vm::CellSlice> cs2_ref) -> bool {
+    if (!vt.add_values(cb, cs1_ref.write(), cs2_ref.write())) {
+      throw CombineError{};
+    }
+    return true;
+  };
+  if (dict1.combine_with(dict2, combine)) {
+    dict2.reset();
+    res = std::move(dict1).extract_root_cell();
+    return true;
+  } else {
+    res = Ref<vm::Cell>{};
+    return false;
+  }
+}
+
+int HashmapE::sub_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const {
+  int n = root_type.n;
+  vm::Dictionary dict1{vm::DictAdvance(), cs1, n}, dict2{vm::DictAdvance(), cs2, n};
+  const TLB& vt = root_type.value_type;
+  vm::Dictionary::simple_combine_func_t combine = [vt](vm::CellBuilder& cb, Ref<vm::CellSlice> cs1_ref,
+                                                       Ref<vm::CellSlice> cs2_ref) -> bool {
+    int r = vt.sub_values(cb, cs1_ref.write(), cs2_ref.write());
+    if (r < 0) {
+      throw CombineError{};
+    }
+    return r;
+  };
+  if (!dict1.combine_with(dict2, combine, 1)) {
+    return -1;
+  }
+  dict2.reset();
+  bool not_empty = !dict1.is_empty();
+  return std::move(dict1).append_dict_to_bool(cb) ? not_empty : -1;
+}
+
+int HashmapE::sub_values_ref(Ref<vm::Cell>& res, Ref<vm::Cell> arg1, Ref<vm::Cell> arg2) const {
+  int n = root_type.n;
+  vm::Dictionary dict1{std::move(arg1), n}, dict2{std::move(arg2), n};
+  const TLB& vt = root_type.value_type;
+  vm::Dictionary::simple_combine_func_t combine = [vt](vm::CellBuilder& cb, Ref<vm::CellSlice> cs1_ref,
+                                                       Ref<vm::CellSlice> cs2_ref) -> bool {
+    int r = vt.sub_values(cb, cs1_ref.write(), cs2_ref.write());
+    if (r < 0) {
+      throw CombineError{};
+    }
+    return r;
+  };
+  if (dict1.combine_with(dict2, combine, 1)) {
+    dict2.reset();
+    res = std::move(dict1).extract_root_cell();
+    return res.not_null();
+  } else {
+    res = Ref<vm::Cell>{};
+    return -1;
+  }
+}
+
+bool HashmapE::store_ref(vm::CellBuilder& cb, Ref<vm::Cell> arg) const {
+  if (arg.is_null()) {
+    return cb.store_long_bool(0, 1);
+  } else {
+    return cb.store_long_bool(1, 1) && cb.store_ref_bool(std::move(arg));
+  }
+}
+
+const ExtraCurrencyCollection t_ExtraCurrencyCollection;
+
+bool CurrencyCollection::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_Grams.validate_skip(cs, weak) && t_ExtraCurrencyCollection.validate_skip(cs, weak);
+}
+
+bool CurrencyCollection::skip(vm::CellSlice& cs) const {
+  return t_Grams.skip(cs) && t_ExtraCurrencyCollection.skip(cs);
+}
+
+td::RefInt256 CurrencyCollection::as_integer_skip(vm::CellSlice& cs) const {
+  auto res = t_Grams.as_integer_skip(cs);
+  if (res.not_null() && t_ExtraCurrencyCollection.skip(cs)) {
+    return res;
+  } else {
+    return {};
+  }
+}
+
+bool CurrencyCollection::add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const {
+  return t_Grams.add_values(cb, cs1, cs2) && t_ExtraCurrencyCollection.add_values(cb, cs1, cs2);
+}
+
+bool CurrencyCollection::unpack_special(vm::CellSlice& cs, td::RefInt256& balance, Ref<vm::Cell>& extra,
+                                        bool inexact) const {
+  balance = t_Grams.as_integer_skip(cs);
+  if (cs.fetch_ulong(1) == 1) {
+    return balance.not_null() && cs.fetch_ref_to(extra) && (inexact || cs.empty_ext());
+  } else {
+    extra.clear();
+    return balance.not_null() && (inexact || cs.empty_ext());
+  }
+}
+
+bool CurrencyCollection::unpack_special(vm::CellSlice& cs, block::CurrencyCollection& value, bool inexact) const {
+  return unpack_special(cs, value.grams, value.extra, inexact);
+}
+
+bool CurrencyCollection::pack_special(vm::CellBuilder& cb, td::RefInt256 balance, Ref<vm::Cell> extra) const {
+  return t_Grams.store_integer_ref(cb, std::move(balance)) && t_ExtraCurrencyCollection.store_ref(cb, std::move(extra));
+}
+
+bool CurrencyCollection::pack_special(vm::CellBuilder& cb, const block::CurrencyCollection& value) const {
+  return value.is_valid() && pack_special(cb, value.grams, value.extra);
+}
+
+bool CurrencyCollection::pack_special(vm::CellBuilder& cb, block::CurrencyCollection&& value) const {
+  return value.is_valid() && pack_special(cb, std::move(value.grams), std::move(value.extra));
+}
+
+bool CurrencyCollection::unpack(vm::CellSlice& cs, block::CurrencyCollection& res) const {
+  return unpack_special(cs, res.grams, res.extra);
+}
+
+bool CurrencyCollection::pack(vm::CellBuilder& cb, const block::CurrencyCollection& res) const {
+  return res.is_valid() && pack_special(cb, res.grams, res.extra);
+}
+
+const CurrencyCollection t_CurrencyCollection;
+
+bool CommonMsgInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int tag = get_tag(cs);
+  switch (tag) {
+    case int_msg_info:
+      return cs.advance(4)                               // int_msg_info$0 ihr_disabled:Bool bounce:Bool bounced:Bool
+             && t_MsgAddressInt.validate_skip(cs, weak)  // src
+             && t_MsgAddressInt.validate_skip(cs, weak)  // dest
+             && t_CurrencyCollection.validate_skip(cs, weak)  // value
+             && t_Grams.validate_skip(cs, weak)               // ihr_fee
+             && t_Grams.validate_skip(cs, weak)               // fwd_fee
+             && cs.advance(64 + 32);                          // created_lt:uint64 created_at:uint32
+    case ext_in_msg_info:
+      return cs.advance(2) && t_MsgAddressExt.validate_skip(cs, weak)  // src
+             && t_MsgAddressInt.validate_skip(cs, weak)                // dest
+             && t_Grams.validate_skip(cs, weak);                       // import_fee
+    case ext_out_msg_info:
+      return cs.advance(2) && t_MsgAddressInt.validate_skip(cs, weak)  // src
+             && t_MsgAddressExt.validate_skip(cs, weak)                // dest
+             && cs.advance(64 + 32);                                   // created_lt:uint64 created_at:uint32
+  }
+  return false;
+}
+
+bool CommonMsgInfo::unpack(vm::CellSlice& cs, CommonMsgInfo::Record_int_msg_info& data) const {
+  return get_tag(cs) == int_msg_info && cs.advance(1) && cs.fetch_bool_to(data.ihr_disabled) &&
+         cs.fetch_bool_to(data.bounce) && cs.fetch_bool_to(data.bounced) && t_MsgAddressInt.fetch_to(cs, data.src) &&
+         t_MsgAddressInt.fetch_to(cs, data.dest) && t_CurrencyCollection.fetch_to(cs, data.value) &&
+         t_Grams.fetch_to(cs, data.ihr_fee) && t_Grams.fetch_to(cs, data.fwd_fee) &&
+         cs.fetch_uint_to(64, data.created_lt) && cs.fetch_uint_to(32, data.created_at);
+}
+
+bool CommonMsgInfo::skip(vm::CellSlice& cs) const {
+  int tag = get_tag(cs);
+  switch (tag) {
+    case int_msg_info:
+      return cs.advance(4)                     // int_msg_info$0 ihr_disabled:Bool bounce:Bool bounced:Bool
+             && t_MsgAddressInt.skip(cs)       // src
+             && t_MsgAddressInt.skip(cs)       // dest
+             && t_CurrencyCollection.skip(cs)  // value
+             && t_Grams.skip(cs)               // ihr_fee
+             && t_Grams.skip(cs)               // fwd_fee
+             && cs.advance(64 + 32);           // created_lt:uint64 created_at:uint32
+    case ext_in_msg_info:
+      return cs.advance(2) && t_MsgAddressExt.skip(cs)  // src
+             && t_MsgAddressInt.skip(cs)                // dest
+             && t_Grams.skip(cs);                       // import_fee
+    case ext_out_msg_info:
+      return cs.advance(2) && t_MsgAddressInt.skip(cs)  // src
+             && t_MsgAddressExt.skip(cs)                // dest
+             && cs.advance(64 + 32);                    // created_lt:uint64 created_at:uint32
+  }
+  return false;
+}
+
+bool CommonMsgInfo::get_created_lt(vm::CellSlice& cs, unsigned long long& created_lt) const {
+  switch (get_tag(cs)) {
+    case int_msg_info:
+      return cs.advance(4)                           // int_msg_info$0 ihr_disabled:Bool bounce:Bool bounced:Bool
+             && t_MsgAddressInt.skip(cs)             // src
+             && t_MsgAddressInt.skip(cs)             // dest
+             && t_CurrencyCollection.skip(cs)        // value
+             && t_Grams.skip(cs)                     // ihr_fee
+             && t_Grams.skip(cs)                     // fwd_fee
+             && cs.fetch_ulong_bool(64, created_lt)  // created_lt:uint64
+             && cs.advance(32);                      // created_at:uint32
+    case ext_in_msg_info:
+      return false;
+    case ext_out_msg_info:
+      return cs.advance(2) && t_MsgAddressInt.skip(cs)  // src
+             && t_MsgAddressExt.skip(cs)                // dest
+             && cs.fetch_ulong_bool(64, created_lt)     // created_lt:uint64
+             && cs.advance(32);                         // created_at:uint32
+  }
+  return false;
+}
+
+const CommonMsgInfo t_CommonMsgInfo;
+const TickTock t_TickTock;
+const RefAnything t_RefCell;
+
+bool StateInit::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return Maybe<UInt>{5}.validate_skip(cs, weak)            // split_depth:(Maybe (## 5))
+         && Maybe<TickTock>{}.validate_skip(cs, weak)      // special:(Maybe TickTock)
+         && Maybe<RefAnything>{}.validate_skip(cs, weak)   // code:(Maybe ^Cell)
+         && Maybe<RefAnything>{}.validate_skip(cs, weak)   // data:(Maybe ^Cell)
+         && Maybe<RefAnything>{}.validate_skip(cs, weak);  // library:(Maybe ^Cell)
+}
+
+bool StateInit::get_ticktock(vm::CellSlice& cs, int& ticktock) const {
+  bool have_tt;
+  ticktock = 0;
+  return Maybe<UInt>{5}.validate_skip(cs) && cs.fetch_bool_to(have_tt) && (!have_tt || cs.fetch_uint_to(2, ticktock));
+}
+
+const StateInit t_StateInit;
+
+bool Message::validate_skip(vm::CellSlice& cs, bool weak) const {
+  static const Maybe<Either<StateInit, RefTo<StateInit>>> init_type;
+  static const Either<Anything, RefAnything> body_type;
+  return t_CommonMsgInfo.validate_skip(cs, weak)  // info:CommonMsgInfo
+         && init_type.validate_skip(cs, weak)     // init:(Maybe (Either StateInit ^StateInit))
+         && body_type.validate_skip(cs, weak);    // body:(Either X ^X)
+}
+
+bool Message::extract_info(vm::CellSlice& cs) const {
+  return t_CommonMsgInfo.extract(cs);
+}
+
+bool Message::get_created_lt(vm::CellSlice& cs, unsigned long long& created_lt) const {
+  return t_CommonMsgInfo.get_created_lt(cs, created_lt);
+}
+
+bool Message::is_internal(Ref<vm::Cell> ref) const {
+  return is_internal(load_cell_slice(std::move(ref)));
+}
+
+const Message t_Message;
+const RefTo<Message> t_Ref_Message;
+
+bool IntermediateAddress::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+    case interm_addr_regular:
+      return cs.advance(1) && cs.fetch_ulong(7) <= 96U;
+    case interm_addr_simple:
+      return cs.advance(2 + 8 + 64);
+    case interm_addr_ext:
+      if (cs.have(2 + 32 + 64)) {
+        cs.advance(2);
+        int workchain_id = (int)cs.fetch_long(32);
+        return (workchain_id < -128 || workchain_id >= 128) && cs.advance(64);
+      }
+      // no break
+  }
+  return false;
+}
+
+bool IntermediateAddress::skip(vm::CellSlice& cs) const {
+  return cs.advance(get_size(cs));
+}
+
+int IntermediateAddress::get_size(const vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+    case interm_addr_regular:
+      return 1 + 7;
+    case interm_addr_simple:
+      return 2 + 8 + 64;
+    case interm_addr_ext:
+      return 2 + 32 + 64;
+  }
+  return -1;
+}
+
+const IntermediateAddress t_IntermediateAddress;
+
+bool MsgEnvelope::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(4) == 4                            // msg_envelope#4
+         && t_IntermediateAddress.validate_skip(cs, weak)  // cur_addr:IntermediateAddress
+         && t_IntermediateAddress.validate_skip(cs, weak)  // next_addr:IntermediateAddress
+         && t_Grams.validate_skip(cs, weak)                // fwd_fee_remaining:Grams
+         && t_Ref_Message.validate_skip(cs, weak);         // msg:^Message
+}
+
+bool MsgEnvelope::skip(vm::CellSlice& cs) const {
+  return cs.advance(4)                      // msg_envelope#4
+         && t_IntermediateAddress.skip(cs)  // cur_addr:IntermediateAddress
+         && t_IntermediateAddress.skip(cs)  // next_addr:IntermediateAddress
+         && t_Grams.skip(cs)                // fwd_fee_remaining:Grams
+         && t_Ref_Message.skip(cs);         // msg:^Message
+}
+
+bool MsgEnvelope::extract_fwd_fees_remaining(vm::CellSlice& cs) const {
+  return t_IntermediateAddress.skip(cs) && t_IntermediateAddress.skip(cs) && t_Grams.extract(cs);
+}
+
+bool MsgEnvelope::unpack(vm::CellSlice& cs, MsgEnvelope::Record& data) const {
+  return cs.fetch_ulong(4) == 4                                 // msg_envelope#4
+         && t_IntermediateAddress.fetch_to(cs, data.cur_addr)   // cur_addr:IntermediateAddress
+         && t_IntermediateAddress.fetch_to(cs, data.next_addr)  // next_addr:IntermediateAddress
+         && t_Grams.fetch_to(cs, data.fwd_fee_remaining)        // fwd_fee_remaining:Grams
+         && cs.fetch_ref_to(data.msg);                          // msg:^Message
+}
+
+bool MsgEnvelope::unpack(vm::CellSlice& cs, MsgEnvelope::Record_std& data) const {
+  return cs.fetch_ulong(4) == 4                                      // msg_envelope#4
+         && t_IntermediateAddress.fetch_regular(cs, data.cur_addr)   // cur_addr:IntermediateAddress
+         && t_IntermediateAddress.fetch_regular(cs, data.next_addr)  // next_addr:IntermediateAddress
+         && t_Grams.as_integer_skip_to(cs, data.fwd_fee_remaining)   // fwd_fee_remaining:Grams
+         && cs.fetch_ref_to(data.msg);                               // msg:^Message
+}
+
+bool MsgEnvelope::unpack_std(vm::CellSlice& cs, int& cur_a, int& nhop_a, Ref<vm::Cell>& msg) const {
+  return cs.fetch_ulong(4) == 4                              // msg_envelope#4
+         && t_IntermediateAddress.fetch_regular(cs, cur_a)   // cur_addr:IntermediateAddress
+         && t_IntermediateAddress.fetch_regular(cs, nhop_a)  // next_addr:IntermediateAddress
+         && cs.fetch_ref_to(msg);
+}
+
+bool MsgEnvelope::get_created_lt(const vm::CellSlice& cs, unsigned long long& created_lt) const {
+  if (!cs.size_refs()) {
+    return false;
+  }
+  auto msg_cs = load_cell_slice(cs.prefetch_ref());
+  return t_Message.get_created_lt(msg_cs, created_lt);
+}
+
+const MsgEnvelope t_MsgEnvelope;
+const RefTo<MsgEnvelope> t_Ref_MsgEnvelope;
+
+bool StorageUsed::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_VarUInteger_7.validate_skip(cs, weak)      // cells:(VarUInteger 7)
+         && t_VarUInteger_7.validate_skip(cs, weak)   // bits:(VarUInteger 7)
+         && t_VarUInteger_7.validate_skip(cs, weak);  // public_cells:(VarUInteger 7)
+}
+
+bool StorageUsed::skip(vm::CellSlice& cs) const {
+  return t_VarUInteger_7.skip(cs)      // cells:(VarUInteger 7)
+         && t_VarUInteger_7.skip(cs)   // bits:(VarUInteger 7)
+         && t_VarUInteger_7.skip(cs);  // public_cells:(VarUInteger 7)
+}
+
+const StorageUsed t_StorageUsed;
+
+bool StorageUsedShort::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_VarUInteger_7.validate_skip(cs, weak)      // cells:(VarUInteger 7)
+         && t_VarUInteger_7.validate_skip(cs, weak);  // bits:(VarUInteger 7)
+}
+
+bool StorageUsedShort::skip(vm::CellSlice& cs) const {
+  return t_VarUInteger_7.skip(cs)      // cells:(VarUInteger 7)
+         && t_VarUInteger_7.skip(cs);  // bits:(VarUInteger 7)
+}
+
+const StorageUsedShort t_StorageUsedShort;
+
+const Maybe<Grams> t_Maybe_Grams;
+
+bool StorageInfo::skip(vm::CellSlice& cs) const {
+  return t_StorageUsed.skip(cs)      // used:StorageUsed
+         && cs.advance(32)           // last_paid:uint32
+         && t_Maybe_Grams.skip(cs);  // due_payment:(Maybe Grams)
+}
+
+bool StorageInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_StorageUsed.validate_skip(cs, weak)      // used:StorageUsed
+         && cs.advance(32)                          // last_paid:uint32
+         && t_Maybe_Grams.validate_skip(cs, weak);  // due_payment:(Maybe Grams)
+}
+
+const StorageInfo t_StorageInfo;
+
+bool AccountState::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+    case account_uninit:
+      return cs.advance(2);
+    case account_frozen:
+      return cs.advance(2 + 256);
+    case account_active:
+      return cs.advance(1) && t_StateInit.validate_skip(cs, weak);
+  }
+  return false;
+}
+
+bool AccountState::get_ticktock(vm::CellSlice& cs, int& ticktock) const {
+  if (get_tag(cs) != account_active) {
+    ticktock = 0;
+    return true;
+  }
+  return cs.advance(1) && t_StateInit.get_ticktock(cs, ticktock);
+}
+
+const AccountState t_AccountState;
+
+bool AccountStorage::skip(vm::CellSlice& cs) const {
+  return cs.advance(64) && t_CurrencyCollection.skip(cs) && t_AccountState.skip(cs);
+}
+
+bool AccountStorage::skip_copy_balance(vm::CellBuilder& cb, vm::CellSlice& cs) const {
+  return cs.advance(64) && t_CurrencyCollection.skip_copy(cb, cs) && t_AccountState.skip(cs);
+}
+
+bool AccountStorage::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.advance(64) && t_CurrencyCollection.validate_skip(cs, weak) && t_AccountState.validate_skip(cs, weak);
+}
+
+const AccountStorage t_AccountStorage;
+
+bool Account::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+    case account_none:
+      return cs.advance(1);
+    case account:
+      return cs.advance(1)                  // account$1
+             && t_MsgAddressInt.skip(cs)    // addr:MsgAddressInt
+             && t_StorageInfo.skip(cs)      // storage_stat:StorageInfo
+             && t_AccountStorage.skip(cs);  // storage:AccountStorage
+  }
+  return false;
+}
+
+bool Account::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+    case account_none:
+      return allow_empty && cs.advance(1);
+    case account:
+      return cs.advance(1)                                 // account$1
+             && t_MsgAddressInt.validate_skip(cs, weak)    // addr:MsgAddressInt
+             && t_StorageInfo.validate_skip(cs, weak)      // storage_stat:StorageInfo
+             && t_AccountStorage.validate_skip(cs, weak);  // storage:AccountStorage
+  }
+  return false;
+}
+
+bool Account::skip_copy_balance(vm::CellBuilder& cb, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+    case account_none:
+      return allow_empty && cs.advance(1) && t_CurrencyCollection.null_value(cb);
+    case account:
+      return cs.advance(1)                                   // account$1
+             && t_MsgAddressInt.skip(cs)                     // addr:MsgAddressInt
+             && t_StorageInfo.skip(cs)                       // storage_stat:StorageInfo
+             && t_AccountStorage.skip_copy_balance(cb, cs);  // storage:AccountStorage
+  }
+  return false;
+}
+
+bool Account::skip_copy_depth_balance(vm::CellBuilder& cb, vm::CellSlice& cs) const {
+  int depth;
+  switch (get_tag(cs)) {
+    case account_none:
+      return allow_empty && cs.advance(1) && t_DepthBalanceInfo.null_value(cb);
+    case account:
+      return cs.advance(1)                                   // account$1
+             && t_MsgAddressInt.skip_get_depth(cs, depth)    // addr:MsgAddressInt
+             && cb.store_uint_leq(30, depth)                 // -> store split_depth:(#<= 30)
+             && t_StorageInfo.skip(cs)                       // storage_stat:StorageInfo
+             && t_AccountStorage.skip_copy_balance(cb, cs);  // storage:AccountStorage
+  }
+  return false;
+}
+
+const Account t_Account, t_AccountE{true};
+const RefTo<Account> t_Ref_Account;
+
+bool ShardAccount::extract_account_state(Ref<vm::CellSlice> cs_ref, Ref<vm::Cell>& acc_state) {
+  if (cs_ref.is_null()) {
+    vm::CellBuilder cb;
+    return cb.store_bool_bool(false) && cb.finalize_to(acc_state);
+  } else {
+    return cs_ref->prefetch_ref_to(acc_state);
+  }
+}
+
+bool ShardAccount::Record::reset() {
+  last_trans_hash.set_zero();
+  last_trans_lt = 0;
+  is_zero = valid = true;
+  vm::CellBuilder cb;
+  return (cb.store_bool_bool(false) && cb.finalize_to(account)) || invalidate();
+}
+
+bool ShardAccount::Record::unpack(vm::CellSlice& cs) {
+  is_zero = false;
+  valid = true;
+  return (cs.fetch_ref_to(account) && cs.fetch_bits_to(last_trans_hash) && cs.fetch_uint_to(64, last_trans_lt)) ||
+         invalidate();
+}
+
+bool ShardAccount::Record::unpack(Ref<vm::CellSlice> cs_ref) {
+  if (cs_ref.not_null()) {
+    return unpack(cs_ref.write()) && (cs_ref->empty_ext() || invalidate());
+  } else {
+    return reset();
+  }
+}
+
+const ShardAccount t_ShardAccount;
+
+const AccountStatus t_AccountStatus;
+
+bool HashmapAugNode::skip(vm::CellSlice& cs) const {
+  if (n < 0) {
+    return false;
+  } else if (!n) {
+    // ahmn_leaf
+    return aug.extra_type.skip(cs) && aug.value_type.skip(cs);
+  } else {
+    // ahmn_fork
+    return cs.advance_refs(2) && aug.extra_type.skip(cs);
+  }
+}
+
+bool HashmapAugNode::validate_skip(vm::CellSlice& cs, bool weak) const {
+  if (n < 0) {
+    return false;
+  }
+  if (!n) {
+    // ahmn_leaf
+    vm::CellSlice cs_extra{cs};
+    if (!aug.extra_type.validate_skip(cs, weak)) {
+      return false;
+    }
+    cs_extra.cut_tail(cs);
+    vm::CellSlice cs_value{cs};
+    if (!aug.value_type.validate_skip(cs, weak)) {
+      return false;
+    }
+    cs_value.cut_tail(cs);
+    return aug.check_leaf(cs_extra, cs_value);
+  }
+  // ahmn_fork
+  if (!cs.have_refs(2)) {
+    return false;
+  }
+  HashmapAug branch_type{n - 1, aug};
+  if (!branch_type.validate_ref(cs.prefetch_ref(0), weak) || !branch_type.validate_ref(cs.prefetch_ref(1), weak)) {
+    return false;
+  }
+  auto cs_left = load_cell_slice(cs.fetch_ref());
+  auto cs_right = load_cell_slice(cs.fetch_ref());
+  vm::CellSlice cs_extra{cs};
+  if (!aug.extra_type.validate_skip(cs, weak)) {
+    return false;
+  }
+  cs_extra.cut_tail(cs);
+  return branch_type.extract_extra(cs_left) && branch_type.extract_extra(cs_right) &&
+         aug.check_fork(cs_extra, cs_left, cs_right);
+}
+
+bool HashmapAug::skip(vm::CellSlice& cs) const {
+  int l;
+  return HmLabel{n}.skip(cs, l) && HashmapAugNode{n - l, aug}.skip(cs);
+}
+
+bool HashmapAug::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int l;
+  return HmLabel{n}.validate_skip(cs, weak, l) && HashmapAugNode{n - l, aug}.validate_skip(cs, weak);
+}
+
+bool HashmapAug::extract_extra(vm::CellSlice& cs) const {
+  int l;
+  return HmLabel{n}.skip(cs, l) && (l == n || cs.advance_refs(2)) && aug.extra_type.extract(cs);
+}
+
+bool HashmapAugE::validate_skip(vm::CellSlice& cs, bool weak) const {
+  Ref<vm::CellSlice> extra;
+  switch (get_tag(cs)) {
+    case ahme_empty:
+      return cs.advance(1) && (extra = root_type.aug.extra_type.validate_fetch(cs, weak)).not_null() &&
+             root_type.aug.check_empty(extra.unique_write());
+    case ahme_root:
+      if (cs.advance(1) && root_type.validate_ref(cs.prefetch_ref(), weak)) {
+        bool special;
+        auto cs_root = load_cell_slice_special(cs.fetch_ref(), special);
+        if (special) {
+          return weak;
+        }
+        return (extra = root_type.aug.extra_type.validate_fetch(cs, weak)).not_null() &&
+               root_type.extract_extra(cs_root) && extra->contents_equal(cs_root);
+      }
+      break;
+  }
+  return false;
+}
+
+bool HashmapAugE::skip(vm::CellSlice& cs) const {
+  int tag = (int)cs.fetch_ulong(1);
+  return tag >= 0 && cs.advance_refs(tag) && root_type.aug.extra_type.skip(cs);
+}
+
+bool HashmapAugE::extract_extra(vm::CellSlice& cs) const {
+  int tag = (int)cs.fetch_ulong(1);
+  return tag >= 0 && cs.advance_refs(tag) && root_type.aug.extra_type.extract(cs);
+}
+
+bool DepthBalanceInfo::skip(vm::CellSlice& cs) const {
+  return cs.advance(5) &&
+         t_CurrencyCollection.skip(
+             cs);  // depth_balance$_ split_depth:(#<= 30) balance:CurrencyCollection = DepthBalanceInfo;
+}
+
+bool DepthBalanceInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(5) <= 30 && t_CurrencyCollection.validate_skip(
+                                        cs, weak);  // depth_balance$_ split_depth:(#<= 30) balance:CurrencyCollection
+}
+
+bool DepthBalanceInfo::null_value(vm::CellBuilder& cb) const {
+  return cb.store_zeroes_bool(5) && t_CurrencyCollection.null_value(cb);
+}
+
+bool DepthBalanceInfo::add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const {
+  unsigned d1, d2;
+  return cs1.fetch_uint_leq(30, d1) && cs2.fetch_uint_leq(30, d2) && cb.store_uint_leq(30, std::max(d1, d2)) &&
+         t_CurrencyCollection.add_values(cb, cs1, cs2);
+}
+
+const DepthBalanceInfo t_DepthBalanceInfo;
+
+bool Aug_ShardAccounts::eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const {
+  if (cs.have_refs()) {
+    auto cs2 = load_cell_slice(cs.prefetch_ref());
+    return t_Account.skip_copy_depth_balance(cb, cs2);
+  } else {
+    return false;
+  }
+}
+
+const Aug_ShardAccounts aug_ShardAccounts;
+
+const ShardAccounts t_ShardAccounts;
+
+const AccStatusChange t_AccStatusChange;
+
+bool TrStoragePhase::skip(vm::CellSlice& cs) const {
+  return t_Grams.skip(cs)                // storage_fees_collected:Grams
+         && t_Maybe_Grams.skip(cs)       // storage_fees_due:Grams
+         && t_AccStatusChange.skip(cs);  // status_change:AccStatusChange
+}
+
+bool TrStoragePhase::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_Grams.validate_skip(cs, weak)                // storage_fees_collected:Grams
+         && t_Maybe_Grams.validate_skip(cs, weak)       // storage_fees_due:Grams
+         && t_AccStatusChange.validate_skip(cs, weak);  // status_change:AccStatusChange
+}
+
+const TrStoragePhase t_TrStoragePhase;
+
+bool TrCreditPhase::skip(vm::CellSlice& cs) const {
+  return t_Maybe_Grams.skip(cs)             // due_fees_collected:(Maybe Grams)
+         && t_CurrencyCollection.skip(cs);  // credit:CurrencyCollection
+}
+
+bool TrCreditPhase::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_Maybe_Grams.validate_skip(cs, weak)             // due_fees_collected:(Maybe Grams)
+         && t_CurrencyCollection.validate_skip(cs, weak);  // credit:CurrencyCollection
+}
+
+const TrCreditPhase t_TrCreditPhase;
+
+bool TrComputeInternal1::skip(vm::CellSlice& cs) const {
+  return t_VarUInteger_7.skip(cs)           // gas_used:(VarUInteger 7)
+         && t_VarUInteger_7.skip(cs)        // gas_limit:(VarUInteger 7)
+         && Maybe<VarUInteger>{3}.skip(cs)  // gas_credit:(Maybe (VarUInteger 3))
+         && cs.advance(8 + 32)              // mode:int8 exit_code:int32
+         && Maybe<Int>{32}.skip(cs)         // exit_arg:(Maybe int32)
+         && cs.advance(32 + 256 + 256);     // vm_steps:uint32
+                                            // vm_init_state_hash:uint256
+                                            // vm_final_state_hash:uint256
+}
+
+bool TrComputeInternal1::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_VarUInteger_7.validate_skip(cs, weak)           // gas_used:(VarUInteger 7)
+         && t_VarUInteger_7.validate_skip(cs, weak)        // gas_limit:(VarUInteger 7)
+         && Maybe<VarUInteger>{3}.validate_skip(cs, weak)  // gas_credit:(Maybe (VarUInteger 3))
+         && cs.advance(8 + 32)                             // mode:int8 exit_code:int32
+         && Maybe<Int>{32}.validate_skip(cs, weak)         // exit_arg:(Maybe int32)
+         && cs.advance(32 + 256 + 256);                    // vm_steps:uint32
+                                                           // vm_init_state_hash:uint256
+                                                           // vm_final_state_hash:uint256
+}
+
+const TrComputeInternal1 t_TrComputeInternal1;
+const RefTo<TrComputeInternal1> t_Ref_TrComputeInternal1;
+const ComputeSkipReason t_ComputeSkipReason;
+
+bool TrComputePhase::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+    case tr_phase_compute_skipped:
+      return cs.advance(1) && t_ComputeSkipReason.skip(cs);
+    case tr_phase_compute_vm:
+      return cs.advance(1 + 3)    // tr_phase_compute_vm$1 success:Bool msg_state_used:Bool account_activated:Bool
+             && t_Grams.skip(cs)  // gas_fees:Grams
+             && t_Ref_TrComputeInternal1.skip(cs);  // ^[ gas_used:(..) .. ]
+  }
+  return false;
+}
+
+bool TrComputePhase::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+    case tr_phase_compute_skipped:
+      return cs.advance(1) && t_ComputeSkipReason.validate_skip(cs, weak);
+    case tr_phase_compute_vm:
+      return cs.advance(1 + 3)  // tr_phase_compute_vm$1 success:Bool msg_state_used:Bool account_activated:Bool
+             && t_Grams.validate_skip(cs, weak)                    // gas_fees:Grams
+             && t_Ref_TrComputeInternal1.validate_skip(cs, weak);  // ^[ gas_used:(..) .. ]
+  }
+  return false;
+}
+
+const TrComputePhase t_TrComputePhase;
+
+bool TrActionPhase::skip(vm::CellSlice& cs) const {
+  return cs.advance(3)                    // success:Bool valid:Bool no_funds:Bool
+         && t_AccStatusChange.skip(cs)    // status_change:AccStatusChange
+         && t_Maybe_Grams.skip(cs)        // total_fwd_fees:(Maybe Grams)
+         && t_Maybe_Grams.skip(cs)        // total_action_fees:(Maybe Grams)
+         && cs.advance(32)                // result_code:int32
+         && Maybe<Int>{32}.skip(cs)       // result_arg:(Maybe int32)
+         && cs.advance(16 * 4 + 256)      // tot_actions:uint16 spec_actions:uint16
+                                          // skipped_actions:uint16 msgs_created:uint16
+                                          // action_list_hash:uint256
+         && t_StorageUsedShort.skip(cs);  // tot_msg_size:StorageUsedShort
+}
+
+bool TrActionPhase::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.advance(3)                                   // success:Bool valid:Bool no_funds:Bool
+         && t_AccStatusChange.validate_skip(cs, weak)    // status_change:AccStatusChange
+         && t_Maybe_Grams.validate_skip(cs, weak)        // total_fwd_fees:(Maybe Grams)
+         && t_Maybe_Grams.validate_skip(cs, weak)        // total_action_fees:(Maybe Grams)
+         && cs.advance(32)                               // result_code:int32
+         && Maybe<Int>{32}.validate_skip(cs, weak)       // result_arg:(Maybe int32)
+         && cs.advance(16 * 4 + 256)                     // tot_actions:uint16 spec_actions:uint16
+                                                         // skipped_actions:uint16 msgs_created:uint16
+                                                         // action_list_hash:uint256
+         && t_StorageUsedShort.validate_skip(cs, weak);  // tot_msg_size:StorageUsed
+}
+
+const TrActionPhase t_TrActionPhase;
+
+bool TrBouncePhase::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+    case tr_phase_bounce_negfunds:
+      return cs.advance(2);  // tr_phase_bounce_negfunds$00
+    case tr_phase_bounce_nofunds:
+      return cs.advance(2)                   // tr_phase_bounce_nofunds$01
+             && t_StorageUsedShort.skip(cs)  // msg_size:StorageUsedShort
+             && t_Grams.skip(cs);            // req_fwd_fees:Grams
+    case tr_phase_bounce_ok:
+      return cs.advance(1)                   // tr_phase_bounce_ok$1
+             && t_StorageUsedShort.skip(cs)  // msg_size:StorageUsedShort
+             && t_Grams.skip(cs)             // msg_fees:Grams
+             && t_Grams.skip(cs);            // fwd_fees:Grams
+  }
+  return false;
+}
+
+bool TrBouncePhase::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+    case tr_phase_bounce_negfunds:
+      return cs.advance(2);  // tr_phase_bounce_negfunds$00
+    case tr_phase_bounce_nofunds:
+      return cs.advance(2)                                  // tr_phase_bounce_nofunds$01
+             && t_StorageUsedShort.validate_skip(cs, weak)  // msg_size:StorageUsedShort
+             && t_Grams.validate_skip(cs, weak);            // req_fwd_fees:Grams
+    case tr_phase_bounce_ok:
+      return cs.advance(1)                                  // tr_phase_bounce_ok$1
+             && t_StorageUsedShort.validate_skip(cs, weak)  // msg_size:StorageUsedShort
+             && t_Grams.validate_skip(cs, weak)             // msg_fees:Grams
+             && t_Grams.validate_skip(cs, weak);            // fwd_fees:Grams
+  }
+  return false;
+}
+
+int TrBouncePhase::get_tag(const vm::CellSlice& cs) const {
+  if (cs.size() == 1) {
+    return (int)cs.prefetch_ulong(1) == 1 ? tr_phase_bounce_ok : -1;
+  }
+  int v = (int)cs.prefetch_ulong(2);
+  return v == 3 ? tr_phase_bounce_ok : v;
+};
+
+const TrBouncePhase t_TrBouncePhase;
+
+bool SplitMergeInfo::skip(vm::CellSlice& cs) const {
+  // cur_shard_pfx_len:(## 6) acc_split_depth:(##6) this_addr:uint256 sibling_addr:uint256
+  return cs.advance(6 + 6 + 256 + 256);
+}
+
+bool SplitMergeInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  if (!cs.have(6 + 6 + 256 + 256)) {
+    return false;
+  }
+  int cur_pfx_len = (int)cs.fetch_ulong(6);
+  int split_depth = (int)cs.fetch_ulong(6);
+  unsigned char this_addr[32], sibling_addr[32];
+  if (!cs.fetch_bytes(this_addr, 32) || !cs.fetch_bytes(sibling_addr, 32)) {
+    return false;
+  }
+  // cur_pfx_len < split_depth, addresses match except in bit cur_pfx_len
+  if (cur_pfx_len >= split_depth) {
+    return false;
+  }
+  sibling_addr[cur_pfx_len >> 3] ^= (unsigned char)(0x80 >> (cur_pfx_len & 7));
+  return !std::memcmp(this_addr, sibling_addr, 32);
+}
+
+const SplitMergeInfo t_SplitMergeInfo;
+
+bool TransactionDescr::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+    case trans_ord:
+      return cs.advance(4 + 1)                          // trans_ord$0000 storage_first:Bool
+             && Maybe<TrStoragePhase>{}.skip(cs)        // storage_ph:(Maybe TrStoragePhase)
+             && Maybe<TrCreditPhase>{}.skip(cs)         // credit_ph:(Maybe TrCreditPhase)
+             && t_TrComputePhase.skip(cs)               // compute_ph:TrComputePhase
+             && Maybe<RefTo<TrActionPhase>>{}.skip(cs)  // action:(Maybe ^TrActionPhase)
+             && cs.advance(1)                           // aborted:Bool
+             && Maybe<TrBouncePhase>{}.skip(cs)         // bounce:(Maybe TrBouncePhase)
+             && cs.advance(1);                          // destroyed:Bool
+    case trans_storage:
+      return cs.advance(4)                  // trans_storage$0001
+             && t_TrStoragePhase.skip(cs);  // storage_ph:TrStoragePhase
+    case trans_tick_tock:
+      return cs.advance(4)                              // trans_tick_tock$001 is_tock:Bool
+             && t_TrStoragePhase.skip(cs)               // storage:TrStoragePhase
+             && t_TrComputePhase.skip(cs)               // compute_ph:TrComputePhase
+             && Maybe<RefTo<TrActionPhase>>{}.skip(cs)  // action:(Maybe ^TrActionPhase)
+             && cs.advance(2);                          // aborted:Bool destroyed:Bool
+    case trans_split_prepare:
+      return cs.advance(4)                              // trans_split_prepare$0100
+             && t_SplitMergeInfo.skip(cs)               // split_info:SplitMergeInfo
+             && t_TrComputePhase.skip(cs)               // compute_ph:TrComputePhase
+             && Maybe<RefTo<TrActionPhase>>{}.skip(cs)  // action:(Maybe ^TrActionPhase)
+             && cs.advance(2);                          // aborted:Bool destroyed:Bool
+    case trans_split_install:
+      return cs.advance(4)                  // trans_split_install$0101
+             && t_SplitMergeInfo.skip(cs)   // split_info:SplitMergeInfo
+             && t_Ref_Transaction.skip(cs)  // prepare_transaction:^Transaction
+             && cs.advance(1);              // installed:Bool
+    case trans_merge_prepare:
+      return cs.advance(4)                 // trans_merge_prepare$0110
+             && t_SplitMergeInfo.skip(cs)  // split_info:SplitMergeInfo
+             && t_TrStoragePhase.skip(cs)  // storage_ph:TrStoragePhase
+             && cs.advance(1);             // aborted:Bool
+    case trans_merge_install:
+      return cs.advance(4)                              // trans_merge_install$0111
+             && t_SplitMergeInfo.skip(cs)               // split_info:SplitMergeInfo
+             && t_Ref_Transaction.skip(cs)              // prepare_transaction:^Transaction
+             && Maybe<TrCreditPhase>{}.skip(cs)         // credit_ph:(Maybe TrCreditPhase)
+             && Maybe<TrComputePhase>{}.skip(cs)        // compute_ph:TrComputePhase
+             && Maybe<RefTo<TrActionPhase>>{}.skip(cs)  // action:(Maybe ^TrActionPhase)
+             && cs.advance(2);                          // aborted:Bool destroyed:Bool
+  }
+  return false;
+}
+
+bool TransactionDescr::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+    case trans_ord:
+      return cs.advance(4 + 1)                                         // trans_ord$0000 credit_first:Bool
+             && Maybe<TrStoragePhase>{}.validate_skip(cs, weak)        // storage_ph:(Maybe TrStoragePhase)
+             && Maybe<TrCreditPhase>{}.validate_skip(cs, weak)         // credit_ph:(Maybe TrCreditPhase)
+             && t_TrComputePhase.validate_skip(cs, weak)               // compute_ph:TrComputePhase
+             && Maybe<RefTo<TrActionPhase>>{}.validate_skip(cs, weak)  // action:(Maybe ^TrActionPhase)
+             && cs.advance(1)                                          // aborted:Bool
+             && Maybe<TrBouncePhase>{}.validate_skip(cs, weak)         // bounce:(Maybe TrBouncePhase)
+             && cs.advance(1);                                         // destroyed:Bool
+    case trans_storage:
+      return cs.advance(4)                                 // trans_storage$0001
+             && t_TrStoragePhase.validate_skip(cs, weak);  // storage_ph:TrStoragePhase
+    case trans_tick_tock:
+      return cs.advance(4)                                             // trans_tick_tock$001 is_tock:Bool
+             && t_TrStoragePhase.validate_skip(cs, weak)               // storage:TrStoragePhase
+             && t_TrComputePhase.validate_skip(cs, weak)               // compute_ph:TrComputePhase
+             && Maybe<RefTo<TrActionPhase>>{}.validate_skip(cs, weak)  // action:(Maybe ^TrActionPhase)
+             && cs.advance(2);                                         // aborted:Bool destroyed:Bool
+    case trans_split_prepare:
+      return cs.advance(4)                                             // trans_split_prepare$0100
+             && t_SplitMergeInfo.validate_skip(cs, weak)               // split_info:SplitMergeInfo
+             && t_TrComputePhase.validate_skip(cs, weak)               // compute_ph:TrComputePhase
+             && Maybe<RefTo<TrActionPhase>>{}.validate_skip(cs, weak)  // action:(Maybe ^TrActionPhase)
+             && cs.advance(2);                                         // aborted:Bool destroyed:Bool
+    case trans_split_install:
+      return cs.advance(4)                                 // trans_split_install$0101
+             && t_SplitMergeInfo.validate_skip(cs, weak)   // split_info:SplitMergeInfo
+             && t_Ref_Transaction.validate_skip(cs, weak)  // prepare_transaction:^Transaction
+             && cs.advance(1);                             // installed:Bool
+    case trans_merge_prepare:
+      return cs.advance(4)                                // trans_merge_prepare$0110
+             && t_SplitMergeInfo.validate_skip(cs, weak)  // split_info:SplitMergeInfo
+             && t_TrStoragePhase.validate_skip(cs, weak)  // storage_ph:TrStoragePhase
+             && cs.advance(1);                            // aborted:Bool
+    case trans_merge_install:
+      return cs.advance(4)                                             // trans_merge_install$0111
+             && t_SplitMergeInfo.validate_skip(cs, weak)               // split_info:SplitMergeInfo
+             && t_Ref_Transaction.validate_skip(cs, weak)              // prepare_transaction:^Transaction
+             && Maybe<TrCreditPhase>{}.validate_skip(cs, weak)         // credit_ph:(Maybe TrCreditPhase)
+             && Maybe<TrComputePhase>{}.validate_skip(cs, weak)        // compute_ph:TrComputePhase
+             && Maybe<RefTo<TrActionPhase>>{}.validate_skip(cs, weak)  // action:(Maybe ^TrActionPhase)
+             && cs.advance(2);                                         // aborted:Bool destroyed:Bool
+  }
+  return false;
+}
+
+int TransactionDescr::get_tag(const vm::CellSlice& cs) const {
+  int t = (int)cs.prefetch_ulong(4);
+  return (t >= 0 && t <= 7) ? (t == 3 ? 2 : t) : -1;
+}
+
+const TransactionDescr t_TransactionDescr;
+
+bool Transaction_aux::skip(vm::CellSlice& cs) const {
+  return Maybe<RefTo<Message>>{}.skip(cs)          // in_msg:(Maybe ^Message)
+         && HashmapE{15, t_Ref_Message}.skip(cs);  // out_msgs:(HashmapE 15 ^Message)
+}
+
+bool Transaction_aux::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return Maybe<RefTo<Message>>{}.validate_skip(cs, weak)          // in_msg:(Maybe ^Message)
+         && HashmapE{15, t_Ref_Message}.validate_skip(cs, weak);  // out_msgs:(HashmapE 15 ^Message)
+}
+
+const Transaction_aux t_Transaction_aux;
+
+bool Transaction::skip(vm::CellSlice& cs) const {
+  return cs.advance(
+             4 + 256 + 64 + 256 + 64 + 32 +
+             15)  // transaction$0111 account_addr:uint256 lt:uint64 prev_trans_hash:bits256 prev_trans_lt:uint64 now:uint32 outmsg_cnt:uint15
+         && t_AccountStatus.skip(cs)             // orig_status:AccountStatus
+         && t_AccountStatus.skip(cs)             // end_status:AccountStatus
+         && cs.advance_refs(1)                   // ^[ in_msg:(Maybe ^Message) out_msgs:(HashmapE 15 ^Message) ]
+         && t_CurrencyCollection.skip(cs)        // total_fees:CurrencyCollection
+         && cs.advance_refs(1)                   // state_update:^(MERKLE_UPDATE Account)
+         && RefTo<TransactionDescr>{}.skip(cs);  // description:^TransactionDescr
+}
+
+bool Transaction::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(4) == 7  // transaction$0111
+         &&
+         cs.advance(
+             256 + 64 + 256 + 64 + 32 +
+             15)  // account_addr:uint256 lt:uint64 prev_trans_hash:bits256 prev_trans_lt:uint64 now:uint32 outmsg_cnt:uint15
+         && t_AccountStatus.validate_skip(cs, weak)             // orig_status:AccountStatus
+         && t_AccountStatus.validate_skip(cs, weak)             // end_status:AccountStatus
+         && RefTo<Transaction_aux>{}.validate_skip(cs, weak)    // ^[ in_msg:... out_msgs:... ]
+         && t_CurrencyCollection.validate_skip(cs, weak)        // total_fees:CurrencyCollection
+         && t_Ref_HashUpdate.validate_skip(cs, weak)            // state_update:^(HASH_UPDATE Account)
+         && RefTo<TransactionDescr>{}.validate_skip(cs, weak);  // description:^TransactionDescr
+}
+
+bool Transaction::get_total_fees(vm::CellSlice&& cs, block::CurrencyCollection& total_fees) const {
+  return cs.is_valid() && cs.fetch_ulong(4) == 7  // transaction$0111
+         &&
+         cs.advance(
+             256 + 64 + 256 + 64 + 32 +
+             15)  // account_addr:uint256 lt:uint64 prev_trans_hash:bits256 prev_trans_lt:uint64 now:uint32 outmsg_cnt:uint15
+         && t_AccountStatus.skip(cs)  // orig_status:AccountStatus
+         && t_AccountStatus.skip(cs)  // end_status:AccountStatus
+         && cs.advance_refs(1)        // ^[ in_msg:... out_msg:... ]
+         && total_fees.fetch(cs);     // total_fees:CurrencyCollection
+}
+
+const Transaction t_Transaction;
+const RefTo<Transaction> t_Ref_Transaction;
+
+// leaf evaluation for (HashmapAug 64 ^Transaction CurrencyCollection)
+bool Aug_AccountTransactions::eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const {
+  auto cell_ref = cs.prefetch_ref();
+  block::CurrencyCollection total_fees;
+  return cell_ref.not_null() && t_Transaction.get_total_fees(vm::load_cell_slice(std::move(cell_ref)), total_fees) &&
+         total_fees.store(cb);
+}
+
+const Aug_AccountTransactions aug_AccountTransactions;
+const HashmapAug t_AccountTransactions{64, aug_AccountTransactions};
+
+const HashUpdate t_HashUpdate;
+const RefTo<HashUpdate> t_Ref_HashUpdate;
+
+bool AccountBlock::skip(vm::CellSlice& cs) const {
+  return cs.advance(4 + 256)                // acc_trans#5 account_addr:bits256
+         && t_AccountTransactions.skip(cs)  // transactions:(HashmapAug 64 ^Transaction CurrencyCollection)
+         && cs.advance_refs(1);             // state_update:^(HASH_UPDATE Account)
+}
+
+bool AccountBlock::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.fetch_ulong(4) == 5  // acc_trans#5
+         && cs.advance(256)      // account_addr:bits256
+         &&
+         t_AccountTransactions.validate_skip(cs, weak)  // transactions:(HashmapAug 64 ^Transaction CurrencyCollection)
+         && t_Ref_HashUpdate.validate_skip(cs, weak);   // state_update:^(HASH_UPDATE Account)
+}
+
+bool AccountBlock::get_total_fees(vm::CellSlice&& cs, block::CurrencyCollection& total_fees) const {
+  return cs.advance(4 + 256)                         // acc_trans#5 account_addr:bits256
+         && t_AccountTransactions.extract_extra(cs)  // transactions:(HashmapAug 64 ^Transaction Grams)
+         && total_fees.fetch(cs);
+}
+
+const AccountBlock t_AccountBlock;
+
+bool Aug_ShardAccountBlocks::eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const {
+  block::CurrencyCollection total_fees;
+  return t_AccountBlock.get_total_fees(std::move(cs), total_fees) && total_fees.store(cb);
+}
+
+const Aug_ShardAccountBlocks aug_ShardAccountBlocks;
+const HashmapAugE t_ShardAccountBlocks{256,
+                                       aug_ShardAccountBlocks};  // (HashmapAugE 256 AccountBlock CurrencyCollection)
+
+bool ImportFees::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_Grams.validate_skip(cs, weak) && t_CurrencyCollection.validate_skip(cs, weak);
+}
+
+bool ImportFees::skip(vm::CellSlice& cs) const {
+  return t_Grams.skip(cs) && t_CurrencyCollection.skip(cs);
+}
+
+bool ImportFees::add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const {
+  return t_Grams.add_values(cb, cs1, cs2) && t_CurrencyCollection.add_values(cb, cs1, cs2);
+}
+
+const ImportFees t_ImportFees;
+
+bool InMsg::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+    case msg_import_ext:
+      return cs.advance(3)                   // msg_import_ext$000
+             && t_Ref_Message.skip(cs)       // msg:^Message
+             && t_Ref_Transaction.skip(cs);  // transaction:^Transaction
+    case msg_import_ihr:
+      return cs.advance(3)                  // msg_import_ihr$010
+             && t_Ref_Message.skip(cs)      // msg:^Message
+             && t_Ref_Transaction.skip(cs)  // transaction:^Transaction
+             && t_Grams.skip(cs)            // ihr_fee:Grams
+             && t_RefCell.skip(cs);         // proof_created:^Cell
+    case msg_import_imm:
+      return cs.advance(3)                  // msg_import_imm$011
+             && t_Ref_MsgEnvelope.skip(cs)  // in_msg:^MsgEnvelope
+             && t_Ref_Transaction.skip(cs)  // transaction:^Transaction
+             && t_Grams.skip(cs);           // fwd_fee:Grams
+    case msg_import_fin:
+      return cs.advance(3)                  // msg_import_fin$100
+             && t_Ref_MsgEnvelope.skip(cs)  // in_msg:^MsgEnvelope
+             && t_Ref_Transaction.skip(cs)  // transaction:^Transaction
+             && t_Grams.skip(cs);           // fwd_fee:Grams
+    case msg_import_tr:
+      return cs.advance(3)                  // msg_import_tr$101
+             && t_Ref_MsgEnvelope.skip(cs)  // in_msg:^MsgEnvelope
+             && t_Ref_MsgEnvelope.skip(cs)  // out_msg:^MsgEnvelope
+             && t_Grams.skip(cs);           // transit_fee:Grams
+    case msg_discard_fin:
+      return cs.advance(3)                  // msg_discard_fin$110
+             && t_Ref_MsgEnvelope.skip(cs)  // in_msg:^MsgEnvelope
+             && cs.advance(64)              // transaction_id:uint64
+             && t_Grams.skip(cs);           // fwd_fee:Grams
+    case msg_discard_tr:
+      return cs.advance(3)                  // msg_discard_tr$111
+             && t_Ref_MsgEnvelope.skip(cs)  // in_msg:^MsgEnvelope
+             && cs.advance(64)              // transaction_id:uint64
+             && t_Grams.skip(cs)            // fwd_fee:Grams
+             && t_RefCell.skip(cs);         // proof_delivered:^Cell
+  }
+  return false;
+}
+
+bool InMsg::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+    case msg_import_ext:
+      return cs.advance(3)                                  // msg_import_ext$000
+             && t_Ref_Message.validate_skip(cs, weak)       // msg:^Message
+             && t_Ref_Transaction.validate_skip(cs, weak);  // transaction:^Transaction
+    case msg_import_ihr:
+      return cs.advance(3)                                 // msg_import_ihr$010
+             && t_Ref_Message.validate_skip(cs, weak)      // msg:^Message
+             && t_Ref_Transaction.validate_skip(cs, weak)  // transaction:^Transaction
+             && t_Grams.validate_skip(cs, weak)            // ihr_fee:Grams
+             && t_RefCell.validate_skip(cs, weak);         // proof_created:^Cell
+    case msg_import_imm:
+      return cs.advance(3)                                 // msg_import_imm$011
+             && t_Ref_MsgEnvelope.validate_skip(cs, weak)  // in_msg:^MsgEnvelope
+             && t_Ref_Transaction.validate_skip(cs, weak)  // transaction:^Transaction
+             && t_Grams.validate_skip(cs, weak);           // fwd_fee:Grams
+    case msg_import_fin:
+      return cs.advance(3)                                 // msg_import_fin$100
+             && t_Ref_MsgEnvelope.validate_skip(cs, weak)  // in_msg:^MsgEnvelope
+             && t_Ref_Transaction.validate_skip(cs, weak)  // transaction:^Transaction
+             && t_Grams.validate_skip(cs, weak);           // fwd_fee:Grams
+    case msg_import_tr:
+      return cs.advance(3)                                 // msg_import_tr$101
+             && t_Ref_MsgEnvelope.validate_skip(cs, weak)  // in_msg:^MsgEnvelope
+             && t_Ref_MsgEnvelope.validate_skip(cs, weak)  // out_msg:^MsgEnvelope
+             && t_Grams.validate_skip(cs, weak);           // transit_fee:Grams
+    case msg_discard_fin:
+      return cs.advance(3)                                 // msg_discard_fin$110
+             && t_Ref_MsgEnvelope.validate_skip(cs, weak)  // in_msg:^MsgEnvelope
+             && cs.advance(64)                             // transaction_id:uint64
+             && t_Grams.validate_skip(cs, weak);           // fwd_fee:Grams
+    case msg_discard_tr:
+      return cs.advance(3)                                 // msg_discard_tr$111
+             && t_Ref_MsgEnvelope.validate_skip(cs, weak)  // in_msg:^MsgEnvelope
+             && cs.advance(64)                             // transaction_id:uint64
+             && t_Grams.validate_skip(cs, weak)            // fwd_fee:Grams
+             && t_RefCell.validate_skip(cs, weak);         // proof_delivered:^Cell
+  }
+  return false;
+}
+
+bool InMsg::get_import_fees(vm::CellBuilder& cb, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+    case msg_import_ext:                   // inbound external message
+      return t_ImportFees.null_value(cb);  // external messages have no value and no import fees
+    case msg_import_ihr:                   // IHR-forwarded internal message to its final destination
+      if (cs.advance(3) && cs.size_refs() >= 3) {
+        auto msg_cs = load_cell_slice(cs.fetch_ref());
+        CommonMsgInfo::Record_int_msg_info msg_info;
+        td::RefInt256 ihr_fee;
+        vm::CellBuilder aux;
+        // sort of Prolog-style in C++
+        return t_Message.extract_info(msg_cs) && t_CommonMsgInfo.unpack(msg_cs, msg_info) &&
+               cs.fetch_ref().not_null() && (ihr_fee = t_Grams.as_integer_skip(cs)).not_null() &&
+               cs.fetch_ref().not_null() && !cmp(ihr_fee, t_Grams.as_integer(*msg_info.ihr_fee)) &&
+               cb.append_cellslice_bool(msg_info.ihr_fee)  // fees_collected := ihr_fee
+               && aux.append_cellslice_bool(msg_info.ihr_fee) && t_ExtraCurrencyCollection.null_value(aux) &&
+               t_CurrencyCollection.add_values(cb, aux.as_cellslice_ref().write(),
+                                               msg_info.value.write());  // value_imported := ihr_fee + value
+      }
+      return false;
+    case msg_import_imm:  // internal message re-imported from this very block
+      if (cs.advance(3) && cs.size_refs() >= 2) {
+        return cs.fetch_ref().not_null() && cs.fetch_ref().not_null() &&
+               cb.append_cellslice_bool(t_Grams.fetch(cs))  // fees_collected := fwd_fees
+               && t_CurrencyCollection.null_value(cb);      // value_imported := 0
+      }
+      return false;
+    case msg_import_fin:  // internal message delivered to its final destination in this block
+      if (cs.advance(3) && cs.size_refs() >= 2) {
+        auto msg_env_cs = load_cell_slice(cs.fetch_ref());
+        MsgEnvelope::Record in_msg;
+        td::RefInt256 fwd_fee, fwd_fee_remaining, value_grams, ihr_fee;
+        if (!(t_MsgEnvelope.unpack(msg_env_cs, in_msg) && cs.fetch_ref().not_null() &&
+              t_Grams.as_integer_skip_to(cs, fwd_fee) &&
+              (fwd_fee_remaining = t_Grams.as_integer(in_msg.fwd_fee_remaining)).not_null() &&
+              !(cmp(fwd_fee, fwd_fee_remaining)))) {
+          return false;
+        }
+        auto msg_cs = load_cell_slice(std::move(in_msg.msg));
+        CommonMsgInfo::Record_int_msg_info msg_info;
+        return t_Message.extract_info(msg_cs) && t_CommonMsgInfo.unpack(msg_cs, msg_info) &&
+               cb.append_cellslice_bool(in_msg.fwd_fee_remaining)  // fees_collected := fwd_fee_remaining
+               && t_Grams.as_integer_skip_to(msg_info.value.write(), value_grams) &&
+               (ihr_fee = t_Grams.as_integer(std::move(msg_info.ihr_fee))).not_null() &&
+               t_Grams.store_integer_ref(cb, value_grams + ihr_fee + fwd_fee_remaining) &&
+               cb.append_cellslice_bool(
+                   msg_info.value.write());  // value_imported = msg.value + msg.ihr_fee + fwd_fee_remaining
+      }
+      return false;
+    case msg_import_tr:  // transit internal message
+      if (cs.advance(3) && cs.size_refs() >= 2) {
+        auto msg_env_cs = load_cell_slice(cs.fetch_ref());
+        MsgEnvelope::Record in_msg;
+        td::RefInt256 transit_fee, fwd_fee_remaining, value_grams, ihr_fee;
+        if (!(t_MsgEnvelope.unpack(msg_env_cs, in_msg) && cs.fetch_ref().not_null() &&
+              t_Grams.as_integer_skip_to(cs, transit_fee) &&
+              (fwd_fee_remaining = t_Grams.as_integer(in_msg.fwd_fee_remaining)).not_null() &&
+              cmp(transit_fee, fwd_fee_remaining) <= 0)) {
+          return false;
+        }
+        auto msg_cs = load_cell_slice(in_msg.msg);
+        CommonMsgInfo::Record_int_msg_info msg_info;
+        return t_Message.extract_info(msg_cs) && t_CommonMsgInfo.unpack(msg_cs, msg_info) &&
+               t_Grams.store_integer_ref(cb, std::move(transit_fee))  // fees_collected := transit_fees
+               && t_Grams.as_integer_skip_to(msg_info.value.write(), value_grams) &&
+               (ihr_fee = t_Grams.as_integer(std::move(msg_info.ihr_fee))).not_null() &&
+               t_Grams.store_integer_ref(cb, value_grams + ihr_fee + fwd_fee_remaining) &&
+               cb.append_cellslice_bool(
+                   msg_info.value.write());  // value_imported = msg.value + msg.ihr_fee + fwd_fee_remaining
+      }
+      return false;
+    case msg_discard_fin:  // internal message discarded at its final destination because of previous IHR delivery
+      if (cs.advance(3) && cs.size_refs() >= 1) {
+        Ref<vm::CellSlice> fwd_fee;
+        return cs.fetch_ref().not_null() && cs.advance(64) && (fwd_fee = t_Grams.fetch(cs)).not_null() &&
+               cb.append_cellslice_bool(fwd_fee)  // fees_collected := fwd_fee
+               && cb.append_cellslice_bool(std::move(fwd_fee)) &&
+               t_ExtraCurrencyCollection.null_value(cb);  // value_imported := fwd_fee
+      }
+      return false;
+    case msg_discard_tr:  // internal message discarded at an intermediate destination
+      if (cs.advance(3) && cs.size_refs() >= 2) {
+        Ref<vm::CellSlice> fwd_fee;
+        return cs.fetch_ref().not_null() && cs.advance(64) && (fwd_fee = t_Grams.fetch(cs)).not_null() &&
+               cs.fetch_ref().not_null() && cb.append_cellslice_bool(fwd_fee)  // fees_collected := fwd_fee
+               && cb.append_cellslice_bool(std::move(fwd_fee)) &&
+               t_ExtraCurrencyCollection.null_value(cb);  // value_imported := fwd_fee
+      }
+      return false;
+  }
+  return false;
+}
+
+const InMsg t_InMsg;
+
+const Aug_InMsgDescr aug_InMsgDescr;
+const InMsgDescr t_InMsgDescr;
+
+bool OutMsg::skip(vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+    case msg_export_ext:
+      return cs.advance(3)                   // msg_export_ext$000
+             && t_Ref_Message.skip(cs)       // msg:^Message
+             && t_Ref_Transaction.skip(cs);  // transaction:^Transaction
+    case msg_export_imm:
+      return cs.advance(3)                  // msg_export_imm$010
+             && t_Ref_MsgEnvelope.skip(cs)  // out_msg:^MsgEnvelope
+             && t_Ref_Transaction.skip(cs)  // transaction:^Transaction
+             && RefTo<InMsg>{}.skip(cs);    // reimport:^InMsg
+    case msg_export_new:
+      return cs.advance(3)                   // msg_export_new$001
+             && t_Ref_MsgEnvelope.skip(cs)   // out_msg:^MsgEnvelope
+             && t_Ref_Transaction.skip(cs);  // transaction:^Transaction
+    case msg_export_tr:
+      return cs.advance(3)                  // msg_export_tr$011
+             && t_Ref_MsgEnvelope.skip(cs)  // out_msg:^MsgEnvelope
+             && RefTo<InMsg>{}.skip(cs);    // imported:^InMsg
+    case msg_export_deq_imm:
+      return cs.advance(3)                  // msg_export_deq_imm$100
+             && t_Ref_MsgEnvelope.skip(cs)  // out_msg:^MsgEnvelope
+             && RefTo<InMsg>{}.skip(cs);    // reimport:^InMsg
+    case msg_export_deq:
+      return cs.advance(3)                  // msg_export_deq$110
+             && t_Ref_MsgEnvelope.skip(cs)  // out_msg:^MsgEnvelope
+             && cs.advance(64);             // import_block_lt:uint64
+    case msg_export_tr_req:
+      return cs.advance(3)                  // msg_export_tr_req$111
+             && t_Ref_MsgEnvelope.skip(cs)  // out_msg:^MsgEnvelope
+             && RefTo<InMsg>{}.skip(cs);    // imported:^InMsg
+  }
+  return false;
+}
+
+bool OutMsg::validate_skip(vm::CellSlice& cs, bool weak) const {
+  switch (get_tag(cs)) {
+    case msg_export_ext:
+      return cs.advance(3)                                  // msg_export_ext$000
+             && t_Ref_Message.validate_skip(cs, weak)       // msg:^Message
+             && t_Ref_Transaction.validate_skip(cs, weak);  // transaction:^Transaction
+    case msg_export_imm:
+      return cs.advance(3)                                 // msg_export_imm$010
+             && t_Ref_MsgEnvelope.validate_skip(cs, weak)  // out_msg:^MsgEnvelope
+             && t_Ref_Transaction.validate_skip(cs, weak)  // transaction:^Transaction
+             && RefTo<InMsg>{}.validate_skip(cs, weak);    // reimport:^InMsg
+    case msg_export_new:
+      return cs.advance(3)                                  // msg_export_new$001
+             && t_Ref_MsgEnvelope.validate_skip(cs, weak)   // out_msg:^MsgEnvelope
+             && t_Ref_Transaction.validate_skip(cs, weak);  // transaction:^Transaction
+    case msg_export_tr:
+      return cs.advance(3)                                 // msg_export_tr$011
+             && t_Ref_MsgEnvelope.validate_skip(cs, weak)  // out_msg:^MsgEnvelope
+             && RefTo<InMsg>{}.validate_skip(cs, weak);    // imported:^InMsg
+    case msg_export_deq_imm:
+      return cs.advance(3)                                 // msg_export_deq_imm$100
+             && t_Ref_MsgEnvelope.validate_skip(cs, weak)  // out_msg:^MsgEnvelope
+             && RefTo<InMsg>{}.validate_skip(cs, weak);    // reimport:^InMsg
+    case msg_export_deq:
+      return cs.advance(3)                                 // msg_export_deq$110
+             && t_Ref_MsgEnvelope.validate_skip(cs, weak)  // out_msg:^MsgEnvelope
+             && cs.advance(64);                            // import_block_lt:uint64
+    case msg_export_tr_req:
+      return cs.advance(3)                                 // msg_export_tr_req$111
+             && t_Ref_MsgEnvelope.validate_skip(cs, weak)  // out_msg:^MsgEnvelope
+             && RefTo<InMsg>{}.validate_skip(cs, weak);    // imported:^InMsg
+  }
+  return false;
+}
+
+bool OutMsg::get_export_value(vm::CellBuilder& cb, vm::CellSlice& cs) const {
+  switch (get_tag(cs)) {
+    case msg_export_ext:  // external outbound message carries no value
+      if (cs.have(3, 2)) {
+        return t_CurrencyCollection.null_value(cb);
+      }
+      return false;
+    case msg_export_imm:  // outbound internal message delivered in this very block, no value exported
+      return cs.have(3, 3) && t_CurrencyCollection.null_value(cb);
+    case msg_export_deq_imm:  // dequeuing record for outbound message delivered in this very block, no value exported
+      return cs.have(3, 2) && t_CurrencyCollection.null_value(cb);
+    case msg_export_deq:  // dequeueing record for outbound message, no exported value
+      return cs.have(3, 1) && t_CurrencyCollection.null_value(cb);
+    case msg_export_new:     // newly-generated outbound internal message, queued
+    case msg_export_tr:      // transit internal message, queued
+    case msg_export_tr_req:  // transit internal message, re-queued from this shardchain
+      if (cs.advance(3) && cs.size_refs() >= 2) {
+        auto msg_env_cs = load_cell_slice(cs.fetch_ref());
+        MsgEnvelope::Record out_msg;
+        if (!(cs.fetch_ref().not_null() && t_MsgEnvelope.unpack(msg_env_cs, out_msg))) {
+          return false;
+        }
+        auto msg_cs = load_cell_slice(std::move(out_msg.msg));
+        CommonMsgInfo::Record_int_msg_info msg_info;
+        td::RefInt256 value_grams, ihr_fee, fwd_fee_remaining;
+        return t_Message.extract_info(msg_cs) && t_CommonMsgInfo.unpack(msg_cs, msg_info) &&
+               (value_grams = t_Grams.as_integer_skip(msg_info.value.write())).not_null() &&
+               (ihr_fee = t_Grams.as_integer(std::move(msg_info.ihr_fee))).not_null() &&
+               (fwd_fee_remaining = t_Grams.as_integer(out_msg.fwd_fee_remaining)).not_null() &&
+               t_Grams.store_integer_ref(cb, value_grams + ihr_fee + fwd_fee_remaining) &&
+               cb.append_cellslice_bool(std::move(msg_info.value));
+        // exported value = msg.value + msg.ihr_fee + fwd_fee_remaining
+      }
+      return false;
+  }
+  return false;
+}
+
+bool OutMsg::get_created_lt(vm::CellSlice& cs, unsigned long long& created_lt) const {
+  switch (get_tag(cs)) {
+    case msg_export_ext:
+      if (cs.have(3, 1)) {
+        auto msg_cs = load_cell_slice(cs.prefetch_ref());
+        return t_Message.get_created_lt(msg_cs, created_lt);
+      } else {
+        return false;
+      }
+    case msg_export_imm:
+    case msg_export_new:
+    case msg_export_tr:
+    case msg_export_deq:
+    case msg_export_deq_imm:
+    case msg_export_tr_req:
+      if (cs.have(3, 1)) {
+        auto out_msg_cs = load_cell_slice(cs.prefetch_ref());
+        return t_MsgEnvelope.get_created_lt(out_msg_cs, created_lt);
+      } else {
+        return false;
+      }
+  }
+  return false;
+}
+
+const OutMsg t_OutMsg;
+
+const Aug_OutMsgDescr aug_OutMsgDescr;
+const OutMsgDescr t_OutMsgDescr;
+
+bool EnqueuedMsg::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.advance(64) && t_Ref_MsgEnvelope.validate_skip(cs, weak);
+}
+
+const EnqueuedMsg t_EnqueuedMsg;
+
+bool Aug_OutMsgQueue::eval_fork(vm::CellBuilder& cb, vm::CellSlice& left_cs, vm::CellSlice& right_cs) const {
+  unsigned long long x, y;
+  return left_cs.fetch_ulong_bool(64, x) && right_cs.fetch_ulong_bool(64, y) &&
+         cb.store_ulong_rchk_bool(std::min(x, y), 64);
+}
+
+bool Aug_OutMsgQueue::eval_empty(vm::CellBuilder& cb) const {
+  return cb.store_long_bool(0, 64);
+}
+
+bool Aug_OutMsgQueue::eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const {
+  Ref<vm::Cell> msg_env;
+  unsigned long long created_lt;
+  return cs.fetch_ref_to(msg_env) && t_MsgEnvelope.get_created_lt(load_cell_slice(std::move(msg_env)), created_lt) &&
+         cb.store_ulong_rchk_bool(created_lt, 64);
+}
+
+const Aug_OutMsgQueue aug_OutMsgQueue;
+const OutMsgQueue t_OutMsgQueue;
+
+const ProcessedUpto t_ProcessedUpto;
+const HashmapE t_ProcessedInfo{96, t_ProcessedUpto};
+const HashmapE t_IhrPendingInfo{256, t_uint128};
+
+// _ out_queue:OutMsgQueue proc_info:ProcessedInfo = OutMsgQueueInfo;
+bool OutMsgQueueInfo::skip(vm::CellSlice& cs) const {
+  return t_OutMsgQueue.skip(cs) && t_ProcessedInfo.skip(cs) && t_IhrPendingInfo.skip(cs);
+}
+
+bool OutMsgQueueInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_OutMsgQueue.validate_skip(cs, weak) && t_ProcessedInfo.validate_skip(cs, weak) &&
+         t_IhrPendingInfo.validate_skip(cs, weak);
+}
+
+const OutMsgQueueInfo t_OutMsgQueueInfo;
+const RefTo<OutMsgQueueInfo> t_Ref_OutMsgQueueInfo;
+
+bool ExtBlkRef::unpack(vm::CellSlice& cs, ton::BlockIdExt& blkid, ton::LogicalTime* end_lt) const {
+  block::gen::ExtBlkRef::Record data;
+  if (!tlb::unpack(cs, data)) {
+    blkid.invalidate();
+    return false;
+  }
+  blkid.id = ton::BlockId{ton::masterchainId, ton::shardIdAll, data.seq_no};
+  blkid.root_hash = data.root_hash;
+  blkid.file_hash = data.file_hash;
+  if (end_lt) {
+    *end_lt = data.end_lt;
+  }
+  return true;
+}
+
+bool ExtBlkRef::unpack(Ref<vm::CellSlice> cs_ref, ton::BlockIdExt& blkid, ton::LogicalTime* end_lt) const {
+  block::gen::ExtBlkRef::Record data;
+  if (!tlb::csr_unpack_safe(std::move(cs_ref), data)) {
+    blkid.invalidate();
+    return false;
+  }
+  blkid.id = ton::BlockId{ton::masterchainId, ton::shardIdAll, data.seq_no};
+  blkid.root_hash = data.root_hash;
+  blkid.file_hash = data.file_hash;
+  if (end_lt) {
+    *end_lt = data.end_lt;
+  }
+  return true;
+}
+
+const ExtBlkRef t_ExtBlkRef;
+const BlkMasterInfo t_BlkMasterInfo;
+
+bool ShardIdent::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int shard_pfx_len, workchain_id;
+  unsigned long long shard_pfx;
+  if (cs.fetch_ulong(2) == 0 && cs.fetch_uint_to(6, shard_pfx_len) && cs.fetch_int_to(32, workchain_id) &&
+      workchain_id != ton::workchainInvalid && cs.fetch_uint_to(64, shard_pfx)) {
+    auto pow2 = (1ULL << (63 - shard_pfx_len));
+    if (!(shard_pfx & (pow2 - 1))) {
+      return true;
+    }
+  }
+  return false;
+}
+
+bool ShardIdent::Record::check() const {
+  return workchain_id != ton::workchainInvalid && !(shard_prefix & ((1ULL << (63 - shard_pfx_bits)) - 1));
+}
+
+bool ShardIdent::unpack(vm::CellSlice& cs, ShardIdent::Record& data) const {
+  if (cs.fetch_ulong(2) == 0 && cs.fetch_uint_to(6, data.shard_pfx_bits) && cs.fetch_int_to(32, data.workchain_id) &&
+      cs.fetch_uint_to(64, data.shard_prefix) && data.check()) {
+    return true;
+  } else {
+    data.invalidate();
+    return false;
+  }
+}
+
+bool ShardIdent::pack(vm::CellBuilder& cb, const Record& data) const {
+  return data.check() && cb.store_ulong_rchk_bool(0, 2) && cb.store_ulong_rchk_bool(data.shard_pfx_bits, 6) &&
+         cb.store_long_rchk_bool(data.workchain_id, 32) && cb.store_ulong_rchk_bool(data.shard_prefix, 64);
+}
+
+bool ShardIdent::unpack(vm::CellSlice& cs, ton::WorkchainId& workchain, ton::ShardId& shard) const {
+  int bits;
+  unsigned long long pow2;
+  auto assign = [](auto& a, auto b) { return a = b; };
+  auto assign_or = [](auto& a, auto b) { return a |= b; };
+  return cs.fetch_ulong(2) == 0                  // shard_ident$00
+         && cs.fetch_uint_leq(60, bits)          // shard_pfx_bits:(#<= 60)
+         && assign(pow2, (1ULL << (63 - bits)))  // (power)
+         && cs.fetch_int_to(32, workchain)       // workchain_id:int32
+         && cs.fetch_uint_to(64, shard)          // shard_prefix:uint64
+         && workchain != ton::workchainInvalid && !(shard & (2 * pow2 - 1)) && assign_or(shard, pow2);
+}
+
+bool ShardIdent::unpack(vm::CellSlice& cs, ton::ShardIdFull& data) const {
+  return unpack(cs, data.workchain, data.shard);
+}
+
+bool ShardIdent::pack(vm::CellBuilder& cb, ton::WorkchainId workchain, ton::ShardId shard) const {
+  int bits = ton::shard_prefix_length(shard);
+  return workchain != ton::workchainInvalid               // check workchain
+         && shard                                         // check shard
+         && cb.store_long_bool(0, 2)                      // shard_ident$00
+         && cb.store_uint_leq(60, bits)                   // shard_pfx_bits:(#<= 60)
+         && cb.store_long_bool(workchain, 32)             // workchain_id:int32
+         && cb.store_long_bool(shard & (shard - 1), 64);  // shard_prefix:uint64
+}
+
+bool ShardIdent::pack(vm::CellBuilder& cb, ton::ShardIdFull data) const {
+  return pack(cb, data.workchain, data.shard);
+}
+
+const ShardIdent t_ShardIdent;
+
+bool BlockIdExt::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_ShardIdent.validate_skip(cs, weak) && cs.advance(32 + 256 * 2);
+}
+
+bool BlockIdExt::unpack(vm::CellSlice& cs, ton::BlockIdExt& data) const {
+  return t_ShardIdent.unpack(cs, data.id.workchain, data.id.shard)  // block_id_ext$_ shard_id:ShardIdent
+         && cs.fetch_uint_to(32, data.id.seqno)                     // seq_no:uint32
+         && cs.fetch_bits_to(data.root_hash)                        // root_hash:bits256
+         && cs.fetch_bits_to(data.file_hash);                       // file_hash:bits256
+}
+
+bool BlockIdExt::pack(vm::CellBuilder& cb, const ton::BlockIdExt& data) const {
+  return t_ShardIdent.pack(cb, data.id.workchain, data.id.shard)  // block_id_ext$_ shard_id:ShardIdent
+         && cb.store_long_bool(data.id.seqno, 32)                 // seq_no:uint32
+         && cb.store_bits_bool(data.root_hash)                    // root_hash:bits256
+         && cb.store_bits_bool(data.file_hash);                   // file_hash:bits256
+}
+
+const BlockIdExt t_BlockIdExt;
+
+bool ShardState::skip(vm::CellSlice& cs) const {
+  return get_tag(cs) == shard_state && cs.advance(64)  // shard_state#9023afe2 blockchain_id:int32
+         && t_ShardIdent.skip(cs)                      // shard_id:ShardIdent
+         && cs.advance(32 + 32 + 32 + 64 +
+                       32)  // seq_no:int32 vert_seq_no:# gen_utime:uint32 gen_lt:uint64 min_ref_mc_seqno:uint32
+         && t_Ref_OutMsgQueueInfo.skip(cs)  // out_msg_queue_info:^OutMsgQueueInfo
+         && cs.advance(1)                   // before_split:Bool
+         && cs.advance_refs(1)              // accounts:^ShardAccounts
+         &&
+         cs.advance_refs(
+             1)  // ^[ total_balance:CurrencyCollection total_validator_fees:CurrencyCollection libraries:(HashmapE 256 LibDescr) master_ref:(Maybe BlkMasterInfo) ]
+         && Maybe<RefTo<McStateExtra>>{}.skip(cs);  // custom:(Maybe ^McStateExtra)
+}
+
+bool ShardState::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int seq_no;
+  return get_tag(cs) == shard_state && cs.advance(64)  // shard_state#9023afe2 blockchain_id:int32
+         && t_ShardIdent.validate_skip(cs, weak)       // shard_id:ShardIdent
+         && cs.fetch_int_to(32, seq_no)                // seq_no:int32
+         && seq_no >= -1                               // { seq_no >= -1 }
+         && cs.advance(32 + 32 + 64 + 32)  // vert_seq_no:# gen_utime:uint32 gen_lt:uint64 min_ref_mc_seqno:uint32
+         && t_Ref_OutMsgQueueInfo.validate_skip(cs, weak)  // out_msg_queue_info:^OutMsgQueueInfo
+         && cs.advance(1)                                  // before_split:Bool
+         && t_ShardAccounts.validate_skip_ref(cs, weak)    // accounts:^ShardAccounts
+         &&
+         t_ShardState_aux.validate_skip_ref(
+             cs,
+             weak)  // ^[ total_balance:CurrencyCollection total_validator_fees:CurrencyCollection libraries:(HashmapE 256 LibDescr) master_ref:(Maybe BlkMasterInfo) ]
+         && Maybe<RefTo<McStateExtra>>{}.validate_skip(cs, weak);  // custom:(Maybe ^McStateExtra)
+}
+
+const ShardState t_ShardState;
+
+bool ShardState_aux::skip(vm::CellSlice& cs) const {
+  return cs.advance(128)                        // overload_history:uint64 underload_history:uint64
+         && t_CurrencyCollection.skip(cs)       // total_balance:CurrencyCollection
+         && t_CurrencyCollection.skip(cs)       // total_validator_fees:CurrencyCollection
+         && HashmapE{256, t_LibDescr}.skip(cs)  // libraries:(HashmapE 256 LibDescr)
+         && Maybe<BlkMasterInfo>{}.skip(cs);    // master_ref:(Maybe BlkMasterInfo)
+}
+
+bool ShardState_aux::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return cs.advance(128)                                       // overload_history:uint64 underload_history:uint64
+         && t_CurrencyCollection.validate_skip(cs, weak)       // total_balance:CurrencyCollection
+         && t_CurrencyCollection.validate_skip(cs, weak)       // total_validator_fees:CurrencyCollection
+         && HashmapE{256, t_LibDescr}.validate_skip(cs, weak)  // libraries:(HashmapE 256 LibDescr)
+         && Maybe<BlkMasterInfo>{}.validate_skip(cs, weak);    // master_ref:(Maybe BlkMasterInfo)
+}
+
+const ShardState_aux t_ShardState_aux;
+
+bool LibDescr::skip(vm::CellSlice& cs) const {
+  return cs.advance(2)                      // shared_lib_descr$00
+         && cs.fetch_ref().not_null()       // lib:^Cell
+         && Hashmap{256, t_True}.skip(cs);  // publishers:(Hashmap 256 False)
+}
+
+bool LibDescr::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return get_tag(cs) == shared_lib_descr && cs.advance(2)  // shared_lib_descr$00
+         && cs.fetch_ref().not_null()                      // lib:^Cell
+         && Hashmap{256, t_True}.validate_skip(cs, weak);  // publishers:(Hashmap 256 False)
+}
+
+const LibDescr t_LibDescr;
+
+bool BlkPrevInfo::skip(vm::CellSlice& cs) const {
+  return t_ExtBlkRef.skip(cs)                   // prev_blk_info$_ {merged:#} prev:ExtBlkRef
+         && (!merged || t_ExtBlkRef.skip(cs));  // prev_alt:merged?ExtBlkRef
+}
+
+bool BlkPrevInfo::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_ExtBlkRef.validate_skip(cs, weak)                   // prev_blk_info$_ {merged:#} prev:ExtBlkRef
+         && (!merged || t_ExtBlkRef.validate_skip(cs, weak));  // prev_alt:merged?ExtBlkRef
+}
+
+const BlkPrevInfo t_BlkPrevInfo_0{0};
+
+bool McStateExtra::skip(vm::CellSlice& cs) const {
+  return block::gen::t_McStateExtra.skip(cs);
+}
+
+bool McStateExtra::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return block::gen::t_McStateExtra.validate_skip(cs, weak);  // ??
+}
+
+const McStateExtra t_McStateExtra;
+
+const KeyExtBlkRef t_KeyExtBlkRef;
+
+bool KeyMaxLt::add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const {
+  bool key1, key2;
+  unsigned long long lt1, lt2;
+  return cs1.fetch_bool_to(key1) && cs1.fetch_ulong_bool(64, lt1)     // cs1 => _ key:Bool max_end_lt:uint64 = KeyMaxLt;
+         && cs2.fetch_bool_to(key2) && cs2.fetch_ulong_bool(64, lt2)  // cs2 => _ key:Bool max_end_lt:uint64 = KeyMaxLt;
+         && cb.store_bool_bool(key1 | key2) && cb.store_long_bool(std::max(lt1, lt2), 64);
+}
+
+const KeyMaxLt t_KeyMaxLt;
+
+bool Aug_OldMcBlocksInfo::eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const {
+  return cs.have(65) && cb.append_bitslice(cs.prefetch_bits(65));  // copy first 1+64 bits
+};
+
+const Aug_OldMcBlocksInfo aug_OldMcBlocksInfo;
+
+bool ShardFeeCreated::skip(vm::CellSlice& cs) const {
+  return t_CurrencyCollection.skip(cs) && t_CurrencyCollection.skip(cs);
+}
+
+bool ShardFeeCreated::validate_skip(vm::CellSlice& cs, bool weak) const {
+  return t_CurrencyCollection.validate_skip(cs, weak) && t_CurrencyCollection.validate_skip(cs, weak);
+}
+
+bool ShardFeeCreated::null_value(vm::CellBuilder& cb) const {
+  return t_CurrencyCollection.null_value(cb) && t_CurrencyCollection.null_value(cb);
+}
+
+bool ShardFeeCreated::add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const {
+  return t_CurrencyCollection.add_values(cb, cs1, cs2) && t_CurrencyCollection.add_values(cb, cs1, cs2);
+}
+
+const ShardFeeCreated t_ShardFeeCreated;
+
+bool Aug_ShardFees::eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const {
+  return cb.append_cellslice_bool(cs) && t_ShardFeeCreated.skip(cs) && cs.empty_ext();
+};
+
+const Aug_ShardFees aug_ShardFees;
+
+}  // namespace tlb
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/block-parse.h b/submodules/ton/tonlib-src/crypto/block/block-parse.h
new file mode 100644
index 0000000000..381dc149f3
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/block-parse.h
@@ -0,0 +1,1081 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "common/refcnt.hpp"
+#include "vm/cells.h"
+#include "vm/cellslice.h"
+#include "vm/dict.h"
+#include "vm/boc.h"
+#include "block/block.h"
+#include <ostream>
+#include "tl/tlblib.hpp"
+#include "td/utils/bits.h"
+#include "td/utils/StringBuilder.h"
+#include "ton/ton-types.h"
+
+namespace block {
+
+using td::Ref;
+
+namespace tlb {
+using namespace ::tlb;
+
+struct Anycast final : TLB {
+  int get_size(const vm::CellSlice& cs) const override {
+    return cs.have(5) ? 5 + (int)cs.prefetch_ulong(5) : -1;
+  }
+  bool skip_get_depth(vm::CellSlice& cs, int& depth) const {
+    return cs.fetch_uint_leq(30, depth) && cs.advance(depth);
+  }
+};
+
+extern const Anycast t_Anycast;
+
+struct Maybe_Anycast final : public Maybe<Anycast> {
+  bool skip_get_depth(vm::CellSlice& cs, int& depth) const;
+};
+
+extern const Maybe_Anycast t_Maybe_Anycast;
+
+struct VarUInteger final : TLB_Complex {
+  int n, ln;
+  VarUInteger(int _n) : n(_n) {
+    ln = 32 - td::count_leading_zeroes32(n - 1);
+  }
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  td::RefInt256 as_integer_skip(vm::CellSlice& cs) const override;
+  unsigned long long as_uint(const vm::CellSlice& cs) const override;
+  bool null_value(vm::CellBuilder& cb) const override {
+    return cb.store_zeroes_bool(ln);
+  }
+  bool store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const override;
+  unsigned precompute_integer_size(const td::BigInt256& value) const;
+  unsigned precompute_integer_size(td::RefInt256 value) const;
+};
+
+extern const VarUInteger t_VarUInteger_3, t_VarUInteger_7, t_VarUInteger_16, t_VarUInteger_32;
+
+struct VarUIntegerPos final : TLB_Complex {
+  int n, ln;
+  VarUIntegerPos(int _n) : n(_n) {
+    ln = 32 - td::count_leading_zeroes32(n - 1);
+  }
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  td::RefInt256 as_integer_skip(vm::CellSlice& cs) const override;
+  unsigned long long as_uint(const vm::CellSlice& cs) const override;
+  bool store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const override;
+};
+
+extern const VarUIntegerPos t_VarUIntegerPos_16, t_VarUIntegerPos_32;
+
+struct VarInteger final : TLB_Complex {
+  int n, ln;
+  VarInteger(int _n) : n(_n) {
+    ln = 32 - td::count_leading_zeroes32(n - 1);
+  }
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  td::RefInt256 as_integer_skip(vm::CellSlice& cs) const override;
+  long long as_int(const vm::CellSlice& cs) const override;
+  bool null_value(vm::CellBuilder& cb) const override {
+    return cb.store_zeroes_bool(ln);
+  }
+  bool store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const override;
+};
+
+struct VarIntegerNz final : TLB_Complex {
+  int n, ln;
+  VarIntegerNz(int _n) : n(_n) {
+    ln = 32 - td::count_leading_zeroes32(n - 1);
+  }
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  td::RefInt256 as_integer_skip(vm::CellSlice& cs) const override;
+  long long as_int(const vm::CellSlice& cs) const override;
+  bool store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const override;
+};
+
+struct Unary final : TLB {
+  int get_size(const vm::CellSlice& cs) const override {
+    return cs.count_leading(1) + 1;
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak, int& n) const {
+    return cs.advance((n = cs.count_leading(1)) + 1);
+  }
+  bool skip(vm::CellSlice& cs, int& n) const {
+    return validate_skip(cs, false, n);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(get_size(cs));
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return validate_skip(cs);
+  }
+  bool validate(const vm::CellSlice& cs, bool weak = false) const override {
+    return cs.have(get_size(cs));
+  }
+};
+
+extern const Unary t_Unary;
+
+struct HmLabel final : TLB_Complex {
+  enum { hml_short = 0, hml_long = 2, hml_same = 3 };
+  int m;  // max size
+  HmLabel(int _m) : m(_m) {
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak, int& n) const;
+  bool skip(vm::CellSlice& cs, int& n) const {
+    return validate_skip(cs, false, n);
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    int n;
+    return skip(cs, n);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    int n;
+    return validate_skip(cs, weak, n);
+  }
+  int get_tag(const vm::CellSlice& cs) const override;
+};
+
+struct Hashmap final : TLB_Complex {
+  const TLB& value_type;
+  int n;
+  Hashmap(int _n, const TLB& _val_type) : value_type(_val_type), n(_n) {
+  }
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+};
+
+struct HashmapNode final : TLB_Complex {
+  enum { hmn_leaf = 0, hmn_fork = 1 };
+  const TLB& value_type;
+  int n;
+  HashmapNode(int _n, const TLB& _val_type) : value_type(_val_type), n(_n) {
+  }
+  int get_size(const vm::CellSlice& cs) const override;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return n > 0 ? hmn_fork : n;
+  }
+};
+
+struct HashmapE final : TLB {
+  enum { hme_empty = 0, hme_root = 1 };
+  Hashmap root_type;
+  HashmapE(int _n, const TLB& _val_type) : root_type(_n, _val_type) {
+  }
+  int get_size(const vm::CellSlice& cs) const override;
+  bool validate(const vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+  bool null_value(vm::CellBuilder& cb) const override {
+    return cb.store_zeroes_bool(1);
+  }
+  bool add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const override;
+  int sub_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const override;
+  bool add_values_ref(Ref<vm::Cell>& res, Ref<vm::Cell> arg1, Ref<vm::Cell> arg2) const;
+  int sub_values_ref(Ref<vm::Cell>& res, Ref<vm::Cell> arg1, Ref<vm::Cell> arg2) const;
+  bool store_ref(vm::CellBuilder& cb, Ref<vm::Cell> arg) const;
+};
+
+struct AugmentationCheckData : vm::dict::AugmentationData {
+  const TLB& value_type;
+  const TLB& extra_type;
+  AugmentationCheckData(const TLB& val_type, const TLB& ex_type) : value_type(val_type), extra_type(ex_type) {
+  }
+  bool skip_extra(vm::CellSlice& cs) const override {
+    return extra_type.skip(cs);
+  }
+  bool eval_fork(vm::CellBuilder& cb, vm::CellSlice& left_cs, vm::CellSlice& right_cs) const override {
+    return extra_type.add_values(cb, left_cs, right_cs);
+  }
+  bool eval_empty(vm::CellBuilder& cb) const override {
+    return extra_type.null_value(cb);
+  }
+};
+
+struct HashmapAug final : TLB_Complex {
+  const AugmentationCheckData& aug;
+  int n;
+  HashmapAug(int _n, const AugmentationCheckData& _aug) : aug(_aug), n(_n) {
+  }
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool extract_extra(vm::CellSlice& cs) const;
+};
+
+struct HashmapAugNode final : TLB_Complex {
+  enum { ahmn_leaf = 0, ahmn_fork = 1 };
+  const AugmentationCheckData& aug;
+  int n;
+  HashmapAugNode(int _n, const AugmentationCheckData& _aug) : aug(_aug), n(_n) {
+  }
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return n > 0 ? ahmn_fork : n;
+  }
+};
+
+struct HashmapAugE final : TLB_Complex {
+  enum { ahme_empty = 0, ahme_root = 1 };
+  HashmapAug root_type;
+  HashmapAugE(int _n, const AugmentationCheckData& _aug) : root_type(_n, std::move(_aug)) {
+  }
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool extract_extra(vm::CellSlice& cs) const;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+struct Grams final : TLB_Complex {
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  td::RefInt256 as_integer_skip(vm::CellSlice& cs) const override;
+  bool null_value(vm::CellBuilder& cb) const override;
+  bool store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const override;
+  unsigned precompute_size(const td::BigInt256& value) const;
+  unsigned precompute_size(td::RefInt256 value) const;
+};
+
+extern const Grams t_Grams;
+
+struct MsgAddressInt final : TLB_Complex {
+  enum { addr_std = 2, addr_var = 3 };
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(2);
+  }
+  static ton::AccountIdPrefixFull get_prefix(vm::CellSlice&& cs);
+  static ton::AccountIdPrefixFull get_prefix(const vm::CellSlice& cs);
+  static ton::AccountIdPrefixFull get_prefix(Ref<vm::CellSlice> cs_ref);
+  static bool get_prefix_to(vm::CellSlice&& cs, ton::AccountIdPrefixFull& pfx) {
+    return (pfx = get_prefix(std::move(cs))).is_valid();
+  }
+  static bool get_prefix_to(const vm::CellSlice& cs, ton::AccountIdPrefixFull& pfx) {
+    return (pfx = get_prefix(cs)).is_valid();
+  }
+  static bool get_prefix_to(Ref<vm::CellSlice> cs_ref, ton::AccountIdPrefixFull& pfx) {
+    return cs_ref.not_null() && (pfx = get_prefix(std::move(cs_ref))).is_valid();
+  }
+  bool skip_get_depth(vm::CellSlice& cs, int& depth) const;
+  bool extract_std_address(Ref<vm::CellSlice> cs_ref, ton::WorkchainId& workchain, ton::StdSmcAddress& addr,
+                           bool rewrite = true) const;
+  bool extract_std_address(vm::CellSlice& cs, ton::WorkchainId& workchain, ton::StdSmcAddress& addr,
+                           bool rewrite = true) const;
+};
+
+extern const MsgAddressInt t_MsgAddressInt;
+
+struct MsgAddressExt final : TLB {
+  enum { addr_none = 0, addr_ext = 1 };
+  int get_size(const vm::CellSlice& cs) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(2);
+  }
+};
+
+extern const MsgAddressExt t_MsgAddressExt;
+
+struct MsgAddress final : TLB_Complex {
+  enum { addr_none = 0, addr_ext = 1, addr_std = 2, addr_var = 3 };
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(2);
+  }
+};
+
+extern const MsgAddress t_MsgAddress;
+
+struct ExtraCurrencyCollection final : TLB {
+  HashmapE dict_type;
+  ExtraCurrencyCollection() : dict_type(32, t_VarUIntegerPos_32) {
+  }
+  int get_size(const vm::CellSlice& cs) const override {
+    return dict_type.get_size(cs);
+  }
+  bool validate(const vm::CellSlice& cs, bool weak) const override {
+    return dict_type.validate(cs, weak);
+  }
+  bool null_value(vm::CellBuilder& cb) const override {
+    return cb.store_zeroes_bool(1);
+  }
+  bool add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const override {
+    return dict_type.add_values(cb, cs1, cs2);
+  }
+  int sub_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const override {
+    return dict_type.sub_values(cb, cs1, cs2);
+  }
+  bool add_values_ref(Ref<vm::Cell>& res, Ref<vm::Cell> arg1, Ref<vm::Cell> arg2) const {
+    return dict_type.add_values_ref(res, std::move(arg1), std::move(arg2));
+  }
+  int sub_values_ref(Ref<vm::Cell>& res, Ref<vm::Cell> arg1, Ref<vm::Cell> arg2) const {
+    return dict_type.sub_values_ref(res, std::move(arg1), std::move(arg2));
+  }
+  bool store_ref(vm::CellBuilder& cb, Ref<vm::Cell> arg) const {
+    return dict_type.store_ref(cb, std::move(arg));
+  }
+  unsigned precompute_size(Ref<vm::Cell> arg) const {
+    return arg.is_null() ? 1 : 0x10001;
+  }
+};
+
+extern const ExtraCurrencyCollection t_ExtraCurrencyCollection;
+
+struct CurrencyCollection final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  td::RefInt256 as_integer_skip(vm::CellSlice& cs) const override;
+  bool null_value(vm::CellBuilder& cb) const override {
+    return cb.store_bits_same_bool(1 + 4, false);
+  }
+  bool add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const override;
+  bool unpack_special(vm::CellSlice& cs, td::RefInt256& balance, Ref<vm::Cell>& extra, bool inexact = false) const;
+  bool unpack_special(vm::CellSlice& cs, block::CurrencyCollection& value, bool inexact = false) const;
+  bool pack_special(vm::CellBuilder& cb, td::RefInt256 balance, Ref<vm::Cell> extra) const;
+  bool pack_special(vm::CellBuilder& cb, const block::CurrencyCollection& value) const;
+  bool pack_special(vm::CellBuilder& cb, block::CurrencyCollection&& value) const;
+  bool unpack(vm::CellSlice& cs, block::CurrencyCollection& res) const;
+  bool pack(vm::CellBuilder& cb, const block::CurrencyCollection& res) const;
+  unsigned precompute_size(td::RefInt256 balance, Ref<vm::Cell> extra) const {
+    return t_Grams.precompute_size(std::move(balance)) + t_ExtraCurrencyCollection.precompute_size(std::move(extra));
+  }
+};
+
+extern const CurrencyCollection t_CurrencyCollection;
+
+struct CommonMsgInfo final : TLB_Complex {
+  enum { int_msg_info = 0, ext_in_msg_info = 2, ext_out_msg_info = 3 };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    int v = (int)cs.prefetch_ulong(2);
+    return v == 1 ? int_msg_info : v;
+  }
+  struct Record_int_msg_info;
+  bool unpack(vm::CellSlice& cs, Record_int_msg_info& data) const;
+  bool get_created_lt(vm::CellSlice& cs, unsigned long long& created_lt) const;
+  bool is_internal(const vm::CellSlice& cs) const {
+    return get_tag(cs) == int_msg_info;
+  }
+};
+
+struct CommonMsgInfo::Record_int_msg_info {
+  bool ihr_disabled, bounce, bounced;
+  Ref<vm::CellSlice> src, dest, value, ihr_fee, fwd_fee;
+  unsigned long long created_lt;
+  unsigned created_at;
+};
+
+extern const CommonMsgInfo t_CommonMsgInfo;
+
+struct TickTock final : TLB {
+  int get_size(const vm::CellSlice& cs) const override {
+    return 2;
+  }
+};
+
+extern const TickTock t_TickTock;
+
+struct StateInit final : TLB_Complex {
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool get_ticktock(vm::CellSlice& cs, int& ticktock) const;
+};
+
+extern const StateInit t_StateInit;
+
+struct Message final : TLB_Complex {
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool extract_info(vm::CellSlice& cs) const;
+  bool get_created_lt(vm::CellSlice& cs, unsigned long long& created_lt) const;
+  bool is_internal(const vm::CellSlice& cs) const {
+    return t_CommonMsgInfo.is_internal(cs);
+  }
+  bool is_internal(Ref<vm::Cell> ref) const;
+};
+
+extern const Message t_Message;
+extern const RefTo<Message> t_Ref_Message;
+
+struct IntermediateAddress final : TLB_Complex {
+  enum { interm_addr_regular = 0, interm_addr_simple = 2, interm_addr_ext = 3 };
+  int get_size(const vm::CellSlice& cs) const override;
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool fetch_regular(vm::CellSlice& cs, int& use_dst_bits) const {
+    return cs.fetch_uint_to(8, use_dst_bits) && use_dst_bits <= 96;
+  }
+  int get_tag(const vm::CellSlice& cs) const override {
+    int v = (int)cs.prefetch_ulong(2);
+    return v == 1 ? interm_addr_regular : v;
+  }
+};
+
+extern const IntermediateAddress t_IntermediateAddress;
+
+struct MsgEnvelope final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool extract_fwd_fees_remaining(vm::CellSlice& cs) const;
+  struct Record {
+    typedef MsgEnvelope type_class;
+    Ref<vm::CellSlice> cur_addr, next_addr, fwd_fee_remaining;
+    Ref<vm::Cell> msg;
+  };
+  struct Record_std {
+    typedef MsgEnvelope type_class;
+    int cur_addr, next_addr;
+    td::RefInt256 fwd_fee_remaining;
+    Ref<vm::Cell> msg;
+  };
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool unpack(vm::CellSlice& cs, Record_std& data) const;
+  bool unpack_std(vm::CellSlice& cs, int& cur_a, int& nhop_a, Ref<vm::Cell>& msg) const;
+  bool get_created_lt(const vm::CellSlice& cs, unsigned long long& created_lt) const;
+};
+
+extern const MsgEnvelope t_MsgEnvelope;
+extern const RefTo<MsgEnvelope> t_Ref_MsgEnvelope;
+
+struct StorageUsed final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+};
+
+extern const StorageUsed t_StorageUsed;
+
+struct StorageUsedShort final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+};
+
+extern const StorageUsedShort t_StorageUsedShort;
+
+struct StorageInfo final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+};
+
+extern const StorageInfo t_StorageInfo;
+
+struct AccountState final : TLB_Complex {
+  enum { account_uninit = 0, account_frozen = 1, account_active = 2 };
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    int t = (int)cs.prefetch_ulong(2);
+    return t == 3 ? account_active : t;
+  }
+  bool get_ticktock(vm::CellSlice& cs, int& ticktock) const;
+};
+
+extern const AccountState t_AccountState;
+
+struct AccountStorage final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool skip_copy_balance(vm::CellBuilder& cb, vm::CellSlice& cs) const;
+};
+
+extern const AccountStorage t_AccountStorage;
+
+struct Account final : TLB_Complex {
+  enum { account_none = 0, account = 1 };
+  bool allow_empty;
+  Account(bool _allow_empty = false) : allow_empty(_allow_empty) {
+  }
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  // Ref<vm::CellSlice> get_balance(const vm::CellSlice& cs) const;
+  bool skip_copy_balance(vm::CellBuilder& cb, vm::CellSlice& cs) const;
+  bool skip_copy_depth_balance(vm::CellBuilder& cb, vm::CellSlice& cs) const;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+extern const Account t_Account, t_AccountE;
+extern const RefTo<Account> t_Ref_Account;
+
+struct AccountStatus final : TLB {
+  enum { acc_state_uninit, acc_state_frozen, acc_state_active, acc_state_nonexist };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 2;
+  }
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(2);
+  }
+};
+
+extern const AccountStatus t_AccountStatus;
+
+struct ShardAccount final : TLB_Complex {
+  struct Record {
+    using Type = ShardAccount;
+    Ref<vm::Cell> account;
+    ton::LogicalTime last_trans_lt;
+    ton::Bits256 last_trans_hash;
+    bool valid{false};
+    bool is_zero{false};
+    bool reset();
+    bool unpack(vm::CellSlice& cs);
+    bool unpack(Ref<vm::CellSlice> cs_ref);
+    bool invalidate() {
+      return valid = false;
+    }
+  };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0x10140;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance_ext(0x140, 1);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.advance(0x140) && t_Ref_Account.validate_skip(cs, weak);
+  }
+  static bool unpack(vm::CellSlice& cs, Record& info) {
+    return info.unpack(cs);
+  }
+  static bool unpack(Ref<vm::CellSlice> cs_ref, Record& info) {
+    return info.unpack(std::move(cs_ref));
+  }
+  static bool extract_account_state(Ref<vm::CellSlice> cs_ref, Ref<vm::Cell>& acc_state);
+};
+
+extern const ShardAccount t_ShardAccount;
+
+struct DepthBalanceInfo final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool null_value(vm::CellBuilder& cb) const override;
+  bool add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const override;
+};
+
+extern const DepthBalanceInfo t_DepthBalanceInfo;
+
+struct Aug_ShardAccounts final : AugmentationCheckData {
+  Aug_ShardAccounts() : AugmentationCheckData(t_ShardAccount, t_DepthBalanceInfo) {
+  }
+  bool eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const override;
+};
+
+extern const Aug_ShardAccounts aug_ShardAccounts;
+
+struct ShardAccounts final : TLB_Complex {
+  HashmapAugE dict_type;
+  ShardAccounts() : dict_type(256, aug_ShardAccounts){};
+  bool skip(vm::CellSlice& cs) const override {
+    return dict_type.skip(cs);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return dict_type.validate_skip(cs, weak);
+  }
+};
+
+extern const ShardAccounts t_ShardAccounts;
+
+struct AccStatusChange final : TLB {
+  enum { acst_unchanged = 0, acst_frozen = 2, acst_deleted = 3 };
+  int get_size(const vm::CellSlice& cs) const override {
+    return cs.prefetch_ulong(1) ? 2 : 1;
+  }
+  int get_tag(const vm::CellSlice& cs) const override {
+    if (cs.size() == 1) {
+      return (int)cs.prefetch_ulong(1) ? -1 : acst_unchanged;
+    }
+    int v = (int)cs.prefetch_ulong(2);
+    return v == 1 ? acst_unchanged : v;
+  }
+};
+
+extern const AccStatusChange t_AccStatusChange;
+
+struct TrStoragePhase final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+};
+
+extern const TrStoragePhase t_TrStoragePhase;
+
+struct TrCreditPhase final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+};
+
+extern const TrCreditPhase t_TrCreditPhase;
+
+struct TrComputeInternal1 final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+};
+
+struct ComputeSkipReason final : TLB {
+  enum { cskip_no_state = 0, cskip_bad_state = 1, cskip_no_gas = 2 };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 2;
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return get_tag(cs) >= 0 && cs.advance(2);
+  }
+  int get_tag(const vm::CellSlice& cs) const override {
+    int t = (int)cs.prefetch_ulong(2);
+    return t < 3 ? t : -1;
+  }
+};
+
+extern const ComputeSkipReason t_ComputeSkipReason;
+
+struct TrComputePhase final : TLB_Complex {
+  enum { tr_phase_compute_skipped = 0, tr_phase_compute_vm = 1 };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+};
+
+extern const TrComputePhase t_TrComputePhase;
+
+struct TrActionPhase final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+};
+
+extern const TrActionPhase t_TrActionPhase;
+
+struct TrBouncePhase final : TLB_Complex {
+  enum { tr_phase_bounce_negfunds = 0, tr_phase_bounce_nofunds = 1, tr_phase_bounce_ok = 2 };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override;
+};
+
+extern const TrBouncePhase t_TrBouncePhase;
+
+struct SplitMergeInfo final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+};
+
+extern const SplitMergeInfo t_SplitMergeInfo;
+
+struct TransactionDescr final : TLB_Complex {
+  enum {
+    trans_ord = 0,
+    trans_storage = 1,
+    trans_tick_tock = 2,
+    trans_split_prepare = 4,
+    trans_split_install = 5,
+    trans_merge_prepare = 6,
+    trans_merge_install = 7
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override;
+};
+
+extern const TransactionDescr t_TransactionDescr;
+
+struct Transaction_aux final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+};
+
+extern const Transaction_aux t_Transaction_aux;
+
+struct Transaction final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool get_total_fees(vm::CellSlice&& cs, block::CurrencyCollection& total_fees) const;
+};
+
+extern const Transaction t_Transaction;
+extern const RefTo<Transaction> t_Ref_Transaction;
+
+struct Aug_AccountTransactions final : AugmentationCheckData {
+  Aug_AccountTransactions() : AugmentationCheckData(t_Ref_Transaction, t_CurrencyCollection) {
+  }
+  bool eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const override;
+};
+
+extern const Aug_AccountTransactions aug_AccountTransactions;
+extern const HashmapAug t_AccountTransactions;  // (HashmapAug 64 ^Transaction CurrencyCollection)
+
+struct HashUpdate final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(8 + 256 * 2);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.fetch_ulong(8) == 0x72 && cs.advance(256 * 2);
+  }
+};
+
+extern const HashUpdate t_HashUpdate;
+extern const RefTo<HashUpdate> t_Ref_HashUpdate;
+
+struct AccountBlock final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool get_total_fees(vm::CellSlice&& cs, block::CurrencyCollection& total_fees) const;
+};
+
+extern const AccountBlock t_AccountBlock;
+
+struct Aug_ShardAccountBlocks final : AugmentationCheckData {
+  Aug_ShardAccountBlocks() : AugmentationCheckData(t_AccountBlock, t_CurrencyCollection) {
+  }
+  bool eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const override;
+};
+
+extern const Aug_ShardAccountBlocks aug_ShardAccountBlocks;
+extern const HashmapAugE t_ShardAccountBlocks;  // (HashmapAugE 256 AccountBlock CurrencyCollection)
+
+struct ImportFees final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool null_value(vm::CellBuilder& cb) const override {
+    return cb.store_bits_same_bool(4 + 4 + 1, false);
+  }
+  bool add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const override;
+};
+
+extern const ImportFees t_ImportFees;
+
+struct InMsg final : TLB_Complex {
+  enum {
+    msg_import_ext = 0,
+    msg_import_ihr = 2,
+    msg_import_imm = 3,
+    msg_import_fin = 4,
+    msg_import_tr = 5,
+    msg_discard_fin = 6,
+    msg_discard_tr = 7
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(3);
+  }
+  bool get_import_fees(vm::CellBuilder& cb, vm::CellSlice& cs) const;
+};
+
+extern const InMsg t_InMsg;
+
+struct OutMsg final : TLB_Complex {
+  enum {
+    msg_export_ext = 0,
+    msg_export_new = 1,
+    msg_export_imm = 2,
+    msg_export_tr = 3,
+    msg_export_deq_imm = 4,
+    msg_export_deq = 6,
+    msg_export_tr_req = 7
+  };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(3);
+  }
+  bool get_export_value(vm::CellBuilder& cb, vm::CellSlice& cs) const;
+  bool get_created_lt(vm::CellSlice& cs, unsigned long long& created_lt) const;
+};
+
+extern const OutMsg t_OutMsg;
+
+// next: InMsgDescr, OutMsgDescr, OutMsgQueue, and their augmentations
+
+struct Aug_InMsgDescr final : AugmentationCheckData {
+  Aug_InMsgDescr() : AugmentationCheckData(t_InMsg, t_ImportFees) {
+  }
+  bool eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const override {
+    return t_InMsg.get_import_fees(cb, cs);
+  }
+};
+
+extern const Aug_InMsgDescr aug_InMsgDescr;
+
+struct InMsgDescr final : TLB_Complex {
+  HashmapAugE dict_type;
+  InMsgDescr() : dict_type(256, aug_InMsgDescr){};
+  bool skip(vm::CellSlice& cs) const override {
+    return dict_type.skip(cs);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return dict_type.validate_skip(cs, weak);
+  }
+};
+
+extern const InMsgDescr t_InMsgDescr;
+
+struct Aug_OutMsgDescr final : AugmentationCheckData {
+  Aug_OutMsgDescr() : AugmentationCheckData(t_OutMsg, t_CurrencyCollection) {
+  }
+  bool eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const override {
+    return t_OutMsg.get_export_value(cb, cs);
+  }
+};
+
+extern const Aug_OutMsgDescr aug_OutMsgDescr;
+
+struct OutMsgDescr final : TLB_Complex {
+  HashmapAugE dict_type;
+  OutMsgDescr() : dict_type(256, aug_OutMsgDescr){};
+  bool skip(vm::CellSlice& cs) const override {
+    return dict_type.skip(cs);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return dict_type.validate_skip(cs, weak);
+  }
+};
+
+extern const OutMsgDescr t_OutMsgDescr;
+
+struct EnqueuedMsg final : TLB_Complex {
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0x10040;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance_ext(0x10040);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, EnqueuedMsgDescr& descr) const {
+    return descr.unpack(cs);
+  }
+};
+
+extern const EnqueuedMsg t_EnqueuedMsg;
+
+struct Aug_OutMsgQueue final : AugmentationCheckData {
+  Aug_OutMsgQueue() : AugmentationCheckData(t_EnqueuedMsg, t_uint64) {
+  }
+  bool eval_fork(vm::CellBuilder& cb, vm::CellSlice& left_cs, vm::CellSlice& right_cs) const override;
+  bool eval_empty(vm::CellBuilder& cb) const override;
+  bool eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const override;
+};
+
+extern const Aug_OutMsgQueue aug_OutMsgQueue;
+
+struct OutMsgQueue final : TLB_Complex {
+  HashmapAugE dict_type;
+  OutMsgQueue() : dict_type(32 + 64 + 256, aug_OutMsgQueue){};
+  bool skip(vm::CellSlice& cs) const override {
+    return dict_type.skip(cs);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return dict_type.validate_skip(cs, weak);
+  }
+};
+
+extern const OutMsgQueue t_OutMsgQueue;
+
+struct ProcessedUpto final : TLB {
+  int get_size(const vm::CellSlice& cs) const override {
+    return 64 + 256;
+  }
+};
+
+extern const ProcessedUpto t_ProcessedUpto;
+extern const HashmapE t_ProcessedInfo;
+extern const HashmapE t_IhrPendingInfo;
+
+struct OutMsgQueueInfo final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+};
+
+extern const OutMsgQueueInfo t_OutMsgQueueInfo;
+extern const RefTo<OutMsgQueueInfo> t_Ref_OutMsgQueueInfo;
+
+struct ExtBlkRef final : TLB {
+  enum { fixed_size = 64 + 32 + 256 * 2 };
+  int get_size(const vm::CellSlice& cs) const override {
+    return fixed_size;
+  }
+  bool unpack(vm::CellSlice& cs, ton::BlockIdExt& blkid, ton::LogicalTime* end_lt = nullptr) const;
+  bool unpack(Ref<vm::CellSlice> cs_ref, ton::BlockIdExt& blkid, ton::LogicalTime* end_lt = nullptr) const;
+};
+
+extern const ExtBlkRef t_ExtBlkRef;
+
+struct BlkMasterInfo final : TLB {
+  int get_size(const vm::CellSlice& cs) const override {
+    return t_ExtBlkRef.get_size(cs);
+  }
+};
+
+extern const BlkMasterInfo t_BlkMasterInfo;
+
+struct ShardIdent final : TLB_Complex {
+  struct Record;
+  int get_size(const vm::CellSlice& cs) const override {
+    return 2 + 6 + 32 + 64;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(get_size(cs));
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+  bool unpack(vm::CellSlice& cs, Record& data) const;
+  bool pack(vm::CellBuilder& cb, const Record& data) const;
+  bool unpack(vm::CellSlice& cs, ton::ShardIdFull& data) const;
+  bool pack(vm::CellBuilder& cb, ton::ShardIdFull data) const;
+  bool unpack(vm::CellSlice& cs, ton::WorkchainId& workchain, ton::ShardId& shard) const;
+  bool pack(vm::CellBuilder& cb, ton::WorkchainId workchain, ton::ShardId shard) const;
+};
+
+struct ShardIdent::Record {
+  int shard_pfx_bits;
+  int workchain_id;
+  unsigned long long shard_prefix;
+  Record() : shard_pfx_bits(-1) {
+  }
+  Record(int _pfxlen, int _wcid, unsigned long long _pfx)
+      : shard_pfx_bits(_pfxlen), workchain_id(_wcid), shard_prefix(_pfx) {
+  }
+  bool check() const;
+  bool is_valid() const {
+    return shard_pfx_bits >= 0;
+  }
+  void invalidate() {
+    shard_pfx_bits = -1;
+  }
+};
+
+extern const ShardIdent t_ShardIdent;
+
+struct BlockIdExt final : TLB_Complex {
+  int get_size(const vm::CellSlice& cs) const override {
+    return 2 + 6 + 32 + 64 + 32 + 256 * 2;
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.advance(get_size(cs));
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool unpack(vm::CellSlice& cs, ton::BlockIdExt& data) const;
+  bool pack(vm::CellBuilder& cb, const ton::BlockIdExt& data) const;
+};
+
+extern const BlockIdExt t_BlockIdExt;
+
+struct ShardState final : TLB_Complex {
+  enum { shard_state = (int)0x9023afe2, split_state = 0x5f327da5 };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(32) == shard_state ? shard_state : -1;
+  }
+};
+
+extern const ShardState t_ShardState;
+
+struct ShardState_aux final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+};
+
+extern const ShardState_aux t_ShardState_aux;
+
+struct LibDescr final : TLB_Complex {
+  enum { shared_lib_descr = 0 };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(2);
+  }
+};
+
+extern const LibDescr t_LibDescr;
+
+struct BlkPrevInfo final : TLB_Complex {
+  bool merged;
+  BlkPrevInfo(bool _merged) : merged(_merged) {
+  }
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+};
+
+extern const BlkPrevInfo t_BlkPrevInfo_0;
+
+struct McStateExtra final : TLB_Complex {
+  enum { masterchain_state_extra = 0xcc26 };
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+};
+
+extern const McStateExtra t_McStateExtra;
+
+struct KeyExtBlkRef final : TLB {
+  enum { fixed_size = 1 + ExtBlkRef::fixed_size };
+  int get_size(const vm::CellSlice& cs) const override {
+    return fixed_size;
+  }
+};
+
+extern const KeyExtBlkRef t_KeyExtBlkRef;
+
+struct KeyMaxLt final : TLB {
+  enum { fixed_size = 1 + 64 };
+  int get_size(const vm::CellSlice& cs) const override {
+    return fixed_size;
+  }
+  bool null_value(vm::CellBuilder& cb) const override {
+    return cb.store_bits_same_bool(fixed_size, false);
+  }
+  bool add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const override;
+};
+
+extern const KeyMaxLt t_KeyMaxLt;
+
+struct Aug_OldMcBlocksInfo final : AugmentationCheckData {
+  Aug_OldMcBlocksInfo() : AugmentationCheckData(t_KeyExtBlkRef, t_KeyMaxLt) {
+  }
+  bool eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const override;
+};
+
+extern const Aug_OldMcBlocksInfo aug_OldMcBlocksInfo;
+
+struct ShardFeeCreated final : TLB_Complex {
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  bool null_value(vm::CellBuilder& cb) const override;
+  bool add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const override;
+};
+
+extern const ShardFeeCreated t_ShardFeeCreated;
+
+struct Aug_ShardFees final : AugmentationCheckData {
+  Aug_ShardFees() : AugmentationCheckData(t_ShardFeeCreated, t_ShardFeeCreated) {
+  }
+  bool eval_leaf(vm::CellBuilder& cb, vm::CellSlice& cs) const override;
+};
+
+extern const Aug_ShardFees aug_ShardFees;
+
+}  // namespace tlb
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/block.cpp b/submodules/ton/tonlib-src/crypto/block/block.cpp
new file mode 100644
index 0000000000..a3316b2022
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/block.cpp
@@ -0,0 +1,2122 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/bits.h"
+#include "block/block.h"
+#include "block/block-auto.h"
+#include "block/block-parse.h"
+#include "ton/ton-shard.h"
+#include "common/bigexp.h"
+#include "common/util.h"
+#include "td/utils/crypto.h"
+#include "td/utils/tl_storers.h"
+#include "td/utils/misc.h"
+
+namespace block {
+using namespace std::literals::string_literals;
+
+td::Result<PublicKey> PublicKey::from_bytes(td::Slice key) {
+  if (key.size() != 32) {
+    return td::Status::Error("Ed25519 public key must be exactly 32 bytes long");
+  }
+  PublicKey res;
+  res.key = key.str();
+  return res;
+}
+
+td::Result<PublicKey> PublicKey::parse(td::Slice key) {
+  if (key.size() != 48) {
+    return td::Status::Error("Serialized Ed25519 public key must be exactly 48 characters long");
+  }
+  td::uint8 buf[36];
+  if (!buff_base64_decode(td::MutableSlice(buf, 36), key, true)) {
+    return td::Status::Error("Public key is not serialized in base64 encoding");
+  }
+
+  td::uint16 hash = static_cast<td::uint16>((static_cast<unsigned>(buf[34]) << 8) + buf[35]);
+  if (hash != td::crc16(td::Slice(buf, 34))) {
+    return td::Status::Error("Public key has incorrect crc16 hash");
+  }
+
+  if (buf[0] != 0x3e) {
+    return td::Status::Error("Not a public key");
+  }
+  if (buf[1] != 0xe6) {
+    return td::Status::Error("Not an ed25519 public key");
+  }
+
+  return from_bytes(td::Slice(buf + 2, 32));
+}
+
+std::string PublicKey::serialize(bool base64_url) {
+  CHECK(key.size() == 32);
+  std::string buf(36, 0);
+  td::MutableSlice bytes(buf);
+
+  bytes[0] = static_cast<char>(0x3e);
+  bytes[1] = static_cast<char>(0xe6);
+  bytes.substr(2).copy_from(key);
+  auto hash = td::crc16(bytes.substr(0, 34));
+  bytes[34] = static_cast<char>(hash >> 8);
+  bytes[35] = static_cast<char>(hash & 255);
+
+  std::string res(48, 0);
+  buff_base64_encode(res, bytes, base64_url);
+  return res;
+}
+
+bool pack_std_smc_addr_to(char result[48], bool base64_url, ton::WorkchainId wc, const ton::StdSmcAddress& addr,
+                          bool bounceable, bool testnet) {
+  if (wc < -128 || wc >= 128) {
+    return false;
+  }
+  unsigned char buffer[36];
+  buffer[0] = (unsigned char)(0x51 - bounceable * 0x40 + testnet * 0x80);
+  buffer[1] = (unsigned char)wc;
+  std::memcpy(buffer + 2, addr.data(), 32);
+  unsigned crc = td::crc16(td::Slice{buffer, 34});
+  buffer[34] = (unsigned char)(crc >> 8);
+  buffer[35] = (unsigned char)(crc & 0xff);
+  CHECK(buff_base64_encode(td::MutableSlice{result, 48}, td::Slice{buffer, 36}, base64_url) == 48);
+  return true;
+}
+
+std::string pack_std_smc_addr(bool base64_url, ton::WorkchainId wc, const ton::StdSmcAddress& addr, bool bounceable,
+                              bool testnet) {
+  char result[48];
+  if (pack_std_smc_addr_to(result, base64_url, wc, addr, bounceable, testnet)) {
+    return std::string{result, 48};
+  } else {
+    return "";
+  }
+}
+
+bool unpack_std_smc_addr(const char packed[48], ton::WorkchainId& wc, ton::StdSmcAddress& addr, bool& bounceable,
+                         bool& testnet) {
+  unsigned char buffer[36];
+  wc = ton::workchainInvalid;
+  if (!buff_base64_decode(td::MutableSlice{buffer, 36}, td::Slice{packed, 48}, true)) {
+    return false;
+  }
+  unsigned crc = td::crc16(td::Slice{buffer, 34});
+  if (buffer[34] != (unsigned char)(crc >> 8) || buffer[35] != (unsigned char)(crc & 0xff)) {
+    return false;
+  }
+  if ((buffer[0] & 0x3f) != 0x11) {
+    return false;
+  }
+  testnet = (buffer[0] & 0x80);
+  bounceable = !(buffer[0] & 0x40);
+  wc = (td::int8)buffer[1];
+  std::memcpy(addr.data(), buffer + 2, 32);
+  return true;
+}
+
+bool unpack_std_smc_addr(td::Slice packed, ton::WorkchainId& wc, ton::StdSmcAddress& addr, bool& bounceable,
+                         bool& testnet) {
+  return packed.size() == 48 && unpack_std_smc_addr(packed.data(), wc, addr, bounceable, testnet);
+}
+
+bool unpack_std_smc_addr(std::string packed, ton::WorkchainId& wc, ton::StdSmcAddress& addr, bool& bounceable,
+                         bool& testnet) {
+  return packed.size() == 48 && unpack_std_smc_addr(packed.data(), wc, addr, bounceable, testnet);
+}
+
+StdAddress::StdAddress(std::string serialized) {
+  rdeserialize(std::move(serialized));
+}
+
+StdAddress::StdAddress(td::Slice from) {
+  rdeserialize(std::move(from));
+}
+
+std::string StdAddress::rserialize(bool base64_url) const {
+  char buffer[48];
+  return rserialize_to(buffer, base64_url) ? std::string{buffer, 48} : "";
+}
+
+bool StdAddress::rserialize_to(td::MutableSlice to, bool base64_url) const {
+  return to.size() == 48 && rserialize_to(to.data(), base64_url);
+}
+
+bool StdAddress::rserialize_to(char to[48], bool base64_url) const {
+  return pack_std_smc_addr_to(to, base64_url, workchain, addr, bounceable, testnet);
+}
+
+bool StdAddress::rdeserialize(td::Slice from) {
+  return from.size() == 48 && unpack_std_smc_addr(from.data(), workchain, addr, bounceable, testnet);
+}
+
+bool StdAddress::rdeserialize(std::string from) {
+  return from.size() == 48 && unpack_std_smc_addr(from.data(), workchain, addr, bounceable, testnet);
+}
+
+bool StdAddress::rdeserialize(const char from[48]) {
+  return unpack_std_smc_addr(from, workchain, addr, bounceable, testnet);
+}
+
+bool StdAddress::operator==(const StdAddress& other) const {
+  return workchain == other.workchain && addr == other.addr && bounceable == other.bounceable &&
+         testnet == other.testnet;
+}
+
+int parse_hex_digit(int c) {
+  if (c >= '0' && c <= '9') {
+    return c - '0';
+  }
+  c |= 0x20;
+  if (c >= 'a' && c <= 'z') {
+    return c - 'a' + 10;
+  }
+  return -1;
+}
+
+bool StdAddress::parse_addr(td::Slice acc_string) {
+  if (rdeserialize(acc_string)) {
+    return true;
+  }
+  testnet = false;
+  bounceable = true;
+  auto pos = acc_string.find(':');
+  if (pos != std::string::npos) {
+    if (pos > 10) {
+      return invalidate();
+    }
+    auto tmp = acc_string.substr(0, pos);
+    auto r_wc = td::to_integer_safe<ton::WorkchainId>(tmp);
+    if (r_wc.is_error()) {
+      return invalidate();
+    }
+    workchain = r_wc.move_as_ok();
+    if (workchain == ton::workchainInvalid) {
+      return invalidate();
+    }
+    ++pos;
+  } else {
+    pos = 0;
+  }
+  // LOG(DEBUG) << "parsing " << acc_string << " address";
+  if (acc_string.size() != pos + 64) {
+    return invalidate();
+  }
+  for (unsigned i = 0; i < 64; i++) {
+    int x = parse_hex_digit(acc_string[pos + i]), m = 15;
+    if (x < 0) {
+      return invalidate();
+    }
+    if (!(i & 1)) {
+      x <<= 4;
+      m <<= 4;
+    }
+    addr.data()[i >> 1] = (unsigned char)((addr.data()[i >> 1] & ~m) | x);
+  }
+  return true;
+}
+
+bool parse_std_account_addr(td::Slice acc_string, ton::WorkchainId& wc, ton::StdSmcAddress& addr, bool* bounceable,
+                            bool* testnet_only) {
+  StdAddress a;
+  if (!a.parse_addr(acc_string)) {
+    return false;
+  }
+  wc = a.workchain;
+  addr = a.addr;
+  if (testnet_only) {
+    *testnet_only = a.testnet;
+  }
+  if (bounceable) {
+    *bounceable = a.bounceable;
+  }
+  return true;
+}
+
+td::Result<StdAddress> StdAddress::parse(td::Slice acc_string) {
+  StdAddress res;
+  if (res.parse_addr(acc_string)) {
+    return res;
+  }
+  return td::Status::Error("Failed to parse account address");
+}
+
+void ShardId::init() {
+  if (!shard_pfx) {
+    shard_pfx = (1ULL << 63);
+    shard_pfx_len = 0;
+  } else {
+    shard_pfx_len = 63 - td::count_trailing_zeroes_non_zero64(shard_pfx);
+  }
+}
+
+ShardId::ShardId(ton::WorkchainId wc_id, unsigned long long sh_pfx) : workchain_id(wc_id), shard_pfx(sh_pfx) {
+  init();
+}
+
+ShardId::ShardId(ton::ShardIdFull ton_shard_id) : workchain_id(ton_shard_id.workchain), shard_pfx(ton_shard_id.shard) {
+  init();
+}
+
+ShardId::ShardId(ton::BlockId ton_block_id) : workchain_id(ton_block_id.workchain), shard_pfx(ton_block_id.shard) {
+  init();
+}
+
+ShardId::ShardId(const ton::BlockIdExt& ton_block_id)
+    : workchain_id(ton_block_id.id.workchain), shard_pfx(ton_block_id.id.shard) {
+  init();
+}
+
+ShardId::ShardId(ton::WorkchainId wc_id, unsigned long long sh_pfx, int sh_pfx_len)
+    : workchain_id(wc_id), shard_pfx_len(sh_pfx_len) {
+  if (sh_pfx_len < 0) {
+    shard_pfx_len = 0;
+    shard_pfx = (1ULL << 63);
+  } else if (sh_pfx_len > 63) {
+    shard_pfx_len = 63;
+    shard_pfx = sh_pfx | 1;
+  } else {
+    unsigned long long pow = 1ULL << (63 - sh_pfx_len);
+    shard_pfx = (sh_pfx | pow) & (pow - 1);
+  }
+}
+
+std::ostream& operator<<(std::ostream& os, const ShardId& shard_id) {
+  shard_id.show(os);
+  return os;
+}
+
+void ShardId::show(std::ostream& os) const {
+  if (workchain_id == ton::workchainInvalid) {
+    os << '?';
+    return;
+  }
+  os << workchain_id << ':' << shard_pfx_len << ',';
+  unsigned long long t = shard_pfx;
+  int cnt = 0;
+  while ((t & ((1ULL << 63) - 1)) != 0) {
+    static const char hex_digit[] = "0123456789ABCDEF";
+    os << (char)hex_digit[t >> 60];
+    t <<= 4;
+    ++cnt;
+  }
+  if (!t || !cnt) {
+    os << '_';
+  }
+}
+
+std::string ShardId::to_str() const {
+  std::ostringstream os;
+  show(os);
+  return os.str();
+}
+
+bool ShardId::serialize(vm::CellBuilder& cb) const {
+  if (workchain_id == ton::workchainInvalid || cb.remaining_bits() < 104) {
+    return false;
+  }
+  return cb.store_long_bool(0, 2) && cb.store_ulong_rchk_bool(shard_pfx_len, 6) &&
+         cb.store_long_bool(workchain_id, 32) && cb.store_long_bool(shard_pfx & (shard_pfx - 1));
+}
+
+bool ShardId::deserialize(vm::CellSlice& cs) {
+  if (cs.fetch_ulong(2) == 0 && cs.fetch_uint_to(6, shard_pfx_len) && cs.fetch_int_to(32, workchain_id) &&
+      workchain_id != ton::workchainInvalid && cs.fetch_uint_to(64, shard_pfx)) {
+    auto pow2 = (1ULL << (63 - shard_pfx_len));
+    if (!(shard_pfx & (pow2 - 1))) {
+      shard_pfx |= pow2;
+      return true;
+    }
+  }
+
+  invalidate();
+  return false;
+}
+
+MsgProcessedUptoCollection::MsgProcessedUptoCollection(ton::ShardIdFull _owner, Ref<vm::CellSlice> cs_ref)
+    : owner(_owner) {
+  vm::Dictionary dict{std::move(cs_ref), 96};
+  valid = dict.check_for_each([&](Ref<vm::CellSlice> value, td::ConstBitPtr key, int n) -> bool {
+    if (value->size_ext() != 64 + 256) {
+      return false;
+    }
+    list.emplace_back();
+    MsgProcessedUpto& z = list.back();
+    z.shard = key.get_uint(64);
+    z.mc_seqno = (unsigned)((key + 64).get_uint(32));
+    z.last_inmsg_lt = value.write().fetch_ulong(64);
+    // std::cerr << "ProcessedUpto shard " << std::hex << z.shard << std::dec << std::endl;
+    return value.write().fetch_bits_to(z.last_inmsg_hash) && z.shard && ton::shard_contains(owner.shard, z.shard);
+  });
+}
+
+std::unique_ptr<MsgProcessedUptoCollection> MsgProcessedUptoCollection::unpack(ton::ShardIdFull _owner,
+                                                                               Ref<vm::CellSlice> cs_ref) {
+  auto v = std::make_unique<MsgProcessedUptoCollection>(_owner, std::move(cs_ref));
+  return v && v->valid ? std::move(v) : std::unique_ptr<MsgProcessedUptoCollection>{};
+}
+
+bool MsgProcessedUpto::contains(const MsgProcessedUpto& other) const & {
+  return ton::shard_is_ancestor(shard, other.shard) && mc_seqno >= other.mc_seqno &&
+         (last_inmsg_lt > other.last_inmsg_lt ||
+          (last_inmsg_lt == other.last_inmsg_lt && !(last_inmsg_hash < other.last_inmsg_hash)));
+}
+
+bool MsgProcessedUpto::contains(ton::ShardId other_shard, ton::LogicalTime other_lt, td::ConstBitPtr other_hash,
+                                ton::BlockSeqno other_mc_seqno) const & {
+  return ton::shard_is_ancestor(shard, other_shard) && mc_seqno >= other_mc_seqno &&
+         (last_inmsg_lt > other_lt || (last_inmsg_lt == other_lt && !(last_inmsg_hash < other_hash)));
+}
+
+bool MsgProcessedUptoCollection::insert(ton::BlockSeqno mc_seqno, ton::LogicalTime last_proc_lt,
+                                        td::ConstBitPtr last_proc_hash) {
+  if (!last_proc_lt) {
+    return false;
+  }
+  for (const auto& z : list) {
+    if (z.contains(owner.shard, last_proc_lt, last_proc_hash, mc_seqno)) {
+      return true;
+    }
+  }
+  list.emplace_back(owner.shard, mc_seqno, last_proc_lt, last_proc_hash);
+  return true;
+}
+
+bool MsgProcessedUptoCollection::insert_infty(ton::BlockSeqno mc_seqno, ton::LogicalTime last_proc_lt) {
+  return insert(mc_seqno, last_proc_lt, td::Bits256::ones().bits());
+}
+
+bool MsgProcessedUptoCollection::is_reduced() const {
+  if (!valid) {
+    return false;
+  }
+  for (auto it = list.begin(); it < list.end(); ++it) {
+    for (auto it2 = it + 1; it2 < list.end(); ++it2) {
+      if (it->contains(*it2) || it2->contains(*it)) {
+        return false;
+      }
+    }
+  }
+  return true;
+}
+
+bool MsgProcessedUptoCollection::contains(const MsgProcessedUpto& p_upto) const {
+  for (const auto& z : list) {
+    if (z.contains(p_upto)) {
+      return true;
+    }
+  }
+  return false;
+}
+
+bool MsgProcessedUptoCollection::contains(const MsgProcessedUptoCollection& other) const {
+  for (const auto& w : other.list) {
+    if (!contains(w)) {
+      return false;
+    }
+  }
+  return true;
+}
+
+const MsgProcessedUpto* MsgProcessedUptoCollection::is_simple_update_of(const MsgProcessedUptoCollection& other,
+                                                                        bool& ok) const {
+  ok = false;
+  if (!contains(other)) {
+    LOG(DEBUG) << "does not cointain the previous value";
+    return nullptr;
+  }
+  if (other.contains(*this)) {
+    LOG(DEBUG) << "coincides with the previous value";
+    ok = true;
+    return nullptr;
+  }
+  const MsgProcessedUpto* found = nullptr;
+  for (const auto& z : list) {
+    if (!other.contains(z)) {
+      if (found) {
+        LOG(DEBUG) << "has more than two new entries";
+        return found;  // ok = false: update is not simple
+      }
+      found = &z;
+    }
+  }
+  ok = true;
+  return found;
+}
+
+ton::BlockSeqno MsgProcessedUptoCollection::min_mc_seqno() const {
+  ton::BlockSeqno min_mc_seqno = ~0U;
+  for (const auto& z : list) {
+    min_mc_seqno = std::min(min_mc_seqno, z.mc_seqno);
+  }
+  return min_mc_seqno;
+}
+
+bool MsgProcessedUptoCollection::compactify() {
+  std::sort(list.begin(), list.end());
+  std::size_t i, j, k = 0, m = 0, n = list.size();
+  std::vector<bool> mark(n, false);
+  assert(mark.size() == n);
+  for (i = 0; i < n; i++) {
+    for (j = 0; j < n; j++) {
+      if (j != i && !mark[j] && list[j].contains(list[i])) {
+        mark[i] = true;
+        ++m;
+        break;
+      }
+    }
+  }
+  if (m) {
+    for (i = 0; i < n; i++) {
+      if (!mark[i]) {
+        list[k++] = list[i];
+      }
+    }
+    list.resize(k);
+  }
+  return true;
+}
+
+bool MsgProcessedUptoCollection::pack(vm::CellBuilder& cb) {
+  if (!compactify()) {
+    return false;
+  }
+  vm::Dictionary dict{96};
+  for (const auto& z : list) {
+    td::BitArray<96> key;
+    vm::CellBuilder cb2;
+    key.bits().store_uint(z.shard, 64);
+    (key.bits() + 64).store_uint(z.mc_seqno, 32);
+    if (!(cb2.store_long_bool(z.last_inmsg_lt) && cb2.store_bits_bool(z.last_inmsg_hash) &&
+          dict.set_builder(key, cb2, vm::Dictionary::SetMode::Add))) {
+      return false;
+    }
+  }
+  return std::move(dict).append_dict_to_bool(cb);
+}
+
+bool MsgProcessedUptoCollection::split(ton::ShardIdFull new_owner) {
+  if (!ton::shard_is_ancestor(owner, new_owner)) {
+    return false;
+  }
+  if (owner == new_owner) {
+    return true;
+  }
+  std::size_t n = list.size(), i, j = 0;
+  for (i = 0; i < n; i++) {
+    if (ton::shard_intersects(list[i].shard, new_owner.shard)) {
+      list[i].shard = ton::shard_intersection(list[i].shard, new_owner.shard);
+      if (j < i) {
+        list[j] = std::move(list[i]);
+      }
+      j++;
+    }
+  }
+  list.resize(j);
+  owner = new_owner;
+  return compactify();
+}
+
+bool MsgProcessedUptoCollection::combine_with(const MsgProcessedUptoCollection& other) {
+  if (!(other.owner == owner || ton::shard_is_sibling(other.owner, owner))) {
+    return false;
+  }
+  list.insert(list.end(), other.list.begin(), other.list.end());
+  if (owner != other.owner) {
+    owner = ton::shard_parent(owner);
+  }
+  return compactify();
+}
+
+bool MsgProcessedUpto::already_processed(const EnqueuedMsgDescr& msg) const {
+  // LOG(DEBUG) << "compare msg (" << msg.lt_ << "," << msg.hash_.to_hex() << ") against record's (" << last_inmsg_lt
+  //            << "," << last_inmsg_hash.to_hex() << ")";
+  if (msg.lt_ > last_inmsg_lt) {
+    return false;
+  }
+  if (!ton::shard_contains(shard, msg.next_prefix_.account_id_prefix)) {
+    return false;
+  }
+  if (msg.lt_ == last_inmsg_lt && last_inmsg_hash < msg.hash_) {
+    return false;
+  }
+  if (ton::shard_contains(shard, msg.cur_prefix_.account_id_prefix)) {
+    // ? enable this branch only if an extra boolean parameter is set ?
+    return true;
+  }
+  auto shard_end_lt = compute_shard_end_lt(msg.cur_prefix_);
+  // LOG(DEBUG) << "enqueued_lt = " << msg.enqueued_lt_ << " , shard_end_lt = " << shard_end_lt;
+  return msg.enqueued_lt_ < shard_end_lt;
+}
+
+bool MsgProcessedUptoCollection::already_processed(const EnqueuedMsgDescr& msg) const {
+  // LOG(DEBUG) << "checking message with cur_addr=" << msg.cur_prefix_.to_str()
+  //            << " next_addr=" << msg.next_prefix_.to_str() << " against ProcessedUpto of neighbor " << owner.to_str();
+  if (!ton::shard_contains(owner, msg.next_prefix_)) {
+    return false;
+  }
+  for (const auto& rec : list) {
+    if (rec.already_processed(msg)) {
+      return true;
+    }
+  }
+  return false;
+}
+
+bool MsgProcessedUptoCollection::for_each_mcseqno(std::function<bool(ton::BlockSeqno)> func) const {
+  for (const auto& entry : list) {
+    if (!func(entry.mc_seqno)) {
+      return false;
+    }
+  }
+  return true;
+}
+
+// unpacks some fields from EnqueuedMsg
+bool EnqueuedMsgDescr::unpack(vm::CellSlice& cs) {
+  block::gen::EnqueuedMsg::Record enq;
+  block::tlb::MsgEnvelope::Record_std env;
+  block::gen::CommonMsgInfo::Record_int_msg_info info;
+  if (!(tlb::unpack(cs, enq) && tlb::unpack_cell(enq.out_msg, env) && tlb::unpack_cell_inexact(env.msg, info))) {
+    return invalidate();
+  }
+  src_prefix_ = block::tlb::t_MsgAddressInt.get_prefix(std::move(info.src));
+  dest_prefix_ = block::tlb::t_MsgAddressInt.get_prefix(std::move(info.dest));
+  if (!(src_prefix_.is_valid() && dest_prefix_.is_valid())) {
+    return invalidate();
+  }
+  cur_prefix_ = interpolate_addr(src_prefix_, dest_prefix_, env.cur_addr);
+  next_prefix_ = interpolate_addr(src_prefix_, dest_prefix_, env.next_addr);
+  lt_ = info.created_lt;
+  enqueued_lt_ = enq.enqueued_lt;
+  hash_ = env.msg->get_hash().bits();
+  msg_ = std::move(env.msg);
+  msg_env_ = std::move(enq.out_msg);
+  return true;
+}
+
+bool EnqueuedMsgDescr::check_key(td::ConstBitPtr key) const {
+  return key.get_int(32) == next_prefix_.workchain && (key + 32).get_uint(64) == next_prefix_.account_id_prefix &&
+         hash_ == key + 96;
+}
+
+bool ParamLimits::deserialize(vm::CellSlice& cs) {
+  return cs.fetch_ulong(8) == 0xc3            // param_limits#c3
+         && cs.fetch_uint_to(32, limits_[0])  // underload:uint32
+         && cs.fetch_uint_to(32, limits_[1])  // soft_limit:uint32
+         && cs.fetch_uint_to(32, limits_[3])  // hard_limit:uint32
+         && limits_[0] <= limits_[1]          // { underload <= soft_limit }
+         && limits_[1] <= limits_[3]          // { soft_limit <= hard_limit } = ParamLimits;
+         && compute_medium_limit();
+}
+
+bool BlockLimits::deserialize(vm::CellSlice& cs) {
+  return cs.fetch_ulong(8) == 0x5d     // block_limits#5d
+         && bytes.deserialize(cs)      // bytes:ParamLimits
+         && gas.deserialize(cs)        // gas:ParamLimits
+         && lt_delta.deserialize(cs);  // lt_delta:ParamLimits
+}
+
+int ParamLimits::classify(td::uint64 value) const {
+  int a = -1, b = limits_cnt;
+  while (b - a > 1) {
+    int c = (a + b) >> 1;
+    if (value >= limits_[c]) {
+      a = c;
+    } else {
+      b = c;
+    }
+  }
+  return a + 1;
+}
+
+bool ParamLimits::fits(unsigned cls, td::uint64 value) const {
+  return cls >= limits_cnt || value < limits_[cls];
+}
+
+int BlockLimits::classify_size(td::uint64 size) const {
+  return bytes.classify(size);
+}
+
+int BlockLimits::classify_gas(td::uint64 gas_value) const {
+  return gas.classify(gas_value);
+}
+
+int BlockLimits::classify_lt(ton::LogicalTime lt) const {
+  return lt_delta.classify(lt - start_lt);
+}
+
+int BlockLimits::classify(td::uint64 size, td::uint64 gas, ton::LogicalTime lt) const {
+  return std::max(std::max(classify_size(size), classify_gas(gas)), classify_lt(lt));
+}
+
+bool BlockLimits::fits(unsigned cls, td::uint64 size, td::uint64 gas_value, ton::LogicalTime lt) const {
+  return bytes.fits(cls, size) && gas.fits(cls, gas_value) && lt_delta.fits(cls, lt - start_lt);
+}
+
+td::uint64 BlockLimitStatus::estimate_block_size(const vm::NewCellStorageStat::Stat* extra) const {
+  auto sum = st_stat.get_total_stat();
+  if (extra) {
+    sum += *extra;
+  }
+  return 2000 + (sum.bits >> 3) + sum.cells * 12 + sum.internal_refs * 3 + sum.external_refs * 40 + accounts * 200 +
+         transactions * 200 + (extra ? 200 : 0);
+}
+
+int BlockLimitStatus::classify() const {
+  return limits.classify(estimate_block_size(), gas_used, cur_lt);
+}
+
+bool BlockLimitStatus::fits(unsigned cls) const {
+  return cls >= ParamLimits::limits_cnt ||
+         (limits.gas.fits(cls, gas_used) && limits.lt_delta.fits(cls, cur_lt - limits.start_lt) &&
+          limits.bytes.fits(cls, estimate_block_size()));
+}
+
+bool BlockLimitStatus::would_fit(unsigned cls, ton::LogicalTime end_lt, td::uint64 more_gas,
+                                 const vm::NewCellStorageStat::Stat* extra) const {
+  return cls >= ParamLimits::limits_cnt || (limits.gas.fits(cls, gas_used + more_gas) &&
+                                            limits.lt_delta.fits(cls, std::max(cur_lt, end_lt) - limits.start_lt) &&
+                                            limits.bytes.fits(cls, estimate_block_size(extra)));
+}
+
+// SETS: account_dict, shard_libraries_, mc_state_extra
+//    total_balance{,_extra}, total_validator_fees
+// SETS: out_msg_queue, processed_upto_, ihr_pending (via unpack_out_msg_queue_info)
+// SETS: utime_, lt_
+td::Status ShardState::unpack_state(ton::BlockIdExt blkid, Ref<vm::Cell> prev_state_root) {
+  if (!blkid.is_valid()) {
+    return td::Status::Error(-666, "invalid block id supplied to ShardState::unpack");
+  }
+  if (prev_state_root.is_null()) {
+    return td::Status::Error(-666, "the root cell supplied for the shardchain state "s + blkid.to_str() + " is null");
+  }
+  block::gen::ShardStateUnsplit::Record state;
+  if (!tlb::unpack_cell(prev_state_root, state)) {
+    return td::Status::Error(-666, "cannot unpack header of shardchain state "s + blkid.to_str());
+  }
+  if ((unsigned)state.seq_no != blkid.seqno()) {
+    return td::Status::Error(
+        -666, PSTRING() << "shardchain state for " << blkid.to_str() << " has incorrect seqno " << state.seq_no);
+  }
+  auto shard1 = ton::ShardIdFull(block::ShardId{state.shard_id});
+  if (shard1 != blkid.shard_full()) {
+    return td::Status::Error(-666, "shardchain state for "s + blkid.to_str() +
+                                       " corresponds to incorrect workchain or shard " + shard1.to_str());
+  }
+  if (state.vert_seq_no) {
+    return td::Status::Error(
+        -666, "shardchain state for "s + blkid.to_str() + " has non-zero vert_seq_no, which is unsupported");
+  }
+  id_ = blkid;
+  root_ = std::move(prev_state_root);
+  before_split_ = state.before_split;
+  account_dict_ = std::make_unique<vm::AugmentedDictionary>(
+      vm::load_cell_slice(std::move(state.accounts)).prefetch_ref(), 256, block::tlb::aug_ShardAccounts);
+  // check that all keys in account_dict have correct prefixes
+  td::BitArray<64> acc_pfx{(long long)shard1.shard};
+  int acc_pfx_len = shard_prefix_length(shard1);
+  if (!account_dict_->has_common_prefix(acc_pfx.bits(), acc_pfx_len)) {
+    return td::Status::Error(-666, "account dictionary of previous state of "s + id_.to_str() + " does not have " +
+                                       acc_pfx.bits().to_hex(acc_pfx_len) + " as common key prefix");
+  }
+  // get overload / underload history
+  overload_history_ = state.r1.overload_history;
+  underload_history_ = state.r1.underload_history;
+  // get shard libraries
+  shard_libraries_ = std::make_unique<vm::Dictionary>(state.r1.libraries->prefetch_ref(), 256);
+  if (!shard_libraries_->is_empty() && !shard1.is_masterchain()) {
+    return td::Status::Error(-666,
+                             "shardchain state "s + id_.to_str() +
+                                 " has a non-trivial shard libraries collection, but it is not in the masterchain");
+  }
+  mc_state_extra_ = state.custom->prefetch_ref();
+  vm::CellSlice cs{*state.r1.master_ref};  // master_ref:(Maybe BlkMasterInfo)
+  if ((int)cs.fetch_ulong(1) == 1) {
+    if (!(block::tlb::t_ExtBlkRef.unpack(cs, mc_blk_ref_, &mc_blk_lt_) && cs.empty_ext())) {
+      return td::Status::Error(-666, "cannot unpack master_ref in shardchain state of "s + id_.to_str());
+    }
+    mc_blk_seqno_ = mc_blk_ref_.seqno();
+  } else {
+    mc_blk_seqno_ = 0;
+    mc_blk_lt_ = 0;
+    mc_blk_ref_.invalidate();
+  }
+  min_ref_mc_seqno_ = state.min_ref_mc_seqno;
+  global_id_ = state.global_id;
+  utime_ = state.gen_utime;
+  lt_ = state.gen_lt;
+  if (!total_balance_.validate_unpack(state.r1.total_balance)) {
+    return td::Status::Error(
+        -666, "cannot unpack total_balance:CurrencyCollection from previous ShardState of "s + id_.to_str());
+  }
+  auto accounts_extra = account_dict_->get_root_extra();
+  CurrencyCollection old_total_balance;
+  if (!(accounts_extra.write().advance(5) && old_total_balance.fetch(accounts_extra.write()))) {
+    return td::Status::Error(
+        -666,
+        "cannot extract total account balance from ShardAccounts contained in previous ShardState of "s + id_.to_str());
+  }
+  if (old_total_balance != total_balance_) {
+    return td::Status::Error(-666, "invalid previous ShardState for "s + id_.to_str() + ": declared total balance " +
+                                       total_balance_.to_str() + " differs from " + old_total_balance.to_str() +
+                                       " obtained by summing over all Accounts");
+  }
+  if (!(total_validator_fees_.validate_unpack(state.r1.total_validator_fees) && !total_validator_fees_.has_extra())) {
+    return td::Status::Error(
+        -666, "cannot unpack total_validator_fees:CurrencyCollection from previous ShardState of "s + id_.to_str());
+  }
+  if (is_masterchain()) {
+    if (mc_state_extra_.is_null()) {
+      return td::Status::Error(-666, "ShardState of "s + id_.to_str() + " does not contain McStateExtra");
+    }
+    block::gen::McStateExtra::Record extra;
+    if (!tlb::unpack_cell(mc_state_extra_, extra)) {
+      return td::Status::Error(-666, "cannot unpack McStateExtra in ShardState of "s + id_.to_str());
+    }
+    if (!global_balance_.validate_unpack(extra.global_balance)) {
+      return td::Status::Error(-666, "ShardState of "s + id_.to_str() + " does not contain a valid global_balance");
+    }
+    if (extra.r1.flags & 1) {
+      if (extra.r1.block_create_stats->prefetch_ulong(8) != 0x17) {
+        return td::Status::Error(-666, "ShardState of "s + id_.to_str() + " does not contain a valid BlockCreateStats");
+      }
+      block_create_stats_ = std::make_unique<vm::Dictionary>(extra.r1.block_create_stats->prefetch_ref(), 256);
+    } else {
+      block_create_stats_ = std::make_unique<vm::Dictionary>(256);
+    }
+  }
+  return unpack_out_msg_queue_info(std::move(state.out_msg_queue_info));
+}
+
+// SETS: out_msg_queue, processed_upto_, ihr_pending
+td::Status ShardState::unpack_out_msg_queue_info(Ref<vm::Cell> out_msg_queue_info) {
+  block::gen::OutMsgQueueInfo::Record qinfo;
+  if (!tlb::unpack_cell(std::move(out_msg_queue_info), qinfo)) {
+    return td::Status::Error(-666, "cannot unpack OutMsgQueueInfo in the state of "s + id_.to_str());
+  }
+  out_msg_queue_ =
+      std::make_unique<vm::AugmentedDictionary>(std::move(qinfo.out_queue), 352, block::tlb::aug_OutMsgQueue);
+  if (verbosity >= 3 * 0) {
+    LOG(DEBUG) << "unpacking ProcessedUpto of our previous block " << id_.to_str();
+    block::gen::t_ProcessedInfo.print(std::cerr, qinfo.proc_info);
+  }
+  if (!block::gen::t_ProcessedInfo.validate_csr(qinfo.proc_info)) {
+    return td::Status::Error(
+        -666, "ProcessedInfo in the state of "s + id_.to_str() + " is invalid according to automated validity checks");
+  }
+  if (!block::gen::t_IhrPendingInfo.validate_csr(qinfo.ihr_pending)) {
+    return td::Status::Error(
+        -666, "IhrPendingInfo in the state of "s + id_.to_str() + " is invalid according to automated validity checks");
+  }
+  processed_upto_ = block::MsgProcessedUptoCollection::unpack(ton::ShardIdFull(id_), std::move(qinfo.proc_info));
+  ihr_pending_ = std::make_unique<vm::Dictionary>(std::move(qinfo.ihr_pending), 320);
+  auto shard1 = id_.shard_full();
+  td::BitArray<64> pfx{(long long)shard1.shard};
+  int pfx_len = shard_prefix_length(shard1);
+  if (!ihr_pending_->has_common_prefix(pfx.bits(), pfx_len)) {
+    return td::Status::Error(-666, "IhrPendingInfo in the state of "s + id_.to_str() + " does not have " +
+                                       pfx.bits().to_hex(pfx_len) + " as common key prefix");
+  }
+  return td::Status::OK();
+}
+
+// UPDATES: prev_state_utime_, prev_state_lt_
+bool ShardState::update_prev_utime_lt(ton::UnixTime& prev_utime, ton::LogicalTime& prev_lt) const {
+  prev_utime = std::max<ton::UnixTime>(prev_utime, utime_);
+  prev_lt = std::max<ton::LogicalTime>(prev_lt, lt_);
+  return true;
+}
+
+td::Status ShardState::check_before_split(bool req_before_split) const {
+  CHECK(id_.is_valid());
+  if (before_split_ != req_before_split) {
+    return td::Status::Error(PSTRING() << "previous state for " << id_.to_str() << " has before_split=" << before_split_
+                                       << ", but we have after_split=" << req_before_split);
+  }
+  return td::Status::OK();
+}
+
+td::Status ShardState::check_global_id(int req_global_id) const {
+  if (global_id_ != req_global_id) {
+    return td::Status::Error(-666, PSTRING() << "global blockchain id mismatch in shard state of " << id_.to_str()
+                                             << ": expected " << req_global_id << ", found " << global_id_);
+  }
+  return td::Status::OK();
+}
+
+td::Status ShardState::check_mc_blk_seqno(ton::BlockSeqno last_mc_block_seqno) const {
+  if (mc_blk_seqno_ > last_mc_block_seqno) {
+    return td::Status::Error(
+        -666, PSTRING() << "previous block refers to masterchain block with seqno " << mc_blk_seqno_
+                        << " larger than the latest known masterchain block seqno " << last_mc_block_seqno);
+  }
+  return td::Status::OK();
+}
+
+td::Status ShardState::unpack_state_ext(ton::BlockIdExt id, Ref<vm::Cell> state_root, int global_id,
+                                        ton::BlockSeqno prev_mc_block_seqno, bool after_split, bool clear_history,
+                                        std::function<bool(ton::BlockSeqno)> for_each_mcseqno_func) {
+  TRY_STATUS(unpack_state(id, std::move(state_root)));
+  TRY_STATUS(check_global_id(global_id));
+  TRY_STATUS(check_mc_blk_seqno(prev_mc_block_seqno));
+  TRY_STATUS(check_before_split(after_split));
+  clear_load_history_if(clear_history);
+  if (!for_each_mcseqno(std::move(for_each_mcseqno_func))) {
+    return td::Status::Error(
+        -666, "cannot perform necessary actions for each mc_seqno mentioned in ProcessedUpto of "s + id_.to_str());
+  }
+  return td::Status::OK();
+}
+
+td::Status ShardState::merge_with(ShardState& sib) {
+  // 1. check that the two states are valid and belong to sibling shards
+  if (!is_valid() || !sib.is_valid()) {
+    return td::Status::Error(-666, "cannot merge invalid or uninitialized states");
+  }
+  if (!ton::shard_is_sibling(id_.shard_full(), sib.id_.shard_full())) {
+    return td::Status::Error(-666, "cannot merge non-sibling states of "s + id_.to_str() + " and " + sib.id_.to_str());
+  }
+  ton::ShardIdFull shard = ton::shard_parent(id_.shard_full());
+  // 2. compute total_balance and total_validator_fees
+  total_balance_ += std::move(sib.total_balance_);
+  if (!total_balance_.is_valid()) {
+    return td::Status::Error(-667, "cannot add total_balance_extra of the two states being merged");
+  }
+  total_validator_fees_ += std::move(sib.total_validator_fees_);
+  // 3. merge account_dict with sibling_account_dict
+  LOG(DEBUG) << "merging account dictionaries";
+  if (!account_dict_->combine_with(*sib.account_dict_)) {
+    return td::Status::Error(-666, "cannot merge account dictionaries of the two ancestors");
+  }
+  sib.account_dict_.reset();
+  // 3.1. check that all keys in merged account_dict have correct prefixes
+  td::BitArray<64> pfx{(long long)shard.shard};
+  int pfx_len = shard_prefix_length(shard);
+  if (!account_dict_->has_common_prefix(pfx.bits(), pfx_len)) {
+    return td::Status::Error(-666, "merged account dictionary of previous states of "s + shard.to_str() +
+                                       " does not have " + pfx.bits().to_hex(pfx_len) + " as common key prefix");
+  }
+  // 3.2. check total balance of the new account_dict
+  auto accounts_extra = account_dict_->get_root_extra();
+  CurrencyCollection old_total_balance;
+  if (!(accounts_extra.write().advance(5) && old_total_balance.fetch(accounts_extra.write()))) {
+    return td::Status::Error(-666, "cannot extract total account balance from merged accounts dictionary");
+  }
+  if (old_total_balance != total_balance_) {
+    return td::Status::Error(
+        -666,
+        "invalid merged account dictionary: declared total balance differs from one obtained by summing over all "
+        "Accounts");
+  }
+  // 4. merge shard libraries
+  CHECK(shard_libraries_->is_empty() && sib.shard_libraries_->is_empty());
+  // 5. merge out_msg_queue
+  LOG(DEBUG) << "merging outbound message queues";
+  if (!out_msg_queue_->combine_with(*sib.out_msg_queue_)) {
+    return td::Status::Error(-666, "cannot merge outbound message queues of the two ancestor states");
+  }
+  sib.out_msg_queue_.reset();
+  // 6. merge processed_upto
+  LOG(DEBUG) << "merging ProcessedUpto structures";
+  if (!processed_upto_->combine_with(*sib.processed_upto_)) {
+    return td::Status::Error(-666, "cannot merge ProcessedUpto structures of the two ancestor states");
+  }
+  sib.processed_upto_.reset();
+  // 7. merge ihr_pending
+  LOG(DEBUG) << "merging IhrPendingInfo";
+  if (!ihr_pending_->combine_with(*sib.ihr_pending_)) {
+    return td::Status::Error(-666, "cannot merge IhrPendingInfo of the two ancestors");
+  }
+  sib.ihr_pending_.reset();
+  // 7.1. check whether all keys of the new ihr_pending have correct prefix
+  if (!ihr_pending_->has_common_prefix(pfx.bits(), pfx_len)) {
+    return td::Status::Error(-666, "merged IhrPendingInfo of the two previous states of "s + shard.to_str() +
+                                       " does not have " + pfx.bits().to_hex(pfx_len) + " as common key prefix");
+  }
+  // 8. compute merged utime_ and lt_
+  utime_ = std::max(utime_, sib.utime_);
+  lt_ = std::max(lt_, sib.lt_);
+  // 9. compute underload & overload history
+  underload_history_ = overload_history_ = 0;
+  // Anything else? add here
+  // ...
+
+  // 10. compute new root
+  if (!block::gen::t_ShardState.cell_pack_split_state(root_, std::move(root_), std::move(sib.root_))) {
+    return td::Status::Error(-667, "cannot construct a virtual split_state after a merge");
+  }
+  // 11. invalidate sibling, change id_ to the (virtual) common parent
+  sib.invalidate();
+  id_.id.shard = shard.shard;
+  id_.file_hash.set_zero();
+  id_.root_hash.set_zero();
+  return td::Status::OK();
+}
+
+td::Result<std::unique_ptr<vm::AugmentedDictionary>> ShardState::compute_split_out_msg_queue(
+    ton::ShardIdFull subshard) {
+  auto shard = id_.shard_full();
+  if (!ton::shard_is_parent(shard, subshard)) {
+    return td::Status::Error(-666, "cannot split subshard "s + subshard.to_str() + " from state of " + id_.to_str() +
+                                       " because it is not a parent");
+  }
+  CHECK(out_msg_queue_);
+  auto subqueue = std::make_unique<vm::AugmentedDictionary>(*out_msg_queue_);
+  int res = block::filter_out_msg_queue(*subqueue, shard, subshard);
+  if (res < 0) {
+    return td::Status::Error(-666, "error splitting OutMsgQueue of "s + id_.to_str());
+  }
+  LOG(DEBUG) << "OutMsgQueue split counter: " << res << " messages";
+  return std::move(subqueue);
+}
+
+td::Result<std::shared_ptr<block::MsgProcessedUptoCollection>> ShardState::compute_split_processed_upto(
+    ton::ShardIdFull subshard) {
+  if (!ton::shard_is_parent(id_.shard_full(), subshard)) {
+    return td::Status::Error(-666, "cannot split subshard "s + subshard.to_str() + " from state of " + id_.to_str() +
+                                       " because it is not a parent");
+  }
+  CHECK(processed_upto_);
+  auto sub_processed_upto = std::make_shared<block::MsgProcessedUptoCollection>(*processed_upto_);
+  if (!sub_processed_upto->split(subshard)) {
+    return td::Status::Error(-666, "error splitting ProcessedUpto of "s + id_.to_str());
+  }
+  return std::move(sub_processed_upto);
+}
+
+td::Status ShardState::split(ton::ShardIdFull subshard) {
+  if (!ton::shard_is_parent(id_.shard_full(), subshard)) {
+    return td::Status::Error(-666, "cannot split subshard "s + subshard.to_str() + " from state of " + id_.to_str() +
+                                       " because it is not a parent");
+  }
+  // Have to split:
+  // 1. account_dict
+  LOG(DEBUG) << "splitting account dictionary";
+  td::BitArray<64> pfx{(long long)subshard.shard};
+  int pfx_len = shard_prefix_length(subshard);
+  CHECK(account_dict_);
+  CHECK(account_dict_->cut_prefix_subdict(pfx.bits(), pfx_len));
+  CHECK(account_dict_->has_common_prefix(pfx.bits(), pfx_len));
+  // 2. out_msg_queue
+  LOG(DEBUG) << "splitting OutMsgQueue";
+  auto shard1 = id_.shard_full();
+  CHECK(ton::shard_is_parent(shard1, subshard));
+  CHECK(out_msg_queue_);
+  int res1 = block::filter_out_msg_queue(*out_msg_queue_, shard1, subshard);
+  if (res1 < 0) {
+    return td::Status::Error(-666, "error splitting OutMsgQueue of "s + id_.to_str());
+  }
+  LOG(DEBUG) << "split counters: " << res1;
+  // 3. processed_upto
+  LOG(DEBUG) << "splitting ProcessedUpto";
+  CHECK(processed_upto_);
+  if (!processed_upto_->split(subshard)) {
+    return td::Status::Error(-666, "error splitting ProcessedUpto of "s + id_.to_str());
+  }
+  // 4. ihr_pending
+  LOG(DEBUG) << "splitting IhrPending";
+  CHECK(ihr_pending_->cut_prefix_subdict(pfx.bits(), pfx_len));
+  CHECK(ihr_pending_->has_common_prefix(pfx.bits(), pfx_len));
+  // 5. adjust total_balance
+  LOG(DEBUG) << "splitting total_balance";
+  auto old_total_balance = total_balance_;
+  auto accounts_extra = account_dict_->get_root_extra();
+  if (!(accounts_extra.write().advance(5) && total_balance_.validate_unpack(accounts_extra))) {
+    LOG(ERROR) << "cannot unpack CurrencyCollection from the root of newly-split accounts dictionary";
+    return td::Status::Error(
+        -666, "error splitting total balance in account dictionary of shardchain state "s + id_.to_str());
+  }
+  LOG(DEBUG) << "split total balance from " << old_total_balance.to_str() << " to our share of "
+             << total_balance_.to_str();
+  // 6. adjust total_fees
+  LOG(DEBUG) << "split total validator fees (current value is " << total_validator_fees_.to_str() << ")";
+  total_validator_fees_.grams = (total_validator_fees_.grams + is_right_child(subshard)) >> 1;
+  LOG(DEBUG) << "new total_validator_fees is " << total_validator_fees_.to_str();
+  // NB: if total_fees_extra will be allowed to be non-empty, split it here too
+  // 7. reset overload/underload history
+  overload_history_ = underload_history_ = 0;
+  // 999. anything else?
+  id_.id.shard = subshard.shard;
+  id_.file_hash.set_zero();
+  id_.root_hash.set_zero();
+  return td::Status::OK();
+}
+
+int filter_out_msg_queue(vm::AugmentedDictionary& out_queue, ton::ShardIdFull old_shard, ton::ShardIdFull subshard) {
+  return out_queue.filter([subshard, old_shard](vm::CellSlice& cs, td::ConstBitPtr key, int key_len) -> int {
+    CHECK(key_len == 352);
+    LOG(DEBUG) << "scanning OutMsgQueue entry with key " << key.to_hex(key_len);
+    block::tlb::MsgEnvelope::Record_std env;
+    block::gen::CommonMsgInfo::Record_int_msg_info info;
+    if (!(cs.size_ext() == 0x10080  // (uint64) enqueued_lt:uint64 out_msg:^MsgEnvelope
+          && tlb::unpack_cell(cs.prefetch_ref(), env) && tlb::unpack_cell_inexact(env.msg, info))) {
+      LOG(ERROR) << "cannot unpack OutMsgQueue entry with key " << key.to_hex(key_len);
+      return -1;
+    }
+    auto src_prefix = block::tlb::t_MsgAddressInt.get_prefix(info.src);
+    auto dest_prefix = block::tlb::t_MsgAddressInt.get_prefix(info.dest);
+    auto cur_prefix = block::interpolate_addr(src_prefix, dest_prefix, env.cur_addr);
+    if (!(src_prefix.is_valid() && dest_prefix.is_valid() && cur_prefix.is_valid())) {
+      LOG(ERROR) << "OutMsgQueue message with key " << key.to_hex(key_len)
+                 << " has invalid source or destination address";
+      return -1;
+    }
+    if (!ton::shard_contains(old_shard, cur_prefix)) {
+      LOG(ERROR) << "OutMsgQueue message with key " << key.to_hex(key_len)
+                 << " does not contain current address belonging to shard " << old_shard.to_str();
+      return -1;
+    }
+    return ton::shard_contains(subshard, cur_prefix);
+  });
+}
+
+bool CurrencyCollection::validate() const {
+  return is_valid() && td::sgn(grams) >= 0 && validate_extra();
+}
+
+bool CurrencyCollection::validate_extra() const {
+  if (extra.is_null()) {
+    return true;
+  }
+  vm::CellBuilder cb;
+  return cb.store_maybe_ref(extra) && block::tlb::t_ExtraCurrencyCollection.validate_ref(cb.finalize());
+}
+
+bool CurrencyCollection::add(const CurrencyCollection& a, const CurrencyCollection& b, CurrencyCollection& c) {
+  return (a.is_valid() && b.is_valid() && (c.grams = a.grams + b.grams).not_null() && c.grams->is_valid() &&
+          add_extra_currency(a.extra, b.extra, c.extra)) ||
+         c.invalidate();
+}
+
+bool CurrencyCollection::add(const CurrencyCollection& a, CurrencyCollection&& b, CurrencyCollection& c) {
+  return (a.is_valid() && b.is_valid() && (c.grams = a.grams + std::move(b.grams)).not_null() && c.grams->is_valid() &&
+          add_extra_currency(a.extra, std::move(b.extra), c.extra)) ||
+         c.invalidate();
+}
+
+CurrencyCollection& CurrencyCollection::operator+=(const CurrencyCollection& other) {
+  if (!is_valid()) {
+    return *this;
+  }
+  if (!(other.is_valid() && (grams += other.grams).not_null() && grams->is_valid() &&
+        add_extra_currency(extra, other.extra, extra))) {
+    invalidate();
+  }
+  return *this;
+}
+
+CurrencyCollection& CurrencyCollection::operator+=(CurrencyCollection&& other) {
+  if (!is_valid()) {
+    return *this;
+  }
+  if (!(other.is_valid() && (grams += std::move(other.grams)).not_null() && grams->is_valid() &&
+        add_extra_currency(extra, std::move(other.extra), extra))) {
+    invalidate();
+  }
+  return *this;
+}
+
+CurrencyCollection& CurrencyCollection::operator+=(td::RefInt256 other_grams) {
+  if (!is_valid()) {
+    return *this;
+  }
+  if (!(other_grams.not_null() && (grams += other_grams).not_null())) {
+    invalidate();
+  }
+  return *this;
+}
+
+CurrencyCollection CurrencyCollection::operator+(const CurrencyCollection& other) const {
+  CurrencyCollection res;
+  add(*this, other, res);
+  return res;
+}
+
+CurrencyCollection CurrencyCollection::operator+(CurrencyCollection&& other) const {
+  CurrencyCollection res;
+  add(*this, std::move(other), res);
+  return res;
+}
+
+CurrencyCollection CurrencyCollection::operator+(td::RefInt256 other_grams) {
+  if (!is_valid()) {
+    return *this;
+  }
+  auto sum = grams + other_grams;
+  if (sum.not_null()) {
+    return CurrencyCollection{std::move(sum), extra};
+  } else {
+    return CurrencyCollection{};
+  }
+}
+
+bool CurrencyCollection::sub(const CurrencyCollection& a, const CurrencyCollection& b, CurrencyCollection& c) {
+  return (a.is_valid() && b.is_valid() && (c.grams = a.grams - b.grams).not_null() && c.grams->is_valid() &&
+          td::sgn(c.grams) >= 0 && sub_extra_currency(a.extra, b.extra, c.extra)) ||
+         c.invalidate();
+}
+
+bool CurrencyCollection::sub(const CurrencyCollection& a, CurrencyCollection&& b, CurrencyCollection& c) {
+  return (a.is_valid() && b.is_valid() && (c.grams = a.grams - std::move(b.grams)).not_null() && c.grams->is_valid() &&
+          td::sgn(c.grams) >= 0 && sub_extra_currency(a.extra, std::move(b.extra), c.extra)) ||
+         c.invalidate();
+}
+
+CurrencyCollection& CurrencyCollection::operator-=(const CurrencyCollection& other) {
+  if (!is_valid()) {
+    return *this;
+  }
+  if (!(other.is_valid() && (grams -= other.grams).not_null() && grams->is_valid() && td::sgn(grams) >= 0 &&
+        sub_extra_currency(extra, other.extra, extra))) {
+    invalidate();
+  }
+  return *this;
+}
+
+CurrencyCollection& CurrencyCollection::operator-=(CurrencyCollection&& other) {
+  if (!is_valid()) {
+    return *this;
+  }
+  if (!(other.is_valid() && (grams -= std::move(other.grams)).not_null() && grams->is_valid() && td::sgn(grams) >= 0 &&
+        sub_extra_currency(extra, std::move(other.extra), extra))) {
+    invalidate();
+  }
+  return *this;
+}
+
+CurrencyCollection& CurrencyCollection::operator-=(td::RefInt256 other_grams) {
+  if (!is_valid()) {
+    return *this;
+  }
+  if (!(other_grams.not_null() && (grams -= other_grams).not_null() && td::sgn(grams) >= 0)) {
+    invalidate();
+  }
+  return *this;
+}
+
+CurrencyCollection CurrencyCollection::operator-(const CurrencyCollection& other) const {
+  CurrencyCollection res;
+  sub(*this, other, res);
+  return res;
+}
+
+CurrencyCollection CurrencyCollection::operator-(CurrencyCollection&& other) const {
+  CurrencyCollection res;
+  sub(*this, std::move(other), res);
+  return res;
+}
+
+CurrencyCollection CurrencyCollection::operator-(td::RefInt256 other_grams) const {
+  if (!(is_valid() && other_grams.not_null())) {
+    return {};
+  }
+  auto x = grams - other_grams;
+  if (td::sgn(x) >= 0) {
+    return CurrencyCollection{std::move(x), extra};
+  } else {
+    return {};
+  }
+}
+
+bool CurrencyCollection::operator==(const CurrencyCollection& other) const {
+  return is_valid() && other.is_valid() && !td::cmp(grams, other.grams) &&
+         (extra.not_null() == other.extra.not_null()) &&
+         (extra.is_null() || extra->get_hash() == other.extra->get_hash());
+}
+
+bool CurrencyCollection::operator>=(const CurrencyCollection& other) const {
+  Ref<vm::Cell> tmp;
+  return is_valid() && other.is_valid() && td::cmp(grams, other.grams) >= 0 &&
+         sub_extra_currency(extra, other.extra, tmp);
+}
+
+bool CurrencyCollection::store(vm::CellBuilder& cb) const {
+  return is_valid() && store_CurrencyCollection(cb, grams, extra);
+}
+
+bool CurrencyCollection::store_or_zero(vm::CellBuilder& cb) const {
+  return is_valid() ? store(cb) : cb.store_long_bool(0, 5);
+}
+
+bool CurrencyCollection::fetch(vm::CellSlice& cs) {
+  return block::tlb::t_CurrencyCollection.unpack_special(cs, *this, true) || invalidate();
+}
+
+bool CurrencyCollection::fetch_exact(vm::CellSlice& cs) {
+  return block::tlb::t_CurrencyCollection.unpack_special(cs, *this, false) || invalidate();
+}
+
+bool CurrencyCollection::unpack(Ref<vm::CellSlice> csr) {
+  return unpack_CurrencyCollection(std::move(csr), grams, extra) || invalidate();
+}
+
+bool CurrencyCollection::validate_unpack(Ref<vm::CellSlice> csr) {
+  return (csr.not_null() && block::tlb::t_CurrencyCollection.validate(*csr) &&
+          unpack_CurrencyCollection(std::move(csr), grams, extra)) ||
+         invalidate();
+}
+
+Ref<vm::CellSlice> CurrencyCollection::pack() const {
+  vm::CellBuilder cb;
+  if (store(cb)) {
+    return vm::load_cell_slice_ref(cb.finalize());
+  } else {
+    return {};
+  }
+}
+
+bool CurrencyCollection::show(std::ostream& os) const {
+  if (!is_valid()) {
+    os << "<invalid-cc>";
+    return false;
+  }
+  if (extra.not_null()) {
+    os << '(';
+  }
+  os << grams << "ng";
+  if (extra.not_null()) {
+    vm::Dictionary dict{extra, 32};
+    if (!dict.check_for_each([&os](Ref<vm::CellSlice> csr, td::ConstBitPtr key, int n) {
+          CHECK(n == 32);
+          int x = (int)key.get_int(n);
+          auto val = block::tlb::t_VarUIntegerPos_32.as_integer_skip(csr.write());
+          if (val.is_null() || !csr->empty_ext()) {
+            os << "+<invalid>.$" << x << "...)";
+            return false;
+          }
+          os << '+' << val << ".$" << x;
+          return true;
+        })) {
+      return false;
+    }
+    os << ')';
+  }
+  return true;
+}
+
+std::string CurrencyCollection::to_str() const {
+  std::ostringstream os;
+  show(os);
+  return os.str();
+}
+
+std::ostream& operator<<(std::ostream& os, const CurrencyCollection& cc) {
+  cc.show(os);
+  return os;
+}
+
+bool ValueFlow::set_zero() {
+  return from_prev_blk.set_zero() && to_next_blk.set_zero() && imported.set_zero() && exported.set_zero() &&
+         fees_collected.set_zero() && fees_imported.set_zero() && recovered.set_zero() && created.set_zero() &&
+         minted.set_zero();
+}
+
+bool ValueFlow::validate() const {
+  return is_valid() && from_prev_blk + imported + fees_imported + created + minted + recovered ==
+                           to_next_blk + exported + fees_collected;
+}
+
+bool ValueFlow::store(vm::CellBuilder& cb) const {
+  vm::CellBuilder cb2;
+  return cb.store_long_bool(block::gen::ValueFlow::cons_tag[0], 32)  // value_flow ^[
+         && from_prev_blk.store(cb2)                                 //   from_prev_blk:CurrencyCollection
+         && to_next_blk.store(cb2)                                   //   to_next_blk:CurrencyCollection
+         && imported.store(cb2)                                      //   imported:CurrencyCollection
+         && exported.store(cb2)                                      //   exported:CurrencyCollection
+         && cb.store_ref_bool(cb2.finalize())                        // ]
+         && fees_collected.store(cb)                                 // fees_collected:CurrencyCollection
+         && fees_imported.store(cb2)                                 // ^[ fees_imported:CurrencyCollection
+         && recovered.store(cb2)                                     //    recovered:CurrencyCollection
+         && created.store(cb2)                                       //    created:CurrencyCollection
+         && minted.store(cb2)                                        //    minted:CurrencyCollection
+         && cb.store_ref_bool(cb2.finalize());                       // ] = ValueFlow;
+}
+
+bool ValueFlow::fetch(vm::CellSlice& cs) {
+  block::gen::ValueFlow::Record f;
+  if (!(tlb::unpack(cs, f) && from_prev_blk.validate_unpack(std::move(f.r1.from_prev_blk)) &&
+        to_next_blk.validate_unpack(std::move(f.r1.to_next_blk)) &&
+        imported.validate_unpack(std::move(f.r1.imported)) && exported.validate_unpack(std::move(f.r1.exported)) &&
+        fees_collected.validate_unpack(std::move(f.fees_collected)) &&
+        fees_imported.validate_unpack(std::move(f.r2.fees_imported)) &&
+        recovered.validate_unpack(std::move(f.r2.recovered)) && created.validate_unpack(std::move(f.r2.created)) &&
+        minted.validate_unpack(std::move(f.r2.minted)))) {
+    return invalidate();
+  }
+  return true;
+}
+
+bool ValueFlow::unpack(Ref<vm::CellSlice> csr) {
+  return (csr.not_null() && fetch(csr.write()) && csr->empty_ext()) || invalidate();
+}
+
+static inline bool say(std::ostream& os, const char* str) {
+  os << str;
+  return true;
+}
+
+bool ValueFlow::show_one(std::ostream& os, const char* str, const CurrencyCollection& cc) const {
+  return say(os, str) && cc.show(os);
+}
+
+bool ValueFlow::show(std::ostream& os) const {
+  if (!is_valid()) {
+    os << "<invalid-value-flow>";
+    return false;
+  }
+  return (say(os, "(value-flow ") && show_one(os, "from_prev_blk:", from_prev_blk) &&
+          show_one(os, " to_next_blk:", to_next_blk) && show_one(os, " imported:", imported) &&
+          show_one(os, " exported:", exported) && show_one(os, " fees_collected:", fees_collected) &&
+          show_one(os, " fees_imported:", fees_imported) && show_one(os, " recovered:", recovered) &&
+          show_one(os, " created:", created) && show_one(os, " minted:", minted) && say(os, ")")) ||
+         (say(os, "...<invalid-value-flow>)") && false);
+}
+
+std::string ValueFlow::to_str() const {
+  std::ostringstream os;
+  show(os);
+  return os.str();
+}
+
+std::ostream& operator<<(std::ostream& os, const ValueFlow& vflow) {
+  vflow.show(os);
+  return os;
+}
+
+bool DiscountedCounter::increase_by(unsigned count, ton::UnixTime now) {
+  if (!validate()) {
+    return false;
+  }
+  td::uint64 scaled = (td::uint64(count) << 32);
+  if (!total) {
+    last_updated = now;
+    total = count;
+    cnt2048 = scaled;
+    cnt65536 = scaled;
+    return true;
+  }
+  if (count > ~total || cnt2048 > ~scaled || cnt65536 > ~scaled) {
+    return false /* invalidate() */;  // overflow
+  }
+  unsigned dt = (now >= last_updated ? now - last_updated : 0);
+  if (dt > 0) {
+    // more precise version of cnt2048 = llround(cnt2048 * exp(-dt / 2048.));
+    // (rounding error has absolute value < 1)
+    cnt2048 = (dt >= 48 * 2048 ? 0 : td::umulnexps32(cnt2048, dt << 5));
+    // more precise version of cnt65536 = llround(cnt65536 * exp(-dt / 65536.));
+    // (rounding error has absolute value < 1)
+    cnt65536 = td::umulnexps32(cnt65536, dt);
+  }
+  total += count;
+  cnt2048 += scaled;
+  cnt65536 += scaled;
+  last_updated = now;
+  return true;
+}
+
+bool DiscountedCounter::validate() {
+  if (!is_valid()) {
+    return false;
+  }
+  if (!total) {
+    if (cnt2048 | cnt65536) {
+      return invalidate();
+    }
+  } else if (!last_updated) {
+    return invalidate();
+  }
+  return true;
+}
+
+bool DiscountedCounter::fetch(vm::CellSlice& cs) {
+  valid = (cs.fetch_uint_to(32, last_updated) && cs.fetch_uint_to(64, total) && cs.fetch_uint_to(64, cnt2048) &&
+           cs.fetch_uint_to(64, cnt65536));
+  return validate() || invalidate();
+}
+
+bool DiscountedCounter::unpack(Ref<vm::CellSlice> csr) {
+  return (csr.not_null() && fetch(csr.write()) && csr->empty_ext()) || invalidate();
+}
+
+bool DiscountedCounter::store(vm::CellBuilder& cb) const {
+  return is_valid() && cb.store_long_bool(last_updated, 32) && cb.store_long_bool(total, 64) &&
+         cb.store_long_bool(cnt2048, 64) && cb.store_long_bool(cnt65536, 64);
+}
+
+Ref<vm::CellSlice> DiscountedCounter::pack() const {
+  vm::CellBuilder cb;
+  if (store(cb)) {
+    return vm::load_cell_slice_ref(cb.finalize());
+  } else {
+    return {};
+  }
+}
+
+bool DiscountedCounter::show(std::ostream& os) const {
+  if (!is_valid()) {
+    os << "<invalid-counter>";
+    return false;
+  }
+  os << "(counter last_updated:" << last_updated << " total:" << total << " cnt2048: " << (double)cnt2048 / (1LL << 32)
+     << " cnt65536: " << (double)cnt65536 / (1LL << 32) << ")";
+  return true;
+}
+
+std::string DiscountedCounter::to_str() const {
+  std::ostringstream stream;
+  if (show(stream)) {
+    return stream.str();
+  } else {
+    return "<invalid-counter>";
+  }
+}
+
+bool fetch_CreatorStats(vm::CellSlice& cs, DiscountedCounter& mc_cnt, DiscountedCounter& shard_cnt) {
+  return cs.fetch_ulong(4) == 4   // creator_info#4
+         && mc_cnt.fetch(cs)      // mc_blocks:Counters
+         && shard_cnt.fetch(cs);  // shard_blocks:Counters
+}
+
+bool store_CreatorStats(vm::CellBuilder& cb, const DiscountedCounter& mc_cnt, const DiscountedCounter& shard_cnt) {
+  return cb.store_long_bool(4, 4)  // creator_info#4
+         && mc_cnt.store(cb)       // mc_blocks:Counters
+         && shard_cnt.store(cb);   // shard_blocks:Counters
+}
+
+bool unpack_CreatorStats(Ref<vm::CellSlice> cs, DiscountedCounter& mc_cnt, DiscountedCounter& shard_cnt) {
+  if (cs.is_null()) {
+    return mc_cnt.set_zero() && shard_cnt.set_zero();
+  } else {
+    return fetch_CreatorStats(cs.write(), mc_cnt, shard_cnt) && cs->empty_ext();
+  }
+}
+
+/*
+ * 
+ *    Other block-related functions
+ * 
+ */
+
+bool store_UInt7(vm::CellBuilder& cb, unsigned long long value) {
+  return block::tlb::t_VarUInteger_7.store_long(cb, (long long)value);
+}
+
+bool store_UInt7(vm::CellBuilder& cb, unsigned long long value1, unsigned long long value2) {
+  return store_UInt7(cb, value1) && store_UInt7(cb, value2);
+}
+
+bool store_Maybe_Grams(vm::CellBuilder& cb, td::RefInt256 value) {
+  if (value.is_null()) {
+    return cb.store_long_bool(0, 1);
+  } else {
+    return cb.store_long_bool(1, 1) && block::tlb::t_Grams.store_integer_ref(cb, std::move(value));
+  }
+}
+
+bool store_Maybe_Grams_nz(vm::CellBuilder& cb, td::RefInt256 value) {
+  if (value.is_null() || !value->sgn()) {
+    return cb.store_long_bool(0, 1);
+  } else {
+    return cb.store_long_bool(1, 1) && block::tlb::t_Grams.store_integer_ref(cb, std::move(value));
+  }
+}
+
+bool store_CurrencyCollection(vm::CellBuilder& cb, td::RefInt256 value, Ref<vm::Cell> extra) {
+  return block::tlb::t_CurrencyCollection.pack_special(cb, std::move(value), std::move(extra));
+}
+
+bool fetch_CurrencyCollection(vm::CellSlice& cs, td::RefInt256& value, Ref<vm::Cell>& extra, bool inexact) {
+  return block::tlb::t_CurrencyCollection.unpack_special(cs, value, extra, inexact);
+}
+
+bool unpack_CurrencyCollection(Ref<vm::CellSlice> csr, td::RefInt256& value, Ref<vm::Cell>& extra) {
+  if (csr.is_null()) {
+    return false;
+  } else if (csr->is_unique()) {
+    return block::tlb::t_CurrencyCollection.unpack_special(csr.write(), value, extra);
+  } else {
+    vm::CellSlice cs{*csr};
+    return block::tlb::t_CurrencyCollection.unpack_special(cs, value, extra);
+  }
+}
+
+bool check_one_library(Ref<vm::CellSlice> cs_ref, td::ConstBitPtr key, int n) {
+  assert(n == 256);
+  if (cs_ref->size_ext() != 0x10001) {
+    return false;
+  }
+  Ref<vm::Cell> cell = cs_ref->prefetch_ref();
+  const auto& cell_hash = cell->get_hash();
+  return !td::bitstring::bits_memcmp(cell_hash.bits(), key, n);
+}
+
+bool valid_library_collection(Ref<vm::Cell> cell, bool catch_errors) {
+  if (cell.is_null()) {
+    return true;
+  }
+  if (!catch_errors) {
+    vm::Dictionary dict{std::move(cell), 256};
+    return dict.check_for_each(check_one_library);
+  }
+  try {
+    vm::Dictionary dict{std::move(cell), 256};
+    return dict.check_for_each(check_one_library);
+  } catch (vm::VmError&) {
+    return false;
+  }
+}
+
+bool check_one_config_param(Ref<vm::CellSlice> cs_ref, td::ConstBitPtr key, td::ConstBitPtr addr, bool relax_par0) {
+  if (cs_ref->size_ext() != 0x10000) {
+    return false;
+  }
+  Ref<vm::Cell> cell = cs_ref->prefetch_ref();
+  int idx = (int)key.get_int(32);
+  if (!idx) {
+    auto cs = load_cell_slice(std::move(cell));
+    return cs.size_ext() == 256 && (relax_par0 || cs.fetch_bits(256) == addr);
+  } else if (idx < 0) {
+    return true;
+  }
+  bool ok = block::gen::ConfigParam{idx}.validate_ref(std::move(cell));
+  if (!ok) {
+    LOG(ERROR) << "configuration parameter #" << idx << " is invalid";
+  }
+  return ok;
+}
+
+const int mandatory_config_params[] = {18, 20, 21, 22, 23, 24, 25, 28, 34};
+
+bool valid_config_data(Ref<vm::Cell> cell, const td::BitArray<256>& addr, bool catch_errors, bool relax_par0) {
+  using namespace std::placeholders;
+  if (cell.is_null()) {
+    return false;
+  }
+  if (!catch_errors) {
+    vm::Dictionary dict{std::move(cell), 32};
+    for (int x : mandatory_config_params) {
+      if (!dict.int_key_exists(x)) {
+        LOG(ERROR) << "mandatory configuration parameter #" << x << " is missing";
+        return false;
+      }
+    }
+    return dict.check_for_each(std::bind(check_one_config_param, _1, _2, addr.cbits(), relax_par0));
+  }
+  try {
+    vm::Dictionary dict{std::move(cell), 32};
+    for (int x : mandatory_config_params) {
+      if (!dict.int_key_exists(x)) {
+        LOG(ERROR) << "mandatory configuration parameter #" << x << " is missing";
+        return false;
+      }
+    }
+    return dict.check_for_each(std::bind(check_one_config_param, _1, _2, addr.cbits(), relax_par0));
+  } catch (vm::VmError&) {
+    return false;
+  }
+}
+
+bool add_extra_currency(Ref<vm::Cell> extra1, Ref<vm::Cell> extra2, Ref<vm::Cell>& res) {
+  if (extra2.is_null()) {
+    res = extra1;
+    return true;
+  } else if (extra1.is_null()) {
+    res = extra2;
+    return true;
+  } else {
+    return block::tlb::t_ExtraCurrencyCollection.add_values_ref(res, std::move(extra1), std::move(extra2));
+  }
+}
+
+bool sub_extra_currency(Ref<vm::Cell> extra1, Ref<vm::Cell> extra2, Ref<vm::Cell>& res) {
+  if (extra2.is_null()) {
+    res = extra1;
+    return true;
+  } else if (extra1.is_null()) {
+    res.clear();
+    return false;
+  } else {
+    return block::tlb::t_ExtraCurrencyCollection.sub_values_ref(res, std::move(extra1), std::move(extra2));
+  }
+}
+
+// combine d bits from dest, remaining 64 - d bits from src
+ton::AccountIdPrefixFull interpolate_addr(const ton::AccountIdPrefixFull& src, const ton::AccountIdPrefixFull& dest,
+                                          int d) {
+  if (d <= 0) {
+    return src;
+  } else if (d >= 96) {
+    return dest;
+  } else if (d >= 32) {
+    unsigned long long mask = (std::numeric_limits<td::uint64>::max() >> (d - 32));
+    return ton::AccountIdPrefixFull{dest.workchain, (dest.account_id_prefix & ~mask) | (src.account_id_prefix & mask)};
+  } else {
+    int mask = (-1 >> d);
+    return ton::AccountIdPrefixFull{(dest.workchain & ~mask) | (src.workchain & mask), src.account_id_prefix};
+  }
+}
+
+bool interpolate_addr_to(const ton::AccountIdPrefixFull& src, const ton::AccountIdPrefixFull& dest, int d,
+                         ton::AccountIdPrefixFull& res) {
+  res = interpolate_addr(src, dest, d);
+  return true;
+}
+
+// result: (transit_addr_dest_bits, nh_addr_dest_bits)
+std::pair<int, int> perform_hypercube_routing(ton::AccountIdPrefixFull src, ton::AccountIdPrefixFull dest,
+                                              ton::ShardIdFull cur, int used_dest_bits) {
+  ton::AccountIdPrefixFull transit = interpolate_addr(src, dest, used_dest_bits);
+  if (!ton::shard_contains(cur, transit)) {
+    return {-1, -1};
+  }
+  if (ton::shard_contains(cur, dest)) {
+    // if destination is in this shard, set cur:=next_hop:=dest
+    return {96, 96};
+  }
+  if (transit.workchain == ton::masterchainId || dest.workchain == ton::masterchainId) {
+    return {used_dest_bits, 96};  // route messages to/from masterchain directly
+  }
+  if (transit.workchain != dest.workchain) {
+    return {used_dest_bits, 32};
+  }
+  unsigned long long x = cur.shard & (cur.shard - 1), y = cur.shard | (cur.shard - 1);
+  unsigned long long t = transit.account_id_prefix, q = dest.account_id_prefix ^ t;
+  int i = (td::count_leading_zeroes64(q) & -4);  // top i bits match, next 4 bits differ
+  unsigned long long m = (std::numeric_limits<td::uint64>::max() >> i), h;
+  do {
+    m >>= 4;
+    h = t ^ (q & ~m);
+    i += 4;
+  } while (h >= x && h <= y);
+  return {28 + i, 32 + i};
+}
+
+bool compute_out_msg_queue_key(Ref<vm::Cell> msg_env, td::BitArray<352>& key) {
+  block::tlb::MsgEnvelope::Record_std env;
+  block::gen::CommonMsgInfo::Record_int_msg_info info;
+  if (!(tlb::unpack_cell(msg_env, env) && tlb::unpack_cell_inexact(env.msg, info))) {
+    return false;
+  }
+  auto src_prefix = block::tlb::t_MsgAddressInt.get_prefix(std::move(info.src));
+  auto dest_prefix = block::tlb::t_MsgAddressInt.get_prefix(std::move(info.dest));
+  auto next_hop = interpolate_addr(src_prefix, dest_prefix, env.next_addr);
+  key.bits().store_int(next_hop.workchain, 32);
+  (key.bits() + 32).store_int(next_hop.account_id_prefix, 64);
+  (key.bits() + 96).copy_from(env.msg->get_hash().bits(), 256);
+  return true;
+}
+
+bool unpack_block_prev_blk(Ref<vm::Cell> block_root, const ton::BlockIdExt& id, std::vector<ton::BlockIdExt>& prev,
+                           ton::BlockIdExt& mc_blkid, bool& after_split, ton::BlockIdExt* fetch_blkid) {
+  return unpack_block_prev_blk_ext(std::move(block_root), id, prev, mc_blkid, after_split, fetch_blkid).is_ok();
+}
+
+td::Status unpack_block_prev_blk_try(Ref<vm::Cell> block_root, const ton::BlockIdExt& id,
+                                     std::vector<ton::BlockIdExt>& prev, ton::BlockIdExt& mc_blkid, bool& after_split,
+                                     ton::BlockIdExt* fetch_blkid) {
+  try {
+    return unpack_block_prev_blk_ext(std::move(block_root), id, prev, mc_blkid, after_split, fetch_blkid);
+  } catch (vm::VmError err) {
+    return td::Status::Error(std::string{"error while processing Merkle proof: "} + err.get_msg());
+  } catch (vm::VmVirtError err) {
+    return td::Status::Error(std::string{"error while processing Merkle proof: "} + err.get_msg());
+  }
+}
+
+td::Status unpack_block_prev_blk_ext(Ref<vm::Cell> block_root, const ton::BlockIdExt& id,
+                                     std::vector<ton::BlockIdExt>& prev, ton::BlockIdExt& mc_blkid, bool& after_split,
+                                     ton::BlockIdExt* fetch_blkid) {
+  block::gen::Block::Record blk;
+  block::gen::BlockInfo::Record info;
+  block::gen::ExtBlkRef::Record mcref;  // _ ExtBlkRef = BlkMasterInfo;
+  ton::ShardIdFull shard;
+  if (!(tlb::unpack_cell(block_root, blk) && tlb::unpack_cell(blk.info, info) && !info.version &&
+        block::tlb::t_ShardIdent.unpack(info.shard.write(), shard) && !info.vert_seq_no &&
+        (!info.not_master || tlb::unpack_cell(info.master_ref, mcref)))) {
+    return td::Status::Error("cannot unpack block header");
+  }
+  if (fetch_blkid) {
+    fetch_blkid->id = ton::BlockId{shard, (unsigned)info.seq_no};
+    fetch_blkid->root_hash = block_root->get_hash().bits();
+    fetch_blkid->file_hash.clear();
+  } else {
+    ton::BlockId hdr_id{shard, (unsigned)info.seq_no};
+    if (id.id != hdr_id) {
+      return td::Status::Error("block header contains block id "s + hdr_id.to_str() + ", expected " + id.id.to_str());
+    }
+    if (id.root_hash != block_root->get_hash().bits()) {
+      return td::Status::Error("block header has incorrect root hash "s + block_root->get_hash().bits().to_hex(256) +
+                               " instead of expected " + id.root_hash.to_hex());
+    }
+  }
+  if (info.not_master != !shard.is_masterchain()) {
+    return td::Status::Error("block has invalid not_master flag in its (Merkelized) header");
+  }
+  after_split = info.after_split;
+  block::gen::ExtBlkRef::Record prev1, prev2;
+  if (info.after_merge) {
+    auto cs = vm::load_cell_slice(std::move(info.prev_ref));
+    CHECK(cs.size_ext() == 0x20000);  // prev_blks_info$_ prev1:^ExtBlkRef prev2:^ExtBlkRef = BlkPrevInfo 1;
+    if (!(tlb::unpack_cell(cs.prefetch_ref(0), prev1) && tlb::unpack_cell(cs.prefetch_ref(1), prev2))) {
+      return td::Status::Error("cannot unpack two previous block references from block header");
+    }
+  } else {
+    // prev_blk_info$_ prev:ExtBlkRef = BlkPrevInfo 0;
+    if (!(tlb::unpack_cell(std::move(info.prev_ref), prev1))) {
+      return td::Status::Error("cannot unpack previous block reference from block header");
+    }
+  }
+  prev.clear();
+  ton::BlockSeqno prev_seqno = prev1.seq_no;
+  if (!info.after_merge) {
+    prev.emplace_back(shard.workchain, info.after_split ? ton::shard_parent(shard.shard) : shard.shard, prev1.seq_no,
+                      prev1.root_hash, prev1.file_hash);
+    if (info.after_split && !prev1.seq_no) {
+      return td::Status::Error("shardchains cannot be split immediately after initial state");
+    }
+  } else {
+    if (info.after_split) {
+      return td::Status::Error("shardchains cannot be simultaneously split and merged at the same block");
+    }
+    prev.emplace_back(shard.workchain, ton::shard_child(shard.shard, true), prev1.seq_no, prev1.root_hash,
+                      prev1.file_hash);
+    prev.emplace_back(shard.workchain, ton::shard_child(shard.shard, false), prev2.seq_no, prev2.root_hash,
+                      prev2.file_hash);
+    prev_seqno = std::max<unsigned>(prev1.seq_no, prev2.seq_no);
+    if (!prev1.seq_no || !prev2.seq_no) {
+      return td::Status::Error("shardchains cannot be merged immediately after initial state");
+    }
+  }
+  if (id.id.seqno != prev_seqno + 1) {
+    return td::Status::Error("new block has invalid seqno (not equal to one plus maximum of seqnos of its ancestors)");
+  }
+  if (shard.is_masterchain()) {
+    mc_blkid = prev.at(0);
+  } else {
+    mc_blkid = ton::BlockIdExt{ton::masterchainId, ton::shardIdAll, mcref.seq_no, mcref.root_hash, mcref.file_hash};
+  }
+  return td::Status::OK();
+}
+
+td::Status check_block_header(Ref<vm::Cell> block_root, const ton::BlockIdExt& id, ton::Bits256* store_shard_hash_to) {
+  block::gen::Block::Record blk;
+  block::gen::BlockInfo::Record info;
+  ton::ShardIdFull shard;
+  if (!(tlb::unpack_cell(block_root, blk) && tlb::unpack_cell(blk.info, info) && !info.version &&
+        block::tlb::t_ShardIdent.unpack(info.shard.write(), shard) && !info.vert_seq_no)) {
+    return td::Status::Error("cannot unpack block header");
+  }
+  ton::BlockId hdr_id{shard, (unsigned)info.seq_no};
+  if (id.id != hdr_id) {
+    return td::Status::Error("block header contains block id "s + hdr_id.to_str() + ", expected " + id.id.to_str());
+  }
+  if (id.root_hash != block_root->get_hash().bits()) {
+    return td::Status::Error("block header has incorrect root hash "s + block_root->get_hash().bits().to_hex(256) +
+                             " instead of expected " + id.root_hash.to_hex());
+  }
+  if (info.not_master != !shard.is_masterchain()) {
+    return td::Status::Error("block has invalid not_master flag in its (Merkelized) header");
+  }
+  if (store_shard_hash_to) {
+    vm::CellSlice upd_cs{vm::NoVmSpec(), blk.state_update};
+    if (!(upd_cs.is_special() && upd_cs.prefetch_long(8) == 4  // merkle update
+          && upd_cs.size_ext() == 0x20228)) {
+      return td::Status::Error("invalid Merkle update in block header");
+    }
+    auto upd_hash = upd_cs.prefetch_ref(1)->get_hash(0);
+    *store_shard_hash_to = upd_hash.bits();
+  }
+  return td::Status::OK();
+}
+
+std::unique_ptr<vm::AugmentedDictionary> get_prev_blocks_dict(Ref<vm::Cell> state_root) {
+  block::gen::ShardStateUnsplit::Record info;
+  block::gen::McStateExtra::Record extra_info;
+  if (!(::tlb::unpack_cell(std::move(state_root), info) && info.custom->size_refs() &&
+        ::tlb::unpack_cell(info.custom->prefetch_ref(), extra_info))) {
+    return {};
+  }
+  return std::make_unique<vm::AugmentedDictionary>(extra_info.r1.prev_blocks, 32, block::tlb::aug_OldMcBlocksInfo);
+}
+
+bool get_old_mc_block_id(vm::AugmentedDictionary* prev_blocks_dict, ton::BlockSeqno seqno, ton::BlockIdExt& blkid,
+                         ton::LogicalTime* end_lt) {
+  return prev_blocks_dict && get_old_mc_block_id(*prev_blocks_dict, seqno, blkid, end_lt);
+}
+
+bool get_old_mc_block_id(vm::AugmentedDictionary& prev_blocks_dict, ton::BlockSeqno seqno, ton::BlockIdExt& blkid,
+                         ton::LogicalTime* end_lt) {
+  return unpack_old_mc_block_id(prev_blocks_dict.lookup(td::BitArray<32>{seqno}), seqno, blkid, end_lt);
+}
+
+bool unpack_old_mc_block_id(Ref<vm::CellSlice> old_blk_info, ton::BlockSeqno seqno, ton::BlockIdExt& blkid,
+                            ton::LogicalTime* end_lt) {
+  return old_blk_info.not_null() && old_blk_info.write().advance(1) &&
+         block::tlb::t_ExtBlkRef.unpack(std::move(old_blk_info), blkid, end_lt) && blkid.seqno() == seqno;
+}
+
+bool check_old_mc_block_id(vm::AugmentedDictionary* prev_blocks_dict, const ton::BlockIdExt& blkid) {
+  return prev_blocks_dict && check_old_mc_block_id(*prev_blocks_dict, blkid);
+}
+
+bool check_old_mc_block_id(vm::AugmentedDictionary& prev_blocks_dict, const ton::BlockIdExt& blkid) {
+  if (!blkid.id.is_masterchain_ext()) {
+    return false;
+  }
+  ton::BlockIdExt old_blkid;
+  return unpack_old_mc_block_id(prev_blocks_dict.lookup(td::BitArray<32>{blkid.id.seqno}), blkid.id.seqno, old_blkid) &&
+         old_blkid == blkid;
+}
+
+td::Result<Ref<vm::Cell>> get_block_transaction(Ref<vm::Cell> block_root, ton::WorkchainId workchain,
+                                                const ton::StdSmcAddress& addr, ton::LogicalTime lt) {
+  block::gen::Block::Record block;
+  block::gen::BlockInfo::Record info;
+  if (!(tlb::unpack_cell(std::move(block_root), block) && tlb::unpack_cell(std::move(block.info), info))) {
+    return td::Status::Error("cannot unpack block header");
+  }
+  Ref<vm::Cell> trans_root;
+  if (lt > info.start_lt && lt < info.end_lt) {
+    // lt belongs to this block
+    block::gen::BlockExtra::Record extra;
+    if (!(tlb::unpack_cell(block.extra, extra))) {
+      return td::Status::Error("cannot unpack block extra information");
+    }
+    vm::AugmentedDictionary account_blocks_dict{vm::load_cell_slice_ref(extra.account_blocks), 256,
+                                                block::tlb::aug_ShardAccountBlocks};
+    auto ab_csr = account_blocks_dict.lookup(addr);
+    if (ab_csr.not_null()) {
+      // account block for this account exists
+      block::gen::AccountBlock::Record acc_block;
+      if (!(tlb::csr_unpack(std::move(ab_csr), acc_block) && acc_block.account_addr == addr)) {
+        return td::Status::Error("cannot unpack AccountBlock");
+      }
+      vm::AugmentedDictionary trans_dict{vm::DictNonEmpty(), acc_block.transactions, 64,
+                                         block::tlb::aug_AccountTransactions};
+      return trans_dict.lookup_ref(td::BitArray<64>{static_cast<long long>(lt)});
+    }
+  }
+  return Ref<vm::Cell>{};
+}
+
+td::Result<Ref<vm::Cell>> get_block_transaction_try(Ref<vm::Cell> block_root, ton::WorkchainId workchain,
+                                                    const ton::StdSmcAddress& addr, ton::LogicalTime lt) {
+  try {
+    return get_block_transaction(std::move(block_root), workchain, addr, lt);
+  } catch (vm::VmError err) {
+    return td::Status::Error(std::string{"error while extracting transaction from block : "} + err.get_msg());
+  } catch (vm::VmVirtError err) {
+    return td::Status::Error(std::string{"virtualization error while traversing transaction proof : "} + err.get_msg());
+  }
+}
+
+bool get_transaction_in_msg(Ref<vm::Cell> trans_ref, Ref<vm::Cell>& in_msg) {
+  block::gen::Transaction::Record trans;
+  if (!tlb::unpack_cell(std::move(trans_ref), trans)) {
+    return false;
+  } else {
+    in_msg = trans.r1.in_msg->prefetch_ref();
+    return true;
+  }
+}
+
+bool is_transaction_in_msg(Ref<vm::Cell> trans_ref, Ref<vm::Cell> msg) {
+  Ref<vm::Cell> imsg;
+  return get_transaction_in_msg(std::move(trans_ref), imsg) && imsg.not_null() == msg.not_null() &&
+         (imsg.is_null() || imsg->get_hash() == msg->get_hash());
+}
+
+bool is_transaction_out_msg(Ref<vm::Cell> trans_ref, Ref<vm::Cell> msg) {
+  block::gen::Transaction::Record trans;
+  vm::CellSlice cs;
+  unsigned long long created_lt;
+  if (!(trans_ref.not_null() && msg.not_null() && tlb::unpack_cell(std::move(trans_ref), trans) && cs.load_ord(msg) &&
+        block::tlb::t_CommonMsgInfo.get_created_lt(cs, created_lt))) {
+    return false;
+  }
+  if (created_lt <= trans.lt || created_lt > trans.lt + trans.outmsg_cnt) {
+    return false;
+  }
+  try {
+    auto o_msg =
+        vm::Dictionary{trans.r1.out_msgs, 15}.lookup_ref(td::BitArray<15>{(long long)(created_lt - trans.lt - 1)});
+    return o_msg.not_null() && o_msg->get_hash() == msg->get_hash();
+  } catch (vm::VmError&) {
+    return false;
+  }
+}
+
+// transaction$0111 account_addr:bits256 lt:uint64 ...
+bool get_transaction_id(Ref<vm::Cell> trans_ref, ton::StdSmcAddress& account_addr, ton::LogicalTime& lt) {
+  if (trans_ref.is_null()) {
+    return false;
+  }
+  vm::CellSlice cs{vm::NoVmOrd(), trans_ref};
+  return cs.fetch_ulong(4) == 7             // transaction$0111
+         && cs.fetch_bits_to(account_addr)  // account_addr:bits256
+         && cs.fetch_uint_to(64, lt);       // lt:uint64
+}
+
+bool get_transaction_owner(Ref<vm::Cell> trans_ref, ton::StdSmcAddress& addr) {
+  ton::LogicalTime lt;
+  return get_transaction_id(std::move(trans_ref), addr, lt);
+}
+
+td::uint32 compute_validator_set_hash(ton::CatchainSeqno cc_seqno, ton::ShardIdFull from,
+                                      const std::vector<ton::ValidatorDescr>& nodes) {
+  /*
+  std::vector<tl_object_ptr<ton_api::test0_validatorSetItem>> s_vec;
+
+  for (auto& n : nodes) {
+    auto id = ValidatorFullId{n.key}.short_id();
+    s_vec.emplace_back(create_tl_object<ton_api::test0_validatorSetItem>(id, n.weight));
+  }
+
+  auto obj = create_tl_object<ton_api::test0_validatorSet>(cc_seqno, std::move(s_vec));
+  auto B = serialize_tl_object(obj, true);
+  return td::crc32c(B.as_slice());
+  */
+  CHECK(nodes.size() <= 0xffffffff);
+  auto tot_size = 1 + 1 + 1 + nodes.size() * (8 + 2 + 8);
+  auto buff = std::make_unique<td::uint32[]>(tot_size);
+  td::TlStorerUnsafe storer(reinterpret_cast<unsigned char*>(buff.get()));
+  auto* begin = storer.get_buf();
+  storer.store_int(-1877581587);  // magic inherited from test0.validatorSet
+  storer.store_int(cc_seqno);
+  storer.store_binary((td::uint32)nodes.size());
+  for (auto& n : nodes) {
+    storer.store_binary(n.key.as_bits256());
+    storer.store_long(n.weight);
+    storer.store_binary(n.addr);
+  }
+  auto* end = storer.get_buf();
+  CHECK(static_cast<size_t>(end - begin) == 4 * tot_size);
+  return td::crc32c(td::Slice(begin, end));
+}
+
+td::Result<Ref<vm::Cell>> get_config_data_from_smc(Ref<vm::Cell> acc_root) {
+  if (acc_root.is_null()) {
+    return td::Status::Error("configuration smart contract not found or it has no state, cannot extract configuration");
+  }
+  block::gen::Account::Record_account acc;
+  block::gen::AccountStorage::Record storage;
+  block::gen::StateInit::Record state;
+  if (!(tlb::unpack_cell(acc_root, acc) && tlb::csr_unpack(acc.storage, storage) &&
+        storage.state.write().fetch_ulong(1) == 1 && tlb::csr_unpack(storage.state, state) &&
+        state.data->have_refs(1))) {
+    return td::Status::Error("cannot extract persistent data from configuration smart contract state");
+  }
+  Ref<vm::Cell> data_cell = state.data->prefetch_ref();
+  auto res = vm::load_cell_slice(data_cell).prefetch_ref();
+  if (res.is_null()) {
+    return td::Status::Error(
+        "configuration smart contract does not contain a valid configuration in the first reference of its persistent "
+        "data");
+  }
+  return std::move(res);
+}
+
+td::Result<Ref<vm::Cell>> get_config_data_from_smc(Ref<vm::CellSlice> acc_csr) {
+  if (acc_csr.is_null()) {
+    return td::Status::Error("configuration smart contract not found, cannot extract configuration");
+  }
+  if (acc_csr->size_ext() != 0x10140) {
+    return td::Status::Error("configuration smart contract does not have a valid non-empty state");
+  }
+  return get_config_data_from_smc(acc_csr->prefetch_ref());
+}
+
+// when these parameters change, the block must be marked as a key block
+bool important_config_parameters_changed(Ref<vm::Cell> old_cfg_root, Ref<vm::Cell> new_cfg_root, bool coarse) {
+  if (old_cfg_root->get_hash() == new_cfg_root->get_hash()) {
+    return false;
+  }
+  if (coarse) {
+    return true;
+  }
+  // for now, all parameters are "important"
+  // at least the parameters affecting the computations of validator sets must be considered important
+  // ...
+  return true;
+}
+
+bool is_public_library(td::ConstBitPtr key, Ref<vm::CellSlice> val) {
+  return val.not_null() && val->prefetch_ulong(1) == 1 && val->have_refs() &&
+         !key.compare(val->prefetch_ref()->get_hash().bits(), 256);
+}
+
+bool parse_hex_hash(const char* str, const char* end, td::Bits256& hash) {
+  if (end - str != 64) {
+    return false;
+  }
+  int y = 0;
+  for (int i = 0; i < 64; i++) {
+    int c = *str++, x = c - '0';
+    if (x < 0) {
+      return false;
+    } else if (x > 10) {
+      x = (c | 0x20) - ('a' - 10);
+      if (x < 10 || x > 16) {
+        return false;
+      }
+    }
+    y = (y << 4) | x;
+    if (i & 1) {
+      hash.data()[i >> 1] = (unsigned char)y;
+      y = 0;
+    }
+  }
+  return true;
+}
+
+bool parse_hex_hash(td::Slice str, td::Bits256& hash) {
+  return parse_hex_hash(str.begin(), str.end(), hash);
+}
+
+bool parse_block_id_ext(const char* str, const char* end, ton::BlockIdExt& blkid) {
+  blkid.invalidate();
+  if (!str || !end || str >= end || end - str > 255) {
+    return false;
+  }
+  if (*str != '(') {
+    return false;
+  }
+  if (!std::memchr(str, ')', end - str)) {
+    return false;
+  }
+  int wc, pos = 0;
+  unsigned seqno;
+  unsigned long long shard;
+  if (std::sscanf(str, "(%d,%llx,%u):%n", &wc, &shard, &seqno, &pos) < 3 || pos <= 0 || pos >= end - str) {
+    return false;
+  }
+  if (!shard || wc == ton::workchainInvalid) {
+    return false;
+  }
+  str += pos;
+  if (end - str != 64 * 2 + 1 || str[64] != ':') {
+    return false;
+  }
+  blkid.id = ton::BlockId{wc, shard, seqno};
+  return (parse_hex_hash(str, str + 64, blkid.root_hash) && parse_hex_hash(str + 65, end, blkid.file_hash)) ||
+         blkid.invalidate();
+}
+
+bool parse_block_id_ext(td::Slice str, ton::BlockIdExt& blkid) {
+  return parse_block_id_ext(str.begin(), str.end(), blkid);
+}
+
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/block.h b/submodules/ton/tonlib-src/crypto/block/block.h
new file mode 100644
index 0000000000..377f99c2b8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/block.h
@@ -0,0 +1,664 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "common/refcnt.hpp"
+#include "vm/cells.h"
+#include "vm/cellslice.h"
+#include "vm/dict.h"
+#include "vm/boc.h"
+#include "vm/stack.hpp"
+#include <ostream>
+#include "tl/tlblib.hpp"
+#include "td/utils/bits.h"
+#include "td/utils/StringBuilder.h"
+#include "ton/ton-types.h"
+
+namespace block {
+
+using td::Ref;
+
+struct PublicKey {
+  std::string key;
+
+  static td::Result<PublicKey> from_bytes(td::Slice key);
+
+  static td::Result<PublicKey> parse(td::Slice key);
+
+  std::string serialize(bool base64_url = false);
+};
+
+struct StdAddress {
+  ton::WorkchainId workchain{ton::workchainInvalid};
+  bool bounceable{true};  // addresses must be bounceable by default
+  bool testnet{false};
+  ton::StdSmcAddress addr;
+  StdAddress() = default;
+  StdAddress(ton::WorkchainId _wc, const ton::StdSmcAddress& _addr, bool _bounce = true, bool _testnet = false)
+      : workchain(_wc), bounceable(_bounce), testnet(_testnet), addr(_addr) {
+  }
+  StdAddress(ton::WorkchainId _wc, td::ConstBitPtr _addr, bool _bounce = true, bool _testnet = false)
+      : workchain(_wc), bounceable(_bounce), testnet(_testnet), addr(_addr) {
+  }
+  explicit StdAddress(std::string serialized);
+  explicit StdAddress(td::Slice from);
+  bool is_valid() const {
+    return workchain != ton::workchainInvalid;
+  }
+  bool invalidate() {
+    workchain = ton::workchainInvalid;
+    return false;
+  }
+  std::string rserialize(bool base64_url = false) const;
+  bool rserialize_to(td::MutableSlice to, bool base64_url = false) const;
+  bool rserialize_to(char to[48], bool base64_url = false) const;
+  bool rdeserialize(td::Slice from);
+  bool rdeserialize(std::string from);
+  bool rdeserialize(const char from[48]);
+  bool parse_addr(td::Slice acc_string);
+  bool operator==(const StdAddress& other) const;
+
+  static td::Result<StdAddress> parse(td::Slice acc_string);
+};
+
+inline td::StringBuilder& operator<<(td::StringBuilder& sb, const StdAddress& addr) {
+  return sb << addr.workchain << " : " << addr.addr.to_hex();
+}
+
+bool parse_std_account_addr(td::Slice acc_string, ton::WorkchainId& wc, ton::StdSmcAddress& addr,
+                            bool* bounceable = nullptr, bool* testnet_only = nullptr);
+
+struct ShardId {
+  ton::WorkchainId workchain_id;
+  int shard_pfx_len;
+  unsigned long long shard_pfx;
+  ShardId(ton::WorkchainId wc_id = ton::workchainInvalid)
+      : workchain_id(wc_id), shard_pfx_len(0), shard_pfx(1ULL << 63) {
+  }
+  ShardId(ton::WorkchainId wc_id, unsigned long long sh_pfx);
+  ShardId(ton::ShardIdFull ton_shard);
+  ShardId(ton::BlockId ton_block);
+  ShardId(const ton::BlockIdExt& ton_block);
+  ShardId(ton::WorkchainId wc_id, unsigned long long sh_pfx, int sh_pfx_len);
+  ShardId(vm::CellSlice& cs) {
+    deserialize(cs);
+  }
+  ShardId(Ref<vm::CellSlice> cs_ref) {
+    vm::CellSlice cs{*cs_ref};
+    deserialize(cs);
+  }
+  explicit operator ton::ShardIdFull() const {
+    return ton::ShardIdFull{workchain_id, shard_pfx};
+  }
+  bool operator==(const ShardId& other) const {
+    return workchain_id == other.workchain_id && shard_pfx == other.shard_pfx;
+  }
+  void invalidate() {
+    workchain_id = ton::workchainInvalid;
+    shard_pfx_len = 0;
+  }
+  bool is_valid() const {
+    return workchain_id != ton::workchainInvalid;
+  }
+  void show(std::ostream& os) const;
+  std::string to_str() const;
+  bool serialize(vm::CellBuilder& cb) const;
+  bool deserialize(vm::CellSlice& cs);
+
+ private:
+  void init();
+};
+
+struct EnqueuedMsgDescr {
+  ton::AccountIdPrefixFull src_prefix_, cur_prefix_, next_prefix_, dest_prefix_;
+  ton::LogicalTime lt_;
+  ton::LogicalTime enqueued_lt_;
+  ton::Bits256 hash_;
+  Ref<vm::Cell> msg_;
+  Ref<vm::Cell> msg_env_;
+  EnqueuedMsgDescr() = default;
+  EnqueuedMsgDescr(ton::AccountIdPrefixFull cur_pfx, ton::AccountIdPrefixFull next_pfx, ton::LogicalTime lt,
+                   ton::LogicalTime enqueued_lt, td::ConstBitPtr hash)
+      : cur_prefix_(cur_pfx), next_prefix_(next_pfx), lt_(lt), enqueued_lt_(enqueued_lt), hash_(hash) {
+  }
+  bool is_valid() const {
+    return next_prefix_.is_valid();
+  }
+  bool check_key(td::ConstBitPtr key) const;
+  bool invalidate() {
+    next_prefix_.workchain = cur_prefix_.workchain = ton::workchainInvalid;
+    return false;
+  }
+  bool unpack(vm::CellSlice& cs);
+};
+
+using compute_shard_end_lt_func_t = std::function<ton::LogicalTime(ton::AccountIdPrefixFull)>;
+
+struct MsgProcessedUpto {
+  ton::ShardId shard;
+  ton::BlockSeqno mc_seqno;
+  ton::LogicalTime last_inmsg_lt;
+  ton::Bits256 last_inmsg_hash;
+  compute_shard_end_lt_func_t compute_shard_end_lt;
+  MsgProcessedUpto() = default;
+  MsgProcessedUpto(ton::ShardId _shard, ton::BlockSeqno _mcseqno, ton::LogicalTime _lt, td::ConstBitPtr _hash)
+      : shard(_shard), mc_seqno(_mcseqno), last_inmsg_lt(_lt), last_inmsg_hash(_hash) {
+  }
+  bool operator<(const MsgProcessedUpto& other) const & {
+    return shard < other.shard || (shard == other.shard && mc_seqno < other.mc_seqno);
+  }
+  bool contains(const MsgProcessedUpto& other) const &;
+  bool contains(ton::ShardId other_shard, ton::LogicalTime other_lt, td::ConstBitPtr other_hash,
+                ton::BlockSeqno other_mc_seqno) const &;
+  // NB: this is for checking whether we have already imported an internal message
+  bool already_processed(const EnqueuedMsgDescr& msg) const;
+};
+
+struct MsgProcessedUptoCollection {
+  ton::ShardIdFull owner;
+  bool valid{false};
+  std::vector<MsgProcessedUpto> list;
+  MsgProcessedUptoCollection(ton::ShardIdFull _owner) : owner(_owner) {
+  }
+  MsgProcessedUptoCollection(ton::ShardIdFull _owner, Ref<vm::CellSlice> cs_ref);
+  static std::unique_ptr<MsgProcessedUptoCollection> unpack(ton::ShardIdFull _owner, Ref<vm::CellSlice> cs_ref);
+  bool is_valid() const {
+    return valid;
+  }
+  bool insert(ton::BlockSeqno mc_seqno, ton::LogicalTime last_proc_lt, td::ConstBitPtr last_proc_hash);
+  bool insert_infty(ton::BlockSeqno mc_seqno, ton::LogicalTime last_proc_lt = ~0ULL);
+  bool compactify();
+  bool pack(vm::CellBuilder& cb);
+  bool is_reduced() const;
+  bool contains(const MsgProcessedUpto& other) const;
+  bool contains(const MsgProcessedUptoCollection& other) const;
+  const MsgProcessedUpto* is_simple_update_of(const MsgProcessedUptoCollection& other, bool& ok) const;
+  ton::BlockSeqno min_mc_seqno() const;
+  bool split(ton::ShardIdFull new_owner);
+  bool combine_with(const MsgProcessedUptoCollection& other);
+  // NB: this is for checking whether we have already imported an internal message
+  bool already_processed(const EnqueuedMsgDescr& msg) const;
+  bool for_each_mcseqno(std::function<bool(ton::BlockSeqno)>) const;
+};
+
+struct ParamLimits {
+  enum { limits_cnt = 4 };
+  enum { cl_underload = 0, cl_normal = 1, cl_soft = 2, cl_medium = 3, cl_hard = 4 };
+  ParamLimits() = default;
+  ParamLimits(td::uint32 underload, td::uint32 soft_lim, td::uint32 hard_lim)
+      : limits_{underload, soft_lim, (soft_lim + hard_lim) / 2, hard_lim} {
+  }
+  td::uint32 underload() const {
+    return limits_[0];
+  }
+  td::uint32 soft() const {
+    return limits_[1];
+  }
+  td::uint32 hard() const {
+    return limits_[3];
+  }
+  bool compute_medium_limit() {
+    limits_[2] = soft() + ((hard() - soft()) >> 1);
+    return true;
+  }
+  bool deserialize(vm::CellSlice& cs);
+  int classify(td::uint64 value) const;
+  bool fits(unsigned cls, td::uint64 value) const;
+
+ private:
+  std::array<td::uint32, limits_cnt> limits_;
+};
+
+struct BlockLimits {
+  ParamLimits bytes, gas, lt_delta;
+  ton::LogicalTime start_lt{0};
+  const vm::CellUsageTree* usage_tree{nullptr};
+  bool deserialize(vm::CellSlice& cs);
+  int classify_size(td::uint64 size) const;
+  int classify_gas(td::uint64 gas) const;
+  int classify_lt(ton::LogicalTime lt) const;
+  int classify(td::uint64 size, td::uint64 gas, ton::LogicalTime lt) const;
+  bool fits(unsigned cls, td::uint64 size, td::uint64 gas, ton::LogicalTime lt) const;
+};
+
+struct BlockLimitStatus {
+  const BlockLimits& limits;
+  ton::LogicalTime cur_lt;
+  td::uint64 gas_used{};
+  vm::NewCellStorageStat st_stat;
+  unsigned accounts{}, transactions{};
+  BlockLimitStatus(const BlockLimits& limits_, ton::LogicalTime lt = 0)
+      : limits(limits_), cur_lt(std::max(limits_.start_lt, lt)) {
+  }
+  void reset() {
+    cur_lt = limits.start_lt;
+    st_stat.set_zero();
+    transactions = accounts = 0;
+    gas_used = 0;
+  }
+  td::uint64 estimate_block_size(const vm::NewCellStorageStat::Stat* extra = nullptr) const;
+  int classify() const;
+  bool fits(unsigned cls) const;
+  bool would_fit(unsigned cls, ton::LogicalTime end_lt, td::uint64 more_gas,
+                 const vm::NewCellStorageStat::Stat* extra = nullptr) const;
+  bool add_cell(Ref<vm::Cell> cell) {
+    st_stat.add_cell(std::move(cell));
+    return true;
+  }
+  bool add_proof(Ref<vm::Cell> cell) {
+    st_stat.add_proof(std::move(cell), limits.usage_tree);
+    return true;
+  }
+  bool update_lt(ton::LogicalTime lt) {
+    cur_lt = std::max(lt, cur_lt);
+    return true;
+  }
+  bool update_gas(td::uint64 more_gas) {
+    gas_used += more_gas;
+    return true;
+  }
+  bool add_transaction(unsigned cnt = 1) {
+    transactions += cnt;
+    return true;
+  }
+  bool add_account(unsigned cnt = 1) {
+    accounts += cnt;
+    return true;
+  }
+};
+
+namespace tlb {
+struct CurrencyCollection;
+}  // namespace tlb
+
+struct CurrencyCollection {
+  using type_class = block::tlb::CurrencyCollection;
+  td::RefInt256 grams;
+  Ref<vm::Cell> extra;
+  CurrencyCollection() = default;
+  explicit CurrencyCollection(td::RefInt256 _grams, Ref<vm::Cell> _extra = {})
+      : grams(std::move(_grams)), extra(std::move(_extra)) {
+  }
+  explicit CurrencyCollection(long long _grams, Ref<vm::Cell> _extra = {})
+      : grams(true, _grams), extra(std::move(_extra)) {
+  }
+  bool set_zero() {
+    grams = td::RefInt256{true, 0};
+    extra.clear();
+    return true;
+  }
+  static CurrencyCollection zero() {
+    return CurrencyCollection(td::RefInt256{true, 0});
+  }
+  bool is_valid() const {
+    return grams.not_null();
+  }
+  bool is_zero() const {
+    return is_valid() && extra.is_null() && !td::sgn(grams);
+  }
+  bool has_extra() const {
+    return extra.not_null();
+  }
+  bool invalidate() {
+    extra.clear();
+    grams.clear();
+    return false;
+  }
+  bool validate() const;
+  bool validate_extra() const;
+  bool operator==(const CurrencyCollection& other) const;
+  bool operator!=(const CurrencyCollection& other) const {
+    return !operator==(other);
+  }
+  bool operator==(td::RefInt256 other_grams) const {
+    return is_valid() && !has_extra() && !td::cmp(grams, other_grams);
+  }
+  bool operator!=(td::RefInt256 other_grams) const {
+    return !operator==(std::move(other_grams));
+  }
+  bool operator>=(const CurrencyCollection& other) const;
+  bool operator<=(const CurrencyCollection& other) const {
+    return other >= *this;
+  }
+  static bool add(const CurrencyCollection& a, const CurrencyCollection& b, CurrencyCollection& c);
+  static bool add(const CurrencyCollection& a, CurrencyCollection&& b, CurrencyCollection& c);
+  CurrencyCollection& operator+=(const CurrencyCollection& other);
+  CurrencyCollection& operator+=(CurrencyCollection&& other);
+  CurrencyCollection& operator+=(td::RefInt256 other_grams);
+  CurrencyCollection operator+(const CurrencyCollection& other) const;
+  CurrencyCollection operator+(CurrencyCollection&& other) const;
+  CurrencyCollection operator+(td::RefInt256 other_grams);
+  static bool sub(const CurrencyCollection& a, const CurrencyCollection& b, CurrencyCollection& c);
+  static bool sub(const CurrencyCollection& a, CurrencyCollection&& b, CurrencyCollection& c);
+  CurrencyCollection& operator-=(const CurrencyCollection& other);
+  CurrencyCollection& operator-=(CurrencyCollection&& other);
+  CurrencyCollection& operator-=(td::RefInt256 other_grams);
+  CurrencyCollection operator-(const CurrencyCollection& other) const;
+  CurrencyCollection operator-(CurrencyCollection&& other) const;
+  CurrencyCollection operator-(td::RefInt256 other_grams) const;
+  bool store(vm::CellBuilder& cb) const;
+  bool store_or_zero(vm::CellBuilder& cb) const;
+  bool fetch(vm::CellSlice& cs);
+  bool fetch_exact(vm::CellSlice& cs);
+  bool unpack(Ref<vm::CellSlice> csr);
+  bool validate_unpack(Ref<vm::CellSlice> csr);
+  Ref<vm::CellSlice> pack() const;
+  bool pack_to(Ref<vm::CellSlice>& csr) const {
+    return (csr = pack()).not_null();
+  }
+  Ref<vm::Tuple> as_vm_tuple() const {
+    if (is_valid()) {
+      return vm::make_tuple_ref(grams, vm::StackEntry::maybe(extra));
+    } else {
+      return {};
+    }
+  }
+  bool show(std::ostream& os) const;
+  std::string to_str() const;
+};
+
+std::ostream& operator<<(std::ostream& os, const CurrencyCollection& cc);
+
+struct ShardState {
+  enum { verbosity = 0 };
+  ton::BlockIdExt id_;
+  Ref<vm::Cell> root_;
+  int global_id_;
+  ton::UnixTime utime_;
+  ton::LogicalTime lt_;
+  ton::BlockSeqno mc_blk_seqno_, min_ref_mc_seqno_;
+  ton::BlockIdExt mc_blk_ref_;
+  ton::LogicalTime mc_blk_lt_;
+  bool before_split_{false};
+  std::unique_ptr<vm::AugmentedDictionary> account_dict_;
+  std::unique_ptr<vm::Dictionary> shard_libraries_;
+  Ref<vm::Cell> mc_state_extra_;
+  td::uint64 overload_history_{0}, underload_history_{0};
+  CurrencyCollection total_balance_, total_validator_fees_, global_balance_;
+  std::unique_ptr<vm::AugmentedDictionary> out_msg_queue_;
+  std::unique_ptr<vm::Dictionary> ihr_pending_;
+  std::unique_ptr<vm::Dictionary> block_create_stats_;
+  std::shared_ptr<block::MsgProcessedUptoCollection> processed_upto_;
+
+  bool is_valid() const {
+    return id_.is_valid();
+  }
+  bool is_masterchain() const {
+    return id_.is_masterchain();
+  }
+  bool invalidate() {
+    id_.invalidate();
+    return false;
+  }
+  td::Status unpack_state(ton::BlockIdExt id, Ref<vm::Cell> state_root);
+  td::Status unpack_state_ext(ton::BlockIdExt id, Ref<vm::Cell> state_root, int global_id,
+                              ton::BlockSeqno prev_mc_block_seqno, bool after_split, bool clear_history,
+                              std::function<bool(ton::BlockSeqno)> for_each_mcseqno);
+  td::Status merge_with(ShardState& sib);
+  td::Result<std::unique_ptr<vm::AugmentedDictionary>> compute_split_out_msg_queue(ton::ShardIdFull subshard);
+  td::Result<std::shared_ptr<block::MsgProcessedUptoCollection>> compute_split_processed_upto(
+      ton::ShardIdFull subshard);
+  td::Status split(ton::ShardIdFull subshard);
+  td::Status unpack_out_msg_queue_info(Ref<vm::Cell> out_msg_queue_info);
+  bool clear_load_history() {
+    overload_history_ = underload_history_ = 0;
+    return true;
+  }
+  bool clear_load_history_if(bool cond) {
+    return !cond || clear_load_history();
+  }
+  td::Status check_before_split(bool before_split) const;
+  td::Status check_global_id(int req_global_id) const;
+  td::Status check_mc_blk_seqno(ton::BlockSeqno last_mc_block_seqno) const;
+  bool update_prev_utime_lt(ton::UnixTime& prev_utime, ton::LogicalTime& prev_lt) const;
+
+  bool for_each_mcseqno(std::function<bool(ton::BlockSeqno)> func) const {
+    return processed_upto_ && processed_upto_->for_each_mcseqno(std::move(func));
+  }
+};
+
+struct ValueFlow {
+  struct SetZero {};
+  CurrencyCollection from_prev_blk, to_next_blk, imported, exported, fees_collected, fees_imported, recovered, created,
+      minted;
+  ValueFlow() = default;
+  ValueFlow(SetZero)
+      : from_prev_blk{0}
+      , to_next_blk{0}
+      , imported{0}
+      , exported{0}
+      , fees_collected{0}
+      , fees_imported{0}
+      , recovered{0}
+      , created{0}
+      , minted{0} {
+  }
+  bool is_valid() const {
+    return from_prev_blk.is_valid() && minted.is_valid();
+  }
+  bool validate() const;
+  bool invalidate() {
+    return from_prev_blk.invalidate();
+  }
+  bool set_zero();
+  bool store(vm::CellBuilder& cb) const;
+  bool fetch(vm::CellSlice& cs);
+  bool unpack(Ref<vm::CellSlice> csr);
+  bool show(std::ostream& os) const;
+  std::string to_str() const;
+
+ private:
+  bool show_one(std::ostream& os, const char* str, const CurrencyCollection& cc) const;
+};
+
+std::ostream& operator<<(std::ostream& os, const ValueFlow& vflow);
+
+struct DiscountedCounter {
+  struct SetZero {};
+  bool valid;
+  ton::UnixTime last_updated;
+  td::uint64 total;
+  td::uint64 cnt2048;
+  td::uint64 cnt65536;
+  DiscountedCounter() : valid(false) {
+  }
+  DiscountedCounter(SetZero) : valid(true), last_updated(0), total(0), cnt2048(0), cnt65536(0) {
+  }
+  DiscountedCounter(ton::UnixTime _lastupd, td::uint64 _total, td::uint64 _cnt2048, td::uint64 _cnt65536)
+      : valid(true), last_updated(_lastupd), total(_total), cnt2048(_cnt2048), cnt65536(_cnt65536) {
+  }
+  static DiscountedCounter Zero() {
+    return SetZero();
+  }
+  bool is_valid() const {
+    return valid;
+  }
+  bool invalidate() {
+    return (valid = false);
+  }
+  bool set_zero() {
+    last_updated = 0;
+    total = cnt2048 = cnt65536 = 0;
+    return (valid = true);
+  }
+  bool is_zero() const {
+    return !total;
+  }
+  bool almost_zero() const {
+    return (cnt2048 | cnt65536) <= 1;
+  }
+  bool operator==(const DiscountedCounter& other) const {
+    return last_updated == other.last_updated && total == other.total && cnt2048 == other.cnt2048 &&
+           cnt65536 == other.cnt65536;
+  }
+  bool almost_equals(const DiscountedCounter& other) const {
+    return last_updated == other.last_updated && total == other.total && cnt2048 <= other.cnt2048 + 1 &&
+           other.cnt2048 <= cnt2048 + 1 && cnt65536 <= other.cnt65536 + 1 && other.cnt65536 <= cnt65536 + 1;
+  }
+  bool validate();
+  bool increase_by(unsigned count, ton::UnixTime now);
+  bool fetch(vm::CellSlice& cs);
+  bool unpack(Ref<vm::CellSlice> csr);
+  bool store(vm::CellBuilder& cb) const;
+  Ref<vm::CellSlice> pack() const;
+  bool show(std::ostream& os) const;
+  std::string to_str() const;
+};
+
+static inline std::ostream& operator<<(std::ostream& os, const DiscountedCounter& dcount) {
+  dcount.show(os);
+  return os;
+}
+
+bool fetch_CreatorStats(vm::CellSlice& cs, DiscountedCounter& mc_cnt, DiscountedCounter& shard_cnt);
+bool store_CreatorStats(vm::CellBuilder& cb, const DiscountedCounter& mc_cnt, const DiscountedCounter& shard_cnt);
+bool unpack_CreatorStats(Ref<vm::CellSlice> cs, DiscountedCounter& mc_cnt, DiscountedCounter& shard_cnt);
+
+struct BlockProofLink {
+  ton::BlockIdExt from, to;
+  bool is_key{false}, is_fwd{false};
+  Ref<vm::Cell> dest_proof, state_proof, proof;
+  ton::CatchainSeqno cc_seqno{0};
+  td::uint32 validator_set_hash{0};
+  std::vector<ton::BlockSignature> signatures;
+  BlockProofLink(ton::BlockIdExt _from, ton::BlockIdExt _to, bool _iskey = false)
+      : from(_from), to(_to), is_key(_iskey), is_fwd(to.seqno() > from.seqno()) {
+  }
+  bool incomplete() const {
+    return dest_proof.is_null();
+  }
+  td::Status validate(td::uint32* save_utime = nullptr) const;
+};
+
+struct BlockProofChain {
+  ton::BlockIdExt from, to;
+  int mode;
+  td::uint32 last_utime{0};
+  bool complete{false}, has_key_block{false}, has_utime{false}, valid{false};
+  ton::BlockIdExt key_blkid;
+  std::vector<BlockProofLink> links;
+  std::size_t link_count() const {
+    return links.size();
+  }
+  BlockProofChain(ton::BlockIdExt _from, ton::BlockIdExt _to, int _mode = 0) : from(_from), to(_to), mode(_mode) {
+  }
+  BlockProofLink& new_link(const ton::BlockIdExt& cur, const ton::BlockIdExt& next, bool iskey = false) {
+    links.emplace_back(cur, next, iskey);
+    return links.back();
+  }
+  const BlockProofLink& last_link() const {
+    return links.back();
+  }
+  BlockProofLink& last_link() {
+    return links.back();
+  }
+  bool last_link_incomplete() const {
+    return !links.empty() && last_link().incomplete();
+  }
+  td::Status validate();
+};
+
+int filter_out_msg_queue(vm::AugmentedDictionary& out_queue, ton::ShardIdFull old_shard, ton::ShardIdFull subshard);
+
+std::ostream& operator<<(std::ostream& os, const ShardId& shard_id);
+
+bool pack_std_smc_addr_to(char result[48], bool base64_url, ton::WorkchainId wc, const ton::StdSmcAddress& addr,
+                          bool bounceable, bool testnet);
+std::string pack_std_smc_addr(bool base64_url, ton::WorkchainId wc, const ton::StdSmcAddress& addr, bool bounceable,
+                              bool testnet);
+bool unpack_std_smc_addr(const char packed[48], ton::WorkchainId& wc, ton::StdSmcAddress& addr, bool& bounceable,
+                         bool& testnet);
+bool unpack_std_smc_addr(td::Slice packed, ton::WorkchainId& wc, ton::StdSmcAddress& addr, bool& bounceable,
+                         bool& testnet);
+bool unpack_std_smc_addr(std::string packed, ton::WorkchainId& wc, ton::StdSmcAddress& addr, bool& bounceable,
+                         bool& testnet);
+
+bool store_UInt7(vm::CellBuilder& cb, unsigned long long value);
+bool store_UInt7(vm::CellBuilder& cb, unsigned long long value1, unsigned long long value2);
+bool store_Maybe_Grams(vm::CellBuilder& cb, td::RefInt256 value);
+bool store_Maybe_Grams_nz(vm::CellBuilder& cb, td::RefInt256 value);
+bool store_CurrencyCollection(vm::CellBuilder& cb, td::RefInt256 value, Ref<vm::Cell> extra);
+bool fetch_CurrencyCollection(vm::CellSlice& cs, td::RefInt256& value, Ref<vm::Cell>& extra, bool inexact = false);
+bool unpack_CurrencyCollection(Ref<vm::CellSlice> csr, td::RefInt256& value, Ref<vm::Cell>& extra);
+
+bool valid_library_collection(Ref<vm::Cell> cell, bool catch_errors = true);
+
+bool valid_config_data(Ref<vm::Cell> cell, const td::BitArray<256>& addr, bool catch_errors = true,
+                       bool relax_par0 = false);
+
+bool add_extra_currency(Ref<vm::Cell> extra1, Ref<vm::Cell> extra2, Ref<vm::Cell>& res);
+bool sub_extra_currency(Ref<vm::Cell> extra1, Ref<vm::Cell> extra2, Ref<vm::Cell>& res);
+
+ton::AccountIdPrefixFull interpolate_addr(const ton::AccountIdPrefixFull& src, const ton::AccountIdPrefixFull& dest,
+                                          int used_dest_bits);
+bool interpolate_addr_to(const ton::AccountIdPrefixFull& src, const ton::AccountIdPrefixFull& dest, int used_dest_bits,
+                         ton::AccountIdPrefixFull& res);
+// result: (transit_addr_dest_bits, nh_addr_dest_bits)
+std::pair<int, int> perform_hypercube_routing(ton::AccountIdPrefixFull src, ton::AccountIdPrefixFull dest,
+                                              ton::ShardIdFull cur, int used_dest_bits = 0);
+
+bool compute_out_msg_queue_key(Ref<vm::Cell> msg_env, td::BitArray<352>& key);
+
+bool unpack_block_prev_blk(Ref<vm::Cell> block_root, const ton::BlockIdExt& id, std::vector<ton::BlockIdExt>& prev,
+                           ton::BlockIdExt& mc_blkid, bool& after_split, ton::BlockIdExt* fetch_blkid = nullptr);
+td::Status unpack_block_prev_blk_ext(Ref<vm::Cell> block_root, const ton::BlockIdExt& id,
+                                     std::vector<ton::BlockIdExt>& prev, ton::BlockIdExt& mc_blkid, bool& after_split,
+                                     ton::BlockIdExt* fetch_blkid = nullptr);
+td::Status unpack_block_prev_blk_try(Ref<vm::Cell> block_root, const ton::BlockIdExt& id,
+                                     std::vector<ton::BlockIdExt>& prev, ton::BlockIdExt& mc_blkid, bool& after_split,
+                                     ton::BlockIdExt* fetch_blkid = nullptr);
+td::Status check_block_header(Ref<vm::Cell> block_root, const ton::BlockIdExt& id,
+                              ton::Bits256* store_shard_hash_to = nullptr);
+
+std::unique_ptr<vm::AugmentedDictionary> get_prev_blocks_dict(Ref<vm::Cell> state_root);
+bool get_old_mc_block_id(vm::AugmentedDictionary* prev_blocks_dict, ton::BlockSeqno seqno, ton::BlockIdExt& blkid,
+                         ton::LogicalTime* end_lt = nullptr);
+bool get_old_mc_block_id(vm::AugmentedDictionary& prev_blocks_dict, ton::BlockSeqno seqno, ton::BlockIdExt& blkid,
+                         ton::LogicalTime* end_lt = nullptr);
+bool unpack_old_mc_block_id(Ref<vm::CellSlice> old_blk_info, ton::BlockSeqno seqno, ton::BlockIdExt& blkid,
+                            ton::LogicalTime* end_lt = nullptr);
+bool check_old_mc_block_id(vm::AugmentedDictionary* prev_blocks_dict, const ton::BlockIdExt& blkid);
+bool check_old_mc_block_id(vm::AugmentedDictionary& prev_blocks_dict, const ton::BlockIdExt& blkid);
+
+td::Result<Ref<vm::Cell>> get_block_transaction(Ref<vm::Cell> block_root, ton::WorkchainId workchain,
+                                                const ton::StdSmcAddress& addr, ton::LogicalTime lt);
+td::Result<Ref<vm::Cell>> get_block_transaction_try(Ref<vm::Cell> block_root, ton::WorkchainId workchain,
+                                                    const ton::StdSmcAddress& addr, ton::LogicalTime lt);
+
+bool get_transaction_in_msg(Ref<vm::Cell> trans_ref, Ref<vm::Cell>& in_msg);
+bool is_transaction_in_msg(Ref<vm::Cell> trans_ref, Ref<vm::Cell> msg);
+bool is_transaction_out_msg(Ref<vm::Cell> trans_ref, Ref<vm::Cell> msg);
+bool get_transaction_id(Ref<vm::Cell> trans_ref, ton::StdSmcAddress& account_addr, ton::LogicalTime& lt);
+bool get_transaction_owner(Ref<vm::Cell> trans_ref, ton::StdSmcAddress& addr);
+
+td::uint32 compute_validator_set_hash(ton::CatchainSeqno cc_seqno, ton::ShardIdFull from,
+                                      const std::vector<ton::ValidatorDescr>& nodes);
+
+td::Result<Ref<vm::Cell>> get_config_data_from_smc(Ref<vm::Cell> acc_root);
+td::Result<Ref<vm::Cell>> get_config_data_from_smc(Ref<vm::CellSlice> acc_csr);
+bool important_config_parameters_changed(Ref<vm::Cell> old_cfg_root, Ref<vm::Cell> new_cfg_root, bool coarse = false);
+
+bool is_public_library(td::ConstBitPtr key, Ref<vm::CellSlice> val);
+
+bool parse_hex_hash(const char* str, const char* end, td::Bits256& hash);
+bool parse_hex_hash(td::Slice str, td::Bits256& hash);
+
+bool parse_block_id_ext(const char* str, const char* end, ton::BlockIdExt& blkid);
+bool parse_block_id_ext(td::Slice str, ton::BlockIdExt& blkid);
+
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/block.tlb b/submodules/ton/tonlib-src/crypto/block/block.tlb
new file mode 100644
index 0000000000..b9db5fe6ec
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/block.tlb
@@ -0,0 +1,672 @@
+unit$_ = Unit;
+true$_ = True;
+// EMPTY False;
+bool_false$0 = Bool;
+bool_true$1 = Bool;
+bool_false$0 = BoolFalse;
+bool_true$1 = BoolTrue;
+nothing$0 {X:Type} = Maybe X;
+just$1 {X:Type} value:X = Maybe X;
+left$0 {X:Type} {Y:Type} value:X = Either X Y;
+right$1 {X:Type} {Y:Type} value:Y = Either X Y;
+pair$_ {X:Type} {Y:Type} first:X second:Y = Both X Y;
+
+bit$_ (## 1) = Bit;
+/*
+ *
+ *   FROM hashmap.tlb
+ *
+ */
+// ordinary Hashmap / HashmapE, with fixed length keys
+//
+hm_edge#_ {n:#} {X:Type} {l:#} {m:#} label:(HmLabel ~l n) 
+          {n = (~m) + l} node:(HashmapNode m X) = Hashmap n X;
+
+hmn_leaf#_ {X:Type} value:X = HashmapNode 0 X;
+hmn_fork#_ {n:#} {X:Type} left:^(Hashmap n X) 
+           right:^(Hashmap n X) = HashmapNode (n + 1) X;
+
+hml_short$0 {m:#} {n:#} len:(Unary ~n) {n <= m} s:(n * Bit) = HmLabel ~n m;
+hml_long$10 {m:#} n:(#<= m) s:(n * Bit) = HmLabel ~n m;
+hml_same$11 {m:#} v:Bit n:(#<= m) = HmLabel ~n m;
+
+unary_zero$0 = Unary ~0;
+unary_succ$1 {n:#} x:(Unary ~n) = Unary ~(n + 1);
+
+hme_empty$0 {n:#} {X:Type} = HashmapE n X;
+hme_root$1 {n:#} {X:Type} root:^(Hashmap n X) = HashmapE n X;
+
+// true#_ = True;
+_ {n:#} _:(Hashmap n True) = BitstringSet n;
+
+//  HashmapAug, hashmap with an extra value 
+//   (augmentation) of type Y at every node
+//
+ahm_edge#_ {n:#} {X:Type} {Y:Type} {l:#} {m:#} 
+  label:(HmLabel ~l n) {n = (~m) + l} 
+  node:(HashmapAugNode m X Y) = HashmapAug n X Y;
+ahmn_leaf#_ {X:Type} {Y:Type} extra:Y value:X = HashmapAugNode 0 X Y;
+ahmn_fork#_ {n:#} {X:Type} {Y:Type} left:^(HashmapAug n X Y)
+  right:^(HashmapAug n X Y) extra:Y = HashmapAugNode (n + 1) X Y;
+
+ahme_empty$0 {n:#} {X:Type} {Y:Type} extra:Y 
+          = HashmapAugE n X Y;
+ahme_root$1 {n:#} {X:Type} {Y:Type} root:^(HashmapAug n X Y) 
+  extra:Y = HashmapAugE n X Y;
+
+// VarHashmap / VarHashmapE, with variable-length keys
+//
+vhm_edge#_ {n:#} {X:Type} {l:#} {m:#} label:(HmLabel ~l n) 
+           {n = (~m) + l} node:(VarHashmapNode m X) 
+           = VarHashmap n X;
+vhmn_leaf$00 {n:#} {X:Type} value:X = VarHashmapNode n X;
+vhmn_fork$01 {n:#} {X:Type} left:^(VarHashmap n X) 
+             right:^(VarHashmap n X) value:(Maybe X) 
+             = VarHashmapNode (n + 1) X;
+vhmn_cont$1 {n:#} {X:Type} branch:Bit child:^(VarHashmap n X) 
+            value:X = VarHashmapNode (n + 1) X;
+
+// nothing$0 {X:Type} = Maybe X;
+// just$1 {X:Type} value:X = Maybe X;
+
+vhme_empty$0 {n:#} {X:Type} = VarHashmapE n X;
+vhme_root$1 {n:#} {X:Type} root:^(VarHashmap n X) 
+            = VarHashmapE n X;
+
+//
+// PfxHashmap / PfxHashmapE, with variable-length keys
+//                           constituting a prefix code
+//
+
+phm_edge#_ {n:#} {X:Type} {l:#} {m:#} label:(HmLabel ~l n) 
+           {n = (~m) + l} node:(PfxHashmapNode m X) 
+           = PfxHashmap n X;
+
+phmn_leaf$0 {n:#} {X:Type} value:X = PfxHashmapNode n X;
+phmn_fork$1 {n:#} {X:Type} left:^(PfxHashmap n X) 
+            right:^(PfxHashmap n X) = PfxHashmapNode (n + 1) X;
+
+phme_empty$0 {n:#} {X:Type} = PfxHashmapE n X;
+phme_root$1 {n:#} {X:Type} root:^(PfxHashmap n X) 
+            = PfxHashmapE n X;
+/*
+ *
+ *  END hashmap.tlb
+ *
+ */
+//
+// TON BLOCK LAYOUT
+//
+addr_none$00 = MsgAddressExt;
+addr_extern$01 len:(## 9) external_address:(bits len) 
+             = MsgAddressExt;
+anycast_info$_ depth:(#<= 30) { depth >= 1 }
+   rewrite_pfx:(bits depth) = Anycast;
+addr_std$10 anycast:(Maybe Anycast) 
+   workchain_id:int8 address:bits256  = MsgAddressInt;
+addr_var$11 anycast:(Maybe Anycast) addr_len:(## 9) 
+   workchain_id:int32 address:(bits addr_len) = MsgAddressInt;
+_ _:MsgAddressInt = MsgAddress;
+_ _:MsgAddressExt = MsgAddress;
+//
+var_uint$_ {n:#} len:(#< n) value:(uint (len * 8))
+         = VarUInteger n;
+var_int$_ {n:#} len:(#< n) value:(int (len * 8)) 
+        = VarInteger n;
+nanograms$_ amount:(VarUInteger 16) = Grams;  
+//
+extra_currencies$_ dict:(HashmapE 32 (VarUInteger 32)) 
+                 = ExtraCurrencyCollection;
+currencies$_ grams:Grams other:ExtraCurrencyCollection 
+           = CurrencyCollection;
+//
+int_msg_info$0 ihr_disabled:Bool bounce:Bool bounced:Bool
+  src:MsgAddressInt dest:MsgAddressInt 
+  value:CurrencyCollection ihr_fee:Grams fwd_fee:Grams
+  created_lt:uint64 created_at:uint32 = CommonMsgInfo;
+ext_in_msg_info$10 src:MsgAddressExt dest:MsgAddressInt 
+  import_fee:Grams = CommonMsgInfo;
+ext_out_msg_info$11 src:MsgAddressInt dest:MsgAddressExt
+  created_lt:uint64 created_at:uint32 = CommonMsgInfo;
+
+int_msg_info$0 ihr_disabled:Bool bounce:Bool bounced:Bool
+  src:MsgAddress dest:MsgAddressInt 
+  value:CurrencyCollection ihr_fee:Grams fwd_fee:Grams
+  created_lt:uint64 created_at:uint32 = CommonMsgInfoRelaxed;
+ext_out_msg_info$11 src:MsgAddress dest:MsgAddressExt
+  created_lt:uint64 created_at:uint32 = CommonMsgInfoRelaxed;
+
+tick_tock$_ tick:Bool tock:Bool = TickTock;
+
+_ split_depth:(Maybe (## 5)) special:(Maybe TickTock)
+  code:(Maybe ^Cell) data:(Maybe ^Cell)
+  library:(HashmapE 256 SimpleLib) = StateInit;
+  
+simple_lib$_ public:Bool root:^Cell = SimpleLib;
+
+message$_ {X:Type} info:CommonMsgInfo
+  init:(Maybe (Either StateInit ^StateInit))
+  body:(Either X ^X) = Message X;
+
+message$_ {X:Type} info:CommonMsgInfoRelaxed
+  init:(Maybe (Either StateInit ^StateInit))
+  body:(Either X ^X) = MessageRelaxed X;
+//
+interm_addr_regular$0 use_dest_bits:(#<= 96) 
+  = IntermediateAddress;
+interm_addr_simple$10 workchain_id:int8 addr_pfx:uint64 
+  = IntermediateAddress;
+interm_addr_ext$11 workchain_id:int32 addr_pfx:uint64
+  = IntermediateAddress;
+msg_envelope#4 cur_addr:IntermediateAddress 
+  next_addr:IntermediateAddress fwd_fee_remaining:Grams 
+  msg:^(Message Any) = MsgEnvelope;
+//
+msg_import_ext$000 msg:^(Message Any) transaction:^Transaction 
+              = InMsg;
+msg_import_ihr$010 msg:^(Message Any) transaction:^Transaction 
+    ihr_fee:Grams proof_created:^Cell = InMsg;
+msg_import_imm$011 in_msg:^MsgEnvelope
+    transaction:^Transaction fwd_fee:Grams = InMsg;
+msg_import_fin$100 in_msg:^MsgEnvelope 
+    transaction:^Transaction fwd_fee:Grams = InMsg;
+msg_import_tr$101  in_msg:^MsgEnvelope out_msg:^MsgEnvelope 
+    transit_fee:Grams = InMsg;
+msg_discard_fin$110 in_msg:^MsgEnvelope transaction_id:uint64 
+    fwd_fee:Grams = InMsg;
+msg_discard_tr$111 in_msg:^MsgEnvelope transaction_id:uint64 
+    fwd_fee:Grams proof_delivered:^Cell = InMsg;
+//
+import_fees$_ fees_collected:Grams 
+  value_imported:CurrencyCollection = ImportFees;
+
+_ (HashmapAugE 256 InMsg ImportFees) = InMsgDescr;
+
+msg_export_ext$000 msg:^(Message Any)
+    transaction:^Transaction = OutMsg;
+msg_export_imm$010 out_msg:^MsgEnvelope 
+    transaction:^Transaction reimport:^InMsg = OutMsg;
+msg_export_new$001 out_msg:^MsgEnvelope 
+    transaction:^Transaction = OutMsg;
+msg_export_tr$011  out_msg:^MsgEnvelope 
+    imported:^InMsg = OutMsg;
+msg_export_deq$110 out_msg:^MsgEnvelope  // out_msg_hash:bits256 ?
+    import_block_lt:uint64 = OutMsg;
+msg_export_tr_req$111 out_msg:^MsgEnvelope 
+    imported:^InMsg = OutMsg;
+msg_export_deq_imm$100 out_msg:^MsgEnvelope 
+    reimport:^InMsg = OutMsg;
+
+_ enqueued_lt:uint64 out_msg:^MsgEnvelope = EnqueuedMsg;
+
+_ (HashmapAugE 256 OutMsg CurrencyCollection) = OutMsgDescr;
+
+_ (HashmapAugE 352 EnqueuedMsg uint64) = OutMsgQueue;
+
+processed_upto$_ last_msg_lt:uint64 last_msg_hash:bits256 = ProcessedUpto;
+// key is [ shard:uint64 mc_seqno:uint32 ]  
+_ (HashmapE 96 ProcessedUpto) = ProcessedInfo;
+
+ihr_pending$_ import_lt:uint64 = IhrPendingSince;
+_ (HashmapE 320 IhrPendingSince) = IhrPendingInfo;
+
+_ out_queue:OutMsgQueue proc_info:ProcessedInfo
+  ihr_pending:IhrPendingInfo = OutMsgQueueInfo;
+//
+storage_used$_ cells:(VarUInteger 7) bits:(VarUInteger 7) 
+  public_cells:(VarUInteger 7) = StorageUsed;
+
+storage_used_short$_ cells:(VarUInteger 7) 
+  bits:(VarUInteger 7) = StorageUsedShort;
+
+storage_info$_ used:StorageUsed last_paid:uint32
+              due_payment:(Maybe Grams) = StorageInfo;
+
+account_none$0 = Account;
+account$1 addr:MsgAddressInt storage_stat:StorageInfo
+          storage:AccountStorage = Account;
+
+account_storage$_ last_trans_lt:uint64
+    balance:CurrencyCollection state:AccountState 
+  = AccountStorage;
+
+account_uninit$00 = AccountState;
+account_active$1 _:StateInit = AccountState;
+account_frozen$01 state_hash:bits256 = AccountState;
+
+acc_state_uninit$00 = AccountStatus;
+acc_state_frozen$01 = AccountStatus;
+acc_state_active$10 = AccountStatus;
+acc_state_nonexist$11 = AccountStatus;
+
+/* duplicates
+tick_tock$_ tick:Bool tock:Bool = TickTock;
+
+_ split_depth:(Maybe (## 5)) special:(Maybe TickTock)
+  code:(Maybe ^Cell) data:(Maybe ^Cell)
+  library:(Maybe ^Cell) = StateInit;
+*/
+
+account_descr$_ account:^Account last_trans_hash:bits256 
+  last_trans_lt:uint64 = ShardAccount;
+
+depth_balance$_ split_depth:(#<= 30) balance:CurrencyCollection = DepthBalanceInfo;
+
+_ (HashmapAugE 256 ShardAccount DepthBalanceInfo) = ShardAccounts;
+
+transaction$0111 account_addr:bits256 lt:uint64 
+  prev_trans_hash:bits256 prev_trans_lt:uint64 now:uint32
+  outmsg_cnt:uint15
+  orig_status:AccountStatus end_status:AccountStatus
+  ^[ in_msg:(Maybe ^(Message Any)) out_msgs:(HashmapE 15 ^(Message Any)) ]
+  total_fees:CurrencyCollection state_update:^(HASH_UPDATE Account)
+  description:^TransactionDescr = Transaction;
+
+!merkle_update#02 {X:Type} old_hash:bits256 new_hash:bits256
+  old:^X new:^X = MERKLE_UPDATE X;
+update_hashes#72 {X:Type} old_hash:bits256 new_hash:bits256
+  = HASH_UPDATE X;
+
+acc_trans#5 account_addr:bits256
+            transactions:(HashmapAug 64 ^Transaction CurrencyCollection)
+            state_update:^(HASH_UPDATE Account)
+          = AccountBlock;
+
+_ (HashmapAugE 256 AccountBlock CurrencyCollection) = ShardAccountBlocks;
+//
+tr_phase_storage$_ storage_fees_collected:Grams 
+  storage_fees_due:(Maybe Grams)
+  status_change:AccStatusChange
+  = TrStoragePhase;
+
+acst_unchanged$0 = AccStatusChange;  // x -> x
+acst_frozen$10 = AccStatusChange;    // init -> frozen
+acst_deleted$11 = AccStatusChange;   // frozen -> deleted
+
+tr_phase_credit$_ due_fees_collected:(Maybe Grams)
+  credit:CurrencyCollection = TrCreditPhase;
+
+tr_phase_compute_skipped$0 reason:ComputeSkipReason
+  = TrComputePhase;
+tr_phase_compute_vm$1 success:Bool msg_state_used:Bool 
+  account_activated:Bool gas_fees:Grams
+  ^[ gas_used:(VarUInteger 7)
+  gas_limit:(VarUInteger 7) gas_credit:(Maybe (VarUInteger 3))
+  mode:int8 exit_code:int32 exit_arg:(Maybe int32)
+  vm_steps:uint32
+  vm_init_state_hash:bits256 vm_final_state_hash:bits256 ]
+  = TrComputePhase;
+cskip_no_state$00 = ComputeSkipReason;
+cskip_bad_state$01 = ComputeSkipReason;
+cskip_no_gas$10 = ComputeSkipReason;
+
+tr_phase_action$_ success:Bool valid:Bool no_funds:Bool
+  status_change:AccStatusChange
+  total_fwd_fees:(Maybe Grams) total_action_fees:(Maybe Grams)
+  result_code:int32 result_arg:(Maybe int32) tot_actions:uint16
+  spec_actions:uint16 skipped_actions:uint16 msgs_created:uint16 
+  action_list_hash:bits256 tot_msg_size:StorageUsedShort 
+  = TrActionPhase;
+
+tr_phase_bounce_negfunds$00 = TrBouncePhase;
+tr_phase_bounce_nofunds$01 msg_size:StorageUsedShort
+  req_fwd_fees:Grams = TrBouncePhase;
+tr_phase_bounce_ok$1 msg_size:StorageUsedShort 
+  msg_fees:Grams fwd_fees:Grams = TrBouncePhase;
+//
+trans_ord$0000 credit_first:Bool
+  storage_ph:(Maybe TrStoragePhase)
+  credit_ph:(Maybe TrCreditPhase)
+  compute_ph:TrComputePhase action:(Maybe ^TrActionPhase)
+  aborted:Bool bounce:(Maybe TrBouncePhase)
+  destroyed:Bool
+  = TransactionDescr;
+
+trans_storage$0001 storage_ph:TrStoragePhase
+  = TransactionDescr;
+
+trans_tick_tock$001 is_tock:Bool storage:TrStoragePhase
+  compute_ph:TrComputePhase action:(Maybe ^TrActionPhase)
+  aborted:Bool destroyed:Bool = TransactionDescr;
+//
+split_merge_info$_ cur_shard_pfx_len:(## 6)
+  acc_split_depth:(## 6) this_addr:bits256 sibling_addr:bits256
+  = SplitMergeInfo;
+trans_split_prepare$0100 split_info:SplitMergeInfo
+  compute_ph:TrComputePhase action:(Maybe ^TrActionPhase)
+  aborted:Bool destroyed:Bool
+  = TransactionDescr;
+trans_split_install$0101 split_info:SplitMergeInfo
+  prepare_transaction:^Transaction
+  installed:Bool = TransactionDescr;
+
+trans_merge_prepare$0110 split_info:SplitMergeInfo
+  storage_ph:TrStoragePhase aborted:Bool
+  = TransactionDescr;
+trans_merge_install$0111 split_info:SplitMergeInfo
+  prepare_transaction:^Transaction
+  credit_ph:(Maybe TrCreditPhase)
+  compute_ph:TrComputePhase action:(Maybe ^TrActionPhase)
+  aborted:Bool destroyed:Bool
+  = TransactionDescr;
+
+smc_info#076ef1ea actions:uint16 msgs_sent:uint16
+  unixtime:uint32 block_lt:uint64 trans_lt:uint64 
+  rand_seed:bits256 balance_remaining:CurrencyCollection
+  myself:MsgAddressInt = SmartContractInfo;
+//
+//
+out_list_empty$_ = OutList 0;
+out_list$_ {n:#} prev:^(OutList n) action:OutAction
+  = OutList (n + 1);
+action_send_msg#0ec3c86d mode:(## 8) 
+  out_msg:^(MessageRelaxed Any) = OutAction;
+action_set_code#ad4de08e new_code:^Cell = OutAction;
+action_reserve_currency#36e6b809 mode:(## 8)
+  currency:CurrencyCollection = OutAction;
+
+out_list_node$_ prev:^Cell action:OutAction = OutListNode;
+//
+//
+shard_ident$00 shard_pfx_bits:(#<= 60) 
+  workchain_id:int32 shard_prefix:uint64 = ShardIdent;
+
+ext_blk_ref$_ end_lt:uint64
+  seq_no:uint32 root_hash:bits256 file_hash:bits256 
+  = ExtBlkRef;
+
+block_id_ext$_ shard_id:ShardIdent seq_no:uint32
+  root_hash:bits256 file_hash:bits256 = BlockIdExt;
+
+master_info$_ master:ExtBlkRef = BlkMasterInfo;
+
+shard_state#9023afe2 global_id:int32
+  shard_id:ShardIdent 
+  seq_no:uint32 vert_seq_no:#
+  gen_utime:uint32 gen_lt:uint64
+  min_ref_mc_seqno:uint32
+  out_msg_queue_info:^OutMsgQueueInfo
+  before_split:(## 1)
+  accounts:^ShardAccounts
+  ^[ overload_history:uint64 underload_history:uint64
+  total_balance:CurrencyCollection
+  total_validator_fees:CurrencyCollection
+  libraries:(HashmapE 256 LibDescr)
+  master_ref:(Maybe BlkMasterInfo) ]
+  custom:(Maybe ^McStateExtra)
+  = ShardStateUnsplit;
+  
+_ ShardStateUnsplit = ShardState;
+split_state#5f327da5 left:^ShardStateUnsplit right:^ShardStateUnsplit = ShardState;
+
+shared_lib_descr$00 lib:^Cell publishers:(Hashmap 256 True)
+  = LibDescr;
+
+block_info#9bc7a987 version:uint32 
+  not_master:(## 1) 
+  after_merge:(## 1) before_split:(## 1) 
+  after_split:(## 1) 
+  want_split:Bool want_merge:Bool
+  key_block:Bool vert_seqno_incr:(## 1)
+  flags:(## 8)
+  seq_no:# vert_seq_no:# { vert_seq_no >= vert_seqno_incr } 
+  { prev_seq_no:# } { ~prev_seq_no + 1 = seq_no } 
+  shard:ShardIdent gen_utime:uint32
+  start_lt:uint64 end_lt:uint64
+  gen_validator_list_hash_short:uint32
+  gen_catchain_seqno:uint32
+  min_ref_mc_seqno:uint32
+  prev_key_block_seqno:uint32
+  master_ref:not_master?^BlkMasterInfo 
+  prev_ref:^(BlkPrevInfo after_merge)
+  prev_vert_ref:vert_seq_no?^(BlkPrevInfo 0)
+  = BlockInfo;
+
+prev_blk_info$_ prev:ExtBlkRef = BlkPrevInfo 0;
+prev_blks_info$_ prev1:^ExtBlkRef prev2:^ExtBlkRef = BlkPrevInfo 1;
+
+block#11ef55aa global_id:int32
+  info:^BlockInfo value_flow:^ValueFlow
+  state_update:^(MERKLE_UPDATE ShardState) 
+  extra:^BlockExtra = Block;
+
+block_extra in_msg_descr:^InMsgDescr
+  out_msg_descr:^OutMsgDescr
+  account_blocks:^ShardAccountBlocks
+  rand_seed:bits256
+  created_by:bits256
+  custom:(Maybe ^McBlockExtra) = BlockExtra;
+//
+value_flow ^[ from_prev_blk:CurrencyCollection 
+  to_next_blk:CurrencyCollection
+  imported:CurrencyCollection
+  exported:CurrencyCollection ]
+  fees_collected:CurrencyCollection
+  ^[
+  fees_imported:CurrencyCollection
+  recovered:CurrencyCollection
+  created:CurrencyCollection
+  minted:CurrencyCollection
+  ] = ValueFlow;
+
+//
+//
+bt_leaf$0 {X:Type} leaf:X = BinTree X;
+bt_fork$1 {X:Type} left:^(BinTree X) right:^(BinTree X) 
+          = BinTree X;
+
+fsm_none$0 = FutureSplitMerge;
+fsm_split$10 split_utime:uint32 interval:uint32 = FutureSplitMerge;
+fsm_merge$11 merge_utime:uint32 interval:uint32 = FutureSplitMerge;
+
+shard_descr#b seq_no:uint32 reg_mc_seqno:uint32
+  start_lt:uint64 end_lt:uint64
+  root_hash:bits256 file_hash:bits256 
+  before_split:Bool before_merge:Bool
+  want_split:Bool want_merge:Bool
+  nx_cc_updated:Bool flags:(## 3) { flags = 0 }
+  next_catchain_seqno:uint32 next_validator_shard:uint64
+  min_ref_mc_seqno:uint32 gen_utime:uint32
+  split_merge_at:FutureSplitMerge
+  fees_collected:CurrencyCollection
+  funds_created:CurrencyCollection = ShardDescr;
+
+_ (HashmapE 32 ^(BinTree ShardDescr)) = ShardHashes;
+
+bta_leaf$0 {X:Type} {Y:Type} extra:Y leaf:X = BinTreeAug X Y;
+bta_fork$1 {X:Type} {Y:Type} left:^(BinTreeAug X Y) 
+           right:^(BinTreeAug X Y) extra:Y = BinTreeAug X Y;
+
+_ fees:CurrencyCollection create:CurrencyCollection = ShardFeeCreated;
+_ (HashmapAugE 96 ShardFeeCreated ShardFeeCreated) = ShardFees;
+
+_ config_addr:bits256 config:^(Hashmap 32 ^Cell) 
+  = ConfigParams;
+
+validator_info$_
+  validator_list_hash_short:uint32 
+  catchain_seqno:uint32
+  nx_cc_updated:Bool
+= ValidatorInfo;
+
+validator_base_info$_
+  validator_list_hash_short:uint32 
+  catchain_seqno:uint32
+= ValidatorBaseInfo;
+
+_ key:Bool max_end_lt:uint64 = KeyMaxLt;
+_ key:Bool blk_ref:ExtBlkRef = KeyExtBlkRef;
+
+_ (HashmapAugE 32 KeyExtBlkRef KeyMaxLt) = OldMcBlocksInfo;
+
+
+counters#_ last_updated:uint32 total:uint64 cnt2048:uint64 cnt65536:uint64 = Counters; 
+creator_info#4 mc_blocks:Counters shard_blocks:Counters = CreatorStats; 
+block_create_stats#17 counters:(HashmapE 256 CreatorStats) = BlockCreateStats;
+
+masterchain_state_extra#cc26
+  shard_hashes:ShardHashes
+  config:ConfigParams
+  ^[ flags:(## 16) { flags <= 1 }
+     validator_info:ValidatorInfo
+     prev_blocks:OldMcBlocksInfo
+     after_key_block:Bool
+     last_key_block:(Maybe ExtBlkRef)
+     block_create_stats:(flags . 0)?BlockCreateStats ]
+  global_balance:CurrencyCollection
+= McStateExtra;
+
+ed25519_pubkey#8e81278a pubkey:bits256 = SigPubKey;  // 288 bits
+ed25519_signature#5 R:bits256 s:bits256 = CryptoSignatureSimple;  // 516 bits
+_ CryptoSignatureSimple = CryptoSignature;
+sig_pair$_ node_id_short:bits256 sign:CryptoSignature = CryptoSignaturePair;  // 256+x ~ 772 bits
+
+certificate#4 temp_key:SigPubKey valid_since:uint32 valid_until:uint32 = Certificate;  // 356 bits
+certificate_env#a419b7d certificate:Certificate = CertificateEnv;  // 384 bits
+signed_certificate$_ certificate:Certificate certificate_signature:CryptoSignature
+  = SignedCertificate;  // 356+516 = 872 bits
+// certificate_signature is the signature of CertificateEnv (with embedded certificate) with persistent key
+chained_signature#f signed_cert:^SignedCertificate temp_key_signature:CryptoSignatureSimple
+  = CryptoSignature;   // 4+(356+516)+516 = 520 bits+ref (1392 bits total)
+// temp_key_signature is the signature of whatever was originally intended to be signed with temp_key from certificate
+
+masterchain_block_extra#cca5
+  key_block:(## 1)
+  shard_hashes:ShardHashes
+  shard_fees:ShardFees
+  ^[ prev_blk_signatures:(HashmapE 16 CryptoSignaturePair)
+     recover_create_msg:(Maybe ^InMsg)
+     mint_msg:(Maybe ^InMsg) ]
+  config:key_block?ConfigParams
+= McBlockExtra;
+
+//
+//  CONFIGURATION PARAMETERS
+//
+
+validator#53 public_key:SigPubKey weight:uint64 = ValidatorDescr;
+validator_addr#73 public_key:SigPubKey weight:uint64 adnl_addr:bits256 = ValidatorDescr;
+validators#11 utime_since:uint32 utime_until:uint32 
+  total:(## 16) main:(## 16) { main <= total } { main >= 1 } 
+  list:(Hashmap 16 ValidatorDescr) = ValidatorSet;
+
+_ config_addr:bits256 = ConfigParam 0;
+_ elector_addr:bits256 = ConfigParam 1;
+_ minter_addr:bits256 = ConfigParam 2;  // ConfigParam 0 is used if absent
+_ fee_collector_addr:bits256 = ConfigParam 3;  // ConfigParam 1 is used if absent
+_ dns_root_addr:bits256 = ConfigParam 4;  // root TON DNS resolver
+
+_ mint_new_price:Grams mint_add_price:Grams = ConfigParam 6;
+_ to_mint:ExtraCurrencyCollection = ConfigParam 7;
+
+capabilities#c4 version:uint32 capabilities:uint64 = GlobalVersion;
+_ GlobalVersion = ConfigParam 8;  // all zero if absent
+_ mandatory_params:(Hashmap 32 True) = ConfigParam 9;
+
+wfmt_basic#1 vm_version:int32 vm_mode:uint64 = WorkchainFormat 1;
+wfmt_ext#0 min_addr_len:(## 12) max_addr_len:(## 12) addr_len_step:(## 12)
+  { min_addr_len >= 64 } { min_addr_len <= max_addr_len } 
+  { max_addr_len <= 1023 } { addr_len_step <= 1023 }
+  workchain_type_id:(## 32) { workchain_type_id >= 1 }
+  = WorkchainFormat 0;
+
+workchain#a6 enabled_since:uint32 actual_min_split:(## 8) 
+  min_split:(## 8) max_split:(## 8) { actual_min_split <= min_split }
+//workchain#a5 enabled_since:uint32 min_split:(## 8) max_split:(## 8)
+//  { min_split <= max_split } { max_split <= 60 }
+  basic:(## 1) active:Bool accept_msgs:Bool flags:(## 13) { flags = 0 }
+  zerostate_root_hash:bits256 zerostate_file_hash:bits256
+  version:uint32 format:(WorkchainFormat basic)
+  = WorkchainDescr;
+
+_ workchains:(HashmapE 32 WorkchainDescr) = ConfigParam 12;
+
+block_grams_created#6b masterchain_block_fee:Grams basechain_block_fee:Grams
+  = BlockCreateFees;
+_ BlockCreateFees = ConfigParam 14;
+
+_ validators_elected_for:uint32 elections_start_before:uint32 
+  elections_end_before:uint32 stake_held_for:uint32
+  = ConfigParam 15;
+  
+_ max_validators:(## 16) max_main_validators:(## 16) min_validators:(## 16) 
+  { max_validators >= max_main_validators } 
+  { max_main_validators >= min_validators } 
+  { min_validators >= 1 }
+  = ConfigParam 16;
+
+_ min_stake:Grams max_stake:Grams min_total_stake:Grams max_stake_factor:uint32 = ConfigParam 17;
+
+_#cc utime_since:uint32 bit_price_ps:uint64 cell_price_ps:uint64 
+  mc_bit_price_ps:uint64 mc_cell_price_ps:uint64 = StoragePrices;
+_ (Hashmap 32 StoragePrices) = ConfigParam 18;
+
+gas_prices#dd gas_price:uint64 gas_limit:uint64 gas_credit:uint64 
+  block_gas_limit:uint64 freeze_due_limit:uint64 delete_due_limit:uint64 
+  = GasLimitsPrices;
+
+gas_prices_ext#de gas_price:uint64 gas_limit:uint64 special_gas_limit:uint64 gas_credit:uint64 
+  block_gas_limit:uint64 freeze_due_limit:uint64 delete_due_limit:uint64 
+  = GasLimitsPrices;
+
+config_mc_gas_prices#_ GasLimitsPrices = ConfigParam 20;
+config_gas_prices#_ GasLimitsPrices = ConfigParam 21;
+
+param_limits#c3 underload:# soft_limit:# { underload <= soft_limit }
+  hard_limit:# { soft_limit <= hard_limit } = ParamLimits;
+block_limits#5d bytes:ParamLimits gas:ParamLimits lt_delta:ParamLimits
+  = BlockLimits;
+  
+config_mc_block_limits#_ BlockLimits = ConfigParam 22;
+config_block_limits#_ BlockLimits = ConfigParam 23;
+
+// msg_fwd_fees = (lump_price + ceil((bit_price * msg.bits + cell_price * msg.cells)/2^16)) nanograms
+// ihr_fwd_fees = ceil((msg_fwd_fees * ihr_price_factor)/2^16) nanograms
+// bits in the root cell of a message are not included in msg.bits (lump_price pays for them)
+msg_forward_prices#ea lump_price:uint64 bit_price:uint64 cell_price:uint64
+  ihr_price_factor:uint32 first_frac:uint16 next_frac:uint16 = MsgForwardPrices;
+
+// used for messages to/from masterchain
+config_mc_fwd_prices#_ MsgForwardPrices = ConfigParam 24;
+// used for all other messages
+config_fwd_prices#_ MsgForwardPrices = ConfigParam 25;
+
+catchain_config#c1 mc_catchain_lifetime:uint32 shard_catchain_lifetime:uint32 
+  shard_validators_lifetime:uint32 shard_validators_num:uint32 = CatchainConfig;
+consensus_config#d6 round_candidates:# { round_candidates >= 1 }
+  next_candidate_delay_ms:uint32 consensus_timeout_ms:uint32
+  fast_attempts:uint32 attempt_duration:uint32 catchain_max_deps:uint32
+  max_block_bytes:uint32 max_collated_bytes:uint32 = ConsensusConfig;
+
+_ CatchainConfig = ConfigParam 28;
+_ ConsensusConfig = ConfigParam 29;
+
+_ fundamental_smc_addr:(HashmapE 256 True) = ConfigParam 31;
+_ prev_validators:ValidatorSet = ConfigParam 32;
+_ prev_temp_validators:ValidatorSet = ConfigParam 33;
+_ cur_validators:ValidatorSet = ConfigParam 34;
+_ cur_temp_validators:ValidatorSet = ConfigParam 35;
+_ next_validators:ValidatorSet = ConfigParam 36;
+_ next_temp_validators:ValidatorSet = ConfigParam 37;
+
+validator_temp_key#3 adnl_addr:bits256 temp_public_key:SigPubKey seqno:# valid_until:uint32 = ValidatorTempKey;
+signed_temp_key#4 key:^ValidatorTempKey signature:CryptoSignature = ValidatorSignedTempKey;
+_ (HashmapE 256 ValidatorSignedTempKey) = ConfigParam 39;
+
+//
+//  PROOFS
+//
+block_signatures_pure#_ sig_count:uint32 sig_weight:uint64
+  signatures:(HashmapE 16 CryptoSignaturePair) = BlockSignaturesPure;
+block_signatures#11 validator_info:ValidatorBaseInfo pure_signatures:BlockSignaturesPure = BlockSignatures;
+block_proof#c3 proof_for:BlockIdExt root:^Cell signatures:(Maybe ^BlockSignatures) = BlockProof;
+
+chain_empty$_ = ProofChain 0;
+chain_link$_ {n:#} root:^Cell prev:n?^(ProofChain n) = ProofChain (n + 1);
+top_block_descr#d5 proof_for:BlockIdExt signatures:(Maybe ^BlockSignatures) 
+  len:(## 8) { len >= 1 } { len <= 8 } chain:(ProofChain len) = TopBlockDescr;
+
+//
+//  COLLATED DATA
+//
+top_block_descr_set#4ac789f3 collection:(HashmapE 96 ^TopBlockDescr) = TopBlockDescrSet;
diff --git a/submodules/ton/tonlib-src/crypto/block/check-proof.cpp b/submodules/ton/tonlib-src/crypto/block/check-proof.cpp
new file mode 100644
index 0000000000..e8316f5d67
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/check-proof.cpp
@@ -0,0 +1,537 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "check-proof.h"
+#include "block/block.h"
+#include "block/block-parse.h"
+#include "block/block-auto.h"
+#include "block/mc-config.h"
+
+#include "ton/ton-shard.h"
+
+#include "vm/cells/MerkleProof.h"
+#include "openssl/digest.h"
+#include "Ed25519.h"
+
+namespace block {
+using namespace std::literals::string_literals;
+
+td::Status check_block_header_proof(td::Ref<vm::Cell> root, ton::BlockIdExt blkid, ton::Bits256* store_shard_hash_to,
+                                    bool check_state_hash) {
+  ton::RootHash vhash{root->get_hash().bits()};
+  if (vhash != blkid.root_hash) {
+    return td::Status::Error(PSTRING() << " block header for block " << blkid.to_str() << " has incorrect root hash "
+                                       << vhash.to_hex() << " instead of " << blkid.root_hash.to_hex());
+  }
+  std::vector<ton::BlockIdExt> prev;
+  ton::BlockIdExt mc_blkid;
+  bool after_split;
+  TRY_STATUS(block::unpack_block_prev_blk_try(root, blkid, prev, mc_blkid, after_split));
+  block::gen::Block::Record blk;
+  block::gen::BlockInfo::Record info;
+  if (!(tlb::unpack_cell(root, blk) && tlb::unpack_cell(blk.info, info))) {
+    return td::Status::Error(std::string{"cannot unpack header for block "} + blkid.to_str());
+  }
+  if (store_shard_hash_to) {
+    vm::CellSlice upd_cs{vm::NoVmSpec(), blk.state_update};
+    if (!(upd_cs.is_special() && upd_cs.prefetch_long(8) == 4  // merkle update
+          && upd_cs.size_ext() == 0x20228)) {
+      return td::Status::Error("invalid Merkle update in block header");
+    }
+    auto upd_hash = upd_cs.prefetch_ref(1)->get_hash(0);
+    if (!check_state_hash) {
+      *store_shard_hash_to = upd_hash.bits();
+    } else if (store_shard_hash_to->compare(upd_hash.bits())) {
+      return td::Status::Error(PSTRING() << "state hash mismatch in block header of " << blkid.to_str()
+                                         << " : header declares " << upd_hash.bits().to_hex(256) << " expected "
+                                         << store_shard_hash_to->to_hex());
+    }
+  }
+  return td::Status::OK();
+}
+
+td::Result<td::Bits256> check_state_proof(ton::BlockIdExt blkid, td::Slice proof) {
+  TRY_RESULT(proof_root, vm::std_boc_deserialize(proof));
+  auto virt_root = vm::MerkleProof::virtualize(std::move(proof_root), 1);
+  if (virt_root.is_null()) {
+    return td::Status::Error("account state proof is invalid");
+  }
+  td::Bits256 state_hash;
+  TRY_STATUS(check_block_header_proof(std::move(virt_root), blkid, &state_hash));
+  return state_hash;
+}
+
+td::Result<Ref<vm::Cell>> check_extract_state_proof(ton::BlockIdExt blkid, td::Slice proof, td::Slice data) {
+  try {
+    TRY_RESULT(state_hash, check_state_proof(blkid, proof));
+    TRY_RESULT(state_root, vm::std_boc_deserialize(data));
+    auto state_virt_root = vm::MerkleProof::virtualize(std::move(state_root), 1);
+    if (state_virt_root.is_null()) {
+      return td::Status::Error("account state proof is invalid");
+    }
+    if (state_hash != state_virt_root->get_hash().bits()) {
+      return td::Status::Error("root hash mismatch in the shardchain state proof");
+    }
+    return std::move(state_virt_root);
+  } catch (vm::VmError& err) {
+    return td::Status::Error(PSLICE() << "error scanning shard state proof: " << err.get_msg());
+  } catch (vm::VmVirtError& err) {
+    return td::Status::Error(PSLICE() << "virtualization error scanning shard state proof: " << err.get_msg());
+  }
+}
+
+td::Status check_shard_proof(ton::BlockIdExt blk, ton::BlockIdExt shard_blk, td::Slice shard_proof) {
+  if (blk == shard_blk) {
+    if (!shard_proof.empty()) {
+      LOG(WARNING) << "Unexpected non-empty shard proof";
+    }
+    return td::Status::OK();
+  }
+  if (!blk.is_masterchain() || !blk.is_valid_full()) {
+    return td::Status::Error(PSLICE() << "reference block " << blk.to_str()
+                                      << " for a getAccountState query must belong to the masterchain");
+  }
+  TRY_RESULT_PREFIX(P_roots, vm::std_boc_deserialize_multi(std::move(shard_proof)),
+                    "cannot deserialize shard configuration proof");
+  if (P_roots.size() != 2) {
+    return td::Status::Error("shard configuration proof must have exactly two roots");
+  }
+  try {
+    auto mc_state_root = vm::MerkleProof::virtualize(std::move(P_roots[1]), 1);
+    if (mc_state_root.is_null()) {
+      return td::Status::Error("shard configuration proof is invalid");
+    }
+    ton::Bits256 mc_state_hash = mc_state_root->get_hash().bits();
+    TRY_STATUS_PREFIX(
+        check_block_header_proof(vm::MerkleProof::virtualize(std::move(P_roots[0]), 1), blk, &mc_state_hash, true),
+        "error in shard configuration block header proof :");
+    block::gen::ShardStateUnsplit::Record sstate;
+    if (!(tlb::unpack_cell(mc_state_root, sstate))) {
+      return td::Status::Error("cannot unpack masterchain state header");
+    }
+    auto shards_dict = block::ShardConfig::extract_shard_hashes_dict(std::move(mc_state_root));
+    if (!shards_dict) {
+      return td::Status::Error("cannot extract shard configuration dictionary from proof");
+    }
+    vm::CellSlice cs;
+    ton::ShardIdFull true_shard;
+    if (!block::ShardConfig::get_shard_hash_raw_from(*shards_dict, cs, shard_blk.shard_full(), true_shard)) {
+      return td::Status::Error(PSLICE() << "masterchain state contains no information for shard "
+                                        << shard_blk.shard_full().to_str());
+    }
+    auto shard_info = block::McShardHash::unpack(cs, true_shard);
+    if (shard_info.is_null()) {
+      return td::Status::Error(PSLICE() << "cannot unpack information for shard " << shard_blk.shard_full().to_str()
+                                        << " from masterchain state");
+    }
+    if (shard_info->top_block_id() != shard_blk) {
+      return td::Status::Error(PSLICE() << "shard configuration mismatch: expected to find block " << shard_blk.to_str()
+                                        << " , found " << shard_info->top_block_id().to_str());
+    }
+  } catch (vm::VmError err) {
+    return td::Status::Error(PSLICE() << "error while traversing shard configuration proof : " << err.get_msg());
+  } catch (vm::VmVirtError err) {
+    return td::Status::Error(PSLICE() << "virtualization error while traversing shard configuration proof : "
+                                      << err.get_msg());
+  }
+  return td::Status::OK();
+}
+
+td::Status check_account_proof(td::Slice proof, ton::BlockIdExt shard_blk, const block::StdAddress& addr,
+                               td::Ref<vm::Cell> root, ton::LogicalTime* last_trans_lt, ton::Bits256* last_trans_hash) {
+  TRY_RESULT_PREFIX(Q_roots, vm::std_boc_deserialize_multi(std::move(proof)), "cannot deserialize account proof");
+  if (Q_roots.size() != 2) {
+    return td::Status::Error(PSLICE() << "account state proof must have exactly two roots");
+  }
+
+  if (last_trans_lt) {
+    last_trans_hash->set_zero();
+  }
+
+  try {
+    auto state_root = vm::MerkleProof::virtualize(std::move(Q_roots[1]), 1);
+    if (state_root.is_null()) {
+      return td::Status::Error("account state proof is invalid");
+    }
+    ton::Bits256 state_hash = state_root->get_hash().bits();
+    TRY_STATUS_PREFIX(
+        check_block_header_proof(vm::MerkleProof::virtualize(std::move(Q_roots[0]), 1), shard_blk, &state_hash, true),
+        "error in account shard block header proof : ");
+    block::gen::ShardStateUnsplit::Record sstate;
+    if (!(tlb::unpack_cell(std::move(state_root), sstate))) {
+      return td::Status::Error("cannot unpack state header");
+    }
+    vm::AugmentedDictionary accounts_dict{vm::load_cell_slice(sstate.accounts).prefetch_ref(), 256,
+                                          block::tlb::aug_ShardAccounts};
+    auto acc_csr = accounts_dict.lookup(addr.addr);
+    if (acc_csr.not_null()) {
+      if (root.is_null()) {
+        return td::Status::Error(PSLICE() << "account state proof shows that account state for " << addr
+                                          << " must be non-empty, but it actually is empty");
+      }
+      block::gen::ShardAccount::Record acc_info;
+      if (!tlb::csr_unpack(std::move(acc_csr), acc_info)) {
+        return td::Status::Error("cannot unpack ShardAccount from proof");
+      }
+      if (acc_info.account->get_hash().bits().compare(root->get_hash().bits(), 256)) {
+        return td::Status::Error(PSLICE() << "account state hash mismatch: Merkle proof expects "
+                                          << acc_info.account->get_hash().bits().to_hex(256)
+                                          << " but received data has " << root->get_hash().bits().to_hex(256));
+      }
+      if (last_trans_hash) {
+        *last_trans_hash = acc_info.last_trans_hash;
+      }
+      if (last_trans_lt) {
+        *last_trans_lt = acc_info.last_trans_lt;
+      }
+    } else if (root.not_null()) {
+      return td::Status::Error(PSLICE() << "account state proof shows that account state for " << addr
+                                        << " must be empty, but it is not");
+    }
+  } catch (vm::VmError err) {
+    return td::Status::Error(PSLICE() << "error while traversing account proof : " << err.get_msg());
+  } catch (vm::VmVirtError err) {
+    return td::Status::Error(PSLICE() << "virtualization error while traversing account proof : " << err.get_msg());
+  }
+  return td::Status::OK();
+}
+
+td::Result<AccountState::Info> AccountState::validate(ton::BlockIdExt ref_blk, block::StdAddress addr) const {
+  TRY_RESULT_PREFIX(root, vm::std_boc_deserialize(state.as_slice(), true), "cannot deserialize account state");
+
+  LOG(INFO) << "got account state for " << addr << " with respect to blocks " << blk.to_str()
+            << (shard_blk == blk ? "" : std::string{" and "} + shard_blk.to_str());
+  if (blk != ref_blk && ref_blk.id.seqno != ~0U) {
+    return td::Status::Error(PSLICE() << "obtained getAccountState() for a different reference block " << blk.to_str()
+                                      << " instead of requested " << ref_blk.to_str());
+  }
+
+  if (!shard_blk.is_valid_full()) {
+    return td::Status::Error(PSLICE() << "shard block id " << shard_blk.to_str() << " in answer is invalid");
+  }
+
+  if (!ton::shard_contains(shard_blk.shard_full(), ton::extract_addr_prefix(addr.workchain, addr.addr))) {
+    return td::Status::Error(PSLICE() << "received data from shard block " << shard_blk.to_str()
+                                      << " that cannot contain requested account");
+  }
+
+  TRY_STATUS(block::check_shard_proof(blk, shard_blk, shard_proof.as_slice()));
+
+  Info res;
+  TRY_STATUS(
+      block::check_account_proof(proof.as_slice(), shard_blk, addr, root, &res.last_trans_lt, &res.last_trans_hash));
+  res.root = std::move(root);
+
+  return res;
+}
+
+td::Result<Transaction::Info> Transaction::validate() {
+  if (root.is_null()) {
+    return td::Status::Error("transactions are expected to be non-empty");
+  }
+  if (hash != root->get_hash().bits()) {
+    return td::Status::Error(PSLICE() << "transaction hash mismatch: expected " << hash.to_hex() << ", found "
+                                      << root->get_hash().bits().to_hex(256));
+  }
+  block::gen::Transaction::Record trans;
+  if (!tlb::unpack_cell(root, trans)) {
+    return td::Status::Error("cannot unpack transaction #");
+  }
+
+  if (trans.lt != lt) {
+    return td::Status::Error(PSLICE() << "transaction lt mismatch: expected " << lt << ", found " << trans.lt);
+  }
+  Info res;
+  res.blkid = blkid;
+  res.prev_trans_lt = trans.prev_trans_lt;
+  res.prev_trans_hash = trans.prev_trans_hash;
+  res.transaction = root;
+  return std::move(res);
+}
+
+td::Result<TransactionList::Info> TransactionList::validate() const {
+  if (blkids.empty()) {
+    return td::Status::Error("transaction list must be non-empty");
+  }
+  auto R = vm::std_boc_deserialize_multi(std::move(transactions_boc));
+  if (R.is_error()) {
+    return td::Status::Error("cannot deserialize transactions BoC");
+  }
+  auto list = R.move_as_ok();
+  if (list.size() != blkids.size()) {
+    return td::Status::Error(PSLICE() << "transaction list size " << list.size()
+                                      << " must be equal to the size of block id list " << blkids.size());
+  }
+  size_t c = 0;
+  Info res;
+  auto current_lt = lt;
+  auto current_hash = hash;
+  for (auto& root : list) {
+    const auto& blkid = blkids[c++];
+    Transaction transaction;
+    transaction.blkid = std::move(blkid);
+    transaction.lt = current_lt;
+    transaction.hash = current_hash;
+    transaction.root = root;
+    TRY_RESULT(info, transaction.validate());
+    current_lt = info.prev_trans_lt;
+    current_hash = info.prev_trans_hash;
+    res.transactions.push_back(std::move(info));
+  }
+  return std::move(res);
+}
+
+td::Status BlockProofLink::validate(td::uint32* save_utime) const {
+  if (save_utime) {
+    *save_utime = 0;
+  }
+  if (!(from.is_masterchain_ext() && to.is_masterchain_ext())) {
+    return td::Status::Error("BlockProofLink must have both source and destination blocks in the masterchain");
+  }
+  if (from.seqno() == to.seqno()) {
+    return td::Status::Error("BlockProofLink connects two masterchain blocks "s + from.to_str() + " and " +
+                             to.to_str() + " of equal height");
+  }
+  if (is_fwd != (from.seqno() < to.seqno())) {
+    return td::Status::Error("BlockProofLink from "s + from.to_str() + " to " + to.to_str() +
+                             " is incorrectly declared as a " + (is_fwd ? "forward" : "backward") + " link");
+  }
+  if (dest_proof.is_null() && to.seqno()) {
+    return td::Status::Error("BlockProofLink contains no proof for destination block "s + to.to_str());
+  }
+  if (proof.is_null()) {
+    return td::Status::Error("BlockProofLink contains no proof for source block "s + from.to_str());
+  }
+  if (!is_fwd && state_proof.is_null()) {
+    return td::Status::Error("a backward BlockProofLink contains no proof for the source state of "s + from.to_str());
+  }
+  if (is_fwd && signatures.empty()) {
+    return td::Status::Error("a forward BlockProofLink from "s + from.to_str() + " to " + to.to_str() +
+                             " contains no signatures");
+  }
+  try {
+    // virtualize Merkle proof roots
+    auto vs_root = vm::MerkleProof::virtualize(proof, 1);
+    if (vs_root.is_null()) {
+      return td::Status::Error("BlockProofLink contains an invalid Merkle proof for source block "s + from.to_str());
+    }
+    ton::Bits256 state_hash;
+    if (from.seqno()) {
+      TRY_STATUS(check_block_header(vs_root, from, is_fwd ? nullptr : &state_hash));
+    }
+    auto vd_root = dest_proof.not_null() ? vm::MerkleProof::virtualize(dest_proof, 1) : Ref<vm::Cell>{};
+    if (vd_root.is_null() && to.seqno()) {
+      return td::Status::Error("BlockProofLink contains an invalid Merkle proof for destination block "s + to.to_str());
+    }
+    block::gen::Block::Record blk;
+    block::gen::BlockInfo::Record info;
+    if (to.seqno()) {
+      TRY_STATUS(check_block_header(vd_root, to));
+      if (!(tlb::unpack_cell(vd_root, blk) && tlb::unpack_cell(blk.info, info))) {
+        return td::Status::Error("cannot unpack header for block "s + from.to_str());
+      }
+      if (info.key_block != is_key) {
+        return td::Status::Error(PSTRING() << "incorrect is_key_block value " << is_key << " for destination block "
+                                           << to.to_str());
+      }
+      if (save_utime) {
+        *save_utime = info.gen_utime;
+      }
+    } else if (!is_key) {
+      // return td::Status::Error("Zerostate destination block "s + to.to_str() + " does not have is_key_block set");
+    }
+    if (!is_fwd) {
+      // check a backward link
+      auto vstate_root = vm::MerkleProof::virtualize(state_proof, 1);
+      if (vstate_root.is_null()) {
+        return td::Status::Error("backward BlockProofLink contains an invalid Merkle proof for source state "s +
+                                 from.to_str());
+      }
+      if (state_hash != vstate_root->get_hash().bits()) {
+        return td::Status::Error("BlockProofLink contains a state proof for "s + from.to_str() +
+                                 " with incorrect root hash");
+      }
+      TRY_RESULT(config, block::ConfigInfo::extract_config(vstate_root, block::ConfigInfo::needPrevBlocks));
+      if (!config->check_old_mc_block_id(to, true)) {
+        return td::Status::Error("cannot check that "s + to.to_str() + " is indeed a previous masterchain block of " +
+                                 from.to_str() + " using the presented Merkle proof of masterchain state");
+      }
+      return td::Status::OK();
+    } else {
+      // check a forward link
+      // extract configuration from source key block or zerostate
+      auto cfg_res = from.seqno() ? block::Config::extract_from_key_block(vs_root, block::ConfigInfo::needValidatorSet)
+                                  : block::Config::extract_from_state(vs_root, block::ConfigInfo::needValidatorSet);
+      if (cfg_res.is_error()) {
+        return td::Status::Error("cannot extract configuration from source key block "s + from.to_str() +
+                                 " of a forward BlockProofLink: " + cfg_res.move_as_error().to_string());
+      }
+      auto config = cfg_res.move_as_ok();
+      // compute validator set
+      ton::ShardIdFull shard{ton::masterchainId};
+      auto nodes = config->compute_validator_set(shard, info.gen_utime, info.gen_catchain_seqno);
+      if (nodes.empty()) {
+        return td::Status::Error(PSTRING()
+                                 << "while checking a forward BlockProofLink: cannot compute validator set for block "
+                                 << to.to_str() << " with utime " << info.gen_utime << " and cc_seqno "
+                                 << info.gen_catchain_seqno << " starting from previous key block " << from.to_str());
+      }
+      // check computed validator set hash
+      auto vset_hash = compute_validator_set_hash(cc_seqno, shard, nodes);
+      if (vset_hash != info.gen_validator_list_hash_short) {
+        return td::Status::Error(
+            PSTRING() << "while checking a forward BlockProofLink: computed validator set for block " << to.to_str()
+                      << " with utime " << info.gen_utime << " and cc_seqno " << info.gen_catchain_seqno
+                      << " starting from previous key block " << from.to_str() << " has hash " << vset_hash
+                      << " different from " << info.gen_validator_list_hash_short << " stated in block header");
+      }
+      // check signatures
+      auto err = check_block_signatures(nodes, signatures, to);
+      if (err.is_error()) {
+        return td::Status::Error("error checking signatures for block "s + to.to_str() +
+                                 " in a forward BlockProofLink: " + err.to_string());
+      }
+      return td::Status::OK();
+    }
+  } catch (vm::VmError& err) {
+    return td::Status::Error("vm error while checking BlockProofLink from "s + from.to_str() + " to " + to.to_str() +
+                             " : " + err.get_msg());
+  } catch (vm::VmVirtError& err) {
+    return td::Status::Error("virtualization error while checking BlockProofLink from "s + from.to_str() + " to " +
+                             to.to_str() + " : " + err.get_msg());
+  }
+}
+
+td::Status BlockProofChain::validate() {
+  valid = false;
+  has_key_block = false;
+  has_utime = false;
+  last_utime = 0;
+  key_blkid.invalidate();
+  if (!(from.is_masterchain_ext() && to.is_masterchain_ext())) {
+    return td::Status::Error("BlockProofChain must have both source and destination blocks in the masterchain");
+  }
+  if (!link_count()) {
+    if (from != to) {
+      return td::Status::Error("BlockProofChain has no links, but its source block "s + from.to_str() +
+                               " and destination block " + to.to_str() + " differ");
+    }
+    valid = true;
+    return td::Status::OK();
+  }
+  ton::BlockIdExt cur = from;
+  int i = 0;
+  for (const auto& link : links) {
+    ++i;
+    if (link.from != cur) {
+      return td::Status::Error(PSTRING() << "link #" << i << " in a BlockProofChain begins with block "
+                                         << link.from.to_str() << " but the previous link ends at different block "
+                                         << cur.to_str());
+    }
+    auto err = link.validate(&last_utime);
+    if (err.is_error()) {
+      return td::Status::Error(PSTRING() << "link #" << i << " in BlockProofChain is invalid: " << err.to_string());
+    }
+    if (link.is_key && (!has_key_block || key_blkid.seqno() < link.to.seqno())) {
+      key_blkid = link.to;
+      has_key_block = true;
+    }
+    cur = link.to;
+  }
+  if (cur != to) {
+    return td::Status::Error("last link of BlockProofChain ends at block "s + cur.to_str() +
+                             " different from declared chain destination block " + to.to_str());
+  }
+  has_utime = (last_utime > 0);
+  valid = true;
+  return td::Status::OK();
+}
+
+td::Bits256 compute_node_id_short(td::Bits256 ed25519_pubkey) {
+  // pub.ed25519#4813b4c6 key:int256 = PublicKey;
+  struct pubkey {
+    int magic = 0x4813b4c6;
+    unsigned char ed25519_key[32];
+  } PK;
+  std::memcpy(PK.ed25519_key, ed25519_pubkey.data(), 32);
+  static_assert(sizeof(pubkey) == 36, "PublicKey structure is not 36 bytes long");
+  td::Bits256 hash;
+  digest::hash_str<digest::SHA256>(hash.data(), (void*)&PK, sizeof(pubkey));
+  return hash;
+}
+
+td::Status check_block_signatures(const std::vector<ton::ValidatorDescr>& nodes,
+                                  const std::vector<ton::BlockSignature>& signatures, const ton::BlockIdExt& blkid) {
+  if (nodes.empty()) {
+    return td::Status::Error("empty validator public keys set");
+  }
+  if (signatures.empty()) {
+    return td::Status::Error("empty validator signature set");
+  }
+  // compute the string to be signed and its hash
+  unsigned char to_sign[68];
+  td::as<td::uint32>(to_sign) = 0xc50b6e70;  // ton.blockId root_cell_hash:int256 file_hash:int256 = ton.BlockId;
+  memcpy(to_sign + 4, blkid.root_hash.data(), 32);
+  memcpy(to_sign + 36, blkid.file_hash.data(), 32);
+  // unsigned char hash[32];
+  // digest::hash_str<digest::SHA256>(hash, (void*)to_sign, sizeof(to_sign));
+
+  ton::ValidatorWeight total_weight = 0, signed_weight = 0;
+  std::vector<std::pair<td::Bits256, unsigned>> node_map;
+  for (unsigned i = 0; i < nodes.size(); i++) {
+    total_weight += nodes[i].weight;
+    node_map.emplace_back(compute_node_id_short(nodes[i].key), i);
+  }
+  std::sort(node_map.begin(), node_map.end());
+  std::vector<unsigned> seen;
+  for (auto& sig : signatures) {
+    // lookup node in validator set
+    auto& id = sig.node;
+    auto it = std::lower_bound(node_map.begin(), node_map.end(), id,
+                               [](const auto& p, const auto& x) { return p.first < x; });
+    if (it == node_map.end() || it->first != id) {
+      return td::Status::Error("signature set contains unknown NodeIdShort "s + id.to_hex());
+    }
+    unsigned i = it->second;
+    seen.emplace_back(i);
+    // check one signature
+    td::Ed25519::PublicKey pub_key{td::SecureString{nodes.at(i).key.as_slice()}};
+    auto res = pub_key.verify_signature(td::Slice{to_sign, 68}, sig.signature.as_slice());
+    if (res.is_error()) {
+      return res;
+    }
+    signed_weight += nodes[i].weight;
+    if (signed_weight > total_weight) {
+      break;
+    }
+  }
+  std::sort(seen.begin(), seen.end());
+  for (std::size_t i = 1; i < seen.size(); i++) {
+    if (seen[i] == seen[i - 1]) {
+      return td::Status::Error("signature set contains duplicate signature for NodeIdShort "s +
+                               compute_node_id_short(nodes.at(seen[i]).key).to_hex());
+    }
+  }
+  if (3 * signed_weight <= 2 * total_weight) {
+    return td::Status::Error(PSTRING() << "insufficient total signature weight: only " << signed_weight << " out of "
+                                       << total_weight);
+  }
+  return td::Status::OK();
+}
+
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/check-proof.h b/submodules/ton/tonlib-src/crypto/block/check-proof.h
new file mode 100644
index 0000000000..e9c43a7074
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/check-proof.h
@@ -0,0 +1,94 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "vm/cells.h"
+#include "block/block.h"
+
+namespace block {
+using td::Ref;
+
+td::Status check_block_header_proof(td::Ref<vm::Cell> root, ton::BlockIdExt blkid,
+                                    ton::Bits256* store_shard_hash_to = nullptr, bool check_state_hash = false);
+td::Status check_shard_proof(ton::BlockIdExt blk, ton::BlockIdExt shard_blk, td::Slice shard_proof);
+td::Status check_account_proof(td::Slice proof, ton::BlockIdExt shard_blk, const block::StdAddress& addr,
+                               td::Ref<vm::Cell> root, ton::LogicalTime* last_trans_lt = nullptr,
+                               ton::Bits256* last_trans_hash = nullptr);
+td::Result<td::Bits256> check_state_proof(ton::BlockIdExt blkid, td::Slice proof);
+td::Result<Ref<vm::Cell>> check_extract_state_proof(ton::BlockIdExt blkid, td::Slice proof, td::Slice data);
+
+td::Status check_block_signatures(const std::vector<ton::ValidatorDescr>& nodes,
+                                  const std::vector<ton::BlockSignature>& signatures, const ton::BlockIdExt& blkid);
+
+struct AccountState {
+  ton::BlockIdExt blk;
+  ton::BlockIdExt shard_blk;
+  td::BufferSlice shard_proof;
+  td::BufferSlice proof;
+  td::BufferSlice state;
+
+  struct Info {
+    td::Ref<vm::Cell> root;
+    ton::LogicalTime last_trans_lt = 0;
+    ton::Bits256 last_trans_hash;
+  };
+
+  td::Result<Info> validate(ton::BlockIdExt ref_blk, block::StdAddress addr) const;
+};
+
+struct Transaction {
+  ton::BlockIdExt blkid;
+  ton::LogicalTime lt;
+  ton::Bits256 hash;
+  td::Ref<vm::Cell> root;
+
+  struct Info {
+    ton::BlockIdExt blkid;
+    ton::LogicalTime prev_trans_lt;
+    ton::Bits256 prev_trans_hash;
+    td::Ref<vm::Cell> transaction;
+  };
+  td::Result<Info> validate();
+};
+
+struct TransactionList {
+  ton::LogicalTime lt;
+  ton::Bits256 hash;
+  std::vector<ton::BlockIdExt> blkids;
+  td::BufferSlice transactions_boc;
+
+  struct Info {
+    std::vector<Transaction::Info> transactions;
+  };
+
+  td::Result<Info> validate() const;
+};
+
+struct BlockChain {
+  ton::BlockIdExt from;
+  ton::BlockIdExt to;
+  td::int32 mode;
+  td::BufferSlice proof;
+
+  using Info = std::unique_ptr<block::BlockProofChain>;
+
+  td::Result<Info> validate() const;
+};
+
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/create-state.cpp b/submodules/ton/tonlib-src/crypto/block/create-state.cpp
new file mode 100644
index 0000000000..8b92a24fa2
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/create-state.cpp
@@ -0,0 +1,780 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <cassert>
+#include <algorithm>
+#include <string>
+#include <vector>
+#include <iostream>
+#include <sstream>
+#include <fstream>
+#include <memory>
+#include <cstring>
+#include <cstdlib>
+#include <cmath>
+#include <map>
+#include <functional>
+#include <limits>
+#include <getopt.h>
+
+#include "vm/stack.hpp"
+#include "vm/boc.h"
+
+#include "fift/Fift.h"
+#include "fift/Dictionary.h"
+#include "fift/SourceLookup.h"
+#include "fift/words.h"
+
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/Parser.h"
+#include "td/utils/port/path.h"
+#include "td/utils/port/signals.h"
+
+#include "block.h"
+#include "block-parse.h"
+#include "block-auto.h"
+#include "mc-config.h"
+
+#define PDO(__op) \
+  if (!(__op)) {  \
+    ok = false;   \
+  }
+#define THRERR(__msg)            \
+  if (!ok) {                     \
+    throw fift::IntError{__msg}; \
+  }
+#define RETERR    \
+  if (!ok) {      \
+    return false; \
+  }
+
+using td::Ref;
+
+int verbosity;
+
+enum { wc_master = -1, wc_base = 0 };
+constexpr int wc_undef = std::numeric_limits<int>::min();
+
+int workchain_id = wc_undef;
+int global_id = 0;
+
+typedef td::BitArray<256> hash_t;
+
+struct SmcDescr {
+  hash_t addr;
+  int split_depth;
+  bool preinit_only;
+  td::RefInt256 gram_balance;
+  Ref<vm::DataCell> state_init;  // StateInit
+  Ref<vm::DataCell> account;     // Account
+  SmcDescr(const hash_t& _addr) : addr(_addr), split_depth(0), preinit_only(false) {
+  }
+};
+
+std::map<hash_t, SmcDescr> smart_contracts;
+td::RefInt256 total_smc_balance{true, 0}, max_total_smc_balance;
+
+struct PublicLibDescr {
+  Ref<vm::Cell> root;
+  std::set<hash_t> publishers;
+  PublicLibDescr(Ref<vm::Cell> _root) : root(std::move(_root)) {
+  }
+};
+
+std::map<hash_t, PublicLibDescr> public_libraries;
+
+hash_t config_addr;
+Ref<vm::Cell> config_param_root;
+bool config_addr_set;
+vm::Dictionary config_dict{32};
+
+ton::UnixTime now;
+
+bool set_config_smc(const SmcDescr& smc) {
+  if (config_addr_set || smc.preinit_only || workchain_id != wc_master || smc.split_depth) {
+    return false;
+  }
+  vm::CellSlice cs = load_cell_slice(smc.state_init);
+  bool ok = true;
+  PDO(block::gen::t_Maybe_natwidth_5.skip(cs) && block::gen::t_Maybe_TickTock.skip(cs) &&
+      block::gen::t_Maybe_Ref_Cell.skip(cs));
+  RETERR;
+  Ref<vm::Cell> data;
+  PDO(cs.fetch_ulong(1) == 1 && cs.fetch_ref_to(data));
+  THRERR("config smart contract must have non-empty data");
+  vm::CellSlice cs2 = load_cell_slice(data);
+  PDO(cs2.fetch_ref_to(data));
+  THRERR("first reference in config smart contract data must point to initial configuration");
+  PDO(block::valid_config_data(data, smc.addr));
+  THRERR("invalid smart contract configuration data");
+  config_addr = smc.addr;
+  config_param_root = std::move(data);
+  config_addr_set = true;
+  if (verbosity > 2) {
+    std::cerr << "set smart contract " << config_addr << " as the configuration smart contract with configuration:\n";
+    load_cell_slice(config_param_root).print_rec(std::cerr);
+  }
+  return true;
+}
+
+void interpret_set_workchain(vm::Stack& stack) {
+  workchain_id = stack.pop_smallint_range(0x7fffffff, -0x7fffffff);
+}
+
+void interpret_get_workchain(vm::Stack& stack) {
+  stack.push_smallint(workchain_id);
+}
+
+void interpret_set_global_id(vm::Stack& stack) {
+  global_id = stack.pop_smallint_range(0x7fffffff, -0x7fffffff);
+}
+
+void interpret_get_global_id(vm::Stack& stack) {
+  stack.push_smallint(global_id);
+}
+
+void interpret_get_verbosity(vm::Stack& stack) {
+  stack.push_smallint(GET_VERBOSITY_LEVEL());
+}
+
+void interpret_set_verbosity(vm::Stack& stack) {
+  int x = stack.pop_smallint_range(15);
+  SET_VERBOSITY_LEVEL(x);
+}
+
+void interpret_set_config_smartcontract(vm::Stack& stack) {
+  if (workchain_id != wc_master) {
+    throw fift::IntError{"configuration smart contract may be selected in masterchain only"};
+  }
+  if (config_addr_set) {
+    throw fift::IntError{"configuration smart contract already selected"};
+  }
+  td::RefInt256 int_addr = stack.pop_int_finite();
+  hash_t addr;
+  if (!int_addr->export_bits(addr.bits(), 256, false)) {
+    throw fift::IntError{"not a valid smart-contract address"};
+  }
+  auto it = smart_contracts.find(addr);
+  if (it == smart_contracts.end()) {
+    throw fift::IntError{"unknown smart contract"};
+  }
+  const SmcDescr& smc = it->second;
+  assert(smc.addr == addr);
+  if (smc.preinit_only) {
+    throw fift::IntError{"configuration smart contract must be completely initialized"};
+  }
+  if (!set_config_smc(smc)) {
+    throw fift::IntError{"invalid configuration smart contract"};
+  }
+}
+
+bool is_empty_cell(Ref<vm::Cell> cell) {
+  bool is_special;
+  auto cs = load_cell_slice_special(std::move(cell), is_special);
+  return !is_special && cs.empty_ext();
+}
+
+bool add_public_library(hash_t lib_addr, hash_t smc_addr, Ref<vm::Cell> lib_root) {
+  if (lib_root.is_null() || lib_root->get_hash().as_array() != lib_addr.as_array()) {
+    return false;
+  }
+  auto ins = public_libraries.emplace(lib_addr, lib_root);
+  PublicLibDescr& lib = ins.first->second;
+  lib.publishers.insert(smc_addr);
+  if (verbosity > 2) {
+    std::cerr << "added " << (ins.second ? "new " : "") << "public library " << lib_addr << " with publisher "
+              << smc_addr << std::endl;
+  }
+  return true;
+}
+
+td::RefInt256 create_smartcontract(td::RefInt256 smc_addr, Ref<vm::Cell> code, Ref<vm::Cell> data,
+                                   Ref<vm::Cell> library, td::RefInt256 balance, int special, int split_depth,
+                                   int mode) {
+  if (is_empty_cell(code)) {
+    code.clear();
+  }
+  if (is_empty_cell(data)) {
+    data.clear();
+  }
+  if (is_empty_cell(library)) {
+    library.clear();
+  }
+  bool ok = true;
+  if (library.not_null()) {
+    PDO(block::valid_library_collection(library, false));
+    THRERR("not a valid library collection");
+  }
+  vm::CellBuilder cb;
+  if (!split_depth) {
+    PDO(cb.store_long_bool(0, 1));
+  } else {
+    PDO(cb.store_long_bool(1, 1) && cb.store_ulong_rchk_bool(split_depth, 5));
+  }
+  THRERR("invalid split_depth for a smart contract");
+  if (!special) {
+    PDO(cb.store_long_bool(0, 1));
+  } else {
+    PDO(cb.store_long_bool(1, 1) && cb.store_ulong_rchk_bool(special, 2));
+  }
+  THRERR("invalid special TickTock argument for a smart contract");
+  PDO(cb.store_maybe_ref(std::move(code)) && cb.store_maybe_ref(std::move(data)) && cb.store_maybe_ref(library));
+  THRERR("cannot store smart-contract code, data or library");
+  Ref<vm::DataCell> state_init = cb.finalize();
+  hash_t addr;
+  if (smc_addr.is_null()) {
+    addr = state_init->get_hash().as_array();
+    smc_addr = td::RefInt256{true};
+    PDO(smc_addr.write().import_bits(addr.data(), 0, 256, false));
+  } else if (mode == 1) {
+    throw fift::IntError{"cannot create uninitialized smart contracts with specified addresses"};
+  } else {
+    PDO(smc_addr->export_bits(addr.data(), 0, 256, false));
+  }
+  THRERR("cannot initialize smart-contract address");
+  if (verbosity > 2) {
+    std::cerr << "smart-contract address is ";
+    std::cerr << addr << " = " << smc_addr << std::endl;
+  }
+  PDO(mode || !sgn(balance));
+  THRERR("cannot set non-zero balance to smart contract unless it is initialized");
+  PDO(sgn(balance) >= 0);
+  THRERR("balance cannot be negative");
+  if (!mode) {
+    return smc_addr;  // compute address only
+  }
+  auto it = smart_contracts.find(addr);
+  if (it != smart_contracts.end()) {
+    std::cerr << "smart contract " << addr << " already defined\n";
+    throw fift::IntError{"smart contract already exists"};
+  }
+  auto ins = smart_contracts.emplace(addr, addr);
+  assert(ins.second);
+  SmcDescr& smc = ins.first->second;
+  smc.split_depth = split_depth;
+  smc.preinit_only = (mode == 1);
+  smc.gram_balance = balance;
+  total_smc_balance += balance;
+  if (mode > 1) {
+    smc.state_init = std::move(state_init);
+  }
+  if (max_total_smc_balance.not_null() && total_smc_balance > max_total_smc_balance) {
+    throw fift::IntError{"total smart-contract balance exceeds limit"};
+  }
+  cb.reset();
+  PDO(cb.store_long_bool(0, 64)                                 // account_storage$_ last_trans_lt:uint64
+      && block::tlb::t_Grams.store_integer_value(cb, *balance)  // balance.grams:Grams
+      && cb.store_long_bool(0, 1));                             // balance.other:ExtraCurrencyCollection
+  if (mode == 1) {
+    PDO(block::gen::t_AccountState.pack_account_uninit(cb));
+  } else {
+    PDO(block::gen::t_AccountState.pack_account_active(cb, vm::load_cell_slice_ref(smc.state_init)));
+  }
+  THRERR("cannot create smart-contract AccountStorage");
+  Ref<vm::DataCell> storage = cb.finalize();
+  vm::CellStorageStat stats;
+  PDO(stats.compute_used_storage(Ref<vm::Cell>(storage)));
+  if (verbosity > 2) {
+    std::cerr << "storage is:\n";
+    vm::load_cell_slice(storage).print_rec(std::cerr);
+    std::cerr << "stats: bits=" << stats.bits << ", cells=" << stats.cells << std::endl;
+    std::cerr << "block::gen::AccountStorage.validate_ref() = " << block::gen::t_AccountStorage.validate_ref(storage)
+              << std::endl;
+    std::cerr << "block::tlb::AccountStorage.validate_ref() = " << block::tlb::t_AccountStorage.validate_ref(storage)
+              << std::endl;
+  }
+  PDO(block::gen::t_AccountStorage.validate_ref(storage));
+  THRERR("AccountStorage of created smart-contract is invalid (?)");
+  cb.reset();                     // build Account
+  PDO(cb.store_long_bool(1, 1));  // account$1
+  int ctor = 3;                   // addr_var$11
+  if (workchain_id >= -128 && workchain_id <= 127) {
+    ctor = 2;  // addr_std$10
+  }
+  PDO(cb.store_long_bool(ctor, 2));  // addr_std$10 or addr_var$11
+  if (split_depth) {
+    PDO(cb.store_long_bool(1, 1)                            // just$1
+        && cb.store_ulong_rchk_bool(split_depth, 5)         // depth:(## 5)
+        && cb.store_bits_bool(addr.cbits(), split_depth));  // rewrite pfx:(depth * Bit)
+  } else {
+    PDO(cb.store_long_bool(0, 1));  // nothing$0
+  }
+  PDO(cb.store_long_rchk_bool(workchain_id, ctor == 2 ? 8 : 32) && cb.store_bits_bool(addr.cbits(), 256));
+  THRERR("Cannot serialize addr:MsgAddressInt of the new smart contract");
+  // storage_stat:StorageInfo -> storage_stat.used:StorageUsed
+  PDO(block::store_UInt7(cb, stats.cells)              // cells:(VarUInteger 7)
+      && block::store_UInt7(cb, stats.bits)            // bits:(VarUInteger 7)
+      && block::store_UInt7(cb, stats.public_cells));  // public_cells:(VarUInteger 7)
+  THRERR("Cannot serialize used:StorageUsed of the new smart contract");
+  PDO(cb.store_long_bool(0, 33));          // last_paid:uint32 due_payment:(Maybe Grams)
+  PDO(cb.append_data_cell_bool(storage));  // storage:AccountStorage
+  THRERR("Cannot create Account of the new smart contract");
+  smc.account = cb.finalize();
+  if (verbosity > 2) {
+    std::cerr << "account is:\n";
+    vm::load_cell_slice(smc.account).print_rec(std::cerr);
+    std::cerr << "block::gen::Account.validate_ref() = " << block::gen::t_Account.validate_ref(smc.account)
+              << std::endl;
+    std::cerr << "block::tlb::Account.validate_ref() = " << block::tlb::t_Account.validate_ref(smc.account)
+              << std::endl;
+  }
+  PDO(block::gen::t_Account.validate_ref(smc.account));
+  THRERR("Account of created smart contract is invalid (?)");
+  if (library.not_null()) {
+    vm::Dictionary dict{std::move(library), 256};
+    ok &= dict.check_for_each([addr](Ref<vm::CellSlice> cs, td::ConstBitPtr key, int n) -> bool {
+      return !cs->prefetch_ulong(1) || add_public_library(key, addr, cs->prefetch_ref());
+    });
+    THRERR("Error processing libraries published by new smart contract");
+  }
+  return smc_addr;
+}
+
+// stores accounts:ShardAccounts
+bool store_accounts(vm::CellBuilder& cb) {
+  vm::AugmentedDictionary dict{256, block::tlb::aug_ShardAccounts};
+  for (const auto& smc_pair : smart_contracts) {
+    const SmcDescr& smc = smc_pair.second;
+    CHECK(smc_pair.first == smc.addr);
+    vm::CellBuilder cb;
+    bool ok = cb.store_ref_bool(smc.account)     // account_descr$_ acc:^Account
+              && cb.store_zeroes_bool(256 + 64)  // last_trans_hash:bits256 last_trans_lt:uint64
+              && dict.set_builder(smc.addr.cbits(), 256, cb, vm::Dictionary::SetMode::Add);
+    CHECK(ok);
+  }
+  return std::move(dict).append_dict_to_bool(cb);
+}
+
+// stores libraries:(HashmapE 256 LibDescr)
+bool store_public_libraries(vm::CellBuilder& cb) {
+  vm::Dictionary dict{256};
+  bool ok = true;
+  vm::CellBuilder empty_cb;
+  for (const auto& lib_pair : public_libraries) {
+    const PublicLibDescr pl = lib_pair.second;
+    PDO(pl.root->get_hash().as_array() == lib_pair.first.as_array());
+    vm::Dictionary publishers{256};
+    for (const auto& publisher : pl.publishers) {
+      PDO(publishers.set_builder(publisher.cbits(), 256, empty_cb, vm::Dictionary::SetMode::Add));
+    }
+    Ref<vm::Cell> root = std::move(publishers).extract_root_cell();
+    PDO(root.not_null());
+    THRERR("public library has an empty or invalid set of publishers");
+    vm::CellBuilder value_cb;  // LibDescr
+    PDO(value_cb.store_long_bool(0, 2) && value_cb.store_ref_bool(pl.root) &&
+        value_cb.append_cellslice_bool(vm::load_cell_slice(std::move(root))));
+    THRERR("cannot create LibDescr for a public library");
+    PDO(dict.set_builder(lib_pair.first.cbits(), 256, value_cb, vm::Dictionary::SetMode::Add));
+    THRERR("cannot insert LibDescr of a public library into the public library collection");
+  }
+  PDO(std::move(dict).append_dict_to_bool(cb));
+  return ok;
+}
+
+// stores config:ConfigParams
+bool store_config_params(vm::CellBuilder& cb) {
+  return config_addr_set && config_param_root.not_null() &&
+         cb.store_bits_bool(config_addr.cbits(), 256)  // _ config_addr:bits256
+         && cb.store_ref_bool(config_param_root);      // config:^(Hashmap 32 ^Cell)
+}
+
+// stores hash of initial masterchain validator set computed from configuration parameter 34
+bool store_validator_list_hash(vm::CellBuilder& cb) {
+  Ref<vm::Cell> vset_cell = config_dict.lookup_ref(td::BitArray<32>{34});
+  auto res = block::Config::unpack_validator_set(std::move(vset_cell));
+  if (res.is_error()) {
+    LOG(ERROR) << "cannot unpack current validator set: " << res.move_as_error().to_string();
+    return false;
+  }
+  auto vset = res.move_as_ok();
+  LOG_CHECK(vset) << "unpacked validator set is empty";
+  auto ccvc = block::Config::unpack_catchain_validators_config(config_dict.lookup_ref(td::BitArray<32>{28}));
+  ton::ShardIdFull shard{ton::masterchainId};
+  auto nodes = block::Config::do_compute_validator_set(ccvc, shard, *vset, now, 0);
+  LOG_CHECK(!nodes.empty()) << "validator node list in unpacked validator set is empty";
+  auto vset_hash = block::compute_validator_set_hash(0, shard, std::move(nodes));
+  LOG(DEBUG) << "initial validator set hash is " << vset_hash;
+  return cb.store_long_bool(vset_hash, 32);
+}
+
+// stores custom:(Maybe ^McStateExtra)
+bool store_custom(vm::CellBuilder& cb) {
+  if (workchain_id != wc_master) {
+    return cb.store_long_bool(0, 1);  // nothing
+  }
+  vm::CellBuilder cb2, cb3;
+  bool ok = true;
+  PDO(cb2.store_long_bool(0xcc26, 16)        // masterchain_state_extra#cc26
+      && cb2.store_long_bool(0, 1)           // shard_hashes:ShardHashes = (HashmapE 32 ^(BinTree ShardDescr))
+      && store_config_params(cb2)            // config:ConfigParams
+      && cb3.store_long_bool(0, 16)          // ^[ flags:(## 16) { flags = 0 }
+      && store_validator_list_hash(cb3)      //   validator_list_hash_short:uint32
+      && cb3.store_long_bool(0, 32)          //   catchain_seqno:uint32
+      && cb3.store_bool_bool(true)           //   nx_cc_updated:Bool
+      && cb3.store_zeroes_bool(1 + 65)       //   prev_blocks:OldMcBlocksInfo
+      && cb3.store_long_bool(2, 1 + 1)       //   after_key_block:Bool last_key_block:(Maybe ...)
+      && cb2.store_ref_bool(cb3.finalize())  // ]
+      && block::CurrencyCollection{total_smc_balance}.store(cb2)  // global_balance:CurrencyCollection
+      && cb.store_long_bool(1, 1)                                 // just
+      && cb.store_ref_bool(cb2.finalize()));
+  return ok;
+}
+
+Ref<vm::Cell> create_state() {
+  vm::CellBuilder cb, cb2;
+  now = static_cast<ton::UnixTime>(time(0));
+  bool ok = true;
+  PDO(workchain_id != wc_undef);
+  THRERR("workchain_id is unset, cannot generate state");
+  PDO(workchain_id != wc_master || config_addr_set);
+  THRERR("configuration smart contract must be selected");
+  PDO(cb.store_long_bool(0x9023afe2, 32)      // shard_state#9023afe2
+      && cb.store_long_bool(global_id, 32));  // global_id:int32
+  PDO(cb.store_long_bool(0, 8) && cb.store_long_bool(workchain_id, 32) &&
+      cb.store_long_bool(0, 64)                                   // shard_id:ShardIdent
+      && cb.store_long_bool(0, 32)                                // seq_no:#
+      && cb.store_zeroes_bool(32)                                 // vert_seq_no:#
+      && cb.store_long_bool(now, 32)                              // gen_utime:uint32
+      && cb.store_zeroes_bool(64)                                 // gen_lt:uint64
+      && cb.store_ones_bool(32)                                   // min_ref_mc_seqno:uint32
+      && cb2.store_zeroes_bool(1 + 64 + 2)                        // OutMsgQueueInfo
+      && cb.store_ref_bool(cb2.finalize())                        // out_msg_queue_info:^OutMsgQueueInfo
+      && cb.store_long_bool(0, 1)                                 // before_split:Bool
+      && store_accounts(cb2)                                      // accounts:^ShardAccounts
+      && cb.store_ref_bool(cb2.finalize())                        // ...
+      && cb2.store_zeroes_bool(128)                               // ^[ overload_history:uint64 underload_history:uint64
+      && block::CurrencyCollection{total_smc_balance}.store(cb2)  //   total_balance:CurrencyCollection
+      && block::tlb::t_CurrencyCollection.null_value(cb2)         //   total_validator_fees:CurrencyCollection
+      && store_public_libraries(cb2)                              //   libraries:(Hashmap 256 LibDescr)
+      && cb2.store_long_bool(0, 1)                                //   master_ref:(Maybe BlkMasterInfo)
+      && cb.store_ref_bool(cb2.finalize())                        // ]
+      && store_custom(cb));                                       // custom:(Maybe ^McStateExtra)
+  THRERR("cannot create blockchain state");
+  Ref<vm::Cell> cell = cb.finalize();
+  if (verbosity > 2) {
+    std::cerr << "shard_state is:\n";
+    vm::load_cell_slice(cell).print_rec(std::cerr);
+    std::cerr << "pretty-printed shard_state is:\n";
+    block::gen::t_ShardState.print_ref(std::cerr, cell);
+    std::cerr << "\n";
+    std::cerr << "block::gen::ShardState.validate_ref() = " << block::gen::t_ShardState.validate_ref(cell) << std::endl;
+    std::cerr << "block::tlb::ShardState.validate_ref() = " << block::tlb::t_ShardState.validate_ref(cell) << std::endl;
+    block::gen::ShardStateUnsplit::Record data;
+    bool ok1 = tlb::unpack_cell(cell, data);
+    std::cerr << "block::gen::ShardState.unpack_cell() = " << ok1 << std::endl;
+    if (ok1) {
+      std::cerr << "shard_id = " << data.shard_id
+                << "; out_msg_queue_info = " << load_cell_slice(data.out_msg_queue_info)
+                << "; total_balance = " << data.r1.total_balance << std::endl;
+    }
+  }
+  PDO(block::gen::t_ShardState.validate_ref(cell));
+  PDO(block::tlb::t_ShardState.validate_ref(cell));
+  THRERR("created an invalid ShardState record");
+  return cell;
+}
+
+// code (cell)
+// data (cell)
+// library (cell)
+// balance (int)
+// split_depth (int 0..32)
+// special (int 0..3, +2 = tick, +1 = tock)
+// [ address (uint256) ]
+// mode (0 = compute address only, 1 = create uninit, 2 = create complete; +4 = with specified address)
+// --> 256-bit address
+void interpret_register_smartcontract(vm::Stack& stack) {
+  if (workchain_id == wc_undef) {
+    throw fift::IntError{"cannot register a smartcontract unless the workchain is specified first"};
+  }
+  td::RefInt256 spec_addr;
+  int mode = stack.pop_smallint_range(2 + 4);  // allowed modes: 0 1 2 4 5 6
+  if (mode == 3) {
+    throw fift::IntError{"invalid mode"};
+  }
+  if (mode & 4) {
+    spec_addr = stack.pop_int_finite();
+    mode &= ~4;
+  }
+  int special = stack.pop_smallint_range(3);
+  if (special && workchain_id != wc_master) {
+    throw fift::IntError{"cannot create special smartcontracts outside of the masterchain"};
+  }
+  int split_depth = stack.pop_smallint_range(32);
+  td::RefInt256 balance = stack.pop_int_finite();
+  if (sgn(balance) < 0) {
+    throw fift::IntError{"initial balance of a smartcontract cannot be negative"};
+  }
+  if (sgn(balance) > 0 && !mode) {
+    throw fift::IntError{"cannot set non-zero balance if an account is not created"};
+  }
+  Ref<vm::Cell> library = stack.pop_cell();
+  Ref<vm::Cell> data = stack.pop_cell();
+  Ref<vm::Cell> code = stack.pop_cell();
+  td::RefInt256 addr = create_smartcontract(std::move(spec_addr), std::move(code), std::move(data), std::move(library),
+                                            std::move(balance), special, split_depth, mode);
+  if (addr.is_null()) {
+    throw fift::IntError{"internal error while creating smartcontract"};
+  }
+  stack.push(std::move(addr));
+}
+
+void interpret_create_state(vm::Stack& stack) {
+  if (!global_id) {
+    throw fift::IntError{
+        "(global) blockchain id must be set to a non-zero value: negative for test chains, positive for production"};
+  }
+  Ref<vm::Cell> state = create_state();
+  if (state.is_null()) {
+    throw fift::IntError{"could not create blockchain state"};
+  }
+  stack.push(std::move(state));
+}
+
+void interpret_get_config_dict(vm::Stack& stack) {
+  Ref<vm::Cell> value = config_dict.get_root_cell();
+  if (value.is_null()) {
+    stack.push_bool(false);
+  } else {
+    stack.push_cell(std::move(value));
+    stack.push_bool(true);
+  }
+}
+
+void interpret_get_config_param(vm::Stack& stack) {
+  int x = stack.pop_smallint_range(0x7fffffff, 0x80000000);
+  Ref<vm::Cell> value = config_dict.lookup_ref(td::BitArray<32>{x});
+  if (value.is_null()) {
+    stack.push_bool(false);
+  } else {
+    stack.push_cell(std::move(value));
+    stack.push_bool(true);
+  }
+}
+
+void interpret_set_config_param(vm::Stack& stack) {
+  int x = stack.pop_smallint_range(0x7fffffff, 0x80000000);
+  Ref<vm::Cell> value = stack.pop_cell();
+  if (verbosity > 2 && x >= 0) {
+    std::cerr << "setting configuration parameter #" << x << " to ";
+    // vm::load_cell_slice(value).print_rec(std::cerr);
+    block::gen::ConfigParam{x}.print_ref(std::cerr, value);
+    std::cerr << std::endl;
+  }
+  if (x >= 0 && !block::gen::ConfigParam{x}.validate_ref(value)) {
+    throw fift::IntError{"invalid value for indicated configuration parameter"};
+  }
+  if (!config_dict.set_ref(td::BitArray<32>{x}, std::move(value))) {
+    throw fift::IntError{"cannot set value of configuration parameter (value too long?)"};
+  }
+}
+
+void interpret_is_shard_state(vm::Stack& stack) {
+  Ref<vm::Cell> cell = stack.pop_cell();
+  if (verbosity > 4) {
+    std::cerr << "custom shard state is:\n";
+    vm::load_cell_slice(cell).print_rec(std::cerr);
+    std::cerr << "pretty-printed custom shard state is:\n";
+    block::gen::t_ShardState.print_ref(std::cerr, cell);
+  }
+  stack.push_bool(block::gen::t_ShardState.validate_ref(std::move(cell)));
+}
+
+void interpret_is_workchain_descr(vm::Stack& stack) {
+  Ref<vm::Cell> cell = stack.pop_cell();
+  if (verbosity > 4) {
+    std::cerr << "WorkchainDescr is:\n";
+    vm::load_cell_slice(cell).print_rec(std::cerr);
+    std::cerr << "pretty-printed WorkchainDescr is:\n";
+    block::gen::t_WorkchainDescr.print_ref(std::cerr, cell);
+  }
+  stack.push_bool(block::gen::t_WorkchainDescr.validate_ref(std::move(cell)));
+}
+
+void init_words_custom(fift::Dictionary& d) {
+  d.def_stack_word("verb@ ", interpret_get_verbosity);
+  d.def_stack_word("verb! ", interpret_set_verbosity);
+  d.def_stack_word("wcid@ ", interpret_get_workchain);
+  d.def_stack_word("wcid! ", interpret_set_workchain);
+  d.def_stack_word("globalid@ ", interpret_get_global_id);
+  d.def_stack_word("globalid! ", interpret_set_global_id);
+  d.def_stack_word("config@ ", interpret_get_config_param);
+  d.def_stack_word("config! ", interpret_set_config_param);
+  d.def_stack_word("(configdict) ", interpret_get_config_dict);
+  d.def_stack_word("register_smc ", interpret_register_smartcontract);
+  d.def_stack_word("set_config_smc ", interpret_set_config_smartcontract);
+  d.def_stack_word("create_state ", interpret_create_state);
+  d.def_stack_word("isShardState? ", interpret_is_shard_state);
+  d.def_stack_word("isWorkchainDescr? ", interpret_is_workchain_descr);
+}
+
+void usage(const char* progname) {
+  std::cerr
+      << "Creates initial state for a TON blockchain, using configuration defined by Fift-language source files\n";
+  std::cerr
+      << "usage: " << progname
+      << " [-i] [-n] [-I <source-include-path>] {-L <library-fif-file>} <source-file1-fif> <source-file2-fif> ...\n";
+  std::cerr << "\t-n\tDo not preload preamble files `Fift.fif` and `CreateState.fif`\n"
+               "\t-i\tForce interactive mode even if explicit source file names are indicated\n"
+               "\t-I<source-search-path>\tSets colon-separated library source include path. If not indicated, "
+               "$FIFTPATH is used instead.\n"
+               "\t-L<library-fif-file>\tPre-loads a library source file\n"
+               "\t-v<verbosity-level>\tSet verbosity level\n";
+  std::exit(2);
+}
+
+void parse_include_path_set(std::string include_path_set, std::vector<std::string>& res) {
+  td::Parser parser(include_path_set);
+  while (!parser.empty()) {
+    auto path = parser.read_till_nofail(':');
+    if (!path.empty()) {
+      res.push_back(path.str());
+    }
+    parser.skip_nofail(':');
+  }
+}
+
+void preload_preamble(fift::Fift& fift, std::string filename, bool standard = true) {
+  auto status = fift.interpret_file(filename, "");
+  if (status.is_error()) {
+    LOG(ERROR) << "Error interpreting " << (standard ? "standard" : "application-specific") << " preamble file `"
+               << filename << "`: " << status.error().message()
+               << "\nCheck that correct include path is set by -I or by FIFTPATH environment variable, or disable "
+                  "standard preamble by -n.\n";
+    std::exit(2);
+  }
+}
+
+int main(int argc, char* const argv[]) {
+  td::set_default_failure_signal_handler().ensure();
+  bool interactive = false;
+  bool fift_preload = true, no_env = false, script_mode = false;
+  std::vector<std::string> library_source_files, source_list;
+  std::vector<std::string> source_include_path;
+  std::string ton_db_path;
+
+  fift::Fift::Config config;
+
+  int i;
+  int new_verbosity_level = VERBOSITY_NAME(INFO);
+  while (!script_mode && (i = getopt(argc, argv, "hinsI:L:v:")) != -1) {
+    switch (i) {
+      case 'i':
+        interactive = true;
+        break;
+      case 'n':
+        fift_preload = false;
+        break;
+      case 'I':
+        LOG(ERROR) << source_include_path;
+        parse_include_path_set(optarg, source_include_path);
+        no_env = true;
+        break;
+      case 's':
+        script_mode = true;
+        break;
+      case 'L':
+        library_source_files.emplace_back(optarg);
+        break;
+      case 'v':
+        new_verbosity_level = VERBOSITY_NAME(FATAL) + (verbosity = td::to_integer<int>(td::Slice(optarg)));
+        break;
+      case 'h':
+      default:
+        usage(argv[0]);
+    }
+  }
+  SET_VERBOSITY_LEVEL(new_verbosity_level);
+
+  while (optind < argc) {
+    source_list.emplace_back(argv[optind++]);
+    if (script_mode) {
+      break;
+    }
+  }
+
+  if (!no_env) {
+    const char* path = std::getenv("FIFTPATH");
+    if (path) {
+      parse_include_path_set(path ? path : "/usr/lib/fift", source_include_path);
+    }
+  }
+  std::string current_dir;
+  auto r_current_dir = td::realpath(".");
+  if (r_current_dir.is_ok()) {
+    current_dir = r_current_dir.move_as_ok();
+    source_include_path.push_back(current_dir);
+  }
+  config.source_lookup = fift::SourceLookup(std::make_unique<fift::OsFileLoader>());
+  for (auto& path : source_include_path) {
+    config.source_lookup.add_include_path(path);
+  }
+
+  fift::init_words_common(config.dictionary);
+  fift::init_words_vm(config.dictionary);
+  fift::init_words_ton(config.dictionary);
+  init_words_custom(config.dictionary);
+
+  if (script_mode) {
+    fift::import_cmdline_args(config.dictionary, source_list.empty() ? "" : source_list[0], argc - optind,
+                              argv + optind);
+  }
+
+  fift::Fift fift(std::move(config));
+
+  if (fift_preload) {
+    preload_preamble(fift, "Fift.fif", true);
+    preload_preamble(fift, "CreateState.fif", false);
+  }
+
+  for (auto source : library_source_files) {
+    auto status = fift.interpret_file(source, "");
+    if (status.is_error()) {
+      std::cerr << "Error interpreting preloaded file `" << source << "`: " << status.error().to_string() << std::endl;
+      std::exit(2);
+    }
+  }
+
+  if (source_list.empty() && !interactive) {
+    std::cerr << "No Fift source files specified" << std::endl;
+    std::exit(2);
+  }
+
+  for (const auto& source : source_list) {
+    auto status = fift.interpret_file(source, current_dir);
+    if (status.is_error()) {
+      std::cerr << "Error interpreting file `" << source << "`: " << status.error().to_string() << std::endl;
+      std::exit(2);
+    }
+  }
+
+  if (interactive) {
+    fift.interpret_istream(std::cin, current_dir).ensure();
+  }
+  // show_total_cells();
+}
diff --git a/submodules/ton/tonlib-src/crypto/block/mc-config.cpp b/submodules/ton/tonlib-src/crypto/block/mc-config.cpp
new file mode 100644
index 0000000000..a8fbeed262
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/mc-config.cpp
@@ -0,0 +1,1834 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "mc-config.h"
+#include "block/block.h"
+#include "block/block-parse.h"
+#include "block/block-auto.h"
+#include "common/bitstring.h"
+#include "vm/dict.h"
+#include "td/utils/bits.h"
+#include "td/utils/uint128.h"
+#include "ton/ton-types.h"
+#include "ton/ton-shard.h"
+#include "crypto/openssl/digest.h"
+#include <stack>
+#include <algorithm>
+
+namespace block {
+using td::Ref;
+
+Config::Config(Ref<vm::Cell> config_root, const td::Bits256& config_addr, int _mode)
+    : mode(_mode), config_addr(config_addr), config_root(std::move(config_root)) {
+}
+
+td::Result<std::unique_ptr<Config>> Config::unpack_config(Ref<vm::Cell> config_root, const td::Bits256& config_addr,
+                                                          int mode) {
+  std::unique_ptr<Config> ptr{new Config(std::move(config_root), config_addr, mode)};
+  TRY_STATUS(ptr->unpack_wrapped());
+  return std::move(ptr);
+}
+
+td::Result<std::unique_ptr<Config>> Config::unpack_config(Ref<vm::CellSlice> config_csr, int mode) {
+  std::unique_ptr<Config> ptr{new Config(mode)};
+  TRY_STATUS(ptr->unpack_wrapped(std::move(config_csr)));
+  return std::move(ptr);
+}
+
+td::Result<std::unique_ptr<Config>> Config::extract_from_key_block(Ref<vm::Cell> key_block_root, int mode) {
+  block::gen::Block::Record blk;
+  block::gen::BlockExtra::Record extra;
+  block::gen::McBlockExtra::Record mc_extra;
+  if (!(tlb::unpack_cell(key_block_root, blk) && tlb::unpack_cell(std::move(blk.extra), extra) &&
+        tlb::unpack_cell(extra.custom->prefetch_ref(), mc_extra) && mc_extra.key_block && mc_extra.config.not_null())) {
+    return td::Status::Error(-400, "cannot unpack extra header of key block to extract configuration");
+  }
+  return block::Config::unpack_config(std::move(mc_extra.config), mode);
+}
+
+td::Result<std::unique_ptr<Config>> Config::extract_from_state(Ref<vm::Cell> mc_state_root, int mode) {
+  gen::ShardStateUnsplit::Record state;
+  gen::McStateExtra::Record extra;
+  if (!(tlb::unpack_cell(mc_state_root, state) && state.global_id &&
+        tlb::unpack_cell(state.custom->prefetch_ref(), extra))) {
+    return td::Status::Error("cannot extract configuration from masterchain state extra information");
+  }
+  return unpack_config(std::move(extra.config), mode);
+}
+
+td::Result<std::unique_ptr<ConfigInfo>> ConfigInfo::extract_config(std::shared_ptr<vm::StaticBagOfCellsDb> static_boc,
+                                                                   int mode) {
+  TRY_RESULT(rc, static_boc->get_root_count());
+  if (rc != 1) {
+    return td::Status::Error(-668, "Masterchain state BoC is invalid");
+  }
+  TRY_RESULT(root, static_boc->get_root_cell(0));
+  return extract_config(std::move(root), mode);
+}
+
+td::Result<std::unique_ptr<ConfigInfo>> ConfigInfo::extract_config(Ref<vm::Cell> mc_state_root, int mode) {
+  if (mc_state_root.is_null()) {
+    return td::Status::Error("configuration state root cell is null");
+  }
+  auto config = std::unique_ptr<ConfigInfo>{new ConfigInfo(std::move(mc_state_root), mode)};
+  TRY_STATUS(config->unpack_wrapped());
+  return std::move(config);
+}
+
+ConfigInfo::ConfigInfo(Ref<vm::Cell> mc_state_root, int _mode) : Config(_mode), state_root(std::move(mc_state_root)) {
+  block_id.root_hash.set_zero();
+  block_id.file_hash.set_zero();
+}
+
+td::Status ConfigInfo::unpack_wrapped() {
+  try {
+    return unpack();
+  } catch (vm::VmError& err) {
+    return td::Status::Error(PSLICE() << "error unpacking block state header and configuration: " << err.get_msg());
+  } catch (vm::VmVirtError& err) {
+    return td::Status::Error(PSLICE() << "virtualization error while unpacking block state header and configuration: "
+                                      << err.get_msg());
+  }
+}
+
+td::Status ConfigInfo::unpack() {
+  gen::ShardStateUnsplit::Record root_info;
+  if (!tlb::unpack_cell(state_root, root_info) || !root_info.global_id) {
+    return td::Status::Error("configuration state root cannot be deserialized");
+  }
+  global_id_ = root_info.global_id;
+  block::ShardId shard_id{root_info.shard_id};
+  block_id.id = ton::BlockId{ton::ShardIdFull(shard_id), (unsigned)root_info.seq_no};
+  block_id.root_hash.set_zero();
+  block_id.file_hash.set_zero();
+  vert_seqno = root_info.vert_seq_no;
+  utime = root_info.gen_utime;
+  lt = root_info.gen_lt;
+  min_ref_mc_seqno_ = root_info.min_ref_mc_seqno;
+  if (!root_info.custom->size_refs()) {
+    return td::Status::Error("state does not have a `custom` field with masterchain configuration");
+  }
+  if (mode & needLibraries) {
+    lib_root_ = root_info.r1.libraries->prefetch_ref();
+    libraries_dict_ = std::make_unique<vm::Dictionary>(lib_root_, 256);
+  }
+  if (mode & needAccountsRoot) {
+    accounts_root = vm::load_cell_slice_ref(root_info.accounts);
+    LOG(DEBUG) << "requested accounts dictionary";
+    accounts_dict = std::make_unique<vm::AugmentedDictionary>(accounts_root, 256, block::tlb::aug_ShardAccounts);
+    LOG(DEBUG) << "accounts dictionary created";
+  }
+  state_extra_root_ = root_info.custom->prefetch_ref();
+  if (!is_masterchain()) {
+    if (mode & (needShardHashes | needValidatorSet | needSpecialSmc | needPrevBlocks | needWorkchainInfo)) {
+      return td::Status::Error("cannot extract masterchain-specific configuration data from a non-masterchain state");
+    }
+    cleanup();
+    return td::Status::OK();
+  }
+  gen::McStateExtra::Record extra_info;
+  if (!tlb::unpack_cell(state_extra_root_, extra_info)) {
+    vm::load_cell_slice(state_extra_root_).print_rec(std::cerr);
+    block::gen::t_McStateExtra.print_ref(std::cerr, state_extra_root_);
+    return td::Status::Error("state extra information is invalid");
+  }
+  gen::ValidatorInfo::Record validator_info;
+  if (!tlb::csr_unpack(extra_info.r1.validator_info, validator_info)) {
+    return td::Status::Error("validator_info in state extra information is invalid");
+  }
+  cc_seqno_ = validator_info.catchain_seqno;
+  nx_cc_updated = validator_info.nx_cc_updated;
+  if ((mode & needShardHashes) && !ShardConfig::unpack(extra_info.shard_hashes)) {
+    return td::Status::Error("cannot unpack Shard configuration");
+  }
+  is_key_state_ = extra_info.r1.after_key_block;
+  if (extra_info.r1.last_key_block->size() > 1) {
+    auto& cs = extra_info.r1.last_key_block.write();
+    block::gen::ExtBlkRef::Record ext_ref;
+    if (!(cs.advance(1) && tlb::unpack_exact(cs, ext_ref))) {
+      return td::Status::Error("cannot unpack last_key_block from masterchain state");
+    }
+    last_key_block_.id = ton::BlockId{ton::masterchainId, ton::shardIdAll, ext_ref.seq_no};
+    last_key_block_.root_hash = ext_ref.root_hash;
+    last_key_block_.file_hash = ext_ref.file_hash;
+    last_key_block_lt_ = ext_ref.end_lt;
+  } else {
+    last_key_block_.invalidate();
+    last_key_block_.id.seqno = 0;
+    last_key_block_lt_ = 0;
+  }
+  // unpack configuration
+  TRY_STATUS(Config::unpack_wrapped(std::move(extra_info.config)));
+  // unpack previous masterchain block collection
+  std::unique_ptr<vm::AugmentedDictionary> prev_blocks_dict =
+      std::make_unique<vm::AugmentedDictionary>(extra_info.r1.prev_blocks, 32, block::tlb::aug_OldMcBlocksInfo);
+  if (block_id.id.seqno) {
+    block::gen::ExtBlkRef::Record extref = {};
+    auto ref = prev_blocks_dict->lookup(td::BitArray<32>::zero());
+    if (!(ref.not_null() && ref.write().advance(1) && tlb::csr_unpack(ref, extref) && !extref.seq_no)) {
+      return td::Status::Error("OldMcBlocks in masterchain state does not contain a valid zero state reference");
+    }
+    zerostate_id_.root_hash = extref.root_hash;
+    zerostate_id_.file_hash = extref.file_hash;
+  } else {
+    zerostate_id_.root_hash.set_zero();
+    zerostate_id_.file_hash.set_zero();
+  }
+  zerostate_id_.workchain = ton::masterchainId;
+  if (mode & needPrevBlocks) {
+    prev_blocks_dict_ = std::move(prev_blocks_dict);
+  }
+  // ...
+  cleanup();
+  return td::Status::OK();
+}
+
+td::Status Config::unpack_wrapped(Ref<vm::CellSlice> config_csr) {
+  try {
+    return unpack(std::move(config_csr));
+  } catch (vm::VmError err) {
+    return td::Status::Error(PSLICE() << "error unpacking masterchain configuration: " << err.get_msg());
+  }
+}
+
+td::Status Config::unpack_wrapped() {
+  try {
+    return unpack();
+  } catch (vm::VmError err) {
+    return td::Status::Error(PSLICE() << "error unpacking masterchain configuration: " << err.get_msg());
+  }
+}
+
+td::Status Config::unpack(Ref<vm::CellSlice> config_cs) {
+  gen::ConfigParams::Record config_params;
+  if (!tlb::csr_unpack(std::move(config_cs), config_params)) {
+    return td::Status::Error("cannot unpack ConfigParams");
+  }
+  config_addr = config_params.config_addr;
+  config_root = std::move(config_params.config);
+  return unpack();
+}
+
+td::Status Config::unpack() {
+  if (config_root.is_null()) {
+    return td::Status::Error("configuration root not set");
+  }
+  config_dict = std::make_unique<vm::Dictionary>(config_root, 32);
+  if (mode & needValidatorSet) {
+    auto vset_res = unpack_validator_set(get_config_param(35, 34));
+    if (vset_res.is_error()) {
+      return vset_res.move_as_error();
+    }
+    cur_validators_ = vset_res.move_as_ok();
+  }
+  if (mode & needSpecialSmc) {
+    LOG(DEBUG) << "needSpecialSmc flag set";
+    auto param = get_config_param(31);
+    if (param.is_null()) {
+      special_smc_dict = std::make_unique<vm::Dictionary>(256);
+    } else {
+      special_smc_dict = std::make_unique<vm::Dictionary>(vm::load_cell_slice_ref(std::move(param)), 256);
+      LOG(DEBUG) << "smc dictionary created";
+    }
+  }
+  if (mode & needWorkchainInfo) {
+    TRY_RESULT(pair, unpack_workchain_list_ext(get_config_param(12)));
+    workchains_ = std::move(pair.first);
+    workchains_dict_ = std::move(pair.second);
+  }
+  if (mode & needCapabilities) {
+    auto cell = get_config_param(8);
+    if (cell.is_null()) {
+      version_ = 0;
+      capabilities_ = 0;
+    } else {
+      block::gen::GlobalVersion::Record gv;
+      if (!tlb::unpack_cell(std::move(cell), gv)) {
+        return td::Status::Error(
+            "cannot extract global blockchain version and capabilities from GlobalVersion in configuration parameter "
+            "#8");
+      }
+      version_ = gv.version;
+      capabilities_ = gv.capabilities;
+    }
+  }
+  // ...
+  return td::Status::OK();
+}
+
+td::Status Config::visit_validator_params() const {
+  {
+    // current validator set
+    TRY_RESULT(vset, unpack_validator_set(get_config_param(34)));
+  }
+  for (int i = 32; i < 38; i++) {
+    // prev/current/next persistent and temporary validator sets
+    auto vs = get_config_param(i);
+    if (vs.not_null()) {
+      TRY_RESULT(vset, unpack_validator_set(std::move(vs)));
+    }
+  }
+  get_catchain_validators_config();
+  return td::Status::OK();
+}
+
+ton::ValidatorSessionConfig Config::get_consensus_config() const {
+  auto cc = get_config_param(29);
+  ton::ValidatorSessionConfig c;
+  block::gen::ConsensusConfig::Record r;
+  if (cc.not_null() && tlb::unpack_cell(cc, r)) {
+    c.catchain_idle_timeout = r.consensus_timeout_ms * 0.001;
+    c.catchain_max_deps = r.catchain_max_deps;
+    c.round_candidates = r.round_candidates;
+    c.next_candidate_delay = r.next_candidate_delay_ms * 0.001;
+    c.round_attempt_duration = r.attempt_duration;
+    c.max_round_attempts = r.fast_attempts;
+    c.max_block_size = r.max_block_bytes;
+    c.max_collated_data_size = r.max_collated_bytes;
+  }
+  return c;
+}
+
+bool Config::foreach_config_param(std::function<bool(int, Ref<vm::Cell>)> scan_func) const {
+  if (!config_dict) {
+    return false;
+  }
+  return config_dict->check_for_each([scan_func](Ref<vm::CellSlice> cs_ref, td::ConstBitPtr key, int n) {
+    return n == 32 && cs_ref.not_null() && cs_ref->size_ext() == 0x10000 &&
+           scan_func((int)key.get_int(n), cs_ref->prefetch_ref());
+  });
+}
+
+std::unique_ptr<vm::Dictionary> ShardConfig::extract_shard_hashes_dict(Ref<vm::Cell> mc_state_root) {
+  gen::ShardStateUnsplit::Record root_info;
+  gen::McStateExtra::Record extra_info;
+  if (mc_state_root.not_null()                       //
+      && tlb::unpack_cell(mc_state_root, root_info)  //
+      && tlb::unpack_cell(root_info.custom->prefetch_ref(), extra_info)) {
+    return std::make_unique<vm::Dictionary>(std::move(extra_info.shard_hashes), 32);
+  } else {
+    return {};
+  }
+}
+
+std::unique_ptr<vm::AugmentedDictionary> ConfigInfo::create_accounts_dict() const {
+  if (mode & needAccountsRoot) {
+    return std::make_unique<vm::AugmentedDictionary>(accounts_root, 256, block::tlb::aug_ShardAccounts);
+  } else {
+    return nullptr;
+  }
+}
+
+const vm::AugmentedDictionary& ConfigInfo::get_accounts_dict() const {
+  return *accounts_dict;
+}
+
+bool ConfigInfo::get_last_key_block(ton::BlockIdExt& blkid, ton::LogicalTime& blklt, bool strict) const {
+  if (strict || !is_key_state_) {
+    blkid = last_key_block_;
+    blklt = last_key_block_lt_;
+  } else {
+    blkid = block_id;
+    blklt = lt;
+  }
+  return blkid.is_valid();
+}
+
+td::Result<std::pair<WorkchainSet, std::unique_ptr<vm::Dictionary>>> Config::unpack_workchain_list_ext(
+    Ref<vm::Cell> root) {
+  if (root.is_null()) {
+    LOG(DEBUG) << "workchain description dictionary is empty (no configuration parameter #12)";
+    return std::make_pair(WorkchainSet{}, std::make_unique<vm::Dictionary>(32));
+  } else {
+    auto wc_dict = std::make_unique<vm::Dictionary>(vm::load_cell_slice_ref(std::move(root)), 32);
+    WorkchainSet wc_list;
+    LOG(DEBUG) << "workchain description dictionary created";
+    if (!(wc_dict->check_for_each([&wc_list](Ref<vm::CellSlice> cs_ref, td::ConstBitPtr key, int n) -> bool {
+          ton::WorkchainId wc = ton::WorkchainId(key.get_int(32));
+          Ref<WorkchainInfo> wc_info{true};
+          return wc_info.unique_write().unpack(wc, cs_ref.write()) && wc_list.emplace(wc, std::move(wc_info)).second;
+        }))) {
+      return td::Status::Error("cannot unpack WorkchainDescr from masterchain configuration");
+    }
+    return std::make_pair(std::move(wc_list), std::move(wc_dict));
+  }
+}
+
+td::Result<WorkchainSet> Config::unpack_workchain_list(Ref<vm::Cell> root) {
+  TRY_RESULT(pair, unpack_workchain_list_ext(std::move(root)));
+  return std::move(pair.first);
+}
+
+td::Result<std::unique_ptr<ValidatorSet>> Config::unpack_validator_set(Ref<vm::Cell> vset_root) {
+  if (vset_root.is_null()) {
+    return td::Status::Error("validator set is absent");
+  }
+  gen::ValidatorSet::Record rec;
+  if (!tlb::unpack_cell(std::move(vset_root), rec)) {
+    return td::Status::Error("validator set is invalid");
+  }
+  vm::Dictionary dict{vm::Dictionary::construct_root_from(*rec.list), 16};
+  td::BitArray<16> key_buffer;
+  auto last = dict.get_minmax_key(key_buffer.bits(), 16, true);
+  if (last.is_null() || (int)key_buffer.to_ulong() != rec.total - 1) {
+    return td::Status::Error(
+        "maximal index in a validator set dictionary must be one less than the total number of validators");
+  }
+  auto ptr = std::make_unique<ValidatorSet>(rec.utime_since, rec.utime_until, rec.total, rec.main);
+  for (int i = 0; i < rec.total; i++) {
+    key_buffer.store_ulong(i);
+    auto descr_cs = dict.lookup(key_buffer.bits(), 16);
+    if (descr_cs.is_null()) {
+      return td::Status::Error("indices in a validator set dictionary must be integers 0..total-1");
+    }
+    gen::ValidatorDescr::Record_validator_addr descr;
+    if (!tlb::csr_unpack(descr_cs, descr)) {
+      descr.adnl_addr.set_zero();
+      if (!(gen::t_ValidatorDescr.unpack_validator(descr_cs.write(), descr.public_key, descr.weight) &&
+            descr_cs->empty_ext())) {
+        return td::Status::Error(PSLICE() << "validator #" << i
+                                          << " has an invalid ValidatorDescr record in the validator set dictionary");
+      }
+    }
+    gen::SigPubKey::Record sig_pubkey;
+    if (!tlb::csr_unpack(std::move(descr.public_key), sig_pubkey)) {
+      return td::Status::Error(PSLICE() << "validator #" << i
+                                        << " has no public key or its public key is in unsupported format");
+    }
+    if (!descr.weight) {
+      return td::Status::Error(PSLICE() << "validator #" << i << " has zero weight");
+    }
+    if (descr.weight > ~(ptr->total_weight)) {
+      return td::Status::Error("total weight of all validators in validator set exceeds 2^64");
+    }
+    ptr->list.emplace_back(sig_pubkey.pubkey, descr.weight, ptr->total_weight, descr.adnl_addr);
+    ptr->total_weight += descr.weight;
+  }
+  return std::move(ptr);
+}
+
+bool Config::set_block_id_ext(const ton::BlockIdExt& block_id_ext) {
+  if (block_id.id == block_id_ext.id) {
+    block_id = block_id_ext;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+bool ConfigInfo::set_block_id_ext(const ton::BlockIdExt& block_id_ext) {
+  if (!Config::set_block_id_ext(block_id_ext)) {
+    return false;
+  }
+  if (!block_id.seqno()) {
+    zerostate_id_.workchain = ton::masterchainId;
+    zerostate_id_.root_hash = block_id_ext.root_hash;
+    zerostate_id_.file_hash = block_id_ext.file_hash;
+  }
+  reset_mc_hash();
+  return true;
+}
+
+void ConfigInfo::cleanup() {
+  if (!(mode & needStateRoot)) {
+    state_root.clear();
+  }
+  if (!(mode & needStateExtraRoot)) {
+    state_extra_root_.clear();
+  }
+}
+
+Ref<vm::Cell> Config::get_config_param(int idx) const {
+  if (!config_dict) {
+    return {};
+  }
+  return config_dict->lookup_ref(td::BitArray<32>{idx});
+}
+
+Ref<vm::Cell> Config::get_config_param(int idx, int idx2) const {
+  if (!config_dict) {
+    return {};
+  }
+  auto res = config_dict->lookup_ref(td::BitArray<32>{idx});
+  if (res.not_null()) {
+    return res;
+  } else {
+    return config_dict->lookup_ref(td::BitArray<32>{idx2});
+  }
+}
+
+td::Result<std::unique_ptr<BlockLimits>> Config::get_block_limits(bool is_masterchain) const {
+  int param = (is_masterchain ? 22 : 23);
+  auto cell = get_config_param(param);
+  if (cell.is_null()) {
+    return td::Status::Error(PSTRING() << "configuration parameter " << param << " with block limits is absent");
+  }
+  auto cs = vm::load_cell_slice(std::move(cell));
+  auto ptr = std::make_unique<BlockLimits>();
+  if (!ptr->deserialize(cs) || cs.size_ext()) {
+    return td::Status::Error(PSTRING() << "cannot deserialize BlockLimits obtained from configuration parameter "
+                                       << param);
+  }
+  return std::move(ptr);
+}
+
+td::Result<std::vector<StoragePrices>> Config::get_storage_prices() const {
+  auto cell = get_config_param(18);
+  std::vector<StoragePrices> res;
+  if (cell.is_null()) {
+    return td::Status::Error("configuration parameter 18 with storage prices dictionary is absent");
+  }
+  vm::Dictionary dict{std::move(cell), 32};
+  if (!dict.check_for_each([&res](Ref<vm::CellSlice> cs_ref, td::ConstBitPtr key, int n) -> bool {
+        block::gen::StoragePrices::Record data;
+        if (!tlb::csr_unpack(std::move(cs_ref), data) || data.utime_since != key.get_uint(n)) {
+          return false;
+        }
+        res.emplace_back(data.utime_since, data.bit_price_ps, data.cell_price_ps, data.mc_bit_price_ps,
+                         data.mc_cell_price_ps);
+        return true;
+      })) {
+    return td::Status::Error("invalid storage prices dictionary in configuration parameter 18");
+  }
+  return std::move(res);
+}
+
+CatchainValidatorsConfig Config::unpack_catchain_validators_config(Ref<vm::Cell> cell) {
+  block::gen::CatchainConfig::Record cfg;
+  if (cell.is_null() || !tlb::unpack_cell(std::move(cell), cfg)) {
+    return {default_mc_catchain_lifetime, default_shard_catchain_lifetime, default_shard_validators_lifetime,
+            default_shard_validators_num};
+  } else {
+    return {cfg.mc_catchain_lifetime, cfg.shard_catchain_lifetime, cfg.shard_validators_lifetime,
+            cfg.shard_validators_num};
+  }
+}
+
+CatchainValidatorsConfig Config::get_catchain_validators_config() const {
+  return unpack_catchain_validators_config(get_config_param(28));
+}
+
+// compares all fields except fsm*, before_merge_, nx_cc_updated_, next_catchain_seqno_
+bool McShardHash::basic_info_equal(const McShardHash& other, bool compare_fees, bool compare_reg_seqno) const {
+  return blk_ == other.blk_ && start_lt_ == other.start_lt_ && end_lt_ == other.end_lt_ &&
+         (!compare_reg_seqno || reg_mc_seqno_ == other.reg_mc_seqno_) && gen_utime_ == other.gen_utime_ &&
+         min_ref_mc_seqno_ == other.min_ref_mc_seqno_ && before_split_ == other.before_split_ &&
+         want_split_ == other.want_split_ && want_merge_ == other.want_merge_ &&
+         (!compare_fees || (fees_collected_ == other.fees_collected_ && funds_created_ == other.funds_created_));
+}
+
+void McShardHash::set_fsm(FsmState fsm, ton::UnixTime fsm_utime, ton::UnixTime fsm_interval) {
+  fsm_ = fsm;
+  fsm_utime_ = fsm_utime;
+  fsm_interval_ = fsm_interval;
+}
+
+Ref<McShardHash> McShardHash::unpack(vm::CellSlice& cs, ton::ShardIdFull id) {
+  gen::ShardDescr::Record descr;
+  CurrencyCollection fees_collected, funds_created;
+  if (!(tlb::unpack_exact(cs, descr) && fees_collected.unpack(descr.fees_collected) &&
+        funds_created.unpack(descr.funds_created))) {
+    return {};  // throw ?
+  }
+  auto res = Ref<McShardHash>(true, ton::BlockId{id, (unsigned)descr.seq_no}, descr.start_lt, descr.end_lt,
+                              descr.gen_utime, descr.root_hash, descr.file_hash, fees_collected, funds_created,
+                              descr.reg_mc_seqno, descr.min_ref_mc_seqno, descr.next_catchain_seqno,
+                              descr.next_validator_shard, /* descr.nx_cc_updated */ false, descr.before_split,
+                              descr.before_merge, descr.want_split, descr.want_merge);
+  McShardHash& sh = res.unique_write();
+  switch (gen::t_FutureSplitMerge.get_tag(*(descr.split_merge_at))) {
+    case gen::FutureSplitMerge::fsm_none:
+      return res;
+    case gen::FutureSplitMerge::fsm_split:
+      if (gen::t_FutureSplitMerge.unpack_fsm_split(descr.split_merge_at.write(), sh.fsm_utime_, sh.fsm_interval_)) {
+        sh.fsm_ = FsmState::fsm_split;
+        return res;
+      }
+      break;
+    case gen::FutureSplitMerge::fsm_merge:
+      if (gen::t_FutureSplitMerge.unpack_fsm_merge(descr.split_merge_at.write(), sh.fsm_utime_, sh.fsm_interval_)) {
+        sh.fsm_ = FsmState::fsm_merge;
+        return res;
+      }
+      break;
+    default:
+      break;
+  }
+  return {};
+}
+
+bool McShardHash::pack(vm::CellBuilder& cb) const {
+  if (!(is_valid()                                        // (validate)
+        && cb.store_long_bool(11, 4)                      // shard_descr#b
+        && cb.store_long_bool(blk_.id.seqno, 32)          // seq_no:uint32
+        && cb.store_long_bool(reg_mc_seqno_, 32)          // reg_mc_seqno:uint32
+        && cb.store_long_bool(start_lt_, 64)              // start_lt:uint64
+        && cb.store_long_bool(end_lt_, 64)                // end_lt:uint64
+        && cb.store_bits_bool(blk_.root_hash)             // root_hash:bits256
+        && cb.store_bits_bool(blk_.file_hash)             // file_hash:bits256
+        && cb.store_bool_bool(before_split_)              // before_split:Bool
+        && cb.store_bool_bool(before_merge_)              // before_merge:Bool
+        && cb.store_bool_bool(want_split_)                // want_split:Bool
+        && cb.store_bool_bool(want_merge_)                // want_merge:Bool
+        && cb.store_bool_bool(false)                      // nx_cc_updated:Bool
+        && cb.store_long_bool(0, 3)                       // flags:(## 3) { flags = 0 }
+        && cb.store_long_bool(next_catchain_seqno_, 32)   // next_catchain_seqno:uint32
+        && cb.store_long_bool(next_validator_shard_, 64)  // next_validator_shard:uint64
+        && cb.store_long_bool(min_ref_mc_seqno_, 32)      // min_ref_mc_seqno:uint32
+        && cb.store_long_bool(gen_utime_, 32)             // gen_utime:uint32
+        )) {
+    return false;
+  }
+  bool ok;
+  switch (fsm_) {  // split_merge_at:FutureSplitMerge
+    case FsmState::fsm_none:
+      ok = gen::t_FutureSplitMerge.pack_fsm_none(cb);
+      break;
+    case FsmState::fsm_split:
+      ok = gen::t_FutureSplitMerge.pack_fsm_split(cb, fsm_utime_, fsm_interval_);
+      break;
+    case FsmState::fsm_merge:
+      ok = gen::t_FutureSplitMerge.pack_fsm_merge(cb, fsm_utime_, fsm_interval_);
+      break;
+    default:
+      return false;
+  }
+  return ok                                    // split_merge_at:FutureSplitMerge
+         && fees_collected_.store_or_zero(cb)  // fees_collected:CurrencyCollection
+         && funds_created_.store_or_zero(cb);  // funds_created:CurrencyCollection = ShardDescr;
+}
+
+Ref<McShardHash> McShardHash::from_block(Ref<vm::Cell> block_root, const ton::FileHash& fhash, bool init_fees) {
+  if (block_root.is_null()) {
+    return {};
+  }
+  block::gen::Block::Record rec;
+  block::gen::BlockInfo::Record info;
+  block::ShardId shard;
+  if (!(tlb::unpack_cell(block_root, rec) && tlb::unpack_cell(rec.info, info) &&
+        shard.deserialize(info.shard.write()))) {
+    return {};
+  }
+  ton::RootHash rhash = block_root->get_hash().bits();
+  CurrencyCollection fees_collected, funds_created;
+  if (init_fees) {
+    block::gen::ValueFlow::Record flow;
+    if (!(tlb::unpack_cell(rec.value_flow, flow) && fees_collected.unpack(flow.fees_collected) &&
+          funds_created.unpack(flow.r2.created))) {
+      return {};
+    }
+  }
+  return Ref<McShardHash>(true, ton::BlockId{ton::ShardIdFull(shard), (unsigned)info.seq_no}, info.start_lt,
+                          info.end_lt, info.gen_utime, rhash, fhash, fees_collected, funds_created, ~0U,
+                          info.min_ref_mc_seqno, info.gen_catchain_seqno, shard.shard_pfx, false, info.before_split,
+                          false, info.want_split, info.want_merge);
+}
+
+McShardDescr::McShardDescr(const McShardDescr& other)
+    : McShardHash(other)
+    , block_root(other.block_root)
+    , state_root(other.state_root)
+    , processed_upto(other.processed_upto) {
+  set_queue_root(other.outmsg_root);
+}
+
+McShardDescr& McShardDescr::operator=(const McShardDescr& other) {
+  McShardHash::operator=(other);
+  block_root = other.block_root;
+  outmsg_root = other.outmsg_root;
+  processed_upto = other.processed_upto;
+  set_queue_root(other.outmsg_root);
+  return *this;
+}
+
+Ref<McShardDescr> McShardDescr::from_block(Ref<vm::Cell> block_root, Ref<vm::Cell> state_root,
+                                           const ton::FileHash& fhash, bool init_fees) {
+  if (block_root.is_null()) {
+    return {};
+  }
+  block::gen::Block::Record rec;
+  block::gen::BlockInfo::Record info;
+  block::ShardId shard;
+  if (!(tlb::unpack_cell(block_root, rec) && tlb::unpack_cell(rec.info, info) &&
+        shard.deserialize(info.shard.write()))) {
+    return {};
+  }
+  // TODO: use a suitable vm::MerkleUpdate method here
+  vm::CellSlice cs(vm::NoVm(), rec.state_update);
+  if (cs.special_type() != vm::Cell::SpecialType::MerkleUpdate) {
+    LOG(ERROR) << "state update in a block is not a Merkle update";
+    return {};
+  }
+  if (cs.size_refs() != 2 || cs.prefetch_ref(1)->get_hash(0) != state_root->get_hash()) {
+    LOG(ERROR) << "invalid Merkle update for block state : resulting state hash mismatch";
+    return {};
+  }
+  ton::RootHash rhash = block_root->get_hash().bits();
+  CurrencyCollection fees_collected, funds_created;
+  if (init_fees) {
+    block::gen::ValueFlow::Record flow;
+    if (!(tlb::unpack_cell(rec.value_flow, flow) && fees_collected.unpack(flow.fees_collected) &&
+          funds_created.unpack(flow.r2.created))) {
+      return {};
+    }
+  }
+  auto res = Ref<McShardDescr>(true, ton::BlockId{ton::ShardIdFull(shard), (unsigned)info.seq_no}, info.start_lt,
+                               info.end_lt, info.gen_utime, rhash, fhash, fees_collected, funds_created, ~0U,
+                               info.min_ref_mc_seqno, info.gen_catchain_seqno, shard.shard_pfx, false,
+                               info.before_split, false, info.want_split, info.want_merge);
+  auto& descr = res.unique_write();
+  descr.block_root = std::move(block_root);
+  descr.state_root = std::move(state_root);
+  return res;
+}
+
+Ref<McShardDescr> McShardDescr::from_state(ton::BlockIdExt blkid, Ref<vm::Cell> state_root) {
+  if (state_root.is_null()) {
+    return {};
+  }
+  block::gen::ShardStateUnsplit::Record info;
+  block::gen::OutMsgQueueInfo::Record qinfo;
+  block::ShardId shard;
+  if (!(tlb::unpack_cell(state_root, info) && shard.deserialize(info.shard_id.write()) &&
+        tlb::unpack_cell(info.out_msg_queue_info, qinfo))) {
+    LOG(DEBUG) << "cannot create McShardDescr from a shardchain state";
+    return {};
+  }
+  if (ton::ShardIdFull(shard) != ton::ShardIdFull(blkid) || info.seq_no != blkid.seqno()) {
+    LOG(DEBUG) << "shard id mismatch, cannot construct McShardDescr";
+    return {};
+  }
+  auto res = Ref<McShardDescr>(true, blkid.id, info.gen_lt, info.gen_lt, info.gen_utime, blkid.root_hash,
+                               blkid.file_hash, CurrencyCollection{}, CurrencyCollection{}, ~0U, info.min_ref_mc_seqno,
+                               0, shard.shard_pfx, false, info.before_split);
+  res.unique_write().state_root = state_root;
+  res.unique_write().set_queue_root(qinfo.out_queue->prefetch_ref(0));
+  return res;
+}
+
+bool McShardDescr::set_queue_root(Ref<vm::Cell> queue_root) {
+  outmsg_root = std::move(queue_root);
+  out_msg_queue = std::make_unique<vm::AugmentedDictionary>(outmsg_root, 352, block::tlb::aug_OutMsgQueue);
+  return true;
+}
+
+void McShardDescr::disable() {
+  block_root.clear();
+  state_root.clear();
+  outmsg_root.clear();
+  out_msg_queue.reset();
+  processed_upto.reset();
+  McShardHash::disable();
+}
+
+void ConfigInfo::reset_mc_hash() {
+  if (block_id.is_masterchain() && !block_id.root_hash.is_zero()) {
+    // TODO: use block_start_lt instead of lt if available
+    set_mc_hash(Ref<McShardHash>(true, block_id.id, lt, lt, utime, block_id.root_hash, block_id.file_hash));
+  } else {
+    set_mc_hash(Ref<McShardHash>{});
+  }
+}
+
+Ref<vm::CellSlice> ShardConfig::get_root_csr() const {
+  if (!shard_hashes_dict_) {
+    return {};
+  }
+  return shard_hashes_dict_->get_root();
+}
+
+bool ShardConfig::unpack(Ref<vm::Cell> shard_hashes, Ref<McShardHash> mc_shard_hash) {
+  shard_hashes_ = std::move(shard_hashes);
+  mc_shard_hash_ = std::move(mc_shard_hash);
+  return init();
+}
+
+bool ShardConfig::unpack(Ref<vm::CellSlice> shard_hashes, Ref<McShardHash> mc_shard_hash) {
+  shard_hashes_ = shard_hashes->prefetch_ref();
+  mc_shard_hash_ = std::move(mc_shard_hash);
+  return init();
+}
+
+bool ShardConfig::init() {
+  shard_hashes_dict_ = std::make_unique<vm::Dictionary>(shard_hashes_, 32);
+  valid_ = true;
+  return true;
+}
+
+ShardConfig::ShardConfig(const ShardConfig& other)
+    : shard_hashes_(other.shard_hashes_), mc_shard_hash_(other.mc_shard_hash_) {
+  init();
+}
+
+bool ShardConfig::get_shard_hash_raw_from(vm::Dictionary& dict, vm::CellSlice& cs, ton::ShardIdFull id,
+                                          ton::ShardIdFull& true_id, bool exact, Ref<vm::Cell>* leaf) {
+  if (id.is_masterchain() || !id.is_valid()) {
+    return false;
+  }
+  auto root = dict.lookup_ref(td::BitArray<32>{id.workchain});
+  if (root.is_null()) {
+    return false;
+  }
+  unsigned long long z = id.shard, m = std::numeric_limits<unsigned long long>::max();
+  int len = id.pfx_len();
+  while (true) {
+    cs.load(vm::NoVmOrd{}, leaf ? root : std::move(root));
+    int t = (int)cs.fetch_ulong(1);
+    if (t < 0) {
+      return false;  // throw DictError ?
+    } else if (!t) {
+      if (len && exact) {
+        return false;
+      }
+      true_id = ton::ShardIdFull{id.workchain, (id.shard | m) - (m >> 1)};
+      if (leaf) {
+        *leaf = std::move(root);
+      }
+      return true;
+    }
+    if (!len || cs.size_ext() != 0x20000) {
+      return false;  // throw DictError in the second case?
+    }
+    root = cs.prefetch_ref((unsigned)(z >> 63));
+    z <<= 1;
+    --len;
+    m >>= 1;
+  }
+}
+
+bool ShardConfig::get_shard_hash_raw(vm::CellSlice& cs, ton::ShardIdFull id, ton::ShardIdFull& true_id,
+                                     bool exact) const {
+  return shard_hashes_dict_ && get_shard_hash_raw_from(*shard_hashes_dict_, cs, id, true_id, exact);
+}
+
+Ref<McShardHash> ShardConfig::get_shard_hash(ton::ShardIdFull id, bool exact) const {
+  if (id.is_masterchain()) {
+    return (!exact || id.shard == ton::shardIdAll) ? get_mc_hash() : Ref<McShardHash>{};
+  }
+  ton::ShardIdFull true_id;
+  vm::CellSlice cs;
+  if (get_shard_hash_raw(cs, id, true_id, exact)) {
+    // block::gen::t_ShardDescr.print(std::cerr, vm::CellSlice{cs});
+    return McShardHash::unpack(cs, true_id);
+  } else {
+    return {};
+  }
+}
+
+ton::CatchainSeqno ShardConfig::get_shard_cc_seqno(ton::ShardIdFull shard) const {
+  if (shard.is_masterchain() || !shard.is_valid()) {
+    return std::numeric_limits<ton::CatchainSeqno>::max();
+  }
+  ton::ShardIdFull true_id;
+  gen::ShardDescr::Record info;
+  vm::CellSlice cs;
+  if (!(get_shard_hash_raw(cs, shard - 1, true_id, false) &&
+        (ton::shard_is_ancestor(true_id, shard) || ton::shard_is_parent(shard, true_id)) &&
+        tlb::unpack_exact(cs, info))) {
+    return std::numeric_limits<ton::CatchainSeqno>::max();
+  }
+  ton::CatchainSeqno cc_seqno = info.next_catchain_seqno;
+  if (ton::shard_is_ancestor(true_id, shard)) {
+    return cc_seqno;
+  }
+  if (!(get_shard_hash_raw(cs, shard + 1, true_id, false) && ton::shard_is_parent(shard, true_id) &&
+        tlb::unpack_exact(cs, info))) {
+    return std::numeric_limits<ton::CatchainSeqno>::max();
+  }
+  return std::max(cc_seqno, info.next_catchain_seqno) + 1;
+}
+
+ton::LogicalTime ShardConfig::get_shard_end_lt_ext(ton::AccountIdPrefixFull acc, ton::ShardIdFull& actual_shard) const {
+  if (!acc.is_valid()) {
+    actual_shard.workchain = ton::workchainInvalid;
+    return 0;
+  }
+  if (acc.is_masterchain()) {
+    actual_shard = ton::ShardIdFull(ton::masterchainId);
+    CHECK(mc_shard_hash_.not_null());
+    return mc_shard_hash_->end_lt_;
+  }
+  vm::CellSlice cs;
+  unsigned long long end_lt;
+  return get_shard_hash_raw(cs, acc.as_leaf_shard(), actual_shard, false)  // lookup ShardDescr containing acc
+                 && cs.advance(4 + 128)              // shard_descr#b seq_no:uint32 reg_mc_seqno:uint32 start_lt:uint64
+                 && cs.fetch_ulong_bool(64, end_lt)  // end_lt:uint64
+             ? end_lt
+             : 0;
+}
+
+ton::LogicalTime ShardConfig::get_shard_end_lt(ton::AccountIdPrefixFull acc) const {
+  ton::ShardIdFull tmp;
+  return get_shard_end_lt_ext(acc, tmp);
+}
+
+bool ShardConfig::contains(ton::BlockIdExt blkid) const {
+  auto entry = get_shard_hash(blkid.shard_full());
+  return entry.not_null() && entry->blk_ == blkid;
+}
+
+static int process_workchain_shard_hashes(Ref<vm::Cell>& branch, ton::ShardIdFull shard,
+                                          std::function<int(McShardHash&)>& func) {
+  auto cs = vm::load_cell_slice(branch);
+  int f = (int)cs.fetch_ulong(1);
+  if (f == 1) {
+    if ((shard.shard & 1) || cs.size_ext() != 0x20000) {
+      return false;
+    }
+    auto left = cs.prefetch_ref(0), right = cs.prefetch_ref(1);
+    int r = process_workchain_shard_hashes(left, ton::shard_child(shard, true), func);
+    if (r < 0) {
+      return r;
+    }
+    r |= process_workchain_shard_hashes(right, ton::shard_child(shard, false), func);
+    if (r <= 0) {
+      return r;
+    }
+    vm::CellBuilder cb;
+    return cb.store_bool_bool(true) && cb.store_ref_bool(std::move(left)) && cb.store_ref_bool(std::move(right)) &&
+                   cb.finalize_to(branch)
+               ? r
+               : -1;
+  } else if (!f) {
+    auto shard_info = McShardHash::unpack(cs, shard);
+    if (shard_info.is_null()) {
+      return -1;
+    }
+    int r = func(shard_info.write());
+    if (r <= 0) {
+      return r;
+    }
+    vm::CellBuilder cb;
+    return cb.store_bool_bool(false) && shard_info->pack(cb) && cb.finalize_to(branch) ? r : -1;
+  } else {
+    return -1;
+  }
+}
+
+bool ShardConfig::process_shard_hashes(std::function<int(McShardHash&)> func) {
+  if (!shard_hashes_dict_) {
+    return false;
+  }
+  bool ok = true;
+  shard_hashes_dict_->map(
+      [&ok, &func](vm::CellBuilder& cb, Ref<vm::CellSlice> csr, td::ConstBitPtr key, int n) -> bool {
+        Ref<vm::Cell> root;
+        ok = ok && (n == 32) && csr->size_ext() == 0x10000 && std::move(csr)->prefetch_ref_to(root) &&
+             process_workchain_shard_hashes(root, ton::ShardIdFull{(int)key.get_int(32)}, func) >= 0 &&
+             cb.store_ref_bool(std::move(root));
+        return true;
+      });
+  return ok;
+}
+
+static int process_workchain_sibling_shard_hashes(Ref<vm::Cell>& branch, Ref<vm::Cell> sibling, ton::ShardIdFull shard,
+                                                  std::function<int(McShardHash&, const McShardHash*)>& func) {
+  auto cs = vm::load_cell_slice(branch);
+  int f = (int)cs.fetch_ulong(1);
+  if (f == 1) {
+    if ((shard.shard & 1) || cs.size_ext() != 0x20000) {
+      return false;
+    }
+    auto left = cs.prefetch_ref(0), right = cs.prefetch_ref(1);
+    auto orig_left = left;
+    int r = process_workchain_sibling_shard_hashes(left, right, ton::shard_child(shard, true), func);
+    if (r < 0) {
+      return r;
+    }
+    r |= process_workchain_sibling_shard_hashes(right, std::move(orig_left), ton::shard_child(shard, false), func);
+    if (r <= 0) {
+      return r;
+    }
+    vm::CellBuilder cb;
+    return cb.store_bool_bool(true) && cb.store_ref_bool(std::move(left)) && cb.store_ref_bool(std::move(right)) &&
+                   cb.finalize_to(branch)
+               ? r
+               : -1;
+  } else if (!f) {
+    auto shard_info = McShardHash::unpack(cs, shard);
+    if (shard_info.is_null()) {
+      return -1;
+    }
+    Ref<McShardHash> sibling_info;
+    if (sibling.not_null()) {
+      auto cs2 = vm::load_cell_slice(sibling);
+      if (!cs2.fetch_ulong(1)) {
+        sibling_info = McShardHash::unpack(cs2, ton::shard_sibling(shard));
+        if (sibling_info.is_null()) {
+          return -1;
+        }
+      }
+    }
+    int r = func(shard_info.write(), sibling_info.get());
+    if (r <= 0) {
+      return r;
+    }
+    vm::CellBuilder cb;
+    return cb.store_bool_bool(false) && shard_info->pack(cb) && cb.finalize_to(branch) ? r : -1;
+  } else {
+    return -1;
+  }
+}
+
+bool ShardConfig::process_sibling_shard_hashes(std::function<int(McShardHash&, const McShardHash*)> func) {
+  if (!shard_hashes_dict_) {
+    return false;
+  }
+  bool ok = true;
+  shard_hashes_dict_->map([&ok, &func](vm::CellBuilder& cb, Ref<vm::CellSlice> csr, td::ConstBitPtr key,
+                                       int n) -> bool {
+    Ref<vm::Cell> root;
+    ok = ok && (n == 32) && csr->size_ext() == 0x10000 && std::move(csr)->prefetch_ref_to(root) &&
+         process_workchain_sibling_shard_hashes(root, Ref<vm::Cell>{}, ton::ShardIdFull{(int)key.get_int(32)}, func) >=
+             0 &&
+         cb.store_ref_bool(std::move(root));
+    return true;
+  });
+  return ok;
+}
+
+std::vector<ton::BlockId> ShardConfig::get_shard_hash_ids(
+    const std::function<bool(ton::ShardIdFull, bool)>& filter) const {
+  if (!shard_hashes_dict_) {
+    return {};
+  }
+  std::vector<ton::BlockId> res;
+  bool mcout = mc_shard_hash_.is_null() || !mc_shard_hash_->seqno();  // include masterchain as a shard if seqno > 0
+  bool ok = shard_hashes_dict_->check_for_each(
+      [&res, &mcout, mc_shard_hash_ = mc_shard_hash_, &filter ](Ref<vm::CellSlice> cs_ref, td::ConstBitPtr key, int n)
+          ->bool {
+            int workchain = (int)key.get_int(n);
+            if (workchain >= 0 && !mcout) {
+              if (filter(ton::ShardIdFull{ton::masterchainId}, true)) {
+                res.emplace_back(mc_shard_hash_->blk_.id);
+              }
+              mcout = true;
+            }
+            if (!cs_ref->have_refs()) {
+              return false;
+            }
+            std::stack<std::pair<Ref<vm::Cell>, unsigned long long>> stack;
+            stack.emplace(cs_ref->prefetch_ref(), ton::shardIdAll);
+            while (!stack.empty()) {
+              vm::CellSlice cs{vm::NoVm{}, std::move(stack.top().first)};
+              unsigned long long shard = stack.top().second;
+              stack.pop();
+              int t = (int)cs.fetch_ulong(1);
+              if (t < 0) {
+                return false;
+              }
+              if (!filter(ton::ShardIdFull{workchain, shard}, !t)) {
+                continue;
+              }
+              if (!t) {
+                if (!(cs.advance(4) && cs.have(32))) {
+                  return false;
+                }
+                res.emplace_back(workchain, shard, (int)cs.prefetch_ulong(32));
+                continue;
+              }
+              unsigned long long delta = (td::lower_bit64(shard) >> 1);
+              if (!delta || cs.size_ext() != 0x20000) {
+                return false;
+              }
+              stack.emplace(cs.prefetch_ref(1), shard + delta);
+              stack.emplace(cs.prefetch_ref(0), shard - delta);
+            }
+            return true;
+          },
+      true);
+  if (!ok) {
+    return {};
+  }
+  if (!mcout && filter(ton::ShardIdFull{ton::masterchainId}, true)) {
+    res.emplace_back(mc_shard_hash_->blk_.id);
+  }
+  return res;
+}
+
+std::vector<ton::BlockId> ShardConfig::get_shard_hash_ids(bool skip_mc) const {
+  return get_shard_hash_ids(
+      [skip_mc](ton::ShardIdFull shard, bool) -> bool { return !(skip_mc && shard.is_masterchain()); });
+}
+
+std::vector<ton::BlockId> ShardConfig::get_intersecting_shard_hash_ids(ton::ShardIdFull myself) const {
+  return get_shard_hash_ids(
+      [myself](ton::ShardIdFull shard, bool) -> bool { return ton::shard_intersects(myself, shard); });
+}
+
+std::vector<ton::BlockId> ShardConfig::get_neighbor_shard_hash_ids(ton::ShardIdFull myself) const {
+  return get_shard_hash_ids([myself](ton::ShardIdFull shard, bool) -> bool { return is_neighbor(myself, shard); });
+}
+
+std::vector<ton::BlockId> ShardConfig::get_proper_neighbor_shard_hash_ids(ton::ShardIdFull myself) const {
+  return get_shard_hash_ids([myself](ton::ShardIdFull shard, bool leaf) -> bool {
+    return is_neighbor(myself, shard) && !(leaf && ton::shard_intersects(myself, shard));
+  });
+}
+
+bool ShardConfig::is_neighbor(ton::ShardIdFull x, ton::ShardIdFull y) {
+  if (x.is_masterchain() || y.is_masterchain()) {
+    return true;
+  }
+  unsigned long long xs = x.shard, ys = y.shard;
+  unsigned long long xl = td::lower_bit64(xs), yl = td::lower_bit64(ys);
+  unsigned long long z = (xs ^ ys) & td::bits_negate64(std::max(xl, yl) << 1);
+  if (!z) {
+    return true;
+  }
+  if (x.workchain != y.workchain) {
+    return false;
+  }
+  int c1 = (td::count_leading_zeroes_non_zero64(z) >> 2);
+  int c2 = (td::count_trailing_zeroes_non_zero64(z) >> 2);
+  return c1 + c2 == 15;
+}
+
+bool ShardConfig::has_workchain(ton::WorkchainId workchain) const {
+  return shard_hashes_dict_ && shard_hashes_dict_->key_exists(td::BitArray<32>{workchain});
+}
+
+std::vector<ton::WorkchainId> ShardConfig::get_workchains() const {
+  if (!shard_hashes_dict_) {
+    return {};
+  }
+  std::vector<ton::WorkchainId> res;
+  if (!shard_hashes_dict_->check_for_each([&res](Ref<vm::CellSlice> val, td::ConstBitPtr key, int n) {
+        CHECK(n == 32);
+        ton::WorkchainId w = (int)key.get_int(32);
+        res.push_back(w);
+        return true;
+      })) {
+    return {};
+  }
+  return res;
+}
+
+bool ShardConfig::new_workchain(ton::WorkchainId workchain, ton::BlockSeqno reg_mc_seqno,
+                                const ton::RootHash& zerostate_root_hash, const ton::FileHash& zerostate_file_hash) {
+  if (!shard_hashes_dict_ || has_workchain(workchain)) {
+    return false;
+  }
+  vm::CellBuilder cb;
+  Ref<vm::Cell> cell;
+  return cb.store_long_bool(11, 1 + 4)               // bt_leaf$0 ; shard_descr#b
+         && cb.store_zeroes_bool(32)                 // seq_no:uint32
+         && cb.store_long_bool(reg_mc_seqno, 32)     // reg_mc_seqno:uint32
+         && cb.store_zeroes_bool(64 * 2)             // start_lt:uint64 end_lt:uint64
+         && cb.store_bits_bool(zerostate_root_hash)  // root_hash:bits256
+         && cb.store_bits_bool(zerostate_file_hash)  // file_hash:bits256
+         && cb.store_long_bool(0, 8)                 // ... nx_cc_updated:Bool ...
+         && cb.store_long_bool(0, 32)                // next_catchain_seqno:uint32
+         && cb.store_long_bool(1ULL << 63, 64)       // next_validator_shard:uint64
+         && cb.store_long_bool(~0U, 32)              // min_ref_mc_seqno:uint32
+         && cb.store_long_bool(0, 32)                // gen_utime:uint32
+         &&
+         cb.store_zeroes_bool(
+             1 + 5 +
+             5)  // split_merge_at:FutureSplitMerge fees_collected:CurrencyCollection funds_created:CurrencyCollection
+         && cb.finalize_to(cell) && block::gen::t_BinTree_ShardDescr.validate_ref(cell) &&
+         shard_hashes_dict_->set_ref(td::BitArray<32>{workchain}, std::move(cell), vm::Dictionary::SetMode::Add);
+}
+
+td::Result<bool> ShardConfig::may_update_shard_block_info(Ref<McShardHash> new_info,
+                                                          const std::vector<ton::BlockIdExt>& old_blkids,
+                                                          ton::LogicalTime lt_limit, Ref<McShardHash>* ancestor) const {
+  if (!shard_hashes_dict_) {
+    return td::Status::Error(-666, "no shard top block dictionary present");
+  }
+  if (new_info.is_null()) {
+    return td::Status::Error(-666, "suggested new top shard block info is empty");
+  }
+  if (!new_info->is_valid()) {
+    return td::Status::Error(-666, "new top shard block description is invalid");
+  }
+  auto wc = new_info->shard().workchain;
+  if (wc == ton::workchainInvalid || wc == ton::masterchainId) {
+    return td::Status::Error(-666, "new top shard block description belongs to an invalid workchain");
+  }
+  if (!has_workchain(wc)) {
+    return td::Status::Error(-666, "new top shard block belongs to an unknown or disabled workchain");
+  }
+  if (old_blkids.size() != 1 && old_blkids.size() != 2) {
+    return td::Status::Error(-666, "must have either one or two start blocks in a top shard block update");
+  }
+  bool before_split = ton::shard_is_parent(old_blkids[0].shard_full(), new_info->shard());
+  bool before_merge = (old_blkids.size() == 2);
+  if (before_merge) {
+    if (!ton::shard_is_sibling(old_blkids[0].shard_full(), old_blkids[1].shard_full())) {
+      return td::Status::Error(-666, "the two start blocks of a top shard block update must be siblings");
+    }
+    if (!ton::shard_is_parent(new_info->shard(), old_blkids[0].shard_full())) {
+      return td::Status::Error(
+          -666,
+          std::string{"the two start blocks of a top shard block update do not merge into expected final shard "} +
+              old_blkids[0].shard_full().to_str());
+    }
+  } else if (new_info->shard() != old_blkids[0].shard_full() && !before_split) {
+    return td::Status::Error(
+        -666, "the start block of a top shard block update must either coincide with the final shard or be its parent");
+  }
+  if (ancestor) {
+    ancestor->clear();
+  }
+  ton::CatchainSeqno old_cc_seqno = 0;
+  for (const auto& ob : old_blkids) {
+    auto odef = get_shard_hash(ob.shard_full());
+    if (odef.is_null() || odef->blk_ != ob) {
+      return td::Status::Error(-666,
+                               std::string{"the start block "} + ob.to_str() +
+                                   " of a top shard block update is not contained in the previous shard configuration");
+    }
+    old_cc_seqno = std::max(old_cc_seqno, odef->next_catchain_seqno_);
+    if (shards_updated_.find(ob.shard_full()) != shards_updated_.end()) {
+      return td::Status::Error(
+          -666, std::string{"the shard of the start block "} + ob.to_str() +
+                    " of a top shard block update has been already updated in the current shard configuration");
+    }
+    if (odef->before_split_ != before_split) {
+      return td::Status::Error(
+          -666, PSTRING() << "the shard of the start block " << ob.to_str()
+                          << " had before_split=" << odef->before_split_
+                          << " but the top shard block update is valid only if before_split=" << before_split);
+    }
+    if (odef->before_merge_ != before_merge) {
+      return td::Status::Error(
+          -666, PSTRING() << "the shard of the start block " << ob.to_str()
+                          << " had before_merge=" << odef->before_merge_
+                          << " but the top shard block update is valid only if before_merge=" << before_merge);
+    }
+    if (new_info->before_split_) {
+      if (before_merge || before_split) {
+        return td::Status::Error(
+            -666, PSTRING() << "cannot register a before-split block " << new_info->top_block_id().to_str()
+                            << " at the end of a chain that itself starts with a split/merge event");
+      }
+      if (odef->fsm_state() != block::McShardHash::FsmState::fsm_split) {
+        return td::Status::Error(-666, PSTRING() << "cannot register a before-split block "
+                                                 << new_info->top_block_id().to_str()
+                                                 << " because fsm_split state was not set for this shard beforehand");
+      }
+      if (new_info->gen_utime_ < odef->fsm_utime_ || new_info->gen_utime_ >= odef->fsm_utime_ + odef->fsm_interval_) {
+        return td::Status::Error(-666, PSTRING() << "cannot register a before-split block "
+                                                 << new_info->top_block_id().to_str()
+                                                 << " because fsm_split state was enabled for unixtime "
+                                                 << odef->fsm_utime_ << " .. " << odef->fsm_utime_ + odef->fsm_interval_
+                                                 << " but the block is generated at " << new_info->gen_utime_);
+      }
+    }
+    if (before_merge) {
+      if (odef->fsm_state() != block::McShardHash::FsmState::fsm_merge) {
+        return td::Status::Error(-666, PSTRING() << "cannot register merged block " << new_info->top_block_id().to_str()
+                                                 << " because fsm_merge state was not set for shard "
+                                                 << odef->top_block_id().shard_full().to_str() << " beforehand");
+      }
+      if (new_info->gen_utime_ < odef->fsm_utime_ || new_info->gen_utime_ >= odef->fsm_utime_ + odef->fsm_interval_) {
+        return td::Status::Error(-666, PSTRING() << "cannot register merged block " << new_info->top_block_id().to_str()
+                                                 << " because fsm_merge state was enabled for shard "
+                                                 << odef->top_block_id().shard_full().to_str() << " for unixtime "
+                                                 << odef->fsm_utime_ << " .. " << odef->fsm_utime_ + odef->fsm_interval_
+                                                 << " but the block is generated at " << new_info->gen_utime_);
+      }
+    }
+    if (ancestor && !before_merge && !before_split) {
+      *ancestor = odef;
+    }
+  }
+  if (old_cc_seqno + before_merge != new_info->next_catchain_seqno_) {
+    return td::Status::Error(-666, PSTRING()
+                                       << "the top shard block update is generated with catchain_seqno="
+                                       << new_info->next_catchain_seqno_ << " but previous shard configuration expects "
+                                       << old_cc_seqno + before_merge);
+  }
+  if (new_info->end_lt_ >= lt_limit) {
+    return td::Status::Error(-666, PSTRING() << "the top shard block update has end_lt " << new_info->end_lt_
+                                             << " which is larger than the current limit " << lt_limit);
+  }
+  return !before_split;
+}
+
+td::Result<bool> ShardConfig::update_shard_block_info(Ref<McShardHash> new_info,
+                                                      const std::vector<ton::BlockIdExt>& old_blkids) {
+  Ref<McShardHash> ancestor;
+  auto res = may_update_shard_block_info(new_info, old_blkids, ~0ULL, &ancestor);
+  if (res.is_error()) {
+    return res;
+  }
+  if (!res.move_as_ok()) {
+    return td::Status::Error(-666, std::string{"cannot apply the after-split update for "} + new_info->blk_.to_str() +
+                                       " without a corresponding sibling update");
+  }
+  if (ancestor.not_null() && ancestor->fsm_ != McShardHash::FsmState::fsm_none) {
+    new_info.write().set_fsm(ancestor->fsm_, ancestor->fsm_utime_, ancestor->fsm_interval_);
+  }
+  auto blk = new_info->blk_;
+  bool ok = do_update_shard_info(std::move(new_info));
+  if (!ok) {
+    return td::Status::Error(
+        -666,
+        std::string{
+            "unknown serialization error for (BinTree ShardDescr) while updating shard configuration to include "} +
+            blk.to_str());
+  } else {
+    return true;
+  }
+}
+
+td::Result<bool> ShardConfig::update_shard_block_info2(Ref<McShardHash> new_info1, Ref<McShardHash> new_info2,
+                                                       const std::vector<ton::BlockIdExt>& old_blkids) {
+  auto res1 = may_update_shard_block_info(new_info1, old_blkids);
+  if (res1.is_error()) {
+    return res1;
+  }
+  auto res2 = may_update_shard_block_info(new_info2, old_blkids);
+  if (res2.is_error()) {
+    return res2;
+  }
+  if (res1.move_as_ok() || res2.move_as_ok()) {
+    return td::Status::Error(-666, "the two updates in update_shard_block_info2 must follow a shard split event");
+  }
+  if (new_info1->blk_.id.shard > new_info2->blk_.id.shard) {
+    std::swap(new_info1, new_info2);
+  }
+  auto blk1 = new_info1->blk_, blk2 = new_info2->blk_;
+  bool ok = do_update_shard_info2(std::move(new_info1), std::move(new_info2));
+  if (!ok) {
+    return td::Status::Error(
+        -666,
+        std::string{
+            "unknown serialization error for (BinTree ShardDescr) while updating shard configuration to include "} +
+            blk1.to_str() + " and " + blk2.to_str());
+  } else {
+    return true;
+  }
+}
+
+bool ShardConfig::do_update_shard_info(Ref<McShardHash> new_info) {
+  vm::CellBuilder cb;
+  Ref<vm::Cell> ref;
+  return new_info.not_null() && cb.store_bool_bool(false)  // bt_leaf$0
+         && new_info->pack(cb)                             // leaf:ShardDescr
+         && cb.finalize_to(ref) && set_shard_info(new_info->shard(), std::move(ref));
+}
+
+bool ShardConfig::do_update_shard_info2(Ref<McShardHash> new_info1, Ref<McShardHash> new_info2) {
+  if (new_info1.is_null() || new_info2.is_null() || !ton::shard_is_sibling(new_info1->shard(), new_info2->shard())) {
+    return false;
+  }
+  if (new_info1->blk_.id.shard > new_info2->blk_.id.shard) {
+    std::swap(new_info1, new_info2);
+  }
+  vm::CellBuilder cb, cb1;
+  Ref<vm::Cell> ref;
+  return cb.store_bool_bool(true)              // bt_node$1
+         && cb1.store_bool_bool(false)         // ( bt_leaf$0
+         && new_info1->pack(cb1)               //   leaf:ShardDescr
+         && cb1.finalize_to(ref)               // ) -> ref
+         && cb.store_ref_bool(std::move(ref))  // left:^(BinTree ShardDescr)
+         && cb1.store_bool_bool(false)         // ( bt_leaf$0
+         && new_info2->pack(cb1)               //   leaf:ShardDescr
+         && cb1.finalize_to(ref)               // ) -> ref
+         && cb.store_ref_bool(std::move(ref))  // right:^(BinTree ShardDescr)
+         && cb.finalize_to(ref) && set_shard_info(ton::shard_parent(new_info1->shard()), std::move(ref));
+}
+
+static bool btree_set(Ref<vm::Cell>& root, ton::ShardId shard, Ref<vm::Cell> value) {
+  if (!shard) {
+    return false;
+  }
+  if (shard == ton::shardIdAll) {
+    root = value;
+    return true;
+  }
+  auto cs = vm::load_cell_slice(std::move(root));
+  if (cs.size_ext() != 0x20001 || cs.prefetch_ulong(1) != 1) {
+    return false;  // branch does not exist
+  }
+  Ref<vm::Cell> left = cs.prefetch_ref(0), right = cs.prefetch_ref(1);
+  if (!(btree_set(shard & (1ULL << 63) ? right : left, shard << 1, std::move(value)))) {
+    return false;
+  }
+  vm::CellBuilder cb;
+  return cb.store_bool_bool(true)                // bt_node$1
+         && cb.store_ref_bool(std::move(left))   // left:^(BinTree ShardDescr)
+         && cb.store_ref_bool(std::move(right))  // right:^(BinTree ShardDescr)
+         && cb.finalize_to(root);                // = BinTree ShardDescr
+}
+
+bool ShardConfig::set_shard_info(ton::ShardIdFull shard, Ref<vm::Cell> value) {
+  if (!gen::t_BinTree_ShardDescr.validate_ref(value)) {
+    LOG(ERROR) << "attempting to store an invalid (BinTree ShardDescr) at shard configuration position "
+               << shard.to_str();
+    gen::t_BinTree_ShardDescr.print_ref(std::cerr, value);
+    vm::load_cell_slice(value).print_rec(std::cerr);
+    return false;
+  }
+  auto root = shard_hashes_dict_->lookup_ref(td::BitArray<32>{shard.workchain});
+  if (root.is_null()) {
+    LOG(ERROR) << "attempting to store a new ShardDescr for shard " << shard.to_str() << " in an undefined workchain";
+    return false;
+  }
+  if (!btree_set(root, shard.shard, value)) {
+    LOG(ERROR) << "error while storing a new ShardDescr for shard " << shard.to_str() << " into shard configuration";
+    return false;
+  }
+  if (!shard_hashes_dict_->set_ref(td::BitArray<32>{shard.workchain}, std::move(root),
+                                   vm::Dictionary::SetMode::Replace)) {
+    return false;
+  }
+  auto ins = shards_updated_.insert(shard);
+  CHECK(ins.second);
+  return true;
+}
+
+bool Config::is_special_smartcontract(const ton::StdSmcAddress& addr) const {
+  CHECK(special_smc_dict);
+  return special_smc_dict->lookup(addr).not_null() || addr == config_addr;
+}
+
+td::Result<std::vector<ton::StdSmcAddress>> Config::get_special_smartcontracts(bool without_config) const {
+  if (!special_smc_dict) {
+    return td::Status::Error(-666, "configuration loaded without fundamental smart contract list");
+  }
+  std::vector<ton::StdSmcAddress> res;
+  if (!special_smc_dict->check_for_each([&res, &without_config, conf_addr = config_addr.bits() ](
+          Ref<vm::CellSlice> cs_ref, td::ConstBitPtr key, int n) {
+        if (cs_ref->size_ext() || n != 256) {
+          return false;
+        }
+        res.emplace_back(key);
+        if (!without_config && key.equals(conf_addr, 256)) {
+          without_config = true;
+        }
+        return true;
+      })) {
+    return td::Status::Error(-666, "invalid fundamental smart contract set in configuration parameter 31");
+  }
+  if (!without_config) {
+    res.push_back(config_addr);
+  }
+  return std::move(res);
+}
+
+td::Result<std::vector<std::pair<ton::StdSmcAddress, int>>> ConfigInfo::get_special_ticktock_smartcontracts(
+    int tick_tock) const {
+  if (!special_smc_dict) {
+    return td::Status::Error(-666, "configuration loaded without fundamental smart contract list");
+  }
+  if (!accounts_dict) {
+    return td::Status::Error(-666, "state loaded without accounts information");
+  }
+  std::vector<std::pair<ton::StdSmcAddress, int>> res;
+  if (!special_smc_dict->check_for_each(
+          [this, &res, tick_tock](Ref<vm::CellSlice> cs_ref, td::ConstBitPtr key, int n) -> bool {
+            if (cs_ref->size_ext() || n != 256) {
+              return false;
+            }
+            int tt = get_smc_tick_tock(key);
+            if (tt < -1) {
+              return false;
+            }
+            if (tt >= 0 && (tt & tick_tock) != 0) {
+              res.emplace_back(key, tt);
+            }
+            return true;
+          })) {
+    return td::Status::Error(-666,
+                             "invalid fundamental smart contract set in configuration parameter 31, or unable to "
+                             "recover tick-tock value from one of them");
+  }
+  return std::move(res);
+}
+
+int ConfigInfo::get_smc_tick_tock(td::ConstBitPtr smc_addr) const {
+  if (!accounts_dict) {
+    return -2;
+  }
+  auto acc_csr = accounts_dict->lookup(smc_addr, 256);
+  Ref<vm::Cell> acc_cell;
+  if (acc_csr.is_null() || !acc_csr->prefetch_ref_to(acc_cell)) {
+    return -1;
+  }
+  auto acc_cs = vm::load_cell_slice(std::move(acc_cell));
+  if (block::gen::t_Account.get_tag(acc_cs) == block::gen::Account::account_none) {
+    return 0;
+  }
+  block::gen::Account::Record_account acc;
+  block::gen::AccountStorage::Record storage;
+  int ticktock;
+  return (tlb::unpack_exact(acc_cs, acc) && tlb::csr_unpack(acc.storage, storage) &&
+          block::tlb::t_AccountState.get_ticktock(storage.state.write(), ticktock))
+             ? ticktock
+             : -2;
+}
+
+ton::CatchainSeqno ConfigInfo::get_shard_cc_seqno(ton::ShardIdFull shard) const {
+  return shard.is_masterchain() ? cc_seqno_ : ShardConfig::get_shard_cc_seqno(shard);
+}
+
+std::vector<ton::ValidatorDescr> Config::compute_validator_set(ton::ShardIdFull shard, const block::ValidatorSet& vset,
+                                                               ton::UnixTime time, ton::CatchainSeqno cc_seqno) const {
+  return do_compute_validator_set(get_catchain_validators_config(), shard, vset, time, cc_seqno);
+}
+
+std::vector<ton::ValidatorDescr> Config::compute_validator_set(ton::ShardIdFull shard, ton::UnixTime time,
+                                                               ton::CatchainSeqno cc_seqno) const {
+  if (!cur_validators_) {
+    LOG(DEBUG) << "failed to compute validator set: cur_validators_ is empty";
+    return {};
+  } else {
+    return compute_validator_set(shard, *cur_validators_, time, cc_seqno);
+  }
+}
+
+std::vector<ton::ValidatorDescr> ConfigInfo::compute_validator_set_cc(ton::ShardIdFull shard,
+                                                                      const block::ValidatorSet& vset,
+                                                                      ton::UnixTime time,
+                                                                      ton::CatchainSeqno* cc_seqno_delta) const {
+  if (cc_seqno_delta && (*cc_seqno_delta & -2)) {
+    return {};
+  }
+  ton::CatchainSeqno cc_seqno = get_shard_cc_seqno(shard);
+  if (cc_seqno == ~0U) {
+    return {};
+  }
+  if (cc_seqno_delta) {
+    cc_seqno = *cc_seqno_delta += cc_seqno;
+  }
+  return do_compute_validator_set(get_catchain_validators_config(), shard, vset, time, cc_seqno);
+}
+
+std::vector<ton::ValidatorDescr> ConfigInfo::compute_validator_set_cc(ton::ShardIdFull shard, ton::UnixTime time,
+                                                                      ton::CatchainSeqno* cc_seqno_delta) const {
+  auto vset = get_cur_validator_set();
+  if (!vset) {
+    return {};
+  } else {
+    return compute_validator_set_cc(shard, *vset, time, cc_seqno_delta);
+  }
+}
+
+void validator_set_descr::incr_seed() {
+  for (int i = 31; i >= 0 && !++(seed[i]); --i) {
+  }
+}
+
+void validator_set_descr::hash_to(unsigned char hash_buffer[64]) const {
+  digest::hash_str<digest::SHA512>(hash_buffer, (const void*)this, sizeof(*this));
+}
+
+td::uint64 ValidatorSetPRNG::next_ulong() {
+  if (pos < limit) {
+    return td::bswap64(hash_longs[pos++]);
+  }
+  data.hash_to(hash);
+  data.incr_seed();
+  pos = 1;
+  limit = 8;
+  return td::bswap64(hash_longs[0]);
+}
+
+td::uint64 ValidatorSetPRNG::next_ranged(td::uint64 range) {
+  td::uint64 y = next_ulong();
+  return td::uint128(range).mult(y).hi();
+}
+
+inline bool operator<(td::uint64 pos, const ValidatorDescr& descr) {
+  return pos < descr.cum_weight;
+}
+
+const ValidatorDescr& ValidatorSet::at_weight(td::uint64 weight_pos) const {
+  CHECK(weight_pos < total_weight);
+  auto it = std::upper_bound(list.begin(), list.end(), weight_pos);
+  CHECK(it != list.begin());
+  return *--it;
+}
+
+std::vector<ton::ValidatorDescr> ValidatorSet::export_validator_set() const {
+  std::vector<ton::ValidatorDescr> l;
+  l.reserve(list.size());
+  for (const auto& node : list) {
+    l.emplace_back(node.pubkey, node.weight, node.adnl_addr);
+  }
+  return l;
+}
+
+std::vector<ton::ValidatorDescr> Config::do_compute_validator_set(const block::CatchainValidatorsConfig& ccv_conf,
+                                                                  ton::ShardIdFull shard,
+                                                                  const block::ValidatorSet& vset, ton::UnixTime time,
+                                                                  ton::CatchainSeqno cc_seqno) {
+  // LOG(DEBUG) << "in Config::do_compute_validator_set() for " << shard.to_str() << " ; cc_seqno=" << cc_seqno;
+  std::vector<ton::ValidatorDescr> nodes;
+  bool is_mc = shard.is_masterchain();
+  unsigned count = std::min<unsigned>(is_mc ? vset.main : ccv_conf.shard_val_num, vset.total);
+  CHECK((unsigned)vset.total == vset.list.size());
+  if (!count) {
+    return {};  // no validators?
+  }
+  nodes.reserve(count);
+  if (is_mc) {
+    // simply take needed number of validators from the head of the list
+    // TODO: write a more clever validator list selection algorithm
+    // (if we really need one for the masterchain)
+    for (unsigned i = 0; i < count; i++) {
+      const auto& v = vset.list[i];
+      nodes.emplace_back(v.pubkey, v.weight, v.adnl_addr);
+    }
+    return nodes;
+  }
+  // this is the "true" algorithm for generating shardchain validator subgroups
+  ValidatorSetPRNG gen{shard, cc_seqno};  // use zero seed (might use a non-trivial seed from ccv_conf in the future)
+  std::vector<std::pair<td::uint64, td::uint64>> holes;
+  holes.reserve(count);
+  td::uint64 total_wt = vset.total_weight;
+  for (unsigned i = 0; i < count; i++) {
+    CHECK(total_wt > 0);
+    auto p = gen.next_ranged(total_wt);  // generate a pseudo-random number 0 .. total_wt-1
+    // auto op = p;
+    for (auto& hole : holes) {
+      if (p < hole.first) {
+        break;
+      }
+      p += hole.second;
+    }
+    auto& entry = vset.at_weight(p);
+    // LOG(DEBUG) << "vset entry #" << i << ": rem_wt=" << total_wt << ", total_wt=" << vset.total_weight << ", op=" << op << ", p=" << p << "; entry.cum_wt=" << entry.cum_weight << ", entry.wt=" << entry.weight << " " << entry.cum_weight / entry.weight;
+    nodes.emplace_back(entry.pubkey, 1, entry.adnl_addr);  // NB: shardchain validator lists have all weights = 1
+    CHECK(total_wt >= entry.weight);
+    total_wt -= entry.weight;
+    std::pair<td::uint64, td::uint64> new_hole{entry.cum_weight, entry.weight};
+    auto it = std::upper_bound(holes.begin(), holes.end(), new_hole);
+    CHECK(it == holes.begin() || *(it - 1) < new_hole);
+    holes.insert(it, new_hole);
+  }
+  return nodes;
+}
+
+std::vector<ton::ValidatorDescr> Config::compute_total_validator_set(int next) const {
+  auto res = unpack_validator_set(get_config_param(next < 0 ? 32 : (next ? 36 : 34)));
+  if (res.is_error()) {
+    return {};
+  }
+  return res.move_as_ok()->export_validator_set();
+}
+
+bool WorkchainInfo::unpack(ton::WorkchainId wc, vm::CellSlice& cs) {
+  workchain = ton::workchainInvalid;
+  if (wc == ton::workchainInvalid) {
+    return false;
+  }
+  block::gen::WorkchainDescr::Record info;
+  if (!tlb::unpack(cs, info)) {
+    return false;
+  }
+  enabled_since = info.enabled_since;
+  actual_min_split = info.actual_min_split;
+  min_split = info.min_split;
+  max_split = info.max_split;
+  basic = info.basic;
+  active = info.active;
+  accept_msgs = info.accept_msgs;
+  flags = info.flags;
+  zerostate_root_hash = info.zerostate_root_hash;
+  zerostate_file_hash = info.zerostate_file_hash;
+  version = info.version;
+  if (basic) {
+    min_addr_len = max_addr_len = addr_len_step = 256;
+  } else {
+    block::gen::WorkchainFormat::Record_wfmt_ext ext;
+    if (!tlb::type_unpack(cs, block::gen::WorkchainFormat{basic}, ext)) {
+      return false;
+    }
+    min_addr_len = ext.min_addr_len;
+    max_addr_len = ext.max_addr_len;
+    addr_len_step = ext.addr_len_step;
+  }
+  workchain = wc;
+  LOG(DEBUG) << "unpacked info for workchain " << wc << ": basic=" << basic << ", active=" << active
+             << ", accept_msgs=" << accept_msgs << ", min_split=" << min_split << ", max_split=" << max_split;
+  return true;
+}
+
+Ref<WorkchainInfo> Config::get_workchain_info(ton::WorkchainId workchain_id) const {
+  if (!workchains_dict_) {
+    return {};
+  }
+  auto it = workchains_.find(workchain_id);
+  if (it == workchains_.end()) {
+    return {};
+  } else {
+    return it->second;
+  }
+}
+
+bool ConfigInfo::get_old_mc_block_id(ton::BlockSeqno seqno, ton::BlockIdExt& blkid, ton::LogicalTime* end_lt) const {
+  if (block_id.is_valid() && seqno == block_id.id.seqno) {
+    blkid = block_id;
+    if (end_lt) {
+      *end_lt = lt;
+    }
+    return true;
+  } else {
+    return block::get_old_mc_block_id(prev_blocks_dict_.get(), seqno, blkid, end_lt);
+  }
+}
+
+bool ConfigInfo::check_old_mc_block_id(const ton::BlockIdExt& blkid, bool strict) const {
+  return (!strict && blkid.id.seqno == block_id.id.seqno && block_id.is_valid())
+             ? blkid == block_id
+             : block::check_old_mc_block_id(prev_blocks_dict_.get(), blkid);
+}
+
+// returns block with min block.seqno and req_lt <= block.end_lt
+bool ConfigInfo::get_mc_block_by_lt(ton::LogicalTime req_lt, ton::BlockIdExt& blkid, ton::LogicalTime* end_lt) const {
+  if (req_lt > lt) {
+    return false;
+  }
+  td::BitArray<32> key;
+  auto found = prev_blocks_dict_->traverse_extra(
+      key.bits(), 32,
+      [req_lt](td::ConstBitPtr key_prefix, int key_pfx_len, Ref<vm::CellSlice> extra, Ref<vm::CellSlice> value) {
+        unsigned long long found_lt;
+        if (!(extra.write().advance(1) && extra.write().fetch_ulong_bool(64, found_lt))) {
+          return -1;
+        }
+        if (found_lt < req_lt) {
+          return 0;  // all leaves in subtree have end_lt <= found_lt < req_lt, skip
+        }
+        return 6;  // visit left subtree, then right subtree; for leaf: accept and return to the top
+      });
+  if (found.first.not_null()) {
+    CHECK(unpack_old_mc_block_id(std::move(found.first), (unsigned)key.to_ulong(), blkid, end_lt));
+    return true;
+  }
+  if (block_id.is_valid()) {
+    blkid = block_id;
+    if (end_lt) {
+      *end_lt = lt;
+    }
+    return true;
+  } else {
+    return false;
+  }
+}
+
+// returns key block with max block.seqno and block.seqno <= req_seqno
+bool ConfigInfo::get_prev_key_block(ton::BlockSeqno req_seqno, ton::BlockIdExt& blkid, ton::LogicalTime* end_lt) const {
+  if (block_id.is_valid() && is_key_state_ && block_id.seqno() <= req_seqno) {
+    blkid = block_id;
+    if (end_lt) {
+      *end_lt = lt;
+    }
+    return true;
+  }
+  td::BitArray<32> key;
+  auto found =
+      prev_blocks_dict_->traverse_extra(key.bits(), 32,
+                                        [req_seqno](td::ConstBitPtr key_prefix, int key_pfx_len,
+                                                    Ref<vm::CellSlice> extra, Ref<vm::CellSlice> value) -> int {
+                                          if (extra->prefetch_ulong(1) != 1) {
+                                            return 0;  // no key blocks in subtree, skip
+                                          }
+                                          unsigned x = (unsigned)key_prefix.get_uint(key_pfx_len);
+                                          unsigned d = 32 - key_pfx_len;
+                                          if (!d) {
+                                            return x <= req_seqno;
+                                          }
+                                          unsigned y = req_seqno >> (d - 1);
+                                          if (y < 2 * x) {
+                                            // (x << d) > req_seqno <=> x > (req_seqno >> d) = (y >> 1) <=> 2 * x > y
+                                            return 0;  // all nodes in subtree have block.seqno > req_seqno => skip
+                                          }
+                                          return y == 2 * x ? 1 /* visit only left */ : 5 /* visit right, then left */;
+                                        });
+  if (found.first.not_null()) {
+    CHECK(unpack_old_mc_block_id(std::move(found.first), (unsigned)key.to_ulong(), blkid, end_lt));
+    CHECK(blkid.seqno() <= req_seqno);
+    return true;
+  } else {
+    blkid.invalidate();
+    return false;
+  }
+}
+
+// returns key block with min block.seqno and block.seqno >= req_seqno
+bool ConfigInfo::get_next_key_block(ton::BlockSeqno req_seqno, ton::BlockIdExt& blkid, ton::LogicalTime* end_lt) const {
+  td::BitArray<32> key;
+  auto found = prev_blocks_dict_->traverse_extra(
+      key.bits(), 32,
+      [req_seqno](td::ConstBitPtr key_prefix, int key_pfx_len, Ref<vm::CellSlice> extra,
+                  Ref<vm::CellSlice> value) -> int {
+        if (extra->prefetch_ulong(1) != 1) {
+          return 0;  // no key blocks in subtree, skip
+        }
+        unsigned x = (unsigned)key_prefix.get_uint(key_pfx_len);
+        unsigned d = 32 - key_pfx_len;
+        if (!d) {
+          return x >= req_seqno;
+        }
+        unsigned y = req_seqno >> (d - 1);
+        if (y > 2 * x + 1) {
+          // ((x + 1) << d) <= req_seqno <=> (x+1) <= (req_seqno >> d) = (y >> 1) <=> 2*x+2 <= y <=> y > 2*x+1
+          return 0;  // all nodes in subtree have block.seqno < req_seqno => skip
+        }
+        return y == 2 * x + 1 ? 2 /* visit only right */ : 6 /* visit left, then right */;
+      });
+  if (found.first.not_null()) {
+    CHECK(unpack_old_mc_block_id(std::move(found.first), (unsigned)key.to_ulong(), blkid, end_lt));
+    CHECK(blkid.seqno() >= req_seqno);
+    return true;
+  }
+  if (block_id.is_valid() && is_key_state_ && block_id.seqno() >= req_seqno) {
+    blkid = block_id;
+    if (end_lt) {
+      *end_lt = lt;
+    }
+    return true;
+  } else {
+    blkid.invalidate();
+    return false;
+  }
+}
+
+Ref<vm::Cell> ConfigInfo::lookup_library(td::ConstBitPtr root_hash) const {
+  if (!libraries_dict_) {
+    return {};
+  }
+  auto csr = libraries_dict_->lookup(root_hash, 256);
+  if (csr.is_null() || csr->prefetch_ulong(8) != 0 || !csr->have_refs()) {  // shared_lib_descr$00 lib:^Cell
+    return {};
+  }
+  auto lib = csr->prefetch_ref();
+  if (lib->get_hash().bits().compare(root_hash, 256)) {
+    LOG(ERROR) << "public library hash mismatch: expected " << root_hash.to_hex(256) << " , found "
+               << lib->get_hash().bits().to_hex(256);
+    return {};
+  }
+  return lib;
+}
+
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/mc-config.h b/submodules/ton/tonlib-src/crypto/block/mc-config.h
new file mode 100644
index 0000000000..dc48ec0256
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/mc-config.h
@@ -0,0 +1,637 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "common/refcnt.hpp"
+#include "vm/db/StaticBagOfCellsDb.h"
+#include "vm/dict.h"
+#include "ton/ton-types.h"
+#include "ton/ton-shard.h"
+#include "common/bitstring.h"
+#include "block.h"
+
+#include <vector>
+#include <limits>
+#include <map>
+#include <set>
+#include <cstring>
+
+namespace block {
+using td::Ref;
+
+struct ValidatorDescr {
+  ton::Ed25519_PublicKey pubkey;
+  td::Bits256 adnl_addr;
+  td::uint64 weight;
+  td::uint64 cum_weight;
+  ValidatorDescr(const td::Bits256& _pubkey, td::uint64 _weight, td::uint64 _cum_weight)
+      : pubkey(_pubkey), weight(_weight), cum_weight(_cum_weight) {
+    adnl_addr.set_zero();
+  }
+  ValidatorDescr(const td::Bits256& _pubkey, td::uint64 _weight, td::uint64 _cum_weight, const td::Bits256& _adnl_addr)
+      : pubkey(_pubkey), adnl_addr(_adnl_addr), weight(_weight), cum_weight(_cum_weight) {
+  }
+  ValidatorDescr(const ton::Ed25519_PublicKey& _pubkey, td::uint64 _weight, td::uint64 _cum_weight)
+      : pubkey(_pubkey), weight(_weight), cum_weight(_cum_weight) {
+    adnl_addr.set_zero();
+  }
+  bool operator<(td::uint64 wt_pos) const & {
+    return cum_weight < wt_pos;
+  }
+};
+
+struct ValidatorSet {
+  unsigned utime_since;
+  unsigned utime_until;
+  int total;
+  int main;
+  td::uint64 total_weight;
+  std::vector<ValidatorDescr> list;
+  ValidatorSet() = default;
+  ValidatorSet(unsigned _since, unsigned _until, int _total, int _main = 0)
+      : utime_since(_since), utime_until(_until), total(_total), main(_main > 0 ? _main : _total), total_weight(0) {
+  }
+  const ValidatorDescr& operator[](unsigned i) const {
+    return list[i];
+  }
+  const ValidatorDescr& at_weight(td::uint64 weight_pos) const;
+  std::vector<ton::ValidatorDescr> export_validator_set() const;
+};
+
+#pragma pack(push, 1)
+// this structure is hashed with SHA512 to produce pseudo-random bit stream in do_compute_validator_set()
+// NB: all integers (including 256-bit seed) are actually big-endian
+struct validator_set_descr {
+  unsigned char seed[32];  // seed for validator set computation, set to zero if none
+  td::uint64 shard;
+  td::int32 workchain;
+  td::uint32 cc_seqno;
+  validator_set_descr() = default;
+  validator_set_descr(ton::ShardIdFull shard_id, ton::CatchainSeqno cc_seqno_, bool flag)
+      : shard(td::bswap64(shard_id.shard))
+      , workchain(td::bswap32(shard_id.workchain))
+      , cc_seqno(td::bswap32(cc_seqno_)) {
+  }
+  validator_set_descr(ton::ShardIdFull shard_id, ton::CatchainSeqno cc_seqno_)
+      : validator_set_descr(shard_id, cc_seqno_, false) {
+    std::memset(seed, 0, 32);
+  }
+  validator_set_descr(ton::ShardIdFull shard_id, ton::CatchainSeqno cc_seqno_, const unsigned char seed_[32])
+      : validator_set_descr(shard_id, cc_seqno_, false) {
+    std::memcpy(seed, seed_, 32);
+  }
+  validator_set_descr(ton::ShardIdFull shard_id, ton::CatchainSeqno cc_seqno_, td::ConstBitPtr seed_)
+      : validator_set_descr(shard_id, cc_seqno_, false) {
+    td::BitPtr{seed}.copy_from(seed_, 256);
+  }
+  validator_set_descr(ton::ShardIdFull shard_id, ton::CatchainSeqno cc_seqno_, const td::Bits256& seed_)
+      : validator_set_descr(shard_id, cc_seqno_, false) {
+    td::BitPtr{seed}.copy_from(seed_.cbits(), 256);
+  }
+  void incr_seed();
+  void hash_to(unsigned char hash_buffer[64]) const;
+};
+#pragma pack(pop)
+
+class ValidatorSetPRNG {
+  validator_set_descr data;
+  union {
+    unsigned char hash[64];
+    td::uint64 hash_longs[8];
+  };
+  int pos{0}, limit{0};
+
+ public:
+  ValidatorSetPRNG() = default;
+  ValidatorSetPRNG(ton::ShardIdFull shard_id, ton::CatchainSeqno cc_seqno_) : data(shard_id, cc_seqno_) {
+  }
+  ValidatorSetPRNG(ton::ShardIdFull shard_id, ton::CatchainSeqno cc_seqno_, const unsigned char seed_[32])
+      : data(shard_id, cc_seqno_, seed_) {
+  }
+  ValidatorSetPRNG(ton::ShardIdFull shard_id, ton::CatchainSeqno cc_seqno_, td::ConstBitPtr seed_)
+      : data(shard_id, cc_seqno_, std::move(seed_)) {
+  }
+  ValidatorSetPRNG(ton::ShardIdFull shard_id, ton::CatchainSeqno cc_seqno_, const td::Bits256& seed_)
+      : data(shard_id, cc_seqno_, seed_) {
+  }
+  td::uint64 next_ulong();
+  td::uint64 next_ranged(td::uint64 range);  // integer in 0 .. range-1
+  ValidatorSetPRNG& operator>>(td::uint64& x) {
+    x = next_ulong();
+    return *this;
+  }
+};
+
+class McShardHashI : public td::CntObject {
+ public:
+  enum class FsmState { fsm_none, fsm_split, fsm_merge };
+  virtual ton::BlockIdExt top_block_id() const = 0;
+  virtual ton::LogicalTime start_lt() const = 0;
+  virtual ton::LogicalTime end_lt() const = 0;
+  virtual ton::UnixTime fsm_utime() const = 0;
+  virtual FsmState fsm_state() const = 0;
+  virtual ton::ShardIdFull shard() const = 0;
+  virtual bool before_split() const = 0;
+  virtual bool before_merge() const = 0;
+};
+
+struct McShardHash : public McShardHashI {
+  ton::BlockIdExt blk_;
+  ton::LogicalTime start_lt_, end_lt_;
+  ton::UnixTime gen_utime_{0};
+  ton::UnixTime fsm_utime_{0};
+  ton::UnixTime fsm_interval_{0};
+  ton::BlockSeqno min_ref_mc_seqno_{std::numeric_limits<ton::BlockSeqno>::max()};
+  ton::BlockSeqno reg_mc_seqno_{std::numeric_limits<ton::BlockSeqno>::max()};
+  FsmState fsm_{FsmState::fsm_none};
+  bool disabled_{false};
+  bool before_split_{false}, before_merge_{false}, want_split_{false}, want_merge_{false};
+  ton::CatchainSeqno next_catchain_seqno_{std::numeric_limits<ton::CatchainSeqno>::max()};
+  ton::ShardId next_validator_shard_{ton::shardIdAll};
+  CurrencyCollection fees_collected_, funds_created_;
+  McShardHash(const ton::BlockId& id, ton::LogicalTime start_lt, ton::LogicalTime end_lt, ton::UnixTime gen_utime,
+              const ton::BlockHash& root_hash, const ton::FileHash& file_hash, CurrencyCollection fees_collected = {},
+              CurrencyCollection funds_created = {},
+              ton::BlockSeqno reg_mc_seqno = std::numeric_limits<ton::BlockSeqno>::max(),
+              ton::BlockSeqno min_ref_mc_seqno = std::numeric_limits<ton::BlockSeqno>::max(),
+              ton::CatchainSeqno cc_seqno = std::numeric_limits<ton::CatchainSeqno>::max(), ton::ShardId val_shard = 0,
+              bool nx_cc_updated = false, bool before_split = false, bool before_merge = false, bool want_split = false,
+              bool want_merge = false)
+      : blk_(id, root_hash, file_hash)
+      , start_lt_(start_lt)
+      , end_lt_(end_lt)
+      , gen_utime_(gen_utime)
+      , min_ref_mc_seqno_(min_ref_mc_seqno)
+      , reg_mc_seqno_(reg_mc_seqno)
+      , before_split_(before_split)
+      , before_merge_(before_merge)
+      , want_split_(want_split)
+      , want_merge_(want_merge)
+      , next_catchain_seqno_(cc_seqno)
+      , next_validator_shard_(val_shard ? val_shard : id.shard)
+      , fees_collected_(fees_collected)
+      , funds_created_(funds_created) {
+  }
+  McShardHash(const ton::BlockIdExt& blk, ton::LogicalTime start_lt, ton::LogicalTime end_lt)
+      : blk_(blk), start_lt_(start_lt), end_lt_(end_lt) {
+  }
+  McShardHash(const McShardHash&) = default;
+  bool is_valid() const {
+    return blk_.is_valid();
+  }
+  ton::BlockIdExt top_block_id() const override final {
+    return blk_;
+  }
+  //  ZeroStateIdExt zero_state() const override;
+  ton::LogicalTime start_lt() const override final {
+    return start_lt_;
+  }
+  ton::LogicalTime end_lt() const override final {
+    return end_lt_;
+  }
+  ton::UnixTime fsm_utime() const override final {
+    return fsm_utime_;
+  }
+  ton::UnixTime fsm_utime_end() const {
+    return fsm_utime_ + fsm_interval_;
+  }
+  ton::UnixTime created_at() const {
+    return gen_utime_;
+  }
+  FsmState fsm_state() const override final {
+    return fsm_;
+  }
+  bool is_fsm_none() const {
+    return fsm_ == FsmState::fsm_none;
+  }
+  bool is_fsm_split() const {
+    return fsm_ == FsmState::fsm_split;
+  }
+  bool is_fsm_merge() const {
+    return fsm_ == FsmState::fsm_merge;
+  }
+  ton::ShardIdFull shard() const override final {
+    return ton::ShardIdFull(blk_);
+  }
+  ton::WorkchainId workchain() const {
+    return blk_.id.workchain;
+  }
+  bool contains(const ton::AccountIdPrefixFull& pfx) const {
+    return ton::shard_contains(shard(), pfx);
+  }
+  bool before_split() const override final {
+    return before_split_;
+  }
+  bool before_merge() const override final {
+    return before_merge_;
+  }
+  bool is_disabled() const {
+    return disabled_;
+  }
+  void disable() {
+    blk_.invalidate();
+    disabled_ = true;
+  }
+  ton::BlockSeqno seqno() const {
+    return blk_.id.seqno;
+  }
+  bool set_reg_mc_seqno(ton::BlockSeqno reg_mc_seqno) {
+    reg_mc_seqno_ = reg_mc_seqno;
+    return true;
+  }
+  // compares all fields except fsm*, before_merge_, nx_cc_updated_, next_catchain_seqno_, fees_collected_
+  bool basic_info_equal(const McShardHash& other, bool compare_fees = false, bool compare_reg_seqno = true) const;
+  void clear_fsm() {
+    fsm_ = FsmState::fsm_none;
+  }
+  void set_fsm(FsmState fsm, ton::UnixTime fsm_utime, ton::UnixTime fsm_interval);
+  void set_fsm_split(ton::UnixTime fsm_utime, ton::UnixTime fsm_interval) {
+    set_fsm(FsmState::fsm_split, fsm_utime, fsm_interval);
+  }
+  void set_fsm_merge(ton::UnixTime fsm_utime, ton::UnixTime fsm_interval) {
+    set_fsm(FsmState::fsm_merge, fsm_utime, fsm_interval);
+  }
+  bool fsm_equal(const McShardHash& other) const {
+    return fsm_ == other.fsm_ &&
+           (is_fsm_none() || (fsm_utime_ == other.fsm_utime_ && fsm_interval_ == other.fsm_interval_));
+  }
+  bool pack(vm::CellBuilder& cb) const;
+  static Ref<McShardHash> unpack(vm::CellSlice& cs, ton::ShardIdFull id);
+  static Ref<McShardHash> from_block(Ref<vm::Cell> block_root, const ton::FileHash& _fhash, bool init_fees = false);
+  McShardHash* make_copy() const override {
+    return new McShardHash(*this);
+  }
+};
+
+struct McShardDescr final : public McShardHash {
+  Ref<vm::Cell> block_root;
+  Ref<vm::Cell> state_root;
+  Ref<vm::Cell> outmsg_root;
+  std::unique_ptr<vm::AugmentedDictionary> out_msg_queue;
+  std::shared_ptr<block::MsgProcessedUptoCollection> processed_upto;
+  McShardDescr(const ton::BlockId& id, ton::LogicalTime start_lt, ton::LogicalTime end_lt, ton::UnixTime gen_utime,
+               const ton::BlockHash& root_hash, const ton::FileHash& file_hash, CurrencyCollection fees_collected = {},
+               CurrencyCollection funds_created = {},
+               ton::BlockSeqno reg_mc_seqno = std::numeric_limits<ton::BlockSeqno>::max(),
+               ton::BlockSeqno min_ref_mc_seqno = std::numeric_limits<ton::BlockSeqno>::max(),
+               ton::CatchainSeqno cc_seqno = std::numeric_limits<ton::CatchainSeqno>::max(),
+               ton::ShardId val_shard = ton::shardIdAll, bool nx_cc_updated = false, bool before_split = false,
+               bool before_merge = false, bool want_split = false, bool want_merge = false)
+      : McShardHash(id, start_lt, end_lt, gen_utime, root_hash, file_hash, fees_collected, funds_created, reg_mc_seqno,
+                    min_ref_mc_seqno, cc_seqno, val_shard, nx_cc_updated, before_split, before_merge, want_split,
+                    want_merge) {
+  }
+  McShardDescr(const ton::BlockIdExt& blk, ton::LogicalTime start_lt, ton::LogicalTime end_lt)
+      : McShardHash(blk, start_lt, end_lt) {
+  }
+  McShardDescr(const McShardHash& shard_hash) : McShardHash(shard_hash) {
+  }
+  McShardDescr(const McShardDescr& other);
+  McShardDescr(McShardDescr&& other) = default;
+  McShardDescr& operator=(const McShardDescr& other);
+  McShardDescr& operator=(McShardDescr&& other) = default;
+  bool set_queue_root(Ref<vm::Cell> queue_root);
+  void disable();
+  static Ref<McShardDescr> from_block(Ref<vm::Cell> block_root, Ref<vm::Cell> state_root, const ton::FileHash& _fhash,
+                                      bool init_fees = false);
+  static Ref<McShardDescr> from_state(ton::BlockIdExt blkid, Ref<vm::Cell> state_root);
+};
+
+struct StoragePrices {
+  ton::UnixTime valid_since{0};
+  td::uint64 bit_price{0};
+  td::uint64 cell_price{0};
+  td::uint64 mc_bit_price{0};
+  td::uint64 mc_cell_price{0};
+  StoragePrices() = default;
+  StoragePrices(ton::UnixTime _valid_since, td::uint64 _bprice, td::uint64 _cprice, td::uint64 _mc_bprice,
+                td::uint64 _mc_cprice)
+      : valid_since(_valid_since)
+      , bit_price(_bprice)
+      , cell_price(_cprice)
+      , mc_bit_price(_mc_bprice)
+      , mc_cell_price(_mc_cprice) {
+  }
+};
+
+struct CatchainValidatorsConfig {
+  td::uint32 mc_cc_lifetime, shard_cc_lifetime, shard_val_lifetime, shard_val_num;
+  CatchainValidatorsConfig(td::uint32 mc_cc_lt_, td::uint32 sh_cc_lt_, td::uint32 sh_val_lt_, td::uint32 sh_val_num_)
+      : mc_cc_lifetime(mc_cc_lt_)
+      , shard_cc_lifetime(sh_cc_lt_)
+      , shard_val_lifetime(sh_val_lt_)
+      , shard_val_num(sh_val_num_) {
+  }
+};
+
+struct WorkchainInfo : public td::CntObject {
+  ton::WorkchainId workchain{ton::workchainInvalid};
+  ton::UnixTime enabled_since;
+  td::uint32 actual_min_split;
+  td::uint32 min_split, max_split;
+  bool basic;
+  bool active;
+  bool accept_msgs;
+  int flags;
+  td::uint32 version;
+  ton::RootHash zerostate_root_hash;
+  ton::FileHash zerostate_file_hash;
+  int min_addr_len, max_addr_len, addr_len_step;
+  bool is_valid() const {
+    return workchain != ton::workchainInvalid;
+  }
+  bool is_valid_addr_len(int addr_len) const {
+    return addr_len >= min_addr_len && addr_len <= max_addr_len &&
+           (addr_len == min_addr_len || addr_len == max_addr_len ||
+            (addr_len_step > 0 && !((addr_len - min_addr_len) % addr_len_step)));
+  }
+  bool unpack(ton::WorkchainId wc, vm::CellSlice& cs);
+};
+
+using WorkchainSet = std::map<td::int32, Ref<WorkchainInfo>>;
+
+class ShardConfig {
+  Ref<vm::Cell> shard_hashes_;
+  Ref<McShardHash> mc_shard_hash_;
+  std::unique_ptr<vm::Dictionary> shard_hashes_dict_;
+  std::set<ton::ShardIdFull> shards_updated_;
+  bool valid_{false};
+
+ public:
+  ShardConfig() = default;
+  ShardConfig(const ShardConfig& other);
+  ShardConfig(ShardConfig&& other) = default;
+  ShardConfig(Ref<vm::Cell> shard_hashes, Ref<McShardHash> mc_shard_hash = {})
+      : shard_hashes_(std::move(shard_hashes)), mc_shard_hash_(std::move(mc_shard_hash)) {
+    init();
+  }
+  bool is_valid() const {
+    return valid_;
+  }
+  bool unpack(Ref<vm::Cell> shard_hashes, Ref<McShardHash> mc_shard_hash = {});
+  bool unpack(Ref<vm::CellSlice> shard_hashes, Ref<McShardHash> mc_shard_hash = {});
+  Ref<vm::CellSlice> get_root_csr() const;
+  bool has_workchain(ton::WorkchainId workchain) const;
+  std::vector<ton::WorkchainId> get_workchains() const;
+  Ref<McShardHash> get_shard_hash(ton::ShardIdFull id, bool exact = true) const;
+  bool contains(ton::BlockIdExt blkid) const;
+  bool get_shard_hash_raw(vm::CellSlice& cs, ton::ShardIdFull id, ton::ShardIdFull& true_id, bool exact = true) const;
+  ton::LogicalTime get_shard_end_lt(ton::AccountIdPrefixFull acc) const;
+  ton::LogicalTime get_shard_end_lt_ext(ton::AccountIdPrefixFull acc, ton::ShardIdFull& actual_shard) const;
+  static bool get_shard_hash_raw_from(vm::Dictionary& shard_hashes_dict, vm::CellSlice& cs, ton::ShardIdFull id,
+                                      ton::ShardIdFull& true_id, bool exact = true, Ref<vm::Cell>* leaf = nullptr);
+  std::vector<ton::BlockId> get_shard_hash_ids(bool skip_mc = false) const;
+  std::vector<ton::BlockId> get_shard_hash_ids(const std::function<bool(ton::ShardIdFull, bool)>& filter) const;
+  std::vector<ton::BlockId> get_intersecting_shard_hash_ids(ton::ShardIdFull myself) const;
+  std::vector<ton::BlockId> get_neighbor_shard_hash_ids(ton::ShardIdFull myself) const;
+  std::vector<ton::BlockId> get_proper_neighbor_shard_hash_ids(ton::ShardIdFull myself) const;
+  static std::unique_ptr<vm::Dictionary> extract_shard_hashes_dict(Ref<vm::Cell> mc_state_root);
+  bool process_shard_hashes(std::function<int(McShardHash&)> func);
+  bool process_sibling_shard_hashes(std::function<int(McShardHash&, const McShardHash*)> func);
+  // may become non-static const in the future
+  static bool is_neighbor(ton::ShardIdFull x, ton::ShardIdFull y);
+  Ref<McShardHash> get_mc_hash() const {
+    return mc_shard_hash_;
+  }
+  void set_mc_hash(Ref<McShardHash> mc_shard_hash) {
+    mc_shard_hash_ = std::move(mc_shard_hash);
+  }
+  ton::CatchainSeqno get_shard_cc_seqno(ton::ShardIdFull shard) const;
+  block::compute_shard_end_lt_func_t get_compute_shard_end_lt_func() const {
+    return std::bind(&ShardConfig::get_shard_end_lt, *this, std::placeholders::_1);
+  }
+  bool new_workchain(ton::WorkchainId workchain, ton::BlockSeqno reg_mc_seqno, const ton::RootHash& zerostate_root_hash,
+                     const ton::FileHash& zerostate_file_hash);
+  td::Result<bool> update_shard_block_info(Ref<McShardHash> new_info, const std::vector<ton::BlockIdExt>& old_blkids);
+  td::Result<bool> update_shard_block_info2(Ref<McShardHash> new_info1, Ref<McShardHash> new_info2,
+                                            const std::vector<ton::BlockIdExt>& old_blkids);
+  td::Result<bool> may_update_shard_block_info(Ref<McShardHash> new_info,
+                                               const std::vector<ton::BlockIdExt>& old_blkids,
+                                               ton::LogicalTime lt_limit = std::numeric_limits<ton::LogicalTime>::max(),
+                                               Ref<McShardHash>* ancestor = nullptr) const;
+
+ private:
+  bool init();
+  bool do_update_shard_info(Ref<McShardHash> new_info);
+  bool do_update_shard_info2(Ref<McShardHash> new_info1, Ref<McShardHash> new_info2);
+  bool set_shard_info(ton::ShardIdFull shard, Ref<vm::Cell> value);
+};
+
+class Config {
+  enum {
+    default_mc_catchain_lifetime = 200,
+    default_shard_catchain_lifetime = 200,
+    default_shard_validators_lifetime = 3000,
+    default_shard_validators_num = 7
+  };
+
+ public:
+  enum { needValidatorSet = 16, needSpecialSmc = 32, needWorkchainInfo = 256, needCapabilities = 512 };
+  int mode{0};
+  ton::BlockIdExt block_id;
+
+ private:
+  td::BitArray<256> config_addr;
+  Ref<vm::Cell> config_root;
+  std::unique_ptr<vm::Dictionary> config_dict;
+  std::unique_ptr<ValidatorSet> cur_validators_;
+  std::unique_ptr<vm::Dictionary> workchains_dict_;
+  WorkchainSet workchains_;
+  int version_{-1};
+  long long capabilities_{-1};
+
+ protected:
+  std::unique_ptr<vm::Dictionary> special_smc_dict;
+
+ public:
+  static constexpr ton::LogicalTime get_lt_align() {
+    return 1000000;
+  }
+  static constexpr ton::LogicalTime get_max_lt_growth() {
+    return 10 * get_lt_align() - 1;
+  }
+  Ref<vm::Cell> get_config_param(int idx) const;
+  Ref<vm::Cell> get_config_param(int idx, int idx2) const;
+  Ref<vm::Cell> operator[](int idx) const {
+    return get_config_param(idx);
+  }
+  Ref<vm::Cell> get_root_cell() const {
+    return config_root;
+  }
+  bool is_masterchain() const {
+    return block_id.is_masterchain();
+  }
+  bool has_capabilities() const {
+    return capabilities_ >= 0;
+  }
+  long long get_capabilities() const {
+    return capabilities_;
+  }
+  int get_global_version() const {
+    return version_;
+  }
+  bool has_capability(long long cap_set) const {
+    return has_capabilities() && (capabilities_ & cap_set) == cap_set;
+  }
+  bool ihr_enabled() const {
+    return has_capability(ton::capIhrEnabled);
+  }
+  bool create_stats_enabled() const {
+    return has_capability(ton::capCreateStatsEnabled);
+  }
+  bool set_block_id_ext(const ton::BlockIdExt& block_id_ext);
+  td::Result<std::vector<ton::StdSmcAddress>> get_special_smartcontracts(bool without_config = false) const;
+  bool is_special_smartcontract(const ton::StdSmcAddress& addr) const;
+  static td::Result<std::unique_ptr<ValidatorSet>> unpack_validator_set(Ref<vm::Cell> valset_root);
+  td::Result<std::vector<StoragePrices>> get_storage_prices() const;
+  static CatchainValidatorsConfig unpack_catchain_validators_config(Ref<vm::Cell> cell);
+  CatchainValidatorsConfig get_catchain_validators_config() const;
+  td::Status visit_validator_params() const;
+  td::Result<std::unique_ptr<BlockLimits>> get_block_limits(bool is_masterchain = false) const;
+  auto get_mc_block_limits() const {
+    return get_block_limits(true);
+  }
+  static td::Result<std::pair<WorkchainSet, std::unique_ptr<vm::Dictionary>>> unpack_workchain_list_ext(
+      Ref<vm::Cell> cell);
+  static td::Result<WorkchainSet> unpack_workchain_list(Ref<vm::Cell> cell);
+  const WorkchainSet& get_workchain_list() const {
+    return workchains_;
+  }
+  const ValidatorSet* get_cur_validator_set() const {
+    return cur_validators_.get();
+  }
+  ton::ValidatorSessionConfig get_consensus_config() const;
+  bool foreach_config_param(std::function<bool(int, Ref<vm::Cell>)> scan_func) const;
+  Ref<WorkchainInfo> get_workchain_info(ton::WorkchainId workchain_id) const;
+  std::vector<ton::ValidatorDescr> compute_validator_set(ton::ShardIdFull shard, const block::ValidatorSet& vset,
+                                                         ton::UnixTime time, ton::CatchainSeqno cc_seqno) const;
+  std::vector<ton::ValidatorDescr> compute_validator_set(ton::ShardIdFull shard, ton::UnixTime time,
+                                                         ton::CatchainSeqno cc_seqno) const;
+  std::vector<ton::ValidatorDescr> compute_total_validator_set(int next) const;
+  static std::vector<ton::ValidatorDescr> do_compute_validator_set(const block::CatchainValidatorsConfig& ccv_conf,
+                                                                   ton::ShardIdFull shard,
+                                                                   const block::ValidatorSet& vset, ton::UnixTime time,
+                                                                   ton::CatchainSeqno cc_seqno);
+
+  static td::Result<std::unique_ptr<Config>> unpack_config(Ref<vm::Cell> config_root,
+                                                           const td::Bits256& config_addr = td::Bits256::zero(),
+                                                           int mode = 0);
+  static td::Result<std::unique_ptr<Config>> unpack_config(Ref<vm::CellSlice> config_csr, int mode = 0);
+  static td::Result<std::unique_ptr<Config>> extract_from_state(Ref<vm::Cell> mc_state_root, int mode = 0);
+  static td::Result<std::unique_ptr<Config>> extract_from_key_block(Ref<vm::Cell> key_block_root, int mode = 0);
+
+ protected:
+  Config(int _mode) : mode(_mode) {
+    config_addr.set_zero();
+  }
+  Config(Ref<vm::Cell> config_root, const td::Bits256& config_addr = td::Bits256::zero(), int _mode = 0);
+  td::Status unpack_wrapped(Ref<vm::CellSlice> config_csr);
+  td::Status unpack(Ref<vm::CellSlice> config_csr);
+  td::Status unpack_wrapped();
+  td::Status unpack();
+};
+
+class ConfigInfo : public Config, public ShardConfig {
+ public:
+  enum {
+    needStateRoot = 1,
+    needLibraries = 2,
+    needStateExtraRoot = 4,
+    needShardHashes = 8,
+    needAccountsRoot = 64,
+    needPrevBlocks = 128
+  };
+  int vert_seqno{-1};
+  int global_id_{0};
+  ton::UnixTime utime{0};
+  ton::LogicalTime lt{0};
+  ton::BlockSeqno min_ref_mc_seqno_{std::numeric_limits<ton::BlockSeqno>::max()};
+  ton::CatchainSeqno cc_seqno_{std::numeric_limits<ton::CatchainSeqno>::max()};
+  int shard_cc_updated{-1};
+  bool nx_cc_updated;
+  bool is_key_state_{false};
+
+ private:
+  Ref<vm::Cell> state_root;
+  Ref<vm::Cell> lib_root_;
+  Ref<vm::Cell> state_extra_root_;
+  Ref<vm::CellSlice> accounts_root;
+  ton::ZeroStateIdExt zerostate_id_;
+  ton::BlockIdExt last_key_block_;
+  ton::LogicalTime last_key_block_lt_;
+  Ref<vm::Cell> shard_hashes;
+  std::unique_ptr<vm::Dictionary> shard_hashes_dict;
+  std::unique_ptr<vm::AugmentedDictionary> accounts_dict;
+  std::unique_ptr<vm::AugmentedDictionary> prev_blocks_dict_;
+  std::unique_ptr<vm::Dictionary> libraries_dict_;
+
+ public:
+  bool set_block_id_ext(const ton::BlockIdExt& block_id_ext);
+  bool rotated_all_shards() const {
+    return nx_cc_updated;
+  }
+  int get_global_blockchain_id() const {
+    return global_id_;
+  }
+  ton::ZeroStateIdExt get_zerostate_id() const {
+    return zerostate_id_;
+  }
+  Ref<vm::Cell> lookup_library(const ton::Bits256& root_hash) const {
+    return lookup_library(root_hash.bits());
+  }
+  Ref<vm::Cell> lookup_library(td::ConstBitPtr root_hash) const;
+  Ref<vm::Cell> get_libraries_root() const {
+    return lib_root_;
+  }
+  bool is_key_state() const {
+    return is_key_state_;
+  }
+  Ref<vm::Cell> get_state_extra_root() const {
+    return state_extra_root_;
+  }
+  ton::CatchainSeqno get_shard_cc_seqno(ton::ShardIdFull shard) const;
+  bool get_last_key_block(ton::BlockIdExt& blkid, ton::LogicalTime& blklt, bool strict = false) const;
+  bool get_old_mc_block_id(ton::BlockSeqno seqno, ton::BlockIdExt& blkid, ton::LogicalTime* end_lt = nullptr) const;
+  bool check_old_mc_block_id(const ton::BlockIdExt& blkid, bool strict = false) const;
+  // returns block with min seqno and req_lt <= block.end_lt
+  bool get_mc_block_by_lt(ton::LogicalTime lt, ton::BlockIdExt& blkid, ton::LogicalTime* end_lt = nullptr) const;
+  bool get_prev_key_block(ton::BlockSeqno req_seqno, ton::BlockIdExt& blkid, ton::LogicalTime* end_lt = nullptr) const;
+  bool get_next_key_block(ton::BlockSeqno req_seqno, ton::BlockIdExt& blkid, ton::LogicalTime* end_lt = nullptr) const;
+  td::Result<std::vector<std::pair<ton::StdSmcAddress, int>>> get_special_ticktock_smartcontracts(
+      int tick_tock = 3) const;
+  int get_smc_tick_tock(td::ConstBitPtr smc_addr) const;
+  std::unique_ptr<vm::AugmentedDictionary> create_accounts_dict() const;
+  const vm::AugmentedDictionary& get_accounts_dict() const;
+  std::vector<ton::ValidatorDescr> compute_validator_set_cc(ton::ShardIdFull shard, const block::ValidatorSet& vset,
+                                                            ton::UnixTime time,
+                                                            ton::CatchainSeqno* cc_seqno_delta = nullptr) const;
+  std::vector<ton::ValidatorDescr> compute_validator_set_cc(ton::ShardIdFull shard, ton::UnixTime time,
+                                                            ton::CatchainSeqno* cc_seqno_delta = nullptr) const;
+  static td::Result<std::unique_ptr<ConfigInfo>> extract_config(std::shared_ptr<vm::StaticBagOfCellsDb> static_boc,
+                                                                int mode = 0);
+  static td::Result<std::unique_ptr<ConfigInfo>> extract_config(Ref<vm::Cell> mc_state_root, int mode = 0);
+
+ private:
+  ConfigInfo(Ref<vm::Cell> mc_state_root, int _mode = 0);
+  td::Status unpack_wrapped();
+  td::Status unpack();
+  void reset_mc_hash();
+  void cleanup();
+};
+
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/output-queue-merger.cpp b/submodules/ton/tonlib-src/crypto/block/output-queue-merger.cpp
new file mode 100644
index 0000000000..981f1f95e8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/output-queue-merger.cpp
@@ -0,0 +1,221 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "output-queue-merger.h"
+
+namespace block {
+
+/*
+ * 
+ *  OUTPUT QUEUE MERGER 
+ * 
+ */
+
+bool OutputQueueMerger::MsgKeyValue::operator<(const MsgKeyValue& other) const {
+  return lt < other.lt ||
+         (lt == other.lt && td::bitstring::bits_memcmp(key.cbits() + 96, other.key.cbits() + 96, 256) < 0);
+}
+
+bool OutputQueueMerger::MsgKeyValue::less(const std::unique_ptr<MsgKeyValue>& he1,
+                                          const std::unique_ptr<MsgKeyValue>& he2) {
+  return *he1 < *he2;
+}
+
+bool OutputQueueMerger::MsgKeyValue::greater(const std::unique_ptr<MsgKeyValue>& he1,
+                                             const std::unique_ptr<MsgKeyValue>& he2) {
+  return *he2 < *he1;
+}
+
+OutputQueueMerger::MsgKeyValue::MsgKeyValue(td::ConstBitPtr key_pfx, int key_pfx_len, int _src, Ref<vm::Cell> node)
+    : source(_src) {
+  unpack_node(key_pfx, key_pfx_len, std::move(node));
+}
+
+OutputQueueMerger::MsgKeyValue::MsgKeyValue(int _src, Ref<vm::Cell> node) : source(_src) {
+  unpack_node(td::ConstBitPtr{nullptr}, 0, std::move(node));
+}
+
+bool OutputQueueMerger::MsgKeyValue::invalidate() {
+  msg.clear();
+  lt = 0;
+  source = -1;
+  return false;
+}
+
+ton::LogicalTime OutputQueueMerger::MsgKeyValue::get_node_lt(Ref<vm::Cell> node, int key_pfx_len) {
+  if (node.is_null() || (unsigned)key_pfx_len > (unsigned)max_key_len) {
+    return std::numeric_limits<td::uint64>::max();
+  }
+  vm::dict::LabelParser label{std::move(node), max_key_len - key_pfx_len, vm::dict::LabelParser::chk_size};
+  if (!label.is_valid()) {
+    return std::numeric_limits<td::uint64>::max();
+  }
+  label.skip_label();
+  return label.remainder->prefetch_ulong(64);
+}
+
+bool OutputQueueMerger::MsgKeyValue::unpack_node(td::ConstBitPtr key_pfx, int key_pfx_len, Ref<vm::Cell> node) {
+  if (node.is_null() || (unsigned)key_pfx_len >= (unsigned)max_key_len) {
+    return invalidate();
+  }
+  if (!key_pfx.is_null()) {
+    td::bitstring::bits_memcpy(key.bits(), key_pfx, key_pfx_len);
+  }
+  vm::dict::LabelParser label{std::move(node), max_key_len - key_pfx_len, vm::dict::LabelParser::chk_size};
+  if (!label.is_valid()) {
+    return invalidate();
+  }
+  label.extract_label_to(key.bits() + key_pfx_len);
+  key_len = key_pfx_len + label.l_bits;
+  msg = std::move(label.remainder);
+  if (!msg.write().fetch_uint_to(64, lt)) {
+    return invalidate();
+  }
+  if (is_fork() && msg->size_ext() != 0x20000) {
+    return invalidate();
+  }
+  return true;
+}
+
+bool OutputQueueMerger::MsgKeyValue::replace_with_child(bool child_idx) {
+  if (!is_fork() || msg.is_null() || msg->size_ext() != 0x20000) {
+    return false;
+  }
+  key[key_len] = child_idx;
+  return unpack_node(td::ConstBitPtr{nullptr}, key_len + 1, msg->prefetch_ref(child_idx));
+}
+
+bool OutputQueueMerger::MsgKeyValue::replace_by_prefix(td::ConstBitPtr req_pfx, int req_pfx_len) {
+  do {
+    if (td::bitstring::bits_memcmp(req_pfx, key.cbits(), std::min(req_pfx_len, key_len))) {
+      return false;
+    }
+    if (key_len >= req_pfx_len) {
+      return true;
+    }
+  } while (replace_with_child(req_pfx[key_len]));
+  return false;
+}
+
+bool OutputQueueMerger::MsgKeyValue::split(MsgKeyValue& second) {
+  if (!is_fork() || msg.is_null()) {
+    return false;
+  }
+  unsigned long long keep_lt = lt;
+  unsigned long long left_lt = get_node_lt(msg->prefetch_ref(0), key_len + 1);
+  bool sw = (left_lt == lt);
+  second.source = source;
+  key[key_len] = sw;
+  if (!second.unpack_node(key.cbits(), key_len + 1, msg->prefetch_ref(sw))) {
+    return false;
+  }
+  key[key_len] = 1 - sw;
+  if (!unpack_node(td::ConstBitPtr{nullptr}, key_len + 1, msg->prefetch_ref(1 - sw))) {
+    return false;
+  }
+  if (lt != keep_lt || second.lt < keep_lt) {
+    return false;
+  }
+  return true;
+}
+
+bool OutputQueueMerger::add_root(int src, Ref<vm::Cell> outmsg_root) {
+  if (outmsg_root.is_null()) {
+    return true;
+  }
+  //block::gen::HashmapAug{352, block::gen::t_EnqueuedMsg, block::gen::t_uint64}.print_ref(std::cerr, outmsg_root);
+  auto kv = std::make_unique<MsgKeyValue>(src, std::move(outmsg_root));
+  if (kv->replace_by_prefix(common_pfx.cbits(), common_pfx_len)) {
+    heap.push_back(std::move(kv));
+  }
+  return true;
+}
+
+OutputQueueMerger::OutputQueueMerger(ton::ShardIdFull _queue_for, std::vector<block::McShardDescr> _neighbors)
+    : queue_for(_queue_for), neighbors(std::move(_neighbors)), eof(false), failed(false) {
+  init();
+}
+
+void OutputQueueMerger::init() {
+  common_pfx.bits().store_int(queue_for.workchain, 32);
+  int l = queue_for.pfx_len();
+  td::bitstring::bits_store_long_top(common_pfx.bits() + 32, queue_for.shard, l);
+  common_pfx_len = 32 + l;
+  int i = 0;
+  for (block::McShardDescr& neighbor : neighbors) {
+    if (!neighbor.is_disabled()) {
+      LOG(DEBUG) << "adding " << (neighbor.outmsg_root.is_null() ? "" : "non-") << "empty output queue for neighbor #"
+                 << i << " (" << neighbor.blk_.to_str() << ")";
+      add_root(i++, neighbor.outmsg_root);
+    } else {
+      LOG(DEBUG) << "skipping output queue for disabled neighbor #" << i;
+      i++;
+    }
+  }
+  std::make_heap(heap.begin(), heap.end(), MsgKeyValue::greater);
+  eof = heap.empty();
+  if (!eof) {
+    load();
+  }
+}
+
+OutputQueueMerger::MsgKeyValue* OutputQueueMerger::cur() {
+  return eof ? nullptr : msg_list.at(pos).get();
+}
+
+std::unique_ptr<OutputQueueMerger::MsgKeyValue> OutputQueueMerger::extract_cur() {
+  return eof ? std::unique_ptr<MsgKeyValue>{} : std::move(msg_list.at(pos));
+}
+
+bool OutputQueueMerger::next() {
+  if (eof) {
+    return false;
+  } else if (++pos < msg_list.size() || load()) {
+    return true;
+  } else {
+    eof = true;
+    return false;
+  }
+}
+
+bool OutputQueueMerger::load() {
+  if (heap.empty() || failed) {
+    return false;
+  }
+  unsigned long long lt = heap[0]->lt;
+  std::size_t orig_size = msg_list.size();
+  do {
+    while (heap[0]->is_fork()) {
+      auto other = std::make_unique<MsgKeyValue>();
+      if (!heap[0]->split(*other)) {
+        failed = true;
+        return false;
+      }
+      heap.push_back(std::move(other));
+      std::push_heap(heap.begin(), heap.end(), MsgKeyValue::greater);
+    }
+    assert(heap[0]->lt == lt);
+    std::pop_heap(heap.begin(), heap.end(), MsgKeyValue::greater);
+    msg_list.push_back(std::move(heap.back()));
+    heap.pop_back();
+  } while (!heap.empty() && heap[0]->lt <= lt);
+  std::sort(msg_list.begin() + orig_size, msg_list.end(), MsgKeyValue::less);
+  return true;
+}
+
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/output-queue-merger.h b/submodules/ton/tonlib-src/crypto/block/output-queue-merger.h
new file mode 100644
index 0000000000..942ca7c8b8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/output-queue-merger.h
@@ -0,0 +1,80 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "ton/ton-types.h"
+#include "vm/cells/CellSlice.h"
+#include "block/mc-config.h"
+
+namespace block {
+using td::Ref;
+
+struct OutputQueueMerger {
+  struct MsgKeyValue {
+    static constexpr int max_key_len = 32 + 64 + 256;
+    Ref<vm::CellSlice> msg;
+    unsigned long long lt;
+    int source;
+    int key_len{0};
+    td::BitArray<max_key_len> key;
+    MsgKeyValue() = default;
+    MsgKeyValue(int src, Ref<vm::Cell> node);
+    MsgKeyValue(td::ConstBitPtr key_pfx, int key_pfx_len, int src, Ref<vm::Cell> node);
+    bool operator<(const MsgKeyValue& other) const;
+    bool is_fork() const {
+      return key_len < max_key_len;
+    }
+    bool invalidate();
+    static bool less(const std::unique_ptr<MsgKeyValue>& he1, const std::unique_ptr<MsgKeyValue>& he2);
+    static bool greater(const std::unique_ptr<MsgKeyValue>& he1, const std::unique_ptr<MsgKeyValue>& he2);
+
+   protected:
+    friend struct OutputQueueMerger;
+    static ton::LogicalTime get_node_lt(Ref<vm::Cell> node, int key_pfx_len);
+    bool replace_with_child(bool child_idx);
+    bool replace_by_prefix(td::ConstBitPtr req_pfx, int req_pfx_len);
+    bool unpack_node(td::ConstBitPtr key_pfx, int key_pfx_len, Ref<vm::Cell> node);
+    bool split(MsgKeyValue& second);
+  };
+  //
+  ton::ShardIdFull queue_for;
+  std::vector<std::unique_ptr<MsgKeyValue>> msg_list;
+  std::vector<block::McShardDescr> neighbors;
+
+ public:
+  OutputQueueMerger(ton::ShardIdFull _queue_for, std::vector<block::McShardDescr> _neighbors);
+  bool is_eof() const {
+    return eof;
+  }
+  MsgKeyValue* cur();
+  std::unique_ptr<MsgKeyValue> extract_cur();
+  bool next();
+
+ private:
+  td::BitArray<32 + 64> common_pfx;
+  int common_pfx_len;
+  std::vector<std::unique_ptr<MsgKeyValue>> heap;
+  std::size_t pos{0};
+  bool eof;
+  bool failed;
+  void init();
+  bool add_root(int src, Ref<vm::Cell> outmsg_root);
+  bool load();
+};
+
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/test-block.cpp b/submodules/ton/tonlib-src/crypto/block/test-block.cpp
new file mode 100644
index 0000000000..6e10ebe9ac
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/test-block.cpp
@@ -0,0 +1,248 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "block/block.h"
+#include "vm/boc.h"
+#include <iostream>
+#include "block-db.h"
+#include "block-auto.h"
+#include "block-parse.h"
+#include "vm/cp0.h"
+#include <getopt.h>
+
+using td::Ref;
+
+int verbosity;
+
+struct IntError {
+  std::string err_msg;
+  IntError(std::string _msg) : err_msg(_msg) {
+  }
+  IntError(const char* _msg) : err_msg(_msg) {
+  }
+};
+
+td::Ref<vm::Cell> load_boc(std::string filename) {
+  std::cerr << "loading bag-of-cell file " << filename << std::endl;
+  auto bytes_res = block::load_binary_file(filename);
+  if (bytes_res.is_error()) {
+    throw IntError{PSTRING() << "cannot load file `" << filename << "` : " << bytes_res.move_as_error()};
+  }
+  vm::BagOfCells boc;
+  auto res = boc.deserialize(bytes_res.move_as_ok());
+  if (res.is_error()) {
+    throw IntError{PSTRING() << "cannot deserialize bag-of-cells " << res.move_as_error()};
+  }
+  if (res.move_as_ok() <= 0 || boc.get_root_cell().is_null()) {
+    throw IntError{"cannot deserialize bag-of-cells "};
+  }
+  return boc.get_root_cell();
+}
+
+void test1() {
+  block::ShardId id{ton::masterchainId}, id2{ton::basechainId, 0x11efULL << 48};
+  std::cout << '[' << id << "][" << id2 << ']' << std::endl;
+  vm::CellBuilder cb;
+  cb << id << id2;
+  std::cout << "ShardIdent.pack() = " << block::tlb::t_ShardIdent.pack(cb, {12, 3, 0x3aeULL << 52}) << std::endl;
+  std::cout << cb << std::endl;
+  auto cref = cb.finalize();
+  td::Ref<vm::CellSlice> cs{true, cref}, cs2;
+  block::ShardId id3{cs.write()}, id4, id5;
+  cs >> id4 >> id5;
+  std::cout << '[' << id3 << "][" << id4 << "][" << id5 << ']' << std::endl;
+  vm::CellSlice csl{std::move(cref)};
+  std::cout << "ShardIdent.get_size() = " << block::tlb::t_ShardIdent.get_size(csl) << std::endl;
+  std::cout << "MsgAddress.get_size() = " << block::tlb::t_MsgAddress.get_size(csl) << std::endl;
+  std::cout << "Grams.get_size() = " << block::tlb::t_Grams.get_size(csl) << std::endl;
+  std::cout << "Grams.as_integer() = " << block::tlb::t_Grams.as_integer(csl) << std::endl;
+  (csl + 8).print_rec(std::cout);
+  std::cout << "Grams.get_size() = " << block::tlb::t_Grams.get_size(csl + 8) << std::endl;
+  std::cout << "Grams.as_integer() = " << block::tlb::t_Grams.as_integer(csl + 8) << std::endl;
+
+  vm::CellSlice csl2{csl};
+  block::gen::ShardIdent::Record sh_id;
+  for (int i = 0; i < 3; i++) {
+    std::cout << csl2 << std::endl;
+    bool ok = tlb::unpack(csl2, sh_id);
+    std::cout << "block::gen::ShardIdent.unpack() = " << ok << std::endl;
+    if (ok) {
+      std::cout << "  (shard_ident shard_pfx_bits:" << sh_id.shard_pfx_bits << " workchain_id:" << sh_id.workchain_id
+                << " shard_prefix:" << std::hex << sh_id.shard_prefix << std::dec << ")" << std::endl;
+    }
+  }
+
+  block::tlb::ShardIdent::Record shard_id;
+  for (int i = 0; i < 3; i++) {
+    std::cout << "ShardIdent.validate() = " << block::tlb::t_ShardIdent.validate(csl) << std::endl;
+    csl.print_rec(std::cerr);
+    csl.dump(std::cerr, 7);
+    std::cout << "ShardIdent.unpack() = " << block::tlb::t_ShardIdent.unpack(csl, shard_id) << std::endl;
+    if (shard_id.is_valid()) {
+      std::cout << "shard_pfx_bits:" << shard_id.shard_pfx_bits << " workchain_id:" << shard_id.workchain_id
+                << " shard_prefix:" << shard_id.shard_prefix << std::endl;
+    }
+  }
+  std::cout << "ShardIdent.skip_validate() = " << block::tlb::t_ShardIdent.validate_skip(csl) << std::endl;
+  std::cout << "ShardIdent.skip_validate() = " << block::tlb::t_ShardIdent.validate_skip(csl) << std::endl;
+  std::cout << "ShardIdent.skip_validate() = " << block::tlb::t_ShardIdent.validate_skip(csl) << std::endl;
+  using namespace td::literals;
+  std::cout << "Grams.store_intval(239) = " << block::tlb::t_Grams.store_integer_value(cb, "239"_i256) << std::endl;
+  std::cout << "Grams.store_intval(17239) = " << block::tlb::t_Grams.store_integer_value(cb, "17239"_i256) << std::endl;
+  std::cout << "Grams.store_intval(-17) = " << block::tlb::t_Grams.store_integer_value(cb, "-17"_i256) << std::endl;
+  std::cout << "Grams.store_intval(0) = " << block::tlb::t_Grams.store_integer_value(cb, "0"_i256) << std::endl;
+  std::cout << cb << std::endl;
+  cs = td::Ref<vm::CellSlice>{true, cb.finalize()};
+  std::cout << "Grams.store_intval(666) = " << block::tlb::t_Grams.store_integer_value(cb, "666"_i256) << std::endl;
+  std::cout << cb << std::endl;
+  cs2 = td::Ref<vm::CellSlice>{true, cb.finalize()};
+  std::cout << "Grams.validate(cs) = " << block::tlb::t_Grams.validate(*cs) << std::endl;
+  std::cout << "Grams.validate(cs2) = " << block::tlb::t_Grams.validate(*cs2) << std::endl;
+  //
+  block::gen::SplitMergeInfo::Record data;
+  block::gen::Grams::Record data2;
+  std::cout << "block::gen::Grams.validate(cs) = " << block::gen::t_Grams.validate(*cs) << std::endl;
+  std::cout << "block::gen::Grams.validate(cs2) = " << block::gen::t_Grams.validate(*cs2) << std::endl;
+  std::cout << "[cs = " << cs << "]" << std::endl;
+  bool ok = tlb::csr_unpack_inexact(cs, data);
+  std::cout << "block::gen::SplitMergeInfo.unpack(cs, data) = " << ok << std::endl;
+  if (ok) {
+    std::cout << "  cur_shard_pfx_len = " << data.cur_shard_pfx_len << "; acc_split_depth = " << data.acc_split_depth
+              << "; this_addr = " << data.this_addr << "; sibling_addr = " << data.sibling_addr << std::endl;
+  }
+  ok = tlb::csr_unpack_inexact(cs, data2);
+  std::cout << "block::gen::Grams.unpack(cs, data2) = " << ok << std::endl;
+  if (ok) {
+    std::cout << "  amount = " << data2.amount << std::endl;
+    block::gen::VarUInteger::Record data3;
+    ok = tlb::csr_type_unpack(data2.amount, block::gen::t_VarUInteger_16, data3);
+    std::cout << "  block::gen::VarUInteger16.unpack(amount, data3) = " << ok << std::endl;
+    if (ok) {
+      std::cout << "    len = " << data3.len << "; value = " << data3.value << std::endl;
+      vm::CellBuilder cb;
+      std::cout << "    block::gen::VarUInteger16.pack(cb, data3) = "
+                << tlb::type_pack(cb, block::gen::t_VarUInteger_16, data3) << std::endl;
+      std::cout << "    cb = " << cb.finalize() << std::endl;
+    }
+  }
+  /* 
+  {
+    vm::CellBuilder cb;
+    td::BitArray<256> hash;
+    std::memset(hash.data(), 0x69, 32);
+    bool ok = tlb::pack(
+        cb, block::gen::Test::Record{1000000000000, {170239, -888, {239017, "1000000000000000000"_ri256}, hash}, 17});
+    std::cout << "  block::gen::Test::pack(cb, {1000000000000, ...}) = " << ok << std::endl;
+    std::cout << "  cb = " << cb << std::endl;
+    auto cell = cb.finalize();
+    vm::CellSlice cs{cell};
+    cs.print_rec(std::cout);
+    block::gen::Test::Record data;
+    std::cout << "  block::gen::Test::validate_ref(cell) = " << block::gen::t_Test.validate_ref(cell) << std::endl;
+    ok = tlb::unpack(cs, data);
+    std::cout << "  block::gen::Test::unpack(cs, data) = " << ok << std::endl;
+    if (ok) {
+      std::cout << "a:" << data.a << " b:" << data.r1.b << " c:" << data.r1.c << " d:" << data.r1.r1.d
+                << " e:" << data.r1.r1.e << " f:" << data.r1.f << " g:" << data.g << std::endl;
+    }
+    std::cout << "  block::gen::Test::print_ref(cell) = ";
+    block::gen::t_Test.print_ref(std::cout, cell, 2);
+    block::gen::t_CurrencyCollection.print_ref(std::cout, cell, 2);
+    std::cout << std::endl;
+  }
+  */
+  std::cout << "Grams.add_values() = " << block::tlb::t_Grams.add_values(cb, cs.write(), cs2.write()) << std::endl;
+  std::cout << cb << std::endl;
+  std::cout << "block::gen::t_HashmapAug_64_...print_type() = "
+            << block::gen::t_HashmapAug_64_Ref_Transaction_CurrencyCollection << std::endl;
+}
+
+void test2(vm::CellSlice& cs) {
+  std::cout << "Bool.validate() = " << block::tlb::t_Bool.validate(cs) << std::endl;
+  std::cout << "UInt16.validate() = " << block::tlb::t_uint16.validate(cs) << std::endl;
+  std::cout << "HashmapE(32,UInt16).validate() = " << block::tlb::HashmapE(32, block::tlb::t_uint16).validate(cs)
+            << std::endl;
+  std::cout << "block::gen::HashmapE(32,UInt16).validate() = "
+            << block::gen::HashmapE{32, block::gen::t_uint16}.validate(cs) << std::endl;
+}
+
+void usage() {
+  std::cout << "usage: test-block [<boc-file>]\n\tor test-block -h\n";
+  std::exit(2);
+}
+
+int main(int argc, char* const argv[]) {
+  int i;
+  int new_verbosity_level = VERBOSITY_NAME(INFO);
+  auto zerostate = std::make_unique<block::ZerostateInfo>();
+  while ((i = getopt(argc, argv, "hv:")) != -1) {
+    switch (i) {
+      case 'v':
+        new_verbosity_level = VERBOSITY_NAME(FATAL) + (verbosity = td::to_integer<int>(td::Slice(optarg)));
+        break;
+      case 'h':
+        usage();
+        std::exit(2);
+      default:
+        usage();
+        std::exit(2);
+    }
+  }
+  SET_VERBOSITY_LEVEL(new_verbosity_level);
+  try {
+    bool done = false;
+    while (optind < argc) {
+      auto boc = load_boc(argv[optind++]);
+      if (boc.is_null()) {
+        std::cerr << "(invalid boc)" << std::endl;
+        std::exit(2);
+      } else {
+        done = true;
+        vm::CellSlice cs{vm::NoVm(), boc};
+        cs.print_rec(std::cout);
+        std::cout << std::endl;
+        block::gen::t_Block.print_ref(std::cout, boc);
+        std::cout << std::endl;
+        if (!block::gen::t_Block.validate_ref(boc)) {
+          std::cout << "(invalid Block)" << std::endl;
+        } else {
+          std::cout << "(valid Block)" << std::endl;
+        }
+      }
+    }
+    if (!done) {
+      test1();
+    }
+  } catch (IntError& err) {
+    std::cerr << "caught internal error " << err.err_msg << std::endl;
+    return 1;
+  } catch (vm::VmError& err) {
+    std::cerr << "caught vm error " << err.get_msg() << std::endl;
+    return 1;
+  }
+  return 0;
+}
diff --git a/submodules/ton/tonlib-src/crypto/block/transaction.cpp b/submodules/ton/tonlib-src/crypto/block/transaction.cpp
new file mode 100644
index 0000000000..77f3ad0756
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/transaction.cpp
@@ -0,0 +1,2089 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "block/transaction.h"
+#include "block/block.h"
+#include "block/block-parse.h"
+#include "block/block-auto.h"
+#include "td/utils/bits.h"
+#include "td/utils/uint128.h"
+#include "ton/ton-shard.h"
+#include "vm/continuation.h"
+
+namespace block {
+using td::Ref;
+
+Ref<vm::Cell> ComputePhaseConfig::lookup_library(td::ConstBitPtr key) const {
+  return libraries ? vm::lookup_library_in(key, libraries->get_root_cell()) : Ref<vm::Cell>{};
+}
+
+/*
+ * 
+ *   ACCOUNTS
+ * 
+ */
+
+bool Account::set_address(ton::WorkchainId wc, td::ConstBitPtr new_addr) {
+  workchain = wc;
+  addr = new_addr;
+  return true;
+}
+
+bool Account::set_split_depth(int new_split_depth) {
+  if (new_split_depth < 0 || new_split_depth > 30) {
+    return false;  // invalid value for split_depth
+  }
+  if (split_depth_set_) {
+    return split_depth_ == new_split_depth;
+  } else {
+    split_depth_ = (unsigned char)new_split_depth;
+    split_depth_set_ = true;
+    return true;
+  }
+}
+
+bool Account::check_split_depth(int split_depth) const {
+  return split_depth_set_ ? (split_depth == split_depth_) : (split_depth >= 0 && split_depth <= 30);
+}
+
+// initializes split_depth and addr_rewrite
+bool Account::parse_maybe_anycast(vm::CellSlice& cs) {
+  int t = (int)cs.fetch_ulong(1);
+  if (t < 0) {
+    return false;
+  } else if (!t) {
+    return set_split_depth(0);
+  }
+  int depth;
+  return cs.fetch_uint_leq(30, depth)                     // anycast_info$_ depth:(#<= 30)
+         && depth                                         // { depth >= 1 }
+         && cs.fetch_bits_to(addr_rewrite.bits(), depth)  // rewrite_pfx:(bits depth)
+         && set_split_depth(depth);
+}
+
+bool Account::store_maybe_anycast(vm::CellBuilder& cb) const {
+  if (!split_depth_set_ || !split_depth_) {
+    return cb.store_bool_bool(false);
+  }
+  return cb.store_bool_bool(true)                                    // just$1
+         && cb.store_uint_leq(30, split_depth_)                      // depth:(#<= 30)
+         && cb.store_bits_bool(addr_rewrite.cbits(), split_depth_);  // rewrite_pfx:(bits depth)
+}
+
+bool Account::unpack_address(vm::CellSlice& addr_cs) {
+  int addr_tag = block::gen::t_MsgAddressInt.get_tag(addr_cs);
+  int new_wc = ton::workchainInvalid;
+  switch (addr_tag) {
+    case block::gen::MsgAddressInt::addr_std:
+      if (!(addr_cs.advance(2) && parse_maybe_anycast(addr_cs) && addr_cs.fetch_int_to(8, new_wc) &&
+            addr_cs.fetch_bits_to(addr_orig.bits(), 256) && addr_cs.empty_ext())) {
+        return false;
+      }
+      break;
+    case block::gen::MsgAddressInt::addr_var:
+      // cannot appear in masterchain / basechain
+      return false;
+    default:
+      return false;
+  }
+  addr_cs.clear();
+  if (new_wc == ton::workchainInvalid) {
+    return false;
+  }
+  if (workchain == ton::workchainInvalid) {
+    workchain = new_wc;
+    addr = addr_orig;
+    addr.bits().copy_from(addr_rewrite.cbits(), split_depth_);
+  } else if (split_depth_) {
+    ton::StdSmcAddress new_addr = addr_orig;
+    new_addr.bits().copy_from(addr_rewrite.cbits(), split_depth_);
+    if (new_addr != addr) {
+      LOG(ERROR) << "error unpacking account " << workchain << ":" << addr.to_hex()
+                 << " : account header contains different address " << new_addr.to_hex() << " (with splitting depth "
+                 << (int)split_depth_ << ")";
+      return false;
+    }
+  } else if (addr != addr_orig) {
+    LOG(ERROR) << "error unpacking account " << workchain << ":" << addr.to_hex()
+               << " : account header contains different address " << addr_orig.to_hex();
+    return false;
+  }
+  if (workchain != new_wc) {
+    LOG(ERROR) << "error unpacking account " << workchain << ":" << addr.to_hex()
+               << " : account header contains different workchain " << new_wc;
+    return false;
+  }
+  addr_rewrite = addr.bits();  // initialize all 32 bits of addr_rewrite
+  if (!split_depth_) {
+    my_addr_exact = my_addr;
+  }
+  return true;
+}
+
+bool Account::unpack_storage_info(vm::CellSlice& cs) {
+  block::gen::StorageInfo::Record info;
+  block::gen::StorageUsed::Record used;
+  if (!tlb::unpack_exact(cs, info) || !tlb::csr_unpack(info.used, used)) {
+    return false;
+  }
+  last_paid = info.last_paid;
+  if (info.due_payment->prefetch_ulong(1) == 1) {
+    vm::CellSlice& cs2 = info.due_payment.write();
+    cs2.advance(1);
+    due_payment = block::tlb::t_Grams.as_integer_skip(cs2);
+    if (due_payment.is_null() || !cs2.empty_ext()) {
+      return false;
+    }
+  } else {
+    due_payment = td::RefInt256{true, 0};
+  }
+  unsigned long long u = 0;
+  u |= storage_stat.cells = block::tlb::t_VarUInteger_7.as_uint(*used.cells);
+  u |= storage_stat.bits = block::tlb::t_VarUInteger_7.as_uint(*used.bits);
+  u |= storage_stat.public_cells = block::tlb::t_VarUInteger_7.as_uint(*used.public_cells);
+  LOG(DEBUG) << "last_paid=" << last_paid << "; cells=" << storage_stat.cells << " bits=" << storage_stat.bits
+             << " public_cells=" << storage_stat.public_cells;
+  return (u != std::numeric_limits<td::uint64>::max());
+}
+
+// initializes split_depth (from account state - StateInit)
+bool Account::unpack_state(vm::CellSlice& cs) {
+  block::gen::StateInit::Record state;
+  if (!tlb::unpack_exact(cs, state)) {
+    return false;
+  }
+  int sd = 0;
+  if (state.split_depth->size() == 6) {
+    sd = (int)state.split_depth->prefetch_ulong(6) - 32;
+  }
+  if (!set_split_depth(sd)) {
+    return false;
+  }
+  if (state.special->size() > 1) {
+    int z = (int)state.special->prefetch_ulong(3);
+    if (z < 0) {
+      return false;
+    }
+    tick = z & 2;
+    tock = z & 1;
+    LOG(DEBUG) << "tick=" << tick << ", tock=" << tock;
+  }
+  code = state.code->prefetch_ref();
+  data = state.data->prefetch_ref();
+  library = orig_library = state.library->prefetch_ref();
+  return true;
+}
+
+bool Account::compute_my_addr(bool force) {
+  if (!force && my_addr.not_null() && my_addr_exact.not_null()) {
+    return true;
+  }
+  if (workchain == ton::workchainInvalid) {
+    my_addr.clear();
+    return false;
+  }
+  vm::CellBuilder cb;
+  Ref<vm::Cell> cell, cell2;
+  if (workchain >= -128 && workchain < 127) {
+    if (!(cb.store_long_bool(2, 2)                             // addr_std$10
+          && store_maybe_anycast(cb)                           // anycast:(Maybe Anycast)
+          && cb.store_long_rchk_bool(workchain, 8)             // workchain_id:int8
+          && cb.store_bits_bool(addr_orig)                     // addr:bits256
+          && cb.finalize_to(cell) && cb.store_long_bool(4, 3)  // addr_std$10 anycast:(Maybe Anycast)
+          && cb.store_long_rchk_bool(workchain, 8)             // workchain_id:int8
+          && cb.store_bits_bool(addr)                          // addr:bits256
+          && cb.finalize_to(cell2))) {
+      return false;
+    }
+  } else {
+    if (!(cb.store_long_bool(3, 2)                             // addr_var$11
+          && store_maybe_anycast(cb)                           // anycast:(Maybe Anycast)
+          && cb.store_long_bool(256, 9)                        // addr_len:(## 9)
+          && cb.store_long_rchk_bool(workchain, 32)            // workchain_id:int32
+          && cb.store_bits_bool(addr_orig)                     // addr:(bits addr_len)
+          && cb.finalize_to(cell) && cb.store_long_bool(6, 3)  // addr_var$11 anycast:(Maybe Anycast)
+          && cb.store_long_bool(256, 9)                        // addr_len:(## 9)
+          && cb.store_long_rchk_bool(workchain, 32)            // workchain_id:int32
+          && cb.store_bits_bool(addr)                          // addr:(bits addr_len)
+          && cb.finalize_to(cell2))) {
+      return false;
+    }
+  }
+  my_addr = load_cell_slice_ref(std::move(cell));
+  my_addr_exact = load_cell_slice_ref(std::move(cell2));
+  return true;
+}
+
+bool Account::recompute_tmp_addr(Ref<vm::CellSlice>& tmp_addr, int split_depth,
+                                 td::ConstBitPtr orig_addr_rewrite) const {
+  if (!split_depth && my_addr_exact.not_null()) {
+    tmp_addr = my_addr_exact;
+    return true;
+  }
+  if (split_depth == split_depth_ && my_addr.not_null()) {
+    tmp_addr = my_addr;
+    return true;
+  }
+  if (split_depth < 0 || split_depth > 30) {
+    return false;
+  }
+  vm::CellBuilder cb;
+  bool std = (workchain >= -128 && workchain < 128);
+  if (!cb.store_long_bool(std ? 2 : 3, 2)) {  // addr_std$10 or addr_var$11
+    return false;
+  }
+  if (!split_depth) {
+    if (!cb.store_bool_bool(false)) {  // anycast:(Maybe Anycast)
+      return false;
+    }
+  } else if (!(cb.store_bool_bool(true)                             // just$1
+               && cb.store_long_bool(split_depth, 5)                // depth:(#<= 30)
+               && cb.store_bits_bool(addr.bits(), split_depth))) {  // rewrite_pfx:(bits depth)
+    return false;
+  }
+  if (std) {
+    if (!cb.store_long_rchk_bool(workchain, 8)) {  // workchain:int8
+      return false;
+    }
+  } else if (!(cb.store_long_bool(256, 9)                // addr_len:(## 9)
+               && cb.store_long_bool(workchain, 32))) {  // workchain:int32
+    return false;
+  }
+  Ref<vm::Cell> cell;
+  return cb.store_bits_bool(orig_addr_rewrite, split_depth)  // address:(bits addr_len) or bits256
+         && cb.store_bits_bool(addr.bits() + split_depth, 256 - split_depth) && cb.finalize_to(cell) &&
+         (tmp_addr = vm::load_cell_slice_ref(std::move(cell))).not_null();
+}
+
+bool Account::init_rewrite_addr(int split_depth, td::ConstBitPtr orig_addr_rewrite) {
+  if (split_depth_set_ || !created || !set_split_depth(split_depth)) {
+    return false;
+  }
+  addr_orig = addr;
+  addr_rewrite = addr.bits();
+  addr_orig.bits().copy_from(orig_addr_rewrite, split_depth);
+  return compute_my_addr(true);
+}
+
+// used to unpack previously existing accounts
+bool Account::unpack(Ref<vm::CellSlice> shard_account, Ref<vm::CellSlice> extra, ton::UnixTime now, bool special) {
+  LOG(DEBUG) << "unpacking " << (special ? "special " : "") << "account " << addr.to_hex();
+  if (shard_account.is_null()) {
+    LOG(ERROR) << "account " << addr.to_hex() << " does not have a valid ShardAccount to unpack";
+    return false;
+  }
+  if (verbosity > 2) {
+    shard_account->print_rec(std::cerr, 2);
+    block::gen::t_ShardAccount.print(std::cerr, *shard_account);
+  }
+  block::gen::ShardAccount::Record acc_info;
+  if (!(block::gen::t_ShardAccount.validate_csr(shard_account) &&
+        block::tlb::t_ShardAccount.validate_csr(shard_account) && tlb::unpack_exact(shard_account.write(), acc_info))) {
+    LOG(ERROR) << "account " << addr.to_hex() << " state is invalid";
+    return false;
+  }
+  last_trans_lt_ = acc_info.last_trans_lt;
+  last_trans_hash_ = acc_info.last_trans_hash;
+  now_ = now;
+  auto account = std::move(acc_info.account);
+  total_state = orig_total_state = account;
+  auto acc_cs = load_cell_slice(std::move(account));
+  if (block::gen::t_Account.get_tag(acc_cs) == block::gen::Account::account_none) {
+    status = acc_nonexist;
+    last_paid = 0;
+    last_trans_end_lt_ = 0;
+    is_special = special;
+    if (workchain != ton::workchainInvalid) {
+      addr_orig = addr;
+      addr_rewrite = addr.cbits();
+    }
+    return compute_my_addr() && acc_cs.size_ext() == 1;
+  }
+  block::gen::Account::Record_account acc;
+  block::gen::AccountStorage::Record storage;
+  if (!(tlb::unpack_exact(acc_cs, acc) && (my_addr = acc.addr).not_null() && unpack_address(acc.addr.write()) &&
+        compute_my_addr() && unpack_storage_info(acc.storage_stat.write()) &&
+        tlb::csr_unpack(std::move(acc.storage), storage) &&
+        std::max(storage.last_trans_lt, 1ULL) > acc_info.last_trans_lt && balance.unpack(std::move(storage.balance)))) {
+    return false;
+  }
+  is_special = special;
+  last_trans_end_lt_ = storage.last_trans_lt;
+  switch (block::gen::t_AccountState.get_tag(*storage.state)) {
+    case block::gen::AccountState::account_uninit:
+      status = orig_status = acc_uninit;
+      state_hash = addr;
+      break;
+    case block::gen::AccountState::account_frozen:
+      status = orig_status = acc_frozen;
+      if (!storage.state->have(2 + 256)) {
+        return false;
+      }
+      state_hash = storage.state->data_bits() + 2;
+      break;
+    case block::gen::AccountState::account_active:
+      status = orig_status = acc_active;
+      if (storage.state.write().fetch_ulong(1) != 1) {
+        return false;
+      }
+      inner_state = storage.state;
+      if (!unpack_state(storage.state.write())) {
+        return false;
+      }
+      state_hash.clear();
+      break;
+    default:
+      return false;
+  }
+  LOG(DEBUG) << "end of Account.unpack() for " << workchain << ":" << addr.to_hex()
+             << " (balance = " << balance.to_str() << " ; last_trans_lt = " << last_trans_lt_ << ".."
+             << last_trans_end_lt_ << ")";
+  return true;
+}
+
+// used to initialize new accounts
+bool Account::init_new(ton::UnixTime now) {
+  // only workchain and addr are initialized at this point
+  if (workchain == ton::workchainInvalid) {
+    return false;
+  }
+  addr_orig = addr;
+  addr_rewrite = addr.cbits();
+  last_trans_lt_ = last_trans_end_lt_ = 0;
+  last_trans_hash_.set_zero();
+  now_ = now;
+  last_paid = 0;
+  storage_stat.clear();
+  due_payment = td::RefInt256{true, 0};
+  balance.set_zero();
+  if (my_addr_exact.is_null()) {
+    vm::CellBuilder cb;
+    if (workchain >= -128 && workchain < 128) {
+      CHECK(cb.store_long_bool(4, 3)                  // addr_std$10 anycast:(Maybe Anycast)
+            && cb.store_long_rchk_bool(workchain, 8)  // workchain:int8
+            && cb.store_bits_bool(addr));             // address:bits256
+    } else {
+      CHECK(cb.store_long_bool(0xd00, 12)              // addr_var$11 anycast:(Maybe Anycast) addr_len:(## 9)
+            && cb.store_long_rchk_bool(workchain, 32)  // workchain:int32
+            && cb.store_bits_bool(addr));              // address:(bits addr_len)
+    }
+    my_addr_exact = load_cell_slice_ref(cb.finalize());
+  }
+  if (my_addr.is_null()) {
+    my_addr = my_addr_exact;
+  }
+  if (total_state.is_null()) {
+    vm::CellBuilder cb;
+    CHECK(cb.store_long_bool(0, 1)  // account_none$0 = Account
+          && cb.finalize_to(total_state));
+    orig_total_state = total_state;
+  }
+  state_hash = addr_orig;
+  status = orig_status = acc_nonexist;
+  created = true;
+  return true;
+}
+
+bool Account::belongs_to_shard(ton::ShardIdFull shard) const {
+  return workchain == shard.workchain && ton::shard_is_ancestor(shard.shard, addr);
+}
+
+void add_partial_storage_payment(td::BigInt256& payment, ton::UnixTime delta, const block::StoragePrices& prices,
+                                 const vm::CellStorageStat& storage, bool is_mc) {
+  td::BigInt256 c{(long long)storage.cells}, b{(long long)storage.bits};
+  if (is_mc) {
+    // storage.cells * prices.mc_cell_price + storage.bits * prices.mc_bit_price;
+    c.mul_short(prices.mc_cell_price);
+    b.mul_short(prices.mc_bit_price);
+  } else {
+    // storage.cells * prices.cell_price + storage.bits * prices.bit_price;
+    c.mul_short(prices.cell_price);
+    b.mul_short(prices.bit_price);
+  }
+  b += c;
+  b.mul_short(delta);
+  CHECK(b.sgn() >= 0);
+  payment += b;
+}
+
+td::RefInt256 Account::compute_storage_fees(ton::UnixTime now, const std::vector<block::StoragePrices>& pricing) const {
+  if (now <= last_paid || !last_paid || is_special || pricing.empty() || now <= pricing[0].valid_since) {
+    return {};
+  }
+  std::size_t n = pricing.size(), i = n;
+  while (i && pricing[i - 1].valid_since > last_paid) {
+    --i;
+  }
+  if (i) {
+    --i;
+  }
+  ton::UnixTime upto = std::max(last_paid, pricing[0].valid_since);
+  td::RefInt256 total{true, 0};
+  for (; i < n && upto < now; i++) {
+    ton::UnixTime valid_until = (i < n - 1 ? std::min(now, pricing[i + 1].valid_since) : now);
+    if (upto < valid_until) {
+      assert(upto >= pricing[i].valid_since);
+      add_partial_storage_payment(total.unique_write(), valid_until - upto, pricing[i], storage_stat, is_masterchain());
+    }
+    upto = valid_until;
+  }
+  total.unique_write().rshift(16, 1);  // divide by 2^16 with ceil rounding to obtain nanograms
+  return total;
+}
+
+Transaction::Transaction(const Account& _account, int ttype, ton::LogicalTime req_start_lt, ton::UnixTime _now,
+                         Ref<vm::Cell> _inmsg)
+    : trans_type(ttype)
+    , is_first(_account.transactions.empty())
+    , new_tick(_account.tick)
+    , new_tock(_account.tock)
+    , now(_now)
+    , account(_account)
+    , my_addr(_account.my_addr)
+    , my_addr_exact(_account.my_addr_exact)
+    , balance(_account.balance)
+    , due_payment(_account.due_payment)
+    , last_paid(_account.last_paid)
+    , new_code(_account.code)
+    , new_data(_account.data)
+    , new_library(_account.library)
+    , in_msg(std::move(_inmsg)) {
+  start_lt = std::max(req_start_lt, account.last_trans_end_lt_);
+  end_lt = start_lt + 1;
+  acc_status = (account.status == Account::acc_nonexist ? Account::acc_uninit : account.status);
+}
+
+bool Transaction::unpack_input_msg(bool ihr_delivered, const ActionPhaseConfig* cfg) {
+  if (in_msg.is_null() || in_msg_type) {
+    return false;
+  }
+  if (verbosity > 2) {
+    fprintf(stderr, "unpacking inbound message for a new transaction: ");
+    block::gen::t_Message_Any.print_ref(std::cerr, in_msg);
+    load_cell_slice(in_msg).print_rec(std::cerr);
+  }
+  auto cs = vm::load_cell_slice(in_msg);
+  int tag = block::gen::t_CommonMsgInfo.get_tag(cs);
+  Ref<vm::CellSlice> src_addr, dest_addr;
+  switch (tag) {
+    case block::gen::CommonMsgInfo::int_msg_info: {
+      block::gen::CommonMsgInfo::Record_int_msg_info info;
+      if (!(tlb::unpack(cs, info) && msg_balance_remaining.unpack(std::move(info.value)))) {
+        return false;
+      }
+      if (info.ihr_disabled && ihr_delivered) {
+        return false;
+      }
+      bounce_enabled = info.bounce;
+      src_addr = std::move(info.src);
+      dest_addr = std::move(info.dest);
+      in_msg_type = 1;
+      td::RefInt256 ihr_fee = block::tlb::t_Grams.as_integer(std::move(info.ihr_fee));
+      if (ihr_delivered) {
+        in_fwd_fee = std::move(ihr_fee);
+      } else {
+        in_fwd_fee = td::RefInt256{true, 0};
+        msg_balance_remaining += std::move(ihr_fee);
+      }
+      if (info.created_lt >= start_lt) {
+        start_lt = info.created_lt + 1;
+        end_lt = start_lt + 1;
+      }
+      // ...
+      break;
+    }
+    case block::gen::CommonMsgInfo::ext_in_msg_info: {
+      block::gen::CommonMsgInfo::Record_ext_in_msg_info info;
+      if (!tlb::unpack(cs, info)) {
+        return false;
+      }
+      src_addr = std::move(info.src);
+      dest_addr = std::move(info.dest);
+      in_msg_type = 2;
+      in_msg_extern = true;
+      // compute forwarding fees for this external message
+      vm::CellStorageStat sstat;       // for message size
+      sstat.compute_used_storage(cs);  // message body
+      sstat.bits -= cs.size();         // bits in the root cells are free
+      sstat.cells--;                   // the root cell itself is not counted as a cell
+      LOG(DEBUG) << "storage paid for a message: " << sstat.cells << " cells, " << sstat.bits << " bits";
+      if (sstat.bits > max_msg_bits || sstat.cells > max_msg_cells) {
+        LOG(DEBUG) << "inbound external message too large, invalid";
+        return false;
+      }
+      // fetch message pricing info
+      CHECK(cfg);
+      const MsgPrices& msg_prices = cfg->fetch_msg_prices(account.is_masterchain());
+      // compute forwarding fees
+      auto fees_c = msg_prices.compute_fwd_ihr_fees(sstat.cells, sstat.bits, true);
+      LOG(DEBUG) << "computed fwd fees = " << fees_c.first << " + " << fees_c.second;
+
+      if (account.is_special) {
+        LOG(DEBUG) << "computed fwd fees set to zero for special account";
+        fees_c.first = fees_c.second = 0;
+      }
+      in_fwd_fee = td::RefInt256{true, fees_c.first};
+      if (balance.grams < in_fwd_fee) {
+        LOG(DEBUG) << "cannot pay for importing this external message";
+        return false;
+      }
+      // (tentatively) debit account for importing this external message
+      balance -= in_fwd_fee;
+      msg_balance_remaining.set_zero();  // external messages cannot carry value
+      // ...
+      break;
+    }
+    default:
+      return false;
+  }
+  // init:(Maybe (Either StateInit ^StateInit))
+  switch ((int)cs.prefetch_ulong(2)) {
+    case 2: {  // (just$1 (left$0 _:StateInit ))
+      Ref<vm::CellSlice> state_init;
+      vm::CellBuilder cb;
+      if (!(cs.advance(2) && block::gen::t_StateInit.fetch_to(cs, state_init) &&
+            cb.append_cellslice_bool(std::move(state_init)) && cb.finalize_to(in_msg_state) &&
+            block::gen::t_StateInit.validate_ref(in_msg_state))) {
+        LOG(DEBUG) << "cannot parse StateInit in inbound message";
+        return false;
+      }
+      break;
+    }
+    case 3: {  // (just$1 (right$1 _:^StateInit ))
+      if (!(cs.advance(2) && cs.fetch_ref_to(in_msg_state) && block::gen::t_StateInit.validate_ref(in_msg_state))) {
+        LOG(DEBUG) << "cannot parse ^StateInit in inbound message";
+        return false;
+      }
+      break;
+    }
+    default:  // nothing$0
+      if (!cs.advance(1)) {
+        LOG(DEBUG) << "invalid init field in an inbound message";
+        return false;
+      }
+  }
+  // body:(Either X ^X)
+  switch ((int)cs.fetch_ulong(1)) {
+    case 0:  // left$0 _:X
+      in_msg_body = Ref<vm::CellSlice>{true, cs};
+      break;
+    case 1:  // right$1 _:^X
+      if (cs.size_ext() != 0x10000) {
+        LOG(DEBUG) << "body of an inbound message is not represented by exactly one reference";
+        return false;
+      }
+      in_msg_body = load_cell_slice_ref(cs.prefetch_ref());
+      break;
+    default:
+      LOG(DEBUG) << "invalid body field in an inbound message";
+      return false;
+  }
+  total_fees += in_fwd_fee;
+  return true;
+}
+
+bool Transaction::prepare_storage_phase(const StoragePhaseConfig& cfg, bool force_collect) {
+  if (now < account.last_paid) {
+    return false;
+  }
+  auto to_pay = account.compute_storage_fees(now, *(cfg.pricing));
+  if (to_pay.not_null() && sgn(to_pay) < 0) {
+    return false;
+  }
+  auto res = std::make_unique<StoragePhase>();
+  res->is_special = account.is_special;
+  last_paid = res->last_paid_updated = (res->is_special ? 0 : now);
+  if (to_pay.is_null() || sgn(to_pay) == 0) {
+    res->fees_collected = res->fees_due = td::RefInt256{true, 0};
+  } else if (to_pay <= balance.grams) {
+    res->fees_collected = to_pay;
+    res->fees_due = td::RefInt256{true, 0};
+    balance -= std::move(to_pay);
+  } else if (acc_status == Account::acc_frozen && !force_collect && to_pay + due_payment < cfg.delete_due_limit) {
+    // do not collect fee
+    res->last_paid_updated = (res->is_special ? 0 : account.last_paid);
+    res->fees_collected = res->fees_due = td::RefInt256{true, 0};
+  } else {
+    res->fees_collected = balance.grams;
+    res->fees_due = std::move(to_pay) - std::move(balance.grams);
+    balance.grams = td::RefInt256{true, 0};
+    if (!res->is_special) {
+      auto total_due = res->fees_due + due_payment;
+      switch (acc_status) {
+        case Account::acc_uninit:
+        case Account::acc_frozen:
+          if (total_due > cfg.delete_due_limit) {
+            res->deleted = true;
+            acc_status = Account::acc_deleted;
+            if (balance.extra.not_null()) {
+              // collect extra currencies as a fee
+              total_fees += block::CurrencyCollection{0, std::move(balance.extra)};
+              balance.extra.clear();
+            }
+          }
+          break;
+        case Account::acc_active:
+          if (total_due > cfg.freeze_due_limit) {
+            res->frozen = true;
+            was_frozen = true;
+            acc_status = Account::acc_frozen;
+          }
+          break;
+      }
+    }
+  }
+  total_fees += res->fees_collected;
+  storage_phase = std::move(res);
+  return true;
+}
+
+bool Transaction::prepare_credit_phase() {
+  credit_phase = std::make_unique<CreditPhase>();
+  auto collected = std::min(msg_balance_remaining.grams, due_payment);
+  credit_phase->due_fees_collected = collected;
+  due_payment -= collected;
+  credit_phase->credit = msg_balance_remaining -= collected;
+  if (!msg_balance_remaining.is_valid()) {
+    LOG(ERROR) << "cannot compute the amount to be credited in the credit phase of transaction";
+    return false;
+  }
+  // NB: msg_balance_remaining may be deducted from balance later during bounce phase
+  balance += msg_balance_remaining;
+  if (!balance.is_valid()) {
+    LOG(ERROR) << "cannot credit currency collection to account";
+    return false;
+  }
+  total_fees += std::move(collected);
+  return true;
+}
+
+void ComputePhaseConfig::compute_threshold() {
+  gas_price256 = td::RefInt256{true, gas_price};
+  max_gas_threshold = td::rshift(gas_price256 * gas_limit, 16, 1);
+}
+
+td::uint64 ComputePhaseConfig::gas_bought_for(td::RefInt256 nanograms) const {
+  if (nanograms.is_null() || sgn(nanograms) < 0) {
+    return 0;
+  }
+  if (nanograms >= max_gas_threshold) {
+    return gas_limit;
+  }
+  auto res = td::div(std::move(nanograms) << 16, gas_price256);
+  return res->to_long();
+}
+
+td::RefInt256 ComputePhaseConfig::compute_gas_price(td::uint64 gas_used) const {
+  return td::rshift(gas_price256 * gas_used, 16, 1);
+}
+
+bool Transaction::compute_gas_limits(ComputePhase& cp, const ComputePhaseConfig& cfg) {
+  // Compute gas limits
+  if (account.is_special) {
+    cp.gas_max = cfg.special_gas_limit;
+  } else {
+    cp.gas_max = cfg.gas_bought_for(balance.grams);
+  }
+  cp.gas_credit = 0;
+  if (trans_type != tr_ord) {
+    // may use all gas that can be bought using remaining balance
+    cp.gas_limit = cp.gas_max;
+  } else {
+    // originally use only gas bought using remaining message balance
+    // if the message is "accepted" by the smart contract, the gas limit will be set to gas_max
+    cp.gas_limit = cfg.gas_bought_for(msg_balance_remaining.grams);
+    if (!block::tlb::t_Message.is_internal(in_msg)) {
+      // external messages carry no balance, give them some credit to check whether they are accepted
+      cp.gas_credit = std::min(cfg.gas_credit, cp.gas_max);
+    }
+  }
+  LOG(DEBUG) << "gas limits: max=" << cp.gas_max << ", limit=" << cp.gas_limit << ", credit=" << cp.gas_credit;
+  return true;
+}
+
+Ref<vm::Stack> Transaction::prepare_vm_stack(ComputePhase& cp) {
+  Ref<vm::Stack> stack_ref{true};
+  td::RefInt256 acc_addr{true};
+  CHECK(acc_addr.write().import_bits(account.addr.cbits(), 256));
+  vm::Stack& stack = stack_ref.write();
+  switch (trans_type) {
+    case tr_tick:
+    case tr_tock:
+      stack.push_int(balance.grams);
+      stack.push_int(std::move(acc_addr));
+      stack.push_bool(trans_type == tr_tock);
+      stack.push_smallint(-2);
+      return stack_ref;
+    case tr_ord:
+      stack.push_int(balance.grams);
+      stack.push_int(msg_balance_remaining.grams);
+      stack.push_cell(in_msg);
+      stack.push_cellslice(in_msg_body);
+      stack.push_bool(in_msg_extern);
+      return stack_ref;
+    default:
+      LOG(ERROR) << "cannot initialize stack for a transaction of type " << trans_type;
+      return {};
+  }
+}
+
+bool Transaction::prepare_rand_seed(td::BitArray<256>& rand_seed, const ComputePhaseConfig& cfg) const {
+  // we might use SHA256(block_rand_seed . addr . trans_lt)
+  // instead, we use SHA256(block_rand_seed . addr)
+  // if the smart contract wants to randomize further, it can use RANDOMIZE instruction
+  td::BitArray<256 + 256> data;
+  data.bits().copy_from(cfg.block_rand_seed.cbits(), 256);
+  (data.bits() + 256).copy_from(account.addr_rewrite.cbits(), 256);
+  rand_seed.clear();
+  data.compute_sha256(rand_seed);
+  return true;
+}
+
+Ref<vm::Tuple> Transaction::prepare_vm_c7(const ComputePhaseConfig& cfg) const {
+  // TODO: fix initialization of c7
+  td::BitArray<256> rand_seed;
+  td::RefInt256 rand_seed_int{true};
+  if (!(prepare_rand_seed(rand_seed, cfg) && rand_seed_int.unique_write().import_bits(rand_seed.cbits(), 256, false))) {
+    LOG(ERROR) << "cannot compute rand_seed for transaction";
+    throw CollatorError{"cannot generate valid SmartContractInfo"};
+    return {};
+  }
+  auto tuple = vm::make_tuple_ref(
+      td::make_refint(0x076ef1ea),                // [ magic:0x076ef1ea
+      td::make_refint(0),                         //   actions:Integer
+      td::make_refint(0),                         //   msgs_sent:Integer
+      td::make_refint(now),                       //   unixtime:Integer
+      td::make_refint(account.block_lt),          //   block_lt:Integer
+      td::make_refint(start_lt),                  //   trans_lt:Integer
+      std::move(rand_seed_int),                   //   rand_seed:Integer
+      balance.as_vm_tuple(),                      //   balance_remaining:[Integer (Maybe Cell)]
+      my_addr,                                    //  myself:MsgAddressInt
+      vm::StackEntry::maybe(cfg.global_config));  //  global_config:(Maybe Cell) ] = SmartContractInfo;
+  LOG(DEBUG) << "SmartContractInfo initialized with " << vm::StackEntry(tuple).to_string();
+  return vm::make_tuple_ref(std::move(tuple));
+}
+
+int output_actions_count(Ref<vm::Cell> list) {
+  int i = -1;
+  do {
+    ++i;
+    list = load_cell_slice(std::move(list)).prefetch_ref();
+  } while (list.not_null());
+  return i;
+}
+
+bool Transaction::unpack_msg_state(bool lib_only) {
+  block::gen::StateInit::Record state;
+  if (in_msg_state.is_null() || !tlb::unpack_cell(in_msg_state, state)) {
+    LOG(ERROR) << "cannot unpack StateInit from an inbound message";
+    return false;
+  }
+  if (lib_only) {
+    in_msg_library = state.library->prefetch_ref();
+    return true;
+  }
+  if (state.split_depth->size() == 6) {
+    new_split_depth = (signed char)(state.split_depth->prefetch_ulong(6) - 32);
+  } else {
+    new_split_depth = 0;
+  }
+  if (state.special->size() > 1) {
+    int z = (int)state.special->prefetch_ulong(3);
+    if (z < 0) {
+      return false;
+    }
+    new_tick = z & 2;
+    new_tock = z & 1;
+    LOG(DEBUG) << "tick=" << new_tick << ", tock=" << new_tock;
+  }
+  new_code = state.code->prefetch_ref();
+  new_data = state.data->prefetch_ref();
+  new_library = state.library->prefetch_ref();
+  return true;
+}
+
+std::vector<Ref<vm::Cell>> Transaction::compute_vm_libraries(const ComputePhaseConfig& cfg) {
+  std::vector<Ref<vm::Cell>> lib_set;
+  if (in_msg_library.not_null()) {
+    lib_set.push_back(in_msg_library);
+  }
+  if (new_library.not_null()) {
+    lib_set.push_back(new_library);
+  }
+  auto global_libs = cfg.get_lib_root();
+  if (global_libs.not_null()) {
+    lib_set.push_back(std::move(global_libs));
+  }
+  return lib_set;
+}
+
+bool Transaction::check_in_msg_state_hash() {
+  CHECK(in_msg_state.not_null());
+  CHECK(new_split_depth >= 0 && new_split_depth < 32);
+  td::Bits256 in_state_hash = in_msg_state->get_hash().bits();
+  int d = new_split_depth;
+  if ((in_state_hash.bits() + d).compare(account.addr.bits() + d, 256 - d)) {
+    return false;
+  }
+  orig_addr_rewrite = in_state_hash.bits();
+  orig_addr_rewrite_set = true;
+  return account.recompute_tmp_addr(my_addr, d, orig_addr_rewrite.bits());
+}
+
+bool Transaction::prepare_compute_phase(const ComputePhaseConfig& cfg) {
+  // TODO: add more skip verifications + sometimes use state from in_msg to re-activate
+  // ...
+  compute_phase = std::make_unique<ComputePhase>();
+  ComputePhase& cp = *(compute_phase.get());
+  if (td::sgn(balance.grams) <= 0) {
+    // no gas
+    cp.skip_reason = ComputePhase::sk_no_gas;
+    return true;
+  }
+  if (in_msg_state.not_null()) {
+    LOG(DEBUG) << "HASH(in_msg_state) = " << in_msg_state->get_hash().bits().to_hex(256)
+               << ", account_state_hash = " << account.state_hash.to_hex();
+    // vm::load_cell_slice(in_msg_state).print_rec(std::cerr);
+  } else {
+    LOG(DEBUG) << "in_msg_state is null";
+  }
+  if (in_msg_state.not_null() &&
+      (acc_status == Account::acc_uninit ||
+       (acc_status == Account::acc_frozen && account.state_hash == in_msg_state->get_hash().bits()))) {
+    use_msg_state = true;
+    if (!(unpack_msg_state() && account.check_split_depth(new_split_depth))) {
+      LOG(DEBUG) << "cannot unpack in_msg_state, or it has bad split_depth; cannot init account state";
+      cp.skip_reason = ComputePhase::sk_bad_state;
+      return true;
+    }
+    if (acc_status == Account::acc_uninit && !check_in_msg_state_hash()) {
+      LOG(DEBUG) << "in_msg_state hash mismatch, cannot init account state";
+      cp.skip_reason = ComputePhase::sk_bad_state;
+      return true;
+    }
+  } else if (acc_status != Account::acc_active) {
+    // no state, cannot perform transactions
+    cp.skip_reason = in_msg_state.not_null() ? ComputePhase::sk_bad_state : ComputePhase::sk_no_state;
+    return true;
+  } else if (in_msg_state.not_null()) {
+    unpack_msg_state(true);  // use only libraries
+  }
+  // Compute gas limits
+  if (!compute_gas_limits(cp, cfg)) {
+    compute_phase.reset();
+    return false;
+  }
+  // initialize VM
+  Ref<vm::Stack> stack = prepare_vm_stack(cp);
+  if (stack.is_null()) {
+    compute_phase.reset();
+    return false;
+  }
+  // OstreamLogger ostream_logger(error_stream);
+  // auto log = create_vm_log(error_stream ? &ostream_logger : nullptr);
+  vm::GasLimits gas{(long long)cp.gas_limit, (long long)cp.gas_max, (long long)cp.gas_credit};
+  LOG(DEBUG) << "creating VM";
+
+  vm::VmState vm{new_code, std::move(stack), gas, 1, new_data, vm::VmLog(), compute_vm_libraries(cfg)};
+  vm.set_c7(prepare_vm_c7(cfg));  // tuple with SmartContractInfo
+  // vm.incr_stack_trace(1);    // enable stack dump after each step
+
+  LOG(DEBUG) << "starting VM";
+  cp.vm_init_state_hash = vm.get_state_hash();
+  cp.exit_code = ~vm.run();
+  LOG(DEBUG) << "VM terminated with exit code " << cp.exit_code;
+  cp.out_of_gas = (cp.exit_code == ~(int)vm::Excno::out_of_gas);
+  cp.vm_final_state_hash = vm.get_final_state_hash(cp.exit_code);
+  stack = vm.get_stack_ref();
+  cp.vm_steps = (int)vm.get_steps_count();
+  gas = vm.get_gas_limits();
+  cp.gas_used = std::min<long long>(gas.gas_consumed(), gas.gas_limit);
+  cp.accepted = (gas.gas_credit == 0);
+  cp.success = (cp.accepted && (unsigned)cp.exit_code <= 1);
+  if (cp.accepted & use_msg_state) {
+    was_activated = true;
+    acc_status = Account::acc_active;
+  }
+  LOG(INFO) << "steps: " << vm.get_steps_count() << " gas: used=" << gas.gas_consumed() << ", max=" << gas.gas_max
+            << ", limit=" << gas.gas_limit << ", credit=" << gas.gas_credit;
+  LOG(INFO) << "out_of_gas=" << cp.out_of_gas << ", accepted=" << cp.accepted << ", success=" << cp.success;
+  if (cp.success) {
+    cp.new_data = vm.get_c4();  // c4 -> persistent data
+    cp.actions = vm.get_d(5);   // c5 -> action list
+    int out_act_num = output_actions_count(cp.actions);
+    if (verbosity > 2) {
+      std::cerr << "new smart contract data: ";
+      load_cell_slice(cp.new_data).print_rec(std::cerr);
+      std::cerr << "output actions: ";
+      block::gen::OutList{out_act_num}.print_ref(std::cerr, cp.actions);
+    }
+  }
+  cp.mode = 0;
+  cp.exit_arg = 0;
+  if (!cp.success && stack->depth() > 0) {
+    td::RefInt256 tos = stack->tos().as_int();
+    if (tos.not_null() && tos->signed_fits_bits(32)) {
+      cp.exit_arg = (int)tos->to_long();
+    }
+  }
+  if (cp.accepted) {
+    if (account.is_special) {
+      cp.gas_fees = td::RefInt256{true, 0};
+    } else {
+      cp.gas_fees = cfg.compute_gas_price(cp.gas_used);
+      total_fees += cp.gas_fees;
+      balance -= cp.gas_fees;
+    }
+    if (verbosity > 2) {
+      std::cerr << "gas fees: " << cp.gas_fees << " = " << cfg.gas_price256 << " * " << cp.gas_used
+                << " /2^16 ; price=" << cfg.gas_price << "; remaining balance=" << balance << std::endl;
+    }
+    CHECK(td::sgn(balance.grams) >= 0);
+  }
+  return true;
+}
+
+bool Transaction::prepare_action_phase(const ActionPhaseConfig& cfg) {
+  if (!compute_phase || !compute_phase->success) {
+    return false;
+  }
+  action_phase = std::make_unique<ActionPhase>();
+  ActionPhase& ap = *(action_phase.get());
+  ap.result_code = -1;
+  ap.result_arg = 0;
+  ap.tot_actions = ap.spec_actions = ap.skipped_actions = ap.msgs_created = 0;
+  Ref<vm::Cell> list = compute_phase->actions;
+  assert(list.not_null());
+  ap.action_list_hash = list->get_hash().bits();
+  ap.remaining_balance = balance;
+  ap.end_lt = end_lt;
+  ap.total_fwd_fees = td::RefInt256{true, 0};
+  ap.total_action_fees = td::RefInt256{true, 0};
+  ap.reserved_balance.set_zero();
+
+  int n = 0;
+  while (true) {
+    ap.action_list.push_back(list);
+    auto cs = load_cell_slice(std::move(list));
+    if (!cs.size_ext()) {
+      break;
+    }
+    if (!cs.have_refs()) {
+      ap.result_code = 32;  // action list invalid
+      ap.result_arg = n;
+      ap.action_list_invalid = true;
+      LOG(DEBUG) << "action list invalid: entry found with data but no next reference";
+      return true;
+    }
+    list = cs.prefetch_ref();
+    n++;
+    if (n > cfg.max_actions) {
+      ap.result_code = 33;  // too many actions
+      ap.result_arg = n;
+      ap.action_list_invalid = true;
+      LOG(DEBUG) << "action list too long: more than " << cfg.max_actions << " actions";
+      return true;
+    }
+  }
+
+  ap.tot_actions = n;
+  ap.spec_actions = ap.skipped_actions = 0;
+  for (int i = n - 1; i >= 0; --i) {
+    ap.result_arg = n - 1 - i;
+    if (!block::gen::t_OutListNode.validate_ref(ap.action_list[i])) {
+      ap.result_code = 34;  // action #i invalid or unsupported
+      ap.action_list_invalid = true;
+      LOG(DEBUG) << "invalid action " << ap.result_arg << " found while preprocessing action list: error code "
+                 << ap.result_code;
+      return true;
+    }
+  }
+  ap.valid = true;
+  for (int i = n - 1; i >= 0; --i) {
+    ap.result_arg = n - 1 - i;
+    vm::CellSlice cs = load_cell_slice(ap.action_list[i]);
+    CHECK(cs.fetch_ref().not_null());
+    int tag = block::gen::t_OutAction.get_tag(cs);
+    CHECK(tag >= 0);
+    int err_code = 34;
+    switch (tag) {
+      case block::gen::OutAction::action_set_code:
+        err_code = try_action_set_code(cs, ap, cfg);
+        break;
+      case block::gen::OutAction::action_send_msg:
+        err_code = try_action_send_msg(cs, ap, cfg);
+        break;
+      case block::gen::OutAction::action_reserve_currency:
+        err_code = try_action_reserve_currency(cs, ap, cfg);
+        break;
+    }
+    if (err_code) {
+      ap.result_code = (err_code == -1 ? 34 : err_code);
+      ap.end_lt = end_lt;
+      if (err_code == -1 || err_code == 34) {
+        ap.action_list_invalid = true;
+      }
+      if (err_code == 37 || err_code == 38) {
+        ap.no_funds = true;
+      }
+      LOG(DEBUG) << "invalid action " << ap.result_arg << " in action list: error code " << ap.result_code;
+      return true;
+    }
+  }
+  ap.result_arg = 0;
+  ap.result_code = 0;
+  CHECK(ap.remaining_balance.grams->sgn() >= 0);
+  CHECK(ap.reserved_balance.grams->sgn() >= 0);
+  ap.remaining_balance += ap.reserved_balance;
+  CHECK(ap.remaining_balance.is_valid());
+  if (ap.acc_delete_req) {
+    CHECK(ap.remaining_balance.is_zero());
+    ap.acc_status_change = ActionPhase::acst_deleted;
+    acc_status = Account::acc_deleted;
+    was_deleted = true;
+  }
+  ap.success = true;
+  end_lt = ap.end_lt;
+  out_msgs = std::move(ap.out_msgs);
+  if (ap.new_code.not_null()) {
+    new_code = ap.new_code;
+  }
+  new_data = compute_phase->new_data;  // tentative persistent data update applied
+  total_fees +=
+      ap.total_action_fees;  // NB: forwarding fees are not accounted here (they are not collected by the validators in this transaction)
+  balance = ap.remaining_balance;
+  return true;
+}
+
+int Transaction::try_action_set_code(vm::CellSlice& cs, ActionPhase& ap, const ActionPhaseConfig& cfg) {
+  block::gen::OutAction::Record_action_set_code rec;
+  if (!tlb::unpack_exact(cs, rec)) {
+    return -1;
+  }
+  ap.new_code = std::move(rec.new_code);
+  ap.code_changed = true;
+  ap.spec_actions++;
+  return 0;
+}
+
+// msg_fwd_fees = (lump_price + ceil((bit_price * msg.bits + cell_price * msg.cells)/2^16)) nanograms
+// ihr_fwd_fees = ceil((msg_fwd_fees * ihr_price_factor)/2^16) nanograms
+// bits in the root cell of a message are not included in msg.bits (lump_price pays for them)
+td::uint64 MsgPrices::compute_fwd_fees(td::uint64 cells, td::uint64 bits) const {
+  return lump_price + td::uint128(bit_price)
+                          .mult(bits)
+                          .add(td::uint128(cell_price).mult(cells))
+                          .add(td::uint128(0xffffu))
+                          .shr(16)
+                          .lo();
+}
+
+std::pair<td::uint64, td::uint64> MsgPrices::compute_fwd_ihr_fees(td::uint64 cells, td::uint64 bits,
+                                                                  bool ihr_disabled) const {
+  td::uint64 fwd = compute_fwd_fees(cells, bits);
+  if (ihr_disabled) {
+    return std::pair<td::uint64, td::uint64>(fwd, 0);
+  }
+  return std::pair<td::uint64, td::uint64>(fwd, td::uint128(fwd).mult(ihr_factor).shr(16).lo());
+}
+
+td::RefInt256 MsgPrices::get_first_part(td::RefInt256 total) const {
+  return (std::move(total) * first_frac) >> 16;
+}
+
+td::uint64 MsgPrices::get_first_part(td::uint64 total) const {
+  return td::uint128(total).mult(first_frac).shr(16).lo();
+}
+
+td::RefInt256 MsgPrices::get_next_part(td::RefInt256 total) const {
+  return (std::move(total) * next_frac) >> 16;
+}
+
+bool Transaction::check_replace_src_addr(Ref<vm::CellSlice>& src_addr) const {
+  int t = (int)src_addr->prefetch_ulong(2);
+  if (!t && src_addr->size_ext() == 2) {
+    // addr_none$00  --> replace with the address of current smart contract
+    src_addr = my_addr;
+    return true;
+  }
+  if (t != 2) {
+    // invalid address (addr_extern and addr_var cannot be source addresses)
+    return false;
+  }
+  if (src_addr->contents_equal(*my_addr) || src_addr->contents_equal(*my_addr_exact)) {
+    // source address matches that of the current account
+    return true;
+  }
+  // only one valid case remaining: rewritten source address used, replace with the complete one
+  // (are we sure we want to allow this?)
+  return false;
+}
+
+bool Transaction::check_rewrite_dest_addr(Ref<vm::CellSlice>& dest_addr, const ActionPhaseConfig& cfg,
+                                          bool* is_mc) const {
+  if (!dest_addr->prefetch_ulong(1)) {
+    // all external addresses allowed
+    if (is_mc) {
+      *is_mc = false;
+    }
+    return true;
+  }
+  bool repack = false;
+  int tag = block::gen::t_MsgAddressInt.get_tag(*dest_addr);
+
+  block::gen::MsgAddressInt::Record_addr_var rec;
+
+  if (tag == block::gen::MsgAddressInt::addr_var) {
+    if (!tlb::csr_unpack(dest_addr, rec)) {
+      // cannot unpack addr_var
+      LOG(DEBUG) << "cannot unpack addr_var in a destination address";
+      return false;
+    }
+    if (rec.addr_len == 256 && rec.workchain_id >= -128 && rec.workchain_id < 128) {
+      LOG(DEBUG) << "destination address contains an addr_var to be repacked into addr_std";
+      repack = true;
+    }
+  } else if (tag == block::gen::MsgAddressInt::addr_std) {
+    block::gen::MsgAddressInt::Record_addr_std recs;
+    if (!tlb::csr_unpack(dest_addr, recs)) {
+      // cannot unpack addr_std
+      LOG(DEBUG) << "cannot unpack addr_std in a destination address";
+      return false;
+    }
+    rec.anycast = std::move(recs.anycast);
+    rec.addr_len = 256;
+    rec.workchain_id = recs.workchain_id;
+    rec.address = td::make_bitstring_ref(recs.address);
+  } else {
+    // unknown address format (not a MsgAddressInt)
+    LOG(DEBUG) << "destination address does not have a MsgAddressInt tag";
+    return false;
+  }
+  if (rec.workchain_id != ton::masterchainId) {
+    // recover destination workchain info from configuration
+    auto it = cfg.workchains->find(rec.workchain_id);
+    if (it == cfg.workchains->end()) {
+      // undefined destination workchain
+      LOG(DEBUG) << "destination address contains unknown workchain_id " << rec.workchain_id;
+      return false;
+    }
+    if (!it->second->accept_msgs) {
+      // workchain does not accept new messages
+      LOG(DEBUG) << "destination address belongs to workchain " << rec.workchain_id << " not accepting new messages";
+      return false;
+    }
+    if (!it->second->is_valid_addr_len(rec.addr_len)) {
+      // invalid address length for specified workchain
+      LOG(DEBUG) << "destination address has length " << rec.addr_len << " invalid for destination workchain "
+                 << rec.workchain_id;
+      return false;
+    }
+  }
+  if (rec.anycast->size() > 1) {
+    // destination address is an anycast
+    if (rec.workchain_id == ton::masterchainId) {
+      // anycast addresses disabled in masterchain
+      LOG(DEBUG) << "masterchain destination address has an anycast field";
+      return false;
+    }
+    vm::CellSlice cs{*rec.anycast};
+    int d = (int)cs.fetch_ulong(6) - 32;
+    if (d <= 0 || d > 30) {
+      // invalid anycast prefix length
+      return false;
+    }
+    unsigned pfx = (unsigned)cs.fetch_ulong(d);
+    unsigned my_pfx = (unsigned)account.addr.cbits().get_uint(d);
+    if (pfx != my_pfx) {
+      // rewrite destination address
+      vm::CellBuilder cb;
+      CHECK(cb.store_long_bool(32 + d, 6)     // just$1 depth:(#<= 30)
+            && cb.store_long_bool(my_pfx, d)  // rewrite_pfx:(bits depth)
+            && (rec.anycast = load_cell_slice_ref(cb.finalize())).not_null());
+      repack = true;
+    }
+  }
+  if (is_mc) {
+    *is_mc = (rec.workchain_id == ton::masterchainId);
+  }
+  if (!repack) {
+    return true;
+  }
+  if (rec.addr_len == 256 && rec.workchain_id >= -128 && rec.workchain_id < 128) {
+    // repack as an addr_std
+    vm::CellBuilder cb;
+    CHECK(cb.store_long_bool(2, 2)                             // addr_std$10
+          && cb.append_cellslice_bool(std::move(rec.anycast))  // anycast:(Maybe Anycast) ...
+          && cb.store_long_bool(rec.workchain_id, 8)           // workchain_id:int8
+          && cb.append_bitstring(std::move(rec.address))       // address:bits256
+          && (dest_addr = load_cell_slice_ref(cb.finalize())).not_null());
+  } else {
+    // repack as an addr_var
+    CHECK(tlb::csr_pack(dest_addr, std::move(rec)));
+  }
+  CHECK(block::gen::t_MsgAddressInt.validate_csr(dest_addr));
+  return true;
+}
+
+int Transaction::try_action_send_msg(vm::CellSlice& cs, ActionPhase& ap, const ActionPhaseConfig& cfg) {
+  block::gen::OutAction::Record_action_send_msg act_rec;
+  // mode: +128 = attach all remaining balance, +64 = attach all remaining balance of the inbound message, +1 = pay message fees, +2 = skip if message cannot be sent
+  if (!tlb::unpack_exact(cs, act_rec) || (act_rec.mode & ~0xc3) || (act_rec.mode & 0xc0) == 0xc0) {
+    return -1;
+  }
+  bool skip_invalid = (act_rec.mode & 2);
+  auto cs2 = vm::load_cell_slice(act_rec.out_msg);
+  // try to parse suggested message in cs2
+  td::RefInt256 fwd_fee, ihr_fee;
+  bool ext_msg = cs2.prefetch_ulong(1);
+  block::gen::CommonMsgInfoRelaxed::Record_int_msg_info info;
+  if (ext_msg) {
+    // ext_out_msg_info$11 constructor of CommonMsgInfoRelaxed
+    block::gen::CommonMsgInfoRelaxed::Record_ext_out_msg_info erec;
+    if (!tlb::unpack(cs2, erec)) {
+      return -1;
+    }
+    info.src = std::move(erec.src);
+    info.dest = std::move(erec.dest);
+    // created_lt and created_at are ignored
+    info.ihr_disabled = true;
+    info.bounce = false;
+    info.bounced = false;
+    fwd_fee = ihr_fee = td::RefInt256{true, 0};
+  } else {
+    // int_msg_info$0 constructor
+    if (!tlb::unpack(cs2, info) || !block::tlb::t_CurrencyCollection.validate_csr(info.value)) {
+      return -1;
+    }
+    fwd_fee = block::tlb::t_Grams.as_integer(info.fwd_fee);
+    ihr_fee = block::tlb::t_Grams.as_integer(info.ihr_fee);
+  }
+  // set created_at and created_lt to correct values
+  info.created_at = now;
+  info.created_lt = ap.end_lt;
+  // always clear bounced flag
+  info.bounced = false;
+  // have to check source address
+  // it must be either our source address, or empty
+  if (!check_replace_src_addr(info.src)) {
+    LOG(DEBUG) << "invalid source address in a proposed outbound message";
+    return 35;  // invalid source address
+  }
+  bool to_mc = false;
+  if (!check_rewrite_dest_addr(info.dest, cfg, &to_mc)) {
+    LOG(DEBUG) << "invalid destination address in a proposed outbound message";
+    return skip_invalid ? 0 : 36;  // invalid destination address
+  }
+
+  // fetch message pricing info
+  const MsgPrices& msg_prices = cfg.fetch_msg_prices(to_mc || account.is_masterchain());
+  // compute size of message
+  vm::CellStorageStat sstat;  // for message size
+  // preliminary storage estimation of the resulting message
+  sstat.compute_used_storage(cs2);  // message body
+  if (!ext_msg) {
+    sstat.add_used_storage(info.value->prefetch_ref());
+  }
+  sstat.bits -= cs2.size();  // bits in the root cells are free
+  sstat.cells--;             // the root cell itself is not counted as a cell
+  LOG(DEBUG) << "storage paid for a message: " << sstat.cells << " cells, " << sstat.bits << " bits";
+  if (sstat.bits > max_msg_bits || sstat.cells > max_msg_cells) {
+    LOG(DEBUG) << "message too large, invalid";
+    return skip_invalid ? 0 : 40;
+  }
+
+  // compute forwarding fees
+  auto fees_c = msg_prices.compute_fwd_ihr_fees(sstat.cells, sstat.bits, info.ihr_disabled);
+  LOG(DEBUG) << "computed fwd fees = " << fees_c.first << " + " << fees_c.second;
+
+  if (account.is_special) {
+    LOG(DEBUG) << "computed fwd fees set to zero for special account";
+    fees_c.first = fees_c.second = 0;
+  }
+
+  // set fees to computed values
+  if (fwd_fee->unsigned_fits_bits(63) && fwd_fee->to_long() < (long long)fees_c.first) {
+    fwd_fee = td::RefInt256{true, fees_c.first};
+  }
+  if (fees_c.second && ihr_fee->unsigned_fits_bits(63) && ihr_fee->to_long() < (long long)fees_c.second) {
+    ihr_fee = td::RefInt256{true, fees_c.second};
+  }
+
+  Ref<vm::Cell> new_msg;
+  td::RefInt256 fees_collected, fees_total;
+  unsigned new_msg_bits;
+
+  if (!ext_msg) {
+    // Process outbound internal message
+    // check value, check/compute ihr_fees, fwd_fees
+    // ...
+    if (!block::tlb::t_CurrencyCollection.validate_csr(info.value)) {
+      LOG(DEBUG) << "invalid value:CurrencyCollection in proposed outbound message";
+      return skip_invalid ? 0 : 37;
+    }
+    if (info.ihr_disabled) {
+      // if IHR is disabled, IHR fees will be always zero
+      ihr_fee = td::RefInt256{true, 0};
+    }
+    // extract value to be carried by the message
+    block::CurrencyCollection req;
+    CHECK(req.unpack(info.value));
+    CHECK(req.grams.not_null());
+
+    if (act_rec.mode & 0x80) {
+      // attach all remaining balance to this message
+      req = ap.remaining_balance;
+      act_rec.mode &= ~1;  // pay fees from attached value
+    } else if (act_rec.mode & 0x40) {
+      // attach all remaining balance of the inbound message (in addition to the original value)
+      req += msg_balance_remaining;
+      if (!(act_rec.mode & 1) && compute_phase) {
+        req -= compute_phase->gas_fees;
+        if (!req.is_valid()) {
+          LOG(DEBUG)
+              << "not enough value to transfer with the message: all of the inbound message value has been consumed";
+          return skip_invalid ? 0 : 37;
+        }
+      }
+    }
+
+    // compute req_grams + fees
+    td::RefInt256 req_grams_brutto = req.grams;
+    fees_total = fwd_fee + ihr_fee;
+    if (act_rec.mode & 1) {
+      // we are going to pay the fees
+      req_grams_brutto += fees_total;
+    } else if (req.grams < fees_total) {
+      // receiver pays the fees (but cannot)
+      LOG(DEBUG) << "not enough value attached to the message to pay forwarding fees : have " << req.grams << ", need "
+                 << fees_total;
+      return skip_invalid ? 0 : 37;  // not enough grams
+    } else {
+      // decrease message value
+      req.grams -= fees_total;
+    }
+
+    // check that we have at least the required value
+    if (ap.remaining_balance.grams < req_grams_brutto) {
+      LOG(DEBUG) << "not enough grams to transfer with the message : remaining balance is "
+                 << ap.remaining_balance.to_str() << ", need " << req_grams_brutto << " (including forwarding fees)";
+      return skip_invalid ? 0 : 37;  // not enough grams
+    }
+
+    Ref<vm::Cell> new_extra;
+
+    if (!block::sub_extra_currency(ap.remaining_balance.extra, req.extra, new_extra)) {
+      LOG(DEBUG) << "not enough extra currency to send with the message";
+      return skip_invalid ? 0 : 38;  // not enough (extra) funds
+    }
+
+    auto fwd_fee_mine = msg_prices.get_first_part(fwd_fee);
+    auto fwd_fee_remain = fwd_fee - fwd_fee_mine;
+
+    // re-pack message value
+    CHECK(req.pack_to(info.value));
+    vm::CellBuilder cb;
+    CHECK(block::tlb::t_Grams.store_integer_ref(cb, fwd_fee_remain) &&
+          (info.fwd_fee = load_cell_slice_ref(cb.finalize())).not_null());
+    CHECK(block::tlb::t_Grams.store_integer_ref(cb, ihr_fee) &&
+          (info.ihr_fee = load_cell_slice_ref(cb.finalize())).not_null());
+
+    // serialize message
+    CHECK(tlb::pack(cb, info));
+    if (!cb.append_cellslice_bool(cs2)) {
+      LOG(DEBUG) << "outbound message does not fit into a cell after rewriting";
+      return 39;
+    }
+
+    new_msg_bits = cb.size();
+    new_msg = cb.finalize();
+
+    // clear msg_balance_remaining if it has been used
+    if (act_rec.mode & 0xc0) {
+      msg_balance_remaining.set_zero();
+    }
+
+    // update balance
+    ap.remaining_balance -= req_grams_brutto;
+    ap.remaining_balance.extra = std::move(new_extra);
+    CHECK(ap.remaining_balance.is_valid());
+    CHECK(ap.remaining_balance.grams->sgn() >= 0);
+    fees_total = fwd_fee + ihr_fee;
+    fees_collected = fwd_fee_mine;
+  } else {
+    // external messages also have forwarding fees
+    if (ap.remaining_balance.grams < fwd_fee) {
+      LOG(DEBUG) << "not enough funds to pay for an outbound external message";
+      return skip_invalid ? 0 : 37;  // not enough grams
+    }
+    // repack message
+    // ext_out_msg_info$11 constructor of CommonMsgInfo
+    block::gen::CommonMsgInfo::Record_ext_out_msg_info erec;
+    erec.src = info.src;
+    erec.dest = info.dest;
+    erec.created_at = info.created_at;
+    erec.created_lt = info.created_lt;
+    vm::CellBuilder cb;
+    CHECK(tlb::pack(cb, erec));
+    if (!cb.append_cellslice_bool(cs2)) {
+      LOG(DEBUG) << "outbound message does not fit into a cell after rewriting";
+      return 39;
+    }
+
+    new_msg_bits = cb.size();
+    new_msg = cb.finalize();
+
+    // update balance
+    ap.remaining_balance -= fwd_fee;
+    CHECK(ap.remaining_balance.is_valid());
+    CHECK(td::sgn(ap.remaining_balance.grams) >= 0);
+    fees_collected = fees_total = fwd_fee;
+  }
+
+  if (!block::tlb::t_Message.validate_ref(new_msg)) {
+    LOG(ERROR) << "generated outbound message is not a valid (Message Any) according to hand-written check";
+    return -1;
+  }
+  if (!block::gen::t_Message_Any.validate_ref(new_msg)) {
+    LOG(ERROR) << "generated outbound message is not a valid (Message Any) according to automated check";
+    return -1;
+  }
+  if (verbosity > 2) {
+    std::cerr << "converted outbound message: ";
+    block::gen::t_Message_Any.print_ref(std::cerr, new_msg);
+  }
+
+  ap.msgs_created++;
+  ap.end_lt++;
+
+  ap.out_msgs.push_back(std::move(new_msg));
+  ap.total_action_fees += fees_collected;
+  ap.total_fwd_fees += fees_total;
+
+  if (act_rec.mode & 0x80) {
+    CHECK(ap.remaining_balance.is_zero());
+    ap.acc_delete_req = ap.reserved_balance.is_zero();
+  }
+
+  ap.tot_msg_bits += sstat.bits + new_msg_bits;
+  ap.tot_msg_cells += sstat.cells + 1;
+
+  return 0;
+}
+
+int Transaction::try_action_reserve_currency(vm::CellSlice& cs, ActionPhase& ap, const ActionPhaseConfig& cfg) {
+  block::gen::OutAction::Record_action_reserve_currency rec;
+  if (!tlb::unpack_exact(cs, rec) || (rec.mode & ~3)) {
+    return -1;
+  }
+  int mode = rec.mode;
+  LOG(INFO) << "in try_action_reserve_currency(" << mode << ")";
+  CurrencyCollection reserve, newc;
+  if (!reserve.validate_unpack(std::move(rec.currency))) {
+    LOG(DEBUG) << "cannot parse currency field in action_reserve_currency";
+    return -1;
+  }
+  LOG(DEBUG) << "action_reserve_currency: mode=" << mode << ", reserve=" << reserve.to_str()
+             << ", balance=" << ap.remaining_balance.to_str();
+  if (reserve.grams > ap.remaining_balance.grams) {
+    if (mode & 2) {
+      reserve.grams = ap.remaining_balance.grams;
+    } else {
+      LOG(DEBUG) << "cannot reserve " << reserve.grams << " nanograms : only " << ap.remaining_balance.grams
+                 << " available";
+      return 37;  // not enough grams
+    }
+  }
+  if (!block::sub_extra_currency(ap.remaining_balance.extra, reserve.extra, newc.extra)) {
+    LOG(DEBUG) << "not enough extra currency to reserve";
+    if (mode & 2) {
+      // TODO: process (mode & 2) correctly by setting res_extra := inf (reserve.extra, ap.remaining_balance.extra)
+    }
+    return 38;  // not enough (extra) funds
+  }
+  newc.grams = ap.remaining_balance.grams - reserve.grams;
+  if (mode & 1) {
+    // leave only res_grams, reserve everything else
+    std::swap(newc, reserve);
+  }
+  // set remaining_balance to new_grams and new_extra
+  ap.remaining_balance = std::move(newc);
+  // increase reserved_balance by res_grams and res_extra
+  ap.reserved_balance += std::move(reserve);
+  CHECK(ap.reserved_balance.is_valid());
+  CHECK(ap.remaining_balance.is_valid());
+  LOG(INFO) << "changed remaining balance to " << ap.remaining_balance.to_str() << ", reserved balance to "
+            << ap.reserved_balance.to_str();
+  ap.spec_actions++;
+  return 0;
+}
+
+bool Transaction::prepare_bounce_phase(const ActionPhaseConfig& cfg) {
+  if (in_msg.is_null() || !bounce_enabled) {
+    return false;
+  }
+  bounce_phase = std::make_unique<BouncePhase>();
+  BouncePhase& bp = *bounce_phase;
+  block::gen::CommonMsgInfo::Record_int_msg_info info;
+  if (!tlb::unpack_cell_inexact(in_msg, info)) {
+    bounce_phase.reset();
+    return false;
+  }
+  info.ihr_disabled = true;
+  info.bounce = false;
+  info.bounced = true;
+  std::swap(info.src, info.dest);
+  bool to_mc = false;
+  if (!check_rewrite_dest_addr(info.dest, cfg, &to_mc)) {
+    LOG(DEBUG) << "invalid destination address in a bounced message";
+    bounce_phase.reset();
+    return false;
+  }
+  // fetch message pricing info
+  const MsgPrices& msg_prices = cfg.fetch_msg_prices(to_mc || account.is_masterchain());
+  // compute size of message
+  vm::CellStorageStat sstat;  // for message size
+  // preliminary storage estimation of the resulting message
+  sstat.compute_used_storage(info.value->prefetch_ref());
+  bp.msg_bits = sstat.bits;
+  bp.msg_cells = sstat.cells;
+  // compute forwarding fees
+  bp.fwd_fees = msg_prices.compute_fwd_fees(sstat.cells, sstat.bits);
+  // check whether the message has enough funds
+  auto msg_balance = msg_balance_remaining;
+  if (compute_phase && compute_phase->gas_fees.not_null()) {
+    msg_balance.grams -= compute_phase->gas_fees;
+  }
+  if ((msg_balance.grams < 0) ||
+      (msg_balance.grams->signed_fits_bits(64) && msg_balance.grams->to_long() < (long long)bp.fwd_fees)) {
+    // not enough funds
+    bp.nofunds = true;
+    return true;
+  }
+  // debit msg_balance_remaining from account's (tentative) balance
+  balance -= msg_balance;
+  CHECK(balance.is_valid());
+  // debit total forwarding fees from the message's balance, then split forwarding fees into our part and remaining part
+  msg_balance -= td::RefInt256{true, bp.fwd_fees};
+  bp.fwd_fees_collected = msg_prices.get_first_part(bp.fwd_fees);
+  bp.fwd_fees -= bp.fwd_fees_collected;
+  total_fees += td::RefInt256{true, bp.fwd_fees_collected};
+  // serialize outbound message
+  info.created_lt = end_lt++;
+  info.created_at = now;
+  vm::CellBuilder cb;
+  CHECK(cb.store_long_bool(5, 4)                            // int_msg_info$0 ihr_disabled:Bool bounce:Bool bounced:Bool
+        && cb.append_cellslice_bool(info.src)               // src:MsgAddressInt
+        && cb.append_cellslice_bool(info.dest)              // dest:MsgAddressInt
+        && msg_balance.store(cb)                            // value:CurrencyCollection
+        && block::tlb::t_Grams.store_long(cb, 0)            // ihr_fee:Grams
+        && block::tlb::t_Grams.store_long(cb, bp.fwd_fees)  // fwd_fee:Grams
+        && cb.store_long_bool(info.created_lt, 64)          // created_lt:uint64
+        && cb.store_long_bool(info.created_at, 32)          // created_at:uint32
+        && cb.store_long_bool(0, 2)                         // init:(Maybe ...) state:(Either ..)
+        && cb.finalize_to(bp.out_msg));
+  if (verbosity > 2) {
+    std::cerr << "generated bounced message: ";
+    block::gen::t_Message_Any.print_ref(std::cerr, bp.out_msg);
+  }
+  out_msgs.push_back(bp.out_msg);
+  bp.ok = true;
+  return true;
+}
+
+/*
+ * 
+ *  SERIALIZE PREPARED TRANSACTION
+ * 
+ */
+
+bool Account::store_acc_status(vm::CellBuilder& cb, int acc_status) const {
+  int v;
+  switch (acc_status) {
+    case acc_nonexist:
+    case acc_deleted:
+      v = 3;  // acc_state_nonexist$11
+      break;
+    case acc_uninit:
+      v = 0;  // acc_state_uninit$00
+      break;
+    case acc_frozen:
+      v = 1;  // acc_state_frozen$01
+      break;
+    case acc_active:
+      v = 2;  // acc_state_active$10
+      break;
+    default:
+      return false;
+  }
+  return cb.store_long_bool(v, 2);
+}
+
+bool Transaction::compute_state() {
+  if (new_total_state.not_null()) {
+    return true;
+  }
+  if (acc_status == Account::acc_uninit && !was_activated && balance.is_zero()) {
+    LOG(DEBUG) << "account is uninitialized and has zero balance, deleting it back";
+    acc_status = Account::acc_nonexist;
+    was_created = false;
+  }
+  if (acc_status == Account::acc_nonexist || acc_status == Account::acc_deleted) {
+    CHECK(balance.is_zero());
+    vm::CellBuilder cb;
+    CHECK(cb.store_long_bool(0, 1)  // account_none$0
+          && cb.finalize_to(new_total_state));
+    return true;
+  }
+  vm::CellBuilder cb;
+  CHECK(cb.store_long_bool(end_lt, 64)  // account_storage$_ last_trans_lt:uint64
+        && balance.store(cb));          // balance:CurrencyCollection
+  int ticktock = new_tick * 2 + new_tock;
+  unsigned si_pos = 0;
+  if (acc_status == Account::acc_uninit) {
+    CHECK(cb.store_long_bool(0, 2));  // account_uninit$00 = AccountState
+  } else if (acc_status == Account::acc_frozen) {
+    if (was_frozen) {
+      vm::CellBuilder cb2;
+      CHECK(account.split_depth_ ? cb2.store_long_bool(account.split_depth_ + 32, 6)  // _ ... = StateInit
+                                 : cb2.store_long_bool(0, 1));                        // ... split_depth:(Maybe (## 5))
+      CHECK(ticktock ? cb2.store_long_bool(ticktock | 4, 3) : cb2.store_long_bool(0, 1));  // special:(Maybe TickTock)
+      CHECK(cb2.store_maybe_ref(new_code) && cb2.store_maybe_ref(new_data) && cb2.store_maybe_ref(new_library));
+      // code:(Maybe ^Cell) data:(Maybe ^Cell) library:(HashmapE 256 SimpleLib)
+      auto frozen_state = cb2.finalize();
+      frozen_hash = frozen_state->get_hash().bits();
+      if (verbosity >= 3 * 0) {  // !!!DEBUG!!!
+        std::cerr << "freezing state of smart contract: ";
+        block::gen::t_StateInit.print_ref(std::cerr, frozen_state);
+        CHECK(block::gen::t_StateInit.validate_ref(frozen_state));
+        CHECK(block::tlb::t_StateInit.validate_ref(frozen_state));
+        std::cerr << "with hash " << frozen_hash.to_hex() << std::endl;
+      }
+    }
+    new_code.clear();
+    new_data.clear();
+    new_library.clear();
+    if (frozen_hash == account.addr_orig) {
+      // if frozen_hash equals account's "original" address (before rewriting), do not need storing hash
+      CHECK(cb.store_long_bool(0, 2));  // account_uninit$00 = AccountState
+    } else {
+      CHECK(cb.store_long_bool(1, 2)              // account_frozen$01
+            && cb.store_bits_bool(frozen_hash));  // state_hash:bits256
+    }
+  } else {
+    CHECK(acc_status == Account::acc_active && !was_frozen && !was_deleted);
+    si_pos = cb.size_ext() + 1;
+    CHECK(account.split_depth_ ? cb.store_long_bool(account.split_depth_ + 96, 7)      // account_active$1 _:StateInit
+                               : cb.store_long_bool(2, 2));                            // ... split_depth:(Maybe (## 5))
+    CHECK(ticktock ? cb.store_long_bool(ticktock | 4, 3) : cb.store_long_bool(0, 1));  // special:(Maybe TickTock)
+    CHECK(cb.store_maybe_ref(new_code) && cb.store_maybe_ref(new_data) && cb.store_maybe_ref(new_library));
+    // code:(Maybe ^Cell) data:(Maybe ^Cell) library:(HashmapE 256 SimpleLib)
+  }
+  auto storage = cb.finalize();
+  if (si_pos) {
+    auto cs_ref = load_cell_slice_ref(storage);
+    CHECK(cs_ref.unique_write().skip_ext(si_pos));
+    new_inner_state = std::move(cs_ref);
+  } else {
+    new_inner_state.clear();
+  }
+  vm::CellStorageStat& stats = new_storage_stat;
+  CHECK(stats.compute_used_storage(Ref<vm::Cell>(storage)));
+  CHECK(cb.store_long_bool(1, 1)                       // account$1
+        && cb.append_cellslice_bool(account.my_addr)   // addr:MsgAddressInt
+        && block::store_UInt7(cb, stats.cells)         // storage_used$_ cells:(VarUInteger 7)
+        && block::store_UInt7(cb, stats.bits)          //   bits:(VarUInteger 7)
+        && block::store_UInt7(cb, stats.public_cells)  //   public_cells:(VarUInteger 7)
+        && cb.store_long_bool(last_paid, 32));         // last_paid:uint32
+  if (due_payment.not_null() && td::sgn(due_payment) != 0) {
+    CHECK(cb.store_long_bool(1, 1) && block::tlb::t_Grams.store_integer_ref(cb, due_payment));
+    // due_payment:(Maybe Grams)
+  } else {
+    CHECK(cb.store_long_bool(0, 1));
+  }
+  CHECK(cb.append_data_cell_bool(std::move(storage)));
+  new_total_state = cb.finalize();
+  if (verbosity > 2) {
+    std::cerr << "new account state: ";
+    block::gen::t_Account.print_ref(std::cerr, new_total_state);
+  }
+  CHECK(block::gen::t_Account.validate_ref(new_total_state));
+  CHECK(block::tlb::t_Account.validate_ref(new_total_state));
+  return true;
+}
+
+bool Transaction::serialize() {
+  if (root.not_null()) {
+    return true;
+  }
+  if (!compute_state()) {
+    return false;
+  }
+  vm::Dictionary dict{15};
+  for (unsigned i = 0; i < out_msgs.size(); i++) {
+    td::BitArray<15> key{i};
+    if (!dict.set_ref(key, out_msgs[i], vm::Dictionary::SetMode::Add)) {
+      return false;
+    }
+  }
+  vm::CellBuilder cb, cb2;
+  if (!(cb.store_long_bool(7, 4)                                             // transaction$0111
+        && cb.store_bits_bool(account.addr)                                  // account_addr:bits256
+        && cb.store_long_bool(start_lt)                                      // lt:uint64
+        && cb.store_bits_bool(account.last_trans_hash_)                      // prev_trans_hash:bits256
+        && cb.store_long_bool(account.last_trans_lt_, 64)                    // prev_trans_lt:uint64
+        && cb.store_long_bool(account.now_, 32)                              // now:uint32
+        && cb.store_ulong_rchk_bool(out_msgs.size(), 15)                     // outmsg_cnt:uint15
+        && account.store_acc_status(cb)                                      // orig_status:AccountStatus
+        && account.store_acc_status(cb, acc_status)                          // end_status:AccountStatus
+        && cb2.store_maybe_ref(in_msg)                                       // ^[ in_msg:(Maybe ^(Message Any)) ...
+        && std::move(dict).append_dict_to_bool(cb2)                          //    out_msgs:(HashmapE 15 ^(Message Any))
+        && cb.store_ref_bool(cb2.finalize())                                 // ]
+        && total_fees.store(cb)                                              // total_fees:CurrencyCollection
+        && cb2.store_long_bool(0x72, 8)                                      //   update_hashes#72
+        && cb2.store_bits_bool(account.total_state->get_hash().bits(), 256)  //   old_hash:bits256
+        && cb2.store_bits_bool(new_total_state->get_hash().bits(), 256)      //   new_hash:bits256
+        && cb.store_ref_bool(cb2.finalize()))) {                             // state_update:^(HASH_UPDATE Account)
+    return false;
+  }
+
+  switch (trans_type) {
+    case tr_tick:  // fallthrough
+    case tr_tock: {
+      vm::CellBuilder cb3;
+      bool act = compute_phase->success;
+      bool act_ok = act && action_phase->success;
+      CHECK(cb2.store_long_bool(trans_type == tr_tick ? 2 : 3, 4)  // trans_tick_tock$000 is_tock:Bool
+            && serialize_storage_phase(cb2)                        // storage:TrStoragePhase
+            && serialize_compute_phase(cb2)                        // compute_ph:TrComputePhase
+            && cb2.store_bool_bool(act)                            // action:(Maybe
+            && (!act || (serialize_action_phase(cb3)               //   ^TrActionPhase)
+                         && cb2.store_ref_bool(cb3.finalize()))) &&
+            cb2.store_bool_bool(!act_ok)         // aborted:Bool
+            && cb2.store_bool_bool(was_deleted)  // destroyed:Bool
+            && cb.store_ref_bool(cb2.finalize()) && cb.finalize_to(root));
+      break;
+    }
+    case tr_ord: {
+      vm::CellBuilder cb3;
+      bool have_storage = (bool)storage_phase;
+      bool have_credit = (bool)credit_phase;
+      bool have_bounce = (bool)bounce_phase;
+      bool act = compute_phase->success;
+      bool act_ok = act && action_phase->success;
+      CHECK(cb2.store_long_bool(0, 4)                           // trans_ord$0000
+            && cb2.store_long_bool(!bounce_enabled, 1)          // credit_first:Bool
+            && cb2.store_bool_bool(have_storage)                // storage_ph:(Maybe
+            && (!have_storage || serialize_storage_phase(cb2))  //   TrStoragePhase)
+            && cb2.store_bool_bool(have_credit)                 // credit_ph:(Maybe
+            && (!have_credit || serialize_credit_phase(cb2))    //   TrCreditPhase)
+            && serialize_compute_phase(cb2)                     // compute_ph:TrComputePhase
+            && cb2.store_bool_bool(act)                         // action:(Maybe
+            && (!act || (serialize_action_phase(cb3) && cb2.store_ref_bool(cb3.finalize())))  //   ^TrActionPhase)
+            && cb2.store_bool_bool(!act_ok)                                                   // aborted:Bool
+            && cb2.store_bool_bool(have_bounce)                                               // bounce:(Maybe
+            && (!have_bounce || serialize_bounce_phase(cb2))                                  //   TrBouncePhase
+            && cb2.store_bool_bool(was_deleted)                                               // destroyed:Bool
+            && cb.store_ref_bool(cb2.finalize()) && cb.finalize_to(root));
+      break;
+    }
+    default:
+      return false;
+  }
+  if (verbosity >= 3 * 1) {
+    std::cerr << "new transaction: ";
+    block::gen::t_Transaction.print_ref(std::cerr, root);
+    vm::load_cell_slice(root).print_rec(std::cerr);
+  }
+
+  if (!block::gen::t_Transaction.validate_ref(root)) {
+    LOG(ERROR) << "newly-generated transaction failed to pass automated validation:";
+    vm::load_cell_slice(root).print_rec(std::cerr);
+    block::gen::t_Transaction.print_ref(std::cerr, root);
+    root.clear();
+    return false;
+  }
+  if (!block::tlb::t_Transaction.validate_ref(root)) {
+    LOG(ERROR) << "newly-generated transaction failed to pass hand-written validation:";
+    vm::load_cell_slice(root).print_rec(std::cerr);
+    block::gen::t_Transaction.print_ref(std::cerr, root);
+    root.clear();
+    return false;
+  }
+
+  return true;
+}
+
+bool Transaction::serialize_storage_phase(vm::CellBuilder& cb) {
+  if (!storage_phase) {
+    return false;
+  }
+  StoragePhase& sp = *storage_phase;
+  bool ok;
+  // tr_phase_storage$_ storage_fees_collected:Grams
+  if (sp.fees_collected.not_null()) {
+    ok = block::tlb::t_Grams.store_integer_ref(cb, sp.fees_collected);
+  } else {
+    ok = block::tlb::t_Grams.null_value(cb);
+  }
+  // storage_fees_due:(Maybe Grams)
+  ok &= block::store_Maybe_Grams_nz(cb, sp.fees_due);
+  // status_change:AccStatusChange
+  if (sp.deleted || sp.frozen) {
+    ok &= cb.store_long_bool(sp.deleted ? 3 : 2, 2);  // acst_frozen$10 acst_deleted$11
+  } else {
+    ok &= cb.store_long_bool(0, 1);  // acst_unchanged$0 = AccStatusChange
+  }
+  return ok;
+}
+
+bool Transaction::serialize_credit_phase(vm::CellBuilder& cb) {
+  if (!credit_phase) {
+    return false;
+  }
+  CreditPhase& cp = *credit_phase;
+  // tr_phase_credit$_ due_fees_collected:(Maybe Grams) credit:CurrencyCollection
+  return block::store_Maybe_Grams_nz(cb, cp.due_fees_collected) && cp.credit.store(cb);
+}
+
+bool Transaction::serialize_compute_phase(vm::CellBuilder& cb) {
+  if (!compute_phase) {
+    return false;
+  }
+  ComputePhase& cp = *compute_phase;
+  switch (cp.skip_reason) {
+    // tr_compute_phase_skipped$0 reason:ComputeSkipReason;
+    case ComputePhase::sk_no_state:
+      return cb.store_long_bool(0, 3);  // cskip_no_state$00 = ComputeSkipReason;
+    case ComputePhase::sk_bad_state:
+      return cb.store_long_bool(1, 3);  // cskip_bad_state$01 = ComputeSkipReason;
+    case ComputePhase::sk_no_gas:
+      return cb.store_long_bool(2, 3);  // cskip_no_gas$10 = ComputeSkipReason;
+    case ComputePhase::sk_none:
+      break;
+    default:
+      return false;
+  }
+  vm::CellBuilder cb2;
+  bool ok, credit = (cp.gas_credit != 0), exarg = (cp.exit_arg != 0);
+  ok = cb.store_long_bool(1, 1)                                   // tr_phase_compute_vm$1
+       && cb.store_long_bool(cp.success, 1)                       // success:Bool
+       && cb.store_long_bool(cp.msg_state_used, 1)                // msg_state_used:Bool
+       && cb.store_long_bool(cp.account_activated, 1)             // account_activated:Bool
+       && block::tlb::t_Grams.store_integer_ref(cb, cp.gas_fees)  // gas_fees:Grams
+       && block::store_UInt7(cb2, cp.gas_used)                    // ^[ gas_used:(VarUInteger 7)
+       && block::store_UInt7(cb2, cp.gas_limit)                   //    gas_limit:(VarUInteger 7)
+       && cb2.store_long_bool(credit, 1)                          //    gas_credit:(Maybe (VarUInteger 3))
+       && (!credit || block::tlb::t_VarUInteger_3.store_long(cb2, cp.gas_credit)) &&
+       cb2.store_long_rchk_bool(cp.mode, 8)      //    mode:int8
+       && cb2.store_long_bool(cp.exit_code, 32)  //    exit_code:int32
+       && cb2.store_long_bool(exarg, 1)          //    exit_arg:(Maybe int32)
+       && (!exarg || cb2.store_long_bool(cp.exit_arg, 32)) &&
+       cb2.store_ulong_rchk_bool(cp.vm_steps, 32)      //    vm_steps:uint32
+       && cb2.store_bits_bool(cp.vm_init_state_hash)   //    vm_init_state_hash:bits256
+       && cb2.store_bits_bool(cp.vm_final_state_hash)  //    vm_final_state_hash:bits256
+       && cb.store_ref_bool(cb2.finalize());           // ] = TrComputePhase
+  return ok;
+}
+
+bool Transaction::serialize_action_phase(vm::CellBuilder& cb) {
+  if (!action_phase) {
+    return false;
+  }
+  ActionPhase& ap = *action_phase;
+  bool ok, arg = (ap.result_arg != 0);
+  ok = cb.store_long_bool(ap.success, 1)                                             // tr_phase_action$_ success:Bool
+       && cb.store_long_bool(ap.valid, 1)                                            // valid:Bool
+       && cb.store_long_bool(ap.no_funds, 1)                                         // no_funds:Bool
+       && cb.store_long_bool(ap.acc_status_change, (ap.acc_status_change >> 1) + 1)  // status_change:AccStatusChange
+       && block::store_Maybe_Grams_nz(cb, ap.total_fwd_fees)                         // total_fwd_fees:(Maybe Grams)
+       && block::store_Maybe_Grams_nz(cb, ap.total_action_fees)                      // total_action_fees:(Maybe Grams)
+       && cb.store_long_bool(ap.result_code, 32)                                     // result_code:int32
+       && cb.store_long_bool(arg, 1)                                                 // result_arg:(Maybe
+       && (!arg || cb.store_long_bool(ap.result_arg, 32))                            //    uint32)
+       && cb.store_ulong_rchk_bool(ap.tot_actions, 16)                               // tot_actions:uint16
+       && cb.store_ulong_rchk_bool(ap.spec_actions, 16)                              // spec_actions:uint16
+       && cb.store_ulong_rchk_bool(ap.skipped_actions, 16)                           // skipped_actions:uint16
+       && cb.store_ulong_rchk_bool(ap.msgs_created, 16)                              // msgs_created:uint16
+       && cb.store_bits_bool(ap.action_list_hash)                                    // action_list_hash:bits256
+       && block::store_UInt7(cb, ap.tot_msg_cells, ap.tot_msg_bits);                 // tot_msg_size:StorageUsed
+  return ok;
+}
+
+bool Transaction::serialize_bounce_phase(vm::CellBuilder& cb) {
+  if (!bounce_phase) {
+    return false;
+  }
+  BouncePhase& bp = *bounce_phase;
+  if (!(bp.ok ^ bp.nofunds)) {
+    return false;
+  }
+  if (bp.nofunds) {
+    return cb.store_long_bool(1, 2)                              // tr_phase_bounce_nofunds$01
+           && block::store_UInt7(cb, bp.msg_cells, bp.msg_bits)  // msg_size:StorageUsed
+           && block::tlb::t_Grams.store_long(cb, bp.fwd_fees);   // req_fwd_fees:Grams
+  } else {
+    return cb.store_long_bool(1, 1)                                      // tr_phase_bounce_ok$1
+           && block::store_UInt7(cb, bp.msg_cells, bp.msg_bits)          // msg_size:StorageUsed
+           && block::tlb::t_Grams.store_long(cb, bp.fwd_fees_collected)  // msg_fees:Grams
+           && block::tlb::t_Grams.store_long(cb, bp.fwd_fees);           // fwd_fees:Grams
+  }
+}
+
+td::Result<vm::NewCellStorageStat::Stat> Transaction::estimate_block_storage_profile_incr(
+    const vm::NewCellStorageStat& store_stat, const vm::CellUsageTree* usage_tree) const {
+  if (root.is_null()) {
+    return td::Status::Error("Cannot estimate the size profile of a transaction before it is serialized");
+  }
+  if (new_total_state.is_null()) {
+    return td::Status::Error("Cannot estimate the size profile of a transaction before its new state is computed");
+  }
+  return store_stat.tentative_add_proof(new_total_state, usage_tree) + store_stat.tentative_add_cell(root);
+}
+
+bool Transaction::update_block_storage_profile(vm::NewCellStorageStat& store_stat,
+                                               const vm::CellUsageTree* usage_tree) const {
+  if (root.is_null() || new_total_state.is_null()) {
+    return false;
+  }
+  store_stat.add_proof(new_total_state, usage_tree);
+  store_stat.add_cell(root);
+  return true;
+}
+
+bool Transaction::would_fit(unsigned cls, const block::BlockLimitStatus& blimst) const {
+  auto res = estimate_block_storage_profile_incr(blimst.st_stat, blimst.limits.usage_tree);
+  if (res.is_error()) {
+    LOG(ERROR) << res.move_as_error();
+    return false;
+  }
+  auto extra = res.move_as_ok();
+  return blimst.would_fit(cls, end_lt, gas_used(), &extra);
+}
+
+bool Transaction::update_limits(block::BlockLimitStatus& blimst) const {
+  return blimst.update_lt(end_lt) && blimst.update_gas(gas_used()) && blimst.add_proof(new_total_state) &&
+         blimst.add_cell(root) && blimst.add_transaction() && blimst.add_account(is_first);
+}
+
+/*
+ * 
+ *  COMMIT TRANSACTION
+ * 
+ */
+
+Ref<vm::Cell> Transaction::commit(Account& acc) {
+  CHECK(account.last_trans_end_lt_ <= start_lt && start_lt < end_lt);
+  CHECK(root.not_null());
+  CHECK(new_total_state.not_null());
+  CHECK((const void*)&acc == (const void*)&account);
+  // export all fields modified by the Transaction into original account
+  // NB: this is the only method that modifies account
+  if (orig_addr_rewrite_set && new_split_depth >= 0 && acc.status == Account::acc_nonexist &&
+      acc_status == Account::acc_active) {
+    LOG(DEBUG) << "setting address rewriting info for newly-activated account " << acc.addr.to_hex()
+               << " with split_depth=" << new_split_depth
+               << ", orig_addr_rewrite=" << orig_addr_rewrite.bits().to_hex(new_split_depth);
+    CHECK(acc.init_rewrite_addr(new_split_depth, orig_addr_rewrite.bits()));
+  }
+  acc.status = (acc_status == Account::acc_deleted ? Account::acc_nonexist : acc_status);
+  acc.last_trans_lt_ = start_lt;
+  acc.last_trans_end_lt_ = end_lt;
+  acc.last_trans_hash_ = root->get_hash().bits();
+  acc.last_paid = last_paid;
+  acc.storage_stat = new_storage_stat;
+  acc.balance = std::move(balance);
+  acc.due_payment = std::move(due_payment);
+  acc.total_state = std::move(new_total_state);
+  acc.inner_state = std::move(new_inner_state);
+  if (was_frozen) {
+    acc.state_hash = frozen_hash;
+  }
+  acc.my_addr = std::move(my_addr);
+  // acc.my_addr_exact = std::move(my_addr_exact);
+  acc.code = std::move(new_code);
+  acc.data = std::move(new_data);
+  acc.library = std::move(new_library);
+  if (acc.status == Account::acc_active) {
+    acc.tick = new_tick;
+    acc.tock = new_tock;
+  } else {
+    acc.tick = acc.tock = false;
+  }
+  end_lt = 0;
+  acc.push_transaction(root, start_lt);
+  return root;
+}
+
+LtCellRef Transaction::extract_out_msg(unsigned i) {
+  return {start_lt + i + 1, std::move(out_msgs.at(i))};
+}
+
+NewOutMsg Transaction::extract_out_msg_ext(unsigned i) {
+  return {start_lt + i + 1, std::move(out_msgs.at(i)), root};
+}
+
+void Transaction::extract_out_msgs(std::vector<LtCellRef>& list) {
+  for (unsigned i = 0; i < out_msgs.size(); i++) {
+    list.emplace_back(start_lt + i + 1, std::move(out_msgs[i]));
+  }
+}
+
+void Account::push_transaction(Ref<vm::Cell> trans_root, ton::LogicalTime trans_lt) {
+  transactions.emplace_back(trans_lt, std::move(trans_root));
+}
+
+bool Account::create_account_block(vm::CellBuilder& cb) {
+  if (transactions.empty()) {
+    return false;
+  }
+  if (!(cb.store_long_bool(5, 4)         // acc_trans#5
+        && cb.store_bits_bool(addr))) {  // account_addr:bits256
+    return false;
+  }
+  vm::AugmentedDictionary dict{64, block::tlb::aug_AccountTransactions};
+  for (auto& z : transactions) {
+    if (!dict.set_ref(td::BitArray<64>{(long long)z.first}, z.second, vm::Dictionary::SetMode::Add)) {
+      LOG(ERROR) << "error creating the list of transactions for account " << addr.to_hex()
+                 << " : cannot add transaction with lt=" << z.first;
+      return false;
+    }
+  }
+  Ref<vm::Cell> dict_root = std::move(dict).extract_root_cell();
+  // transactions:(HashmapAug 64 ^Transaction Grams)
+  if (dict_root.is_null() || !cb.append_cellslice_bool(vm::load_cell_slice(std::move(dict_root)))) {
+    return false;
+  }
+  vm::CellBuilder cb2;
+  return cb2.store_long_bool(0x72, 8)                                      // update_hashes#72
+         && cb2.store_bits_bool(orig_total_state->get_hash().bits(), 256)  // old_hash:bits256
+         && cb2.store_bits_bool(total_state->get_hash().bits(), 256)       // new_hash:bits256
+         && cb.store_ref_bool(cb2.finalize());                             // state_update:^(HASH_UPDATE Account)
+}
+
+bool Account::libraries_changed() const {
+  bool s = orig_library.not_null();
+  bool t = library.not_null();
+  if (s & t) {
+    return orig_library->get_hash() != library->get_hash();
+  } else {
+    return s != t;
+  }
+}
+
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/block/transaction.h b/submodules/ton/tonlib-src/crypto/block/transaction.h
new file mode 100644
index 0000000000..94b2a85300
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/block/transaction.h
@@ -0,0 +1,406 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "common/refcnt.hpp"
+#include "common/refint.h"
+#include "vm/cells.h"
+#include "vm/cellslice.h"
+#include "vm/dict.h"
+#include "vm/boc.h"
+#include <ostream>
+#include "tl/tlblib.hpp"
+#include "td/utils/bits.h"
+#include "ton/ton-types.h"
+#include "block/block.h"
+#include "block/mc-config.h"
+
+namespace block {
+using td::Ref;
+using LtCellRef = std::pair<ton::LogicalTime, Ref<vm::Cell>>;
+
+struct Account;
+struct Transaction;
+
+struct CollatorError {
+  std::string msg;
+  CollatorError(std::string _msg) : msg(_msg) {
+  }
+  CollatorError(const char* _msg) : msg(_msg) {
+  }
+  std::string get_msg() const {
+    return msg;
+  }
+};
+
+static inline bool operator<(const LtCellRef& a, const LtCellRef& b) {
+  return a.first < b.first;
+}
+
+struct LtCellCompare {
+  bool operator()(const LtCellRef& a, const LtCellRef& b) {
+    return a.first < b.first;
+  }
+};
+
+struct NewOutMsg {
+  ton::LogicalTime lt;
+  Ref<vm::Cell> msg;
+  Ref<vm::Cell> trans;
+  NewOutMsg(ton::LogicalTime _lt, Ref<vm::Cell> _msg, Ref<vm::Cell> _trans)
+      : lt(_lt), msg(std::move(_msg)), trans(std::move(_trans)) {
+  }
+  bool operator<(const NewOutMsg& other) const & {
+    return lt < other.lt || (lt == other.lt && msg->get_hash() < other.msg->get_hash());
+  }
+  bool operator>(const NewOutMsg& other) const & {
+    return lt > other.lt || (lt == other.lt && other.msg->get_hash() < msg->get_hash());
+  }
+};
+
+struct StoragePhaseConfig {
+  const std::vector<block::StoragePrices>* pricing{nullptr};
+  td::RefInt256 freeze_due_limit;
+  td::RefInt256 delete_due_limit;
+  StoragePhaseConfig() = default;
+  StoragePhaseConfig(const std::vector<block::StoragePrices>* _pricing, td::RefInt256 freeze_limit = {},
+                     td::RefInt256 delete_limit = {})
+      : pricing(_pricing), freeze_due_limit(freeze_limit), delete_due_limit(delete_limit) {
+  }
+};
+
+struct StoragePhase {
+  td::RefInt256 fees_collected;
+  td::RefInt256 fees_due;
+  ton::UnixTime last_paid_updated;
+  bool frozen{false};
+  bool deleted{false};
+  bool is_special{false};
+};
+
+struct ComputePhaseConfig {
+  td::uint64 gas_price;
+  td::uint64 gas_limit;
+  td::uint64 special_gas_limit;
+  td::uint64 gas_credit;
+  static constexpr td::uint64 gas_infty = (1ULL << 63) - 1;
+  td::RefInt256 gas_price256;
+  td::RefInt256 max_gas_threshold;
+  std::unique_ptr<vm::Dictionary> libraries;
+  Ref<vm::Cell> global_config;
+  td::BitArray<256> block_rand_seed;
+  ComputePhaseConfig(td::uint64 _gas_price = 0, td::uint64 _gas_limit = 0, td::uint64 _gas_credit = 0)
+      : gas_price(_gas_price), gas_limit(_gas_limit), special_gas_limit(_gas_limit), gas_credit(_gas_credit) {
+    compute_threshold();
+  }
+  ComputePhaseConfig(td::uint64 _gas_price, td::uint64 _gas_limit, td::uint64 _spec_gas_limit, td::uint64 _gas_credit)
+      : gas_price(_gas_price), gas_limit(_gas_limit), special_gas_limit(_spec_gas_limit), gas_credit(_gas_credit) {
+    compute_threshold();
+  }
+  void compute_threshold();
+  td::uint64 gas_bought_for(td::RefInt256 nanograms) const;
+  td::RefInt256 compute_gas_price(td::uint64 gas_used) const;
+  void set_gas_price(td::uint64 _gas_price) {
+    gas_price = _gas_price;
+    compute_threshold();
+  }
+  Ref<vm::Cell> lookup_library(td::ConstBitPtr key) const;
+  Ref<vm::Cell> lookup_library(const td::Bits256& key) const {
+    return lookup_library(key.bits());
+  }
+  Ref<vm::Cell> get_lib_root() const {
+    return libraries ? libraries->get_root_cell() : Ref<vm::Cell>{};
+  }
+};
+
+// msg_fwd_fees = (lump_price + ceil((bit_price * msg.bits + cell_price * msg.cells)/2^16)) nanograms
+// ihr_fwd_fees = ceil((msg_fwd_fees * ihr_price_factor)/2^16) nanograms
+// bits in the root cell of a message are not included in msg.bits (lump_price pays for them)
+
+struct MsgPrices {
+  td::uint64 lump_price;
+  td::uint64 bit_price;
+  td::uint64 cell_price;
+  td::uint32 ihr_factor;
+  td::uint32 first_frac;
+  td::uint32 next_frac;
+  td::uint64 compute_fwd_fees(td::uint64 cells, td::uint64 bits) const;
+  std::pair<td::uint64, td::uint64> compute_fwd_ihr_fees(td::uint64 cells, td::uint64 bits,
+                                                         bool ihr_disabled = false) const;
+  MsgPrices() = default;
+  MsgPrices(td::uint64 lump, td::uint64 bitp, td::uint64 cellp, td::uint32 ihrf, td::uint32 firstf, td::uint32 nextf)
+      : lump_price(lump), bit_price(bitp), cell_price(cellp), ihr_factor(ihrf), first_frac(firstf), next_frac(nextf) {
+  }
+  td::RefInt256 get_first_part(td::RefInt256 total) const;
+  td::uint64 get_first_part(td::uint64 total) const;
+  td::RefInt256 get_next_part(td::RefInt256 total) const;
+};
+
+struct ActionPhaseConfig {
+  int max_actions{255};
+  MsgPrices fwd_std;
+  MsgPrices fwd_mc;  // from/to masterchain
+  const WorkchainSet* workchains{nullptr};
+  const MsgPrices& fetch_msg_prices(bool is_masterchain) const {
+    return is_masterchain ? fwd_mc : fwd_std;
+  }
+};
+
+struct CreditPhase {
+  td::RefInt256 due_fees_collected;
+  block::CurrencyCollection credit;
+  // td::RefInt256 credit;
+  // Ref<vm::Cell> credit_extra;
+};
+
+struct ComputePhase {
+  enum { sk_none, sk_no_state, sk_bad_state, sk_no_gas };
+  int skip_reason{sk_none};
+  bool success{false};
+  bool msg_state_used{false};
+  bool account_activated{false};
+  bool out_of_gas{false};
+  bool accepted{false};
+  td::RefInt256 gas_fees;
+  td::uint64 gas_used, gas_max, gas_limit, gas_credit;
+  int mode;
+  int exit_code;
+  int exit_arg;
+  int vm_steps;
+  ton::Bits256 vm_init_state_hash, vm_final_state_hash;
+  Ref<vm::Cell> in_msg;
+  Ref<vm::Cell> new_data;
+  Ref<vm::Cell> actions;
+};
+
+struct ActionPhase {
+  bool success{false};
+  bool valid{false};
+  bool no_funds{false};
+  bool code_changed{false};
+  bool action_list_invalid{false};
+  bool acc_delete_req{false};
+  enum { acst_unchanged = 0, acst_frozen = 2, acst_deleted = 3 };
+  int acc_status_change{acst_unchanged};
+  td::RefInt256 total_fwd_fees;     // all fees debited from the account
+  td::RefInt256 total_action_fees;  // fees credited to validators in this action phase
+  int result_code;
+  int result_arg;
+  int tot_actions;
+  int spec_actions;
+  int skipped_actions;
+  int msgs_created;
+  Ref<vm::Cell> new_code;
+  td::BitArray<256> action_list_hash;
+  block::CurrencyCollection remaining_balance, reserved_balance;
+  // td::RefInt256 remaining_balance;
+  // Ref<vm::Cell> remaining_extra;
+  // td::RefInt256 reserved_balance;
+  // Ref<vm::Cell> reserved_extra;
+  std::vector<Ref<vm::Cell>> action_list;  // processed in reverse order
+  std::vector<Ref<vm::Cell>> out_msgs;
+  ton::LogicalTime end_lt;
+  unsigned long long tot_msg_bits{0}, tot_msg_cells{0};
+};
+
+struct BouncePhase {
+  bool ok{false};
+  bool nofunds{false};
+  unsigned long long msg_bits, msg_cells;
+  unsigned long long fwd_fees, fwd_fees_collected;
+  Ref<vm::Cell> out_msg;
+};
+
+struct Account {
+  enum { acc_nonexist = 0, acc_uninit = 1, acc_frozen = 2, acc_active = 3, acc_deleted = 4 };
+  int status{acc_nonexist}, orig_status{acc_nonexist};
+  bool is_special{false};
+  bool tick{false};
+  bool tock{false};
+  bool created{false};
+  bool split_depth_set_{false};
+  unsigned char split_depth_{0};
+  int verbosity{3 * 0};
+  ton::UnixTime now_{0};
+  ton::WorkchainId workchain{ton::workchainInvalid};
+  td::BitArray<32> addr_rewrite;     // rewrite (anycast) data, split_depth bits
+  ton::StdSmcAddress addr;           // rewritten address (by replacing a prefix of `addr_orig` with `addr_rewrite`)
+  ton::StdSmcAddress addr_orig;      // address indicated in smart-contract data
+  Ref<vm::CellSlice> my_addr;        // address as stored in the smart contract (MsgAddressInt)
+  Ref<vm::CellSlice> my_addr_exact;  // exact address without anycast info
+  ton::LogicalTime last_trans_end_lt_;
+  ton::LogicalTime last_trans_lt_;
+  ton::Bits256 last_trans_hash_;
+  ton::LogicalTime block_lt;
+  ton::UnixTime last_paid;
+  vm::CellStorageStat storage_stat;
+  block::CurrencyCollection balance;
+  // td::RefInt256 balance;
+  // Ref<vm::Cell> extra_balance;
+  td::RefInt256 due_payment;
+  Ref<vm::Cell> orig_total_state;  // ^Account
+  Ref<vm::Cell> total_state;       // ^Account
+  Ref<vm::CellSlice> inner_state;  // StateInit
+  ton::Bits256 state_hash;         // hash of StateInit for frozen accounts
+  Ref<vm::Cell> code, data, library, orig_library;
+  std::vector<LtCellRef> transactions;
+  Account() = default;
+  Account(ton::WorkchainId wc, td::ConstBitPtr _addr) : workchain(wc), addr(_addr) {
+  }
+  Account(ton::WorkchainId wc, td::ConstBitPtr _addr, int depth)
+      : split_depth_set_(true), split_depth_((unsigned char)depth), workchain(wc), addr(_addr) {
+  }
+  block::CurrencyCollection get_balance() const {
+    return balance;
+  }
+  bool set_address(ton::WorkchainId wc, td::ConstBitPtr new_addr);
+  bool unpack(Ref<vm::CellSlice> account, Ref<vm::CellSlice> extra, ton::UnixTime now, bool special = false);
+  bool init_new(ton::UnixTime now);
+  bool recompute_tmp_addr(Ref<vm::CellSlice>& tmp_addr, int split_depth, td::ConstBitPtr orig_addr_rewrite) const;
+  td::RefInt256 compute_storage_fees(ton::UnixTime now, const std::vector<block::StoragePrices>& pricing) const;
+  bool is_masterchain() const {
+    return workchain == ton::masterchainId;
+  }
+  bool belongs_to_shard(ton::ShardIdFull shard) const;
+  bool store_acc_status(vm::CellBuilder& cb, int status) const;
+  bool store_acc_status(vm::CellBuilder& cb) const {
+    return store_acc_status(cb, status);
+  }
+  void push_transaction(Ref<vm::Cell> trans_root, ton::LogicalTime trans_lt);
+  bool libraries_changed() const;
+  bool create_account_block(vm::CellBuilder& cb);  // stores an AccountBlock with all transactions
+
+ protected:
+  friend struct Transaction;
+  bool set_split_depth(int split_depth);
+  bool check_split_depth(int split_depth) const;
+  bool init_rewrite_addr(int split_depth, td::ConstBitPtr orig_addr_rewrite);
+
+ private:
+  bool unpack_address(vm::CellSlice& addr_cs);
+  bool unpack_storage_info(vm::CellSlice& cs);
+  bool unpack_state(vm::CellSlice& cs);
+  bool parse_maybe_anycast(vm::CellSlice& cs);
+  bool store_maybe_anycast(vm::CellBuilder& cb) const;
+  bool compute_my_addr(bool force = false);
+};
+
+struct Transaction {
+  static constexpr unsigned max_msg_bits = (1 << 21), max_msg_cells = (1 << 13);
+  enum {
+    tr_none,
+    tr_ord,
+    tr_storage,
+    tr_tick,
+    tr_tock,
+    tr_split_prepare,
+    tr_split_install,
+    tr_merge_prepare,
+    tr_merge_install
+  };
+  int trans_type{tr_none};
+  bool was_deleted{false};
+  bool was_frozen{false};
+  bool was_activated{false};
+  bool was_created{false};
+  bool bounce_enabled{false};
+  bool in_msg_extern{false};
+  bool use_msg_state{false};
+  bool is_first{false};
+  bool orig_addr_rewrite_set{false};
+  bool new_tick;
+  bool new_tock;
+  signed char new_split_depth{-1};
+  ton::UnixTime now;
+  int acc_status;
+  int verbosity{3 * 0};
+  int in_msg_type{0};
+  const Account& account;                     // only `commit` method modifies the account
+  Ref<vm::CellSlice> my_addr, my_addr_exact;  // almost the same as in account.*
+  ton::LogicalTime start_lt, end_lt;
+  block::CurrencyCollection balance;
+  block::CurrencyCollection msg_balance_remaining;
+  td::RefInt256 due_payment;
+  td::RefInt256 in_fwd_fee, msg_fwd_fees;
+  block::CurrencyCollection total_fees{0};
+  ton::UnixTime last_paid;
+  Ref<vm::Cell> root;
+  Ref<vm::Cell> new_total_state;
+  Ref<vm::CellSlice> new_inner_state;
+  // Ref<vm::Cell> extra_balance;
+  // Ref<vm::Cell> msg_extra;
+  Ref<vm::Cell> new_code, new_data, new_library;
+  Ref<vm::Cell> in_msg, in_msg_state;
+  Ref<vm::CellSlice> in_msg_body;
+  Ref<vm::Cell> in_msg_library;
+  td::BitArray<256> frozen_hash;
+  td::BitArray<32> orig_addr_rewrite;
+  std::vector<Ref<vm::Cell>> out_msgs;
+  std::unique_ptr<StoragePhase> storage_phase;
+  std::unique_ptr<CreditPhase> credit_phase;
+  std::unique_ptr<ComputePhase> compute_phase;
+  std::unique_ptr<ActionPhase> action_phase;
+  std::unique_ptr<BouncePhase> bounce_phase;
+  vm::CellStorageStat new_storage_stat;
+  Transaction(const Account& _account, int ttype, ton::LogicalTime req_start_lt, ton::UnixTime _now,
+              Ref<vm::Cell> _inmsg = {});
+  bool unpack_input_msg(bool ihr_delivered, const ActionPhaseConfig* cfg);
+  bool check_in_msg_state_hash();
+  bool prepare_storage_phase(const StoragePhaseConfig& cfg, bool force_collect = true);
+  bool prepare_credit_phase();
+  bool compute_gas_limits(ComputePhase& cp, const ComputePhaseConfig& cfg);
+  Ref<vm::Stack> prepare_vm_stack(ComputePhase& cp);
+  std::vector<Ref<vm::Cell>> compute_vm_libraries(const ComputePhaseConfig& cfg);
+  bool prepare_compute_phase(const ComputePhaseConfig& cfg);
+  bool prepare_action_phase(const ActionPhaseConfig& cfg);
+  bool prepare_bounce_phase(const ActionPhaseConfig& cfg);
+  bool compute_state();
+  bool serialize();
+  td::uint64 gas_used() const {
+    return compute_phase ? compute_phase->gas_used : 0;
+  }
+
+  td::Result<vm::NewCellStorageStat::Stat> estimate_block_storage_profile_incr(
+      const vm::NewCellStorageStat& store_stat, const vm::CellUsageTree* usage_tree) const;
+  bool update_block_storage_profile(vm::NewCellStorageStat& store_stat, const vm::CellUsageTree* usage_tree) const;
+  bool would_fit(unsigned cls, const block::BlockLimitStatus& blk_lim_st) const;
+  bool update_limits(block::BlockLimitStatus& blk_lim_st) const;
+
+  Ref<vm::Cell> commit(Account& _account);  // _account should point to the same account
+  LtCellRef extract_out_msg(unsigned i);
+  NewOutMsg extract_out_msg_ext(unsigned i);
+  void extract_out_msgs(std::vector<LtCellRef>& list);
+
+ private:
+  Ref<vm::Tuple> prepare_vm_c7(const ComputePhaseConfig& cfg) const;
+  bool prepare_rand_seed(td::BitArray<256>& rand_seed, const ComputePhaseConfig& cfg) const;
+  int try_action_set_code(vm::CellSlice& cs, ActionPhase& ap, const ActionPhaseConfig& cfg);
+  int try_action_send_msg(vm::CellSlice& cs, ActionPhase& ap, const ActionPhaseConfig& cfg);
+  int try_action_reserve_currency(vm::CellSlice& cs, ActionPhase& ap, const ActionPhaseConfig& cfg);
+  bool check_replace_src_addr(Ref<vm::CellSlice>& src_addr) const;
+  bool check_rewrite_dest_addr(Ref<vm::CellSlice>& dest_addr, const ActionPhaseConfig& cfg,
+                               bool* is_mc = nullptr) const;
+  bool serialize_storage_phase(vm::CellBuilder& cb);
+  bool serialize_credit_phase(vm::CellBuilder& cb);
+  bool serialize_compute_phase(vm::CellBuilder& cb);
+  bool serialize_action_phase(vm::CellBuilder& cb);
+  bool serialize_bounce_phase(vm::CellBuilder& cb);
+  bool unpack_msg_state(bool lib_only = false);
+};
+
+}  // namespace block
diff --git a/submodules/ton/tonlib-src/crypto/common/AtomicRef.h b/submodules/ton/tonlib-src/crypto/common/AtomicRef.h
new file mode 100644
index 0000000000..91ad733479
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/common/AtomicRef.h
@@ -0,0 +1,200 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/SpinLock.h"
+#include "common/refcnt.hpp"
+
+#include <type_traits>
+
+namespace td {
+template <class T>
+class AtomicRefSpinlock {
+ public:
+  AtomicRefSpinlock() = default;
+  AtomicRefSpinlock(Ref<T>&& ref) : ref_(ref.release()) {
+  }
+  ~AtomicRefSpinlock() {
+    Ref<T>(ref_.load(std::memory_order_relaxed), typename Ref<T>::acquire_t{});
+  }
+  AtomicRefSpinlock(AtomicRefSpinlock&&) = delete;
+  AtomicRefSpinlock& operator=(AtomicRefSpinlock&&) = delete;
+  AtomicRefSpinlock(const AtomicRefSpinlock&) = delete;
+  AtomicRefSpinlock& operator=(const AtomicRefSpinlock&) = delete;
+
+  Ref<T> load() const {
+    auto guard = spin_lock_.lock();
+    return Ref<T>(ref_.load(std::memory_order_relaxed));
+  }
+  Ref<T> extract() const {
+    auto guard = spin_lock_.lock();
+    return Ref<T>(ref_.exchange(nullptr, std::memory_order_release), typename Ref<T>::acquire_t{});
+  }
+
+  Ref<T> load_unsafe() const {
+    return Ref<T>(get_unsafe());
+  }
+  const T* get_unsafe() const {
+    return ref_.load(std::memory_order_acquire);
+  }
+  bool store_if_empty(Ref<T>& desired) {
+    auto guard = spin_lock_.lock();
+    if (ref_.load(std::memory_order_relaxed) == nullptr) {
+      ref_.store(desired.release(), std::memory_order_release);
+      return true;
+    }
+    return false;
+  }
+
+  void store(Ref<T>&& ref) {
+    auto guard = spin_lock_.lock();
+    Ref<T>(ref_.exchange(ref.release(), std::memory_order_acq_rel), typename Ref<T>::acquire_t{});
+  }
+
+ private:
+  mutable SpinLock spin_lock_;
+  std::atomic<T*> ref_{nullptr};
+};
+
+template <class T>
+class AtomicRefLockfree {
+ public:
+  AtomicRefLockfree() = default;
+  static constexpr int BATCH_SIZE = 100;
+  AtomicRefLockfree(Ref<T>&& ref) : ptr_(Ptr(ref.release(), BATCH_SIZE)) {
+    Ref<T>::acquire_shared(ptr_.load(std::memory_order_relaxed).ptr(), BATCH_SIZE);
+  }
+  ~AtomicRefLockfree() {
+    auto ptr = ptr_.load(std::memory_order_relaxed);
+    if (ptr.ptr()) {
+      Ref<T>::release_shared(ptr.ptr(), ptr.ref_cnt() + 1);
+    }
+  }
+  AtomicRefLockfree(AtomicRefLockfree&&) = delete;
+  AtomicRefLockfree& operator=(AtomicRefLockfree&&) = delete;
+  AtomicRefLockfree(const AtomicRefLockfree&) = delete;
+  AtomicRefLockfree& operator=(const AtomicRefLockfree&) = delete;
+
+  Ref<T> load() const {
+    auto ptr = ptr_.load();
+    while (ptr.ptr()) {
+      if (ptr.ref_cnt() == 0) {
+        td::this_thread::yield();
+        ptr = ptr_.load();
+        continue;
+      }
+      auto new_ptr = Ptr(ptr.ptr(), ptr.ref_cnt() - 1);
+      if (ptr_.compare_exchange_weak(ptr, new_ptr)) {
+        if (new_ptr.ref_cnt() < BATCH_SIZE / 2) {
+          try_reserve(ptr.ptr());
+        }
+        return Ref<T>(ptr.ptr(), typename Ref<T>::acquire_t{});
+      }
+    }
+    return {};
+  }
+  void try_reserve(T* raw_ptr) const {
+    int reserve_cnt = BATCH_SIZE;
+    Ref<T>::acquire_shared(raw_ptr, reserve_cnt);
+    auto ptr = ptr_.load();
+    while (ptr.ptr() == raw_ptr && ptr.ref_cnt() < BATCH_SIZE / 2) {
+      auto new_ptr = Ptr(ptr.ptr(), ptr.ref_cnt() + reserve_cnt);
+      if (ptr_.compare_exchange_weak(ptr, new_ptr)) {
+        return;
+      }
+    }
+    Ref<T>::release_shared(raw_ptr, reserve_cnt);
+  }
+  Ref<T> extract() {
+    auto ptr = ptr_.exchange({});
+    if (ptr.ref_cnt() != 0) {
+      Ref<T>::release_shared(ptr.ptr(), ptr.ref_cnt());
+    }
+
+    return Ref<T>(ptr.ptr(), typename Ref<T>::acquire_t{});
+  }
+
+  Ref<T> load_unsafe() const {
+    return load();
+  }
+  T* get_unsafe() const {
+    return ptr_.load().ptr();
+  }
+  bool store_if_empty(Ref<T>& desired) {
+    auto raw_ptr = desired.get();
+    Ref<T>::acquire_shared(raw_ptr, BATCH_SIZE + 1);
+
+    Ptr new_ptr{const_cast<T*>(raw_ptr), BATCH_SIZE};
+    auto ptr = ptr_.load();
+    while (ptr.ptr() == nullptr) {
+      if (ptr_.compare_exchange_weak(ptr, new_ptr)) {
+        return true;
+      }
+    }
+    Ref<T>::release_shared(raw_ptr, BATCH_SIZE + 1);
+    return false;
+  }
+
+  void store(Ref<T>&& ref) {
+    Ptr new_ptr = [&]() -> Ptr {
+      if (ref.is_null()) {
+        return {};
+      }
+      auto raw_ptr = ref.release();
+      Ref<T>::acquire_shared(raw_ptr, BATCH_SIZE);
+      return {raw_ptr, BATCH_SIZE};
+    }();
+
+    auto ptr = ptr_.load();
+    while (!ptr_.compare_exchange_weak(ptr, new_ptr)) {
+    }
+
+    if (ptr.ptr()) {
+      Ref<T>::release_shared(ptr.ptr(), ptr.ref_cnt() + 1);
+    }
+  }
+
+ private:
+  struct Ptr {
+   public:
+    Ptr() = default;
+    Ptr(T* ptr, int ref_cnt) {
+      data_ = reinterpret_cast<td::uint64>(ptr);
+      CHECK((data_ >> 48) == 0);
+      data_ |= static_cast<td::uint64>(ref_cnt) << 48;
+    }
+    T* ptr() const {
+      return reinterpret_cast<T*>(data_ & (std::numeric_limits<uint64>::max() >> 16));
+    }
+    int ref_cnt() const {
+      return static_cast<int>(data_ >> 48);
+    }
+
+   private:
+    td::uint64 data_{0};
+  };
+  static_assert(sizeof(Ptr) == 8, "sizeof(Ptr) must be 8 for atomic to work fine");
+  static_assert(std::is_trivially_copyable<Ptr>::value, "Ptr must be tribially copyable");
+
+  mutable std::atomic<Ptr> ptr_{Ptr()};
+};
+
+template <class T>
+using AtomicRef = AtomicRefLockfree<T>;
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/common/bigexp.cpp b/submodules/ton/tonlib-src/crypto/common/bigexp.cpp
new file mode 100644
index 0000000000..cdc7c778df
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/common/bigexp.cpp
@@ -0,0 +1,261 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "bigexp.h"
+#include "td/utils/bits.h"
+#include "td/utils/as.h"
+#include "td/utils/misc.h"
+
+namespace td {
+
+bool NegExpBinTable::init() {
+  init_one();
+  int k;
+  for (k = minpw2; k <= 0; k++) {
+    exp_pw2_table.emplace_back(series_exp(-k));
+    exp_pw2_ref_table.emplace_back(true, exp_pw2_table.back());
+  }
+  for (; k < maxpw2; k++) {
+    td::BigIntG<257 * 2> tmp{0};
+    auto& x = exp_pw2_table.back();
+    tmp.add_mul(x, x).rshift(precision, 0).normalize();
+    exp_pw2_table.emplace_back(tmp);
+    exp_pw2_ref_table.emplace_back(true, exp_pw2_table.back());
+  }
+  return true;
+}
+
+bool NegExpBinTable::adjust_precision(int new_precision, int rmode) {
+  if (new_precision <= 0 || new_precision > precision) {
+    return false;
+  }
+  if (new_precision == precision) {
+    return true;
+  }
+  int s = precision - new_precision;
+  for (auto& x : exp_pw2_table) {
+    x.rshift(s, rmode).normalize();
+  }
+  for (auto& x : exp_pw2_ref_table) {
+    x.write().rshift(s, rmode).normalize();
+  }
+  precision = new_precision;
+  return init_one();
+}
+
+bool NegExpBinTable::init_one() {
+  One.set_pow2(precision);
+  return true;
+}
+
+bool NegExpBinTable::nexpf(td::BigInt256& res, long long x, int k) const {  // res := 2^precision * exp(-x * 2^k)
+  if (!x) {
+    res.set_pow2(precision);
+    return true;
+  }
+  if (x < 0) {
+    return false;
+  }
+  int s = td::count_trailing_zeroes64(x);
+  x >>= s;
+  k -= s;
+  if (k + minpw2 > 0) {
+    return false;
+  }
+  int t = 63 - td::count_leading_zeroes64(x);
+  if (t - k >= maxpw2) {
+    return false;
+  }
+  res.set_pow2(precision);
+  while (true) {
+    td::BigIntG<257 * 2> tmp{0};
+    tmp.add_mul(res, exp_pw2_table.at(t - k - minpw2)).rshift(precision, 0).normalize();
+    res = tmp;
+    x -= (1LL << t);
+    if (!x) {
+      return true;
+    }
+    t = 63 - td::count_leading_zeroes64(x);
+  }
+}
+
+td::RefInt256 NegExpBinTable::nexpf(long long x, int k) const {
+  td::RefInt256 res{true};
+  if (nexpf(res.unique_write(), x, k)) {
+    return res;
+  } else {
+    return {};
+  }
+}
+
+td::BigInt256 NegExpBinTable::series_exp(int k) const {  // returns 2^precision * exp(-2^(-k)), k >= 0
+  td::BigIntG<257 * 2> s{0}, q;
+  const int prec = 52 * 6;
+  q.set_pow2(prec);
+  int i = 0;
+  do {
+    s += q;
+    --i;
+    q.rshift(k).add_tiny(i / 2).divmod_short(i);
+    q.normalize();
+  } while (q.sgn());
+  s.rshift(prec - precision).normalize();
+  return s;
+}
+
+NegExpInt64Table::NegExpInt64Table() {
+  NegExpBinTable t{252, 8, -32};
+  CHECK(t.is_valid());
+  table0[0] = 0;
+  table0_shift[0] = 0;
+  for (int i = 1; i <= max_exp; i++) {
+    SuperFloat v(*t.nexpf(i, 0));  // compute exp(-i)
+    CHECK(!v.is_nan());
+    if (v.is_zero()) {
+      table0[i] = 0;
+      table0_shift[i] = 0;
+    } else {
+      CHECK(v.normalize());
+      int k = v.s + 64 - 252;
+      CHECK(k <= -64);
+      if (k > -128) {
+        table0[i] = v.top();
+        table0_shift[i] = td::narrow_cast<unsigned char>(-k - 1);
+      } else {
+        table0[i] = 0;
+        table0_shift[i] = 0;
+      }
+    }
+    // std::cerr << "table0[" << i << "] = exp(-" << i << ") : " << table0[i] << " / 2^" << table0_shift[i] + 1 << std::endl;
+  }
+  td::BigInt256 One;
+  One.set_pow2(252);
+  for (int i = 0; i < 256; i++) {
+    td::BigInt256 x;
+    CHECK(t.nexpf(x, i, 8));
+    (x.negate() += One).rshift(252 - 64, 0).normalize();
+    table1[i] = SuperFloat::as_uint64(x);
+    // std::cerr << "table1[" << i << "] = 1 - exp(-" << i << "/256) : " << table1[i] << " / 2^64" << std::endl;
+  }
+  for (int i = 0; i < 256; i++) {
+    td::BigInt256 x;
+    CHECK(t.nexpf(x, i, 16));
+    (x.negate() += One).rshift(252 - 64 - 8, 0).normalize();
+    table2[i] = SuperFloat::as_uint64(x);
+    // std::cerr << "table2[" << i << "] = 1 - exp(-" << i << "/2^16) : " << table2[i] << " / 2^72" << std::endl;
+  }
+}
+
+td::uint64 NegExpInt64Table::umulnexps32(td::uint64 x, unsigned k, bool trunc) const {  // compute x * exp(-k / 2^16)
+  if (!k || !x) {
+    return x;
+  }
+  unsigned k0 = (k >> 16);
+  if (k0 > max_exp) {
+    return 0;
+  }
+  unsigned s = td::count_leading_zeroes_non_zero64(x);
+  x <<= s;
+  unsigned k1 = (k >> 8) & 0xff;
+  unsigned k2 = k & 0xff;
+  if (k2) {
+    x -= ((td::uint128::from_unsigned(x).mult(table2[k2]).rounded_hi() + 0x80) >> 8);
+  }
+  if (k1) {
+    x -= td::uint128::from_unsigned(x).mult(table1[k1]).rounded_hi();
+  }
+  if (k0) {
+    if (trunc) {
+      return td::uint128::from_unsigned(x).mult(table0[k0]).shr(table0_shift[k0] + s + 1).lo();
+    } else {
+      return (td::uint128::from_unsigned(x).mult(table0[k0]).shr(table0_shift[k0] + s).lo() + 1) >> 1;
+    }
+  }
+  if (!s) {
+    return x;
+  } else if (trunc) {
+    return x >> s;
+  } else {
+    return ((x >> (s - 1)) + 1) >> 1;
+  }
+}
+
+td::int64 NegExpInt64Table::mulnexps32(td::int64 x, unsigned k, bool trunc) const {
+  return x >= 0 ? umulnexps32(x, k, trunc) : -umulnexps32(-x, k, trunc);
+}
+
+const NegExpInt64Table& NegExpInt64Table::table() {
+  static NegExpInt64Table tab;
+  return tab;
+}
+
+td::uint64 umulnexps32(td::uint64 x, unsigned k, bool trunc) {  // compute x * exp(-k / 2^16)
+  return NegExpInt64Table::table().umulnexps32(x, k, trunc);
+}
+
+td::int64 mulnexps32(td::int64 x, unsigned k, bool trunc) {
+  return NegExpInt64Table::table().mulnexps32(x, k, trunc);
+}
+
+td::uint128 SuperFloat::as_uint128(const td::BigInt256& x) {
+  td::uint64 t[2];
+  if (!x.export_bytes_lsb((unsigned char*)(void*)t, sizeof(t), false)) {
+    return {std::numeric_limits<uint64>::max(), 0};
+  } else {
+    return {t[1], t[0]};
+  }
+}
+
+td::uint64 SuperFloat::as_uint64(const td::BigInt256& x) {
+  td::uint64 t;
+  if (!x.export_bytes_lsb((unsigned char*)&t, sizeof(t), false)) {
+    return std::numeric_limits<uint64>::max();
+  } else {
+    return t;
+  }
+}
+
+SuperFloat::SuperFloat(td::BigInt256 x) {
+  if (x.unsigned_fits_bits(128)) {
+    m = as_uint128(x);
+    s = 0;
+  } else if (x.sgn() == 1) {
+    s = x.bit_size(false) - 128;
+    x.rshift(s, 0).normalize();
+    m = as_uint128(x);
+  } else {
+    set_nan();
+  }
+}
+
+bool SuperFloat::normalize() {
+  if (is_nan()) {
+    return false;
+  }
+  if (is_zero()) {
+    s = 0;
+    return true;
+  }
+  auto hi = m.hi();
+  int t = (hi ? td::count_leading_zeroes_non_zero64(hi) : 64 + td::count_leading_zeroes_non_zero64(m.lo()));
+  m.shl(t);
+  s -= t;
+  return true;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/common/bigexp.h b/submodules/ton/tonlib-src/crypto/common/bigexp.h
new file mode 100644
index 0000000000..d58c82243e
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/common/bigexp.h
@@ -0,0 +1,145 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "common/refint.h"
+
+namespace td {
+
+class NegExpBinTable {
+  int precision, maxpw2, minpw2;
+  std::vector<td::BigInt256> exp_pw2_table;      // table of 2^precision * exp(- 2^k) for k = max_pw2-1 .. min_pw2
+  std::vector<td::RefInt256> exp_pw2_ref_table;  // same data
+  td::BigInt256 One;
+
+ public:
+  NegExpBinTable(int _precision, int _maxpw2, int _minpw2) : precision(255), maxpw2(_maxpw2), minpw2(_minpw2) {
+    (_precision > 0 && _precision < 256 && _minpw2 <= 0 && _maxpw2 > 0 && _maxpw2 <= 256 && _minpw2 >= -256 && init() &&
+     adjust_precision(_precision)) ||
+        invalidate();
+  }
+  bool is_valid() const {
+    return minpw2 < maxpw2;
+  }
+  int get_precision() const {
+    return precision;
+  }
+  int get_exponent_precision() const {
+    return -minpw2;
+  }
+  int get_exponent_max_log2() const {
+    return maxpw2;
+  }
+  const td::BigInt256* exp_pw2(int k) const {  // returns 2^precision * exp(-2^k) or null
+    return (k >= minpw2 && k < maxpw2) ? &exp_pw2_table[k - minpw2] : nullptr;
+  }
+  td::RefInt256 exp_pw2_ref(int k) const {
+    if (k >= minpw2 && k < maxpw2) {
+      return exp_pw2_ref_table[k - minpw2];
+    } else {
+      return {};
+    }
+  }
+  bool nexpf(td::BigInt256& res, long long x, int k) const;  // res := 2^precision * exp(-x * 2^k)
+  td::RefInt256 nexpf(long long x, int k) const;
+
+ private:
+  bool init();
+  bool init_one();
+  bool adjust_precision(int new_precision, int rmode = 0);
+  bool invalidate() {
+    minpw2 = maxpw2 = 0;
+    return false;
+  }
+  td::BigInt256 series_exp(int k) const;  // returns 2^precision * exp(-2^(-k)), k >= 0
+};
+
+struct SuperFloat {
+  struct SetZero {};
+  struct SetOne {};
+  struct SetNan {};
+  td::uint128 m;
+  int s;
+  SuperFloat() = default;
+  SuperFloat(SetZero) : m(0, 0), s(0) {
+  }
+  SuperFloat(SetOne) : m(0, 1), s(0) {
+  }
+  SuperFloat(SetNan) : m(0, 0), s(std::numeric_limits<int>::min()) {
+  }
+  SuperFloat(td::uint128 _m, int _s = 0) : m(_m), s(_s) {
+  }
+  SuperFloat(td::uint64 _m, int _s = 0) : m(0, _m), s(_s) {
+  }
+  explicit SuperFloat(BigInt256 x);
+  static SuperFloat Zero() {
+    return SetZero{};
+  }
+  static SuperFloat One() {
+    return SetOne{};
+  }
+  static SuperFloat NaN() {
+    return SetNan{};
+  }
+  void set_zero() {
+    m = td::uint128(0, 0);
+    s = 0;
+  }
+  void set_one() {
+    m = td::uint128(0, 1);
+    s = 0;
+  }
+  void set_nan() {
+    s = std::numeric_limits<int>::min();
+  }
+  bool is_nan() const {
+    return s == std::numeric_limits<int>::min();
+  }
+  bool is_zero() const {
+    return m.is_zero();
+  }
+  bool normalize();
+  td::uint64 top() const {
+    return m.rounded_hi();
+  }
+  static td::uint128 as_uint128(const td::BigInt256& x);
+  static td::uint64 as_uint64(const td::BigInt256& x);
+};
+
+class NegExpInt64Table {
+  enum { max_exp = 45 };
+  unsigned char table0_shift[max_exp + 1];
+  td::uint64 table0[max_exp + 1], table1[256], table2[256];
+
+ public:
+  NegExpInt64Table();
+  // compute x * exp(-k / 2^16);
+  // more precisely: computes 0 <= y <= x for 0 <= x < 2^60, s.that |y - x * exp(-k / 2^16)| < 1
+  // two different implementations of this functions would return values differing by at most one
+  td::uint64 umulnexps32(td::uint64 x, unsigned k, bool trunc = false) const;
+  td::int64 mulnexps32(td::int64 x, unsigned k, bool trunc = false) const;
+  static const NegExpInt64Table& table();
+
+ private:
+};
+
+td::uint64 umulnexps32(td::uint64 x, unsigned k, bool trunc = false);  // compute x * exp(-k / 2^16)
+td::int64 mulnexps32(td::int64 x, unsigned k, bool trunc = false);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/common/bigint.cpp b/submodules/ton/tonlib-src/crypto/common/bigint.cpp
new file mode 100644
index 0000000000..3229e68153
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/common/bigint.cpp
@@ -0,0 +1,41 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "common/bigint.hpp"
+
+namespace td {
+
+template class AnyIntView<BigIntInfo>;
+template class BigIntG<257, BigIntInfo>;
+
+namespace literals {
+BigInt256 operator""_i256(const char* str, std::size_t str_len) {
+  BigInt256 x;
+  x.enforce(x.parse_dec(str, (int)str_len) == (int)str_len);
+  return x;
+}
+
+BigInt256 operator""_x256(const char* str, std::size_t str_len) {
+  BigInt256 x;
+  x.enforce(x.parse_hex(str, (int)str_len) == (int)str_len);
+  return x;
+}
+
+}  // namespace literals
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/common/bigint.hpp b/submodules/ton/tonlib-src/crypto/common/bigint.hpp
new file mode 100644
index 0000000000..63bfe464c9
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/common/bigint.hpp
@@ -0,0 +1,2525 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <vector>
+#include <string>
+#include <algorithm>
+#include <cmath>
+#include <cstring>
+#include <ostream>
+#include <sstream>
+#include <cassert>
+#include "common/bitstring.h"
+
+#include "td/utils/bits.h"
+#include "td/utils/Span.h"
+#include "td/utils/uint128.h"
+
+/**************************************
+ *
+ *     BIGINT256
+ *
+ **************************************
+**/
+
+namespace td {
+
+struct BigIntInfo {
+  typedef long long word_t;
+  typedef unsigned long long uword_t;
+  enum { word_bits = 64, word_shift = 52, words_for_256bit = 1 + 256 / word_shift, max_pow10_exp = 18 };
+  static const word_t Base = (1LL << word_shift);
+  static const word_t Half = (1LL << (word_shift - 1));
+  static const word_t MaxDenorm = (1LL << (word_bits - word_shift - 1));
+  static const word_t max_pow10 = 1000000000000000000LL;
+  static constexpr double InvBase = 1.0 / (double)Base;
+
+  static void set_mul(word_t* hi, word_t* lo, word_t x, word_t y);
+  static void add_mul(word_t* hi, word_t* lo, word_t x, word_t y);
+  static void sub_mul(word_t* hi, word_t* lo, word_t x, word_t y);
+  static void dbl_divmod(word_t* quot, word_t* rem, word_t hi, word_t lo, word_t y);
+};
+
+inline void BigIntInfo::set_mul(word_t* hi, word_t* lo, word_t x, word_t y) {
+  auto z = uint128::from_signed(x).mult_signed(y);
+  *lo = static_cast<word_t>(z.lo()) & (Base - 1);
+  *hi = static_cast<word_t>(z.shr(word_shift).lo());
+}
+
+inline void BigIntInfo::add_mul(word_t* hi, word_t* lo, word_t x, word_t y) {
+  auto z = uint128::from_signed(x).mult_signed(y);
+  *lo += static_cast<word_t>(z.lo()) & (Base - 1);
+  *hi += static_cast<word_t>(z.shr(word_shift).lo());
+}
+
+inline void BigIntInfo::sub_mul(word_t* hi, word_t* lo, word_t x, word_t y) {
+  auto z = uint128::from_signed(x).mult_signed(y);
+  *lo -= static_cast<word_t>(z.lo()) & (Base - 1);
+  *hi -= static_cast<word_t>(z.shr(word_shift).lo());
+}
+
+inline void BigIntInfo::dbl_divmod(word_t* quot, word_t* rem, word_t hi, word_t lo, word_t y) {
+  auto x = uint128::from_signed(hi).shl(word_shift).add(uint128::from_signed(lo));
+  int64 a, b;
+  x.divmod_signed(y, &a, &b);
+  *quot = a;
+  *rem = b;
+}
+
+namespace {
+
+template <typename T>
+struct LogOpAnd {
+  static T op(T x, T y) {
+    return x & y;
+  }
+  static const T neutral = -1;
+  static const T zero = 0;
+  static const bool has_zero = true;
+};
+
+template <typename T>
+struct LogOpOr {
+  static T op(T x, T y) {
+    return x | y;
+  }
+  static const T neutral = 0;
+  static const T zero = -1;
+  static const bool has_zero = true;
+};
+
+template <typename T>
+struct LogOpXor {
+  static T op(T x, T y) {
+    return x ^ y;
+  }
+  static const T neutral = 0;
+  static const T zero = -1;
+  static const bool has_zero = false;
+};
+
+template <typename T>
+struct TransformId {
+  static T eval(T x) {
+    return x;
+  }
+};
+
+template <typename T>
+struct TransformNegate {
+  static T eval(T x) {
+    return -x;
+  }
+};
+
+template <typename T, int factor>
+struct TransformMul {
+  static T eval(T x) {
+    return x * factor;
+  }
+};
+
+}  // namespace
+
+struct IntOverflow {};
+
+template <class T>
+class PropagateConstSpan {
+ public:
+  PropagateConstSpan() = default;
+  PropagateConstSpan(T* ptr, size_t size) : ptr_(ptr), size_(size) {
+  }
+
+  T& operator[](size_t i) {
+    DCHECK(i < size_);
+    return ptr_[i];
+  }
+  const T& operator[](size_t i) const {
+    DCHECK(i < size_);
+    return ptr_[i];
+  }
+  T* data() {
+    return ptr_;
+  }
+  const T* data() const {
+    return ptr_;
+  }
+  size_t size() const {
+    return size_;
+  }
+
+ private:
+  T* ptr_{nullptr};
+  size_t size_{0};
+};
+
+template <class Tr = BigIntInfo>
+class AnyIntView {
+ public:
+  enum { word_bits = Tr::word_bits, word_shift = Tr::word_shift };
+  typedef typename Tr::word_t word_t;
+  int& n_;
+  PropagateConstSpan<word_t> digits;
+
+  int max_size() const {
+    return static_cast<int>(digits.size());
+  }
+  int size() const {
+    return n_;
+  }
+  void set_size(int new_size) {
+    n_ = new_size;
+  }
+  int inc_size() {
+    return n_++;
+  }
+  void dec_size() {
+    n_--;
+  }
+
+  bool is_valid() const {
+    return size() > 0;
+  }
+  void enforce_valid() const {
+    enforce(is_valid());
+  }
+  void invalidate() {
+    set_size(0);
+  }
+  bool invalidate_bool() {
+    set_size(0);
+    return false;
+  }
+  void enforce(bool f) const {
+    if (!f) {
+      throw IntOverflow();
+    }
+  }
+  void operator=(word_t y) {
+    set_size(1);
+    digits[0] = y;
+  }
+
+  bool normalize_bool_any();
+  bool set_pow2_any(int exponent);
+  bool set_any(const AnyIntView& yp);
+  bool add_pow2_any(int exponent, int factor);
+  bool add_any(const AnyIntView& yp);
+  bool sub_any(const AnyIntView& yp);
+
+  template <class LogOp>
+  bool log_op_any(const AnyIntView& yp);
+
+  int cmp_any(const AnyIntView& yp) const;
+  int cmp_any(word_t y) const;
+
+  template <class T = TransformId<word_t>>
+  int cmp_un_any(const AnyIntView& yp) const;
+
+  void negate_any();
+
+  int sgn_un_any() const;
+  bool get_bit_any(unsigned bit) const;
+  bool eq_any(const AnyIntView& yp) const;
+  bool eq_any(word_t y) const;
+  void mul_tiny_any(int y);
+  int divmod_tiny_any(int y);
+  word_t divmod_short_any(word_t y);
+  bool mul_add_short_any(word_t y, word_t z);
+  bool add_mul_any(const AnyIntView& yp, const AnyIntView& zp);
+  void add_mul_trunc_any(const AnyIntView& yp, const AnyIntView& zp);
+  bool mod_div_any(const AnyIntView& yp, AnyIntView& quot, int round_mode);
+  bool mod_pow2_any(int exponent);
+  bool mod_pow2_any(int exponent, int round_mode);
+  bool rshift_any(int exponent, int round_mode = -1);
+  bool lshift_any(int exponent);
+  bool unsigned_fits_bits_any(int nbits) const;
+  bool signed_fits_bits_any(int nbits) const;
+  int bit_size_any(bool sgnd = true) const;
+  bool export_bytes_any(unsigned char* buff, std::size_t size, bool sgnd = true) const;
+  bool export_bytes_lsb_any(unsigned char* buff, std::size_t size, bool sgnd = true) const;
+  bool import_bytes_any(const unsigned char* buff, std::size_t size, bool sgnd = true);
+  bool import_bytes_lsb_any(const unsigned char* buff, std::size_t size, bool sgnd = true);
+  bool export_bits_any(unsigned char* buff, int offs, unsigned bits, bool sgnd = true) const;
+  bool import_bits_any(const unsigned char* buff, int offs, unsigned bits, bool sgnd = true);
+  word_t top_word() const {
+    return digits[size() - 1];
+  }
+  double top_double() const {
+    return size() > 1 ? (double)digits[size() - 1] + (double)digits[size() - 2] * (1.0 / Tr::Base)
+                      : (double)digits[size() - 1];
+  }
+  word_t to_long_any() const;
+  int parse_hex_any(const char* str, int str_len, int* frac = nullptr);
+  int parse_binary_any(const char* str, int str_len, int* frac = nullptr);
+  std::string to_dec_string_destroy_any();
+  std::string to_dec_string_slow_destroy_any();
+  std::string to_hex_string_any(bool upcase = false) const;
+  std::string to_hex_string_slow_destroy_any();
+  std::string to_binary_string_any() const;
+
+  int sgn() const {
+    return is_valid() ? (top_word() > 0 ? 1 : (top_word() < 0 ? -1 : 0)) : 0x80000000;
+  }
+};
+
+template <int len, class Tr = BigIntInfo>
+class BigIntG {
+ public:
+  enum { word_bits = Tr::word_bits, word_shift = Tr::word_shift, max_bits = len, word_cnt = len / word_shift + 1 };
+  typedef typename Tr::word_t word_t;
+  typedef Tr Traits;
+  typedef BigIntG<len * 2, Tr> DoubleInt;
+
+  AnyIntView<Tr> as_any_int() {
+    return AnyIntView<Tr>{n, PropagateConstSpan<word_t>(digits, word_cnt)};
+  }
+
+  const AnyIntView<Tr> as_any_int() const {
+    return AnyIntView<Tr>{const_cast<int&>(n), PropagateConstSpan<word_t>(const_cast<word_t*>(digits), word_cnt)};
+  }
+
+ private:
+  template <int bits2, class Tr2>
+  friend class BigIntG;
+
+  int n;
+  word_t digits[word_cnt];
+
+ public:
+  BigIntG() : n(0) {
+  }
+  explicit BigIntG(word_t x) : n(1) {
+    digits[0] = x;
+  }
+  BigIntG(const BigIntG& x) : n(x.n) {
+    std::memcpy(digits, x.digits, n * sizeof(word_t));
+    ///std::cout << "(BiCC " << (const void*)&x << "->" << (void*)this << ")";
+  }
+  template <int len2>
+  BigIntG(const BigIntG<len2, Tr>& y) : n(0) {
+    *this = y;
+  }
+  void enforce(bool f) const {
+    if (!f) {
+      throw IntOverflow();
+    }
+  }
+  void ignore(bool f) const {
+  }
+  bool is_valid() const {
+    return n > 0;
+  }
+  void enforce_valid() const {
+    enforce(is_valid());
+  }
+  BigIntG& invalidate() {
+    n = 0;
+    return *this;
+  }
+  bool invalidate_bool() {
+    n = 0;
+    return false;
+  }
+  BigIntG& invalidate_unless(bool f) {
+    if (!f) {
+      n = 0;
+    }
+    return *this;
+  }
+  bool normalize_bool() {
+    return as_any_int().normalize_bool_any();
+  }
+  BigIntG& normalize() {
+    ignore(normalize_bool());
+    return *this;
+  }
+  BigIntG& denormalize();
+  int sgn() const {
+    return is_valid() ? (top_word() > 0 ? 1 : (top_word() < 0 ? -1 : 0)) : 0x80000000;
+  }
+  int sgn_un() const {
+    return as_any_int().sgn_un_any();
+  }
+  bool get_bit(unsigned bit) const {
+    return as_any_int().get_bit_any(bit);
+  }
+  BigIntG& negate() {
+    as_any_int().negate_any();
+    return *this;
+  }
+  BigIntG& logical_not();
+
+  BigIntG& operator=(const BigIntG& y) {
+    n = y.n;
+    std::memcpy(digits, y.digits, n * sizeof(word_t));
+    ///std::cout << "(BiC=)";
+    return *this;
+  }
+
+  template <int len2>
+  BigIntG& operator=(const BigIntG<len2, Tr>& y) {
+    return invalidate_unless(as_any_int().set_any(y.as_any_int()));
+  }
+
+  template <int len2>
+  BigIntG& operator+=(const BigIntG<len2, Tr>& y) {
+    ignore(as_any_int().add_any(y.as_any_int()));
+    return *this;
+  }
+
+  template <int len2>
+  BigIntG& operator-=(const BigIntG<len2, Tr>& y) {
+    ignore(as_any_int().sub_any(y.as_any_int()));
+    return *this;
+  }
+
+  template <int len2>
+  BigIntG& operator&=(const BigIntG<len2, Tr>& y) {
+    ignore(as_any_int().template log_op_any<LogOpAnd<word_t>>(y.as_any_int()));
+    return *this;
+  }
+
+  template <int len2>
+  BigIntG& operator|=(const BigIntG<len2, Tr>& y) {
+    ignore(as_any_int().template log_op_any<LogOpOr<word_t>>(y.as_any_int()));
+    return *this;
+  }
+
+  template <int len2>
+  BigIntG& operator^=(const BigIntG<len2, Tr>& y) {
+    ignore(as_any_int().template log_op_any<LogOpXor<word_t>>(y.as_any_int()));
+    return *this;
+  }
+
+  BigIntG& operator>>=(int shift) {
+    as_any_int().rshift_any(shift);
+    return *this;
+  }
+
+  BigIntG& operator<<=(int shift) {
+    as_any_int().lshift_any(shift);
+    return *this;
+  }
+
+  BigIntG& rshift(int shift, int round_mode = -1) {
+    as_any_int().rshift_any(shift, round_mode);
+    return *this;
+  }
+
+  template <int len2>
+  int cmp(const BigIntG<len2, Tr>& y) const {
+    return as_any_int().cmp_any(y.as_any_int());
+  }
+
+  template <int len2>
+  int cmp_un(const BigIntG<len2, Tr>& y) const {
+    return as_any_int().template cmp_un_any<TransformId<word_t>>(y.as_any_int());
+  }
+
+  template <int len2>
+  bool operator==(const BigIntG<len2, Tr>& y) const {
+    return as_any_int().eq_any(y.as_any_int());
+  }
+
+  template <int len2>
+  bool operator!=(const BigIntG<len2, Tr>& y) const {
+    return !(*this == y);
+  }
+
+  int cmp(word_t y) const {
+    return as_any_int().cmp_any(y);
+  }
+
+  bool operator==(word_t y) const {
+    return as_any_int().eq_any(y);
+  }
+
+  bool operator!=(word_t y) const {
+    return !(*this == y);
+  }
+  bool mul_add_short_bool(word_t y, word_t z) {
+    return as_any_int().mul_add_short_any(y, z);
+  }
+
+  template <int len2, int len3>
+  bool add_mul_bool(const BigIntG<len2, Tr>& y, const BigIntG<len3, Tr>& z) {
+    return as_any_int().add_mul_any(y.as_any_int(), z.as_any_int());
+  }
+
+  template <int len2, int len3>
+  BigIntG& add_mul(const BigIntG<len2, Tr>& y, const BigIntG<len3, Tr>& z) {
+    ignore(add_mul_bool(y, z));
+    return *this;
+  }
+
+  template <int len2, int len3>
+  void add_mul_trunc(const BigIntG<len2, Tr>& y, const BigIntG<len3, Tr>& z) {
+    as_any_int().add_mul_trunc_any(y.as_any_int(), z.as_any_int());
+  }
+
+  BigIntG& mul_short(word_t y) {
+    return invalidate_unless(mul_add_short_bool(y, 0));
+  }
+
+  BigIntG& mul_tiny(int y) {
+    as_any_int().mul_tiny_any(y);
+    return *this;
+  }
+
+  BigIntG& add_tiny(word_t y) {
+    digits[0] += y;
+    return *this;
+  }
+
+  BigIntG& sub_tiny(word_t y) {
+    digits[0] -= y;
+    return *this;
+  }
+
+  BigIntG& mul_short_opt(word_t y) {
+    if (y <= Tr::MaxDenorm && y >= -Tr::MaxDenorm) {
+      return mul_tiny(static_cast<int>(y));
+    } else {
+      return mul_short(y);
+    }
+  }
+
+  template <int len2, int len3>
+  bool mod_div_bool(const BigIntG<len2, Tr>& y, BigIntG<len3, Tr>& quot, int round_mode = -1) {
+    auto q = quot.as_any_int();
+    return as_any_int().mod_div_any(y.as_any_int(), q, round_mode);
+  }
+
+  template <int len2, int len3>
+  BigIntG& mod_div(const BigIntG<len2, Tr>& y, BigIntG<len3, Tr>& quot, int round_mode = -1) {
+    return invalidate_unless(mod_div_bool(y, quot, round_mode));
+  }
+
+  int divmod_tiny(int y) {
+    return as_any_int().divmod_tiny_any(y);
+  }
+
+  word_t divmod_short(word_t y) {
+    return as_any_int().divmod_short_any(y);
+  }
+
+  BigIntG& operator=(word_t y) {
+    n = 1;
+    digits[0] = y;
+    return *this;
+  }
+
+  BigIntG& set_zero() {
+    n = 1;
+    digits[0] = 0;
+    return *this;
+  }
+
+  BigIntG& set_pow2(int exponent) {
+    return invalidate_unless(as_any_int().set_pow2_any(exponent));
+  }
+
+  bool set_pow2_bool(int exponent) {
+    return as_any_int().set_pow2_any(exponent);
+  }
+
+  BigIntG& mod_pow2(int exponent) {
+    return invalidate_unless(as_any_int().mod_pow2_any(exponent));
+  }
+
+  BigIntG& mod_pow2(int exponent, int round_mode) {
+    return invalidate_unless(as_any_int().mod_pow2_any(exponent, round_mode));
+  }
+
+  BigIntG& add_pow2(int exponent) {
+    return invalidate_unless(as_any_int().add_pow2_any(exponent, 1));
+  }
+
+  BigIntG& sub_pow2(int exponent) {
+    return invalidate_unless(as_any_int().add_pow2_any(exponent, -1));
+  }
+
+  bool unsigned_fits_bits(int nbits) const {
+    return as_any_int().unsigned_fits_bits_any(nbits);
+  }
+
+  bool signed_fits_bits(int nbits) const {
+    return as_any_int().signed_fits_bits_any(nbits);
+  }
+
+  bool fits_bits(int nbits, bool sgnd = true) const {
+    return sgnd ? signed_fits_bits(nbits) : unsigned_fits_bits(nbits);
+  }
+
+  int bit_size(bool sgnd = true) const {
+    return as_any_int().bit_size_any(sgnd);
+  }
+
+  bool export_bytes(unsigned char* buff, std::size_t size, bool sgnd = true) const {
+    return as_any_int().export_bytes_any(buff, size, sgnd);
+  }
+
+  bool export_bytes_lsb(unsigned char* buff, std::size_t size, bool sgnd = true) const {
+    return as_any_int().export_bytes_lsb_any(buff, size, sgnd);
+  }
+
+  bool import_bytes(const unsigned char* buff, std::size_t size, bool sgnd = true) {
+    return as_any_int().import_bytes_any(buff, size, sgnd);
+  }
+
+  bool import_bytes_lsb(const unsigned char* buff, std::size_t size, bool sgnd = true) {
+    return as_any_int().import_bytes_lsb_any(buff, size, sgnd);
+  }
+
+  bool export_bits(unsigned char* buff, int offs, unsigned bits, bool sgnd = true) const {
+    return as_any_int().export_bits_any(buff, offs, bits, sgnd);
+  }
+
+  bool export_bits(td::BitPtr bp, unsigned bits, bool sgnd = true) const {
+    return as_any_int().export_bits_any(bp.ptr, bp.offs, bits, sgnd);
+  }
+
+  template <typename T>
+  bool export_bits(T& bs, bool sgnd = true) const {
+    return export_bits(bs.bits(), bs.size(), sgnd);
+  }
+
+  bool export_bits(const BitSliceWrite& bs, bool sgnd = true) const {
+    return export_bits(bs.bits(), bs.size(), sgnd);
+  }
+
+  bool import_bits(const unsigned char* buff, int offs, unsigned bits, bool sgnd = true) {
+    return as_any_int().import_bits_any(buff, offs, bits, sgnd);
+  }
+
+  bool import_bits(td::ConstBitPtr bp, unsigned bits, bool sgnd = true) {
+    return as_any_int().import_bits_any(bp.ptr, bp.offs, bits, sgnd);
+  }
+
+  template <typename T>
+  bool import_bits(const T& bs, bool sgnd = true) {
+    return import_bits(bs.bits(), bs.size(), sgnd);
+  }
+
+  std::ostream& dump(std::ostream& os, bool nl = true) const;
+  std::string dump() const;
+  int parse_dec(const char* str, int str_len, int* frac = nullptr);
+  int parse_dec(const std::string str, int* frac = nullptr) {
+    return parse_dec(str.c_str(), (int)str.size(), frac);
+  }
+  int parse_dec_slow(const char* str, int str_len);
+  int parse_dec_slow(const std::string str) {
+    return parse_dec_slow(str.c_str(), (int)str.size());
+  }
+  int parse_hex(const char* str, int str_len, int* frac = nullptr) {
+    return as_any_int().parse_hex_any(str, str_len, frac);
+  }
+  int parse_hex(const std::string str, int* frac = nullptr) {
+    return parse_hex(str.c_str(), (int)str.size(), frac);
+  }
+  int parse_binary(const char* str, int str_len, int* frac = nullptr) {
+    return as_any_int().parse_binary_any(str, str_len, frac);
+  }
+  int parse_binary(const std::string str, int* frac = nullptr) {
+    return parse_binary(str.c_str(), (int)str.size(), frac);
+  }
+  std::string to_dec_string() const;
+  std::string to_dec_string_destroy();
+  std::string to_dec_string_slow() const;
+  std::string to_hex_string_slow() const;
+  std::string to_hex_string(bool upcase = false) const;
+  std::string to_binary_string() const;
+  double to_double() const {
+    return is_valid() ? ldexp(top_double(), (n - 1) * word_shift) : NAN;
+  }
+  word_t to_long() const {
+    return as_any_int().to_long_any();
+  }
+
+ private:
+  word_t top_word() const {
+    return digits[n - 1];
+  }
+  double top_double() const {
+    return n > 1 ? (double)digits[n - 1] + (double)digits[n - 2] * (1.0 / Tr::Base) : (double)digits[n - 1];
+  }
+};
+
+template <class Tr>
+bool AnyIntView<Tr>::normalize_bool_any() {
+  word_t val = 0;
+  int i;
+  if (!is_valid()) {
+    return false;
+  }
+  for (i = 0; i < size() && digits[i] < Tr::Half && digits[i] >= -Tr::Half; i++) {
+  }
+  for (; i < size(); i++) {
+    val += digits[i] + Tr::Half;
+    digits[i] = (val & (Tr::Base - 1)) - Tr::Half;
+    val >>= word_shift;
+  }
+  if (val) {
+    do {
+      if (size() == max_size()) {
+        return invalidate_bool();
+      }
+      val += Tr::Half;
+      digits[inc_size()] = (val & (Tr::Base - 1)) - Tr::Half;
+      val >>= word_shift;
+    } while (val);
+  }
+  while (size() > 1 && !digits[size() - 1]) {
+    dec_size();
+  }
+  return true;
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::set_pow2_any(int exponent) {
+  if (exponent < 0 || exponent >= max_size() * word_shift) {
+    invalidate();
+    return false;
+  }
+  auto dm = std::div(exponent, word_shift);
+  int k = dm.quot;
+  std::memset(digits.data(), 0, k * sizeof(word_t));
+  if (dm.rem == word_shift - 1 && k + 1 < max_size()) {
+    digits[k] = -Tr::Half;
+    digits[k + 1] = 1;
+    set_size(k + 2);
+    return true;
+  }
+  digits[k] = ((word_t)1 << dm.rem);
+  set_size(k + 1);
+  return true;
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::set_any(const AnyIntView<Tr>& yp) {
+  if (yp.size() <= max_size()) {
+    set_size(yp.size());
+    std::memcpy(digits.data(), yp.digits.data(), size() * sizeof(word_t));
+    return true;
+  } else {
+    set_size(max_size());
+    std::memcpy(digits.data(), yp.digits.data(), size() * sizeof(word_t));
+    return false;
+  }
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::add_pow2_any(int exponent, int factor) {
+  if (exponent < 0 || exponent >= max_size() * word_shift) {
+    invalidate();
+    return false;
+  }
+  if (!is_valid()) {
+    return false;
+  }
+  auto dm = std::div(exponent, word_shift);
+  int k = dm.quot;
+  while (size() <= k) {
+    digits[inc_size()] = 0;
+  }
+  digits[k] += (factor << dm.rem);
+  return true;
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::add_any(const AnyIntView<Tr>& yp) {
+  if (yp.size() <= size()) {
+    if (!yp.is_valid()) {
+      return invalidate_bool();
+    }
+    for (int i = 0; i < yp.size(); i++) {
+      digits[i] += yp.digits[i];
+    }
+    return true;
+  } else {
+    if (!is_valid()) {
+      return false;
+    }
+    if (yp.size() > max_size()) {
+      return invalidate_bool();
+    }
+    for (int i = 0; i < size(); i++) {
+      digits[i] += yp.digits[i];
+    }
+    for (int i = size(); i < yp.size(); i++) {
+      digits[i] = yp.digits[i];
+    }
+    set_size(yp.size());
+    return true;
+  }
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::sub_any(const AnyIntView<Tr>& yp) {
+  if (yp.size() <= size()) {
+    if (!yp.is_valid()) {
+      return invalidate_bool();
+    }
+    for (int i = 0; i < yp.size(); i++) {
+      digits[i] -= yp.digits[i];
+    }
+    return true;
+  } else {
+    if (!is_valid()) {
+      return false;
+    }
+    if (yp.size() > max_size()) {
+      return invalidate_bool();
+    }
+    for (int i = 0; i < size(); i++) {
+      digits[i] -= yp.digits[i];
+    }
+    for (int i = size(); i < yp.size(); i++) {
+      digits[i] = -yp.digits[i];
+    }
+    set_size(yp.size());
+    return true;
+  }
+}
+
+template <class Tr>
+template <class LogOp>
+bool AnyIntView<Tr>::log_op_any(const AnyIntView<Tr>& yp) {
+  word_t cx = 0, cy = 0, cz = 0;
+  int i = 0;
+  const int shift = Tr::word_shift;
+  if (size() == 1) {
+    if (LogOp::has_zero && digits[0] == LogOp::zero) {
+      return true;
+    } else if (digits[0] == LogOp::neutral) {
+      if (yp.size() <= max_size()) {
+        set_size(yp.size());
+        std::memcpy(digits.data(), yp.digits.data(), size() * sizeof(word_t));
+        return true;
+      } else {
+        return invalidate_bool();
+      }
+    }
+  }
+  if (yp.size() == 1) {
+    if (LogOp::has_zero && yp.digits[0] == LogOp::zero) {
+      set_size(1);
+      digits[0] = LogOp::zero;
+      return true;
+    } else if (yp.digits[0] == LogOp::neutral) {
+      return true;
+    }
+  }
+  if (yp.size() <= size()) {
+    if (!yp.is_valid()) {
+      return invalidate_bool();
+    }
+    for (; i < yp.size(); i++) {
+      cx += digits[i];
+      cy += yp.digits[i];
+      cz += (LogOp::op(cx, cy) & (Tr::Base - 1)) + Tr::Half;
+      cx >>= shift;
+      cy >>= shift;
+      digits[i] = (cz & (Tr::Base - 1)) - Tr::Half;
+      cz >>= shift;
+    }
+    for (; i < size(); i++) {
+      cx += digits[i];
+      cz += (LogOp::op(cx, cy) & (Tr::Base - 1)) + Tr::Half;
+      cx >>= shift;
+      cy >>= shift;
+      digits[i] = (cz & (Tr::Base - 1)) - Tr::Half;
+      cz >>= shift;
+    }
+    cz += LogOp::op(cx, cy);
+    if (cz) {
+      if (size() >= max_size()) {
+        return invalidate_bool();
+      }
+      digits[inc_size()] = cz;
+    } else {
+      while (size() > 1 && !digits[size() - 1]) {
+        dec_size();
+      }
+    }
+    return true;
+  } else {
+    if (!is_valid()) {
+      return false;
+    }
+    for (; i < size(); i++) {
+      cx += digits[i];
+      cy += yp.digits[i];
+      cz += (LogOp::op(cx, cy) & (Tr::Base - 1)) + Tr::Half;
+      cx >>= shift;
+      cy >>= shift;
+      digits[i] = (cz & (Tr::Base - 1)) - Tr::Half;
+      cz >>= shift;
+    }
+    set_size(std::min(yp.size(), max_size()));
+    for (; i < size(); i++) {
+      cy += yp.digits[i];
+      cz += (LogOp::op(cx, cy) & (Tr::Base - 1)) + Tr::Half;
+      cx >>= shift;
+      cy >>= shift;
+      digits[i] = (cz & (Tr::Base - 1)) - Tr::Half;
+      cz >>= shift;
+    }
+    if (yp.size() > size()) {
+      for (; i < yp.size(); i++) {
+        cy += yp.digits[i];
+        cz += (LogOp::op(cx, cy) & (Tr::Base - 1));
+        cx >>= shift;
+        cy >>= shift;
+        if ((cz & (Tr::Base - 1)) != 0) {
+          return invalidate_bool();
+        }
+        cz >>= shift;
+      }
+    }
+    cz += LogOp::op(cx, cy);
+    if (cz) {
+      return invalidate_bool();
+    }
+    while (size() > 1 && !digits[size() - 1]) {
+      dec_size();
+    }
+    return true;
+  }
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::add_mul_any(const AnyIntView<Tr>& yp, const AnyIntView<Tr>& zp) {
+  int yn = yp.size(), zn = zp.size(), rn = yn + zn;
+  if (!yp.is_valid() || !zp.is_valid() || !is_valid()) {
+    return invalidate_bool();
+  }
+  if (rn > max_size() + 1) {
+    return invalidate_bool();
+  } else if (rn < max_size() + 1) {
+    while (size() < rn) {
+      digits[inc_size()] = 0;
+    }
+    for (int i = 0; i < yn; i++) {
+      word_t yv = yp.digits[i];
+      for (int j = 0; j < zn; j++) {
+        Tr::add_mul(&digits[i + j + 1], &digits[i + j], yv, zp.digits[j]);
+      }
+    }
+  } else {
+    while (size() < rn - 1) {
+      digits[inc_size()] = 0;
+    }
+    int i;
+    for (i = 0; i < yn - 1; i++) {
+      word_t yv = yp.digits[i];
+      for (int j = 0; j < zn; j++) {
+        Tr::add_mul(&digits[i + j + 1], &digits[i + j], yv, zp.digits[j]);
+      }
+    }
+    word_t yv = yp.digits[i];
+    int j;
+    for (j = 0; j < zn - 1; j++) {
+      Tr::add_mul(&digits[i + j + 1], &digits[i + j], yv, zp.digits[j]);
+    }
+    word_t hi = 0;
+    Tr::add_mul(&hi, &digits[i + j], yv, zp.digits[j]);
+    if (hi && hi != -1) {
+      return invalidate_bool();
+    }
+    digits[size() - 1] += (hi << word_shift);
+  }
+  return true;
+}
+
+template <class Tr>
+void AnyIntView<Tr>::add_mul_trunc_any(const AnyIntView<Tr>& yp, const AnyIntView<Tr>& zp) {
+  int yn = yp.size(), zn = zp.size();
+  if (!yp.is_valid() || !zp.is_valid() || !is_valid()) {
+    invalidate();
+    return;
+  }
+  int xn = std::min(yn + zn, max_size());
+  while (size() < xn) {
+    digits[inc_size()] = 0;
+  }
+  xn = size();
+  for (int i = 0; i < yn && i < xn; i++) {
+    word_t yv = yp.digits[i];
+    for (int j = 0; j < zn; j++) {
+      if (i + j + 1 < xn) {
+        Tr::add_mul(&digits[i + j + 1], &digits[i + j], yv, zp.digits[j]);
+      } else {
+        word_t hi = 0;
+        Tr::add_mul(&hi, &digits[i + j], yv, zp.digits[j]);
+        break;
+      }
+    }
+  }
+}
+
+template <class Tr>
+int AnyIntView<Tr>::sgn_un_any() const {
+  if (!is_valid()) {
+    return 0;
+  }
+  word_t v = digits[size() - 1];
+  if (size() >= 2) {
+    if (v >= Tr::MaxDenorm) {
+      return 1;
+    } else if (v <= -Tr::MaxDenorm) {
+      return -1;
+    }
+    int i = size() - 2;
+    do {
+      v <<= word_shift;
+      word_t w = digits[i];
+      if (w >= -v + Tr::MaxDenorm) {
+        return 1;
+      } else if (w <= -v - Tr::MaxDenorm) {
+        return -1;
+      }
+      v += w;
+    } while (--i >= 0);
+  }
+  return (v > 0 ? 1 : (v < 0 ? -1 : 0));
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::get_bit_any(unsigned bit) const {
+  if (!is_valid()) {
+    return 0;
+  }
+  if (bit >= (unsigned)size() * word_shift) {
+    return sgn() < 0;
+  }
+  if (bit < word_shift) {
+    return (digits[0] >> bit) & 1;
+  }
+  auto q = std::div(bit, word_shift);
+  int i = q.quot;
+  word_t x = digits[i];
+  while (--i >= 0) {
+    if (digits[i] < 0) {
+      --x;
+      break;
+    } else if (digits[i] > 0) {
+      break;
+    }
+  }
+  return (x >> q.rem) & 1;
+}
+
+template <class Tr>
+typename Tr::word_t AnyIntView<Tr>::to_long_any() const {
+  if (!is_valid()) {
+    return (~0ULL << 63);
+  } else if (size() == 1) {
+    return digits[0];
+  } else {
+    word_t v = digits[0] + (digits[1] << word_shift);  // approximation mod 2^64
+    word_t w = (v & (Tr::Base - 1)) - digits[0];
+    w >>= word_shift;
+    w += (v >> word_shift);  // excess of approximation divided by Tr::Base
+    int n = size() - 1;
+    for (int i = 1; i < n; i++) {
+      w -= digits[i];
+      if (w & (Tr::Base - 1)) {
+        return (~0ULL << 63);
+      }
+      w >>= word_shift;
+    }
+    return w != digits[n] ? (~0ULL << 63) : v;
+  }
+}
+
+template <class Tr>
+int AnyIntView<Tr>::cmp_any(const AnyIntView<Tr>& yp) const {
+  if (yp.size() < size()) {
+    return top_word() < 0 ? -1 : 1;
+  } else if (yp.size() > size()) {
+    return yp.top_word() > 0 ? -1 : 1;
+  }
+  for (int i = size() - 1; i >= 0; i--) {
+    if (digits[i] < yp.digits[i]) {
+      return -1;
+    } else if (digits[i] > yp.digits[i]) {
+      return 1;
+    }
+  }
+  return 0;
+}
+
+template <class Tr>
+int AnyIntView<Tr>::cmp_any(word_t y) const {
+  if (size() > 1) {
+    return top_word() < 0 ? -1 : 1;
+  } else if (size() == 1) {
+    return digits[0] < y ? -1 : (digits[0] > y ? 1 : 0);
+  } else {
+    return 0x80000000;
+  }
+}
+
+template <class Tr>
+template <class T>
+int AnyIntView<Tr>::cmp_un_any(const AnyIntView<Tr>& yp) const {
+  int xn = size(), yn = yp.size();
+  word_t v;
+  if (yn < xn) {
+    v = T::eval(digits[--xn]);
+    if (v >= Tr::MaxDenorm) {
+      return 1;
+    } else if (v <= -Tr::MaxDenorm) {
+      return -1;
+    }
+    while (xn > yn) {
+      v <<= word_shift;
+      word_t w = T::eval(digits[--xn]);
+      if (w >= -v + Tr::MaxDenorm) {
+        return 1;
+      } else if (w <= -v + Tr::MaxDenorm) {
+        return -1;
+      }
+      v += w;
+    }
+  } else if (yn > xn) {
+    v = -yp.digits[--yn];
+    if (v >= Tr::MaxDenorm) {
+      return 1;
+    } else if (v <= -Tr::MaxDenorm) {
+      return -1;
+    }
+    while (yn > xn) {
+      v <<= word_shift;
+      word_t w = yp.digits[--yn];
+      if (w <= v - Tr::MaxDenorm) {
+        return 1;
+      } else if (w >= v + Tr::MaxDenorm) {
+        return -1;
+      }
+      v -= w;
+    }
+  } else {
+    v = 0;
+  }
+  while (--xn >= 0) {
+    v <<= word_shift;
+    word_t w = T::eval(digits[xn]) - yp.digits[xn];
+    if (w >= -v + Tr::MaxDenorm) {
+      return 1;
+    } else if (w <= -v - Tr::MaxDenorm) {
+      return -1;
+    }
+    v += w;
+  }
+  return (v > 0 ? 1 : (v < 0 ? -1 : 0));
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::eq_any(const AnyIntView<Tr>& yp) const {
+  if (yp.size() != size()) {
+    return false;
+  }
+  return !std::memcmp(digits.data(), yp.digits.data(), size() * sizeof(word_t));
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::eq_any(word_t y) const {
+  return (size() == 1 && digits[0] == y);
+}
+
+template <class Tr>
+void AnyIntView<Tr>::negate_any() {
+  for (int i = 0; i < size(); i++) {
+    digits[i] = -digits[i];
+  }
+}
+
+template <class Tr>
+void AnyIntView<Tr>::mul_tiny_any(int y) {
+  for (int i = 0; i < size(); i++) {
+    digits[i] *= y;
+  }
+}
+
+template <class Tr>
+int AnyIntView<Tr>::divmod_tiny_any(int y) {
+  if (!y) {
+    invalidate();
+    return 0;
+  }
+  int rem = 0;
+  for (int i = size() - 1; i >= 0; i--) {
+    auto divmod = std::div(digits[i] + ((word_t)rem << word_shift), (word_t)y);
+    digits[i] = divmod.quot;
+    rem = (int)divmod.rem;
+    if ((rem ^ y) < 0 && rem) {
+      rem += y;
+      digits[i]--;
+    }
+  }
+  while (size() > 1 && !digits[size() - 1]) {
+    dec_size();
+  }
+  return rem;
+}
+
+template <class Tr>
+typename Tr::word_t AnyIntView<Tr>::divmod_short_any(word_t y) {
+  if (!y || !is_valid()) {
+    invalidate();
+    throw IntOverflow{};
+  }
+  word_t rem = 0;
+  int i = size() - 1;
+  if (!i) {
+    auto divmod = std::div(digits[0], y);
+    digits[0] = divmod.quot;
+    rem = divmod.rem;
+    if ((rem ^ y) < 0 && rem) {
+      rem += y;
+      digits[0]--;
+    }
+    return rem;
+  }
+  if (std::abs(digits[i]) * 2 < std::abs(y)) {
+    rem = digits[i--];
+    dec_size();
+  }
+  do {
+    Tr::dbl_divmod(&digits[i], &rem, rem, digits[i], y);
+  } while (--i >= 0);
+  if ((rem ^ y) < 0 && rem) {
+    rem += y;
+    digits[0]--;
+  }
+  while (size() > 1 && !digits[size() - 1]) {
+    dec_size();
+  }
+  return rem;
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::mul_add_short_any(word_t y, word_t z) {
+  if (!is_valid()) {
+    return false;
+  }
+  for (int i = 0; i < size(); i++) {
+    word_t newc;
+    Tr::set_mul(&newc, digits.data() + i, y, digits[i]);
+    digits[i] += z;
+    z = newc;
+  }
+  if (!z) {
+    return true;
+  }
+  if (size() < max_size()) {
+    digits[inc_size()] = z;
+    return true;
+  }
+  z += (digits[size() - 1] >> word_shift);
+  digits[size() - 1] &= Tr::Base - 1;
+  if (!z || z == -1) {
+    digits[size() - 1] += (z << word_shift);
+    return true;
+  } else {
+    return false;
+  }
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::mod_div_any(const AnyIntView<Tr>& yp, AnyIntView<Tr>& quot, int round_mode) {
+  quot.invalidate();
+  if (!is_valid()) {
+    return false;
+  }
+  if (yp.size() == 1) {
+    word_t yv = yp.digits[0];
+    if (!yv) {
+      return false;
+    }
+    word_t rem = divmod_short_any(yv);
+    if (!round_mode) {
+      if ((yv > 0 && rem * 2 >= yv) || (yv < 0 && rem * 2 <= yv)) {
+        rem -= yv;
+        digits[0]++;
+      }
+    } else if (round_mode > 0 && rem) {
+      rem -= yv;
+      digits[0]++;
+    }
+    if (!normalize_bool_any()) {
+      return false;
+    }
+    if (size() > quot.max_size()) {
+      return false;
+    }
+    quot.set_size(size());
+    std::memcpy(quot.digits.data(), digits.data(), size() * sizeof(word_t));
+    *this = rem;
+    return true;
+  }
+  if (!yp.is_valid()) {
+    return invalidate_bool();
+  }
+
+  double y_top = yp.top_double();
+  if (y_top == 0) {
+    // division by zero
+    return invalidate_bool();
+  }
+  double y_inv = (double)Tr::Base / y_top;
+
+  int k = size() - yp.size();
+  if (k >= 0) {
+    if (std::abs(top_word()) * 2 <= std::abs(yp.top_word())) {
+      if (k > quot.max_size()) {
+        return invalidate_bool();
+      }
+      quot.set_size(k);
+    } else {
+      if (k >= quot.max_size()) {
+        return invalidate_bool();
+      }
+      quot.set_size(k + 1);
+      double x_top = top_double();
+      word_t q = std::llrint(x_top * y_inv * Tr::InvBase);
+      quot.digits[k] = q;
+      int i = yp.size() - 1;
+      word_t hi = 0;
+      Tr::sub_mul(&hi, &digits[k + i], q, yp.digits[i]);
+      while (--i >= 0) {
+        Tr::sub_mul(&digits[k + i + 1], &digits[k + i], q, yp.digits[i]);
+      }
+      digits[size() - 1] += (hi << word_shift);
+    }
+  } else {
+    quot.set_size(1);
+    quot.digits[0] = 0;
+  }
+  while (--k >= 0) {
+    double x_top = top_double();
+    word_t q = std::llrint(x_top * y_inv);
+    quot.digits[k] = q;
+    for (int i = yp.size() - 1; i >= 0; --i) {
+      Tr::sub_mul(&digits[k + i + 1], &digits[k + i], q, yp.digits[i]);
+    }
+    dec_size();
+    digits[size() - 1] += (digits[size()] << word_shift);
+  }
+  if (size() >= yp.size()) {
+    assert(size() == yp.size());
+    double x_top = top_double();
+    double t = x_top * y_inv * Tr::InvBase;
+    if (round_mode >= 0) {
+      t += (round_mode ? 1 : 0.5);
+    }
+    word_t q = std::llrint(std::floor(t));
+    if (q) {
+      for (int i = 0; i < size(); i++) {
+        digits[i] -= q * yp.digits[i];
+      }
+      quot.digits[0] += q;
+    }
+  }
+
+  int q_adj = 0, sy = (y_inv > 0 ? 1 : -1);
+  if (round_mode < 0) {
+    // floor: must have 0 <= rem < y or 0 >= rem > y
+    int sr = sgn_un_any();
+    if (sr * sy < 0) {
+      q_adj = -1;
+    } else {
+      sr = cmp_un_any<TransformId<word_t>>(yp);
+      if (sr * sy >= 0) {
+        q_adj = 1;
+      }
+    }
+  } else if (round_mode > 0) {
+    // ceil: must have -y < rem <= 0 or -y > rem >= 0
+    int sr = sgn_un_any();
+    if (sr * sy > 0) {
+      q_adj = 1;
+    } else {
+      sr = cmp_un_any<TransformNegate<word_t>>(yp);  // -rem ?? y
+      if (sr * sy >= 0) {
+        q_adj = -1;
+      }
+    }
+  } else {
+    // round: must have -y <= 2*rem < y or -y >= 2*rem > y
+    int sr = sgn_un_any();
+    if (sr * sy > 0) {
+      // y and rem same sign, check 2*rem < y or 2*rem > y
+      sr = cmp_un_any<TransformMul<word_t, 2>>(yp);
+      if (sr * sy >= 0) {
+        q_adj = 1;
+      }
+    } else {
+      // y and rem different sign, check 2*rem >= -y or 2*rem <= -y
+      sr = cmp_un_any<TransformMul<word_t, -2>>(yp);
+      if (sr * sy > 0) {
+        q_adj = -1;
+      }
+    }
+  }
+  if (q_adj) {
+    quot.digits[0] += q_adj;
+    if (q_adj < 0 ? !add_any(yp) : !sub_any(yp)) {
+      return invalidate_bool();
+    }
+  }
+  return normalize_bool_any();
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::mod_pow2_any(int exponent) {
+  if (!is_valid()) {
+    return false;
+  }
+  if (exponent <= 0) {
+    *this = 0;
+    return true;
+  }
+  int q = exponent - (size() - 1) * word_shift;
+  if (q >= word_bits) {
+    if (sgn() >= 0) {
+      return true;
+    }
+    if (exponent >= max_size() * word_shift) {
+      return invalidate_bool();
+    }
+    while (q >= word_shift) {
+      digits[inc_size()] = 0;
+      q -= word_shift;
+    }
+    if (q == word_shift - 1 && size() < max_size()) {
+      digits[size() - 1] = -Tr::Half;
+      digits[inc_size()] = 1;
+    } else {
+      digits[size() - 1] = ((word_t)1 << q);
+    }
+    return true;
+  }
+  while (q < 0) {
+    dec_size();
+    q += word_shift;
+  }
+  word_t pow = ((word_t)1 << q);
+  word_t v = digits[size() - 1] & (pow - 1);
+  if (!v) {
+    int k = size() - 1;
+    while (k > 0 && !digits[k - 1]) {
+      --k;
+    }
+    if (!k) {
+      *this = 0;
+      return true;
+    }
+    if (digits[k - 1] > 0) {
+      set_size(k);
+      return true;
+    }
+    if (exponent >= max_size() * word_shift) {
+      return invalidate_bool();
+    }
+    if (q - word_shift >= 0) {
+      digits[size() - 1] = 0;
+      digits[inc_size()] = ((word_t)1 << (q - word_shift));
+    }
+    if (q - word_shift == -1 && size() < max_size() - 1) {
+      digits[size() - 1] = -Tr::Half;
+      digits[inc_size()] = 1;
+    } else {
+      digits[size() - 1] = pow;
+    }
+    return true;
+  } else if (v >= Tr::Half) {
+    if (size() == max_size() - 1) {
+      return invalidate_bool();
+    } else {
+      digits[size() - 1] = v | -Tr::Half;
+      digits[inc_size()] = ((word_t)1 << (q - word_shift));
+      return true;
+    }
+  } else {
+    digits[size() - 1] = v;
+    return true;
+  }
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::mod_pow2_any(int exponent, int round_mode) {
+  if (round_mode < 0) {
+    return mod_pow2_any(exponent);
+  }
+  if (!is_valid()) {
+    return false;
+  }
+  if (exponent <= 0) {
+    *this = 0;
+    return true;
+  }
+  if (round_mode > 0) {
+    negate_any();
+    bool res = mod_pow2_any(exponent);
+    negate_any();
+    return res;
+  }
+  if (signed_fits_bits_any(exponent)) {
+    return true;
+  }
+  if (!mod_pow2_any(exponent)) {
+    return false;
+  }
+  if (!unsigned_fits_bits_any(exponent - 1)) {
+    return add_pow2_any(exponent, -1);
+  }
+  return true;
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::rshift_any(int exponent, int round_mode) {
+  if (exponent < 0) {
+    return invalidate_bool();
+  }
+  if (!exponent) {
+    return true;
+  }
+  if (exponent > size() * word_shift + word_bits - word_shift) {
+    if (!round_mode) {
+      *this = 0;
+    } else if (round_mode < 0) {
+      *this = (sgn() < 0 ? -1 : 0);
+    } else {
+      *this = (sgn() > 0 ? 1 : 0);
+    }
+    return true;
+  }
+  int q = exponent / word_shift, r = exponent % word_shift;
+  assert(q <= size());
+
+  if (!round_mode && !r) {
+    digits[q - 1] += Tr::Half;
+    round_mode = -1;
+  }
+
+  word_t v = (round_mode > 0 ? -1 : 0);
+  for (int i = 0; i < q; i++) {
+    v += digits[i];
+    v >>= word_shift;
+  }
+
+  set_size(size() - q);
+  if (!size()) {
+    if (!round_mode) {
+      *this = (((v >> (r - 1)) + 1) >> 1);
+    } else {
+      *this = (v >> r) + (round_mode > 0);
+    }
+    return true;
+  }
+
+  if (!r) {
+    std::memmove(digits.data(), digits.data() + q, size() * sizeof(word_t));
+    digits[0] += v + (round_mode > 0);
+    return true;
+  }
+
+  v += digits[q];
+  if (!round_mode) {
+    v = (((v >> (r - 1)) + 1) >> 1);
+  } else {
+    v >>= r;
+    v += (round_mode > 0);
+  }
+
+  word_t mask = ((word_t)1 << r) - 1;
+  for (int i = 1; i < size(); i++) {
+    word_t w = digits[q + i];
+    v += ((w & mask) << (word_shift - r));
+    digits[i - 1] = v;
+    v = (w >> r);
+  }
+  digits[size() - 1] = v;
+  return true;
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::lshift_any(int exponent) {
+  if (exponent < 0) {
+    return invalidate_bool();
+  }
+  if (!exponent) {
+    return true;
+  }
+  int q = exponent / word_shift, r = exponent % word_shift;
+  if (size() + q > max_size()) {
+    return invalidate_bool();
+  }
+  if (!r) {
+    std::memmove(digits.data() + q, digits.data(), size() * sizeof(word_t));
+    std::memset(digits.data(), 0, q * sizeof(word_t));
+    set_size(size() + q);
+    return true;
+  }
+
+  word_t v = 0, mask = (Tr::Base >> r) - 1;
+  for (int i = 0; i < size(); i++) {
+    word_t w = digits[i];
+    v += ((w & mask) << r);
+    digits[i] = v;
+    v = (w >> (word_shift - r));
+  }
+  if (v) {
+    if (size() + q < max_size()) {
+      digits[inc_size()] = v;
+    } else if (v != -1) {
+      return invalidate_bool();
+    } else {
+      digits[size() - 1] += (v << word_shift);
+    }
+  }
+  if (q) {
+    std::memmove(digits.data() + q, digits.data(), size() * sizeof(word_t));
+    std::memset(digits.data(), 0, q * sizeof(word_t));
+    set_size(size() + q);
+  }
+  return true;
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::unsigned_fits_bits_any(int nbits) const {
+  if (!is_valid()) {
+    return false;
+  }
+  if (sgn() < 0) {
+    return false;
+  }
+  if (!sgn()) {
+    return true;
+  }
+  if (nbits >= size() * word_shift) {
+    return true;
+  }
+  if (nbits < 0) {
+    return false;
+  }
+  auto dm = std::div(nbits, word_shift);
+  int k = dm.quot;
+  if (size() >= k + 2) {
+    if (!(size() == k + 2 && dm.rem == word_shift - 1)) {
+      return false;
+    }
+    if (digits[k + 1] != 1) {
+      return false;
+    }
+    if (digits[k] > -Tr::Half) {
+      return false;
+    } else if (digits[k] < -Tr::Half) {
+      return true;
+    }
+  } else {
+    if (size() <= k) {
+      return true;
+    }
+    word_t pow = ((word_t)1 << dm.rem);
+    if (digits[k] > pow) {
+      return false;
+    } else if (digits[k] < pow) {
+      return true;
+    }
+  }
+  while (--k >= 0) {
+    if (digits[k] < 0) {
+      return true;
+    } else if (digits[k] > 0) {
+      return false;
+    }
+  }
+  return false;
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::signed_fits_bits_any(int nbits) const {
+  if (!is_valid()) {
+    return false;
+  }
+  if (nbits > size() * word_shift) {
+    return true;
+  }
+  int s = sgn();
+  if (!s) {
+    return true;
+  }
+  if (nbits <= 0) {
+    return false;
+  }
+  auto dm = std::div(nbits - 1, word_shift);
+  int k = dm.quot;
+  if (size() <= k) {
+    return true;
+  }
+  if (size() >= k + 2) {
+    if (!(size() == k + 2 && dm.rem == word_shift - 1)) {
+      return false;
+    }
+    if (digits[k + 1] != s) {
+      return false;
+    }
+    word_t val = (s > 0 ? digits[k] : -digits[k]);
+    if (val > -Tr::Half) {
+      return false;
+    } else if (val < -Tr::Half) {
+      return true;
+    }
+  } else {
+    word_t val = (s > 0 ? digits[k] : -digits[k]);
+    word_t pow = ((word_t)1 << dm.rem);
+    if (val > pow) {
+      return false;
+    } else if (val < pow) {
+      return true;
+    }
+  }
+  while (--k >= 0) {
+    if (digits[k] < 0) {
+      return s > 0;
+    } else if (digits[k] > 0) {
+      return s < 0;
+    }
+  }
+  return s < 0;
+}
+
+template <class Tr>
+int AnyIntView<Tr>::bit_size_any(bool sgnd) const {
+  if (!is_valid()) {
+    return 0x7fffffff;
+  }
+  int sg = sgn();
+  if (!sg) {
+    return 0;
+  } else if (sg >= 0) {
+    int k = size() - 1;
+    word_t q = digits[k];
+    if (k > 0 && q < Tr::MaxDenorm / 2) {
+      q <<= word_shift;
+      q += digits[--k];
+    }
+    if (!k) {
+      int s = 64 - td::count_leading_zeroes64(q);
+      return s + sgnd;
+    }
+    int s = 64 - td::count_leading_zeroes64(q - Tr::MaxDenorm / 4);
+    q -= (word_t)1 << s;
+    s += k * word_shift + sgnd;
+    while (k > 0) {
+      if (q >= Tr::MaxDenorm / 2) {
+        return s + 1;
+      } else if (q <= -Tr::MaxDenorm / 2) {
+        return s;
+      }
+      q <<= word_shift;
+      q += digits[--k];
+    }
+    return q >= 0 ? s + 1 : s;
+  } else if (sgnd) {
+    int k = size() - 1;
+    word_t q = digits[k];
+    if (k > 0 && q > -Tr::MaxDenorm / 2) {
+      q <<= word_shift;
+      q += digits[--k];
+    }
+    if (!k) {
+      int s = 64 - td::count_leading_zeroes64(~q);
+      return s + 1;
+    }
+    int s = 64 - td::count_leading_zeroes64(-q - Tr::MaxDenorm / 4);
+    q += (word_t)1 << s;
+    s += k * word_shift + 1;
+    while (k > 0) {
+      if (q >= Tr::MaxDenorm / 2) {
+        return s;
+      } else if (q <= -Tr::MaxDenorm / 2) {
+        return s + 1;
+      }
+      q <<= word_shift;
+      q += digits[--k];
+    }
+    return q >= 0 ? s : s + 1;
+  } else {
+    return 0x7fffffff;
+  }
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::export_bytes_any(unsigned char* buff, std::size_t buff_size, bool sgnd) const {
+  if (!is_valid()) {
+    return false;
+  }
+  if (!buff_size) {
+    return sgn_un_any() == 0;
+  }
+  int k = 0;
+  word_t v = 0;
+  unsigned char* ptr = buff + buff_size;
+  unsigned char s = (sgn_un_any() < 0 ? 0xff : 0);
+  if (s && !sgnd) {
+    return false;
+  }
+  for (int i = 0; i < size(); i++) {
+    if ((word_shift & 7) && word_shift + 8 >= word_bits && k >= word_bits - word_shift - 1) {
+      int k1 = 8 - k;
+      v += (digits[i] << k) & 0xff;
+      if (ptr > buff) {
+        *--ptr = (unsigned char)(v & 0xff);
+      } else if ((unsigned char)(v & 0xff) != s) {
+        return false;
+      }
+      v >>= 8;
+      v += (digits[i] >> k1);
+      k += word_shift - 8;
+    } else {
+      v += (digits[i] << k);
+      k += word_shift;
+    }
+    while (k >= 8) {
+      if (ptr > buff) {
+        *--ptr = (unsigned char)(v & 0xff);
+      } else if ((unsigned char)(v & 0xff) != s) {
+        return false;
+      }
+      v >>= 8;
+      k -= 8;
+    }
+  }
+  while (ptr > buff) {
+    *--ptr = (unsigned char)(v & 0xff);
+    v >>= 8;
+  }
+  if (v != -(s & 1)) {
+    return false;
+  }
+  return !sgnd ? true : !((*ptr ^ s) & 0x80);
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::export_bytes_lsb_any(unsigned char* buff, std::size_t buff_size, bool sgnd) const {
+  if (!is_valid()) {
+    return false;
+  }
+  if (!buff_size) {
+    return sgn_un_any() == 0;
+  }
+  int k = 0;
+  word_t v = 0;
+  unsigned char* end = buff + buff_size;
+  unsigned char s = (sgn_un_any() < 0 ? 0xff : 0);
+  if (s && !sgnd) {
+    return false;
+  }
+  for (int i = 0; i < size(); i++) {
+    if ((word_shift & 7) && word_shift + 8 >= word_bits && k >= word_bits - word_shift - 1) {
+      int k1 = 8 - k;
+      v += (digits[i] << k) & 0xff;
+      if (buff < end) {
+        *buff++ = (unsigned char)(v & 0xff);
+      } else if ((unsigned char)(v & 0xff) != s) {
+        return false;
+      }
+      v >>= 8;
+      v += (digits[i] >> k1);
+      k += word_shift - 8;
+    } else {
+      v += (digits[i] << k);
+      k += word_shift;
+    }
+    while (k >= 8) {
+      if (buff < end) {
+        *buff++ = (unsigned char)(v & 0xff);
+      } else if ((unsigned char)(v & 0xff) != s) {
+        return false;
+      }
+      v >>= 8;
+      k -= 8;
+    }
+  }
+  while (buff < end) {
+    *buff++ = (unsigned char)(v & 0xff);
+    v >>= 8;
+  }
+  if (v != -(s & 1)) {
+    return false;
+  }
+  return !sgnd ? true : !((buff[-1] ^ s) & 0x80);
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::export_bits_any(unsigned char* buff, int offs, unsigned bits, bool sgnd) const {
+  if (!is_valid()) {
+    return false;
+  }
+  if (!bits) {
+    return sgn_un_any() == 0;
+  }
+  if (size() == 1 || bits < 64) {
+    word_t v = to_long_any();
+    if (bits < 64) {
+      if (!sgnd) {
+        if (v < 0 || (unsigned long long)v >= (1ULL << bits)) {
+          return false;
+        }
+      } else {
+        word_t pw = (1LL << (bits - 1));
+        if (v < -pw || v >= pw) {
+          return false;
+        }
+      }
+      td::bitstring::bits_store_long_top(buff, offs, v << (64 - bits), bits);
+    } else {
+      if (!sgnd && v < 0) {
+        return false;
+      }
+      td::bitstring::bits_memset(buff, offs, v < 0, bits - 64);
+      td::bitstring::bits_store_long_top(buff, offs + bits - 64, v, 64);
+    }
+    return true;
+  }
+  buff += (offs >> 3);
+  offs &= 7;
+  unsigned char s = (sgn_un_any() < 0 ? 0xff : 0);
+  if (s && !sgnd) {
+    return false;
+  }
+  unsigned end_offs = offs + bits;
+  unsigned char* ptr = buff + (end_offs >> 3);
+  int k = td::bits_negate32(end_offs) & 7;
+  word_t v = k ? (*ptr++ & ((1 << k) - 1)) : 0;
+  for (int i = 0; i < size(); i++) {
+    if (word_shift + 8 >= word_bits && k >= word_bits - word_shift - 1) {
+      int k1 = 8 - k;
+      v += (digits[i] << k) & 0xff;
+      if (ptr > buff) {
+        if (--ptr > buff) {
+          *ptr = (unsigned char)(v & 0xff);
+        } else {
+          int mask = (-0x100 >> offs) & 0xff;
+          if (((unsigned char)v ^ s) & mask) {
+            return false;
+          }
+          *ptr = (unsigned char)((*ptr & mask) | ((int)v & ~mask));
+        }
+      } else if ((unsigned char)(v & 0xff) != s) {
+        return false;
+      }
+      v >>= 8;
+      v += (digits[i] >> k1);
+      k += word_shift - 8;
+    } else {
+      v += (digits[i] << k);
+      k += word_shift;
+    }
+    while (k >= 8) {
+      if (ptr > buff) {
+        if (--ptr > buff) {
+          *ptr = (unsigned char)(v & 0xff);
+        } else {
+          int mask = (-0x100 >> offs) & 0xff;
+          if (((unsigned char)v ^ s) & mask) {
+            return false;
+          }
+          *ptr = (unsigned char)((*ptr & mask) | ((int)v & ~mask));
+        }
+      } else if ((unsigned char)(v & 0xff) != s) {
+        return false;
+      }
+      v >>= 8;
+      k -= 8;
+    }
+  }
+  if (ptr > buff) {
+    while (--ptr > buff) {
+      *ptr = (unsigned char)(v & 0xff);
+      v >>= 8;
+    }
+    int mask = (-0x100 >> offs) & 0xff;
+    if (((unsigned char)v ^ s) & mask) {
+      return false;
+    }
+    *ptr = (unsigned char)((*ptr & mask) | ((int)v & ~mask));
+    v >>= 8;
+  }
+  if (v != -(s & 1)) {
+    return false;
+  }
+  return !sgnd ? true : !((*ptr ^ s) & (0x80 >> offs));
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::import_bytes_any(const unsigned char* buff, std::size_t buff_size, bool sgnd) {
+  if (!buff_size) {
+    *this = 0;
+    return true;
+  }
+  unsigned char s = (sgnd && (buff[0] & 0x80)) ? 0xff : 0;
+  const unsigned char* ptr = buff + buff_size;
+  while (buff < ptr && *buff == s) {
+    buff++;
+  }
+  int k = 0;
+  word_t v = 0;
+  set_size(1);
+  assert(word_bits - word_shift >= 8);
+  while (ptr > buff) {
+    if (k >= word_shift) {
+      if (size() < max_size()) {
+        digits[size() - 1] = v;
+        inc_size();
+        v = 0;
+        k -= word_shift;
+      } else if (k >= word_bits - 8) {
+        return invalidate_bool();
+      }
+    }
+    v |= (((word_t) * --ptr) << k);
+    k += 8;
+  }
+  if (s) {
+    v -= ((word_t)1 << k);
+  }
+  digits[size() - 1] = v;
+  return normalize_bool_any();
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::import_bits_any(const unsigned char* buff, int offs, unsigned bits, bool sgnd) {
+  if (bits < word_shift) {
+    set_size(1);
+    unsigned long long val = td::bitstring::bits_load_long_top(buff, offs, bits);
+    if (sgnd) {
+      digits[0] = ((long long)val >> (64 - bits));
+    } else {
+      digits[0] = (val >> (64 - bits));
+    }
+    return true;
+  }
+  buff += (offs >> 3);
+  offs &= 7;
+  unsigned char s = (sgnd && (buff[0] & (0x80 >> offs))) ? 0xff : 0;
+  unsigned end_offs = (unsigned)offs + bits;
+  const unsigned char* ptr = buff + (end_offs >> 3);
+  if (buff < ptr && !((*buff ^ s) & (0xff >> offs))) {
+    buff++;
+    offs = 0;
+    while (buff < ptr && *buff == s) {
+      buff++;
+    }
+  }
+  int k = end_offs & 7;
+  word_t v = k ? (*ptr >> (8 - k)) : 0;
+  set_size(1);
+  assert(word_bits - word_shift >= 8);
+  while (ptr > buff) {
+    if (k >= word_shift) {
+      if (size() < max_size()) {
+        digits[size() - 1] = v;
+        inc_size();
+        v = 0;
+        k -= word_shift;
+      } else if (k >= word_bits - 8) {
+        return invalidate_bool();
+      }
+    }
+    v |= (((word_t) * --ptr) << k);
+    k += 8;
+  }
+  k -= offs;
+  word_t pw = ((word_t)1 << k);
+  v &= pw - 1;
+  if (s) {
+    v -= pw;
+  }
+  digits[size() - 1] = v;
+  return normalize_bool_any();
+}
+
+template <class Tr>
+bool AnyIntView<Tr>::import_bytes_lsb_any(const unsigned char* buff, std::size_t buff_size, bool sgnd) {
+  if (!buff_size) {
+    *this = 0;
+    return true;
+  }
+  const unsigned char* end = buff + buff_size;
+  unsigned char s = (sgnd && (end[-1] & 0x80)) ? 0xff : 0;
+  while (end > buff && end[-1] == s) {
+    --end;
+  }
+  int k = 0;
+  word_t v = 0;
+  set_size(1);
+  assert(word_bits - word_shift >= 8);
+  while (buff < end) {
+    if (k >= word_shift) {
+      if (size() < max_size()) {
+        digits[size() - 1] = v;
+        inc_size();
+        v = 0;
+        k -= word_shift;
+      } else if (k >= word_bits - 8) {
+        return invalidate_bool();
+      }
+    }
+    v |= (((word_t)*buff++) << k);
+    k += 8;
+  }
+  if (s) {
+    v -= ((word_t)1 << k);
+  }
+  digits[size() - 1] = v;
+  return normalize_bool_any();
+}
+
+template <class Tr>
+int AnyIntView<Tr>::parse_hex_any(const char* str, int str_len, int* frac) {
+  invalidate();
+  bool sgn = (str[0] == '-');
+  int i = sgn, j;
+  int p = (frac ? -1 : 0);
+  while (i < str_len && str[i] == '0') {
+    i++;
+  }
+  for (j = i; j < str_len; j++) {
+    int c = str[j];
+    if (c == '.' && p < 0) {
+      p = j + 1;
+      continue;
+    }
+    if (!((c >= '0' && c <= '9') || (c >= 'A' && c <= 'F') || (c >= 'a' && c <= 'f'))) {
+      break;
+    }
+  }
+  if (j == sgn + (p > 0)) {
+    return 0;
+  }
+  if ((j - i - (p > 0)) * 4 > (max_size() - 1) * word_shift + word_bits - 2) {
+    return 0;
+  }
+  int j_len = j, k = 0;
+  word_t v = 0;
+  set_size(0);
+  while (j > i) {
+    if (j == p) {
+      --j;
+      continue;
+    }
+    if (k >= word_shift && size() < max_size() - 1) {
+      digits[inc_size()] = (sgn ? -v : v);
+      v = 0;
+      k -= word_shift;
+    }
+    int c = str[--j];
+    if (c <= '9') {
+      c -= '0';
+    } else {
+      c = (c | 0x20) - ('a' - 10);
+    }
+    v += ((word_t)c << k);
+    k += 4;
+    enforce(k < word_bits - 1);
+  }
+  digits[inc_size()] = (sgn ? -v : v);
+  if (!normalize_bool_any()) {
+    invalidate();
+    return 0;
+  }
+  if (p) {
+    *frac = (p > 0 ? j_len - p : -1);
+  }
+  return j_len;
+}
+
+template <class Tr>
+int AnyIntView<Tr>::parse_binary_any(const char* str, int str_len, int* frac) {
+  invalidate();
+  bool sgn = (str[0] == '-');
+  int i = sgn, j, p = (frac ? -1 : 0);
+  while (i < str_len && str[i] == '0') {
+    i++;
+  }
+  for (j = i; j < str_len; j++) {
+    int c = str[j];
+    if (c != '0' && c != '1') {
+      if (c == '.' && p < 0) {
+        p = j + 1;
+        continue;
+      }
+      break;
+    }
+  }
+  if (j == sgn + (p > 0)) {
+    return 0;
+  }
+  if (j - i - (p > 0) > (max_size() - 1) * word_shift + word_bits - 2) {
+    return 0;
+  }
+  int j_len = j, k = 0;
+  word_t v = 0;
+  set_size(0);
+  while (j > i) {
+    if (j == p) {
+      --j;
+      continue;
+    }
+    if (k >= word_shift && size() < max_size() - 1) {
+      digits[inc_size()] = (sgn ? -v : v);
+      v = 0;
+      k -= word_shift;
+    }
+    v += ((word_t)(str[--j] & 1) << k);
+    k++;
+    enforce(k < word_bits - 1);
+  }
+  digits[inc_size()] = (sgn ? -v : v);
+  if (!normalize_bool_any()) {
+    invalidate();
+    return 0;
+  }
+  if (p) {
+    *frac = (p > 0 ? j_len - p : -1);
+  }
+  return j_len;
+}
+
+template <class Tr>
+std::string AnyIntView<Tr>::to_dec_string_slow_destroy_any() {
+  if (!is_valid()) {
+    return "NaN";
+  }
+  std::string x;
+  x.reserve((size() * word_shift + word_bits) * 97879 / 325147 + 2);
+  int s = sgn();
+  if (s < 0) {
+    negate_any();
+  }
+  do {
+    x += (char)('0' + divmod_short_any(10));
+  } while (sgn());
+  if (s < 0) {
+    x += '-';
+  }
+  std::reverse(x.begin(), x.end());
+  return x;
+}
+
+template <class Tr>
+std::string AnyIntView<Tr>::to_dec_string_destroy_any() {
+  if (!is_valid()) {
+    return "NaN";
+  }
+  std::string s;
+  std::vector<word_t> stack;
+  int l10 = (size() * word_shift + word_bits) * 97879 / 325147;
+  s.reserve(l10 + 2);
+  stack.reserve(l10 / Tr::max_pow10_exp + 1);
+  if (sgn() < 0) {
+    negate_any();
+    s += '-';
+  }
+  do {
+    stack.push_back(divmod_short_any(Tr::max_pow10));
+  } while (sgn());
+  char slice[word_bits * 97879 / 325147 + 2];
+  std::sprintf(slice, "%lld", stack.back());
+  s += slice;
+  stack.pop_back();
+  while (stack.size()) {
+    std::sprintf(slice, "%018lld", stack.back());
+    s += slice;
+    stack.pop_back();
+  }
+  return s;
+}
+
+static const char hex_digits[] = "0123456789abcdef";
+static const char HEX_digits[] = "0123456789ABCDEF";
+
+template <class Tr>
+std::string AnyIntView<Tr>::to_hex_string_slow_destroy_any() {
+  if (!is_valid()) {
+    return "NaN";
+  }
+  std::string x;
+  x.reserve(((size() * word_shift + word_bits) >> 2) + 2);
+  int s = sgn();
+  if (s < 0) {
+    negate_any();
+  }
+  do {
+    x += hex_digits[divmod_short_any(16)];
+  } while (sgn());
+  if (s < 0) {
+    x += '-';
+  }
+  std::reverse(x.begin(), x.end());
+  return x;
+}
+
+template <class Tr>
+std::string AnyIntView<Tr>::to_hex_string_any(bool upcase) const {
+  if (!is_valid()) {
+    return "NaN";
+  }
+  int s = sgn(), k = 0;
+  if (!s) {
+    return "0";
+  }
+  std::string x;
+  x.reserve(((size() * word_shift + word_bits) >> 2) + 2);
+  assert(word_shift < word_bits - 4);
+  const char* hex_digs = (upcase ? HEX_digits : hex_digits);
+  word_t v = 0;
+  for (int i = 0; i < size(); i++) {
+    v += ((s >= 0 ? digits[i] : -digits[i]) << k);
+    k += word_shift;
+    while (k >= 4 && (v || i < size() - 1)) {
+      x += hex_digs[v & 15];
+      v >>= 4;
+      k -= 4;
+    }
+  }
+  assert(v >= 0);
+  while (v > 0) {
+    x += hex_digs[v & 15];
+    v >>= 4;
+  }
+  if (s < 0) {
+    x += '-';
+  }
+  std::reverse(x.begin(), x.end());
+  return x;
+}
+
+template <class Tr>
+std::string AnyIntView<Tr>::to_binary_string_any() const {
+  if (!is_valid()) {
+    return "NaN";
+  }
+  int s = sgn();
+  if (!s) {
+    return "0";
+  }
+  std::string x;
+  x.reserve(size() * word_shift + word_bits + 2);
+  assert(word_shift < word_bits - 1);
+  word_t v = 0;
+  for (int i = 0; i < size(); i++) {
+    v += (s >= 0 ? digits[i] : -digits[i]);
+    int k = word_shift;
+    while (--k >= 0 && (v || i < size() - 1)) {
+      x += (v & 1 ? '1' : '0');
+      v >>= 1;
+    }
+  }
+  assert(v >= 0);
+  while (v > 0) {
+    x += (v & 1 ? '1' : '0');
+    v >>= 1;
+  }
+  if (s < 0) {
+    x += '-';
+  }
+  std::reverse(x.begin(), x.end());
+  return x;
+}
+
+template <int len, class Tr>
+BigIntG<len, Tr>& BigIntG<len, Tr>::denormalize() {
+  word_t val = 0;
+  for (int i = 0; i < n; i++) {
+    val += digits[i];
+    digits[i] = (val & (Tr::Base - 1));
+    val >>= word_shift;
+  }
+  while (n < word_cnt) {
+    digits[n++] = (val & (Tr::Base - 1));
+    val >>= word_shift;
+  }
+  return *this;
+}
+
+template <int len, class Tr>
+BigIntG<len, Tr>& BigIntG<len, Tr>::logical_not() {
+  digits[0] = ~digits[0];
+  for (int i = 1; i < n; i++) {
+    digits[i] = -digits[i];
+  }
+  return *this;
+}
+
+template <int len, class Tr>
+std::ostream& BigIntG<len, Tr>::dump(std::ostream& os, bool nl) const {
+  os << "{";
+  //auto f = os.flags();
+  //os.flags(std::ios::hex | std::ios::showbase);
+  //os.width(16);
+  for (int i = n - 1; i >= 0; i--) {
+    os << digits[i] << (i ? ' ' : '}');
+  }
+  if (!n) {
+    os << "nan}";
+  }
+  if (nl) {
+    os << std::endl;
+  }
+  //os.flags(f);
+  return os;
+}
+
+template <int len, class Tr>
+std::string BigIntG<len, Tr>::dump() const {
+  std::ostringstream os;
+  dump(os);
+  return os.str();
+}
+
+template <int len, class Tr>
+int BigIntG<len, Tr>::parse_dec_slow(const char* str, int str_len) {
+  *this = 0;
+  int i;
+  bool sgn = (str[0] == '-');
+  if (str_len <= static_cast<int>(sgn)) {
+    return 0;
+  }
+  for (i = sgn; i < str_len; i++) {
+    if (str[i] < '0' || str[i] > '9') {
+      return i;
+    }
+    mul_tiny(10);
+    add_tiny(sgn ? '0' - str[i] : str[i] - '0');
+    if (!normalize_bool()) {
+      *this = 0;
+      return 0;
+    }
+  }
+  return i;
+}
+
+template <int len, class Tr>
+int BigIntG<len, Tr>::parse_dec(const char* str, int str_len, int* frac) {
+  *this = 0;
+  int i;
+  int p = frac ? -1 : 0;
+  bool sgn = (str[0] == '-'), ok = false;
+  word_t q = 1, a = 0;
+  for (i = sgn; i < str_len; i++) {
+    if (str[i] == '.') {
+      if (p >= 0) {
+        break;
+      }
+      p = i + 1;
+      continue;
+    }
+    int digit = (int)str[i] - '0';
+    if ((unsigned)digit >= 10) {
+      break;
+    }
+    ok = true;
+    if (q >= Tr::Half / 10) {
+      if (!mul_add_short_bool(q, a)) {
+        return 0;
+      }
+      q = 1;
+      a = 0;
+    }
+    q *= 10;
+    a *= 10;
+    a += (sgn ? -digit : digit);
+  }
+  if (!ok || !mul_add_short_bool(q, a) || !normalize_bool()) {
+    return 0;
+  }
+  if (frac) {
+    *frac = (p > 0 ? i - p : -1);
+  }
+  return i;
+}
+
+template <int len, class Tr>
+std::string BigIntG<len, Tr>::to_dec_string_slow() const {
+  BigIntG<len, Tr> copy(*this);
+  copy.normalize_bool();
+  return copy.as_any_int().to_dec_string_slow_destroy_any();
+}
+
+template <int len, class Tr>
+std::string BigIntG<len, Tr>::to_dec_string() const {
+  BigIntG<len, Tr> copy(*this);
+  copy.normalize_bool();
+  //std::cout << "(tds " << (const void*)this << "->" << (void*)&copy << ")";
+  return copy.as_any_int().to_dec_string_destroy_any();
+}
+
+template <int len, class Tr>
+std::string BigIntG<len, Tr>::to_dec_string_destroy() {
+  normalize_bool();
+  return as_any_int().to_dec_string_destroy_any();
+}
+
+template <int len, class Tr>
+std::string BigIntG<len, Tr>::to_hex_string_slow() const {
+  BigIntG<len, Tr> copy(*this);
+  copy.normalize_bool();
+  return copy.as_any_int().to_hex_string_slow_destroy_any();
+}
+
+template <int len, class Tr>
+std::string BigIntG<len, Tr>::to_hex_string(bool upcase) const {
+  return as_any_int().to_hex_string_any(upcase);
+}
+
+template <int len, class Tr>
+std::string BigIntG<len, Tr>::to_binary_string() const {
+  return as_any_int().to_binary_string_any();
+}
+
+template <int len, class Tr>
+std::ostream& operator<<(std::ostream& os, const BigIntG<len, Tr>& x) {
+  return os << x.to_dec_string();
+}
+
+template <int len, class Tr>
+std::ostream& operator<<(std::ostream& os, BigIntG<len, Tr>&& x) {
+  return os << x.to_dec_string_destroy();
+}
+
+extern template class AnyIntView<BigIntInfo>;
+extern template class BigIntG<257, BigIntInfo>;
+typedef BigIntG<257, BigIntInfo> BigInt256;
+
+namespace literals {
+
+extern BigInt256 operator""_i256(const char* str, std::size_t str_len);
+extern BigInt256 operator""_x256(const char* str, std::size_t str_len);
+
+}  // namespace literals
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/common/bitstring.cpp b/submodules/ton/tonlib-src/crypto/common/bitstring.cpp
new file mode 100644
index 0000000000..6a23f07250
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/common/bitstring.cpp
@@ -0,0 +1,668 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "common/bitstring.h"
+#include <cstring>
+#include <limits>
+#include "td/utils/as.h"
+#include "td/utils/bits.h"
+#include "td/utils/misc.h"
+#include "crypto/openssl/digest.h"
+
+namespace td {
+
+template class Ref<BitString>;
+
+BitString::BitString(const BitSlice& bs, unsigned reserve_bits) {
+  if (!bs.size() && !reserve_bits) {
+    ptr = 0;
+    offs = len = bytes_alloc = 0;
+  } else {
+    offs = bs.get_offs();
+    len = bs.size();
+    bytes_alloc = (bs.get_offs() + bs.size() + reserve_bits + 7) >> 3;
+    ptr = static_cast<unsigned char*>(std::malloc(bytes_alloc));
+    CHECK(ptr);
+    if (bs.size()) {
+      std::memcpy(ptr, bs.get_ptr(), bs.byte_size());
+    }
+  }
+}
+
+BitString::BitString(unsigned reserve_bits) {
+  if (!reserve_bits) {
+    ptr = 0;
+    offs = len = bytes_alloc = 0;
+  } else {
+    bytes_alloc = (reserve_bits + 7) >> 3;
+    ptr = static_cast<unsigned char*>(std::malloc(bytes_alloc));
+    CHECK(ptr);
+    offs = len = 0;
+  }
+}
+
+BitString::operator BitSlice() const {
+  return BitSlice(BitStringRef{this}, ptr, offs, len);
+}
+
+BitString* BitString::make_copy() const {
+  if (!ptr) {
+    return new BitString(64);  // reserve 64 bits
+  } else {
+    return new BitString(operator BitSlice(), 64);
+  }
+}
+
+BitString& BitString::reserve_bits(unsigned req_bits) {
+  req_bits += offs + len;
+  if (req_bits > bytes_alloc * 8) {
+    bytes_alloc = (req_bits + 7) >> 3;
+    ptr = (unsigned char*)std::realloc(ptr, bytes_alloc);
+    CHECK(ptr);
+  }
+  return *this;
+}
+
+BitSliceWrite BitString::reserve_bitslice(unsigned req_bits) {
+  reserve_bits(req_bits);
+  unsigned pos = offs + len;
+  len += req_bits;
+  return BitSliceWrite(Ref<BitString>(this), ptr, pos, req_bits);
+}
+
+BitString& BitString::append(const BitSlice& bs) {
+  reserve_bitslice(bs.size()) = bs;
+  return *this;
+}
+
+BitSlice BitString::subslice(unsigned from, unsigned bits) const {
+  return BitSlice{BitStringRef{this}, ptr, static_cast<int>(offs + from), bits};
+}
+
+BitSliceWrite BitString::subslice_write(unsigned from, unsigned bits) {
+  return BitSliceWrite{BitStringRef{this}, ptr, offs + from, bits};
+}
+
+const BitSliceWrite& BitSliceWrite::operator=(const BitSlice& bs) const {
+  if (size() != bs.size()) {
+    throw LengthMismatch();
+  }
+  bitstring::bits_memcpy(get_ptr(), get_offs(), bs.get_ptr(), bs.get_offs(), size());
+  return *this;
+}
+
+const BitSliceWrite& BitSliceWrite::operator=(bool val) const {
+  bitstring::bits_memset(get_ptr(), get_offs(), val, size());
+  return *this;
+}
+
+std::ostream& operator<<(std::ostream& os, const BitString& bs) {
+  return os << bs.to_hex();
+}
+
+std::ostream& operator<<(std::ostream& os, Ref<BitString> bs_ref) {
+  return os << (bs_ref.is_null() ? "(null-bs)" : bs_ref->to_hex());
+}
+
+namespace bitstring {
+
+void bits_memcpy(unsigned char* to, int to_offs, const unsigned char* from, int from_offs, std::size_t bit_count) {
+  if (bit_count <= 0) {
+    return;
+  }
+  from += (from_offs >> 3);
+  to += (to_offs >> 3);
+  from_offs &= 7;
+  to_offs &= 7;
+  //fprintf(stderr, "bits_memcpy: from=%p (%02x) to=%p (%02x) from_offs=%d to_offs=%d count=%lu\n", from, *from, to, *to, from_offs, to_offs, bit_count);
+  int sz = (int)bit_count;
+  bit_count += from_offs;
+  if (from_offs == to_offs) {
+    if (bit_count < 8) {
+      int mask = (-0x100 >> bit_count) & (0xff >> to_offs);
+      *to = (unsigned char)((*to & ~mask) | (*from & mask));
+      return;
+    }
+    std::size_t l = (bit_count >> 3);
+    if (!to_offs) {
+      std::memcpy(to, from, l);
+    } else {
+      int mask = (0xff >> to_offs);
+      *to = (unsigned char)((*to & ~mask) | (*from & mask));
+      std::memcpy(to + 1, from + 1, l - 1);
+    }
+    if ((bit_count &= 7) != 0) {
+      int mask = (-0x100 >> bit_count);
+      to[l] = (unsigned char)((to[l] & ~mask) | (from[l] & mask));
+    }
+  } else {
+    int b = (int)to_offs;
+    unsigned long long acc = (b ? *to >> (8 - b) : 0);
+    if (bit_count < 8) {
+      acc <<= sz;
+      acc |= ((*from & (0xff >> from_offs)) >> (8 - bit_count));
+      b += sz;
+    } else {
+      unsigned ld = 8 - from_offs;
+      acc <<= ld;
+      acc |= (*from++ & (0xff >> from_offs));
+      b += ld;
+      bit_count -= 8;
+      // b <= 15 here
+      while (bit_count >= 32) {
+        acc <<= 32;
+        acc |= td::bswap32(as<unsigned>(from));
+        from += 4;
+        as<unsigned>(to) = td::bswap32((unsigned)(acc >> b));
+        to += 4;
+        bit_count -= 32;
+      }
+      // bit_count <= 31, b <= 15
+      while (bit_count >= 8) {
+        acc <<= 8;
+        acc |= *from++;
+        bit_count -= 8;
+        b += 8;
+      }
+      // b + bit_count = const <= 46
+      if (bit_count > 0) {
+        acc <<= bit_count;
+        acc |= (*from >> (8 - bit_count));
+        b += (int)bit_count;
+      }
+    }
+    while (b >= 8) {
+      b -= 8;
+      *to++ = (unsigned char)(acc >> b);
+    }
+    if (b > 0) {
+      *to = (unsigned char)((*to & (0xff >> b)) | ((int)acc << (8 - b)));
+    }
+  }
+}
+
+void bits_memcpy(BitPtr to, ConstBitPtr from, std::size_t bit_count) {
+  bits_memcpy(to.ptr, to.offs, from.ptr, from.offs, bit_count);
+}
+
+void bits_memset(unsigned char* to, int to_offs, bool val, std::size_t bit_count) {
+  if (bit_count <= 0) {
+    return;
+  }
+  to += (to_offs >> 3);
+  to_offs &= 7;
+  int sz = (int)bit_count;
+  bit_count += to_offs;
+  int c = *to;
+  if (bit_count <= 8) {
+    int mask = (((-0x100 >> sz) & 0xff) >> to_offs);
+    if (val) {
+      *to = (unsigned char)(c | mask);
+    } else {
+      *to = (unsigned char)(c & ~mask);
+    }
+    return;
+  }
+  if (val) {
+    *to = (unsigned char)(c | (0xff >> to_offs));
+  } else {
+    *to = (unsigned char)(c & (-0x100 >> to_offs));
+  }
+  std::size_t l = (bit_count >> 3);
+  std::memset(to + 1, val ? 0xff : 0, l - 1);
+  if ((bit_count &= 7) != 0) {
+    if (val) {
+      to[l] = (unsigned char)(to[l] | (-0x100 >> bit_count));
+    } else {
+      to[l] = (unsigned char)(to[l] & (0xff >> bit_count));
+    }
+  }
+}
+
+void bits_memset(BitPtr to, bool val, std::size_t bit_count) {
+  bits_memset(to.ptr, to.offs, val, bit_count);
+}
+
+std::size_t bits_memscan_rev(const unsigned char* ptr, int offs, std::size_t bit_count, bool cmp_to) {
+  if (!bit_count) {
+    return 0;
+  }
+  int xor_val = (cmp_to ? -1 : 0);
+  ptr += ((offs + bit_count) >> 3);
+  offs = (int)((offs + bit_count) & 7);
+  std::size_t res = offs;
+  if (offs) {
+    unsigned v = (*ptr >> (8 - offs)) ^ xor_val;
+    unsigned c = td::count_trailing_zeroes32(v);
+    if (c < (unsigned)offs || res >= bit_count) {
+      return std::min(c, (unsigned)bit_count);
+    }
+  }
+  bit_count -= res;
+  while (bit_count >= 32) {
+    ptr -= 4;
+    unsigned v = td::bswap32(as<unsigned>(ptr)) ^ xor_val;
+    if (v) {
+      return td::count_trailing_zeroes_non_zero32(v) + res;
+    }
+    res += 32;
+    bit_count -= 32;
+  }
+  xor_val &= 0xff;
+  while (bit_count >= 8) {
+    unsigned v = *--ptr ^ xor_val;
+    if (v) {
+      return td::count_trailing_zeroes_non_zero32(v) + res;
+    }
+    res += 8;
+    bit_count -= 8;
+  }
+  if (bit_count > 0) {
+    unsigned v = *--ptr ^ xor_val;
+    return std::min((unsigned)td::count_trailing_zeroes32(v), (unsigned)bit_count) + res;
+  } else {
+    return res;
+  }
+}
+
+std::size_t bits_memscan(const unsigned char* ptr, int offs, std::size_t bit_count, bool cmp_to) {
+  if (!bit_count) {
+    return 0;
+  }
+  int xor_val = -static_cast<int>(cmp_to);
+  ptr += (offs >> 3);
+  offs &= 7;
+  std::size_t rem = bit_count;
+  unsigned v, c;
+  if (offs) {
+    v = ((unsigned)(ptr[0] ^ xor_val) << (24 + offs));
+    // std::cerr << "[A] rem=" << rem << " ptr=" << (const void*)ptr << " v=" << std::hex << v << std::dec << std::endl;
+    c = td::count_leading_zeroes32(v);
+    unsigned l = (unsigned)(8 - offs);
+    if (c < l || bit_count <= l) {
+      return std::min<std::size_t>(c, bit_count);
+    }
+    rem -= l;
+    ptr++;
+  }
+  while (rem >= 8 && !td::is_aligned_pointer<8>(ptr)) {
+    v = ((*ptr++ ^ xor_val) << 24);
+    // std::cerr << "[B] rem=" << rem << " ptr=" << (const void*)(ptr - 1) << " v=" << std::hex << v << std::dec << std::endl;
+    if (v) {
+      return bit_count - rem + td::count_leading_zeroes_non_zero32(v);
+    }
+    rem -= 8;
+  }
+  td::uint64 xor_val_l = (cmp_to ? ~0LL : 0LL);
+  while (rem >= 64) {
+    td::uint64 z = td::bswap64(as<td::uint64>(ptr)) ^ xor_val_l;
+    // std::cerr << "[C] rem=" << rem << " ptr=" << (const void*)ptr << " z=" << std::hex << z << std::dec << std::endl;
+    if (z) {
+      return bit_count - rem + td::count_leading_zeroes_non_zero64(z);
+    }
+    ptr += 8;
+    rem -= 64;
+  }
+  while (rem >= 8) {
+    v = ((*ptr++ ^ xor_val) << 24);
+    // std::cerr << "[D] rem=" << rem << " ptr=" << (const void*)(ptr - 1) << " v=" << std::hex << v << std::dec << std::endl;
+    if (v) {
+      return bit_count - rem + td::count_leading_zeroes_non_zero32(v);
+    }
+    rem -= 8;
+  }
+  if (rem > 0) {
+    v = ((*ptr ^ xor_val) << 24);
+    // std::cerr << "[E] rem=" << rem << " ptr=" << (const void*)ptr << " v=" << std::hex << v << std::dec << std::endl;
+    c = td::count_leading_zeroes32(v);
+    return c < rem ? bit_count - rem + c : bit_count;
+  } else {
+    return bit_count;
+  }
+}
+
+std::size_t bits_memscan(ConstBitPtr bs, std::size_t bit_count, bool cmp_to) {
+  return bits_memscan(bs.ptr, bs.offs, bit_count, cmp_to);
+}
+
+std::size_t bits_memscan_rev(ConstBitPtr bs, std::size_t bit_count, bool cmp_to) {
+  return bits_memscan_rev(bs.ptr, bs.offs, bit_count, cmp_to);
+}
+
+int bits_memcmp(const unsigned char* bs1, int bs1_offs, const unsigned char* bs2, int bs2_offs, std::size_t bit_count,
+                std::size_t* same_upto) {
+  if (!bit_count) {
+    return 0;
+  }
+  bs1 += (bs1_offs >> 3);
+  bs2 += (bs2_offs >> 3);
+  bs1_offs &= 7;
+  bs2_offs &= 7;
+  //fprintf(stderr, "bits_memcmp: bs1=%02x%02x offs=%d bs2=%02x%02x offs=%d cnt=%lu\n", bs1[0], bs1[1], bs1_offs, bs2[0], bs2[1], bs2_offs, bit_count);
+  unsigned long long acc1 = (((unsigned long long)*bs1++) << (56 + bs1_offs));
+  int z1 = 8 - bs1_offs;
+  unsigned long long acc2 = (((unsigned long long)*bs2++) << (56 + bs2_offs));
+  int z2 = 8 - bs2_offs;
+  std::size_t processed = 0;
+  while (bit_count >= 40) {
+    acc1 |= ((unsigned long long)td::bswap32(as<unsigned>(bs1)) << (32 - z1));
+    bs1 += 4;
+    acc2 |= ((unsigned long long)td::bswap32(as<unsigned>(bs2)) << (32 - z2));
+    bs2 += 4;
+    if ((acc1 ^ acc2) & (~0ULL << 32)) {
+      if (same_upto) {
+        *same_upto = processed + td::count_leading_zeroes64(acc1 ^ acc2);
+      }
+      return acc1 < acc2 ? -1 : 1;
+    }
+    acc1 <<= 32;
+    acc2 <<= 32;
+    processed += 32;
+    bit_count -= 32;
+  }
+  // now 0 <= bit_count <= 39
+
+  bs1_offs += (int)bit_count - 8;  // = bit_count - z1, bits to load from bs1
+  while (bs1_offs >= 8) {
+    acc1 |= ((unsigned long long)(*bs1++) << (56 - z1));
+    z1 += 8;
+    bs1_offs -= 8;
+  }
+  if (bs1_offs > 0) {
+    acc1 |= ((unsigned long long)(*bs1) << (56 - z1));
+  }
+  z1 += bs1_offs;  // NB: bs1_offs may be negative
+
+  bs2_offs += (int)bit_count - 8;  // bits to load from bs2
+  while (bs2_offs >= 8) {
+    acc2 |= ((unsigned long long)(*bs2++) << (56 - z2));
+    z2 += 8;
+    bs2_offs -= 8;
+  }
+  if (bs2_offs > 0) {
+    acc2 |= ((unsigned long long)(*bs2) << (56 - z2));
+  }
+  z2 += bs2_offs;
+
+  CHECK(z1 == z2);
+  CHECK(z1 < 64);
+  //fprintf(stderr, "acc1=%016llx acc2=%016llx z1=z2=%d\n", acc1, acc2, z1);
+  if (z1) {
+    if ((acc1 ^ acc2) & (~0ULL << (64 - z1))) {
+      if (same_upto) {
+        *same_upto = processed + td::count_leading_zeroes64(acc1 ^ acc2);
+      }
+      return acc1 < acc2 ? -1 : 1;
+    }
+  }
+  if (same_upto) {
+    *same_upto = processed + bit_count;
+  }
+  return 0;
+}
+
+int bits_memcmp(ConstBitPtr bs1, ConstBitPtr bs2, std::size_t bit_count, std::size_t* same_upto) {
+  return bits_memcmp(bs1.ptr, bs1.offs, bs2.ptr, bs2.offs, bit_count, same_upto);
+}
+
+int bits_lexcmp(const unsigned char* bs1, int bs1_offs, std::size_t bs1_bit_count, const unsigned char* bs2,
+                int bs2_offs, std::size_t bs2_bit_count) {
+  int res = bits_memcmp(bs1, bs1_offs, bs2, bs2_offs, std::min(bs1_bit_count, bs2_bit_count), 0);
+  if (res || bs1_bit_count == bs2_bit_count) {
+    return res;
+  }
+  return bs1_bit_count < bs2_bit_count ? -1 : 1;
+}
+
+int bits_lexcmp(ConstBitPtr bs1, std::size_t bs1_bit_count, ConstBitPtr bs2, std::size_t bs2_bit_count) {
+  return bits_lexcmp(bs1.ptr, bs1.offs, bs1_bit_count, bs2.ptr, bs2.offs, bs2_bit_count);
+}
+
+void bits_store_long_top(unsigned char* to, int to_offs, unsigned long long val, unsigned top_bits) {
+  CHECK(top_bits <= 64);
+  if (top_bits <= 0) {
+    return;
+  }
+  to += (to_offs >> 3);
+  to_offs &= 7;
+  if (!to_offs && !(top_bits & 7)) {
+    // good only on little-endian machines!
+    unsigned long long tmp = td::bswap64(val);
+    std::memcpy(to, &tmp, top_bits >> 3);
+    return;
+  }
+  unsigned long long z = (unsigned long long)(*to & (-0x100 >> to_offs)) << 56;
+  z |= (val >> to_offs);
+  top_bits += to_offs;
+  if (top_bits > 64) {
+    as<unsigned long long>(to) = td::bswap64(z);
+    z = (val << (8 - to_offs));
+    int mask = (0xff >> (top_bits - 64));
+    to[8] = (unsigned char)((to[8] & mask) | ((int)z & ~mask));
+  } else {
+    int p = 56, q = 64 - top_bits;
+    if (q <= 32) {
+      as<unsigned>(to) = td::bswap32((unsigned)(z >> 32));
+      to += 4;
+      p -= 32;
+    }
+    while (p >= q) {
+      *to++ = (unsigned char)(z >> p);
+      p -= 8;
+    }
+    top_bits = p + 8 - q;
+    if (top_bits > 0) {
+      int mask = (0xff >> top_bits);
+      *to = (unsigned char)((*to & mask) | ((z >> p) & ~mask));
+    }
+  }
+}
+
+void bits_store_long_top(BitPtr to, unsigned long long val, unsigned top_bits) {
+  bits_store_long_top(to.ptr, to.offs, val, top_bits);
+}
+
+void bits_store_long(BitPtr to, unsigned long long val, unsigned bits) {
+  bits_store_long_top(to, val << (64 - bits), bits);
+}
+
+unsigned long long bits_load_long_top(const unsigned char* from, int from_offs, unsigned top_bits) {
+  CHECK(top_bits <= 64);
+  if (!top_bits) {
+    return 0;
+  }
+  from += (from_offs >> 3);
+  from_offs &= 7;
+  if ((unsigned)from_offs + top_bits <= 64) {
+    unsigned long long tmp;
+    std::memcpy(&tmp, from, (from_offs + top_bits + 7) >> 3);
+    return (td::bswap64(tmp) << from_offs) & (std::numeric_limits<td::uint64>::max() << (64 - top_bits));
+  } else {
+    unsigned long long z = td::bswap64(as<unsigned long long>(from));
+    z <<= from_offs;
+    z |= (from[8] >> (8 - from_offs));
+    return z & (std::numeric_limits<td::uint64>::max() << (64 - top_bits));
+  }
+}
+
+unsigned long long bits_load_long_top(ConstBitPtr from, unsigned top_bits) {
+  return bits_load_long_top(from.ptr, from.offs, top_bits);
+}
+
+unsigned long long bits_load_ulong(ConstBitPtr from, unsigned bits) {
+  return bits_load_long_top(from, bits) >> (64 - bits);
+}
+
+long long bits_load_long(ConstBitPtr from, unsigned bits) {
+  return (long long)bits_load_long_top(from, bits) >> (64 - bits);
+}
+
+std::string bits_to_binary(const unsigned char* ptr, int offs, std::size_t len) {
+  if (!len) {
+    return "";
+  }
+  std::string s;
+  s.reserve(len);
+  ptr += (offs >> 3);
+  unsigned mask = (0x80 >> (offs & 7));
+  unsigned value = *ptr++;
+  do {
+    s.push_back(value & mask ? '1' : '0');
+    if (!(mask >>= 1)) {
+      value = *ptr++;
+      mask = 0x80;
+    }
+  } while (--len > 0);
+  return s;
+}
+
+std::string bits_to_binary(ConstBitPtr bs, std::size_t len) {
+  return bits_to_binary(bs.ptr, bs.offs, len);
+}
+
+static const char hex_digits[] = "0123456789ABCDEF";
+
+std::string bits_to_hex(const unsigned char* ptr, int offs, std::size_t len) {
+  if (!len) {
+    return "";
+  }
+  std::string s;
+  s.reserve((len + 7) >> 2);
+  ptr += (offs >> 3);
+  offs &= 7;
+  unsigned long long acc = *ptr++ & (0xff >> offs);
+  unsigned bits = 8 - offs;
+  if (bits > len) {
+    acc >>= bits - (unsigned)len;
+    bits = (unsigned)len;
+  } else {
+    len -= bits;
+    while (len >= 8) {
+      while (len >= 8 && bits <= 56) {
+        acc <<= 8;
+        acc |= *ptr++;
+        bits += 8;
+        len -= 8;
+      }
+      while (bits >= 4) {
+        bits -= 4;
+        s.push_back(hex_digits[(acc >> bits) & 15]);
+      }
+    }
+    if (len > 0) {
+      acc <<= len;
+      acc |= (*ptr >> (8 - len));
+      bits += (unsigned)len;
+    }
+  }
+  int f = bits & 3;
+  if (f) {
+    acc = (2 * acc + 1) << (3 - f);
+    bits += 4 - f;
+  }
+  while (bits >= 4) {
+    bits -= 4;
+    s.push_back(hex_digits[(acc >> bits) & 15]);
+  }
+  CHECK(!bits);
+  if (f) {
+    s.push_back('_');
+  }
+  return s;
+}
+
+std::string bits_to_hex(ConstBitPtr bs, std::size_t len) {
+  return bits_to_hex(bs.ptr, bs.offs, len);
+}
+
+long parse_bitstring_hex_literal(unsigned char* buff, std::size_t buff_size, const char* str, const char* str_end) {
+  std::size_t hex_digits_count = 0;
+  bool cmpl = false;
+  unsigned char* ptr = buff;
+  const char* rptr = str;
+  while (rptr < str_end) {
+    int c = *rptr++;
+    if (c == ' ' || c == '\t') {
+      continue;
+    }
+    if (cmpl) {
+      return td::narrow_cast<long>(str - rptr);
+    }
+    if ((c >= '0' && c <= '9') || (c >= 'a' && c <= 'f') || (c >= 'A' && c <= 'F')) {
+      int val = (c <= '9') ? c - '0' : ((c | 0x20) - 'a' + 10);
+      if (hex_digits_count >= 2 * buff_size) {
+        return td::narrow_cast<long>(str - rptr);
+      }
+      if (!(hex_digits_count & 1)) {
+        *ptr = (unsigned char)(val << 4);
+      } else {
+        *ptr = (unsigned char)(*ptr | val);
+        ptr++;
+      }
+      hex_digits_count++;
+      continue;
+    }
+    if (c == '_') {
+      cmpl = true;
+    } else {
+      return td::narrow_cast<long>(str - rptr);
+    }
+  }
+  std::size_t bits = 4 * hex_digits_count;
+  if (cmpl && bits) {
+    int t = (hex_digits_count & 1) ? (0x100 + *ptr) >> 4 : (0x100 + *--ptr);
+    while (bits > 0) {
+      --bits;
+      if (t & 1) {
+        break;
+      }
+      t >>= 1;
+      if (t == 1) {
+        t = 0x100 + *--ptr;
+      }
+    }
+  }
+  return bits;
+}
+
+long parse_bitstring_binary_literal(BitPtr buff, std::size_t buff_size, const char* str, const char* str_end) {
+  const char* ptr = str;
+  while (ptr < str_end && buff_size && (*ptr == '0' || *ptr == '1')) {
+    *buff++ = (bool)(*ptr++ & 1);
+    --buff_size;
+  }
+  return td::narrow_cast<long>(ptr == str_end ? ptr - str : str - ptr - 1);
+}
+
+void bits_sha256(BitPtr to, ConstBitPtr from, std::size_t size) {
+  if (from.byte_aligned() && !(size & 7)) {
+    if (to.byte_aligned()) {
+      digest::hash_str<digest::SHA256>(to.get_byte_ptr(), from.get_byte_ptr(), size >> 3);
+    } else {
+      unsigned char buffer[32];
+      digest::hash_str<digest::SHA256>(buffer, from.get_byte_ptr(), size >> 3);
+      to.copy_from(BitPtr{buffer}, 256);
+    }
+  } else {
+    throw BitstringError{};
+  }
+}
+
+}  // namespace bitstring
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/common/bitstring.h b/submodules/ton/tonlib-src/crypto/common/bitstring.h
new file mode 100644
index 0000000000..b2a37c72f0
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/common/bitstring.h
@@ -0,0 +1,665 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "common/refcnt.hpp"
+#include <utility>
+#include <array>
+#include <string>
+#include <ostream>
+#include <cstdlib>
+#include "td/utils/bits.h"
+
+namespace td {
+template <class Pt>
+struct BitPtrGen;
+
+typedef BitPtrGen<unsigned char> BitPtr;
+typedef BitPtrGen<const unsigned char> ConstBitPtr;
+
+struct BitstringError {};
+
+namespace bitstring {
+
+void bits_memcpy(unsigned char* to, int to_offs, const unsigned char* from, int from_offs, std::size_t bit_count);
+void bits_memcpy(BitPtr to, ConstBitPtr from, std::size_t bit_count);
+void bits_memset(unsigned char* to, int to_offs, bool val, std::size_t bit_count);
+void bits_memset(BitPtr to, bool val, std::size_t bit_count);
+int bits_memcmp(const unsigned char* bs1, int bs1_offs, const unsigned char* bs2, int bs2_offs, std::size_t bit_count,
+                std::size_t* same_upto = 0);
+int bits_memcmp(ConstBitPtr bs1, ConstBitPtr bs2, std::size_t bit_count, std::size_t* same_upto = 0);
+int bits_lexcmp(const unsigned char* bs1, int bs1_offs, std::size_t bs1_bit_count, const unsigned char* bs2,
+                int bs2_offs, std::size_t bs2_bit_count);
+int bits_lexcmp(ConstBitPtr bs1, std::size_t bs1_bit_count, ConstBitPtr bs2, std::size_t bs2_bit_count);
+std::size_t bits_memscan(const unsigned char* ptr, int offs, std::size_t bit_count, bool cmp_to);
+std::size_t bits_memscan_rev(const unsigned char* ptr, int offs, std::size_t bit_count, bool cmp_to);
+std::size_t bits_memscan(ConstBitPtr bs, std::size_t bit_count, bool cmp_to);
+std::size_t bits_memscan_rev(ConstBitPtr bs, std::size_t bit_count, bool cmp_to);
+void bits_store_long_top(unsigned char* to, int to_offs, unsigned long long val, unsigned top_bits);
+void bits_store_long_top(BitPtr to, unsigned long long val, unsigned top_bits);
+void bits_store_long(BitPtr to, unsigned long long val, unsigned bits);
+unsigned long long bits_load_long_top(const unsigned char* from, int from_offs, unsigned top_bits);
+unsigned long long bits_load_long_top(ConstBitPtr from, unsigned top_bits);
+long long bits_load_long(ConstBitPtr from, unsigned bits);
+unsigned long long bits_load_ulong(ConstBitPtr from, unsigned bits);
+long parse_bitstring_hex_literal(unsigned char* buff, std::size_t buff_size, const char* str, const char* str_end);
+long parse_bitstring_binary_literal(BitPtr buff, std::size_t buff_size, const char* str, const char* str_end);
+
+void bits_sha256(BitPtr to, ConstBitPtr from, std::size_t size);
+
+std::string bits_to_binary(const unsigned char* ptr, int offs, std::size_t len);
+std::string bits_to_binary(ConstBitPtr bs, std::size_t len);
+std::string bits_to_hex(const unsigned char* ptr, int offs, std::size_t len);
+std::string bits_to_hex(ConstBitPtr bs, std::size_t len);
+
+}  // namespace bitstring
+
+template <class Pt>
+struct BitPtrGen {
+  Pt* ptr;
+  int offs;
+  BitPtrGen(Pt* _ptr, int _offs = 0) : ptr(_ptr), offs(_offs) {
+  }
+  template <class Pt2>
+  BitPtrGen(BitPtrGen<Pt2> val) : ptr(val.ptr), offs(val.offs) {
+  }
+  BitPtrGen& operator+=(int _offs) {
+    offs += _offs;
+    return *this;
+  }
+  BitPtrGen& operator-=(int _offs) {
+    offs -= _offs;
+    return *this;
+  }
+  void advance(int _offs) {
+    offs += _offs;
+  }
+  bool byte_aligned() const {
+    return !(offs & 7);
+  }
+  Pt* get_byte_ptr() const {
+    return ptr + (offs >> 3);
+  }
+  void copy_from(BitPtrGen<const Pt> from, unsigned size) const {
+    bitstring::bits_memcpy(*this, from, size);
+  }
+  BitPtrGen& concat(BitPtrGen<const Pt> from, unsigned size) {
+    bitstring::bits_memcpy(*this, from, size);
+    offs += size;
+    return *this;
+  }
+  template <typename T>
+  void copy_from(const T& from) const {
+    copy_from(from.bits(), from.size());
+  }
+  template <typename T>
+  BitPtrGen& concat(const T& from) {
+    return concat(from.bits(), from.size());
+  }
+  void fill(bool bit, unsigned size) {
+    bitstring::bits_memset(*this, bit, size);
+  }
+  BitPtrGen& concat_same(bool bit, unsigned size) {
+    bitstring::bits_memset(*this, bit, size);
+    offs += size;
+    return *this;
+  }
+  int compare(BitPtrGen<const Pt> other, std::size_t size, std::size_t* same_upto = nullptr) const {
+    return bitstring::bits_memcmp(*this, other, size, same_upto);
+  }
+  bool equals(BitPtrGen<const Pt> other, std::size_t size) const {
+    return !bitstring::bits_memcmp(*this, other, size);
+  }
+  std::size_t scan(bool value, std::size_t len) const {
+    return bitstring::bits_memscan(*this, len, value);
+  }
+  bool is_zero(std::size_t len) const {
+    return scan(false, len) == len;
+  }
+  long long get_int(unsigned bits) const {
+    return bitstring::bits_load_long(*this, bits);
+  }
+  unsigned long long get_uint(unsigned bits) const {
+    return bitstring::bits_load_ulong(*this, bits);
+  }
+  void store_uint(unsigned long long val, unsigned n) const {
+    bitstring::bits_store_long(*this, val, n);
+  }
+  void store_int(long long val, unsigned n) const {
+    bitstring::bits_store_long(*this, val, n);
+  }
+  BitPtrGen operator+(int _offs) const {
+    return BitPtrGen{ptr, offs + _offs};
+  }
+  BitPtrGen operator-(int _offs) const {
+    return BitPtrGen{ptr, offs - _offs};
+  }
+  BitPtrGen operator++() {
+    ++offs;
+    return *this;
+  }
+  BitPtrGen operator--() {
+    --offs;
+    return *this;
+  }
+  BitPtrGen operator++(int) {
+    return BitPtrGen{ptr, offs++};
+  }
+  BitPtrGen operator--(int) {
+    return BitPtrGen{ptr, offs--};
+  }
+  bool is_null() const {
+    return !ptr;
+  }
+  bool not_null() const {
+    return ptr;
+  }
+  class BitSelector {
+    Pt* ptr;
+    unsigned char mask;
+
+   public:
+    BitSelector(Pt* _ptr, int offs) {
+      ptr = _ptr + (offs >> 3);
+      mask = (unsigned char)(0x80 >> (offs & 7));
+    }
+    bool clear() {
+      *ptr = (unsigned char)(*ptr & ~mask);
+      return false;
+    }
+    bool set() {
+      *ptr = (unsigned char)(*ptr | mask);
+      return true;
+    }
+    bool operator=(bool val) {
+      return val ? set() : clear();
+    }
+    operator bool() const {
+      return *ptr & mask;
+    }
+  };
+  BitSelector operator*() const {
+    return BitSelector{ptr, offs};
+  }
+  BitSelector operator[](int i) const {
+    return BitSelector{ptr, offs + i};
+  }
+  std::string to_hex(std::size_t len) const {
+    return bitstring::bits_to_hex(*this, len);
+  }
+  std::string to_binary(std::size_t len) const {
+    return bitstring::bits_to_binary(*this, len);
+  }
+};
+
+template <class Rf, class Pt>
+class BitSliceGen {
+  Rf ref;
+  Pt* ptr;
+  unsigned offs, len;
+
+ public:
+  struct BitSliceError {};
+  BitSliceGen() : ref(), ptr(0), offs(0), len(0) {
+  }
+  BitSliceGen(Rf _ref, Pt* _ptr, int _offs, unsigned _len)
+      : ref(std::move(_ref)), ptr(_ptr + (_offs >> 3)), offs(_offs & 7), len(_len) {
+  }
+  BitSliceGen(const BitSliceGen& bs, unsigned _offs, unsigned _len);
+  BitSliceGen(BitSliceGen&& bs, unsigned _offs, unsigned _len);
+  BitSliceGen(Pt* _ptr, unsigned _len) : ref(), ptr(_ptr), offs(0), len(_len) {
+  }
+  ~BitSliceGen() {
+  }
+  Pt* get_ptr() const {
+    return ptr;
+  }
+  BitPtrGen<Pt> bits() const {
+    return BitPtrGen<Pt>{ptr, (int)offs};
+  }
+  bool is_valid() const {
+    return ptr != 0;
+  }
+  unsigned char cur_byte() const {
+    return *ptr;
+  }
+  unsigned get_offs() const {
+    return offs;
+  }
+  unsigned size() const {
+    return len;
+  }
+  unsigned byte_size() const {
+    return (offs + len + 7) >> 3;
+  }
+  void ensure_throw(bool cond) const {
+    if (!cond) {
+      throw BitSliceError{};
+    }
+  }
+  BitSliceGen& assign(Rf _ref, Pt* _ptr, unsigned _offs, unsigned _len);
+  void forget() {
+    ref.clear();
+    ptr = 0;
+    offs = len = 0;
+  }
+  bool operator[](unsigned i) const {
+    i += offs;
+    return ptr[i >> 3] & (0x80 >> (i & 7));
+  }
+  bool at(unsigned i) const {
+    ensure_throw(i < len);
+    return operator[](i);
+  }
+  bool advance_bool(unsigned bits);
+  bool set_size_bool(unsigned bits) {
+    if (bits > len) {
+      return false;
+    }
+    len = bits;
+    return true;
+  }
+  BitSliceGen& advance(unsigned bits) {
+    ensure_throw(advance_bool(bits));
+    return *this;
+  }
+  BitSliceGen& set_size(unsigned bits) {
+    ensure_throw(set_size_bool(bits));
+    return *this;
+  }
+  BitSliceGen subslice(unsigned from, unsigned bits) const& {
+    return BitSliceGen(*this, from, bits);
+  }
+  BitSliceGen subslice(unsigned from, unsigned bits) && {
+    return BitSliceGen(*this, from, bits);
+  }
+  void copy_to(BitPtr to) const {
+    bitstring::bits_memcpy(to, bits(), size());
+  }
+  int compare(ConstBitPtr other) const {
+    return bitstring::bits_memcmp(bits(), other, size());
+  }
+  bool operator==(ConstBitPtr other) const {
+    return !compare(other);
+  }
+  bool operator!=(ConstBitPtr other) const {
+    return compare(other);
+  }
+  std::string to_binary() const {
+    return bitstring::bits_to_binary(ptr, offs, len);
+  }
+  std::string to_hex() const {
+    return bitstring::bits_to_hex(ptr, offs, len);
+  }
+  void dump(std::ostream& stream, bool nocr = false) const {
+    stream << "[" << offs << "," << len << "]";
+    if (!nocr) {
+      stream << std::endl;
+    }
+  }
+
+ protected:
+  inline Pt& cur_byte_w() const {
+    return *ptr;
+  }
+};
+
+template <class Rf, class Pt>
+BitSliceGen<Rf, Pt>::BitSliceGen(const BitSliceGen<Rf, Pt>& bs, unsigned from, unsigned bits) : ref() {
+  if (from >= bs.size() || bits > bs.size() - from) {
+    ptr = 0;
+    offs = len = 0;
+    return;
+  }
+  //bs.dump(std::cout, true);
+  //std::cout << ".subslice(" << from << "," << bits << ") = ";
+  ref = bs.ref;
+  offs = bs.offs + from;
+  ptr = bs.ptr + (offs >> 3);
+  offs &= 7;
+  len = bits;
+  //dump(std::cout);
+}
+
+template <class Rf, class Pt>
+BitSliceGen<Rf, Pt>::BitSliceGen(BitSliceGen&& bs, unsigned from, unsigned bits) : ref() {
+  if (from >= bs.size() || bits > bs.size() - from) {
+    ptr = 0;
+    offs = len = 0;
+    return;
+  }
+  ref = std::move(bs.ref);
+  offs = bs.offs + from;
+  ptr = bs.ptr + (offs >> 3);
+  offs &= 7;
+  len = bits;
+}
+
+template <class Rf, class Pt>
+BitSliceGen<Rf, Pt>& BitSliceGen<Rf, Pt>::assign(Rf _ref, Pt* _ptr, unsigned _offs, unsigned _len) {
+  ref = std::move(_ref);
+  ptr = _ptr + (_offs >> 3);
+  offs = (_offs & 7);
+  len = _len;
+  return *this;
+}
+
+template <class Rf, class Pt>
+inline bool BitSliceGen<Rf, Pt>::advance_bool(unsigned bits) {
+  if (len < bits) {
+    return false;
+  }
+  len -= bits;
+  offs += bits;
+  ptr += (offs >> 3);
+  offs &= 7;
+  return true;
+}
+
+typedef BitSliceGen<RefAny, const unsigned char> BitSlice;
+
+static inline std::string to_hex(const BitSlice& bs) {
+  return bs.to_hex();
+}
+
+static inline std::string to_binary(const BitSlice& bs) {
+  return bs.to_binary();
+}
+
+class BitSliceWrite : public BitSliceGen<RefAny, unsigned char> {
+ public:
+  struct LengthMismatch {};
+  BitSliceWrite(RefAny _ref, unsigned char* _ptr, unsigned _offs, unsigned _len)
+      : BitSliceGen<RefAny, unsigned char>(_ref, _ptr, _offs, _len) {
+  }
+  BitSliceWrite() : BitSliceGen<RefAny, unsigned char>() {
+  }
+  BitSliceWrite(unsigned char* _ptr, unsigned _len) : BitSliceGen<RefAny, unsigned char>(_ptr, _len) {
+  }
+  operator BitSlice&() {
+    return *reinterpret_cast<BitSlice*>(this);
+  }
+  operator const BitSlice&() const {
+    return *reinterpret_cast<const BitSlice*>(this);
+  }
+  const BitSliceWrite& operator=(const BitSlice& bs) const;
+  const BitSliceWrite& operator=(bool val) const;
+};
+
+class BitString : public CntObject {
+  unsigned char* ptr;
+  unsigned offs, len, bytes_alloc;
+
+ public:
+  BitString() : ptr(0), offs(0), len(0), bytes_alloc(0) {
+  }
+  explicit BitString(const BitSlice& bs, unsigned reserve_bits = 0);
+  explicit BitString(unsigned reserve_bits);
+
+  BitString(const BitString&) = delete;
+  BitString& operator=(const BitString&) = delete;
+  BitString(BitString&&) = delete;
+  BitString& operator=(BitString&&) = delete;
+  ~BitString() {
+    if (ptr) {
+      std::free(ptr);
+    }
+  }
+  operator BitSlice() const;
+  BitString* make_copy() const override;
+  unsigned size() const {
+    return len;
+  }
+  unsigned byte_size() const {
+    return (offs + len + 7) >> 3;
+  }
+  ConstBitPtr cbits() const {
+    return ConstBitPtr{ptr, (int)offs};
+  }
+  ConstBitPtr bits() const {
+    return ConstBitPtr{ptr, (int)offs};
+  }
+  BitPtr bits() {
+    return BitPtr{ptr, (int)offs};
+  }
+  BitString& reserve_bits(unsigned req_bits);
+  BitSliceWrite reserve_bitslice(unsigned req_bits);
+  BitString& append(const BitSlice& bs);
+  BitSlice subslice(unsigned from, unsigned bits) const;
+  BitSliceWrite subslice_write(unsigned from, unsigned bits);
+  std::string to_hex() const {
+    return bitstring::bits_to_hex(cbits(), size());
+  }
+  std::string to_binary() const {
+    return bitstring::bits_to_binary(cbits(), size());
+  }
+};
+
+extern std::ostream& operator<<(std::ostream& stream, const BitString& bs);
+extern std::ostream& operator<<(std::ostream& stream, Ref<BitString> bs_ref);
+
+extern template class Ref<BitString>;
+typedef Ref<BitString> BitStringRef;
+
+template <unsigned n>
+class BitArray {
+  static constexpr unsigned m = (n + 7) >> 3;
+  typedef std::array<unsigned char, m> byte_array_t;
+  typedef unsigned char raw_byte_array_t[m];
+  byte_array_t bytes;
+
+ public:
+  const unsigned char* data() const {
+    return bytes.data();
+  }
+  unsigned char* data() {
+    return bytes.data();
+  }
+  static unsigned size() {
+    return n;
+  }
+  const byte_array_t& as_array() const {
+    return bytes;
+  }
+  byte_array_t& as_array() {
+    return bytes;
+  }
+  Slice as_slice() const {
+    return Slice{data(), m};
+  }
+  MutableSlice as_slice() {
+    return MutableSlice{data(), m};
+  }
+  ConstBitPtr cbits() const {
+    return ConstBitPtr{data()};
+  }
+  ConstBitPtr bits() const {
+    return ConstBitPtr{data()};
+  }
+  BitPtr bits() {
+    return BitPtr{data()};
+  }
+  BitArray() = default;
+  BitArray(const BitArray&) = default;
+  BitArray(const byte_array_t& init_bytes) : bytes(init_bytes) {
+  }
+  explicit BitArray(const raw_byte_array_t init_bytes) {
+    std::memcpy(data(), init_bytes, m);
+  }
+  BitArray(ConstBitPtr from) {
+    bitstring::bits_memcpy(bits(), from, n);
+  }
+  template <int N = n, typename X = std::enable_if_t<N == n && N <= 64, int>>
+  explicit BitArray(long long val) {
+    bitstring::bits_store_long(bits(), val, n);
+  }
+  BitArray& operator=(const BitArray&) = default;
+  BitArray& operator=(const byte_array_t& set_bytes) {
+    bytes = set_bytes;
+    return *this;
+  }
+  BitArray& operator=(ConstBitPtr from) {
+    bitstring::bits_memcpy(bits(), from, n);
+    return *this;
+  }
+  BitArray& operator=(const raw_byte_array_t set_byte_array) {
+    std::memcpy(data(), set_byte_array, m);
+    return *this;
+  }
+  BitSliceWrite write_bitslice() {
+    return BitSliceWrite{data(), n};
+  }
+  BitSlice as_bitslice() const {
+    return BitSlice{data(), n};
+  }
+  //operator BitString() const {
+  //return BitString{as_bitslice()};
+  //}
+  Ref<BitString> make_bitstring_ref() const {
+    return td::make_ref<BitString>(as_bitslice());
+  }
+  unsigned long long to_ulong() const {
+    return bitstring::bits_load_ulong(bits(), n);
+  }
+  long long to_long() const {
+    return bitstring::bits_load_long(bits(), n);
+  }
+  void store_ulong(unsigned long long val) {
+    bitstring::bits_store_long(bits(), val, n);
+  }
+  void store_long(long long val) {
+    bitstring::bits_store_long(bits(), val, n);
+  }
+  void set_same(bool v) {
+    bytes.fill(static_cast<unsigned char>(v ? -1 : 0));
+  }
+  void set_zero() {
+    set_same(0);
+  }
+  void set_zero_s() {
+    volatile uint8* p = data();
+    auto x = m;
+    while (x--) {
+      *p++ = 0;
+    }
+  }
+  void set_ones() {
+    set_same(1);
+  }
+  void clear() {
+    set_zero();
+  }
+  bool is_zero() const {
+    return bitstring::bits_memscan(cbits(), n, 0) == n;
+  }
+  std::string to_hex() const {
+    return bitstring::bits_to_hex(cbits(), size());
+  }
+  std::string to_binary() const {
+    return bitstring::bits_to_binary(cbits(), size());
+  }
+  int compare(const BitArray& other) const {
+    return (n % 8 == 0) ? std::memcmp(data(), other.data(), n / 8) : bitstring::bits_memcmp(bits(), other.bits(), n);
+  }
+  bool operator==(const BitArray& other) const {
+    return (n % 8 == 0) ? (bytes == other.bytes) : !bitstring::bits_memcmp(bits(), other.bits(), n);
+  }
+  bool operator!=(const BitArray& other) const {
+    return (n % 8 == 0) ? (bytes != other.bytes) : bitstring::bits_memcmp(bits(), other.bits(), n);
+  }
+  bool operator<(const BitArray& other) const {
+    return (n % 8 == 0) ? (bytes < other.bytes) : (bitstring::bits_memcmp(bits(), other.bits(), n) < 0);
+  }
+  int compare(ConstBitPtr other) const {
+    return bitstring::bits_memcmp(bits(), other, n);
+  }
+  bool operator==(ConstBitPtr other) const {
+    return !compare(other);
+  }
+  bool operator!=(ConstBitPtr other) const {
+    return compare(other);
+  }
+  BitPtr::BitSelector operator[](int i) {
+    return bits()[i];
+  }
+  bool operator[](int i) const {
+    return cbits()[i];
+  }
+  void compute_sha256(BitPtr to) const {
+    bitstring::bits_sha256(to, cbits(), n);
+  }
+  void compute_sha256(BitArray<256>& to) const {
+    bitstring::bits_sha256(to.bits(), cbits(), n);
+  }
+  static inline BitArray zero() {
+    BitArray x;
+    x.set_zero();
+    return x;
+  }
+  static inline BitArray ones() {
+    BitArray x;
+    x.set_ones();
+    return x;
+  }
+  BitArray operator^(const BitArray& with) const {
+    BitArray res;
+    for (unsigned i = 0; i < m; i++) {
+      res.bytes[i] = bytes[i] ^ with.bytes[i];
+    }
+    return res;
+  }
+  unsigned scan(bool value) const {
+    return (unsigned)cbits().scan(value, n);
+  }
+  unsigned count_leading_zeroes() const {
+    return scan(false);
+  }
+  unsigned count_matching(ConstBitPtr other) const {
+    std::size_t cnt;
+    bitstring::bits_memcmp(cbits(), other, n, &cnt);
+    return (unsigned)cnt;
+  }
+  unsigned count_matching(const BitArray& other) const {
+    return count_matching(other.bits());
+  }
+};
+
+using Bits256 = BitArray<256>;
+using Bits128 = BitArray<128>;
+
+template <unsigned n>
+std::ostream& operator<<(std::ostream& stream, BitArray<n> bits) {
+  return stream << bits.to_hex();
+}
+
+template <unsigned N>
+Slice as_slice(const BitArray<N>& value) {
+  return value.as_slice();
+}
+
+template <unsigned N>
+MutableSlice as_slice(BitArray<N>& value) {
+  return value.as_slice();
+}
+
+template <unsigned N>
+Ref<BitString> make_bitstring_ref(const BitArray<N>& value) {
+  return value.make_bitstring_ref();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/common/refcnt.cpp b/submodules/ton/tonlib-src/crypto/common/refcnt.cpp
new file mode 100644
index 0000000000..5b95c8f3e4
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/common/refcnt.cpp
@@ -0,0 +1,55 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "refcnt.hpp"
+
+#include "td/utils/ScopeGuard.h"
+
+namespace td {
+namespace detail {
+struct SafeDeleter {
+ public:
+  void retire(const CntObject *ptr) {
+    if (is_active_) {
+      to_delete_.push_back(ptr);
+      return;
+    }
+    is_active_ = true;
+    SCOPE_EXIT {
+      is_active_ = false;
+    };
+    delete ptr;
+    while (!to_delete_.empty()) {
+      auto *ptr = to_delete_.back();
+      to_delete_.pop_back();
+      delete ptr;
+    }
+  }
+
+ private:
+  std::vector<const CntObject *> to_delete_;
+  bool is_active_{false};
+};
+
+TD_THREAD_LOCAL SafeDeleter *deleter;
+void safe_delete(const CntObject *ptr) {
+  init_thread_local<SafeDeleter>(deleter);
+  deleter->retire(ptr);
+}
+}  // namespace detail
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/common/refcnt.hpp b/submodules/ton/tonlib-src/crypto/common/refcnt.hpp
new file mode 100644
index 0000000000..08a584124b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/common/refcnt.hpp
@@ -0,0 +1,474 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <cassert>
+#include <utility>
+#include <atomic>
+#include <iostream>
+
+#include "td/utils/StringBuilder.h"
+#include "td/utils/logging.h"
+
+namespace td {
+
+template <class T>
+class Ref;
+
+class CntObject {
+ private:
+  mutable std::atomic<int> cnt_;
+  template <class T>
+  friend class Ref;
+
+  void inc() const {
+    cnt_.fetch_add(1, std::memory_order_relaxed);
+  }
+  bool dec() const {
+    return cnt_.fetch_sub(1, std::memory_order_acq_rel) == 1;
+  }
+  void inc(int cnt) const {
+    cnt_.fetch_add(cnt, std::memory_order_relaxed);
+  }
+  bool dec(int cnt) const {
+    return cnt_.fetch_sub(cnt, std::memory_order_acq_rel) == cnt;
+  }
+
+ public:
+  struct WriteError {};
+  CntObject() : cnt_(1) {
+  }
+  CntObject(const CntObject& other) : CntObject() {
+  }
+  CntObject(CntObject&& other) : CntObject() {
+  }
+  CntObject& operator=(const CntObject& other) {
+    return *this;
+  }
+  CntObject& operator=(CntObject&& other) {
+    return *this;
+  }
+  virtual ~CntObject() {
+    auto cnt = cnt_.load(std::memory_order_relaxed);
+    (void)cnt;
+    //TODO: assert(cnt == 0) will fail if object is allocated on stack
+    assert(cnt == 0 || cnt == 1);
+  }
+  virtual CntObject* make_copy() const {
+    throw WriteError();
+  }
+  bool is_unique() const {
+    return cnt_.load(std::memory_order_acquire) == 1;
+  }
+  int get_refcnt() const {
+    // use std::memory_order_acquire
+    return cnt_.load(std::memory_order_acquire);
+  }
+  void assert_unique() const {
+    assert(is_unique());
+  }
+};
+
+typedef Ref<CntObject> RefAny;
+
+template <class T>
+class Cnt : public CntObject {
+  T value;
+
+ public:
+  template <typename... Args>
+  Cnt(Args&&... args) : value(std::forward<Args>(args)...) {
+    ///std::cout << "(N " << (void*)this << ")";
+  }
+  Cnt(const Cnt& x) : CntObject(), value(x.value) {
+    ///std::cout << "(C)";
+  }
+  virtual ~Cnt() {
+    ///std::cout << "(D " << (void*)this << ")";
+  }
+  T* operator->() {
+    return &value;
+  }
+  const T* operator->() const {
+    return &value;
+  }
+  T& operator*() {
+    return value;
+  }
+  const T& operator*() const {
+    return value;
+  }
+  Cnt* make_copy() const override {
+    ///std::cout << "(c " << (const void*)this << ")";
+    return new Cnt{value};
+  }
+};
+
+template <class T>
+struct RefValue {
+  using Type = T;
+  static Type& make_ref(T* ptr) {
+    return *ptr;
+  }
+  static const Type& make_const_ref(const T* ptr) {
+    return *ptr;
+  }
+  static Type* make_ptr(T* ptr) {
+    return ptr;
+  }
+  static const Type* make_const_ptr(const T* ptr) {
+    return ptr;
+  }
+};
+
+template <class T>
+struct RefValue<Cnt<T>> {
+  using Type = T;
+  static Type& make_ref(Cnt<T>* ptr) {
+    return **ptr;
+  }
+  static const Type& make_const_ref(const Cnt<T>* ptr) {
+    return **ptr;
+  }
+  static Type* make_ptr(Cnt<T>* ptr) {
+    return &(**ptr);
+  }
+  static const Type* make_const_ptr(const Cnt<T>* ptr) {
+    return &(**ptr);
+  }
+};
+
+struct static_cast_ref {};
+
+namespace detail {
+void safe_delete(const CntObject* ptr);
+}
+template <class T>
+class Ref {
+  T* ptr;
+
+  template <class S>
+  friend class Ref;
+
+ public:
+  struct NullRef {};
+  Ref() : ptr(0) {
+  }
+  //explicit Ref(bool init) : ptr(init ? new T : 0) {
+  //}
+  template <typename... Args>
+  explicit Ref(bool init, Args&&... args) : ptr(0) {
+    //assert(init);
+    ptr = new T(std::forward<Args>(args)...);
+  }
+  /*
+  explicit Ref(const T& c) : ptr(&c) {
+    ptr.inc();
+  }
+  */
+  explicit Ref(T* pc) : ptr(pc) {
+    if (ptr) {
+      acquire_shared(ptr);
+    }
+  }
+  explicit Ref(const T* pc) : ptr(const_cast<T*>(pc)) {
+    if (ptr) {
+      acquire_shared(ptr);
+    }
+  }
+  explicit Ref(const T& obj) : ptr(obj.make_copy()) {
+  }
+  Ref(const Ref& r) : ptr(r.ptr) {
+    if (ptr) {
+      acquire_shared(ptr);
+      ///std::cout << "(rc+ " << (const void*)ptr << ")";
+    }
+  }
+  Ref(Ref&& r) noexcept : ptr(std::move(r.ptr)) {
+    r.ptr = 0;
+  }
+
+  T* release() {
+    auto res = ptr;
+    ptr = nullptr;
+    return res;
+  }
+  struct acquire_t {};
+  Ref(T* ptr, acquire_t) : ptr(ptr) {
+  }
+
+  template <class S>
+  Ref(const Ref<S>& r, std::enable_if_t<std::is_base_of<T, S>::value, int> t = 0) : ptr(static_cast<T*>(r.ptr)) {
+    static_assert(std::is_base_of<T, S>::value, "Invalid static Ref conversion");
+    if (ptr) {
+      acquire_shared(ptr);
+    }
+  }
+
+  template <class S>
+  explicit Ref(const Ref<S>& r,
+               std::enable_if_t<!std::is_base_of<T, S>::value && std::is_base_of<S, T>::value, int> t = 0)
+      : ptr(dynamic_cast<T*>(r.ptr)) {
+    static_assert(std::is_base_of<S, T>::value, "Invalid dynamic Ref conversion");
+    if (ptr) {
+      acquire_shared(ptr);
+      //std::cout << "(rv+ " << (const void*)ptr << ")";
+    } else {
+      //std::cout << "(error converting " << (const void*)r.ptr << ")";
+    }
+  }
+
+  template <class S>
+  Ref(static_cast_ref, const Ref<S>& r, std::enable_if_t<std::is_base_of<S, T>::value, int> t = 0)
+      : ptr(static_cast<T*>(r.ptr)) {
+    static_assert(std::is_base_of<S, T>::value, "Invalid static Ref downcast");
+    if (r.ptr) {
+      acquire_shared(ptr);
+    } else {
+      ptr = nullptr;
+    }
+  }
+
+  template <class S>
+  Ref(Ref<S>&& r, std::enable_if_t<std::is_base_of<T, S>::value, int> t = 0) : ptr(static_cast<T*>(r.ptr)) {
+    static_assert(std::is_base_of<T, S>::value, "Invalid static Ref conversion");
+    r.ptr = nullptr;
+  }
+
+  template <class S>
+  explicit Ref(Ref<S>&& r, std::enable_if_t<!std::is_base_of<T, S>::value && std::is_base_of<S, T>::value, int> t = 0)
+      : ptr(dynamic_cast<T*>(r.ptr)) {
+    static_assert(std::is_base_of<S, T>::value, "Invalid dynamic Ref conversion");
+    if (!ptr && r.ptr) {
+      release_shared(r.ptr);
+    }
+    r.ptr = nullptr;
+  }
+
+  template <class S>
+  Ref(static_cast_ref, Ref<S>&& r, std::enable_if_t<std::is_base_of<S, T>::value, int> t = 0) noexcept
+      : ptr(static_cast<T*>(r.ptr)) {
+    static_assert(std::is_base_of<S, T>::value, "Invalid static Ref downcast");
+    if (r.ptr) {
+      r.ptr = nullptr;
+    } else {
+      ptr = nullptr;
+    }
+  }
+
+  ~Ref() {
+    clear();
+  }
+  Ref& operator=(const Ref& r);
+  template <class S>
+  Ref& operator=(const Ref<S>& r);
+  Ref& operator=(Ref&& r);
+  template <class S>
+  Ref& operator=(Ref<S>&& r);
+  const typename RefValue<T>::Type* operator->() const {
+    if (!ptr) {
+      CHECK(ptr && "deferencing null Ref");
+      throw NullRef{};
+    }
+    return RefValue<T>::make_const_ptr(ptr);
+  }
+  const typename RefValue<T>::Type& operator*() const {
+    if (!ptr) {
+      CHECK(ptr && "deferencing null Ref");
+      throw NullRef{};
+    }
+    return RefValue<T>::make_const_ref(ptr);
+  }
+  const T* get() const {
+    return ptr;
+  }
+  bool is_null() const {
+    return ptr == 0;
+  }
+  bool not_null() const {
+    return ptr != 0;
+  }
+  bool is_unique() const {
+    if (!ptr) {
+      CHECK(ptr && "defererencing null Ref");
+      throw NullRef{};
+    }
+    return ptr->is_unique();
+  }
+  void clear() {
+    if (ptr) {
+      ///std::cout << "(r- " << (const void*)ptr << ")";
+      release_shared(ptr);
+      ptr = 0;
+    }
+  }
+  void swap(Ref& r) {
+    std::swap(ptr, r.ptr);
+  }
+  Ref& operator^=(const Ref& r);
+  Ref& operator^=(Ref&& r);
+  Ref& operator&=(bool retain);
+  bool operator==(const Ref& r) const;
+  bool operator!=(const Ref& r) const;
+  typename RefValue<T>::Type& write();
+  typename RefValue<T>::Type& unique_write() const;
+
+ public:
+  template <class S>
+  static void release_shared(S* obj, int cnt = 1) {
+    if (obj->dec(cnt)) {
+      detail::safe_delete(obj);
+    }
+  }
+  template <class S>
+  static void acquire_shared(S* obj, int cnt = 1) {
+    obj->inc(cnt);
+  }
+
+ private:
+  void assign(T* p) {
+    ptr = p;
+    if (p) {
+      acquire_shared(p);
+      ///std::cout << "(r+ " << (const void*)ptr << ")";
+    }
+  }
+};
+
+template <class T, typename... Args>
+Ref<T> make_ref(Args&&... args) {
+  return Ref<T>{true, std::forward<Args>(args)...};
+}
+
+template <class T, typename... Args>
+Ref<Cnt<T>> make_cnt_ref(Args&&... args) {
+  return Ref<Cnt<T>>{true, std::forward<Args>(args)...};
+}
+
+template <class T>
+td::StringBuilder& operator<<(td::StringBuilder& sb, const Ref<T>& ref) {
+  if (ref.is_null()) {
+    return sb << "nullptr";
+  }
+  return sb << *ref;
+}
+
+template <class T>
+Ref<T>& Ref<T>::operator=(const Ref<T>& r) {
+  if (ptr != r.ptr) {
+    clear();
+    assign(r.ptr);
+  }
+  return *this;
+}
+
+template <class T>
+template <class S>
+Ref<T>& Ref<T>::operator=(const Ref<S>& r) {
+  if (ptr != static_cast<T*>(r.ptr)) {
+    clear();
+    assign(r.ptr);
+  }
+  return *this;
+}
+
+template <class T>
+Ref<T>& Ref<T>::operator=(Ref<T>&& r) {
+  clear();
+  ptr = r.ptr;
+  r.ptr = 0;
+  return *this;
+}
+
+template <class T>
+template <class S>
+Ref<T>& Ref<T>::operator=(Ref<S>&& r) {
+  clear();
+  ptr = r.ptr;
+  r.ptr = 0;
+  return *this;
+}
+
+template <class T>
+typename RefValue<T>::Type& Ref<T>::write() {
+  if (!ptr) {
+    throw CntObject::WriteError();
+  }
+  if (!ptr->is_unique()) {
+    T* copy = dynamic_cast<T*>(ptr->make_copy());
+    if (!copy) {
+      throw CntObject::WriteError();
+    }
+    release_shared(ptr);
+    ptr = copy;
+  }
+  return RefValue<T>::make_ref(ptr);
+}
+
+template <class T>
+typename RefValue<T>::Type& Ref<T>::unique_write() const {
+  if (!ptr || !ptr->is_unique()) {
+    throw CntObject::WriteError();
+  }
+  return RefValue<T>::make_ref(ptr);
+}
+
+template <class T>
+Ref<T>& Ref<T>::operator^=(const Ref<T>& r) {
+  if (r.ptr && r.ptr != ptr) {
+    clear();
+    assign(r.ptr);
+  }
+  return *this;
+}
+
+template <class T>
+Ref<T>& Ref<T>::operator^=(Ref<T>&& r) {
+  if (r.ptr && r.ptr != ptr) {
+    clear();
+    ptr = r.ptr;
+    r.ptr = 0;
+  }
+  return *this;
+}
+
+template <class T>
+Ref<T>& Ref<T>::operator&=(bool retain) {
+  if (!retain && ptr) {
+    clear();
+  }
+  return *this;
+}
+
+template <class T>
+bool Ref<T>::operator==(const Ref<T>& r) const {
+  return ptr == r.ptr;
+}
+
+template <class T>
+bool Ref<T>::operator!=(const Ref<T>& r) const {
+  return ptr != r.ptr;
+}
+
+template <class T>
+void swap(Ref<T>& r1, Ref<T>& r2) {
+  r1.swap(r2);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/common/refint.cpp b/submodules/ton/tonlib-src/crypto/common/refint.cpp
new file mode 100644
index 0000000000..662322c62b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/common/refint.cpp
@@ -0,0 +1,321 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "common/refint.h"
+#include <utility>
+#include <iostream>
+
+#include "td/utils/StringBuilder.h"
+#include "td/utils/Slice.h"
+
+namespace td {
+
+template class Cnt<BigInt256>;
+template class Ref<Cnt<BigInt256>>;
+
+RefInt256 operator+(RefInt256 x, RefInt256 y) {
+  (x.write() += *y).normalize();
+  return x;
+}
+
+RefInt256 operator+(RefInt256 x, long long y) {
+  x.write().add_tiny(y).normalize();
+  return x;
+}
+
+RefInt256 operator-(RefInt256 x, RefInt256 y) {
+  (x.write() -= *y).normalize();
+  return x;
+}
+
+RefInt256 operator-(RefInt256 x, long long y) {
+  x.write().add_tiny(-y).normalize();
+  return x;
+}
+
+RefInt256 operator-(RefInt256 x) {
+  x.write().negate().normalize();
+  return x;
+}
+
+RefInt256 operator~(RefInt256 x) {
+  x.write().logical_not().normalize();
+  return x;
+}
+
+RefInt256 operator*(RefInt256 x, RefInt256 y) {
+  RefInt256 z{true, 0};
+  z.write().add_mul(*x, *y).normalize();
+  return z;
+}
+
+RefInt256 operator*(RefInt256 x, long long y) {
+  x.write().mul_short_opt(y).normalize();
+  return x;
+}
+
+RefInt256 operator/(RefInt256 x, RefInt256 y) {
+  RefInt256 quot{true};
+  x.write().mod_div(*y, quot.write());
+  quot.write().normalize();
+  return quot;
+}
+
+RefInt256 div(RefInt256 x, RefInt256 y, int round_mode) {
+  RefInt256 quot{true};
+  x.write().mod_div(*y, quot.write(), round_mode);
+  quot.write().normalize();
+  return quot;
+}
+
+RefInt256 operator%(RefInt256 x, RefInt256 y) {
+  BigInt256 quot;
+  x.write().mod_div(*y, quot);
+  return x;
+}
+
+RefInt256 mod(RefInt256 x, RefInt256 y, int round_mode) {
+  BigInt256 quot;
+  x.write().mod_div(*y, quot, round_mode);
+  return x;
+}
+
+std::pair<RefInt256, RefInt256> divmod(RefInt256 x, RefInt256 y, int round_mode) {
+  RefInt256 quot{true};
+  x.write().mod_div(*y, quot.write(), round_mode);
+  quot.write().normalize();
+  return std::make_pair(std::move(quot), std::move(x));
+}
+
+RefInt256 operator&(RefInt256 x, RefInt256 y) {
+  x.write() &= *y;
+  return x;
+}
+
+RefInt256 operator|(RefInt256 x, RefInt256 y) {
+  x.write() |= *y;
+  return x;
+}
+
+RefInt256 operator^(RefInt256 x, RefInt256 y) {
+  x.write() ^= *y;
+  return x;
+}
+
+RefInt256 operator<<(RefInt256 x, int y) {
+  (x.write() <<= y).normalize();
+  return x;
+}
+
+RefInt256 operator>>(RefInt256 x, int y) {
+  (x.write() >>= y).normalize();
+  return x;
+}
+
+RefInt256 rshift(RefInt256 x, int y, int round_mode) {
+  x.write().rshift(y, round_mode).normalize();
+  return x;
+}
+
+RefInt256& operator+=(RefInt256& x, RefInt256 y) {
+  (x.write() += *y).normalize();
+  return x;
+}
+
+RefInt256& operator+=(RefInt256& x, long long y) {
+  x.write().add_tiny(y).normalize();
+  return x;
+}
+
+RefInt256& operator-=(RefInt256& x, RefInt256 y) {
+  (x.write() -= *y).normalize();
+  return x;
+}
+
+RefInt256& operator-=(RefInt256& x, long long y) {
+  x.write().add_tiny(-y).normalize();
+  return x;
+}
+
+RefInt256& operator*=(RefInt256& x, RefInt256 y) {
+  RefInt256 z{true, 0};
+  z.write().add_mul(*x, *y).normalize();
+  return x = z;
+}
+
+RefInt256& operator*=(RefInt256& x, long long y) {
+  x.write().mul_short_opt(y).normalize();
+  return x;
+}
+
+RefInt256& operator/=(RefInt256& x, RefInt256 y) {
+  RefInt256 quot{true};
+  x.write().mod_div(*y, quot.write());
+  quot.write().normalize();
+  return x = quot;
+}
+
+RefInt256& operator%=(RefInt256& x, RefInt256 y) {
+  BigInt256 quot;
+  x.write().mod_div(*y, quot);
+  return x;
+}
+
+RefInt256& operator&=(RefInt256& x, RefInt256 y) {
+  x.write() &= *y;
+  return x;
+}
+
+RefInt256& operator|=(RefInt256& x, RefInt256 y) {
+  x.write() |= *y;
+  return x;
+}
+
+RefInt256& operator^=(RefInt256& x, RefInt256 y) {
+  x.write() ^= *y;
+  return x;
+}
+
+RefInt256& operator<<=(RefInt256& x, int y) {
+  (x.write() <<= y).normalize();
+  return x;
+}
+
+RefInt256& operator>>=(RefInt256& x, int y) {
+  (x.write() >>= y).normalize();
+  return x;
+}
+
+int cmp(RefInt256 x, RefInt256 y) {
+  return x->cmp(*y);
+}
+
+int cmp(RefInt256 x, long long y) {
+  return x->cmp(y);
+}
+
+int sgn(RefInt256 x) {
+  return x->sgn();
+}
+
+extern RefInt256 make_refint(long long x) {
+  auto xx = td::RefInt256{true, x};
+  xx.unique_write().normalize();
+  return xx;
+}
+
+std::string dec_string(RefInt256 x) {
+  return x.is_null() ? "(null)" : (x.is_unique() ? x.unique_write().to_dec_string_destroy() : x->to_dec_string());
+}
+
+std::string dec_string2(RefInt256&& x) {
+  return x.is_null() ? "(null)" : (x.is_unique() ? x.unique_write().to_dec_string_destroy() : x->to_dec_string());
+}
+
+std::string hex_string(RefInt256 x, bool upcase) {
+  return x.is_null() ? "(null)" : x->to_hex_string(upcase);
+}
+
+std::string binary_string(RefInt256 x) {
+  return x.is_null() ? "(null)" : x->to_binary_string();
+}
+
+std::ostream& operator<<(std::ostream& os, const RefInt256& x) {
+  //std::cout << "<a|";
+  return os << dec_string(std::move(x));
+  //std::cout << "|a>";
+  //return os;
+}
+
+std::ostream& operator<<(std::ostream& os, RefInt256&& x) {
+  //std::cout << "<A|";
+  return os << dec_string2(std::move(x));
+  //std::cout << "|A>";
+  //return os;
+}
+
+StringBuilder& operator<<(StringBuilder& sb, const RefInt256& x) {
+  return sb << dec_string(x);
+}
+
+RefInt256 dec_string_to_int256(const std::string& s) {
+  return dec_string_to_int256(td::Slice{s});
+}
+
+RefInt256 dec_string_to_int256(td::Slice s) {
+  if (s.size() > 255) {
+    return {};
+  }
+  RefInt256 x{true};
+  if (x.unique_write().parse_dec(s.begin(), (int)s.size()) == (int)s.size()) {
+    return x;
+  } else {
+    return {};
+  }
+}
+
+RefInt256 hex_string_to_int256(const std::string& s) {
+  return hex_string_to_int256(td::Slice{s});
+}
+
+RefInt256 hex_string_to_int256(td::Slice s) {
+  if (s.size() > 255) {
+    return {};
+  }
+  RefInt256 x{true};
+  if (x.unique_write().parse_hex(s.begin(), (int)s.size()) == (int)s.size()) {
+    return x;
+  } else {
+    return {};
+  }
+}
+
+RefInt256 string_to_int256(const std::string& s) {
+  return string_to_int256(td::Slice{s});
+}
+
+RefInt256 string_to_int256(td::Slice s) {
+  if (s.size() >= 3 && s[0] == '-' && s[1] == '0' && s[2] == 'x') {
+    auto x = hex_string_to_int256(td::Slice(s.begin() + 3, s.end()));
+    if (x.not_null()) {
+      x.write().negate();
+    }
+    return x;
+  } else if (s.size() >= 2 && s[0] == '0' && s[1] == 'x') {
+    return hex_string_to_int256(td::Slice(s.begin() + 2, s.end()));
+  } else {
+    return dec_string_to_int256(s);
+  }
+}
+
+namespace literals {
+
+RefInt256 operator""_ri256(const char* str, std::size_t str_len) {
+  RefInt256 x{true};
+  x->enforce(x.unique_write().parse_dec(str, (int)str_len) == (int)str_len);
+  return x;
+}
+
+RefInt256 operator""_rx256(const char* str, std::size_t str_len) {
+  RefInt256 x{true};
+  x->enforce(x.unique_write().parse_hex(str, (int)str_len) == (int)str_len);
+  return x;
+}
+
+}  // namespace literals
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/common/refint.h b/submodules/ton/tonlib-src/crypto/common/refint.h
new file mode 100644
index 0000000000..a828caf162
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/common/refint.h
@@ -0,0 +1,127 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "common/refcnt.hpp"
+#include "common/bigint.hpp"
+#include <utility>
+#include <string>
+
+namespace td {
+class StringBuilder;
+
+extern template class Cnt<BigInt256>;
+extern template class Ref<Cnt<BigInt256>>;
+typedef Cnt<BigInt256> CntInt256;
+typedef Ref<CntInt256> RefInt256;
+
+extern RefInt256 operator+(RefInt256 x, RefInt256 y);
+extern RefInt256 operator+(RefInt256 x, long long y);
+extern RefInt256 operator-(RefInt256 x, RefInt256 y);
+extern RefInt256 operator-(RefInt256 x, long long y);
+extern RefInt256 operator*(RefInt256 x, RefInt256 y);
+extern RefInt256 operator*(RefInt256 x, long long y);
+extern RefInt256 operator/(RefInt256 x, RefInt256 y);
+extern RefInt256 operator%(RefInt256 x, RefInt256 y);
+extern RefInt256 div(RefInt256 x, RefInt256 y, int round_mode = -1);
+extern RefInt256 mod(RefInt256 x, RefInt256 y, int round_mode = -1);
+extern std::pair<RefInt256, RefInt256> divmod(RefInt256 x, RefInt256 y, int round_mode = -1);
+extern RefInt256 operator-(RefInt256 x);
+extern RefInt256 operator&(RefInt256 x, RefInt256 y);
+extern RefInt256 operator|(RefInt256 x, RefInt256 y);
+extern RefInt256 operator^(RefInt256 x, RefInt256 y);
+extern RefInt256 operator~(RefInt256 x);
+extern RefInt256 operator<<(RefInt256 x, int y);
+extern RefInt256 operator>>(RefInt256 x, int y);
+extern RefInt256 rshift(RefInt256 x, int y, int round_mode = -1);
+
+extern RefInt256& operator+=(RefInt256& x, RefInt256 y);
+extern RefInt256& operator+=(RefInt256& x, long long y);
+extern RefInt256& operator-=(RefInt256& x, RefInt256 y);
+extern RefInt256& operator-=(RefInt256& x, long long y);
+extern RefInt256& operator*=(RefInt256& x, RefInt256 y);
+extern RefInt256& operator*=(RefInt256& x, long long y);
+extern RefInt256& operator/=(RefInt256& x, RefInt256 y);
+extern RefInt256& operator%=(RefInt256& x, RefInt256 y);
+
+extern RefInt256& operator&=(RefInt256& x, RefInt256 y);
+extern RefInt256& operator|=(RefInt256& x, RefInt256 y);
+extern RefInt256& operator^=(RefInt256& x, RefInt256 y);
+extern RefInt256& operator<<=(RefInt256& x, int y);
+extern RefInt256& operator>>=(RefInt256& x, int y);
+
+template <typename T>
+bool operator==(RefInt256 x, T y) {
+  return cmp(x, y) == 0;
+}
+
+template <typename T>
+bool operator!=(RefInt256 x, T y) {
+  return cmp(x, y) != 0;
+}
+
+template <typename T>
+bool operator<(RefInt256 x, T y) {
+  return cmp(x, y) < 0;
+}
+
+template <typename T>
+bool operator>(RefInt256 x, T y) {
+  return cmp(x, y) > 0;
+}
+
+template <typename T>
+bool operator<=(RefInt256 x, T y) {
+  return cmp(x, y) <= 0;
+}
+
+template <typename T>
+bool operator>=(RefInt256 x, T y) {
+  return cmp(x, y) >= 0;
+}
+
+extern int cmp(RefInt256 x, RefInt256 y);
+extern int cmp(RefInt256 x, long long y);
+extern int sgn(RefInt256 x);
+
+extern RefInt256 make_refint(long long x);
+
+extern std::string dec_string(RefInt256 x);
+extern std::string dec_string2(RefInt256&& x);
+extern std::string hex_string(RefInt256 x, bool upcase = false);
+extern std::string binary_string(RefInt256 x);
+
+extern RefInt256 dec_string_to_int256(const std::string& s);
+extern RefInt256 dec_string_to_int256(td::Slice s);
+extern RefInt256 hex_string_to_int256(const std::string& s);
+extern RefInt256 hex_string_to_int256(td::Slice s);
+extern RefInt256 string_to_int256(const std::string& s);
+extern RefInt256 string_to_int256(td::Slice s);
+
+extern std::ostream& operator<<(std::ostream& os, const RefInt256& x);
+extern std::ostream& operator<<(std::ostream& os, RefInt256&& x);
+extern td::StringBuilder& operator<<(td::StringBuilder& os, const RefInt256& x);
+
+namespace literals {
+
+extern RefInt256 operator""_ri256(const char* str, std::size_t str_len);
+extern RefInt256 operator""_rx256(const char* str, std::size_t str_len);
+
+}  // namespace literals
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/common/util.cpp b/submodules/ton/tonlib-src/crypto/common/util.cpp
new file mode 100644
index 0000000000..721181524d
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/common/util.cpp
@@ -0,0 +1,212 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "util.h"
+
+#include <limits>
+
+namespace td {
+
+std::size_t compute_base64_encoded_size(size_t bindata_size) {
+  return ((bindata_size + 2) / 3) << 2;
+}
+
+const char base64_table[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+const char base64_url_table[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_";
+const unsigned char base64_dec_table[256] = {
+    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,    0,    0,    0,    0,    0x7e, 0,    0xbe, 0,    0x7f, 0xf4, 0xf5, 0xf6, 0xf7, 0xf8, 0xf9, 0xfa, 0xfb, 0xfc,
+    0xfd, 0,    0,    0,    1,    0,    0,    0,    0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5, 0xc6, 0xc7, 0xc8, 0xc9, 0xca,
+    0xcb, 0xcc, 0xcd, 0xce, 0xcf, 0xd0, 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6, 0xd7, 0xd8, 0xd9, 0,    0,    0,    0,
+    0xbf, 0,    0xda, 0xdb, 0xdc, 0xdd, 0xde, 0xdf, 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, 0xe8, 0xe9, 0xea,
+    0xeb, 0xec, 0xed, 0xee, 0xef, 0xf0, 0xf1, 0xf2, 0xf3, 0,    0,    0,    0,    0};
+
+std::size_t buff_base64_encode(td::MutableSlice buffer, td::Slice raw, bool base64_url) {
+  std::size_t orig_size = raw.size(), res_size = compute_base64_encoded_size(orig_size);
+  if (res_size > buffer.size()) {
+    return 0;
+  }
+  const char *table = base64_url ? base64_url_table : base64_table;
+  char *wptr = buffer.data();
+  unsigned x;
+  std::size_t i;
+  for (i = 0; i < orig_size - 2; i += 3) {
+    x = (((unsigned)(unsigned char)raw[i]) << 16) | (((unsigned)(unsigned char)raw[i + 1]) << 8) |
+        ((unsigned)(unsigned char)raw[i + 2]);
+    *wptr++ = table[(x >> 18) & 0x3f];
+    *wptr++ = table[(x >> 12) & 0x3f];
+    *wptr++ = table[(x >> 6) & 0x3f];
+    *wptr++ = table[x & 0x3f];
+  }
+  switch (orig_size - i) {
+    case 1:
+      x = (((unsigned)(unsigned char)raw[i]) << 16);
+      *wptr++ = table[(x >> 18) & 0x3f];
+      *wptr++ = table[(x >> 12) & 0x3f];
+      *wptr++ = '=';
+      *wptr++ = '=';
+      break;
+    case 2:
+      x = (((unsigned)(unsigned char)raw[i]) << 16) | (((unsigned)(unsigned char)raw[i + 1]) << 8);
+      *wptr++ = table[(x >> 18) & 0x3f];
+      *wptr++ = table[(x >> 12) & 0x3f];
+      *wptr++ = table[(x >> 6) & 0x3f];
+      *wptr++ = '=';
+  }
+  CHECK(wptr == buffer.data() + res_size);
+  return res_size;
+}
+
+std::string str_base64_encode(std::string raw, bool base64_url) {
+  return str_base64_encode(td::Slice{raw}, base64_url);
+}
+
+std::string str_base64_encode(td::Slice raw, bool base64_url) {
+  std::size_t res_size = compute_base64_encoded_size(raw.size());
+  std::string s;
+  s.resize(res_size);
+  if (res_size) {
+    buff_base64_encode(td::MutableSlice{const_cast<char *>(s.data()), s.size()}, raw, base64_url);
+  }
+  return s;
+}
+
+bool is_valid_base64(std::string encoded, bool allow_base64_url) {
+  return is_valid_base64(td::Slice{encoded}, allow_base64_url);
+}
+
+bool is_valid_base64(td::Slice encoded, bool allow_base64_url) {
+  const unsigned char *ptr = (const unsigned char *)encoded.data(), *end = ptr + encoded.size();
+  if (encoded.size() & 3) {
+    return false;
+  }
+  unsigned mode = (allow_base64_url ? 0xc0 : 0x40);
+  while (ptr < end && (base64_dec_table[*ptr] & mode)) {
+    ptr++;
+  }
+  std::size_t d = end - ptr;
+  if (d > 2) {
+    return false;
+  }
+  while (ptr < end && *ptr == '=') {
+    ptr++;
+  }
+  return ptr == end;
+}
+
+td::int32 decoded_base64_size(std::string encoded, bool allow_base64_url) {
+  return decoded_base64_size(td::Slice{encoded}, allow_base64_url);
+}
+
+td::int32 decoded_base64_size(td::Slice encoded, bool allow_base64_url) {
+  const unsigned char *ptr = (const unsigned char *)encoded.data(), *end = ptr + encoded.size();
+  if (encoded.size() & 3) {
+    return -1;
+  }
+  if (encoded.size() > static_cast<size_t>(std::numeric_limits<td::int32>::max())) {
+    return -1;
+  }
+  if (end == ptr) {
+    return 0;
+  }
+  auto s = static_cast<td::int32>((encoded.size() >> 2) * 3);
+  if (end[-1] == '=') {
+    s--;
+    if (end[-2] == '=') {
+      s--;
+    }
+  }
+  return s;
+}
+
+std::size_t buff_base64_decode(td::MutableSlice buffer, td::Slice encoded, bool allow_base64_url) {
+  if ((encoded.size() & 3) || !encoded.size()) {
+    return 0;
+  }
+  std::size_t n = (encoded.size() >> 2);
+  const unsigned char *ptr = (const unsigned char *)encoded.data(), *end = ptr + encoded.size();
+  unsigned q = (end[-1] == '=' ? (end[-2] == '=' ? 2 : 1) : 0);
+  if (buffer.size() + q < n * 3) {
+    return 0;
+  }
+  unsigned char *wptr = (unsigned char *)buffer.data(), *wend = wptr + buffer.size();
+  unsigned mode = (allow_base64_url ? 0xc0 : 0x40);
+  for (std::size_t i = 0; i < n; i++) {
+    unsigned x = 0;
+    for (std::size_t j = 0; j < 4; j++) {
+      unsigned z = base64_dec_table[ptr[4 * i + j]];
+      if (!(z & mode) && z != 1 && (i < n - 1 || j + q < 4)) {
+        return 0;
+      }
+      x = (x << 6) | (z & 0x3f);
+    }
+    if (i < n - 1) {
+      *wptr++ = (unsigned char)(x >> 16);
+      *wptr++ = (unsigned char)(x >> 8);
+      *wptr++ = (unsigned char)x;
+    } else {
+      for (; q < 3; q++) {
+        *wptr++ = (unsigned char)(x >> 16);
+        x <<= 8;
+      }
+      break;
+    }
+  }
+  CHECK(wptr <= wend);
+  return wptr - (unsigned char *)buffer.data();
+}
+
+td::BufferSlice base64_decode(std::string encoded, bool allow_base64_url) {
+  return base64_decode(td::Slice{encoded}, allow_base64_url);
+}
+
+td::BufferSlice base64_decode(td::Slice encoded, bool allow_base64_url) {
+  auto s = decoded_base64_size(encoded, allow_base64_url);
+  if (s <= 0) {
+    return td::BufferSlice{};
+  }
+  td::BufferSlice res{static_cast<std::size_t>(s)};
+  auto r = buff_base64_decode(res.as_slice(), encoded, allow_base64_url);
+  if (!r) {
+    return td::BufferSlice{};
+  }
+  CHECK(r == static_cast<std::size_t>(s));
+  return res;
+}
+
+std::string str_base64_decode(std::string encoded, bool allow_base64_url) {
+  return str_base64_decode(td::Slice{encoded}, allow_base64_url);
+}
+
+std::string str_base64_decode(td::Slice encoded, bool allow_base64_url) {
+  auto s = decoded_base64_size(encoded, allow_base64_url);
+  if (s <= 0) {
+    return std::string{};
+  }
+  std::string res;
+  res.resize(static_cast<std::size_t>(s));
+  auto r = buff_base64_decode(td::MutableSlice{const_cast<char *>(res.data()), res.size()}, encoded, allow_base64_url);
+  if (!r) {
+    return std::string{};
+  }
+  CHECK(r == static_cast<std::size_t>(s));
+  return res;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/common/util.h b/submodules/ton/tonlib-src/crypto/common/util.h
new file mode 100644
index 0000000000..2a594efc76
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/common/util.h
@@ -0,0 +1,42 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <string>
+#include "td/utils/Slice.h"
+#include "td/utils/buffer.h"
+
+namespace td {
+
+std::size_t compute_base64_encoded_size(size_t bindata_size);
+std::size_t buff_base64_encode(td::MutableSlice buffer, td::Slice raw, bool base64_url = false);
+std::string str_base64_encode(std::string raw, bool base64_url = false);
+std::string str_base64_encode(td::Slice raw, bool base64_url = false);
+
+bool is_valid_base64(std::string encoded, bool allow_base64_url = true);
+bool is_valid_base64(td::Slice encoded, bool allow_base64_url = true);
+td::int32 decoded_base64_size(std::string encoded, bool allow_base64_url = true);
+td::int32 decoded_base64_size(td::Slice encoded, bool allow_base64_url = true);
+
+std::size_t buff_base64_decode(td::MutableSlice buffer, td::Slice data, bool allow_base64_url = true);
+td::BufferSlice base64_decode(std::string encoded, bool allow_base64_url = true);
+td::BufferSlice base64_decode(td::Slice encoded, bool allow_base64_url = true);
+std::string str_base64_decode(std::string encoded, bool allow_base64_url = true);
+std::string str_base64_decode(td::Slice encoded, bool allow_base64_url = true);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/ellcurve/Ed25519.cpp b/submodules/ton/tonlib-src/crypto/ellcurve/Ed25519.cpp
new file mode 100644
index 0000000000..dca882cf89
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/ellcurve/Ed25519.cpp
@@ -0,0 +1,280 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "Ed25519.h"
+
+#include "td/utils/Random.h"
+
+namespace crypto {
+namespace Ed25519 {
+
+bool all_bytes_same(const unsigned char *str, std::size_t size) {
+  unsigned char c = str[0];
+  for (std::size_t i = 0; i < size; i++) {
+    if (str[i] != c) {
+      return false;
+    }
+  }
+  return true;
+}
+
+void PublicKey::clear(void) {
+  if (inited != pk_empty) {
+    std::memset(pubkey, 0, pubkey_bytes);
+    PubKey.zeroize();
+    PubKey_xz.zeroize();
+  }
+  inited = pk_empty;
+}
+
+PublicKey::PublicKey(const unsigned char pub_key[pubkey_bytes])
+    : inited(pk_empty), PubKey(ellcurve::Fp25519()), PubKey_xz(ellcurve::Fp25519()) {
+  import_public_key(pub_key);
+}
+
+PublicKey::PublicKey(const ellcurve::TwEdwardsCurve::SegrePoint &Pub_Key)
+    : inited(pk_empty), PubKey(ellcurve::Fp25519()), PubKey_xz(ellcurve::Fp25519()) {
+  import_public_key(Pub_Key);
+}
+
+bool PublicKey::import_public_key(const unsigned char pub_key[pubkey_bytes]) {
+  clear();
+  if (all_bytes_same(pub_key, pubkey_bytes)) {
+    return false;
+  }
+  bool ok = false;
+  PubKey = ellcurve::Ed25519().import_point(pub_key, ok);
+  if (!ok) {
+    clear();
+    return false;
+  }
+  std::memcpy(pubkey, pub_key, pubkey_bytes);
+  PubKey_xz.X = PubKey.Z + PubKey.Y;
+  PubKey_xz.Z = PubKey.Z - PubKey.Y;
+  inited = pk_init;
+  return true;
+}
+
+bool PublicKey::import_public_key(const ellcurve::TwEdwardsCurve::SegrePoint &Pub_Key) {
+  clear();
+  if (!Pub_Key.is_valid()) {
+    return false;
+  }
+  PubKey = Pub_Key;
+  PubKey_xz.X = PubKey.Z + PubKey.Y;
+  PubKey_xz.Z = PubKey.Z - PubKey.Y;
+  inited = pk_init;
+
+  if (!PubKey.export_point(pubkey)) {
+    clear();
+    return false;
+  }
+  return true;
+}
+
+bool PublicKey::export_public_key(unsigned char pubkey_buffer[pubkey_bytes]) const {
+  if (inited != pk_init) {
+    std::memset(pubkey_buffer, 0, pubkey_bytes);
+    return false;
+  } else {
+    std::memcpy(pubkey_buffer, pubkey, pubkey_bytes);
+    return true;
+  }
+}
+
+bool PublicKey::check_message_signature(const unsigned char signature[sign_bytes], const unsigned char *message,
+                                        std::size_t msg_size) {
+  if (inited != pk_init) {
+    return false;
+  }
+  unsigned char hash[64];
+  {
+    digest::SHA512 hasher(signature, 32);
+    hasher.feed(pubkey, 32);
+    hasher.feed(message, msg_size);
+    hasher.extract(hash);
+  }
+  auto &E = ellcurve::Ed25519();
+  const arith::Bignum &L = E.get_ell();
+  arith::Bignum H, S;
+  S.import_lsb(signature + 32, 32);
+  H.import_lsb(hash, 64);
+  H %= L;
+  H = L - H;
+  auto sG = E.power_gen(S);
+  auto hA = E.power_point(PubKey, H);
+  auto pR1 = E.add_points(sG, hA);
+  unsigned char pR1_bytes[32];
+  if (!pR1.export_point(pR1_bytes)) {
+    return false;
+  }
+  return !std::memcmp(pR1_bytes, signature, 32);
+}
+
+// ---------------------
+class PrivateKey;
+
+bool PrivateKey::random_private_key(bool strong) {
+  inited = false;
+  if (!prng::rand_gen().rand_bytes(privkey, privkey_bytes, strong)) {
+    clear();
+    return false;
+  }
+  return process_private_key();
+}
+
+void PrivateKey::clear(void) {
+  std::memset(privkey, 0, privkey_bytes);
+  std::memset(priv_salt, 0, sizeof(priv_salt));
+  priv_exp.clear();
+  PubKey.clear();
+  inited = false;
+}
+
+bool PrivateKey::import_private_key(const unsigned char pk[privkey_bytes]) {
+  clear();
+  if (all_bytes_same(pk, privkey_bytes)) {
+    return false;
+  }
+  std::memcpy(privkey, pk, privkey_bytes);
+  return process_private_key();
+}
+
+bool PrivateKey::export_private_key(unsigned char pk[privkey_bytes]) const {  // careful!
+  if (!inited) {
+    std::memset(pk, 0, privkey_bytes);
+    return false;
+  } else {
+    std::memcpy(pk, privkey, privkey_bytes);
+    return true;
+  }
+}
+
+bool PrivateKey::process_private_key() {
+  unsigned char buff[64];
+  digest::hash_str<digest::SHA512>(buff, privkey, privkey_bytes);
+  std::memcpy(priv_salt, buff + 32, 32);
+  buff[0] = (unsigned char)(buff[0] & -8);
+  buff[31] = (unsigned char)((buff[31] | 0x40) & ~0x80);
+  priv_exp.import_lsb(buff, 32);
+  PubKey = ellcurve::Ed25519().power_gen(priv_exp, true);  // uniform
+  inited = PubKey.ok();
+  if (!inited) {
+    clear();
+  }
+  return inited;
+}
+
+bool PrivateKey::compute_shared_secret(unsigned char secret[shared_secret_bytes], const PublicKey &Pub) {
+  if (!inited || !Pub.ok()) {
+    std::memset(secret, 0, shared_secret_bytes);
+    *(long *)secret = static_cast<long>(td::Random::fast_uint64());
+    return false;
+  }
+  // uniform power!
+  auto P = ellcurve::Curve25519().power_xz(Pub.get_point_xz(), priv_exp);
+  if (P.is_infty()) {
+    std::memset(secret, 0, shared_secret_bytes);
+    *(long *)secret = static_cast<long>(td::Random::fast_uint64());
+    return false;
+  }
+  P.export_point_u(secret);
+  return true;
+}
+
+bool PrivateKey::compute_temp_shared_secret(unsigned char secret[shared_secret_bytes],
+                                            const unsigned char temp_pub_key[pubkey_bytes]) {
+  PublicKey tempPubkey(temp_pub_key);
+  if (!tempPubkey.ok()) {
+    return false;
+  }
+  return compute_shared_secret(secret, tempPubkey);
+}
+
+bool PrivateKey::sign_message(unsigned char signature[sign_bytes], const unsigned char *message, std::size_t msg_size) {
+  if (!inited) {
+    std::memset(signature, 0, sign_bytes);
+    return false;
+  }
+  unsigned char r_bytes[64];
+  digest::hash_two_str<digest::SHA512>(r_bytes, priv_salt, 32, message, msg_size);
+  const arith::Bignum &L = ellcurve::Ed25519().get_ell();
+  arith::Bignum eR;
+  eR.import_lsb(r_bytes, 64);
+  eR %= L;
+  std::memset(r_bytes, 0, sizeof(r_bytes));
+
+  // uniform power
+  auto pR = ellcurve::Ed25519().power_gen(eR, true);
+
+  auto ok = pR.export_point(signature, true);
+  (void)ok;
+  assert(ok);
+  {
+    digest::SHA512 hasher(signature, 32);
+    hasher.feed(PubKey.get_pubkey_ptr(), 32);
+    hasher.feed(message, msg_size);
+    hasher.extract(r_bytes);
+  }
+  arith::Bignum S;
+  S.import_lsb(r_bytes, 64);
+  S %= L;
+  S *= priv_exp;
+  S += eR;
+  S %= L;
+  eR.clear();
+  S.export_lsb(signature + 32, 32);
+  return true;
+}
+
+// ---------------------------------
+class TempKeyGenerator;
+
+unsigned char *TempKeyGenerator::get_temp_private_key(unsigned char *to, const unsigned char *message, std::size_t size,
+                                                      const unsigned char *rand,
+                                                      std::size_t rand_size) {  // rand may be 0
+  digest::SHA256 hasher(message, size);
+  hasher.feed(random_salt, salt_size);
+  if (rand && rand_size) {
+    hasher.feed(rand, rand_size);
+  }
+  if (!to) {
+    to = buffer;
+  }
+  hasher.extract(to);
+  //++ *((long *)random_salt);
+  return to;
+}
+
+void TempKeyGenerator::create_temp_private_key(PrivateKey &pk, const unsigned char *message, std::size_t size,
+                                               const unsigned char *rand, std::size_t rand_size) {
+  pk.import_private_key(get_temp_private_key(buffer, message, size, rand, rand_size));
+  std::memset(buffer, 0, privkey_bytes);
+}
+
+bool TempKeyGenerator::create_temp_shared_secret(unsigned char temp_pub_key[pubkey_bytes],
+                                                 unsigned char shared_secret[shared_secret_bytes],
+                                                 const PublicKey &recipientPubKey, const unsigned char *message,
+                                                 std::size_t size, const unsigned char *rand, std::size_t rand_size) {
+  PrivateKey tmpPk;
+  create_temp_private_key(tmpPk, message, size, rand, rand_size);
+  return tmpPk.export_public_key(temp_pub_key) && tmpPk.compute_shared_secret(shared_secret, recipientPubKey);
+}
+
+}  // namespace Ed25519
+}  // namespace crypto
diff --git a/submodules/ton/tonlib-src/crypto/ellcurve/Ed25519.h b/submodules/ton/tonlib-src/crypto/ellcurve/Ed25519.h
new file mode 100644
index 0000000000..cb899cc168
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/ellcurve/Ed25519.h
@@ -0,0 +1,188 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "ellcurve/Montgomery.h"
+#include "ellcurve/TwEdwards.h"
+#include "openssl/digest.h"
+#include "openssl/rand.hpp"
+#include <assert.h>
+#include <cstring>
+
+#include "td/utils/buffer.h"
+
+namespace crypto {
+namespace Ed25519 {
+
+const int privkey_bytes = 32;
+const int pubkey_bytes = 32;
+const int sign_bytes = 64;
+const int shared_secret_bytes = 32;
+
+class PublicKey {
+  enum { pk_empty, pk_xz, pk_init } inited;
+  unsigned char pubkey[pubkey_bytes];
+  ellcurve::TwEdwardsCurve::SegrePoint PubKey;
+  ellcurve::MontgomeryCurve::PointXZ PubKey_xz;
+
+ public:
+  PublicKey() : inited(pk_empty), PubKey(ellcurve::Fp25519()), PubKey_xz(ellcurve::Fp25519()) {
+  }
+  PublicKey(const unsigned char pub_key[pubkey_bytes]);
+  PublicKey(td::Slice pub_key) : PublicKey(pub_key.ubegin()) {
+    CHECK(pub_key.size() == pubkey_bytes);
+  }
+  PublicKey(const ellcurve::TwEdwardsCurve::SegrePoint &Pub_Key);
+
+  bool import_public_key(const unsigned char pub_key[pubkey_bytes]);
+  bool import_public_key(td::Slice pub_key) {
+    CHECK(pub_key.size() == pubkey_bytes);
+    return import_public_key(pub_key.ubegin());
+  }
+  bool import_public_key(const ellcurve::TwEdwardsCurve::SegrePoint &Pub_Key);
+  bool export_public_key(unsigned char pubkey_buffer[pubkey_bytes]) const;
+  bool export_public_key(td::MutableSlice pubk) const {
+    CHECK(pubk.size() == pubkey_bytes);
+    return export_public_key(pubk.ubegin());
+  }
+  bool check_message_signature(const unsigned char signature[sign_bytes], const unsigned char *message,
+                               std::size_t msg_size);
+  bool check_message_signature(td::Slice signature, td::Slice message) {
+    CHECK(signature.size() == sign_bytes);
+    return check_message_signature(signature.ubegin(), message.ubegin(), message.size());
+  }
+
+  void clear();
+  bool ok() const {
+    return inited == pk_init;
+  }
+
+  const unsigned char *get_pubkey_ptr() const {
+    return inited == pk_init ? pubkey : 0;
+  }
+  const ellcurve::TwEdwardsCurve::SegrePoint &get_point() const {
+    return PubKey;
+  }
+  const ellcurve::MontgomeryCurve::PointXZ &get_point_xz() const {
+    return PubKey_xz;
+  }
+};
+
+class PrivateKey {
+ public:
+  struct priv_key_no_copy {};
+  PrivateKey() : inited(false) {
+    memset(privkey, 0, privkey_bytes);
+  }
+  PrivateKey(const unsigned char pk[privkey_bytes]) : inited(false) {
+    memset(privkey, 0, privkey_bytes);
+    import_private_key(pk);
+  }
+  PrivateKey(td::Slice pk) : inited(false) {
+    CHECK(pk.size() == privkey_bytes);
+    memset(privkey, 0, privkey_bytes);
+    import_private_key(pk.ubegin());
+  }
+  ~PrivateKey() {
+    clear();
+  }
+  bool random_private_key(bool strong = false);
+  bool import_private_key(const unsigned char pk[privkey_bytes]);
+  bool import_private_key(td::Slice pk) {
+    CHECK(pk.size() == privkey_bytes);
+    return import_private_key(pk.ubegin());
+  }
+  bool export_private_key(unsigned char pk[privkey_bytes]) const;  // careful!
+  bool export_private_key(td::MutableSlice pk) const {             // careful!
+    return export_private_key(pk.ubegin());
+  }
+  bool export_public_key(unsigned char pubk[pubkey_bytes]) const {
+    return PubKey.export_public_key(pubk);
+  }
+  bool export_public_key(td::MutableSlice pubk) const {
+    return PubKey.export_public_key(pubk);
+  }
+  void clear();
+  bool ok() const {
+    return inited;
+  }
+
+  // used for EdDSA (sign)
+  bool sign_message(unsigned char signature[sign_bytes], const unsigned char *message, std::size_t msg_size);
+  bool sign_message(td::MutableSlice signature, td::Slice message) {
+    CHECK(signature.size() == sign_bytes);
+    return sign_message(signature.ubegin(), message.ubegin(), message.size());
+  }
+  // used for ECDH (encrypt / decrypt)
+  bool compute_shared_secret(unsigned char secret[shared_secret_bytes], const PublicKey &Pub);
+  bool compute_shared_secret(td::MutableSlice secret, const PublicKey &Pub) {
+    CHECK(secret.size() == shared_secret_bytes);
+    return compute_shared_secret(secret.ubegin(), Pub);
+  }
+  // used for EC asymmetric decryption
+  bool compute_temp_shared_secret(unsigned char secret[shared_secret_bytes],
+                                  const unsigned char temp_pub_key[pubkey_bytes]);
+
+  const PublicKey &get_public_key() const {
+    return PubKey;
+  }
+
+ private:
+  bool inited;
+  unsigned char privkey[privkey_bytes];
+  unsigned char priv_salt[32];
+  arith::Bignum priv_exp;
+  PublicKey PubKey;
+
+  bool process_private_key();
+  PrivateKey(const PrivateKey &) {
+    throw priv_key_no_copy();
+  }
+  PrivateKey &operator=(const PrivateKey &) {
+    throw priv_key_no_copy();
+  }
+};
+
+// use one TempKeyGenerator object a lot of times
+class TempKeyGenerator {
+  enum { salt_size = 64 };
+  unsigned char random_salt[salt_size];
+  unsigned char buffer[privkey_bytes];
+
+ public:
+  TempKeyGenerator() {
+    prng::rand_gen().strong_rand_bytes(random_salt, salt_size);
+  }
+  ~TempKeyGenerator() {
+    memset(random_salt, 0, salt_size);
+    memset(buffer, 0, privkey_bytes);
+  }
+
+  unsigned char *get_temp_private_key(unsigned char *to, const unsigned char *message, std::size_t size,
+                                      const unsigned char *rand = 0, std::size_t rand_size = 0);  // rand may be 0
+  void create_temp_private_key(PrivateKey &pk, const unsigned char *message, std::size_t size,
+                               const unsigned char *rand = 0, std::size_t rand_size = 0);
+
+  // sets temp_pub_key and shared_secret for one-time asymmetric encryption of message
+  bool create_temp_shared_secret(unsigned char temp_pub_key[pubkey_bytes], unsigned char secret[shared_secret_bytes],
+                                 const PublicKey &recipientPubKey, const unsigned char *message, std::size_t size,
+                                 const unsigned char *rand = 0, std::size_t rand_size = 0);
+};
+
+}  // namespace Ed25519
+}  // namespace crypto
diff --git a/submodules/ton/tonlib-src/crypto/ellcurve/Fp25519.cpp b/submodules/ton/tonlib-src/crypto/ellcurve/Fp25519.cpp
new file mode 100644
index 0000000000..393da408b8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/ellcurve/Fp25519.cpp
@@ -0,0 +1,33 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "ellcurve/Fp25519.h"
+
+namespace ellcurve {
+using namespace arith;
+
+const Bignum& P25519() {
+  static const Bignum P25519 = (Bignum(1) << 255) - 19;
+  return P25519;
+}
+
+td::Ref<ResidueRing> Fp25519() {
+  static const td::Ref<ResidueRing> Fp25519(true, P25519());
+  return Fp25519;
+}
+}  // namespace ellcurve
diff --git a/submodules/ton/tonlib-src/crypto/ellcurve/Fp25519.h b/submodules/ton/tonlib-src/crypto/ellcurve/Fp25519.h
new file mode 100644
index 0000000000..3f17a5409c
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/ellcurve/Fp25519.h
@@ -0,0 +1,32 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "common/refcnt.hpp"
+#include "openssl/residue.h"
+
+namespace ellcurve {
+using namespace arith;
+
+// returns 2^255-19
+const Bignum& P25519();
+
+// residue ring modulo P25519
+td::Ref<ResidueRing> Fp25519();
+
+}  // namespace ellcurve
diff --git a/submodules/ton/tonlib-src/crypto/ellcurve/Montgomery.cpp b/submodules/ton/tonlib-src/crypto/ellcurve/Montgomery.cpp
new file mode 100644
index 0000000000..c523f6544b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/ellcurve/Montgomery.cpp
@@ -0,0 +1,138 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "ellcurve/Montgomery.h"
+
+#include <assert.h>
+#include <cstring>
+
+namespace ellcurve {
+using namespace arith;
+
+class MontgomeryCurve;
+
+void MontgomeryCurve::init() {
+  assert(!((a_short + 2) & 3) && a_short >= 0);
+}
+
+void MontgomeryCurve::set_order_cofactor(const Bignum& order, int cof) {
+  assert(order > 0);
+  assert(cof >= 0);
+  assert(cof == 0 || (order % cof) == 0);
+  Order = order;
+  cofactor = cofactor_short = cof;
+  if (cof > 0) {
+    L = order / cof;
+    assert(is_prime(L));
+  }
+  assert(!power_gen_xz(1).is_infty());
+  assert(power_gen_xz(Order).is_infty());
+}
+
+// computes u(P+Q)*u(P-Q) as X/Z
+MontgomeryCurve::PointXZ MontgomeryCurve::add_xz(const MontgomeryCurve::PointXZ& P,
+                                                 const MontgomeryCurve::PointXZ& Q) const {
+  Residue u = (P.X + P.Z) * (Q.X - Q.Z);
+  Residue v = (P.X - P.Z) * (Q.X + Q.Z);
+  return MontgomeryCurve::PointXZ(sqr(u + v), sqr(u - v));
+}
+
+// computes u(2P) as X/Z
+MontgomeryCurve::PointXZ MontgomeryCurve::double_xz(const MontgomeryCurve::PointXZ& P) const {
+  Residue u = sqr(P.X + P.Z);
+  Residue v = sqr(P.X - P.Z);
+  Residue w = u - v;
+  return PointXZ(u * v, w * (v + Residue(a_short, ring) * w));
+}
+
+MontgomeryCurve::PointXZ MontgomeryCurve::power_gen_xz(const Bignum& n) const {
+  return power_xz(Gu, n);
+}
+
+MontgomeryCurve::PointXZ MontgomeryCurve::power_xz(const Residue& u, const Bignum& n) const {
+  return power_xz(PointXZ(u), n);
+}
+
+// computes u([n]P) in form X/Z
+MontgomeryCurve::PointXZ MontgomeryCurve::power_xz(const PointXZ& A, const Bignum& n) const {
+  assert(n >= 0);
+  if (n == 0) {
+    return PointXZ(ring);
+  }
+
+  int k = n.num_bits();
+  PointXZ P(A);
+  PointXZ Q(double_xz(P));
+  for (int i = k - 2; i >= 0; --i) {
+    PointXZ PQ(add_xz(P, Q));
+    PQ.X *= A.Z;
+    PQ.Z *= A.X;
+    if (n[i]) {
+      P = PQ;
+      Q = double_xz(Q);
+    } else {
+      Q = PQ;
+      P = double_xz(P);
+    }
+  }
+  return P;
+}
+
+bool MontgomeryCurve::PointXZ::export_point_y(unsigned char buffer[32]) const {
+  if ((X + Z).is_zero()) {
+    std::memset(buffer, 0xff, 32);
+    return false;
+  } else {
+    get_y().extract().export_lsb(buffer, 32);
+    return true;
+  }
+}
+
+bool MontgomeryCurve::PointXZ::export_point_u(unsigned char buffer[32]) const {
+  if (Z.is_zero()) {
+    std::memset(buffer, 0xff, 32);
+    return false;
+  } else {
+    get_u().extract().export_lsb(buffer, 32);
+    return true;
+  }
+}
+
+MontgomeryCurve::PointXZ MontgomeryCurve::import_point_u(const unsigned char point[32]) const {
+  Bignum u;
+  u.import_lsb(point, 32);
+  u[255] = 0;
+  return PointXZ(Residue(u, ring));
+}
+
+MontgomeryCurve::PointXZ MontgomeryCurve::import_point_y(const unsigned char point[32]) const {
+  Bignum y;
+  y.import_lsb(point, 32);
+  y[255] = 0;
+  return PointXZ(Residue(y, ring), true);
+}
+
+const MontgomeryCurve& Curve25519() {
+  static const MontgomeryCurve Curve25519 = [] {
+    MontgomeryCurve res(486662, 9, Fp25519());
+    res.set_order_cofactor(hex_string{"80000000000000000000000000000000a6f7cef517bce6b2c09318d2e7ae9f68"}, 8);
+    return res;
+  }();
+  return Curve25519;
+}
+}  // namespace ellcurve
diff --git a/submodules/ton/tonlib-src/crypto/ellcurve/Montgomery.h b/submodules/ton/tonlib-src/crypto/ellcurve/Montgomery.h
new file mode 100644
index 0000000000..d40e8f8d7e
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/ellcurve/Montgomery.h
@@ -0,0 +1,123 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <iostream>
+#include <string>
+
+#include "openssl/bignum.h"
+#include "openssl/residue.h"
+#include "ellcurve/Fp25519.h"
+
+namespace ellcurve {
+using namespace arith;
+
+class MontgomeryCurve {
+  td::Ref<ResidueRing> ring;
+  int A_short;   // v^2 = u^2 + Au + 1
+  int Gu_short;  // u(G)
+  int a_short;   // (A+2)/4
+  Residue A_;
+  Residue Gu;
+  Bignum P_;
+  Bignum L;
+  Bignum Order;
+  Bignum cofactor;
+  int cofactor_short;
+
+  void init();
+
+ public:
+  MontgomeryCurve(int _A, int _Gu, td::Ref<ResidueRing> _R)
+      : ring(_R)
+      , A_short(_A)
+      , Gu_short(_Gu)
+      , a_short((_A + 2) / 4)
+      , A_(_A, _R)
+      , Gu(_Gu, _R)
+      , P_(_R->get_modulus())
+      , cofactor_short(0) {
+    init();
+  }
+
+  const Residue& get_gen_u() const {
+    return Gu;
+  }
+  const Bignum& get_ell() const {
+    return L;
+  }
+  const Bignum& get_order() const {
+    return Order;
+  }
+  td::Ref<ResidueRing> get_base_ring() const {
+    return ring;
+  }
+  const Bignum& get_p() const {
+    return P_;
+  }
+
+  void set_order_cofactor(const Bignum& order, int cof);
+
+  struct PointXZ {
+    Residue X, Z;
+    PointXZ(Residue x, Residue z) : X(x), Z(z) {
+      x.same_ring(z);
+    }
+    PointXZ(td::Ref<ResidueRing> r) : X(r->one()), Z(r->zero()) {
+    }
+    explicit PointXZ(Residue u) : X(u), Z(u.ring_of().one()) {
+    }
+    explicit PointXZ(Residue y, bool) : X(y.ring_of().one() + y), Z(y.ring_of().one() - y) {
+    }
+    PointXZ(const PointXZ& P) : X(P.X), Z(P.Z) {
+    }
+    PointXZ& operator=(const PointXZ& P) {
+      X = P.X;
+      Z = P.Z;
+      return *this;
+    }
+    Residue get_u() const {
+      return X * inverse(Z);
+    }
+    Residue get_v(bool sign_v = false) const;
+    bool is_infty() const {
+      return Z.is_zero();
+    }
+    Residue get_y() const {
+      return (X - Z) * inverse(X + Z);
+    }
+    bool export_point_y(unsigned char buffer[32]) const;
+    bool export_point_u(unsigned char buffer[32]) const;
+    void zeroize() {
+      X = Z = Z.ring_of().zero();
+    }
+  };
+
+  PointXZ power_gen_xz(const Bignum& n) const;
+  PointXZ power_xz(const Residue& u, const Bignum& n) const;
+  PointXZ power_xz(const PointXZ& P, const Bignum& n) const;
+  PointXZ add_xz(const PointXZ& P, const PointXZ& Q) const;
+  PointXZ double_xz(const PointXZ& P) const;
+
+  PointXZ import_point_u(const unsigned char point[32]) const;
+  PointXZ import_point_y(const unsigned char point[32]) const;
+};
+
+const MontgomeryCurve& Curve25519();
+
+}  // namespace ellcurve
diff --git a/submodules/ton/tonlib-src/crypto/ellcurve/TwEdwards.cpp b/submodules/ton/tonlib-src/crypto/ellcurve/TwEdwards.cpp
new file mode 100644
index 0000000000..6bcb42c20f
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/ellcurve/TwEdwards.cpp
@@ -0,0 +1,255 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "ellcurve/TwEdwards.h"
+#include <assert.h>
+#include <cstring>
+
+namespace ellcurve {
+using namespace arith;
+
+class TwEdwardsCurve;
+
+TwEdwardsCurve::TwEdwardsCurve(const Residue& _D, const Residue& _Gy, td::Ref<ResidueRing> _R)
+    : ring(_R)
+    , D(_D)
+    , D2(_D + _D)
+    , Gy(_Gy)
+    , P_(_R->get_modulus())
+    , cofactor_short(0)
+    , G(_R)
+    , O(_R)
+    , table_lines(0)
+    , table() {
+  init();
+}
+
+TwEdwardsCurve::~TwEdwardsCurve() {
+}
+
+void TwEdwardsCurve::init() {
+  assert(D != ring->zero() && D != ring->convert(-1));
+  O.X = O.Z = ring->one();
+  G = SegrePoint(*this, Gy, 0);
+  assert(!G.XY.is_zero());
+}
+
+void TwEdwardsCurve::set_order_cofactor(const Bignum& order, int cof) {
+  assert(order > 0);
+  assert(cof >= 0);
+  assert(cof == 0 || (order % cof) == 0);
+  Order = order;
+  cofactor = cofactor_short = cof;
+  if (cof > 0) {
+    L = order / cof;
+    assert(is_prime(L));
+    assert(!power_gen(1).is_zero());
+    assert(power_gen(L).is_zero());
+  }
+}
+
+TwEdwardsCurve::SegrePoint::SegrePoint(const TwEdwardsCurve& E, const Residue& y, bool x_sign)
+    : XY(y), X(E.get_base_ring()), Y(y), Z(E.get_base_ring()->one()) {
+  Residue x(y.ring_ref());
+  if (E.recover_x(x, y, x_sign)) {
+    XY *= x;
+    X = x;
+  } else {
+    XY = Y = Z = E.get_base_ring()->zero();
+  }
+}
+
+bool TwEdwardsCurve::recover_x(Residue& x, const Residue& y, bool x_sign) const {
+  // recovers x from equation -x^2+y^2 = 1+d*x^2*y^2
+  Residue z = inverse(ring->one() + D * sqr(y));
+  if (z.is_zero()) {
+    return false;
+  }
+  z *= sqr(y) - ring->one();
+  Residue t = sqrt(z);
+  if (sqr(t) == z) {
+    x = (t.extract().odd() == x_sign) ? t : -t;
+    //std::cout << "x=" << x << ", y=" << y << std::endl;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+void TwEdwardsCurve::add_points(SegrePoint& Res, const SegrePoint& P, const SegrePoint& Q) const {
+  Residue a((P.X + P.Y) * (Q.X + Q.Y));
+  Residue b((P.X - P.Y) * (Q.X - Q.Y));
+  Residue c(P.Z * Q.Z * ring->convert(2));
+  Residue d(P.XY * Q.XY * D2);
+  Residue x_num(a - b);   // 2(x1y2+x2y1)
+  Residue y_num(a + b);   // 2(x1x2+y1y2)
+  Residue x_den(c + d);   // 2(1+dx1x2y1y2)
+  Residue y_den(c - d);   // 2(1-dx1x2y1y2)
+  Res.X = x_num * y_den;  // x = x_num/x_den, y = y_num/y_den
+  Res.Y = y_num * x_den;
+  Res.XY = x_num * y_num;
+  Res.Z = x_den * y_den;
+}
+
+TwEdwardsCurve::SegrePoint TwEdwardsCurve::add_points(const SegrePoint& P, const SegrePoint& Q) const {
+  SegrePoint Res(ring);
+  add_points(Res, P, Q);
+  return Res;
+}
+
+void TwEdwardsCurve::double_point(SegrePoint& Res, const SegrePoint& P) const {
+  add_points(Res, P, P);
+}
+
+TwEdwardsCurve::SegrePoint TwEdwardsCurve::double_point(const SegrePoint& P) const {
+  SegrePoint Res(ring);
+  double_point(Res, P);
+  return Res;
+}
+
+// computes u([n]P) in form (xy,x,y,1)*Z
+TwEdwardsCurve::SegrePoint TwEdwardsCurve::power_point(const SegrePoint& A, const Bignum& n, bool uniform) const {
+  assert(n >= 0);
+  if (n == 0) {
+    return O;
+  }
+
+  int k = n.num_bits();
+  SegrePoint P(A);
+
+  if (uniform) {
+    SegrePoint Q(double_point(A));
+
+    for (int i = k - 2; i >= 0; --i) {
+      if (n[i]) {
+        add_points(P, P, Q);
+        double_point(Q, Q);
+      } else {
+        // we do more operations than necessary for uniformicity
+        add_points(Q, P, Q);
+        double_point(P, P);
+      }
+    }
+  } else {
+    for (int i = k - 2; i >= 0; --i) {
+      double_point(P, P);
+      if (n[i]) {
+        add_points(P, P, A);  // may optimize further if A.z = 1
+      }
+    }
+  }
+  return P;
+}
+
+int TwEdwardsCurve::build_table() {
+  if (table.size()) {
+    return -1;
+  }
+  table_lines = (P_.num_bits() >> 2) + 2;
+  table.reserve(table_lines * 15 + 1);
+  table.emplace_back(get_base_point());
+  for (int i = 0; i < table_lines; i++) {
+    for (int j = 0; j < 15; j++) {
+      table.emplace_back(add_points(table[15 * i + j], table[15 * i]));
+    }
+  }
+  return 1;
+}
+
+int get_nibble(const Bignum& n, int idx) {
+  return n[idx * 4 + 3] * 8 + n[idx * 4 + 2] * 4 + n[idx * 4 + 1] * 2 + n[idx * 4];
+}
+
+TwEdwardsCurve::SegrePoint TwEdwardsCurve::power_gen(const Bignum& n, bool uniform) const {
+  if (uniform || n.num_bits() > table_lines * 4) {
+    return power_point(G, n, uniform);
+  } else if (n.is_zero()) {
+    return O;
+  } else {
+    int k = (n.num_bits() + 3) >> 2;
+    assert(k > 0 && k <= table_lines);
+    int x = get_nibble(n, k - 1);
+    assert(x > 0 && x < 16);
+    SegrePoint P(table[15 * (k - 1) + x - 1]);
+    for (int i = k - 2; i >= 0; i--) {
+      x = get_nibble(n, i);
+      assert(x >= 0 && x < 16);
+      if (x > 0) {
+        add_points(P, P, table[15 * i + x - 1]);
+      }
+    }
+    return P;
+  }
+}
+
+bool TwEdwardsCurve::SegrePoint::export_point(unsigned char buffer[32], bool need_x) const {
+  if (!is_normalized()) {
+    if (Z.is_zero()) {
+      std::memset(buffer, 0xff, 32);
+      return false;
+    }
+    Residue f(inverse(Z));
+    Bignum y((Y * f).extract());
+    assert(!y[255]);
+    if (need_x) {
+      y[255] = (X * f).extract().odd();
+    }
+    y.export_lsb(buffer, 32);
+  } else {
+    Bignum y(Y.extract());
+    assert(!y[255]);
+    if (need_x) {
+      y[255] = X.extract().odd();
+    }
+    y.export_lsb(buffer, 32);
+  }
+  return true;
+}
+
+bool TwEdwardsCurve::SegrePoint::export_point_u(unsigned char buffer[32]) const {
+  if (Z == Y) {
+    std::memset(buffer, 0xff, 32);
+    return false;
+  }
+  Residue f(inverse(Z - Y));
+  ((Z + Y) * f).extract().export_lsb(buffer, 32);
+  assert(!(buffer[31] & 0x80));
+  return true;
+}
+
+TwEdwardsCurve::SegrePoint TwEdwardsCurve::import_point(const unsigned char point[32], bool& ok) const {
+  Bignum y;
+  y.import_lsb(point, 32);
+  bool x_sign = y[255];
+  y[255] = 0;
+  Residue yr(y, ring);
+  Residue xr(ring);
+  ok = recover_x(xr, yr, x_sign);
+  return ok ? SegrePoint(xr, yr) : SegrePoint(ring);
+}
+
+const TwEdwardsCurve& Ed25519() {
+  static const TwEdwardsCurve Ed25519 = [] {
+    TwEdwardsCurve res(Fp25519()->frac(-121665, 121666), Fp25519()->frac(4, 5), Fp25519());
+    res.set_order_cofactor(hex_string{"80000000000000000000000000000000a6f7cef517bce6b2c09318d2e7ae9f68"}, 8);
+    res.build_table();
+    return res;
+  }();
+  return Ed25519;
+}
+}  // namespace ellcurve
diff --git a/submodules/ton/tonlib-src/crypto/ellcurve/TwEdwards.h b/submodules/ton/tonlib-src/crypto/ellcurve/TwEdwards.h
new file mode 100644
index 0000000000..b226c2916e
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/ellcurve/TwEdwards.h
@@ -0,0 +1,145 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <vector>
+#include "common/refcnt.hpp"
+#include "openssl/residue.h"
+#include "ellcurve/Fp25519.h"
+
+namespace ellcurve {
+using namespace arith;
+
+class TwEdwardsCurve {
+ public:
+  struct SegrePoint {
+    Residue XY, X, Y, Z;  // if x=X/Z and y=Y/T, stores (xy,x,y,1)*Z*T
+    SegrePoint(td::Ref<ResidueRing> R) : XY(R), X(R), Y(R), Z(R) {
+    }
+    SegrePoint(const Residue& x, const Residue& y) : XY(x * y), X(x), Y(y), Z(y.ring_of().one()) {
+    }
+    SegrePoint(const TwEdwardsCurve& E, const Residue& y, bool x_sign);
+    SegrePoint(const SegrePoint& P) : XY(P.XY), X(P.X), Y(P.Y), Z(P.Z) {
+    }
+    SegrePoint& operator=(const SegrePoint& P) {
+      XY = P.XY;
+      X = P.X;
+      Y = P.Y;
+      Z = P.Z;
+      return *this;
+    }
+    bool is_zero() const {
+      return X.is_zero() && (Y == Z);
+    }
+    bool is_valid() const {
+      return (XY * Z == X * Y) && !(XY.is_zero() && X.is_zero() && Y.is_zero() && Z.is_zero());
+    }
+    bool is_finite() const {
+      return !Z.is_zero();
+    }
+    bool is_normalized() const {
+      return Z == Z.ring_of().one();
+    }
+    SegrePoint& normalize() {
+      auto f = inverse(Z);
+      XY *= f;
+      X *= f;
+      Y *= f;
+      Z = Z.ring_of().one();
+      return *this;
+    }
+    SegrePoint& zeroize() {
+      XY = X = Y = Z = Z.ring_of().zero();
+      return *this;
+    }
+    bool export_point(unsigned char buffer[32], bool need_x = true) const;
+    bool export_point_y(unsigned char buffer[32]) const {
+      return export_point(buffer, false);
+    }
+    bool export_point_u(unsigned char buffer[32]) const;
+    Residue get_y() const {
+      return Y * inverse(Z);
+    }
+    Residue get_x() const {
+      return X * inverse(Z);
+    }
+    Residue get_u() const {
+      return (Z + Y) * inverse(Z - Y);
+    }
+    void negate() {
+      XY.negate();
+      X.negate();
+    }
+  };
+
+ private:
+  td::Ref<ResidueRing> ring;
+  Residue D;
+  Residue D2;
+  Residue Gy;
+  Bignum P_;
+  Bignum L;
+  Bignum Order;
+  Bignum cofactor;
+  int cofactor_short;
+  SegrePoint G;
+  SegrePoint O;
+  int table_lines;
+  std::vector<SegrePoint> table;
+
+  void init();
+
+ public:
+  TwEdwardsCurve(const Residue& _D, const Residue& _Gy, td::Ref<ResidueRing> _R);
+  ~TwEdwardsCurve();
+  const Residue& get_gen_y() const {
+    return Gy;
+  }
+  const Bignum& get_ell() const {
+    return L;
+  }
+  const Bignum& get_order() const {
+    return Order;
+  }
+  td::Ref<ResidueRing> get_base_ring() const {
+    return ring;
+  }
+  const Bignum& get_p() const {
+    return P_;
+  }
+  const SegrePoint& get_base_point() const {
+    return G;
+  }
+
+  void set_order_cofactor(const Bignum& order, int cof);
+  bool recover_x(Residue& x, const Residue& y, bool x_sign) const;
+
+  void add_points(SegrePoint& R, const SegrePoint& P, const SegrePoint& Q) const;
+  SegrePoint add_points(const SegrePoint& P, const SegrePoint& Q) const;
+  void double_point(SegrePoint& R, const SegrePoint& P) const;
+  SegrePoint double_point(const SegrePoint& P) const;
+  SegrePoint power_point(const SegrePoint& A, const Bignum& n, bool uniform = false) const;
+  SegrePoint power_gen(const Bignum& n, bool uniform = false) const;
+  int build_table();
+
+  SegrePoint import_point(const unsigned char point[32], bool& ok) const;
+};
+
+std::ostream& operator<<(std::ostream& os, const TwEdwardsCurve::SegrePoint& P);
+const TwEdwardsCurve& Ed25519();
+}  // namespace ellcurve
diff --git a/submodules/ton/tonlib-src/crypto/fift/Dictionary.cpp b/submodules/ton/tonlib-src/crypto/fift/Dictionary.cpp
new file mode 100644
index 0000000000..3298132a9f
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/Dictionary.cpp
@@ -0,0 +1,200 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "Dictionary.h"
+
+namespace fift {
+
+//
+// WordDef
+//
+void WordDef::run(IntCtx& ctx) const {
+  auto next = run_tail(ctx);
+  while (next.not_null()) {
+    next = next->run_tail(ctx);
+  }
+}
+
+//
+// StackWord
+//
+Ref<WordDef> StackWord::run_tail(IntCtx& ctx) const {
+  f(ctx.stack);
+  return {};
+}
+
+//
+// CtxWord
+//
+Ref<WordDef> CtxWord::run_tail(IntCtx& ctx) const {
+  f(ctx);
+  return {};
+}
+
+//
+// CtxTailWord
+//
+Ref<WordDef> CtxTailWord::run_tail(IntCtx& ctx) const {
+  return f(ctx);
+}
+
+//
+// WordList
+//
+WordList::WordList(std::vector<Ref<WordDef>>&& _list) : list(std::move(_list)) {
+}
+
+WordList::WordList(const std::vector<Ref<WordDef>>& _list) : list(_list) {
+}
+
+WordList& WordList::push_back(Ref<WordDef> word_def) {
+  list.push_back(std::move(word_def));
+  return *this;
+}
+
+WordList& WordList::push_back(WordDef& wd) {
+  list.emplace_back(&wd);
+  return *this;
+}
+
+Ref<WordDef> WordList::run_tail(IntCtx& ctx) const {
+  if (list.empty()) {
+    return {};
+  }
+  auto it = list.cbegin(), it2 = list.cend() - 1;
+  while (it < it2) {
+    (*it)->run(ctx);
+    ++it;
+  }
+  return *it;
+}
+
+void WordList::close() {
+  list.shrink_to_fit();
+}
+
+WordList& WordList::append(const std::vector<Ref<WordDef>>& other) {
+  list.insert(list.end(), other.begin(), other.end());
+  return *this;
+}
+
+//
+// WordRef
+//
+
+WordRef::WordRef(Ref<WordDef> _def, bool _act) : def(std::move(_def)), active(_act) {
+}
+
+WordRef::WordRef(StackWordFunc func) : def(Ref<StackWord>{true, std::move(func)}), active(false) {
+}
+
+WordRef::WordRef(CtxWordFunc func, bool _act) : def(Ref<CtxWord>{true, std::move(func)}), active(_act) {
+}
+
+WordRef::WordRef(CtxTailWordFunc func, bool _act) : def(Ref<CtxTailWord>{true, std::move(func)}), active(_act) {
+}
+
+Ref<WordDef> WordRef::get_def() const & {
+  return def;
+}
+
+Ref<WordDef> WordRef::get_def() && {
+  return std::move(def);
+}
+
+void WordRef::operator()(IntCtx& ctx) const {
+  def->run(ctx);
+}
+
+bool WordRef::is_active() const {
+  return active;
+}
+
+//
+// Dictionary
+//
+WordRef* Dictionary::lookup(td::Slice name) {
+  auto it = words_.find(name);
+  if (it == words_.end()) {
+    return nullptr;
+  }
+  return &it->second;
+}
+
+void Dictionary::def_ctx_word(std::string name, CtxWordFunc func) {
+  def_word(std::move(name), std::move(func));
+}
+
+void Dictionary::def_active_word(std::string name, CtxWordFunc func) {
+  Ref<WordDef> wdef = Ref<CtxWord>{true, std::move(func)};
+  def_word(std::move(name), {std::move(wdef), true});
+}
+
+void Dictionary::def_stack_word(std::string name, StackWordFunc func) {
+  def_word(std::move(name), std::move(func));
+}
+
+void Dictionary::def_ctx_tail_word(std::string name, CtxTailWordFunc func) {
+  def_word(std::move(name), std::move(func));
+}
+
+void Dictionary::def_word(std::string name, WordRef word) {
+  auto res = words_.emplace(name, std::move(word));
+  LOG_IF(FATAL, !res.second) << "Cannot redefine word: " << name;
+}
+
+void Dictionary::undef_word(td::Slice name) {
+  auto it = words_.find(name);
+  if (it == words_.end()) {
+    return;
+  }
+  words_.erase(it);
+}
+
+void interpret_nop(vm::Stack& stack) {
+}
+
+Ref<WordDef> Dictionary::nop_word_def = Ref<StackWord>{true, interpret_nop};
+
+//
+// functions for wordef
+//
+Ref<WordDef> pop_exec_token(vm::Stack& stack) {
+  stack.check_underflow(1);
+  auto wd_ref = stack.pop().as_object<WordDef>();
+  if (wd_ref.is_null()) {
+    throw IntError{"execution token expected"};
+  }
+  return wd_ref;
+}
+
+Ref<WordList> pop_word_list(vm::Stack& stack) {
+  stack.check_underflow(1);
+  auto wl_ref = stack.pop().as_object<WordList>();
+  if (wl_ref.is_null()) {
+    throw IntError{"word list expected"};
+  }
+  return wl_ref;
+}
+
+void push_argcount(vm::Stack& stack, int args) {
+  stack.push_smallint(args);
+  stack.push({vm::from_object, Dictionary::nop_word_def});
+}
+
+}  // namespace fift
diff --git a/submodules/ton/tonlib-src/crypto/fift/Dictionary.h b/submodules/ton/tonlib-src/crypto/fift/Dictionary.h
new file mode 100644
index 0000000000..34cdb8325f
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/Dictionary.h
@@ -0,0 +1,182 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <functional>
+#include <map>
+
+#include "IntCtx.h"
+
+namespace fift {
+using td::Ref;
+/*
+ *
+ *    WORD CLASSES
+ *
+ */
+
+typedef std::function<void(vm::Stack&)> StackWordFunc;
+typedef std::function<void(IntCtx&)> CtxWordFunc;
+
+class WordDef : public td::CntObject {
+ public:
+  WordDef() = default;
+  virtual ~WordDef() override = default;
+  virtual Ref<WordDef> run_tail(IntCtx& ctx) const = 0;
+  void run(IntCtx& ctx) const;
+  virtual bool is_list() const {
+    return false;
+  }
+  virtual long long list_size() const {
+    return -1;
+  }
+  virtual const std::vector<Ref<WordDef>>* get_list() const {
+    return nullptr;
+  }
+};
+
+class StackWord : public WordDef {
+  StackWordFunc f;
+
+ public:
+  StackWord(StackWordFunc _f) : f(std::move(_f)) {
+  }
+  ~StackWord() override = default;
+  Ref<WordDef> run_tail(IntCtx& ctx) const override;
+};
+
+class CtxWord : public WordDef {
+  CtxWordFunc f;
+
+ public:
+  CtxWord(CtxWordFunc _f) : f(std::move(_f)) {
+  }
+  ~CtxWord() override = default;
+  Ref<WordDef> run_tail(IntCtx& ctx) const override;
+};
+
+typedef std::function<Ref<WordDef>(IntCtx&)> CtxTailWordFunc;
+
+class CtxTailWord : public WordDef {
+  CtxTailWordFunc f;
+
+ public:
+  CtxTailWord(CtxTailWordFunc _f) : f(std::move(_f)) {
+  }
+  ~CtxTailWord() override = default;
+  Ref<WordDef> run_tail(IntCtx& ctx) const override;
+};
+
+class WordList : public WordDef {
+  std::vector<Ref<WordDef>> list;
+
+ public:
+  ~WordList() override = default;
+  WordList() = default;
+  WordList(std::vector<Ref<WordDef>>&& _list);
+  WordList(const std::vector<Ref<WordDef>>& _list);
+  WordList& push_back(Ref<WordDef> word_def);
+  WordList& push_back(WordDef& wd);
+  Ref<WordDef> run_tail(IntCtx& ctx) const override;
+  void close();
+  bool is_list() const override {
+    return true;
+  }
+  long long list_size() const override {
+    return (long long)list.size();
+  }
+  const std::vector<Ref<WordDef>>* get_list() const override {
+    return &list;
+  }
+  WordList& append(const std::vector<Ref<WordDef>>& other);
+  WordList* make_copy() const override {
+    return new WordList(list);
+  }
+};
+
+class WordRef {
+  Ref<WordDef> def;
+  bool active;
+
+ public:
+  WordRef() = delete;
+  WordRef(const WordRef& ref) = default;
+  WordRef(WordRef&& ref) = default;
+  WordRef(Ref<WordDef> _def, bool _act = false);
+  WordRef(StackWordFunc func);
+  WordRef(CtxWordFunc func, bool _act = false);
+  WordRef(CtxTailWordFunc func, bool _act = false);
+  //WordRef(const std::vector<Ref<WordDef>>& word_list);
+  //WordRef(std::vector<Ref<WordDef>>&& word_list);
+  WordRef& operator=(const WordRef&) = default;
+  WordRef& operator=(WordRef&&) = default;
+  Ref<WordDef> get_def() const &;
+  Ref<WordDef> get_def() &&;
+  void operator()(IntCtx& ctx) const;
+  bool is_active() const;
+  ~WordRef() = default;
+};
+
+/*
+WordRef::WordRef(const std::vector<Ref<WordDef>>& word_list) : def(Ref<WordList>{true, word_list}) {
+}
+
+WordRef::WordRef(std::vector<Ref<WordDef>>&& word_list) : def(Ref<WordList>{true, std::move(word_list)}) {
+}
+*/
+
+/*
+ *
+ *    DICTIONARIES
+ *
+ */
+
+class Dictionary {
+ public:
+  WordRef* lookup(td::Slice name);
+  void def_ctx_word(std::string name, CtxWordFunc func);
+  void def_ctx_tail_word(std::string name, CtxTailWordFunc func);
+  void def_active_word(std::string name, CtxWordFunc func);
+  void def_stack_word(std::string name, StackWordFunc func);
+  void def_word(std::string name, WordRef word);
+  void undef_word(td::Slice name);
+
+  auto begin() const {
+    return words_.begin();
+  }
+  auto end() const {
+    return words_.end();
+  }
+
+  static Ref<WordDef> nop_word_def;
+
+ private:
+  std::map<std::string, WordRef, std::less<>> words_;
+};
+
+/*
+ *
+ *      AUX FUNCTIONS FOR WORD DEFS
+ *
+ */
+
+Ref<WordDef> pop_exec_token(vm::Stack& stack);
+Ref<WordList> pop_word_list(vm::Stack& stack);
+void push_argcount(vm::Stack& stack, int args);
+}  // namespace fift
diff --git a/submodules/ton/tonlib-src/crypto/fift/Fift.cpp b/submodules/ton/tonlib-src/crypto/fift/Fift.cpp
new file mode 100644
index 0000000000..5a4439ef77
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/Fift.cpp
@@ -0,0 +1,76 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "Fift.h"
+
+#include "words.h"
+
+#include "td/utils/PathView.h"
+
+namespace fift {
+
+Fift::Fift(Config config) : config_(std::move(config)) {
+}
+
+Fift::Config& Fift::config() {
+  return config_;
+}
+
+td::Result<int> Fift::interpret_file(std::string fname, std::string current_dir, bool is_interactive) {
+  auto r_file = config_.source_lookup.lookup_source(fname, current_dir);
+  if (r_file.is_error()) {
+    return td::Status::Error("cannot locate file `" + fname + "`");
+  }
+  auto file = r_file.move_as_ok();
+  IntCtx ctx;
+  std::stringstream ss(file.data);
+  ctx.input_stream = &ss;
+  ctx.filename = td::PathView(file.path).file_name().str();
+  ctx.currentd_dir = td::PathView(file.path).parent_dir().str();
+  ctx.include_depth = is_interactive ? 0 : 1;
+  return do_interpret(ctx);
+}
+
+td::Result<int> Fift::interpret_istream(std::istream& stream, std::string current_dir, bool is_interactive) {
+  IntCtx ctx;
+  ctx.input_stream = &stream;
+  ctx.filename = "stdin";
+  ctx.currentd_dir = current_dir;
+  ctx.include_depth = is_interactive ? 0 : 1;
+  return do_interpret(ctx);
+}
+
+td::Result<int> Fift::do_interpret(IntCtx& ctx) {
+  ctx.ton_db = &config_.ton_db;
+  ctx.source_lookup = &config_.source_lookup;
+  ctx.dictionary = &config_.dictionary;
+  ctx.output_stream = config_.output_stream;
+  ctx.error_stream = config_.error_stream;
+  if (!ctx.output_stream) {
+    return td::Status::Error("Cannot run interpreter without output_stream");
+  }
+  try {
+    return funny_interpret_loop(ctx);
+  } catch (fift::IntError ab) {
+    return td::Status::Error(ab.msg);
+  } catch (fift::Quit q) {
+    return q.res;
+  }
+  return 0;
+}
+}  // namespace fift
diff --git a/submodules/ton/tonlib-src/crypto/fift/Fift.h b/submodules/ton/tonlib-src/crypto/fift/Fift.h
new file mode 100644
index 0000000000..bd3c80237d
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/Fift.h
@@ -0,0 +1,53 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "SourceLookup.h"
+#include "vm/db/TonDb.h"
+#include "Dictionary.h"
+
+#include "td/utils/Status.h"
+
+namespace fift {
+struct IntCtx;
+int funny_interpret_loop(IntCtx& ctx);
+
+struct Fift {
+ public:
+  struct Config {
+    fift::SourceLookup source_lookup;
+    vm::TonDb ton_db;
+    fift::Dictionary dictionary;
+    std::ostream* output_stream{&std::cout};
+    std::ostream* error_stream{&std::cerr};
+  };
+  // Fift must own ton_db and dictionary, no concurrent access is allowed
+  explicit Fift(Config config);
+
+  td::Result<int> interpret_file(std::string fname, std::string current_dir, bool interactive = false);
+  td::Result<int> interpret_istream(std::istream& stream, std::string current_dir, bool interactive = true);
+
+  Config& config();
+
+ private:
+  Config config_;
+
+  td::Result<int> do_interpret(IntCtx& ctx);
+};
+}  // namespace fift
diff --git a/submodules/ton/tonlib-src/crypto/fift/IntCtx.cpp b/submodules/ton/tonlib-src/crypto/fift/IntCtx.cpp
new file mode 100644
index 0000000000..f2da340973
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/IntCtx.cpp
@@ -0,0 +1,192 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "IntCtx.h"
+
+namespace fift {
+
+td::StringBuilder& operator<<(td::StringBuilder& os, const IntCtx& ctx) {
+  if (ctx.include_depth) {
+    return os << ctx.filename << ":" << ctx.line_no << ": ";
+  } else {
+    return os;
+  }
+}
+
+std::ostream& operator<<(std::ostream& os, const IntCtx& ctx) {
+  return os << (PSLICE() << ctx).c_str();
+}
+
+void CharClassifier::import_from_string(td::Slice str, int space_cls) {
+  set_char_class(' ', space_cls);
+  set_char_class('\t', space_cls);
+  int cls = 3;
+  for (char c : str) {
+    if (c == ' ') {
+      cls--;
+    } else {
+      set_char_class(c, cls);
+    }
+  }
+}
+
+void CharClassifier::import_from_string(std::string str, int space_cls) {
+  import_from_string(td::Slice{str}, space_cls);
+}
+
+void CharClassifier::import_from_string(const char* str, int space_cls) {
+  import_from_string(td::Slice{str}, space_cls);
+}
+
+CharClassifier CharClassifier::from_string(td::Slice str, int space_cls) {
+  return CharClassifier{str, space_cls};
+}
+
+void CharClassifier::set_char_class(int c, int cl) {
+  c &= 0xff;
+  cl &= 3;
+  int offs = (c & 3) * 2;
+  int mask = (3 << offs);
+  cl <<= offs;
+  unsigned char* p = data_ + (c >> 2);
+  *p = static_cast<unsigned char>((*p & ~mask) | cl);
+}
+
+IntCtx::Savepoint::Savepoint(IntCtx& _ctx, std::string new_filename, std::string new_current_dir,
+                             std::istream* new_input_stream)
+    : ctx(_ctx)
+    , old_line_no(_ctx.line_no)
+    , old_filename(_ctx.filename)
+    , old_current_dir(_ctx.currentd_dir)
+    , old_input_stream(_ctx.input_stream)
+    , old_curline(_ctx.str)
+    , old_curpos(_ctx.input_ptr - _ctx.str.c_str()) {
+  ctx.line_no = 0;
+  ctx.filename = new_filename;
+  ctx.currentd_dir = new_current_dir;
+  ctx.input_stream = new_input_stream;
+  ctx.str = "";
+  ctx.input_ptr = 0;
+  ++(ctx.include_depth);
+}
+
+IntCtx::Savepoint::~Savepoint() {
+  ctx.line_no = old_line_no;
+  ctx.filename = old_filename;
+  ctx.currentd_dir = old_current_dir;
+  ctx.input_stream = old_input_stream;
+  ctx.str = old_curline;
+  ctx.input_ptr = ctx.str.c_str() + old_curpos;
+  --(ctx.include_depth);
+}
+
+bool IntCtx::load_next_line() {
+  if (!std::getline(*input_stream, str)) {
+    return false;
+  }
+  if (!str.empty() && str.back() == '\r') {
+    str.pop_back();
+  }
+  set_input(str);
+  return true;
+}
+
+bool IntCtx::is_sb() const {
+  return !eof() && line_no == 1 && *input_ptr == '#' && input_ptr[1] == '!';
+}
+
+td::Slice IntCtx::scan_word_to(char delim, bool err_endl) {
+  auto ptr = input_ptr;
+  while (*ptr && *ptr != delim) {
+    ptr++;
+  }
+  if (*ptr) {
+    std::swap(ptr, input_ptr);
+    return td::Slice{ptr, input_ptr++};
+  } else if (err_endl && delim) {
+    throw IntError{std::string{"end delimiter `"} + delim + "` not found"};
+  } else {
+    std::swap(ptr, input_ptr);
+    return td::Slice{ptr, input_ptr};
+  }
+}
+
+td::Slice IntCtx::scan_word() {
+  skipspc(true);
+  auto ptr = input_ptr;
+  while (*ptr && *ptr != ' ' && *ptr != '\t' && *ptr != '\r') {
+    ptr++;
+  }
+  auto ptr2 = ptr;
+  std::swap(ptr, input_ptr);
+  skipspc();
+  return td::Slice{ptr, ptr2};
+}
+
+td::Slice IntCtx::scan_word_ext(const CharClassifier& classifier) {
+  skipspc(true);
+  auto ptr = input_ptr;
+  while (*ptr && *ptr != '\r' && *ptr != '\n') {
+    int c = classifier.classify(*ptr);
+    if ((c & 1) && ptr != input_ptr) {
+      break;
+    }
+    ptr++;
+    if (c & 2) {
+      break;
+    }
+  }
+  std::swap(ptr, input_ptr);
+  return td::Slice{ptr, input_ptr};
+}
+
+void IntCtx::skipspc(bool skip_eol) {
+  do {
+    while (*input_ptr == ' ' || *input_ptr == '\t' || *input_ptr == '\r') {
+      ++input_ptr;
+    }
+    if (!skip_eol || *input_ptr) {
+      break;
+    }
+  } while (load_next_line());
+}
+
+void check_compile(const IntCtx& ctx) {
+  if (ctx.state <= 0) {
+    throw IntError{"compilation mode only"};
+  }
+}
+
+void check_execute(const IntCtx& ctx) {
+  if (ctx.state != 0) {
+    throw IntError{"interpret mode only"};
+  }
+}
+
+void check_not_int_exec(const IntCtx& ctx) {
+  if (ctx.state < 0) {
+    throw IntError{"not allowed in internal interpret mode"};
+  }
+}
+
+void check_int_exec(const IntCtx& ctx) {
+  if (ctx.state >= 0) {
+    throw IntError{"internal interpret mode only"};
+  }
+}
+}  // namespace fift
diff --git a/submodules/ton/tonlib-src/crypto/fift/IntCtx.h b/submodules/ton/tonlib-src/crypto/fift/IntCtx.h
new file mode 100644
index 0000000000..753d2cb1d4
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/IntCtx.h
@@ -0,0 +1,147 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "crypto/vm/db/TonDb.h"  // FIXME
+#include "crypto/vm/stack.hpp"
+#include "crypto/common/bitstring.h"
+
+#include <cstdint>
+#include <cstring>
+#include <iostream>
+#include <string>
+
+namespace fift {
+class Dictionary;
+class SourceLookup;
+
+struct IntError {
+  std::string msg;
+  IntError(std::string _msg) : msg(_msg) {
+  }
+};
+
+class CharClassifier {
+  unsigned char data_[64];
+
+ public:
+  CharClassifier() {
+    std::memset(data_, 0, sizeof(data_));
+  }
+  CharClassifier(td::Slice str, int space_cls = 3) : CharClassifier() {
+    import_from_string(str, space_cls);
+  }
+  CharClassifier(std::string str, int space_cls = 3) : CharClassifier(td::Slice{str}, space_cls) {
+  }
+  CharClassifier(const char* str, int space_cls = 3) : CharClassifier(td::Slice{str}, space_cls) {
+  }
+  void import_from_string(td::Slice str, int space_cls = 3);
+  void import_from_string(std::string str, int space_cls = 3);
+  void import_from_string(const char* str, int space_cls = 3);
+  static CharClassifier from_string(td::Slice str, int space_cls = 3);
+  void set_char_class(int c, int cl);
+  int classify(int c) const {
+    c &= 0xff;
+    int offs = (c & 3) * 2;
+    return (data_[(unsigned)c >> 2] >> offs) & 3;
+  }
+};
+
+struct IntCtx {
+  vm::Stack stack;
+  int state{0};
+  int include_depth{0};
+  int line_no{0};
+  std::string filename;
+  std::string currentd_dir;
+  std::istream* input_stream{nullptr};
+  std::ostream* output_stream{nullptr};
+  std::ostream* error_stream{nullptr};
+
+  vm::TonDb* ton_db{nullptr};
+  Dictionary* dictionary{nullptr};
+  SourceLookup* source_lookup{nullptr};
+
+ private:
+  std::string str;
+  const char* input_ptr;
+
+ public:
+  IntCtx() = default;
+
+  operator vm::Stack&() {
+    return stack;
+  }
+
+  td::Slice scan_word_to(char delim, bool err_endl = true);
+  td::Slice scan_word();
+  td::Slice scan_word_ext(const CharClassifier& classifier);
+  void skipspc(bool skip_eol = false);
+
+  bool eof() const {
+    return !*input_stream;
+  }
+
+  bool not_eof() const {
+    return !eof();
+  }
+
+  void set_input(std::string input_str) {
+    str = input_str;
+    input_ptr = str.c_str();
+    ++line_no;
+  }
+  void set_input(const char* ptr) {
+    input_ptr = ptr;
+  }
+  const char* get_input() const {
+    return input_ptr;
+  }
+
+  bool load_next_line();
+
+  bool is_sb() const;
+
+  void clear() {
+    state = 0;
+    stack.clear();
+  }
+  class Savepoint {
+    IntCtx& ctx;
+    int old_line_no;
+    std::string old_filename;
+    std::string old_current_dir;
+    std::istream* old_input_stream;
+    std::string old_curline;
+    std::ptrdiff_t old_curpos;
+
+   public:
+    Savepoint(IntCtx& _ctx, std::string new_filename, std::string new_current_dir, std::istream* new_input_stream);
+    ~Savepoint();
+  };
+};
+
+void check_compile(const IntCtx& ctx);
+void check_execute(const IntCtx& ctx);
+void check_not_int_exec(const IntCtx& ctx);
+void check_int_exec(const IntCtx& ctx);
+
+td::StringBuilder& operator<<(td::StringBuilder& os, const IntCtx& ctx);
+std::ostream& operator<<(std::ostream& os, const IntCtx& ctx);
+}  // namespace fift
diff --git a/submodules/ton/tonlib-src/crypto/fift/SourceLookup.cpp b/submodules/ton/tonlib-src/crypto/fift/SourceLookup.cpp
new file mode 100644
index 0000000000..50cd8c3141
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/SourceLookup.cpp
@@ -0,0 +1,89 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "SourceLookup.h"
+
+#include "td/utils/PathView.h"
+#include "td/utils/PathView.h"
+#include "td/utils/port/path.h"
+#include "td/utils/filesystem.h"
+
+#include <fstream>
+
+namespace fift {
+td::Result<FileLoader::File> OsFileLoader::read_file(td::CSlice filename) {
+  File res;
+  TRY_RESULT(data, td::read_file_str(filename));
+  res.data = std::move(data);
+  TRY_RESULT(path, td::realpath(filename));
+  res.path = std::move(path);
+  return std::move(res);
+}
+
+td::Status OsFileLoader::write_file(td::CSlice filename, td::Slice data) {
+  return td::write_file(filename, data);
+}
+
+td::Result<FileLoader::File> OsFileLoader::read_file_part(td::CSlice filename, td::int64 size, td::int64 offset) {
+  File res;
+  TRY_RESULT(data, td::read_file_str(filename, size, offset));
+  res.data = std::move(data);
+  TRY_RESULT(path, td::realpath(filename));
+  res.path = std::move(path);
+  return std::move(res);
+}
+
+bool OsFileLoader::is_file_exists(td::CSlice filename) {
+  return td::stat(filename).is_ok();
+}
+
+void SourceLookup::add_include_path(td::string path) {
+  if (path.empty()) {
+    return;
+  }
+  if (!td::PathView(path).is_dir()) {
+    path += TD_DIR_SLASH;
+  }
+
+  source_include_path_.push_back(std::move(path));
+}
+
+td::Result<FileLoader::File> SourceLookup::lookup_source(std::string filename, std::string current_dir) {
+  CHECK(file_loader_);
+  if (!current_dir.empty() && !td::PathView(current_dir).is_dir()) {
+    current_dir += TD_DIR_SLASH;
+  }
+  if (td::PathView(filename).is_absolute()) {
+    return read_file(filename);
+  }
+  if (!current_dir.empty()) {
+    auto res = read_file(current_dir + filename);
+    if (res.is_ok()) {
+      return res;
+    }
+  }
+  for (auto& dir : source_include_path_) {
+    auto res = read_file(dir + filename);
+    if (res.is_ok()) {
+      return res;
+    }
+  }
+
+  return td::Status::Error(PSLICE() << "failed to lookup file: " << filename);
+}
+}  // namespace fift
diff --git a/submodules/ton/tonlib-src/crypto/fift/SourceLookup.h b/submodules/ton/tonlib-src/crypto/fift/SourceLookup.h
new file mode 100644
index 0000000000..73d2cd918f
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/SourceLookup.h
@@ -0,0 +1,71 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <iostream>
+
+#include "td/utils/Status.h"
+
+namespace fift {
+class FileLoader {
+ public:
+  virtual ~FileLoader() = default;
+  struct File {
+    std::string data;
+    std::string path;
+  };
+  virtual td::Result<File> read_file(td::CSlice filename) = 0;
+  virtual td::Status write_file(td::CSlice filename, td::Slice data) = 0;
+  virtual td::Result<File> read_file_part(td::CSlice filename, td::int64 size, td::int64 offset) = 0;
+  virtual bool is_file_exists(td::CSlice filename) = 0;
+};
+
+class OsFileLoader : public FileLoader {
+ public:
+  td::Result<File> read_file(td::CSlice filename) override;
+  td::Status write_file(td::CSlice filename, td::Slice data) override;
+  td::Result<File> read_file_part(td::CSlice filename, td::int64 size, td::int64 offset) override;
+  bool is_file_exists(td::CSlice filename) override;
+};
+
+class SourceLookup {
+ public:
+  SourceLookup() = default;
+  explicit SourceLookup(std::unique_ptr<FileLoader> file_loader) : file_loader_(std::move(file_loader)) {
+  }
+  void add_include_path(td::string path);
+  td::Result<FileLoader::File> lookup_source(std::string filename, std::string current_dir);
+
+  td::Result<FileLoader::File> read_file(td::CSlice path) {
+    return file_loader_->read_file(path);
+  }
+  td::Status write_file(td::CSlice path, td::Slice data) {
+    return file_loader_->write_file(path, data);
+  }
+  td::Result<FileLoader::File> read_file_part(td::CSlice filename, td::int64 size, td::int64 offset) {
+    return file_loader_->read_file_part(filename, size, offset);
+  }
+  bool is_file_exists(td::CSlice filename) {
+    return file_loader_->is_file_exists(filename);
+  }
+
+ protected:
+  std::unique_ptr<FileLoader> file_loader_;
+  std::vector<std::string> source_include_path_;
+};
+}  // namespace fift
diff --git a/submodules/ton/tonlib-src/crypto/fift/fift-main.cpp b/submodules/ton/tonlib-src/crypto/fift/fift-main.cpp
new file mode 100644
index 0000000000..e040b6e8cf
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/fift-main.cpp
@@ -0,0 +1,221 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/stack.hpp"
+#include <cassert>
+#include <algorithm>
+#include <string>
+#include <vector>
+#include <iostream>
+#include <sstream>
+#include <fstream>
+#include <memory>
+#include <cstring>
+#include <cstdlib>
+#include <cmath>
+#include <map>
+#include <functional>
+#include <getopt.h>
+
+#include "Fift.h"
+#include "Dictionary.h"
+#include "SourceLookup.h"
+#include "words.h"
+
+#include "vm/db/TonDb.h"
+
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/Parser.h"
+#include "td/utils/port/path.h"
+
+void usage(const char* progname) {
+  std::cerr << "A simple Fift interpreter. Type `bye` to quit, or `words` to get a list of all commands\n";
+  std::cerr
+      << "usage: " << progname
+      << " [-i] [-n] [-I <source-include-path>] {-L <library-fif-file>} <source-file1-fif> <source-file2-fif> ...\n";
+  std::cerr << "\t-n\tDo not preload standard preamble file `Fift.fif`\n"
+               "\t-i\tForce interactive mode even if explicit source file names are indicated\n"
+               "\t-I<source-search-path>\tSets colon-separated library source include path. If not indicated, "
+               "$FIFTPATH is used instead.\n"
+               "\t-L<library-fif-file>\tPre-loads a library source file\n"
+               "\t-d<ton-db-path>\tUse a ton database\n"
+               "\t-s\tScript mode: use first argument as a fift source file and import remaining arguments as $n)\n"
+               "\t-v<verbosity-level>\tSet verbosity level\n";
+  std::exit(2);
+}
+
+void parse_include_path_set(std::string include_path_set, std::vector<std::string>& res) {
+  td::Parser parser(include_path_set);
+  while (!parser.empty()) {
+    auto path = parser.read_till_nofail(':');
+    if (!path.empty()) {
+      res.push_back(path.str());
+    }
+    parser.skip_nofail(':');
+  }
+}
+
+int main(int argc, char* const argv[]) {
+  bool interactive = false;
+  bool fift_preload = true, no_env = false;
+  bool script_mode = false;
+  std::vector<std::string> library_source_files, source_list;
+  std::vector<std::string> source_include_path;
+  std::string ton_db_path;
+
+  fift::Fift::Config config;
+
+  int i;
+  int new_verbosity_level = VERBOSITY_NAME(INFO);
+  while (!script_mode && (i = getopt(argc, argv, "hinI:L:d:sv:")) != -1) {
+    switch (i) {
+      case 'i':
+        interactive = true;
+        break;
+      case 'n':
+        fift_preload = false;
+        break;
+      case 'I':
+        parse_include_path_set(optarg, source_include_path);
+        no_env = true;
+        break;
+      case 'L':
+        library_source_files.emplace_back(optarg);
+        break;
+      case 'd':
+        ton_db_path = optarg;
+        break;
+      case 's':
+        script_mode = true;
+        break;
+      case 'v':
+        new_verbosity_level = VERBOSITY_NAME(FATAL) + td::to_integer<int>(td::Slice(optarg));
+        break;
+      case 'h':
+      default:
+        usage(argv[0]);
+    }
+  }
+  SET_VERBOSITY_LEVEL(new_verbosity_level);
+
+  while (optind < argc) {
+    source_list.emplace_back(argv[optind++]);
+    if (script_mode) {
+      break;
+    }
+  }
+
+  if (!no_env) {
+    const char* path = std::getenv("FIFTPATH");
+    if (path) {
+      parse_include_path_set(path ? path : "/usr/lib/fift", source_include_path);
+    }
+  }
+  std::string current_dir;
+  auto r_current_dir = td::realpath(".");
+  if (r_current_dir.is_ok()) {
+    current_dir = r_current_dir.move_as_ok();
+    source_include_path.push_back(current_dir);
+  }
+  config.source_lookup = fift::SourceLookup(std::make_unique<fift::OsFileLoader>());
+  for (auto& path : source_include_path) {
+    config.source_lookup.add_include_path(path);
+  }
+
+  if (!ton_db_path.empty()) {
+    auto r_ton_db = vm::TonDbImpl::open(ton_db_path);
+    if (r_ton_db.is_error()) {
+      LOG(ERROR) << "Error opening ton database: " << r_ton_db.error().to_string();
+      std::exit(2);
+    }
+    config.ton_db = r_ton_db.move_as_ok();
+    // FIXME //std::atexit([&] { config.ton_db.reset(); });
+  }
+
+  fift::init_words_common(config.dictionary);
+  fift::init_words_vm(config.dictionary);
+  fift::init_words_ton(config.dictionary);
+
+  if (script_mode) {
+    fift::import_cmdline_args(config.dictionary, source_list.empty() ? "" : source_list[0], argc - optind,
+                              argv + optind);
+  }
+
+  fift::Fift fift(std::move(config));
+
+  if (fift_preload) {
+    auto status = fift.interpret_file("Fift.fif", "");
+    if (status.is_error()) {
+      LOG(ERROR) << "Error interpreting standard preamble file `Fift.fif`: " << status.error().message()
+                 << "\nCheck that correct include path is set by -I or by FIFTPATH environment variable, or disable "
+                    "standard preamble by -n.\n";
+      std::exit(2);
+    }
+  }
+
+  for (auto source : library_source_files) {
+    auto status = fift.interpret_file(source, "");
+    if (status.is_error()) {
+      LOG(ERROR) << "Error interpreting preloaded file `" << source << "`: " << status.error().message();
+      std::exit(2);
+    }
+  }
+
+  if (source_list.empty()) {
+    interactive = true;
+  }
+  for (const auto& source : source_list) {
+    bool is_stdin = (source.empty() || source == "-");
+    auto status =
+        !is_stdin ? fift.interpret_file(source, current_dir) : fift.interpret_istream(std::cin, current_dir, false);
+    if (status.is_error()) {
+      if (!is_stdin) {
+        LOG(ERROR) << "Error interpreting file `" << source << "`: " << status.error().message();
+      } else {
+        LOG(ERROR) << "Error interpreting stdin: " << status.error().message();
+      }
+      std::exit(2);
+    }
+    auto res = status.move_as_ok();
+    if (res) {
+      std::exit(~res);
+    }
+  }
+  if (interactive) {
+    auto status = fift.interpret_istream(std::cin, current_dir);
+    if (status.is_error()) {
+      LOG(ERROR) << status.error().message();
+      std::exit(2);
+    } else {
+      int res = status.move_as_ok();
+      if (res) {
+        std::exit(~res);
+      }
+    }
+  }
+}
diff --git a/submodules/ton/tonlib-src/crypto/fift/lib/Asm.fif b/submodules/ton/tonlib-src/crypto/fift/lib/Asm.fif
new file mode 100644
index 0000000000..69adeeeaa8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/lib/Asm.fif
@@ -0,0 +1,1101 @@
+library TVM_Asm
+// simple TVM Assembler
+variable @atend
+'nop @atend !
+{ `normal eq? not abort"must be terminated by }>" } : @normal?
+{ @atend @ 1 { @atend ! @normal? } does @atend ! } : @pushatend
+{ @pushatend <b } : <{
+{ @atend @ execute } : @endblk
+{ `normal @endblk } : }>
+{ }> b> } : }>c
+{ }>c <s } : }>s
+{ @atend @ 2 { @atend ! rot b> ref, swap @endblk } does @atend ! <b } : @|
+{ @atend @ 3 { @atend ! 2swap rot execute } does @atend ! <b } : @doafter<{
+{ over brembits <= } : @havebits
+{ rot >= -rot <= and } : 2x<=
+{ 2 pick brembitrefs 1- 2x<= } : @havebitrefs
+{ @havebits not ' @| if } : @ensurebits
+{ @havebitrefs not ' @| if } : @ensurebitrefs
+{ rot over @ensurebits -rot u, } : @simpleuop
+{ tuck sbitrefs @ensurebitrefs swap s, } : @addop
+{ tuck bbitrefs @ensurebitrefs swap b+ } : @addopb
+' @addopb : @inline
+{ 1 ' @addop does create } : @Defop
+{ 1 { <b swap s, swap 8 u, @addopb } does create } : @Defop(8u)
+{ 1 { <b swap s, swap 8 i, @addopb } does create } : @Defop(8i)
+{ 1 { <b swap s, swap 1- 8 u, @addopb } does create } : @Defop(8u+1)
+{ 1 { <b swap s, swap 4 u, @addopb } does create } : @Defop(4u)
+{ 1 { <b swap s, rot 4 u, swap 4 u, @addopb } does create } : @Defop(4u,4u)
+{ 1 { <b swap s, swap ref, @addopb } does create } : @Defop(ref)
+{ <b 0xef 8 u, swap 12 i, b> } : si()
+// x mi ma -- ?
+{ rot tuck >= -rot <= and } : @range
+{ rot tuck < -rot > or } : @-range
+{ @-range abort"Out of range" } : @rangechk
+{ dup 0 < over 255 > or abort"Invalid stack register number" si() } : s()
+{ si() constant } : @Sreg
+-2 @Sreg s(-2)
+-1 @Sreg s(-1)
+0 @Sreg s0
+1 @Sreg s1
+2 @Sreg s2
+3 @Sreg s3
+4 @Sreg s4
+5 @Sreg s5
+6 @Sreg s6
+7 @Sreg s7
+8 @Sreg s8
+9 @Sreg s9
+10 @Sreg s10
+11 @Sreg s11
+12 @Sreg s12
+13 @Sreg s13
+14 @Sreg s14
+15 @Sreg s15
+{ dup 0 < over 7 > or abort"Invalid control register number" <b 0xcc 8 u, swap 4 u, b> } : c()
+{ c() constant } : @Creg
+0 @Creg c0
+1 @Creg c1
+2 @Creg c2
+3 @Creg c3
+4 @Creg c4
+5 @Creg c5
+7 @Creg c7
+{ <s 8 u@+ swap 0xef <> abort"not a stack register" 12 i@+ s> } : @bigsridx
+{ @bigsridx dup 16 >= over 0< or abort"stack register s0..s15 expected" } : @sridx
+{ rot @bigsridx tuck < -rot tuck > rot or abort"stack register out of range" } : @sridxrange
+{ swap @bigsridx + dup 16 >= over 0< or abort"stack register out of range" } : @sridx+
+{ <s 8 u@+ 4 u@+ s> swap 0xcc <> over 7 > or over 6 = or abort"not a control register c0..c5 or c7" } : @cridx
+{ <s 8 u@ 0xcc = } : @iscr?
+{ <b swap s, 1 { swap @sridx 4 u, @addopb } does create } : @Defop(s)
+{ <b swap s, 1 { rot @sridx 4 u, swap @sridx 4 u, @addopb } does create } : @Defop(s,s)
+{ <b swap s, 1 { swap @cridx 4 u, @addopb } does create } : @Defop(c)
+//
+// stack manipulation primitives
+// (simple stack primitives)
+//
+x{00} @Defop NOP
+x{01} @Defop SWAP
+x{0} @Defop(s) XCHG0
+{ @bigsridx swap @bigsridx 2dup =
+  { 2drop <b }
+  { 2dup < { swap } if dup 0=
+    { drop dup 16 <
+      { <b x{0} s, swap 4 u, }
+      { <b x{11} s, swap 8 u, }
+      cond
+    }
+    { over 16 >=
+      { tuck 16 >=
+        { <b x{11} s, 2 pick 8 u, x{11} s, swap 8 u, x{11} s, swap 8 u, }
+	{ <b x{0} s, 2 pick 4 u, x{11} s, swap 8 u, x{0} s, swap 4 u, } cond
+      }
+      { dup 1 =
+        { drop <b x{1} s, swap 4 u, }
+        { <b x{10} s, swap 4 u, swap 4 u, }
+        cond
+      } cond
+    } cond
+  } cond
+  @addopb } : XCHG
+x{ED4} @Defop(c) PUSHCTR
+x{ED5} @Defop(c) POPCTR
+{ dup @iscr?
+  ' PUSHCTR
+  { @bigsridx dup 16 <
+    { <b x{2} s, swap 4 u, }
+    { <b x{56} s, swap 8 u,
+    } cond
+  @addopb
+  } cond
+} : PUSH
+x{20} @Defop DUP
+x{21} @Defop OVER
+{ dup @iscr?
+  ' POPCTR
+  { @bigsridx dup 16 <
+    { <b x{3} s, swap 4 u, }
+    { <b x{57} s, swap 8 u,
+    } cond
+  @addopb
+  } cond
+} : POP
+x{30} @Defop DROP
+x{31} @Defop NIP
+
+// compound stack primitives
+{ @sridx rot @sridx rot @sridx swap <b x{4} s, swap 4 u, swap 4 u, swap 4 u, @addopb } : XCHG3
+x{50} @Defop(s,s) XCHG2
+x{51} @Defop(s,s) XCPU
+{ <b x{52} s, rot @sridx 4 u, swap 1 @sridx+ 4 u, @addopb } : PUXC
+x{53} @Defop(s,s) PUSH2
+{ @sridx rot @sridx rot @sridx swap <b x{540} s, swap 4 u, swap 4 u, swap 4 u, @addopb } : XCHG3_l
+{ @sridx rot @sridx rot @sridx swap <b x{541} s, swap 4 u, swap 4 u, swap 4 u, @addopb } : XC2PU
+{ 1 @sridx+ rot @sridx rot @sridx swap <b x{542} s, swap 4 u, swap 4 u, swap 4 u, @addopb } : XCPUXC
+{ @sridx rot @sridx rot @sridx swap <b x{543} s, swap 4 u, swap 4 u, swap 4 u, @addopb } : XCPU2
+{ 1 @sridx+ rot @sridx rot 1 @sridx+ swap <b x{544} s, swap 4 u, swap 4 u, swap 4 u, @addopb } : PUXC2
+{ 1 @sridx+ rot @sridx rot 1 @sridx+ swap <b x{545} s, swap 4 u, swap 4 u, swap 4 u, @addopb } : PUXCPU
+{ 2 @sridx+ rot @sridx rot 1 @sridx+ swap <b x{546} s, swap 4 u, swap 4 u, swap 4 u, @addopb } : PU2XC
+{ @sridx rot @sridx rot @sridx swap <b x{547} s, swap 4 u, swap 4 u, swap 4 u, @addopb } : PUSH3
+{ <b x{55} s, rot 1- 4 u, swap 1- 4 u, @addopb } : BLKSWAP
+{ dup { 1 swap BLKSWAP } { drop } cond } : ROLL
+{ dup { 1 BLKSWAP } { drop } cond } dup : -ROLL : ROLLREV
+x{5513} dup @Defop 2ROT @Defop ROT2
+
+// exotic stack primitives
+x{58} @Defop ROT
+x{59} dup @Defop -ROT @Defop ROTREV
+x{5A} dup @Defop 2SWAP @Defop SWAP2
+x{5B} dup @Defop 2DROP @Defop DROP2
+x{5C} dup @Defop 2DUP @Defop DUP2
+x{5D} dup @Defop 2OVER @Defop OVER2
+{ <b x{5E} s, rot 2 - 4 u, swap 4 u, @addopb } : REVERSE
+{ <b x{5F0} s, swap 4 u, @addopb } : BLKDROP
+{ over 0= abort"first argument must be non-zero"
+  <b x{5F} s, rot 4 u, swap 4 u, @addopb } : BLKPUSH
+x{60} dup @Defop PICK @Defop PUSHX
+x{61} @Defop ROLLX
+x{62} dup @Defop -ROLLX @Defop ROLLREVX
+x{63} @Defop BLKSWX
+x{64} @Defop REVX
+x{65} @Defop DROPX
+x{66} @Defop TUCK
+x{67} @Defop XCHGX
+x{68} @Defop DEPTH
+x{69} @Defop CHKDEPTH
+x{6A} @Defop ONLYTOPX
+x{6B} @Defop ONLYX
+
+// null primitives
+x{6D} dup @Defop NULL @Defop PUSHNULL
+x{6E} @Defop ISNULL
+// tuple primitives
+x{6F0} @Defop(4u) TUPLE
+x{6F00} @Defop NIL
+x{6F01} @Defop SINGLE
+x{6F02} dup @Defop PAIR @Defop CONS 
+x{6F03} @Defop TRIPLE
+x{6F1} @Defop(4u) INDEX
+x{6F10} dup @Defop FIRST @Defop CAR
+x{6F11} dup @Defop SECOND @Defop CDR
+x{6F12} @Defop THIRD
+x{6F2} @Defop(4u) UNTUPLE
+x{6F21} @Defop UNSINGLE
+x{6F22} dup @Defop UNPAIR @Defop UNCONS
+x{6F23} @Defop UNTRIPLE
+x{6F3} @Defop(4u) UNPACKFIRST
+x{6F30} @Defop CHKTUPLE
+x{6F4} @Defop(4u) EXPLODE
+x{6F5} @Defop(4u) SETINDEX
+x{6F50} @Defop SETFIRST
+x{6F51} @Defop SETSECOND
+x{6F52} @Defop SETTHIRD
+x{6F6} @Defop(4u) INDEXQ
+x{6F60} dup @Defop FIRSTQ @Defop CARQ
+x{6F61} dup @Defop SECONDQ @Defop CDRQ
+x{6F62} @Defop THIRDQ
+x{6F7} @Defop(4u) SETINDEXQ
+x{6F70} @Defop SETFIRSTQ
+x{6F71} @Defop SETSECONDQ
+x{6F72} @Defop SETTHIRDQ
+x{6F80} @Defop TUPLEVAR
+x{6F81} @Defop INDEXVAR
+x{6F82} @Defop UNTUPLEVAR
+x{6F83} @Defop UNPACKFIRSTVAR
+x{6F84} @Defop EXPLODEVAR
+x{6F85} @Defop SETINDEXVAR
+x{6F86} @Defop INDEXVARQ
+x{6F87} @Defop SETINDEXVARQ
+x{6F88} @Defop TLEN
+x{6F89} @Defop QTLEN
+x{6F8A} @Defop ISTUPLE
+x{6F8B} @Defop LAST
+x{6F8C} dup @Defop TPUSH @Defop COMMA
+x{6F8D} @Defop TPOP
+x{6FA0} @Defop NULLSWAPIF
+x{6FA1} @Defop NULLSWAPIFNOT
+x{6FA2} @Defop NULLROTRIF
+x{6FA3} @Defop NULLROTRIFNOT
+{ <b x{6FB} s, rot 2 u, swap 2 u, @addopb } : INDEX2
+x{6FB4} @Defop CADR
+x{6FB5} @Defop CDDR
+{ <b x{6FE_} s, 3 roll 2 u, rot 2 u, swap 2 u, @addopb } : INDEX3
+x{6FD4} @Defop CADDR
+x{6FD5} @Defop CDDDR
+
+// integer constants
+x{70} dup @Defop ZERO @Defop FALSE
+x{71} @Defop ONE
+x{72} @Defop TWO
+x{7A} @Defop TEN
+x{7F} @Defop TRUE
+{ dup 10 <= over -5 >= and
+  { 15 and <b x{7} s, swap 4 u, }
+  { dup 8 fits
+    { <b x{80} s, swap 8 i, }
+    { dup 16 fits
+      { <b x{81} s, swap 16 i, }
+      { 11 { dup 259 > abort"integer too large" 8 + 2dup fits } until
+        <b x{82} s, over 3 >> 2- 5 u, -rot i, 
+      } cond
+    } cond
+  } cond
+  @addopb } dup : PUSHINT : INT
+{ <b x{83} s, swap 1- 8 u, @addopb } : PUSHPOW2
+x{83FF} @Defop PUSHNAN
+{ <b x{84} s, swap 1- 8 u, @addopb } : PUSHPOW2DEC
+{ <b x{85} s, swap 1- 8 u, @addopb } : PUSHNEGPOW2
+//
+// other constants
+x{88} @Defop(ref) PUSHREF
+x{89} @Defop(ref) PUSHREFSLICE
+x{8A} @Defop(ref) PUSHREFCONT
+{ 1- dup 0< over 8 >= or abort"invalid slice padding"
+  swap 1 1 u, 0 rot u, } : @scomplete
+{ tuck sbitrefs swap 17 + swap @havebitrefs not
+  { <b rot s, b> PUSHREFSLICE }
+  { over sbitrefs 2dup 123 0 2x<=
+    { drop tuck 4 + 3 >> swap x{8B} s, over 4 u, 3 roll s,
+      -rot 3 << 4 + swap - @scomplete }
+    { 2dup 1 >= swap 248 <= and
+      { rot x{8C} s, swap 1- 2 u, over 7 + 3 >> tuck 5 u, 3 roll s,
+        -rot 3 << 1 + swap - @scomplete }
+      { rot x{8D} s, swap 3 u, over 2 + 3 >> tuck 7 u, 3 roll s,
+        -rot 3 << 6 + swap - @scomplete
+      } cond
+    } cond
+  } cond
+} dup : PUSHSLICE : SLICE
+{ tuck bbitrefs swap 16 + dup 7 and 3 -roll swap @havebitrefs
+  not rot or
+  { swap b> PUSHREFCONT }
+  { over bbitrefs 2dup 120 0 2x<=
+    { drop swap x{9} s, swap 3 >> 4 u, swap b+ }
+    { rot x{8F_} s, swap 2 u, swap 3 >> 7 u, swap b+ } cond
+  } cond
+} dup : PUSHCONT : CONT
+{ }> PUSHCONT } : }>CONT
+{ { @normal? PUSHCONT } @doafter<{ } : CONT:<{
+
+// arithmetic operations
+{ 2 { rot dup 8 fits
+      { nip <b rot s, swap 8 i, }
+      { rot drop <b swap PUSHINT swap s, }
+      cond @addopb
+    } does create
+} : @Defop(8i,alt)
+x{A0} @Defop ADD
+x{A1} @Defop SUB
+x{A2} @Defop SUBR
+x{A3} @Defop NEGATE
+x{A4} @Defop INC
+x{A5} @Defop DEC
+x{A6} x{A0} @Defop(8i,alt) ADDCONST
+{ negate ADDCONST } : SUBCONST
+x{A7} x{A8} @Defop(8i,alt) MULCONST
+' ADDCONST : ADDINT
+' SUBCONST : SUBINT
+' MULCONST : MULINT
+x{A8} @Defop MUL
+x{A904} @Defop DIV
+x{A905} @Defop DIVR
+x{A906} @Defop DIVC
+x{A908} @Defop MOD
+x{A90C} @Defop DIVMOD
+x{A90D} @Defop DIVMODR
+x{A90E} @Defop DIVMODC
+x{A925} @Defop RSHIFTR
+x{A935} @Defop(8u+1) RSHIFTR#
+x{A938} @Defop(8u+1) MODPOW2#
+x{A984} @Defop MULDIV
+x{A985} @Defop MULDIVR
+x{A98C} @Defop MULDIVMOD
+x{A9C4} @Defop LSHIFTDIV
+x{A9C5} @Defop LSHIFTDIVR
+x{A9D4} @Defop(8u+1) LSHIFT#DIV
+x{A9D5} @Defop(8u+1) LSHIFT#DIVR
+x{A9E4} @Defop MULRSHIFT
+x{A9E5} @Defop MULRSHIFTR
+x{A9F4} @Defop(8u+1) MULRSHIFT#
+x{A9F5} @Defop(8u+1) MULRSHIFTR#
+x{AA} @Defop(8u+1) LSHIFT#
+x{AB} @Defop(8u+1) RSHIFT#
+x{AC} @Defop LSHIFT
+x{AD} @Defop RSHIFT
+x{AE} @Defop POW2
+x{B0} @Defop AND
+x{B1} @Defop OR
+x{B2} @Defop XOR
+x{B3} @Defop NOT
+x{B4} @Defop(8u+1) FITS
+x{B400} @Defop CHKBOOL
+x{B5} @Defop(8u+1) UFITS
+x{B500} @Defop CHKBIT
+x{B600} @Defop FITSX
+x{B601} @Defop UFITSX
+x{B602} @Defop BITSIZE
+x{B603} @Defop UBITSIZE
+x{B608} @Defop MIN
+x{B609} @Defop MAX
+x{B60A} dup @Defop MINMAX @Defop INTSORT2
+x{B60B} @Defop ABS
+x{B7} @Defop QUIET
+x{B7A0} @Defop QADD
+x{B7A1} @Defop QSUB
+x{B7A2} @Defop QSUBR
+x{B7A3} @Defop QNEGATE
+x{B7A4} @Defop QINC
+x{B7A5} @Defop QDEC
+x{B7A8} @Defop QMUL
+x{B7A904} @Defop QDIV
+x{B7A905} @Defop QDIVR
+x{B7A906} @Defop QDIVC
+x{B7A908} @Defop QMOD
+x{B7A90C} @Defop QDIVMOD
+x{B7A90D} @Defop QDIVMODR
+x{B7A90E} @Defop QDIVMODC
+x{B7A985} @Defop QMULDIVR
+x{B7A98C} @Defop QMULDIVMOD
+x{B7AC} @Defop QLSHIFT
+x{B7AD} @Defop QRSHIFT
+x{B7AE} @Defop QPOW2
+x{B7B0} @Defop QAND
+x{B7B1} @Defop QOR
+x{B7B2} @Defop QXOR
+x{B7B3} @Defop QNOT
+x{B7B4} @Defop(8u+1) QFITS
+x{B7B5} @Defop(8u+1) QUFITS
+x{B7B600} @Defop QFITSX
+x{B7B601} @Defop QUFITSX
+
+// integer comparison
+x{B8} @Defop SGN
+x{B9} @Defop LESS
+x{BA} @Defop EQUAL
+x{BB} @Defop LEQ
+x{BC} @Defop GREATER
+x{BD} @Defop NEQ
+x{BE} @Defop GEQ
+x{BF} @Defop CMP
+x{C0} x{BA} @Defop(8i,alt) EQINT
+x{C000} @Defop ISZERO
+x{C1} x{B9} @Defop(8i,alt) LESSINT
+{ 1+ LESSINT } : LEQINT
+x{C100} @Defop ISNEG
+x{C101} @Defop ISNPOS
+x{C2} x{BC} @Defop(8i,alt) GTINT
+{ 1- GTINT } : GEQINT
+x{C200} @Defop ISPOS
+x{C2FF} @Defop ISNNEG
+x{C3} x{BD} @Defop(8i,alt) NEQINT
+x{C300} @Defop ISNZERO
+x{C4} @Defop ISNAN
+x{C5} @Defop CHKNAN
+
+// other comparison
+x{C700} @Defop SEMPTY
+x{C701} @Defop SDEMPTY
+x{C702} @Defop SREMPTY
+x{C703} @Defop SDFIRST
+x{C704} @Defop SDLEXCMP
+x{C705} @Defop SDEQ
+x{C708} @Defop SDPFX
+x{C709} @Defop SDPFXREV
+x{C70A} @Defop SDPPFX
+x{C70B} @Defop SDPPFXREV
+x{C70C} @Defop SDSFX
+x{C70D} @Defop SDSFXREV
+x{C70E} @Defop SDPSFX
+x{C70F} @Defop SDPSFXREV
+x{C710} @Defop SDCNTLEAD0
+x{C711} @Defop SDCNTLEAD1
+x{C712} @Defop SDCNTTRAIL0
+x{C713} @Defop SDCNTTRAIL1
+
+// cell serialization (Builder manipulation primitives)
+x{C8} @Defop NEWC
+x{C9} @Defop ENDC
+x{CA} @Defop(8u+1) STI
+x{CB} @Defop(8u+1) STU
+x{CC} @Defop STREF
+x{CD} dup @Defop STBREFR @Defop ENDCST
+x{CE} @Defop STSLICE
+x{CF00} @Defop STIX
+x{CF01} @Defop STUX
+x{CF02} @Defop STIXR
+x{CF03} @Defop STUXR
+x{CF04} @Defop STIXQ
+x{CF05} @Defop STUXQ
+x{CF06} @Defop STIXRQ
+x{CF07} @Defop STUXRQ
+x{CF08} @Defop(8u+1) STI_l
+x{CF09} @Defop(8u+1) STU_l
+x{CF0A} @Defop(8u+1) STIR
+x{CF0B} @Defop(8u+1) STUR
+x{CF0C} @Defop(8u+1) STIQ
+x{CF0D} @Defop(8u+1) STUQ
+x{CF0E} @Defop(8u+1) STIRQ
+x{CF0F} @Defop(8u+1) STURQ
+x{CF10} @Defop STREF_l
+x{CF11} @Defop STBREF
+x{CF12} @Defop STSLICE_l
+x{CF13} @Defop STB
+x{CF14} @Defop STREFR
+x{CF15} @Defop STBREFR_l
+x{CF16} @Defop STSLICER
+x{CF17} dup @Defop STBR @Defop BCONCAT
+x{CF18} @Defop STREFQ
+x{CF19} @Defop STBREFQ
+x{CF1A} @Defop STSLICEQ
+x{CF1B} @Defop STBQ
+x{CF1C} @Defop STREFRQ
+x{CF1D} @Defop STBREFRQ
+x{CF1E} @Defop STSLICERQ
+x{CF1F} dup @Defop STBRQ @Defop BCONCATQ
+x{CF20} @Defop(ref) STREFCONST
+{ <b x{CF21} s, rot ref, swap ref, @addopb } : STREF2CONST
+x{CF28} @Defop STILE4
+x{CF29} @Defop STULE4
+x{CF2A} @Defop STILE8
+x{CF2B} @Defop STULE8
+x{CF31} @Defop BBITS
+x{CF32} @Defop BREFS
+x{CF33} @Defop BBITREFS
+x{CF35} @Defop BREMBITS
+x{CF36} @Defop BREMREFS
+x{CF37} @Defop BREMBITREFS
+x{CF38} @Defop(8u+1) BCHKBITS#
+x{CF39} @Defop BCHKBITS
+x{CF3A} @Defop BCHKREFS
+x{CF3B} @Defop BCHKBITREFS
+x{CF3C} @Defop(8u+1) BCHKBITSQ#
+x{CF3D} @Defop BCHKBITSQ
+x{CF3E} @Defop BCHKREFSQ
+x{CF3F} @Defop BCHKBITREFSQ
+x{CF40} @Defop STZEROES
+x{CF41} @Defop STONES
+x{CF42} @Defop STSAME
+{ tuck sbitrefs swap 15 + swap @havebitrefs not
+  { swap PUSHSLICE STSLICER }
+  { over sbitrefs 2dup 57 3 2x<=
+    { rot x{CFC_} s, swap 2 u, over 6 + 3 >> tuck 3 u, 3 roll s,
+      -rot 3 << 2 + swap - @scomplete }
+    { 2drop swap PUSHSLICE STSLICER } cond
+  } cond
+} : STSLICECONST
+x{CF81} @Defop STZERO
+x{CF83} @Defop STONE
+// cell deserialization (CellSlice primitives)
+x{D0} @Defop CTOS
+x{D1} @Defop ENDS
+x{D2} @Defop(8u+1) LDI
+x{D3} @Defop(8u+1) LDU
+x{D4} @Defop LDREF
+x{D5} @Defop LDREFRTOS
+x{D6} @Defop(8u+1) LDSLICE
+x{D700} @Defop LDIX
+x{D701} @Defop LDUX
+x{D702} @Defop PLDIX
+x{D703} @Defop PLDUX
+x{D704} @Defop LDIXQ
+x{D705} @Defop LDUXQ
+x{D706} @Defop PLDIXQ
+x{D707} @Defop PLDUXQ
+x{D708} @Defop(8u+1) LDI_l
+x{D709} @Defop(8u+1) LDU_l
+x{D70A} @Defop(8u+1) PLDI
+x{D70B} @Defop(8u+1) PLDU
+x{D70C} @Defop(8u+1) LDIQ
+x{D70D} @Defop(8u+1) LDUQ
+x{D70E} @Defop(8u+1) PLDIQ
+x{D70F} @Defop(8u+1) PLDUQ
+{ dup 31 and abort"argument must be a multiple of 32" 5 >> 1-
+  <b x{D714_} s, swap 3 u, @addopb
+} : PLDUZ
+x{D718} @Defop LDSLICEX
+x{D719} @Defop PLDSLICEX
+x{D71A} @Defop LDSLICEXQ
+x{D71B} @Defop PLDSLICEXQ
+x{D71C} @Defop(8u+1) LDSLICE_l
+x{D71D} @Defop(8u+1) PLDSLICE
+x{D71E} @Defop(8u+1) LDSLICEQ
+x{D71F} @Defop(8u+1) PLDSLICEQ
+x{D720} @Defop SDCUTFIRST
+x{D721} @Defop SDSKIPFIRST
+x{D722} @Defop SDCUTLAST
+x{D723} @Defop SDSKIPLAST
+x{D724} @Defop SDSUBSTR
+x{D726} @Defop SDBEGINSX
+x{D727} @Defop SDBEGINSXQ
+{ tuck sbits tuck 5 + 3 >> swap x{D72A_} s, over 7 u, 3 roll s,
+  -rot 3 << 3 + swap - @scomplete } : SDBEGINS:imm
+{ tuck sbitrefs abort"no references allowed in slice" dup 26 <=
+  { drop <b rot SDBEGINS:imm @addopb }
+  { @havebits
+    { swap SDBEGINS:imm }
+    { swap PUSHSLICE SDBEGINSX
+    } cond
+  } cond
+} : SDBEGINS
+{ tuck sbits tuck 5 + 3 >> swap x{D72E_} s, over 7 u, 3 roll s,
+  -rot 3 << 3 + swap - @scomplete } : SDBEGINSQ:imm
+{ tuck sbitrefs abort"no references allowed in slice" dup 26 <=
+  { drop <b rot SDBEGINSQ:imm @addopb }
+  { @havebits
+    { swap SDBEGINSQ:imm }
+    { swap PUSHSLICE SDBEGINSXQ
+    } cond
+  } cond
+} : SDBEGINSQ
+x{D730} @Defop SCUTFIRST
+x{D731} @Defop SSKIPFIRST
+x{D732} @Defop SCUTLAST
+x{D733} @Defop SSKIPLAST
+x{D734} @Defop SUBSLICE
+x{D736} @Defop SPLIT
+x{D737} @Defop SPLITQ
+x{D741} @Defop SCHKBITS
+x{D742} @Defop SCHKREFS
+x{D743} @Defop SCHKBITREFS
+x{D745} @Defop SCHKBITSQ
+x{D746} @Defop SCHKREFSQ
+x{D747} @Defop SCHKBITREFSQ
+x{D748} @Defop PLDREFVAR
+x{D749} @Defop SBITS
+x{D74A} @Defop SREFS
+x{D74B} @Defop SBITREFS
+{ <b x{D74E_} s, swap 2 u, @addopb } : PLDREFIDX
+x{D74C} @Defop PLDREF
+x{D750} @Defop LDILE4
+x{D751} @Defop LDULE4
+x{D752} @Defop LDILE8
+x{D753} @Defop LDULE8
+x{D754} @Defop PLDILE4
+x{D755} @Defop PLDULE4
+x{D756} @Defop PLDILE8
+x{D757} @Defop PLDULE8
+x{D758} @Defop LDILE4Q
+x{D759} @Defop LDULE4Q
+x{D75A} @Defop LDILE8Q
+x{D75B} @Defop LDULE8Q
+x{D75C} @Defop PLDILE4Q
+x{D75D} @Defop PLDULE4Q
+x{D75E} @Defop PLDILE8Q
+x{D75F} @Defop PLDULE8Q
+x{D760} @Defop LDZEROES
+x{D761} @Defop LDONES
+x{D762} @Defop LDSAME
+//
+// continuation / flow control primitives
+x{D8} dup @Defop EXECUTE @Defop CALLX
+x{D9} @Defop JMPX
+{ dup 1+
+  { <b x{DA} s, rot 4 u, swap 4 u, }
+  { drop <b x{DB0} s, swap 4 u,
+  } cond @addopb
+} : CALLXARGS
+x{DB1} @Defop(4u) JMPXARGS
+x{DB2} @Defop(4u) RETARGS
+x{DB30} dup @Defop RET @Defop RETTRUE
+x{DB31} dup @Defop RETALT @Defop RETFALSE
+x{DB32} dup @Defop BRANCH @Defop RETBOOL
+x{DB34} @Defop CALLCC
+x{DB35} @Defop JMPXDATA
+{ dup 1+ 0= { 16 + } if
+  <b x{DB36} rot 4 u, swap 4 u, @addopb
+} : CALLCCARGS
+x{DB38} @Defop CALLXVARARGS
+x{DB39} @Defop RETVARARGS
+x{DB3A} @Defop JMPXVARARGS
+x{DB3B} @Defop CALLCCVARARGS
+x{DB3C} @Defop(ref) CALLREF
+x{DB3D} @Defop(ref) JMPREF
+x{DB3E} @Defop(ref) JMPREFDATA
+x{DB3F} @Defop RETDATA
+// conditional and iterated execution primitives
+x{DC} @Defop IFRET
+x{DD} @Defop IFNOTRET
+x{DE} @Defop IF
+{ }> PUSHCONT IF } : }>IF
+x{DF} @Defop IFNOT
+{ }> PUSHCONT IFNOT } : }>IFNOT
+' IFNOTRET : IF:
+' IFRET : IFNOT:
+x{E0} @Defop IFJMP
+{ }> PUSHCONT IFJMP } : }>IFJMP
+{ { @normal? PUSHCONT IFJMP } @doafter<{ } : IFJMP:<{
+x{E1} @Defop IFNOTJMP
+{ }> PUSHCONT IFNOTJMP } : }>IFNOTJMP
+{ { @normal? PUSHCONT IFNOTJMP } @doafter<{ } : IFNOTJMP:<{
+x{E2} @Defop IFELSE
+{ `else @endblk } : }>ELSE<{
+{ `else: @endblk } : }>ELSE:
+{ PUSHCONT { @normal? PUSHCONT IFELSE } @doafter<{ } : @doifelse
+{ 1 { swap @normal? -rot PUSHCONT swap PUSHCONT IFELSE } does @doafter<{ } : @doifnotelse
+{ 
+  { dup `else eq? 
+    { drop @doifelse }
+    { dup `else: eq?
+      { drop PUSHCONT IFJMP }
+      { @normal? PUSHCONT IF
+      } cond 
+    } cond 
+  } @doafter<{ 
+} : IF:<{
+{ 
+  { dup `else eq? 
+    { drop @doifnotelse }
+    { dup `else: eq?
+      { drop PUSHCONT IFNOTJMP }
+      { @normal? PUSHCONT IFNOT
+      } cond 
+    } cond 
+  } @doafter<{ 
+} : IFNOT:<{
+x{E300} @Defop(ref) IFREF
+x{E301} @Defop(ref) IFNOTREF
+x{E302} @Defop(ref) IFJMPREF
+x{E303} @Defop(ref) IFNOTJMPREF
+x{E304} @Defop CONDSEL
+x{E305} @Defop CONDSELCHK
+x{E308} @Defop IFRETALT
+x{E309} @Defop IFNOTRETALT
+{ <b x{E39_} swap 5 u, @addopb } : IFBITJMP
+{ <b x{E3B_} swap 5 u, @addopb } : IFNBITJMP
+{ <b x{E3D_} swap 5 u, swap ref, @addopb } : IFBITJMPREF
+{ <b x{E3F_} swap 5 u, swap ref, @addopb } : IFNBITJMPREF
+x{E4} @Defop REPEAT
+{ }> PUSHCONT REPEAT } : }>REPEAT
+{ { @normal? PUSHCONT REPEAT } @doafter<{ } : REPEAT:<{
+x{E5} dup @Defop REPEATEND @Defop REPEAT:
+x{E6} @Defop UNTIL
+{ }> PUSHCONT UNTIL } : }>UNTIL
+{ { @normal? PUSHCONT UNTIL } @doafter<{ } : UNTIL:<{
+x{E7} dup @Defop UNTILEND @Defop UNTIL:
+x{E8} @Defop WHILE
+x{E9} @Defop WHILEEND
+{ `do @endblk } : }>DO<{
+{ `do: @endblk } : }>DO:
+{ PUSHCONT { @normal? PUSHCONT WHILE } @doafter<{ } : @dowhile
+{ 
+  { dup `do eq? 
+    { drop @dowhile } 
+    { `do: eq? not abort"`}>DO<{` expected" PUSHCONT WHILEEND 
+    } cond 
+  } @doafter<{ 
+} : WHILE:<{
+x{EA} @Defop AGAIN
+{ }> PUSHCONT AGAIN } : }>AGAIN
+{ { @normal? PUSHCONT AGAIN } @doafter<{ } : AGAIN:<{
+x{EB} dup @Defop AGAINEND @Defop AGAIN:
+//
+// continuation stack manipulation and continuation creation
+//
+{ <b x{EC} s, rot 4 u, swap dup 1+ { 16 + } ifnot 4 u, @addopb } : SETCONTARGS
+{ 0 swap SETCONTARGS } : SETNUMARGS
+x{ED0} @Defop(4u) RETURNARGS
+x{ED10} @Defop RETURNVARARGS
+x{ED11} @Defop SETCONTVARARGS
+x{ED12} @Defop SETNUMVARARGS
+x{ED1E} @Defop BLESS
+x{ED1F} @Defop BLESSVARARGS
+{ <b x{EE} s, rot 4 u, swap dup 1+ { 16 + } ifnot 4 u, @addopb } : BLESSARGS
+{ 0 swap BLESSARGS } : BLESSNUMARGS
+//
+// control register and continuation savelist manipulation
+// x{ED4} Defop(c) PUSHCTR
+// x{ED5} Defop(c) POPCTR
+{ c4 PUSHCTR } : PUSHROOT
+{ c4 POPCTR } : POPROOT
+x{ED6} dup @Defop(c) SETCONTCTR @Defop(c) SETCONT
+x{ED7} @Defop(c) SETRETCTR 
+x{ED8} @Defop(c) SETALTCTR 
+x{ED9} dup @Defop(c) POPSAVE @Defop(c) POPCTRSAVE
+x{EDA} dup @Defop(c) SAVE @Defop(c) SAVECTR
+x{EDB} dup @Defop(c) SAVEALT @Defop(c) SAVEALTCTR
+x{EDC} dup @Defop(c) SAVEBOTH @Defop(c) SAVEBOTHCTR
+x{EDE0} @Defop PUSHCTRX
+x{EDE1} @Defop POPCTRX
+x{EDE2} @Defop SETCONTCTRX
+x{EDF0} dup @Defop BOOLAND @Defop COMPOS
+x{EDF1} dup @Defop BOOLOR @Defop COMPOSALT
+x{EDF2} @Defop COMPOSBOTH
+x{EDF3} @Defop ATEXIT
+{ }> PUSHCONT ATEXIT } : }>ATEXIT
+{ { @normal? PUSHCONT ATEXIT } @doafter<{ } : ATEXIT:<{
+x{EDF4} @Defop ATEXITALT
+{ }> PUSHCONT ATEXITALT } : }>ATEXITALT
+{ { @normal? PUSHCONT ATEXITALT } @doafter<{ } : ATEXITALT:<{
+x{EDF5} @Defop SETEXITALT
+{ }> PUSHCONT SETEXITALT } : }>SETEXITALT
+{ { @normal? PUSHCONT SETEXITALT } @doafter<{ } : SETEXITALT:<{
+x{EDF6} @Defop THENRET
+x{EDF7} @Defop THENRETALT
+x{EDF8} @Defop INVERT
+x{EDF9} @Defop BOOLEVAL
+// x{EE} is BLESSARGS
+//
+// dictionary subroutine call/jump primitives
+{ c3 PUSH EXECUTE } : CALLVAR
+{ c3 PUSH JMPX } : JMPVAR
+{ c3 PUSH } : PREPAREVAR
+{ dup 14 ufits {
+    dup 8 ufits {
+      <b x{F0} s, swap 8 u, } {
+      <b x{F12_} s, swap 14 u,
+    } cond @addopb } {
+    PUSHINT CALLVAR
+  } cond
+} dup : CALL : CALLDICT
+{ dup 14 ufits
+  { <b x{F16_} s, swap 14 u, @addopb }
+  { PUSHINT JMPVAR } cond
+} dup : JMP : JMPDICT
+{ dup 14 ufits
+  { <b x{F1A_} s, swap 14 u, @addopb }
+  { PUSHINT c3 PREPAREVAR } cond
+} dup : PREPARE : PREPAREDICT
+//
+// throwing and handling exceptions
+{ dup 6 ufits
+  { <b x{F22_} s, swap 6 u, }
+  { <b x{F2C4_} s, swap 11 u,
+  } cond
+@addopb } : THROW
+{ dup 6 ufits
+  { <b x{F26_} s, swap 6 u, }
+  { <b x{F2D4_} s, swap 11 u,
+  } cond
+@addopb } : THROWIF
+{ dup 6 ufits
+  { <b x{F2A_} s, swap 6 u, }
+  { <b x{F2E4_} s, swap 11 u,
+  } cond
+@addopb } : THROWIFNOT
+{ <b x{F2CC_} s, swap 11 u, @addopb } : THROWARG
+{ <b x{F2DC_} s, swap 11 u, @addopb } : THROWARGIF
+{ <b x{F2EC_} s, swap 11 u, @addopb } : THROWARGIFNOT
+x{F2F0} @Defop THROWANY
+x{F2F1} @Defop THROWARGANY
+x{F2F2} @Defop THROWANYIF
+x{F2F3} @Defop THROWARGANYIF
+x{F2F4} @Defop THROWANYIFNOT
+x{F2F5} @Defop THROWARGANYIFNOT
+x{F2FF} @Defop TRY
+x{F3} @Defop(4u,4u) TRYARGS
+{ `catch @endblk } : }>CATCH<{
+{ PUSHCONT { @normal? PUSHCONT TRY } @doafter<{ } : @trycatch
+{ 
+  { `catch eq? not abort"`}>CATCH<{` expected" @trycatch
+  } @doafter<{ 
+} : TRY:<{
+//
+// dictionary manipulation
+' NULL : NEWDICT
+' ISNULL : DICTEMPTY
+' STSLICE : STDICTS
+x{F400} dup @Defop STDICT @Defop STOPTREF
+x{F401} dup @Defop SKIPDICT @Defop SKIPOPTREF
+x{F402} @Defop LDDICTS
+x{F403} @Defop PLDDICTS
+x{F404} dup @Defop LDDICT @Defop LDOPTREF
+x{F405} dup @Defop PLDDICT @Defop PLDOPTREF
+x{F406} @Defop LDDICTQ
+x{F407} @Defop PLDDICTQ
+
+x{F40A} @Defop DICTGET
+x{F40B} @Defop DICTGETREF
+x{F40C} @Defop DICTIGET
+x{F40D} @Defop DICTIGETREF
+x{F40E} @Defop DICTUGET
+x{F40F} @Defop DICTUGETREF
+
+x{F412} @Defop DICTSET
+x{F413} @Defop DICTSETREF
+x{F414} @Defop DICTISET
+x{F415} @Defop DICTISETREF
+x{F416} @Defop DICTUSET
+x{F417} @Defop DICTUSETREF
+x{F41A} @Defop DICTSETGET
+x{F41B} @Defop DICTSETGETREF
+x{F41C} @Defop DICTISETGET
+x{F41D} @Defop DICTISETGETREF
+x{F41E} @Defop DICTUSETGET
+x{F41F} @Defop DICTUSETGETREF
+
+x{F422} @Defop DICTREPLACE
+x{F423} @Defop DICTREPLACEREF
+x{F424} @Defop DICTIREPLACE
+x{F425} @Defop DICTIREPLACEREF
+x{F426} @Defop DICTUREPLACE
+x{F427} @Defop DICTUREPLACEREF
+x{F42A} @Defop DICTREPLACEGET
+x{F42B} @Defop DICTREPLACEGETREF
+x{F42C} @Defop DICTIREPLACEGET
+x{F42D} @Defop DICTIREPLACEGETREF
+x{F42E} @Defop DICTUREPLACEGET
+x{F42F} @Defop DICTUREPLACEGETREF
+
+x{F432} @Defop DICTADD
+x{F433} @Defop DICTADDREF
+x{F434} @Defop DICTIADD
+x{F435} @Defop DICTIADDREF
+x{F436} @Defop DICTUADD
+x{F437} @Defop DICTUADDREF
+x{F43A} @Defop DICTADDGET
+x{F43B} @Defop DICTADDGETREF
+x{F43C} @Defop DICTIADDGET
+x{F43D} @Defop DICTIADDGETREF
+x{F43E} @Defop DICTUADDGET
+x{F43F} @Defop DICTUADDGETREF
+
+x{F441} @Defop DICTSETB
+x{F442} @Defop DICTISETB
+x{F443} @Defop DICTUSETB
+x{F445} @Defop DICTSETGETB
+x{F446} @Defop DICTISETGETB
+x{F447} @Defop DICTUSETGETB
+
+x{F449} @Defop DICTREPLACEB
+x{F44A} @Defop DICTIREPLACEB
+x{F44B} @Defop DICTUREPLACEB
+x{F44D} @Defop DICTREPLACEGETB
+x{F44E} @Defop DICTIREPLACEGETB
+x{F44F} @Defop DICTUREPLACEGETB
+
+x{F451} @Defop DICTADDB
+x{F452} @Defop DICTIADDB
+x{F453} @Defop DICTUADDB
+x{F455} @Defop DICTADDGETB
+x{F456} @Defop DICTIADDGETB
+x{F457} @Defop DICTUADDGETB
+
+x{F459} @Defop DICTDEL
+x{F45A} @Defop DICTIDEL
+x{F45B} @Defop DICTUDEL
+
+x{F462} @Defop DICTDELGET
+x{F463} @Defop DICTDELGETREF
+x{F464} @Defop DICTIDELGET
+x{F465} @Defop DICTIDELGETREF
+x{F466} @Defop DICTUDELGET
+x{F467} @Defop DICTUDELGETREF
+
+x{F469} @Defop DICTGETOPTREF
+x{F46A} @Defop DICTIGETOPTREF
+x{F46B} @Defop DICTUGETOPTREF
+x{F46D} @Defop DICTSETGETOPTREF
+x{F46E} @Defop DICTISETGETOPTREF
+x{F46F} @Defop DICTUSETGETOPTREF
+
+x{F470} @Defop PFXDICTSET
+x{F471} @Defop PFXDICTREPLACE
+x{F472} @Defop PFXDICTADD
+x{F473} @Defop PFXDICTDEL
+
+x{F474} @Defop DICTGETNEXT
+x{F475} @Defop DICTGETNEXTEQ
+x{F476} @Defop DICTGETPREV
+x{F477} @Defop DICTGETPREVEQ
+x{F478} @Defop DICTIGETNEXT
+x{F479} @Defop DICTIGETNEXTEQ
+x{F47A} @Defop DICTIGETPREV
+x{F47B} @Defop DICTIGETPREVEQ
+x{F47C} @Defop DICTUGETNEXT
+x{F47D} @Defop DICTUGETNEXTEQ
+x{F47E} @Defop DICTUGETPREV
+x{F47F} @Defop DICTUGETPREVEQ
+
+x{F482} @Defop DICTMIN
+x{F483} @Defop DICTMINREF
+x{F484} @Defop DICTIMIN
+x{F485} @Defop DICTIMINREF
+x{F486} @Defop DICTUMIN
+x{F487} @Defop DICTUMINREF
+x{F48A} @Defop DICTMAX
+x{F48B} @Defop DICTMAXREF
+x{F48C} @Defop DICTIMAX
+x{F48D} @Defop DICTIMAXREF
+x{F48E} @Defop DICTUMAX
+x{F48F} @Defop DICTUMAXREF
+
+x{F492} @Defop DICTREMMIN
+x{F493} @Defop DICTREMMINREF
+x{F494} @Defop DICTIREMMIN
+x{F495} @Defop DICTIREMMINREF
+x{F496} @Defop DICTUREMMIN
+x{F497} @Defop DICTUREMMINREF
+x{F49A} @Defop DICTREMMAX
+x{F49B} @Defop DICTREMMAXREF
+x{F49C} @Defop DICTIREMMAX
+x{F49D} @Defop DICTIREMMAXREF
+x{F49E} @Defop DICTUREMMAX
+x{F49F} @Defop DICTUREMMAXREF
+
+x{F4A0} @Defop DICTIGETJMP
+x{F4A1} @Defop DICTUGETJMP
+x{F4A2} @Defop DICTIGETEXEC
+x{F4A3} @Defop DICTUGETEXEC
+{ dup sbitrefs tuck 1 > swap 1 <> or abort"not a dictionary" swap 1 u@ over <> abort"not a dictionary" } : @chkdicts
+{ dup null? tuck { <s } ifnot drop not } : @chkdict 
+{ over @chkdict
+  { swap <b x{F4A6_} s, swap ref, swap 10 u, @addopb }
+  { nip swap NEWDICT swap PUSHINT }
+  cond
+} : DICTPUSHCONST
+x{F4A8} @Defop PFXDICTGETQ
+x{F4A9} @Defop PFXDICTGET
+x{F4AA} @Defop PFXDICTGETJMP
+x{F4AB} @Defop PFXDICTGETEXEC
+{ over @chkdict
+  { swap <b x{F4AE_} s, swap ref, swap 10 u, @addopb
+  } if
+} dup : PFXDICTCONSTGETJMP : PFXDICTSWITCH
+
+x{F4B1} @Defop SUBDICTGET
+x{F4B2} @Defop SUBDICTIGET
+x{F4B3} @Defop SUBDICTUGET
+x{F4B5} @Defop SUBDICTRPGET
+x{F4B6} @Defop SUBDICTIRPGET
+x{F4B7} @Defop SUBDICTURPGET
+
+//
+// blockchain-specific primitives
+
+x{F800} @Defop ACCEPT
+x{F801} @Defop SETGASLIMIT
+
+x{F82} @Defop(4u) GETPARAM
+x{F823} @Defop NOW
+x{F824} @Defop BLOCKLT
+x{F825} @Defop LTIME
+x{F828} @Defop MYADDR
+x{F829} @Defop CONFIGROOT
+x{F830} @Defop CONFIGDICT
+x{F832} @Defop CONFIGPARAM
+x{F833} @Defop CONFIGOPTPARAM
+
+x{F840} @Defop GETGLOBVAR
+{ dup 1 31 @rangechk <b x{F85_} s, swap 5 u, @addopb } : GETGLOB
+x{F860} @Defop SETGLOBVAR
+{ dup 1 31 @rangechk <b x{F87_} s, swap 5 u, @addopb } : SETGLOB
+
+x{F900} @Defop HASHCU
+x{F901} @Defop HASHSU
+x{F902} @Defop SHA256U
+x{F910} @Defop CHKSIGNU
+x{F911} @Defop CHKSIGNS
+
+x{FA00} dup @Defop LDGRAMS @Defop LDVARUINT16
+x{FA01} @Defop LDVARINT16
+x{FA02} dup @Defop STGRAMS @Defop STVARUINT16
+x{FA03} @Defop STVARINT16
+
+x{FA40} @Defop LDMSGADDR
+x{FA41} @Defop LDMSGADDRQ
+x{FA42} @Defop PARSEMSGADDR
+x{FA43} @Defop PARSEMSGADDRQ
+x{FA44} @Defop REWRITESTDADDR
+x{FA45} @Defop REWRITESTDADDRQ
+x{FA46} @Defop REWRITEVARADDR
+x{FA47} @Defop REWRITEVARADDRQ
+
+x{FB00} @Defop SENDRAWMSG
+x{FB02} @Defop RAWRESERVE
+x{FB03} @Defop RAWRESERVEX
+x{FB04} @Defop SETCODE
+
+//
+// debug primitives
+
+{ dup 0 239 @-range abort"debug selector out of range"
+  <b x{FE} s, swap 8 u, @addopb
+} : DEBUG
+{ dup $len 1- <b x{FEF} s, swap 4 u, swap $, @addopb
+} : DEBUGSTR
+{ over $len <b x{FEF} s, swap 4 u, swap 8 u, swap $, @addopb
+} : DEBUGSTRI
+
+x{FE00} @Defop DUMPSTK
+{ 1 15 @rangechk <b x{FE0} s, swap 4 u, @addopb
+} : DUMPSTKTOP
+x{FE10} @Defop HEXDUMP
+x{FE11} @Defop HEXPRINT
+x{FE12} @Defop BINDUMP
+x{FE13} @Defop BINPRINT
+x{FE14} @Defop STRDUMP
+x{FE15} @Defop STRPRINT
+x{FE1E} @Defop DEBUGOFF
+x{FE1F} @Defop DEBUGON
+x{FE2} @Defop(s) DUMP
+x{FE3} @Defop(s) PRINT
+' DEBUGSTR : DUMPTOSFMT
+{ 0 DEBUGSTRI } : LOGSTR
+{ 1 DEBUGSTRI } : PRINTSTR
+x{FEF000} @Defop LOGFLUSH
+
+//
+// codepage primitives
+x{FF00} @Defop SETCP0
+x{FFF0} @Defop SETCPX
+{ dup -14 239 @-range abort"codepage out of range"
+  255 and <b x{FF} s, swap 8 u, @addopb
+} : SETCP
+
+//
+// provisions for defining programs consisting of several mutually-recursive procedures
+//
+variable @proccnt
+variable @proclist
+19 constant @procdictkeylen
+{ @proclist @ cons @proclist ! } : @proclistadd
+{ dup @procdictkeylen fits not abort"procedure index out of range"
+  1 'nop does swap dup @proclistadd 0 (create)
+} : @declproc
+{ @proccnt @ 1+ dup @proccnt ! @declproc } : @newproc
+{ 0 =: main  @proclist null!  @proccnt 0!
+  { bl word @newproc } : NEWPROC
+  { bl word dup (def?) ' drop ' @newproc cond } : DECLPROC
+  { bl word dup find
+    { nip execute <> abort"method redefined with different id" }
+    { swap @declproc }
+  cond } : DECLMETHOD
+  "main" @proclistadd
+  dictnew
+} : PROGRAM{
+{ dup sbits 1000 > { s>c <b swap ref, b> <s } if } : @adj-long-proc
+{ // d i s
+  @adj-long-proc swap rot @procdictkeylen idict!+ not abort"cannot define procedure, redefined?"
+} : PROC
+{ 2dup swap @procdictkeylen idict@ abort"procedure already defined"
+  1 { -rot @normal? b> <s PROC } does @doafter<{
+} : PROC:<{
+{ 0 swap @procdictkeylen idict@ not abort"`main` procedure not defined" drop
+} : @chkmaindef
+{ dup @chkmaindef
+  @proclist @ { dup null? not } {
+    uncons swap dup find not
+    { +": undefined procedure name in list" abort } if
+    execute 3 pick @procdictkeylen idict@ not
+    { +": procedure declared but left undefined" abort } if
+    drop (forget)
+  } while
+  drop @proclist null! @proccnt 0!
+} : }END
+forget @proclist  forget @proccnt
+{ }END <{ SETCP0 swap @procdictkeylen DICTPUSHCONST DICTIGETJMP 11 THROWARG }> } : }END>
+{ }END> b> } : }END>c
+{ }END>c <s } : }END>s
+
+0 constant recv_internal
+-1 constant recv_external
+-2 constant run_ticktock
+-3 constant split_prepare
+-4 constant split_install
+
+// ( c -- )   add vm library for later use with runvmcode
+{ <b over ref, b> <s swap hash vmlibs @ 256 udict! not abort"cannot add library" vmlibs ! } : add-lib
+// ( x -- c ) make library reference cell
+{ <b 2 8 u, swap 256 u, b>spec } : hash>libref
+// ( c -- c' )
+{ hash hash>libref } : >libref
diff --git a/submodules/ton/tonlib-src/crypto/fift/lib/Fift.fif b/submodules/ton/tonlib-src/crypto/fift/lib/Fift.fif
new file mode 100644
index 0000000000..292711e7ea
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/lib/Fift.fif
@@ -0,0 +1,83 @@
+{ 0 word drop 0 'nop } :: //
+{ char " word 1 { swap { abort } if drop } } ::_ abort"
+{ { bl word dup "" $= abort"comment extends after end of file" "*/" $= } until 0 'nop } :: /*
+// { bl word 1 2 ' (create) } "::" 1 (create)
+// { bl word 0 2 ' (create) } :: :
+// { bl word 2 2 ' (create) } :: :_
+// { bl word 3 2 ' (create) } :: ::_
+// { bl word 0 (create) } : create
+// { bl word (forget) } : forget
+{ bl word 1 ' (forget) } :: [forget]
+{ char " word 1 ' type } ::_ ."
+{ swap ({) over 2+ -roll swap (compile) (}) } : does
+{ 1 'nop does create } : constant
+{ 2 'nop does create } : 2constant
+{ hole constant } : variable
+10 constant ten
+{ bl word 1 { find 0= abort"word not found" } } :: (')
+{ bl word find not abort"-?" 0 swap } :: [compile]
+{ bl word 1 { 
+  dup find { " -?" $+ abort } ifnot nip execute
+} } :: @'
+{ bl word 1 { swap 1 'nop does swap 0 (create) }
+} :: =:
+{ bl word 1 { -rot 2 'nop does swap 0 (create) }
+} :: 2=:
+{ <b swap s, b> } : s>c
+{ s>c hash } : shash
+// to be more efficiently re-implemented in C++ in the future
+{ dup 0< ' negate if } : abs
+{ 2dup > ' swap if } : minmax
+{ minmax drop } : min
+{ minmax nip } : max
+"" constant <#
+' $reverse : #>
+{ swap 10 /mod char 0 + rot swap hold } : #
+{ { # over 0<= } until } : #s
+{ 0< { char - hold } if } : sign
+// { dup abs <# #s rot sign #> nip } : (.)
+// { (.) type } : ._
+// { ._ space } : .
+{ bl (-trailing) } : -trailing
+{ char 0 (-trailing) } : -trailing0
+{ char " word 1 ' $+ } ::_ +"
+{ find 0<> dup ' nip if } : (def?)
+{ bl word 1 ' (def?) } :: def?
+{ bl word 1 { (def?) not } } :: undef?
+{ def? ' skip-to-eof if } : skip-ifdef
+{ bl word dup (def?) { drop skip-to-eof } { 'nop swap 0 (create) } cond } : library
+{ bl word dup (def?) { 2drop skip-to-eof } { swap 1 'nop does swap 0 (create) } cond } : library-version
+{ char ) word "$" swap $+ 1 { find 0= abort"undefined parameter" execute } } ::_ $(
+// b s -- ?
+{ sbitrefs rot brembitrefs rot >= -rot <= and } : s-fits?
+{ 0 swap ! } : 0!
+{ tuck @ + swap ! } : +!
+{ tuck @ swap - swap ! } : -!
+{ 1 swap +! } : 1+!
+{ -1 swap +! } : 1-!
+{ null swap ! } : null!
+0 tuple constant nil
+{ 1 tuple } : single
+{ 2 tuple } : pair
+{ 3 tuple } : triple
+{ 1 untuple } : unsingle
+{ 2 untuple } : unpair
+{ 3 untuple } : untriple
+{ over tuple? { swap count = } { 2drop false } cond } : tuple-len?
+{ 0 tuple-len? } : nil?
+{ 1 tuple-len? } : single?
+{ 2 tuple-len? } : pair?
+{ 3 tuple-len? } : triple?
+{ 0 [] } : first
+{ 1 [] } : second
+{ 2 [] } : third
+' pair : cons
+' unpair : uncons
+{ 0 [] } : car
+{ 1 [] } : cdr
+{ cdr car } : cadr
+{ cdr cdr } : cddr
+{ cdr cdr car } : caddr
+{ null ' cons rot times } : list
+{ true (atom) drop } : atom
+{ bl word atom 1 'nop } ::_ `
diff --git a/submodules/ton/tonlib-src/crypto/fift/lib/Lisp.fif b/submodules/ton/tonlib-src/crypto/fift/lib/Lisp.fif
new file mode 100644
index 0000000000..fb91408d33
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/lib/Lisp.fif
@@ -0,0 +1,436 @@
+library Lisp  // tiny Lisp (or rather Scheme) interpreter
+"Lists.fif" include
+variable lisp-dict
+{ hole dup 1 { @ execute } does create } : recursive
+{ atom>$ +" undefined" abort } : report-not-found
+// a l -- d -1 or a 0  Look up definition d of atom a in dictionary l
+{ { dup null? { drop false true }
+    { uncons -rot unpair -rot over eq?
+      { drop nip true true } { nip swap false } cond
+    } cond
+  } until
+} : lookup-in
+// a dict -- def
+{ lookup-in ' report-not-found ifnot } : lookup-or-fail
+{ lisp-dict @ lookup-or-fail } : lisp-dict-lookup
+// a d --  Defines a with definition d in dictionary lisp-dict
+{ pair lisp-dict @ cons lisp-dict ! } : lisp-dict-int-define
+{ box lisp-dict-int-define } : lisp-dict-define
+// a d -- Defines new a with defininition d
+{ over lisp-dict @ lookup-in { 2drop atom>$ +" already defined" abort }
+  { drop lisp-dict-int-define } cond
+} : lisp-dict-int-define-new
+{ box lisp-dict-int-define-new } : lisp-dict-define-new
+// a e -- Defines a with executable definition given by e
+{ single lisp-dict-define-new } : lisp-dict-define-exec
+// expr ctx def -- val
+{ dup first execute } : run-definition
+// expr ctx -- val
+recursive lisp-ctx-eval {
+  over tuple?
+  { over first over lisp-ctx-eval run-definition }
+  { over atom? { lookup-or-fail @ } { drop } cond }
+  cond
+} swap !
+// exp -- value
+{ lisp-dict @ lisp-ctx-eval } : lisp-eval
+// (exprs) ctx -- (vals)
+recursive lisp-ctx-eval-list
+{ over null? { drop } {
+  swap uncons -rot over lisp-ctx-eval -rot lisp-ctx-eval-list cons
+  } cond 
+} swap !
+// (exprs) ctx -- val
+{ null rot {
+  dup null? { drop nip true } {
+  nip uncons swap 2 pick lisp-ctx-eval swap false
+  } cond } until
+} : lisp-ctx-eval-list-last
+// l c -- (args)
+{ swap uncons nip swap lisp-ctx-eval-list } : extract-eval-arg-list
+{ drop uncons nip } : extract-arg-list
+// (x1 .. xn) e n -- x1 .. xn e
+{ { swap uncons rot } swap times
+  swap null? not abort"invalid number of arguments"
+} : unpack-list
+// l c n e -- v
+{ swap 2swap extract-eval-arg-list  // e n (args)
+  -rot unpack-list execute
+} : eval-exec-fixed
+// l c n e -- v
+{ 2 pick pair
+  swap 2swap extract-arg-list  // [e c] n (args)
+  -rot unpack-list unpair swap execute
+} : exec-fixed
+// l c e -- v
+{ -rot extract-eval-arg-list  // e (args)
+  swap execute
+} : eval-exec-list
+{ -rot tuck extract-arg-list  // e c (args)
+  swap rot execute
+} : exec-list
+// e a n --
+{ rot 2 {  // expr ctx def n e
+    rot drop eval-exec-fixed } does
+  lisp-dict-define-exec
+} : lisp-fixed-primitive
+{ rot 2 { rot drop exec-fixed } does lisp-dict-define-exec
+} : lisp-fixed-lazy-primitive
+// e a --
+{ swap 1 { nip eval-exec-list } does lisp-dict-define-exec
+} : lisp-primitive
+{ swap 1 { nip exec-list } does lisp-dict-define-exec
+} : lisp-lazy-primitive
+
+// Uncomment next line for Fift booleans
+// false constant #f  true constant #t  null constant no-answer
+// Uncomment next line for Scheme booleans
+`#f constant #f  `#t constant #t  #f constant no-answer
+{ #f eq? } : lisp-false?
+{ lisp-false? 0= } : lisp-true?
+{ ' #t ' #f cond } : lisp-bool
+
+// temp for defining a lot of primitives
+{ bl word atom lisp-primitive } : L:
+{ bl word atom swap lisp-dict-define } : L=:
+{ bl word atom swap lisp-fixed-primitive } : #L:
+{ 0 #L: } : 0L:
+{ 1 #L: } : 1L:
+{ 2 #L: } : 2L:
+
+// basic primitives
+{ sum-list } L: +
+{ - } 2L: -
+{ dup null? { drop 1 } { ' * foldl-ne } cond } L: *
+{ / } 2L: /
+{ mod } 2L: modulo
+{ abs } 1L: abs
+{ ' min foldl-ne } L: min
+{ ' max foldl-ne } L: max
+{ true ' and foldl } L: integer-and
+{ false ' or foldl } L: integer-or
+{ 0 ' xor foldl } L: integer-xor
+{ not } 1L: integer-not
+{ = lisp-bool } 2L: =
+{ <> lisp-bool } 2L: <>
+{ < lisp-bool } 2L: <
+{ <= lisp-bool } 2L: <=
+{ > lisp-bool } 2L: >
+{ >= lisp-bool } 2L: >=
+{ eq? lisp-bool } 2L: eq?
+{ eqv? lisp-bool } 2L: eqv?
+{ equal? lisp-bool } 2L: equal?
+{ cons } 2L: cons
+{ car } 1L: car
+{ cdr } 1L: cdr
+{ cadr } 1L: cadr
+{ cddr } 1L: cddr
+{ caddr } 1L: caddr
+{ cdr cddr } 1L: cdddr
+{ concat-list-lists } L: append
+{ list-reverse } 1L: reverse
+{ list-tail } 2L: list-tail
+{ list-ref } 2L: list-ref
+{ list-member-eq } 2L: memq
+{ list-member-eqv } 2L: memv
+{ list-member-equal } 2L: member
+{ assq ' #f ifnot } 2L: assq
+{ assv ' #f ifnot } 2L: assv
+{ assoc ' #f ifnot } 2L: assoc
+{ list? lisp-bool } 1L: list?
+{ pair? lisp-bool } 1L: pair?
+{ tuple? lisp-bool } 1L: tuple?
+{ string? lisp-bool } 1L: string?
+{ integer? lisp-bool } 1L: integer?
+{ integer? lisp-bool } 1L: number?
+{ count } 1L: width
+{ list-length } 1L: length
+{ [] } 2L: tuple-ref
+{ first } 1L: first
+{ second } 1L: second
+{ third } 1L: third
+{ 3 [] } 1L: fourth
+{ list>tuple } 1L: list->tuple
+{ explode list } 1L: tuple->list
+null L=: null
+{ atom? lisp-bool } 1L: symbol?
+{ atom } 1L: string->symbol
+{ atom>$ } 1L: symbol->string
+{ dup #f eq? swap #t eq? or lisp-bool } 1L: boolean?
+#t L=: else
+#f L=: #f
+#t L=: #t
+{ null? lisp-bool } 1L: null?
+{ 0= lisp-bool } 1L: zero?
+{ 0> lisp-bool } 1L: positive?
+{ 0< lisp-bool } 1L: negative?
+{ 1 and 0= lisp-bool } 1L: even?
+{ 1 and 0<> lisp-bool } 1L: odd?
+{ bye } 0L: exit
+{ .l null } 1L: write
+{ lisp-eval } 1L: eval
+{ drop } `quote 1 lisp-fixed-lazy-primitive
+'nop L: list
+{ list>tuple } L: tuple
+{ list-last } L: begin
+{ $len } 1L: string-length
+{ concat-string-list } L: string-append
+{ $= lisp-bool } 2L: string=?
+{ $cmp 0< lisp-bool } 2L: string<?
+{ $cmp 0<= lisp-bool } 2L: string<=?
+{ $cmp 0> lisp-bool } 2L: string>?
+{ $cmp 0>= lisp-bool } 2L: string>=?
+{ (number) dup 1 = { drop } { ' 2drop if no-answer } cond
+} 1L: string->number
+{ (.) } 1L: number->string
+{ box? lisp-bool } 1L: box?
+{ box } 1L: box
+{ hole } 0L: new-box
+{ @ } 1L: unbox
+{ tuck swap ! } 2L: set-box!
+{ abort } 1L: error
+{ dup find { nip execute } { +" -?" abort } cond } : find-execute
+{ explode-list 1- roll find-execute } L: fift-exec
+{ explode-list dup 1- swap roll find-execute } L: fift-exec-cnt
+{ uncons swap find-execute } L: fift-exec-list
+// end of basic primitives
+forget L:  forget #L:  forget L=:
+forget 0L:  forget 1L:  forget 2L:
+
+{ { dup tuple? ' do-quote if } list-map } : map-quote
+{ uncons ' cons foldr-ne map-quote
+  null swap cons lisp-dict @ rot run-definition
+} `apply lisp-primitive  // bad: should have preserved original context
+// e1 e2 e3 ctx
+{ 3 exch 3 pick lisp-ctx-eval lisp-true? ' swap if nip swap lisp-ctx-eval }
+`if 3 lisp-fixed-lazy-primitive
+// (e) ctx
+{ #t -rot 
+  { over null? { 2drop true } {
+    swap uncons swap 2 pick lisp-ctx-eval dup lisp-true? // v' c t v ?
+    { swap 2swap nip false } { -rot 2drop nip true } cond
+  } cond } until
+} `and lisp-lazy-primitive
+{ #f -rot
+  { over null? { 2drop true } {
+    swap uncons swap 2 pick lisp-ctx-eval dup lisp-false? // v' c t v ?
+    { swap 2swap nip false } { -rot 2drop nip true } cond
+  } cond } until
+} `or lisp-lazy-primitive
+{ lisp-false? lisp-bool } `not 1 lisp-fixed-primitive
+// cond-clause ctx -- v -1 or 0
+{ swap uncons -rot dup `else eq? {
+  drop lisp-ctx-eval-list-last true } {
+  over lisp-ctx-eval lisp-true? {
+  lisp-ctx-eval-list-last true } {
+  2drop false
+  } cond } cond
+} : eval-cond-clause
+// (clauses) ctx -- v
+{ { over null? { no-answer true } {
+    swap uncons -rot over eval-cond-clause } cond 
+  } until -rot 2drop
+} `cond lisp-lazy-primitive
+{ lisp-dict @ lookup-in { hole tuck lisp-dict-int-define } ifnot
+} : lisp-create-global-var
+// a e ctx  -- old (simple) define
+{ drop over atom? not abort"only a variable can be define'd"
+  over lisp-create-global-var swap lisp-eval swap ! 
+} drop // `define 2 lisp-fixed-lazy-primitive
+{ tuck lisp-ctx-eval rot dup atom? not abort"only a variable can be set"
+  rot lookup-or-fail dup @ -rot !
+} `set! 2 lisp-fixed-lazy-primitive
+// define lambda
+{ { dup null? { drop true true }
+    { uncons swap atom? { false } { drop false true } cond } cond
+  } until
+} : var-list?
+{ { dup null? over atom? or { drop true true }
+    { uncons swap atom? { false } { drop false true } cond } cond
+  } until
+} : lambda-var-list?
+// (quote x) -- x -1 ; else 0
+{ dup pair? { uncons swap `quote eq? { car true } { drop false } cond }
+  { drop false } cond
+} : is-quote?
+recursive match-arg-list-acc
+// l (vars) (args) -- ((var . arg) ...)+l -1 or ? 0
+{ over atom? { over `_ eq? { 2drop } { pair swap cons } cond true } { 
+  over null? { nip null? } { // (vars) (args)
+  over tuple? not { 2drop false } {
+  over is-quote? { eq? nip } { // (v) (a)
+  dup tuple? not { 2drop false } {
+  over count over count over <> { drop 2drop false } { // l [v] [a] n
+  3 roll 0 rot { // [v] [a] l i
+    dup 0< {
+      3 pick over [] swap  // [v] [a] l vi i
+      3 pick over [] 2swap rot // [v] [a] i l vi ai
+      match-arg-list-acc { // [v] [a] i l'
+        swap 1+ } { nip -1 } cond
+    } ifnot
+  } swap times
+  2swap 2drop 0>=
+  } cond } cond } cond } cond } cond } cond
+} swap !
+{ null -rot match-arg-list-acc } : match-arg-list
+// ((var . arg)...) ctx -- ctx'
+{ { over null? not }
+  { swap uncons swap unpair box pair rot cons } while
+  nip
+} : extend-ctx-by-list
+// ((vars) body) ctx
+{ swap uncons -rot 
+  dup lambda-var-list? not abort"invalid formal parameter list"
+  { // l-expr ctx' [_ body ctx (vars)]
+    -rot 2 pick 3 [] swap rot  // [_ body ...] (vars) ctx' l-expr
+    uncons nip swap lisp-ctx-eval-list  // [_ body ...] (vars) (arg-vals)
+    match-arg-list not abort"invalid arguments to lambda" // [_ body ...] ((var arg)...)
+    over third extend-ctx-by-list // [_ body ctx (vars)] ctx''
+    swap second swap lisp-ctx-eval-list-last
+  } 3 -roll 4 tuple
+} : make-lambda
+{ make-lambda } `lambda lisp-lazy-primitive
+// (a e) ctx -- more sophisticated (define a e)
+{ drop uncons swap dup atom? { // (e) a 
+    tuck lisp-create-global-var
+    swap lisp-dict @ lisp-ctx-eval-list-last swap !
+  } { // (e) (a v..)
+    uncons over atom? not abort"only variables can be define'd"  // (e) a (v..)
+    rot cons over lisp-create-global-var   // a ((v..) (e)) h
+    swap lisp-dict @ make-lambda swap !
+  } cond
+} `define lisp-lazy-primitive
+// ((x e) ..) ctx -- ((x.v) ..)
+recursive eval-assign-list
+{ over null? { drop } {
+  swap uncons swap uncons // ctx t x (e)
+  over atom? not abort"invalid variable name in assignment list"
+  3 pick lisp-ctx-eval-list-last  // ctx t x v
+  pair swap rot eval-assign-list cons
+  } cond
+} swap !
+// (((x v) ..) body) ctx  -- let construct
+{ swap uncons swap 2 pick eval-assign-list  // ctx body ((x v)...)
+  rot extend-ctx-by-list lisp-ctx-eval-list-last
+} `let lisp-lazy-primitive
+// ((x e) ..) ctx -- ctx'
+{ swap {
+  dup null? { drop true } {
+  uncons swap uncons  // ctx t x (e)
+  over atom? not abort"invalid variable name in assignment list"
+  3 pick lisp-ctx-eval-list-last  // ctx t x v
+  box pair rot cons swap false
+  } cond } until
+} : compute-let*-ctx
+// (((x v) ..) body) ctx  -- let* construct
+{ swap uncons swap rot compute-let*-ctx lisp-ctx-eval-list-last
+} `let* lisp-lazy-primitive
+// ((x e) ..) ctx -- ((h e) ..) ctx' , with x bound to h in ctx'
+recursive prepare-letrec-ctx {
+  over null? {
+  swap uncons swap uncons swap // ctx t (e) x
+  hole tuck pair swap rot cons // ctx t (x.h) (h e)
+  3 -roll rot cons prepare-letrec-ctx // (h e) t ctx'
+  -rot cons swap
+  } ifnot
+} swap !
+// (((x v) ..) body) ctx  -- letrec construct
+{ swap uncons swap rot prepare-letrec-ctx swap { // body ctx' ((h e)..)
+    dup null? { drop true } {
+    uncons -rot uncons 2 pick lisp-ctx-eval-list-last // body t ctx' h v
+    swap ! swap false
+  } cond } until
+  lisp-ctx-eval-list-last
+} `letrec lisp-lazy-primitive
+// (e (p e)...) ctx -- match construct
+{ swap uncons swap 2 pick lisp-ctx-eval swap { // ctx v ((p e)..)
+  dup null? { drop 2drop no-answer true } {
+  uncons swap uncons swap 3 pick // ctx v t e p v
+  match-arg-list { // ctx v t e ((x' . v')...)
+  2swap 2drop rot extend-ctx-by-list lisp-ctx-eval-list-last true } {
+  2drop false
+  } cond } cond } until
+} `match lisp-lazy-primitive
+//
+lisp-dict @ constant original-lisp-dict
+{ original-lisp-dict lisp-dict ! } : reset-lisp
+{ ' drop { lisp-eval .l cr } List-generic( } :_ LISP-EVAL-PRINT(
+// LISP-EVAL-PRINT((+ 3 4) (* 5 6)) computes and prints 12 and 30
+{ hole dup 1 { @ nip } does swap 
+  1 { swap lisp-eval swap ! } does 
+  List-generic(
+} :_ LISP-EVAL(
+// LISP-EVAL((+ 3 4) (* 5 6)) computes 12 and 30, returns only 30
+// /*
+LISP-EVAL-PRINT(
+  (define succ (lambda (x) (+ x 1)))
+  (define (twice f) (lambda (x) (f (f x))))
+  (define (fact n) (if (= n 0) 1 (* n (fact (- n 1)))))
+  (fact ((twice succ) 5))
+  (define compare (lambda (x y) (cond ((< x y) 'less) ((= x y) 'equal) (else 'greater))))
+  (compare 2 3)
+  (compare 7 (+ 2 3))
+  (define next (let ((cnt 0)) (lambda () (set! cnt (+ cnt 1)) cnt)))
+  (list (next) (next))
+  (define new-counter (lambda () (let ((x 0)) (lambda () (set! x (+ x 1)) x))))
+  (define c1 (new-counter))
+  (define c2 (new-counter))
+  (list (c1) (c1) (c2) (c1) (c2) (c1) (c1) (c2) (c2))
+  (let* ((x (+ 2 3)) (y (* x x)) (z (+ x y))) (list x y z))
+  (letrec ((even? (lambda (n) (if (= n 0) #t (odd? (- n 1)))))
+           (odd?  (lambda (n) (if (= n 0) #f (even? (- n 1))))))
+          (even? 88))
+  (define (len l) (if (null? l) 0 (+ 1 (len (cdr l)))))
+  (len '(2 3 9))
+  (define (len2 l) (match l (() 0) ((x . t) (+ 1 (len2 t)))))
+  (len2 '(2 3 9))
+  (define (foo x) (match x
+     (('zero) 0)
+     (('succ x) (+ (foo x) 1))
+     (('plus x y) (+ (foo x) (foo y)))
+     (('minus x y) (- (foo x) (foo y)))
+     (x x)))
+  (foo '(plus (succ (zero)) (minus (succ (succ 5)) 3)))
+  (define (bar x) (match x
+     (['zero] 0)
+     (['succ x] (+ (bar x) 1))
+     (['plus x y] (+ (bar x) (bar y)))
+     (['minus x y] (- (bar x) (bar y)))
+     (['const x] x)))
+  (bar '[plus [succ [zero]] [minus [succ [succ [const 5]]] [const 3]]])
+  (define (map f l) (letrec
+    ((map-f (lambda (l) (match l
+      (() ())
+      ((h . t) (cons (f h) (map-f t)))))))
+    (map-f l)))
+  (map (lambda (x) (* x (+ 2 x))) '(2 3 9))
+  (define (make-promise proc) (let ((result-ready? #f) (result #f))
+    (lambda ()
+      (if result-ready? result
+        (let ((x (proc)))
+	  (if result-ready? result
+	    (begin (set! result x) (set! result-ready? #t) result)))))))
+  (define (force promise) (promise))
+)
+// */
+// words for invoking Lisp definitions from Fift
+// (args) def -- val
+{ null rot map-quote cons lisp-dict @ rot run-definition
+} : invoke-lisp-definition
+{ atom lisp-dict-lookup 1 { @ invoke-lisp-definition }
+} : (invoke-lisp)
+{ bl word (invoke-lisp) } :: invoke-lisp
+// ( 2 3 ) invoke-lisp compare .l
+{ atom lisp-dict-lookup 2 { @ mklist-1 invoke-lisp-definition }
+} : (invoke-lisp-fixed)
+{ bl word (invoke-lisp-fixed) } :: invoke-lisp-fixed
+// 9 8  2 invoke-lisp-fixed compare .l
+{ bl word (invoke-lisp) does } : make-lisp-invoker
+{ bl word (invoke-lisp-fixed) does } : make-lisp-fixed-invoker
+// 2 make-lisp-fixed-invoker compare : compare
+// 3 9 compare
+// import Lisp definitions as Fift words
+{ bl word dup (invoke-lisp) does swap 0 (create) } : import-lisp
+{ bl word tuck (invoke-lisp-fixed) does swap 0 (create) } : import-lisp-fixed
+// 1 import-lisp-fixed fact
+// 7 fact .
diff --git a/submodules/ton/tonlib-src/crypto/fift/lib/Lists.fif b/submodules/ton/tonlib-src/crypto/fift/lib/Lists.fif
new file mode 100644
index 0000000000..3d50ae0f4c
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/lib/Lists.fif
@@ -0,0 +1,184 @@
+library Lists  // List utilities
+//
+{ hole dup 1 { @ execute } does create } : recursive
+// x x' -- ?  recursively compares two S-expressions
+recursive equal? {
+  dup tuple? {
+    over tuple? {
+      over count over count over = { // t t' l ?
+        0 { dup 0>= { 2dup [] 3 pick 2 pick [] equal? { 1+ } { drop -1 } cond
+            } if } rot times
+        nip nip 0>=
+      } { drop 2drop false } cond
+    } { 2drop false } cond
+  } { eqv? } cond
+} swap !
+// (a1 .. an) -- (an .. a1)
+{ null swap { dup null? not } { uncons swap rot cons swap } while drop } : list-reverse
+// (a1 .. an) -- an   Computes last element of non-empty list l
+{ { uncons dup null? { drop true } { nip false } cond } until } : list-last
+// l l' -- l++l'  Concatenates two lists
+recursive list+ {
+  over null? { nip } { swap uncons rot list+ cons } cond
+} swap !
+// l l' -- l'' -1 or 0, where l = l' ++ l''
+// Removes prefix from list
+{ { dup null? { drop true true } {
+  swap dup null? { 2drop false true } { // l' l
+  uncons swap rot uncons -rot equal? { false } {
+  2drop false true
+  } cond } cond } cond } until
+} : list-
+// (a1 .. an) -- a1 .. an n   Explodes a list
+{ 0 { over null? not } { swap uncons rot 1+ } while nip } : explode-list
+// (a1 .. an) x -- a1 .. an n x   Explodes a list under the topmost element
+{ swap explode-list dup 1+ roll } : explode-list-1
+// l -- t   Transforms a list into a tuple with the same elements
+{ explode-list tuple } : list>tuple
+// a1 ... an n x -- (a1 .. an) x
+{ null swap rot { -rot cons swap } swap times } : mklist-1
+// (s1 ... sn) -- s1+...+sn   Concatenates a list of strings
+{ "" { over null? not } { swap uncons -rot $+ } while nip
+} : concat-string-list
+// (x1 ... xn) -- x1+...+xn   Sums a list of integers
+{ 0 { over null? not } { swap uncons -rot + } while nip
+} : sum-list
+// (a1 ... an) a e -- e(...e(e(a,a1),a2),...),an)
+{ -rot { over null? not } { swap uncons -rot 3 pick execute } while nip nip
+} : foldl
+// (a1 ... an) e -- e(...e(e(a1,a2),a3),...),an)
+{ swap uncons swap rot foldl } : foldl-ne
+// (a1 ... an) a e -- e(a1,e(a2,...,e(an,a)...))
+recursive foldr {
+  rot dup null? { 2drop } {
+    uncons -rot 2swap swap 3 pick foldr rot execute
+  } cond
+} swap !
+// (a1 ... an) e -- e(a1,e(a2,...,e(a[n-1],an)...))
+recursive foldr-ne {
+  over cdr null? { drop car } {
+    swap uncons 2 pick foldr-ne rot execute
+  } cond
+} swap !
+// (l1 ... ln) -- l1++...++ln   Concatenates a list of lists
+{ dup null? { ' list+ foldr-ne } ifnot } : concat-list-lists
+// (a1 .. an . t) n -- t   Computes the n-th tail of a list
+{ ' cdr swap times } : list-tail
+// (a0 .. an ..) n -- an   Computes the n-th element of a list
+{ list-tail car } : list-ref
+// l -- ?
+{ { dup null? { drop true true } {
+    dup pair? { cdr false } {
+    drop false true
+  } cond } cond } until
+} : list?
+// l -- n
+{ 0 { over null? not } { 1+ swap uncons nip swap } while nip
+} : list-length
+// l e -- t  // returns tail of l after first member that satisfies e
+{ swap {
+  dup null? { nip true } {
+  tuck car over execute { drop true } {
+  swap cdr false
+  } cond } cond } until
+} : list-tail-from
+// a l -- t  // tail of l after first occurence of a using eq?
+{ swap 1 ' eq? does list-tail-from } : list-member-eq
+{ swap 1 ' eqv? does list-tail-from } : list-member-eqv
+{ swap 1 ' equal? does list-tail-from } : list-member-equal
+// a l -- ?
+{ list-member-eq null? not } : list-member?
+{ list-member-eqv null? not } : list-member-eqv?
+// l -- a -1 or 0 // returns car l if l is non-empty
+{ dup null? { drop false } { car true } cond
+} : safe-car
+{ dup null? { drop false } { car second true } cond
+} : get-first-value
+// l e -- v -1 or 0
+{ list-tail-from safe-car } : assoc-gen
+{ list-tail-from get-first-value } : assoc-gen-x
+// a l -- (a.v) -1 or 0 -- returns first entry (a . v) in l
+{ swap 1 { swap first eq? } does assoc-gen } : assq
+{ swap 1 { swap first eqv? } does assoc-gen } : assv
+{ swap 1 { swap first equal? } does assoc-gen } : assoc
+// a l -- v -1 or 0 -- returns v from first entry (a . v) in l
+{ swap 1 { swap first eq? } does assoc-gen-x } : assq-val
+{ swap 1 { swap first eqv? } does assoc-gen-x } : assv-val
+{ swap 1 { swap first equal? } does assoc-gen-x } : assoc-val
+// (a1 .. an) e -- (e(a1) .. e(an))
+recursive list-map {
+  over null? { drop } {
+  swap uncons -rot over execute -rot list-map cons
+  } cond
+} swap !
+//
+// create Lisp-style lists using words "(" and ")"
+//
+variable ')
+'nop box constant ',
+{ ") without (" abort } ') ! 
+{ ') @ execute } : )
+anon constant dot-marker
+// m x1 ... xn t m -- (x1 ... xn . t)
+{ swap
+  { -rot 2dup eq? not }
+  { over dot-marker eq? abort"invalid dotted list"
+    swap rot cons } while 2drop
+} : list-tail-until-marker
+// m x1 ... xn m -- (x1 ... xn)
+{ null swap list-tail-until-marker } : list-until-marker
+{ over dot-marker eq? { nip 2dup eq? abort"invalid dotted list" }
+  { null swap } cond
+  list-tail-until-marker
+} : list-until-marker-ext
+{ ') @ ', @ } : ops-get
+{ ', ! ') ! } : ops-set
+{ anon dup ops-get 3 { ops-set list-until-marker-ext } does ') ! 'nop ', !
+} : (
+// test of Lisp-style lists
+// ( 42 ( `+ 9 ( `* 3 4 ) ) "test" ) .l cr
+// ( `eq? ( `* 3 4 ) 3 4 * ) .l cr
+// `alpha ( `beta `gamma `delta ) cons .l cr
+// { ( `eq? ( `* 3 5 pick ) 3 4 roll * ) } : 3*sample
+// 17 3*sample .l cr
+
+// similar syntax _( x1 .. xn ) for tuples
+{ 2 { 1+ 2dup pick eq? } until 3 - nip } : count-to-marker
+{ count-to-marker tuple nip } : tuple-until-marker
+{ anon dup ops-get 3 { ops-set tuple-until-marker } does ') ! 'nop ', ! } : _(
+// test of tuples
+// _( _( 2 "two" ) _( 3 "three" ) _( 4 "four" ) ) .dump cr
+
+// pseudo-Lisp tokenizer
+"()[]'" 34 hold constant lisp-delims
+{ lisp-delims 11 (word) } : lisp-token
+{ null cons `quote swap cons } : do-quote
+{ 1 { ', @ 2 { 2 { ', ! execute ', @ execute } does ', ! }
+      does ', ! } does
+} : postpone-prefix
+{ ', @ 1 { ', ! } does ', ! } : postpone-',
+( `( ' ( pair
+  `) ' ) pair
+  `[ ' _( pair
+  `] ' ) pair
+  `' ' do-quote postpone-prefix pair
+  `. ' dot-marker postpone-prefix pair
+  `" { char " word } pair
+  `;; { 0 word drop postpone-', } pair
+) constant lisp-token-dict
+variable eol
+{ eol @ eol 0! anon dup ') @ 'nop 3
+  { ops-set list-until-marker-ext true eol ! } does ') ! rot ', !
+  { lisp-token dup (number) dup { roll drop } {
+      drop atom dup lisp-token-dict assq { nip second execute } if
+    } cond
+    ', @ execute
+    eol @
+  } until
+  -rot eol ! execute
+} :_ List-generic(
+{ 'nop 'nop List-generic( } :_ LIST(
+// LIST((lambda (x) (+ x 1)) (* 3 4))
+// LIST('(+ 3 4))
+// LIST(2 3 "test" . 9)
+// LIST((process '[plus 3 4]))
diff --git a/submodules/ton/tonlib-src/crypto/fift/lib/Stack.fif b/submodules/ton/tonlib-src/crypto/fift/lib/Stack.fif
new file mode 100644
index 0000000000..c7ef6f8e58
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/lib/Stack.fif
@@ -0,0 +1,266 @@
+library Stack  // advanced stack manupulation library
+"Lists.fif" include
+// S(a b c - a c 2 a b) would compile to code performing the requested stack manipulation
+
+// interface to low-level stack manipulation primitives
+{ (number) 1- abort"index expected" dup 0 < over 255 > or
+  abort"index 0..255 expected"
+} : (idx)
+// push(n) : a0 .. an - a0 .. an a0  equivalent to "n pick"
+// push(0) = dup, push(1) = over
+{ 0 char ) word (idx) <push> } ::_ push(
+// pop(n) : a0 a1 .. a(n-1) an - an a1 .. a(n-1)
+// pop(0) = drop, pop(1) = nip
+{ 0 char ) word (idx) <pop> } ::_ pop(
+// xchg(i,j) : equivalent to "i j exch2"
+{ 0 char , word (idx) char ) word (idx) <xchg> } ::_ xchg(
+// xchg0(i) : equivalent to "i exch" or "xchg(0,i)"
+// xchg0(1) = swap
+{ 0 char ) word (idx) 0 <xchg> } ::_ xchg0(
+forget (idx)
+
+// parser for stack notation expressions
+")" 34 hold +"  -" constant stk-delims
+anon constant stk-start
+anon constant stk-to
+variable stk-mode
+{ stk-delims 11 (word) } : stk-token
+'nop : mk-lit
+// stk-start vn ... v0 -- stk-start ... v0 i  where v[i]=v0
+{ 0 {
+  1+ 2dup 2+ pick dup stk-start eq? { 2drop drop 0 true } { eqv? } cond
+  } until
+} : stk-lookup
+// stk-start a1 .. an stk-to b1 .. bm -- [a1 .. an] [b1 .. bm]
+{ stk-mode @ 0= abort"identifier expected" } : chk-lit
+{ stk-to list-until-marker stk-mode !
+  stk-start list-until-marker stk-mode @
+  stk-mode 0!
+} : build-stk-effect
+{ stk-start stk-mode 0! {
+  stk-token dup ")" $= { drop true } {
+  dup "-" $= {
+    drop stk-mode @ abort"duplicate -" true stk-mode ! stk-to false } {
+  dup 34 chr $= { chk-lit drop char " word mk-lit false } {
+  dup (number) ?dup { chk-lit 1- { swap mk-lit -rot } if mk-lit nip false } {
+  atom dup `_ eq? { stk-mode @ abort"identifier expected" false } {
+  stk-lookup 0= stk-mode @ = {
+    stk-mode @ { atom>$ +" -?" } { atom>$ +" redefined" } cond abort } {
+  false
+  } cond } cond } cond } cond } cond } cond } until
+  stk-mode @ 0= abort"'-' expected"
+  build-stk-effect
+} :_ parse-stk-list(
+
+// stack operation list construction
+variable op-rlist
+{ op-rlist null! } : clear-op-list
+{ op-rlist @ list-reverse } : get-op-list
+{ op-rlist @ cons op-rlist ! } : issue-op
+{ minmax `xchg -rot triple } : op-xchg
+{ `push swap pair } : op-push
+{ `lit swap pair } : op-lit
+{ `pop swap pair } : op-pop
+0 op-pop constant op-drop
+{ 2dup <> { op-xchg issue-op } if } : issue-xchg
+{ op-push issue-op } : issue-push
+{ op-lit issue-op } : issue-lit
+{ op-pop issue-op } : issue-pop
+{ op-drop issue-op } : issue-drop
+{ ' issue-drop swap times } : issue-drop-#
+
+// emulated stack contents
+variable emul-stk
+{ emul-stk @ count } : emul-depth
+{ emul-depth 1- swap - } : adj-i
+{ emul-depth 1- tuck swap - swap rot - swap } : adj-ij
+// i j --
+{ adj-ij 2dup emul-stk @ tuck swap [] swap rot [] rot // i sj si j
+  emul-stk @ -rot []= swap rot []= emul-stk !
+} : emul-xchg
+{ emul-stk @ tpop drop emul-stk ! } : emul-drop
+// i --
+{ 0 emul-xchg emul-drop } : emul-pop
+// i -- s[i]
+{ emul-stk @ swap [] } : emul-stk[]
+// i -- si
+{ adj-i emul-stk[] } : emul-get
+{ 0 emul-get } : emul-tos
+// v i -- ?   Check whether s[i]=v
+{ dup emul-depth < { emul-stk[] eqv? } { 2drop false } cond } : emul[]-eq?
+// v -- i or -1   Returns maximum i with s[i]=v
+{ emul-stk @ dup count { // v s i
+  ?dup 0= { -1 true } { 1- 2dup [] 3 pick eqv? } cond  // v s i' ?
+  } until nip nip
+} : emul-stk-lookup-rev
+// i --
+{ emul-get emul-stk @ swap , emul-stk ! } : emul-push
+{ emul-stk @ swap , emul-stk ! } : emul-lit
+// show emulated stack contents similarly to .s
+{ emul-stk @ explode dup 1 reverse ' .l swap times cr } : .e
+
+// both issue an operation and emulate it
+{ 2dup issue-xchg emul-xchg } : issue-emul-xchg
+{ dup issue-push emul-push } : issue-emul-push
+{ dup issue-lit emul-lit } : issue-emul-lit
+{ dup issue-pop emul-pop } : issue-emul-pop
+{ issue-drop emul-drop } : issue-emul-drop
+{ ' issue-emul-drop swap times } : issue-emul-drop-#
+
+// b.. s -- b.. s   moves tos value to stk[s]
+{ dup emul-stk[] 2 pick cdr list-member-eqv? {
+  dup adj-i 0 issue-emul-xchg } { dup adj-i issue-emul-pop } cond
+} : move-tos-to
+
+// new s -- ops registered
+{ { over null? not } {
+  // .sl .e get-op-list .l cr 
+  // get-op-list list-length 100 > abort"too long"
+  emul-depth over >
+    { over emul-tos swap list-member-eqv? not } { false } cond {
+  // b.. s  tos unneeded
+  issue-emul-drop } {
+  over car // b.. s b1
+  2dup swap emul[]-eq? { drop swap cdr swap 1+ } {
+  dup emul-stk-lookup-rev // b.. s b1 i
+  dup 0< { // b.. s b1 i  not found, must be a literal
+    drop dup atom? abort"unavailable value"
+    issue-emul-lit } {
+  dup 3 pick < { // b.. s b1 i  found in bottom s stack values
+    nip adj-i issue-emul-push  // b.. s
+    dup emul-depth 1- < { move-tos-to } if
+  } {
+  emul-depth 1- over = { // b.. s b1 i  found in tos
+    2drop move-tos-to
+  } { // b.. s b1 i
+    nip over adj-ij issue-emul-xchg
+  } cond } cond } cond } cond } cond } while
+  nip emul-depth swap - issue-emul-drop-#
+} : generate-reorder-ops
+
+// old new -- op-list
+{ emul-stk @ op-rlist @ 2swap 
+  swap list>tuple emul-stk ! clear-op-list
+  0 generate-reorder-ops get-op-list
+  -rot op-rlist ! emul-stk !
+} : generate-reorder
+{ parse-stk-list( generate-reorder } :_ SG(
+
+// op-list rewriting according to a ruleset 
+// l f l1 l2 -- l' -1 or l f  with l' = l2 + (l - l1)
+{ push(3) rot list- { list+ nip nip true } { drop } cond
+} : try-rule
+// l f ll -- l' -1 or l f
+{ { dup null? not } { uncons 3 -roll unpair try-rule rot } while drop
+} : try-ruleset
+// l ll -- l'
+{ swap { over false swap try-ruleset 0= } until nip
+} : try-ruleset*
+// l ruleset -- l'
+recursive try-ruleset*-everywhere {
+  tuck try-ruleset* dup null? { nip } {
+    uncons rot try-ruleset*-everywhere cons } cond
+} swap !
+LIST(
+ [([xchg 0 1] [xchg 0 2]) ([rot])]
+ [([xchg 0 1] [xchg 1 2]) ([-rot])]
+ [([xchg 0 2] [xchg 1 2]) ([rot])]
+ [([xchg 0 2] [xchg 0 1]) ([-rot])]
+ [([xchg 1 2] [xchg 0 1]) ([rot])]
+ [([xchg 1 2] [xchg 0 2]) ([-rot])]
+ [([xchg 0 1] [rot]) ([xchg 0 2])]
+ [([-rot] [xchg 0 1]) ([xchg 0 2])]
+ [([xchg 0 2] [xchg 1 3]) ([2swap])]
+ [([xchg 1 3] [xchg 0 2]) ([2swap])]
+ [([push 1] [push 1]) ([2dup])]
+ [([push 3] [push 3]) ([2over])]
+ [([pop 0] [pop 0]) ([2drop])]
+ [([pop 1] [pop 0]) ([2drop])]
+ [([xchg 0 1] [push 1]) ([tuck])]
+ [([rot] [-rot]) ()]
+ [([-rot] [rot]) ()]
+) constant fift-stack-ruleset
+{ fift-stack-ruleset try-ruleset*-everywhere } : fift-ops-rewrite
+{ SG( fift-ops-rewrite } :_ SGF(
+
+// helpers for creating Fift source strings for one fift-op
+// i j -- s
+{ minmax over { "xchg(" rot (.) $+ +"," swap (.) $+ +")" }
+  { nip dup 1 = { drop "swap" } { 
+    ?dup { "xchg0(" swap (.) $+ +")" } { "" } cond
+  } cond } cond
+} : source-<xchg>
+// i -- s
+{ dup 1 = { drop "over" } {
+  ?dup { "push(" swap (.) $+ +")" } { "dup" } cond
+  } cond
+} : source-<push>
+// i -- s
+{ dup 1 = { drop "nip" } {
+  ?dup { "pop(" swap (.) $+ +")" } { "drop" } cond
+  } cond
+} : source-<pop>
+// lit -- s
+{ dup string? { char " chr swap $+ char " hold } { (.) } cond
+} : source-<lit> 
+
+// dictionary with all fift op compilation/source creation
+{ 0 swap (compile) } : fop-compile
+( _( `xchg 2 { <xchg> fop-compile } { source-<xchg> swap cons } )
+  _( `push 1 { <push> fop-compile } { source-<push> swap cons } )
+  _( `pop 1 { <pop> fop-compile } { source-<pop> swap cons } )
+  _( `lit 1 { 1 'nop (compile) } { source-<lit> swap cons } )
+  _( `rot 0 { ' rot fop-compile } { "rot" swap cons } )
+  _( `-rot 0 { ' -rot fop-compile } { "-rot" swap cons } )
+  _( `tuck 0 { ' tuck fop-compile } { "tuck" swap cons } )
+  _( `2swap 0 { ' 2swap fop-compile } { "2swap" swap cons } )
+  _( `2drop 0 { ' 2drop fop-compile } { "2drop" swap cons } )
+  _( `2dup 0 { ' 2dup fop-compile } { "2dup" swap cons } )
+  _( `2over 0 { ' 2over fop-compile } { "2over" swap cons } )
+) box constant fift-op-dict
+
+{ dup atom? { atom>$ } { drop "" } cond
+  "unknown operation " swap $+ abort
+} : report-unknown-op
+variable 'fop-entry-exec
+// process fift-op according to 'fop-entry-exec
+// ... op - ...
+{ dup first dup fift-op-dict @ assq { report-unknown-op } ifnot
+  dup second 1+ push(3) count <> abort"incorrect param count"
+  nip swap explode dup roll drop 1- roll // o2 .. on entry
+  'fop-entry-exec @ execute 
+} : process-fift-op
+
+// compile op-list into Fift wordlist
+// wl op-list -- wl'
+{ { third execute } 'fop-entry-exec !
+  swap ' process-fift-op foldl } : compile-fift-op*
+// op-list -- e
+{ fift-ops-rewrite ({) swap compile-fift-op* (}) } : ops>wdef
+
+// S(<orig-stack> - <new-stack>) compiles a "word" performing required action
+{ SG( ops>wdef 0 swap } ::_ S(
+// 1 2 3 S(a b c - c a b a) .s  would print 3 1 2 1
+
+// transform op-list into Fift source
+// ls op -- ls'
+{ fift-ops-rewrite 
+  { 3 [] execute } 'fop-entry-exec !
+  null ' process-fift-op foldl
+  dup null? { drop "" } { { +" " swap $+ } foldr-ne } cond
+} : ops>$
+{ SG( ops>$ 1 'nop } ::_ $S(
+{ SG( ops>$ type } :_ .$S(
+// $S(a b c - b c a c a c) => string "rot 2dup over"
+// S(a b c - b c a c a c) => compile/execute block { rot 2dup over }
+// $S(_ x y _ - y x) => string "drop pop(2)"
+// .$S(x1 x2 - 17 x1) => print string "drop 17 swap"
+
+// simplify/transform sequences of stack manipulation operations
+LIST(. [a b c d e f g h i j]) constant std-stack
+{ stk-start std-stack explode drop stk-to std-stack explode drop
+} : simplify<{
+{ build-stk-effect generate-reorder ops>$ } : }>stack
+// simplify<{ drop drop over over -13 }>stack => string "2drop 2dup -13"
+// simplify<{ 17 rot }>stack => string "swap 17 swap"
+// simplify<{ 5 1 reverse }>stack => string "xchg(1,5) xchg(2,4)"
diff --git a/submodules/ton/tonlib-src/crypto/fift/lib/TonUtil.fif b/submodules/ton/tonlib-src/crypto/fift/lib/TonUtil.fif
new file mode 100644
index 0000000000..2e2484ad26
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/lib/TonUtil.fif
@@ -0,0 +1,125 @@
+library TonUtil // TON Blockchain Fift Library
+"Lists.fif" include
+
+-1 constant Masterchain
+0 constant Basechain
+
+// parse workchain id
+// ( S -- workchain )
+{ (number) 1- abort"workchain id must be an integer"
+  dup 32 fits not abort"workchain id must fit in 32 bits"
+} : parse-workchain-id
+
+{ (number) 1- abort"integer expected" } : parse-int
+
+// Private key load/generate
+// ( fname -- pubkey privkey )
+{ dup ."Loading private key from file " type cr 
+  file>B dup Blen 32 <> abort"Private key must be exactly 32 bytes long"
+  dup priv>pub swap 
+} : load-keypair
+// ( fname -- pubkey privkey )
+{ dup file-exists?
+  { load-keypair }
+  { dup newkeypair swap rot over swap B>file
+    rot ."Saved new private key to file " type cr 
+  } cond
+} : load-generate-keypair
+
+// Parse smart-contract address
+// ( S -- workchain addr bounce? )
+{ $>smca not abort"invalid smart-contract address"
+  1 and 0= 
+} : parse-smc-addr
+
+// ( wc addr -- )  Show address in <workchain>:<account> form
+{ swap ._ .":" x. } : .addr
+// ( wc addr flags -- )  Show address in base64url form
+{ smca>$ type } : .Addr
+// ( wc addr fname -- )  Save address to file in 36-byte format
+{ -rot 256 u>B swap 32 i>B B+ swap B>file } : save-address
+// ( wc addr fname -- )  Save address and print message
+{ dup ."(Saving address to file " type .")" cr save-address
+} : save-address-verbose
+
+// ( fname -- wc addr )  Load address from file
+{ file>B 32 B| 
+  dup Blen { 32 B>i@ } { drop Basechain } cond
+  swap 256 B>u@
+} : load-address
+// ( fname -- wc addr )  Load address from file and print message
+{ dup ."(Loading address from file " type .")" cr load-address
+} : load-address-verbose
+// Parse string as address or load address from file (if string is prefixed by @)
+// ( S default-bounce -- workchain addr bounce? )
+{ over $len 0= abort"empty smart-contract address"
+  swap dup 1 $| swap "@" $=
+  { nip load-address rot } { drop nip parse-smc-addr } cond
+} : parse-load-address
+
+// ( hex-str -- addr )  Parses ADNL address
+{ dup $len 64 <> abort"ADNL address must consist of exactly 64 hexadecimal characters"
+  (hex-number) 1 <> abort"ADNL address must consist of 64 hexadecimal characters"
+  dup 256 ufits not abort"invalid ADNL address"
+} : parse-adnl-address
+
+// ( b wc addr -- b' )  Serializes address into Builder b
+{ -rot 8 i, swap 256 u, } : addr, 
+
+// Gram utilities
+1000000000 constant Gram
+{ Gram swap */r } : Gram*/
+{ Gram * } : Gram*
+// ( S -- nanograms )
+{ (number) ?dup 0= abort"not a valid Gram amount"
+1- ' Gram*/ ' Gram* cond
+} : $>GR
+{ bl word $>GR 1 'nop } ::_ GR$
+// ( nanograms -- S )
+{ dup abs <# ' # 9 times char . hold #s rot sign #>
+nip -trailing0 } : (.GR)
+{ (.GR) ."GR$" type space } : .GR
+
+// b x -- b'  ( serializes a Gram amount )
+{ -1 { 1+ 2dup 8 * ufits } until
+  rot over 4 u, -rot 8 * u, } : Gram,
+// s -- x s'  ( deserializes a Gram amount )
+{ 4 u@+ swap 8 * u@+ } : Gram@+
+// s -- x
+{ 4 u@+ swap 8 * u@ } : Gram@
+
+// currency collections
+// b x --> b'  ( serializes a VarUInteger32 )
+{ -1 { 1+ 2dup 8 * ufits } until
+  rot over 5 u, -rot 8 * u, } : VarUInt32,
+// s --> x  ( deserializes a VarUInteger32 )
+{ 5 u@+ swap 8 * u@ } : VarUInt32@
+32 constant cc-key-bits
+' VarUInt32, : val,
+' VarUInt32@ : val@
+// d k v -- d'
+{ <b swap val, b> <s swap rot cc-key-bits idict! not abort"cannot add key-value to CurrencyCollection" } : +ccpair
+dictnew constant cc0   // zero currency collection
+// ( v k -- d )  Creates currency collection representing v units of currency k
+{ cc0 swap rot +ccpair } : of-cc
+{ dictnew { over null? not } { swap uncons -rot unpair +ccpair } while nip } : list>cc
+{ dup null? { ."(null) " drop } { val@ . } cond } dup : .maybeVarUInt32 : .val
+{ cc-key-bits { swap 32 1<< rmod . ."-> " .val ."; " true } dictforeach drop cr } : .cc
+{ cc-key-bits { rot . ."-> " swap .val .val ."; " true } dictdiff drop cr } : show-cc-diff
+{ cc-key-bits { val@ swap val@ + val, true } dictmerge } : cc+
+{ null swap cc-key-bits { val@ pair swap cons true } dictforeach drop } : cc>list-rev
+{ cc>list-rev list-reverse } : cc>list
+forget val,  forget val@  forget .val
+
+// Libraries
+// ( -- D )  New empty library collection
+' dictnew : Libs{
+// ( D -- D )  Return library collection as dictionary
+'nop : }Libs
+// ( D c x -- D' )  Add a public/private library c to collection D
+{ <b swap 1 u, over ref, b> <s swap hash rot 256 udict!+
+  0= abort"duplicate library in collection" } : lib+
+// ( D c -- D' )  Add private library c to collection D
+{ 0 lib+ } : private_lib
+// ( D c -- D' )  Add public library c to collection D
+{ 1 lib+ } : public_lib
diff --git a/submodules/ton/tonlib-src/crypto/fift/utils.cpp b/submodules/ton/tonlib-src/crypto/fift/utils.cpp
new file mode 100644
index 0000000000..e5f9a597e5
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/utils.cpp
@@ -0,0 +1,175 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "utils.h"
+#include "words.h"
+#include "td/utils/PathView.h"
+#include "td/utils/filesystem.h"
+#include "td/utils/port/path.h"
+
+namespace fift {
+namespace {
+
+std::string fift_dir(std::string dir) {
+  return dir.size() > 0 ? dir : td::PathView(td::realpath(__FILE__).move_as_ok()).parent_dir().str() + "lib/";
+}
+td::Result<std::string> load_source(std::string name, std::string dir = "") {
+  return td::read_file_str(fift_dir(dir) + name);
+}
+td::Result<std::string> load_Fift_fif(std::string dir = "") {
+  return load_source("Fift.fif", dir);
+}
+td::Result<std::string> load_Asm_fif(std::string dir = "") {
+  return load_source("Asm.fif", dir);
+}
+td::Result<std::string> load_TonUtil_fif(std::string dir = "") {
+  return load_source("TonUtil.fif", dir);
+}
+td::Result<std::string> load_Lists_fif(std::string dir = "") {
+  return load_source("Lists.fif", dir);
+}
+
+class MemoryFileLoader : public fift::FileLoader {
+ public:
+  td::Result<fift::FileLoader::File> read_file(td::CSlice filename) override {
+    auto it = files_.find(filename);
+    if (it == files_.end()) {
+      return td::Status::Error("File not found");
+    }
+    fift::FileLoader::File res;
+    res.data = it->second;
+    res.path = it->first;
+    return std::move(res);
+  }
+
+  td::Status write_file(td::CSlice filename, td::Slice data) override {
+    files_[filename.str()] = data.str();
+    return td::Status::OK();
+  }
+
+  void add_file(std::string path, std::string data) {
+    files_[path] = std::move(data);
+  }
+  td::Result<File> read_file_part(td::CSlice filename, td::int64 size, td::int64 offset) override {
+    auto it = files_.find(filename);
+    if (it == files_.end()) {
+      return td::Status::Error("File not found");
+    }
+    fift::FileLoader::File res;
+    if (static_cast<td::int64>(it->second.size()) < offset) {
+      return td::Status::Error("Offset too large");
+    }
+    if (size > static_cast<td::int64>(it->second.size())) {
+      size = static_cast<td::int64>(it->second.size());
+    }
+    res.data = td::Slice(it->second).substr(td::narrow_cast<size_t>(offset), td::narrow_cast<size_t>(size)).str();
+    res.path = it->first;
+    return std::move(res);
+  }
+
+  bool is_file_exists(td::CSlice filename) override {
+    return files_.count(filename) != 0;
+  }
+
+ private:
+  std::map<std::string, std::string, std::less<>> files_;
+};
+
+td::Result<fift::SourceLookup> create_source_lookup(std::string main, bool need_preamble = true, bool need_asm = true,
+                                                    bool need_ton_util = true, std::string dir = "") {
+  auto loader = std::make_unique<MemoryFileLoader>();
+  loader->add_file("/main.fif", std::move(main));
+  if (need_preamble) {
+    TRY_RESULT(f, load_Fift_fif(dir));
+    loader->add_file("/Fift.fif", std::move(f));
+  }
+  if (need_asm) {
+    TRY_RESULT(f, load_Asm_fif(dir));
+    loader->add_file("/Asm.fif", std::move(f));
+  }
+  if (need_ton_util) {
+    {
+      TRY_RESULT(f, load_Lists_fif(dir));
+      loader->add_file("/Lists.fif", std::move(f));
+    }
+    {
+      TRY_RESULT(f, load_TonUtil_fif(dir));
+      loader->add_file("/TonUtil.fif", std::move(f));
+    }
+  }
+  auto res = fift::SourceLookup(std::move(loader));
+  res.add_include_path("/");
+  return std::move(res);
+}
+
+td::Result<fift::SourceLookup> run_fift(fift::SourceLookup source_lookup, std::ostream *stream,
+                                        bool preload_fift = true, std::vector<std::string> args = {}) {
+  fift::Fift::Config config;
+  config.source_lookup = std::move(source_lookup);
+  fift::init_words_common(config.dictionary);
+  fift::init_words_vm(config.dictionary);
+  fift::init_words_ton(config.dictionary);
+  config.error_stream = stream;
+  config.output_stream = stream;
+  if (args.size() != 0) {
+    std::vector<const char *> argv;
+    for (auto &arg : args) {
+      argv.push_back(arg.c_str());
+    }
+    fift::import_cmdline_args(config.dictionary, argv[0], td::narrow_cast<int>(argv.size() - 1), argv.data() + 1);
+  }
+  fift::Fift fift{std::move(config)};
+  if (preload_fift) {
+    TRY_STATUS(fift.interpret_file("Fift.fif", ""));
+  }
+  TRY_STATUS(fift.interpret_file("main.fif", ""));
+  return std::move(fift.config().source_lookup);
+}
+}  // namespace
+td::Result<FiftOutput> mem_run_fift(std::string source, std::vector<std::string> args, std::string fift_dir) {
+  std::stringstream ss;
+  TRY_RESULT(source_lookup, create_source_lookup(source, true, true, true, fift_dir));
+  TRY_RESULT_ASSIGN(source_lookup, run_fift(std::move(source_lookup), &ss, true, std::move(args)));
+  FiftOutput res;
+  res.source_lookup = std::move(source_lookup);
+  res.output = ss.str();
+  return std::move(res);
+}
+td::Result<FiftOutput> mem_run_fift(SourceLookup source_lookup, std::vector<std::string> args) {
+  std::stringstream ss;
+  TRY_RESULT_ASSIGN(source_lookup, run_fift(std::move(source_lookup), &ss, true, std::move(args)));
+  FiftOutput res;
+  res.source_lookup = std::move(source_lookup);
+  res.output = ss.str();
+  return std::move(res);
+}
+td::Result<fift::SourceLookup> create_mem_source_lookup(std::string main, std::string fift_dir, bool need_preamble,
+                                                        bool need_asm, bool need_ton_util) {
+  return create_source_lookup(main, need_preamble, need_asm, need_ton_util, fift_dir);
+}
+
+td::Result<td::Ref<vm::Cell>> compile_asm(td::Slice asm_code, std::string fift_dir) {
+  std::stringstream ss;
+  TRY_RESULT(source_lookup,
+             create_source_lookup(PSTRING() << "\"Asm.fif\" include\n<{ " << asm_code << "\n}>c boc>B \"res\" B>file",
+                                  true, true, true, fift_dir));
+  TRY_RESULT(res, run_fift(std::move(source_lookup), &ss));
+  TRY_RESULT(boc, res.read_file("res"));
+  return vm::std_boc_deserialize(std::move(boc.data));
+}
+}  // namespace fift
diff --git a/submodules/ton/tonlib-src/crypto/fift/utils.h b/submodules/ton/tonlib-src/crypto/fift/utils.h
new file mode 100644
index 0000000000..e6ed145287
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/utils.h
@@ -0,0 +1,35 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "Fift.h"
+#include <vector>
+
+namespace fift {
+struct FiftOutput {
+  SourceLookup source_lookup;
+  std::string output;
+};
+td::Result<fift::SourceLookup> create_mem_source_lookup(std::string main, std::string fift_dir = "",
+                                                        bool need_preamble = true, bool need_asm = true,
+                                                        bool need_ton_util = true);
+td::Result<FiftOutput> mem_run_fift(std::string source, std::vector<std::string> args = {}, std::string fift_dir = "");
+td::Result<FiftOutput> mem_run_fift(SourceLookup source_lookup, std::vector<std::string> args);
+td::Result<td::Ref<vm::Cell>> compile_asm(td::Slice asm_code, std::string fift_dir = "");
+}  // namespace fift
diff --git a/submodules/ton/tonlib-src/crypto/fift/words.cpp b/submodules/ton/tonlib-src/crypto/fift/words.cpp
new file mode 100644
index 0000000000..f744273cc9
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/words.cpp
@@ -0,0 +1,2831 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "words.h"
+
+#include "Dictionary.h"
+#include "IntCtx.h"
+#include "SourceLookup.h"
+
+#include "common/refcnt.hpp"
+#include "common/bigint.hpp"
+#include "common/refint.h"
+#include "common/bitstring.h"
+#include "common/util.h"
+
+#include "Ed25519.h"
+
+#include "vm/cells.h"
+#include "vm/cellslice.h"
+#include "vm/continuation.h"
+#include "vm/cp0.h"
+#include "vm/dict.h"
+#include "vm/boc.h"
+
+#include "vm/box.hpp"
+#include "vm/atom.h"
+
+#include "block/block.h"
+
+#include "td/utils/filesystem.h"
+#include "td/utils/misc.h"
+#include "td/utils/optional.h"
+#include "td/utils/PathView.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/port/Stat.h"
+#include "td/utils/Timer.h"
+#include "td/utils/tl_helpers.h"
+#include "td/utils/crypto.h"
+
+#include <ctime>
+
+namespace fift {
+
+void show_total_cells(std::ostream& stream) {
+  stream << "total cells = " << vm::DataCell::get_total_data_cells() << std::endl;
+}
+
+void do_compile(vm::Stack& stack, Ref<WordDef> word_def);
+void do_compile_literals(vm::Stack& stack, int count);
+
+void interpret_dot(IntCtx& ctx, bool space_after) {
+  *ctx.output_stream << dec_string2(ctx.stack.pop_int()) << (space_after ? " " : "");
+}
+
+void interpret_dothex(IntCtx& ctx, bool upcase, bool space_after) {
+  *ctx.output_stream << hex_string(ctx.stack.pop_int(), upcase) << (space_after ? " " : "");
+}
+
+void interpret_dotbinary(IntCtx& ctx, bool space_after) {
+  *ctx.output_stream << binary_string(ctx.stack.pop_int()) << (space_after ? " " : "");
+}
+
+void interpret_dot_cellslice_rec(IntCtx& ctx) {
+  auto cs = ctx.stack.pop_cellslice();
+  cs->print_rec(*ctx.output_stream);
+}
+
+void interpret_dotstack(IntCtx& ctx) {
+  for (int i = ctx.stack.depth(); i > 0; i--) {
+    ctx.stack[i - 1].dump(*ctx.output_stream);
+    *ctx.output_stream << ' ';
+  }
+  *ctx.output_stream << std::endl;
+}
+
+void interpret_dotstack_list(IntCtx& ctx) {
+  for (int i = ctx.stack.depth(); i > 0; i--) {
+    ctx.stack[i - 1].print_list(*ctx.output_stream);
+    *ctx.output_stream << ' ';
+  }
+  *ctx.output_stream << std::endl;
+}
+
+void interpret_dump(IntCtx& ctx) {
+  ctx.stack.pop_chk().dump(*ctx.output_stream);
+  *ctx.output_stream << ' ';
+}
+
+void interpret_dump_internal(vm::Stack& stack) {
+  stack.push_string(stack.pop_chk().to_string());
+}
+
+void interpret_print_list(IntCtx& ctx) {
+  ctx.stack.pop_chk().print_list(*ctx.output_stream);
+  *ctx.output_stream << ' ';
+}
+
+void interpret_dottc(IntCtx& ctx) {
+  show_total_cells(*ctx.output_stream);
+}
+
+void interpret_dot_internal(vm::Stack& stack) {
+  stack.push_string(dec_string2(stack.pop_int()));
+}
+
+void interpret_dothex_internal(vm::Stack& stack, bool upcase) {
+  stack.push_string(hex_string(stack.pop_int(), upcase));
+}
+
+void interpret_dotbinary_internal(vm::Stack& stack) {
+  stack.push_string(binary_string(stack.pop_int()));
+}
+
+void interpret_plus(vm::Stack& stack) {
+  stack.push_int(stack.pop_int() + stack.pop_int());
+}
+
+void interpret_cond_dup(vm::Stack& stack) {
+  auto x = stack.pop_int();
+  if (x->sgn()) {
+    stack.push_int(x);
+  }
+  stack.push_int(std::move(x));
+}
+
+void interpret_plus_tiny(vm::Stack& stack, long long y) {
+  stack.push_int(stack.pop_int() + y);
+}
+
+void interpret_minus(vm::Stack& stack) {
+  auto y = stack.pop_int();
+  stack.push_int(stack.pop_int() - y);
+}
+
+void interpret_times(vm::Stack& stack) {
+  stack.push_int(stack.pop_int() * stack.pop_int());
+}
+
+void interpret_div(vm::Stack& stack, int round_mode) {
+  auto y = stack.pop_int();
+  stack.push_int(td::div(stack.pop_int(), y, round_mode));
+}
+
+void interpret_mod(vm::Stack& stack, int round_mode) {
+  auto y = stack.pop_int();
+  stack.push_int(td::mod(stack.pop_int(), y, round_mode));
+}
+
+void interpret_divmod(vm::Stack& stack, int round_mode) {
+  auto y = stack.pop_int();
+  auto dm = td::divmod(stack.pop_int(), std::move(y), round_mode);
+  stack.push_int(std::move(dm.first));
+  stack.push_int(std::move(dm.second));
+}
+
+void interpret_times_div(vm::Stack& stack, int round_mode) {
+  auto z = stack.pop_int();
+  auto y = stack.pop_int();
+  auto x = stack.pop_int();
+  td::BigIntG<257 * 2> tmp{0};
+  tmp.add_mul(*x, *y);
+  auto q = td::RefInt256{true};
+  tmp.mod_div(*z, q.unique_write(), round_mode);
+  q.unique_write().normalize();
+  stack.push_int(std::move(q));
+}
+
+void interpret_times_divmod(vm::Stack& stack, int round_mode) {
+  auto z = stack.pop_int();
+  auto y = stack.pop_int();
+  auto x = stack.pop_int();
+  td::BigIntG<257 * 2> tmp{0};
+  tmp.add_mul(*x, *y);
+  auto q = td::RefInt256{true};
+  tmp.mod_div(*z, q.unique_write(), round_mode);
+  q.unique_write().normalize();
+  auto r = td::RefInt256{true, tmp};
+  stack.push_int(std::move(q));
+  stack.push_int(std::move(r));
+}
+
+void interpret_times_mod(vm::Stack& stack, int round_mode) {
+  auto z = stack.pop_int();
+  auto y = stack.pop_int();
+  auto x = stack.pop_int();
+  td::BigIntG<257 * 2> tmp{0};
+  tmp.add_mul(*x, *y);
+  td::BigIntG<257 * 2> q;
+  tmp.mod_div(*z, q, round_mode);
+  auto r = td::RefInt256{true, tmp};
+  stack.push_int(std::move(r));
+}
+
+void interpret_negate(vm::Stack& stack) {
+  stack.push_int(-stack.pop_int());
+}
+
+void interpret_const(vm::Stack& stack, long long val) {
+  stack.push_smallint(val);
+}
+
+void interpret_big_const(vm::Stack& stack, td::RefInt256 val) {
+  stack.push_int(std::move(val));
+}
+
+void interpret_literal(vm::Stack& stack, vm::StackEntry se) {
+  stack.push(std::move(se));
+}
+
+void interpret_cmp(vm::Stack& stack, const char opt[3]) {
+  auto y = stack.pop_int();
+  auto x = stack.pop_int();
+  int r = x->cmp(*y);
+  assert((unsigned)(r + 1) <= 2);
+  stack.push_smallint(((const signed char*)opt)[r + 1]);
+}
+
+void interpret_sgn(vm::Stack& stack, const char opt[3]) {
+  auto x = stack.pop_int();
+  int r = x->sgn();
+  assert((unsigned)(r + 1) <= 2);
+  stack.push_smallint(((const signed char*)opt)[r + 1]);
+}
+
+void interpret_fits(vm::Stack& stack, bool sgnd) {
+  int n = stack.pop_smallint_range(1023);
+  auto x = stack.pop_int();
+  stack.push_bool(x->fits_bits(n, sgnd));
+}
+
+void interpret_pow2(vm::Stack& stack) {
+  int x = stack.pop_smallint_range(255);
+  auto r = td::RefInt256{true};
+  r.unique_write().set_pow2(x);
+  stack.push_int(r);
+}
+
+void interpret_neg_pow2(vm::Stack& stack) {
+  int x = stack.pop_smallint_range(256);
+  auto r = td::RefInt256{true};
+  r.unique_write().set_pow2(x).negate().normalize();
+  stack.push_int(r);
+}
+
+void interpret_pow2_minus1(vm::Stack& stack) {
+  int x = stack.pop_smallint_range(256);
+  auto r = td::RefInt256{true};
+  r.unique_write().set_pow2(x).add_tiny(-1).normalize();
+  stack.push_int(r);
+}
+
+void interpret_mod_pow2(vm::Stack& stack) {
+  int y = stack.pop_smallint_range(256);
+  auto x = stack.pop_int();
+  x.write().mod_pow2(y).normalize();
+  stack.push_int(x);
+}
+
+void interpret_lshift(vm::Stack& stack) {
+  int y = stack.pop_smallint_range(256);
+  stack.push_int(stack.pop_int() << y);
+}
+
+void interpret_rshift(vm::Stack& stack, int round_mode) {
+  int y = stack.pop_smallint_range(256);
+  stack.push_int(rshift(stack.pop_int(), y, round_mode));
+}
+
+void interpret_lshift_const(vm::Stack& stack, int y) {
+  stack.push_int(stack.pop_int() << y);
+}
+
+void interpret_rshift_const(vm::Stack& stack, int y) {
+  stack.push_int(stack.pop_int() >> y);
+}
+
+void interpret_times_rshift(vm::Stack& stack, int round_mode) {
+  int z = stack.pop_smallint_range(256);
+  auto y = stack.pop_int();
+  auto x = stack.pop_int();
+  td::BigIntG<257 * 2> tmp{0};
+  tmp.add_mul(*x, *y).rshift(z, round_mode).normalize();
+  auto q = td::RefInt256{true, tmp};
+  stack.push_int(std::move(q));
+}
+
+void interpret_lshift_div(vm::Stack& stack, int round_mode) {
+  int z = stack.pop_smallint_range(256);
+  auto y = stack.pop_int();
+  auto x = stack.pop_int();
+  td::BigIntG<257 * 2> tmp{*x};
+  tmp <<= z;
+  auto q = td::RefInt256{true};
+  tmp.mod_div(*y, q.unique_write(), round_mode);
+  q.unique_write().normalize();
+  stack.push_int(std::move(q));
+}
+
+void interpret_not(vm::Stack& stack) {
+  stack.push_int(~stack.pop_int());
+}
+
+void interpret_and(vm::Stack& stack) {
+  stack.push_int(stack.pop_int() & stack.pop_int());
+}
+
+void interpret_or(vm::Stack& stack) {
+  stack.push_int(stack.pop_int() | stack.pop_int());
+}
+
+void interpret_xor(vm::Stack& stack) {
+  stack.push_int(stack.pop_int() ^ stack.pop_int());
+}
+
+void interpret_has_type(vm::Stack& stack, int t) {
+  stack.push_bool(stack.pop_chk().type() == t);
+}
+
+void interpret_drop(vm::Stack& stack) {
+  stack.check_underflow(1);
+  stack.pop();
+}
+
+void interpret_2drop(vm::Stack& stack) {
+  stack.check_underflow(2);
+  stack.pop();
+  stack.pop();
+}
+
+void interpret_dup(vm::Stack& stack) {
+  stack.check_underflow(1);
+  stack.push(stack.fetch(0));
+}
+
+void interpret_2dup(vm::Stack& stack) {
+  stack.check_underflow(2);
+  stack.push(stack.fetch(1));
+  stack.push(stack.fetch(1));
+}
+
+void interpret_over(vm::Stack& stack) {
+  stack.check_underflow(2);
+  stack.push(stack.fetch(1));
+}
+
+void interpret_2over(vm::Stack& stack) {
+  stack.check_underflow(4);
+  stack.push(stack.fetch(3));
+  stack.push(stack.fetch(3));
+}
+
+void interpret_swap(vm::Stack& stack) {
+  stack.check_underflow(2);
+  swap(stack[0], stack[1]);
+}
+
+void interpret_2swap(vm::Stack& stack) {
+  stack.check_underflow(4);
+  swap(stack[0], stack[2]);
+  swap(stack[1], stack[3]);
+}
+
+void interpret_tuck(vm::Stack& stack) {
+  stack.check_underflow(2);
+  swap(stack[0], stack[1]);
+  stack.push(stack.fetch(1));
+}
+
+void interpret_nip(vm::Stack& stack) {
+  stack.check_underflow(2);
+  stack.pop(stack[1]);
+}
+
+void interpret_rot(vm::Stack& stack) {
+  stack.check_underflow(3);
+  swap(stack[1], stack[2]);
+  swap(stack[0], stack[1]);
+}
+
+void interpret_rot_rev(vm::Stack& stack) {
+  stack.check_underflow(3);
+  swap(stack[0], stack[1]);
+  swap(stack[1], stack[2]);
+}
+
+void interpret_pick(vm::Stack& stack) {
+  int n = stack.pop_smallint_range(255);
+  stack.check_underflow(n + 1);
+  stack.push(stack.fetch(n));
+}
+
+void interpret_roll(vm::Stack& stack) {
+  int n = stack.pop_smallint_range(255);
+  stack.check_underflow(n + 1);
+  for (int i = n; i > 0; i--) {
+    swap(stack[i], stack[i - 1]);
+  }
+}
+
+void interpret_roll_rev(vm::Stack& stack) {
+  int n = stack.pop_smallint_range(255);
+  stack.check_underflow(n + 1);
+  for (int i = 0; i < n; i++) {
+    swap(stack[i], stack[i + 1]);
+  }
+}
+
+void interpret_reverse(vm::Stack& stack) {
+  int m = stack.pop_smallint_range(255);
+  int n = stack.pop_smallint_range(255);
+  stack.check_underflow(n + m);
+  int s = 2 * m + n - 1;
+  for (int i = ((s - 1) >> 1); i >= m; i--) {
+    swap(stack[i], stack[s - i]);
+  }
+}
+
+void interpret_exch(vm::Stack& stack) {
+  int n = stack.pop_smallint_range(255);
+  stack.check_underflow(n + 1);
+  swap(stack[0], stack[n]);
+}
+
+void interpret_exch2(vm::Stack& stack) {
+  int n = stack.pop_smallint_range(255);
+  int m = stack.pop_smallint_range(255);
+  stack.check_underflow(std::max(m, n) + 1);
+  swap(stack[n], stack[m]);
+}
+
+void interpret_depth(vm::Stack& stack) {
+  stack.push_smallint(stack.depth());
+}
+
+void interpret_xchg0(vm::Stack& stack, int x) {
+  stack.check_underflow_p(x);
+  std::swap(stack.tos(), stack.at(x));
+}
+
+void interpret_xchg(vm::Stack& stack, int x, int y) {
+  stack.check_underflow_p(x, y);
+  std::swap(stack.at(x), stack.at(y));
+}
+
+void interpret_push(vm::Stack& stack, int x) {
+  stack.check_underflow_p(x);
+  stack.push(stack.fetch(x));
+}
+
+void interpret_pop(vm::Stack& stack, int x) {
+  stack.check_underflow_p(x);
+  std::swap(stack.tos(), stack.at(x));
+  stack.pop();
+}
+
+Ref<StackWord> dup_word_def{true, interpret_dup}, over_word_def{true, interpret_over},
+    drop_word_def{true, interpret_drop}, nip_word_def{true, interpret_nip}, swap_word_def{true, interpret_swap};
+
+void interpret_make_xchg(vm::Stack& stack) {
+  using namespace std::placeholders;
+  int y = stack.pop_smallint_range(255), x = stack.pop_smallint_range(255);
+  if (x > y) {
+    std::swap(x, y);
+  }
+  if (x) {
+    stack.push_object(td::Ref<StackWord>{true, std::bind(interpret_xchg, _1, x, y)});
+  } else if (y <= 1) {
+    stack.push_object(y ? swap_word_def : Dictionary::nop_word_def);
+  } else {
+    stack.push_object(td::Ref<StackWord>{true, std::bind(interpret_xchg0, _1, y)});
+  }
+}
+
+void interpret_make_push(vm::Stack& stack) {
+  int x = stack.pop_smallint_range(255);
+  if (x <= 1) {
+    stack.push_object(x ? over_word_def : dup_word_def);
+  } else {
+    stack.push_object(td::Ref<StackWord>{true, std::bind(interpret_push, std::placeholders::_1, x)});
+  }
+}
+
+void interpret_make_pop(vm::Stack& stack) {
+  int x = stack.pop_smallint_range(255);
+  if (x <= 1) {
+    stack.push_object(x ? nip_word_def : drop_word_def);
+  } else {
+    stack.push_object(td::Ref<StackWord>{true, std::bind(interpret_pop, std::placeholders::_1, x)});
+  }
+}
+
+void interpret_is_string(vm::Stack& stack) {
+  stack.push_bool(stack.pop().type() == vm::StackEntry::t_string);
+}
+
+int make_utf8_char(char buffer[4], int x) {
+  if (x < -0x80) {
+    return 0;
+  } else if (x < 0x80) {
+    buffer[0] = (char)x;
+    return 1;
+  } else if (x < 0x800) {
+    buffer[0] = (char)(0xc0 + (x >> 6));
+    buffer[1] = (char)(0x80 + (x & 0x3f));
+    return 2;
+  } else if (x < 0x10000) {
+    buffer[0] = (char)(0xe0 + (x >> 12));
+    buffer[1] = (char)(0x80 + ((x >> 6) & 0x3f));
+    buffer[2] = (char)(0x80 + (x & 0x3f));
+    return 3;
+  } else if (x < 0x200000) {
+    buffer[0] = (char)(0xf0 + (x >> 18));
+    buffer[1] = (char)(0x80 + ((x >> 12) & 0x3f));
+    buffer[2] = (char)(0x80 + ((x >> 6) & 0x3f));
+    buffer[3] = (char)(0x80 + (x & 0x3f));
+    return 4;
+  } else {
+    return 0;
+  }
+}
+
+void interpret_chr(vm::Stack& stack) {
+  char buffer[8];
+  unsigned len = make_utf8_char(buffer, stack.pop_smallint_range(0x10ffff, -128));
+  stack.push_string(std::string{buffer, len});
+}
+
+void interpret_hold(vm::Stack& stack) {
+  stack.check_underflow(2);
+  char buffer[8];
+  unsigned len = make_utf8_char(buffer, stack.pop_smallint_range(0x10ffff, -128));
+  std::string s = stack.pop_string() + std::string{buffer, len};
+  stack.push_string(std::move(s));
+}
+
+void interpret_emit(IntCtx& ctx) {
+  char buffer[8];
+  buffer[make_utf8_char(buffer, ctx.stack.pop_smallint_range(0x10ffff, -128))] = 0;
+  *ctx.output_stream << buffer;
+}
+
+void interpret_emit_const(IntCtx& ctx, char c) {
+  *ctx.output_stream << c;
+}
+
+void interpret_type(IntCtx& ctx) {
+  std::string s = ctx.stack.pop_string();
+  *ctx.output_stream << s;
+}
+
+void interpret_str_concat(vm::Stack& stack) {
+  std::string t = stack.pop_string();
+  stack.push_string(stack.pop_string() + t);
+}
+
+void interpret_str_equal(vm::Stack& stack) {
+  stack.check_underflow(2);
+  std::string t = stack.pop_string(), s = stack.pop_string();
+  stack.push_bool(s == t);
+}
+
+void interpret_str_cmp(vm::Stack& stack) {
+  stack.check_underflow(2);
+  std::string t = stack.pop_string(), s = stack.pop_string();
+  int res = s.compare(std::move(t));
+  stack.push_smallint((res > 0) - (res < 0));
+}
+
+void interpret_str_len(vm::Stack& stack) {
+  stack.push_smallint((long long)stack.pop_string().size());
+}
+
+void interpret_str_split(vm::Stack& stack) {
+  stack.check_underflow(2);
+  unsigned sz = stack.pop_smallint_range(0x7fffffff);
+  std::string str = stack.pop_string();
+  if (sz > str.size()) {
+    throw IntError{"not enough bytes for cutting"};
+  }
+  stack.push_string(std::string{str, 0, sz});
+  stack.push_string(std::string{str, sz});
+}
+
+void interpret_str_reverse(vm::Stack& stack) {
+  std::string s = stack.pop_string();
+  auto it = s.begin();
+  while (it < s.end()) {
+    if ((*it & 0xc0) != 0xc0) {
+      ++it;
+    } else {
+      auto it0 = it++;
+      while (it < s.end() && (*it & 0xc0) == 0x80) {
+        ++it;
+      }
+      std::reverse(it0, it);
+    }
+  }
+  std::reverse(s.begin(), s.end());
+  stack.push_string(std::move(s));
+}
+
+void interpret_str_remove_trailing_int(vm::Stack& stack, int arg) {
+  char x = (char)(arg ? arg : stack.pop_long_range(127));
+  std::string s = stack.pop_string();
+  s.resize(s.find_last_not_of(x) + 1);  // if not found, this expression will be 0
+  stack.push_string(std::move(s));
+}
+
+void interpret_bytes_len(vm::Stack& stack) {
+  stack.push_smallint((long long)stack.pop_bytes().size());
+}
+
+const char hex_digits[] = "0123456789abcdef";
+const char HEX_digits[] = "0123456789ABCDEF";
+
+static inline const char* hex_digits_table(bool upcase) {
+  return upcase ? HEX_digits : hex_digits;
+}
+
+void interpret_bytes_hex_print_raw(IntCtx& ctx, bool upcase) {
+  auto hex_digits = hex_digits_table(upcase);
+  std::string str = ctx.stack.pop_bytes();
+  for (unsigned c : str) {
+    *ctx.output_stream << hex_digits[(c >> 4) & 15] << hex_digits[c & 15];
+  }
+}
+
+void interpret_bytes_to_hex(vm::Stack& stack, bool upcase) {
+  auto hex_digits = hex_digits_table(upcase);
+  std::string str = stack.pop_bytes();
+  std::string t(str.size() * 2, 0);
+  for (std::size_t i = 0; i < str.size(); i++) {
+    unsigned c = str[i];
+    t[2 * i] = hex_digits[(c >> 4) & 15];
+    t[2 * i + 1] = hex_digits[c & 15];
+  }
+  stack.push_string(std::move(t));
+}
+
+void interpret_hex_to_bytes(vm::Stack& stack, bool partial) {
+  std::string str = stack.pop_string(), t;
+  if (!partial) {
+    if (str.size() & 1) {
+      throw IntError{"not a hex string"};
+    }
+    t.reserve(str.size() >> 1);
+  }
+  std::size_t i;
+  unsigned f = 0;
+  for (i = 0; i < str.size(); i++) {
+    int c = str[i];
+    if (c >= '0' && c <= '9') {
+      c -= '0';
+    } else {
+      c |= 0x20;
+      if (c >= 'a' && c <= 'f') {
+        c -= 'a' - 10;
+      } else {
+        if (!partial) {
+          throw IntError{"not a hex string"};
+        }
+        break;
+      }
+    }
+    f = (f << 4) + c;
+    if (i & 1) {
+      t += (char)(f & 0xff);
+    }
+  }
+  stack.push_bytes(t);
+  if (partial) {
+    stack.push_smallint(i & -2);
+  }
+}
+
+void interpret_bytes_split(vm::Stack& stack) {
+  stack.check_underflow(2);
+  unsigned sz = stack.pop_smallint_range(0x7fffffff);
+  std::string str = stack.pop_bytes();
+  if (sz > str.size()) {
+    throw IntError{"not enough bytes for cutting"};
+  }
+  stack.push_bytes(std::string{str, 0, sz});
+  stack.push_bytes(std::string{str, sz});
+}
+
+void interpret_bytes_concat(vm::Stack& stack) {
+  std::string t = stack.pop_bytes();
+  stack.push_bytes(stack.pop_bytes() + t);
+}
+
+void interpret_bytes_equal(vm::Stack& stack) {
+  stack.check_underflow(2);
+  std::string t = stack.pop_bytes(), s = stack.pop_bytes();
+  stack.push_bool(s == t);
+}
+
+void interpret_bytes_cmp(vm::Stack& stack) {
+  stack.check_underflow(2);
+  std::string t = stack.pop_bytes(), s = stack.pop_bytes();
+  int res = s.compare(std::move(t));
+  stack.push_smallint((res > 0) - (res < 0));
+}
+
+void interpret_bytes_fetch_int(vm::Stack& stack, int mode) {
+  stack.check_underflow(2);
+  unsigned bits = (unsigned)stack.pop_smallint_range(256 + (mode & 1));
+  std::string str = stack.pop_bytes();
+  if ((bits & 7)) {
+    throw IntError{"can load only an integer number of bytes"};
+  }
+  unsigned sz = bits >> 3;
+  if (str.size() < sz) {
+    throw IntError{"not enough bytes in the source"};
+  }
+  td::RefInt256 x{true};
+  bool ok;
+  const unsigned char* ptr = (const unsigned char*)(str.data());
+  if (!(mode & 0x10)) {
+    ok = x.write().import_bytes(ptr, sz, mode & 1);
+  } else {
+    ok = x.write().import_bytes_lsb(ptr, sz, mode & 1);
+  }
+  if (!ok) {
+    throw IntError{"cannot load integer"};
+  }
+  if (mode & 2) {
+    stack.push_bytes(std::string{str, sz});
+  }
+  stack.push_int(std::move(x));
+}
+
+void interpret_int_to_bytes(vm::Stack& stack, bool sgnd, bool lsb) {
+  stack.check_underflow(2);
+  unsigned bits = (unsigned)stack.pop_smallint_range(sgnd ? 264 : 256, 1);
+  td::RefInt256 x = stack.pop_int();
+  if ((bits & 7)) {
+    throw IntError{"can store only an integer number of bytes"};
+  }
+  unsigned sz = bits >> 3;
+  unsigned char buffer[33];
+  if (!(lsb ? x->export_bytes_lsb(buffer, sz, sgnd) : x->export_bytes(buffer, sz, sgnd))) {
+    throw IntError{"cannot store integer"};
+  }
+  stack.push_bytes(std::string{(char*)buffer, sz});
+}
+
+void interpret_string_to_bytes(vm::Stack& stack) {
+  stack.push_bytes(stack.pop_string());
+}
+
+void interpret_bytes_hash(vm::Stack& stack) {
+  std::string str = stack.pop_bytes();
+  unsigned char buffer[32];
+  digest::hash_str<digest::SHA256>(buffer, str.c_str(), str.size());
+  td::RefInt256 x{true};
+  x.write().import_bytes(buffer, 32, false);
+  stack.push_int(std::move(x));
+}
+
+void interpret_empty(vm::Stack& stack) {
+  stack.push(td::Ref<vm::CellBuilder>{true});
+}
+
+void interpret_store(vm::Stack& stack, bool sgnd) {
+  stack.check_underflow(3);
+  int bits = stack.pop_smallint_range(1023);
+  auto x = stack.pop_int();
+  auto cell = stack.pop_builder();
+  if (!cell.write().store_int256_bool(*x, bits, sgnd)) {
+    throw IntError{"integer does not fit into cell"};
+  }
+  stack.push(cell);
+}
+
+void interpret_store_str(vm::Stack& stack) {
+  stack.check_underflow(2);
+  auto str = stack.pop_string();
+  auto cell = stack.pop_builder();
+  cell.write().store_bytes(str);  // may throw CellWriteError
+  stack.push(cell);
+}
+
+void interpret_store_bytes(vm::Stack& stack) {
+  stack.check_underflow(2);
+  auto str = stack.pop_bytes();
+  auto cell = stack.pop_builder();
+  cell.write().store_bytes(str);  // may throw CellWriteError
+  stack.push(cell);
+}
+
+void interpret_string_to_cellslice(vm::Stack& stack) {
+  auto str = stack.pop_string();
+  vm::CellBuilder cb;
+  cb.store_bytes(str);  // may throw CellWriteError
+  stack.push_cellslice(td::Ref<vm::CellSlice>{true, cb.finalize()});
+}
+
+void interpret_store_cellslice(vm::Stack& stack) {
+  stack.check_underflow(2);
+  auto cs = stack.pop_cellslice();
+  auto cb = stack.pop_builder();
+  vm::cell_builder_add_slice(cb.write(), *cs);
+  stack.push(std::move(cb));
+}
+
+void interpret_store_cellslice_ref(vm::Stack& stack) {
+  stack.check_underflow(2);
+  auto cs = stack.pop_cellslice();
+  vm::CellBuilder cs_cell_builder;
+  vm::cell_builder_add_slice(cs_cell_builder, *cs);
+  auto cb = stack.pop_builder();
+  if (!cb.write().store_ref_bool(cs_cell_builder.finalize())) {
+    throw IntError{"cell reference list overflow"};
+  }
+  stack.push(std::move(cb));
+}
+
+void interpret_concat_cellslice(vm::Stack& stack) {
+  stack.check_underflow(2);
+  auto cs2 = stack.pop_cellslice();
+  auto cs1 = stack.pop_cellslice();
+  vm::CellBuilder cb;
+  vm::cell_builder_add_slice(cb, *cs1);
+  vm::cell_builder_add_slice(cb, *cs2);
+  stack.push_cellslice(td::Ref<vm::CellSlice>{true, cb.finalize()});
+}
+
+void interpret_concat_cellslice_ref(vm::Stack& stack) {
+  stack.check_underflow(2);
+  auto cs2 = stack.pop_cellslice();
+  auto cs1 = stack.pop_cellslice();
+  vm::CellBuilder builder1, builder2;
+  vm::cell_builder_add_slice(builder1, *cs1);
+  vm::cell_builder_add_slice(builder2, *cs2);
+  if (!builder1.store_ref_bool(builder2.finalize())) {
+    throw IntError{"cell reference list overflow"};
+  }
+  stack.push_cellslice(td::Ref<vm::CellSlice>{true, builder1.finalize()});
+}
+
+void interpret_concat_builders(vm::Stack& stack) {
+  stack.check_underflow(2);
+  auto cb2 = stack.pop_builder();
+  auto cb1 = stack.pop_builder();
+  cb1.write().append_builder(std::move(cb2));
+  stack.push_builder(std::move(cb1));
+}
+
+void interpret_slice_bitrefs(vm::Stack& stack, int mode) {
+  auto cs = stack.pop_cellslice();
+  if (mode & 1) {
+    stack.push_smallint(cs->size());
+  }
+  if (mode & 2) {
+    stack.push_smallint(cs->size_refs());
+  }
+}
+
+void interpret_builder_bitrefs(vm::Stack& stack, int mode) {
+  auto cb = stack.pop_builder();
+  if (mode & 1) {
+    stack.push_smallint(cb->size());
+  }
+  if (mode & 2) {
+    stack.push_smallint(cb->size_refs());
+  }
+}
+
+void interpret_builder_remaining_bitrefs(vm::Stack& stack, int mode) {
+  auto cb = stack.pop_builder();
+  if (mode & 1) {
+    stack.push_smallint(cb->remaining_bits());
+  }
+  if (mode & 2) {
+    stack.push_smallint(cb->remaining_refs());
+  }
+}
+
+void interpret_cell_hash(vm::Stack& stack) {
+  auto cell = stack.pop_cell();
+  td::RefInt256 hash{true};
+  hash.write().import_bytes(cell->get_hash().as_slice().ubegin(), 32, false);
+  stack.push_int(std::move(hash));
+}
+
+void interpret_store_ref(vm::Stack& stack) {
+  auto ref = stack.pop_cell();
+  auto cb = stack.pop_builder();
+  if (!cb.write().store_ref_bool(ref)) {
+    throw IntError{"cell reference list overflow"};
+  }
+  stack.push(std::move(cb));
+}
+
+void interpret_store_end(vm::Stack& stack, bool special) {
+  auto cell = stack.pop_builder()->finalize_copy(special);
+  if (cell.is_null()) {
+    throw IntError{"invalid special cell constructed"};
+  }
+  stack.push_cell(std::move(cell));
+}
+
+void interpret_from_cell(vm::Stack& stack) {
+  auto cell = stack.pop_cell();
+  Ref<vm::CellSlice> cs{true};
+  if (!cs.unique_write().load(vm::NoVmOrd(), std::move(cell))) {
+    throw IntError{"deserializing a special cell as ordinary"};
+  }
+  stack.push(cs);
+}
+
+// cs n -- cs' x
+// cs n -- cs' x -1 OR cs' 0
+// mode & 1 : signed
+// mode & 2 : advance position
+// mode & 4 : return error on stack
+void interpret_fetch(vm::Stack& stack, int mode) {
+  auto n = stack.pop_smallint_range(256 + (mode & 1));
+  auto cs = stack.pop_cellslice();
+  if (!cs->have(n)) {
+    stack.push(std::move(cs));
+    stack.push_bool(false);
+    if (!(mode & 4)) {
+      throw IntError{"end of data while reading integer from cell"};
+    }
+  } else {
+    if (mode & 2) {
+      stack.push_int(cs.write().fetch_int256(n, mode & 1));
+      stack.push(std::move(cs));
+    } else {
+      stack.push_int(cs->prefetch_int256(n, mode & 1));
+    }
+    if (mode & 4) {
+      stack.push_bool(true);
+    }
+  }
+}
+
+// mode & 1 : return result as bytes (instead of string)
+// mode & 2 : advance position
+// mode & 4 : return error on stack
+void interpret_fetch_bytes(vm::Stack& stack, int mode) {
+  unsigned n = stack.pop_smallint_range(127);
+  auto cs = stack.pop_cellslice();
+  if (!cs->have(n * 8)) {
+    stack.push(std::move(cs));
+    stack.push_bool(false);
+    if (!(mode & 4)) {
+      throw IntError{"end of data while reading byte string from cell"};
+    }
+  } else {
+    // unfortunately, std::string's data() is writeable only in C++17
+    unsigned char tmp[128];
+    if (mode & 2) {
+      cs.write().fetch_bytes(tmp, n);
+    } else {
+      cs.write().prefetch_bytes(tmp, n);
+    }
+    std::string s{tmp, tmp + n};
+    if (mode & 1) {
+      stack.push_bytes(std::move(s));
+    } else {
+      stack.push_string(std::move(s));
+    }
+    stack.push(std::move(cs));
+    if (mode & 4) {
+      stack.push_bool(true);
+    }
+  }
+}
+
+void interpret_cell_empty(vm::Stack& stack) {
+  auto cs = stack.pop_cellslice();
+  stack.push_bool(cs->empty_ext());
+}
+
+void interpret_cell_check_empty(vm::Stack& stack) {
+  auto cs = stack.pop_cellslice();
+  if (!cs->empty_ext()) {
+    throw IntError{"cell slice not empty"};
+  }
+}
+
+void interpret_cell_remaining(vm::Stack& stack) {
+  auto cs = stack.pop_cellslice();
+  stack.push_smallint(cs->size());
+  stack.push_smallint(cs->size_refs());
+}
+
+// mode & 1 : return result as slice (instead of cell)
+// mode & 2 : advance position
+// mode & 4 : return error on stack
+void interpret_fetch_ref(vm::Stack& stack, int mode) {
+  auto cs = stack.pop_cellslice();
+  if (!cs->have_refs(1)) {
+    stack.push(std::move(cs));
+    stack.push_bool(false);
+    if (!(mode & 4)) {
+      throw IntError{"end of data while reading reference from cell"};
+    }
+  } else {
+    auto cell = (mode & 2) ? cs.write().fetch_ref() : cs.write().prefetch_ref();
+    if (mode & 2) {
+      stack.push(std::move(cs));
+    }
+    if (mode & 1) {
+      Ref<vm::CellSlice> new_cs{true, vm::NoVm(), std::move(cell)};
+      stack.push(std::move(new_cs));
+    } else {
+      stack.push_cell(std::move(cell));
+    }
+    if (mode & 4) {
+      stack.push_bool(true);
+    }
+  }
+}
+
+// Box create/fetch/store operations
+
+void interpret_hole(vm::Stack& stack) {
+  stack.push_box(Ref<vm::Box>{true});
+}
+
+void interpret_box(vm::Stack& stack) {
+  stack.push_box(Ref<vm::Box>{true, stack.pop_chk()});
+}
+
+void interpret_box_fetch(vm::Stack& stack) {
+  stack.push(stack.pop_box()->get());
+}
+
+void interpret_box_store(vm::Stack& stack) {
+  stack.check_underflow(2);
+  auto box = stack.pop_box();
+  box->set(stack.pop());
+}
+
+void interpret_push_null(vm::Stack& stack) {
+  stack.push({});
+}
+
+void interpret_is_null(vm::Stack& stack) {
+  stack.push_bool(stack.pop_chk().empty());
+}
+
+// Tuple/array operations
+
+void interpret_empty_tuple(vm::Stack& stack) {
+  stack.push_tuple(Ref<vm::Tuple>{true});
+}
+
+void interpret_is_tuple(vm::Stack& stack) {
+  stack.push_bool(stack.pop_chk().type() == vm::StackEntry::t_tuple);
+}
+
+void interpret_tuple_push(vm::Stack& stack) {
+  stack.check_underflow(2);
+  auto val = stack.pop();
+  auto tuple = stack.pop_tuple();
+  tuple.write().emplace_back(std::move(val));
+  stack.push_tuple(std::move(tuple));
+}
+
+void interpret_tuple_pop(vm::Stack& stack) {
+  auto tuple = stack.pop_tuple();
+  if (tuple->empty()) {
+    throw IntError{"empty tuple"};
+  }
+  auto val = tuple->back();
+  tuple.write().pop_back();
+  stack.push_tuple(std::move(tuple));
+  stack.push(std::move(val));
+}
+
+void interpret_tuple_len(vm::Stack& stack) {
+  stack.push_smallint(stack.pop_tuple()->size());
+}
+
+void interpret_tuple_index(vm::Stack& stack) {
+  auto idx = stack.pop_long_range(std::numeric_limits<long long>::max());
+  auto tuple = stack.pop_tuple();
+  if ((td::uint64)idx >= tuple->size()) {
+    throw vm::VmError{vm::Excno::range_chk, "array index out of range"};
+  }
+  stack.push((*tuple)[td::narrow_cast<size_t>(idx)]);
+}
+
+void interpret_tuple_set(vm::Stack& stack) {
+  auto idx = stack.pop_long_range(std::numeric_limits<long long>::max());
+  auto val = stack.pop_chk();
+  auto tuple = stack.pop_tuple();
+  if ((td::uint64)idx >= tuple->size()) {
+    throw vm::VmError{vm::Excno::range_chk, "array index out of range"};
+  }
+  tuple.write()[td::narrow_cast<size_t>(idx)] = std::move(val);
+  stack.push_tuple(std::move(tuple));
+}
+
+void interpret_make_tuple(vm::Stack& stack) {
+  int n = stack.pop_smallint_range(255);
+  stack.check_underflow(n);
+  Ref<vm::Tuple> ref{true};
+  auto& tuple = ref.unique_write();
+  tuple.reserve(n);
+  for (int i = n - 1; i >= 0; i--) {
+    tuple.push_back(std::move(stack[i]));
+  }
+  stack.pop_many(n);
+  stack.push_tuple(std::move(ref));
+}
+
+void interpret_tuple_explode(vm::Stack& stack, bool pop_count) {
+  std::size_t n = pop_count ? (unsigned)stack.pop_smallint_range(255) : 0;
+  auto ref = stack.pop_tuple();
+  const auto& tuple = *ref;
+  if (!pop_count) {
+    n = tuple.size();
+    if (n > 255) {
+      throw IntError{"tuple too large to be exploded"};
+    }
+  } else if (tuple.size() != n) {
+    throw IntError{"tuple size mismatch"};
+  }
+  if (ref.is_unique()) {
+    auto& tuplew = ref.unique_write();
+    for (auto& entry : tuplew) {
+      stack.push(std::move(entry));
+    }
+  } else {
+    for (const auto& entry : tuple) {
+      stack.push(entry);
+    }
+  }
+  if (!pop_count) {
+    stack.push_smallint((td::int32)n);
+  }
+}
+
+void interpret_allot(vm::Stack& stack) {
+  auto n = stack.pop_long_range(0xffffffff);
+  Ref<vm::Tuple> ref{true};
+  auto& tuple = ref.unique_write();
+  tuple.reserve(td::narrow_cast<size_t>(n));
+  while (n-- > 0) {
+    tuple.emplace_back(Ref<vm::Box>{true});
+  }
+  stack.push(std::move(ref));
+}
+
+// Atoms
+
+void interpret_atom(vm::Stack& stack) {
+  bool create = stack.pop_bool();
+  auto atom = vm::Atom::find(stack.pop_string(), create);
+  if (atom.is_null()) {
+    stack.push_bool(false);
+  } else {
+    stack.push_atom(std::move(atom));
+    stack.push_bool(true);
+  }
+}
+
+void interpret_atom_name(vm::Stack& stack) {
+  stack.push_string(stack.pop_atom()->name_ext());
+}
+
+void interpret_atom_anon(vm::Stack& stack) {
+  stack.push_atom(vm::Atom::anon());
+}
+
+void interpret_is_atom(vm::Stack& stack) {
+  stack.push_bool(stack.pop().is_atom());
+}
+
+bool are_eqv(vm::StackEntry x, vm::StackEntry y) {
+  if (x.type() != y.type()) {
+    return false;
+  }
+  switch (x.type()) {
+    case vm::StackEntry::t_null:
+      return true;
+    case vm::StackEntry::t_atom:
+      return std::move(x).as_atom() == std::move(y).as_atom();
+    case vm::StackEntry::t_int:
+      return !td::cmp(std::move(x).as_int(), std::move(y).as_int());
+    case vm::StackEntry::t_string:
+      return std::move(x).as_string() == std::move(y).as_string();
+    default:
+      return false;
+  }
+}
+
+void interpret_is_eqv(vm::Stack& stack) {
+  auto y = stack.pop(), x = stack.pop();
+  stack.push_bool(are_eqv(std::move(x), std::move(y)));
+}
+
+void interpret_is_eq(vm::Stack& stack) {
+  auto y = stack.pop(), x = stack.pop();
+  stack.push_bool(x == y);
+}
+
+// BoC (de)serialization
+
+void interpret_boc_serialize(vm::Stack& stack) {
+  vm::BagOfCells boc;
+  boc.add_root(stack.pop_cell());
+  auto res = boc.import_cells();
+  if (res.is_error()) {
+    throw IntError{(PSLICE() << "cannot serialize bag-of-cells " << res.error()).c_str()};
+  }
+  stack.push_bytes(boc.serialize_to_string());
+}
+
+void interpret_boc_serialize_ext(vm::Stack& stack) {
+  int mode = stack.pop_smallint_range(vm::BagOfCells::Mode::max);
+  vm::BagOfCells boc;
+  boc.add_root(stack.pop_cell());
+  auto res = boc.import_cells();
+  if (res.is_error()) {
+    throw IntError{(PSLICE() << "cannot serialize bag-of-cells " << res.error()).c_str()};
+  }
+  stack.push_bytes(boc.serialize_to_string(mode));
+}
+
+void interpret_boc_deserialize(vm::Stack& stack) {
+  std::string bytes = stack.pop_bytes();
+  vm::BagOfCells boc;
+  auto res = boc.deserialize(td::Slice{bytes});
+  if (res.is_error()) {
+    throw IntError{(PSLICE() << "cannot deserialize bag-of-cells " << res.error()).c_str()};
+  }
+  if (res.ok() <= 0 || boc.get_root_cell().is_null()) {
+    throw IntError{"cannot deserialize bag-of-cells "};
+  }
+  stack.push_cell(boc.get_root_cell());
+}
+
+void interpret_read_file(IntCtx& ctx) {
+  std::string filename = ctx.stack.pop_string();
+  auto r_data = ctx.source_lookup->read_file(filename);
+  if (r_data.is_error()) {
+    throw IntError{PSTRING() << "error reading file `" << filename << "`: " << r_data.error()};
+  }
+  ctx.stack.push_bytes(r_data.move_as_ok().data);
+}
+
+void interpret_read_file_part(IntCtx& ctx) {
+  auto size = ctx.stack.pop_long_range(std::numeric_limits<long long>::max());
+  auto offset = ctx.stack.pop_long_range(std::numeric_limits<long long>::max());
+  std::string filename = ctx.stack.pop_string();
+  auto r_data = ctx.source_lookup->read_file_part(filename, size, offset);
+  if (r_data.is_error()) {
+    throw IntError{PSTRING() << "error reading file `" << filename << "`: " << r_data.error()};
+  }
+  ctx.stack.push_bytes(r_data.move_as_ok().data);
+}
+
+void interpret_write_file(IntCtx& ctx) {
+  std::string filename = ctx.stack.pop_string();
+  std::string str = ctx.stack.pop_bytes();
+  auto status = ctx.source_lookup->write_file(filename, str);
+  if (status.is_error()) {
+    throw IntError{PSTRING() << "error writing file `" << filename << "`: " << status.error()};
+  }
+}
+
+void interpret_file_exists(IntCtx& ctx) {
+  std::string filename = ctx.stack.pop_string();
+  auto res = ctx.source_lookup->is_file_exists(filename);
+  ctx.stack.push_bool(res);
+}
+
+// custom and crypto
+
+void interpret_now(vm::Stack& stack) {
+  stack.push_smallint(std::time(nullptr));
+}
+
+void interpret_new_keypair(vm::Stack& stack) {
+  auto priv_key = td::Ed25519::generate_private_key();
+  if (!priv_key.is_ok()) {
+    throw fift::IntError{priv_key.error().to_string()};
+  }
+  auto pub_key = priv_key.ok().get_public_key();
+  if (!pub_key.is_ok()) {
+    throw fift::IntError{pub_key.error().to_string()};
+  }
+  stack.push_bytes(priv_key.ok().as_octet_string());
+  stack.push_bytes(pub_key.ok().as_octet_string());
+}
+
+void interpret_priv_key_to_pub(vm::Stack& stack) {
+  std::string str = stack.pop_bytes();
+  if (str.size() != 32) {
+    throw IntError{"Ed25519 private key must be exactly 32 bytes long"};
+  }
+  td::Ed25519::PrivateKey priv_key{td::SecureString{str}};
+  auto pub_key = priv_key.get_public_key();
+  if (!pub_key.is_ok()) {
+    throw fift::IntError{pub_key.error().to_string()};
+  }
+  stack.push_bytes(pub_key.ok().as_octet_string());
+}
+
+void interpret_ed25519_sign(vm::Stack& stack) {
+  stack.check_underflow(2);
+  std::string key = stack.pop_bytes(), data = stack.pop_bytes();
+  if (key.size() != 32) {
+    throw IntError{"Ed25519 private key must be exactly 32 bytes long"};
+  }
+  td::Ed25519::PrivateKey priv_key{td::SecureString{key}};
+  auto signature = priv_key.sign(td::Slice{data});
+  if (!signature.is_ok()) {
+    throw fift::IntError{signature.error().to_string()};
+  }
+  stack.push_bytes(signature.move_as_ok());
+}
+
+void interpret_ed25519_sign_uint(vm::Stack& stack) {
+  stack.check_underflow(2);
+  std::string key = stack.pop_bytes();
+  td::RefInt256 data_int = stack.pop_int();
+  if (key.size() != 32) {
+    throw IntError{"Ed25519 private key must be exactly 32 bytes long"};
+  }
+  unsigned char data[32];
+  if (!data_int->export_bytes(data, 32, false)) {
+    throw IntError{"Ed25519 data to be signed must fit into 256 bits"};
+  }
+  td::Ed25519::PrivateKey priv_key{td::SecureString{key}};
+  auto signature = priv_key.sign(td::Slice{data, 32});
+  if (!signature.is_ok()) {
+    throw fift::IntError{signature.error().to_string()};
+  }
+  stack.push_bytes(signature.move_as_ok());
+}
+
+void interpret_ed25519_chksign(vm::Stack& stack) {
+  stack.check_underflow(3);
+  std::string key = stack.pop_bytes(), signature = stack.pop_bytes(), data = stack.pop_bytes();
+  if (key.size() != 32) {
+    throw IntError{"Ed25519 public key must be exactly 32 bytes long"};
+  }
+  if (signature.size() != 64) {
+    throw IntError{"Ed25519 signature must be exactly 64 bytes long"};
+  }
+  td::Ed25519::PublicKey pub_key{td::SecureString{key}};
+  auto res = pub_key.verify_signature(td::Slice{data}, td::Slice{signature});
+  stack.push_bool(res.is_ok());
+}
+
+void interpret_crc16(vm::Stack& stack) {
+  std::string str = stack.pop_bytes();
+  stack.push_smallint(td::crc16(td::Slice{str}));
+}
+
+void interpret_crc32(vm::Stack& stack) {
+  std::string str = stack.pop_bytes();
+  stack.push_smallint(td::crc32(td::Slice{str}));
+}
+
+void interpret_crc32c(vm::Stack& stack) {
+  std::string str = stack.pop_bytes();
+  stack.push_smallint(td::crc32c(td::Slice{str}));
+}
+
+// vm dictionaries
+void interpret_dict_new(vm::Stack& stack) {
+  stack.push({});
+}
+
+void interpret_dict_to_slice(vm::Stack& stack) {
+  vm::CellBuilder cb;
+  cb.store_maybe_ref(stack.pop_maybe_cell());
+  stack.push_cellslice(vm::load_cell_slice_ref(cb.finalize()));
+}
+
+void interpret_load_dict(vm::Stack& stack, bool fetch) {
+  auto cs = stack.pop_cellslice();
+  Ref<vm::Cell> dict;
+  bool non_empty;
+  if (!(cs.write().fetch_bool_to(non_empty) && (!non_empty || cs.write().fetch_ref_to(dict)))) {
+    throw IntError{"cell underflow"};
+  }
+  stack.push_maybe_cell(std::move(dict));
+  if (fetch) {
+    stack.push_cellslice(std::move(cs));
+  }
+}
+
+void interpret_store_dict(vm::Stack& stack) {
+  auto cell = stack.pop_maybe_cell();
+  auto cb = stack.pop_builder();
+  if (!cb.write().store_maybe_ref(std::move(cell))) {
+    throw IntError{"cell overflow"};
+  }
+  stack.push_builder(std::move(cb));
+}
+
+// val key dict keylen -- dict' ?
+void interpret_dict_add_u(vm::Stack& stack, vm::Dictionary::SetMode mode, bool add_builder, bool sgnd) {
+  int n = stack.pop_smallint_range(vm::Dictionary::max_key_bits);
+  vm::Dictionary dict{stack.pop_maybe_cell(), n};
+  unsigned char buffer[vm::Dictionary::max_key_bytes];
+  vm::BitSlice key = dict.integer_key(stack.pop_int(), n, sgnd, buffer);
+  if (!key.is_valid()) {
+    throw IntError{"not enough bits for a dictionary key"};
+  }
+  bool res;
+  if (add_builder) {
+    res = dict.set_builder(std::move(key), stack.pop_builder(), mode);
+  } else {
+    res = dict.set(std::move(key), stack.pop_cellslice(), mode);
+  }
+  stack.push_maybe_cell(std::move(dict).extract_root_cell());
+  stack.push_bool(res);
+}
+
+void interpret_dict_get_u(vm::Stack& stack, bool sgnd) {
+  int n = stack.pop_smallint_range(vm::Dictionary::max_key_bits);
+  vm::Dictionary dict{stack.pop_maybe_cell(), n};
+  unsigned char buffer[vm::Dictionary::max_key_bytes];
+  vm::BitSlice key = dict.integer_key(stack.pop_int(), n, sgnd, buffer);
+  if (!key.is_valid()) {
+    throw IntError{"not enough bits for a dictionary key"};
+  }
+  auto res = dict.lookup(std::move(key));
+  if (res.not_null()) {
+    stack.push_cellslice(std::move(res));
+    stack.push_bool(true);
+  } else {
+    stack.push_bool(false);
+  }
+}
+
+void interpret_dict_map(IntCtx& ctx) {
+  auto func = pop_exec_token(ctx);
+  int n = ctx.stack.pop_smallint_range(vm::Dictionary::max_key_bits);
+  vm::Dictionary dict{ctx.stack.pop_maybe_cell(), n};
+  vm::Dictionary::simple_map_func_t simple_map = [&ctx, func](vm::CellBuilder& cb, Ref<vm::CellSlice> cs_ref) -> bool {
+    ctx.stack.push_builder(Ref<vm::CellBuilder>(cb));
+    ctx.stack.push_cellslice(std::move(cs_ref));
+    func->run(ctx);
+    assert(cb.is_unique());
+    if (!ctx.stack.pop_bool()) {
+      return false;
+    }
+    Ref<vm::CellBuilder> cb_ref = ctx.stack.pop_builder();
+    cb = *cb_ref;
+    return true;
+  };
+  dict.map(std::move(simple_map));
+  ctx.stack.push_maybe_cell(std::move(dict).extract_root_cell());
+}
+
+void interpret_dict_map_ext(IntCtx& ctx) {
+  auto func = pop_exec_token(ctx);
+  int n = ctx.stack.pop_smallint_range(vm::Dictionary::max_key_bits);
+  vm::Dictionary dict{ctx.stack.pop_maybe_cell(), n};
+  vm::Dictionary::map_func_t map_func = [&ctx, func](vm::CellBuilder& cb, Ref<vm::CellSlice> cs_ref,
+                                                     td::ConstBitPtr key, int key_len) -> bool {
+    ctx.stack.push_builder(Ref<vm::CellBuilder>(cb));
+    td::RefInt256 x{true};
+    x.unique_write().import_bits(key, key_len, false);
+    ctx.stack.push_int(std::move(x));
+    ctx.stack.push_cellslice(std::move(cs_ref));
+    func->run(ctx);
+    assert(cb.is_unique());
+    if (!ctx.stack.pop_bool()) {
+      return false;
+    }
+    Ref<vm::CellBuilder> cb_ref = ctx.stack.pop_builder();
+    cb = *cb_ref;
+    return true;
+  };
+  dict.map(std::move(map_func));
+  ctx.stack.push_maybe_cell(std::move(dict).extract_root_cell());
+}
+
+void interpret_dict_foreach(IntCtx& ctx) {
+  auto func = pop_exec_token(ctx);
+  int n = ctx.stack.pop_smallint_range(vm::Dictionary::max_key_bits);
+  vm::Dictionary dict{ctx.stack.pop_maybe_cell(), n};
+  vm::Dictionary::foreach_func_t foreach_func = [&ctx, func](Ref<vm::CellSlice> cs_ref, td::ConstBitPtr key,
+                                                             int key_len) -> bool {
+    td::RefInt256 x{true};
+    x.unique_write().import_bits(key, key_len, false);
+    ctx.stack.push_int(std::move(x));
+    ctx.stack.push_cellslice(std::move(cs_ref));
+    func->run(ctx);
+    return ctx.stack.pop_bool();
+  };
+  ctx.stack.push_bool(dict.check_for_each(std::move(foreach_func)));
+}
+
+void interpret_dict_merge(IntCtx& ctx) {
+  auto func = pop_exec_token(ctx);
+  int n = ctx.stack.pop_smallint_range(vm::Dictionary::max_key_bits);
+  vm::Dictionary dict2{ctx.stack.pop_maybe_cell(), n};
+  vm::Dictionary dict1{ctx.stack.pop_maybe_cell(), n};
+  vm::Dictionary::simple_combine_func_t simple_combine = [&ctx, func](vm::CellBuilder& cb, Ref<vm::CellSlice> cs1_ref,
+                                                                      Ref<vm::CellSlice> cs2_ref) -> bool {
+    ctx.stack.push_builder(Ref<vm::CellBuilder>(cb));
+    ctx.stack.push_cellslice(std::move(cs1_ref));
+    ctx.stack.push_cellslice(std::move(cs2_ref));
+    func->run(ctx);
+    assert(cb.is_unique());
+    if (!ctx.stack.pop_bool()) {
+      return false;
+    }
+    Ref<vm::CellBuilder> cb_ref = ctx.stack.pop_builder();
+    cb = *cb_ref;
+    return true;
+  };
+  if (!dict1.combine_with(dict2, std::move(simple_combine))) {
+    throw IntError{"cannot combine dictionaries"};
+  }
+  ctx.stack.push_maybe_cell(std::move(dict1).extract_root_cell());
+}
+
+void interpret_dict_diff(IntCtx& ctx) {
+  auto func = pop_exec_token(ctx);
+  int n = ctx.stack.pop_smallint_range(vm::Dictionary::max_key_bits);
+  vm::Dictionary dict2{ctx.stack.pop_maybe_cell(), n};
+  vm::Dictionary dict1{ctx.stack.pop_maybe_cell(), n};
+  vm::Dictionary::scan_diff_func_t scan_value_pair =
+      [&ctx, func](td::ConstBitPtr key, int key_len, Ref<vm::CellSlice> cs1_ref, Ref<vm::CellSlice> cs2_ref) -> bool {
+    td::RefInt256 x{true};
+    x.unique_write().import_bits(key, key_len, false);
+    ctx.stack.push_int(std::move(x));
+    ctx.stack.push_maybe_cellslice(std::move(cs1_ref));
+    ctx.stack.push_maybe_cellslice(std::move(cs2_ref));
+    func->run(ctx);
+    return ctx.stack.pop_bool();
+  };
+  ctx.stack.push_bool(dict1.scan_diff(dict2, std::move(scan_value_pair)));
+}
+
+void interpret_pfx_dict_add(vm::Stack& stack, vm::Dictionary::SetMode mode, bool add_builder) {
+  int n = stack.pop_smallint_range(vm::Dictionary::max_key_bits);
+  vm::PrefixDictionary dict{stack.pop_maybe_cell(), n};
+  auto cs = stack.pop_cellslice();
+  bool res;
+  if (add_builder) {
+    res = dict.set_builder(cs->data_bits(), cs->size(), stack.pop_builder(), mode);
+  } else {
+    res = dict.set(cs->data_bits(), cs->size(), stack.pop_cellslice(), mode);
+  }
+  stack.push_maybe_cell(std::move(dict).extract_root_cell());
+  stack.push_bool(res);
+}
+
+void interpret_pfx_dict_get(vm::Stack& stack) {
+  int n = stack.pop_smallint_range(vm::Dictionary::max_key_bits);
+  vm::PrefixDictionary dict{stack.pop_maybe_cell(), n};
+  auto cs = stack.pop_cellslice();
+  auto res = dict.lookup(cs->data_bits(), cs->size());
+  if (res.not_null()) {
+    stack.push_cellslice(std::move(res));
+    stack.push_bool(true);
+  } else {
+    stack.push_bool(false);
+  }
+}
+
+void interpret_bytes_hex_literal(IntCtx& ctx) {
+  auto s = ctx.scan_word_to('}');
+  std::string t;
+  t.reserve(s.size() >> 1);
+  int v = 1;
+  for (char c : s) {
+    if (c == ' ' || c == '\t') {
+      continue;
+    }
+    v <<= 4;
+    if (c >= '0' && c <= '9') {
+      v += c - '0';
+    } else {
+      c |= 0x20;
+      if (c >= 'a' && c <= 'f') {
+        v += c - ('a' - 10);
+      } else {
+        v = -1;
+        break;
+      }
+    }
+    if (v & 0x100) {
+      t.push_back((char)v);
+      v = 1;
+    }
+  }
+  if (v != 1) {
+    throw IntError{"Invalid bytes hexstring constant"};
+  }
+  ctx.stack.push_bytes(std::move(t));
+  push_argcount(ctx.stack, 1);
+}
+
+void interpret_bitstring_hex_literal(IntCtx& ctx) {
+  auto s = ctx.scan_word_to('}');
+  unsigned char buff[128];
+  int bits = (int)td::bitstring::parse_bitstring_hex_literal(buff, sizeof(buff), s.begin(), s.end());
+  if (bits < 0) {
+    throw IntError{"Invalid hex bitstring constant"};
+  }
+  auto cs = Ref<vm::CellSlice>{true, vm::CellBuilder().store_bits(td::ConstBitPtr{buff}, bits).finalize()};
+  ctx.stack.push(std::move(cs));
+  push_argcount(ctx.stack, 1);
+}
+
+void interpret_bitstring_binary_literal(IntCtx& ctx) {
+  auto s = ctx.scan_word_to('}');
+  unsigned char buff[128];
+  int bits = (int)td::bitstring::parse_bitstring_binary_literal(buff, sizeof(buff), s.begin(), s.end());
+  if (bits < 0) {
+    throw IntError{"Invalid binary bitstring constant"};
+  }
+  auto cs = Ref<vm::CellSlice>{true, vm::CellBuilder().store_bits(td::ConstBitPtr{buff}, bits).finalize()};
+  ctx.stack.push(std::move(cs));
+  push_argcount(ctx.stack, 1);
+}
+
+void interpret_word(IntCtx& ctx) {
+  char sep = (char)ctx.stack.pop_smallint_range(127);
+  auto word = (sep != ' ' ? ctx.scan_word_to(sep, true) : ctx.scan_word());
+  ctx.stack.push_string(word);
+}
+
+void interpret_word_ext(IntCtx& ctx) {
+  int mode = ctx.stack.pop_smallint_range(11);
+  auto delims = ctx.stack.pop_string();
+  if (mode & 8) {
+    ctx.skipspc(mode & 4);
+  }
+  ctx.stack.push_string(ctx.scan_word_ext(CharClassifier{delims, mode & 3}));
+}
+
+void interpret_skipspc(IntCtx& ctx) {
+  ctx.skipspc();
+}
+
+void interpret_wordlist_begin_aux(vm::Stack& stack) {
+  stack.push({vm::from_object, Ref<WordList>{true}});
+}
+
+void interpret_wordlist_begin(IntCtx& ctx) {
+  check_not_int_exec(ctx);
+  interpret_wordlist_begin_aux(ctx.stack);
+  push_argcount(ctx, 0);
+  ++(ctx.state);
+}
+
+void interpret_wordlist_end_aux(vm::Stack& stack) {
+  Ref<WordList> wordlist_ref = pop_word_list(stack);
+  wordlist_ref.write().close();
+  stack.push({vm::from_object, Ref<WordDef>{wordlist_ref}});
+}
+
+void interpret_wordlist_end(IntCtx& ctx) {
+  check_compile(ctx);
+  interpret_wordlist_end_aux(ctx.stack);
+  push_argcount(ctx, 1);
+  --(ctx.state);
+}
+
+void interpret_internal_interpret_begin(IntCtx& ctx) {
+  check_compile(ctx);
+  push_argcount(ctx, 0);
+  ctx.state = -ctx.state;
+}
+
+void interpret_internal_interpret_end(IntCtx& ctx) {
+  check_int_exec(ctx);
+  ctx.state = -ctx.state;
+  ctx.stack.push({vm::from_object, Dictionary::nop_word_def});
+}
+
+// (create)
+// maybe need an extra argument to identify the vocabulary (namespace) to be edited
+void interpret_create_aux(IntCtx& ctx, int mode) {
+  if (mode < 0) {
+    mode = ctx.stack.pop_smallint_range(3);
+  }
+  std::string word = ctx.stack.pop_string();
+  if (!word.size()) {
+    throw IntError{"non-empty word name expected"};
+  }
+  auto wd_ref = pop_exec_token(ctx.stack);
+  if (!(mode & 2)) {
+    word += ' ';
+  }
+  bool active = (mode & 1);
+  auto entry = ctx.dictionary->lookup(word);
+  if (entry) {
+    *entry = WordRef{wd_ref, active};  // redefine word
+  } else {
+    ctx.dictionary->def_word(std::move(word), {wd_ref, active});
+  }
+}
+
+// { bl word 0 (create) } : create
+void interpret_create(IntCtx& ctx) {
+  auto word = ctx.scan_word();
+  if (!word.size()) {
+    throw IntError{"non-empty word name expected"};
+  }
+  ctx.stack.push_string(word);
+  interpret_create_aux(ctx, 0);
+}
+
+Ref<WordDef> create_aux_wd{Ref<CtxWord>{true, std::bind(interpret_create_aux, std::placeholders::_1, -1)}};
+
+// { bl word <mode> 2 ' (create) } :: :
+void interpret_colon(IntCtx& ctx, int mode) {
+  ctx.stack.push_string(ctx.scan_word());
+  ctx.stack.push_smallint(mode);
+  ctx.stack.push_smallint(2);
+  ctx.stack.push({vm::from_object, create_aux_wd});
+  //push_argcount(ctx, 2, create_wd);
+}
+
+// (forget)
+void interpret_forget_aux(IntCtx& ctx) {
+  std::string s = ctx.stack.pop_string();
+  auto s_copy = s;
+  auto entry = ctx.dictionary->lookup(s);
+  if (!entry) {
+    s += " ";
+    entry = ctx.dictionary->lookup(s);
+  }
+  if (!entry) {
+    throw IntError{"`" + s_copy + "` not found"};
+  } else {
+    ctx.dictionary->undef_word(s);
+  }
+}
+
+// { bl word (forget) } : forget
+void interpret_forget(IntCtx& ctx) {
+  ctx.stack.push_string(ctx.scan_word());
+  interpret_forget_aux(ctx);
+}
+
+void interpret_quote_str(IntCtx& ctx) {
+  ctx.stack.push_string(ctx.scan_word_to('"'));
+  push_argcount(ctx.stack, 1);
+}
+
+int str_utf8_code(const char* str, int& len) {
+  if (len <= 0) {
+    return -1;
+  }
+  if (len >= 1 && (unsigned char)str[0] < 0x80) {
+    len = 1;
+    return str[0];
+  }
+  if (len >= 2 && (str[0] & 0xe0) == 0xc0 && (str[1] & 0xc0) == 0x80) {
+    len = 2;
+    return ((str[0] & 0x1f) << 6) | (str[1] & 0x3f);
+  }
+  if (len >= 3 && (str[0] & 0xf0) == 0xe0 && (str[1] & 0xc0) == 0x80 && (str[2] & 0xc0) == 0x80) {
+    len = 3;
+    return ((str[0] & 0x0f) << 12) | ((str[1] & 0x3f) << 6) | (str[2] & 0x3f);
+  }
+  if (len >= 4 && (str[0] & 0xf8) == 0xf0 && (str[1] & 0xc0) == 0x80 && (str[2] & 0xc0) == 0x80 &&
+      (str[3] & 0xc0) == 0x80) {
+    len = 4;
+    return ((str[0] & 7) << 18) | ((str[1] & 0x3f) << 12) | ((str[2] & 0x3f) << 6) | (str[3] & 0x3f);
+  }
+  return -1;
+}
+
+void interpret_char(IntCtx& ctx) {
+  auto s = ctx.scan_word();
+  int len = (s.size() < 10 ? (int)s.size() : 10);
+  int code = str_utf8_code(s.data(), len);
+  if (code < 0 || s.size() != (unsigned)len) {
+    throw IntError{"exactly one character expected"};
+  }
+  ctx.stack.push_smallint(code);
+  push_argcount(ctx, 1);
+}
+
+int parse_number(std::string s, td::RefInt256& num, td::RefInt256& denom, bool allow_frac = true,
+                 bool throw_error = false) {
+  if (allow_frac) {
+    auto pos = s.find('/');
+    if (pos != std::string::npos) {
+      return parse_number(std::string{s, 0, pos}, num, denom, false, throw_error) > 0 &&
+                     parse_number(std::string{s, pos + 1}, denom, num, false, throw_error) > 0
+                 ? 2
+                 : 0;
+    }
+  }
+  const char* str = s.c_str();
+  int len = (int)s.size();
+  int frac = -1, base, *frac_ptr = allow_frac ? &frac : nullptr;
+  num = td::RefInt256{true};
+  auto& x = num.unique_write();
+  if (len >= 4 && str[0] == '-' && str[1] == '0' && (str[2] == 'x' || str[2] == 'b')) {
+    if (str[2] == 'x') {
+      base = 16;
+      if (x.parse_hex(str + 3, len - 3, frac_ptr) != len - 3) {
+        return 0;
+      }
+    } else {
+      base = 2;
+      if (x.parse_binary(str + 3, len - 3, frac_ptr) != len - 3) {
+        return 0;
+      }
+    }
+    x.negate().normalize();
+  } else if (len >= 3 && str[0] == '0' && (str[1] == 'x' || str[1] == 'b')) {
+    if (str[1] == 'x') {
+      base = 16;
+      if (x.parse_hex(str + 2, len - 2, frac_ptr) != len - 2) {
+        return 0;
+      }
+    } else {
+      base = 2;
+      if (x.parse_binary(str + 2, len - 2, frac_ptr) != len - 2) {
+        return 0;
+      }
+    }
+  } else {
+    base = 10;
+    if (!len || x.parse_dec(str, len, frac_ptr) != len) {
+      return 0;
+    }
+  }
+  if (!x.signed_fits_bits(257)) {
+    if (throw_error) {
+      throw IntError{"integer constant too large"};
+    }
+    return 0;
+  }
+  if (frac < 0) {
+    return 1;
+  } else {
+    denom = td::RefInt256{true, 1};
+    while (frac-- > 0) {
+      if (!denom.unique_write().mul_tiny(base).normalize_bool()) {
+        if (throw_error) {
+          throw IntError{"denominator in constant too large"};
+        }
+        return 0;
+      }
+    }
+    if (!denom.unique_write().unsigned_fits_bits(256)) {
+      if (throw_error) {
+        throw IntError{"denominator in constant too large"};
+      }
+      return 0;
+    }
+    return 2;
+  }
+}
+
+void interpret_parse_number(vm::Stack& stack) {
+  td::RefInt256 num, denom;
+  int res = parse_number(stack.pop_string(), num, denom, true, false);
+  if (res >= 1) {
+    stack.push_int(std::move(num));
+  }
+  if (res == 2) {
+    stack.push_int(std::move(denom));
+  }
+  stack.push_smallint(res);
+}
+
+void interpret_parse_hex_number(vm::Stack& stack) {
+  td::RefInt256 x{true};
+  auto str = stack.pop_string();
+  bool ok = (str.size() <= 65535) && x.unique_write().parse_hex(str.data(), (int)str.size()) == (int)str.size();
+  if (ok) {
+    stack.push_int(std::move(x));
+  }
+  stack.push_smallint(ok);
+}
+
+void interpret_quit(IntCtx& ctx) {
+  throw Quit{0};
+}
+
+void interpret_bye(IntCtx& ctx) {
+  throw Quit{-1};
+}
+
+void interpret_halt(vm::Stack& stack) {
+  int code = stack.pop_smallint_range(255);
+  throw Quit{~code};
+}
+
+void interpret_abort(IntCtx& ctx) {
+  throw IntError{ctx.stack.pop_string()};
+}
+
+Ref<WordDef> interpret_execute(IntCtx& ctx) {
+  return pop_exec_token(ctx);
+}
+
+Ref<WordDef> interpret_execute_times(IntCtx& ctx) {
+  int count = ctx.stack.pop_smallint_range(1000000000);
+  auto wd_ref = pop_exec_token(ctx);
+  if (!count) {
+    return {};
+  }
+  while (--count > 0) {
+    wd_ref->run(ctx);
+  }
+  return wd_ref;
+}
+
+Ref<WordDef> interpret_if(IntCtx& ctx) {
+  auto true_ref = pop_exec_token(ctx);
+  if (ctx.stack.pop_bool()) {
+    return true_ref;
+  } else {
+    return {};
+  }
+}
+
+Ref<WordDef> interpret_ifnot(IntCtx& ctx) {
+  auto false_ref = pop_exec_token(ctx);
+  if (ctx.stack.pop_bool()) {
+    return {};
+  } else {
+    return false_ref;
+  }
+}
+
+Ref<WordDef> interpret_cond(IntCtx& ctx) {
+  auto false_ref = pop_exec_token(ctx);
+  auto true_ref = pop_exec_token(ctx);
+  if (ctx.stack.pop_bool()) {
+    return true_ref;
+  } else {
+    return false_ref;
+  }
+}
+
+void interpret_while(IntCtx& ctx) {
+  auto body_ref = pop_exec_token(ctx);
+  auto cond_ref = pop_exec_token(ctx);
+  while (true) {
+    cond_ref->run(ctx);
+    if (!ctx.stack.pop_bool()) {
+      break;
+    }
+    body_ref->run(ctx);
+  }
+}
+
+void interpret_until(IntCtx& ctx) {
+  auto body_ref = pop_exec_token(ctx);
+  do {
+    body_ref->run(ctx);
+  } while (!ctx.stack.pop_bool());
+}
+
+void interpret_tick(IntCtx& ctx) {
+  std::string word = ctx.scan_word().str();
+  auto entry = ctx.dictionary->lookup(word);
+  if (!entry) {
+    entry = ctx.dictionary->lookup(word + ' ');
+    if (!entry) {
+      throw IntError{"word `" + word + "` undefined"};
+    }
+  }
+  ctx.stack.push({vm::from_object, entry->get_def()});
+  push_argcount(ctx, 1);
+}
+
+void interpret_find(IntCtx& ctx) {
+  std::string word = ctx.stack.pop_string();
+  auto entry = ctx.dictionary->lookup(word);
+  if (!entry) {
+    entry = ctx.dictionary->lookup(word + ' ');
+  }
+  if (!entry) {
+    ctx.stack.push_bool(false);
+  } else {
+    ctx.stack.push({vm::from_object, entry->get_def()});
+    ctx.stack.push_bool(true);
+  }
+}
+
+void interpret_tick_nop(vm::Stack& stack) {
+  stack.push({vm::from_object, Dictionary::nop_word_def});
+}
+
+void interpret_include(IntCtx& ctx) {
+  auto fname = ctx.stack.pop_string();
+  auto r_file = ctx.source_lookup->lookup_source(fname, ctx.currentd_dir);
+  if (r_file.is_error()) {
+    throw IntError{"cannot locate file `" + fname + "`"};
+  }
+  auto file = r_file.move_as_ok();
+  std::stringstream ss(std::move(file.data));
+  IntCtx::Savepoint save{ctx, td::PathView(file.path).file_name().str(), td::PathView(file.path).parent_dir().str(),
+                         &ss};
+  funny_interpret_loop(ctx);
+}
+
+void interpret_skip_source(vm::Stack& stack) {
+  throw SkipToEof();
+}
+
+void interpret_words(IntCtx& ctx) {
+  for (const auto& x : *ctx.dictionary) {
+    *ctx.output_stream << x.first << " ";
+  }
+  *ctx.output_stream << std::endl;
+}
+
+void interpret_pack_std_smc_addr(vm::Stack& stack) {
+  block::StdAddress a;
+  stack.check_underflow(3);
+  int mode = stack.pop_smallint_range(7);
+  td::RefInt256 x = stack.pop_int_finite();
+  if (td::sgn(x) < 0) {
+    throw IntError{"non-negative integer expected"};
+  }
+  CHECK(x->export_bytes(a.addr.data(), 32, false));
+  a.workchain = stack.pop_smallint_range(0x7f, -0x80);
+  a.testnet = mode & 2;
+  a.bounceable = !(mode & 1);
+  stack.push_string(a.rserialize(mode & 4));
+}
+
+void interpret_unpack_std_smc_addr(vm::Stack& stack) {
+  block::StdAddress a;
+  if (!a.parse_addr(stack.pop_string())) {
+    stack.push_bool(false);
+  } else {
+    stack.push_smallint(a.workchain);
+    td::RefInt256 x{true};
+    CHECK(x.write().import_bytes(a.addr.data(), 32, false));
+    stack.push_int(std::move(x));
+    stack.push_smallint(a.testnet * 2 + 1 - a.bounceable);
+    stack.push_bool(true);
+  }
+}
+
+void interpret_bytes_to_base64(vm::Stack& stack, bool base64_url) {
+  stack.push_string(td::str_base64_encode(stack.pop_bytes(), base64_url));
+}
+
+void interpret_base64_to_bytes(vm::Stack& stack, bool allow_base64_url, bool quiet) {
+  auto s = stack.pop_string();
+  if (!td::is_valid_base64(s, allow_base64_url)) {
+    stack.push_bool(false);
+    if (!quiet) {
+      throw IntError{"invalid base64"};
+    }
+  } else {
+    stack.push_bytes(td::str_base64_decode(s, allow_base64_url));
+    if (quiet) {
+      stack.push_bool(true);
+    }
+  }
+}
+
+vm::VmLog create_vm_log(td::LogInterface* logger) {
+  if (!logger) {
+    return {};
+  }
+  auto options = td::LogOptions::plain();
+  options.level = 4;
+  options.fix_newlines = true;
+  return {logger, options};
+}
+
+class StringLogger : public td::LogInterface {
+ public:
+  void append(td::CSlice slice) override {
+    res.append(slice.data(), slice.size());
+  }
+  std::string res;
+};
+class OstreamLogger : public td::LogInterface {
+ public:
+  explicit OstreamLogger(std::ostream* stream) : stream_(stream) {
+  }
+  void append(td::CSlice slice) override {
+    stream_->write(slice.data(), slice.size());
+  }
+
+ private:
+  std::ostream* stream_{nullptr};
+};
+
+td::Ref<vm::Box> vm_libraries{true};
+
+std::vector<Ref<vm::Cell>> get_vm_libraries() {
+  if (vm_libraries->get().type() == vm::StackEntry::t_cell) {
+    return {vm_libraries->get().as_cell()};
+  } else {
+    return {};
+  }
+}
+
+void interpret_run_vm_code(IntCtx& ctx, bool with_gas) {
+  long long gas_limit = with_gas ? ctx.stack.pop_long_range(vm::GasLimits::infty) : vm::GasLimits::infty;
+  auto cs = ctx.stack.pop_cellslice();
+  OstreamLogger ostream_logger(ctx.error_stream);
+  auto log = create_vm_log(ctx.error_stream ? &ostream_logger : nullptr);
+  vm::GasLimits gas{gas_limit};
+  int res = vm::run_vm_code(cs, ctx.stack, 0, nullptr, log, nullptr, &gas, get_vm_libraries());
+  ctx.stack.push_smallint(res);
+  if (with_gas) {
+    ctx.stack.push_smallint(gas.gas_consumed());
+  }
+}
+
+void interpret_run_vm_dict(IntCtx& ctx, bool with_gas) {
+  long long gas_limit = with_gas ? ctx.stack.pop_long_range(vm::GasLimits::infty) : vm::GasLimits::infty;
+  auto cs = ctx.stack.pop_cellslice();
+  OstreamLogger ostream_logger(ctx.error_stream);
+  auto log = create_vm_log(ctx.error_stream ? &ostream_logger : nullptr);
+  vm::GasLimits gas{gas_limit};
+  int res = vm::run_vm_code(cs, ctx.stack, 3, nullptr, log, nullptr, &gas, get_vm_libraries());
+  ctx.stack.push_smallint(res);
+  if (with_gas) {
+    ctx.stack.push_smallint(gas.gas_consumed());
+  }
+}
+
+void interpret_run_vm(IntCtx& ctx, bool with_gas) {
+  long long gas_limit = with_gas ? ctx.stack.pop_long_range(vm::GasLimits::infty) : vm::GasLimits::infty;
+  auto data = ctx.stack.pop_cell();
+  auto cs = ctx.stack.pop_cellslice();
+  OstreamLogger ostream_logger(ctx.error_stream);
+  auto log = create_vm_log(ctx.error_stream ? &ostream_logger : nullptr);
+  vm::GasLimits gas{gas_limit};
+  int res = vm::run_vm_code(cs, ctx.stack, 3, &data, log, nullptr, &gas);
+  ctx.stack.push_smallint(res);
+  ctx.stack.push_cell(std::move(data));
+  if (with_gas) {
+    ctx.stack.push_smallint(gas.gas_consumed());
+  }
+}
+
+void do_interpret_db_run_vm_parallel(std::ostream* stream, vm::Stack& stack, vm::TonDb* ton_db_ptr, int threads_n,
+                                     int tasks_n) {
+  if (!ton_db_ptr || !*ton_db_ptr) {
+    throw vm::VmError{vm::Excno::fatal, "Ton database is not available"};
+  }
+  auto& ton_db = *ton_db_ptr;
+  auto txn = ton_db->begin_transaction();
+  auto txn_abort = td::ScopeExit() + [&] { ton_db->abort_transaction(std::move(txn)); };
+
+  struct Task {
+    vm::Ref<vm::CellSlice> code;
+    vm::SmartContractDb smart;
+    td::optional<vm::SmartContractDiff> diff;
+    td::unique_ptr<td::Guard> guard;
+    Ref<vm::Stack> stack;
+    int res{0};
+    Ref<vm::Cell> data;
+    std::string log;
+  };
+  std::vector<Task> tasks(tasks_n);
+  std::vector<td::thread> threads(threads_n);
+
+  for (auto& task : tasks) {
+    task.code = stack.pop_cellslice();
+    auto smart_hash = td::serialize(stack.pop_smallint_range(1000000000));
+    task.smart = txn->begin_smartcontract(smart_hash);
+    task.guard = td::create_lambda_guard([&] { txn->abort_smartcontract(std::move(task.smart)); });
+    auto argsn = stack.pop_smallint_range(100);
+    task.stack = stack.split_top(argsn);
+  }
+
+  std::atomic<int> next_task_i{0};
+  auto run_tasks = [&] {
+    while (true) {
+      auto task_i = next_task_i++;
+      if (task_i >= tasks_n) {
+        break;
+      }
+      auto& task = tasks[task_i];
+      auto data = task.smart->get_root();
+
+      StringLogger logger;
+      vm::VmLog log = create_vm_log(stream ? &logger : nullptr);
+
+      task.res = vm::run_vm_code(task.code, task.stack, 3, &data, std::move(log));
+      task.smart->set_root(data);
+      task.diff = vm::SmartContractDiff(std::move(task.smart));
+      task.data = std::move(data);
+      task.log = std::move(logger.res);
+    }
+  };
+
+  td::Timer timer;
+  for (auto& thread : threads) {
+    thread = td::thread(run_tasks);
+  }
+  run_tasks();
+  for (auto& thread : threads) {
+    thread.join();
+  }
+
+  if (stream) {
+    int id = 0;
+    for (auto& task : tasks) {
+      id++;
+      *stream << "Task #" << id << " vm_log begin" << std::endl;
+      *stream << task.log;
+      *stream << "Task #" << id << " vm_log end" << std::endl;
+    }
+  }
+
+  LOG(ERROR) << timer;
+  timer = {};
+
+  for (auto& task : tasks) {
+    auto retn = task.stack.write().pop_smallint_range(100, -1);
+    if (retn == -1) {
+      retn = task.stack->depth();
+    }
+    stack.push_from_stack(std::move(*task.stack), retn);
+    stack.push_smallint(task.res);
+    stack.push_cell(std::move(task.data));
+    task.guard->dismiss();
+    if (task.diff) {
+      txn->commit_smartcontract(std::move(task.diff.value()));
+    } else {
+      txn->commit_smartcontract(std::move(task.smart));
+    }
+  }
+  LOG(ERROR) << timer;
+  timer = {};
+
+  txn_abort.dismiss();
+  ton_db->commit_transaction(std::move(txn));
+  timer = {};
+  LOG(INFO) << "TonDB stats: \n" << ton_db->stats();
+}
+
+void interpret_db_run_vm(IntCtx& ctx) {
+  do_interpret_db_run_vm_parallel(ctx.error_stream, ctx.stack, ctx.ton_db, 0, 1);
+}
+
+void interpret_db_run_vm_parallel(IntCtx& ctx) {
+  auto threads_n = ctx.stack.pop_smallint_range(32, 0);
+  auto tasks_n = ctx.stack.pop_smallint_range(1000000000);
+  do_interpret_db_run_vm_parallel(ctx.error_stream, ctx.stack, ctx.ton_db, threads_n, tasks_n);
+}
+
+// n -- executes $n
+void interpret_get_cmdline_arg(IntCtx& ctx) {
+  int n = ctx.stack.pop_smallint_range(999999);
+  char buffer[14];
+  sprintf(buffer, "$%d ", n);
+  auto entry = ctx.dictionary->lookup(std::string{buffer});
+  if (!entry) {
+    throw IntError{"-?"};
+  } else {
+    (*entry)(ctx);
+  }
+}
+
+// x1 .. xn n 'w -->
+void interpret_execute_internal(IntCtx& ctx) {
+  Ref<WordDef> word_def = pop_exec_token(ctx);
+  int count = ctx.stack.pop_smallint_range(255);
+  ctx.stack.check_underflow(count);
+  word_def->run(ctx);
+}
+
+// wl x1 .. xn n 'w --> wl'
+void interpret_compile_internal(vm::Stack& stack) {
+  Ref<WordDef> word_def = pop_exec_token(stack);
+  int count = stack.pop_smallint_range(255);
+  do_compile_literals(stack, count);
+  if (word_def != Dictionary::nop_word_def) {
+    do_compile(stack, word_def);
+  }
+}
+
+void do_compile(vm::Stack& stack, Ref<WordDef> word_def) {
+  Ref<WordList> wl_ref = pop_word_list(stack);
+  if (word_def != Dictionary::nop_word_def) {
+    if ((td::uint64)word_def->list_size() <= 1) {
+      // inline short definitions
+      wl_ref.write().append(*(word_def->get_list()));
+    } else {
+      wl_ref.write().push_back(word_def);
+    }
+  }
+  stack.push({vm::from_object, wl_ref});
+}
+
+void compile_one_literal(WordList& wlist, vm::StackEntry val) {
+  using namespace std::placeholders;
+  if (val.type() == vm::StackEntry::t_int) {
+    auto x = std::move(val).as_int();
+    if (!x->signed_fits_bits(257)) {
+      throw IntError{"invalid numeric literal"};
+    } else if (x->signed_fits_bits(64)) {
+      wlist.push_back(Ref<StackWord>{true, std::bind(interpret_const, _1, x->to_long())});
+    } else {
+      wlist.push_back(Ref<StackWord>{true, std::bind(interpret_big_const, _1, std::move(x))});
+    }
+  } else {
+    wlist.push_back(Ref<StackWord>{true, std::bind(interpret_literal, _1, std::move(val))});
+  }
+}
+
+void do_compile_literals(vm::Stack& stack, int count) {
+  if (count < 0) {
+    throw IntError{"cannot compile a negative number of literals"};
+  }
+  stack.check_underflow(count + 1);
+  Ref<WordList> wl_ref = std::move(stack[count]).as_object<WordList>();
+  if (wl_ref.is_null()) {
+    throw IntError{"list of words expected"};
+  }
+  for (int i = count - 1; i >= 0; i--) {
+    compile_one_literal(wl_ref.write(), std::move(stack[i]));
+  }
+  stack.pop_many(count + 1);
+  stack.push({vm::from_object, wl_ref});
+}
+
+void init_words_common(Dictionary& d) {
+  using namespace std::placeholders;
+  d.def_word("nop ", Dictionary::nop_word_def);
+  // stack print/dump words
+  d.def_ctx_word(". ", std::bind(interpret_dot, _1, true));
+  d.def_ctx_word("._ ", std::bind(interpret_dot, _1, false));
+  d.def_ctx_word("x. ", std::bind(interpret_dothex, _1, false, true));
+  d.def_ctx_word("x._ ", std::bind(interpret_dothex, _1, false, false));
+  d.def_ctx_word("X. ", std::bind(interpret_dothex, _1, true, true));
+  d.def_ctx_word("X._ ", std::bind(interpret_dothex, _1, true, false));
+  d.def_ctx_word("b. ", std::bind(interpret_dotbinary, _1, true));
+  d.def_ctx_word("b._ ", std::bind(interpret_dotbinary, _1, false));
+  d.def_ctx_word("csr. ", interpret_dot_cellslice_rec);
+  d.def_ctx_word(".s ", interpret_dotstack);
+  d.def_ctx_word(".sl ", interpret_dotstack_list);
+  d.def_ctx_word(".dump ", interpret_dump);
+  d.def_ctx_word(".l ", interpret_print_list);
+  d.def_ctx_word(".tc ", interpret_dottc);
+  d.def_stack_word("(dump) ", interpret_dump_internal);
+  d.def_stack_word("(.) ", interpret_dot_internal);
+  d.def_stack_word("(x.) ", std::bind(interpret_dothex_internal, _1, false));
+  d.def_stack_word("(X.) ", std::bind(interpret_dothex_internal, _1, true));
+  d.def_stack_word("(b.) ", interpret_dotbinary_internal);
+  // stack manipulation
+  d.def_stack_word("drop ", interpret_drop);
+  d.def_stack_word("2drop ", interpret_2drop);
+  d.def_stack_word("dup ", interpret_dup);
+  d.def_stack_word("over ", interpret_over);
+  d.def_stack_word("2dup ", interpret_2dup);
+  d.def_stack_word("2over ", interpret_2over);
+  d.def_stack_word("swap ", interpret_swap);
+  d.def_stack_word("2swap ", interpret_2swap);
+  d.def_stack_word("tuck ", interpret_tuck);
+  d.def_stack_word("nip ", interpret_nip);
+  d.def_stack_word("rot ", interpret_rot);
+  d.def_stack_word("-rot ", interpret_rot_rev);
+  d.def_stack_word("pick ", interpret_pick);
+  d.def_stack_word("roll ", interpret_roll);
+  d.def_stack_word("-roll ", interpret_roll_rev);
+  d.def_stack_word("reverse ", interpret_reverse);
+  d.def_stack_word("exch ", interpret_exch);
+  d.def_stack_word("exch2 ", interpret_exch2);
+  d.def_stack_word("depth ", interpret_depth);
+  d.def_stack_word("?dup ", interpret_cond_dup);
+  // low-level stack manipulation
+  d.def_stack_word("<xchg> ", interpret_make_xchg);
+  d.def_stack_word("<push> ", interpret_make_push);
+  d.def_stack_word("<pop> ", interpret_make_pop);
+  // arithmetic
+  d.def_stack_word("+ ", interpret_plus);
+  d.def_stack_word("- ", interpret_minus);
+  d.def_stack_word("negate ", interpret_negate);
+  d.def_stack_word("1+ ", std::bind(interpret_plus_tiny, _1, 1));
+  d.def_stack_word("1- ", std::bind(interpret_plus_tiny, _1, -1));
+  d.def_stack_word("2+ ", std::bind(interpret_plus_tiny, _1, 2));
+  d.def_stack_word("2- ", std::bind(interpret_plus_tiny, _1, -2));
+  d.def_stack_word("* ", interpret_times);
+  d.def_stack_word("/ ", std::bind(interpret_div, _1, -1));
+  d.def_stack_word("/c ", std::bind(interpret_div, _1, 1));
+  d.def_stack_word("/r ", std::bind(interpret_div, _1, 0));
+  d.def_stack_word("mod ", std::bind(interpret_mod, _1, -1));
+  d.def_stack_word("rmod ", std::bind(interpret_mod, _1, 0));
+  d.def_stack_word("cmod ", std::bind(interpret_mod, _1, 1));
+  d.def_stack_word("/mod ", std::bind(interpret_divmod, _1, -1));
+  d.def_stack_word("/cmod ", std::bind(interpret_divmod, _1, 1));
+  d.def_stack_word("/rmod ", std::bind(interpret_divmod, _1, 0));
+  d.def_stack_word("*/ ", std::bind(interpret_times_div, _1, -1));
+  d.def_stack_word("*/c ", std::bind(interpret_times_div, _1, 1));
+  d.def_stack_word("*/r ", std::bind(interpret_times_div, _1, 0));
+  d.def_stack_word("*/mod ", std::bind(interpret_times_divmod, _1, -1));
+  d.def_stack_word("*/cmod ", std::bind(interpret_times_divmod, _1, 1));
+  d.def_stack_word("*/rmod ", std::bind(interpret_times_divmod, _1, 0));
+  d.def_stack_word("*mod ", std::bind(interpret_times_mod, _1, -1));
+  d.def_stack_word("1<< ", interpret_pow2);
+  d.def_stack_word("-1<< ", interpret_neg_pow2);
+  d.def_stack_word("1<<1- ", interpret_pow2_minus1);
+  d.def_stack_word("%1<< ", interpret_mod_pow2);
+  d.def_stack_word("<< ", interpret_lshift);
+  d.def_stack_word(">> ", std::bind(interpret_rshift, _1, -1));
+  d.def_stack_word(">>c ", std::bind(interpret_rshift, _1, 1));
+  d.def_stack_word(">>r ", std::bind(interpret_rshift, _1, 0));
+  d.def_stack_word("2* ", std::bind(interpret_lshift_const, _1, 1));
+  d.def_stack_word("2/ ", std::bind(interpret_rshift_const, _1, 1));
+  d.def_stack_word("*>> ", std::bind(interpret_times_rshift, _1, -1));
+  d.def_stack_word("*>>c ", std::bind(interpret_times_rshift, _1, 1));
+  d.def_stack_word("*>>r ", std::bind(interpret_times_rshift, _1, 0));
+  d.def_stack_word("<</ ", std::bind(interpret_lshift_div, _1, -1));
+  d.def_stack_word("<</c ", std::bind(interpret_lshift_div, _1, 1));
+  d.def_stack_word("<</r ", std::bind(interpret_lshift_div, _1, 0));
+  d.def_stack_word("integer? ", std::bind(interpret_has_type, _1, vm::StackEntry::t_int));
+  d.def_stack_word("box? ", std::bind(interpret_has_type, _1, vm::StackEntry::t_box));
+  // logical
+  d.def_stack_word("not ", interpret_not);
+  d.def_stack_word("and ", interpret_and);
+  d.def_stack_word("or ", interpret_or);
+  d.def_stack_word("xor ", interpret_xor);
+  // integer constants
+  d.def_stack_word("false ", std::bind(interpret_const, _1, 0));
+  d.def_stack_word("true ", std::bind(interpret_const, _1, -1));
+  d.def_stack_word("0 ", std::bind(interpret_const, _1, 0));
+  d.def_stack_word("1 ", std::bind(interpret_const, _1, 1));
+  d.def_stack_word("2 ", std::bind(interpret_const, _1, 2));
+  d.def_stack_word("-1 ", std::bind(interpret_const, _1, -1));
+  d.def_stack_word("bl ", std::bind(interpret_const, _1, 32));
+  // integer comparison
+  d.def_stack_word("cmp ", std::bind(interpret_cmp, _1, "\xff\x00\x01"));
+  d.def_stack_word("= ", std::bind(interpret_cmp, _1, "\x00\xff\x00"));
+  d.def_stack_word("<> ", std::bind(interpret_cmp, _1, "\xff\x00\xff"));
+  d.def_stack_word("<= ", std::bind(interpret_cmp, _1, "\xff\xff\x00"));
+  d.def_stack_word(">= ", std::bind(interpret_cmp, _1, "\x00\xff\xff"));
+  d.def_stack_word("< ", std::bind(interpret_cmp, _1, "\xff\x00\x00"));
+  d.def_stack_word("> ", std::bind(interpret_cmp, _1, "\x00\x00\xff"));
+  d.def_stack_word("sgn ", std::bind(interpret_sgn, _1, "\xff\x00\x01"));
+  d.def_stack_word("0= ", std::bind(interpret_sgn, _1, "\x00\xff\x00"));
+  d.def_stack_word("0<> ", std::bind(interpret_sgn, _1, "\xff\x00\xff"));
+  d.def_stack_word("0<= ", std::bind(interpret_sgn, _1, "\xff\xff\x00"));
+  d.def_stack_word("0>= ", std::bind(interpret_sgn, _1, "\x00\xff\xff"));
+  d.def_stack_word("0< ", std::bind(interpret_sgn, _1, "\xff\x00\x00"));
+  d.def_stack_word("0> ", std::bind(interpret_sgn, _1, "\x00\x00\xff"));
+  d.def_stack_word("fits ", std::bind(interpret_fits, _1, true));
+  d.def_stack_word("ufits ", std::bind(interpret_fits, _1, false));
+  // char/string manipulation
+  d.def_active_word("\"", interpret_quote_str);
+  d.def_active_word("char ", interpret_char);
+  d.def_ctx_word("emit ", interpret_emit);
+  d.def_ctx_word("space ", std::bind(interpret_emit_const, _1, ' '));
+  d.def_ctx_word("cr ", std::bind(interpret_emit_const, _1, '\n'));
+  d.def_ctx_word("type ", interpret_type);
+  d.def_stack_word("string? ", interpret_is_string);
+  d.def_stack_word("chr ", interpret_chr);
+  d.def_stack_word("hold ", interpret_hold);
+  d.def_stack_word("(number) ", interpret_parse_number);
+  d.def_stack_word("(hex-number) ", interpret_parse_hex_number);
+  d.def_stack_word("$| ", interpret_str_split);
+  d.def_stack_word("$+ ", interpret_str_concat);
+  d.def_stack_word("$= ", interpret_str_equal);
+  d.def_stack_word("$cmp ", interpret_str_cmp);
+  d.def_stack_word("$reverse ", interpret_str_reverse);
+  d.def_stack_word("(-trailing) ", std::bind(interpret_str_remove_trailing_int, _1, 0));
+  d.def_stack_word("-trailing ", std::bind(interpret_str_remove_trailing_int, _1, ' '));
+  d.def_stack_word("-trailing0 ", std::bind(interpret_str_remove_trailing_int, _1, '0'));
+  d.def_stack_word("$len ", interpret_str_len);
+  d.def_stack_word("Blen ", interpret_bytes_len);
+  d.def_ctx_word("Bx. ", std::bind(interpret_bytes_hex_print_raw, _1, true));
+  d.def_stack_word("B>X ", std::bind(interpret_bytes_to_hex, _1, true));
+  d.def_stack_word("B>x ", std::bind(interpret_bytes_to_hex, _1, false));
+  d.def_stack_word("x>B ", std::bind(interpret_hex_to_bytes, _1, false));
+  d.def_stack_word("x>B? ", std::bind(interpret_hex_to_bytes, _1, true));
+  d.def_stack_word("B| ", interpret_bytes_split);
+  d.def_stack_word("B+ ", interpret_bytes_concat);
+  d.def_stack_word("B= ", interpret_bytes_equal);
+  d.def_stack_word("Bcmp ", interpret_bytes_cmp);
+  d.def_stack_word("u>B ", std::bind(interpret_int_to_bytes, _1, false, false));
+  d.def_stack_word("i>B ", std::bind(interpret_int_to_bytes, _1, true, false));
+  d.def_stack_word("Lu>B ", std::bind(interpret_int_to_bytes, _1, false, true));
+  d.def_stack_word("Li>B ", std::bind(interpret_int_to_bytes, _1, true, true));
+  d.def_stack_word("B>u@ ", std::bind(interpret_bytes_fetch_int, _1, 0));
+  d.def_stack_word("B>i@ ", std::bind(interpret_bytes_fetch_int, _1, 1));
+  d.def_stack_word("B>u@+ ", std::bind(interpret_bytes_fetch_int, _1, 2));
+  d.def_stack_word("B>i@+ ", std::bind(interpret_bytes_fetch_int, _1, 3));
+  d.def_stack_word("B>Lu@ ", std::bind(interpret_bytes_fetch_int, _1, 0x10));
+  d.def_stack_word("B>Li@ ", std::bind(interpret_bytes_fetch_int, _1, 0x11));
+  d.def_stack_word("B>Lu@+ ", std::bind(interpret_bytes_fetch_int, _1, 0x12));
+  d.def_stack_word("B>Li@+ ", std::bind(interpret_bytes_fetch_int, _1, 0x13));
+  d.def_stack_word("$>B ", interpret_string_to_bytes);
+  d.def_stack_word("Bhash ", interpret_bytes_hash);
+  // cell manipulation (create, write and modify cells)
+  d.def_stack_word("<b ", interpret_empty);
+  d.def_stack_word("i, ", std::bind(interpret_store, _1, true));
+  d.def_stack_word("u, ", std::bind(interpret_store, _1, false));
+  d.def_stack_word("ref, ", interpret_store_ref);
+  d.def_stack_word("$, ", interpret_store_str);
+  d.def_stack_word("B, ", interpret_store_bytes);
+  d.def_stack_word("s, ", interpret_store_cellslice);
+  d.def_stack_word("sr, ", interpret_store_cellslice_ref);
+  d.def_stack_word("b> ", std::bind(interpret_store_end, _1, false));
+  d.def_stack_word("b>spec ", std::bind(interpret_store_end, _1, true));
+  d.def_stack_word("$>s ", interpret_string_to_cellslice);
+  d.def_stack_word("|+ ", interpret_concat_cellslice);
+  d.def_stack_word("|_ ", interpret_concat_cellslice_ref);
+  d.def_stack_word("b+ ", interpret_concat_builders);
+  d.def_stack_word("bbits ", std::bind(interpret_builder_bitrefs, _1, 1));
+  d.def_stack_word("brefs ", std::bind(interpret_builder_bitrefs, _1, 2));
+  d.def_stack_word("bbitrefs ", std::bind(interpret_builder_bitrefs, _1, 3));
+  d.def_stack_word("brembits ", std::bind(interpret_builder_remaining_bitrefs, _1, 1));
+  d.def_stack_word("bremrefs ", std::bind(interpret_builder_remaining_bitrefs, _1, 2));
+  d.def_stack_word("brembitrefs ", std::bind(interpret_builder_remaining_bitrefs, _1, 3));
+  d.def_stack_word("hash ", interpret_cell_hash);
+  // cellslice manipulation (read from cells)
+  d.def_stack_word("<s ", interpret_from_cell);
+  d.def_stack_word("i@ ", std::bind(interpret_fetch, _1, 1));
+  d.def_stack_word("u@ ", std::bind(interpret_fetch, _1, 0));
+  d.def_stack_word("i@+ ", std::bind(interpret_fetch, _1, 3));
+  d.def_stack_word("u@+ ", std::bind(interpret_fetch, _1, 2));
+  d.def_stack_word("i@? ", std::bind(interpret_fetch, _1, 5));
+  d.def_stack_word("u@? ", std::bind(interpret_fetch, _1, 4));
+  d.def_stack_word("i@?+ ", std::bind(interpret_fetch, _1, 7));
+  d.def_stack_word("u@?+ ", std::bind(interpret_fetch, _1, 6));
+  d.def_stack_word("$@ ", std::bind(interpret_fetch_bytes, _1, 0));
+  d.def_stack_word("B@ ", std::bind(interpret_fetch_bytes, _1, 1));
+  d.def_stack_word("$@+ ", std::bind(interpret_fetch_bytes, _1, 2));
+  d.def_stack_word("B@+ ", std::bind(interpret_fetch_bytes, _1, 3));
+  d.def_stack_word("$@? ", std::bind(interpret_fetch_bytes, _1, 4));
+  d.def_stack_word("B@? ", std::bind(interpret_fetch_bytes, _1, 5));
+  d.def_stack_word("$@?+ ", std::bind(interpret_fetch_bytes, _1, 6));
+  d.def_stack_word("B@?+ ", std::bind(interpret_fetch_bytes, _1, 7));
+  d.def_stack_word("ref@ ", std::bind(interpret_fetch_ref, _1, 0));
+  d.def_stack_word("ref@+ ", std::bind(interpret_fetch_ref, _1, 2));
+  d.def_stack_word("ref@? ", std::bind(interpret_fetch_ref, _1, 4));
+  d.def_stack_word("ref@?+ ", std::bind(interpret_fetch_ref, _1, 6));
+  d.def_stack_word("s> ", interpret_cell_check_empty);
+  d.def_stack_word("empty? ", interpret_cell_empty);
+  d.def_stack_word("remaining ", interpret_cell_remaining);
+  d.def_stack_word("sbits ", std::bind(interpret_slice_bitrefs, _1, 1));
+  d.def_stack_word("srefs ", std::bind(interpret_slice_bitrefs, _1, 2));
+  d.def_stack_word("sbitrefs ", std::bind(interpret_slice_bitrefs, _1, 3));
+  // boc manipulation
+  d.def_stack_word("B>boc ", interpret_boc_deserialize);
+  d.def_stack_word("boc>B ", interpret_boc_serialize);
+  d.def_stack_word("boc+>B ", interpret_boc_serialize_ext);
+  d.def_ctx_word("file>B ", interpret_read_file);
+  d.def_ctx_word("filepart>B ", interpret_read_file_part);
+  d.def_ctx_word("B>file ", interpret_write_file);
+  d.def_ctx_word("file-exists? ", interpret_file_exists);
+  // custom & crypto
+  d.def_stack_word("now ", interpret_now);
+  d.def_stack_word("newkeypair ", interpret_new_keypair);
+  d.def_stack_word("priv>pub ", interpret_priv_key_to_pub);
+  d.def_stack_word("ed25519_sign ", interpret_ed25519_sign);
+  d.def_stack_word("ed25519_chksign ", interpret_ed25519_chksign);
+  d.def_stack_word("ed25519_sign_uint ", interpret_ed25519_sign_uint);
+  d.def_stack_word("crc16 ", interpret_crc16);
+  d.def_stack_word("crc32 ", interpret_crc32);
+  d.def_stack_word("crc32c ", interpret_crc32c);
+  // vm dictionaries
+  d.def_stack_word("dictnew ", interpret_dict_new);
+  d.def_stack_word("dict>s ", interpret_dict_to_slice);
+  d.def_stack_word("dict, ", interpret_store_dict);
+  d.def_stack_word("dict@ ", std::bind(interpret_load_dict, _1, false));
+  d.def_stack_word("dict@+ ", std::bind(interpret_load_dict, _1, true));
+  d.def_stack_word("udict!+ ", std::bind(interpret_dict_add_u, _1, vm::Dictionary::SetMode::Add, false, false));
+  d.def_stack_word("udict! ", std::bind(interpret_dict_add_u, _1, vm::Dictionary::SetMode::Set, false, false));
+  d.def_stack_word("b>udict!+ ", std::bind(interpret_dict_add_u, _1, vm::Dictionary::SetMode::Add, true, false));
+  d.def_stack_word("b>udict! ", std::bind(interpret_dict_add_u, _1, vm::Dictionary::SetMode::Set, true, false));
+  d.def_stack_word("udict@ ", std::bind(interpret_dict_get_u, _1, false));
+  d.def_stack_word("idict!+ ", std::bind(interpret_dict_add_u, _1, vm::Dictionary::SetMode::Add, false, true));
+  d.def_stack_word("idict! ", std::bind(interpret_dict_add_u, _1, vm::Dictionary::SetMode::Set, false, true));
+  d.def_stack_word("b>idict!+ ", std::bind(interpret_dict_add_u, _1, vm::Dictionary::SetMode::Add, true, true));
+  d.def_stack_word("b>idict! ", std::bind(interpret_dict_add_u, _1, vm::Dictionary::SetMode::Set, true, true));
+  d.def_stack_word("idict@ ", std::bind(interpret_dict_get_u, _1, true));
+  d.def_stack_word("pfxdict!+ ", std::bind(interpret_pfx_dict_add, _1, vm::Dictionary::SetMode::Add, false));
+  d.def_stack_word("pfxdict! ", std::bind(interpret_pfx_dict_add, _1, vm::Dictionary::SetMode::Set, false));
+  d.def_stack_word("pfxdict@ ", interpret_pfx_dict_get);
+  d.def_ctx_word("dictmap ", interpret_dict_map);
+  d.def_ctx_word("dictmapext ", interpret_dict_map_ext);
+  d.def_ctx_word("dictforeach ", interpret_dict_foreach);
+  d.def_ctx_word("dictmerge ", interpret_dict_merge);
+  d.def_ctx_word("dictdiff ", interpret_dict_diff);
+  // slice/bitstring constants
+  d.def_active_word("B{", interpret_bytes_hex_literal);
+  d.def_active_word("x{", interpret_bitstring_hex_literal);
+  d.def_active_word("b{", interpret_bitstring_binary_literal);
+  // boxes/holes/variables
+  d.def_stack_word("hole ", interpret_hole);
+  d.def_stack_word("box ", interpret_box);
+  d.def_stack_word("@ ", interpret_box_fetch);
+  d.def_stack_word("! ", interpret_box_store);
+  d.def_stack_word("null ", interpret_push_null);
+  d.def_stack_word("null? ", interpret_is_null);
+  // tuples/arrays
+  d.def_stack_word("| ", interpret_empty_tuple);
+  d.def_stack_word(", ", interpret_tuple_push);
+  d.def_stack_word("tpop ", interpret_tuple_pop);
+  d.def_stack_word("[] ", interpret_tuple_index);
+  d.def_stack_word("[]= ", interpret_tuple_set);
+  d.def_stack_word("count ", interpret_tuple_len);
+  d.def_stack_word("tuple? ", interpret_is_tuple);
+  d.def_stack_word("tuple ", interpret_make_tuple);
+  d.def_stack_word("untuple ", std::bind(interpret_tuple_explode, _1, true));
+  d.def_stack_word("explode ", std::bind(interpret_tuple_explode, _1, false));
+  d.def_stack_word("allot ", interpret_allot);
+  // atoms
+  d.def_stack_word("anon ", interpret_atom_anon);
+  d.def_stack_word("(atom) ", interpret_atom);
+  d.def_stack_word("atom>$ ", interpret_atom_name);
+  d.def_stack_word("eq? ", interpret_is_eq);
+  d.def_stack_word("eqv? ", interpret_is_eqv);
+  d.def_stack_word("atom? ", interpret_is_atom);
+  // execution control
+  d.def_ctx_tail_word("execute ", interpret_execute);
+  d.def_ctx_tail_word("times ", interpret_execute_times);
+  d.def_ctx_tail_word("if ", interpret_if);
+  d.def_ctx_tail_word("ifnot ", interpret_ifnot);
+  d.def_ctx_tail_word("cond ", interpret_cond);
+  d.def_ctx_word("while ", interpret_while);
+  d.def_ctx_word("until ", interpret_until);
+  // compiler control
+  d.def_active_word("[ ", interpret_internal_interpret_begin);
+  d.def_active_word("] ", interpret_internal_interpret_end);
+  d.def_active_word("{ ", interpret_wordlist_begin);
+  d.def_active_word("} ", interpret_wordlist_end);
+  d.def_stack_word("({) ", interpret_wordlist_begin_aux);
+  d.def_stack_word("(}) ", interpret_wordlist_end_aux);
+  d.def_stack_word("(compile) ", interpret_compile_internal);
+  d.def_ctx_word("(execute) ", interpret_execute_internal);
+  d.def_active_word("' ", interpret_tick);
+  d.def_stack_word("'nop ", interpret_tick_nop);
+  // dictionary manipulation
+  d.def_ctx_word("find ", interpret_find);
+  d.def_ctx_word("create ", interpret_create);
+  d.def_ctx_word("(create) ", std::bind(interpret_create_aux, _1, -1));
+  d.def_active_word(": ", std::bind(interpret_colon, _1, 0));
+  d.def_active_word(":: ", std::bind(interpret_colon, _1, 1));
+  d.def_active_word(":_ ", std::bind(interpret_colon, _1, 2));
+  d.def_active_word("::_ ", std::bind(interpret_colon, _1, 3));
+  d.def_ctx_word("(forget) ", interpret_forget_aux);
+  d.def_ctx_word("forget ", interpret_forget);
+  d.def_ctx_word("words ", interpret_words);
+  // input parse
+  d.def_ctx_word("word ", interpret_word);
+  d.def_ctx_word("(word) ", interpret_word_ext);
+  d.def_ctx_word("skipspc ", interpret_skipspc);
+  d.def_ctx_word("include ", interpret_include);
+  d.def_stack_word("skip-to-eof ", interpret_skip_source);
+  d.def_ctx_word("abort ", interpret_abort);
+  d.def_ctx_word("quit ", interpret_quit);
+  d.def_ctx_word("bye ", interpret_bye);
+  d.def_stack_word("halt ", interpret_halt);
+}
+
+void init_words_ton(Dictionary& d) {
+  using namespace std::placeholders;
+  d.def_stack_word("smca>$ ", interpret_pack_std_smc_addr);
+  d.def_stack_word("$>smca ", interpret_unpack_std_smc_addr);
+  d.def_stack_word("B>base64 ", std::bind(interpret_bytes_to_base64, _1, false));
+  d.def_stack_word("B>base64url ", std::bind(interpret_bytes_to_base64, _1, true));
+  d.def_stack_word("base64>B ", std::bind(interpret_base64_to_bytes, _1, false, false));
+  d.def_stack_word("base64url>B ", std::bind(interpret_base64_to_bytes, _1, true, false));
+}
+
+void init_words_vm(Dictionary& d) {
+  using namespace std::placeholders;
+  vm::init_op_cp0();
+  // vm run
+  d.def_stack_word("vmlibs ", std::bind(interpret_literal, _1, vm::StackEntry{vm_libraries}));
+  d.def_ctx_word("runvmcode ", std::bind(interpret_run_vm_code, _1, false));
+  d.def_ctx_word("gasrunvmcode ", std::bind(interpret_run_vm_code, _1, true));
+  d.def_ctx_word("runvmdict ", std::bind(interpret_run_vm_dict, _1, false));
+  d.def_ctx_word("gasrunvmdict ", std::bind(interpret_run_vm_dict, _1, true));
+  d.def_ctx_word("runvm ", std::bind(interpret_run_vm, _1, false));
+  d.def_ctx_word("gasrunvm ", std::bind(interpret_run_vm, _1, true));
+  d.def_ctx_word("dbrunvm ", interpret_db_run_vm);
+  d.def_ctx_word("dbrunvm-parallel ", interpret_db_run_vm_parallel);
+}
+
+void import_cmdline_args(Dictionary& d, std::string arg0, int n, const char* const argv[]) {
+  using namespace std::placeholders;
+  LOG(DEBUG) << "import_cmdlist_args(" << arg0 << "," << n << ")";
+  d.def_stack_word("$0 ", std::bind(interpret_literal, _1, vm::StackEntry{arg0}));
+  for (int i = 0; i < n; i++) {
+    char buffer[14];
+    sprintf(buffer, "$%d ", i + 1);
+    d.def_stack_word(buffer, std::bind(interpret_literal, _1, vm::StackEntry{argv[i]}));
+  }
+  d.def_stack_word("$# ", std::bind(interpret_const, _1, n));
+  d.def_ctx_word("$() ", interpret_get_cmdline_arg);
+}
+
+std::pair<td::RefInt256, td::RefInt256> numeric_value_ext(std::string s, bool allow_frac = true) {
+  td::RefInt256 num, denom;
+  int res = parse_number(s, num, denom, allow_frac);
+  if (res <= 0) {
+    throw IntError{"-?"};
+  }
+  return std::make_pair(std::move(num), res == 2 ? std::move(denom) : td::RefInt256{});
+}
+
+td::RefInt256 numeric_value(std::string s) {
+  td::RefInt256 num, denom;
+  int res = parse_number(s, num, denom, false);
+  if (res != 1) {
+    throw IntError{"-?"};
+  }
+  return num;
+}
+
+int funny_interpret_loop(IntCtx& ctx) {
+  while (ctx.load_next_line()) {
+    if (ctx.is_sb()) {
+      continue;
+    }
+    std::ostringstream errs;
+    bool ok = true;
+    while (ok) {
+      ctx.skipspc();
+      const char* ptr = ctx.get_input();
+      if (!*ptr) {
+        break;
+      }
+      std::string Word;
+      Word.reserve(128);
+      auto entry = ctx.dictionary->lookup("");
+      std::string entry_word;
+      const char* ptr_end = ptr;
+      while (*ptr && *ptr != ' ' && *ptr != '\t') {
+        Word += *ptr++;
+        auto cur = ctx.dictionary->lookup(Word);
+        if (cur) {
+          entry = cur;
+          entry_word = Word;
+          ptr_end = ptr;
+        }
+      }
+      auto cur = ctx.dictionary->lookup(Word + " ");
+      if (cur || !entry) {
+        entry = std::move(cur);
+        ctx.set_input(ptr);
+        ctx.skipspc();
+      } else {
+        Word = entry_word;
+        ctx.set_input(ptr_end);
+      }
+      try {
+        if (entry) {
+          if (entry->is_active()) {
+            (*entry)(ctx);
+          } else {
+            ctx.stack.push_smallint(0);
+            ctx.stack.push({vm::from_object, entry->get_def()});
+          }
+        } else {
+          auto res = numeric_value_ext(Word);
+          ctx.stack.push(std::move(res.first));
+          if (res.second.not_null()) {
+            ctx.stack.push(std::move(res.second));
+            push_argcount(ctx, 2);
+          } else {
+            push_argcount(ctx, 1);
+          }
+        }
+        if (ctx.state > 0) {
+          interpret_compile_internal(ctx.stack);
+        } else {
+          interpret_execute_internal(ctx);
+        }
+      } catch (IntError& ab) {
+        errs << ctx << Word << ": " << ab.msg;
+        ok = false;
+      } catch (vm::VmError& ab) {
+        errs << ctx << Word << ": " << ab.get_msg();
+        ok = false;
+      } catch (vm::CellBuilder::CellWriteError) {
+        errs << ctx << Word << ": Cell builder write error";
+        ok = false;
+      } catch (vm::VmFatal) {
+        errs << ctx << Word << ": fatal vm error";
+        ok = false;
+      } catch (Quit& q) {
+        if (ctx.include_depth) {
+          throw;
+        }
+        if (!q.res) {
+          ok = false;
+        } else {
+          return q.res;
+        }
+      } catch (SkipToEof) {
+        return 0;
+      }
+    };
+    if (!ok) {
+      auto err_msg = errs.str();
+      if (!err_msg.empty()) {
+        LOG(ERROR) << err_msg;
+      }
+      ctx.clear();
+      if (ctx.include_depth) {
+        throw IntError{"error interpreting included file `" + ctx.filename + "` : " + err_msg};
+      }
+    } else if (!ctx.state && !ctx.include_depth) {
+      *ctx.output_stream << " ok" << std::endl;
+    }
+  }
+  return 0;
+}
+
+}  // namespace fift
diff --git a/submodules/ton/tonlib-src/crypto/fift/words.h b/submodules/ton/tonlib-src/crypto/fift/words.h
new file mode 100644
index 0000000000..eac182e43b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/fift/words.h
@@ -0,0 +1,43 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "Dictionary.h"
+
+namespace fift {
+
+// thrown by 'quit', 'bye' and 'halt' for exiting to top level
+struct Quit {
+  int res;
+  Quit() : res(0) {
+  }
+  Quit(int _res) : res(_res) {
+  }
+};
+
+struct SkipToEof {};
+
+void init_words_common(Dictionary& dictionary);
+void init_words_vm(Dictionary& dictionary);
+void init_words_ton(Dictionary& dictionary);
+
+void import_cmdline_args(Dictionary& d, std::string arg0, int n, const char* const argv[]);
+
+int funny_interpret_loop(IntCtx& ctx);
+
+}  // namespace fift
diff --git a/submodules/ton/tonlib-src/crypto/func/abscode.cpp b/submodules/ton/tonlib-src/crypto/func/abscode.cpp
new file mode 100644
index 0000000000..1bc4f0d9db
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/abscode.cpp
@@ -0,0 +1,492 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "func.h"
+
+namespace funC {
+
+/*
+ * 
+ *   ABSTRACT CODE
+ * 
+ */
+
+TmpVar::TmpVar(var_idx_t _idx, int _cls, TypeExpr* _type, SymDef* sym, const SrcLocation* loc)
+    : v_type(_type), idx(_idx), cls(_cls), coord(0) {
+  if (sym) {
+    name = sym->sym_idx;
+    sym->value->idx = _idx;
+  }
+  if (loc) {
+    where = std::make_unique<SrcLocation>(*loc);
+  }
+  if (!_type) {
+    v_type = TypeExpr::new_hole();
+  }
+}
+
+void TmpVar::set_location(const SrcLocation& loc) {
+  if (where) {
+    *where = loc;
+  } else {
+    where = std::make_unique<SrcLocation>(loc);
+  }
+}
+
+void TmpVar::dump(std::ostream& os) const {
+  show(os);
+  os << " : " << v_type << " (width ";
+  v_type->show_width(os);
+  os << ")";
+  if (coord > 0) {
+    os << " = _" << (coord >> 8) << '.' << (coord & 255);
+  } else if (coord < 0) {
+    int n = (~coord >> 8), k = (~coord & 0xff);
+    if (k) {
+      os << " = (_" << n << ".._" << (n + k - 1) << ")";
+    } else {
+      os << " = ()";
+    }
+  }
+  os << std::endl;
+}
+
+void TmpVar::show(std::ostream& os, int omit_idx) const {
+  if (cls & _Named) {
+    os << sym::symbols.get_name(name);
+    if (omit_idx && (omit_idx >= 2 || (cls & _UniqueName))) {
+      return;
+    }
+  }
+  os << '_' << idx;
+}
+
+std::ostream& operator<<(std::ostream& os, const TmpVar& var) {
+  var.show(os);
+  return os;
+}
+
+void VarDescr::show_value(std::ostream& os) const {
+  if (val & _Int) {
+    os << 'i';
+  }
+  if (val & _Const) {
+    os << 'c';
+  }
+  if (val & _Zero) {
+    os << '0';
+  }
+  if (val & _NonZero) {
+    os << '!';
+  }
+  if (val & _Pos) {
+    os << '>';
+  }
+  if (val & _Neg) {
+    os << '<';
+  }
+  if (val & _Bool) {
+    os << 'B';
+  }
+  if (val & _Bit) {
+    os << 'b';
+  }
+  if (val & _Even) {
+    os << 'E';
+  }
+  if (val & _Odd) {
+    os << 'O';
+  }
+  if (val & _Finite) {
+    os << 'f';
+  }
+  if (val & _Nan) {
+    os << 'N';
+  }
+  if (int_const.not_null()) {
+    os << '=' << int_const;
+  }
+}
+
+void VarDescr::show(std::ostream& os, const char* name) const {
+  if (flags & _Last) {
+    os << '*';
+  }
+  if (flags & _Unused) {
+    os << '?';
+  }
+  if (name) {
+    os << name;
+  }
+  os << '_' << idx;
+  show_value(os);
+}
+
+void VarDescr::set_const(long long value) {
+  return set_const(td::RefInt256{true, value});
+}
+
+void VarDescr::set_const(td::RefInt256 value) {
+  int_const = std::move(value);
+  if (!int_const->signed_fits_bits(257)) {
+    int_const.write().invalidate();
+  }
+  val = _Const | _Int;
+  int s = sgn(int_const);
+  if (s < -1) {
+    val |= _Nan | _NonZero;
+  } else if (s < 0) {
+    val |= _NonZero | _Neg | _Finite;
+    if (*int_const == -1) {
+      val |= _Bool;
+    }
+  } else if (s > 0) {
+    val |= _NonZero | _Pos | _Finite;
+  } else if (!s) {
+    if (*int_const == 1) {
+      val |= _Bit;
+    }
+    val |= _Zero | _Neg | _Pos | _Finite | _Bool | _Bit;
+  }
+  if (val & _Finite) {
+    val |= int_const->get_bit(0) ? _Odd : _Even;
+  }
+}
+
+void VarDescr::set_const_nan() {
+  set_const(td::RefInt256{true});
+}
+
+void VarDescr::operator|=(const VarDescr& y) {
+  val &= y.val;
+  if (is_int_const() && cmp(int_const, y.int_const) != 0) {
+    val &= ~_Const;
+  }
+  if (!(val & _Const)) {
+    int_const.clear();
+  }
+}
+
+void VarDescr::operator&=(const VarDescr& y) {
+  val |= y.val;
+  if (y.int_const.not_null() && int_const.is_null()) {
+    int_const = y.int_const;
+  }
+}
+
+void VarDescr::set_value(const VarDescr& y) {
+  val = y.val;
+  int_const = y.int_const;
+}
+
+void VarDescr::set_value(VarDescr&& y) {
+  val = y.val;
+  int_const = std::move(y.int_const);
+}
+
+void VarDescr::clear_value() {
+  val = 0;
+  int_const.clear();
+}
+
+void VarDescrList::show(std::ostream& os) const {
+  os << "[";
+  for (const auto& v : list) {
+    os << ' ' << v;
+  }
+  os << " ]\n";
+}
+
+void Op::flags_set_clear(int set, int clear) {
+  flags = (flags | set) & ~clear;
+  for (auto& op : block0) {
+    op.flags_set_clear(set, clear);
+  }
+  for (auto& op : block1) {
+    op.flags_set_clear(set, clear);
+  }
+}
+void Op::split_vars(const std::vector<TmpVar>& vars) {
+  split_var_list(left, vars);
+  split_var_list(right, vars);
+  for (auto& op : block0) {
+    op.split_vars(vars);
+  }
+  for (auto& op : block1) {
+    op.split_vars(vars);
+  }
+}
+
+void Op::split_var_list(std::vector<var_idx_t>& var_list, const std::vector<TmpVar>& vars) {
+  int new_size = 0, changes = 0;
+  for (var_idx_t v : var_list) {
+    int c = vars.at(v).coord;
+    if (c < 0) {
+      ++changes;
+      new_size += (~c & 0xff);
+    } else {
+      ++new_size;
+    }
+  }
+  if (!changes) {
+    return;
+  }
+  std::vector<var_idx_t> new_var_list;
+  new_var_list.reserve(new_size);
+  for (var_idx_t v : var_list) {
+    int c = vars.at(v).coord;
+    if (c < 0) {
+      int n = (~c >> 8), k = (~c & 0xff);
+      while (k-- > 0) {
+        new_var_list.push_back(n++);
+      }
+    } else {
+      new_var_list.push_back(v);
+    }
+  }
+  var_list = std::move(new_var_list);
+}
+
+void Op::show(std::ostream& os, const std::vector<TmpVar>& vars, std::string pfx, int mode) const {
+  if (mode & 2) {
+    os << pfx << " [";
+    for (const auto& v : var_info.list) {
+      os << ' ';
+      if (v.flags & VarDescr::_Last) {
+        os << '*';
+      }
+      if (v.flags & VarDescr::_Unused) {
+        os << '?';
+      }
+      os << vars[v.idx];
+      if (mode & 4) {
+        os << ':';
+        v.show_value(os);
+      }
+    }
+    os << " ]\n";
+  }
+  std::string dis = disabled() ? "<disabled> " : "";
+  if (noreturn()) {
+    dis += "<noret> ";
+  }
+  if (!is_pure()) {
+    dis += "<impure> ";
+  }
+  switch (cl) {
+    case _Undef:
+      os << pfx << dis << "???\n";
+      break;
+    case _Nop:
+      os << pfx << dis << "NOP\n";
+      break;
+    case _Call:
+      os << pfx << dis << "CALL: ";
+      show_var_list(os, left, vars);
+      os << " := " << (fun_ref ? fun_ref->name() : "(null)") << " ";
+      if ((mode & 4) && args.size() == right.size()) {
+        show_var_list(os, args, vars);
+      } else {
+        show_var_list(os, right, vars);
+      }
+      os << std::endl;
+      break;
+    case _CallInd:
+      os << pfx << dis << "CALLIND: ";
+      show_var_list(os, left, vars);
+      os << " := EXEC ";
+      show_var_list(os, right, vars);
+      os << std::endl;
+      break;
+    case _Let:
+      os << pfx << dis << "LET ";
+      show_var_list(os, left, vars);
+      os << " := ";
+      show_var_list(os, right, vars);
+      os << std::endl;
+      break;
+    case _IntConst:
+      os << pfx << dis << "CONST ";
+      show_var_list(os, left, vars);
+      os << " := " << int_const << std::endl;
+      break;
+    case _Import:
+      os << pfx << dis << "IMPORT ";
+      show_var_list(os, left, vars);
+      os << std::endl;
+      break;
+    case _Return:
+      os << pfx << dis << "RETURN ";
+      show_var_list(os, left, vars);
+      os << std::endl;
+      break;
+    case _GlobVar:
+      os << pfx << dis << "GLOBVAR ";
+      show_var_list(os, left, vars);
+      os << " := " << (fun_ref ? fun_ref->name() : "(null)") << std::endl;
+      break;
+    case _Repeat:
+      os << pfx << dis << "REPEAT ";
+      show_var_list(os, left, vars);
+      os << ' ';
+      show_block(os, block0.get(), vars, pfx, mode);
+      os << std::endl;
+      break;
+    case _If:
+      os << pfx << dis << "IF ";
+      show_var_list(os, left, vars);
+      os << ' ';
+      show_block(os, block0.get(), vars, pfx, mode);
+      os << " ELSE ";
+      show_block(os, block1.get(), vars, pfx, mode);
+      os << std::endl;
+      break;
+    case _While:
+      os << pfx << dis << "WHILE ";
+      show_var_list(os, left, vars);
+      os << ' ';
+      show_block(os, block0.get(), vars, pfx, mode);
+      os << " DO ";
+      show_block(os, block1.get(), vars, pfx, mode);
+      os << std::endl;
+      break;
+    case _Until:
+      os << pfx << dis << "UNTIL ";
+      show_var_list(os, left, vars);
+      os << ' ';
+      show_block(os, block0.get(), vars, pfx, mode);
+      os << std::endl;
+      break;
+    case _Again:
+      os << pfx << dis << "AGAIN ";
+      show_var_list(os, left, vars);
+      os << ' ';
+      show_block(os, block0.get(), vars, pfx, mode);
+      os << std::endl;
+      break;
+    default:
+      os << pfx << dis << "<???" << cl << "> ";
+      show_var_list(os, left, vars);
+      os << " -- ";
+      show_var_list(os, right, vars);
+      os << std::endl;
+      break;
+  }
+}
+
+void Op::show_var_list(std::ostream& os, const std::vector<var_idx_t>& idx_list,
+                       const std::vector<TmpVar>& vars) const {
+  if (!idx_list.size()) {
+    os << "()";
+  } else if (idx_list.size() == 1) {
+    os << vars.at(idx_list[0]);
+  } else {
+    os << "(" << vars.at(idx_list[0]);
+    for (std::size_t i = 1; i < idx_list.size(); i++) {
+      os << "," << vars.at(idx_list[i]);
+    }
+    os << ")";
+  }
+}
+
+void Op::show_var_list(std::ostream& os, const std::vector<VarDescr>& list, const std::vector<TmpVar>& vars) const {
+  auto n = list.size();
+  if (!n) {
+    os << "()";
+  } else {
+    os << "( ";
+    for (std::size_t i = 0; i < list.size(); i++) {
+      if (i) {
+        os << ", ";
+      }
+      if (list[i].is_unused()) {
+        os << '?';
+      }
+      os << vars.at(list[i].idx) << ':';
+      list[i].show_value(os);
+    }
+    os << " )";
+  }
+}
+
+void Op::show_block(std::ostream& os, const Op* block, const std::vector<TmpVar>& vars, std::string pfx, int mode) {
+  os << "{" << std::endl;
+  std::string pfx2 = pfx + "  ";
+  for (const Op& op : block) {
+    op.show(os, vars, pfx2, mode);
+  }
+  os << pfx << "}";
+}
+
+void CodeBlob::flags_set_clear(int set, int clear) {
+  for (auto& op : ops) {
+    op.flags_set_clear(set, clear);
+  }
+}
+
+std::ostream& operator<<(std::ostream& os, const CodeBlob& code) {
+  code.print(os);
+  return os;
+}
+
+// flags: +1 = show variable definition locations; +2 = show vars after each op; +4 = show var abstract value info after each op; +8 = show all variables at start
+void CodeBlob::print(std::ostream& os, int flags) const {
+  os << "CODE BLOB: " << var_cnt << " variables, " << in_var_cnt << " input\n";
+  if ((flags & 8) != 0) {
+    for (const auto& var : vars) {
+      var.dump(os);
+      if (var.where && (flags & 1) != 0) {
+        var.where->show(os);
+        os << " defined here:\n";
+        var.where->show_context(os);
+      }
+    }
+  }
+  os << "------- BEGIN --------\n";
+  for (const auto& op : ops) {
+    op.show(os, vars, "", flags);
+  }
+  os << "-------- END ---------\n\n";
+}
+
+var_idx_t CodeBlob::create_var(int cls, TypeExpr* var_type, SymDef* sym, const SrcLocation* location) {
+  vars.emplace_back(var_cnt, cls, var_type, sym, location);
+  if (sym) {
+    sym->value->idx = var_cnt;
+  }
+  return var_cnt++;
+}
+
+bool CodeBlob::import_params(FormalArgList arg_list) {
+  if (var_cnt || in_var_cnt || op_cnt) {
+    return false;
+  }
+  std::vector<var_idx_t> list;
+  for (const auto& par : arg_list) {
+    TypeExpr* arg_type;
+    SymDef* arg_sym;
+    SrcLocation arg_loc;
+    std::tie(arg_type, arg_sym, arg_loc) = par;
+    list.push_back(create_var(arg_sym ? (TmpVar::_In | TmpVar::_Named) : TmpVar::_In, arg_type, arg_sym, &arg_loc));
+  }
+  emplace_back(loc, Op::_Import, list);
+  in_var_cnt = var_cnt;
+  return true;
+}
+
+}  // namespace funC
diff --git a/submodules/ton/tonlib-src/crypto/func/analyzer.cpp b/submodules/ton/tonlib-src/crypto/func/analyzer.cpp
new file mode 100644
index 0000000000..207aa64b4a
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/analyzer.cpp
@@ -0,0 +1,846 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "func.h"
+
+namespace funC {
+
+/*
+ *  
+ *   ANALYZE AND PREPROCESS ABSTRACT CODE
+ * 
+ */
+
+void CodeBlob::simplify_var_types() {
+  for (TmpVar& var : vars) {
+    TypeExpr::remove_indirect(var.v_type);
+  }
+}
+
+int CodeBlob::split_vars(bool strict) {
+  int n = var_cnt, changes = 0;
+  for (int j = 0; j < var_cnt; j++) {
+    TmpVar& var = vars[j];
+    if (strict && var.v_type->minw != var.v_type->maxw) {
+      throw src::ParseError{var.where.get(), "variable does not have fixed width, cannot manipulate it"};
+    }
+    std::vector<TypeExpr*> comp_types;
+    int k = var.v_type->extract_components(comp_types);
+    assert(k <= 254 && n <= 0x7fff00);
+    assert((unsigned)k == comp_types.size());
+    if (k != 1) {
+      var.coord = ~((n << 8) + k);
+      for (int i = 0; i < k; i++) {
+        auto v = create_var(vars[j].cls, comp_types[i], 0, vars[j].where.get());
+        assert(v == n + i);
+        assert(vars[v].idx == v);
+        vars[v].name = vars[j].name;
+        vars[v].coord = ((int)j << 8) + i + 1;
+      }
+      n += k;
+      ++changes;
+    } else if (strict && var.v_type->minw != 1) {
+      throw src::ParseError{var.where.get(),
+                            "cannot work with variable or variable component of width greater than one"};
+    }
+  }
+  if (!changes) {
+    return 0;
+  }
+  for (auto& op : ops) {
+    op.split_vars(vars);
+  }
+  return changes;
+}
+
+bool CodeBlob::compute_used_code_vars() {
+  VarDescrList empty_var_info;
+  return compute_used_code_vars(ops, empty_var_info, true);
+}
+
+bool CodeBlob::compute_used_code_vars(std::unique_ptr<Op>& ops_ptr, const VarDescrList& var_info, bool edit) const {
+  assert(ops_ptr);
+  if (!ops_ptr->next) {
+    assert(ops_ptr->cl == Op::_Nop);
+    return ops_ptr->set_var_info(var_info);
+  }
+  return compute_used_code_vars(ops_ptr->next, var_info, edit) | ops_ptr->compute_used_vars(*this, edit);
+}
+
+bool operator==(const VarDescrList& x, const VarDescrList& y) {
+  if (x.size() != y.size()) {
+    return false;
+  }
+  for (std::size_t i = 0; i < x.size(); i++) {
+    if (x.list[i].idx != y.list[i].idx || x.list[i].flags != y.list[i].flags) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool same_values(const VarDescr& x, const VarDescr& y) {
+  if (x.val != y.val || x.int_const.is_null() != y.int_const.is_null()) {
+    return false;
+  }
+  if (x.int_const.not_null() && cmp(x.int_const, y.int_const) != 0) {
+    return false;
+  }
+  return true;
+}
+
+bool same_values(const VarDescrList& x, const VarDescrList& y) {
+  if (x.size() != y.size()) {
+    return false;
+  }
+  for (std::size_t i = 0; i < x.size(); i++) {
+    if (x.list[i].idx != y.list[i].idx || !same_values(x.list[i], y.list[i])) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool Op::set_var_info(const VarDescrList& new_var_info) {
+  if (var_info == new_var_info) {
+    return false;
+  }
+  var_info = new_var_info;
+  return true;
+}
+
+bool Op::set_var_info(VarDescrList&& new_var_info) {
+  if (var_info == new_var_info) {
+    return false;
+  }
+  var_info = std::move(new_var_info);
+  return true;
+}
+
+bool Op::set_var_info_except(const VarDescrList& new_var_info, const std::vector<var_idx_t>& var_list) {
+  if (!var_list.size()) {
+    return set_var_info(new_var_info);
+  }
+  VarDescrList tmp_info{new_var_info};
+  tmp_info -= var_list;
+  return set_var_info(new_var_info);
+}
+
+bool Op::set_var_info_except(VarDescrList&& new_var_info, const std::vector<var_idx_t>& var_list) {
+  if (var_list.size()) {
+    new_var_info -= var_list;
+  }
+  return set_var_info(std::move(new_var_info));
+}
+std::vector<var_idx_t> sort_unique_vars(const std::vector<var_idx_t>& var_list) {
+  std::vector<var_idx_t> vars{var_list}, unique_vars;
+  std::sort(vars.begin(), vars.end());
+  vars.erase(std::unique(vars.begin(), vars.end()), vars.end());
+  return vars;
+}
+
+VarDescr* VarDescrList::operator[](var_idx_t idx) {
+  auto it = std::lower_bound(list.begin(), list.end(), idx);
+  return it != list.end() && it->idx == idx ? &*it : nullptr;
+}
+
+const VarDescr* VarDescrList::operator[](var_idx_t idx) const {
+  auto it = std::lower_bound(list.begin(), list.end(), idx);
+  return it != list.end() && it->idx == idx ? &*it : nullptr;
+}
+
+std::size_t VarDescrList::count(const std::vector<var_idx_t> idx_list) const {
+  std::size_t res = 0;
+  for (var_idx_t idx : idx_list) {
+    if (operator[](idx)) {
+      ++res;
+    }
+  }
+  return res;
+}
+
+std::size_t VarDescrList::count_used(const std::vector<var_idx_t> idx_list) const {
+  std::size_t res = 0;
+  for (var_idx_t idx : idx_list) {
+    auto v = operator[](idx);
+    if (v && !v->is_unused()) {
+      ++res;
+    }
+  }
+  return res;
+}
+
+VarDescrList& VarDescrList::operator-=(var_idx_t idx) {
+  auto it = std::lower_bound(list.begin(), list.end(), idx);
+  if (it != list.end() && it->idx == idx) {
+    list.erase(it);
+  }
+  return *this;
+}
+
+VarDescrList& VarDescrList::operator-=(const std::vector<var_idx_t>& idx_list) {
+  for (var_idx_t idx : idx_list) {
+    *this -= idx;
+  }
+  return *this;
+}
+
+VarDescrList& VarDescrList::add_var(var_idx_t idx, bool unused) {
+  auto it = std::lower_bound(list.begin(), list.end(), idx);
+  if (it == list.end() || it->idx != idx) {
+    list.emplace(it, idx, VarDescr::_Last | (unused ? VarDescr::_Unused : 0));
+  } else if (it->is_unused() && !unused) {
+    it->clear_unused();
+  }
+  return *this;
+}
+
+VarDescrList& VarDescrList::add_vars(const std::vector<var_idx_t>& idx_list, bool unused) {
+  for (var_idx_t idx : idx_list) {
+    add_var(idx, unused);
+  }
+  return *this;
+}
+
+VarDescr& VarDescrList::add(var_idx_t idx) {
+  auto it = std::lower_bound(list.begin(), list.end(), idx);
+  if (it == list.end() || it->idx != idx) {
+    it = list.emplace(it, idx);
+  }
+  return *it;
+}
+
+VarDescr& VarDescrList::add_newval(var_idx_t idx) {
+  auto it = std::lower_bound(list.begin(), list.end(), idx);
+  if (it == list.end() || it->idx != idx) {
+    return *list.emplace(it, idx);
+  } else {
+    it->clear_value();
+    return *it;
+  }
+}
+
+VarDescrList& VarDescrList::clear_last() {
+  for (auto& var : list) {
+    if (var.flags & VarDescr::_Last) {
+      var.flags &= ~VarDescr::_Last;
+    }
+  }
+  return *this;
+}
+
+VarDescrList VarDescrList::operator+(const VarDescrList& y) const {
+  VarDescrList res;
+  auto it1 = list.cbegin();
+  auto it2 = y.list.cbegin();
+  while (it1 != list.cend() && it2 != y.list.cend()) {
+    if (it1->idx < it2->idx) {
+      res.list.push_back(*it1++);
+    } else if (it1->idx > it2->idx) {
+      res.list.push_back(*it2++);
+    } else {
+      res.list.push_back(*it1++);
+      res.list.back() += *it2++;
+    }
+  }
+  while (it1 != list.cend()) {
+    res.list.push_back(*it1++);
+  }
+  while (it2 != y.list.cend()) {
+    res.list.push_back(*it2++);
+  }
+  return res;
+}
+
+VarDescrList& VarDescrList::operator+=(const VarDescrList& y) {
+  return *this = *this + y;
+}
+
+VarDescrList VarDescrList::operator|(const VarDescrList& y) const {
+  VarDescrList res;
+  auto it1 = list.cbegin();
+  auto it2 = y.list.cbegin();
+  while (it1 != list.cend() && it2 != y.list.cend()) {
+    if (it1->idx < it2->idx) {
+      it1++;
+    } else if (it1->idx > it2->idx) {
+      it2++;
+    } else {
+      res.list.push_back(*it1++);
+      res.list.back() |= *it2++;
+    }
+  }
+  return res;
+}
+
+VarDescrList& VarDescrList::operator|=(const VarDescrList& y) {
+  return *this = *this | y;
+}
+
+VarDescrList& VarDescrList::operator&=(const VarDescrList& values) {
+  for (const VarDescr& vd : values.list) {
+    VarDescr* item = operator[](vd.idx);
+    if (item) {
+      *item &= vd;
+    }
+  }
+  return *this;
+}
+
+VarDescrList& VarDescrList::import_values(const VarDescrList& values) {
+  for (const VarDescr& vd : values.list) {
+    VarDescr* item = operator[](vd.idx);
+    if (item) {
+      item->set_value(vd);
+    }
+  }
+  return *this;
+}
+
+bool Op::std_compute_used_vars(bool disabled) {
+  // left = OP right
+  // var_info := (var_info - left) + right
+  VarDescrList new_var_info{next->var_info};
+  new_var_info -= left;
+  new_var_info.clear_last();
+  if (args.size() == right.size() && !disabled) {
+    for (const VarDescr& arg : args) {
+      new_var_info.add_var(arg.idx, arg.is_unused());
+    }
+  } else {
+    new_var_info.add_vars(right, disabled);
+  }
+  return set_var_info(std::move(new_var_info));
+}
+
+bool Op::compute_used_vars(const CodeBlob& code, bool edit) {
+  assert(next);
+  const VarDescrList& next_var_info = next->var_info;
+  if (cl == _Nop) {
+    return set_var_info_except(next_var_info, left);
+  }
+  switch (cl) {
+    case _IntConst:
+    case _GlobVar:
+    case _Call:
+    case _CallInd: {
+      // left = EXEC right;
+      if (!next_var_info.count_used(left) && is_pure()) {
+        // all variables in `left` are not needed
+        if (edit) {
+          disable();
+        }
+        return std_compute_used_vars(true);
+      }
+      return std_compute_used_vars();
+    }
+    case _Let: {
+      // left = right
+      std::size_t cnt = next_var_info.count_used(left);
+      assert(left.size() == right.size());
+      auto l_it = left.cbegin(), r_it = right.cbegin();
+      VarDescrList new_var_info{next_var_info};
+      new_var_info -= left;
+      new_var_info.clear_last();
+      std::vector<var_idx_t> new_left, new_right;
+      for (; l_it < left.cend(); ++l_it, ++r_it) {
+        if (std::find(l_it + 1, left.cend(), *l_it) == left.cend()) {
+          auto p = next_var_info[*l_it];
+          new_var_info.add_var(*r_it, !p || p->is_unused());
+          new_left.push_back(*l_it);
+          new_right.push_back(*r_it);
+        }
+      }
+      if (new_left.size() < left.size()) {
+        left = std::move(new_left);
+        right = std::move(new_right);
+      }
+      if (!cnt && edit) {
+        // all variables in `left` are not needed
+        disable();
+      }
+      return set_var_info(std::move(new_var_info));
+    }
+    case _Return: {
+      // return left
+      if (var_info.count(left) == left.size()) {
+        return false;
+      }
+      std::vector<var_idx_t> unique_vars = sort_unique_vars(left);
+      var_info.list.clear();
+      for (var_idx_t i : unique_vars) {
+        var_info.list.emplace_back(i, VarDescr::_Last);
+      }
+      return true;
+    }
+    case _Import: {
+      // import left
+      std::vector<var_idx_t> unique_vars = sort_unique_vars(left);
+      var_info.list.clear();
+      for (var_idx_t i : unique_vars) {
+        var_info.list.emplace_back(i, next_var_info[i] ? 0 : VarDescr::_Last);
+      }
+      return true;
+    }
+    case _If: {
+      // if (left) then block0 else block1
+      //  VarDescrList nx_var_info = next_var_info;
+      //  nx_var_info.clear_last();
+      code.compute_used_code_vars(block0, next_var_info, edit);
+      VarDescrList merge_info;
+      if (block1) {
+        code.compute_used_code_vars(block1, next_var_info, edit);
+        merge_info = block0->var_info + block1->var_info;
+      } else {
+        merge_info = block0->var_info + next_var_info;
+      }
+      merge_info.clear_last();
+      merge_info += left;
+      return set_var_info(std::move(merge_info));
+    }
+    case _While: {
+      // while (block0 || left) block1;
+      // ... { block0 left block1 } block0 left next
+      VarDescrList after_cond_first{next_var_info};
+      after_cond_first += left;
+      code.compute_used_code_vars(block0, after_cond_first, false);
+      VarDescrList new_var_info{block0->var_info};
+      bool changes = false;
+      do {
+        code.compute_used_code_vars(block1, block0->var_info, changes);
+        VarDescrList after_cond{block1->var_info};
+        after_cond += left;
+        code.compute_used_code_vars(block0, after_cond, changes);
+        std::size_t n = new_var_info.size();
+        new_var_info += block0->var_info;
+        new_var_info.clear_last();
+        if (changes) {
+          break;
+        }
+        changes = (new_var_info.size() == n);
+      } while (changes <= edit);
+      return set_var_info(std::move(new_var_info));
+    }
+    case _Until: {
+      // until (block0 || left);
+      // .. { block0 left } block0 left next
+      VarDescrList after_cond_first{next_var_info};
+      after_cond_first += left;
+      code.compute_used_code_vars(block0, after_cond_first, false);
+      VarDescrList new_var_info{block0->var_info};
+      bool changes = false;
+      do {
+        VarDescrList after_cond{new_var_info};
+        after_cond += next_var_info;
+        after_cond += left;
+        code.compute_used_code_vars(block0, after_cond, changes);
+        std::size_t n = new_var_info.size();
+        new_var_info += block0->var_info;
+        new_var_info.clear_last();
+        if (changes) {
+          break;
+        }
+        changes = (new_var_info.size() == n);
+      } while (changes <= edit);
+      return set_var_info(std::move(new_var_info) + next_var_info);
+    }
+    case _Repeat: {
+      // repeat (left) block0
+      // left { block0 } next
+      VarDescrList new_var_info{next_var_info};
+      bool changes = false;
+      do {
+        code.compute_used_code_vars(block0, new_var_info, changes);
+        std::size_t n = new_var_info.size();
+        new_var_info += block0->var_info;
+        new_var_info.clear_last();
+        if (changes) {
+          break;
+        }
+        changes = (new_var_info.size() == n);
+      } while (changes <= edit);
+      new_var_info += left;
+      return set_var_info(std::move(new_var_info));
+    }
+    case _Again: {
+      // for(;;) block0
+      // { block0 }
+      VarDescrList new_var_info;
+      bool changes = false;
+      do {
+        code.compute_used_code_vars(block0, new_var_info, changes);
+        std::size_t n = new_var_info.size();
+        new_var_info += block0->var_info;
+        new_var_info.clear_last();
+        if (changes) {
+          break;
+        }
+        changes = (new_var_info.size() == n);
+      } while (changes <= edit);
+      return set_var_info(std::move(new_var_info));
+    }
+    default:
+      std::cerr << "fatal: unknown operation <??" << cl << "> in compute_used_vars()\n";
+      throw src::ParseError{where, "unknown operation"};
+  }
+}
+
+bool prune_unreachable(std::unique_ptr<Op>& ops) {
+  if (!ops) {
+    return true;
+  }
+  Op& op = *ops;
+  if (op.cl == Op::_Nop) {
+    if (op.next) {
+      ops = std::move(op.next);
+      return prune_unreachable(ops);
+    }
+    return true;
+  }
+  bool reach;
+  switch (op.cl) {
+    case Op::_IntConst:
+    case Op::_GlobVar:
+    case Op::_Call:
+    case Op::_CallInd:
+    case Op::_Import:
+      reach = true;
+      break;
+    case Op::_Let: {
+      reach = true;
+      break;
+    }
+    case Op::_Return:
+      reach = false;
+      break;
+    case Op::_If: {
+      // if left then block0 else block1; ...
+      VarDescr* c_var = op.var_info[op.left[0]];
+      if (c_var && c_var->always_true()) {
+        op.block0->last().next = std::move(op.next);
+        ops = std::move(op.block0);
+        return prune_unreachable(ops);
+      } else if (c_var && c_var->always_false()) {
+        op.block1->last().next = std::move(op.next);
+        ops = std::move(op.block1);
+        return prune_unreachable(ops);
+      } else {
+        reach = prune_unreachable(op.block0) | prune_unreachable(op.block1);
+      }
+      break;
+    }
+    case Op::_While: {
+      // while (block0 || left) block1;
+      if (!prune_unreachable(op.block0)) {
+        // computation of block0 never returns
+        ops = std::move(op.block0);
+        return prune_unreachable(ops);
+      }
+      VarDescr* c_var = op.block0->last().var_info[op.left[0]];
+      if (c_var && c_var->always_false()) {
+        // block1 never executed
+        op.block0->last().next = std::move(op.next);
+        ops = std::move(op.block0);
+        return false;
+      } else if (c_var && c_var->always_true()) {
+        if (!prune_unreachable(op.block1)) {
+          // block1 never returns
+          op.block0->last().next = std::move(op.block1);
+          ops = std::move(op.block0);
+          return false;
+        }
+        // infinite loop
+        op.cl = Op::_Again;
+        op.block0->last().next = std::move(op.block1);
+        op.left.clear();
+        reach = false;
+      } else {
+        if (!prune_unreachable(op.block1)) {
+          // block1 never returns, while equivalent to block0 ; if left then block1 else next
+          op.cl = Op::_If;
+          std::unique_ptr<Op> new_op = std::move(op.block0);
+          op.block0 = std::move(op.block1);
+          op.block1 = std::make_unique<Op>(op.next->where, Op::_Nop);
+          new_op->last().next = std::move(ops);
+          ops = std::move(new_op);
+        }
+        reach = true;  // block1 may be never executed
+      }
+      break;
+    }
+    case Op::_Repeat: {
+      // repeat (left) block0
+      VarDescr* c_var = op.var_info[op.left[0]];
+      if (c_var && c_var->always_nonpos()) {
+        // loop never executed
+        ops = std::move(op.next);
+        return prune_unreachable(ops);
+      }
+      if (c_var && c_var->always_pos()) {
+        if (!prune_unreachable(op.block0)) {
+          // block0 executed at least once, and it never returns
+          // replace code with block0
+          ops = std::move(op.block0);
+          return false;
+        }
+      } else {
+        prune_unreachable(op.block0);
+      }
+      reach = true;
+      break;
+    }
+    case Op::_Until:
+    case Op::_Again: {
+      // do block0 until left; ...
+      if (!prune_unreachable(op.block0)) {
+        // block0 never returns, replace loop by block0
+        ops = std::move(op.block0);
+        return false;
+      }
+      reach = true;
+      break;
+    }
+    default:
+      std::cerr << "fatal: unknown operation <??" << op.cl << ">\n";
+      throw src::ParseError{op.where, "unknown operation in prune_unreachable()"};
+  }
+  if (reach) {
+    return prune_unreachable(op.next);
+  } else {
+    while (op.next->next) {
+      op.next = std::move(op.next->next);
+    }
+    return false;
+  }
+}
+
+void CodeBlob::prune_unreachable_code() {
+  if (prune_unreachable(ops)) {
+    throw src::ParseError{loc, "control reaches end of function"};
+  }
+}
+
+void CodeBlob::fwd_analyze() {
+  VarDescrList values;
+  assert(ops && ops->cl == Op::_Import);
+  for (var_idx_t i : ops->left) {
+    values += i;
+    if (vars[i].v_type->is_int()) {
+      values[i]->val |= VarDescr::_Int;
+    }
+  }
+  ops->fwd_analyze(values);
+}
+
+void Op::prepare_args(VarDescrList values) {
+  if (args.size() != right.size()) {
+    args.clear();
+    for (var_idx_t i : right) {
+      args.emplace_back(i);
+    }
+  }
+  for (std::size_t i = 0; i < right.size(); i++) {
+    const VarDescr* val = values[right[i]];
+    if (val) {
+      args[i].set_value(*val);
+      args[i].clear_unused();
+    }
+  }
+}
+
+VarDescrList Op::fwd_analyze(VarDescrList values) {
+  var_info.import_values(values);
+  switch (cl) {
+    case _Nop:
+    case _Import:
+      break;
+    case _Return:
+      values.list.clear();
+      break;
+    case _IntConst: {
+      values.add_newval(left[0]).set_const(int_const);
+      break;
+    }
+    case _GlobVar:
+    case _Call: {
+      prepare_args(values);
+      auto func = dynamic_cast<const SymValAsmFunc*>(fun_ref->value);
+      if (func) {
+        std::vector<VarDescr> res;
+        res.reserve(left.size());
+        for (var_idx_t i : left) {
+          res.emplace_back(i);
+        }
+        AsmOpList tmp;
+        func->compile(tmp, res, args);  // abstract interpretation of res := f (args)
+        int j = 0;
+        for (var_idx_t i : left) {
+          values.add_newval(i).set_value(res[j++]);
+        }
+      } else {
+        for (var_idx_t i : left) {
+          values.add_newval(i);
+        }
+      }
+      break;
+    }
+    case _CallInd: {
+      for (var_idx_t i : left) {
+        values.add_newval(i);
+      }
+      break;
+    }
+    case _Let: {
+      std::vector<VarDescr> old_val;
+      assert(left.size() == right.size());
+      for (std::size_t i = 0; i < right.size(); i++) {
+        const VarDescr* ov = values[right[i]];
+        if (!ov && verbosity >= 5) {
+          std::cerr << "FATAL: error in assignment at right component #" << i << " (no value for _" << right[i] << ")"
+                    << std::endl;
+          for (auto x : left) {
+            std::cerr << '_' << x << " ";
+          }
+          std::cerr << "= ";
+          for (auto x : right) {
+            std::cerr << '_' << x << " ";
+          }
+          std::cerr << std::endl;
+        }
+        // assert(ov);
+        if (ov) {
+          old_val.push_back(*ov);
+        } else {
+          old_val.emplace_back();
+        }
+      }
+      for (std::size_t i = 0; i < left.size(); i++) {
+        values.add_newval(left[i]).set_value(std::move(old_val[i]));
+      }
+      break;
+    }
+    case _If: {
+      VarDescrList val1 = block0->fwd_analyze(values);
+      VarDescrList val2 = block1 ? block1->fwd_analyze(std::move(values)) : std::move(values);
+      values = val1 | val2;
+      break;
+    }
+    case _Repeat: {
+      bool atl1 = (values[left[0]] && values[left[0]]->always_pos());
+      VarDescrList next_values = block0->fwd_analyze(values);
+      while (true) {
+        VarDescrList new_values = values | next_values;
+        if (same_values(new_values, values)) {
+          break;
+        }
+        values = std::move(new_values);
+        next_values = block0->fwd_analyze(values);
+      }
+      if (atl1) {
+        values = std::move(next_values);
+      }
+      break;
+    }
+    case _While: {
+      values = block0->fwd_analyze(values);
+      if (values[left[0]] && values[left[0]]->always_false()) {
+        // block1 never executed
+        block1->fwd_analyze(values);
+        break;
+      }
+      while (true) {
+        VarDescrList next_values = values | block0->fwd_analyze(block1->fwd_analyze(values));
+        if (same_values(next_values, values)) {
+          break;
+        }
+        values = std::move(next_values);
+      }
+      break;
+    }
+    case _Until:
+    case _Again: {
+      while (true) {
+        VarDescrList next_values = values | block0->fwd_analyze(values);
+        if (same_values(next_values, values)) {
+          break;
+        }
+        values = std::move(next_values);
+      }
+      values = block0->fwd_analyze(values);
+      break;
+    }
+    default:
+      std::cerr << "fatal: unknown operation <??" << cl << ">\n";
+      throw src::ParseError{where, "unknown operation in fwd_analyze()"};
+  }
+  if (next) {
+    return next->fwd_analyze(std::move(values));
+  } else {
+    return values;
+  }
+}
+
+bool Op::set_noreturn(bool nr) {
+  if (nr) {
+    flags |= _NoReturn;
+  } else {
+    flags &= ~_NoReturn;
+  }
+  return nr;
+}
+
+bool Op::mark_noreturn() {
+  switch (cl) {
+    case _Nop:
+      if (!next) {
+        return set_noreturn(false);
+      }
+      // fallthrough
+    case _Import:
+    case _IntConst:
+    case _Let:
+    case _GlobVar:
+    case _CallInd:
+    case _Call:
+      return set_noreturn(next->mark_noreturn());
+    case _Return:
+      return set_noreturn(true);
+    case _If:
+      return set_noreturn((block0->mark_noreturn() & (block1 && block1->mark_noreturn())) | next->mark_noreturn());
+    case _Again:
+      block0->mark_noreturn();
+      return set_noreturn(false);
+    case _Until:
+      return set_noreturn(block0->mark_noreturn() | next->mark_noreturn());
+    case _While:
+      block1->mark_noreturn();
+      return set_noreturn(block0->mark_noreturn() | next->mark_noreturn());
+    case _Repeat:
+      block0->mark_noreturn();
+      return set_noreturn(next->mark_noreturn());
+    default:
+      std::cerr << "fatal: unknown operation <??" << cl << ">\n";
+      throw src::ParseError{where, "unknown operation in mark_noreturn()"};
+  }
+}
+
+void CodeBlob::mark_noreturn() {
+  ops->mark_noreturn();
+}
+
+}  // namespace funC
diff --git a/submodules/ton/tonlib-src/crypto/func/asmops.cpp b/submodules/ton/tonlib-src/crypto/func/asmops.cpp
new file mode 100644
index 0000000000..6afdac8452
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/asmops.cpp
@@ -0,0 +1,329 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "parser/srcread.h"
+#include "func.h"
+#include <iostream>
+
+namespace funC {
+
+/*
+ * 
+ *   ASM-OP LIST FUNCTIONS
+ * 
+ */
+
+int is_pos_pow2(td::RefInt256 x) {
+  if (sgn(x) > 0 && !sgn(x & (x - 1))) {
+    return x->bit_size(false) - 1;
+  } else {
+    return -1;
+  }
+}
+
+int is_neg_pow2(td::RefInt256 x) {
+  return sgn(x) < 0 ? is_pos_pow2(-x) : 0;
+}
+
+std::ostream& operator<<(std::ostream& os, AsmOp::SReg stack_reg) {
+  int i = stack_reg.idx;
+  if (i >= 0) {
+    if (i < 16) {
+      return os << 's' << i;
+    } else {
+      return os << i << " s()";
+    }
+  } else if (i >= -2) {
+    return os << "s(" << i << ')';
+  } else {
+    return os << i << " s()";
+  }
+}
+
+AsmOp AsmOp::Const(int arg, std::string push_op) {
+  std::ostringstream os;
+  os << arg << ' ' << push_op;
+  return AsmOp::Const(os.str());
+}
+
+AsmOp AsmOp::make_stk2(int a, int b, const char* str, int delta) {
+  std::ostringstream os;
+  os << SReg(a) << ' ' << SReg(b) << ' ' << str;
+  int c = std::max(a, b) + 1;
+  return AsmOp::Custom(os.str(), c, c + delta);
+}
+
+AsmOp AsmOp::make_stk3(int a, int b, int c, const char* str, int delta) {
+  std::ostringstream os;
+  os << SReg(a) << ' ' << SReg(b) << ' ' << SReg(c) << ' ' << str;
+  int m = std::max(a, std::max(b, c)) + 1;
+  return AsmOp::Custom(os.str(), m, m + delta);
+}
+
+AsmOp AsmOp::BlkSwap(int a, int b) {
+  std::ostringstream os;
+  if (a == 1 && b == 1) {
+    return AsmOp::Xchg(0, 1);
+  } else if (a == 1) {
+    if (b == 2) {
+      os << "ROT";
+    } else {
+      os << b << " ROLL";
+    }
+  } else if (b == 1) {
+    if (a == 2) {
+      os << "-ROT";
+    } else {
+      os << a << " -ROLL";
+    }
+  } else {
+    os << a << " " << b << " BLKSWAP";
+  }
+  return AsmOp::Custom(os.str(), a + b, a + b);
+}
+
+AsmOp AsmOp::BlkPush(int a, int b) {
+  std::ostringstream os;
+  if (a == 1) {
+    return AsmOp::Push(b);
+  } else if (a == 2 && b == 1) {
+    os << "2DUP";
+  } else {
+    os << a << " " << b << " BLKPUSH";
+  }
+  return AsmOp::Custom(os.str(), b + 1, a + b + 1);
+}
+
+AsmOp AsmOp::BlkDrop(int a) {
+  std::ostringstream os;
+  if (a == 1) {
+    return AsmOp::Pop();
+  } else if (a == 2) {
+    os << "2DROP";
+  } else {
+    os << a << " BLKDROP";
+  }
+  return AsmOp::Custom(os.str(), a, 0);
+}
+
+AsmOp AsmOp::BlkReverse(int a, int b) {
+  std::ostringstream os;
+  os << a << " " << b << " REVERSE";
+  return AsmOp::Custom(os.str(), a + b, a + b);
+}
+
+AsmOp AsmOp::IntConst(td::RefInt256 x) {
+  if (x->signed_fits_bits(8)) {
+    return AsmOp::Const(dec_string(std::move(x)) + " PUSHINT");
+  }
+  if (!x->is_valid()) {
+    return AsmOp::Const("PUSHNAN");
+  }
+  int k = is_pos_pow2(x);
+  if (k >= 0) {
+    return AsmOp::Const(k, "PUSHPOW2");
+  }
+  k = is_pos_pow2(x + 1);
+  if (k >= 0) {
+    return AsmOp::Const(k, "PUSHPOW2DEC");
+  }
+  k = is_pos_pow2(-x);
+  if (k >= 0) {
+    return AsmOp::Const(k, "PUSHNEGPOW2");
+  }
+  return AsmOp::Const(dec_string(std::move(x)) + " PUSHINT");
+}
+
+AsmOp AsmOp::Parse(std::string custom_op) {
+  if (custom_op == "NOP") {
+    return AsmOp::Nop();
+  } else if (custom_op == "SWAP") {
+    return AsmOp::Xchg(1);
+  } else if (custom_op == "DROP") {
+    return AsmOp::Pop(0);
+  } else if (custom_op == "NIP") {
+    return AsmOp::Pop(1);
+  } else if (custom_op == "DUP") {
+    return AsmOp::Push(0);
+  } else if (custom_op == "OVER") {
+    return AsmOp::Push(1);
+  } else {
+    return AsmOp::Custom(custom_op);
+  }
+}
+
+AsmOp AsmOp::Parse(std::string custom_op, int args, int retv) {
+  auto res = Parse(custom_op);
+  if (res.is_custom()) {
+    res.a = args;
+    res.b = retv;
+  }
+  return res;
+}
+
+void AsmOp::out(std::ostream& os) const {
+  if (!op.empty()) {
+    os << op;
+    return;
+  }
+  switch (t) {
+    case a_none:
+      break;
+    case a_xchg:
+      if (!a && !(b & -2)) {
+        os << (b ? "SWAP" : "NOP");
+        break;
+      }
+      os << "s" << a << " s" << b << " XCHG";
+      break;
+    case a_push:
+      if (!(a & -2)) {
+        os << (a ? "OVER" : "DUP");
+        break;
+      }
+      os << "s" << a << " PUSH";
+      break;
+    case a_pop:
+      if (!(a & -2)) {
+        os << (a ? "NIP" : "DROP");
+        break;
+      }
+      os << "s" << a << " POP";
+      break;
+    default:
+      throw src::Fatal{"unknown assembler operation"};
+  }
+}
+
+void AsmOp::out_indent_nl(std::ostream& os, bool no_eol) const {
+  for (int i = 0; i < indent; i++) {
+    os << "  ";
+  }
+  out(os);
+  if (!no_eol) {
+    os << std::endl;
+  }
+}
+
+std::string AsmOp::to_string() const {
+  if (!op.empty()) {
+    return op;
+  } else {
+    std::ostringstream os;
+    out(os);
+    return os.str();
+  }
+}
+
+bool AsmOpList::append(const std::vector<AsmOp>& ops) {
+  for (const auto& op : ops) {
+    if (!append(op)) {
+      return false;
+    }
+  }
+  return true;
+}
+
+const_idx_t AsmOpList::register_const(Const new_const) {
+  if (new_const.is_null()) {
+    return not_const;
+  }
+  unsigned idx;
+  for (idx = 0; idx < constants_.size(); idx++) {
+    if (!td::cmp(new_const, constants_[idx])) {
+      return idx;
+    }
+  }
+  constants_.push_back(std::move(new_const));
+  return (const_idx_t)idx;
+}
+
+Const AsmOpList::get_const(const_idx_t idx) {
+  if ((unsigned)idx < constants_.size()) {
+    return constants_[idx];
+  } else {
+    return {};
+  }
+}
+
+void AsmOpList::show_var(std::ostream& os, var_idx_t idx) const {
+  if (!var_names_ || (unsigned)idx >= var_names_->size()) {
+    os << '_' << idx;
+  } else {
+    var_names_->at(idx).show(os, 2);
+  }
+}
+
+void AsmOpList::show_var_ext(std::ostream& os, std::pair<var_idx_t, const_idx_t> idx_pair) const {
+  auto i = idx_pair.first;
+  auto j = idx_pair.second;
+  if (!var_names_ || (unsigned)i >= var_names_->size()) {
+    os << '_' << i;
+  } else {
+    var_names_->at(i).show(os, 2);
+  }
+  if ((unsigned)j < constants_.size() && constants_[j].not_null()) {
+    os << '=' << constants_[j];
+  }
+}
+
+void AsmOpList::out(std::ostream& os, int mode) const {
+  if (!(mode & 2)) {
+    for (const auto& op : list_) {
+      op.out_indent_nl(os);
+    }
+  } else {
+    std::size_t n = list_.size();
+    for (std::size_t i = 0; i < n; i++) {
+      const auto& op = list_[i];
+      if (!op.is_comment() && i + 1 < n && list_[i + 1].is_comment()) {
+        op.out_indent_nl(os, true);
+        os << '\t';
+        do {
+          i++;
+        } while (i + 1 < n && list_[i + 1].is_comment());
+        list_[i].out(os);
+        os << std::endl;
+      } else {
+        op.out_indent_nl(os, false);
+      }
+    }
+  }
+}
+
+bool apply_op(StackTransform& trans, const AsmOp& op) {
+  if (!trans.is_valid()) {
+    return false;
+  }
+  switch (op.t) {
+    case AsmOp::a_none:
+      return true;
+    case AsmOp::a_xchg:
+      return trans.apply_xchg(op.a, op.b, true);
+    case AsmOp::a_push:
+      return trans.apply_push(op.a);
+    case AsmOp::a_pop:
+      return trans.apply_pop(op.a);
+    case AsmOp::a_const:
+      return !op.a && op.b == 1 && trans.apply_push_newconst();
+    default:
+      return false;
+  }
+}
+
+}  // namespace funC
diff --git a/submodules/ton/tonlib-src/crypto/func/builtins.cpp b/submodules/ton/tonlib-src/crypto/func/builtins.cpp
new file mode 100644
index 0000000000..2393e9c694
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/builtins.cpp
@@ -0,0 +1,974 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "func.h"
+
+namespace funC {
+using namespace std::literals::string_literals;
+
+/*
+ *
+ *   SYMBOL VALUES
+ * 
+ */
+
+int glob_func_cnt, undef_func_cnt;
+std::vector<SymDef*> glob_func;
+
+SymDef* predefine_builtin_func(std::string name, TypeExpr* func_type) {
+  sym_idx_t name_idx = sym::symbols.lookup(name, 1);
+  if (sym::symbols.is_keyword(name_idx)) {
+    std::cerr << "fatal: global function `" << name << "` already defined as a keyword" << std::endl;
+  }
+  SymDef* def = sym::define_global_symbol(name_idx, true);
+  if (!def) {
+    std::cerr << "fatal: global function `" << name << "` already defined" << std::endl;
+    std::exit(1);
+  }
+  return def;
+}
+
+template <typename T>
+void define_builtin_func(std::string name, TypeExpr* func_type, const T& func, bool impure = false) {
+  SymDef* def = predefine_builtin_func(name, func_type);
+  def->value = new SymValAsmFunc{func_type, func, impure};
+}
+
+template <typename T>
+void define_builtin_func_x(std::string name, TypeExpr* func_type, const T& func, std::initializer_list<int> arg_order,
+                           std::initializer_list<int> ret_order = {}, bool impure = false) {
+  SymDef* def = predefine_builtin_func(name, func_type);
+  def->value = new SymValAsmFunc{func_type, func, arg_order, ret_order, impure};
+}
+
+void define_builtin_func_x(std::string name, TypeExpr* func_type, const AsmOp& macro,
+                           std::initializer_list<int> arg_order, std::initializer_list<int> ret_order = {},
+                           bool impure = false) {
+  SymDef* def = predefine_builtin_func(name, func_type);
+  def->value = new SymValAsmFunc{func_type, make_simple_compile(macro), arg_order, ret_order, impure};
+}
+
+bool SymValAsmFunc::compile(AsmOpList& dest, std::vector<VarDescr>& in, std::vector<VarDescr>& out) const {
+  if (simple_compile) {
+    return dest.append(simple_compile(in, out));
+  } else if (ext_compile) {
+    return ext_compile(dest, in, out);
+  } else {
+    return false;
+  }
+}
+
+/*
+ * 
+ *   DEFINE BUILT-IN FUNCTIONS
+ * 
+ */
+
+int emulate_negate(int a) {
+  int f = VarDescr::_Pos | VarDescr::_Neg;
+  if ((a & f) && (~a & f)) {
+    a ^= f;
+  }
+  f = VarDescr::_Bit | VarDescr::_Bool;
+  if ((a & f) && (~a & f)) {
+    a ^= f;
+  }
+  return a;
+}
+
+int emulate_add(int a, int b) {
+  if (b & VarDescr::_Zero) {
+    return a;
+  } else if (a & VarDescr::_Zero) {
+    return b;
+  }
+  int u = a & b, v = a | b;
+  int r = VarDescr::_Int;
+  int t = u & (VarDescr::_Pos | VarDescr::_Neg);
+  if (v & VarDescr::_Nan) {
+    return r | VarDescr::_Nan;
+  }
+  // non-quiet addition always returns finite results!
+  r |= t | VarDescr::_Finite;
+  if (t) {
+    r |= v & VarDescr::_NonZero;
+  }
+  r |= v & VarDescr::_Nan;
+  if (u & (VarDescr::_Odd | VarDescr::_Even)) {
+    r |= VarDescr::_Even;
+  } else if (!(~v & (VarDescr::_Odd | VarDescr::_Even))) {
+    r |= VarDescr::_Odd | VarDescr::_NonZero;
+  }
+  return r;
+}
+
+int emulate_sub(int a, int b) {
+  return emulate_add(a, emulate_negate(b));
+}
+
+int emulate_mul(int a, int b) {
+  if ((b & (VarDescr::_NonZero | VarDescr::_Bit)) == (VarDescr::_NonZero | VarDescr::_Bit)) {
+    return a;
+  } else if ((a & (VarDescr::_NonZero | VarDescr::_Bit)) == (VarDescr::_NonZero | VarDescr::_Bit)) {
+    return b;
+  }
+  int u = a & b, v = a | b;
+  int r = VarDescr::_Int;
+  if (v & VarDescr::_Nan) {
+    return r | VarDescr::_Nan;
+  }
+  // non-quiet multiplication always yields finite results, if any
+  r |= VarDescr::_Finite;
+  if (v & VarDescr::_Zero) {
+    // non-quiet multiplication
+    // the result is zero, if any result at all
+    return VarDescr::ConstZero;
+  }
+  if (u & (VarDescr::_Pos | VarDescr::_Neg)) {
+    r |= VarDescr::_Pos;
+  } else if (!(~v & (VarDescr::_Pos | VarDescr::_Neg))) {
+    r |= VarDescr::_Neg;
+  }
+  if (u & (VarDescr::_Bit | VarDescr::_Bool)) {
+    r |= VarDescr::_Bit;
+  } else if (!(~v & (VarDescr::_Bit | VarDescr::_Bool))) {
+    r |= VarDescr::_Bool;
+  }
+  r |= v & VarDescr::_Even;
+  r |= u & (VarDescr::_Odd | VarDescr::_NonZero);
+  return r;
+}
+
+int emulate_lshift(int a, int b) {
+  if (((a | b) & VarDescr::_Nan) || !(~b & (VarDescr::_Neg | VarDescr::_NonZero))) {
+    return VarDescr::_Int | VarDescr::_Nan;
+  }
+  if (b & VarDescr::_Zero) {
+    return a;
+  }
+  int t = ((b & VarDescr::_NonZero) ? VarDescr::_Even : 0);
+  t |= b & VarDescr::_Finite;
+  return emulate_mul(a, VarDescr::_Int | VarDescr::_Pos | VarDescr::_NonZero | VarDescr::_Even | t);
+}
+
+int emulate_div(int a, int b) {
+  if ((b & (VarDescr::_NonZero | VarDescr::_Bit)) == (VarDescr::_NonZero | VarDescr::_Bit)) {
+    return a;
+  } else if ((b & (VarDescr::_NonZero | VarDescr::_Bool)) == (VarDescr::_NonZero | VarDescr::_Bool)) {
+    return emulate_negate(b);
+  }
+  if (b & VarDescr::_Zero) {
+    return VarDescr::_Int | VarDescr::_Nan;
+  }
+  int u = a & b, v = a | b;
+  int r = VarDescr::_Int;
+  if (v & VarDescr::_Nan) {
+    return r | VarDescr::_Nan;
+  }
+  // non-quiet division always yields finite results, if any
+  r |= VarDescr::_Finite;
+  if (a & VarDescr::_Zero) {
+    // non-quiet division
+    // the result is zero, if any result at all
+    return VarDescr::ConstZero;
+  }
+  if (u & (VarDescr::_Pos | VarDescr::_Neg)) {
+    r |= VarDescr::_Pos;
+  } else if (!(~v & (VarDescr::_Pos | VarDescr::_Neg))) {
+    r |= VarDescr::_Neg;
+  }
+  if (u & (VarDescr::_Bit | VarDescr::_Bool)) {
+    r |= VarDescr::_Bit;
+  } else if (!(~v & (VarDescr::_Bit | VarDescr::_Bool))) {
+    r |= VarDescr::_Bool;
+  }
+  return r;
+}
+
+int emulate_rshift(int a, int b) {
+  if (((a | b) & VarDescr::_Nan) || !(~b & (VarDescr::_Neg | VarDescr::_NonZero))) {
+    return VarDescr::_Int | VarDescr::_Nan;
+  }
+  if (b & VarDescr::_Zero) {
+    return a;
+  }
+  int t = ((b & VarDescr::_NonZero) ? VarDescr::_Even : 0);
+  t |= b & VarDescr::_Finite;
+  return emulate_div(a, VarDescr::_Int | VarDescr::_Pos | VarDescr::_NonZero | VarDescr::_Even | t);
+}
+
+int emulate_mod(int a, int b, int round_mode = -1) {
+  if ((b & (VarDescr::_NonZero | VarDescr::_Bit)) == (VarDescr::_NonZero | VarDescr::_Bit)) {
+    return VarDescr::ConstZero;
+  } else if ((b & (VarDescr::_NonZero | VarDescr::_Bool)) == (VarDescr::_NonZero | VarDescr::_Bool)) {
+    return VarDescr::ConstZero;
+  }
+  if (b & VarDescr::_Zero) {
+    return VarDescr::_Int | VarDescr::_Nan;
+  }
+  int r = VarDescr::_Int;
+  if ((a | b) & VarDescr::_Nan) {
+    return r | VarDescr::_Nan;
+  }
+  // non-quiet division always yields finite results, if any
+  r |= VarDescr::_Finite;
+  if (a & VarDescr::_Zero) {
+    // non-quiet division
+    // the result is zero, if any result at all
+    return VarDescr::ConstZero;
+  }
+  if (round_mode < 0) {
+    r |= b & (VarDescr::_Pos | VarDescr::_Neg);
+  } else if (round_mode > 0) {
+    r |= emulate_negate(b) & (VarDescr::_Pos | VarDescr::_Neg);
+  }
+  if (a & (VarDescr::_Bit | VarDescr::_Bool)) {
+    if (r & VarDescr::_Pos) {
+      r |= VarDescr::_Bit;
+    }
+    if (r & VarDescr::_Neg) {
+      r |= VarDescr::_Bool;
+    }
+  }
+  if (b & VarDescr::_Even) {
+    r |= a & (VarDescr::_Even | VarDescr::_Odd);
+  }
+  return r;
+}
+
+bool VarDescr::always_less(const VarDescr& other) const {
+  if (is_int_const() && other.is_int_const()) {
+    return int_const < other.int_const;
+  }
+  return (always_nonpos() && other.always_pos()) || (always_neg() && other.always_nonneg());
+}
+
+bool VarDescr::always_leq(const VarDescr& other) const {
+  if (is_int_const() && other.is_int_const()) {
+    return int_const <= other.int_const;
+  }
+  return always_nonpos() && other.always_nonneg();
+}
+
+bool VarDescr::always_greater(const VarDescr& other) const {
+  return other.always_less(*this);
+}
+
+bool VarDescr::always_geq(const VarDescr& other) const {
+  return other.always_leq(*this);
+}
+
+bool VarDescr::always_equal(const VarDescr& other) const {
+  return is_int_const() && other.is_int_const() && *int_const == *other.int_const;
+}
+
+bool VarDescr::always_neq(const VarDescr& other) const {
+  if (is_int_const() && other.is_int_const()) {
+    return *int_const != *other.int_const;
+  }
+  return always_greater(other) || always_less(other) || (always_even() && other.always_odd()) ||
+         (always_odd() && other.always_even());
+}
+
+AsmOp exec_op(std::string op) {
+  return AsmOp::Custom(op);
+}
+
+AsmOp exec_op(std::string op, int args, int retv = 1) {
+  return AsmOp::Custom(op, args, retv);
+}
+
+AsmOp exec_arg_op(std::string op, long long arg) {
+  std::ostringstream os;
+  os << arg << ' ' << op;
+  return AsmOp::Custom(os.str());
+}
+
+AsmOp exec_arg_op(std::string op, long long arg, int args, int retv) {
+  std::ostringstream os;
+  os << arg << ' ' << op;
+  return AsmOp::Custom(os.str(), args, retv);
+}
+
+AsmOp exec_arg_op(std::string op, td::RefInt256 arg) {
+  std::ostringstream os;
+  os << arg << ' ' << op;
+  return AsmOp::Custom(os.str());
+}
+
+AsmOp exec_arg_op(std::string op, td::RefInt256 arg, int args, int retv) {
+  std::ostringstream os;
+  os << arg << ' ' << op;
+  return AsmOp::Custom(os.str(), args, retv);
+}
+
+AsmOp push_const(td::RefInt256 x) {
+  return AsmOp::IntConst(std::move(x));
+}
+
+AsmOp compile_add(std::vector<VarDescr>& res, std::vector<VarDescr>& args) {
+  assert(res.size() == 1 && args.size() == 2);
+  VarDescr &r = res[0], &x = args[0], &y = args[1];
+  if (x.is_int_const() && y.is_int_const()) {
+    r.set_const(x.int_const + y.int_const);
+    x.unused();
+    y.unused();
+    return push_const(r.int_const);
+  }
+  r.val = emulate_add(x.val, y.val);
+  if (y.is_int_const() && y.int_const->signed_fits_bits(8)) {
+    y.unused();
+    if (y.always_zero()) {
+      return AsmOp::Nop();
+    }
+    if (*y.int_const == 1) {
+      return exec_op("INC", 1);
+    }
+    if (*y.int_const == -1) {
+      return exec_op("DEC", 1);
+    }
+    return exec_arg_op("ADDCONST", y.int_const, 1);
+  }
+  if (x.is_int_const() && x.int_const->signed_fits_bits(8)) {
+    x.unused();
+    if (x.always_zero()) {
+      return AsmOp::Nop();
+    }
+    if (*x.int_const == 1) {
+      return exec_op("INC", 1);
+    }
+    if (*x.int_const == -1) {
+      return exec_op("DEC", 1);
+    }
+    return exec_arg_op("ADDCONST", x.int_const, 1);
+  }
+  return exec_op("ADD", 2);
+}
+
+AsmOp compile_sub(std::vector<VarDescr>& res, std::vector<VarDescr>& args) {
+  assert(res.size() == 1 && args.size() == 2);
+  VarDescr &r = res[0], &x = args[0], &y = args[1];
+  if (x.is_int_const() && y.is_int_const()) {
+    r.set_const(x.int_const - y.int_const);
+    x.unused();
+    y.unused();
+    return push_const(r.int_const);
+  }
+  r.val = emulate_sub(x.val, y.val);
+  if (y.is_int_const() && (-y.int_const)->signed_fits_bits(8)) {
+    y.unused();
+    if (y.always_zero()) {
+      return {};
+    }
+    if (*y.int_const == 1) {
+      return exec_op("DEC", 1);
+    }
+    if (*y.int_const == -1) {
+      return exec_op("INC", 1);
+    }
+    return exec_arg_op("ADDCONST", -y.int_const, 1);
+  }
+  if (x.always_zero()) {
+    x.unused();
+    return exec_op("NEGATE", 1);
+  }
+  return exec_op("SUB", 2);
+}
+
+AsmOp compile_negate(std::vector<VarDescr>& res, std::vector<VarDescr>& args) {
+  assert(res.size() == 1 && args.size() == 1);
+  VarDescr &r = res[0], &x = args[0];
+  if (x.is_int_const()) {
+    r.set_const(-x.int_const);
+    x.unused();
+    return push_const(r.int_const);
+  }
+  r.val = emulate_negate(x.val);
+  return exec_op("NEGATE", 1);
+}
+
+AsmOp compile_mul(std::vector<VarDescr>& res, std::vector<VarDescr>& args) {
+  assert(res.size() == 1 && args.size() == 2);
+  VarDescr &r = res[0], &x = args[0], &y = args[1];
+  if (x.is_int_const() && y.is_int_const()) {
+    r.set_const(x.int_const * y.int_const);
+    x.unused();
+    y.unused();
+    return push_const(r.int_const);
+  }
+  r.val = emulate_mul(x.val, y.val);
+  if (y.is_int_const()) {
+    int k = is_pos_pow2(y.int_const);
+    if (y.int_const->signed_fits_bits(8) && k < 0) {
+      y.unused();
+      if (y.always_zero() && x.always_finite()) {
+        // dubious optimization: NaN * 0 = ?
+        r.set_const(y.int_const);
+        return push_const(r.int_const);
+      }
+      if (*y.int_const == 1 && x.always_finite()) {
+        return AsmOp::Nop();
+      }
+      if (*y.int_const == -1) {
+        return exec_op("NEGATE", 1);
+      }
+      return exec_arg_op("MULCONST", y.int_const, 1);
+    }
+    if (k >= 0) {
+      y.unused();
+      return exec_arg_op("LSHIFT#", k, 1);
+    }
+  }
+  if (x.is_int_const()) {
+    int k = is_pos_pow2(x.int_const);
+    if (x.int_const->signed_fits_bits(8) && k < 0) {
+      x.unused();
+      if (x.always_zero() && y.always_finite()) {
+        // dubious optimization: NaN * 0 = ?
+        r.set_const(x.int_const);
+        return push_const(r.int_const);
+      }
+      if (*x.int_const == 1 && y.always_finite()) {
+        return AsmOp::Nop();
+      }
+      if (*x.int_const == -1) {
+        return exec_op("NEGATE", 1);
+      }
+      return exec_arg_op("MULCONST", x.int_const, 1);
+    }
+    if (k >= 0) {
+      x.unused();
+      return exec_arg_op("LSHIFT#", k, 1);
+    }
+  }
+  return exec_op("MUL", 2);
+}
+
+AsmOp compile_lshift(std::vector<VarDescr>& res, std::vector<VarDescr>& args) {
+  assert(res.size() == 1 && args.size() == 2);
+  VarDescr &r = res[0], &x = args[0], &y = args[1];
+  if (y.is_int_const()) {
+    auto yv = y.int_const->to_long();
+    if (yv < 0 || yv > 256) {
+      r.set_const_nan();
+      x.unused();
+      y.unused();
+      return push_const(r.int_const);
+    } else if (x.is_int_const()) {
+      r.set_const(x.int_const << (int)yv);
+      x.unused();
+      y.unused();
+      return push_const(r.int_const);
+    }
+  }
+  r.val = emulate_lshift(x.val, y.val);
+  if (y.is_int_const()) {
+    int k = (int)(y.int_const->to_long());
+    if (!k /* && x.always_finite() */) {
+      // dubious optimization: what if x=NaN ?
+      y.unused();
+      return AsmOp::Nop();
+    }
+    y.unused();
+    return exec_arg_op("LSHIFT#", k, 1);
+  }
+  if (x.is_int_const()) {
+    auto xv = x.int_const->to_long();
+    if (xv == 1) {
+      x.unused();
+      return exec_op("POW2", 1);
+    }
+    if (xv == -1) {
+      x.unused();
+      return exec_op("NEGPOW2", 1);
+    }
+  }
+  return exec_op("LSHIFT", 2);
+}
+
+AsmOp compile_rshift(std::vector<VarDescr>& res, std::vector<VarDescr>& args, int round_mode) {
+  assert(res.size() == 1 && args.size() == 2);
+  VarDescr &r = res[0], &x = args[0], &y = args[1];
+  if (y.is_int_const()) {
+    auto yv = y.int_const->to_long();
+    if (yv < 0 || yv > 256) {
+      r.set_const_nan();
+      x.unused();
+      y.unused();
+      return push_const(r.int_const);
+    } else if (x.is_int_const()) {
+      r.set_const(td::rshift(x.int_const, (int)yv, round_mode));
+      x.unused();
+      y.unused();
+      return push_const(r.int_const);
+    }
+  }
+  r.val = emulate_rshift(x.val, y.val);
+  std::string rshift = (round_mode < 0 ? "RSHIFT" : (round_mode ? "RSHIFTC" : "RSHIFTR"));
+  if (y.is_int_const()) {
+    int k = (int)(y.int_const->to_long());
+    if (!k /* && x.always_finite() */) {
+      // dubious optimization: what if x=NaN ?
+      y.unused();
+      return AsmOp::Nop();
+    }
+    y.unused();
+    return exec_arg_op(rshift + "#", k, 1);
+  }
+  return exec_op(rshift, 2);
+}
+
+AsmOp compile_div(std::vector<VarDescr>& res, std::vector<VarDescr>& args, int round_mode) {
+  assert(res.size() == 1 && args.size() == 2);
+  VarDescr &r = res[0], &x = args[0], &y = args[1];
+  if (x.is_int_const() && y.is_int_const()) {
+    r.set_const(div(x.int_const, y.int_const, round_mode));
+    x.unused();
+    y.unused();
+    return push_const(r.int_const);
+  }
+  r.val = emulate_div(x.val, y.val);
+  if (y.is_int_const()) {
+    if (*y.int_const == 0) {
+      x.unused();
+      y.unused();
+      r.set_const(div(y.int_const, y.int_const));
+      return push_const(r.int_const);
+    }
+    if (*y.int_const == 1 && x.always_finite()) {
+      y.unused();
+      return AsmOp::Nop();
+    }
+    if (*y.int_const == -1) {
+      y.unused();
+      return exec_op("NEGATE", 1);
+    }
+    int k = is_pos_pow2(y.int_const);
+    if (k > 0) {
+      y.unused();
+      std::string op = "RSHIFT";
+      if (round_mode >= 0) {
+        op += (round_mode > 0 ? 'C' : 'R');
+      }
+      return exec_arg_op(op + '#', k, 1);
+    }
+  }
+  std::string op = "DIV";
+  if (round_mode >= 0) {
+    op += (round_mode > 0 ? 'C' : 'R');
+  }
+  return exec_op(op, 2);
+}
+
+AsmOp compile_mod(std::vector<VarDescr>& res, std::vector<VarDescr>& args, int round_mode) {
+  assert(res.size() == 1 && args.size() == 2);
+  VarDescr &r = res[0], &x = args[0], &y = args[1];
+  if (x.is_int_const() && y.is_int_const()) {
+    r.set_const(mod(x.int_const, y.int_const, round_mode));
+    x.unused();
+    y.unused();
+    return push_const(r.int_const);
+  }
+  r.val = emulate_mod(x.val, y.val);
+  if (y.is_int_const()) {
+    if (*y.int_const == 0) {
+      x.unused();
+      y.unused();
+      r.set_const(mod(y.int_const, y.int_const));
+      return push_const(r.int_const);
+    }
+    if ((*y.int_const == 1 || *y.int_const == -1) && x.always_finite()) {
+      x.unused();
+      y.unused();
+      r.set_const(td::RefInt256{true, 0});
+      return push_const(r.int_const);
+    }
+    int k = is_pos_pow2(y.int_const);
+    if (k > 0) {
+      y.unused();
+      std::string op = "MODPOW2";
+      if (round_mode >= 0) {
+        op += (round_mode > 0 ? 'C' : 'R');
+      }
+      return exec_arg_op(op + '#', k, 1);
+    }
+  }
+  std::string op = "MOD";
+  if (round_mode >= 0) {
+    op += (round_mode > 0 ? 'C' : 'R');
+  }
+  return exec_op(op, 2);
+}
+
+int compute_compare(td::RefInt256 x, td::RefInt256 y, int mode) {
+  int s = td::cmp(x, y);
+  if (mode == 7) {
+    return s;
+  } else {
+    return (mode >> (1 - s)) & 1;
+  }
+}
+
+// return value:
+// 4 -> constant 1
+// 2 -> constant 0
+// 1 -> constant -1
+// 3 -> 0 or -1
+int compute_compare(const VarDescr& x, const VarDescr& y, int mode) {
+  switch (mode) {
+    case 1:  // >
+      return x.always_greater(y) ? 1 : (x.always_leq(y) ? 2 : 3);
+    case 2:  // =
+      return x.always_equal(y) ? 1 : (x.always_neq(y) ? 2 : 3);
+    case 3:  // >=
+      return x.always_geq(y) ? 1 : (x.always_less(y) ? 2 : 3);
+    case 4:  // <
+      return x.always_less(y) ? 1 : (x.always_geq(y) ? 2 : 3);
+    case 5:  // <>
+      return x.always_neq(y) ? 1 : (x.always_equal(y) ? 2 : 3);
+    case 6:  // >=
+      return x.always_geq(y) ? 1 : (x.always_less(y) ? 2 : 3);
+    case 7:  // <=>
+      return x.always_less(y)
+                 ? 1
+                 : (x.always_equal(y)
+                        ? 2
+                        : (x.always_greater(y)
+                               ? 4
+                               : (x.always_leq(y) ? 3 : (x.always_geq(y) ? 6 : (x.always_neq(y) ? 5 : 7)))));
+    default:
+      return 7;
+  }
+}
+
+AsmOp compile_cmp_int(std::vector<VarDescr>& res, std::vector<VarDescr>& args, int mode) {
+  assert(mode >= 1 && mode <= 7);
+  assert(res.size() == 1 && args.size() == 2);
+  VarDescr &r = res[0], &x = args[0], &y = args[1];
+  if (x.is_int_const() && y.is_int_const()) {
+    r.set_const(compute_compare(x.int_const, y.int_const, mode));
+    x.unused();
+    y.unused();
+    return push_const(r.int_const);
+  }
+  int v = compute_compare(x, y, mode);
+  assert(v);
+  if (!(v & (v - 1))) {
+    r.set_const(v - (v >> 2) - 2);
+    x.unused();
+    y.unused();
+    return push_const(r.int_const);
+  }
+  r.val = ~0;
+  if (v & 1) {
+    r.val &= VarDescr::ConstTrue;
+  }
+  if (v & 2) {
+    r.val &= VarDescr::ConstZero;
+  }
+  if (v & 4) {
+    r.val &= VarDescr::ConstOne;
+  }
+  static const char* cmp_int_names[] = {"", "GTINT", "EQINT", "GTINT", "LESSINT", "NEQINT", "LESSINT"};
+  static const char* cmp_names[] = {"", "GREATER", "EQUAL", "GEQ", "LESS", "NEQ", "LEQ", "CMP"};
+  static int cmp_int_delta[] = {0, 0, 0, -1, 0, 0, 1};
+  if (mode != 7) {
+    if (y.is_int_const() && y.int_const >= -128 && y.int_const <= 127) {
+      y.unused();
+      return exec_arg_op(cmp_int_names[mode], y.int_const + cmp_int_delta[mode], 1);
+    }
+    if (x.is_int_const() && x.int_const >= -128 && x.int_const <= 127) {
+      x.unused();
+      mode = ((mode & 4) >> 2) | (mode & 2) | ((mode & 1) << 2);
+      return exec_arg_op(cmp_int_names[mode], x.int_const + cmp_int_delta[mode], 1);
+    }
+  }
+  return exec_op(cmp_names[mode], 2);
+}
+
+AsmOp compile_throw(std::vector<VarDescr>& res, std::vector<VarDescr>& args) {
+  assert(res.empty() && args.size() == 1);
+  VarDescr& x = args[0];
+  if (x.is_int_const() && x.int_const->unsigned_fits_bits(11)) {
+    x.unused();
+    return exec_arg_op("THROW", x.int_const, 0, 0);
+  } else {
+    return exec_op("THROWANY", 1, 0);
+  }
+}
+
+AsmOp compile_cond_throw(std::vector<VarDescr>& res, std::vector<VarDescr>& args, bool mode) {
+  assert(res.empty() && args.size() == 2);
+  VarDescr &x = args[0], &y = args[1];
+  std::string suff = (mode ? "IF" : "IFNOT");
+  bool skip_cond = false;
+  if (y.always_true() || y.always_false()) {
+    y.unused();
+    skip_cond = true;
+    if (y.always_true() != mode) {
+      x.unused();
+      return AsmOp::Nop();
+    }
+  }
+  if (x.is_int_const() && x.int_const->unsigned_fits_bits(11)) {
+    x.unused();
+    return skip_cond ? exec_arg_op("THROW", x.int_const, 0, 0) : exec_arg_op("THROW"s + suff, x.int_const, 1, 0);
+  } else {
+    return skip_cond ? exec_op("THROWANY", 1, 0) : exec_arg_op("THROWANY"s + suff, 2, 0);
+  }
+}
+
+AsmOp compile_bool_const(std::vector<VarDescr>& res, std::vector<VarDescr>& args, bool val) {
+  assert(res.size() == 1 && args.empty());
+  VarDescr& r = res[0];
+  r.set_const(val ? -1 : 0);
+  return AsmOp::Const(val ? "TRUE" : "FALSE");
+}
+
+// (slice, int) load_int(slice s, int len) asm(s len -> 1 0) "LDIX";
+// (slice, int) load_uint(slice s, int len) asm( -> 1 0) "LDUX";
+// int preload_int(slice s, int len) asm "PLDIX";
+// int preload_uint(slice s, int len) asm "PLDUX";
+AsmOp compile_fetch_int(std::vector<VarDescr>& res, std::vector<VarDescr>& args, bool fetch, bool sgnd) {
+  assert(args.size() == 2 && res.size() == 1 + (unsigned)fetch);
+  auto &y = args[1], &r = res.back();
+  r.val = (sgnd ? VarDescr::FiniteInt : VarDescr::FiniteUInt);
+  int v = -1;
+  if (y.is_int_const() && y.int_const >= 0 && y.int_const <= 256) {
+    v = (int)y.int_const->to_long();
+    if (!v) {
+      r.val = VarDescr::ConstZero;
+    }
+    if (v == 1) {
+      r.val = (sgnd ? VarDescr::ValBool : VarDescr::ValBit);
+    }
+    if (v > 0) {
+      y.unused();
+      return exec_arg_op((fetch ? "LD"s : "PLD"s) + (sgnd ? 'I' : 'U'), v, 1, 1 + (unsigned)fetch);
+    }
+  }
+  return exec_op((fetch ? "LD"s : "PLD"s) + (sgnd ? "IX" : "UX"), 2, 1 + (unsigned)fetch);
+}
+
+// builder store_uint(builder b, int x, int len) asm(x b len) "STUX";
+// builder store_int(builder b, int x, int len) asm(x b len) "STIX";
+AsmOp compile_store_int(std::vector<VarDescr>& res, std::vector<VarDescr>& args, bool sgnd) {
+  assert(args.size() == 3 && res.size() == 1);
+  auto& z = args[2];
+  if (z.is_int_const() && z.int_const > 0 && z.int_const <= 256) {
+    z.unused();
+    return exec_arg_op("ST"s + (sgnd ? 'I' : 'U'), z.int_const, 2, 1);
+  }
+  return exec_op("ST"s + (sgnd ? "IX" : "UX"), 3, 1);
+}
+
+AsmOp compile_fetch_slice(std::vector<VarDescr>& res, std::vector<VarDescr>& args, bool fetch) {
+  assert(args.size() == 2 && res.size() == 1 + (unsigned)fetch);
+  auto& y = args[1];
+  int v = -1;
+  if (y.is_int_const() && y.int_const > 0 && y.int_const <= 256) {
+    v = (int)y.int_const->to_long();
+    if (v > 0) {
+      y.unused();
+      return exec_arg_op(fetch ? "LDSLICE" : "PLDSLICE", v, 1, 1 + (unsigned)fetch);
+    }
+  }
+  return exec_op(fetch ? "LDSLICEX" : "PLDSLICEX", 2, 1 + (unsigned)fetch);
+}
+
+// <type> <type>_at(tuple t, int index) asm "INDEXVAR";
+AsmOp compile_tuple_at(std::vector<VarDescr>& res, std::vector<VarDescr>& args) {
+  assert(args.size() == 2 && res.size() == 1);
+  auto& y = args[1];
+  if (y.is_int_const() && y.int_const >= 0 && y.int_const < 16) {
+    y.unused();
+    return exec_arg_op("INDEX", y.int_const, 1, 1);
+  }
+  return exec_op("INDEXVAR", 2, 1);
+}
+
+// int null?(X arg)
+AsmOp compile_is_null(std::vector<VarDescr>& res, std::vector<VarDescr>& args) {
+  assert(args.size() == 1 && res.size() == 1);
+  auto &x = args[0], &r = res[0];
+  if (x.always_null() || x.always_not_null()) {
+    x.unused();
+    r.set_const(x.always_null() ? -1 : 0);
+    return push_const(r.int_const);
+  }
+  res[0].val = VarDescr::ValBool;
+  return exec_op("ISNULL", 1, 1);
+}
+
+bool compile_run_method(AsmOpList& code, std::vector<VarDescr>& res, std::vector<VarDescr>& args, int n,
+                        bool has_value) {
+  assert(args.size() == (unsigned)n + 1 && res.size() == (unsigned)has_value);
+  auto& x = args[0];
+  if (x.is_int_const() && x.int_const->unsigned_fits_bits(14)) {
+    x.unused();
+    code << exec_arg_op("PREPAREDICT", x.int_const, 0, 2);
+  } else {
+    code << exec_op("c3 PUSH", 0, 1);
+  }
+  code << exec_arg_op(has_value ? "1 CALLXARGS" : "0 CALLXARGS", n, n + 2, (unsigned)has_value);
+  return true;
+}
+
+void define_builtins() {
+  using namespace std::placeholders;
+  auto Unit = TypeExpr::new_unit();
+  auto Int = TypeExpr::new_atomic(_Int);
+  auto Cell = TypeExpr::new_atomic(_Cell);
+  auto Slice = TypeExpr::new_atomic(_Slice);
+  auto Builder = TypeExpr::new_atomic(_Builder);
+  // auto Null = TypeExpr::new_atomic(_Null);
+  auto Tuple = TypeExpr::new_atomic(_Tuple);
+  auto Int2 = TypeExpr::new_tensor({Int, Int});
+  auto Int3 = TypeExpr::new_tensor({Int, Int, Int});
+  auto TupleInt = TypeExpr::new_tensor({Tuple, Int});
+  auto SliceInt = TypeExpr::new_tensor({Slice, Int});
+  auto X = TypeExpr::new_var();
+  auto Y = TypeExpr::new_var();
+  auto Z = TypeExpr::new_var();
+  auto T = TypeExpr::new_var();
+  auto XY = TypeExpr::new_tensor({X, Y});
+  auto XYZ = TypeExpr::new_tensor({X, Y, Z});
+  auto XYZT = TypeExpr::new_tensor({X, Y, Z, T});
+  auto arith_bin_op = TypeExpr::new_map(Int2, Int);
+  auto arith_un_op = TypeExpr::new_map(Int, Int);
+  auto impure_bin_op = TypeExpr::new_map(Int2, Unit);
+  auto impure_un_op = TypeExpr::new_map(Int, Unit);
+  auto fetch_int_op = TypeExpr::new_map(SliceInt, SliceInt);
+  auto prefetch_int_op = TypeExpr::new_map(SliceInt, Int);
+  auto store_int_op = TypeExpr::new_map(TypeExpr::new_tensor({Builder, Int, Int}), Builder);
+  auto store_int_method =
+      TypeExpr::new_map(TypeExpr::new_tensor({Builder, Int, Int}), TypeExpr::new_tensor({Builder, Unit}));
+  auto fetch_slice_op = TypeExpr::new_map(SliceInt, TypeExpr::new_tensor({Slice, Slice}));
+  auto prefetch_slice_op = TypeExpr::new_map(SliceInt, Slice);
+  //auto arith_null_op = TypeExpr::new_map(TypeExpr::new_unit(), Int);
+  define_builtin_func("_+_", arith_bin_op, compile_add);
+  define_builtin_func("_-_", arith_bin_op, compile_sub);
+  define_builtin_func("-_", arith_un_op, compile_negate);
+  define_builtin_func("_*_", arith_bin_op, compile_mul);
+  define_builtin_func("_/_", arith_bin_op, std::bind(compile_div, _1, _2, -1));
+  define_builtin_func("_/~_", arith_bin_op, std::bind(compile_div, _1, _2, 0));
+  define_builtin_func("_/^_", arith_bin_op, std::bind(compile_div, _1, _2, 1));
+  define_builtin_func("_%_", arith_bin_op, std::bind(compile_mod, _1, _2, -1));
+  define_builtin_func("_%~_", arith_bin_op, std::bind(compile_mod, _1, _2, 0));
+  define_builtin_func("_%^_", arith_bin_op, std::bind(compile_mod, _1, _2, -1));
+  define_builtin_func("_/%_", TypeExpr::new_map(Int2, Int2), AsmOp::Custom("DIVMOD", 2, 2));
+  define_builtin_func("_<<_", arith_bin_op, compile_lshift);
+  define_builtin_func("_>>_", arith_bin_op, std::bind(compile_rshift, _1, _2, -1));
+  define_builtin_func("_>>~_", arith_bin_op, std::bind(compile_rshift, _1, _2, 0));
+  define_builtin_func("_>>^_", arith_bin_op, std::bind(compile_rshift, _1, _2, 1));
+  define_builtin_func("_&_", arith_bin_op, AsmOp::Custom("AND", 2));
+  define_builtin_func("_|_", arith_bin_op, AsmOp::Custom("OR", 2));
+  define_builtin_func("_^_", arith_bin_op, AsmOp::Custom("XOR", 2));
+  define_builtin_func("~_", arith_un_op, AsmOp::Custom("NOT", 1));
+  define_builtin_func("^_+=_", arith_bin_op, compile_add);
+  define_builtin_func("^_-=_", arith_bin_op, compile_sub);
+  define_builtin_func("^_*=_", arith_bin_op, compile_mul);
+  define_builtin_func("^_/=_", arith_bin_op, std::bind(compile_div, _1, _2, -1));
+  define_builtin_func("^_/~=_", arith_bin_op, std::bind(compile_div, _1, _2, 0));
+  define_builtin_func("^_/^=_", arith_bin_op, std::bind(compile_div, _1, _2, 1));
+  define_builtin_func("^_%=_", arith_bin_op, std::bind(compile_mod, _1, _2, -1));
+  define_builtin_func("^_%~=_", arith_bin_op, std::bind(compile_mod, _1, _2, 0));
+  define_builtin_func("^_%^=_", arith_bin_op, std::bind(compile_mod, _1, _2, 1));
+  define_builtin_func("^_<<=_", arith_bin_op, compile_lshift);
+  define_builtin_func("^_>>=_", arith_bin_op, std::bind(compile_rshift, _1, _2, -1));
+  define_builtin_func("^_>>~=_", arith_bin_op, std::bind(compile_rshift, _1, _2, 0));
+  define_builtin_func("^_>>^=_", arith_bin_op, std::bind(compile_rshift, _1, _2, 1));
+  define_builtin_func("^_&=_", arith_bin_op, AsmOp::Custom("AND", 2));
+  define_builtin_func("^_|=_", arith_bin_op, AsmOp::Custom("OR", 2));
+  define_builtin_func("^_^=_", arith_bin_op, AsmOp::Custom("XOR", 2));
+  define_builtin_func("muldivr", TypeExpr::new_map(Int3, Int), AsmOp::Custom("MULDIVR", 3));
+  define_builtin_func("muldiv", TypeExpr::new_map(Int3, Int), AsmOp::Custom("MULDIV", 3));
+  define_builtin_func("muldivmod", TypeExpr::new_map(Int3, Int2), AsmOp::Custom("MULDIVMOD", 3, 2));
+  define_builtin_func("_==_", arith_bin_op, std::bind(compile_cmp_int, _1, _2, 2));
+  define_builtin_func("_!=_", arith_bin_op, std::bind(compile_cmp_int, _1, _2, 5));
+  define_builtin_func("_<_", arith_bin_op, std::bind(compile_cmp_int, _1, _2, 4));
+  define_builtin_func("_>_", arith_bin_op, std::bind(compile_cmp_int, _1, _2, 1));
+  define_builtin_func("_<=_", arith_bin_op, std::bind(compile_cmp_int, _1, _2, 6));
+  define_builtin_func("_>=_", arith_bin_op, std::bind(compile_cmp_int, _1, _2, 3));
+  define_builtin_func("_<=>_", arith_bin_op, std::bind(compile_cmp_int, _1, _2, 7));
+  define_builtin_func("true", Int, /* AsmOp::Const("TRUE") */ std::bind(compile_bool_const, _1, _2, true));
+  define_builtin_func("false", Int, /* AsmOp::Const("FALSE") */ std::bind(compile_bool_const, _1, _2, false));
+  // define_builtin_func("null", Null, AsmOp::Const("PUSHNULL"));
+  define_builtin_func("nil", Tuple, AsmOp::Const("PUSHNULL"));
+  define_builtin_func("null?", TypeExpr::new_forall({X}, TypeExpr::new_map(X, Int)), compile_is_null);
+  define_builtin_func("cons", TypeExpr::new_forall({X}, TypeExpr::new_map(TypeExpr::new_tensor(X, Tuple), Tuple)),
+                      AsmOp::Custom("CONS", 2, 1));
+  define_builtin_func("uncons", TypeExpr::new_forall({X}, TypeExpr::new_map(Tuple, TypeExpr::new_tensor(X, Tuple))),
+                      AsmOp::Custom("UNCONS", 1, 2));
+  define_builtin_func_x("list_next",
+                        TypeExpr::new_forall({X}, TypeExpr::new_map(Tuple, TypeExpr::new_tensor(Tuple, X))),
+                        AsmOp::Custom("UNCONS", 1, 2), {}, {1, 0});
+  define_builtin_func("car", TypeExpr::new_forall({X}, TypeExpr::new_map(Tuple, X)), AsmOp::Custom("CAR", 1, 1));
+  define_builtin_func("cdr", TypeExpr::new_map(Tuple, Tuple), AsmOp::Custom("CDR", 1, 1));
+  define_builtin_func("pair", TypeExpr::new_forall({X, Y}, TypeExpr::new_map(XY, Tuple)), AsmOp::Custom("PAIR", 2, 1));
+  define_builtin_func("unpair", TypeExpr::new_forall({X, Y}, TypeExpr::new_map(Tuple, XY)),
+                      AsmOp::Custom("UNPAIR", 1, 2));
+  define_builtin_func("triple", TypeExpr::new_forall({X, Y, Z}, TypeExpr::new_map(XYZ, Tuple)),
+                      AsmOp::Custom("TRIPLE", 3, 1));
+  define_builtin_func("untriple", TypeExpr::new_forall({X, Y, Z}, TypeExpr::new_map(Tuple, XYZ)),
+                      AsmOp::Custom("UNTRIPLE", 1, 3));
+  define_builtin_func("tuple4", TypeExpr::new_forall({X, Y, Z, T}, TypeExpr::new_map(XYZT, Tuple)),
+                      AsmOp::Custom("4 TUPLE", 4, 1));
+  define_builtin_func("untuple4", TypeExpr::new_forall({X, Y, Z, T}, TypeExpr::new_map(Tuple, XYZT)),
+                      AsmOp::Custom("4 UNTUPLE", 1, 4));
+  define_builtin_func("throw", impure_un_op, compile_throw, true);
+  define_builtin_func("throw_if", impure_bin_op, std::bind(compile_cond_throw, _1, _2, true), true);
+  define_builtin_func("throw_unless", impure_bin_op, std::bind(compile_cond_throw, _1, _2, false), true);
+  define_builtin_func_x("load_int", fetch_int_op, std::bind(compile_fetch_int, _1, _2, true, true), {}, {1, 0});
+  define_builtin_func_x("load_uint", fetch_int_op, std::bind(compile_fetch_int, _1, _2, true, false), {}, {1, 0});
+  define_builtin_func("preload_int", prefetch_int_op, std::bind(compile_fetch_int, _1, _2, false, true));
+  define_builtin_func("preload_uint", prefetch_int_op, std::bind(compile_fetch_int, _1, _2, false, false));
+  define_builtin_func_x("store_int", store_int_op, std::bind(compile_store_int, _1, _2, true), {1, 0, 2});
+  define_builtin_func_x("store_uint", store_int_op, std::bind(compile_store_int, _1, _2, false), {1, 0, 2});
+  define_builtin_func_x("~store_int", store_int_method, std::bind(compile_store_int, _1, _2, true), {1, 0, 2});
+  define_builtin_func_x("~store_uint", store_int_method, std::bind(compile_store_int, _1, _2, false), {1, 0, 2});
+  define_builtin_func_x("load_bits", fetch_slice_op, std::bind(compile_fetch_slice, _1, _2, true), {}, {1, 0});
+  define_builtin_func("preload_bits", prefetch_slice_op, std::bind(compile_fetch_slice, _1, _2, false));
+  define_builtin_func("int_at", TypeExpr::new_map(TupleInt, Int), compile_tuple_at);
+  define_builtin_func("cell_at", TypeExpr::new_map(TupleInt, Cell), compile_tuple_at);
+  define_builtin_func("slice_at", TypeExpr::new_map(TupleInt, Cell), compile_tuple_at);
+  define_builtin_func("tuple_at", TypeExpr::new_map(TupleInt, Tuple), compile_tuple_at);
+  define_builtin_func("at", TypeExpr::new_forall({X}, TypeExpr::new_map(TupleInt, X)), compile_tuple_at);
+  define_builtin_func("touch", TypeExpr::new_forall({X}, TypeExpr::new_map(X, X)), AsmOp::Nop());
+  define_builtin_func("~touch", TypeExpr::new_forall({X}, TypeExpr::new_map(X, TypeExpr::new_tensor({X, Unit}))),
+                      AsmOp::Nop());
+  define_builtin_func("touch2", TypeExpr::new_forall({X, Y}, TypeExpr::new_map(XY, XY)), AsmOp::Nop());
+  define_builtin_func("~touch2", TypeExpr::new_forall({X, Y}, TypeExpr::new_map(XY, TypeExpr::new_tensor({XY, Unit}))),
+                      AsmOp::Nop());
+  define_builtin_func("~dump", TypeExpr::new_forall({X}, TypeExpr::new_map(X, TypeExpr::new_tensor({X, Unit}))),
+                      AsmOp::Custom("s0 DUMP", 1, 1));
+  define_builtin_func(
+      "run_method0", TypeExpr::new_map(Int, Unit),
+      [](auto a, auto b, auto c) { return compile_run_method(a, b, c, 0, false); }, true);
+  define_builtin_func_x(
+      "run_method1", TypeExpr::new_forall({X}, TypeExpr::new_map(TypeExpr::new_tensor({Int, X}), Unit)),
+      [](auto a, auto b, auto c) { return compile_run_method(a, b, c, 1, false); }, {1, 0}, {}, true);
+  define_builtin_func_x(
+      "run_method2", TypeExpr::new_forall({X, Y}, TypeExpr::new_map(TypeExpr::new_tensor({Int, X, Y}), Unit)),
+      [](auto a, auto b, auto c) { return compile_run_method(a, b, c, 2, false); }, {1, 2, 0}, {}, true);
+  define_builtin_func_x(
+      "run_method3", TypeExpr::new_forall({X, Y, Z}, TypeExpr::new_map(TypeExpr::new_tensor({Int, X, Y, Z}), Unit)),
+      [](auto a, auto b, auto c) { return compile_run_method(a, b, c, 3, false); }, {1, 2, 3, 0}, {}, true);
+}
+
+}  // namespace funC
diff --git a/submodules/ton/tonlib-src/crypto/func/codegen.cpp b/submodules/ton/tonlib-src/crypto/func/codegen.cpp
new file mode 100644
index 0000000000..0efea4d680
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/codegen.cpp
@@ -0,0 +1,689 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "func.h"
+
+namespace funC {
+
+/*
+ * 
+ *   GENERATE TVM STACK CODE
+ * 
+ */
+
+StackLayout Stack::vars() const {
+  StackLayout res;
+  res.reserve(s.size());
+  for (auto x : s) {
+    res.push_back(x.first);
+  }
+  return res;
+}
+
+int Stack::find(var_idx_t var, int from) const {
+  for (int i = from; i < depth(); i++) {
+    if (at(i).first == var) {
+      return i;
+    }
+  }
+  return -1;
+}
+
+// finds var in [from .. to)
+int Stack::find(var_idx_t var, int from, int to) const {
+  for (int i = from; i < depth() && i < to; i++) {
+    if (at(i).first == var) {
+      return i;
+    }
+  }
+  return -1;
+}
+
+// finds var outside [from .. to)
+int Stack::find_outside(var_idx_t var, int from, int to) const {
+  from = std::max(from, 0);
+  if (from >= to) {
+    return find(var);
+  } else {
+    int t = find(var, 0, from);
+    return t >= 0 ? t : find(var, to);
+  }
+}
+
+int Stack::find_const(const_idx_t cst, int from) const {
+  for (int i = from; i < depth(); i++) {
+    if (at(i).second == cst) {
+      return i;
+    }
+  }
+  return -1;
+}
+
+void Stack::forget_const() {
+  for (auto& vc : s) {
+    if (vc.second != not_const) {
+      vc.second = not_const;
+    }
+  }
+}
+
+void Stack::issue_pop(int i) {
+  validate(i);
+  o << AsmOp::Pop(i);
+  at(i) = get(0);
+  s.pop_back();
+  modified();
+}
+
+void Stack::issue_push(int i) {
+  validate(i);
+  o << AsmOp::Push(i);
+  s.push_back(get(i));
+  modified();
+}
+
+void Stack::issue_xchg(int i, int j) {
+  validate(i);
+  validate(j);
+  if (i != j && get(i) != get(j)) {
+    o << AsmOp::Xchg(i, j);
+    std::swap(at(i), at(j));
+    modified();
+  }
+}
+
+int Stack::drop_vars_except(const VarDescrList& var_info, int excl_var) {
+  int dropped = 0, changes;
+  do {
+    changes = 0;
+    int n = depth();
+    for (int i = 0; i < n; i++) {
+      var_idx_t idx = at(i).first;
+      if (((!var_info[idx] || var_info[idx]->is_unused()) && idx != excl_var) || find(idx, 0, i - 1) >= 0) {
+        // unneeded
+        issue_pop(i);
+        changes = 1;
+        break;
+      }
+    }
+    dropped += changes;
+  } while (changes);
+  return dropped;
+}
+
+void Stack::show(int flags) {
+  std::ostringstream os;
+  for (auto i : s) {
+    os << ' ';
+    o.show_var_ext(os, i);
+  }
+  o << AsmOp::Comment(os.str());
+  mode |= _Shown;
+}
+
+void Stack::forget_var(var_idx_t idx) {
+  for (auto& x : s) {
+    if (x.first == idx) {
+      x = std::make_pair(_Garbage, not_const);
+      modified();
+    }
+  }
+}
+
+void Stack::push_new_var(var_idx_t idx) {
+  forget_var(idx);
+  s.emplace_back(idx, not_const);
+  modified();
+}
+
+void Stack::push_new_const(var_idx_t idx, const_idx_t cidx) {
+  forget_var(idx);
+  s.emplace_back(idx, cidx);
+  modified();
+}
+
+void Stack::assign_var(var_idx_t new_idx, var_idx_t old_idx) {
+  int i = find(old_idx);
+  assert(i >= 0 && "variable not found in stack");
+  if (new_idx != old_idx) {
+    at(i).first = new_idx;
+    modified();
+  }
+}
+
+void Stack::do_copy_var(var_idx_t new_idx, var_idx_t old_idx) {
+  int i = find(old_idx);
+  assert(i >= 0 && "variable not found in stack");
+  if (find(old_idx, i + 1) < 0) {
+    issue_push(i);
+    assert(at(0).first == old_idx);
+  }
+  assign_var(new_idx, old_idx);
+}
+
+void Stack::enforce_state(const StackLayout& req_stack) {
+  int k = (int)req_stack.size();
+  for (int i = 0; i < k; i++) {
+    var_idx_t x = req_stack[i];
+    if (i < depth() && s[i].first == x) {
+      continue;
+    }
+    int j = find(x);
+    if (j >= depth() - i) {
+      issue_push(j);
+      j = 0;
+    }
+    issue_xchg(j, depth() - i - 1);
+    assert(s[i].first == x);
+  }
+  while (depth() > k) {
+    issue_pop(0);
+  }
+  assert(depth() == k);
+  for (int i = 0; i < k; i++) {
+    assert(s[i].first == req_stack[i]);
+  }
+}
+
+void Stack::merge_const(const Stack& req_stack) {
+  assert(s.size() == req_stack.s.size());
+  for (std::size_t i = 0; i < s.size(); i++) {
+    assert(s[i].first == req_stack.s[i].first);
+    if (s[i].second != req_stack.s[i].second) {
+      s[i].second = not_const;
+    }
+  }
+}
+
+void Stack::merge_state(const Stack& req_stack) {
+  enforce_state(req_stack.vars());
+  merge_const(req_stack);
+}
+
+void Stack::rearrange_top(const StackLayout& top, std::vector<bool> last) {
+  while (last.size() < top.size()) {
+    last.push_back(false);
+  }
+  int k = (int)top.size();
+  for (int i = 0; i < k; i++) {
+    for (int j = i + 1; j < k; j++) {
+      if (top[i] == top[j]) {
+        last[i] = false;
+        break;
+      }
+    }
+  }
+  int ss = 0;
+  for (int i = 0; i < k; i++) {
+    if (last[i]) {
+      ++ss;
+    }
+  }
+  for (int i = 0; i < k; i++) {
+    var_idx_t x = top[i];
+    // find s(j) containing x with j not in [ss, ss+i)
+    int j = find_outside(x, ss, ss + i);
+    if (last[i]) {
+      // rearrange x to be at s(ss-1)
+      issue_xchg(--ss, j);
+      assert(get(ss).first == x);
+    } else {
+      // create a new copy of x
+      issue_push(j);
+      issue_xchg(0, ss);
+      assert(get(ss).first == x);
+    }
+  }
+  assert(!ss);
+}
+
+void Stack::rearrange_top(var_idx_t top, bool last) {
+  int i = find(top);
+  if (last) {
+    issue_xchg(0, i);
+  } else {
+    issue_push(i);
+  }
+  assert(get(0).first == top);
+}
+
+bool Op::generate_code_step(Stack& stack) {
+  stack.opt_show();
+  stack.drop_vars_except(var_info);
+  stack.opt_show();
+  const auto& next_var_info = next->var_info;
+  switch (cl) {
+    case _Nop:
+    case _Import:
+      return true;
+    case _Return: {
+      stack.enforce_state(left);
+      stack.opt_show();
+      return false;
+    }
+    case _IntConst: {
+      auto p = next_var_info[left[0]];
+      if (!p || p->is_unused()) {
+        return true;
+      }
+      auto cidx = stack.o.register_const(int_const);
+      int i = stack.find_const(cidx);
+      if (i < 0) {
+        stack.o << push_const(int_const);
+        stack.push_new_const(left[0], cidx);
+      } else {
+        assert(stack.at(i).second == cidx);
+        stack.do_copy_var(left[0], stack[i]);
+      }
+      return true;
+    }
+    case _GlobVar: {
+      assert(left.size() == 1);
+      auto p = next_var_info[left[0]];
+      if (!p || p->is_unused() || disabled()) {
+        return true;
+      }
+      auto func = dynamic_cast<const SymValAsmFunc*>(fun_ref->value);
+      if (func) {
+        std::vector<VarDescr> res;
+        res.reserve(left.size());
+        for (var_idx_t i : left) {
+          res.emplace_back(i);
+        }
+        func->compile(stack.o, res, args);  // compile res := f (args)
+      } else {
+        std::string name = sym::symbols.get_name(fun_ref->sym_idx);
+        stack.o << AsmOp::Custom(name + " CALLDICT", (int)right.size());
+      }
+      stack.push_new_var(left[0]);
+      return true;
+    }
+    case _Let: {
+      assert(left.size() == right.size());
+      int i = 0;
+      std::vector<bool> active;
+      active.reserve(left.size());
+      for (std::size_t k = 0; k < left.size(); k++) {
+        var_idx_t y = left[k];  // "y" = "x"
+        auto p = next_var_info[y];
+        active.push_back(p && !p->is_unused());
+      }
+      for (std::size_t k = 0; k < left.size(); k++) {
+        if (!active[k]) {
+          continue;
+        }
+        var_idx_t x = right[k];  // "y" = "x"
+        bool is_last = true;
+        for (std::size_t l = k + 1; l < right.size(); l++) {
+          if (right[l] == x && active[l]) {
+            is_last = false;
+          }
+        }
+        if (is_last) {
+          auto info = var_info[x];
+          is_last = (info && info->is_last());
+        }
+        if (is_last) {
+          stack.assign_var(--i, x);
+        } else {
+          stack.do_copy_var(--i, x);
+        }
+      }
+      i = 0;
+      for (std::size_t k = 0; k < left.size(); k++) {
+        if (active[k]) {
+          stack.assign_var(left[k], --i);
+        }
+      }
+      return true;
+    }
+    case _Call:
+    case _CallInd: {
+      if (disabled()) {
+        return true;
+      }
+      SymValFunc* func = (fun_ref ? dynamic_cast<SymValFunc*>(fun_ref->value) : nullptr);
+      auto arg_order = (func ? func->get_arg_order() : nullptr);
+      auto ret_order = (func ? func->get_ret_order() : nullptr);
+      assert(!arg_order || arg_order->size() == right.size());
+      assert(!ret_order || ret_order->size() == left.size());
+      std::vector<var_idx_t> right1;
+      if (args.size()) {
+        assert(args.size() == right.size());
+        for (int i = 0; i < (int)right.size(); i++) {
+          int j = arg_order ? arg_order->at(i) : i;
+          const VarDescr& arg = args.at(j);
+          if (!arg.is_unused()) {
+            assert(var_info[arg.idx] && !var_info[arg.idx]->is_unused());
+            right1.push_back(arg.idx);
+          }
+        }
+      } else if (arg_order) {
+        for (int i = 0; i < (int)right.size(); i++) {
+          right1.push_back(right.at(arg_order->at(i)));
+        }
+      } else {
+        right1 = right;
+      }
+      std::vector<bool> last;
+      for (var_idx_t x : right1) {
+        last.push_back(var_info[x] && var_info[x]->is_last());
+      }
+      stack.rearrange_top(right1, std::move(last));
+      stack.opt_show();
+      int k = (int)stack.depth() - (int)right1.size();
+      assert(k >= 0);
+      for (int i = 0; i < (int)right1.size(); i++) {
+        if (stack.s[k + i].first != right1[i]) {
+          std::cerr << stack.o;
+        }
+        assert(stack.s[k + i].first == right1[i]);
+      }
+      if (cl == _CallInd) {
+        stack.o << exec_arg_op("CALLARGS", (int)right.size() - 1, -1, (int)right.size() - 1);
+      } else {
+        auto func = dynamic_cast<const SymValAsmFunc*>(fun_ref->value);
+        if (func) {
+          std::vector<VarDescr> res;
+          res.reserve(left.size());
+          for (var_idx_t i : left) {
+            res.emplace_back(i);
+          }
+          func->compile(stack.o, res, args);  // compile res := f (args)
+        } else {
+          std::string name = sym::symbols.get_name(fun_ref->sym_idx);
+          stack.o << AsmOp::Custom(name + " CALLDICT", (int)right.size());
+        }
+      }
+      stack.s.resize(k);
+      for (int i = 0; i < (int)left.size(); i++) {
+        int j = ret_order ? ret_order->at(i) : i;
+        stack.push_new_var(left.at(j));
+      }
+      return true;
+    }
+    case _If: {
+      if (block0->is_empty() && block1->is_empty()) {
+        return true;
+      }
+      var_idx_t x = left[0];
+      stack.rearrange_top(x, var_info[x] && var_info[x]->is_last());
+      assert(stack[0] == x);
+      stack.opt_show();
+      stack.s.pop_back();
+      stack.modified();
+      if (block1->is_empty()) {
+        // if (left) block0; ...
+        if (block0->noreturn()) {
+          stack.o << "IFJMP:<{";
+          stack.o.indent();
+          Stack stack_copy{stack};
+          block0->generate_code_all(stack_copy);
+          stack.o.undent();
+          stack.o << "}>";
+          return true;
+        }
+        stack.o << "IF:<{";
+        stack.o.indent();
+        Stack stack_copy{stack};
+        block0->generate_code_all(stack_copy);
+        stack_copy.drop_vars_except(var_info);
+        stack_copy.opt_show();
+        if (stack_copy == stack) {
+          stack.o.undent();
+          stack.o << "}>";
+          return true;
+        }
+        stack_copy.drop_vars_except(next->var_info);
+        stack_copy.opt_show();
+        if (stack_copy.vars() == stack.vars()) {
+          stack.o.undent();
+          stack.o << "}>";
+          stack.merge_const(stack_copy);
+          return true;
+        }
+        stack.o.undent();
+        stack.o << "}>ELSE<{";
+        stack.o.indent();
+        stack.merge_state(stack_copy);
+        stack.opt_show();
+        stack.o.undent();
+        stack.o << "}>";
+        return true;
+      }
+      if (block0->is_empty()) {
+        // if (!left) block1; ...
+        if (block1->noreturn()) {
+          stack.o << "IFNOTJMP:<{";
+          stack.o.indent();
+          Stack stack_copy{stack};
+          block1->generate_code_all(stack_copy);
+          stack.o.undent();
+          stack.o << "}>";
+          return true;
+        }
+        stack.o << "IFNOT:<{";
+        stack.o.indent();
+        Stack stack_copy{stack};
+        block1->generate_code_all(stack_copy);
+        stack_copy.drop_vars_except(var_info);
+        stack_copy.opt_show();
+        if (stack_copy.vars() == stack.vars()) {
+          stack.o.undent();
+          stack.o << "}>";
+          stack.merge_const(stack_copy);
+          return true;
+        }
+        stack_copy.drop_vars_except(next->var_info);
+        stack_copy.opt_show();
+        if (stack_copy.vars() == stack.vars()) {
+          stack.o.undent();
+          stack.o << "}>";
+          stack.merge_const(stack_copy);
+          return true;
+        }
+        stack.o.undent();
+        stack.o << "}>ELSE<{";
+        stack.o.indent();
+        stack.merge_state(stack_copy);
+        stack.opt_show();
+        stack.o.undent();
+        stack.o << "}>";
+        return true;
+      }
+      if (block0->noreturn()) {
+        stack.o << "IFJMP:<{";
+        stack.o.indent();
+        Stack stack_copy{stack};
+        block0->generate_code_all(stack_copy);
+        stack.o.undent();
+        stack.o << "}>";
+        return block1->generate_code_all(stack);
+      }
+      if (block1->noreturn()) {
+        stack.o << "IFNOTJMP:<{";
+        stack.o.indent();
+        Stack stack_copy{stack};
+        block1->generate_code_all(stack_copy);
+        stack.o.undent();
+        stack.o << "}>";
+        return block0->generate_code_all(stack);
+      }
+      stack.o << "IF:<{";
+      stack.o.indent();
+      Stack stack_copy{stack};
+      block0->generate_code_all(stack_copy);
+      stack_copy.drop_vars_except(next->var_info);
+      stack_copy.opt_show();
+      stack.o.undent();
+      stack.o << "}>ELSE<{";
+      stack.o.indent();
+      block1->generate_code_all(stack);
+      stack.merge_state(stack_copy);
+      stack.opt_show();
+      stack.o.undent();
+      stack.o << "}>";
+      return true;
+    }
+    case _Repeat: {
+      var_idx_t x = left[0];
+      //stack.drop_vars_except(block0->var_info, x);
+      stack.rearrange_top(x, var_info[x] && var_info[x]->is_last());
+      assert(stack[0] == x);
+      stack.opt_show();
+      stack.s.pop_back();
+      stack.modified();
+      if (!next->is_empty()) {
+        stack.o << "REPEAT:<{";
+        stack.o.indent();
+        stack.forget_const();
+        StackLayout layout1 = stack.vars();
+        block0->generate_code_all(stack);
+        stack.enforce_state(std::move(layout1));
+        stack.opt_show();
+        stack.o.undent();
+        stack.o << "}>";
+        return true;
+      } else {
+        stack.o << "REPEATEND";
+        stack.forget_const();
+        StackLayout layout1 = stack.vars();
+        block0->generate_code_all(stack);
+        stack.enforce_state(std::move(layout1));
+        stack.opt_show();
+        return false;
+      }
+    }
+    case _Again: {
+      stack.drop_vars_except(block0->var_info);
+      stack.opt_show();
+      if (!next->is_empty()) {
+        stack.o << "AGAIN:<{";
+        stack.o.indent();
+        stack.forget_const();
+        StackLayout layout1 = stack.vars();
+        block0->generate_code_all(stack);
+        stack.enforce_state(std::move(layout1));
+        stack.opt_show();
+        stack.o.undent();
+        stack.o << "}>";
+        return true;
+      } else {
+        stack.o << "AGAINEND";
+        stack.forget_const();
+        StackLayout layout1 = stack.vars();
+        block0->generate_code_all(stack);
+        stack.enforce_state(std::move(layout1));
+        stack.opt_show();
+        return false;
+      }
+    }
+    case _Until: {
+      // stack.drop_vars_except(block0->var_info);
+      // stack.opt_show();
+      if (!next->is_empty()) {
+        stack.o << "UNTIL:<{";
+        stack.o.indent();
+        stack.forget_const();
+        auto layout1 = stack.vars();
+        block0->generate_code_all(stack);
+        layout1.push_back(left[0]);
+        stack.enforce_state(std::move(layout1));
+        stack.opt_show();
+        stack.o.undent();
+        stack.o << "}>";
+        stack.s.pop_back();
+        stack.modified();
+        return true;
+      } else {
+        stack.o << "UNTILEND";
+        stack.forget_const();
+        StackLayout layout1 = stack.vars();
+        block0->generate_code_all(stack);
+        layout1.push_back(left[0]);
+        stack.enforce_state(std::move(layout1));
+        stack.opt_show();
+        return false;
+      }
+    }
+    case _While: {
+      // while (block0 | left) block1; ...next
+      var_idx_t x = left[0];
+      stack.drop_vars_except(block0->var_info);
+      stack.opt_show();
+      StackLayout layout1 = stack.vars();
+      bool next_empty = next->is_empty();
+      stack.o << (next_empty ? "WHILEEND:<{" : "WHILE:<{");
+      stack.o.indent();
+      stack.forget_const();
+      block0->generate_code_all(stack);
+      stack.rearrange_top(x, !next->var_info[x] && !block1->var_info[x]);
+      stack.opt_show();
+      stack.s.pop_back();
+      stack.modified();
+      stack.o.undent();
+      Stack stack_copy{stack};
+      stack.o << (next_empty ? "}>" : "}>DO<{");
+      if (!next_empty) {
+        stack.o.indent();
+      }
+      stack_copy.opt_show();
+      block1->generate_code_all(stack_copy);
+      stack_copy.enforce_state(std::move(layout1));
+      stack_copy.opt_show();
+      if (!next_empty) {
+        stack.o.undent();
+        stack.o << "}>";
+        return true;
+      } else {
+        return false;
+      }
+    }
+    default:
+      std::cerr << "fatal: unknown operation <??" << cl << ">\n";
+      throw src::ParseError{where, "unknown operation in generate_code()"};
+  }
+}
+
+bool Op::generate_code_all(Stack& stack) {
+  if (generate_code_step(stack) && next) {
+    return next->generate_code_all(stack);
+  } else {
+    return false;
+  }
+}
+
+void CodeBlob::generate_code(AsmOpList& out, int mode) {
+  Stack stack{out, mode};
+  assert(ops && ops->cl == Op::_Import);
+  for (var_idx_t x : ops->left) {
+    stack.push_new_var(x);
+  }
+  ops->generate_code_all(stack);
+  if (!(mode & Stack::_DisableOpt)) {
+    optimize_code(out);
+  }
+}
+
+void CodeBlob::generate_code(std::ostream& os, int mode, int indent) {
+  AsmOpList out_list(indent, &vars);
+  generate_code(out_list, mode);
+  out_list.out(os, mode);
+}
+
+}  // namespace funC
diff --git a/submodules/ton/tonlib-src/crypto/func/func.cpp b/submodules/ton/tonlib-src/crypto/func/func.cpp
new file mode 100644
index 0000000000..223e6fcf95
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/func.cpp
@@ -0,0 +1,248 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "func.h"
+#include "parser/srcread.h"
+#include "parser/lexer.h"
+#include "parser/symtable.h"
+#include <getopt.h>
+#include <fstream>
+
+namespace funC {
+
+int verbosity, indent, opt_level = 2;
+bool stack_layout_comments, op_rewrite_comments, program_envelope, asm_preamble;
+std::ostream* outs = &std::cout;
+std::string generated_from, boc_output_filename;
+
+/*
+ * 
+ *   OUTPUT CODE GENERATOR
+ * 
+ */
+
+void generate_output_func(SymDef* func_sym) {
+  SymValCodeFunc* func_val = dynamic_cast<SymValCodeFunc*>(func_sym->value);
+  assert(func_val);
+  std::string name = sym::symbols.get_name(func_sym->sym_idx);
+  if (verbosity >= 2) {
+    std::cerr << "\n\n=========================\nfunction " << name << " : " << func_val->get_type() << std::endl;
+  }
+  if (!func_val->code) {
+    std::cerr << "( function `" << name << "` undefined )\n";
+  } else {
+    CodeBlob& code = *(func_val->code);
+    if (verbosity >= 3) {
+      code.print(std::cerr, 9);
+    }
+    code.simplify_var_types();
+    // std::cerr << "after simplify_var_types: \n";  code.print(std::cerr, 0);
+    code.prune_unreachable_code();
+    // std::cerr << "after prune_unreachable: \n";  code.print(std::cerr, 0);
+    code.split_vars(true);
+    // std::cerr << "after split_vars: \n";  code.print(std::cerr, 0);
+    for (int i = 0; i < 8; i++) {
+      code.compute_used_code_vars();
+      if (verbosity >= 5) {
+        std::cerr << "after compute_used_vars: \n";
+        code.print(std::cerr, 6);
+      }
+      code.fwd_analyze();
+      // std::cerr << "after fwd_analyze: \n";  code.print(std::cerr, 6);
+      code.prune_unreachable_code();
+      // std::cerr << "after prune_unreachable: \n";  code.print(std::cerr, 6);
+    }
+    code.mark_noreturn();
+    if (verbosity >= 3) {
+      code.print(std::cerr, 15);
+    }
+    if (verbosity >= 2) {
+      std::cerr << "\n---------- resulting code for " << name << " -------------\n";
+    }
+    *outs << std::string(indent * 2, ' ') << name << " PROC:<{\n";
+    code.generate_code(
+        *outs,
+        (stack_layout_comments ? Stack::_StkCmt | Stack::_CptStkCmt : 0) | (opt_level < 2 ? Stack::_DisableOpt : 0),
+        indent + 1);
+    *outs << std::string(indent * 2, ' ') << "}>\n";
+    if (verbosity >= 2) {
+      std::cerr << "--------------\n";
+    }
+  }
+}
+
+int generate_output() {
+  if (asm_preamble) {
+    *outs << "\"Asm.fif\" include\n";
+  }
+  *outs << "// automatically generated from " << generated_from << std::endl;
+  if (program_envelope) {
+    *outs << "PROGRAM{\n";
+  }
+  for (SymDef* func_sym : glob_func) {
+    SymValCodeFunc* func_val = dynamic_cast<SymValCodeFunc*>(func_sym->value);
+    assert(func_val);
+    std::string name = sym::symbols.get_name(func_sym->sym_idx);
+    *outs << std::string(indent * 2, ' ');
+    if (func_val->method_id.is_null()) {
+      *outs << "DECLPROC " << name << "\n";
+    } else {
+      *outs << func_val->method_id << " DECLMETHOD " << name << "\n";
+    }
+  }
+  int errors = 0;
+  for (SymDef* func_sym : glob_func) {
+    try {
+      generate_output_func(func_sym);
+    } catch (src::Error& err) {
+      std::cerr << "cannot generate code for function `" << sym::symbols.get_name(func_sym->sym_idx) << "`:\n"
+                << err << std::endl;
+      ++errors;
+    }
+  }
+  if (program_envelope) {
+    *outs << "}END>c\n";
+  }
+  if (!boc_output_filename.empty()) {
+    *outs << "2 boc+>B \"" << boc_output_filename << "\" B>file\n";
+  }
+  return errors;
+}
+
+}  // namespace funC
+
+void usage(const char* progname) {
+  std::cerr
+      << "usage: " << progname
+      << " [-vIAPSR][-O<level>][-i<indent-spc>][-o<output-filename>][-W<boc-filename>] {<func-source-filename> ...}\n"
+         "\tGenerates Fift TVM assembler code from a funC source\n"
+         "-I\tEnables interactive mode (parse stdin)\n"
+         "-o<fift-output-filename>\tWrites generated code into specified file instead of stdout\n"
+         "-v\tIncreases verbosity level (extra information output into stderr)\n"
+         "-i<indent>\tSets indentation for the output code (in two-space units)\n"
+         "-A\tPrefix code with `\"Asm.fif\" include` preamble\n"
+         "-O<level>\tSets optimization level (2 by default)\n"
+         "-P\tEnvelope code into PROGRAM{ ... }END>c\n"
+         "-S\tInclude stack layout comments in the output code\n"
+         "-R\tInclude operation rewrite comments in the output code\n"
+         "-W<output-boc-file>\tInclude Fift code to serialize and save generated code into specified BoC file. Enables "
+         "-A and -P.\n";
+  std::exit(2);
+}
+
+std::string output_filename;
+
+int main(int argc, char* const argv[]) {
+  int i;
+  bool interactive = false;
+  while ((i = getopt(argc, argv, "Ahi:Io:O:PRSvW:")) != -1) {
+    switch (i) {
+      case 'A':
+        funC::asm_preamble = true;
+        break;
+      case 'I':
+        interactive = true;
+        break;
+      case 'i':
+        funC::indent = std::max(0, atoi(optarg));
+        break;
+      case 'o':
+        output_filename = optarg;
+        break;
+      case 'O':
+        funC::opt_level = std::max(0, atoi(optarg));
+        break;
+      case 'P':
+        funC::program_envelope = true;
+        break;
+      case 'R':
+        funC::op_rewrite_comments = true;
+        break;
+      case 'S':
+        funC::stack_layout_comments = true;
+        break;
+      case 'v':
+        ++funC::verbosity;
+        break;
+      case 'W':
+        funC::boc_output_filename = optarg;
+        funC::asm_preamble = funC::program_envelope = true;
+        break;
+      case 'h':
+      default:
+        usage(argv[0]);
+    }
+  }
+
+  if (funC::program_envelope && !funC::indent) {
+    funC::indent = 1;
+  }
+
+  funC::define_keywords();
+  funC::define_builtins();
+
+  int ok = 0, proc = 0;
+  try {
+    while (optind < argc) {
+      funC::generated_from += std::string{"`"} + argv[optind] + "` ";
+      ok += funC::parse_source_file(argv[optind++]);
+      proc++;
+    }
+    if (interactive) {
+      funC::generated_from += "stdin ";
+      ok += funC::parse_source_stdin();
+      proc++;
+    }
+    if (ok < proc) {
+      throw src::Fatal{"output code generation omitted because of errors"};
+    }
+    if (!proc) {
+      throw src::Fatal{"no source files, no output"};
+    }
+    std::unique_ptr<std::fstream> fs;
+    if (!output_filename.empty()) {
+      fs = std::make_unique<std::fstream>(output_filename, fs->trunc | fs->out);
+      if (!fs->is_open()) {
+        std::cerr << "failed to create output file " << output_filename << '\n';
+        return 2;
+      }
+      funC::outs = fs.get();
+    }
+    funC::generate_output();
+  } catch (src::Fatal& fatal) {
+    std::cerr << "fatal: " << fatal << std::endl;
+    std::exit(1);
+  } catch (src::Error& error) {
+    std::cerr << error << std::endl;
+    std::exit(1);
+  } catch (funC::UnifyError& unif_err) {
+    std::cerr << "fatal: ";
+    unif_err.print_message(std::cerr);
+    std::cerr << std::endl;
+    std::exit(1);
+  }
+}
diff --git a/submodules/ton/tonlib-src/crypto/func/func.h b/submodules/ton/tonlib-src/crypto/func/func.h
new file mode 100644
index 0000000000..f4b66380ea
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/func.h
@@ -0,0 +1,1445 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <vector>
+#include <string>
+#include <stack>
+#include <utility>
+#include <algorithm>
+#include <iostream>
+#include <functional>
+#include "common/refcnt.hpp"
+#include "common/bigint.hpp"
+#include "common/refint.h"
+#include "parser/srcread.h"
+#include "parser/lexer.h"
+#include "parser/symtable.h"
+
+namespace funC {
+
+extern int verbosity;
+extern bool op_rewrite_comments;
+
+constexpr int optimize_depth = 12;
+
+enum Keyword {
+  _Eof = -1,
+  _Ident = 0,
+  _Number,
+  _Special,
+  _String,
+  _Return = 0x80,
+  _Var,
+  _Repeat,
+  _Do,
+  _While,
+  _Until,
+  _If,
+  _Ifnot,
+  _Then,
+  _Else,
+  _Elseif,
+  _Elseifnot,
+  _Eq,
+  _Neq,
+  _Leq,
+  _Geq,
+  _Spaceship,
+  _Lshift,
+  _Rshift,
+  _RshiftR,
+  _RshiftC,
+  _DivR,
+  _DivC,
+  _DivMod,
+  _PlusLet,
+  _MinusLet,
+  _TimesLet,
+  _DivLet,
+  _DivRLet,
+  _DivCLet,
+  _ModLet,
+  _LshiftLet,
+  _RshiftLet,
+  _RshiftRLet,
+  _RshiftCLet,
+  _Int,
+  _Cell,
+  _Slice,
+  _Builder,
+  _Cont,
+  _Tuple,
+  _Type,
+  _Mapsto,
+  _Asm,
+  _Impure,
+  _Extern,
+  _MethodId,
+  _Operator,
+  _Infix,
+  _Infixl,
+  _Infixr
+};
+
+void define_keywords();
+
+class IdSc {
+  int cls;
+
+ public:
+  enum { undef = 0, dotid = 1, tildeid = 2 };
+  IdSc(int _cls = undef) : cls(_cls) {
+  }
+  operator int() {
+    return cls;
+  }
+};
+
+// symbol subclass:
+// 1 = begins with . (a const method)
+// 2 = begins with ~ (a non-const method)
+// 0 = else
+
+/*
+ * 
+ *   TYPE EXPRESSIONS
+ * 
+ */
+
+struct TypeExpr {
+  enum te_type { te_Unknown, te_Indirect, te_Atomic, te_Tensor, te_Map, te_Type, te_ForAll } constr;
+  enum {
+    _Int = Keyword::_Int,
+    _Cell = Keyword::_Cell,
+    _Slice = Keyword::_Slice,
+    _Builder = Keyword::_Builder,
+    _Cont = Keyword::_Cont,
+    _Tuple = Keyword::_Tuple,
+    _Type = Keyword::_Type
+  };
+  int value;
+  int minw, maxw;
+  static constexpr int w_inf = 1023;
+  std::vector<TypeExpr*> args;
+  TypeExpr(te_type _constr, int _val = 0) : constr(_constr), value(_val), minw(0), maxw(w_inf) {
+  }
+  TypeExpr(te_type _constr, int _val, int width) : constr(_constr), value(_val), minw(width), maxw(width) {
+  }
+  TypeExpr(te_type _constr, std::vector<TypeExpr*> list)
+      : constr(_constr), value((int)list.size()), args(std::move(list)) {
+    compute_width();
+  }
+  TypeExpr(te_type _constr, std::initializer_list<TypeExpr*> list)
+      : constr(_constr), value((int)list.size()), args(std::move(list)) {
+    compute_width();
+  }
+  TypeExpr(te_type _constr, TypeExpr* elem0, std::vector<TypeExpr*> list)
+      : constr(_constr), value((int)list.size() + 1), args{elem0} {
+    args.insert(args.end(), list.begin(), list.end());
+    compute_width();
+  }
+  TypeExpr(te_type _constr, TypeExpr* elem0, std::initializer_list<TypeExpr*> list)
+      : constr(_constr), value((int)list.size() + 1), args{elem0} {
+    args.insert(args.end(), list.begin(), list.end());
+    compute_width();
+  }
+  bool is_atomic() const {
+    return constr == te_Atomic;
+  }
+  bool is_atomic(int v) const {
+    return constr == te_Atomic && value == v;
+  }
+  bool is_int() const {
+    return is_atomic(_Int);
+  }
+  bool has_fixed_width() const {
+    return minw == maxw;
+  }
+  int get_width() const {
+    return has_fixed_width() ? minw : -1;
+  }
+  void compute_width();
+  bool recompute_width();
+  void show_width(std::ostream& os);
+  std::ostream& print(std::ostream& os, int prio = 0);
+  void replace_with(TypeExpr* te2);
+  int extract_components(std::vector<TypeExpr*>& comp_list);
+  static int holes, type_vars;
+  static TypeExpr* new_hole() {
+    return new TypeExpr{te_Unknown, ++holes};
+  }
+  static TypeExpr* new_hole(int width) {
+    return new TypeExpr{te_Unknown, ++holes, width};
+  }
+  static TypeExpr* new_unit() {
+    return new TypeExpr{te_Tensor, 0, 0};
+  }
+  static TypeExpr* new_atomic(int value) {
+    return new TypeExpr{te_Atomic, value, 1};
+  }
+  static TypeExpr* new_map(TypeExpr* from, TypeExpr* to);
+  static TypeExpr* new_func() {
+    return new_map(new_hole(), new_hole());
+  }
+  static TypeExpr* new_tensor(std::vector<TypeExpr*> list, bool red = true) {
+    return red && list.size() == 1 ? list[0] : new TypeExpr{te_Tensor, std::move(list)};
+  }
+  static TypeExpr* new_tensor(std::initializer_list<TypeExpr*> list) {
+    return new TypeExpr{te_Tensor, std::move(list)};
+  }
+  static TypeExpr* new_tensor(TypeExpr* te1, TypeExpr* te2) {
+    return new_tensor({te1, te2});
+  }
+  static TypeExpr* new_tensor(TypeExpr* te1, TypeExpr* te2, TypeExpr* te3) {
+    return new_tensor({te1, te2, te3});
+  }
+  static TypeExpr* new_var() {
+    return new TypeExpr{te_Unknown, --type_vars, 1};
+  }
+  static TypeExpr* new_forall(std::vector<TypeExpr*> list, TypeExpr* body) {
+    return new TypeExpr{te_ForAll, body, std::move(list)};
+  }
+  static TypeExpr* new_forall(std::initializer_list<TypeExpr*> list, TypeExpr* body) {
+    return new TypeExpr{te_ForAll, body, std::move(list)};
+  }
+  static bool remove_indirect(TypeExpr*& te, TypeExpr* forbidden = nullptr);
+  static bool remove_forall(TypeExpr*& te);
+  static bool remove_forall_in(TypeExpr*& te, TypeExpr* te2, const std::vector<TypeExpr*>& new_vars);
+};
+
+std::ostream& operator<<(std::ostream& os, TypeExpr* type_expr);
+
+struct UnifyError {
+  TypeExpr* te1;
+  TypeExpr* te2;
+  std::string msg;
+  UnifyError(TypeExpr* _te1, TypeExpr* _te2, std::string _msg = "") : te1(_te1), te2(_te2), msg(_msg) {
+  }
+  void print_message(std::ostream& os) const;
+  std::string message() const;
+};
+
+std::ostream& operator<<(std::ostream& os, const UnifyError& ue);
+
+void unify(TypeExpr*& te1, TypeExpr*& te2);
+
+// extern int TypeExpr::holes;
+
+/*
+ * 
+ *   ABSTRACT CODE
+ * 
+ */
+
+using src::Lexem;
+using src::SrcLocation;
+using sym::SymDef;
+using sym::sym_idx_t;
+using sym::var_idx_t;
+using const_idx_t = int;
+
+struct TmpVar {
+  TypeExpr* v_type;
+  var_idx_t idx;
+  enum { _In = 1, _Named = 2, _Tmp = 4, _UniqueName = 0x20 };
+  int cls;
+  sym_idx_t name;
+  int coord;
+  std::unique_ptr<SrcLocation> where;
+  TmpVar(var_idx_t _idx, int _cls, TypeExpr* _type = 0, SymDef* sym = 0, const SrcLocation* loc = 0);
+  void show(std::ostream& os, int omit_idx = 0) const;
+  void dump(std::ostream& os) const;
+  void set_location(const SrcLocation& loc);
+};
+
+struct VarDescr {
+  var_idx_t idx;
+  enum { _Last = 1, _Unused = 2 };
+  int flags;
+  enum {
+    _Const = 16,
+    _Int = 32,
+    _Zero = 64,
+    _NonZero = 128,
+    _Pos = 256,
+    _Neg = 512,
+    _Bool = 1024,
+    _Bit = 2048,
+    _Finite = 4096,
+    _Nan = 8192,
+    _Even = 16384,
+    _Odd = 32768,
+    _Null = (1 << 16),
+    _NotNull = (1 << 17)
+  };
+  static constexpr int ConstZero = _Int | _Zero | _Pos | _Neg | _Bool | _Bit | _Finite | _Even | _NotNull;
+  static constexpr int ConstOne = _Int | _NonZero | _Pos | _Bit | _Finite | _Odd | _NotNull;
+  static constexpr int ConstTrue = _Int | _NonZero | _Neg | _Bool | _Finite | _Odd | _NotNull;
+  static constexpr int ValBit = ConstZero & ConstOne;
+  static constexpr int ValBool = ConstZero & ConstTrue;
+  static constexpr int FiniteInt = _Int | _Finite | _NotNull;
+  static constexpr int FiniteUInt = FiniteInt | _Pos;
+  int val;
+  td::RefInt256 int_const;
+  VarDescr(var_idx_t _idx = -1, int _flags = 0, int _val = 0) : idx(_idx), flags(_flags), val(_val) {
+  }
+  bool operator<(var_idx_t other_idx) const {
+    return idx < other_idx;
+  }
+  bool is_unused() const {
+    return flags & _Unused;
+  }
+  bool is_last() const {
+    return flags & _Last;
+  }
+  bool always_true() const {
+    return val & _NonZero;
+  }
+  bool always_false() const {
+    return val & _Zero;
+  }
+  bool always_nonzero() const {
+    return val & _NonZero;
+  }
+  bool always_zero() const {
+    return val & _Zero;
+  }
+  bool always_even() const {
+    return val & _Even;
+  }
+  bool always_odd() const {
+    return val & _Odd;
+  }
+  bool always_null() const {
+    return val & _Null;
+  }
+  bool always_not_null() const {
+    return val & _NotNull;
+  }
+  bool is_const() const {
+    return val & _Const;
+  }
+  bool is_int_const() const {
+    return (val & (_Int | _Const)) == (_Int | _Const);
+  }
+  bool always_nonpos() const {
+    return val & _Neg;
+  }
+  bool always_nonneg() const {
+    return val & _Pos;
+  }
+  bool always_pos() const {
+    return (val & (_Pos | _NonZero)) == (_Pos | _NonZero);
+  }
+  bool always_neg() const {
+    return (val & (_Neg | _NonZero)) == (_Neg | _NonZero);
+  }
+  bool always_finite() const {
+    return val & _Finite;
+  }
+  bool always_less(const VarDescr& other) const;
+  bool always_leq(const VarDescr& other) const;
+  bool always_greater(const VarDescr& other) const;
+  bool always_geq(const VarDescr& other) const;
+  bool always_equal(const VarDescr& other) const;
+  bool always_neq(const VarDescr& other) const;
+  void unused() {
+    flags |= _Unused;
+  }
+  void clear_unused() {
+    flags &= ~_Unused;
+  }
+  void set_const(long long value);
+  void set_const(td::RefInt256 value);
+  void set_const_nan();
+  void operator+=(const VarDescr& y) {
+    flags &= y.flags;
+  }
+  void operator|=(const VarDescr& y);
+  void operator&=(const VarDescr& y);
+  void set_value(const VarDescr& y);
+  void set_value(VarDescr&& y);
+  void set_value(const VarDescr* y) {
+    if (y) {
+      set_value(*y);
+    }
+  }
+  void clear_value();
+  void show_value(std::ostream& os) const;
+  void show(std::ostream& os, const char* var_name = nullptr) const;
+};
+
+inline std::ostream& operator<<(std::ostream& os, const VarDescr& vd) {
+  vd.show(os);
+  return os;
+}
+
+struct VarDescrList {
+  std::vector<VarDescr> list;
+  VarDescrList() : list() {
+  }
+  VarDescrList(const std::vector<VarDescr>& _list) : list(_list) {
+  }
+  VarDescrList(std::vector<VarDescr>&& _list) : list(std::move(_list)) {
+  }
+  std::size_t size() const {
+    return list.size();
+  }
+  VarDescr* operator[](var_idx_t idx);
+  const VarDescr* operator[](var_idx_t idx) const;
+  VarDescrList operator+(const VarDescrList& y) const;
+  VarDescrList& operator+=(const VarDescrList& y);
+  VarDescrList& clear_last();
+  VarDescrList& operator+=(var_idx_t idx) {
+    return add_var(idx);
+  }
+  VarDescrList& operator+=(const std::vector<var_idx_t>& idx_list) {
+    return add_vars(idx_list);
+  }
+  VarDescrList& add_var(var_idx_t idx, bool unused = false);
+  VarDescrList& add_vars(const std::vector<var_idx_t>& idx_list, bool unused = false);
+  VarDescrList& operator-=(const std::vector<var_idx_t>& idx_list);
+  VarDescrList& operator-=(var_idx_t idx);
+  std::size_t count(const std::vector<var_idx_t> idx_list) const;
+  std::size_t count_used(const std::vector<var_idx_t> idx_list) const;
+  VarDescr& add(var_idx_t idx);
+  VarDescr& add_newval(var_idx_t idx);
+  VarDescrList& operator&=(const VarDescrList& values);
+  VarDescrList& import_values(const VarDescrList& values);
+  VarDescrList operator|(const VarDescrList& y) const;
+  VarDescrList& operator|=(const VarDescrList& values);
+  void show(std::ostream& os) const;
+};
+
+inline std::ostream& operator<<(std::ostream& os, const VarDescrList& values) {
+  values.show(os);
+  return os;
+}
+
+struct CodeBlob;
+
+template <typename T>
+class ListIterator {
+  T* ptr;
+
+ public:
+  ListIterator() : ptr(nullptr) {
+  }
+  ListIterator(T* _ptr) : ptr(_ptr) {
+  }
+  ListIterator& operator++() {
+    ptr = ptr->next.get();
+    return *this;
+  }
+  ListIterator& operator++(int) {
+    T* z = ptr;
+    ptr = ptr->next.get();
+    return ListIterator{z};
+  }
+  T& operator*() const {
+    return *ptr;
+  }
+  T* operator->() const {
+    return ptr;
+  }
+  bool operator==(const ListIterator& y) const {
+    return ptr == y.ptr;
+  }
+  bool operator!=(const ListIterator& y) const {
+    return ptr != y.ptr;
+  }
+};
+
+struct Stack;
+
+struct Op {
+  enum {
+    _Undef,
+    _Nop,
+    _Call,
+    _CallInd,
+    _Let,
+    _IntConst,
+    _GlobVar,
+    _Import,
+    _Return,
+    _If,
+    _While,
+    _Until,
+    _Repeat,
+    _Again
+  };
+  int cl;
+  enum { _Disabled = 1, _Reachable = 2, _NoReturn = 4, _ImpureR = 8, _ImpureW = 16, _Impure = 24 };
+  int flags;
+  std::unique_ptr<Op> next;
+  SymDef* fun_ref;
+  SrcLocation where;
+  VarDescrList var_info;
+  std::vector<VarDescr> args;
+  std::vector<var_idx_t> left, right;
+  std::unique_ptr<Op> block0, block1;
+  td::RefInt256 int_const;
+  Op(const SrcLocation& _where = {}, int _cl = _Undef) : cl(_cl), flags(0), fun_ref(nullptr), where(_where) {
+  }
+  Op(const SrcLocation& _where, int _cl, const std::vector<var_idx_t>& _left)
+      : cl(_cl), flags(0), fun_ref(nullptr), where(_where), left(_left) {
+  }
+  Op(const SrcLocation& _where, int _cl, std::vector<var_idx_t>&& _left)
+      : cl(_cl), flags(0), fun_ref(nullptr), where(_where), left(std::move(_left)) {
+  }
+  Op(const SrcLocation& _where, int _cl, const std::vector<var_idx_t>& _left, td::RefInt256 _const)
+      : cl(_cl), flags(0), fun_ref(nullptr), where(_where), left(_left), int_const(_const) {
+  }
+  Op(const SrcLocation& _where, int _cl, const std::vector<var_idx_t>& _left, const std::vector<var_idx_t>& _right,
+     SymDef* _fun = nullptr)
+      : cl(_cl), flags(0), fun_ref(_fun), where(_where), left(_left), right(_right) {
+  }
+  Op(const SrcLocation& _where, int _cl, std::vector<var_idx_t>&& _left, std::vector<var_idx_t>&& _right,
+     SymDef* _fun = nullptr)
+      : cl(_cl), flags(0), fun_ref(_fun), where(_where), left(std::move(_left)), right(std::move(_right)) {
+  }
+  bool disabled() const {
+    return flags & _Disabled;
+  }
+  bool enabled() const {
+    return !disabled();
+  }
+  void disable() {
+    flags |= _Disabled;
+  }
+  bool unreachable() {
+    return !(flags & _Reachable);
+  }
+  void flags_set_clear(int set, int clear);
+  void show(std::ostream& os, const std::vector<TmpVar>& vars, std::string pfx = "", int mode = 0) const;
+  void show_var_list(std::ostream& os, const std::vector<var_idx_t>& idx_list, const std::vector<TmpVar>& vars) const;
+  void show_var_list(std::ostream& os, const std::vector<VarDescr>& list, const std::vector<TmpVar>& vars) const;
+  static void show_block(std::ostream& os, const Op* block, const std::vector<TmpVar>& vars, std::string pfx = "",
+                         int mode = 0);
+  void split_vars(const std::vector<TmpVar>& vars);
+  static void split_var_list(std::vector<var_idx_t>& var_list, const std::vector<TmpVar>& vars);
+  bool compute_used_vars(const CodeBlob& code, bool edit);
+  bool std_compute_used_vars(bool disabled = false);
+  bool set_var_info(const VarDescrList& new_var_info);
+  bool set_var_info(VarDescrList&& new_var_info);
+  bool set_var_info_except(const VarDescrList& new_var_info, const std::vector<var_idx_t>& var_list);
+  bool set_var_info_except(VarDescrList&& new_var_info, const std::vector<var_idx_t>& var_list);
+  void prepare_args(VarDescrList values);
+  VarDescrList fwd_analyze(VarDescrList values);
+  bool set_noreturn(bool nr);
+  bool mark_noreturn();
+  bool noreturn() const {
+    return flags & _NoReturn;
+  }
+  bool is_empty() const {
+    return cl == _Nop && !next;
+  }
+  bool is_pure() const {
+    return !(flags & _Impure);
+  }
+  bool generate_code_step(Stack& stack);
+  bool generate_code_all(Stack& stack);
+  Op& last() {
+    return next ? next->last() : *this;
+  }
+  const Op& last() const {
+    return next ? next->last() : *this;
+  }
+  ListIterator<Op> begin() {
+    return ListIterator<Op>{this};
+  }
+  ListIterator<Op> end() const {
+    return ListIterator<Op>{};
+  }
+  ListIterator<const Op> cbegin() {
+    return ListIterator<const Op>{this};
+  }
+  ListIterator<const Op> cend() const {
+    return ListIterator<const Op>{};
+  }
+};
+
+inline ListIterator<Op> begin(const std::unique_ptr<Op>& op_list) {
+  return ListIterator<Op>{op_list.get()};
+}
+
+inline ListIterator<Op> end(const std::unique_ptr<Op>& op_list) {
+  return ListIterator<Op>{};
+}
+
+inline ListIterator<const Op> cbegin(const Op* op_list) {
+  return ListIterator<const Op>{op_list};
+}
+
+inline ListIterator<const Op> cend(const Op* op_list) {
+  return ListIterator<const Op>{};
+}
+
+inline ListIterator<const Op> begin(const Op* op_list) {
+  return ListIterator<const Op>{op_list};
+}
+
+inline ListIterator<const Op> end(const Op* op_list) {
+  return ListIterator<const Op>{};
+}
+
+inline ListIterator<Op> begin(Op* op_list) {
+  return ListIterator<Op>{op_list};
+}
+
+inline ListIterator<Op> end(Op* op_list) {
+  return ListIterator<Op>{};
+}
+
+typedef std::tuple<TypeExpr*, SymDef*, SrcLocation> FormalArg;
+typedef std::vector<FormalArg> FormalArgList;
+
+struct AsmOpList;
+
+struct CodeBlob {
+  int var_cnt, in_var_cnt, op_cnt;
+  TypeExpr* ret_type;
+  std::string name;
+  SrcLocation loc;
+  std::vector<TmpVar> vars;
+  std::unique_ptr<Op> ops;
+  std::unique_ptr<Op>* cur_ops;
+  std::stack<std::unique_ptr<Op>*> cur_ops_stack;
+  CodeBlob(TypeExpr* ret = nullptr) : var_cnt(0), in_var_cnt(0), op_cnt(0), ret_type(ret), cur_ops(&ops) {
+  }
+  template <typename... Args>
+  Op& emplace_back(const Args&... args) {
+    Op& res = *(*cur_ops = std::make_unique<Op>(args...));
+    cur_ops = &(res.next);
+    return res;
+  }
+  bool import_params(FormalArgList arg_list);
+  var_idx_t create_var(int cls, TypeExpr* var_type = 0, SymDef* sym = 0, const SrcLocation* loc = 0);
+  int split_vars(bool strict = false);
+  bool compute_used_code_vars();
+  bool compute_used_code_vars(std::unique_ptr<Op>& ops, const VarDescrList& var_info, bool edit) const;
+  void print(std::ostream& os, int flags = 0) const;
+  void push_set_cur(std::unique_ptr<Op>& new_cur_ops) {
+    cur_ops_stack.push(cur_ops);
+    cur_ops = &new_cur_ops;
+  }
+  void close_blk(const SrcLocation& location) {
+    *cur_ops = std::make_unique<Op>(location, Op::_Nop);
+  }
+  void pop_cur() {
+    cur_ops = cur_ops_stack.top();
+    cur_ops_stack.pop();
+  }
+  void close_pop_cur(const SrcLocation& location) {
+    close_blk(location);
+    pop_cur();
+  }
+  void simplify_var_types();
+  void flags_set_clear(int set, int clear);
+  void prune_unreachable_code();
+  void fwd_analyze();
+  void mark_noreturn();
+  void generate_code(AsmOpList& out_list, int mode = 0);
+  void generate_code(std::ostream& os, int mode = 0, int indent = 0);
+};
+
+/*
+ *
+ *   SYMBOL VALUES
+ * 
+ */
+
+struct SymVal : sym::SymValBase {
+  TypeExpr* sym_type;
+  td::RefInt256 method_id;
+  bool impure;
+  SymVal(int _type, int _idx, TypeExpr* _stype = nullptr, bool _impure = false)
+      : sym::SymValBase(_type, _idx), sym_type(_stype), impure(_impure) {
+  }
+  ~SymVal() override = default;
+  TypeExpr* get_type() const {
+    return sym_type;
+  }
+  virtual const std::vector<int>* get_arg_order() const {
+    return nullptr;
+  }
+  virtual const std::vector<int>* get_ret_order() const {
+    return nullptr;
+  }
+};
+
+struct SymValFunc : SymVal {
+  std::vector<int> arg_order, ret_order;
+  ~SymValFunc() override = default;
+  SymValFunc(int val, TypeExpr* _ft, bool _impure = false) : SymVal(_Func, val, _ft, _impure) {
+  }
+  SymValFunc(int val, TypeExpr* _ft, std::initializer_list<int> _arg_order, std::initializer_list<int> _ret_order = {},
+             bool _impure = false)
+      : SymVal(_Func, val, _ft, _impure), arg_order(_arg_order), ret_order(_ret_order) {
+  }
+
+  const std::vector<int>* get_arg_order() const override {
+    return arg_order.empty() ? nullptr : &arg_order;
+  }
+  const std::vector<int>* get_ret_order() const override {
+    return ret_order.empty() ? nullptr : &ret_order;
+  }
+};
+
+struct SymValCodeFunc : SymValFunc {
+  CodeBlob* code;
+  ~SymValCodeFunc() override = default;
+  SymValCodeFunc(int val, TypeExpr* _ft, bool _impure = false) : SymValFunc(val, _ft, _impure), code(nullptr) {
+  }
+};
+
+extern int glob_func_cnt, undef_func_cnt;
+extern std::vector<SymDef*> glob_func;
+
+/*
+ * 
+ *   PARSE SOURCE
+ * 
+ */
+
+// defined in parse-func.cpp
+bool parse_source(std::istream* is, const src::FileDescr* fdescr);
+bool parse_source_file(const char* filename);
+bool parse_source_stdin();
+
+/*
+ * 
+ *   EXPRESSIONS
+ * 
+ */
+
+struct Expr {
+  enum {
+    _None,
+    _Apply,
+    _VarApply,
+    _TypeApply,
+    _Tuple,
+    _Const,
+    _Var,
+    _Glob,
+    _Letop,
+    _LetFirst,
+    _Hole,
+    _Type,
+    _CondExpr
+  };
+  int cls;
+  int val{0};
+  enum { _IsType = 1, _IsRvalue = 2, _IsLvalue = 4, _IsHole = 8, _IsNewVar = 16, _IsImpure = 32 };
+  int flags{0};
+  SrcLocation here;
+  td::RefInt256 intval;
+  SymDef* sym{nullptr};
+  TypeExpr* e_type{nullptr};
+  std::vector<Expr*> args;
+  Expr(int c = _None) : cls(c) {
+  }
+  Expr(int c, const SrcLocation& loc) : cls(c), here(loc) {
+  }
+  Expr(int c, std::vector<Expr*> _args) : cls(c), args(std::move(_args)) {
+  }
+  Expr(int c, std::initializer_list<Expr*> _arglist) : cls(c), args(std::move(_arglist)) {
+  }
+  Expr(int c, SymDef* _sym, std::initializer_list<Expr*> _arglist) : cls(c), sym(_sym), args(std::move(_arglist)) {
+  }
+  Expr(int c, SymDef* _sym, std::vector<Expr*> _arglist) : cls(c), sym(_sym), args(std::move(_arglist)) {
+  }
+  Expr(int c, sym_idx_t name_idx, std::initializer_list<Expr*> _arglist);
+  ~Expr() {
+    for (auto& arg_ptr : args) {
+      delete arg_ptr;
+    }
+  }
+  Expr* copy() const;
+  void pb_arg(Expr* expr) {
+    args.push_back(expr);
+  }
+  void set_val(int _val) {
+    val = _val;
+  }
+  bool is_rvalue() const {
+    return flags & _IsRvalue;
+  }
+  bool is_lvalue() const {
+    return flags & _IsLvalue;
+  }
+  bool is_type() const {
+    return flags & _IsType;
+  }
+  void chk_rvalue(const Lexem& lem) const;
+  void chk_lvalue(const Lexem& lem) const;
+  void chk_type(const Lexem& lem) const;
+  bool deduce_type(const Lexem& lem);
+  void set_location(const SrcLocation& loc) {
+    here = loc;
+  }
+  const SrcLocation& get_location() const {
+    return here;
+  }
+  int define_new_vars(CodeBlob& code);
+  int predefine_vars();
+  std::vector<var_idx_t> pre_compile(CodeBlob& code) const;
+};
+
+/*
+ * 
+ *   GENERATE CODE
+ * 
+ */
+
+typedef std::vector<var_idx_t> StackLayout;
+typedef std::pair<var_idx_t, const_idx_t> var_const_idx_t;
+typedef std::vector<var_const_idx_t> StackLayoutExt;
+constexpr const_idx_t not_const = -1;
+using Const = td::RefInt256;
+
+struct AsmOp {
+  enum Type { a_none, a_xchg, a_push, a_pop, a_const, a_custom, a_magic };
+  int t{a_none};
+  int indent{0};
+  int a, b, c;
+  std::string op;
+  struct SReg {
+    int idx;
+    SReg(int _idx) : idx(_idx) {
+    }
+  };
+  AsmOp() = default;
+  AsmOp(int _t) : t(_t) {
+  }
+  AsmOp(int _t, std::string _op) : t(_t), op(std::move(_op)) {
+  }
+  AsmOp(int _t, int _a) : t(_t), a(_a) {
+  }
+  AsmOp(int _t, int _a, std::string _op) : t(_t), a(_a), op(std::move(_op)) {
+  }
+  AsmOp(int _t, int _a, int _b) : t(_t), a(_a), b(_b) {
+  }
+  AsmOp(int _t, int _a, int _b, std::string _op) : t(_t), a(_a), b(_b), op(std::move(_op)) {
+  }
+  AsmOp(int _t, int _a, int _b, int _c) : t(_t), a(_a), b(_b), c(_c) {
+  }
+  AsmOp(int _t, int _a, int _b, int _c, std::string _op) : t(_t), a(_a), b(_b), c(_c), op(std::move(_op)) {
+  }
+  void out(std::ostream& os) const;
+  void out_indent_nl(std::ostream& os, bool no_nl = false) const;
+  std::string to_string() const;
+  bool is_nop() const {
+    return t == a_none && op.empty();
+  }
+  bool is_comment() const {
+    return t == a_none && !op.empty();
+  }
+  bool is_custom() const {
+    return t == a_custom;
+  }
+  bool is_very_custom() const {
+    return is_custom() && a >= 255;
+  }
+  bool is_push() const {
+    return t == a_push;
+  }
+  bool is_push(int x) const {
+    return is_push() && a == x;
+  }
+  bool is_push(int* x) const {
+    *x = a;
+    return is_push();
+  }
+  bool is_pop() const {
+    return t == a_pop;
+  }
+  bool is_pop(int x) const {
+    return is_pop() && a == x;
+  }
+  bool is_xchg() const {
+    return t == a_xchg;
+  }
+  bool is_xchg(int x, int y) const {
+    return is_xchg() && b == y && a == x;
+  }
+  bool is_xchg(int* x, int* y) const {
+    *x = a;
+    *y = b;
+    return is_xchg();
+  }
+  bool is_swap() const {
+    return is_xchg(0, 1);
+  }
+  bool is_const() const {
+    return t == a_const && !a && b == 1;
+  }
+  bool is_gconst() const {
+    return (t == a_const || t == a_custom) && !a && b == 1;
+  }
+  static AsmOp Nop() {
+    return AsmOp(a_none);
+  }
+  static AsmOp Xchg(int a, int b = 0) {
+    return a == b ? AsmOp(a_none) : (a < b ? AsmOp(a_xchg, a, b) : AsmOp(a_xchg, b, a));
+  }
+  static AsmOp Push(int a) {
+    return AsmOp(a_push, a);
+  }
+  static AsmOp Pop(int a = 0) {
+    return AsmOp(a_pop, a);
+  }
+  static AsmOp Xchg2(int a, int b) {
+    return make_stk2(a, b, "XCHG2", 0);
+  }
+  static AsmOp XcPu(int a, int b) {
+    return make_stk2(a, b, "XCPU", 1);
+  }
+  static AsmOp PuXc(int a, int b) {
+    return make_stk2(a, b, "PUXC", 1);
+  }
+  static AsmOp Push2(int a, int b) {
+    return make_stk2(a, b, "PUSH2", 2);
+  }
+  static AsmOp Xchg3(int a, int b, int c) {
+    return make_stk3(a, b, c, "XCHG3", 0);
+  }
+  static AsmOp Xc2Pu(int a, int b, int c) {
+    return make_stk3(a, b, c, "XC2PU", 1);
+  }
+  static AsmOp XcPuXc(int a, int b, int c) {
+    return make_stk3(a, b, c, "XCPUXC", 1);
+  }
+  static AsmOp XcPu2(int a, int b, int c) {
+    return make_stk3(a, b, c, "XCPU2", 3);
+  }
+  static AsmOp PuXc2(int a, int b, int c) {
+    return make_stk3(a, b, c, "PUXC2", 3);
+  }
+  static AsmOp PuXcPu(int a, int b, int c) {
+    return make_stk3(a, b, c, "PUXCPU", 3);
+  }
+  static AsmOp Pu2Xc(int a, int b, int c) {
+    return make_stk3(a, b, c, "PU2XC", 3);
+  }
+  static AsmOp Push3(int a, int b, int c) {
+    return make_stk3(a, b, c, "PUSH3", 3);
+  }
+  static AsmOp BlkSwap(int a, int b);
+  static AsmOp BlkPush(int a, int b);
+  static AsmOp BlkDrop(int a);
+  static AsmOp BlkReverse(int a, int b);
+  static AsmOp make_stk2(int a, int b, const char* str, int delta);
+  static AsmOp make_stk3(int a, int b, int c, const char* str, int delta);
+  static AsmOp IntConst(td::RefInt256 value);
+  static AsmOp Const(std::string push_op) {
+    return AsmOp(a_const, 0, 1, std::move(push_op));
+  }
+  static AsmOp Const(int arg, std::string push_op);
+  static AsmOp Comment(std::string comment) {
+    return AsmOp(a_none, std::string{"// "} + comment);
+  }
+  static AsmOp Custom(std::string custom_op) {
+    return AsmOp(a_custom, 255, 255, custom_op);
+  }
+  static AsmOp Parse(std::string custom_op);
+  static AsmOp Custom(std::string custom_op, int args, int retv = 1) {
+    return AsmOp(a_custom, args, retv, custom_op);
+  }
+  static AsmOp Parse(std::string custom_op, int args, int retv = 1);
+};
+
+inline std::ostream& operator<<(std::ostream& os, const AsmOp& op) {
+  op.out(os);
+  return os;
+}
+
+std::ostream& operator<<(std::ostream& os, AsmOp::SReg stack_reg);
+
+struct AsmOpList {
+  std::vector<AsmOp> list_;
+  int indent_{0};
+  const std::vector<TmpVar>* var_names_{nullptr};
+  std::vector<Const> constants_;
+  void out(std::ostream& os, int mode = 0) const;
+  AsmOpList(int indent = 0, const std::vector<TmpVar>* var_names = nullptr) : indent_(indent), var_names_(var_names) {
+  }
+  template <typename... Args>
+  AsmOpList& add(Args&&... args) {
+    list_.emplace_back(std::forward<Args>(args)...);
+    adjust_last();
+    return *this;
+  }
+  bool append(const AsmOp& op) {
+    list_.push_back(op);
+    adjust_last();
+    return true;
+  }
+  bool append(const std::vector<AsmOp>& ops);
+  bool append(std::initializer_list<AsmOp> ops) {
+    return append(std::vector<AsmOp>(std::move(ops)));
+  }
+  AsmOpList& operator<<(const AsmOp& op) {
+    return add(op);
+  }
+  AsmOpList& operator<<(AsmOp&& op) {
+    return add(std::move(op));
+  }
+  AsmOpList& operator<<(std::string str) {
+    return add(AsmOp::Type::a_custom, 255, 255, str);
+  }
+  const_idx_t register_const(Const new_const);
+  Const get_const(const_idx_t idx);
+  void show_var(std::ostream& os, var_idx_t idx) const;
+  void show_var_ext(std::ostream& os, std::pair<var_idx_t, const_idx_t> idx_pair) const;
+  void adjust_last() {
+    if (list_.back().is_nop()) {
+      list_.pop_back();
+    } else {
+      list_.back().indent = indent_;
+    }
+  }
+  void indent() {
+    ++indent_;
+  }
+  void undent() {
+    --indent_;
+  }
+  void set_indent(int new_indent) {
+    indent_ = new_indent;
+  }
+};
+
+inline std::ostream& operator<<(std::ostream& os, const AsmOpList& op_list) {
+  op_list.out(os);
+  return os;
+}
+
+class IndentGuard {
+  AsmOpList& aol_;
+
+ public:
+  IndentGuard(AsmOpList& aol) : aol_(aol) {
+    aol.indent();
+  }
+  ~IndentGuard() {
+    aol_.undent();
+  }
+};
+
+struct AsmOpCons {
+  std::unique_ptr<AsmOp> car;
+  std::unique_ptr<AsmOpCons> cdr;
+  AsmOpCons(std::unique_ptr<AsmOp> head, std::unique_ptr<AsmOpCons> tail) : car(std::move(head)), cdr(std::move(tail)) {
+  }
+  static std::unique_ptr<AsmOpCons> cons(std::unique_ptr<AsmOp> head, std::unique_ptr<AsmOpCons> tail) {
+    return std::make_unique<AsmOpCons>(std::move(head), std::move(tail));
+  }
+};
+
+using AsmOpConsList = std::unique_ptr<AsmOpCons>;
+
+int is_pos_pow2(td::RefInt256 x);
+int is_neg_pow2(td::RefInt256 x);
+
+/*
+ * 
+ *  STACK TRANSFORMS
+ * 
+ */
+
+/*
+A stack transform is a map f:N={0,1,...} -> N, such that f(x) = x + d_f for almost all x:N and for a fixed d_f:N.
+They form a monoid under composition: (fg)(x)=f(g(x)).
+They act on stacks S on the right: Sf=S', such that S'[n]=S[f(n)].
+
+A stack transform f is determined by d_f and the finite set A of all pairs (x,y), such that x>=d_f, f(x-d_f) = y and y<>x. They are listed in increasing order by x.
+*/
+struct StackTransform {
+  enum { max_n = 16, inf_x = 0x7fffffff, c_start = -1000 };
+  int d{0}, n{0}, dp{0}, c{0};
+  bool invalid{false};
+  std::array<std::pair<short, short>, max_n> A;
+  StackTransform() = default;
+  // list of f(0),f(1),...,f(s); assumes next values are f(s)+1,f(s)+2,...
+  StackTransform(std::initializer_list<int> list);
+  StackTransform& operator=(std::initializer_list<int> list);
+  bool assign(const StackTransform& other);
+  static StackTransform id() {
+    return {};
+  }
+  bool invalidate() {
+    invalid = true;
+    return false;
+  }
+  bool is_valid() const {
+    return !invalid;
+  }
+  bool set_id() {
+    d = n = dp = c = 0;
+    invalid = false;
+    return true;
+  }
+  bool shift(int offs) {  // post-composes with x -> x + offs
+    d += offs;
+    return offs <= 0 || remove_negative();
+  }
+  bool remove_negative();
+  bool touch(int i) {
+    dp = std::max(dp, i + d + 1);
+    return true;
+  }
+  bool is_permutation() const;         // is f:N->N bijective ?
+  bool is_trivial_after(int x) const;  // f(x') = x' + d for all x' >= x
+  int preimage_count(int y) const;     // card f^{-1}(y)
+  std::vector<int> preimage(int y) const;
+  bool apply_xchg(int i, int j, bool relaxed = false);
+  bool apply_push(int i);
+  bool apply_pop(int i = 0);
+  bool apply_push_newconst();
+  bool apply(const StackTransform& other);     // this = this * other
+  bool preapply(const StackTransform& other);  // this = other * this
+  // c := a * b
+  static bool compose(const StackTransform& a, const StackTransform& b, StackTransform& c);
+  StackTransform& operator*=(const StackTransform& other);
+  StackTransform operator*(const StackTransform& b) const &;
+  bool equal(const StackTransform& other, bool relaxed = false) const;
+  bool almost_equal(const StackTransform& other) const {
+    return equal(other, true);
+  }
+  bool operator==(const StackTransform& other) const {
+    return dp == other.dp && almost_equal(other);
+  }
+  bool operator<=(const StackTransform& other) const {
+    return dp <= other.dp && almost_equal(other);
+  }
+  bool operator>=(const StackTransform& other) const {
+    return dp >= other.dp && almost_equal(other);
+  }
+  int get(int i) const;
+  int touch_get(int i, bool relaxed = false) {
+    if (!relaxed) {
+      touch(i);
+    }
+    return get(i);
+  }
+  bool set(int i, int v, bool relaxed = false);
+  int operator()(int i) const {
+    return get(i);
+  }
+  class Pos {
+    StackTransform& t_;
+    int p_;
+
+   public:
+    Pos(StackTransform& t, int p) : t_(t), p_(p) {
+    }
+    Pos& operator=(const Pos& other) = delete;
+    operator int() const {
+      return t_.get(p_);
+    }
+    const Pos& operator=(int v) const {
+      t_.set(p_, v);
+      return *this;
+    }
+  };
+  Pos operator[](int i) {
+    return Pos(*this, i);
+  }
+  static const StackTransform rot;
+  static const StackTransform rot_rev;
+  bool is_id() const {
+    return is_valid() && !d && !n;
+  }
+  bool is_xchg(int i, int j) const;
+  bool is_xchg(int* i, int* j) const;
+  bool is_push(int i) const;
+  bool is_push(int* i) const;
+  bool is_pop(int i) const;
+  bool is_pop(int* i) const;
+  bool is_rot() const;
+  bool is_rotrev() const;
+  bool is_xchg2(int i, int j) const;
+  bool is_xchg2(int* i, int* j) const;
+  bool is_xcpu(int i, int j) const;
+  bool is_xcpu(int* i, int* j) const;
+  bool is_puxc(int i, int j) const;
+  bool is_puxc(int* i, int* j) const;
+  bool is_push2(int i, int j) const;
+  bool is_push2(int* i, int* j) const;
+  bool is_xchg3(int* i, int* j, int* k) const;
+  bool is_xc2pu(int* i, int* j, int* k) const;
+  bool is_xcpuxc(int* i, int* j, int* k) const;
+  bool is_xcpu2(int* i, int* j, int* k) const;
+  bool is_puxc2(int i, int j, int k) const;
+  bool is_puxc2(int* i, int* j, int* k) const;
+  bool is_puxcpu(int* i, int* j, int* k) const;
+  bool is_pu2xc(int i, int j, int k) const;
+  bool is_pu2xc(int* i, int* j, int* k) const;
+  bool is_push3(int i, int j, int k) const;
+  bool is_push3(int* i, int* j, int* k) const;
+  bool is_blkswap(int i, int j) const;
+  bool is_blkswap(int* i, int* j) const;
+  bool is_blkpush(int i, int j) const;
+  bool is_blkpush(int* i, int* j) const;
+  bool is_blkdrop(int* i) const;
+  bool is_reverse(int i, int j) const;
+  bool is_reverse(int* i, int* j) const;
+  bool is_nip_seq(int i, int j = 0) const;
+  bool is_nip_seq(int* i) const;
+  bool is_nip_seq(int* i, int* j) const;
+
+  void show(std::ostream& os, int mode = 0) const;
+
+  static StackTransform Xchg(int i, int j, bool relaxed = false);
+  static StackTransform Push(int i);
+  static StackTransform Pop(int i);
+
+ private:
+  int try_load(int& i, int offs = 0) const;  // returns A[i++].first + offs or inf_x
+  bool try_store(int x, int y);              // appends (x,y) to A
+};
+
+//extern const StackTransform StackTransform::rot, StackTransform::rot_rev;
+
+inline std::ostream& operator<<(std::ostream& os, const StackTransform& trans) {
+  trans.show(os);
+  return os;
+}
+
+bool apply_op(StackTransform& trans, const AsmOp& op);
+
+/*
+ * 
+ *   STACK OPERATION OPTIMIZER
+ * 
+ */
+
+struct Optimizer {
+  enum { n = optimize_depth };
+  AsmOpConsList code_;
+  int l_{0}, l2_{0}, p_, pb_, q_, indent_;
+  bool debug_{false};
+  std::unique_ptr<AsmOp> op_[n], oq_[n];
+  AsmOpCons* op_cons_[n];
+  int offs_[n];
+  StackTransform tr_[n];
+  Optimizer() {
+  }
+  Optimizer(bool debug) : debug_(debug) {
+  }
+  Optimizer(AsmOpConsList code, bool debug = false) : Optimizer(debug) {
+    set_code(std::move(code));
+  }
+  void set_code(AsmOpConsList code_);
+  void unpack();
+  void pack();
+  void apply();
+  bool find_at_least(int pb);
+  bool find();
+  bool optimize();
+  bool compute_stack_transforms();
+  bool say(std::string str) const;
+  bool show_stack_transforms() const;
+  void show_head() const;
+  void show_left() const;
+  void show_right() const;
+  bool is_const_push_swap() const;
+  bool rewrite_const_push_swap();
+  bool is_const_push_xchgs();
+  bool rewrite_const_push_xchgs();
+  bool simple_rewrite(int p, AsmOp&& new_op);
+  bool simple_rewrite(int p, AsmOp&& new_op1, AsmOp&& new_op2);
+  bool simple_rewrite(AsmOp&& new_op) {
+    return simple_rewrite(p_, std::move(new_op));
+  }
+  bool simple_rewrite(AsmOp&& new_op1, AsmOp&& new_op2) {
+    return simple_rewrite(p_, std::move(new_op1), std::move(new_op2));
+  }
+  bool simple_rewrite_nop();
+  bool is_pred(const std::function<bool(const StackTransform&)>& pred, int min_p = 2);
+  bool is_same_as(const StackTransform& trans, int min_p = 2);
+  bool is_rot();
+  bool is_rotrev();
+  bool is_tuck();
+  bool is_2dup();
+  bool is_2drop();
+  bool is_2swap();
+  bool is_2over();
+  bool is_xchg(int* i, int* j);
+  bool is_push(int* i);
+  bool is_pop(int* i);
+  bool is_nop();
+  bool is_xchg2(int* i, int* j);
+  bool is_xcpu(int* i, int* j);
+  bool is_puxc(int* i, int* j);
+  bool is_push2(int* i, int* j);
+  bool is_xchg3(int* i, int* j, int* k);
+  bool is_xc2pu(int* i, int* j, int* k);
+  bool is_xcpuxc(int* i, int* j, int* k);
+  bool is_xcpu2(int* i, int* j, int* k);
+  bool is_puxc2(int* i, int* j, int* k);
+  bool is_puxcpu(int* i, int* j, int* k);
+  bool is_pu2xc(int* i, int* j, int* k);
+  bool is_push3(int* i, int* j, int* k);
+  bool is_blkswap(int* i, int* j);
+  bool is_blkpush(int* i, int* j);
+  bool is_blkdrop(int* i);
+  bool is_reverse(int* i, int* j);
+  bool is_nip_seq(int* i, int* j);
+  AsmOpConsList extract_code();
+};
+
+AsmOpConsList optimize_code_head(AsmOpConsList op_list);
+AsmOpConsList optimize_code(AsmOpConsList op_list);
+void optimize_code(AsmOpList& ops);
+
+struct Stack {
+  StackLayoutExt s;
+  AsmOpList& o;
+  enum { _StkCmt = 1, _CptStkCmt = 2, _DisableOpt = 4, _Shown = 256, _Garbage = -0x10000 };
+  int mode;
+  Stack(AsmOpList& _o, int _mode = 0) : o(_o), mode(_mode) {
+  }
+  Stack(AsmOpList& _o, const StackLayoutExt& _s, int _mode = 0) : s(_s), o(_o), mode(_mode) {
+  }
+  Stack(AsmOpList& _o, StackLayoutExt&& _s, int _mode = 0) : s(std::move(_s)), o(_o), mode(_mode) {
+  }
+  int depth() const {
+    return (int)s.size();
+  }
+  var_idx_t operator[](int i) const {
+    validate(i);
+    return s[depth() - i - 1].first;
+  }
+  var_const_idx_t& at(int i) {
+    validate(i);
+    return s[depth() - i - 1];
+  }
+  var_const_idx_t at(int i) const {
+    validate(i);
+    return s[depth() - i - 1];
+  }
+  var_const_idx_t get(int i) const {
+    return at(i);
+  }
+  StackLayout vars() const;
+  int find(var_idx_t var, int from = 0) const;
+  int find(var_idx_t var, int from, int to) const;
+  int find_const(const_idx_t cst, int from = 0) const;
+  int find_outside(var_idx_t var, int from, int to) const;
+  void forget_const();
+  void validate(int i) const {
+    assert(i >= 0 && i < depth() && "invalid stack reference");
+  }
+  void modified() {
+    mode &= ~_Shown;
+  }
+  void issue_pop(int i);
+  void issue_push(int i);
+  void issue_xchg(int i, int j);
+  int drop_vars_except(const VarDescrList& var_info, int excl_var = 0x80000000);
+  void forget_var(var_idx_t idx);
+  void push_new_var(var_idx_t idx);
+  void push_new_const(var_idx_t idx, const_idx_t cidx);
+  void assign_var(var_idx_t new_idx, var_idx_t old_idx);
+  void do_copy_var(var_idx_t new_idx, var_idx_t old_idx);
+  void enforce_state(const StackLayout& req_stack);
+  void rearrange_top(const StackLayout& top, std::vector<bool> last);
+  void rearrange_top(var_idx_t top, bool last);
+  void merge_const(const Stack& req_stack);
+  void merge_state(const Stack& req_stack);
+  void show(int _mode);
+  void show() {
+    show(mode);
+  }
+  void opt_show() {
+    if ((mode & (_StkCmt | _Shown)) == _StkCmt) {
+      show(mode);
+    }
+  }
+  bool operator==(const Stack& y) const & {
+    return s == y.s;
+  }
+};
+
+/*
+ *
+ *   SPECIFIC SYMBOL VALUES,
+ *   BUILT-IN FUNCTIONS AND OPERATIONS
+ * 
+ */
+
+typedef std::function<AsmOp(std::vector<VarDescr>&, std::vector<VarDescr>&)> simple_compile_func_t;
+typedef std::function<bool(AsmOpList&, std::vector<VarDescr>&, std::vector<VarDescr>&)> compile_func_t;
+
+inline simple_compile_func_t make_simple_compile(AsmOp op) {
+  return [op](std::vector<VarDescr>& out, std::vector<VarDescr>& in) -> AsmOp { return op; };
+}
+
+inline compile_func_t make_ext_compile(std::vector<AsmOp> ops) {
+  return [ops = std::move(ops)](AsmOpList & dest, std::vector<VarDescr> & out, std::vector<VarDescr> & in)->bool {
+    return dest.append(ops);
+  };
+}
+
+inline compile_func_t make_ext_compile(AsmOp op) {
+  return
+      [op](AsmOpList& dest, std::vector<VarDescr>& out, std::vector<VarDescr>& in) -> bool { return dest.append(op); };
+}
+
+struct SymValAsmFunc : SymValFunc {
+  simple_compile_func_t simple_compile;
+  compile_func_t ext_compile;
+  ~SymValAsmFunc() override = default;
+  SymValAsmFunc(TypeExpr* ft, const AsmOp& _macro, bool impure = false)
+      : SymValFunc(-1, ft, impure), simple_compile(make_simple_compile(_macro)) {
+  }
+  SymValAsmFunc(TypeExpr* ft, std::vector<AsmOp> _macro, bool impure = false)
+      : SymValFunc(-1, ft, impure), ext_compile(make_ext_compile(std::move(_macro))) {
+  }
+  SymValAsmFunc(TypeExpr* ft, simple_compile_func_t _compile, bool impure = false)
+      : SymValFunc(-1, ft, impure), simple_compile(std::move(_compile)) {
+  }
+  SymValAsmFunc(TypeExpr* ft, compile_func_t _compile, bool impure = false)
+      : SymValFunc(-1, ft, impure), ext_compile(std::move(_compile)) {
+  }
+  SymValAsmFunc(TypeExpr* ft, simple_compile_func_t _compile, std::initializer_list<int> arg_order,
+                std::initializer_list<int> ret_order = {}, bool impure = false)
+      : SymValFunc(-1, ft, arg_order, ret_order, impure), simple_compile(std::move(_compile)) {
+  }
+  SymValAsmFunc(TypeExpr* ft, compile_func_t _compile, std::initializer_list<int> arg_order,
+                std::initializer_list<int> ret_order = {}, bool impure = false)
+      : SymValFunc(-1, ft, arg_order, ret_order, impure), ext_compile(std::move(_compile)) {
+  }
+  bool compile(AsmOpList& dest, std::vector<VarDescr>& in, std::vector<VarDescr>& out) const;
+};
+
+// defined in builtins.cpp
+AsmOp exec_arg_op(std::string op, long long arg);
+AsmOp exec_arg_op(std::string op, long long arg, int args, int retv = 1);
+AsmOp exec_arg_op(std::string op, td::RefInt256 arg);
+AsmOp exec_arg_op(std::string op, td::RefInt256 arg, int args, int retv = 1);
+AsmOp push_const(td::RefInt256 x);
+
+void define_builtins();
+
+}  // namespace funC
diff --git a/submodules/ton/tonlib-src/crypto/func/gen-abscode.cpp b/submodules/ton/tonlib-src/crypto/func/gen-abscode.cpp
new file mode 100644
index 0000000000..ab2efed541
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/gen-abscode.cpp
@@ -0,0 +1,325 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "func.h"
+
+namespace funC {
+
+/*
+ * 
+ *   EXPRESSIONS
+ * 
+ */
+
+Expr* Expr::copy() const {
+  auto res = new Expr{*this};
+  for (auto& arg : res->args) {
+    arg = arg->copy();
+  }
+  return res;
+}
+
+Expr::Expr(int c, sym_idx_t name_idx, std::initializer_list<Expr*> _arglist) : cls(c), args(std::move(_arglist)) {
+  sym = sym::lookup_symbol(name_idx);
+  if (!sym) {
+  }
+}
+
+void Expr::chk_rvalue(const Lexem& lem) const {
+  if (!is_rvalue()) {
+    lem.error_at("rvalue expected before `", "`");
+  }
+}
+
+void Expr::chk_lvalue(const Lexem& lem) const {
+  if (!is_lvalue()) {
+    lem.error_at("lvalue expected before `", "`");
+  }
+}
+
+void Expr::chk_type(const Lexem& lem) const {
+  if (!is_type()) {
+    lem.error_at("type expression expected before `", "`");
+  }
+}
+
+bool Expr::deduce_type(const Lexem& lem) {
+  if (e_type) {
+    return true;
+  }
+  switch (cls) {
+    case _Apply: {
+      if (!sym) {
+        return false;
+      }
+      SymVal* sym_val = dynamic_cast<SymVal*>(sym->value);
+      if (!sym_val || !sym_val->get_type()) {
+        return false;
+      }
+      std::vector<TypeExpr*> arg_types;
+      for (const auto& arg : args) {
+        arg_types.push_back(arg->e_type);
+      }
+      TypeExpr* fun_type = TypeExpr::new_map(TypeExpr::new_tensor(arg_types), TypeExpr::new_hole());
+      try {
+        unify(fun_type, sym_val->sym_type);
+      } catch (UnifyError& ue) {
+        std::ostringstream os;
+        os << "cannot apply function " << sym->name() << " : " << sym_val->get_type() << " to arguments of type "
+           << fun_type->args[0] << ": " << ue;
+        lem.error(os.str());
+      }
+      e_type = fun_type->args[1];
+      TypeExpr::remove_indirect(e_type);
+      return true;
+    }
+    case _VarApply: {
+      assert(args.size() == 2);
+      TypeExpr* fun_type = TypeExpr::new_map(args[1]->e_type, TypeExpr::new_hole());
+      try {
+        unify(fun_type, args[0]->e_type);
+      } catch (UnifyError& ue) {
+        std::ostringstream os;
+        os << "cannot apply expression of type " << args[0]->e_type << " to an expression of type " << args[1]->e_type
+           << ": " << ue;
+        lem.error(os.str());
+      }
+      e_type = fun_type->args[1];
+      TypeExpr::remove_indirect(e_type);
+      return true;
+    }
+    case _Letop: {
+      assert(args.size() == 2);
+      try {
+        // std::cerr << "in assignment: " << args[0]->e_type << " from " << args[1]->e_type << std::endl;
+        unify(args[0]->e_type, args[1]->e_type);
+      } catch (UnifyError& ue) {
+        std::ostringstream os;
+        os << "cannot assign an expression of type " << args[1]->e_type << " to a variable or pattern of type "
+           << args[0]->e_type << ": " << ue;
+        lem.error(os.str());
+      }
+      e_type = args[0]->e_type;
+      TypeExpr::remove_indirect(e_type);
+      return true;
+    }
+    case _LetFirst: {
+      assert(args.size() == 2);
+      TypeExpr* rhs_type = TypeExpr::new_tensor({args[0]->e_type, TypeExpr::new_hole()});
+      try {
+        // std::cerr << "in implicit assignment of a modifying method: " << rhs_type << " and " << args[1]->e_type << std::endl;
+        unify(rhs_type, args[1]->e_type);
+      } catch (UnifyError& ue) {
+        std::ostringstream os;
+        os << "cannot implicitly assign an expression of type " << args[1]->e_type
+           << " to a variable or pattern of type " << rhs_type << " in modifying method `" << sym::symbols.get_name(val)
+           << "` : " << ue;
+        lem.error(os.str());
+      }
+      e_type = rhs_type->args[1];
+      TypeExpr::remove_indirect(e_type);
+      // std::cerr << "result type is " << e_type << std::endl;
+      return true;
+    }
+    case _CondExpr: {
+      assert(args.size() == 3);
+      auto flag_type = TypeExpr::new_atomic(_Int);
+      try {
+        unify(args[0]->e_type, flag_type);
+      } catch (UnifyError& ue) {
+        std::ostringstream os;
+        os << "condition in a conditional expression has non-integer type " << args[0]->e_type << ": " << ue;
+        lem.error(os.str());
+      }
+      try {
+        unify(args[1]->e_type, args[2]->e_type);
+      } catch (UnifyError& ue) {
+        std::ostringstream os;
+        os << "the two variants in a conditional expression have different types " << args[1]->e_type << " and "
+           << args[2]->e_type << " : " << ue;
+        lem.error(os.str());
+      }
+      e_type = args[1]->e_type;
+      TypeExpr::remove_indirect(e_type);
+      return true;
+    }
+  }
+  return false;
+}
+
+int Expr::define_new_vars(CodeBlob& code) {
+  switch (cls) {
+    case _Tuple:
+    case _TypeApply: {
+      int res = 0;
+      for (const auto& x : args) {
+        res += x->define_new_vars(code);
+      }
+      return res;
+    }
+    case _Var:
+      if (val < 0) {
+        val = code.create_var(TmpVar::_Named, e_type, sym, &here);
+        return 1;
+      }
+      break;
+    case _Hole:
+      if (val < 0) {
+        val = code.create_var(TmpVar::_Tmp, e_type, nullptr, &here);
+      }
+      break;
+  }
+  return 0;
+}
+
+int Expr::predefine_vars() {
+  switch (cls) {
+    case _Tuple:
+    case _TypeApply: {
+      int res = 0;
+      for (const auto& x : args) {
+        res += x->predefine_vars();
+      }
+      return res;
+    }
+    case _Var:
+      if (!sym) {
+        assert(val < 0 && here.defined());
+        sym = sym::define_symbol(~val, false, here);
+        if (!sym) {
+          throw src::ParseError{here, std::string{"redefined variable `"} + sym::symbols.get_name(~val) + "`"};
+        }
+        sym->value = new SymVal{SymVal::_Var, -1, e_type};
+        return 1;
+      }
+      break;
+  }
+  return 0;
+}
+
+std::vector<var_idx_t> Expr::pre_compile(CodeBlob& code) const {
+  switch (cls) {
+    case _Tuple: {
+      std::vector<var_idx_t> res;
+      for (const auto& x : args) {
+        auto add = x->pre_compile(code);
+        res.insert(res.end(), add.cbegin(), add.cend());
+      }
+      return res;
+    }
+    case _Apply: {
+      assert(sym);
+      std::vector<var_idx_t> res;
+      auto func = dynamic_cast<SymValFunc*>(sym->value);
+      if (func && func->arg_order.size() == args.size()) {
+        //std::cerr << "!!! reordering " << args.size() << " arguments of " << sym->name() << std::endl;
+        std::vector<std::vector<var_idx_t>> add_list(args.size());
+        for (int i : func->arg_order) {
+          add_list[i] = args[i]->pre_compile(code);
+        }
+        for (const auto& add : add_list) {
+          res.insert(res.end(), add.cbegin(), add.cend());
+        }
+      } else {
+        for (const auto& x : args) {
+          auto add = x->pre_compile(code);
+          res.insert(res.end(), add.cbegin(), add.cend());
+        }
+      }
+      var_idx_t rv = code.create_var(TmpVar::_Tmp, e_type, nullptr, &here);
+      std::vector<var_idx_t> rvect{rv};
+      auto& op = code.emplace_back(here, Op::_Call, rvect, std::move(res), sym);
+      if (flags & _IsImpure) {
+        op.flags |= Op::_Impure;
+      }
+      return rvect;
+    }
+    case _TypeApply:
+      return args[0]->pre_compile(code);
+    case _Var:
+    case _Hole:
+      return {val};
+    case _VarApply:
+      if (args[0]->cls == _Glob) {
+        std::vector<var_idx_t> res = args[1]->pre_compile(code);
+        var_idx_t rv = code.create_var(TmpVar::_Tmp, e_type, nullptr, &here);
+        std::vector<var_idx_t> rvect{rv};
+        auto& op = code.emplace_back(here, Op::_Call, rvect, std::move(res), args[0]->sym);
+        if (args[0]->flags & _IsImpure) {
+          op.flags |= Op::_Impure;
+        }
+        return rvect;
+      } else {
+        std::vector<var_idx_t> res = args[1]->pre_compile(code);
+        std::vector<var_idx_t> tfunc = args[0]->pre_compile(code);
+        if (tfunc.size() != 1) {
+          throw src::Fatal{"stack tuple used as a function"};
+        }
+        res.push_back(tfunc[0]);
+        var_idx_t rv = code.create_var(TmpVar::_Tmp, e_type, nullptr, &here);
+        std::vector<var_idx_t> rvect{rv};
+        code.emplace_back(here, Op::_CallInd, rvect, std::move(res));
+        return rvect;
+      }
+    case _Const: {
+      var_idx_t rv = code.create_var(TmpVar::_Tmp, e_type, nullptr, &here);
+      std::vector<var_idx_t> rvect{rv};
+      code.emplace_back(here, Op::_IntConst, rvect, intval);
+      return rvect;
+    }
+    case _Glob: {
+      var_idx_t rv = code.create_var(TmpVar::_Tmp, e_type, nullptr, &here);
+      std::vector<var_idx_t> rvect{rv};
+      code.emplace_back(here, Op::_GlobVar, rvect, std::vector<var_idx_t>{}, sym);
+      return rvect;
+    }
+    case _Letop: {
+      std::vector<var_idx_t> right = args[1]->pre_compile(code);
+      std::vector<var_idx_t> left = args[0]->pre_compile(code);
+      code.emplace_back(here, Op::_Let, left, std::move(right));
+      return left;
+    }
+    case _LetFirst: {
+      var_idx_t rv = code.create_var(TmpVar::_Tmp, e_type, nullptr, &here);
+      std::vector<var_idx_t> right = args[1]->pre_compile(code);
+      std::vector<var_idx_t> left = args[0]->pre_compile(code);
+      left.push_back(rv);
+      code.emplace_back(here, Op::_Let, std::move(left), std::move(right));
+      return std::vector<var_idx_t>{rv};
+    }
+    case _CondExpr: {
+      auto cond = args[0]->pre_compile(code);
+      assert(cond.size() == 1);
+      var_idx_t rv = code.create_var(TmpVar::_Tmp, e_type, nullptr, &here);
+      std::vector<var_idx_t> rvect{rv};
+      Op& if_op = code.emplace_back(here, Op::_If, cond);
+      code.push_set_cur(if_op.block0);
+      code.emplace_back(here, Op::_Let, rvect, args[1]->pre_compile(code));
+      code.close_pop_cur(args[1]->here);
+      code.push_set_cur(if_op.block1);
+      code.emplace_back(here, Op::_Let, rvect, args[2]->pre_compile(code));
+      code.close_pop_cur(args[2]->here);
+      return rvect;
+    }
+    default:
+      std::cerr << "expression constructor is " << cls << std::endl;
+      throw src::Fatal{"cannot compile expression with unknown constructor"};
+  }
+}
+
+}  // namespace funC
diff --git a/submodules/ton/tonlib-src/crypto/func/keywords.cpp b/submodules/ton/tonlib-src/crypto/func/keywords.cpp
new file mode 100644
index 0000000000..bab30d32a6
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/keywords.cpp
@@ -0,0 +1,115 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "func.h"
+
+namespace src {
+
+int lexem_is_special(std::string str) {
+  return 0;  // no special lexems
+}
+
+}  // namespace src
+
+namespace funC {
+
+/*
+ * 
+ *   KEYWORD DEFINITION
+ * 
+ */
+
+void define_keywords() {
+  sym::symbols.add_kw_char('+')
+      .add_kw_char('-')
+      .add_kw_char('*')
+      .add_kw_char('/')
+      .add_kw_char('%')
+      .add_kw_char('?')
+      .add_kw_char(':')
+      .add_kw_char(',')
+      .add_kw_char(';')
+      .add_kw_char('(')
+      .add_kw_char(')')
+      .add_kw_char('{')
+      .add_kw_char('}')
+      .add_kw_char('=')
+      .add_kw_char('_')
+      .add_kw_char('<')
+      .add_kw_char('>')
+      .add_kw_char('&')
+      .add_kw_char('|')
+      .add_kw_char('~');
+
+  using Kw = funC::Keyword;
+  sym::symbols.add_keyword("==", Kw::_Eq)
+      .add_keyword("!=", Kw::_Neq)
+      .add_keyword("<=", Kw::_Leq)
+      .add_keyword(">=", Kw::_Geq)
+      .add_keyword("<=>", Kw::_Spaceship)
+      .add_keyword("<<", Kw::_Lshift)
+      .add_keyword(">>", Kw::_Rshift)
+      .add_keyword(">>~", Kw::_RshiftR)
+      .add_keyword(">>^", Kw::_RshiftC)
+      .add_keyword("/~", Kw::_DivR)
+      .add_keyword("/^", Kw::_DivC)
+      .add_keyword("/%", Kw::_DivMod)
+      .add_keyword("+=", Kw::_PlusLet)
+      .add_keyword("-=", Kw::_MinusLet)
+      .add_keyword("*=", Kw::_TimesLet)
+      .add_keyword("/=", Kw::_DivLet)
+      .add_keyword("%=", Kw::_ModLet)
+      .add_keyword("/~=", Kw::_DivRLet)
+      .add_keyword("/^=", Kw::_DivCLet)
+      .add_keyword("<<=", Kw::_LshiftLet)
+      .add_keyword(">>=", Kw::_RshiftLet)
+      .add_keyword(">>~=", Kw::_RshiftRLet)
+      .add_keyword(">>^=", Kw::_RshiftCLet);
+
+  sym::symbols.add_keyword("return", Kw::_Return)
+      .add_keyword("var", Kw::_Var)
+      .add_keyword("repeat", Kw::_Repeat)
+      .add_keyword("do", Kw::_Do)
+      .add_keyword("while", Kw::_While)
+      .add_keyword("until", Kw::_Until)
+      .add_keyword("if", Kw::_If)
+      .add_keyword("ifnot", Kw::_Ifnot)
+      .add_keyword("then", Kw::_Then)
+      .add_keyword("else", Kw::_Else)
+      .add_keyword("elseif", Kw::_Elseif)
+      .add_keyword("elseifnot", Kw::_Elseifnot);
+
+  sym::symbols.add_keyword("int", Kw::_Int)
+      .add_keyword("cell", Kw::_Cell)
+      .add_keyword("slice", Kw::_Slice)
+      .add_keyword("builder", Kw::_Builder)
+      .add_keyword("cont", Kw::_Cont)
+      .add_keyword("tuple", Kw::_Tuple)
+      .add_keyword("->", Kw::_Mapsto);
+
+  sym::symbols.add_keyword("extern", Kw::_Extern)
+      .add_keyword("asm", Kw::_Asm)
+      .add_keyword("impure", Kw::_Impure)
+      .add_keyword("method_id", Kw::_MethodId)
+      .add_keyword("operator", Kw::_Operator)
+      .add_keyword("infix", Kw::_Infix)
+      .add_keyword("infixl", Kw::_Infixl)
+      .add_keyword("infixr", Kw::_Infixr);
+}
+
+}  // namespace funC
diff --git a/submodules/ton/tonlib-src/crypto/func/optimize.cpp b/submodules/ton/tonlib-src/crypto/func/optimize.cpp
new file mode 100644
index 0000000000..95b4403c46
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/optimize.cpp
@@ -0,0 +1,539 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "func.h"
+
+namespace funC {
+
+/*
+ * 
+ *   PEEPHOLE OPTIMIZER
+ * 
+ */
+
+void Optimizer::set_code(AsmOpConsList code) {
+  code_ = std::move(code);
+  unpack();
+}
+
+void Optimizer::unpack() {
+  int i = 0, j = 0;
+  for (AsmOpCons *p = code_.get(); p && i < n; p = p->cdr.get(), ++j) {
+    if (p->car->is_very_custom()) {
+      break;
+    }
+    if (p->car->is_comment()) {
+      continue;
+    }
+    op_cons_[i] = p;
+    op_[i] = std::move(p->car);
+    offs_[i] = j;
+    ++i;
+  }
+  l_ = i;
+  indent_ = (i ? op_[0]->indent : 0);
+}
+
+void Optimizer::pack() {
+  for (int i = 0; i < l_; i++) {
+    op_cons_[i]->car = std::move(op_[i]);
+    op_cons_[i] = nullptr;
+  }
+  l_ = 0;
+}
+
+void Optimizer::apply() {
+  if (!p_ && !q_) {
+    return;
+  }
+  assert(p_ > 0 && p_ <= l_ && q_ >= 0 && q_ <= n && l_ <= n);
+  for (int i = p_; i < l_; i++) {
+    assert(op_[i]);
+    op_cons_[i]->car = std::move(op_[i]);
+    op_cons_[i] = nullptr;
+  }
+  for (int c = offs_[p_ - 1]; c >= 0; --c) {
+    code_ = std::move(code_->cdr);
+  }
+  for (int j = q_ - 1; j >= 0; j--) {
+    assert(oq_[j]);
+    oq_[j]->indent = indent_;
+    code_ = AsmOpCons::cons(std::move(oq_[j]), std::move(code_));
+  }
+  l_ = 0;
+}
+
+AsmOpConsList Optimizer::extract_code() {
+  pack();
+  return std::move(code_);
+}
+
+void Optimizer::show_head() const {
+  if (!debug_) {
+    return;
+  }
+  std::cerr << "optimizing";
+  for (int i = 0; i < l_; i++) {
+    if (op_[i]) {
+      std::cerr << ' ' << *op_[i] << ' ';
+    } else {
+      std::cerr << " (null) ";
+    }
+  }
+  std::cerr << std::endl;
+}
+
+void Optimizer::show_left() const {
+  if (!debug_) {
+    return;
+  }
+  std::cerr << "// *** rewriting";
+  for (int i = 0; i < p_; i++) {
+    if (op_[i]) {
+      std::cerr << ' ' << *op_[i] << ' ';
+    } else {
+      std::cerr << " (null) ";
+    }
+  }
+}
+
+void Optimizer::show_right() const {
+  if (!debug_) {
+    return;
+  }
+  std::cerr << "->";
+  for (int i = 0; i < q_; i++) {
+    if (oq_[i]) {
+      std::cerr << ' ' << *oq_[i] << ' ';
+    } else {
+      std::cerr << " (null) ";
+    }
+  }
+  std::cerr << std::endl;
+}
+
+bool Optimizer::say(std::string str) const {
+  if (debug_) {
+    std::cerr << str << std::endl;
+  }
+  return true;
+}
+
+bool Optimizer::is_const_push_swap() const {
+  return l_ >= 3 && op_[0]->is_gconst() && op_[1]->is_push() && op_[1]->a >= 1 && op_[2]->is_swap();
+}
+
+// PUSHCONST c ; PUSH s(i+1) ; SWAP -> PUSH s(i) ; PUSHCONST c
+bool Optimizer::rewrite_const_push_swap() {
+  p_ = 3;
+  q_ = 2;
+  show_left();
+  oq_[1] = std::move(op_[0]);
+  oq_[0] = std::move(op_[1]);
+  (oq_[0]->a)--;
+  show_right();
+  return true;
+}
+
+bool Optimizer::is_const_push_xchgs() {
+  if (!(pb_ >= 2 && pb_ <= l2_ && op_[0]->is_gconst())) {
+    return false;
+  }
+  StackTransform t;
+  int pos = 0, i;
+  for (i = 1; i < pb_; i++) {
+    int a, b;
+    if (op_[i]->is_xchg(&a, &b)) {
+      if (pos == a) {
+        pos = b;
+      } else if (pos == b) {
+        pos = a;
+      } else {
+        t.apply_xchg(a - (a > pos), b - (b > pos));
+      }
+    } else if (op_[i]->is_push(&a)) {
+      if (pos == a) {
+        return false;
+      }
+      t.apply_push(a - (a > pos));
+      ++pos;
+    } else {
+      return false;
+    }
+  }
+  if (pos) {
+    return false;
+  }
+  t.apply_push_newconst();
+  if (t <= tr_[i - 1]) {
+    p_ = i;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+bool Optimizer::rewrite_const_push_xchgs() {
+  if (!p_) {
+    return false;
+  }
+  show_left();
+  auto c_op = std::move(op_[0]);
+  assert(c_op->is_gconst());
+  StackTransform t;
+  q_ = 0;
+  int pos = 0;
+  for (int i = 1; i < p_; i++) {
+    int a, b;
+    if (op_[i]->is_xchg(&a, &b)) {
+      if (a == pos) {
+        pos = b;
+      } else if (b == pos) {
+        pos = a;
+      } else {
+        oq_[q_] = std::move(op_[i]);
+        if (a > pos) {
+          oq_[q_]->a = a - 1;
+        }
+        if (b > pos) {
+          oq_[q_]->b = b - 1;
+        }
+        assert(apply_op(t, *oq_[q_]));
+        ++q_;
+      }
+    } else {
+      assert(op_[i]->is_push(&a));
+      assert(a != pos);
+      oq_[q_] = std::move(op_[i]);
+      if (a > pos) {
+        oq_[q_]->a = a - 1;
+      }
+      assert(apply_op(t, *oq_[q_]));
+      ++q_;
+      ++pos;
+    }
+  }
+  assert(!pos);
+  t.apply_push_newconst();
+  assert(t <= tr_[p_ - 1]);
+  oq_[q_++] = std::move(c_op);
+  show_right();
+  return true;
+}
+
+bool Optimizer::simple_rewrite(int p, AsmOp&& new_op) {
+  assert(p > 0 && p <= l_);
+  p_ = p;
+  q_ = 1;
+  show_left();
+  oq_[0] = std::move(op_[0]);
+  *oq_[0] = new_op;
+  show_right();
+  return true;
+}
+
+bool Optimizer::simple_rewrite(int p, AsmOp&& new_op1, AsmOp&& new_op2) {
+  assert(p > 1 && p <= l_);
+  p_ = p;
+  q_ = 2;
+  show_left();
+  oq_[0] = std::move(op_[0]);
+  *oq_[0] = new_op1;
+  oq_[1] = std::move(op_[1]);
+  *oq_[1] = new_op2;
+  show_right();
+  return true;
+}
+
+bool Optimizer::simple_rewrite_nop() {
+  assert(p_ > 0 && p_ <= l_);
+  q_ = 0;
+  show_left();
+  show_right();
+  return true;
+}
+
+bool Optimizer::is_pred(const std::function<bool(const StackTransform&)>& pred, int min_p) {
+  min_p = std::max(min_p, pb_);
+  for (int p = l2_; p >= min_p; p--) {
+    if (pred(tr_[p - 1])) {
+      p_ = p;
+      return true;
+    }
+  }
+  return false;
+}
+
+bool Optimizer::is_same_as(const StackTransform& trans, int min_p) {
+  return is_pred([&trans](const auto& t) { return t >= trans; }, min_p);
+}
+
+// s1 s3 XCHG ; s0 s2 XCHG -> 2SWAP
+bool Optimizer::is_2swap() {
+  static const StackTransform t_2swap{2, 3, 0, 1, 4};
+  return is_same_as(t_2swap);
+}
+
+// s3 PUSH ; s3 PUSH -> 2OVER
+bool Optimizer::is_2over() {
+  static const StackTransform t_2over{2, 3, 0};
+  return is_same_as(t_2over);
+}
+
+bool Optimizer::is_2dup() {
+  static const StackTransform t_2dup{0, 1, 0};
+  return is_same_as(t_2dup);
+}
+
+bool Optimizer::is_tuck() {
+  static const StackTransform t_tuck{0, 1, 0, 2};
+  return is_same_as(t_tuck);
+}
+
+bool Optimizer::is_2drop() {
+  static const StackTransform t_2drop{2};
+  return is_same_as(t_2drop);
+}
+
+bool Optimizer::is_rot() {
+  return is_pred([](const auto& t) { return t.is_rot(); });
+}
+
+bool Optimizer::is_rotrev() {
+  return is_pred([](const auto& t) { return t.is_rotrev(); });
+}
+
+bool Optimizer::is_nop() {
+  return is_pred([](const auto& t) { return t.is_id(); }, 1);
+}
+
+bool Optimizer::is_xchg(int* i, int* j) {
+  return is_pred([i, j](const auto& t) { return t.is_xchg(i, j) && ((*i < 16 && *j < 16) || (!*i && *j < 256)); });
+}
+
+bool Optimizer::is_push(int* i) {
+  return is_pred([i](const auto& t) { return t.is_push(i) && *i < 256; });
+}
+
+bool Optimizer::is_pop(int* i) {
+  return is_pred([i](const auto& t) { return t.is_pop(i) && *i < 256; });
+}
+
+bool Optimizer::is_xchg2(int* i, int* j) {
+  return is_pred([i, j](const auto& t) { return t.is_xchg2(i, j) && *i < 16 && *j < 16; });
+}
+
+bool Optimizer::is_xcpu(int* i, int* j) {
+  return is_pred([i, j](const auto& t) { return t.is_xcpu(i, j) && *i < 16 && *j < 16; });
+}
+
+bool Optimizer::is_puxc(int* i, int* j) {
+  return is_pred([i, j](const auto& t) { return t.is_puxc(i, j) && *i < 16 && *j < 15; });
+}
+
+bool Optimizer::is_push2(int* i, int* j) {
+  return is_pred([i, j](const auto& t) { return t.is_push2(i, j) && *i < 16 && *j < 16; });
+}
+
+bool Optimizer::is_xchg3(int* i, int* j, int* k) {
+  return is_pred([i, j, k](const auto& t) { return t.is_xchg3(i, j, k) && *i < 16 && *j < 16 && *k < 16; });
+}
+
+bool Optimizer::is_xc2pu(int* i, int* j, int* k) {
+  return is_pred([i, j, k](const auto& t) { return t.is_xc2pu(i, j, k) && *i < 16 && *j < 16 && *k < 16; });
+}
+
+bool Optimizer::is_xcpuxc(int* i, int* j, int* k) {
+  return is_pred([i, j, k](const auto& t) { return t.is_xcpuxc(i, j, k) && *i < 16 && *j < 16 && *k < 15; });
+}
+
+bool Optimizer::is_xcpu2(int* i, int* j, int* k) {
+  return is_pred([i, j, k](const auto& t) { return t.is_xcpu2(i, j, k) && *i < 16 && *j < 16 && *k < 16; });
+}
+
+bool Optimizer::is_puxc2(int* i, int* j, int* k) {
+  return is_pred([i, j, k](const auto& t) { return t.is_puxc2(i, j, k) && *i < 16 && *j < 15 && *k < 15; });
+}
+
+bool Optimizer::is_puxcpu(int* i, int* j, int* k) {
+  return is_pred([i, j, k](const auto& t) { return t.is_puxcpu(i, j, k) && *i < 16 && *j < 15 && *k < 15; });
+}
+
+bool Optimizer::is_pu2xc(int* i, int* j, int* k) {
+  return is_pred([i, j, k](const auto& t) { return t.is_pu2xc(i, j, k) && *i < 16 && *j < 15 && *k < 14; });
+}
+
+bool Optimizer::is_push3(int* i, int* j, int* k) {
+  return is_pred([i, j, k](const auto& t) { return t.is_push3(i, j, k) && *i < 16 && *j < 16 && *k < 16; });
+}
+
+bool Optimizer::is_blkswap(int* i, int* j) {
+  return is_pred([i, j](const auto& t) { return t.is_blkswap(i, j) && *i > 0 && *j > 0 && *i <= 16 && *j <= 16; });
+}
+
+bool Optimizer::is_blkpush(int* i, int* j) {
+  return is_pred([i, j](const auto& t) { return t.is_blkpush(i, j) && *i > 0 && *i < 16 && *j < 16; });
+}
+
+bool Optimizer::is_blkdrop(int* i) {
+  return is_pred([i](const auto& t) { return t.is_blkdrop(i) && *i > 0 && *i < 16; });
+}
+
+bool Optimizer::is_reverse(int* i, int* j) {
+  return is_pred([i, j](const auto& t) { return t.is_reverse(i, j) && *i >= 2 && *i <= 17 && *j < 16; });
+}
+
+bool Optimizer::is_nip_seq(int* i, int* j) {
+  return is_pred([i, j](const auto& t) { return t.is_nip_seq(i, j) && *i >= 3 && *i <= 15; });
+}
+
+bool Optimizer::compute_stack_transforms() {
+  StackTransform trans;
+  for (int i = 0; i < l_; i++) {
+    if (!apply_op(trans, *op_[i])) {
+      l2_ = i;
+      return true;
+    }
+    tr_[i] = trans;
+  }
+  l2_ = l_;
+  return true;
+}
+
+bool Optimizer::show_stack_transforms() const {
+  show_head();
+  // slow version
+  /*
+  StackTransform trans2;
+  std::cerr << "id = " << trans2 << std::endl;
+  for (int i = 0; i < l_; i++) {
+    StackTransform op;
+    if (!apply_op(op, *op_[i])) {
+      std::cerr << "* (" << *op_[i] << " = invalid)\n";
+      break;
+    }
+    trans2 *= op;
+    std::cerr << "* " << *op_[i] << " = " << op << " -> " << trans2 << std::endl;
+  }
+  */
+  // fast version
+  StackTransform trans;
+  for (int i = 0; i < l_; i++) {
+    std::cerr << trans << std::endl << *op_[i] << " -> ";
+    if (!apply_op(trans, *op_[i])) {
+      std::cerr << " <not-applicable>" << std::endl;
+      return true;
+    }
+  }
+  std::cerr << trans << std::endl;
+  return true;
+}
+
+bool Optimizer::find_at_least(int pb) {
+  p_ = q_ = 0;
+  pb_ = pb;
+  // show_stack_transforms();
+  int i = -100, j = -100, k = -100;
+  return (is_const_push_swap() && 3 >= pb && rewrite_const_push_swap()) || (is_nop() && simple_rewrite_nop()) ||
+         (is_const_push_xchgs() && rewrite_const_push_xchgs()) ||
+         (is_xchg(&i, &j) && simple_rewrite(AsmOp::Xchg(i, j))) || (is_push(&i) && simple_rewrite(AsmOp::Push(i))) ||
+         (is_pop(&i) && simple_rewrite(AsmOp::Pop(i))) || (is_rot() && simple_rewrite(AsmOp::Custom("ROT", 3, 3))) ||
+         (is_rotrev() && simple_rewrite(AsmOp::Custom("-ROT", 3, 3))) ||
+         (is_2dup() && simple_rewrite(AsmOp::Custom("2DUP", 2, 4))) ||
+         (is_2swap() && simple_rewrite(AsmOp::Custom("2SWAP", 2, 4))) ||
+         (is_2over() && simple_rewrite(AsmOp::Custom("2OVER", 2, 4))) ||
+         (is_tuck() && simple_rewrite(AsmOp::Custom("TUCK", 2, 3))) ||
+         (is_2drop() && simple_rewrite(AsmOp::Custom("2DROP", 2, 0))) ||
+         (is_xchg2(&i, &j) && simple_rewrite(AsmOp::Xchg2(i, j))) ||
+         (is_xcpu(&i, &j) && simple_rewrite(AsmOp::XcPu(i, j))) ||
+         (is_puxc(&i, &j) && simple_rewrite(AsmOp::PuXc(i, j))) ||
+         (is_push2(&i, &j) && simple_rewrite(AsmOp::Push2(i, j))) ||
+         (is_blkswap(&i, &j) && simple_rewrite(AsmOp::BlkSwap(i, j))) ||
+         (is_blkpush(&i, &j) && simple_rewrite(AsmOp::BlkPush(i, j))) ||
+         (is_blkdrop(&i) && simple_rewrite(AsmOp::BlkDrop(i))) ||
+         (is_reverse(&i, &j) && simple_rewrite(AsmOp::BlkReverse(i, j))) ||
+         (is_nip_seq(&i, &j) && simple_rewrite(AsmOp::Xchg(i, j), AsmOp::BlkDrop(i))) ||
+         (is_xchg3(&i, &j, &k) && simple_rewrite(AsmOp::Xchg3(i, j, k))) ||
+         (is_xc2pu(&i, &j, &k) && simple_rewrite(AsmOp::Xc2Pu(i, j, k))) ||
+         (is_xcpuxc(&i, &j, &k) && simple_rewrite(AsmOp::XcPuXc(i, j, k))) ||
+         (is_xcpu2(&i, &j, &k) && simple_rewrite(AsmOp::XcPu2(i, j, k))) ||
+         (is_puxc2(&i, &j, &k) && simple_rewrite(AsmOp::PuXc2(i, j, k))) ||
+         (is_puxcpu(&i, &j, &k) && simple_rewrite(AsmOp::PuXcPu(i, j, k))) ||
+         (is_pu2xc(&i, &j, &k) && simple_rewrite(AsmOp::Pu2Xc(i, j, k))) ||
+         (is_push3(&i, &j, &k) && simple_rewrite(AsmOp::Push3(i, j, k)));
+}
+
+bool Optimizer::find() {
+  if (!compute_stack_transforms()) {
+    return false;
+  }
+  for (int pb = l_; pb > 0; --pb) {
+    if (find_at_least(pb)) {
+      return true;
+    }
+  }
+  return false;
+}
+
+bool Optimizer::optimize() {
+  bool f = false;
+  while (find()) {
+    f = true;
+    apply();
+    unpack();
+  }
+  return f;
+}
+
+AsmOpConsList optimize_code_head(AsmOpConsList op_list) {
+  Optimizer opt(std::move(op_list), op_rewrite_comments);
+  opt.optimize();
+  return opt.extract_code();
+}
+
+AsmOpConsList optimize_code(AsmOpConsList op_list) {
+  std::vector<std::unique_ptr<AsmOp>> v;
+  while (op_list) {
+    if (!op_list->car->is_comment()) {
+      op_list = optimize_code_head(std::move(op_list));
+    }
+    if (op_list) {
+      v.push_back(std::move(op_list->car));
+      op_list = std::move(op_list->cdr);
+    }
+  }
+  for (auto it = v.rbegin(); it < v.rend(); ++it) {
+    op_list = AsmOpCons::cons(std::move(*it), std::move(op_list));
+  }
+  return std::move(op_list);
+}
+
+void optimize_code(AsmOpList& ops) {
+  std::unique_ptr<AsmOpCons> op_list;
+  for (auto it = ops.list_.rbegin(); it < ops.list_.rend(); ++it) {
+    op_list = AsmOpCons::cons(std::make_unique<AsmOp>(std::move(*it)), std::move(op_list));
+  }
+  op_list = optimize_code(std::move(op_list));
+  ops.list_.clear();
+  while (op_list) {
+    ops.list_.push_back(std::move(*(op_list->car)));
+    op_list = std::move(op_list->cdr);
+  }
+}
+
+}  // namespace funC
diff --git a/submodules/ton/tonlib-src/crypto/func/parse-func.cpp b/submodules/ton/tonlib-src/crypto/func/parse-func.cpp
new file mode 100644
index 0000000000..f605bd83ef
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/parse-func.cpp
@@ -0,0 +1,1105 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "func.h"
+#include "td/utils/crypto.h"
+#include <fstream>
+
+namespace sym {
+
+int compute_symbol_subclass(std::string str) {
+  using funC::IdSc;
+  if (str.size() < 2) {
+    return IdSc::undef;
+  } else if (str[0] == '.') {
+    return IdSc::dotid;
+  } else if (str[0] == '~') {
+    return IdSc::tildeid;
+  } else {
+    return IdSc::undef;
+  }
+}
+
+}  // namespace sym
+
+namespace funC {
+using namespace std::literals::string_literals;
+using src::Lexer;
+using sym::symbols;
+using td::Ref;
+
+inline bool is_dot_ident(sym_idx_t idx) {
+  return symbols.get_subclass(idx) == IdSc::dotid;
+}
+
+inline bool is_tilde_ident(sym_idx_t idx) {
+  return symbols.get_subclass(idx) == IdSc::tildeid;
+}
+
+inline bool is_special_ident(sym_idx_t idx) {
+  return symbols.get_subclass(idx) != IdSc::undef;
+}
+
+/*
+ * 
+ *   PARSE SOURCE
+ * 
+ */
+
+// TE ::= TA | TA -> TE
+// TA ::= int | ... | cont | var | _ | () | ( TE { , TE } )
+TypeExpr* parse_type(Lexer& lex);
+
+TypeExpr* parse_type1(Lexer& lex) {
+  switch (lex.tp()) {
+    case _Int:
+      lex.next();
+      return TypeExpr::new_atomic(_Int);
+    case _Cell:
+      lex.next();
+      return TypeExpr::new_atomic(_Cell);
+    case _Slice:
+      lex.next();
+      return TypeExpr::new_atomic(_Slice);
+    case _Builder:
+      lex.next();
+      return TypeExpr::new_atomic(_Builder);
+    case _Cont:
+      lex.next();
+      return TypeExpr::new_atomic(_Cont);
+    case _Tuple:
+      lex.next();
+      return TypeExpr::new_atomic(_Tuple);
+    case _Var:
+    case '_':
+      lex.next();
+      return TypeExpr::new_hole();
+  }
+  lex.expect('(');
+  if (lex.tp() == ')') {
+    lex.next();
+    return TypeExpr::new_unit();
+  }
+  auto t1 = parse_type(lex);
+  if (lex.tp() != ',') {
+    lex.expect(')');
+    return t1;
+  }
+  std::vector<TypeExpr*> tlist{1, t1};
+  while (lex.tp() == ',') {
+    lex.next();
+    tlist.push_back(parse_type(lex));
+  }
+  lex.expect(')');
+  return TypeExpr::new_tensor(std::move(tlist));
+}
+
+TypeExpr* parse_type(Lexer& lex) {
+  auto res = parse_type1(lex);
+  if (lex.tp() == _Mapsto) {
+    lex.next();
+    auto to = parse_type(lex);
+    return TypeExpr::new_map(res, to);
+  } else {
+    return res;
+  }
+}
+
+FormalArg parse_formal_arg(Lexer& lex, int fa_idx) {
+  TypeExpr* arg_type = 0;
+  SrcLocation loc = lex.cur().loc;
+  if (lex.tp() == '_') {
+    lex.next();
+    if (lex.tp() == ',' || lex.tp() == ')') {
+      return std::make_tuple(TypeExpr::new_hole(), (SymDef*)nullptr, loc);
+    }
+    arg_type = TypeExpr::new_hole();
+    loc = lex.cur().loc;
+  } else if (lex.tp() != _Ident) {
+    arg_type = parse_type(lex);
+  } else {
+    arg_type = TypeExpr::new_hole();
+  }
+  if (lex.tp() == '_' || lex.tp() == ',' || lex.tp() == ')') {
+    if (lex.tp() == '_') {
+      loc = lex.cur().loc;
+      lex.next();
+    }
+    return std::make_tuple(arg_type, (SymDef*)nullptr, loc);
+  }
+  if (lex.tp() != _Ident) {
+    lex.expect(_Ident, "formal parameter name");
+  }
+  loc = lex.cur().loc;
+  SymDef* new_sym_def = sym::define_symbol(lex.cur().val, true, loc);
+  if (new_sym_def->value) {
+    lex.cur().error_at("redefined formal parameter `", "`");
+  }
+  new_sym_def->value = new SymVal{SymVal::_Param, fa_idx, arg_type};
+  lex.next();
+  return std::make_tuple(arg_type, new_sym_def, loc);
+}
+
+FormalArgList parse_formal_args(Lexer& lex) {
+  FormalArgList args;
+  lex.expect('(', "formal argument list");
+  if (lex.tp() == ')') {
+    lex.next();
+    return args;
+  }
+  int fa_idx = 0;
+  args.push_back(parse_formal_arg(lex, fa_idx++));
+  while (lex.tp() == ',') {
+    lex.next();
+    args.push_back(parse_formal_arg(lex, fa_idx++));
+  }
+  lex.expect(')');
+  return args;
+}
+
+TypeExpr* extract_total_arg_type(const FormalArgList& arg_list) {
+  if (arg_list.empty()) {
+    return TypeExpr::new_unit();
+  }
+  if (arg_list.size() == 1) {
+    return std::get<0>(arg_list[0]);
+  }
+  std::vector<TypeExpr*> type_list;
+  for (auto& x : arg_list) {
+    type_list.push_back(std::get<0>(x));
+  }
+  return TypeExpr::new_tensor(std::move(type_list));
+}
+
+SymValCodeFunc* make_new_glob_func(SymDef* func_sym, TypeExpr* func_type, bool impure = false) {
+  SymValCodeFunc* res = new SymValCodeFunc{glob_func_cnt, func_type, impure};
+  func_sym->value = res;
+  glob_func.push_back(func_sym);
+  glob_func_cnt++;
+  return res;
+}
+
+bool check_global_func(const Lexem& cur, sym_idx_t func_name = 0) {
+  if (!func_name) {
+    func_name = cur.val;
+  }
+  SymDef* def = sym::lookup_symbol(func_name);
+  if (!def) {
+    cur.loc.show_error(std::string{"undefined function `"} + symbols.get_name(func_name) +
+                       "`, defining a global function of unknown type");
+    def = sym::define_global_symbol(func_name, 0, cur.loc);
+    assert(def && "cannot define global function");
+    ++undef_func_cnt;
+    make_new_glob_func(def, TypeExpr::new_hole());  // was: ... ::new_func()
+    return true;
+  }
+  SymVal* val = dynamic_cast<SymVal*>(def->value);
+  if (!val) {
+    cur.error(std::string{"symbol `"} + symbols.get_name(func_name) + "` has no value and no type");
+    return false;
+  } else if (!val->get_type()) {
+    cur.error(std::string{"symbol `"} + symbols.get_name(func_name) + "` has no type, possibly not a function");
+    return false;
+  } else {
+    return true;
+  }
+}
+
+Expr* parse_expr(Lexer& lex, CodeBlob& code, bool nv = false);
+
+// parse ( E { , E } ) | () | id | num | _
+Expr* parse_expr100(Lexer& lex, CodeBlob& code, bool nv) {
+  if (lex.tp() == '(') {
+    SrcLocation loc{lex.cur().loc};
+    lex.next();
+    if (lex.tp() == ')') {
+      lex.next();
+      Expr* res = new Expr{Expr::_Tuple, {}};
+      res->flags = Expr::_IsRvalue;
+      res->here = loc;
+      res->e_type = TypeExpr::new_unit();
+      return res;
+    }
+    Expr* res = parse_expr(lex, code, nv);
+    if (lex.tp() != ',') {
+      lex.expect(')');
+      return res;
+    }
+    std::vector<TypeExpr*> type_list;
+    type_list.push_back(res->e_type);
+    int f = res->flags;
+    res = new Expr{Expr::_Tuple, {res}};
+    while (lex.tp() == ',') {
+      lex.next();
+      auto x = parse_expr(lex, code, nv);
+      res->pb_arg(x);
+      if ((f ^ x->flags) & Expr::_IsType) {
+        lex.cur().error("mixing type and non-type expressions inside the same tuple");
+      }
+      f &= x->flags;
+      type_list.push_back(x->e_type);
+    }
+    res->here = loc;
+    res->flags = f;
+    res->e_type = TypeExpr::new_tensor(std::move(type_list));
+    lex.expect(')');
+    return res;
+  }
+  int t = lex.tp();
+  if (t == Lexem::Number) {
+    Expr* res = new Expr{Expr::_Const, lex.cur().loc};
+    res->flags = Expr::_IsRvalue;
+    res->intval = td::string_to_int256(lex.cur().str);
+    if (res->intval.is_null()) {
+      lex.cur().error_at("invalid integer constant `", "`");
+    }
+    res->e_type = TypeExpr::new_atomic(_Int);
+    lex.next();
+    return res;
+  }
+  if (t == '_') {
+    Expr* res = new Expr{Expr::_Hole, lex.cur().loc};
+    res->val = -1;
+    res->flags = (Expr::_IsLvalue | Expr::_IsHole | Expr::_IsNewVar);
+    res->e_type = TypeExpr::new_hole();
+    lex.next();
+    return res;
+  }
+  if (t == _Var) {
+    Expr* res = new Expr{Expr::_Type, lex.cur().loc};
+    res->flags = Expr::_IsType;
+    res->e_type = TypeExpr::new_hole();
+    lex.next();
+    return res;
+  }
+  if (t == _Int || t == _Cell || t == _Slice || t == _Builder || t == _Cont || t == _Type) {
+    Expr* res = new Expr{Expr::_Type, lex.cur().loc};
+    res->flags = Expr::_IsType;
+    res->e_type = TypeExpr::new_atomic(t);
+    lex.next();
+    return res;
+  }
+  if (t == _Ident) {
+    Expr* res = new Expr{Expr::_Var, lex.cur().loc};
+    if (nv) {
+      res->val = ~lex.cur().val;
+      res->e_type = TypeExpr::new_hole();
+      res->flags = Expr::_IsLvalue | Expr::_IsNewVar;
+      // std::cerr << "defined new variable " << lex.cur().str << " : " << res->e_type << std::endl;
+    } else {
+      res->sym = sym::lookup_symbol(lex.cur().val);
+      if (!res->sym) {
+        check_global_func(lex.cur());
+        res->sym = sym::lookup_symbol(lex.cur().val);
+      }
+      SymVal* val = nullptr;
+      if (res->sym) {
+        val = dynamic_cast<SymVal*>(res->sym->value);
+      }
+      if (!val) {
+        lex.cur().error_at("undefined identifier `", "`");
+      } else if (val->type == SymVal::_Func) {
+        res->e_type = val->get_type();
+        res->cls = Expr::_Glob;
+      } else if (val->idx < 0) {
+        lex.cur().error_at("accessing variable `", "` being defined");
+      } else {
+        res->val = val->idx;
+        res->e_type = val->get_type();
+        // std::cerr << "accessing variable " << lex.cur().str << " : " << res->e_type << std::endl;
+      }
+      // std::cerr << "accessing symbol " << lex.cur().str << " : " << res->e_type << (val->impure ? " (impure)" : " (pure)") << std::endl;
+      res->flags = Expr::_IsLvalue | Expr::_IsRvalue | (val->impure ? Expr::_IsImpure : 0);
+    }
+    res->deduce_type(lex.cur());
+    lex.next();
+    return res;
+  }
+  lex.expect(Lexem::Ident);
+  return nullptr;
+}
+
+Expr* make_func_apply(Expr* fun, Expr* x) {
+  Expr* res;
+  if (fun->cls == Expr::_Glob) {
+    if (x->cls == Expr::_Tuple) {
+      res = new Expr{Expr::_Apply, fun->sym, x->args};
+    } else {
+      res = new Expr{Expr::_Apply, fun->sym, {x}};
+    }
+    res->flags = Expr::_IsRvalue | (fun->flags & Expr::_IsImpure);
+  } else {
+    res = new Expr{Expr::_VarApply, {fun, x}};
+    res->flags = Expr::_IsRvalue;
+  }
+  return res;
+}
+
+// parse E { E }
+Expr* parse_expr90(Lexer& lex, CodeBlob& code, bool nv) {
+  Expr* res = parse_expr100(lex, code, nv);
+  while (lex.tp() == '(' || (lex.tp() == _Ident && !is_special_ident(lex.cur().val))) {
+    if (res->is_type()) {
+      Expr* x = parse_expr100(lex, code, true);
+      x->chk_lvalue(lex.cur());  // chk_lrvalue() ?
+      TypeExpr* tp = res->e_type;
+      delete res;
+      res = new Expr{Expr::_TypeApply, {x}};
+      res->e_type = tp;
+      res->here = lex.cur().loc;
+      try {
+        unify(res->e_type, x->e_type);
+      } catch (UnifyError& ue) {
+        std::ostringstream os;
+        os << "cannot transform expression of type " << x->e_type << " to explicitly requested type " << res->e_type
+           << ": " << ue;
+        lex.cur().error(os.str());
+      }
+      res->flags = x->flags;
+    } else {
+      Expr* x = parse_expr100(lex, code, false);
+      x->chk_rvalue(lex.cur());
+      res = make_func_apply(res, x);
+      res->here = lex.cur().loc;
+      res->deduce_type(lex.cur());
+    }
+  }
+  return res;
+}
+
+// parse E { .method E | ~method E }
+Expr* parse_expr80(Lexer& lex, CodeBlob& code, bool nv) {
+  Expr* res = parse_expr90(lex, code, nv);
+  while (lex.tp() == _Ident && is_special_ident(lex.cur().val)) {
+    auto modify = is_tilde_ident(lex.cur().val);
+    auto obj = res;
+    if (modify) {
+      obj->chk_lvalue(lex.cur());
+    } else {
+      obj->chk_rvalue(lex.cur());
+    }
+    auto loc = lex.cur().loc;
+    auto name = lex.cur().val;
+    auto sym = sym::lookup_symbol(name);
+    if (!sym || !dynamic_cast<SymValFunc*>(sym->value)) {
+      auto name1 = symbols.lookup(lex.cur().str.substr(1));
+      if (name1) {
+        auto sym1 = sym::lookup_symbol(name1);
+        if (sym1 && dynamic_cast<SymValFunc*>(sym1->value)) {
+          name = name1;
+          sym = sym1;
+        }
+      }
+    }
+    check_global_func(lex.cur(), name);
+    if (verbosity >= 2) {
+      std::cerr << "using symbol `" << symbols.get_name(name) << "` for method call of " << lex.cur().str << std::endl;
+    }
+    sym = sym::lookup_symbol(name);
+    SymValFunc* val = sym ? dynamic_cast<SymValFunc*>(sym->value) : nullptr;
+    if (!val) {
+      lex.cur().error_at("undefined method identifier `", "`");
+    }
+    lex.next();
+    auto x = parse_expr100(lex, code, false);
+    x->chk_rvalue(lex.cur());
+    if (x->cls == Expr::_Tuple) {
+      res = new Expr{Expr::_Apply, name, {obj}};
+      res->args.insert(res->args.end(), x->args.begin(), x->args.end());
+    } else {
+      res = new Expr{Expr::_Apply, name, {obj, x}};
+    }
+    res->here = loc;
+    res->flags = Expr::_IsRvalue | (val->impure ? Expr::_IsImpure : 0);
+    res->deduce_type(lex.cur());
+    if (modify) {
+      // FIXME (use _LetFirst instead of _Letop)
+      auto tmp = res;
+      res = new Expr{Expr::_LetFirst, {obj->copy(), tmp}};
+      res->here = loc;
+      res->flags = tmp->flags;
+      res->set_val(name);
+      res->deduce_type(lex.cur());
+    }
+  }
+  return res;
+}
+
+// parse [ ~ ] E
+Expr* parse_expr75(Lexer& lex, CodeBlob& code, bool nv) {
+  if (lex.tp() == '~') {
+    sym_idx_t name = symbols.lookup_add("~_");
+    check_global_func(lex.cur(), name);
+    SrcLocation loc{lex.cur().loc};
+    lex.next();
+    auto x = parse_expr80(lex, code, false);
+    x->chk_rvalue(lex.cur());
+    auto res = new Expr{Expr::_Apply, name, {x}};
+    res->here = loc;
+    res->set_val('~');
+    res->flags = Expr::_IsRvalue;
+    res->deduce_type(lex.cur());
+    return res;
+  } else {
+    return parse_expr80(lex, code, nv);
+  }
+}
+
+// parse E { (* | / | % | /% ) E }
+Expr* parse_expr30(Lexer& lex, CodeBlob& code, bool nv) {
+  Expr* res = parse_expr75(lex, code, nv);
+  while (lex.tp() == '*' || lex.tp() == '/' || lex.tp() == '%' || lex.tp() == _DivMod || lex.tp() == _DivC ||
+         lex.tp() == _DivR || lex.tp() == '&') {
+    res->chk_rvalue(lex.cur());
+    int t = lex.tp();
+    sym_idx_t name = symbols.lookup_add(std::string{"_"} + lex.cur().str + "_");
+    SrcLocation loc{lex.cur().loc};
+    check_global_func(lex.cur(), name);
+    lex.next();
+    auto x = parse_expr75(lex, code, false);
+    x->chk_rvalue(lex.cur());
+    res = new Expr{Expr::_Apply, name, {res, x}};
+    res->here = loc;
+    res->set_val(t);
+    res->flags = Expr::_IsRvalue;
+    res->deduce_type(lex.cur());
+  }
+  return res;
+}
+
+// parse [-] E { (+ | - | `|` ) E }
+Expr* parse_expr20(Lexer& lex, CodeBlob& code, bool nv) {
+  Expr* res;
+  int t = lex.tp();
+  if (t == '-') {
+    sym_idx_t name = symbols.lookup_add("-_");
+    check_global_func(lex.cur(), name);
+    SrcLocation loc{lex.cur().loc};
+    lex.next();
+    auto x = parse_expr30(lex, code, false);
+    x->chk_rvalue(lex.cur());
+    res = new Expr{Expr::_Apply, name, {x}};
+    res->here = loc;
+    res->set_val(t);
+    res->flags = Expr::_IsRvalue;
+    res->deduce_type(lex.cur());
+  } else {
+    res = parse_expr30(lex, code, nv);
+  }
+  while (lex.tp() == '-' || lex.tp() == '+' || lex.tp() == '|') {
+    res->chk_rvalue(lex.cur());
+    t = lex.tp();
+    sym_idx_t name = symbols.lookup_add(std::string{"_"} + lex.cur().str + "_");
+    check_global_func(lex.cur(), name);
+    SrcLocation loc{lex.cur().loc};
+    lex.next();
+    auto x = parse_expr30(lex, code, false);
+    x->chk_rvalue(lex.cur());
+    res = new Expr{Expr::_Apply, name, {res, x}};
+    res->here = loc;
+    res->set_val(t);
+    res->flags = Expr::_IsRvalue;
+    res->deduce_type(lex.cur());
+  }
+  return res;
+}
+
+// parse E { ( << | >> | >>~ | >>^ ) E }
+Expr* parse_expr17(Lexer& lex, CodeBlob& code, bool nv) {
+  Expr* res = parse_expr20(lex, code, nv);
+  while (lex.tp() == _Lshift || lex.tp() == _Rshift || lex.tp() == _RshiftC || lex.tp() == _RshiftR) {
+    res->chk_rvalue(lex.cur());
+    int t = lex.tp();
+    sym_idx_t name = symbols.lookup_add(std::string{"_"} + lex.cur().str + "_");
+    check_global_func(lex.cur(), name);
+    SrcLocation loc{lex.cur().loc};
+    lex.next();
+    auto x = parse_expr20(lex, code, false);
+    x->chk_rvalue(lex.cur());
+    res = new Expr{Expr::_Apply, name, {res, x}};
+    res->here = loc;
+    res->set_val(t);
+    res->flags = Expr::_IsRvalue;
+    res->deduce_type(lex.cur());
+  }
+  return res;
+}
+
+// parse E [ (== | < | > | <= | >= | != | <=> ) E ]
+Expr* parse_expr15(Lexer& lex, CodeBlob& code, bool nv) {
+  Expr* res = parse_expr17(lex, code, nv);
+  if (lex.tp() == _Eq || lex.tp() == '<' || lex.tp() == '>' || lex.tp() == _Leq || lex.tp() == _Geq ||
+      lex.tp() == _Neq || lex.tp() == _Spaceship) {
+    res->chk_rvalue(lex.cur());
+    int t = lex.tp();
+    sym_idx_t name = symbols.lookup_add(std::string{"_"} + lex.cur().str + "_");
+    check_global_func(lex.cur(), name);
+    SrcLocation loc{lex.cur().loc};
+    lex.next();
+    auto x = parse_expr17(lex, code, false);
+    x->chk_rvalue(lex.cur());
+    res = new Expr{Expr::_Apply, name, {res, x}};
+    res->here = loc;
+    res->set_val(t);
+    res->flags = Expr::_IsRvalue;
+    res->deduce_type(lex.cur());
+  }
+  return res;
+}
+
+// parse E [ ? E : E ]
+Expr* parse_expr13(Lexer& lex, CodeBlob& code, bool nv) {
+  Expr* res = parse_expr15(lex, code, nv);
+  if (lex.tp() == '?') {
+    res->chk_rvalue(lex.cur());
+    SrcLocation loc{lex.cur().loc};
+    lex.next();
+    auto x = parse_expr(lex, code, false);
+    x->chk_rvalue(lex.cur());
+    lex.expect(':');
+    auto y = parse_expr13(lex, code, false);
+    y->chk_rvalue(lex.cur());
+    res = new Expr{Expr::_CondExpr, {res, x, y}};
+    res->here = loc;
+    res->flags = Expr::_IsRvalue;
+    res->deduce_type(lex.cur());
+  }
+  return res;
+}
+
+// parse LE1 (= | += | -= | ... ) E2
+Expr* parse_expr10(Lexer& lex, CodeBlob& code, bool nv) {
+  auto x = parse_expr13(lex, code, nv);
+  int t = lex.tp();
+  if (t == _PlusLet || t == _MinusLet || t == _TimesLet || t == _DivLet || t == _DivRLet || t == _DivCLet ||
+      t == _ModLet || t == _LshiftLet || t == _RshiftLet || t == _RshiftCLet || t == _RshiftRLet) {
+    x->chk_lvalue(lex.cur());
+    x->chk_rvalue(lex.cur());
+    sym_idx_t name = symbols.lookup_add(std::string{"^_"} + lex.cur().str + "_");
+    check_global_func(lex.cur(), name);
+    SrcLocation loc{lex.cur().loc};
+    lex.next();
+    auto y = parse_expr10(lex, code, false);
+    y->chk_rvalue(lex.cur());
+    Expr* z = new Expr{Expr::_Apply, name, {x, y}};
+    z->here = loc;
+    z->set_val(t);
+    z->flags = Expr::_IsRvalue;
+    z->deduce_type(lex.cur());
+    Expr* res = new Expr{Expr::_Letop, {x->copy(), z}};
+    res->here = loc;
+    res->flags = (x->flags & ~Expr::_IsType) | Expr::_IsRvalue;
+    res->set_val(t);
+    res->deduce_type(lex.cur());
+    return res;
+  } else if (t == '=') {
+    x->chk_lvalue(lex.cur());
+    SrcLocation loc{lex.cur().loc};
+    lex.next();
+    auto y = parse_expr10(lex, code, false);
+    y->chk_rvalue(lex.cur());
+    x->predefine_vars();
+    x->define_new_vars(code);
+    Expr* res = new Expr{Expr::_Letop, {x, y}};
+    res->here = loc;
+    res->flags = (x->flags & ~Expr::_IsType) | Expr::_IsRvalue;
+    res->set_val(t);
+    res->deduce_type(lex.cur());
+    return res;
+  } else {
+    return x;
+  }
+}
+
+Expr* parse_expr(Lexer& lex, CodeBlob& code, bool nv) {
+  return parse_expr10(lex, code, nv);
+}
+
+namespace blk_fl {
+enum { end = 1, ret = 2, empty = 4 };
+typedef int val;
+constexpr val init = end | empty;
+void combine(val& x, const val y) {
+  x |= y & ret;
+  x &= y | ~(end | empty);
+}
+void combine_parallel(val& x, const val y) {
+  x &= y | ~(ret | empty);
+  x |= y & end;
+}
+}  // namespace blk_fl
+
+blk_fl::val parse_return_stmt(Lexer& lex, CodeBlob& code) {
+  auto expr = parse_expr(lex, code);
+  expr->chk_rvalue(lex.cur());
+  try {
+    // std::cerr << "in return: ";
+    unify(expr->e_type, code.ret_type);
+  } catch (UnifyError& ue) {
+    std::ostringstream os;
+    os << "previous function return type " << code.ret_type
+       << " cannot be unified with return statement expression type " << expr->e_type << ": " << ue;
+    lex.cur().error(os.str());
+  }
+  std::vector<var_idx_t> tmp_vars = expr->pre_compile(code);
+  code.emplace_back(lex.cur().loc, Op::_Return, std::move(tmp_vars));
+  lex.expect(';');
+  return blk_fl::ret;
+}
+
+blk_fl::val parse_implicit_ret_stmt(Lexer& lex, CodeBlob& code) {
+  auto ret_type = TypeExpr::new_unit();
+  try {
+    // std::cerr << "in implicit return: ";
+    unify(ret_type, code.ret_type);
+  } catch (UnifyError& ue) {
+    std::ostringstream os;
+    os << "previous function return type " << code.ret_type
+       << " cannot be unified with implicit end-of-block return type " << ret_type << ": " << ue;
+    lex.cur().error(os.str());
+  }
+  code.emplace_back(lex.cur().loc, Op::_Return);
+  return blk_fl::ret;
+}
+
+blk_fl::val parse_stmt(Lexer& lex, CodeBlob& code);
+
+blk_fl::val parse_block_stmt(Lexer& lex, CodeBlob& code, bool no_new_scope = false) {
+  lex.expect('{');
+  if (!no_new_scope) {
+    sym::open_scope(lex);
+  }
+  blk_fl::val res = blk_fl::init;
+  bool warned = false;
+  while (lex.tp() != '}') {
+    if (!(res & blk_fl::end) && !warned) {
+      lex.cur().loc.show_warning("unreachable code");
+      warned = true;
+    }
+    blk_fl::combine(res, parse_stmt(lex, code));
+  }
+  if (!no_new_scope) {
+    sym::close_scope(lex);
+  }
+  lex.expect('}');
+  return res;
+}
+
+blk_fl::val parse_repeat_stmt(Lexer& lex, CodeBlob& code) {
+  SrcLocation loc{lex.cur().loc};
+  lex.expect(_Repeat);
+  auto expr = parse_expr(lex, code);
+  expr->chk_rvalue(lex.cur());
+  auto cnt_type = TypeExpr::new_atomic(_Int);
+  try {
+    unify(expr->e_type, cnt_type);
+  } catch (UnifyError& ue) {
+    std::ostringstream os;
+    os << "repeat count value of type " << expr->e_type << " is not an integer: " << ue;
+    lex.cur().error(os.str());
+  }
+  std::vector<var_idx_t> tmp_vars = expr->pre_compile(code);
+  if (tmp_vars.size() != 1) {
+    lex.cur().error("repeat count value is not a singleton");
+  }
+  Op& repeat_op = code.emplace_back(loc, Op::_Repeat, tmp_vars);
+  code.push_set_cur(repeat_op.block0);
+  blk_fl::val res = parse_block_stmt(lex, code);
+  code.close_pop_cur(lex.cur().loc);
+  return res | blk_fl::end;
+}
+
+blk_fl::val parse_while_stmt(Lexer& lex, CodeBlob& code) {
+  SrcLocation loc{lex.cur().loc};
+  lex.expect(_While);
+  auto expr = parse_expr(lex, code);
+  expr->chk_rvalue(lex.cur());
+  auto cnt_type = TypeExpr::new_atomic(_Int);
+  try {
+    unify(expr->e_type, cnt_type);
+  } catch (UnifyError& ue) {
+    std::ostringstream os;
+    os << "while condition value of type " << expr->e_type << " is not an integer: " << ue;
+    lex.cur().error(os.str());
+  }
+  Op& while_op = code.emplace_back(loc, Op::_While);
+  code.push_set_cur(while_op.block0);
+  while_op.left = expr->pre_compile(code);
+  code.close_pop_cur(lex.cur().loc);
+  if (while_op.left.size() != 1) {
+    lex.cur().error("while condition value is not a singleton");
+  }
+  code.push_set_cur(while_op.block1);
+  blk_fl::val res1 = parse_block_stmt(lex, code);
+  code.close_pop_cur(lex.cur().loc);
+  return res1 | blk_fl::end;
+}
+
+blk_fl::val parse_do_stmt(Lexer& lex, CodeBlob& code) {
+  Op& while_op = code.emplace_back(lex.cur().loc, Op::_Until);
+  lex.expect(_Do);
+  code.push_set_cur(while_op.block0);
+  sym::open_scope(lex);
+  blk_fl::val res = parse_block_stmt(lex, code, true);
+  lex.expect(_Until);
+  auto expr = parse_expr(lex, code);
+  expr->chk_rvalue(lex.cur());
+  sym::close_scope(lex);
+  auto cnt_type = TypeExpr::new_atomic(_Int);
+  try {
+    unify(expr->e_type, cnt_type);
+  } catch (UnifyError& ue) {
+    std::ostringstream os;
+    os << "`until` condition value of type " << expr->e_type << " is not an integer: " << ue;
+    lex.cur().error(os.str());
+  }
+  while_op.left = expr->pre_compile(code);
+  code.close_pop_cur(lex.cur().loc);
+  if (while_op.left.size() != 1) {
+    lex.cur().error("`until` condition value is not a singleton");
+  }
+  return res & ~blk_fl::empty;
+}
+
+blk_fl::val parse_if_stmt(Lexer& lex, CodeBlob& code, int first_lex = _If) {
+  SrcLocation loc{lex.cur().loc};
+  lex.expect(first_lex);
+  auto expr = parse_expr(lex, code);
+  expr->chk_rvalue(lex.cur());
+  auto flag_type = TypeExpr::new_atomic(_Int);
+  try {
+    unify(expr->e_type, flag_type);
+  } catch (UnifyError& ue) {
+    std::ostringstream os;
+    os << "`if` condition value of type " << expr->e_type << " is not an integer: " << ue;
+    lex.cur().error(os.str());
+  }
+  std::vector<var_idx_t> tmp_vars = expr->pre_compile(code);
+  if (tmp_vars.size() != 1) {
+    lex.cur().error("condition value is not a singleton");
+  }
+  Op& if_op = code.emplace_back(loc, Op::_If, tmp_vars);
+  code.push_set_cur(if_op.block0);
+  blk_fl::val res1 = parse_block_stmt(lex, code);
+  blk_fl::val res2 = blk_fl::init;
+  code.close_pop_cur(lex.cur().loc);
+  if (lex.tp() == _Else) {
+    lex.expect(_Else);
+    code.push_set_cur(if_op.block1);
+    res2 = parse_block_stmt(lex, code);
+    code.close_pop_cur(lex.cur().loc);
+  } else if (lex.tp() == _Elseif || lex.tp() == _Elseifnot) {
+    code.push_set_cur(if_op.block1);
+    res2 = parse_if_stmt(lex, code, lex.tp());
+    code.close_pop_cur(lex.cur().loc);
+  } else {
+    if_op.block1 = std::make_unique<Op>(lex.cur().loc, Op::_Nop);
+  }
+  if (first_lex == _Ifnot || first_lex == _Elseifnot) {
+    std::swap(if_op.block0, if_op.block1);
+  }
+  blk_fl::combine_parallel(res1, res2);
+  return res1;
+}
+
+blk_fl::val parse_stmt(Lexer& lex, CodeBlob& code) {
+  switch (lex.tp()) {
+    case _Return: {
+      lex.next();
+      return parse_return_stmt(lex, code);
+    }
+    case '{': {
+      return parse_block_stmt(lex, code);
+    }
+    case ';': {
+      lex.next();
+      return blk_fl::init;
+    }
+    case _Repeat:
+      return parse_repeat_stmt(lex, code);
+    case _If:
+    case _Ifnot:
+      return parse_if_stmt(lex, code, lex.tp());
+    case _Do:
+      return parse_do_stmt(lex, code);
+    case _While:
+      return parse_while_stmt(lex, code);
+    default: {
+      auto expr = parse_expr(lex, code);
+      expr->chk_rvalue(lex.cur());
+      expr->pre_compile(code);
+      lex.expect(';');
+      return blk_fl::end;
+    }
+  }
+}
+
+CodeBlob* parse_func_body(Lexer& lex, FormalArgList arg_list, TypeExpr* ret_type) {
+  lex.expect('{');
+  CodeBlob* blob = new CodeBlob{ret_type};
+  blob->import_params(std::move(arg_list));
+  blk_fl::val res = blk_fl::init;
+  bool warned = false;
+  while (lex.tp() != '}') {
+    if (!(res & blk_fl::end) && !warned) {
+      lex.cur().loc.show_warning("unreachable code");
+      warned = true;
+    }
+    blk_fl::combine(res, parse_stmt(lex, *blob));
+  }
+  if (res & blk_fl::end) {
+    parse_implicit_ret_stmt(lex, *blob);
+  }
+  blob->close_blk(lex.cur().loc);
+  lex.expect('}');
+  return blob;
+}
+
+SymValAsmFunc* parse_asm_func_body(Lexer& lex, TypeExpr* func_type, const FormalArgList& arg_list, TypeExpr* ret_type,
+                                   bool impure = false) {
+  auto loc = lex.cur().loc;
+  lex.expect(_Asm);
+  int cnt = (int)arg_list.size();
+  int width = ret_type->get_width();
+  if (width < 0 || width > 16) {
+    throw src::ParseError{loc, "return type of an assembler built-in function must have a well-defined fixed width"};
+  }
+  if (arg_list.size() > 16) {
+    throw src::ParseError{loc, "assembler built-in function must have at most 16 arguments"};
+  }
+  std::vector<int> cum_arg_width;
+  cum_arg_width.push_back(0);
+  int tot_width = 0;
+  for (auto& arg : arg_list) {
+    int arg_width = std::get<TypeExpr*>(arg)->get_width();
+    if (arg_width < 0 || arg_width > 16) {
+      throw src::ParseError{std::get<SrcLocation>(arg),
+                            "parameters of an assembler built-in function must have a well-defined fixed width"};
+    }
+    cum_arg_width.push_back(tot_width += arg_width);
+  }
+  std::vector<AsmOp> asm_ops;
+  std::vector<int> arg_order, ret_order;
+  if (lex.tp() == '(') {
+    lex.expect('(');
+    if (lex.tp() != _Mapsto) {
+      std::vector<bool> visited(cnt, false);
+      for (int i = 0; i < cnt; i++) {
+        if (lex.tp() != _Ident) {
+          lex.expect(_Ident);
+        }
+        auto sym = sym::lookup_symbol(lex.cur().val);
+        int j;
+        for (j = 0; j < cnt; j++) {
+          if (std::get<SymDef*>(arg_list[j]) == sym) {
+            break;
+          }
+        }
+        if (j == cnt) {
+          lex.cur().error("formal argument name expected");
+        }
+        if (visited[j]) {
+          lex.cur().error("formal argument listed twice");
+        }
+        visited[j] = true;
+        int c1 = cum_arg_width[j], c2 = cum_arg_width[j + 1];
+        while (c1 < c2) {
+          arg_order.push_back(c1++);
+        }
+        lex.next();
+      }
+      assert(arg_order.size() == (unsigned)tot_width);
+    }
+    if (lex.tp() == _Mapsto) {
+      lex.expect(_Mapsto);
+      std::vector<bool> visited(width, false);
+      for (int i = 0; i < width; i++) {
+        if (lex.tp() != Lexem::Number || lex.cur().str.size() > 3) {
+          lex.expect(Lexem::Number);
+        }
+        int j = atoi(lex.cur().str.c_str());
+        if (j < 0 || j >= width || visited[j]) {
+          lex.cur().error("expected integer return value index 0 .. width-1");
+        }
+        visited[j] = true;
+        ret_order.push_back(j);
+        lex.next();
+      }
+    }
+    lex.expect(')');
+  }
+  while (lex.tp() == _String) {
+    asm_ops.push_back(AsmOp::Parse(lex.cur().str, cnt, width));
+    lex.next();
+    if (asm_ops.back().is_custom()) {
+      cnt = width;
+    }
+  }
+  if (asm_ops.empty()) {
+    throw src::ParseError{lex.cur().loc, "string with assembler instruction expected"};
+  }
+  lex.expect(';');
+  auto res = new SymValAsmFunc{func_type, asm_ops, impure};
+  res->arg_order = std::move(arg_order);
+  res->ret_order = std::move(ret_order);
+  return res;
+}
+
+void parse_func_def(Lexer& lex) {
+  SrcLocation loc{lex.cur().loc};
+  sym::open_scope(lex);
+  auto ret_type = parse_type(lex);
+  if (lex.tp() != _Ident) {
+    throw src::ParseError{lex.cur().loc, "function name identifier expected"};
+  }
+  Lexem func_name = lex.cur();
+  lex.next();
+  FormalArgList arg_list = parse_formal_args(lex);
+  bool impure = (lex.tp() == _Impure);
+  if (impure) {
+    lex.next();
+  }
+  td::RefInt256 method_id;
+  std::string method_name;
+  if (lex.tp() == _MethodId) {
+    lex.next();
+    if (lex.tp() == '(') {
+      lex.expect('(');
+      if (lex.tp() == Lexem::String) {
+        method_name = lex.cur().str;
+      } else if (lex.tp() == Lexem::Number) {
+        method_name = lex.cur().str;
+        method_id = td::string_to_int256(method_name);
+        if (method_id.is_null()) {
+          lex.cur().error_at("invalid integer constant `", "`");
+        }
+      } else {
+        throw src::ParseError{lex.cur().loc, "integer or string method identifier expected"};
+      }
+      lex.next();
+      lex.expect(')');
+    } else {
+      method_name = func_name.str;
+    }
+    if (method_id.is_null()) {
+      unsigned crc = td::crc16(method_name);
+      method_id = td::make_refint((crc & 0xffff) | 0x10000);
+    }
+  }
+  if (lex.tp() != ';' && lex.tp() != '{' && lex.tp() != _Asm) {
+    lex.expect('{', "function body block expected");
+  }
+  TypeExpr* func_type = TypeExpr::new_map(extract_total_arg_type(arg_list), ret_type);
+  if (verbosity >= 1) {
+    std::cerr << "function " << func_name.str << " : " << func_type << std::endl;
+  }
+  SymDef* func_sym = sym::define_global_symbol(func_name.val, 0, loc);
+  assert(func_sym);
+  SymValFunc* func_sym_val = dynamic_cast<SymValFunc*>(func_sym->value);
+  if (func_sym->value) {
+    if (func_sym->value->type != SymVal::_Func || !func_sym_val) {
+      lex.cur().error("was not defined as a function before");
+    }
+    try {
+      unify(func_sym_val->sym_type, func_type);
+    } catch (UnifyError& ue) {
+      std::ostringstream os;
+      os << "previous type of function " << func_name.str << " : " << func_sym_val->sym_type
+         << " cannot be unified with new type " << func_type << ": " << ue;
+      lex.cur().error(os.str());
+    }
+  }
+  if (lex.tp() == ';') {
+    make_new_glob_func(func_sym, func_type, impure);
+    lex.next();
+  } else if (lex.tp() == '{') {
+    if (dynamic_cast<SymValAsmFunc*>(func_sym_val)) {
+      lex.cur().error("function `"s + func_name.str + "` has been already defined as an assembler built-in");
+    }
+    SymValCodeFunc* func_sym_code;
+    if (func_sym_val) {
+      func_sym_code = dynamic_cast<SymValCodeFunc*>(func_sym_val);
+      if (!func_sym_code) {
+        lex.cur().error("function `"s + func_name.str + "` has been already defined in an yet-unknown way");
+      }
+    } else {
+      func_sym_code = make_new_glob_func(func_sym, func_type, impure);
+    }
+    if (func_sym_code->code) {
+      lex.cur().error("redefinition of function `"s + func_name.str + "`");
+    }
+    CodeBlob* code = parse_func_body(lex, arg_list, ret_type);
+    code->name = func_name.str;
+    code->loc = loc;
+    // code->print(std::cerr);  // !!!DEBUG!!!
+    func_sym_code->code = code;
+  } else {
+    if (func_sym_val) {
+      if (dynamic_cast<SymValCodeFunc*>(func_sym_val)) {
+        lex.cur().error("function `"s + func_name.str + "` was already declared as an ordinary function");
+      }
+      if (dynamic_cast<SymValAsmFunc*>(func_sym_val)) {
+        lex.cur().error("redefinition of built-in assembler function `"s + func_name.str + "`");
+      }
+      lex.cur().error("redefinition of previously (somehow) defined function `"s + func_name.str + "`");
+    }
+    func_sym->value = parse_asm_func_body(lex, func_type, arg_list, ret_type, impure);
+  }
+  if (method_id.not_null()) {
+    auto val = dynamic_cast<SymVal*>(func_sym->value);
+    if (!val) {
+      lex.cur().error("cannot set method id for unknown function `"s + func_name.str + "`");
+    }
+    if (val->method_id.is_null()) {
+      val->method_id = std::move(method_id);
+    } else if (val->method_id != method_id) {
+      lex.cur().error("integer method identifier for `"s + func_name.str + "` changed to a different value");
+    }
+  }
+  if (verbosity >= 1) {
+    std::cerr << "new type of function " << func_name.str << " : " << func_type << std::endl;
+  }
+  sym::close_scope(lex);
+}
+
+bool parse_source(std::istream* is, const src::FileDescr* fdescr) {
+  src::SourceReader reader{is, fdescr};
+  Lexer lex{reader, true};
+  while (lex.tp() != _Eof) {
+    parse_func_def(lex);
+  }
+  return true;
+}
+
+bool parse_source_file(const char* filename) {
+  if (!filename || !*filename) {
+    throw src::Fatal{"source file name is an empty string"};
+  }
+  src::FileDescr* cur_source = new src::FileDescr{filename};
+  std::ifstream ifs{filename};
+  if (ifs.fail()) {
+    throw src::Fatal{std::string{"cannot open source file `"} + filename + "`"};
+  }
+  return parse_source(&ifs, cur_source);
+}
+
+bool parse_source_stdin() {
+  return parse_source(&std::cin, new src::FileDescr{"stdin", true});
+}
+
+}  // namespace funC
diff --git a/submodules/ton/tonlib-src/crypto/func/stack-transform.cpp b/submodules/ton/tonlib-src/crypto/func/stack-transform.cpp
new file mode 100644
index 0000000000..f682b49075
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/stack-transform.cpp
@@ -0,0 +1,826 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "func.h"
+
+namespace funC {
+
+/*
+ * 
+ *   GENERIC STACK TRANSFORMATIONS
+ * 
+ */
+
+StackTransform::StackTransform(std::initializer_list<int> list) {
+  *this = list;
+}
+
+StackTransform &StackTransform::operator=(std::initializer_list<int> list) {
+  if (list.size() > 255) {
+    invalidate();
+    return *this;
+  }
+  set_id();
+  if (!list.size()) {
+    return *this;
+  }
+  int m = (int)list.size();
+  d = list.begin()[m - 1] - (m - 1);
+  if (d >= 128 || d < -128) {
+    invalidate();
+    return *this;
+  }
+  for (int i = 0; i < m - 1; i++) {
+    int x = d + i;
+    int y = list.begin()[i];
+    if (y != x) {
+      if (x != (short)x || y != (short)y || n == max_n) {
+        invalidate();
+        return *this;
+      }
+      dp = std::max(dp, std::max(x, y) + 1);
+      A[n++] = std::make_pair((short)x, (short)y);
+    }
+  }
+  return *this;
+}
+
+bool StackTransform::assign(const StackTransform &other) {
+  if (!other.is_valid() || (unsigned)other.n > max_n) {
+    return invalidate();
+  }
+  d = other.d;
+  n = other.n;
+  dp = other.dp;
+  c = other.c;
+  invalid = false;
+  for (int i = 0; i < n; i++) {
+    A[i] = other.A[i];
+  }
+  return true;
+}
+
+int StackTransform::get(int x) const {
+  if (!is_valid()) {
+    return -1;
+  }
+  if (x <= c_start) {
+    return x - c;
+  }
+  x += d;
+  int i;
+  for (i = 0; i < n && A[i].first < x; i++) {
+  }
+  if (i < n && A[i].first == x) {
+    return A[i].second;
+  } else {
+    return x;
+  }
+}
+
+bool StackTransform::set(int x, int y, bool relaxed) {
+  if (!is_valid()) {
+    return false;
+  }
+  if (x < 0) {
+    return (relaxed && y == x + d) || invalidate();
+  }
+  if (!relaxed) {
+    touch(x);
+  }
+  x += d;
+  int i;
+  for (i = 0; i < n && A[i].first < x; i++) {
+  }
+  if (i < n && A[i].first == x) {
+    if (x != y) {
+      if (y != (short)y) {
+        return invalidate();
+      }
+      A[i].second = (short)y;
+    } else {
+      --n;
+      for (; i < n; i++) {
+        A[i] = A[i + 1];
+      }
+    }
+  } else {
+    if (x != y) {
+      if (x != (short)x || y != (short)y || n == max_n) {
+        return invalidate();
+      }
+      for (int j = n++; j > i; j--) {
+        A[j] = A[j - 1];
+      }
+      A[i].first = (short)x;
+      A[i].second = (short)y;
+      touch(x - d);
+      touch(y);
+    }
+  }
+  return true;
+}
+
+// f(x') = x' + d for all x' >= x ?
+bool StackTransform::is_trivial_after(int x) const {
+  return is_valid() && (!n || A[n - 1].first < x + d);
+}
+
+// card f^{-1}(y)
+int StackTransform::preimage_count(int y) const {
+  if (!is_valid()) {
+    return -1;
+  }
+  int count = (y >= d);
+  for (const auto &pair : A) {
+    if (pair.second == y) {
+      ++count;
+    } else if (pair.first == y) {
+      --count;
+    }
+  }
+  return count;
+}
+
+// f^{-1}(y)
+std::vector<int> StackTransform::preimage(int y) const {
+  if (!is_valid()) {
+    return {};
+  }
+  std::vector<int> res;
+  bool f = (y >= d);
+  for (const auto &pair : A) {
+    if (pair.first > y && f) {
+      res.push_back(y - d);
+      f = false;
+    }
+    if (pair.first == y) {
+      f = false;
+    } else if (pair.second == y) {
+      res.push_back(pair.first - d);
+    }
+  }
+  return res;
+}
+
+// is f:N->N bijective ?
+bool StackTransform::is_permutation() const {
+  if (!is_valid() || d) {
+    return false;
+  }
+  assert(n <= max_n);
+  std::array<int, max_n> X, Y;
+  for (int i = 0; i < n; i++) {
+    X[i] = A[i].first;
+    Y[i] = A[i].second;
+    if (Y[i] < 0) {
+      return false;
+    }
+  }
+  std::sort(Y.begin(), Y.begin() + n);
+  for (int i = 0; i < n; i++) {
+    if (X[i] != Y[i]) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool StackTransform::remove_negative() {
+  int s = 0;
+  while (s < n && A[s].first < d) {
+    ++s;
+  }
+  if (s) {
+    n -= s;
+    for (int i = 0; i < n; i++) {
+      A[i] = A[i + s];
+    }
+  }
+  return true;
+}
+
+int StackTransform::try_load(int &i, int offs) const {
+  return i < n ? A[i++].first + offs : inf_x;
+}
+
+bool StackTransform::try_store(int x, int y) {
+  if (x == y || x < d) {
+    return true;
+  }
+  if (n == max_n || x != (short)x || y != (short)y) {
+    return invalidate();
+  }
+  A[n].first = (short)x;
+  A[n++].second = (short)y;
+  return true;
+}
+
+// c := a * b
+bool StackTransform::compose(const StackTransform &a, const StackTransform &b, StackTransform &c) {
+  if (!a.is_valid() || !b.is_valid()) {
+    return c.invalidate();
+  }
+  c.d = a.d + b.d;
+  c.n = 0;
+  c.dp = std::max(a.dp, b.dp + a.d);
+  c.c = a.c + b.c;
+  c.invalid = false;
+  int i = 0, j = 0;
+  int x1 = a.try_load(i);
+  int x2 = b.try_load(j, a.d);
+  while (true) {
+    if (x1 < x2) {
+      int y = a.A[i - 1].second;
+      if (!c.try_store(x1, y)) {
+        return false;
+      }
+      x1 = a.try_load(i);
+    } else if (x2 < inf_x) {
+      if (x1 == x2) {
+        x1 = a.try_load(i);
+      }
+      int y = b.A[j - 1].second;
+      if (!c.try_store(x2, a(y))) {
+        return false;
+      }
+      x2 = b.try_load(j, a.d);
+    } else {
+      return true;
+    }
+  }
+}
+
+// this = this * other
+bool StackTransform::apply(const StackTransform &other) {
+  StackTransform res;
+  if (!compose(*this, other, res)) {
+    return invalidate();
+  }
+  return assign(res);
+}
+
+// this = other * this
+bool StackTransform::preapply(const StackTransform &other) {
+  StackTransform res;
+  if (!compose(other, *this, res)) {
+    return invalidate();
+  }
+  return assign(res);
+}
+
+StackTransform StackTransform::operator*(const StackTransform &b) const & {
+  StackTransform res;
+  compose(*this, b, res);
+  return res;
+}
+
+// this = this * other
+StackTransform &StackTransform::operator*=(const StackTransform &other) {
+  StackTransform res;
+  (compose(*this, other, res) && assign(res)) || invalidate();
+  return *this;
+}
+
+bool StackTransform::apply_xchg(int i, int j, bool relaxed) {
+  if (!is_valid() || i < 0 || j < 0) {
+    return invalidate();
+  }
+  if (i == j) {
+    return relaxed || touch(i);
+  }
+  int u = touch_get(i), v = touch_get(j);
+  return set(i, v) && set(j, u);
+}
+
+bool StackTransform::apply_push(int i) {
+  if (!is_valid() || i < 0) {
+    return invalidate();
+  }
+  int u = touch_get(i);
+  return shift(-1) && set(0, u);
+}
+
+bool StackTransform::apply_push_newconst() {
+  if (!is_valid()) {
+    return false;
+  }
+  return shift(-1) && set(0, c_start - c++);
+}
+
+bool StackTransform::apply_pop(int i) {
+  if (!is_valid() || i < 0) {
+    return invalidate();
+  }
+  if (!i) {
+    return touch(0) && shift(1);
+  } else {
+    return set(i, get(0)) && shift(1);
+  }
+}
+
+bool StackTransform::equal(const StackTransform &other, bool relaxed) const {
+  if (!is_valid() || !other.is_valid()) {
+    return false;
+  }
+  if (!(n == other.n && d == other.d)) {
+    return false;
+  }
+  for (int i = 0; i < n; i++) {
+    if (A[i] != other.A[i]) {
+      return false;
+    }
+  }
+  return relaxed || dp == other.dp;
+}
+
+StackTransform StackTransform::Xchg(int i, int j, bool relaxed) {
+  StackTransform t;
+  t.apply_xchg(i, j, relaxed);
+  return t;
+}
+
+StackTransform StackTransform::Push(int i) {
+  StackTransform t;
+  t.apply_push(i);
+  return t;
+}
+
+StackTransform StackTransform::Pop(int i) {
+  StackTransform t;
+  t.apply_pop(i);
+  return t;
+}
+
+bool StackTransform::is_xchg(int i, int j) const {
+  if (i == j) {
+    return is_id();
+  }
+  return is_valid() && !d && n == 2 && i >= 0 && j >= 0 && get(i) == j && get(j) == i;
+}
+
+bool StackTransform::is_xchg(int *i, int *j) const {
+  if (!is_valid() || d || n > 2 || !dp) {
+    return false;
+  }
+  if (!n) {
+    *i = *j = 0;
+    return true;
+  }
+  if (n != 2) {
+    return false;
+  }
+  int a = A[0].first, b = A[1].first;
+  if (A[0].second != b || A[1].second != a) {
+    return false;
+  }
+  *i = std::min(a, b);
+  *j = std::max(a, b);
+  return true;
+}
+
+bool StackTransform::is_push(int i) const {
+  return is_valid() && d == -1 && n == 1 && A[0].first == -1 && A[0].second == i;
+}
+
+bool StackTransform::is_push(int *i) const {
+  if (is_valid() && d == -1 && n == 1 && A[0].first == -1 && A[0].second >= 0) {
+    *i = A[0].second;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+// 1 2 3 4 .. = pop0
+// 0 2 3 4 .. = pop1
+// 1 0 3 4 .. = pop2
+// 1 2 0 4 .. = pop3
+bool StackTransform::is_pop(int i) const {
+  if (!is_valid() || d != 1 || n > 1 || i < 0) {
+    return false;
+  }
+  if (!i) {
+    return !n;
+  }
+  return n == 1 && A[0].first == i && !A[0].second;
+}
+
+bool StackTransform::is_pop(int *i) const {
+  if (!is_valid() || d != 1 || n > 1) {
+    return false;
+  }
+  if (!n) {
+    *i = 0;
+    return true;
+  }
+  if (n == 1 && !A[0].second) {
+    *i = A[0].first;
+    return true;
+  }
+  return false;
+}
+
+const StackTransform StackTransform::rot{2, 0, 1, 3};
+const StackTransform StackTransform::rot_rev{1, 2, 0, 3};
+
+bool StackTransform::is_rot() const {
+  return equal(rot, true);
+}
+
+bool StackTransform::is_rotrev() const {
+  return equal(rot_rev, true);
+}
+
+// XCHG s1,s(i) ; XCHG s0,s(j)
+bool StackTransform::is_xchg2(int i, int j) const {
+  StackTransform t;
+  return is_valid() && !d && t.apply_xchg(1, i) && t.apply_xchg(0, j) && t <= *this;
+}
+
+bool StackTransform::is_xchg2(int *i, int *j) const {
+  if (!is_valid() || d || n > 4 || n == 1 || dp < 2) {
+    return false;
+  }
+  *i = get(1);
+  *j = get(0);
+  if (!n) {
+    return true;
+  }
+  if (*i < 0 || *j < 0) {
+    return false;
+  }
+  if (n != 3) {
+    return is_xchg2(*i, *j);
+  }
+  if (*i) {
+    // XCHG2 s(i),s(i) = XCHG s1,s(i) ; XCHG s0,s(i) : 0->1, 1->i
+    *j = *i;
+  }  // XCHG2 s0,s(i) = XCHG s0,s1 ; XCHG s0,s(i) : 0->i, 1->0
+  return is_xchg2(*i, *j);
+}
+
+// XCHG s0,s(i) ; PUSH s(j)  = PUSH s(j') ; XCHG s1,s(i+1)
+// j'=j if j!=0, j!=i
+// j'=0 if j=i
+// j'=i if j=0
+bool StackTransform::is_xcpu(int i, int j) const {
+  StackTransform t;
+  return is_valid() && d == -1 && t.apply_xchg(0, i) && t.apply_push(j) && t <= *this;
+}
+
+bool StackTransform::is_xcpu(int *i, int *j) const {
+  if (!is_valid() || d != -1 || n > 3 || dp < 1) {
+    return false;
+  }
+  *i = get(1);
+  *j = get(0);
+  if (!*j) {
+    *j = *i;
+  } else if (*j == *i) {
+    *j = 0;
+  }
+  return is_xcpu(*i, *j);
+}
+
+// PUSH s(i) ; XCHG s0, s1 ; XCHG s0, s(j+1)
+bool StackTransform::is_puxc(int i, int j) const {
+  StackTransform t;
+  return is_valid() && d == -1 && t.apply_push(i) && t.apply_xchg(0, 1) && t.apply_xchg(0, j + 1) && t <= *this;
+}
+
+// j > 0 : 0 -> j, 1 -> i
+// j = 0 : 0 -> i, 1 -> 0  ( PUSH s(i) )
+// j = -1 : 0 -> 0, 1 -> i  ( PUSH s(i) ; XCHG s0, s1 )
+bool StackTransform::is_puxc(int *i, int *j) const {
+  if (!is_valid() || d != -1 || n > 3) {
+    return false;
+  }
+  *i = get(1);
+  *j = get(0);
+  if (!*i && is_push(*j)) {
+    std::swap(*i, *j);
+    return is_puxc(*i, *j);
+  }
+  if (!*j) {
+    --*j;
+  }
+  return is_puxc(*i, *j);
+}
+
+// PUSH s(i) ; PUSH s(j+1)
+bool StackTransform::is_push2(int i, int j) const {
+  StackTransform t;
+  return is_valid() && d == -2 && t.apply_push(i) && t.apply_push(j + 1) && t <= *this;
+}
+
+bool StackTransform::is_push2(int *i, int *j) const {
+  if (!is_valid() || d != -2 || n > 2) {
+    return false;
+  }
+  *i = get(1);
+  *j = get(0);
+  return is_push2(*i, *j);
+}
+
+// XCHG s2,s(i) ; XCHG s1,s(j) ; XCHG s0,s(k)
+bool StackTransform::is_xchg3(int *i, int *j, int *k) const {
+  if (!is_valid() || d || dp < 3 || !is_permutation()) {
+    return false;
+  }
+  for (int s = 2; s >= 0; s--) {
+    *i = get(s);
+    StackTransform t = Xchg(2, *i) * *this;
+    if (t.is_xchg2(j, k)) {
+      return true;
+    }
+  }
+  return false;
+}
+
+// XCHG s1,s(i) ; XCHG s0,s(j) ; PUSH s(k)
+bool StackTransform::is_xc2pu(int *i, int *j, int *k) const {
+  if (!is_valid() || d != -1 || dp < 2) {
+    return false;
+  }
+  for (int s = 2; s >= 1; s--) {
+    *i = get(s);
+    StackTransform t = Xchg(1, *i) * *this;
+    if (t.is_xcpu(j, k)) {
+      return true;
+    }
+  }
+  return false;
+}
+
+// XCHG s1,s(i) ; PUSH s(j) ; XCHG s0,s1 ; XCHG s0,s(k+1)
+bool StackTransform::is_xcpuxc(int *i, int *j, int *k) const {
+  if (!is_valid() || d != -1 || dp < 2) {
+    return false;
+  }
+  for (int s = 2; s >= 0; s--) {
+    *i = get(s);
+    StackTransform t = Xchg(1, *i) * *this;
+    if (t.is_puxc(j, k)) {
+      return true;
+    }
+  }
+  return false;
+}
+
+// XCHG s0,s(i) ; PUSH s(j) ; PUSH s(k+1)
+bool StackTransform::is_xcpu2(int *i, int *j, int *k) const {
+  if (!is_valid() || d != -2 || dp < 1) {
+    return false;
+  }
+  *i = get(2);
+  StackTransform t = Xchg(0, *i) * *this;
+  return t.is_push2(j, k);
+}
+
+// PUSH s(i) ; XCHG s0,s2 ; XCHG s1,s(j+1) ; XCHG s0,s(k+1)
+// 0 -> i or 1 -> i or 2 -> i ; i has two preimages
+// 0 -> k if k >= 2, k != j
+// 1 -> j=k if j = k >= 2
+// 1 -> j if j >= 2, k != 0
+// 0 -> j if j >= 2, k = 0
+// => i in {f(0), f(1), f(2)} ; j in {-1, 0, 1, f(0), f(1)} ; k in {-1, 0, 1, f(0), f(1)}
+bool StackTransform::is_puxc2(int *i, int *j, int *k) const {
+  if (!is_valid() || d != -1 || dp < 2) {
+    return false;
+  }
+  for (int s = 2; s >= 0; s--) {
+    *i = get(s);
+    if (preimage_count(*i) != 2) {
+      continue;
+    }
+    for (int u = -1; u <= 3; u++) {
+      *j = (u >= 2 ? get(u - 2) : u);
+      for (int v = -1; v <= 3; v++) {
+        *k = (v >= 2 ? get(v - 2) : v);
+        if (is_puxc2(*i, *j, *k)) {
+          return true;
+        }
+      }
+    }
+  }
+  return false;
+}
+
+// PUSH s(i) ; XCHG s0,s2 ; XCHG s1,s(j+1) ; XCHG s0,s(k+1)
+bool StackTransform::is_puxc2(int i, int j, int k) const {
+  StackTransform t;
+  return is_valid() && d == -1 && dp >= 2          // basic checks
+         && t.apply_push(i) && t.apply_xchg(0, 2)  // PUSH s(i) ; XCHG s0,s2
+         && t.apply_xchg(1, j + 1)                 // XCHG s1,s(j+1)
+         && t.apply_xchg(0, k + 1) && t <= *this;  // XCHG s0,s(k+2)
+}
+
+// PUSH s(i) ; XCHG s0,s1 ; XCHG s0,s(j+1) ; PUSH s(k+1)
+bool StackTransform::is_puxcpu(int *i, int *j, int *k) const {
+  if (!is_valid() || d != -2 || dp < 1) {
+    return false;
+  }
+  StackTransform t = *this;
+  if (t.apply_pop() && t.is_puxc(i, j)) {
+    int y = get(0);
+    auto v = t.preimage(y);
+    if (!v.empty()) {
+      *k = v[0] - 1;
+      t.apply_push(*k + 1);
+      return t <= *this;
+    }
+  }
+  return false;
+}
+
+// PUSH s(i) ; XCHG s0,s1 ; PUSH s(j+1) ; XCHG s0,s1 ; XCHG s0,s(k+2)
+// 2 -> i;  1 -> j (if j >= 1, k != -1), 1 -> i (if j = 0, k != -1), 1 -> 0 (if j = -1, k != -1)
+// 0 -> k (if k >= 1), 0 -> i (if k = 0), 0 -> j (if k = -1, j >= 1)
+bool StackTransform::is_pu2xc(int *i, int *j, int *k) const {
+  if (!is_valid() || d != -2 || dp < 1) {
+    return false;
+  }
+  *i = get(2);
+  for (int v = -2; v <= 1; v++) {
+    *k = (v <= 0 ? v : get(0));  // one of -2, -1, 0, get(0)
+    for (int u = -1; u <= 1; u++) {
+      *j = (u <= 0 ? u : get(v != -1));  // one of -1, 0, get(0), get(1)
+      if (is_pu2xc(*i, *j, *k)) {
+        return true;
+      }
+    }
+  }
+  return false;
+}
+
+bool StackTransform::is_pu2xc(int i, int j, int k) const {
+  StackTransform t;
+  return is_valid() && d == -2 && dp >= 1              // basic checks
+         && t.apply_push(i) && t.apply_xchg(0, 1)      // PUSH s(i) ; XCHG s0,s1
+         && t.apply_push(j + 1) && t.apply_xchg(0, 1)  // PUSH s(j+1) ; XCHG s0,s1
+         && t.apply_xchg(0, k + 2) && t <= *this;      // XCHG s0,s(k+2)
+}
+
+// PUSH s(i) ; PUSH s(j+1) ; PUSH s(k+2)
+bool StackTransform::is_push3(int i, int j, int k) const {
+  StackTransform t;
+  return is_valid() && d == -3 && t.apply_push(i) && t.apply_push(j + 1) && t.apply_push(k + 2) && t <= *this;
+}
+
+bool StackTransform::is_push3(int *i, int *j, int *k) const {
+  if (!is_valid() || d != -3 || n > 3) {
+    return false;
+  }
+  *i = get(2);
+  *j = get(1);
+  *k = get(0);
+  return is_push3(*i, *j, *k);
+}
+
+bool StackTransform::is_blkswap(int *i, int *j) const {
+  if (!is_valid() || d || !is_permutation()) {
+    return false;
+  }
+  *j = get(0);
+  if (*j <= 0) {
+    return false;
+  }
+  auto v = preimage(0);
+  if (v.size() != 1) {
+    return false;
+  }
+  *i = v[0];
+  return *i > 0 && is_blkswap(*i, *j);
+}
+
+bool StackTransform::is_blkswap(int i, int j) const {
+  if (!is_valid() || d || i <= 0 || j <= 0 || dp < i + j || !is_trivial_after(i + j)) {
+    return false;
+  }
+  for (int s = 0; s < i; s++) {
+    if (get(s) != s + j) {
+      return false;
+    }
+  }
+  for (int s = 0; s < j; s++) {
+    if (get(s + i) != s) {
+      return false;
+    }
+  }
+  return true;
+}
+
+// equivalent to i times DROP
+bool StackTransform::is_blkdrop(int *i) const {
+  if (is_valid() && d > 0 && !n) {
+    *i = d;
+    return true;
+  }
+  return false;
+}
+
+// equivalent to i times PUSH s(j)
+bool StackTransform::is_blkpush(int *i, int *j) const {
+  if (!is_valid() || d >= 0) {
+    return false;
+  }
+  *i = -d;
+  *j = get(*i - 1);
+  return is_blkpush(*i, *j);
+}
+
+bool StackTransform::is_blkpush(int i, int j) const {
+  if (!is_valid() || d >= 0 || d != -i || j < 0 || dp < i + j || !is_trivial_after(i)) {
+    return false;
+  }
+  StackTransform t;
+  for (int s = 0; s < i; s++) {
+    if (!t.apply_push(j)) {
+      return false;
+    }
+  }
+  return t <= *this;
+}
+
+bool StackTransform::is_reverse(int *i, int *j) const {
+  if (!is_valid() || d || !is_permutation() || n < 2) {
+    return false;
+  }
+  *j = A[0].first;
+  *i = A[n - 1].first - A[0].first + 1;
+  return is_reverse(*i, *j);
+}
+
+bool StackTransform::is_reverse(int i, int j) const {
+  if (!is_valid() || d || !is_trivial_after(i + j) || n < 2 || A[0].first != j || A[n - 1].first != j + i - 1) {
+    return false;
+  }
+  for (int s = 0; s < i; s++) {
+    if (get(j + s) != j + i - 1 - s) {
+      return false;
+    }
+  }
+  return true;
+}
+
+// 0 i+1 i+2 ... == i*NIP
+// j i+1 i+2 ... == XCHG s(i),s(j) ; BLKDROP i
+bool StackTransform::is_nip_seq(int i, int j) const {
+  return is_valid() && d == i && i > j && j >= 0 && n == 1 && A[0].first == i && A[0].second == j;
+}
+
+bool StackTransform::is_nip_seq(int *i) const {
+  *i = d;
+  return is_nip_seq(*i);
+}
+
+bool StackTransform::is_nip_seq(int *i, int *j) const {
+  if (is_valid() && n > 0) {
+    *i = d;
+    *j = A[0].second;
+    return is_nip_seq(*i, *j);
+  } else {
+    return false;
+  }
+}
+
+void StackTransform::show(std::ostream &os, int mode) const {
+  if (!is_valid()) {
+    os << "<invalid>";
+    return;
+  }
+  int mi = 0, ma = 0;
+  if (n > 0 && A[0].first < d) {
+    mi = A[0].first - d;
+  }
+  if (n > 0) {
+    ma = std::max(ma, A[n - 1].first - d + 1);
+  }
+  ma = std::max(ma + 1, dp - d);
+  os << '{';
+  if (dp == d) {
+    os << '|';
+  }
+  for (int i = mi; i < ma; i++) {
+    os << get(i) << (i == -1 ? '?' : (i == dp - d - 1 ? '|' : ' '));
+  }
+  os << get(ma) << "..}";
+}
+
+}  // namespace funC
diff --git a/submodules/ton/tonlib-src/crypto/func/test/a6.fc b/submodules/ton/tonlib-src/crypto/func/test/a6.fc
new file mode 100644
index 0000000000..06eeed9fe3
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/test/a6.fc
@@ -0,0 +1,85 @@
+(int, int) f(int a, int b, int c, int d, int e, int f) {
+  ;; solve a 2x2 linear equation
+  int D = a * d - b * c;
+  int Dx = e * d - b * f;
+  int Dy = a * f - e * c;
+  return (Dx / D, Dy / D);
+}
+
+int calc_phi() {
+  var n = 1;
+  repeat (70) { n *= 10; }
+  var p = var q = 1;
+  do {
+    (p, q) = (q, p + q);
+  } until (q > n);
+  return muldivr(p, n, q);
+}
+
+int calc_sqrt2() {
+  var n = 1;
+  repeat (70) { n *= 10; }
+  var p = var q = 1;
+  do {
+    var t = p + q;
+    (p, q) = (q, t + q);
+  } until (q > n);
+  return muldivr(p, n, q);
+}
+
+var calc_root(m) {
+  int base = 1;
+  repeat(70) { base *= 10; }
+  var (a, b, c) = (1, 0, - m);
+  var (p1, q1, p2, q2) = (1, 0, 0, 1);
+  do {
+    int k = -1;
+    var (a1, b1, c1) = (0, 0, 0);
+    do {
+      k += 1;
+      (a1, b1, c1) = (a, b, c);
+      c += b;
+      c += b += a;
+    } until (c > 0);
+    (a, b, c) = (- c1, - b1, - a1);
+    (p1, q1) = (k * p1 + q1, p1);
+    (p2, q2) = (k * p2 + q2, p2);
+  } until (p1 > base);
+  return (p1, q1, p2, q2);
+}
+
+{-
+operator _/%_ infix 20;
+
+(int, int) ((int x) /% (int y)) {
+  return (x / y, x % y);
+}
+
+(int, int) _/%_ (int x, int y) {
+  return (x / y, x % y);
+}
+-}
+{-
+< type A, type B, type C >
+(B, C, A) rot (A x, B y, C z) {
+  return (y, z, x);
+}
+-}
+int ataninv(int base, int q) { ;; computes base*atan(1/q)
+  base /~= q;
+  q *= - q;
+  int sum = 0;
+  int n = 1;
+  do {
+    sum += base /~ n;
+    base /~= q;
+    n += 2;
+  } until base == 0;
+  return sum;
+}
+
+int calc_pi() {
+  int base = 64;
+  repeat (70) { base *= 10; }
+  return (ataninv(base << 2, 5) - ataninv(base, 239)) >>~ 4;
+}
diff --git a/submodules/ton/tonlib-src/crypto/func/test/a6.fp b/submodules/ton/tonlib-src/crypto/func/test/a6.fp
new file mode 100644
index 0000000000..00c2e76e44
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/test/a6.fp
@@ -0,0 +1,75 @@
+f(int a, int b, int c, int d, int e, int f) : (int, int) {
+  var D  = a * d - b * c;
+  var Dx : int = e * d - b * f;
+  var Dy : int = a * f - e * c;
+  return (Dx / D, Dy / D);
+}
+
+calc_phi() : int = {
+  var n : int = 1;
+  repeat (10) {
+    n *= 10;
+  }
+  var p = var q = 1;
+  do {
+    (p, q) = (q, p + q);
+  } until q > n;
+  return muldivr(p, n, q);
+}
+
+calc_sqrt2() : int = {
+  var n = 1;
+  repeat (70) { n *= 10; }
+  var p = var q = 1;
+  do {
+    var t = p + q;
+    (p, q) = (q, t + q);
+  } until q > n;
+  return muldivr(p, n, q);
+}
+
+calc_phi() : int = {
+  var n = 1;
+  repeat (70) { n *= 10; }
+  var p = var q = 1;
+  do {
+    (p, q) = (q, p + q);
+  } until q > n;
+  return muldivr(p, n, q);
+}
+
+operator _/%_ infix 20;
+
+(x : int) /% (y : int) : (int, int) = {
+  return (x / y, x % y);
+}
+
+{-
+_/%_ (int x, int y) : (int, int) = {
+  return (x / y, x % y);
+}
+-}
+
+rot < A : type, B : type, C : type >
+  (x : A, y : B, z : C) : (B, C, A) {
+  return (y, z, x);
+}
+
+ataninv(base : int, q : int) : int { ;; computes base*atan(1/q)
+  base /~= q;
+  q *= - q;
+  var sum : int = 0;
+  var n = 1;
+  do {
+    sum += base /~ n;
+    base /~= q;
+    n += 2;
+  } while base;
+  return sum;
+}
+
+calc_pi() : int {
+  var base = 64;
+  repeat (70) { base *= 10; }
+  return (ataninv(base << 2, 5) - ataninv(base, 239)) >>~ 4;
+}
diff --git a/submodules/ton/tonlib-src/crypto/func/test/a6_1.fc b/submodules/ton/tonlib-src/crypto/func/test/a6_1.fc
new file mode 100644
index 0000000000..9af7f2549b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/test/a6_1.fc
@@ -0,0 +1,6 @@
+(int, int) f(int a, int b, int c, int d, int e, int f) {
+  int D = a * d - b * c;
+  int Dx = e * d - b * f;
+  int Dy = a * f - e * c;
+  return (Dx / D, Dy / D);
+}
diff --git a/submodules/ton/tonlib-src/crypto/func/test/a6_2.fc b/submodules/ton/tonlib-src/crypto/func/test/a6_2.fc
new file mode 100644
index 0000000000..970ad62423
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/test/a6_2.fc
@@ -0,0 +1,130 @@
+var f(a, b, c, d, e, f) {
+  var D = a * d - b * c;
+  var Dx = e * d - b * f;
+  var Dy = a * f - e * c;
+  return (Dx / D, Dy / D);
+}
+
+var test8() {
+  return -4;
+}
+
+var test3(a) {
+  int x = a * 10;
+  a += 1;
+  int x = x + 3;
+  {
+    int y = x + 2;
+    x = y + a;
+  }
+  int z = 5;
+  return x * (z + a);
+}
+
+var test2(a) {
+  (var x, var y) = a /% 10;
+  return x + y;
+}
+
+var test2a(a) {
+  var (x, y) = a /% 10;
+  return x + y;
+}
+
+var test2b(a) {
+  var z = a /% 10;
+  return _+_ z;
+}
+
+var test2c(a) {
+  return _+_ (a /% 10);
+}
+
+var twice(f, x) {
+  return f (f x);
+}
+
+var test() {
+  return f(1, 2, 3, 4, 7, 17);
+}
+
+var rot(a, b, c) {
+  return (b, c, a);
+}
+
+var rot_int(int a, int b, int c) {
+  return (b, c, a);
+}
+
+(int, _) dup_int(x) {
+  return (x, x);
+}
+
+var calc_phi() {
+  var n = 10;
+  n *= n;
+  n *= n;
+  n *= n;
+  n *= n;
+  n *= n;
+  n *= n;
+  var p = var q = 1;
+  (p, q) = (q, p + q);
+  (p, q) = (q, p + q);
+  (p, q) = (q, p + q);
+  (p, q) = (q, p + q);
+  (p, q) = (q, p + q);
+  (p, q) = (q, p + q);
+  (p, q) = (q, p + q);
+  return muldivr(p, n, q);
+}
+
+var t0() {
+  var x = 1;
+  return x;
+}
+
+var t1() {
+  return 2;
+}
+
+var t2(int x) {
+  return 2;
+  return x += 1;
+}
+
+var t3(int x, var y) {
+  int z = (x + y) * (x - y);
+}
+
+var t3b(int x, var y) {
+  int z = (x + y) * (x - y);
+  return z;
+}
+
+var t4((int, int, int) z) {
+  var (_, u, _) = z;
+  return u;
+}
+
+int foo(int t);
+
+var t5(x) {
+  var f = t2;
+  return twice(f, x) * f(x);
+}
+
+var proj1(a, b) { return a; }
+var proj1a(a, b) { var c = a; return c; }
+var proj1b(a, b) { int c = a; return c; }
+var proj1c(a, b) { var c = a + 2; return c; }
+var proj1d(a, b) { return a + 2; }
+var proj1e(int a, _) { return a; }
+int proj1f(_ a, int) { return a; }
+int proj1g(int, a) { return a; }
+
+var test1(a) {
+  a = a + 1;
+  return a;
+}
+
diff --git a/submodules/ton/tonlib-src/crypto/func/test/a7.fc b/submodules/ton/tonlib-src/crypto/func/test/a7.fc
new file mode 100644
index 0000000000..f86be30a10
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/test/a7.fc
@@ -0,0 +1,12 @@
+int steps(int x) {
+  var n = 0;
+  while (x > 1) {
+    n += 1;
+    if (x & 1) {
+      x = 3 * x + 1;
+    } else {
+      x >>= 1;
+    }
+  }
+  return n;
+}
diff --git a/submodules/ton/tonlib-src/crypto/func/test/a8.fc b/submodules/ton/tonlib-src/crypto/func/test/a8.fc
new file mode 100644
index 0000000000..1cd18a3394
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/test/a8.fc
@@ -0,0 +1,28 @@
+int A(int a, int b, int c, int d, int e, int f) {
+  return muldiv(a, b, c) + muldiv(d, e, f);
+}
+
+int B(int a, int b, int c, int d, int e, int f) {
+  return muldiv(a, b, c) + muldiv(b, d, e) + f;
+}
+
+int C(int a, int b, int c, int d, int e, int f) {
+  return muldiv(a, b, c) + muldiv(b, d, c) + muldiv(d, d, f);
+}
+
+int D(int a, int b, int c, int d, int e, int f) {
+  return muldiv(a, b, c) + muldiv(b, d, c) + muldiv(e, e, f);
+}
+
+int E(int a, int b, int c, int d, int e, int f) {
+  return muldiv(a, b, c) + muldiv(c, d, e) + muldiv(c, c, f);
+}
+
+int F(int a, int b, int c, int d, int e, int f) {
+  return muldiv(a, b, c) + muldiv(a, d, c) + muldiv(f, f, e);
+}
+
+int G(int a, int b, int c, int d, int e, int f) {
+  return muldiv(a, b, c) + muldiv(b, c, d) + muldiv(b, c, e) + f;
+}
+
diff --git a/submodules/ton/tonlib-src/crypto/func/test/a9.fc b/submodules/ton/tonlib-src/crypto/func/test/a9.fc
new file mode 100644
index 0000000000..e9cc14507d
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/test/a9.fc
@@ -0,0 +1,23 @@
+int f(int x) {
+  if (2 * x + 1 == 7) {
+    return x + 17;
+  } else {
+    return 239;
+  }
+}
+
+int f2(int x) {
+  return 2 * x + 1 == 6 ? x + 17 : 239;
+}
+
+int g(int x) {
+  return x & 1 ? 3 * x + 1 : x / 2;
+}
+
+_ H(int x, int y) {
+  return (x < y, x <= y, x == y, x >= y, x > y, x != y, x <=> y);
+}
+
+int q() {
+  return 4;
+}
diff --git a/submodules/ton/tonlib-src/crypto/func/test/a9_1.fc b/submodules/ton/tonlib-src/crypto/func/test/a9_1.fc
new file mode 100644
index 0000000000..0dc9de0c10
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/test/a9_1.fc
@@ -0,0 +1,28 @@
+_ F(int x) {
+  x = 2;
+  return x + 1;
+}
+
+_ G(x) {
+  var y = x + 1;
+  x = 2;
+  return (x - 1, y);
+}
+
+_ H(x) {
+  var y = x + 1;
+  x = 2;
+  return (x * y, y);
+}
+
+_ I(x) {
+  int y = 17;
+  int z = x - y;
+  return (z, y);
+}
+
+_ J(x) {
+  int y = 239;
+  int z = x - y;
+  return (z, y);
+}
diff --git a/submodules/ton/tonlib-src/crypto/func/test/b1.fc b/submodules/ton/tonlib-src/crypto/func/test/b1.fc
new file mode 100644
index 0000000000..ce522934c9
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/test/b1.fc
@@ -0,0 +1,63 @@
+int now() asm "NOW";
+
+int cell_hash(cell c)
+asm "HASHCU";
+
+int slice_hash(slice s)
+asm "HASHSU";
+
+int check_signature(int hash, slice signature, int public_key)
+asm "CHKSIGNU";
+
+;; () throw_if(int excno, int cond) impure
+;; asm "THROWARGIF";
+
+cell get_data() asm "c4 PUSH";
+() set_data(cell c) impure asm "c4 POP";
+() accept_message() impure asm "ACCEPT";
+
+slice begin_parse(cell c) asm "CTOS";
+() end_parse(slice s) impure asm "ENDS";
+(cell, slice) load_ref(slice s) asm "LDREF";
+(int, slice) zload_int(slice s, int len) asm "LDIX";
+(int, slice) zload_uint(slice s, int len) asm "LDUX";
+int zpreload_int(slice s, int len) asm "PLDIX";
+int zpreload_uint(slice s, int len) asm "PLDUX";
+(slice, slice) load_bits(slice s, int len) asm "LDSLICEX";
+slice preload_bits(slice s, int len) asm "PLDSLICEX";
+cell set_idict_ref(cell value, int index, cell dict, int key_len) asm "DICTISETREF";
+builder begin_cell() asm "NEWC";
+builder store_ref(cell c, builder b) asm "STREF";
+builder zstore_uint(int x, builder b, int len) asm "STUX";
+builder zstore_int(int x, builder b, int len) asm "STIX";
+cell end_cell(builder b) asm "ENDC";
+
+;; Simple configuration smart contract
+
+() recv_internal(cell in_msg) impure {
+  ;; do nothing for internal messages
+}
+
+() recv_external(cell in_msg) impure {
+  var (signature, cs0) = load_bits(begin_parse(in_msg), 512);
+  var (msg_seqno, cs) = zload_uint(cs0, 32);
+  (var valid_until, cs) = zload_uint(cs, 32);
+  throw_if(35, valid_until < now());
+  var (cfg_dict, cs2) = load_ref(begin_parse(get_data()));
+  (var stored_seqno, cs2) = zload_uint(cs2, 32);
+  (var public_key, cs2) = zload_uint(cs2, 256);
+  end_parse(cs2);
+  throw_unless(33, msg_seqno == stored_seqno);
+  throw_unless(34, check_signature(slice_hash(cs0), signature, public_key));
+  accept_message();
+  (var param_index, cs) = zload_uint(cs, 32);
+  (var param_value, cs) = load_ref(cs);
+  end_parse(cs);
+;;  cfg_dict = set_idict_ref(param_value, param_index, cfg_dict, 32);
+;;  var cb = begin_cell();
+;;  cb = store_ref(cfg_dict, cb);
+  var cb = store_ref(set_idict_ref(param_value, param_index, cfg_dict, 32), begin_cell());
+  cb = zstore_uint(stored_seqno + 1, cb, 32);
+  cb = zstore_uint(public_key, cb, 256);
+  set_data(end_cell(cb));
+}
diff --git a/submodules/ton/tonlib-src/crypto/func/test/b2.fc b/submodules/ton/tonlib-src/crypto/func/test/b2.fc
new file mode 100644
index 0000000000..90322ae013
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/test/b2.fc
@@ -0,0 +1,60 @@
+int now() asm "NOW";
+
+int cell_hash(cell c)
+asm "HASHCU";
+
+int slice_hash(slice s)
+asm "HASHSU";
+
+int check_signature(int hash, slice signature, int public_key)
+asm "CHKSIGNU";
+
+;; () throw_if(int excno, int cond) impure
+;; asm "THROWARGIF";
+
+cell get_data() asm "c4 PUSH";
+() set_data(cell c) impure asm "c4 POP";
+() accept_message() impure asm "ACCEPT";
+
+slice begin_parse(cell c) asm "CTOS";
+() end_parse(slice s) impure asm "ENDS";
+(slice, cell) load_ref(slice s) asm( -> 1 0) "LDREF";
+;; (slice, int) load_int(slice s, int len) asm(s len -> 1 0) "LDIX";
+;; (slice, int) load_uint(slice s, int len) asm( -> 1 0) "LDUX";
+;; int preload_int(slice s, int len) asm "PLDIX";
+;; int preload_uint(slice s, int len) asm "PLDUX";
+(slice, slice) load_bits(slice s, int len) asm(s len -> 1 0) "LDSLICEX";
+slice preload_bits(slice s, int len) asm "PLDSLICEX";
+cell set_idict_ref(cell dict, int key_len, int index, cell value) asm(value index dict key_len) "DICTISETREF";
+builder begin_cell() asm "NEWC";
+builder store_ref(builder b, cell c) asm(c b) "STREF";
+;; builder store_uint(builder b, int x, int len) asm(x b len) "STUX";
+;; builder store_int(builder b, int x, int len) asm(x b len) "STIX";
+cell end_cell(builder b) asm "ENDC";
+
+;; Simple configuration smart contract
+
+() recv_internal(cell in_msg) impure {
+  ;; do nothing for internal messages
+}
+
+() recv_external(cell in_msg) impure {
+  var (cs0, signature) = load_bits(begin_parse(in_msg), 512);
+  var (cs, msg_seqno) = load_uint(cs0, 32);
+  (cs, var valid_until) = load_uint(cs, 32);
+  throw_if(35, valid_until < now());
+  var (cs2, cfg_dict) = load_ref(begin_parse(get_data()));
+  (cs2, var stored_seqno) = load_uint(cs2, 32);
+  (cs2, var public_key) = load_uint(cs2, 256);
+  end_parse(cs2);
+  throw_unless(33, msg_seqno == stored_seqno);
+  throw_unless(34, check_signature(slice_hash(cs0), signature, public_key));
+  accept_message();
+  (cs, var param_index) = load_uint(cs, 32);
+  (cs, var param_value) = load_ref(cs);
+  end_parse(cs);
+  var cb = store_ref(begin_cell(), set_idict_ref(cfg_dict, 32, param_index, param_value));
+  cb = store_uint(cb, stored_seqno + 1, 32);
+  cb = store_uint(cb, public_key, 256);
+  set_data(end_cell(cb));
+}
diff --git a/submodules/ton/tonlib-src/crypto/func/test/b2_0.fc b/submodules/ton/tonlib-src/crypto/func/test/b2_0.fc
new file mode 100644
index 0000000000..c2783f86f4
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/test/b2_0.fc
@@ -0,0 +1,63 @@
+int now() asm "NOW";
+
+int cell_hash(cell c)
+asm "HASHCU";
+
+int slice_hash(slice s)
+asm "HASHSU";
+
+int check_signature(int hash, slice signature, int public_key)
+asm "CHKSIGNU";
+
+;; () throw_if(int excno, int cond) impure
+;; asm "THROWARGIF";
+
+cell get_data() asm "c4 PUSH";
+() set_data(cell c) impure asm "c4 POP";
+() accept_message() impure asm "ACCEPT";
+
+slice begin_parse(cell c) asm "CTOS";
+() end_parse(slice s) impure asm "ENDS";
+(slice, cell) load_ref(slice s) asm( -> 1 0) "LDREF";
+(slice, int) zload_int(slice s, int len) asm(s len -> 1 0) "LDIX";
+(slice, int) zload_uint(slice s, int len) asm( -> 1 0) "LDUX";
+int zpreload_int(slice s, int len) asm "PLDIX";
+int zpreload_uint(slice s, int len) asm "PLDUX";
+(slice, slice) load_bits(slice s, int len) asm(s len -> 1 0) "LDSLICEX";
+slice preload_bits(slice s, int len) asm "PLDSLICEX";
+cell set_idict_ref(cell dict, int key_len, int index, cell value) asm(value index dict key_len) "DICTISETREF";
+builder begin_cell() asm "NEWC";
+builder store_ref(builder b, cell c) asm(c b) "STREF";
+builder zstore_uint(builder b, int x, int len) asm(x b len) "STUX";
+builder zstore_int(builder b, int x, int len) asm(x b len) "STIX";
+cell end_cell(builder b) asm "ENDC";
+
+;; Simple configuration smart contract
+
+() recv_internal(cell in_msg) impure {
+  ;; do nothing for internal messages
+}
+
+() recv_external(cell in_msg) impure {
+  var (cs0, signature) = load_bits(begin_parse(in_msg), 512);
+  var (cs, msg_seqno) = zload_uint(cs0, 32);
+  (cs, var valid_until) = zload_uint(cs, 32);
+  throw_if(35, valid_until < now());
+  var (cs2, cfg_dict) = load_ref(begin_parse(get_data()));
+  (cs2, var stored_seqno) = zload_uint(cs2, 32);
+  (cs2, var public_key) = zload_uint(cs2, 256);
+  end_parse(cs2);
+  throw_unless(33, msg_seqno == stored_seqno);
+  throw_unless(34, check_signature(slice_hash(cs0), signature, public_key));
+  accept_message();
+  (cs, var param_index) = zload_uint(cs, 32);
+  (cs, var param_value) = load_ref(cs);
+  end_parse(cs);
+;;  cfg_dict = set_idict_ref(cfg_dict, 32, param_index, param_value);
+;;  var cb = begin_cell();
+;;  cb = store_ref(cb, cfg_dict);
+  var cb = store_ref(begin_cell(), set_idict_ref(cfg_dict, 32, param_index, param_value));
+  cb = zstore_uint(cb, stored_seqno + 1, 32);
+  cb = zstore_uint(cb, public_key, 256);
+  set_data(end_cell(cb));
+}
diff --git a/submodules/ton/tonlib-src/crypto/func/test/b2_1.fc b/submodules/ton/tonlib-src/crypto/func/test/b2_1.fc
new file mode 100644
index 0000000000..1ff79d05b6
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/test/b2_1.fc
@@ -0,0 +1,62 @@
+int now() asm "NOW";
+
+int cell_hash(cell c)
+asm "HASHCU";
+
+int slice_hash(slice s)
+asm "HASHSU";
+
+int check_signature(int hash, slice signature, int public_key)
+asm "CHKSIGNU";
+
+;; () throw_if(int excno, int cond) impure
+;; asm "THROWARGIF";
+
+cell get_data() asm "c4 PUSH";
+() set_data(cell c) impure asm "c4 POP";
+() accept_message() impure asm "ACCEPT";
+
+slice begin_parse(cell c) asm "CTOS";
+() end_parse(slice s) impure asm "ENDS";
+(slice, cell) load_ref(slice s) asm( -> 1 0) "LDREF";
+;; (slice, int) ~load_int(slice s, int len) asm(s len -> 1 0) "LDIX";
+;; (slice, int) ~load_uint(slice s, int len) asm( -> 1 0) "LDUX";
+;; int preload_int(slice s, int len) asm "PLDIX";
+;; int preload_uint(slice s, int len) asm "PLDUX";
+(slice, slice) load_bits(slice s, int len) asm(s len -> 1 0) "LDSLICEX";
+slice preload_bits(slice s, int len) asm "PLDSLICEX";
+cell set_idict_ref(cell dict, int key_len, int index, cell value) asm(value index dict key_len) "DICTISETREF";
+(cell, ()) ~set_idict_ref(cell dict, int key_len, int index, cell value) asm(value index dict key_len) "DICTISETREF";
+builder begin_cell() asm "NEWC";
+builder store_ref(builder b, cell c) asm(c b) "STREF";
+;; builder store_uint(builder b, int x, int len) asm(x b len) "STUX";
+;; builder store_int(builder b, int x, int len) asm(x b len) "STIX";
+cell end_cell(builder b) asm "ENDC";
+
+;; Simple configuration smart contract
+
+() recv_internal(cell in_msg) impure {
+  ;; do nothing for internal messages
+}
+
+() recv_external(cell in_msg) impure {
+  var cs = begin_parse(in_msg);
+  var signature = cs~load_bits(512);
+  var cs0 = cs;
+  int msg_seqno = cs~load_uint(32);
+  var valid_until = cs~load_uint(32);
+  throw_if(35, valid_until < now());
+  var cs2 = begin_parse(get_data());
+  var cfg_dict = cs2~load_ref();
+  var stored_seqno = cs2~load_uint(32);
+  var public_key = cs2~load_uint(256);
+  cs2.end_parse();
+  throw_unless(33, msg_seqno == stored_seqno);
+  throw_unless(34, check_signature(slice_hash(cs0), signature, public_key));
+  accept_message();
+  var param_index = cs~load_uint(32);
+  var param_value = cs~load_ref();
+  cs.end_parse();
+  cfg_dict~set_idict_ref(32, param_index, param_value);
+  set_data(begin_cell().store_ref(cfg_dict).store_uint(stored_seqno + 1, 32).store_uint(public_key, 256).end_cell());
+}
diff --git a/submodules/ton/tonlib-src/crypto/func/test/b2_2.fc b/submodules/ton/tonlib-src/crypto/func/test/b2_2.fc
new file mode 100644
index 0000000000..d137ff687a
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/test/b2_2.fc
@@ -0,0 +1,58 @@
+int now() asm "NOW";
+
+int cell_hash(cell c)
+asm "HASHCU";
+
+int slice_hash(slice s)
+asm "HASHSU";
+
+int check_signature(int hash, slice signature, int public_key)
+asm "CHKSIGNU";
+
+;; () throw_if(int excno, int cond) impure
+;; asm "THROWARGIF";
+
+cell get_data() asm "c4 PUSH";
+() set_data(cell c) impure asm "c4 POP";
+() accept_message() impure asm "ACCEPT";
+
+slice begin_parse(cell c) asm "CTOS";
+() end_parse(slice s) impure asm "ENDS";
+(slice, cell) load_ref(slice s) asm( -> 1 0) "LDREF";
+;; (slice, int) load_int(slice s, int len) asm(s len -> 1 0) "LDIX";
+;; (slice, int) load_uint(slice s, int len) asm( -> 1 0) "LDUX";
+;; int .preload_int(slice s, int len) asm "PLDIX";
+;; int .preload_uint(slice s, int len) asm "PLDUX";
+(slice, slice) load_bits(slice s, int len) asm(s len -> 1 0) "LDSLICEX";
+;; slice .preload_bits(slice s, int len) asm "PLDSLICEX";
+cell set_idict_ref(cell dict, int key_len, int index, cell value) asm(value index dict key_len) "DICTISETREF";
+builder begin_cell() asm "NEWC";
+builder store_ref(builder b, cell c) asm(c b) "STREF";
+;;builder .store_uint(builder b, int x, int len) asm(x b len) "STUX";
+;;builder .store_int(builder b, int x, int len) asm(x b len) "STIX";
+cell .end_cell(builder b) asm "ENDC";
+
+;; Simple configuration smart contract
+
+() recv_internal(cell in_msg) impure {
+  ;; do nothing for internal messages
+}
+
+() recv_external(cell in_msg) impure {
+  var (cs0, signature) = load_bits(begin_parse(in_msg), 512);
+  var (cs, msg_seqno) = load_uint(cs0, 32);
+  (cs, var valid_until) = load_uint(cs, 32);
+  throw_if(35, valid_until < now());
+  var (cs2, cfg_dict) = load_ref(begin_parse(get_data()));
+  (cs2, var stored_seqno) = load_uint(cs2, 32);
+  (cs2, var public_key) = load_uint(cs2, 256);
+  end_parse(cs2);
+  throw_unless(33, msg_seqno == stored_seqno);
+  throw_unless(34, check_signature(slice_hash(cs0), signature, public_key));
+  accept_message();
+  (cs, var param_index) = load_uint(cs, 32);
+  (cs, var param_value) = load_ref(cs);
+  end_parse(cs);
+  set_data(begin_cell().store_ref(cfg_dict.set_idict_ref(32, param_index, param_value))
+           .store_uint(stored_seqno + 1, 32).store_uint(public_key, 256).end_cell());
+}
diff --git a/submodules/ton/tonlib-src/crypto/func/unify-types.cpp b/submodules/ton/tonlib-src/crypto/func/unify-types.cpp
new file mode 100644
index 0000000000..fd841a0fbe
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/func/unify-types.cpp
@@ -0,0 +1,384 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "func.h"
+
+namespace funC {
+
+/*
+ * 
+ *   TYPE EXPRESSIONS
+ * 
+ */
+
+int TypeExpr::holes = 0, TypeExpr::type_vars = 0;  // not thread safe, but it is ok for now
+
+void TypeExpr::compute_width() {
+  switch (constr) {
+    case te_Atomic:
+    case te_Map:
+      minw = maxw = 1;
+      break;
+    case te_Tensor:
+      minw = maxw = 0;
+      for (TypeExpr* arg : args) {
+        minw += arg->minw;
+        maxw += arg->maxw;
+      }
+      if (minw > w_inf) {
+        minw = w_inf;
+      }
+      if (maxw > w_inf) {
+        maxw = w_inf;
+      }
+      break;
+    case te_Indirect:
+      minw = args[0]->minw;
+      maxw = args[0]->maxw;
+      break;
+    default:
+      minw = 0;
+      maxw = w_inf;
+      break;
+  }
+}
+
+bool TypeExpr::recompute_width() {
+  switch (constr) {
+    case te_Tensor:
+    case te_Indirect: {
+      int min = 0, max = 0;
+      for (TypeExpr* arg : args) {
+        min += arg->minw;
+        max += arg->maxw;
+      }
+      if (min > maxw || max < minw) {
+        return false;
+      }
+      if (min > w_inf) {
+        min = w_inf;
+      }
+      if (max > w_inf) {
+        max = w_inf;
+      }
+      if (minw < min) {
+        minw = min;
+      }
+      if (maxw > max) {
+        maxw = max;
+      }
+      return true;
+    }
+    default:
+      return false;
+  }
+}
+
+int TypeExpr::extract_components(std::vector<TypeExpr*>& comp_list) {
+  if (constr != te_Indirect && constr != te_Tensor) {
+    comp_list.push_back(this);
+    return 1;
+  }
+  int res = 0;
+  for (TypeExpr* arg : args) {
+    res += arg->extract_components(comp_list);
+  }
+  return res;
+}
+
+TypeExpr* TypeExpr::new_map(TypeExpr* from, TypeExpr* to) {
+  return new TypeExpr{te_Map, std::vector<TypeExpr*>{from, to}};
+}
+
+void TypeExpr::replace_with(TypeExpr* te2) {
+  if (te2 == this) {
+    return;
+  }
+  constr = te_Indirect;
+  value = 0;
+  minw = te2->minw;
+  maxw = te2->maxw;
+  args.clear();
+  args.push_back(te2);
+}
+
+bool TypeExpr::remove_indirect(TypeExpr*& te, TypeExpr* forbidden) {
+  assert(te);
+  while (te->constr == te_Indirect) {
+    te = te->args[0];
+  }
+  if (te->constr == te_Unknown) {
+    return te != forbidden;
+  }
+  bool res = true;
+  for (auto& x : te->args) {
+    res &= remove_indirect(x, forbidden);
+  }
+  return res;
+}
+
+bool TypeExpr::remove_forall(TypeExpr*& te) {
+  assert(te);
+  if (te->constr != te_ForAll) {
+    return false;
+  }
+  assert(te->args.size() >= 1);
+  std::vector<TypeExpr*> new_vars;
+  for (std::size_t i = 1; i < te->args.size(); i++) {
+    new_vars.push_back(new_hole(1));
+  }
+  TypeExpr* te2 = te;
+  // std::cerr << "removing universal quantifier in " << te << std::endl;
+  te = te->args[0];
+  remove_forall_in(te, te2, new_vars);
+  // std::cerr << "-> " << te << std::endl;
+  return true;
+}
+
+bool TypeExpr::remove_forall_in(TypeExpr*& te, TypeExpr* te2, const std::vector<TypeExpr*>& new_vars) {
+  assert(te);
+  assert(te2 && te2->constr == te_ForAll);
+  if (te->constr == te_Unknown) {
+    for (std::size_t i = 0; i < new_vars.size(); i++) {
+      if (te == te2->args[i + 1]) {
+        te = new_vars[i];
+        return true;
+      }
+    }
+    return false;
+  }
+  if (te->constr == te_ForAll) {
+    return false;
+  }
+  if (te->args.empty()) {
+    return false;
+  }
+  auto te1 = new TypeExpr(*te);
+  bool res = false;
+  for (auto& arg : te1->args) {
+    res |= remove_forall_in(arg, te2, new_vars);
+  }
+  if (res) {
+    te = te1;
+  } else {
+    delete te1;
+  }
+  return res;
+}
+
+void TypeExpr::show_width(std::ostream& os) {
+  os << minw;
+  if (maxw != minw) {
+    os << "..";
+    if (maxw < w_inf) {
+      os << maxw;
+    }
+  }
+}
+
+std::ostream& operator<<(std::ostream& os, TypeExpr* type_expr) {
+  if (!type_expr) {
+    return os << "(null-type-ptr)";
+  }
+  return type_expr->print(os);
+}
+
+std::ostream& TypeExpr::print(std::ostream& os, int lex_level) {
+  switch (constr) {
+    case te_Unknown:
+      if (value >= 0) {
+        return os << "??" << value;
+      } else if (value >= -26) {
+        return os << (char)(64 - value);
+      } else {
+        return os << "TVAR" << -value;
+      }
+    case te_Indirect:
+      return os << args[0];
+    case te_Atomic: {
+      switch (value) {
+        case _Int:
+          return os << "int";
+        case _Cell:
+          return os << "cell";
+        case _Slice:
+          return os << "slice";
+        case _Builder:
+          return os << "builder";
+        case _Cont:
+          return os << "cont";
+        case _Tuple:
+          return os << "tuple";
+        case _Type:
+          return os << "type";
+        default:
+          return os << "atomic-type-" << value;
+      }
+    }
+    case te_Tensor: {
+      os << "(";
+      auto c = args.size();
+      if (c) {
+        for (const auto& x : args) {
+          x->print(os);
+          if (--c) {
+            os << ", ";
+          }
+        }
+      }
+      return os << ")";
+    }
+    case te_Map: {
+      assert(args.size() == 2);
+      if (lex_level > 0) {
+        os << "(";
+      }
+      args[0]->print(os, 1);
+      os << " -> ";
+      args[1]->print(os);
+      if (lex_level > 0) {
+        os << ")";
+      }
+      return os;
+    }
+    case te_ForAll: {
+      assert(args.size() >= 1);
+      if (lex_level > 0) {
+        os << '(';
+      }
+      os << "Forall ";
+      for (std::size_t i = 1; i < args.size(); i++) {
+        os << (i > 1 ? ' ' : '(');
+        args[i]->print(os);
+      }
+      os << ") ";
+      args[0]->print(os);
+      if (lex_level > 0) {
+        os << ')';
+      }
+      return os;
+    }
+    default:
+      return os << "unknown-type-expr-" << constr;
+  }
+}
+
+void UnifyError::print_message(std::ostream& os) const {
+  os << "cannot unify type " << te1 << " with " << te2;
+  if (!msg.empty()) {
+    os << ": " << msg;
+  }
+}
+
+std::ostream& operator<<(std::ostream& os, const UnifyError& ue) {
+  ue.print_message(os);
+  return os;
+}
+
+std::string UnifyError::message() const {
+  std::ostringstream os;
+  UnifyError::print_message(os);
+  return os.str();
+}
+
+void check_width_compat(TypeExpr* te1, TypeExpr* te2) {
+  if (te1->minw > te2->maxw || te2->minw > te1->maxw) {
+    std::ostringstream os{"cannot unify types of widths "};
+    te1->show_width(os);
+    os << " and ";
+    te2->show_width(os);
+    throw UnifyError{te1, te2, os.str()};
+  }
+}
+
+void check_update_widths(TypeExpr* te1, TypeExpr* te2) {
+  check_width_compat(te1, te2);
+  te1->minw = te2->minw = std::max(te1->minw, te2->minw);
+  te1->maxw = te2->maxw = std::min(te1->maxw, te2->maxw);
+  assert(te1->minw <= te2->minw);
+}
+
+void unify(TypeExpr*& te1, TypeExpr*& te2) {
+  assert(te1 && te2);
+  // std::cerr << "unify( " << te1 << " , " << te2 << " )\n";
+  while (te1->constr == TypeExpr::te_Indirect) {
+    te1 = te1->args[0];
+  }
+  while (te2->constr == TypeExpr::te_Indirect) {
+    te2 = te2->args[0];
+  }
+  if (te1 == te2) {
+    return;
+  }
+  if (te1->constr == TypeExpr::te_ForAll) {
+    TypeExpr* te = te1;
+    if (!TypeExpr::remove_forall(te)) {
+      throw UnifyError{te1, te2, "cannot remove universal type quantifier while performing type unification"};
+    }
+    unify(te, te2);
+    return;
+  }
+  if (te2->constr == TypeExpr::te_ForAll) {
+    TypeExpr* te = te2;
+    if (!TypeExpr::remove_forall(te)) {
+      throw UnifyError{te2, te1, "cannot remove universal type quantifier while performing type unification"};
+    }
+    unify(te1, te);
+    return;
+  }
+  if (te1->constr == TypeExpr::te_Unknown) {
+    if (te2->constr == TypeExpr::te_Unknown) {
+      assert(te1->value != te2->value);
+    }
+    if (!TypeExpr::remove_indirect(te2, te1)) {
+      throw UnifyError{te1, te2, "type unification results in an infinite cyclic type"};
+    }
+    check_update_widths(te1, te2);
+    te1->replace_with(te2);
+    te1 = te2;
+    return;
+  }
+  if (te2->constr == TypeExpr::te_Unknown) {
+    if (!TypeExpr::remove_indirect(te1, te2)) {
+      throw UnifyError{te2, te1, "type unification results in an infinite cyclic type"};
+    }
+    check_update_widths(te2, te1);
+    te2->replace_with(te1);
+    te2 = te1;
+    return;
+  }
+  if (te1->constr != te2->constr || te1->value != te2->value || te1->args.size() != te2->args.size()) {
+    throw UnifyError{te1, te2};
+  }
+  for (std::size_t i = 0; i < te1->args.size(); i++) {
+    unify(te1->args[i], te2->args[i]);
+  }
+  if (te1->constr == TypeExpr::te_Tensor) {
+    if (!te1->recompute_width()) {
+      throw UnifyError{te1, te2, "type unification incompatible with known width of first type"};
+    }
+    if (!te2->recompute_width()) {
+      throw UnifyError{te2, te1, "type unification incompatible with known width of first type"};
+    }
+    check_update_widths(te1, te2);
+  }
+  te1->replace_with(te2);
+  te1 = te2;
+}
+
+}  // namespace funC
diff --git a/submodules/ton/tonlib-src/crypto/openssl/bignum.cpp b/submodules/ton/tonlib-src/crypto/openssl/bignum.cpp
new file mode 100644
index 0000000000..c3a78c73ee
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/openssl/bignum.cpp
@@ -0,0 +1,256 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "openssl/bignum.h"
+
+// impl only
+#include <cstring>
+
+namespace arith {
+
+BN_CTX* get_ctx(void) {
+  thread_local BN_CTX* ctx = BN_CTX_new();
+  return ctx;
+}
+
+BignumBitref& BignumBitref::operator=(bool val) {
+  if (val) {
+    BN_set_bit(ptr, n);
+  } else {
+    BN_clear_bit(ptr, n);
+  }
+  return *this;
+}
+
+const Bignum operator+(const Bignum& x, const Bignum& y) {
+  Bignum z;
+  bn_assert(BN_add(z.bn_ptr(), x.bn_ptr(), y.bn_ptr()));
+  return z;
+}
+
+const Bignum operator+(const Bignum& x, long y) {
+  if (y > 0) {
+    Bignum z(x);
+    bn_assert(BN_add_word(z.bn_ptr(), y));
+    return z;
+  } else if (y < 0) {
+    Bignum z(x);
+    bn_assert(BN_sub_word(z.bn_ptr(), -y));
+    return z;
+  } else {
+    return x;
+  }
+}
+
+/*
+  const Bignum operator+ (Bignum&& x, long y) {
+    if (y > 0) {
+      bn_assert (BN_add_word (x.bn_ptr(), y));
+    } else if (y < 0) {
+      bn_assert (BN_sub_word (x.bn_ptr(), -y));
+    }
+    return std::move (x);
+  }
+  */
+
+/*
+  const Bignum operator+ (long y, Bignum&& x) {
+    return x + y;
+  }
+  */
+
+const Bignum operator-(const Bignum& x, const Bignum& y) {
+  Bignum z;
+  bn_assert(BN_sub(z.bn_ptr(), x.bn_ptr(), y.bn_ptr()));
+  return z;
+}
+
+/*
+  const Bignum operator- (Bignum&& x, long y) {
+    return x + (-y);
+  }
+  */
+
+const Bignum operator*(const Bignum& x, const Bignum& y) {
+  Bignum z;
+  bn_assert(BN_mul(z.bn_ptr(), x.bn_ptr(), y.bn_ptr(), get_ctx()));
+  return z;
+}
+
+const Bignum operator*(const Bignum& x, long y) {
+  if (y > 0) {
+    Bignum z(x);
+    bn_assert(BN_mul_word(z.bn_ptr(), y));
+    return z;
+  } else if (y < 0) {
+    Bignum z(x);
+    z.negate();
+    bn_assert(BN_mul_word(z.bn_ptr(), -y));
+    return z;
+  } else {
+    Bignum z(0);
+    return z;
+  }
+}
+
+/*
+  const Bignum operator* (Bignum&& x, long y) {
+    if (y > 0) {
+      bn_assert (BN_mul_word (x.bn_ptr(), y));
+    } else if (y < 0) {
+      x.negate();
+      bn_assert (BN_mul_word (x.bn_ptr(), -y));
+    } else {
+      x = 0;
+    }
+    return std::move (x);
+  }
+  */
+
+const Bignum operator/(const Bignum& x, const Bignum& y) {
+  Bignum z, w;
+  bn_assert(BN_div(z.bn_ptr(), w.bn_ptr(), x.bn_ptr(), y.bn_ptr(), get_ctx()));
+  return z;
+}
+
+const Bignum Bignum::divmod(const Bignum& y) {
+  Bignum w;
+  bn_assert(BN_div(val, w.bn_ptr(), val, y.bn_ptr(), get_ctx()));
+  return w;
+}
+
+const Bignum operator%(const Bignum& x, const Bignum& y) {
+  Bignum z;
+  bn_assert(BN_mod(z.bn_ptr(), x.bn_ptr(), y.bn_ptr(), get_ctx()));
+  return z;
+}
+
+unsigned long operator%(const Bignum& x, unsigned long y) {
+  BN_ULONG rem = BN_mod_word(x.bn_ptr(), y);
+  bn_assert(rem != (BN_ULONG)(-1));
+  return static_cast<unsigned long>(rem);
+}
+
+const Bignum operator<<(const Bignum& x, int r) {
+  Bignum z;
+  bn_assert(BN_lshift(z.bn_ptr(), x.bn_ptr(), r));
+  return z;
+}
+
+const Bignum operator>>(const Bignum& x, int r) {
+  Bignum z;
+  bn_assert(BN_rshift(z.bn_ptr(), x.bn_ptr(), r));
+  return z;
+}
+
+const Bignum abs(const Bignum& x) {
+  Bignum T(x);
+  if (T.sign() < 0) {
+    T.negate();
+  }
+  return T;
+}
+
+const Bignum sqr(const Bignum& x) {
+  Bignum z;
+  bn_assert(BN_sqr(z.bn_ptr(), x.bn_ptr(), get_ctx()));
+  return z;
+}
+
+void Bignum::export_msb(unsigned char* buffer, std::size_t size) const {
+  bn_assert(size <= (1 << 20));
+  bn_assert(sign() >= 0);
+  std::size_t n = BN_num_bytes(val);
+  bn_assert(n <= size);
+  bn_assert(BN_bn2bin(val, buffer + size - n) == static_cast<int>(n));
+  std::memset(buffer, 0, size - n);
+}
+
+Bignum& Bignum::import_msb(const unsigned char* buffer, std::size_t size) {
+  bn_assert(size <= (1 << 20));
+  std::size_t i = 0;
+  while (i < size && !buffer[i]) {
+    i++;
+  }
+  bn_assert(BN_bin2bn(buffer + i, static_cast<int>(size - i), val) == val);
+  return *this;
+}
+
+void Bignum::export_lsb(unsigned char* buffer, std::size_t size) const {
+  bn_assert(size <= (1 << 20));
+  bn_assert(sign() >= 0);
+  std::size_t n = BN_num_bytes(val);
+  bn_assert(n <= size);
+  bn_assert(BN_bn2bin(val, buffer) == (int)n);
+  std::memset(buffer + n, 0, size - n);
+  for (std::size_t i = 0; 2 * i + 1 < n; i++) {
+    std::swap(buffer[i], buffer[n - 1 - i]);
+  }
+}
+
+Bignum& Bignum::import_lsb(const unsigned char* buffer, std::size_t size) {
+  bn_assert(size <= (1 << 20));
+  while (size > 0 && !buffer[size - 1]) {
+    size--;
+  }
+  if (!size) {
+    bn_assert(BN_set_word(val, 0));
+    return *this;
+  }
+  unsigned char tmp_buff[1024];
+  unsigned char* tmp = (size < 1024 ? tmp_buff : new unsigned char[size]);
+  unsigned char* ptr = tmp + size;
+  for (std::size_t i = 0; i < size; i++) {
+    *--ptr = buffer[i];
+  }
+  bn_assert(BN_bin2bn(tmp, static_cast<int>(size), val) == val);
+  if (tmp != tmp_buff) {
+    delete[] tmp;
+  }
+  return *this;
+}
+
+std::string Bignum::to_str() const {
+  char* ptr = BN_bn2dec(val);
+  std::string z(ptr);
+  OPENSSL_free(ptr);
+  return z;
+}
+
+std::string Bignum::to_hex() const {
+  char* ptr = BN_bn2hex(val);
+  std::string z(ptr);
+  OPENSSL_free(ptr);
+  return z;
+}
+
+std::ostream& operator<<(std::ostream& os, const Bignum& x) {
+  return os << x.to_str();
+}
+
+std::istream& operator>>(std::istream& is, Bignum& x) {
+  std::string word;
+  is >> word;
+  x = dec_string(word);
+  return is;
+}
+
+bool is_prime(const Bignum& p, int nchecks, bool trial_div) {
+  return BN_is_prime_fasttest_ex(p.bn_ptr(), BN_prime_checks, get_ctx(), trial_div, 0);
+}
+}  // namespace arith
diff --git a/submodules/ton/tonlib-src/crypto/openssl/bignum.h b/submodules/ton/tonlib-src/crypto/openssl/bignum.h
new file mode 100644
index 0000000000..74b6a1808f
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/openssl/bignum.h
@@ -0,0 +1,368 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <string>
+#include <iostream>
+
+#include <openssl/bn.h>
+#include "td/utils/bits.h"
+
+namespace arith {
+struct dec_string {
+  std::string str;
+  explicit dec_string(const std::string& s) : str(s) {
+  }
+};
+
+struct hex_string {
+  std::string str;
+  explicit hex_string(const std::string& s) : str(s) {
+  }
+};
+}  // namespace arith
+
+namespace arith {
+
+inline void bn_assert(int cond);
+BN_CTX* get_ctx();
+
+class BignumBitref {
+  BIGNUM* ptr;
+  int n;
+
+ public:
+  BignumBitref(BIGNUM* x, int _n) : ptr(x), n(_n){};
+  operator bool() const {
+    return BN_is_bit_set(ptr, n);
+  }
+  BignumBitref& operator=(bool val);
+};
+
+class Bignum {
+  BIGNUM* val;
+
+ public:
+  class bignum_error {};
+  Bignum() {
+    val = BN_new();
+  }
+  Bignum(long x) {
+    val = BN_new();
+    set_long(x);
+  }
+  ~Bignum() {
+    BN_free(val);
+  }
+  Bignum(const dec_string& ds) {
+    val = BN_new();
+    set_dec_str(ds.str);
+  }
+  Bignum(const hex_string& hs) {
+    val = BN_new();
+    set_hex_str(hs.str);
+  }
+  Bignum(const Bignum& x) {
+    val = BN_new();
+    BN_copy(val, x.val);
+  }
+  //Bignum (Bignum&& x) { val = x.val; }
+  void clear() {
+    BN_clear(val);
+  }  // use this for sensitive data
+  Bignum& operator=(const Bignum& x) {
+    BN_copy(val, x.val);
+    return *this;
+  }
+  Bignum& operator=(Bignum&& x) {
+    swap(x);
+    return *this;
+  }
+  Bignum& operator=(long x) {
+    return set_long(x);
+  }
+  Bignum& operator=(const dec_string& ds) {
+    return set_dec_str(ds.str);
+  }
+  Bignum& operator=(const hex_string& hs) {
+    return set_hex_str(hs.str);
+  }
+  Bignum& swap(Bignum& x) {
+    BN_swap(val, x.val);
+    return *this;
+  }
+  BIGNUM* bn_ptr() {
+    return val;
+  }
+  const BIGNUM* bn_ptr() const {
+    return val;
+  }
+  bool is_zero() const {
+    return BN_is_zero(val);
+  }
+  int sign() const {
+    return BN_is_zero(val) ? 0 : (BN_is_negative(val) ? -1 : 1);
+  }
+  bool odd() const {
+    return BN_is_odd(val);
+  }
+  int num_bits() const {
+    return BN_num_bits(val);
+  }
+  int num_bytes() const {
+    return BN_num_bytes(val);
+  }
+  bool operator[](int n) const {
+    return BN_is_bit_set(val, n);
+  }
+  BignumBitref operator[](int n) {
+    return BignumBitref(val, n);
+  }
+  void export_msb(unsigned char* buffer, std::size_t size) const;
+  Bignum& import_msb(const unsigned char* buffer, std::size_t size);
+  Bignum& import_msb(const std::string& s) {
+    return import_msb((const unsigned char*)s.c_str(), s.size());
+  }
+  void export_lsb(unsigned char* buffer, std::size_t size) const;
+  Bignum& import_lsb(const unsigned char* buffer, std::size_t size);
+  Bignum& import_lsb(const std::string& s) {
+    return import_lsb((const unsigned char*)s.c_str(), s.size());
+  }
+
+  Bignum& set_dec_str(std::string s) {
+    bn_assert(BN_dec2bn(&val, s.c_str()));
+    return *this;
+  }
+
+  Bignum& set_hex_str(std::string s) {
+    bn_assert(BN_hex2bn(&val, s.c_str()));
+    return *this;
+  }
+
+  Bignum& set_ulong(unsigned long x) {
+    bn_assert(BN_set_word(val, x));
+    return *this;
+  }
+
+  Bignum& set_long(long x) {
+    set_ulong(std::abs(x));
+    return x < 0 ? negate() : *this;
+  }
+
+  Bignum& negate() {
+    BN_set_negative(val, !BN_is_negative(val));
+    return *this;
+  }
+
+  Bignum& operator+=(const Bignum& y) {
+    bn_assert(BN_add(val, val, y.val));
+    return *this;
+  }
+
+  Bignum& operator+=(long y) {
+    bn_assert((y >= 0 ? BN_add_word : BN_sub_word)(val, std::abs(y)));
+    return *this;
+  }
+
+  Bignum& operator-=(long y) {
+    bn_assert((y >= 0 ? BN_sub_word : BN_add_word)(val, std::abs(y)));
+    return *this;
+  }
+
+  Bignum& operator*=(const Bignum& y) {
+    bn_assert(BN_mul(val, val, y.val, get_ctx()));
+    return *this;
+  }
+
+  Bignum& operator*=(long y) {
+    if (y < 0) {
+      negate();
+    }
+    bn_assert(BN_mul_word(val, std::abs(y)));
+    return *this;
+  }
+
+  Bignum& operator<<=(int r) {
+    bn_assert(BN_lshift(val, val, r));
+    return *this;
+  }
+
+  Bignum& operator>>=(int r) {
+    bn_assert(BN_rshift(val, val, r));
+    return *this;
+  }
+
+  Bignum& operator/=(const Bignum& y) {
+    Bignum w;
+    bn_assert(BN_div(val, w.val, val, y.val, get_ctx()));
+    return *this;
+  }
+
+  Bignum& operator/=(long y) {
+    bn_assert(BN_div_word(val, std::abs(y)) != (BN_ULONG)(-1));
+    return y < 0 ? negate() : *this;
+  }
+
+  Bignum& operator%=(const Bignum& y) {
+    bn_assert(BN_mod(val, val, y.val, get_ctx()));
+    return *this;
+  }
+
+  Bignum& operator%=(long y) {
+    BN_ULONG rem = BN_mod_word(val, std::abs(y));
+    bn_assert(rem != (BN_ULONG)(-1));
+    return set_long(static_cast<long>(y < 0 ? td::bits_negate64(rem) : rem));
+  }
+
+  unsigned long divmod(unsigned long y) {
+    BN_ULONG rem = BN_div_word(val, y);
+    bn_assert(rem != (BN_ULONG)(-1));
+    return static_cast<unsigned long>(rem);
+  }
+
+  const Bignum divmod(const Bignum& y);
+
+  std::string to_str() const;
+  std::string to_hex() const;
+};
+
+inline void bn_assert(int cond) {
+  if (!cond) {
+    throw Bignum::bignum_error();
+  }
+}
+
+BN_CTX* get_ctx(void);
+
+const Bignum operator+(const Bignum& x, const Bignum& y);
+const Bignum operator+(const Bignum& x, long y);
+
+/*
+  const Bignum operator+ (Bignum&& x, long y) {
+    if (y > 0) {
+      bn_assert (BN_add_word (x.bn_ptr(), y));
+    } else if (y < 0) {
+      bn_assert (BN_sub_word (x.bn_ptr(), -y));
+    }
+    return std::move (x);
+  }
+  */
+
+inline const Bignum operator+(long y, const Bignum& x) {
+  return x + y;
+}
+
+/*
+  const Bignum operator+ (long y, Bignum&& x) {
+    return x + y;
+  }
+  */
+
+const Bignum operator-(const Bignum& x, const Bignum& y);
+inline const Bignum operator-(const Bignum& x, long y) {
+  return x + (-y);
+}
+
+/*
+  const Bignum operator- (Bignum&& x, long y) {
+    return x + (-y);
+  }
+  */
+
+const Bignum operator*(const Bignum& x, const Bignum& y);
+const Bignum operator*(const Bignum& x, long y);
+
+/*
+  const Bignum operator* (Bignum&& x, long y) {
+    if (y > 0) {
+      bn_assert (BN_mul_word (x.bn_ptr(), y));
+    } else if (y < 0) {
+      x.negate();
+      bn_assert (BN_mul_word (x.bn_ptr(), -y));
+    } else {
+      x = 0;
+    }
+    return std::move (x);
+  }
+  */
+
+inline const Bignum operator*(long y, const Bignum& x) {
+  return x * y;
+}
+
+const Bignum operator/(const Bignum& x, const Bignum& y);
+const Bignum operator%(const Bignum& x, const Bignum& y);
+unsigned long operator%(const Bignum& x, unsigned long y);
+
+const Bignum operator<<(const Bignum& x, int r);
+const Bignum operator>>(const Bignum& x, int r);
+
+const Bignum abs(const Bignum& x);
+const Bignum sqr(const Bignum& x);
+
+std::ostream& operator<<(std::ostream& os, const Bignum& x);
+std::istream& operator>>(std::istream& is, Bignum& x);
+
+bool is_prime(const Bignum& p, int nchecks = 64, bool trial_div = true);
+
+inline int cmp(const Bignum& x, const Bignum& y) {
+  return BN_cmp(x.bn_ptr(), y.bn_ptr());
+}
+
+inline bool operator==(const Bignum& x, const Bignum& y) {
+  return cmp(x, y) == 0;
+}
+
+inline bool operator!=(const Bignum& x, const Bignum& y) {
+  return cmp(x, y) != 0;
+}
+
+inline bool operator<(const Bignum& x, const Bignum& y) {
+  return cmp(x, y) < 0;
+}
+
+inline bool operator<=(const Bignum& x, const Bignum& y) {
+  return cmp(x, y) <= 0;
+}
+
+inline bool operator>(const Bignum& x, const Bignum& y) {
+  return cmp(x, y) > 0;
+}
+
+inline bool operator>=(const Bignum& x, const Bignum& y) {
+  return cmp(x, y) >= 0;
+}
+
+inline bool operator==(const Bignum& x, long y) {
+  if (y >= 0) {
+    return BN_is_word(x.bn_ptr(), y);
+  } else {
+    return x == Bignum(y);
+  }
+}
+
+inline bool operator!=(const Bignum& x, long y) {
+  if (y >= 0) {
+    return !BN_is_word(x.bn_ptr(), y);
+  } else {
+    return x != Bignum(y);
+  }
+}
+
+}  // namespace arith
diff --git a/submodules/ton/tonlib-src/crypto/openssl/digest.h b/submodules/ton/tonlib-src/crypto/openssl/digest.h
new file mode 100644
index 0000000000..d0dfc4c086
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/openssl/digest.h
@@ -0,0 +1,151 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <assert.h>
+
+#include <openssl/evp.h>
+#include <openssl/opensslv.h>
+
+#include "td/utils/Slice.h"
+
+namespace digest {
+struct OpensslEVP_SHA1 {
+  enum { digest_bytes = 20 };
+  static const EVP_MD *get_evp() {
+    return EVP_sha1();
+  }
+};
+
+struct OpensslEVP_SHA256 {
+  enum { digest_bytes = 32 };
+  static const EVP_MD *get_evp() {
+    return EVP_sha256();
+  }
+};
+
+struct OpensslEVP_SHA512 {
+  enum { digest_bytes = 64 };
+  static const EVP_MD *get_evp() {
+    return EVP_sha512();
+  }
+};
+
+template <typename H>
+class HashCtx {
+  EVP_MD_CTX *ctx{nullptr};
+  void init();
+  void clear();
+
+ public:
+  enum { digest_bytes = H::digest_bytes };
+  HashCtx() {
+    init();
+  }
+  HashCtx(const void *data, std::size_t len) {
+    init();
+    feed(data, len);
+  }
+  ~HashCtx() {
+    clear();
+  }
+  void reset();
+  void feed(const void *data, std::size_t len);
+  void feed(td::Slice slice) {
+    feed(slice.data(), slice.size());
+  }
+  std::size_t extract(unsigned char buffer[digest_bytes]);
+  std::size_t extract(td::MutableSlice slice);
+  std::string extract();
+};
+
+template <typename H>
+void HashCtx<H>::init() {
+  ctx = EVP_MD_CTX_create();
+  reset();
+}
+
+template <typename H>
+void HashCtx<H>::reset() {
+  EVP_DigestInit_ex(ctx, H::get_evp(), 0);
+}
+
+template <typename H>
+void HashCtx<H>::clear() {
+  EVP_MD_CTX_destroy(ctx);
+  ctx = nullptr;
+}
+
+template <typename H>
+void HashCtx<H>::feed(const void *data, std::size_t len) {
+  EVP_DigestUpdate(ctx, data, len);
+}
+
+template <typename H>
+std::size_t HashCtx<H>::extract(unsigned char buffer[digest_bytes]) {
+  unsigned olen = 0;
+  EVP_DigestFinal_ex(ctx, buffer, &olen);
+  assert(olen == digest_bytes);
+  return olen;
+}
+
+template <typename H>
+std::size_t HashCtx<H>::extract(td::MutableSlice slice) {
+  return extract(slice.ubegin());
+}
+
+template <typename H>
+std::string HashCtx<H>::extract() {
+  unsigned char buffer[digest_bytes];
+  unsigned olen = 0;
+  EVP_DigestFinal_ex(ctx, buffer, &olen);
+  assert(olen == digest_bytes);
+  return std::string((char *)buffer, olen);
+}
+
+typedef HashCtx<OpensslEVP_SHA1> SHA1;
+typedef HashCtx<OpensslEVP_SHA256> SHA256;
+typedef HashCtx<OpensslEVP_SHA512> SHA512;
+
+template <typename T>
+std::size_t hash_str(unsigned char buffer[T::digest_bytes], const void *data, std::size_t size) {
+  T hasher(data, size);
+  return hasher.extract(buffer);
+}
+
+template <typename T>
+std::size_t hash_two_str(unsigned char buffer[T::digest_bytes], const void *data1, std::size_t size1, const void *data2,
+                         std::size_t size2) {
+  T hasher(data1, size1);
+  hasher.feed(data2, size2);
+  return hasher.extract(buffer);
+}
+
+template <typename T>
+std::string hash_str(const void *data, std::size_t size) {
+  T hasher(data, size);
+  return hasher.extract();
+}
+
+template <typename T>
+std::string hash_two_str(const void *data1, std::size_t size1, const void *data2, std::size_t size2) {
+  T hasher(data1, size1);
+  hasher.feed(data2, size2);
+  return hasher.extract();
+}
+}  // namespace digest
diff --git a/submodules/ton/tonlib-src/crypto/openssl/rand.cpp b/submodules/ton/tonlib-src/crypto/openssl/rand.cpp
new file mode 100644
index 0000000000..9e9c546dd8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/openssl/rand.cpp
@@ -0,0 +1,122 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "openssl/rand.hpp"
+
+#include "td/utils/common.h"
+
+#include <openssl/rand.h>
+#include <openssl/opensslv.h>
+
+namespace prng {
+int os_get_random_bytes(void *buf, int n);
+
+bool RandomGen::ok() const {
+  return RAND_status();
+}
+
+void RandomGen::seed_add(const void *data, std::size_t size, double entropy) {
+  RAND_add(data, static_cast<int>(size), entropy > 0 ? entropy : static_cast<double>(size));
+}
+
+void RandomGen::randomize(bool force) {
+  if (!force && ok()) {
+    return;
+  }
+  unsigned char buffer[128];
+  int n = os_get_random_bytes(buffer, 128);
+  seed_add(buffer, n);
+  assert(ok());
+}
+
+bool RandomGen::rand_bytes(void *data, std::size_t size, bool strong) {
+#if OPENSSL_VERSION_NUMBER < 0x10101000L
+  int res = (strong ? RAND_bytes : RAND_pseudo_bytes)((unsigned char *)data, static_cast<int>(size));
+#else
+  int res = RAND_bytes((unsigned char *)data, static_cast<int>(size));
+#endif
+  if (res != 0 && res != 1) {
+    throw rand_error();
+  }
+  return res;
+}
+
+std::string RandomGen::rand_string(std::size_t size, bool strong) {
+  std::string result(size, '\0');
+  if (size > 0 && !rand_bytes(&result[0], size, strong)) {
+    throw rand_error();
+  }
+  return result;
+}
+
+RandomGen &rand_gen() {
+  // RandomGen is stateless, OpenSSL will handle concurrent access
+  static RandomGen MainPRNG;
+  return MainPRNG;
+}
+}  // namespace prng
+
+//------------------------- move to separate OS-dependent file?
+#if TD_WINDOWS
+namespace prng {
+int os_get_random_bytes(void *buf, int n) {
+  return 0;
+}
+}  // namespace prng
+#else
+#include <fcntl.h>
+#include <unistd.h>
+
+namespace prng {
+
+int os_get_random_bytes(void *buf, int n) {
+  using namespace std;
+  int r = 0;
+  int h = open("/dev/random", O_RDONLY | O_NONBLOCK);
+  if (h >= 0) {
+    r = static_cast<int>(read(h, buf, n));
+    if (r > 0) {
+      //std::cerr << "added " << r << " bytes of real entropy to secure random numbers seed" << std::endl;
+    } else {
+      r = 0;
+    }
+    close(h);
+  }
+
+  if (r < n) {
+    h = open("/dev/urandom", O_RDONLY);
+    if (h < 0) {
+      return r;
+    }
+    int s = static_cast<int>(read(h, (char *)buf + r, n - r));
+    close(h);
+    if (s < 0) {
+      return r;
+    }
+    r += s;
+  }
+
+  if (r >= 8) {
+    *(long *)buf ^= lrand48();
+    srand48(*(long *)buf);
+  }
+
+  return r;
+}
+}  // namespace prng
+#endif
diff --git a/submodules/ton/tonlib-src/crypto/openssl/rand.hpp b/submodules/ton/tonlib-src/crypto/openssl/rand.hpp
new file mode 100644
index 0000000000..91064e079b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/openssl/rand.hpp
@@ -0,0 +1,56 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <string>
+#include <cassert>
+
+namespace prng {
+
+// use this generator unless need a separate one
+class RandomGen;
+RandomGen &rand_gen();
+
+class RandomGen {
+ public:
+  struct rand_error {};
+  void randomize(bool force = true);
+  void seed_add(const void *data, std::size_t size, double entropy = 0);
+  bool ok() const;
+  RandomGen() {
+    randomize(false);
+  }
+  RandomGen(const void *seed, std::size_t size) {
+    seed_add(seed, size);
+    randomize(false);
+  }
+  bool rand_bytes(void *data, std::size_t size, bool strong = false);
+  bool strong_rand_bytes(void *data, std::size_t size) {
+    return rand_bytes(data, size, true);
+  }
+  template <class T>
+  bool rand_obj(T &obj) {
+    return rand_bytes(&obj, sizeof(T));
+  }
+  template <class T>
+  bool rand_objs(T *ptr, std::size_t count) {
+    return rand_bytes(ptr, sizeof(T) * count);
+  }
+  std::string rand_string(std::size_t size, bool strong = false);
+};
+}  // namespace prng
diff --git a/submodules/ton/tonlib-src/crypto/openssl/residue.cpp b/submodules/ton/tonlib-src/crypto/openssl/residue.cpp
new file mode 100644
index 0000000000..809ccd5a4c
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/openssl/residue.cpp
@@ -0,0 +1,176 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "residue.h"
+
+// --- impl
+#include <assert.h>
+
+namespace arith {
+class Residue;
+class ResidueRing;
+
+void ResidueRing::init() {
+  Zero = new Residue(0, td::Ref<ResidueRing>(this));
+  One = new Residue(1, td::Ref<ResidueRing>(this));
+}
+
+ResidueRing::~ResidueRing() {
+  delete Zero;
+  delete One;
+  delete Img_i;
+  Zero = One = Img_i = 0;
+}
+
+const Residue operator+(const Residue& x, const Residue& y) {
+  x.same_ring(y);
+  Residue z(x.ring_ref());
+  bn_assert(BN_mod_add(z.val.bn_ptr(), x.val.bn_ptr(), y.val.bn_ptr(), x.modulus().bn_ptr(), get_ctx()));
+  return z;
+}
+
+const Residue operator-(const Residue& x, const Residue& y) {
+  x.same_ring(y);
+  Residue z(x.ring_ref());
+  bn_assert(BN_mod_sub(z.val.bn_ptr(), x.val.bn_ptr(), y.val.bn_ptr(), x.modulus().bn_ptr(), get_ctx()));
+  return z;
+}
+
+const Residue operator*(const Residue& x, const Residue& y) {
+  x.same_ring(y);
+  Residue z(x.ring_ref());
+  bn_assert(BN_mod_mul(z.val.bn_ptr(), x.val.bn_ptr(), y.val.bn_ptr(), x.modulus().bn_ptr(), get_ctx()));
+  return z;
+}
+
+const Residue operator-(const Residue& x) {
+  Residue z(x);
+  z.val.negate();
+  return z.reduce();
+}
+
+Residue& Residue::operator+=(const Residue& y) {
+  same_ring(y);
+  bn_assert(BN_mod_add(val.bn_ptr(), val.bn_ptr(), y.val.bn_ptr(), modulus().bn_ptr(), get_ctx()));
+  return *this;
+}
+
+Residue& Residue::operator-=(const Residue& y) {
+  same_ring(y);
+  bn_assert(BN_mod_sub(val.bn_ptr(), val.bn_ptr(), y.val.bn_ptr(), modulus().bn_ptr(), get_ctx()));
+  return *this;
+}
+
+Residue& Residue::operator*=(const Residue& y) {
+  same_ring(y);
+  bn_assert(BN_mod_mul(val.bn_ptr(), val.bn_ptr(), y.val.bn_ptr(), modulus().bn_ptr(), get_ctx()));
+  return *this;
+}
+
+bool operator==(const Residue& x, const Residue& y) {
+  x.same_ring(y);
+  return x.extract() == y.extract();
+}
+
+bool operator!=(const Residue& x, const Residue& y) {
+  x.same_ring(y);
+  return x.extract() != y.extract();
+}
+
+Residue sqr(const Residue& x) {
+  Residue z(x.ring_ref());
+  bn_assert(BN_mod_sqr(z.val.bn_ptr(), x.val.bn_ptr(), x.modulus().bn_ptr(), get_ctx()));
+  return z;
+}
+
+Residue power(const Residue& x, const Bignum& y) {
+  Residue z(x.ring_ref());
+  bn_assert(BN_mod_exp(z.val.bn_ptr(), x.val.bn_ptr(), y.bn_ptr(), x.modulus().bn_ptr(), get_ctx()));
+  return z;
+}
+
+Residue inverse(const Residue& x) {
+  assert(x.ring_ref()->is_prime());
+  return power(x, x.ring_ref()->get_modulus() - 2);
+}
+
+const Residue& ResidueRing::img_i() const {
+  if (!Img_i) {
+    assert(is_prime());
+    assert(modulus % 4 == 1);
+    int g = 2;
+    Bignum n = (modulus - 1) / 4;
+    while (true) {
+      Residue t = power(frac(g), n);
+      if (t != one() && t != frac(-1)) {
+        Img_i = new Residue(t);
+        break;
+      }
+      g++;
+    }
+  }
+  return *Img_i;
+}
+
+Residue sqrt(const Residue& x) {
+  assert(x.ring_of().is_prime());
+  const ResidueRing& R = x.ring_of();
+  const Bignum& p = R.get_modulus();
+  if (x.is_zero() || !p.odd()) {
+    return x;
+  }
+  if (p[1]) {  // p=3 (mod 4)
+    return power(x, (p + 1) >> 2);
+  } else if (p[2]) {
+    // p=5 (mod 8)
+    Residue t = power(x, (p + 3) >> 3);
+    return (sqr(t) == x) ? t : R.img_i() * t;
+  } else {
+    assert(p[2]);
+    return R.zero();
+  }
+}
+
+Residue ResidueRing::frac(long num, long denom) const {
+  assert(denom);
+  if (denom < 0) {
+    num = -num;
+    denom = -denom;
+  }
+  if (!(num % denom)) {
+    return Residue(num / denom, self_ref());
+  } else {
+    return Residue(num, self_ref()) * inverse(Residue(denom, self_ref()));
+  }
+}
+
+std::string Residue::to_str() const {
+  return "Mod(" + val.to_str() + "," + modulus().to_str() + ")";
+}
+
+std::ostream& operator<<(std::ostream& os, const Residue& x) {
+  return os << x.to_str();
+}
+
+std::istream& operator>>(std::istream& is, Residue& x) {
+  std::string word;
+  is >> word;
+  x = dec_string(word);
+  return is;
+}
+}  // namespace arith
diff --git a/submodules/ton/tonlib-src/crypto/openssl/residue.h b/submodules/ton/tonlib-src/crypto/openssl/residue.h
new file mode 100644
index 0000000000..0067083839
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/openssl/residue.h
@@ -0,0 +1,189 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "bignum.h"
+#include "common/refcnt.hpp"
+
+namespace arith {
+class Residue;
+class ResidueRing;
+
+class ResidueRing : public td::CntObject {
+ public:
+  struct bad_modulus {};
+
+ private:
+  const Bignum modulus;
+  bool prime;
+  Residue* Zero;
+  Residue* One;
+  mutable Residue* Img_i;
+  void init();
+
+ public:
+  typedef Residue element;
+  explicit ResidueRing(Bignum mod) : modulus(mod), prime(arith::is_prime(mod)), Zero(0), One(0), Img_i(0) {
+    init();
+  }
+  ~ResidueRing();
+  const Bignum& get_modulus() const {
+    return modulus;
+  }
+  bool is_prime() const {
+    return prime;
+  }
+  const Residue& zero() const {
+    return *Zero;
+  }
+  const Residue& one() const {
+    return *One;
+  }
+  const Residue& img_i() const;
+  Residue frac(long num, long denom = 1) const;
+  Residue convert(long num) const;
+  Residue convert(const Bignum& x) const;
+
+  Bignum reduce(const Bignum& x) const {
+    Bignum r = x % modulus;
+    if (r.sign() < 0) {
+      r += modulus;
+    }
+    return r;
+  }
+
+  Bignum& do_reduce(Bignum& x) const {
+    x %= modulus;
+    if (x.sign() < 0) {
+      x += modulus;
+    }
+    return x;
+  }
+
+ private:
+  td::Ref<ResidueRing> self_ref() const {
+    return td::Ref<ResidueRing>{this};
+  }
+};
+
+class Residue {
+ public:
+  struct not_same_ring {};
+
+ private:
+  td::Ref<ResidueRing> ring;
+  mutable Bignum val;
+  Residue& reduce() {
+    ring->do_reduce(val);
+    return *this;
+  }
+
+ public:
+  explicit Residue(td::Ref<ResidueRing> R) : ring(R) {
+  }
+  Residue(const Bignum& x, td::Ref<ResidueRing> R) : ring(R), val(R->reduce(x)) {
+  }
+  ~Residue() {
+  }
+  Residue(const Residue& x) : ring(x.ring), val(x.val) {
+  }
+  Bignum extract() const {
+    return val;
+  }
+  const Bignum& extract_raw() const {
+    return val;
+  }
+  const Bignum& modulus() const {
+    return ring->get_modulus();
+  }
+  void same_ring(const Residue& y) const {
+    if (ring != y.ring) {
+      throw not_same_ring();
+    }
+  }
+  const ResidueRing& ring_of() const {
+    return *ring;
+  }
+  td::Ref<ResidueRing> ring_ref() const {
+    return ring;
+  }
+  bool is_zero() const {
+    return (val == 0);
+  }
+  Residue& operator=(const Residue& x) {
+    same_ring(x);
+    val = x.val;
+    return *this;
+  }
+  Residue& operator=(const Bignum& x) {
+    val = ring->reduce(x);
+    return *this;
+  }
+  Residue& operator+=(const Residue& y);
+  Residue& operator-=(const Residue& y);
+  Residue& operator*=(const Residue& y);
+  Residue& operator+=(long y) {
+    val += y;
+    return reduce();
+  }
+  Residue& operator-=(long y) {
+    val -= y;
+    return reduce();
+  }
+  Residue& operator*=(long y) {
+    val *= y;
+    return reduce();
+  }
+  Residue& negate() {
+    val.negate();
+    return reduce();
+  }
+  friend const Residue operator+(const Residue& x, const Residue& y);
+  friend const Residue operator-(const Residue& x, const Residue& y);
+  friend const Residue operator*(const Residue& x, const Residue& y);
+  friend const Residue operator-(const Residue& x);
+  friend Residue sqr(const Residue& x);
+  friend Residue power(const Residue& x, const Bignum& y);
+  friend Residue inverse(const Residue& x);
+  std::string to_str() const;
+};
+
+const Residue operator+(const Residue& x, const Residue& y);
+const Residue operator-(const Residue& x, const Residue& y);
+const Residue operator*(const Residue& x, const Residue& y);
+const Residue operator-(const Residue& x);
+
+bool operator==(const Residue& x, const Residue& y);
+bool operator!=(const Residue& x, const Residue& y);
+
+Residue sqr(const Residue& x);
+Residue power(const Residue& x, const Bignum& y);
+Residue inverse(const Residue& x);
+Residue sqrt(const Residue& x);
+
+inline Residue ResidueRing::convert(long x) const {
+  return Residue(x, td::Ref<ResidueRing>(this));
+}
+
+inline Residue ResidueRing::convert(const Bignum& x) const {
+  return Residue(x, td::Ref<ResidueRing>(this));
+}
+
+std::ostream& operator<<(std::ostream& os, const Residue& x);
+std::istream& operator>>(std::istream& is, Residue& x);
+}  // namespace arith
diff --git a/submodules/ton/tonlib-src/crypto/parser/lexer.cpp b/submodules/ton/tonlib-src/crypto/parser/lexer.cpp
new file mode 100644
index 0000000000..d80293402d
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/parser/lexer.cpp
@@ -0,0 +1,288 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "lexer.h"
+#include "symtable.h"
+#include <sstream>
+#include <cassert>
+
+namespace src {
+
+/*
+ *
+ *   LEXER
+ *
+ */
+
+std::string Lexem::lexem_name_str(int idx) {
+  if (idx == Eof) {
+    return "end of file";
+  } else if (idx == Ident) {
+    return "identifier";
+  } else if (idx == Number) {
+    return "number";
+  } else if (idx == String) {
+    return "string";
+  } else if (idx == Special) {
+    return "special";
+  } else if (sym::symbols.get_keyword(idx)) {
+    return "`" + sym::symbols.get_keyword(idx)->str + "`";
+  } else {
+    std::ostringstream os{"<unknown lexem of type "};
+    os << idx << ">";
+    return os.str();
+  }
+}
+
+std::string Lexem::name_str() const {
+  if (tp == Ident) {
+    return std::string{"identifier `"} + sym::symbols.get_name(val) + "`";
+  } else if (tp == String) {
+    return std::string{"string \""} + str + '"';
+  } else {
+    return lexem_name_str(tp);
+  }
+}
+
+bool is_number(std::string str) {
+  auto st = str.begin(), en = str.end();
+  if (st == en) {
+    return false;
+  }
+  if (*st == '-') {
+    st++;
+  }
+  bool hex = false;
+  if (st + 1 < en && *st == '0' && st[1] == 'x') {
+    st += 2;
+    hex = true;
+  }
+  if (st == en) {
+    return false;
+  }
+  while (st < en) {
+    int c = *st;
+    if (c >= '0' && c <= '9') {
+      ++st;
+      continue;
+    }
+    if (!hex) {
+      return false;
+    }
+    c |= 0x20;
+    if (c < 'a' || c > 'f') {
+      return false;
+    }
+    ++st;
+  }
+  return true;
+}
+
+int Lexem::classify() {
+  if (tp != Unknown) {
+    return tp;
+  }
+  sym::sym_idx_t i = sym::symbols.lookup(str);
+  if (i) {
+    assert(str == sym::symbols[i]->str);
+    str = sym::symbols[i]->str;
+    sym::sym_idx_t idx = sym::symbols[i]->idx;
+    tp = (idx < 0 ? -idx : Ident);
+    val = i;
+  } else if (is_number(str)) {
+    tp = Number;
+  } else {
+    tp = lexem_is_special(str);
+  }
+  if (tp == Unknown) {
+    tp = Ident;
+    val = sym::symbols.lookup(str, 1);
+  }
+  return tp;
+}
+
+int Lexem::set(std::string _str, const SrcLocation& _loc, int _tp, int _val) {
+  str = _str;
+  loc = _loc;
+  tp = _tp;
+  val = _val;
+  return classify();
+}
+
+Lexer::Lexer(SourceReader& _src, bool init, std::string active_chars, std::string eol_cmts, std::string open_cmts,
+             std::string close_cmts, std::string quote_chars)
+    : src(_src), eof(false), lexem("", src.here(), Lexem::Undefined), peek_lexem("", {}, Lexem::Undefined) {
+  std::memset(char_class, 0, sizeof(char_class));
+  unsigned char activity = cc::active;
+  for (char c : active_chars) {
+    if (c == ' ') {
+      if (!--activity) {
+        activity = cc::allow_repeat;
+      }
+    } else if ((unsigned)c < 0x80) {
+      char_class[(unsigned)c] |= activity;
+    }
+  }
+  set_spec(eol_cmt, eol_cmts);
+  set_spec(cmt_op, open_cmts);
+  set_spec(cmt_cl, close_cmts);
+  for (int c : quote_chars) {
+    if (c > ' ' && c <= 0x7f) {
+      char_class[(unsigned)c] |= cc::quote_char;
+    }
+  }
+  if (init) {
+    next();
+  }
+}
+
+void Lexer::set_spec(std::array<int, 3>& arr, std::string setup) {
+  arr[0] = arr[1] = arr[2] = -0x100;
+  std::size_t n = setup.size(), i;
+  for (i = 0; i < n; i++) {
+    if (setup[i] == ' ') {
+      continue;
+    }
+    if (i == n - 1 || setup[i + 1] == ' ') {
+      arr[0] = setup[i];
+    } else if (i == n - 2 || (i < n - 2 && setup[i + 2] == ' ')) {
+      arr[1] = setup[i];
+      arr[2] = setup[++i];
+    } else {
+      while (i < n && setup[i] != ' ') {
+        i++;
+      }
+    }
+  }
+}
+
+void Lexer::expect(int exp_tp, const char* msg) {
+  if (tp() != exp_tp) {
+    throw ParseError{lexem.loc, (msg ? std::string{msg} : Lexem::lexem_name_str(exp_tp)) + " expected instead of " +
+                                    cur().name_str()};
+  }
+  next();
+}
+
+const Lexem& Lexer::next() {
+  if (peek_lexem.valid()) {
+    lexem = std::move(peek_lexem);
+    peek_lexem.clear({}, Lexem::Undefined);
+    eof = (lexem.tp == Lexem::Eof);
+    return lexem;
+  }
+  if (eof) {
+    return lexem.clear(src.here(), Lexem::Eof);
+  }
+  long long comm = 1;
+  while (!src.seek_eof()) {
+    int cc = src.cur_char(), nc = src.next_char();
+    if (cc == eol_cmt[0] || (cc == eol_cmt[1] && nc == eol_cmt[2])) {
+      src.load_line();
+    } else if (cc == cmt_op[1] && nc == cmt_op[2]) {
+      src.advance(2);
+      comm = comm * 2 + 1;
+    } else if (cc == cmt_op[0]) {
+      src.advance(1);
+      comm *= 2;
+    } else if (comm == 1) {
+      break;
+    } else if (cc == cmt_cl[1] && nc == cmt_cl[2]) {
+      if (!(comm & 1)) {
+        src.error(std::string{"a `"} + (char)cmt_op[0] + "` comment closed by `" + (char)cmt_cl[1] + (char)cmt_cl[2] +
+                  "`");
+      }
+      comm >>= 1;
+      src.advance(2);
+    } else if (cc == cmt_cl[0]) {
+      if (!(comm & 1)) {
+        src.error(std::string{"a `"} + (char)cmt_op[1] + (char)cmt_op[2] + "` comment closed by `" + (char)cmt_cl[0] +
+                  "`");
+      }
+      comm >>= 1;
+      src.advance(1);
+    } else {
+      src.advance(1);
+    }
+    if (comm < 0) {
+      src.error("too many nested comments");
+    }
+  }
+  if (src.seek_eof()) {
+    eof = true;
+    if (comm > 1) {
+      if (comm & 1) {
+        src.error(std::string{"`"} + (char)cmt_op[1] + (char)cmt_op[2] + "` comment extends past end of file");
+      } else {
+        src.error(std::string{"`"} + (char)cmt_op[0] + "` comment extends past end of file");
+      }
+    }
+    return lexem.clear(src.here(), Lexem::Eof);
+  }
+  int c = src.cur_char();
+  const char* end = src.get_ptr();
+  if (is_quote_char(c) || c == '`') {
+    int qc = c;
+    ++end;
+    while (end < src.get_end_ptr() && *end != qc) {
+      ++end;
+    }
+    if (*end != qc) {
+      src.error(qc == '`' ? "a `back-quoted` token extends past end of line" : "string extends past end of line");
+    }
+    lexem.set(std::string{src.get_ptr() + 1, end}, src.here(), qc == '`' ? Lexem::Unknown : Lexem::String);
+    src.set_ptr(end + 1);
+    // std::cerr << lexem.name_str() << ' ' << lexem.str << std::endl;
+    return lexem;
+  }
+  int len = 0, pc = -0x100;
+  while (end < src.get_end_ptr()) {
+    c = *end;
+    bool repeated = (c == pc && is_repeatable(c));
+    if (c == ' ' || c == 9 || (len && is_left_active(c) && !repeated)) {
+      break;
+    }
+    ++len;
+    ++end;
+    if (is_right_active(c) && !repeated) {
+      break;
+    }
+    pc = c;
+  }
+  lexem.set(std::string{src.get_ptr(), end}, src.here());
+  src.set_ptr(end);
+  // std::cerr << lexem.name_str() << ' ' << lexem.str << std::endl;
+  return lexem;
+}
+
+const Lexem& Lexer::peek() {
+  if (peek_lexem.valid()) {
+    return peek_lexem;
+  }
+  if (eof) {
+    return lexem.clear(src.here(), Lexem::Eof);
+  }
+  Lexem keep = std::move(lexem);
+  next();
+  peek_lexem = std::move(lexem);
+  lexem = std::move(keep);
+  eof = false;
+  return peek_lexem;
+}
+
+}  // namespace src
diff --git a/submodules/ton/tonlib-src/crypto/parser/lexer.h b/submodules/ton/tonlib-src/crypto/parser/lexer.h
new file mode 100644
index 0000000000..803560e148
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/parser/lexer.h
@@ -0,0 +1,114 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "srcread.h"
+#include <array>
+#include <memory>
+#include <cstring>
+
+namespace src {
+
+/*
+ *
+ *   LEXER
+ *
+ */
+
+int lexem_is_special(std::string str);  // return 0 if no special lexems are needed
+
+struct Lexem {
+  enum { Undefined = -2, Eof = -1, Unknown = 0, Ident = 0, Number = 1, Special = 2, String = 3 };
+  int tp;
+  int val;
+  std::string str;
+  SrcLocation loc;
+  int classify();
+  Lexem(std::string _str = "", const SrcLocation& _loc = {}, int _tp = Unknown, int _val = 0)
+      : tp(_tp), val(_val), str(_str), loc(_loc) {
+    classify();
+  }
+  int set(std::string _str = "", const SrcLocation& _loc = {}, int _tp = Unknown, int _val = 0);
+  Lexem& clear(const SrcLocation& _loc = {}, int _tp = Unknown, int _val = 0) {
+    tp = _tp;
+    val = _val;
+    loc = _loc;
+    str = "";
+    return *this;
+  }
+  bool valid() const {
+    return tp != Undefined;
+  }
+  std::string name_str() const;
+  void error(std::string _str) const {
+    throw ParseError{loc, _str};
+  }
+  void error_at(std::string str1, std::string str2) const {
+    error(str1 + str + str2);
+  }
+
+  static std::string lexem_name_str(int idx);
+};
+
+class Lexer {
+  SourceReader& src;
+  bool eof;
+  Lexem lexem, peek_lexem;
+  unsigned char char_class[128];
+  std::array<int, 3> eol_cmt, cmt_op, cmt_cl;
+  enum cc { left_active = 2, right_active = 1, active = 3, allow_repeat = 4, quote_char = 8 };
+
+ public:
+  bool eof_found() const {
+    return eof;
+  }
+  Lexer(SourceReader& _src, bool init = false, std::string active_chars = ";,() ~.", std::string eol_cmts = ";;",
+        std::string open_cmts = "{-", std::string close_cmts = "-}", std::string quote_chars = "\"");
+  const Lexem& next();
+  const Lexem& cur() const {
+    return lexem;
+  }
+  const Lexem& peek();
+  int tp() const {
+    return lexem.tp;
+  }
+  void expect(int exp_tp, const char* msg = 0);
+  int classify_char(unsigned c) const {
+    return c < 0x80 ? char_class[c] : 0;
+  }
+  bool is_active(int c) const {
+    return (classify_char(c) & cc::active) == cc::active;
+  }
+  bool is_left_active(int c) const {
+    return (classify_char(c) & cc::left_active);
+  }
+  bool is_right_active(int c) const {
+    return (classify_char(c) & cc::right_active);
+  }
+  bool is_repeatable(int c) const {
+    return (classify_char(c) & cc::allow_repeat);
+  }
+  bool is_quote_char(int c) const {
+    return (classify_char(c) & cc::quote_char);
+  }
+
+ private:
+  void set_spec(std::array<int, 3>& arr, std::string setup);
+};
+
+}  // namespace src
diff --git a/submodules/ton/tonlib-src/crypto/parser/srcread.cpp b/submodules/ton/tonlib-src/crypto/parser/srcread.cpp
new file mode 100644
index 0000000000..ac031e1e14
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/parser/srcread.cpp
@@ -0,0 +1,180 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "srcread.h"
+
+namespace src {
+
+/*
+ *
+ *   SOURCE FILE READER
+ *
+ */
+
+std::ostream& operator<<(std::ostream& os, const FileDescr* fdescr) {
+  return os << (fdescr ? (fdescr->is_stdin ? "stdin" : fdescr->filename) : "unknown-location");
+}
+
+std::ostream& operator<<(std::ostream& os, const Fatal& fatal) {
+  return os << fatal.get_msg();
+}
+
+void SrcLocation::show(std::ostream& os) const {
+  os << fdescr;
+  if (line_no > 0) {
+    os << ':' << line_no;
+    if (line_pos >= 0) {
+      os << ':' << (line_pos + 1);
+    }
+  }
+}
+
+bool SrcLocation::show_context(std::ostream& os) const {
+  if (text.empty() || line_pos < 0 || (unsigned)line_pos > text.size()) {
+    return false;
+  }
+  bool skip_left = (line_pos > 200), skip_right = (line_pos + 200u < text.size());
+  const char* start = skip_left ? text.c_str() + line_pos - 100 : text.c_str();
+  const char* end = skip_right ? text.c_str() + line_pos + 100 : text.c_str() + text.size();
+  const char* here = text.c_str() + line_pos;
+  os << "  ";
+  if (skip_left) {
+    os << "... ";
+  }
+  for (const char* ptr = start; ptr < end; ptr++) {
+    os << (char)*ptr;
+  }
+  if (skip_right) {
+    os << " ...";
+  }
+  os << std::endl;
+  os << "  ";
+  if (skip_left) {
+    os << "... ";
+  }
+  for (const char* ptr = start; ptr < here; ptr++) {
+    char c = *ptr;
+    os << (c == 9 || c == 10 ? c : ' ');
+  }
+  os << '^' << std::endl;
+  return true;
+}
+
+std::ostream& operator<<(std::ostream& os, const SrcLocation& loc) {
+  loc.show(os);
+  return os;
+}
+
+void SrcLocation::show_gen_error(std::ostream& os, std::string message, std::string err_type) const {
+  show(os);
+  if (!err_type.empty()) {
+    os << ": " << err_type;
+  }
+  os << ": " << message << std::endl;
+  show_context(os);
+}
+
+std::ostream& operator<<(std::ostream& os, const Error& error) {
+  error.show(os);
+  return os;
+}
+
+void ParseError::show(std::ostream& os) const {
+  os << where << ": error: " << message << std::endl;
+  where.show_context(os);
+}
+
+SourceReader::SourceReader(std::istream* _is, const FileDescr* _fdescr)
+    : ifs(_is), loc(_fdescr), eof(false), cur_line_len(0), start(0), cur(0), end(0) {
+  load_line();
+}
+
+void SourceReader::set_eof() {
+  if (!eof) {
+    eof = true;
+    start = cur = end = 0;
+  }
+}
+
+int SourceReader::skip_spc() {
+  if (!cur) {
+    return 0;
+  }
+  const char* ptr = cur;
+  int res = 0;
+  while (*ptr == ' ' || *ptr == 9) {
+    ++ptr;
+    ++res;
+  }
+  set_ptr(ptr);
+  return res;
+}
+
+bool SourceReader::seek_eof() {
+  while (seek_eoln()) {
+    if (!load_line()) {
+      return true;
+    }
+  }
+  return false;
+}
+
+const char* SourceReader::set_ptr(const char* ptr) {
+  if (ptr != cur) {
+    if (ptr < cur || ptr > end) {
+      error("parsing position went outside of line");
+    }
+    loc.line_pos = (int)(ptr - start);
+    cur = ptr;
+  }
+  return ptr;
+}
+
+bool SourceReader::load_line() {
+  if (eof) {
+    return false;
+  }
+  if (ifs->eof()) {
+    set_eof();
+    return false;
+  }
+  ++loc.line_no;
+  loc.line_pos = -1;
+  std::getline(*ifs, cur_line);
+  if (ifs->fail()) {
+    set_eof();
+    if (!ifs->eof()) {
+      error("cannot read line from source stream");
+    }
+    return false;
+  }
+  std::size_t len = cur_line.size();
+  if (len > 0xffffff) {
+    set_eof();
+    error("line too long");
+    return false;
+  }
+  loc.text = cur_line;
+  cur_line_len = (int)len;
+  loc.line_pos = 0;
+  cur = start = cur_line.c_str();
+  end = start + cur_line_len;
+  return true;
+}
+
+}  // namespace src
diff --git a/submodules/ton/tonlib-src/crypto/parser/srcread.h b/submodules/ton/tonlib-src/crypto/parser/srcread.h
new file mode 100644
index 0000000000..05b792122e
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/parser/srcread.h
@@ -0,0 +1,150 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <string>
+#include <iostream>
+
+namespace src {
+
+/*
+ *
+ *   SOURCE FILE READER
+ *
+ */
+
+struct FileDescr {
+  std::string filename;
+  bool is_stdin;
+  FileDescr(std::string _fname, bool _stdin = false) : filename(std::move(_fname)), is_stdin(_stdin) {
+  }
+};
+
+struct Fatal {
+  std::string message;
+  Fatal(std::string _msg) : message(std::move(_msg)) {
+  }
+  std::string get_msg() const {
+    return message;
+  }
+};
+
+std::ostream& operator<<(std::ostream& os, const Fatal& fatal);
+
+struct SrcLocation {
+  const FileDescr* fdescr;
+  int line_no;
+  int line_pos;
+  std::string text;
+  SrcLocation() : fdescr(nullptr), line_no(0), line_pos(-1) {
+  }
+  SrcLocation(const FileDescr* _fdescr, int line = 0, int pos = -1) : fdescr(_fdescr), line_no(line), line_pos(pos) {
+  }
+  bool defined() const {
+    return fdescr;
+  }
+  void show(std::ostream& os) const;
+  bool show_context(std::ostream& os) const;
+  void show_gen_error(std::ostream& os, std::string message, std::string err_type = "") const;
+  void show_note(std::string err_msg) const {
+    show_gen_error(std::cerr, err_msg, "note");
+  }
+  void show_warning(std::string err_msg) const {
+    show_gen_error(std::cerr, err_msg, "warning");
+  }
+  void show_error(std::string err_msg) const {
+    show_gen_error(std::cerr, err_msg, "error");
+  }
+};
+
+std::ostream& operator<<(std::ostream& os, const SrcLocation& loc);
+
+struct Error {
+  virtual ~Error() = default;
+  virtual void show(std::ostream& os) const = 0;
+};
+
+std::ostream& operator<<(std::ostream& os, const Error& error);
+
+struct ParseError : Error {
+  SrcLocation where;
+  std::string message;
+  ParseError(const SrcLocation& _where, std::string _msg) : where(_where), message(_msg) {
+  }
+  ParseError(const SrcLocation* _where, std::string _msg) : message(_msg) {
+    if (_where) {
+      where = *_where;
+    }
+  }
+  ~ParseError() override = default;
+  void show(std::ostream& os) const override;
+};
+
+class SourceReader {
+  std::istream* ifs;
+  SrcLocation loc;
+  bool eof;
+  std::string cur_line;
+  int cur_line_len;
+  void set_eof();
+  const char *start, *cur, *end;
+
+ public:
+  SourceReader(std::istream* _is, const FileDescr* _fdescr);
+  bool load_line();
+  bool is_eof() const {
+    return eof;
+  }
+  int is_eoln() const {
+    return cur == end;
+  }
+  int skip_spc();
+  bool seek_eoln() {
+    skip_spc();
+    return is_eoln();
+  }
+  bool seek_eof();
+  const char* cur_line_cstr() const {
+    return cur_line.c_str();
+  }
+  const SrcLocation& here() const {
+    return loc;
+  }
+  char cur_char() const {
+    return *cur;
+  }
+  char next_char() const {
+    return cur[1];
+  }
+  const char* get_ptr() const {
+    return cur;
+  }
+  const char* get_end_ptr() const {
+    return end;
+  }
+  const char* set_ptr(const char* ptr);
+  void advance(int n) {
+    set_ptr(get_ptr() + n);
+  }
+  void error(std::string err_msg) {
+    throw ParseError{loc, err_msg};
+  }
+};
+
+}  // namespace src
diff --git a/submodules/ton/tonlib-src/crypto/parser/symtable.cpp b/submodules/ton/tonlib-src/crypto/parser/symtable.cpp
new file mode 100644
index 0000000000..157b4a2b06
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/parser/symtable.cpp
@@ -0,0 +1,181 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "symtable.h"
+#include <sstream>
+#include <cassert>
+
+namespace sym {
+
+/*
+ *
+ *   SYMBOL VALUES (DECLARED)
+ *
+ */
+
+int scope_level;
+
+SymTable<100003> symbols;
+
+SymDef* sym_def[symbols.hprime];
+SymDef* global_sym_def[symbols.hprime];
+std::vector<std::pair<int, SymDef>> symbol_stack;
+std::vector<src::SrcLocation> scope_opened_at;
+
+std::string Symbol::unknown_symbol_name(sym_idx_t i) {
+  if (!i) {
+    return "_";
+  } else {
+    std::ostringstream os;
+    os << "SYM#" << i;
+    return os.str();
+  }
+}
+
+sym_idx_t SymTableBase::gen_lookup(std::string str, int mode, sym_idx_t idx) {
+  unsigned long long h1 = 1, h2 = 1;
+  for (char c : str) {
+    h1 = ((h1 * 239) + (unsigned char)(c)) % p;
+    h2 = ((h2 * 17) + (unsigned char)(c)) % (p - 1);
+  }
+  ++h2;
+  ++h1;
+  while (true) {
+    if (sym_table[h1]) {
+      if (sym_table[h1]->str == str) {
+        return (mode & 2) ? not_found : sym_idx_t(h1);
+      }
+      h1 += h2;
+      if (h1 > p) {
+        h1 -= p;
+      }
+    } else {
+      if (!(mode & 1)) {
+        return not_found;
+      }
+      if (def_sym >= ((long)p * 3) / 4) {
+        throw SymTableOverflow{def_sym};
+      }
+      sym_table[h1] = std::make_unique<Symbol>(str, idx <= 0 ? sym_idx_t(h1) : -idx);
+      ++def_sym;
+      return sym_idx_t(h1);
+    }
+  }
+}
+
+SymTableBase& SymTableBase::add_keyword(std::string str, sym_idx_t idx) {
+  if (idx <= 0) {
+    idx = ++def_kw;
+  }
+  sym_idx_t res = gen_lookup(str, -1, idx);
+  if (!res) {
+    throw SymTableKwRedef{str};
+  }
+  if (idx < max_kw_idx) {
+    keywords[idx] = res;
+  }
+  return *this;
+}
+
+void open_scope(src::Lexer& lex) {
+  ++scope_level;
+  scope_opened_at.push_back(lex.cur().loc);
+}
+
+void close_scope(src::Lexer& lex) {
+  if (!scope_level) {
+    throw src::Fatal{"cannot close the outer scope"};
+  }
+  while (!symbol_stack.empty() && symbol_stack.back().first == scope_level) {
+    SymDef old_def = symbol_stack.back().second;
+    auto idx = old_def.sym_idx;
+    symbol_stack.pop_back();
+    SymDef* cur_def = sym_def[idx];
+    assert(cur_def);
+    assert(cur_def->level == scope_level && cur_def->sym_idx == idx);
+    //std::cerr << "restoring local symbol `" << old_def.name << "` of level " << scope_level << " to its previous level " << old_def.level << std::endl;
+    if (cur_def->value) {
+      //std::cerr << "deleting value of symbol " << old_def.name << ":" << old_def.level << " at " << (const void*) it->second.value << std::endl;
+      delete cur_def->value;
+    }
+    if (!old_def.level && !old_def.value) {
+      delete cur_def;  // ??? keep the definition always?
+      sym_def[idx] = nullptr;
+    } else {
+      cur_def->value = std::move(old_def.value);
+      cur_def->level = old_def.level;
+    }
+    old_def.value = nullptr;
+  }
+  --scope_level;
+  scope_opened_at.pop_back();
+}
+
+SymDef* lookup_symbol(sym_idx_t idx, int flags) {
+  if (!idx) {
+    return nullptr;
+  }
+  if ((flags & 1) && sym_def[idx]) {
+    return sym_def[idx];
+  }
+  if ((flags & 2) && global_sym_def[idx]) {
+    return global_sym_def[idx];
+  }
+  return nullptr;
+}
+
+SymDef* lookup_symbol(std::string name, int flags) {
+  return lookup_symbol(symbols.lookup(name), flags);
+}
+
+SymDef* define_global_symbol(sym_idx_t name_idx, bool force_new, const src::SrcLocation& loc) {
+  if (!name_idx) {
+    return nullptr;
+  }
+  auto found = global_sym_def[name_idx];
+  if (found) {
+    return force_new && found->value ? nullptr : found;
+  }
+  return global_sym_def[name_idx] = new SymDef(0, name_idx, loc);
+}
+
+SymDef* define_symbol(sym_idx_t name_idx, bool force_new, const src::SrcLocation& loc) {
+  if (!name_idx) {
+    return nullptr;
+  }
+  if (!scope_level) {
+    return define_global_symbol(name_idx, force_new, loc);
+  }
+  auto found = sym_def[name_idx];
+  if (found) {
+    if (found->level < scope_level) {
+      symbol_stack.push_back(std::make_pair(scope_level, *found));
+      found->level = scope_level;
+    } else if (found->value && force_new) {
+      return nullptr;
+    }
+    found->value = 0;
+    found->loc = loc;
+    return found;
+  }
+  found = sym_def[name_idx] = new SymDef(scope_level, name_idx, loc);
+  symbol_stack.push_back(std::make_pair(scope_level, SymDef{0, name_idx}));
+  return found;
+}
+
+}  // namespace sym
diff --git a/submodules/ton/tonlib-src/crypto/parser/symtable.h b/submodules/ton/tonlib-src/crypto/parser/symtable.h
new file mode 100644
index 0000000000..6c77ca7b03
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/parser/symtable.h
@@ -0,0 +1,177 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "srcread.h"
+#include "lexer.h"
+#include <vector>
+
+namespace sym {
+
+/*
+ *
+ *   SYMBOL VALUES (DECLARED)
+ *
+ */
+
+typedef int var_idx_t;
+
+struct SymValBase {
+  enum { _Param, _Var, _Func, _Typename };
+  int type;
+  int idx;
+  SymValBase(int _type, int _idx) : type(_type), idx(_idx) {
+  }
+  virtual ~SymValBase() = default;
+};
+
+/*
+ *
+ *   SYMBOL TABLE
+ *
+ */
+
+// defined outside this module (by the end user)
+int compute_symbol_subclass(std::string str);  // return 0 if unneeded
+
+typedef int sym_idx_t;
+
+struct Symbol {
+  std::string str;
+  sym_idx_t idx;
+  int subclass;
+  Symbol(std::string _str, sym_idx_t _idx, int _sc) : str(_str), idx(_idx), subclass(_sc) {
+  }
+  Symbol(std::string _str, sym_idx_t _idx) : str(_str), idx(_idx) {
+    subclass = compute_symbol_subclass(std::move(_str));
+  }
+  static std::string unknown_symbol_name(sym_idx_t i);
+};
+
+class SymTableBase {
+  unsigned p;
+  std::unique_ptr<Symbol>* sym_table;
+  sym_idx_t def_kw, def_sym;
+  static constexpr int max_kw_idx = 10000;
+  sym_idx_t keywords[max_kw_idx];
+
+ public:
+  SymTableBase(unsigned p_, std::unique_ptr<Symbol>* sym_table_)
+      : p(p_), sym_table(sym_table_), def_kw(0x100), def_sym(0) {
+    std::memset(keywords, 0, sizeof(keywords));
+  }
+  static constexpr sym_idx_t not_found = 0;
+  SymTableBase& add_keyword(std::string str, sym_idx_t idx = 0);
+  SymTableBase& add_kw_char(char c) {
+    return add_keyword(std::string{c}, c);
+  }
+  sym_idx_t lookup(std::string str, int mode = 0) {
+    return gen_lookup(str, mode);
+  }
+  sym_idx_t lookup_add(std::string str) {
+    return gen_lookup(str, 1);
+  }
+  Symbol* operator[](sym_idx_t i) const {
+    return sym_table[i].get();
+  }
+  bool is_keyword(sym_idx_t i) const {
+    return sym_table[i] && sym_table[i]->idx < 0;
+  }
+  std::string get_name(sym_idx_t i) const {
+    return sym_table[i] ? sym_table[i]->str : Symbol::unknown_symbol_name(i);
+  }
+  int get_subclass(sym_idx_t i) const {
+    return sym_table[i] ? sym_table[i]->subclass : 0;
+  }
+  Symbol* get_keyword(int i) const {
+    return ((unsigned)i < (unsigned)max_kw_idx) ? sym_table[keywords[i]].get() : nullptr;
+  }
+
+ protected:
+  sym_idx_t gen_lookup(std::string str, int mode = 0, sym_idx_t idx = 0);
+};
+
+template <unsigned pp>
+class SymTable : public SymTableBase {
+ public:
+  static constexpr int hprime = pp;
+  static int size() {
+    return pp + 1;
+  }
+
+ private:
+  std::unique_ptr<Symbol> sym[pp + 1];
+
+ public:
+  SymTable() : SymTableBase(pp, sym) {
+  }
+  SymTable& add_keyword(std::string str, sym_idx_t idx = 0) {
+    SymTableBase::add_keyword(str, idx);
+    return *this;
+  }
+  SymTable& add_kw_char(char c) {
+    return add_keyword(std::string{c}, c);
+  }
+};
+
+struct SymTableOverflow {
+  int sym_def;
+  SymTableOverflow(int x) : sym_def(x) {
+  }
+};
+
+struct SymTableKwRedef {
+  std::string kw;
+  SymTableKwRedef(std::string _kw) : kw(_kw) {
+  }
+};
+
+extern SymTable<100003> symbols;
+
+extern int scope_level;
+
+struct SymDef {
+  int level;
+  sym_idx_t sym_idx;
+  SymValBase* value;
+  src::SrcLocation loc;
+  SymDef(int lvl, sym_idx_t idx, const src::SrcLocation& _loc = {}, SymValBase* val = 0)
+      : level(lvl), sym_idx(idx), value(val), loc(_loc) {
+  }
+  bool has_name() const {
+    return sym_idx;
+  }
+  std::string name() const {
+    return symbols.get_name(sym_idx);
+  }
+};
+
+extern SymDef* sym_def[symbols.hprime];
+extern SymDef* global_sym_def[symbols.hprime];
+extern std::vector<std::pair<int, SymDef>> symbol_stack;
+extern std::vector<src::SrcLocation> scope_opened_at;
+
+void open_scope(src::Lexer& lex);
+void close_scope(src::Lexer& lex);
+SymDef* lookup_symbol(sym_idx_t idx, int flags = 3);
+SymDef* lookup_symbol(std::string name, int flags = 3);
+
+SymDef* define_global_symbol(sym_idx_t name_idx, bool force_new = false, const src::SrcLocation& loc = {});
+SymDef* define_symbol(sym_idx_t name_idx, bool force_new = false, const src::SrcLocation& loc = {});
+
+}  // namespace sym
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/CreateState.fif b/submodules/ton/tonlib-src/crypto/smartcont/CreateState.fif
new file mode 100644
index 0000000000..b16df7cacf
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/CreateState.fif
@@ -0,0 +1,180 @@
+"Asm.fif" include
+
+31 -1<< constant wc_undef
+0 constant wc_base
+-1 constant wc_master
+
+{ wcid@ 2dup <> swap wc_undef <> and
+  abort"workchain_id already set to another value"
+  wcid! } : setworkchain
+{ globalid@ 2dup <> swap and
+  abort"global_id already set to another value"
+  dup 0= abort"global_id cannot be zero"
+  globalid! } : setglobalid
+
+<b b> constant empty_cell
+
+// b x --> b'  ( serializes a Gram amount )
+{ -1 { 1+ 2dup 8 * ufits } until
+  rot over 4 u, -rot 8 * u, } : Gram,
+
+// workchain-id -- wc-zero-state
+{ <b x{9023afe2} s, globalid@ 32 i, 0 8 i, swap 32 i, 1 63 << 64 u,
+  0 64 i, now 32 u, 0 64 i, -1 32 i, <b 0 67 u, b> ref, 0 1 u,
+  <b 0 11 u, b> ref,
+  <b 0 128 10 + 1+ 1+ u, b> ref, 0 1 u, b>
+  dup isShardState? not abort"invalid ShardState created"
+} : mkemptyShardState
+
+' dictnew : Libs{
+'nop : }Libs
+{ <b swap 1 u, over ref, b> <s swap hash rot 256 udict!+
+  0= abort"duplicate library in collection" } : lib+
+{ 0 lib+ } : private_lib
+{ 1 lib+ } : public_lib
+
+{ (configdict) 0= abort"Configuration dictionary is empty" } : configdict
+
+// version capabilities --
+{ <b x{c4} s, rot 32 u, swap 64 u, b> 8 config! } : config.version!
+1 constant capIhr
+2 constant capCreateStats
+
+// max-validators masterchain-validators min-validators --
+{ swap rot <b swap 16 u, swap 16 u, swap 16 u, b> 16 config! } : config.validator_num!
+
+// min-stake max-stake min-total-stake max-factor --
+{ 4 0 reverse <b swap Gram, swap Gram, swap Gram, swap 32 u, b>
+  17 config!
+} : config.validator_stake_limits!
+
+// elected-for elections-begin-before elections-end-before stakes-frozen
+{ 4 0 reverse <b { swap 32 u, } 4 times b> 15 config! } : config.election_params!
+
+dictnew 0 2constant validator-dict
+{ @' validator-dict } : validator-dict@
+{ validator-dict@ nip } : validator#
+// val-pubkey weight --
+{ dup 0<= abort"validator weight must be non-negative"
+  dup 64 ufits not abort"validator weight must fit into 64 bits"
+  over Blen 32 <> abort"validator public key must be 32 bytes long"
+  <b x{538e81278a} s, rot B, swap 64 u, b> <s
+  validator-dict@ dup 1+ 3 -roll swap 
+  16 udict!+ 0= abort"cannot add validator"
+  swap 2 'nop does : validator-dict
+} : add-validator
+// since-ut until-ut main-val-cnt-or-0 --
+{ ?dup 0= { validator# } if 
+  validator# 0= abort"no initial validators defined"
+  rot <b x{11} s, swap 32 u, rot 32 u, validator# 16 u, swap 16 u,
+  validator-dict@ drop <s s, b>
+  34 config!
+} : config.validators!
+
+dictnew constant workchain-dict
+// root-hash file-hash enable-utime actual-min-split min-split max-split workchain-id --
+{ <b x{a6} s, 5 roll 32 u, 4 roll 8 u, 3 roll 8 u, rot 8 u, x{e000} s,
+  3 roll 256 u, rot 256 u, 0 32 u, x{1} s, -1 32 i, 0 64 u, b>
+  dup isWorkchainDescr? not abort"invalid WorkchainDescr created"
+  <s swap @' workchain-dict 32 idict!+ 0= abort"cannot add workchain"
+  =: workchain-dict
+} : add-std-workchain
+// --
+{ @' workchain-dict dict>s s>c 12 config! } : config.workchains!
+
+dictnew constant special-dict
+// special-smc-addr --
+{ x{} swap @' special-dict 256 udict! not abort"cannot add a new special smart contract"
+  =: special-dict
+} : make_special
+{ @' special-dict dict>s s>c 31 config! } : config.special!
+
+// bit-pps cell-pps mc-bit-pps mc-cell-pps --
+{ <b x{cc} s, 0 32 u, 4 roll 64 u, 3 roll 64 u, rot 64 u, swap 64 u,
+  0 dictnew 32 b>udict! 0= abort"cannot create storage prices dictionary"
+  <b swap <s s, b> 18 config!
+} : config.storage_prices!
+{ 16 << } : sg*
+{ 16 <</r } : sg*/
+{ bl word (number) ?dup 0= abort"not a valid 2^16-based fraction" 
+  1- { sg*/ } { sg* } cond 
+  1 'nop
+} ::_ sg~
+
+// gas_price gas_limit spec_limit gas_credit block_gas_limit freeze_due_limit delete_due_limit -- c
+{ 7 0 reverse <b x{de} s, { swap 64 u, } 7 times b>
+} : make-gas-prices
+{ make-gas-prices 20 config! } : config.mc_gas_prices!
+{ make-gas-prices 21 config! } : config.gas_prices!
+
+// lump_price bit_price cell_price ihr_factor first_frac next_frac
+{ 6 0 reverse <b x{ea} s, swap 64 u, swap 64 u, swap 64 u, swap 32 u, swap 16 u, swap 16 u, b>
+} : make-msg-fwd-prices
+{ make-msg-fwd-prices 24 config! } : config.mc_fwd_prices!
+{ make-msg-fwd-prices 25 config! } : config.fwd_prices!
+
+// mc-cc-lifetime sh-cc-lifetime sh-val-lifetime sh-val-num
+{ 4 0 reverse <b x{c1} s, swap 32 u, swap 32 u, swap 32 u, swap 32 u, b> 
+} : make-catchain-params
+{ make-catchain-params 28 config! } : config.catchain_params!
+// round-candidates next-cand-delay-ms consensus-timeout-ms fast-attempts attempt-duration cc-max-deps max-block-size max-collated-size
+{ 8 0 reverse <b x{d6} s, { swap 32 u, } 8 times b> } : make-vsession-params
+{ make-vsession-params 29 config! } : config.consensus_params!
+
+// b [underload soft hard] -- b'
+{ untriple 3 roll x{c3} s, 3 roll 32 u, rot 32 u, swap 32 u, } : param_limits,
+// bytes-limits gas-limits lt-limits -- c
+{ <b x{5d} s, 3 roll param_limits, rot param_limits, swap param_limits, b>
+} : make-block-limits
+{ make-block-limits 22 config! } : config.mc_block_limits!
+{ make-block-limits 23 config! } : config.block_limits!
+
+// mc-block-create-fee bc-block-create-fee
+{ <b x{6b} s, rot Gram, swap Gram, b> } : make-block-create-fees
+{ make-block-create-fees 14 config! } : config.block_create_fees!
+
+{ <b swap 256 u, b> } : make-smc-addr-cell
+{ make-smc-addr-cell 0 config! } : config.config_smc!
+{ make-smc-addr-cell 1 config! } : config.elector_smc!
+{ make-smc-addr-cell 2 config! } : config.minter_smc!
+{ make-smc-addr-cell 3 config! } : config.collector_smc!
+
+{ <b swap dict, b> 7 config! } : config.to_mint!
+
+1000000000 constant Gram
+1000000 constant mGram
+1000 constant uGram
+1 constant nGram
+{ Gram * } : Gram*
+{ mGram * } : mGram*
+{ uGram * } : uGram*
+'nop : nGram*
+{ Gram swap */r } : Gram*/
+{ mGram swap */r } : mGram*/
+{ uGram swap */r } : uGram*/
+{ /r } : nGram*/
+
+// GR$.17 is equivalent to 170000000
+{ bl word (number) ?dup 0= abort"not a valid Gram amount" 
+  1- { Gram swap */r } { Gram * } cond 
+  1 'nop
+} ::_ GR$
+
+{ 10 << } : *Ki
+{ 20 << } : *Mi
+{ 30 << } : *Gi
+{ 10 <</r } : */Ki
+{ 20 <</r } : */Mi
+{ 30 <</r } : */Gi
+{ 1000 * } : *K
+{ 1000000 * } : *M
+{ 1000000000 * } : *G
+{ 1000 swap */r } : */K
+{ 1000000 swap */r } : */M
+{ 1000000000 swap */r } : */G
+
+0 constant recv_internal
+-1 constant recv_external
+-2 constant run_ticktock
+-3 constant split_prepare
+-4 constant split_install
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/config-code.fc b/submodules/ton/tonlib-src/crypto/smartcont/config-code.fc
new file mode 100644
index 0000000000..5e0508f537
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/config-code.fc
@@ -0,0 +1,149 @@
+;; Simple configuration smart contract
+
+() set_conf_param(int index, cell value) impure {
+  var cs = begin_parse(get_data());
+  var cfg_dict = cs~load_ref();
+  cfg_dict~idict_set_ref(32, index, value);
+  set_data(begin_cell().store_ref(cfg_dict).store_slice(cs).end_cell());
+}
+
+(int, int) check_validator_set(cell vset) {
+  var cs = vset.begin_parse();
+  throw_unless(9, cs~load_uint(8) == 0x11);  ;; validators#11
+  int utime_since = cs~load_uint(32);
+  int utime_until = cs~load_uint(32);
+  int total = cs~load_uint(16);
+  int main = cs~load_uint(16);
+  throw_unless(9, main > 0);
+  throw_unless(9, total >= main);
+  return (utime_since, utime_until);
+}
+
+() send_answer(addr, query_id, ans_tag, mode) impure {
+  ;; int_msg_info$0 ihr_disabled:Bool bounce:Bool bounced:Bool src:MsgAddress -> 011000
+  send_raw_message(begin_cell().store_uint(0x18, 6).store_slice(addr).store_uint(0, 5 + 4 + 4 + 64 + 32 + 1 + 1).store_uint(ans_tag, 32).store_uint(query_id, 64).end_cell(), mode);
+}
+
+() send_confirmation(addr, query_id, ans_tag) impure {
+  return send_answer(addr, query_id, ans_tag, 64);
+}
+
+() send_error(addr, query_id, ans_tag) impure {
+  return send_answer(addr, query_id, ans_tag, 64);
+}
+
+() recv_internal(cell in_msg_cell, slice in_msg) impure {
+  var cs = in_msg_cell.begin_parse();
+  var flags = cs~load_uint(4);  ;; int_msg_info$0 ihr_disabled:Bool bounce:Bool bounced:Bool
+  var s_addr = cs~load_msg_addr();
+  (int src_wc, int src_addr) = s_addr.parse_std_addr();
+  if ((src_wc + 1) | (flags & 1) | in_msg.slice_empty?()) {
+    ;; source not in masterchain, or a bounced message, or a simple transfer
+    return ();
+  }
+  int tag = in_msg~load_uint(32);
+  int query_id = in_msg~load_uint(64);
+  if (tag == 0x4e565354) {
+    ;; set next validator set
+    var vset = in_msg~load_ref();
+    in_msg.end_parse();
+    var elector_param = config_param(1);
+    var elector_addr = cell_null?(elector_param) ? -1 : elector_param.begin_parse().preload_uint(256);
+    var ok = false;
+    if (src_addr == elector_addr) {
+      ;; message from elector smart contract
+      ;; set next validator set
+      (var t_since, var t_until) = check_validator_set(vset);
+      var t = now();
+      ok = (t_since > t) & (t_until > t_since);
+    }
+    if (ok) {
+      set_conf_param(36, vset);
+      ;; send confirmation
+      return send_confirmation(s_addr, query_id, 0xee764f4b);
+    } else {
+      return send_error(s_addr, query_id, 0xee764f6f);
+    }
+  }
+  ;; if tag is non-zero and its higher bit is zero, throw an exception (the message is an unsupported query)
+  ;; to bounce message back to sender
+  throw_unless(37, (tag == 0) | (tag & (1 << 31)));
+  ;; do nothing for other internal messages
+}
+
+;; forward a message to elector smart contract to make it upgrade its code
+() change_elector_code(slice cs) impure {
+  var dest_addr = config_param(1).begin_parse().preload_uint(256);
+  var query_id = now();
+  send_raw_message(begin_cell()
+   .store_uint(0xc4ff, 17)
+   .store_uint(dest_addr, 256)
+   .store_grams(1 << 30)         ;; ~ 1 Gram (will be returned back)
+   .store_uint(0, 1 + 4 + 4 + 64 + 32 + 1 + 1)
+   .store_uint(0x4e436f64, 32)   ;; action
+   .store_uint(query_id, 64)
+   .store_slice(cs)
+  .end_cell(), 0);
+}
+
+() recv_external(slice in_msg) impure {
+  var signature = in_msg~load_bits(512);
+  var cs = in_msg;
+  int action = cs~load_uint(32);
+  int msg_seqno = cs~load_uint(32);
+  var valid_until = cs~load_uint(32);
+  throw_if(35, valid_until < now());
+  var cs2 = begin_parse(get_data());
+  var cfg_dict = cs2~load_ref();
+  var stored_seqno = cs2~load_uint(32);
+  var public_key = cs2~load_uint(256);
+  cs2.end_parse();
+  throw_unless(33, msg_seqno == stored_seqno);
+  throw_unless(34, check_signature(slice_hash(in_msg), signature, public_key));
+  accept_message();
+  if (action == 0x43665021) {
+    ;; change one configuration parameter
+    var param_index = cs~load_uint(32);
+    var param_value = cs~load_ref();
+    cs.end_parse();
+    cfg_dict~idict_set_ref(32, param_index, param_value);
+  } elseif (action == 0x4e436f64) {
+    ;; change configuration smart contract code
+    var new_code = cs~load_ref();
+    cs.end_parse();
+    set_code(new_code);
+  } elseif (action == 0x50624b21) {
+    ;; change configuration master public key
+    public_key = cs~load_uint(256);
+    cs.end_parse();
+  } elseif (action == 0x4e43ef05) {
+    ;; change election smart contract code
+    change_elector_code(cs);
+  } else {
+    throw_if(32, action);
+  }
+  set_data(begin_cell().store_ref(cfg_dict).store_uint(stored_seqno + 1, 32).store_uint(public_key, 256).end_cell());
+}
+
+() run_ticktock(int is_tock) impure {
+  var cs = begin_parse(get_data());
+  var cfg_dict = cs~load_ref();
+  int kl = 32;
+  ;; cfg_dict~idict_set_ref(kl, -17, begin_cell().store_uint(now() >> 16, 32).end_cell());
+  var next_vset = cfg_dict.idict_get_ref(kl, 36);
+  ifnot (next_vset.null?()) {
+    ;; check whether we have to set next_vset as the current validator set
+    var ds = next_vset.begin_parse();
+    if (ds.slice_bits() >= 40) {
+      var tag = ds~load_uint(8);
+      var since = ds.preload_uint(32);
+      if ((tag == 0x11) & (since >= now())) {
+        ;; next validator set becomes active!
+        var cur_vset = cfg_dict~idict_set_get_ref(kl, 34, next_vset);  ;; next_vset -> cur_vset
+        cfg_dict~idict_set_get_ref(kl, 32, cur_vset);   ;; cur_vset -> prev_vset
+        cfg_dict~idict_delete?(kl, 36);             ;; (null) -> next_vset
+      }
+    }
+  }
+  set_data(begin_cell().store_ref(cfg_dict).store_slice(cs).end_cell());
+}
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/config-code.fif b/submodules/ton/tonlib-src/crypto/smartcont/config-code.fif
new file mode 100644
index 0000000000..1a4084fafe
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/config-code.fif
@@ -0,0 +1,323 @@
+// automatically generated from `smartcont/stdlib.fc` `smartcont/config-code.fc` 
+PROGRAM{
+  DECLPROC set_conf_param
+  DECLPROC check_validator_set
+  DECLPROC send_answer
+  DECLPROC send_confirmation
+  DECLPROC send_error
+  DECLPROC recv_internal
+  DECLPROC change_elector_code
+  DECLPROC recv_external
+  DECLPROC run_ticktock
+  set_conf_param PROC:<{
+    //  index value
+    c4 PUSH	//  index value _3
+    CTOS	//  index value cs
+    LDREF	//  index value cfg_dict cs
+    s3 s3 XCHG2
+    32 PUSHINT	//  cs value index cfg_dict _9=32
+    DICTISETREF	//  cs cfg_dict
+    NEWC	//  cs cfg_dict _11
+    STREF	//  cs _12
+    SWAP	//  _12 cs
+    STSLICER	//  _13
+    ENDC	//  _14
+    c4 POP
+  }>
+  check_validator_set PROC:<{
+    //  vset
+    CTOS	//  cs
+    8 LDU	//  _4 cs
+    SWAP	//  cs _4
+    17 EQINT	//  cs _8
+    9 THROWIFNOT
+    32 LDU	//  utime_since cs
+    32 LDU	//  utime_since utime_until cs
+    16 LDU	//  utime_since utime_until total cs
+    16 LDU	//  utime_since utime_until total _42 _41
+    DROP	//  utime_since utime_until total main
+    DUP	//  utime_since utime_until total main main
+    0 GTINT	//  utime_since utime_until total main _28
+    9 THROWIFNOT
+    GEQ	//  utime_since utime_until _31
+    9 THROWIFNOT
+  }>
+  send_answer PROC:<{
+    //  addr query_id ans_tag mode
+    0 PUSHINT	//  addr query_id ans_tag mode _4=0
+    24 PUSHINT	//  addr query_id ans_tag mode _4=0 _5=24
+    NEWC	//  addr query_id ans_tag mode _4=0 _5=24 _6
+    6 STU	//  addr query_id ans_tag mode _4=0 _8
+    s0 s5 XCHG2	//  _4=0 query_id ans_tag mode _8 addr
+    STSLICER	//  _4=0 query_id ans_tag mode _9
+    s1 s4 XCHG	//  mode query_id ans_tag _4=0 _9
+    111 STU	//  mode query_id ans_tag _23
+    32 STU	//  mode query_id _25
+    64 STU	//  mode _27
+    ENDC	//  mode _28
+    SWAP	//  _28 mode
+    SENDRAWMSG
+  }>
+  send_confirmation PROC:<{
+    //  addr query_id ans_tag
+    64 PUSHINT	//  addr query_id ans_tag _3=64
+    send_answer CALLDICT
+  }>
+  send_error PROC:<{
+    //  addr query_id ans_tag
+    64 PUSHINT	//  addr query_id ans_tag _3=64
+    send_answer CALLDICT
+  }>
+  recv_internal PROC:<{
+    //  in_msg_cell in_msg
+    SWAP	//  in_msg in_msg_cell
+    CTOS	//  in_msg cs
+    4 LDU	//  in_msg flags cs
+    LDMSGADDR	//  in_msg flags _74 _73
+    DROP	//  in_msg flags s_addr
+    DUP	//  in_msg flags s_addr s_addr
+    REWRITESTDADDR	//  in_msg flags s_addr src_wc src_addr
+    SWAP	//  in_msg flags s_addr src_addr src_wc
+    INC	//  in_msg flags s_addr src_addr _15
+    s0 s3 XCHG
+    1 PUSHINT	//  in_msg _15 s_addr src_addr flags _16=1
+    AND	//  in_msg _15 s_addr src_addr _17
+    s1 s3 XCHG	//  in_msg src_addr s_addr _15 _17
+    OR	//  in_msg src_addr s_addr _18
+    s3 PUSH	//  in_msg src_addr s_addr _18 in_msg
+    SEMPTY	//  in_msg src_addr s_addr _18 _19
+    OR	//  in_msg src_addr s_addr _20
+    IFJMP:<{	//  in_msg src_addr s_addr
+      3 BLKDROP	// 
+    }>	//  in_msg src_addr s_addr
+    s0 s2 XCHG	//  s_addr src_addr in_msg
+    32 LDU	//  s_addr src_addr tag in_msg
+    64 LDU	//  s_addr src_addr tag query_id in_msg
+    s2 PUSH
+    1314280276 PUSHINT	//  s_addr src_addr tag query_id in_msg tag _29=1314280276
+    EQUAL	//  s_addr src_addr tag query_id in_msg _30
+    IFJMP:<{	//  s_addr src_addr tag query_id in_msg
+      s2 POP	//  s_addr src_addr in_msg query_id
+      SWAP	//  s_addr src_addr query_id in_msg
+      LDREF	//  s_addr src_addr query_id vset in_msg
+      ENDS
+      1 PUSHINT	//  s_addr src_addr query_id vset _36=1
+      CONFIGOPTPARAM	//  s_addr src_addr query_id vset elector_param
+      DUP	//  s_addr src_addr query_id vset elector_param elector_param
+      ISNULL	//  s_addr src_addr query_id vset elector_param _39
+      IF:<{	//  s_addr src_addr query_id vset elector_param
+        DROP	//  s_addr src_addr query_id vset
+        -1 PUSHINT	//  s_addr src_addr query_id vset _40=-1
+      }>ELSE<{	//  s_addr src_addr query_id vset elector_param
+        CTOS	//  s_addr src_addr query_id vset _42
+        256 PLDU	//  s_addr src_addr query_id vset _40
+      }>	//  s_addr src_addr query_id vset elector_addr
+      s0 s3 XCHG
+      FALSE
+      s0 s4 XCHG	//  s_addr ok query_id vset src_addr elector_addr
+      EQUAL	//  s_addr ok query_id vset _47
+      IF:<{	//  s_addr ok query_id vset
+        s2 POP	//  s_addr vset query_id
+        OVER	//  s_addr vset query_id vset
+        check_validator_set CALLDICT	//  s_addr vset query_id t_since t_until
+        OVER
+        NOW	//  s_addr vset query_id t_since t_until t_since t
+        GREATER	//  s_addr vset query_id t_since t_until _53
+        s0 s2 XCHG	//  s_addr vset query_id _53 t_until t_since
+        GREATER	//  s_addr vset query_id _53 _54
+        AND	//  s_addr vset query_id ok
+      }>ELSE<{
+        s0 s2 XCHG	//  s_addr vset query_id ok
+      }>
+      IFJMP:<{	//  s_addr vset query_id
+        36 PUSHINT	//  s_addr vset query_id _56=36
+        ROT	//  s_addr query_id _56=36 vset
+        set_conf_param CALLDICT
+        4000730955 PUSHINT	//  s_addr query_id _58=4000730955
+        send_confirmation CALLDICT
+      }>	//  s_addr vset query_id
+      NIP	//  s_addr query_id
+      4000730991 PUSHINT	//  s_addr query_id _60=4000730991
+      send_error CALLDICT
+    }>	//  s_addr src_addr tag query_id in_msg
+    s2 s4 XCHG
+    4 BLKDROP	//  tag
+    DUP	//  tag tag
+    0 EQINT	//  tag _64
+    SWAP
+    31 PUSHPOW2	//  _64 tag _67
+    AND	//  _64 _68
+    OR	//  _69
+    37 THROWIFNOT
+  }>
+  change_elector_code PROC:<{
+    //  cs
+    1 PUSHINT	//  cs _2=1
+    CONFIGOPTPARAM	//  cs _3
+    CTOS	//  cs _4
+    256 PLDU	//  cs dest_addr
+    NOW	//  cs dest_addr query_id
+    1313042276 PUSHINT	//  cs dest_addr query_id _9=1313042276
+    0 PUSHINT	//  cs dest_addr query_id _9=1313042276 _10=0
+    50431 PUSHINT	//  cs dest_addr query_id _9=1313042276 _10=0 _11=50431
+    NEWC	//  cs dest_addr query_id _9=1313042276 _10=0 _11=50431 _12
+    17 STU	//  cs dest_addr query_id _9=1313042276 _10=0 _14
+    s1 s4 XCHG	//  cs _10=0 query_id _9=1313042276 dest_addr _14
+    256 STU	//  cs _10=0 query_id _9=1313042276 _16
+    30 PUSHPOW2	//  cs _10=0 query_id _9=1313042276 _16 _19
+    STGRAMS	//  cs _10=0 query_id _9=1313042276 _20
+    s1 s3 XCHG	//  cs _9=1313042276 query_id _10=0 _20
+    107 STU	//  cs _9=1313042276 query_id _34
+    s1 s2 XCHG	//  cs query_id _9=1313042276 _34
+    32 STU	//  cs query_id _36
+    64 STU	//  cs _38
+    SWAP	//  _38 cs
+    STSLICER	//  _39
+    ENDC	//  _40
+    0 PUSHINT	//  _40 _41=0
+    SENDRAWMSG
+  }>
+  recv_external PROC:<{
+    //  in_msg
+    9 PUSHPOW2	//  in_msg _3=512
+    LDSLICEX	//  signature in_msg
+    DUP	//  signature in_msg cs
+    32 LDU	//  signature in_msg action cs
+    32 LDU	//  signature in_msg action msg_seqno cs
+    32 LDU	//  signature in_msg action msg_seqno valid_until cs
+    NOW	//  signature in_msg action msg_seqno valid_until cs _19
+    s1 s2 XCHG	//  signature in_msg action msg_seqno cs valid_until _19
+    LESS	//  signature in_msg action msg_seqno cs _20
+    35 THROWIF
+    c4 PUSH	//  signature in_msg action msg_seqno cs _23
+    CTOS	//  signature in_msg action msg_seqno cs cs2
+    LDREF	//  signature in_msg action msg_seqno cs cfg_dict cs2
+    32 LDU	//  signature in_msg action msg_seqno cs cfg_dict stored_seqno cs2
+    256 LDU	//  signature in_msg action msg_seqno cs cfg_dict stored_seqno public_key cs2
+    ENDS
+    s4 s1 XCPU	//  signature in_msg action public_key cs cfg_dict stored_seqno msg_seqno stored_seqno
+    EQUAL	//  signature in_msg action public_key cs cfg_dict stored_seqno _38
+    33 THROWIFNOT
+    s0 s5 XCHG	//  signature stored_seqno action public_key cs cfg_dict in_msg
+    HASHSU	//  signature stored_seqno action public_key cs cfg_dict _41
+    s0 s6 s3 XC2PU	//  cfg_dict stored_seqno action public_key cs _41 signature public_key
+    CHKSIGNU	//  cfg_dict stored_seqno action public_key cs _42
+    34 THROWIFNOT
+    ACCEPT
+    s2 PUSH
+    1130778657 PUSHINT	//  cfg_dict stored_seqno action public_key cs action _45=1130778657
+    EQUAL	//  cfg_dict stored_seqno action public_key cs _46
+    IF:<{	//  cfg_dict stored_seqno action public_key cs
+      s2 POP	//  cfg_dict stored_seqno cs public_key
+      SWAP	//  cfg_dict stored_seqno public_key cs
+      32 LDU	//  cfg_dict stored_seqno public_key param_index cs
+      LDREF	//  cfg_dict stored_seqno public_key param_index param_value cs
+      ENDS
+      s0 s1 s4 XCHG3
+      32 PUSHINT	//  public_key stored_seqno param_value param_index cfg_dict _56=32
+      DICTISETREF	//  public_key stored_seqno cfg_dict
+    }>ELSE<{	//  cfg_dict stored_seqno action public_key cs
+      s2 PUSH
+      1313042276 PUSHINT	//  cfg_dict stored_seqno action public_key cs action _58=1313042276
+      EQUAL	//  cfg_dict stored_seqno action public_key cs _59
+      IF:<{	//  cfg_dict stored_seqno action public_key cs
+        s2 POP	//  cfg_dict stored_seqno cs public_key
+        SWAP	//  cfg_dict stored_seqno public_key cs
+        LDREF	//  cfg_dict stored_seqno public_key new_code cs
+        ENDS
+        SETCODE
+      }>ELSE<{	//  cfg_dict stored_seqno action public_key cs
+        s2 PUSH
+        1348619041 PUSHINT	//  cfg_dict stored_seqno action public_key cs action _65=1348619041
+        EQUAL	//  cfg_dict stored_seqno action public_key cs _66
+        IF:<{	//  cfg_dict stored_seqno action public_key cs
+          NIP
+          NIP	//  cfg_dict stored_seqno cs
+          256 LDU	//  cfg_dict stored_seqno public_key cs
+          ENDS
+        }>ELSE<{	//  cfg_dict stored_seqno action public_key cs
+          s2 PUSH
+          1313074949 PUSHINT	//  cfg_dict stored_seqno action public_key cs action _71=1313074949
+          EQUAL	//  cfg_dict stored_seqno action public_key cs _72
+          IF:<{	//  cfg_dict stored_seqno action public_key cs
+            s2 POP	//  cfg_dict stored_seqno cs public_key
+            SWAP	//  cfg_dict stored_seqno public_key cs
+            change_elector_code CALLDICT
+          }>ELSE<{	//  cfg_dict stored_seqno action public_key cs
+            DROP	//  cfg_dict stored_seqno action public_key
+            SWAP	//  cfg_dict stored_seqno public_key action
+            32 THROWIF
+          }>
+        }>
+      }>
+      s0 s2 XCHG	//  public_key stored_seqno cfg_dict
+    }>
+    SWAP	//  public_key cfg_dict stored_seqno
+    INC	//  public_key cfg_dict _77
+    NEWC	//  public_key cfg_dict _77 _78
+    s1 s2 XCHG	//  public_key _77 cfg_dict _78
+    STREF	//  public_key _77 _79
+    32 STU	//  public_key _81
+    256 STU	//  _83
+    ENDC	//  _84
+    c4 POP
+  }>
+  run_ticktock PROC:<{
+    //  is_tock
+    DROP	// 
+    c4 PUSH	//  _2
+    CTOS	//  cs
+    LDREF	//  cfg_dict cs
+    32 PUSHINT	//  cfg_dict cs kl=32
+    36 PUSHINT	//  cfg_dict cs kl=32 _10=36
+    s3 s1 PUSH2	//  cfg_dict cs kl=32 _10=36 cfg_dict kl=32
+    DICTIGETOPTREF	//  cfg_dict cs kl=32 next_vset
+    DUP	//  cfg_dict cs kl=32 next_vset next_vset
+    ISNULL	//  cfg_dict cs kl=32 next_vset _12
+    IFNOT:<{	//  cfg_dict cs kl=32 next_vset
+      DUP	//  cfg_dict cs kl=32 next_vset next_vset
+      CTOS	//  cfg_dict cs kl=32 next_vset ds
+      DUP	//  cfg_dict cs kl=32 next_vset ds ds
+      SBITS	//  cfg_dict cs kl=32 next_vset ds _15
+      39 GTINT	//  cfg_dict cs kl=32 next_vset ds _17
+      IF:<{	//  cfg_dict cs kl=32 next_vset ds
+        8 LDU	//  cfg_dict cs kl=32 next_vset tag ds
+        32 PLDU	//  cfg_dict cs kl=32 next_vset tag since
+        SWAP	//  cfg_dict cs kl=32 next_vset since tag
+        17 EQINT	//  cfg_dict cs kl=32 next_vset since _26
+        NOW	//  cfg_dict cs kl=32 next_vset since _26 _27
+        s1 s2 XCHG	//  cfg_dict cs kl=32 next_vset _26 since _27
+        GEQ	//  cfg_dict cs kl=32 next_vset _26 _28
+        AND	//  cfg_dict cs kl=32 next_vset _29
+        IF:<{	//  cfg_dict cs kl=32 next_vset
+          SWAP
+          34 PUSHINT
+          s0 s4 s4 XC2PU	//  kl=32 cs next_vset _32=34 cfg_dict kl=32
+          DICTISETGETOPTREF	//  kl=32 cs cfg_dict cur_vset
+          s3 s1 s0 PUXCPU	//  kl=32 cs cur_vset _35=32 cfg_dict kl=32
+          DICTISETGETOPTREF	//  kl=32 cs _51 _52
+          DROP	//  kl=32 cs cfg_dict
+          36 PUSHINT	//  kl=32 cs cfg_dict _38=36
+          s0 s1 s3 XCHG3	//  cs _38=36 cfg_dict kl=32
+          DICTIDEL	//  cs _53 _54
+          DROP	//  cs cfg_dict
+        }>ELSE<{
+          s2 s3 XCHG
+          2DROP	//  cs cfg_dict
+        }>
+      }>ELSE<{
+        s3 s4 XCHG
+        3 BLKDROP	//  cs cfg_dict
+      }>
+    }>ELSE<{
+      s2 s3 XCHG
+      2DROP	//  cs cfg_dict
+    }>
+    NEWC	//  cs cfg_dict _40
+    STREF	//  cs _41
+    SWAP	//  _41 cs
+    STSLICER	//  _42
+    ENDC	//  _43
+    c4 POP
+  }>
+}END>c
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/elector-code.fc b/submodules/ton/tonlib-src/crypto/smartcont/elector-code.fc
new file mode 100644
index 0000000000..b97b0b3ce4
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/elector-code.fc
@@ -0,0 +1,798 @@
+;; Elector smartcontract
+
+;; cur_elect credits past_elect grams active_id active_hash
+(cell, cell, cell, int, int, int) load_data() {
+  var cs = get_data().begin_parse();
+  var res = (cs~load_dict(), cs~load_dict(), cs~load_dict(), cs~load_grams(), cs~load_uint(32), cs~load_uint(256));
+  cs.end_parse();
+  return res;
+}
+
+;; cur_elect credits past_elect grams active_id active_hash
+() store_data(elect, credits, past_elect, grams, active_id, active_hash) impure {
+  set_data(begin_cell()
+    .store_dict(elect)
+    .store_dict(credits)
+    .store_dict(past_elect)
+    .store_grams(grams)
+    .store_uint(active_id, 32)
+    .store_uint(active_hash, 256)
+  .end_cell());
+}
+
+;; elect -> elect_at elect_close min_stake total_stake members failed finished
+_ unpack_elect(elect) {
+  var es = elect.begin_parse();
+  var res = (es~load_uint(32), es~load_uint(32), es~load_grams(), es~load_grams(), es~load_dict(), es~load_int(1), es~load_int(1));
+  es.end_parse();
+  return res;
+}
+
+cell pack_elect(elect_at, elect_close, min_stake, total_stake, members, failed, finished) {
+  return begin_cell()
+    .store_uint(elect_at, 32)
+    .store_uint(elect_close, 32)
+    .store_grams(min_stake)
+    .store_grams(total_stake)
+    .store_dict(members)
+    .store_int(failed, 1)
+    .store_int(finished, 1)
+  .end_cell();
+}
+
+;; elected_for elections_begin_before elections_end_before stake_held_for
+(int, int, int, int) get_validator_conf() {
+  var cs = config_param(15).begin_parse();
+  return (cs~load_int(32), cs~load_int(32), cs~load_int(32), cs.preload_int(32));
+}
+
+() send_message_back(addr, ans_tag, query_id, body, grams, mode) impure {
+  ;; int_msg_info$0 ihr_disabled:Bool bounce:Bool bounced:Bool src:MsgAddress -> 011000
+  var msg = begin_cell()
+    .store_uint(0x18, 6)
+    .store_slice(addr)
+    .store_grams(grams)
+    .store_uint(0, 1 + 4 + 4 + 64 + 32 + 1 + 1)
+    .store_uint(ans_tag, 32)
+    .store_uint(query_id, 64);
+  if (body >= 0) {
+    msg~store_uint(body, 32);
+  }
+  send_raw_message(msg.end_cell(), mode);
+}
+
+() return_stake(addr, query_id, reason) impure {
+  return send_message_back(addr, 0xee6f454c, query_id, reason, 0, 64);
+}
+
+() send_confirmation(addr, query_id, comment) impure {
+  return send_message_back(addr, 0xf374484c, query_id, comment, 1000000000, 2);
+}
+
+() send_validator_set_to_config(config_addr, vset, query_id) impure {
+  var msg = begin_cell()
+    .store_uint(0xc4ff, 17)   ;; 0 11000100 0xff 
+    .store_uint(config_addr, 256)
+    .store_grams(1 << 30)     ;; ~1 gram of value to process and obtain answer
+    .store_uint(0, 1 + 4 + 4 + 64 + 32 + 1 + 1)
+    .store_uint(0x4e565354, 32)
+    .store_uint(query_id, 64)
+    .store_ref(vset);
+  send_raw_message(msg.end_cell(), 1);
+}
+
+;; credits 'amount' to 'addr' inside credit dictionary 'credits'
+_ ~credit_to(credits, addr, amount) {
+  var (val, f) = credits.udict_get?(256, addr);
+  if (f) {
+    amount += val~load_grams();
+  }
+  credits~udict_set_builder(256, addr, begin_cell().store_grams(amount));
+  return (credits, ());
+}
+
+() process_new_stake(s_addr, msg_value, cs, query_id) impure {
+  var (src_wc, src_addr) = parse_std_addr(s_addr);
+  var ds = get_data().begin_parse();
+  var elect = ds~load_dict();
+  if (null?(elect) | (src_wc + 1)) {
+    ;; no elections active, or source is not in masterchain
+    ;; bounce message
+    return return_stake(s_addr, query_id, 0);
+  }
+  ;; parse the remainder of new stake message
+  var validator_pubkey = cs~load_uint(256);
+  var stake_at = cs~load_uint(32);
+  var max_factor = cs~load_uint(32);
+  var adnl_addr = cs~load_uint(256);
+  var signature = cs~load_ref().begin_parse().preload_bits(512);
+  cs.end_parse();
+  ifnot (check_data_signature(begin_cell()
+      .store_uint(0x654c5074, 32)
+      .store_uint(stake_at, 32)
+      .store_uint(max_factor, 32)
+      .store_uint(src_addr, 256)
+      .store_uint(adnl_addr, 256)
+    .end_cell().begin_parse(), signature, validator_pubkey)) {
+    ;; incorrect signature, return stake
+    return return_stake(s_addr, query_id, 1);
+  }
+  if (max_factor < 0x10000) {
+    ;; factor must be >= 1. = 65536/65536
+    return return_stake(s_addr, query_id, 6);
+  }
+  ;; parse current election data
+  var (elect_at, elect_close, min_stake, total_stake, members, failed, finished) = elect.unpack_elect();
+  elect_at~dump();
+  msg_value -= 1000000000;   ;; deduct GR$1 for sending confirmation
+  if ((msg_value << 12) < total_stake) {
+    ;; stake smaller than 1/4096 of the total accumulated stakes, return
+    return return_stake(s_addr, query_id, 2);
+  }
+  total_stake += msg_value;  ;; (provisionally) increase total stake
+  if (stake_at != elect_at) {
+    ;; stake for some other elections, return
+    return return_stake(s_addr, query_id, 3);
+  }
+  if (finished) {
+    ;; elections already finished, return stake
+    return return_stake(s_addr, query_id, 0);
+  }
+  var (mem, found) = members.udict_get?(256, validator_pubkey);
+  if (found) {
+    ;; entry found, merge stakes
+    msg_value += mem~load_grams();
+    mem~load_uint(64);   ;; skip timestamp and max_factor
+    found = (src_addr != mem~load_uint(256));
+  }
+  if (found) {
+    ;; can make stakes for a public key from one address only
+    return return_stake(s_addr, query_id, 4);
+  }
+  if (msg_value < min_stake) {
+    ;; stake too small, return it
+    return return_stake(s_addr, query_id, 5);
+  }
+  throw_unless(44, msg_value);
+  accept_message();
+  ;; store stake in the dictionary
+  members~udict_set_builder(256, validator_pubkey, begin_cell()
+    .store_grams(msg_value)
+    .store_uint(now(), 32)
+    .store_uint(max_factor, 32)
+    .store_uint(src_addr, 256)
+    .store_uint(adnl_addr, 256));
+  ;; gather and save election data
+  elect = pack_elect(elect_at, elect_close, min_stake, total_stake, members, false, false);
+  set_data(begin_cell().store_dict(elect).store_slice(ds).end_cell());
+  ;; return confirmation message
+  if (query_id) {
+    return send_confirmation(s_addr, query_id, 0);
+  }
+  return ();
+}
+
+(cell, int) unfreeze_without_bonuses(credits, freeze_dict, tot_stakes) {
+  var total = var recovered = 0;
+  var pubkey = -1;
+  do {
+    (pubkey, var cs, var f) = freeze_dict.udict_get_next?(256, pubkey);
+    if (f) {
+      var (addr, weight, stake, banned) = (cs~load_uint(256), cs~load_uint(64), cs~load_grams(), cs~load_int(1));
+      cs.end_parse();
+      if (banned) {
+        recovered += stake;
+      } else {
+        credits~credit_to(addr, stake);
+      }
+      total += stake;
+    }
+  } until (~ f);
+  throw_unless(59, total == tot_stakes);
+  return (credits, recovered);
+}
+
+(cell, int) unfreeze_with_bonuses(credits, freeze_dict, tot_stakes, tot_bonuses) {
+  var total = var recovered = var returned_bonuses = 0;
+  var pubkey = -1;
+  do {
+    (pubkey, var cs, var f) = freeze_dict.udict_get_next?(256, pubkey);
+    if (f) {
+      var (addr, weight, stake, banned) = (cs~load_uint(256), cs~load_uint(64), cs~load_grams(), cs~load_int(1));
+      cs.end_parse();
+      if (banned) {
+        recovered += stake;
+      } else {
+        var bonus = muldiv(tot_bonuses, stake, tot_stakes);
+        returned_bonuses += bonus;
+        credits~credit_to(addr, stake + bonus);
+      }
+      total += stake;
+    }
+  } until (~ f);
+  throw_unless(59, (total == tot_stakes) & (returned_bonuses <= tot_bonuses));
+  return (credits, recovered + tot_bonuses - returned_bonuses);
+}
+
+_ unfreeze_all(credits, past_elections, elect_id) {
+  var (fs, f) = past_elections~udict_delete_get?(32, elect_id);
+  ifnot (f) {
+    ;; no elections with this id
+    return (credits, past_elections, 0);
+  }
+  var (data1, vset_hash, fdict, tot_stakes, bonuses, complaints) = (fs~load_uint(64), fs~load_uint(256), fs~load_dict(), fs~load_grams(), fs~load_grams(), fs~load_dict());
+  fs.end_parse();
+  var unused_prizes = (bonuses > 0) ?
+    credits~unfreeze_with_bonuses(fdict, tot_stakes, bonuses) :
+    credits~unfreeze_without_bonuses(fdict, tot_stakes);
+  return (credits, past_elections, unused_prizes);
+}
+
+() config_set_confirmed(s_addr, cs, query_id, ok) impure {
+  var (src_wc, src_addr) = parse_std_addr(s_addr);
+  var config_addr = config_param(0).begin_parse().preload_uint(256);
+  var ds = get_data().begin_parse();
+  var elect = ds~load_dict();
+  if ((src_wc + 1) | (src_addr != config_addr) | elect.null?()) {
+    ;; not from config smc, somebody's joke?
+    ;; or no elections active (or just completed)
+    return ();
+  }
+  var (elect_at, elect_close, min_stake, total_stake, members, failed, finished) = elect.unpack_elect();
+  if ((elect_at != query_id) | ~ finished) {
+    ;; not these elections, or elections not finished yet
+    return ();
+  }
+  accept_message();
+  ifnot (ok) {
+    ;; cancel elections, return stakes
+    var (credits, past_elections, grams) = (ds~load_dict(), ds~load_dict(), ds~load_grams());
+    (credits, past_elections, var unused_prizes) = unfreeze_all(credits, past_elections, elect_at);
+    set_data(begin_cell()
+      .store_int(false, 1)
+      .store_dict(credits)
+      .store_dict(past_elections)
+      .store_grams(grams + unused_prizes)
+      .store_slice(ds)
+    .end_cell());
+  }
+  ;; ... do not remove elect until we see this set as the next elected validator set
+}
+
+() process_simple_transfer(s_addr, msg_value) impure {
+  var (elect, credits, past_elect, grams, active_id, active_hash) = load_data();
+  (int src_wc, int src_addr) = parse_std_addr(s_addr);
+  if (src_addr | (src_wc + 1) | (active_id == 0)) {
+    ;; simple transfer to us (credit "nobody's" account)
+    ;; (or no known active validator set)
+    grams += msg_value;
+    return store_data(elect, credits, past_elect, grams, active_id, active_hash);
+  }
+  ;; zero source address -1:00..00 (collecting validator fees)
+  var (fs, f) = past_elect.udict_get?(32, active_id);
+  ifnot (f) {
+    ;; active validator set not found (?)
+    grams += msg_value;
+  } else {
+    ;; credit active validator set bonuses
+    var (data, hash, dict, total_stake, bonuses) = (fs~load_uint(64), fs~load_uint(256), fs~load_dict(), fs~load_grams(), fs~load_grams());
+    bonuses += msg_value;
+    past_elect~udict_set_builder(32, active_id, begin_cell()
+      .store_uint(data, 64)
+      .store_uint(hash, 256)
+      .store_dict(dict)
+      .store_grams(total_stake)
+      .store_grams(bonuses)
+      .store_slice(fs));
+  }
+  store_data(elect, credits, past_elect, grams, active_id, active_hash);
+  return ();
+}
+
+() recover_stake(op, s_addr, cs, query_id) impure {
+  (int src_wc, int src_addr) = parse_std_addr(s_addr);
+  if (src_wc + 1) {
+    ;; not from masterchain, return error
+    return send_message_back(s_addr, 0xfffffffe, query_id, op, 0, 64);
+  }
+  var ds = get_data().begin_parse();
+  var (elect, credits) = (ds~load_dict(), ds~load_dict());
+  var (cs, f) = credits~udict_delete_get?(256, src_addr);
+  ifnot (f) {
+    ;; no credit for sender, return error
+    return send_message_back(s_addr, 0xfffffffe, query_id, op, 0, 64);
+  }
+  var amount = cs~load_grams();
+  cs.end_parse();
+  ;; save data
+  set_data(begin_cell().store_dict(elect).store_dict(credits).store_slice(ds).end_cell());
+  ;; send amount to sender in a new message
+  send_raw_message(begin_cell()
+    .store_uint(0x18, 6)
+    .store_slice(s_addr)
+    .store_grams(amount)
+    .store_uint(0, 1 + 4 + 4 + 64 + 32 + 1 + 1)
+    .store_uint(0xf96f7324, 32)
+    .store_uint(query_id, 64)
+  .end_cell(), 64);
+}
+
+() after_code_upgrade(slice s_addr, slice cs, int query_id) impure method_id(1666) {
+  var op = 0x4e436f64;
+  return send_message_back(s_addr, 0xce436f64, query_id, op, 0, 64);
+}
+
+int upgrade_code(s_addr, cs, query_id) {
+  var c_addr = config_param(0);
+  if (c_addr.null?()) {
+    ;; no configuration smart contract known
+    return false;
+  }
+  var config_addr = c_addr.begin_parse().preload_uint(256);
+  var (src_wc, src_addr) = parse_std_addr(s_addr);
+  if ((src_wc + 1) | (src_addr != config_addr)) {
+    ;; not from configuration smart contract, return error
+    return false;
+  }
+  accept_message();
+  var code = cs~load_ref();
+  set_code(code);
+  ifnot(cs.slice_empty?()) {
+    set_c3(code);
+    ;; run_method3(1666, s_addr, cs, query_id);
+    after_code_upgrade(s_addr, cs, query_id);
+    throw(0);
+  }
+  return true;
+}
+
+() recv_internal(int msg_value, cell in_msg_cell, slice in_msg) impure {
+  ;; do nothing for internal messages
+  var cs = in_msg_cell.begin_parse();
+  var flags = cs~load_uint(4);  ;; int_msg_info$0 ihr_disabled:Bool bounce:Bool bounced:Bool
+  if (flags & 1) {
+    ;; ignore all bounced messages
+    return ();
+  }
+  var s_addr = cs~load_msg_addr();
+  if (in_msg.slice_empty?()) {
+    ;; inbound message has empty body
+    return process_simple_transfer(s_addr, msg_value);
+  }
+  int op = in_msg~load_uint(32);
+  if (op == 0) {
+    ;; simple transfer with comment, return
+    return process_simple_transfer(s_addr, msg_value);
+  }
+  int query_id = in_msg~load_uint(64);
+  if (op == 0x4e73744b) {
+    ;; new stake message
+    return process_new_stake(s_addr, msg_value, in_msg, query_id);
+  }
+  if (op == 0x47657424) {
+    ;; recover stake request
+    return recover_stake(op, s_addr, in_msg, query_id);
+  }
+  if (op == 0x4e436f64) {
+    ;; upgrade code (accepted only from configuration smart contract)
+    var ok = upgrade_code(s_addr, in_msg, query_id);
+    return send_message_back(s_addr, ok ? 0xce436f64 : 0xffffffff, query_id, op, 0, 64);
+  }
+  var cfg_ok = (op == 0xee764f4b);
+  if (cfg_ok | (op == 0xee764f6f)) {
+    ;; confirmation from configuration smart contract
+    return config_set_confirmed(s_addr, in_msg, query_id, cfg_ok);
+  }
+  ifnot (op & (1 << 31)) {
+    ;; unknown query, return error
+    return send_message_back(s_addr, 0xffffffff, query_id, op, 0, 64);
+  }
+  ;; unknown answer, ignore
+  return ();
+}
+
+int postpone_elections() impure {
+  return false;
+}
+
+;; computes the total stake out of the first n entries of list l
+_ compute_total_stake(l, n, m_stake) {
+  int tot_stake = 0;
+  repeat (n) {
+    (var h, l) = uncons(l);
+    var stake = h.at(0);
+    var max_f = h.at(1);
+    stake = min(stake, (max_f * m_stake) >> 16);
+    tot_stake += stake;
+  }
+  return tot_stake;
+}
+
+(cell, cell, cell, int, int) try_elect(credits, members, min_stake, max_stake, min_total_stake, max_stake_factor) {
+  var cs = 16.config_param().begin_parse();
+  var (max_validators, _, min_validators) = (cs~load_uint(16), cs~load_uint(16), cs~load_uint(16));
+  cs.end_parse();
+  min_validators = max(min_validators, 1);
+  int n = 0;
+  var sdict = new_dict();
+  var pubkey = -1;
+  do {
+    (pubkey, var cs, var f) = members.udict_get_next?(256, pubkey);
+    if (f) {
+      var (stake, time, max_factor, addr, adnl_addr) = (cs~load_grams(), cs~load_uint(32), cs~load_uint(32), cs~load_uint(256), cs~load_uint(256));
+      cs.end_parse();
+      var key = begin_cell()
+        .store_uint(stake, 128)
+        .store_int(- time, 32)
+        .store_uint(pubkey, 256)
+      .end_cell().begin_parse();
+      sdict~dict_set_builder(128 + 32 + 256, key, begin_cell()
+          .store_uint(min(max_factor, max_stake_factor), 32)
+          .store_uint(addr, 256)
+          .store_uint(adnl_addr, 256));
+      n += 1;
+    }
+  } until (~ f);
+  n = min(n, max_validators);
+  if (n < min_validators) {
+    return (credits, new_dict(), new_dict(), 0, 0);
+  }
+  var l = nil;
+  do {
+    var (key, cs, f) = sdict~dict::delete_get_min(128 + 32 + 256);
+    if (f) {
+      var (stake, _, pubkey) = (min(key~load_uint(128), max_stake), key~load_uint(32), key.preload_uint(256));
+      var (max_f, _, adnl_addr) = (cs~load_uint(32), cs~load_uint(256), cs.preload_uint(256));
+      l = cons(tuple4(stake, max_f, pubkey, adnl_addr), l);
+    }
+  } until (~ f);
+  ;; l is the list of all stakes in decreasing order
+  int i = min_validators - 1;
+  var l1 = l;
+  repeat (i) {
+    l1 = cdr(l1);
+  }
+  var (best_stake, m) = (0, 0);
+  do {
+    var stake = l1~list_next().at(0);
+    i += 1;
+    if (stake >= min_stake) {
+      var tot_stake = compute_total_stake(l, i, stake);
+      if (tot_stake > best_stake) {
+        (best_stake, m) = (tot_stake, i);
+      }
+    }
+  } until (i >= n);
+  if ((m == 0) | (best_stake < min_total_stake)) {
+    return (credits, new_dict(), new_dict(), 0, 0);
+  }
+  ;; we have to select first m validators from list l
+  l1 = touch(l);
+  l1~dump();  ;; DEBUG
+  repeat (m - 1) {
+    l1 = cdr(l1);
+  }
+  var m_stake = car(l1).at(0);  ;; minimal stake
+  ;; create both the new validator set and the refund set
+  int i = 0;
+  var tot_stake = 0;
+  var vset = new_dict();
+  var frozen = new_dict();
+  do {
+    var (stake, max_f, pubkey, adnl_addr) = l~list_next().untuple4();
+    ;; lookup source address first
+    var (val, f) = members.udict_get?(256, pubkey);
+    throw_unless(61, f);
+    (_, _, var src_addr) = (val~load_grams(), val~load_uint(64), val.preload_uint(256));
+    if (i < m) {
+      ;; one of the first m members, include into validator set
+      var true_stake = min(stake, (max_f * m_stake) >> 16);
+      stake -= true_stake;
+      ;; ed25519_pubkey#8e81278a pubkey:bits256 = SigPubKey;  // 288 bits
+      ;; validator_addr#73 public_key:SigPubKey weight:uint64 adnl_addr:bits256 = ValidatorDescr;
+      var weight = (true_stake << 60) / best_stake;
+      tot_stake += true_stake;
+      var vinfo = begin_cell()
+        .store_uint(adnl_addr ? 0x73 : 0x53, 8)  ;; validator_addr#73 or validator#53
+        .store_uint(0x8e81278a, 32)    ;; ed25519_pubkey#8e81278a
+        .store_uint(pubkey, 256)       ;; pubkey:bits256
+        .store_uint(weight, 64);       ;; weight:uint64
+      if (adnl_addr) {
+        vinfo~store_uint(adnl_addr, 256);  ;; adnl_addr:bits256
+      }
+      vset~udict_set_builder(16, i, vinfo);
+      frozen~udict_set_builder(256, pubkey, begin_cell()
+        .store_uint(src_addr, 256)
+        .store_uint(weight, 64)
+        .store_grams(true_stake)
+        .store_int(false, 1));
+    }
+    if (stake) {
+      ;; non-zero unused part of the stake, credit to the source address
+      credits~credit_to(src_addr, stake);
+    }
+    i += 1;
+  } until (l.null?());
+  throw_unless(49, tot_stake == best_stake);
+  return (credits, vset, frozen, tot_stake, m); 
+}
+
+int conduct_elections(ds, elect, credits) impure {
+  var (elect_at, elect_close, min_stake, total_stake, members, failed, finished) = elect.unpack_elect();
+  if (now() < elect_close) {
+    ;; elections not finished yet
+    return false;
+  }
+  if (config_param(0).null?()) {
+    ;; no configuration smart contract to send result to
+    return postpone_elections();
+  }
+  var cs = config_param(17).begin_parse();
+  min_stake = cs~load_grams();
+  var max_stake = cs~load_grams();
+  var min_total_stake = cs~load_grams();
+  var max_stake_factor = cs~load_uint(32);
+  cs.end_parse();
+  if (total_stake < min_total_stake) {
+    ;; insufficient total stake, postpone elections
+    return postpone_elections();
+  }
+  if (failed) {
+    ;; do not retry failed elections until new stakes arrive
+    return postpone_elections();
+  }
+  if (finished) {
+    ;; elections finished
+    return false;
+  }
+  (credits, var vdict, var frozen, var total_stakes, var cnt) = try_elect(credits, members, min_stake, max_stake, min_total_stake, max_stake_factor);
+  ;; pack elections; if cnt==0, set failed=true, finished=false.
+  failed = (cnt == 0);
+  finished = ~ failed;
+  elect = pack_elect(elect_at, elect_close, min_stake, total_stake, members, failed, finished);
+  ifnot (cnt) {
+    ;; elections failed, set elect_failed to true
+    set_data(begin_cell().store_dict(elect).store_dict(credits).store_slice(ds).end_cell());
+    return postpone_elections();
+  }
+  ;; serialize a query to the configuration smart contract
+  ;; to install the computed validator set as the next validator set
+  var (elect_for, elect_begin_before, elect_end_before, stake_held) = get_validator_conf();
+  var start = max(now() + elect_end_before - 60, elect_at);
+  var main_validators = config_param(16).begin_parse().skip_bits(16).preload_uint(16);
+  var vset = begin_cell()
+    .store_uint(0x11, 8)      ;; validators#11
+    .store_uint(start, 32)    ;; utime_since:uint32
+    .store_uint(start + elect_for, 32)  ;; utime_until:uint32
+    .store_uint(cnt, 16)      ;; total:(## 16) 
+    .store_uint(min(cnt, main_validators), 16)  ;; main:(## 16) 
+    .store_slice(vdict.begin_parse())  ;; list:(Hashmap 16 ValidatorDescr)
+  .end_cell();
+  var config_addr = config_param(0).begin_parse().preload_uint(256);
+  send_validator_set_to_config(config_addr, vset, elect_at);
+  ;; add frozen to the dictionary of past elections
+  var past_elect = ds~load_dict();
+  past_elect~udict_set_builder(32, elect_at, begin_cell()
+    .store_uint(start + elect_for + stake_held, 32)
+    .store_uint(stake_held, 32)
+    .store_uint(cell_hash(vset), 256)
+    .store_dict(frozen)
+    .store_grams(total_stakes)
+    .store_grams(0)
+    .store_int(false, 1));
+  ;; store credits and frozen until end
+  set_data(begin_cell()
+    .store_dict(elect)
+    .store_dict(credits)
+    .store_dict(past_elect)
+    .store_slice(ds)
+  .end_cell());
+  return true;
+}
+
+int update_active_vset_id() impure {
+  var (elect, credits, past_elect, grams, active_id, active_hash) = load_data();
+  var cur_hash = config_param(34).cell_hash();
+  if (cur_hash == active_hash) {
+    ;; validator set unchanged
+    return false;
+  }
+  if (active_id) {
+    ;; active_id becomes inactive
+    var (fs, f) = past_elect.udict_get?(32, active_id);
+    if (f) {
+      ;; adjust unfreeze time of this validator set
+      var unfreeze_time = fs~load_uint(32);
+      var fs0 = fs;
+      var (stake_held, hash) = (fs~load_uint(32), fs~load_uint(256));
+      throw_unless(57, hash == active_hash);
+      unfreeze_time = now() + stake_held;
+      past_elect~udict_set_builder(32, active_id, begin_cell()
+        .store_uint(unfreeze_time, 32)
+        .store_slice(fs0));
+    }
+  }
+  ;; look up new active_id by hash
+  var id = -1;
+  do {
+    (id, var fs, var f) = past_elect.udict_get_next?(32, id);
+    if (f) {
+      var (tm, hash) = (fs~load_uint(64), fs~load_uint(256));
+      if (hash == cur_hash) {
+        ;; parse more of this record
+        var (dict, total_stake, bonuses) = (fs~load_dict(), fs~load_grams(), fs~load_grams());
+        ;; transfer 1/8 of accumulated everybody's grams to this validator set as bonuses
+        var amount = (grams >> 3);
+        grams -= amount;
+        bonuses += amount;
+        ;; serialize back
+        past_elect~udict_set_builder(32, id, begin_cell()
+          .store_uint(tm, 64)
+          .store_uint(hash, 256)
+          .store_dict(dict)
+          .store_grams(total_stake)
+          .store_grams(bonuses)
+          .store_slice(fs));
+        ;; found
+        f = false;
+      }
+    }
+  } until (~ f);
+  active_id = (id.null?() ? 0 : id);
+  active_hash = cur_hash;
+  store_data(elect, credits, past_elect, grams, active_id, active_hash);
+  return true;
+}
+
+int cell_hash_eq?(cell vset, int expected_vset_hash) {
+  return vset.null?() ? false : cell_hash(vset) == expected_vset_hash;
+}
+
+int validator_set_installed(ds, elect, credits) impure {
+  var (elect_at, elect_close, min_stake, total_stake, members, failed, finished) = elect.unpack_elect();
+  ifnot (finished) {
+    ;; elections not finished yet
+    return false;
+  }
+  var past_elections = ds~load_dict();
+  var (fs, f) = past_elections.udict_get?(32, elect_at);
+  ifnot (f) {
+    ;; no election data in dictionary
+    return false;
+  }
+  ;; recover validator set hash
+  var vset_hash = fs.skip_bits(64).preload_uint(256);
+  if (config_param(34).cell_hash_eq?(vset_hash) | config_param(36).cell_hash_eq?(vset_hash)) {
+    ;; this validator set has been installed, forget elections
+    set_data(begin_cell()
+      .store_int(false, 1)   ;; forget current elections
+      .store_dict(credits)
+      .store_dict(past_elections)
+      .store_slice(ds)
+    .end_cell());
+    update_active_vset_id();
+    return true;
+  }
+  return false;
+}
+
+int check_unfreeze() impure {
+  var (elect, credits, past_elect, grams, active_id, active_hash) = load_data();
+  int id = -1;
+  do {
+    (id, var fs, var f) = past_elect.udict_get_next?(32, id);
+    if (f) {
+      var unfreeze_at = fs~load_uint(32);
+      if ((unfreeze_at <= now()) & (id != active_id)) {
+        ;; unfreeze!
+        (credits, past_elect, var unused_prizes) = unfreeze_all(credits, past_elect, id);
+        grams += unused_prizes;
+        ;; unfreeze only one at time, exit loop
+        store_data(elect, credits, past_elect, grams, active_id, active_hash);
+        ;; exit loop
+        f = false;
+      }
+    }
+  } until (~ f);
+  return ~ id.null?();
+}
+
+int announce_new_elections(ds, elect, credits) {
+  var next_vset = config_param(36);   ;; next validator set
+  ifnot (next_vset.null?()) {
+    ;; next validator set exists, no elections needed
+    return false;
+  }
+  var elector_addr = config_param(1).begin_parse().preload_uint(256);
+  var (my_wc, my_addr) = my_address().parse_std_addr();
+  if ((my_wc + 1) | (my_addr != elector_addr)) {
+    ;; this smart contract is not the elections smart contract anymore, no new elections
+    return false;
+  }
+  var cur_vset = config_param(34);  ;; current validator set
+  if (cur_vset.null?()) {
+    return false;
+  }
+  var (elect_for, elect_begin_before, elect_end_before, stake_held) = get_validator_conf();
+  var cur_valid_until = cur_vset.begin_parse().skip_bits(8 + 32).preload_uint(32);
+  var t = now();
+  var t0 = cur_valid_until - elect_begin_before;
+  if (t < t0) {
+    ;; too early for the next elections
+    return false;
+  }
+  ;; less than elect_before_begin seconds left, create new elections
+  if (t - t0 < 60) {
+    ;; pretend that the elections started at t0
+    t = t0;
+  }
+  ;; get stake parameters
+  (_, var min_stake) = config_param(17).begin_parse().load_grams();
+  ;; announce new elections
+  var elect_at = t + elect_begin_before;
+  elect_at~dump();
+  var elect_close = elect_at - elect_end_before;
+  elect = pack_elect(elect_at, elect_close, min_stake, 0, new_dict(), false, false);
+  set_data(begin_cell().store_dict(elect).store_dict(credits).store_slice(ds).end_cell());
+  return true;
+}
+
+() run_ticktock(int is_tock) impure {
+  ;; check whether an election is being conducted
+  var ds = get_data().begin_parse();
+  var (elect, credits) = (ds~load_dict(), ds~load_dict());
+  ifnot (elect.null?()) {
+    ;; have an active election
+    throw_if(0, conduct_elections(ds, elect, credits));  ;; elections conducted, exit
+    throw_if(0, validator_set_installed(ds, elect, credits));  ;; validator set installed, current elections removed
+  } else {
+    throw_if(0, announce_new_elections(ds, elect, credits));  ;; new elections announced, exit
+  }
+  throw_if(0, update_active_vset_id());  ;; active validator set id updated, exit
+  check_unfreeze();
+}
+
+;; Get methods
+
+;; returns active election id or 0
+int active_election_id() method_id {
+  var elect = get_data().begin_parse().preload_dict();
+  return elect.null?() ? 0 : elect.begin_parse().preload_uint(32);
+}
+
+;; checks whether a public key participates in current elections
+int participates_in(int validator_pubkey) method_id {
+  var elect = get_data().begin_parse().preload_dict();
+  if (elect.null?()) {
+    return 0;
+  }
+  var (elect_at, elect_close, min_stake, total_stake, members, failed, finished) = elect.unpack_elect();
+  var (mem, found) = members.udict_get?(256, validator_pubkey);
+  return found ? mem~load_grams() : 0;
+}
+
+;; returns the list of all participants of current elections with their stakes
+_ participant_list() method_id {
+  var elect = get_data().begin_parse().preload_dict();
+  if (elect.null?()) {
+    return nil;
+  }
+  var (elect_at, elect_close, min_stake, total_stake, members, failed, finished) = elect.unpack_elect();
+  var l = nil;
+  var id = (1 << 255) + ((1 << 255) - 1);
+  do {
+    (id, var fs, var f) = members.udict_get_prev?(256, id);
+    if (f) {
+      l = cons(pair(id, fs~load_grams()), l);
+    }
+  } until (~ f);
+  return l;
+}
+
+;; computes the return stake
+int compute_returned_stake(int wallet_addr) method_id {
+  var cs = get_data().begin_parse();
+  (_, var credits) = (cs~load_dict(), cs~load_dict());
+  var (val, f) = credits.udict_get?(256, wallet_addr);
+  return f ? val~load_grams() : 0;
+}
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/elector-code.fif b/submodules/ton/tonlib-src/crypto/smartcont/elector-code.fif
new file mode 100644
index 0000000000..08184e6f43
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/elector-code.fif
@@ -0,0 +1,1711 @@
+// automatically generated from `smartcont/stdlib.fc` `smartcont/elector-code.fc` 
+PROGRAM{
+  DECLPROC load_data
+  DECLPROC store_data
+  DECLPROC unpack_elect
+  DECLPROC pack_elect
+  DECLPROC get_validator_conf
+  DECLPROC send_message_back
+  DECLPROC return_stake
+  DECLPROC send_confirmation
+  DECLPROC send_validator_set_to_config
+  DECLPROC ~credit_to
+  DECLPROC process_new_stake
+  DECLPROC unfreeze_without_bonuses
+  DECLPROC unfreeze_with_bonuses
+  DECLPROC unfreeze_all
+  DECLPROC config_set_confirmed
+  DECLPROC process_simple_transfer
+  DECLPROC recover_stake
+  1666 DECLMETHOD after_code_upgrade
+  DECLPROC upgrade_code
+  DECLPROC recv_internal
+  DECLPROC postpone_elections
+  DECLPROC compute_total_stake
+  DECLPROC try_elect
+  DECLPROC conduct_elections
+  DECLPROC update_active_vset_id
+  DECLPROC cell_hash_eq?
+  DECLPROC validator_set_installed
+  DECLPROC check_unfreeze
+  DECLPROC announce_new_elections
+  DECLPROC run_ticktock
+  86535 DECLMETHOD active_election_id
+  87852 DECLMETHOD participates_in
+  123541 DECLMETHOD participant_list
+  130944 DECLMETHOD compute_returned_stake
+  load_data PROC:<{
+    // 
+    c4 PUSH	//  _1
+    CTOS	//  cs
+    LDDICT	//  _4 cs
+    LDDICT	//  _4 _6 cs
+    LDDICT	//  _4 _6 _8 cs
+    LDGRAMS	//  _4 _6 _8 _10 cs
+    32 LDU	//  _4 _6 _8 _10 _12 cs
+    256 LDU	//  res res res res res res cs
+    ENDS
+  }>
+  store_data PROC:<{
+    //  elect credits past_elect grams active_id active_hash
+    NEWC	//  elect credits past_elect grams active_id active_hash _6
+    s1 s6 XCHG	//  active_hash credits past_elect grams active_id elect _6
+    STDICT	//  active_hash credits past_elect grams active_id _7
+    s1 s4 XCHG	//  active_hash active_id past_elect grams credits _7
+    STDICT	//  active_hash active_id past_elect grams _8
+    s1 s2 XCHG	//  active_hash active_id grams past_elect _8
+    STDICT	//  active_hash active_id grams _9
+    SWAP	//  active_hash active_id _9 grams
+    STGRAMS	//  active_hash active_id _10
+    32 STU	//  active_hash _12
+    256 STU	//  _14
+    ENDC	//  _15
+    c4 POP
+  }>
+  unpack_elect PROC:<{
+    //  elect
+    CTOS	//  es
+    32 LDU	//  _4 es
+    32 LDU	//  _4 _7 es
+    LDGRAMS	//  _4 _7 _10 es
+    LDGRAMS	//  _4 _7 _10 _12 es
+    LDDICT	//  _4 _7 _10 _12 _14 es
+    1 LDI	//  _4 _7 _10 _12 _14 _16 es
+    1 LDI	//  res res res res res res res es
+    ENDS
+  }>
+  pack_elect PROC:<{
+    //  elect_at elect_close min_stake total_stake members failed finished
+    NEWC	//  elect_at elect_close min_stake total_stake members failed finished _7
+    s1 s7 XCHG	//  finished elect_close min_stake total_stake members failed elect_at _7
+    32 STU	//  finished elect_close min_stake total_stake members failed _9
+    s1 s5 XCHG	//  finished failed min_stake total_stake members elect_close _9
+    32 STU	//  finished failed min_stake total_stake members _11
+    s0 s3 XCHG2	//  finished failed members total_stake _11 min_stake
+    STGRAMS	//  finished failed members total_stake _12
+    SWAP	//  finished failed members _12 total_stake
+    STGRAMS	//  finished failed members _13
+    STDICT	//  finished failed _14
+    1 STI	//  finished _16
+    1 STI	//  _18
+    ENDC	//  _19
+  }>
+  get_validator_conf PROC:<{
+    // 
+    15 PUSHINT	//  _1=15
+    CONFIGOPTPARAM	//  _2
+    CTOS	//  cs
+    32 LDI	//  _4 cs
+    32 LDI	//  _4 _7 cs
+    32 LDI	//  _4 _7 _10 cs
+    32 PLDI	//  _4 _7 _10 _14
+  }>
+  send_message_back PROC:<{
+    //  addr ans_tag query_id body grams mode
+    0 PUSHINT	//  addr ans_tag query_id body grams mode _7=0
+    24 PUSHINT	//  addr ans_tag query_id body grams mode _7=0 _8=24
+    NEWC	//  addr ans_tag query_id body grams mode _7=0 _8=24 _9
+    6 STU	//  addr ans_tag query_id body grams mode _7=0 _11
+    s0 s7 XCHG2	//  _7=0 ans_tag query_id body grams mode _11 addr
+    STSLICER	//  _7=0 ans_tag query_id body grams mode _12
+    ROT	//  _7=0 ans_tag query_id body mode _12 grams
+    STGRAMS	//  _7=0 ans_tag query_id body mode _13
+    s1 s5 XCHG	//  mode ans_tag query_id body _7=0 _13
+    107 STU	//  mode ans_tag query_id body _27
+    s1 s3 XCHG	//  mode body query_id ans_tag _27
+    32 STU	//  mode body query_id _29
+    64 STU	//  mode body msg
+    OVER	//  mode body msg body
+    -1 GTINT	//  mode body msg _33
+    IF:<{	//  mode body msg
+      32 STU	//  mode msg
+    }>ELSE<{
+      NIP	//  mode msg
+    }>
+    ENDC	//  mode _37
+    SWAP	//  _37 mode
+    SENDRAWMSG
+  }>
+  return_stake PROC:<{
+    //  addr query_id reason
+    4000269644 PUSHINT	//  addr query_id reason _3=4000269644
+    0 PUSHINT	//  addr query_id reason _3=4000269644 _4=0
+    s3 s3 s0 XCHG3
+    64 PUSHINT	//  addr _3=4000269644 query_id reason _4=0 _5=64
+    send_message_back CALLDICT
+  }>
+  send_confirmation PROC:<{
+    //  addr query_id comment
+    4084484172 PUSHINT	//  addr query_id comment _3=4084484172
+    1000000000 PUSHINT	//  addr query_id comment _3=4084484172 _4=1000000000
+    s3 s3 s0 XCHG3
+    2 PUSHINT	//  addr _3=4084484172 query_id comment _4=1000000000 _5=2
+    send_message_back CALLDICT
+  }>
+  send_validator_set_to_config PROC:<{
+    //  config_addr vset query_id
+    1314280276 PUSHINT	//  config_addr vset query_id _4=1314280276
+    0 PUSHINT	//  config_addr vset query_id _4=1314280276 _5=0
+    50431 PUSHINT	//  config_addr vset query_id _4=1314280276 _5=0 _6=50431
+    NEWC	//  config_addr vset query_id _4=1314280276 _5=0 _6=50431 _7
+    17 STU	//  config_addr vset query_id _4=1314280276 _5=0 _9
+    s1 s5 XCHG	//  _5=0 vset query_id _4=1314280276 config_addr _9
+    256 STU	//  _5=0 vset query_id _4=1314280276 _11
+    30 PUSHPOW2	//  _5=0 vset query_id _4=1314280276 _11 _14
+    STGRAMS	//  _5=0 vset query_id _4=1314280276 _15
+    s1 s4 XCHG	//  _4=1314280276 vset query_id _5=0 _15
+    107 STU	//  _4=1314280276 vset query_id _29
+    s1 s3 XCHG	//  query_id vset _4=1314280276 _29
+    32 STU	//  query_id vset _31
+    s1 s2 XCHG	//  vset query_id _31
+    64 STU	//  vset _33
+    STREF	//  msg
+    ENDC	//  _35
+    1 PUSHINT	//  _35 _36=1
+    SENDRAWMSG
+  }>
+  ~credit_to PROC:<{
+    //  credits addr amount
+    s1 s2 PUSH2
+    8 PUSHPOW2	//  credits addr amount addr credits _5=256
+    DICTUGET
+    NULLSWAPIFNOT	//  credits addr amount val f
+    IF:<{	//  credits addr amount val
+      LDGRAMS	//  credits addr amount _18 _17
+      DROP	//  credits addr amount _7
+      ADD	//  credits addr amount
+    }>ELSE<{
+      DROP	//  credits addr amount
+    }>
+    NEWC	//  credits addr amount _11
+    SWAP	//  credits addr _11 amount
+    STGRAMS	//  credits addr _12
+    s0 s2 XCHG
+    8 PUSHPOW2	//  _12 addr credits _13=256
+    DICTUSETB	//  credits
+  }>
+  process_new_stake PROC:<{
+    //  s_addr msg_value cs query_id
+    s3 PUSH	//  s_addr msg_value cs query_id s_addr
+    REWRITESTDADDR	//  s_addr msg_value cs query_id src_wc src_addr
+    c4 PUSH	//  s_addr msg_value cs query_id src_wc src_addr _8
+    CTOS	//  s_addr msg_value cs query_id src_wc src_addr ds
+    LDDICT	//  s_addr msg_value cs query_id src_wc src_addr elect ds
+    OVER	//  s_addr msg_value cs query_id src_wc src_addr elect ds elect
+    ISNULL	//  s_addr msg_value cs query_id src_wc src_addr elect ds _13
+    s0 s4 XCHG	//  s_addr msg_value cs query_id _13 src_addr elect ds src_wc
+    INC	//  s_addr msg_value cs query_id _13 src_addr elect ds _15
+    s1 s4 XCHG	//  s_addr msg_value cs query_id ds src_addr elect _13 _15
+    OR	//  s_addr msg_value cs query_id ds src_addr elect _16
+    IFJMP:<{	//  s_addr msg_value cs query_id ds src_addr elect
+      s3 s5 XCHG
+      5 BLKDROP	//  s_addr query_id
+      0 PUSHINT	//  s_addr query_id _17=0
+      return_stake CALLDICT
+    }>	//  s_addr msg_value cs query_id ds src_addr elect
+    s0 s4 XCHG	//  s_addr msg_value elect query_id ds src_addr cs
+    256 LDU	//  s_addr msg_value elect query_id ds src_addr validator_pubkey cs
+    32 LDU	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at cs
+    32 LDU	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor cs
+    256 LDU	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr cs
+    LDREF	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr _36 cs
+    SWAP	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr cs _36
+    CTOS	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr cs _38
+    9 PUSHPOW2	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr cs _38 _39=512
+    PLDSLICEX	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr cs signature
+    SWAP	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature cs
+    ENDS
+    1699500148 PUSHINT	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature _42=1699500148
+    NEWC	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature _42=1699500148 _43
+    32 STU	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature _45
+    s4 s(-1) PUXC	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature stake_at _45
+    32 STU	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature _47
+    s3 s(-1) PUXC	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature max_factor _47
+    32 STU	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature _49
+    s6 s(-1) PUXC	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature src_addr _49
+    256 STU	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature _51
+    s2 s(-1) PUXC	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature adnl_addr _51
+    256 STU	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature _53
+    ENDC	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature _54
+    CTOS	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr signature _55
+    s1 s5 XCPU	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr _55 signature validator_pubkey
+    CHKSIGNS	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr _56
+    IFNOTJMP:<{	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr
+      s6 s8 XCHG
+      8 BLKDROP	//  s_addr query_id
+      1 PUSHINT	//  s_addr query_id _57=1
+      return_stake CALLDICT
+    }>	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr
+    OVER
+    16 PUSHPOW2	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr max_factor _59=65536
+    LESS	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr _60
+    IFJMP:<{	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr
+      s6 s8 XCHG
+      8 BLKDROP	//  s_addr query_id
+      6 PUSHINT	//  s_addr query_id _61=6
+      return_stake CALLDICT
+    }>	//  s_addr msg_value elect query_id ds src_addr validator_pubkey stake_at max_factor adnl_addr
+    s0 s7 XCHG	//  s_addr msg_value adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor elect
+    unpack_elect CALLDICT	//  s_addr msg_value adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor _146 _147 _148 _149 _150 _151 _152
+    NIP	//  s_addr msg_value adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor elect_at elect_close min_stake total_stake members finished
+    s0 s5 XCHG	//  s_addr msg_value adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor finished elect_close min_stake total_stake members elect_at
+    s0 DUMP	//  s_addr msg_value adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor finished elect_close min_stake total_stake members elect_at
+    s0 s13 XCHG
+    1000000000 PUSHINT	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor finished elect_close min_stake total_stake members msg_value _73=1000000000
+    SUB	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor finished elect_close min_stake total_stake members msg_value
+    DUP	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor finished elect_close min_stake total_stake members msg_value msg_value
+    12 LSHIFT#	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor finished elect_close min_stake total_stake members msg_value _76
+    s3 PUSH	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor finished elect_close min_stake total_stake members msg_value _76 total_stake
+    LESS	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor finished elect_close min_stake total_stake members msg_value _77
+    IFJMP:<{	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor finished elect_close min_stake total_stake members msg_value
+      s11 s12 XCHG
+      12 BLKDROP
+      NIP	//  s_addr query_id
+      2 PUSHINT	//  s_addr query_id _78=2
+      return_stake CALLDICT
+    }>	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor finished elect_close min_stake total_stake members msg_value
+    s2 s2 XCPU	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor finished elect_close min_stake msg_value members total_stake msg_value
+    ADD	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey stake_at max_factor finished elect_close min_stake msg_value members total_stake
+    s7 s13 XCPU	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor finished elect_close min_stake msg_value members stake_at elect_at
+    NEQ	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor finished elect_close min_stake msg_value members _81
+    IFJMP:<{	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor finished elect_close min_stake msg_value members
+      s10 s12 XCHG
+      12 BLKDROP	//  s_addr query_id
+      3 PUSHINT	//  s_addr query_id _82=3
+      return_stake CALLDICT
+    }>	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor finished elect_close min_stake msg_value members
+    s0 s4 XCHG	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value finished
+    IFJMP:<{	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value
+      s9 s11 XCHG
+      11 BLKDROP	//  s_addr query_id
+      0 PUSHINT	//  s_addr query_id _84=0
+      return_stake CALLDICT
+    }>	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value
+    s6 s3 PUSH2
+    8 PUSHPOW2	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value validator_pubkey members _88=256
+    DICTUGET
+    NULLSWAPIFNOT	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value mem found
+    DUP	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value mem found found
+    IF:<{	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value mem found
+      DROP	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value mem
+      LDGRAMS	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value _90 mem
+      -ROT	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake mem msg_value _90
+      ADD	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake mem msg_value
+      SWAP	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value mem
+      64 LDU	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value _158 _157
+      NIP	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value mem
+      256 LDU	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value _160 _159
+      DROP	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value _96
+      s8 s(-1) PUXC	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value src_addr _96
+      NEQ	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value found
+    }>ELSE<{
+      NIP	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value found
+    }>
+    IFJMP:<{	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value
+      s9 s11 XCHG
+      11 BLKDROP	//  s_addr query_id
+      4 PUSHINT	//  s_addr query_id _100=4
+      return_stake CALLDICT
+    }>	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value
+    s0 s1 PUSH2	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value msg_value min_stake
+    LESS	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value _102
+    IFJMP:<{	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value
+      s9 s11 XCHG
+      11 BLKDROP	//  s_addr query_id
+      5 PUSHINT	//  s_addr query_id _103=5
+      return_stake CALLDICT
+    }>	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value
+    DUP	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value msg_value
+    44 THROWIFNOT
+    ACCEPT
+    NOW	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value _109
+    NEWC	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake msg_value _109 _110
+    ROT	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake _109 _110 msg_value
+    STGRAMS	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake _109 _111
+    32 STU	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake max_factor members elect_close min_stake _113
+    s1 s4 XCHG	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake min_stake members elect_close max_factor _113
+    32 STU	//  s_addr elect_at adnl_addr query_id ds src_addr validator_pubkey total_stake min_stake members elect_close _115
+    s1 s6 XCHG	//  s_addr elect_at adnl_addr query_id ds elect_close validator_pubkey total_stake min_stake members src_addr _115
+    256 STU	//  s_addr elect_at adnl_addr query_id ds elect_close validator_pubkey total_stake min_stake members _117
+    s1 s8 XCHG	//  s_addr elect_at members query_id ds elect_close validator_pubkey total_stake min_stake adnl_addr _117
+    256 STU	//  s_addr elect_at members query_id ds elect_close validator_pubkey total_stake min_stake _119
+    s0 s3 s7 XCHG3
+    8 PUSHPOW2	//  s_addr elect_at total_stake query_id ds elect_close min_stake _119 validator_pubkey members _120=256
+    DICTUSETB	//  s_addr elect_at total_stake query_id ds elect_close min_stake members
+    FALSE	//  s_addr elect_at total_stake query_id ds elect_close min_stake members _122
+    s5 s7 XCHG
+    s3 s4 XCHG
+    s2 s3 XCHG
+    s2 s6 XCHG
+    FALSE	//  s_addr query_id ds elect_at elect_close min_stake total_stake members _122 _123
+    pack_elect CALLDICT	//  s_addr query_id ds elect
+    NEWC	//  s_addr query_id ds elect _125
+    STDICT	//  s_addr query_id ds _126
+    SWAP	//  s_addr query_id _126 ds
+    STSLICER	//  s_addr query_id _127
+    ENDC	//  s_addr query_id _128
+    c4 POP
+    DUP	//  s_addr query_id query_id
+    IFJMP:<{	//  s_addr query_id
+      0 PUSHINT	//  s_addr query_id _130=0
+      send_confirmation CALLDICT
+    }>	//  s_addr query_id
+    2DROP	// 
+  }>
+  unfreeze_without_bonuses PROC:<{
+    //  credits freeze_dict tot_stakes
+    0 PUSHINT	//  credits freeze_dict tot_stakes recovered=0
+    DUP	//  credits freeze_dict tot_stakes recovered=0 total=0
+    -1 PUSHINT	//  credits freeze_dict tot_stakes recovered=0 total=0 pubkey=-1
+    UNTIL:<{
+      s4 PUSH
+      8 PUSHPOW2	//  credits freeze_dict tot_stakes recovered total pubkey freeze_dict _10=256
+      DICTUGETNEXT
+      NULLSWAPIFNOT
+      NULLSWAPIFNOT	//  credits freeze_dict tot_stakes recovered total cs pubkey f
+      DUP	//  credits freeze_dict tot_stakes recovered total cs pubkey f f
+      IF:<{	//  credits freeze_dict tot_stakes recovered total cs pubkey f
+        s0 s2 XCHG	//  credits freeze_dict tot_stakes recovered total f pubkey cs
+        256 LDU	//  credits freeze_dict tot_stakes recovered total f pubkey _16 cs
+        64 LDU	//  credits freeze_dict tot_stakes recovered total f pubkey _16 _42 _41
+        NIP	//  credits freeze_dict tot_stakes recovered total f pubkey _16 cs
+        LDGRAMS	//  credits freeze_dict tot_stakes recovered total f pubkey _16 _22 cs
+        1 LDI	//  credits freeze_dict tot_stakes recovered total f pubkey addr stake banned cs
+        ENDS
+        IF:<{	//  credits freeze_dict tot_stakes recovered total f pubkey addr stake
+          NIP	//  credits freeze_dict tot_stakes recovered total f pubkey stake
+          s4 s4 XCPU	//  credits freeze_dict tot_stakes stake total f pubkey recovered stake
+          ADD	//  credits freeze_dict tot_stakes stake total f pubkey recovered
+        }>ELSE<{	//  credits freeze_dict tot_stakes recovered total f pubkey addr stake
+          s8 s8 s8 XC2PU	//  stake freeze_dict tot_stakes recovered total f pubkey credits addr stake
+          ~credit_to CALLDICT	//  stake freeze_dict tot_stakes recovered total f pubkey credits
+          s0 s7 XCHG
+          s0 s4 XCHG	//  credits freeze_dict tot_stakes stake total f pubkey recovered
+        }>
+        s3 s4 XCHG2	//  credits freeze_dict tot_stakes recovered pubkey f total stake
+        ADD	//  credits freeze_dict tot_stakes recovered pubkey f total
+      }>ELSE<{
+        2SWAP
+        DROP	//  credits freeze_dict tot_stakes recovered pubkey f total
+      }>
+      SWAP	//  credits freeze_dict tot_stakes recovered pubkey total f
+      NOT	//  credits freeze_dict tot_stakes recovered pubkey total _32
+      s1 s2 XCHG	//  credits freeze_dict tot_stakes recovered total pubkey _32
+    }>	//  credits freeze_dict tot_stakes recovered total pubkey
+    DROP
+    s3 POP	//  credits total tot_stakes recovered
+    -ROT	//  credits recovered total tot_stakes
+    EQUAL	//  credits recovered _34
+    59 THROWIFNOT
+  }>
+  unfreeze_with_bonuses PROC:<{
+    //  credits freeze_dict tot_stakes tot_bonuses
+    0 PUSHINT	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses=0
+    s0 s0 PUSH2	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses=0 recovered=0 total=0
+    -1 PUSHINT	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses=0 recovered=0 total=0 pubkey=-1
+    UNTIL:<{
+      s6 PUSH
+      8 PUSHPOW2	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total pubkey freeze_dict _12=256
+      DICTUGETNEXT
+      NULLSWAPIFNOT
+      NULLSWAPIFNOT	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total cs pubkey f
+      DUP	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total cs pubkey f f
+      IF:<{	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total cs pubkey f
+        s0 s2 XCHG	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey cs
+        256 LDU	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey _18 cs
+        64 LDU	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey _18 _52 _51
+        NIP	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey _18 cs
+        LDGRAMS	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey _18 _24 cs
+        1 LDI	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey addr stake banned cs
+        ENDS
+        IF:<{	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey addr stake
+          NIP	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey stake
+          s4 s4 XCPU	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses stake total f pubkey recovered stake
+          ADD	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses stake total f pubkey recovered
+        }>ELSE<{	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey addr stake
+          s7 s0 s8 PUSH3	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey addr stake tot_bonuses stake tot_stakes
+          MULDIV	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey addr stake bonus
+          s7 s7 XCPU	//  credits freeze_dict tot_stakes tot_bonuses bonus recovered total f pubkey addr stake returned_bonuses bonus
+          ADD	//  credits freeze_dict tot_stakes tot_bonuses bonus recovered total f pubkey addr stake returned_bonuses
+          s1 s7 PUXC	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey addr stake stake bonus
+          ADD	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey addr stake _35
+          s11 s11 s0 XCHG3	//  stake freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey credits addr _35
+          ~credit_to CALLDICT	//  stake freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total f pubkey credits
+          s0 s9 XCHG
+          s0 s4 XCHG	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses stake total f pubkey recovered
+        }>
+        s3 s4 XCHG2	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered pubkey f total stake
+        ADD	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered pubkey f total
+      }>ELSE<{
+        2SWAP
+        DROP	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered pubkey f total
+      }>
+      SWAP	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered pubkey total f
+      NOT	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered pubkey total _38
+      s1 s2 XCHG	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total pubkey _38
+    }>	//  credits freeze_dict tot_stakes tot_bonuses returned_bonuses recovered total pubkey
+    DROP
+    s5 POP	//  credits total tot_stakes tot_bonuses returned_bonuses recovered
+    s4 s3 XCHG2	//  credits returned_bonuses recovered tot_bonuses total tot_stakes
+    EQUAL	//  credits returned_bonuses recovered tot_bonuses _40
+    s3 s1 PUSH2	//  credits returned_bonuses recovered tot_bonuses _40 returned_bonuses tot_bonuses
+    LEQ	//  credits returned_bonuses recovered tot_bonuses _40 _41
+    AND	//  credits returned_bonuses recovered tot_bonuses _42
+    59 THROWIFNOT
+    ADD	//  credits returned_bonuses _44
+    SWAP	//  credits _44 returned_bonuses
+    SUB	//  credits _45
+  }>
+  unfreeze_all PROC:<{
+    //  credits past_elections elect_id
+    SWAP
+    32 PUSHINT	//  credits elect_id past_elections _6=32
+    DICTUDELGET
+    NULLSWAPIFNOT	//  credits past_elections fs f
+    IFNOTJMP:<{	//  credits past_elections fs
+      DROP	//  credits past_elections
+      0 PUSHINT	//  credits past_elections _8=0
+    }>	//  credits past_elections fs
+    64 LDU	//  credits past_elections _44 _43
+    NIP	//  credits past_elections fs
+    256 LDU	//  credits past_elections _46 _45
+    NIP	//  credits past_elections fs
+    LDDICT	//  credits past_elections _21 fs
+    LDGRAMS	//  credits past_elections _21 _23 fs
+    LDGRAMS	//  credits past_elections _21 _23 _25 fs
+    LDDICT	//  credits past_elections _21 _23 _25 _54 _53
+    NIP	//  credits past_elections fdict tot_stakes bonuses fs
+    ENDS
+    DUP	//  credits past_elections fdict tot_stakes bonuses bonuses
+    0 GTINT	//  credits past_elections fdict tot_stakes bonuses _32
+    IF:<{	//  credits past_elections fdict tot_stakes bonuses
+      s3 s4 XCHG	//  past_elections credits fdict tot_stakes bonuses
+      unfreeze_with_bonuses CALLDICT	//  past_elections credits _33
+    }>ELSE<{	//  credits past_elections fdict tot_stakes bonuses
+      DROP	//  credits past_elections fdict tot_stakes
+      s2 s3 XCHG	//  past_elections credits fdict tot_stakes
+      unfreeze_without_bonuses CALLDICT	//  past_elections credits _33
+    }>	//  past_elections credits unused_prizes
+    s1 s2 XCHG	//  credits past_elections unused_prizes
+  }>
+  config_set_confirmed PROC:<{
+    //  s_addr cs query_id ok
+    s2 POP	//  s_addr ok query_id
+    s0 s2 XCHG	//  query_id ok s_addr
+    REWRITESTDADDR	//  query_id ok src_wc src_addr
+    0 PUSHINT	//  query_id ok src_wc src_addr _8=0
+    CONFIGOPTPARAM	//  query_id ok src_wc src_addr _9
+    CTOS	//  query_id ok src_wc src_addr _10
+    256 PLDU	//  query_id ok src_wc src_addr config_addr
+    c4 PUSH	//  query_id ok src_wc src_addr config_addr _14
+    CTOS	//  query_id ok src_wc src_addr config_addr ds
+    LDDICT	//  query_id ok src_wc src_addr config_addr elect ds
+    s0 s4 XCHG	//  query_id ok ds src_addr config_addr elect src_wc
+    INC	//  query_id ok ds src_addr config_addr elect _20
+    2SWAP	//  query_id ok ds elect _20 src_addr config_addr
+    NEQ	//  query_id ok ds elect _20 _21
+    OR	//  query_id ok ds elect _22
+    OVER	//  query_id ok ds elect _22 elect
+    ISNULL	//  query_id ok ds elect _22 _23
+    OR	//  query_id ok ds elect _24
+    IFJMP:<{	//  query_id ok ds elect
+      4 BLKDROP	// 
+    }>	//  query_id ok ds elect
+    unpack_elect CALLDICT	//  query_id ok ds _63 _64 _65 _66 _67 _68 _69
+    s0 s5 XCHG
+    5 BLKDROP	//  query_id ok ds elect_at finished
+    s1 s4 PUXC	//  finished ok ds elect_at elect_at query_id
+    NEQ	//  finished ok ds elect_at _33
+    s0 s4 XCHG	//  _33 ok ds elect_at finished
+    NOT	//  _33 ok ds elect_at _34
+    s1 s4 XCHG	//  elect_at ok ds _33 _34
+    OR	//  elect_at ok ds _35
+    IFJMP:<{	//  elect_at ok ds
+      3 BLKDROP	// 
+    }>	//  elect_at ok ds
+    ACCEPT
+    SWAP	//  elect_at ds ok
+    IFNOT:<{	//  elect_at ds
+      LDDICT	//  elect_at _40 ds
+      LDDICT	//  elect_at _40 _42 ds
+      LDGRAMS	//  elect_at credits past_elections grams ds
+      s3 s3 s4 XCHG3	//  ds grams credits past_elections elect_at
+      unfreeze_all CALLDICT	//  ds grams credits past_elections unused_prizes
+      FALSE	//  ds grams credits past_elections unused_prizes _48
+      NEWC	//  ds grams credits past_elections unused_prizes _48 _49
+      1 STI	//  ds grams credits past_elections unused_prizes _51
+      s1 s3 XCHG	//  ds grams unused_prizes past_elections credits _51
+      STDICT	//  ds grams unused_prizes past_elections _52
+      STDICT	//  ds grams unused_prizes _53
+      -ROT	//  ds _53 grams unused_prizes
+      ADD	//  ds _53 _54
+      STGRAMS	//  ds _55
+      SWAP	//  _55 ds
+      STSLICER	//  _56
+      ENDC	//  _57
+      c4 POP
+    }>ELSE<{
+      2DROP	// 
+    }>
+  }>
+  process_simple_transfer PROC:<{
+    //  s_addr msg_value
+    load_data CALLDICT	//  s_addr msg_value elect credits past_elect grams active_id active_hash
+    s0 s7 XCHG	//  active_hash msg_value elect credits past_elect grams active_id s_addr
+    REWRITESTDADDR	//  active_hash msg_value elect credits past_elect grams active_id src_wc src_addr
+    SWAP	//  active_hash msg_value elect credits past_elect grams active_id src_addr src_wc
+    INC	//  active_hash msg_value elect credits past_elect grams active_id src_addr _13
+    OR	//  active_hash msg_value elect credits past_elect grams active_id _14
+    OVER	//  active_hash msg_value elect credits past_elect grams active_id _14 active_id
+    0 EQINT	//  active_hash msg_value elect credits past_elect grams active_id _14 _16
+    OR	//  active_hash msg_value elect credits past_elect grams active_id _17
+    IFJMP:<{	//  active_hash msg_value elect credits past_elect grams active_id
+      s0 s5 XCHG	//  active_hash active_id elect credits past_elect grams msg_value
+      ADD	//  active_hash active_id elect credits past_elect grams
+      2 4 BLKSWAP
+      SWAP	//  elect credits past_elect grams active_id active_hash
+      store_data CALLDICT
+    }>	//  active_hash msg_value elect credits past_elect grams active_id
+    s0 s2 PUSH2
+    32 PUSHINT	//  active_hash msg_value elect credits past_elect grams active_id active_id past_elect _22=32
+    DICTUGET
+    NULLSWAPIFNOT	//  active_hash msg_value elect credits past_elect grams active_id fs f
+    IF:<{	//  active_hash msg_value elect credits past_elect grams active_id fs
+      64 LDU	//  active_hash msg_value elect credits past_elect grams active_id _30 fs
+      256 LDU	//  active_hash msg_value elect credits past_elect grams active_id _30 _33 fs
+      LDDICT	//  active_hash msg_value elect credits past_elect grams active_id _30 _33 _36 fs
+      LDGRAMS	//  active_hash msg_value elect credits past_elect grams active_id _30 _33 _36 _38 fs
+      LDGRAMS	//  active_hash msg_value elect credits past_elect grams active_id data hash dict total_stake bonuses fs
+      s0 s11 XCHG	//  active_hash fs elect credits past_elect grams active_id data hash dict total_stake bonuses msg_value
+      ADD	//  active_hash fs elect credits past_elect grams active_id data hash dict total_stake bonuses
+      NEWC	//  active_hash fs elect credits past_elect grams active_id data hash dict total_stake bonuses _44
+      s1 s5 XCHG	//  active_hash fs elect credits past_elect grams active_id bonuses hash dict total_stake data _44
+      64 STU	//  active_hash fs elect credits past_elect grams active_id bonuses hash dict total_stake _46
+      s1 s3 XCHG	//  active_hash fs elect credits past_elect grams active_id bonuses total_stake dict hash _46
+      256 STU	//  active_hash fs elect credits past_elect grams active_id bonuses total_stake dict _48
+      STDICT	//  active_hash fs elect credits past_elect grams active_id bonuses total_stake _49
+      SWAP	//  active_hash fs elect credits past_elect grams active_id bonuses _49 total_stake
+      STGRAMS	//  active_hash fs elect credits past_elect grams active_id bonuses _50
+      SWAP	//  active_hash fs elect credits past_elect grams active_id _50 bonuses
+      STGRAMS	//  active_hash fs elect credits past_elect grams active_id _51
+      s0 s6 XCHG2	//  active_hash active_id elect credits past_elect grams _51 fs
+      STSLICER	//  active_hash active_id elect credits past_elect grams _52
+      SWAP
+      32 PUSHINT
+      s6 s3 s3 PUXC2	//  active_hash active_id elect credits grams _52 active_id past_elect _53=32
+      DICTUSETB	//  active_hash active_id elect credits grams past_elect
+    }>ELSE<{	//  active_hash msg_value elect credits past_elect grams active_id fs
+      DROP	//  active_hash msg_value elect credits past_elect grams active_id
+      s0 s5 XCHG	//  active_hash active_id elect credits past_elect grams msg_value
+      ADD	//  active_hash active_id elect credits past_elect grams
+      SWAP	//  active_hash active_id elect credits grams past_elect
+    }>
+    s3 s5 XCHG
+    s1 s4 s3 XCHG3	//  elect credits past_elect grams active_id active_hash
+    store_data CALLDICT
+  }>
+  recover_stake PROC:<{
+    //  op s_addr cs query_id
+    NIP	//  op s_addr query_id
+    OVER	//  op s_addr query_id s_addr
+    REWRITESTDADDR	//  op s_addr query_id src_wc src_addr
+    SWAP	//  op s_addr query_id src_addr src_wc
+    INC	//  op s_addr query_id src_addr _8
+    IFJMP:<{	//  op s_addr query_id src_addr
+      DROP	//  op s_addr query_id
+      4294967294 PUSHINT	//  op s_addr query_id _9=4294967294
+      0 PUSHINT	//  op s_addr query_id _9=4294967294 _10=0
+      s3 s4 XCHG
+      s1 s3 XCHG
+      64 PUSHINT	//  s_addr _9=4294967294 query_id op _10=0 _11=64
+      send_message_back CALLDICT
+    }>	//  op s_addr query_id src_addr
+    c4 PUSH	//  op s_addr query_id src_addr _14
+    CTOS	//  op s_addr query_id src_addr ds
+    LDDICT	//  op s_addr query_id src_addr _18 ds
+    LDDICT	//  op s_addr query_id src_addr elect credits ds
+    s3 s3 XCHG2
+    8 PUSHPOW2	//  op s_addr query_id ds elect src_addr credits _25=256
+    DICTUDELGET
+    NULLSWAPIFNOT	//  op s_addr query_id ds elect credits cs f
+    IFNOTJMP:<{	//  op s_addr query_id ds elect credits cs
+      4 BLKDROP	//  op s_addr query_id
+      4294967294 PUSHINT	//  op s_addr query_id _27=4294967294
+      0 PUSHINT	//  op s_addr query_id _27=4294967294 _28=0
+      s3 s4 XCHG
+      s1 s3 XCHG
+      64 PUSHINT	//  s_addr _27=4294967294 query_id op _28=0 _29=64
+      send_message_back CALLDICT
+    }>	//  op s_addr query_id ds elect credits cs
+    s6 POP	//  cs s_addr query_id ds elect credits
+    s0 s5 XCHG	//  credits s_addr query_id ds elect cs
+    LDGRAMS	//  credits s_addr query_id ds elect amount cs
+    ENDS
+    NEWC	//  credits s_addr query_id ds elect amount _35
+    s1 s2 XCHG	//  credits s_addr query_id ds amount elect _35
+    STDICT	//  credits s_addr query_id ds amount _36
+    s1 s5 XCHG	//  amount s_addr query_id ds credits _36
+    STDICT	//  amount s_addr query_id ds _37
+    SWAP	//  amount s_addr query_id _37 ds
+    STSLICER	//  amount s_addr query_id _38
+    ENDC	//  amount s_addr query_id _39
+    c4 POP
+    4184830756 PUSHINT	//  amount s_addr query_id _41=4184830756
+    0 PUSHINT	//  amount s_addr query_id _41=4184830756 _42=0
+    24 PUSHINT	//  amount s_addr query_id _41=4184830756 _42=0 _43=24
+    NEWC	//  amount s_addr query_id _41=4184830756 _42=0 _43=24 _44
+    6 STU	//  amount s_addr query_id _41=4184830756 _42=0 _46
+    s0 s4 XCHG2	//  amount _42=0 query_id _41=4184830756 _46 s_addr
+    STSLICER	//  amount _42=0 query_id _41=4184830756 _47
+    s0 s4 XCHG2	//  _41=4184830756 _42=0 query_id _47 amount
+    STGRAMS	//  _41=4184830756 _42=0 query_id _48
+    s1 s2 XCHG	//  _41=4184830756 query_id _42=0 _48
+    107 STU	//  _41=4184830756 query_id _62
+    s1 s2 XCHG	//  query_id _41=4184830756 _62
+    32 STU	//  query_id _64
+    64 STU	//  _66
+    ENDC	//  _67
+    64 PUSHINT	//  _67 _68=64
+    SENDRAWMSG
+  }>
+  after_code_upgrade PROC:<{
+    //  s_addr cs query_id
+    NIP	//  s_addr query_id
+    1313042276 PUSHINT	//  s_addr query_id op=1313042276
+    3460525924 PUSHINT	//  s_addr query_id op=1313042276 _5=3460525924
+    0 PUSHINT	//  s_addr query_id op=1313042276 _5=3460525924 _6=0
+    s3 s3 s0 XCHG3
+    64 PUSHINT	//  s_addr _5=3460525924 query_id op=1313042276 _6=0 _7=64
+    send_message_back CALLDICT
+  }>
+  upgrade_code PROC:<{
+    //  s_addr cs query_id
+    0 PUSHINT	//  s_addr cs query_id _4=0
+    CONFIGOPTPARAM	//  s_addr cs query_id c_addr
+    DUP	//  s_addr cs query_id c_addr c_addr
+    ISNULL	//  s_addr cs query_id c_addr _6
+    IFJMP:<{	//  s_addr cs query_id c_addr
+      4 BLKDROP	// 
+      FALSE	//  _7
+    }>	//  s_addr cs query_id c_addr
+    CTOS	//  s_addr cs query_id _9
+    256 PLDU	//  s_addr cs query_id config_addr
+    s3 PUSH	//  s_addr cs query_id config_addr s_addr
+    REWRITESTDADDR	//  s_addr cs query_id config_addr src_wc src_addr
+    SWAP	//  s_addr cs query_id config_addr src_addr src_wc
+    INC	//  s_addr cs query_id config_addr src_addr _16
+    s0 s2 XCHG	//  s_addr cs query_id _16 src_addr config_addr
+    NEQ	//  s_addr cs query_id _16 _17
+    OR	//  s_addr cs query_id _18
+    IFJMP:<{	//  s_addr cs query_id
+      3 BLKDROP	// 
+      FALSE	//  _19
+    }>	//  s_addr cs query_id
+    ACCEPT
+    SWAP	//  s_addr query_id cs
+    LDREF	//  s_addr query_id code cs
+    OVER	//  s_addr query_id code cs code
+    SETCODE
+    DUP	//  s_addr query_id code cs cs
+    SEMPTY	//  s_addr query_id code cs _25
+    IFNOT:<{	//  s_addr query_id code cs
+      SWAP	//  s_addr query_id cs code
+      c3 POP
+      SWAP	//  s_addr cs query_id
+      after_code_upgrade CALLDICT
+      0 THROW
+    }>ELSE<{
+      4 BLKDROP	// 
+    }>
+    TRUE	//  _30
+  }>
+  recv_internal PROC:<{
+    //  msg_value in_msg_cell in_msg
+    SWAP	//  msg_value in_msg in_msg_cell
+    CTOS	//  msg_value in_msg cs
+    4 LDU	//  msg_value in_msg flags cs
+    SWAP
+    1 PUSHINT	//  msg_value in_msg cs flags _9=1
+    AND	//  msg_value in_msg cs _10
+    IFJMP:<{	//  msg_value in_msg cs
+      3 BLKDROP	// 
+    }>	//  msg_value in_msg cs
+    LDMSGADDR	//  msg_value in_msg _61 _60
+    DROP	//  msg_value in_msg s_addr
+    OVER	//  msg_value in_msg s_addr in_msg
+    SEMPTY	//  msg_value in_msg s_addr _14
+    IFJMP:<{	//  msg_value in_msg s_addr
+      NIP	//  msg_value s_addr
+      SWAP	//  s_addr msg_value
+      process_simple_transfer CALLDICT
+    }>	//  msg_value in_msg s_addr
+    SWAP	//  msg_value s_addr in_msg
+    32 LDU	//  msg_value s_addr op in_msg
+    OVER	//  msg_value s_addr op in_msg op
+    0 EQINT	//  msg_value s_addr op in_msg _21
+    IFJMP:<{	//  msg_value s_addr op in_msg
+      2DROP	//  msg_value s_addr
+      SWAP	//  s_addr msg_value
+      process_simple_transfer CALLDICT
+    }>	//  msg_value s_addr op in_msg
+    64 LDU	//  msg_value s_addr op query_id in_msg
+    s2 PUSH
+    1316189259 PUSHINT	//  msg_value s_addr op query_id in_msg op _27=1316189259
+    EQUAL	//  msg_value s_addr op query_id in_msg _28
+    IFJMP:<{	//  msg_value s_addr op query_id in_msg
+      s2 POP	//  msg_value s_addr in_msg query_id
+      s2 s3 XCHG	//  s_addr msg_value in_msg query_id
+      process_new_stake CALLDICT
+    }>	//  msg_value s_addr op query_id in_msg
+    s4 POP	//  in_msg s_addr op query_id
+    OVER
+    1197831204 PUSHINT	//  in_msg s_addr op query_id op _30=1197831204
+    EQUAL	//  in_msg s_addr op query_id _31
+    IFJMP:<{	//  in_msg s_addr op query_id
+      s1 s3 XCHG	//  op s_addr in_msg query_id
+      recover_stake CALLDICT
+    }>	//  in_msg s_addr op query_id
+    OVER
+    1313042276 PUSHINT	//  in_msg s_addr op query_id op _33=1313042276
+    EQUAL	//  in_msg s_addr op query_id _34
+    IFJMP:<{	//  in_msg s_addr op query_id
+      s2 s3 s3 PUXCPU	//  query_id s_addr op s_addr in_msg query_id
+      upgrade_code CALLDICT	//  query_id s_addr op ok
+      IF:<{	//  query_id s_addr op
+        3460525924 PUSHINT	//  query_id s_addr op _37=3460525924
+      }>ELSE<{	//  query_id s_addr op
+        32 PUSHPOW2DEC	//  query_id s_addr op _37=4294967295
+      }>
+      0 PUSHINT	//  query_id s_addr op _37 _40=0
+      s3 s4 XCHG
+      s3 s3 s0 XCHG3
+      64 PUSHINT	//  s_addr _37 query_id op _40=0 _41=64
+      send_message_back CALLDICT
+    }>	//  in_msg s_addr op query_id
+    OVER
+    4000730955 PUSHINT	//  in_msg s_addr op query_id op _44=4000730955
+    EQUAL	//  in_msg s_addr op query_id cfg_ok
+    s2 PUSH
+    4000730991 PUSHINT	//  in_msg s_addr op query_id cfg_ok op _46=4000730991
+    EQUAL	//  in_msg s_addr op query_id cfg_ok _47
+    s1 s(-1) PUXC	//  in_msg s_addr op query_id cfg_ok cfg_ok _47
+    OR	//  in_msg s_addr op query_id cfg_ok _48
+    IFJMP:<{	//  in_msg s_addr op query_id cfg_ok
+      s2 POP	//  in_msg s_addr cfg_ok query_id
+      s2 s3 XCHG
+      SWAP	//  s_addr in_msg query_id cfg_ok
+      config_set_confirmed CALLDICT
+    }>	//  in_msg s_addr op query_id cfg_ok
+    DROP
+    s3 POP	//  query_id s_addr op
+    DUP
+    31 PUSHPOW2	//  query_id s_addr op op _52
+    AND	//  query_id s_addr op _53
+    IFNOTJMP:<{	//  query_id s_addr op
+      32 PUSHPOW2DEC	//  query_id s_addr op _54=4294967295
+      0 PUSHINT	//  query_id s_addr op _54=4294967295 _55=0
+      s3 s4 XCHG
+      s3 s3 s0 XCHG3
+      64 PUSHINT	//  s_addr _54=4294967295 query_id op _55=0 _56=64
+      send_message_back CALLDICT
+    }>	//  query_id s_addr op
+    3 BLKDROP	// 
+  }>
+  postpone_elections PROC:<{
+    // 
+    FALSE	//  _0
+  }>
+  compute_total_stake PROC:<{
+    //  l n m_stake
+    0 PUSHINT	//  l n m_stake tot_stake=0
+    s0 s2 XCHG	//  l tot_stake=0 m_stake n
+    REPEAT:<{	//  l tot_stake m_stake
+      s0 s2 XCHG	//  m_stake tot_stake l
+      UNCONS	//  m_stake tot_stake h l
+      OVER	//  m_stake tot_stake h l h
+      0 INDEX	//  m_stake tot_stake h l stake
+      s0 s2 XCHG	//  m_stake tot_stake stake l h
+      1 INDEX	//  m_stake tot_stake stake l max_f
+      s4 PUSH	//  m_stake tot_stake stake l max_f m_stake
+      MUL	//  m_stake tot_stake stake l _13
+      16 RSHIFT#	//  m_stake tot_stake stake l _15
+      s1 s2 XCHG	//  m_stake tot_stake l stake _15
+      MIN	//  m_stake tot_stake l stake
+      s1 s2 XCHG	//  m_stake l tot_stake stake
+      ADD	//  m_stake l tot_stake
+      ROT	//  l tot_stake m_stake
+    }>
+    DROP
+    NIP	//  tot_stake
+  }>
+  try_elect PROC:<{
+    //  credits members min_stake max_stake min_total_stake max_stake_factor
+    16 PUSHINT	//  credits members min_stake max_stake min_total_stake max_stake_factor _7=16
+    CONFIGOPTPARAM	//  credits members min_stake max_stake min_total_stake max_stake_factor _8
+    CTOS	//  credits members min_stake max_stake min_total_stake max_stake_factor cs
+    16 LDU	//  credits members min_stake max_stake min_total_stake max_stake_factor _13 cs
+    16 LDU	//  credits members min_stake max_stake min_total_stake max_stake_factor _13 _253 _252
+    NIP	//  credits members min_stake max_stake min_total_stake max_stake_factor _13 cs
+    16 LDU	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators cs
+    ENDS
+    1 PUSHINT	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators _23=1
+    MAX	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators
+    0 PUSHINT	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n=0
+    NEWDICT	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n=0 sdict
+    -1 PUSHINT	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n=0 sdict pubkey=-1
+    UNTIL:<{
+      s9 PUSH
+      8 PUSHPOW2	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict pubkey members _33=256
+      DICTUGETNEXT
+      NULLSWAPIFNOT
+      NULLSWAPIFNOT	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict cs pubkey f
+      DUP	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict cs pubkey f f
+      IF:<{	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict cs pubkey f
+        s0 s2 XCHG	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey cs
+        LDGRAMS	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey _40 cs
+        32 LDU	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey _40 _42 cs
+        32 LDU	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey _40 _42 _45 cs
+        256 LDU	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey _40 _42 _45 _48 cs
+        256 LDU	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey stake time max_factor addr adnl_addr cs
+        ENDS
+        s0 s3 XCHG	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey stake adnl_addr max_factor addr time
+        NEGATE	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey stake adnl_addr max_factor addr _56
+        NEWC	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey stake adnl_addr max_factor addr _56 _57
+        s1 s5 XCHG	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey _56 adnl_addr max_factor addr stake _57
+        128 STU	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey _56 adnl_addr max_factor addr _59
+        s1 s4 XCHG	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey addr adnl_addr max_factor _56 _59
+        32 STI	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey addr adnl_addr max_factor _61
+        s4 s(-1) PUXC	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey addr adnl_addr max_factor pubkey _61
+        256 STU	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey addr adnl_addr max_factor _63
+        ENDC	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey addr adnl_addr max_factor _64
+        CTOS	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey addr adnl_addr max_factor key
+        s1 s10 XCPU	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey addr adnl_addr key max_factor max_stake_factor
+        MIN	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey addr adnl_addr key _67
+        NEWC	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey addr adnl_addr key _67 _68
+        32 STU	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey addr adnl_addr key _70
+        s1 s3 XCHG	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey key adnl_addr addr _70
+        256 STU	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey key adnl_addr _72
+        256 STU	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict f pubkey key _74
+        s0 s1 s4 XCHG3
+        416 PUSHINT	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n pubkey f _74 key sdict _79
+        DICTSETB	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n pubkey f sdict
+        s0 s3 XCHG	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators sdict pubkey f n
+        INC	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators sdict pubkey f n
+      }>ELSE<{
+        s3 s4 XCHG
+        2SWAP
+        DROP	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators sdict pubkey f n
+      }>
+      SWAP	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators sdict pubkey n f
+      NOT	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators sdict pubkey n _83
+      s3 s3 s0 XCHG3	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict pubkey _83
+    }>	//  credits members min_stake max_stake min_total_stake max_stake_factor max_validators min_validators n sdict pubkey
+    DROP
+    s4 POP	//  credits members min_stake max_stake min_total_stake sdict max_validators min_validators n
+    ROT	//  credits members min_stake max_stake min_total_stake sdict min_validators n max_validators
+    MIN	//  credits members min_stake max_stake min_total_stake sdict min_validators n
+    s0 s1 PUSH2	//  credits members min_stake max_stake min_total_stake sdict min_validators n n min_validators
+    LESS	//  credits members min_stake max_stake min_total_stake sdict min_validators n _85
+    IFJMP:<{	//  credits members min_stake max_stake min_total_stake sdict min_validators n
+      7 BLKDROP	//  credits
+      NEWDICT	//  credits _86
+      NEWDICT	//  credits _86 _87
+      0 PUSHINT	//  credits _86 _87 _88=0
+      DUP	//  credits _86 _87 _88=0 _89=0
+    }>	//  credits members min_stake max_stake min_total_stake sdict min_validators n
+    PUSHNULL	//  credits members min_stake max_stake min_total_stake sdict min_validators n l
+    UNTIL:<{
+      s0 s3 XCHG
+      416 PUSHINT	//  credits members min_stake max_stake min_total_stake l min_validators n sdict _100
+      DICTREMMIN
+      NULLSWAPIFNOT
+      NULLSWAPIFNOT	//  credits members min_stake max_stake min_total_stake l min_validators n sdict cs key f
+      DUP	//  credits members min_stake max_stake min_total_stake l min_validators n sdict cs key f f
+      IF:<{	//  credits members min_stake max_stake min_total_stake l min_validators n sdict cs key f
+        SWAP	//  credits members min_stake max_stake min_total_stake l min_validators n sdict cs f key
+        128 LDU	//  credits members min_stake max_stake min_total_stake l min_validators n sdict cs f _105 key
+        s1 s9 XCPU	//  credits members min_stake max_stake min_total_stake l min_validators n sdict cs f key _105 max_stake
+        MIN	//  credits members min_stake max_stake min_total_stake l min_validators n sdict cs f key _108
+        SWAP	//  credits members min_stake max_stake min_total_stake l min_validators n sdict cs f _108 key
+        32 LDU	//  credits members min_stake max_stake min_total_stake l min_validators n sdict cs f _108 _279 _278
+        NIP	//  credits members min_stake max_stake min_total_stake l min_validators n sdict cs f _108 key
+        256 PLDU	//  credits members min_stake max_stake min_total_stake l min_validators n sdict cs f stake pubkey
+        s0 s3 XCHG	//  credits members min_stake max_stake min_total_stake l min_validators n sdict pubkey f stake cs
+        32 LDU	//  credits members min_stake max_stake min_total_stake l min_validators n sdict pubkey f stake _117 cs
+        256 LDU	//  credits members min_stake max_stake min_total_stake l min_validators n sdict pubkey f stake _117 _283 _282
+        NIP	//  credits members min_stake max_stake min_total_stake l min_validators n sdict pubkey f stake _117 cs
+        256 PLDU	//  credits members min_stake max_stake min_total_stake l min_validators n sdict pubkey f stake max_f adnl_addr
+        s1 s3 s0 XCHG3
+        s1 s4 XCHG	//  credits members min_stake max_stake min_total_stake l min_validators n sdict f stake max_f pubkey adnl_addr
+        4 TUPLE	//  credits members min_stake max_stake min_total_stake l min_validators n sdict f _125
+        s0 s5 XCHG2	//  credits members min_stake max_stake min_total_stake f min_validators n sdict _125 l
+        CONS	//  credits members min_stake max_stake min_total_stake f min_validators n sdict l
+      }>ELSE<{
+        s6 s1 s6 XCHG3
+        2DROP	//  credits members min_stake max_stake min_total_stake f min_validators n sdict l
+      }>
+      s0 s4 XCHG	//  credits members min_stake max_stake min_total_stake l min_validators n sdict f
+      NOT	//  credits members min_stake max_stake min_total_stake l min_validators n sdict _127
+      s1 s4 XCHG	//  credits members min_stake max_stake min_total_stake sdict min_validators n l _127
+    }>	//  credits members min_stake max_stake min_total_stake sdict min_validators n l
+    s3 POP
+    s4 POP	//  credits members min_stake n min_total_stake l min_validators
+    DEC	//  credits members min_stake n min_total_stake l i
+    2DUP	//  credits members min_stake n min_total_stake l i l1 i
+    REPEAT:<{	//  credits members min_stake n min_total_stake l i l1
+      CDR	//  credits members min_stake n min_total_stake l i l1
+    }>
+    0 PUSHINT	//  credits members min_stake n min_total_stake l i l1 _135=0
+    DUP	//  credits members min_stake n min_total_stake l i l1 best_stake=0 m=0
+    UNTIL:<{
+      s0 s2 XCHG	//  credits members min_stake n min_total_stake l i m best_stake l1
+      UNCONS	//  credits members min_stake n min_total_stake l i m best_stake _138 l1
+      SWAP	//  credits members min_stake n min_total_stake l i m best_stake l1 _138
+      0 INDEX	//  credits members min_stake n min_total_stake l i m best_stake l1 stake
+      s0 s4 XCHG	//  credits members min_stake n min_total_stake l stake m best_stake l1 i
+      INC	//  credits members min_stake n min_total_stake l stake m best_stake l1 i
+      s4 s8 PUSH2	//  credits members min_stake n min_total_stake l stake m best_stake l1 i stake min_stake
+      GEQ	//  credits members min_stake n min_total_stake l stake m best_stake l1 i _144
+      IF:<{	//  credits members min_stake n min_total_stake l stake m best_stake l1 i
+        s5 s(-1) s4 PU2XC	//  credits members min_stake n min_total_stake l i m best_stake l1 l i stake
+        compute_total_stake CALLDICT	//  credits members min_stake n min_total_stake l i m best_stake l1 tot_stake
+        s0 s2 PUSH2	//  credits members min_stake n min_total_stake l i m best_stake l1 tot_stake tot_stake best_stake
+        GREATER	//  credits members min_stake n min_total_stake l i m best_stake l1 tot_stake _147
+        IF:<{	//  credits members min_stake n min_total_stake l i m best_stake l1 tot_stake
+          s2 POP
+          s2 POP	//  credits members min_stake n min_total_stake l i l1 tot_stake
+          s2 PUSH	//  credits members min_stake n min_total_stake l i l1 best_stake m
+        }>ELSE<{
+          s1 s3 XCHG
+          DROP	//  credits members min_stake n min_total_stake l i l1 best_stake m
+        }>
+      }>ELSE<{
+        s3 s4 XCHG2
+        DROP	//  credits members min_stake n min_total_stake l i l1 best_stake m
+      }>
+      s3 s6 PUSH2	//  credits members min_stake n min_total_stake l i l1 best_stake m i n
+      GEQ	//  credits members min_stake n min_total_stake l i l1 best_stake m _148
+    }>	//  credits members min_stake n min_total_stake l i l1 best_stake m
+    s2 POP
+    s2 POP
+    s4 POP
+    s4 POP	//  credits members best_stake m min_total_stake l
+    s2 PUSH	//  credits members best_stake m min_total_stake l m
+    0 EQINT	//  credits members best_stake m min_total_stake l _150
+    s4 s2 PUXC	//  credits members best_stake m _150 l best_stake min_total_stake
+    LESS	//  credits members best_stake m _150 l _151
+    s1 s2 XCHG	//  credits members best_stake m l _150 _151
+    OR	//  credits members best_stake m l _152
+    IFJMP:<{	//  credits members best_stake m l
+      4 BLKDROP	//  credits
+      NEWDICT	//  credits _153
+      NEWDICT	//  credits _153 _154
+      0 PUSHINT	//  credits _153 _154 _155=0
+      DUP	//  credits _153 _154 _155=0 _156=0
+    }>	//  credits members best_stake m l
+    DUP	//  credits members best_stake m l l1
+    s0 DUMP	//  credits members best_stake m l l1
+    s2 PUSH	//  credits members best_stake m l l1 m
+    DEC	//  credits members best_stake m l l1 _161
+    REPEAT:<{	//  credits members best_stake m l l1
+      CDR	//  credits members best_stake m l l1
+    }>
+    CAR	//  credits members best_stake m l _164
+    0 INDEX	//  credits members best_stake m l m_stake
+    0 PUSHINT	//  credits members best_stake m l m_stake i=0
+    DUP	//  credits members best_stake m l m_stake i=0 tot_stake=0
+    NEWDICT	//  credits members best_stake m l m_stake i=0 tot_stake=0 vset
+    NEWDICT	//  credits members best_stake m l m_stake i=0 tot_stake=0 vset frozen
+    UNTIL:<{
+      s0 s5 XCHG	//  credits members best_stake m frozen m_stake i tot_stake vset l
+      UNCONS	//  credits members best_stake m frozen m_stake i tot_stake vset _179 l
+      SWAP	//  credits members best_stake m frozen m_stake i tot_stake vset l _179
+      4 UNTUPLE	//  credits members best_stake m frozen m_stake i tot_stake vset l stake max_f pubkey adnl_addr
+      s1 s12 PUSH2
+      8 PUSHPOW2	//  credits members best_stake m frozen m_stake i tot_stake vset l stake max_f pubkey adnl_addr pubkey members _184=256
+      DICTUGET
+      NULLSWAPIFNOT	//  credits members best_stake m frozen m_stake i tot_stake vset l stake max_f pubkey adnl_addr val f
+      61 THROWIFNOT
+      LDGRAMS	//  credits members best_stake m frozen m_stake i tot_stake vset l stake max_f pubkey adnl_addr _295 _294
+      NIP	//  credits members best_stake m frozen m_stake i tot_stake vset l stake max_f pubkey adnl_addr val
+      64 LDU	//  credits members best_stake m frozen m_stake i tot_stake vset l stake max_f pubkey adnl_addr _297 _296
+      NIP	//  credits members best_stake m frozen m_stake i tot_stake vset l stake max_f pubkey adnl_addr val
+      256 PLDU	//  credits members best_stake m frozen m_stake i tot_stake vset l stake max_f pubkey adnl_addr src_addr
+      s8 s11 PUSH2	//  credits members best_stake m frozen m_stake i tot_stake vset l stake max_f pubkey adnl_addr src_addr i m
+      LESS	//  credits members best_stake m frozen m_stake i tot_stake vset l stake max_f pubkey adnl_addr src_addr _198
+      IF:<{	//  credits members best_stake m frozen m_stake i tot_stake vset l stake max_f pubkey adnl_addr src_addr
+        s3 s9 XCPU	//  credits members best_stake m frozen m_stake i tot_stake vset l stake src_addr pubkey adnl_addr max_f m_stake
+        MUL	//  credits members best_stake m frozen m_stake i tot_stake vset l stake src_addr pubkey adnl_addr _200
+        16 RSHIFT#	//  credits members best_stake m frozen m_stake i tot_stake vset l stake src_addr pubkey adnl_addr _202
+        s4 s(-1) PUXC	//  credits members best_stake m frozen m_stake i tot_stake vset l stake src_addr pubkey adnl_addr stake _202
+        MIN	//  credits members best_stake m frozen m_stake i tot_stake vset l stake src_addr pubkey adnl_addr true_stake
+        s4 s4 XCPU	//  credits members best_stake m frozen m_stake i tot_stake vset l true_stake src_addr pubkey adnl_addr stake true_stake
+        SUB	//  credits members best_stake m frozen m_stake i tot_stake vset l true_stake src_addr pubkey adnl_addr stake
+        s4 PUSH	//  credits members best_stake m frozen m_stake i tot_stake vset l true_stake src_addr pubkey adnl_addr stake true_stake
+        60 LSHIFT#	//  credits members best_stake m frozen m_stake i tot_stake vset l true_stake src_addr pubkey adnl_addr stake _207
+        s13 PUSH	//  credits members best_stake m frozen m_stake i tot_stake vset l true_stake src_addr pubkey adnl_addr stake _207 best_stake
+        DIV	//  credits members best_stake m frozen m_stake i tot_stake vset l true_stake src_addr pubkey adnl_addr stake weight
+        s8 s5 XCPU	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake true_stake
+        ADD	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake
+        2390828938 PUSHINT	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake _211=2390828938
+        s3 PUSH	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake _211=2390828938 adnl_addr
+        IF:<{	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake _211=2390828938
+          115 PUSHINT	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake _211=2390828938 _212=115
+        }>ELSE<{	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake _211=2390828938
+          83 PUSHINT	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake _211=2390828938 _212=83
+        }>
+        NEWC	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake _211=2390828938 _212 _215
+        8 STU	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake _211=2390828938 _217
+        32 STU	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake _219
+        s4 s(-1) PUXC	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake pubkey _219
+        256 STU	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake _221
+        s9 s(-1) PUXC	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake weight _221
+        64 STU	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake vinfo
+        s3 PUSH	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake vinfo adnl_addr
+        IF:<{	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey adnl_addr stake tot_stake vinfo
+          s1 s3 XCHG	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey tot_stake stake adnl_addr vinfo
+          256 STU	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey tot_stake stake vinfo
+        }>ELSE<{
+          s0 s3 XCHG2
+          DROP	//  credits members best_stake m frozen m_stake i weight vset l true_stake src_addr pubkey tot_stake stake vinfo
+        }>
+        SWAP
+        16 PUSHINT
+        s10 s8 s8 PUXC2	//  credits members best_stake m frozen m_stake i weight stake l true_stake src_addr pubkey tot_stake vinfo i vset _228=16
+        DICTUSETB	//  credits members best_stake m frozen m_stake i weight stake l true_stake src_addr pubkey tot_stake vset
+        FALSE	//  credits members best_stake m frozen m_stake i weight stake l true_stake src_addr pubkey tot_stake vset _231
+        s4 PUSH
+        NEWC	//  credits members best_stake m frozen m_stake i weight stake l true_stake src_addr pubkey tot_stake vset _231 src_addr _232
+        256 STU	//  credits members best_stake m frozen m_stake i weight stake l true_stake src_addr pubkey tot_stake vset _231 _234
+        s1 s9 XCHG	//  credits members best_stake m frozen m_stake i _231 stake l true_stake src_addr pubkey tot_stake vset weight _234
+        64 STU	//  credits members best_stake m frozen m_stake i _231 stake l true_stake src_addr pubkey tot_stake vset _236
+        s0 s5 XCHG2	//  credits members best_stake m frozen m_stake i _231 stake l vset src_addr pubkey tot_stake _236 true_stake
+        STGRAMS	//  credits members best_stake m frozen m_stake i _231 stake l vset src_addr pubkey tot_stake _237
+        s1 s7 XCHG	//  credits members best_stake m frozen m_stake i tot_stake stake l vset src_addr pubkey _231 _237
+        1 STI	//  credits members best_stake m frozen m_stake i tot_stake stake l vset src_addr pubkey _239
+        s0 s1 s9 XCHG3
+        8 PUSHPOW2	//  credits members best_stake m src_addr m_stake i tot_stake stake l vset _239 pubkey frozen _240=256
+        DICTUSETB	//  credits members best_stake m src_addr m_stake i tot_stake stake l vset frozen
+      }>ELSE<{
+        s0 s10 XCHG
+        s4 s6 XCHG
+        s0 s3 XCHG
+        3 BLKDROP	//  credits members best_stake m src_addr m_stake i tot_stake stake l vset frozen
+      }>
+      s3 PUSH	//  credits members best_stake m src_addr m_stake i tot_stake stake l vset frozen stake
+      IF:<{	//  credits members best_stake m src_addr m_stake i tot_stake stake l vset frozen
+        s11 s7 s3 XCHG3	//  l members best_stake m vset m_stake i tot_stake frozen credits src_addr stake
+        ~credit_to CALLDICT	//  l members best_stake m vset m_stake i tot_stake frozen credits
+      }>ELSE<{
+        s11 s7 s3 XCHG3
+        2DROP	//  l members best_stake m vset m_stake i tot_stake frozen credits
+      }>
+      s0 s3 XCHG	//  l members best_stake m vset m_stake credits tot_stake frozen i
+      INC	//  l members best_stake m vset m_stake credits tot_stake frozen i
+      s9 PUSH	//  l members best_stake m vset m_stake credits tot_stake frozen i l
+      ISNULL	//  l members best_stake m vset m_stake credits tot_stake frozen i _246
+      s4 s10 XCHG
+      s4 s6 XCHG
+      s4 s4 s0 XCHG3	//  credits members best_stake m l m_stake i tot_stake vset frozen _246
+    }>	//  credits members best_stake m l m_stake i tot_stake vset frozen
+    s3 POP
+    s3 POP
+    s3 POP
+    s5 POP	//  credits frozen best_stake m tot_stake vset
+    s1 s3 PUXC	//  credits frozen vset m tot_stake tot_stake best_stake
+    EQUAL	//  credits frozen vset m tot_stake _248
+    49 THROWIFNOT
+    s2 s3 XCHG
+    SWAP	//  credits vset frozen tot_stake m
+  }>
+  conduct_elections PROC:<{
+    //  ds elect credits
+    SWAP	//  ds credits elect
+    unpack_elect CALLDICT	//  ds credits _130 _131 _132 _133 _134 _135 _136
+    s4 POP	//  ds credits elect_at elect_close finished total_stake members failed
+    NOW	//  ds credits elect_at elect_close finished total_stake members failed _11
+    s5 PUSH	//  ds credits elect_at elect_close finished total_stake members failed _11 elect_close
+    LESS	//  ds credits elect_at elect_close finished total_stake members failed _12
+    IFJMP:<{	//  ds credits elect_at elect_close finished total_stake members failed
+      8 BLKDROP	// 
+      FALSE	//  _13
+    }>	//  ds credits elect_at elect_close finished total_stake members failed
+    0 PUSHINT	//  ds credits elect_at elect_close finished total_stake members failed _14=0
+    CONFIGOPTPARAM	//  ds credits elect_at elect_close finished total_stake members failed _15
+    ISNULL	//  ds credits elect_at elect_close finished total_stake members failed _16
+    IFJMP:<{	//  ds credits elect_at elect_close finished total_stake members failed
+      8 BLKDROP	// 
+      postpone_elections CALLDICT	//  _17
+    }>	//  ds credits elect_at elect_close finished total_stake members failed
+    17 PUSHINT	//  ds credits elect_at elect_close finished total_stake members failed _19=17
+    CONFIGOPTPARAM	//  ds credits elect_at elect_close finished total_stake members failed _20
+    CTOS	//  ds credits elect_at elect_close finished total_stake members failed cs
+    LDGRAMS	//  ds credits elect_at elect_close finished total_stake members failed min_stake cs
+    LDGRAMS	//  ds credits elect_at elect_close finished total_stake members failed min_stake max_stake cs
+    LDGRAMS	//  ds credits elect_at elect_close finished total_stake members failed min_stake max_stake min_total_stake cs
+    32 LDU	//  ds credits elect_at elect_close finished total_stake members failed min_stake max_stake min_total_stake max_stake_factor cs
+    ENDS
+    s6 s1 PUSH2	//  ds credits elect_at elect_close finished total_stake members failed min_stake max_stake min_total_stake max_stake_factor total_stake min_total_stake
+    LESS	//  ds credits elect_at elect_close finished total_stake members failed min_stake max_stake min_total_stake max_stake_factor _35
+    IFJMP:<{	//  ds credits elect_at elect_close finished total_stake members failed min_stake max_stake min_total_stake max_stake_factor
+      12 BLKDROP	// 
+      postpone_elections CALLDICT	//  _36
+    }>	//  ds credits elect_at elect_close finished total_stake members failed min_stake max_stake min_total_stake max_stake_factor
+    s0 s4 XCHG	//  ds credits elect_at elect_close finished total_stake members max_stake_factor min_stake max_stake min_total_stake failed
+    IFJMP:<{	//  ds credits elect_at elect_close finished total_stake members max_stake_factor min_stake max_stake min_total_stake
+      11 BLKDROP	// 
+      postpone_elections CALLDICT	//  _37
+    }>	//  ds credits elect_at elect_close finished total_stake members max_stake_factor min_stake max_stake min_total_stake
+    s0 s6 XCHG	//  ds credits elect_at elect_close min_total_stake total_stake members max_stake_factor min_stake max_stake finished
+    IFJMP:<{	//  ds credits elect_at elect_close min_total_stake total_stake members max_stake_factor min_stake max_stake
+      10 BLKDROP	// 
+      FALSE	//  _38
+    }>	//  ds credits elect_at elect_close min_total_stake total_stake members max_stake_factor min_stake max_stake
+    s3 s8 XCHG
+    s8 PUSH
+    s3 s2 XCPU
+    s7 s7 XCHG2	//  ds members elect_at elect_close min_stake total_stake credits members min_stake max_stake min_total_stake max_stake_factor
+    try_elect CALLDICT	//  ds members elect_at elect_close min_stake total_stake credits vdict frozen total_stakes cnt
+    DUP	//  ds members elect_at elect_close min_stake total_stake credits vdict frozen total_stakes cnt cnt
+    0 EQINT	//  ds members elect_at elect_close min_stake total_stake credits vdict frozen total_stakes cnt failed
+    DUP	//  ds members elect_at elect_close min_stake total_stake credits vdict frozen total_stakes cnt failed failed
+    NOT	//  ds members elect_at elect_close min_stake total_stake credits vdict frozen total_stakes cnt failed finished
+    s10 PUSH
+    s0 s6 XCHG
+    s5 s10 XCHG
+    s4 s9 XCHG
+    s3 s8 XCHG
+    s12 s12 s12 XCHG3	//  ds vdict elect_at frozen total_stakes cnt credits elect_at elect_close min_stake total_stake members failed finished
+    pack_elect CALLDICT	//  ds vdict elect_at frozen total_stakes cnt credits elect
+    s2 PUSH	//  ds vdict elect_at frozen total_stakes cnt credits elect cnt
+    IFNOTJMP:<{	//  ds vdict elect_at frozen total_stakes cnt credits elect
+      s2 POP
+      s2 POP
+      s2 POP
+      s2 POP
+      s2 POP	//  ds elect credits
+      NEWC	//  ds elect credits _48
+      s1 s2 XCHG	//  ds credits elect _48
+      STDICT	//  ds credits _49
+      STDICT	//  ds _50
+      SWAP	//  _50 ds
+      STSLICER	//  _51
+      ENDC	//  _52
+      c4 POP
+      postpone_elections CALLDICT	//  _54
+    }>	//  ds vdict elect_at frozen total_stakes cnt credits elect
+    get_validator_conf CALLDICT	//  ds vdict elect_at frozen total_stakes cnt credits elect _150 _151 _152 _153
+    s2 POP	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held elect_end_before
+    NOW	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held elect_end_before _61
+    SWAP	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held _61 elect_end_before
+    ADD	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held _62
+    -60 ADDCONST	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held _64
+    s8 PUSH	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held _64 elect_at
+    MAX	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start
+    16 PUSHINT	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _67=16
+    CONFIGOPTPARAM	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _68
+    CTOS	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _69
+    16 PUSHINT	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _69 _70=16
+    SDSKIPFIRST	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _71
+    16 PLDU	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start main_validators
+    s6 s(-1) PUXC	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start cnt main_validators
+    MIN	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _75
+    s1 s3 PUSH2	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _75 start elect_for
+    ADD	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _75 _76
+    17 PUSHINT	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _75 _76 _77=17
+    NEWC	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _75 _76 _77=17 _78
+    8 STU	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _75 _76 _80
+    s3 s(-1) PUXC	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _75 _76 start _80
+    32 STU	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _75 _76 _82
+    32 STU	//  ds vdict elect_at frozen total_stakes cnt credits elect elect_for stake_held start _75 _84
+    s1 s7 XCHG	//  ds vdict elect_at frozen total_stakes _75 credits elect elect_for stake_held start cnt _84
+    16 STU	//  ds vdict elect_at frozen total_stakes _75 credits elect elect_for stake_held start _86
+    s1 s6 XCHG	//  ds vdict elect_at frozen total_stakes start credits elect elect_for stake_held _75 _86
+    16 STU	//  ds vdict elect_at frozen total_stakes start credits elect elect_for stake_held _88
+    s0 s9 XCHG	//  ds _88 elect_at frozen total_stakes start credits elect elect_for stake_held vdict
+    CTOS	//  ds _88 elect_at frozen total_stakes start credits elect elect_for stake_held _89
+    s1 s9 XCHG	//  ds stake_held elect_at frozen total_stakes start credits elect elect_for _88 _89
+    STSLICER	//  ds stake_held elect_at frozen total_stakes start credits elect elect_for _90
+    ENDC	//  ds stake_held elect_at frozen total_stakes start credits elect elect_for vset
+    0 PUSHINT	//  ds stake_held elect_at frozen total_stakes start credits elect elect_for vset _93=0
+    CONFIGOPTPARAM	//  ds stake_held elect_at frozen total_stakes start credits elect elect_for vset _94
+    CTOS	//  ds stake_held elect_at frozen total_stakes start credits elect elect_for vset _95
+    256 PLDU	//  ds stake_held elect_at frozen total_stakes start credits elect elect_for vset config_addr
+    s1 s8 PUSH2	//  ds stake_held elect_at frozen total_stakes start credits elect elect_for vset config_addr vset elect_at
+    send_validator_set_to_config CALLDICT
+    s0 s9 XCHG	//  vset stake_held elect_at frozen total_stakes start credits elect elect_for ds
+    LDDICT	//  vset stake_held elect_at frozen total_stakes start credits elect elect_for past_elect ds
+    FALSE	//  vset stake_held elect_at frozen total_stakes start credits elect elect_for past_elect ds _103
+    s0 s11 XCHG	//  _103 stake_held elect_at frozen total_stakes start credits elect elect_for past_elect ds vset
+    HASHCU	//  _103 stake_held elect_at frozen total_stakes start credits elect elect_for past_elect ds _104
+    s6 s3 XCHG2	//  _103 stake_held elect_at frozen total_stakes ds credits elect _104 past_elect start elect_for
+    ADD	//  _103 stake_held elect_at frozen total_stakes ds credits elect _104 past_elect _105
+    s9 PUSH	//  _103 stake_held elect_at frozen total_stakes ds credits elect _104 past_elect _105 stake_held
+    ADD	//  _103 stake_held elect_at frozen total_stakes ds credits elect _104 past_elect _106
+    NEWC	//  _103 stake_held elect_at frozen total_stakes ds credits elect _104 past_elect _106 _107
+    32 STU	//  _103 stake_held elect_at frozen total_stakes ds credits elect _104 past_elect _109
+    s1 s9 XCHG	//  _103 past_elect elect_at frozen total_stakes ds credits elect _104 stake_held _109
+    32 STU	//  _103 past_elect elect_at frozen total_stakes ds credits elect _104 _111
+    256 STU	//  _103 past_elect elect_at frozen total_stakes ds credits elect _113
+    s1 s5 XCHG	//  _103 past_elect elect_at elect total_stakes ds credits frozen _113
+    STDICT	//  _103 past_elect elect_at elect total_stakes ds credits _114
+    s0 s3 XCHG2	//  _103 past_elect elect_at elect credits ds _114 total_stakes
+    STGRAMS	//  _103 past_elect elect_at elect credits ds _115
+    0 PUSHINT	//  _103 past_elect elect_at elect credits ds _115 _116=0
+    STGRAMS	//  _103 past_elect elect_at elect credits ds _117
+    s1 s6 XCHG	//  ds past_elect elect_at elect credits _103 _117
+    1 STI	//  ds past_elect elect_at elect credits _119
+    s0 s3 s4 XCHG3
+    32 PUSHINT	//  ds elect credits _119 elect_at past_elect _120=32
+    DICTUSETB	//  ds elect credits past_elect
+    NEWC	//  ds elect credits past_elect _122
+    s1 s3 XCHG	//  ds past_elect credits elect _122
+    STDICT	//  ds past_elect credits _123
+    STDICT	//  ds past_elect _124
+    STDICT	//  ds _125
+    SWAP	//  _125 ds
+    STSLICER	//  _126
+    ENDC	//  _127
+    c4 POP
+    TRUE	//  _129
+  }>
+  update_active_vset_id PROC:<{
+    // 
+    load_data CALLDICT	//  elect credits past_elect grams active_id active_hash
+    34 PUSHINT	//  elect credits past_elect grams active_id active_hash _8=34
+    CONFIGOPTPARAM	//  elect credits past_elect grams active_id active_hash _9
+    HASHCU	//  elect credits past_elect grams active_id active_hash cur_hash
+    s0 s1 PUSH2	//  elect credits past_elect grams active_id active_hash cur_hash cur_hash active_hash
+    EQUAL	//  elect credits past_elect grams active_id active_hash cur_hash _11
+    IFJMP:<{	//  elect credits past_elect grams active_id active_hash cur_hash
+      7 BLKDROP	// 
+      FALSE	//  _12
+    }>	//  elect credits past_elect grams active_id active_hash cur_hash
+    s2 PUSH	//  elect credits past_elect grams active_id active_hash cur_hash active_id
+    IF:<{	//  elect credits past_elect grams active_id active_hash cur_hash
+      s2 s4 PUSH2
+      32 PUSHINT	//  elect credits past_elect grams active_id active_hash cur_hash active_id past_elect _15=32
+      DICTUGET
+      NULLSWAPIFNOT	//  elect credits past_elect grams active_id active_hash cur_hash fs f
+      IF:<{	//  elect credits past_elect grams active_id active_hash cur_hash fs
+        32 LDU	//  elect credits past_elect grams active_id active_hash cur_hash _99 _98
+        NIP	//  elect credits past_elect grams active_id active_hash cur_hash fs
+        DUP	//  elect credits past_elect grams active_id active_hash cur_hash fs0 fs
+        32 LDU	//  elect credits past_elect grams active_id active_hash cur_hash fs0 _24 fs
+        256 LDU	//  elect credits past_elect grams active_id active_hash cur_hash fs0 _24 _103 _102
+        DROP	//  elect credits past_elect grams active_id active_hash cur_hash fs0 stake_held hash
+        s0 s4 XCHG2	//  elect credits past_elect grams active_id stake_held cur_hash fs0 hash active_hash
+        EQUAL	//  elect credits past_elect grams active_id stake_held cur_hash fs0 _31
+        57 THROWIFNOT
+        NOW	//  elect credits past_elect grams active_id stake_held cur_hash fs0 _33
+        s0 s3 XCHG2	//  elect credits past_elect grams active_id fs0 cur_hash _33 stake_held
+        ADD	//  elect credits past_elect grams active_id fs0 cur_hash unfreeze_time
+        NEWC	//  elect credits past_elect grams active_id fs0 cur_hash unfreeze_time _36
+        32 STU	//  elect credits past_elect grams active_id fs0 cur_hash _38
+        ROT	//  elect credits past_elect grams active_id cur_hash _38 fs0
+        STSLICER	//  elect credits past_elect grams active_id cur_hash _39
+        s0 s0 s4 XCHG3
+        32 PUSHINT	//  elect credits cur_hash grams _39 active_id past_elect _40=32
+        DICTUSETB	//  elect credits cur_hash grams past_elect
+      }>ELSE<{
+        s1 s5 XCHG
+        s1 s3 XCHG
+        3 BLKDROP	//  elect credits cur_hash grams past_elect
+      }>
+    }>ELSE<{
+      s4 s1 s4 XCHG3
+      2DROP	//  elect credits cur_hash grams past_elect
+    }>
+    -1 PUSHINT	//  elect credits cur_hash grams past_elect id=-1
+    UNTIL:<{
+      OVER
+      32 PUSHINT	//  elect credits cur_hash grams past_elect id past_elect _46=32
+      DICTUGETNEXT
+      NULLSWAPIFNOT
+      NULLSWAPIFNOT	//  elect credits cur_hash grams past_elect fs id f
+      DUP	//  elect credits cur_hash grams past_elect fs id f f
+      IF:<{	//  elect credits cur_hash grams past_elect fs id f
+        s0 s2 XCHG	//  elect credits cur_hash grams past_elect f id fs
+        64 LDU	//  elect credits cur_hash grams past_elect f id _50 fs
+        256 LDU	//  elect credits cur_hash grams past_elect f id tm hash fs
+        s1 s7 PUSH2	//  elect credits cur_hash grams past_elect f id tm hash fs hash cur_hash
+        EQUAL	//  elect credits cur_hash grams past_elect f id tm hash fs _56
+        IF:<{	//  elect credits cur_hash grams past_elect f id tm hash fs
+          s4 POP	//  elect credits cur_hash grams past_elect fs id tm hash
+          s0 s3 XCHG	//  elect credits cur_hash grams past_elect hash id tm fs
+          LDDICT	//  elect credits cur_hash grams past_elect hash id tm _60 fs
+          LDGRAMS	//  elect credits cur_hash grams past_elect hash id tm _60 _62 fs
+          LDGRAMS	//  elect credits cur_hash grams past_elect hash id tm dict total_stake bonuses fs
+          s8 PUSH	//  elect credits cur_hash grams past_elect hash id tm dict total_stake bonuses fs grams
+          3 RSHIFT#	//  elect credits cur_hash grams past_elect hash id tm dict total_stake bonuses fs amount
+          s9 s9 XCPU	//  elect credits cur_hash amount past_elect hash id tm dict total_stake bonuses fs grams amount
+          SUB	//  elect credits cur_hash amount past_elect hash id tm dict total_stake bonuses fs grams
+          s2 s9 XCHG2	//  elect credits cur_hash grams past_elect hash id tm dict total_stake fs bonuses amount
+          ADD	//  elect credits cur_hash grams past_elect hash id tm dict total_stake fs bonuses
+          NEWC	//  elect credits cur_hash grams past_elect hash id tm dict total_stake fs bonuses _72
+          s1 s5 XCHG	//  elect credits cur_hash grams past_elect hash id bonuses dict total_stake fs tm _72
+          64 STU	//  elect credits cur_hash grams past_elect hash id bonuses dict total_stake fs _74
+          s1 s6 XCHG	//  elect credits cur_hash grams past_elect fs id bonuses dict total_stake hash _74
+          256 STU	//  elect credits cur_hash grams past_elect fs id bonuses dict total_stake _76
+          s1 s2 XCHG	//  elect credits cur_hash grams past_elect fs id bonuses total_stake dict _76
+          STDICT	//  elect credits cur_hash grams past_elect fs id bonuses total_stake _77
+          SWAP	//  elect credits cur_hash grams past_elect fs id bonuses _77 total_stake
+          STGRAMS	//  elect credits cur_hash grams past_elect fs id bonuses _78
+          SWAP	//  elect credits cur_hash grams past_elect fs id _78 bonuses
+          STGRAMS	//  elect credits cur_hash grams past_elect fs id _79
+          ROT	//  elect credits cur_hash grams past_elect id _79 fs
+          STSLICER	//  elect credits cur_hash grams past_elect id _80
+          SWAP
+          32 PUSHINT
+          s1 s3 s3 PUXC2	//  elect credits cur_hash grams id _80 id past_elect _81=32
+          DICTUSETB	//  elect credits cur_hash grams id past_elect
+          FALSE	//  elect credits cur_hash grams id past_elect f
+        }>ELSE<{
+          s3 s5 XCHG
+          s3 s4 XCHG
+          3 BLKDROP	//  elect credits cur_hash grams id past_elect f
+        }>
+      }>ELSE<{
+        s3 s0 s3 XCHG3
+        DROP	//  elect credits cur_hash grams id past_elect f
+      }>
+      NOT	//  elect credits cur_hash grams id past_elect _84
+      s1 s2 XCHG	//  elect credits cur_hash grams past_elect id _84
+    }>	//  elect credits cur_hash grams past_elect id
+    DUP	//  elect credits cur_hash grams past_elect id id
+    ISNULL	//  elect credits cur_hash grams past_elect id _85
+    IF:<{	//  elect credits cur_hash grams past_elect id
+      DROP	//  elect credits cur_hash grams past_elect
+      0 PUSHINT	//  elect credits cur_hash grams past_elect _86=0
+    }>ELSE<{	//  elect credits cur_hash grams past_elect _86
+    }>	//  elect credits active_hash grams past_elect active_id
+    s0 s3 XCHG2	//  elect credits past_elect grams active_id active_hash
+    store_data CALLDICT
+    TRUE	//  _89
+  }>
+  cell_hash_eq? PROC:<{
+    //  vset expected_vset_hash
+    OVER	//  vset expected_vset_hash vset
+    ISNULL	//  vset expected_vset_hash _2
+    IF:<{	//  vset expected_vset_hash
+      2DROP	// 
+      FALSE	//  _3
+    }>ELSE<{	//  vset expected_vset_hash
+      SWAP	//  expected_vset_hash vset
+      HASHCU	//  expected_vset_hash _5
+      SWAP	//  _5 expected_vset_hash
+      EQUAL	//  _3
+    }>
+  }>
+  validator_set_installed PROC:<{
+    //  ds elect credits
+    SWAP	//  ds credits elect
+    unpack_elect CALLDICT	//  ds credits _44 _45 _46 _47 _48 _49 _50
+    s0 s5 XCHG
+    5 BLKDROP	//  ds credits elect_at finished
+    IFNOTJMP:<{	//  ds credits elect_at
+      3 BLKDROP	// 
+      FALSE	//  _11
+    }>	//  ds credits elect_at
+    s0 s2 XCHG	//  elect_at credits ds
+    LDDICT	//  elect_at credits past_elections ds
+    s3 s1 XCPU
+    32 PUSHINT	//  ds credits past_elections elect_at past_elections _17=32
+    DICTUGET
+    NULLSWAPIFNOT	//  ds credits past_elections fs f
+    IFNOTJMP:<{	//  ds credits past_elections fs
+      4 BLKDROP	// 
+      FALSE	//  _19
+    }>	//  ds credits past_elections fs
+    64 PUSHINT	//  ds credits past_elections fs _21=64
+    SDSKIPFIRST	//  ds credits past_elections _22
+    256 PLDU	//  ds credits past_elections vset_hash
+    34 PUSHINT	//  ds credits past_elections vset_hash _25=34
+    CONFIGOPTPARAM	//  ds credits past_elections vset_hash _26
+    OVER	//  ds credits past_elections vset_hash _26 vset_hash
+    cell_hash_eq? CALLDICT	//  ds credits past_elections vset_hash _27
+    36 PUSHINT	//  ds credits past_elections vset_hash _27 _28=36
+    CONFIGOPTPARAM	//  ds credits past_elections vset_hash _27 _29
+    ROT	//  ds credits past_elections _27 _29 vset_hash
+    cell_hash_eq? CALLDICT	//  ds credits past_elections _27 _30
+    OR	//  ds credits past_elections _31
+    IFJMP:<{	//  ds credits past_elections
+      FALSE	//  ds credits past_elections _32
+      NEWC	//  ds credits past_elections _32 _33
+      1 STI	//  ds credits past_elections _35
+      s1 s2 XCHG	//  ds past_elections credits _35
+      STDICT	//  ds past_elections _36
+      STDICT	//  ds _37
+      SWAP	//  _37 ds
+      STSLICER	//  _38
+      ENDC	//  _39
+      c4 POP
+      update_active_vset_id CALLDICT	//  _41
+      DROP	// 
+      TRUE	//  _42
+    }>	//  ds credits past_elections
+    3 BLKDROP	// 
+    FALSE	//  _43
+  }>
+  check_unfreeze PROC:<{
+    // 
+    load_data CALLDICT	//  elect credits past_elect grams active_id active_hash
+    -1 PUSHINT	//  elect credits past_elect grams active_id active_hash id=-1
+    UNTIL:<{
+      s4 PUSH
+      32 PUSHINT	//  elect credits past_elect grams active_id active_hash id past_elect _11=32
+      DICTUGETNEXT
+      NULLSWAPIFNOT
+      NULLSWAPIFNOT	//  elect credits past_elect grams active_id active_hash fs id f
+      DUP	//  elect credits past_elect grams active_id active_hash fs id f f
+      IF:<{	//  elect credits past_elect grams active_id active_hash fs id f
+        s0 s2 XCHG	//  elect credits past_elect grams active_id active_hash f id fs
+        32 LDU	//  elect credits past_elect grams active_id active_hash f id _39 _38
+        DROP	//  elect credits past_elect grams active_id active_hash f id unfreeze_at
+        NOW	//  elect credits past_elect grams active_id active_hash f id unfreeze_at _17
+        LEQ	//  elect credits past_elect grams active_id active_hash f id _18
+        s1 s4 PUSH2	//  elect credits past_elect grams active_id active_hash f id _18 id active_id
+        NEQ	//  elect credits past_elect grams active_id active_hash f id _18 _19
+        AND	//  elect credits past_elect grams active_id active_hash f id _20
+        IF:<{	//  elect credits past_elect grams active_id active_hash f id
+          NIP	//  elect credits past_elect grams active_id active_hash id
+          s5 s4 s4 XC2PU	//  elect active_hash id grams active_id credits past_elect id
+          unfreeze_all CALLDICT	//  elect active_hash id grams active_id credits past_elect unused_prizes
+          s1 s4 XCHG	//  elect active_hash id past_elect active_id credits grams unused_prizes
+          ADD	//  elect active_hash id past_elect active_id credits grams
+          s6 s1 s3 PUSH3
+          s3 s5 s8 PUSH3	//  elect active_hash id past_elect active_id credits grams elect credits past_elect grams active_id active_hash
+          store_data CALLDICT
+          FALSE	//  elect active_hash id past_elect active_id credits grams f
+        }>ELSE<{
+          s6 s1 s5 XCHG3
+          s4 s4 XCHG2	//  elect active_hash id past_elect active_id credits grams f
+        }>
+      }>ELSE<{
+        s3 s7 XCHG
+        s1 s6 XCHG
+        s5 s0 s5 XCHG3
+        DROP	//  elect active_hash id past_elect active_id credits grams f
+      }>
+      NOT	//  elect active_hash id past_elect active_id credits grams _26
+      s2 s6 XCHG
+      s4 s5 XCHG
+      s1 s4 XCHG	//  elect credits past_elect grams active_id active_hash id _26
+    }>	//  elect credits past_elect grams active_id active_hash id
+    s0 s6 XCHG
+    6 BLKDROP	//  id
+    ISNULL	//  _27
+    NOT	//  _28
+  }>
+  announce_new_elections PROC:<{
+    //  ds elect credits
+    NIP	//  ds credits
+    36 PUSHINT	//  ds credits _4=36
+    CONFIGOPTPARAM	//  ds credits next_vset
+    ISNULL	//  ds credits _6
+    IFNOTJMP:<{	//  ds credits
+      2DROP	// 
+      FALSE	//  _7
+    }>	//  ds credits
+    1 PUSHINT	//  ds credits _9=1
+    CONFIGOPTPARAM	//  ds credits _10
+    CTOS	//  ds credits _11
+    256 PLDU	//  ds credits elector_addr
+    MYADDR	//  ds credits elector_addr _16
+    REWRITESTDADDR	//  ds credits elector_addr my_wc my_addr
+    SWAP	//  ds credits elector_addr my_addr my_wc
+    INC	//  ds credits elector_addr my_addr _19
+    s0 s2 XCHG	//  ds credits _19 my_addr elector_addr
+    NEQ	//  ds credits _19 _20
+    OR	//  ds credits _21
+    IFJMP:<{	//  ds credits
+      2DROP	// 
+      FALSE	//  _22
+    }>	//  ds credits
+    34 PUSHINT	//  ds credits _24=34
+    CONFIGOPTPARAM	//  ds credits cur_vset
+    DUP	//  ds credits cur_vset cur_vset
+    ISNULL	//  ds credits cur_vset _26
+    IFJMP:<{	//  ds credits cur_vset
+      3 BLKDROP	// 
+      FALSE	//  _27
+    }>	//  ds credits cur_vset
+    get_validator_conf CALLDICT	//  ds credits cur_vset _76 _77 _78 _79
+    DROP
+    s2 POP	//  ds credits cur_vset elect_end_before elect_begin_before
+    s0 s2 XCHG	//  ds credits elect_begin_before elect_end_before cur_vset
+    CTOS	//  ds credits elect_begin_before elect_end_before _34
+    40 PUSHINT	//  ds credits elect_begin_before elect_end_before _34 _37
+    SDSKIPFIRST	//  ds credits elect_begin_before elect_end_before _38
+    32 PLDU	//  ds credits elect_begin_before elect_end_before cur_valid_until
+    NOW	//  ds credits elect_begin_before elect_end_before cur_valid_until t
+    s1 s3 XCPU	//  ds credits elect_begin_before elect_end_before t cur_valid_until elect_begin_before
+    SUB	//  ds credits elect_begin_before elect_end_before t t0
+    2DUP	//  ds credits elect_begin_before elect_end_before t t0 t t0
+    LESS	//  ds credits elect_begin_before elect_end_before t t0 _45
+    IFJMP:<{	//  ds credits elect_begin_before elect_end_before t t0
+      6 BLKDROP	// 
+      FALSE	//  _46
+    }>	//  ds credits elect_begin_before elect_end_before t t0
+    2DUP	//  ds credits elect_begin_before elect_end_before t t0 t t0
+    SUB	//  ds credits elect_begin_before elect_end_before t t0 _47
+    60 LESSINT	//  ds credits elect_begin_before elect_end_before t t0 _49
+    IF:<{	//  ds credits elect_begin_before elect_end_before t t0
+      NIP	//  ds credits elect_begin_before elect_end_before t
+    }>ELSE<{
+      DROP	//  ds credits elect_begin_before elect_end_before t
+    }>
+    17 PUSHINT	//  ds credits elect_begin_before elect_end_before t _52=17
+    CONFIGOPTPARAM	//  ds credits elect_begin_before elect_end_before t _53
+    CTOS	//  ds credits elect_begin_before elect_end_before t _54
+    LDGRAMS	//  ds credits elect_begin_before elect_end_before t _81 _80
+    DROP	//  ds credits elect_begin_before elect_end_before t min_stake
+    s0 s3 XCHG	//  ds credits min_stake elect_end_before t elect_begin_before
+    ADD	//  ds credits min_stake elect_end_before elect_at
+    s0 DUMP	//  ds credits min_stake elect_end_before elect_at
+    s0 s1 PUXC	//  ds credits min_stake elect_at elect_at elect_end_before
+    SUB	//  ds credits min_stake elect_at elect_close
+    0 PUSHINT	//  ds credits min_stake elect_at elect_close _62=0
+    NEWDICT	//  ds credits min_stake elect_at elect_close _62=0 _63
+    FALSE	//  ds credits min_stake elect_at elect_close _62=0 _63 _64
+    s4 s5 XCHG
+    s3 s4 XCHG
+    FALSE	//  ds credits elect_at elect_close min_stake _62=0 _63 _64 _65
+    pack_elect CALLDICT	//  ds credits elect
+    NEWC	//  ds credits elect _67
+    STDICT	//  ds credits _68
+    STDICT	//  ds _69
+    SWAP	//  _69 ds
+    STSLICER	//  _70
+    ENDC	//  _71
+    c4 POP
+    TRUE	//  _73
+  }>
+  run_ticktock PROC:<{
+    //  is_tock
+    DROP	// 
+    c4 PUSH	//  _2
+    CTOS	//  ds
+    LDDICT	//  _6 ds
+    LDDICT	//  elect credits ds
+    s2 PUSH	//  elect credits ds elect
+    ISNULL	//  elect credits ds _10
+    IF:<{	//  elect credits ds
+      -ROT	//  ds elect credits
+      announce_new_elections CALLDICT	//  _18
+      0 THROWIF
+    }>ELSE<{	//  elect credits ds
+      s0 s2 s1 PUSH3	//  elect credits ds ds elect credits
+      conduct_elections CALLDICT	//  elect credits ds _12
+      0 THROWIF
+      -ROT	//  ds elect credits
+      validator_set_installed CALLDICT	//  _15
+      0 THROWIF
+    }>
+    update_active_vset_id CALLDICT	//  _21
+    0 THROWIF
+    check_unfreeze CALLDICT	//  _23
+    DROP	// 
+  }>
+  active_election_id PROC:<{
+    // 
+    c4 PUSH	//  _1
+    CTOS	//  _2
+    PLDDICT	//  elect
+    DUP	//  elect elect
+    ISNULL	//  elect _4
+    IF:<{	//  elect
+      DROP	// 
+      0 PUSHINT	//  _5=0
+    }>ELSE<{	//  elect
+      CTOS	//  _7
+      32 PLDU	//  _5
+    }>
+  }>
+  participates_in PROC:<{
+    //  validator_pubkey
+    c4 PUSH	//  validator_pubkey _2
+    CTOS	//  validator_pubkey _3
+    PLDDICT	//  validator_pubkey elect
+    DUP	//  validator_pubkey elect elect
+    ISNULL	//  validator_pubkey elect _5
+    IFJMP:<{	//  validator_pubkey elect
+      2DROP	// 
+      0 PUSHINT	//  _6=0
+    }>	//  validator_pubkey elect
+    unpack_elect CALLDICT	//  validator_pubkey _23 _24 _25 _26 _27 _28 _29
+    s2 s6 XCHG
+    6 BLKDROP	//  validator_pubkey members
+    8 PUSHPOW2	//  validator_pubkey members _17=256
+    DICTUGET
+    NULLSWAPIFNOT	//  mem found
+    IF:<{	//  mem
+      LDGRAMS	//  _33 _32
+      DROP	//  _19
+    }>ELSE<{	//  mem
+      DROP	// 
+      0 PUSHINT	//  _19=0
+    }>
+  }>
+  participant_list PROC:<{
+    // 
+    c4 PUSH	//  _1
+    CTOS	//  _2
+    PLDDICT	//  elect
+    DUP	//  elect elect
+    ISNULL	//  elect _4
+    IFJMP:<{	//  elect
+      DROP	// 
+      PUSHNULL	//  _5
+    }>	//  elect
+    unpack_elect CALLDICT	//  _35 _36 _37 _38 _39 _40 _41
+    s2 s6 XCHG
+    6 BLKDROP	//  members
+    PUSHNULL	//  members l
+    256 PUSHPOW2DEC	//  members l id
+    UNTIL:<{
+      s2 PUSH
+      8 PUSHPOW2	//  members l id members _28=256
+      DICTUGETPREV
+      NULLSWAPIFNOT
+      NULLSWAPIFNOT	//  members l fs id f
+      DUP	//  members l fs id f f
+      IF:<{	//  members l fs id f
+        s0 s2 XCHG	//  members l f id fs
+        LDGRAMS	//  members l f id _46 _45
+        DROP	//  members l f id _30
+        s1 s(-1) PUXC	//  members l f id id _30
+        PAIR	//  members l f id _32
+        s0 s3 XCHG2	//  members id f _32 l
+        CONS	//  members id f l
+      }>ELSE<{
+        2SWAP
+        DROP	//  members id f l
+      }>
+      SWAP	//  members id l f
+      NOT	//  members id l _34
+      s1 s2 XCHG	//  members l id _34
+    }>	//  members l id
+    DROP
+    NIP	//  l
+  }>
+  compute_returned_stake PROC:<{
+    //  wallet_addr
+    c4 PUSH	//  wallet_addr _2
+    CTOS	//  wallet_addr cs
+    LDDICT	//  wallet_addr _19 _18
+    NIP	//  wallet_addr cs
+    LDDICT	//  wallet_addr _21 _20
+    DROP	//  wallet_addr credits
+    8 PUSHPOW2	//  wallet_addr credits _12=256
+    DICTUGET
+    NULLSWAPIFNOT	//  val f
+    IF:<{	//  val
+      LDGRAMS	//  _25 _24
+      DROP	//  _14
+    }>ELSE<{	//  val
+      DROP	// 
+      0 PUSHINT	//  _14=0
+    }>
+  }>
+}END>c
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/gen-zerostate-test.fif b/submodules/ton/tonlib-src/crypto/smartcont/gen-zerostate-test.fif
new file mode 100644
index 0000000000..58161a2318
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/gen-zerostate-test.fif
@@ -0,0 +1,238 @@
+"TonUtil.fif" include
+"Asm.fif" include
+
+def? $1 { @' $1 } { "" } cond constant suffix 
+{ suffix $+ } : +suffix
+
+wc_master setworkchain
+-17 setglobalid   // negative value means a test instance of the blockchain
+
+// Initial state of Workchain 0 (Basic workchain)
+
+0 mkemptyShardState 
+
+cr ."initial basechain state is:" cr dup <s csr. cr
+dup dup 31 boc+>B dup Bx. cr
+dup "basestate0" +suffix +".boc" tuck B>file
+."(Initial basechain state saved to file " type .")" cr
+Bhash dup =: basestate0_fhash
+."file hash=" dup x. space 256 u>B dup B>base64url type cr
+"basestate0" +suffix +".fhash" B>file
+hash dup =: basestate0_rhash
+."root hash=" dup x. space 256 u>B dup B>base64url type cr
+"basestate0" +suffix +".rhash" B>file
+
+basestate0_rhash basestate0_fhash now 0 2 32 0 add-std-workchain
+config.workchains!
+
+// SmartContract #1 (Simple wallet)
+
+<{  SETCP0 DUP IFNOTRET INC 32 THROWIF  // return if recv_internal, fail unless recv_external
+    512 INT LDSLICEX DUP 32 PLDU   // sign cs cnt
+    c4 PUSHCTR CTOS 32 LDU 256 LDU ENDS  // sign cs cnt cnt' pubk
+    s1 s2 XCPU            // sign cs cnt pubk cnt' cnt
+    EQUAL 33 THROWIFNOT   // ( seqno mismatch? )
+    s2 PUSH HASHSU        // sign cs cnt pubk hash
+    s0 s4 s4 XC2PU        // pubk cs cnt hash sign pubk
+    CHKSIGNU              // pubk cs cnt ?
+    34 THROWIFNOT         // signature mismatch
+    ACCEPT
+    SWAP 32 LDU NIP 8 LDU LDREF ENDS      // pubk cnt mode msg
+    SWAP SENDRAWMSG       // pubk cnt ; ( message sent )
+    INC NEWC 32 STU 256 STU ENDC c4 POPCTR
+}>c
+// code
+<b 0 32 u, 
+   "main-wallet" +suffix +".pk" load-generate-keypair drop
+   B, 
+b> // data
+Libs{
+  x{ABACABADABACABA} s>c public_lib
+  x{1234} x{5678} |_ s>c private_lib
+}Libs  // libraries
+GR$1700000000 // balance
+0 // split_depth
+0 // ticktock
+2 // mode: create
+register_smc
+dup make_special dup constant smc1_addr  
+Masterchain over 
+2dup ."wallet address = " .addr cr 2dup 6 .Addr cr
+"main-wallet" +suffix +".addr" save-address-verbose
+
+// SmartContract #2 (Simple money giver for test network)
+<{ SETCP0 DUP IFNOTRET INC 32 THROWIF  // return if recv_internal, fail unless recv_external
+   32 LDU SWAP                         // cs cnt
+   c4 PUSHCTR CTOS 32 LDU ENDS         // cs cnt cnt'
+   TUCK EQUAL 33 THROWIFNOT            // ( seqno mismatch? )
+   ACCEPT                              // cs cnt'
+   SWAP 8 LDU LDREF ENDS               // cnt'' mode msg
+   GR$20 INT 3 INT RAWRESERVE          // reserve all but 20 Grams from the balance
+   SWAP SENDRAWMSG
+   INC NEWC 32 STU ENDC c4 POPCTR      // store cnt''
+}>c
+// code
+<b 0 32 u, b> // data
+empty_cell    // libraries
+GR$1000000    // initial balance (1m test Grams)
+0 0 2 register_smc
+dup make_special dup constant smc2_addr
+Masterchain over 
+2dup ."free test gram giver address = " .addr cr 2dup 6 .Addr cr
+"testgiver" +suffix +".addr" save-address-verbose
+
+// SmartContract #3
+PROGRAM{
+  recv_internal x{} PROC
+  run_ticktock PROC:<{
+    c4 PUSHCTR CTOS 32 LDU 256 LDU ENDS
+    NEWC ROT INC 32 STUR OVER 256 STUR ENDC
+    c4 POPCTR
+    // first 32 bits of persistent data have been increased
+    // remaining 256 bits with an address have been fetched
+    // create new empty message with 0.1 Grams to that address
+    NEWC b{00100010011111111} STSLICECONST TUCK 256 STU
+    100000000 INT STGRAMS  // store 0.1 Grams
+    1 4 + 4 + 64 + 32 + 1+ 1+ INT STZEROES ENDC
+    // send raw message from Cell
+    ZERO SENDRAWMSG
+    -17 INT 256 STIR 130000000 INT STGRAMS
+    107 INT STZEROES ENDC 
+    ZERO // another message with 0.13 Grams to account -17
+    NEWC b{11000100100000} "test" $>s |+ STSLICECONST
+    123456789 INT STGRAMS
+    107 INT STZEROES "Hello, world!" $>s STSLICECONST ENDC
+    ZERO SENDRAWMSG SENDRAWMSG // external message to address "test"
+  }>
+}END>c
+// code
+<b x{11EF55AA} s, smc1_addr 256 u, b> // data
+// empty_cell // libraries
+Libs{
+  x{ABACABADABACABA} s>c public_lib
+  x{1234} x{5678} |_ s>c public_lib
+}Libs  // libraries
+0x333333333 // balance
+0 // split_depth
+3 // ticktock: tick
+2 // mode: create
+register_smc
+dup make_special dup constant smc3_addr
+."address = " x. cr
+
+// SmartContract #4 (elector)
+"elector-code.fif" include   // code in separate source file
+<b 0 1 1+ 1+ 5 + u, 0 256 u, b>  // data
+GR$10  // balance: 10 grams
+0 // split_depth
+1 // ticktock: tick
+2 // mode: create
+register_smc
+dup make_special dup constant smc4_addr dup constant elector_addr
+
+// Configuration Parameters
+
+// max-validators max-main-validators min-validators
+// 9 3 2 config.validator_num!
+1000 100 5 config.validator_num!
+// min-stake max-stake min-total-stake max-factor
+GR$10000 GR$10000000 GR$1000000 sg~10 config.validator_stake_limits!
+// elected-for elect-start-before elect-end-before stakes-frozen-for
+400000 200000 4000 400000 config.election_params!
+// elector-addr
+elector_addr config.elector_smc!
+
+1 sg* 100 sg* 1000 sg* 1000000 sg* config.storage_prices!
+config.special!
+
+// gas_price gas_limit gas_credit block_gas_limit freeze_due_limit delete_due_limit -- 
+1000 sg* 1000000 10000 10000000 GR$0.1 GR$1.0 config.gas_prices!
+10000 sg* 1000000 10000 10000000 GR$0.1 GR$1.0 config.mc_gas_prices!
+// lump_price bit_price cell_price ihr_factor first_frac next_frac
+1000000 1000 sg* 100000 sg* 3/2 sg*/ 1/3 sg*/ 1/3 sg*/ config.fwd_prices!
+10000000 10000 sg* 1000000 sg* 3/2 sg*/ 1/3 sg*/ 1/3 sg*/ config.mc_fwd_prices!
+// mc-cc-lifetime sh-cc-lifetime sh-val-lifetime sh-val-num
+250 250 1000 7 config.catchain_params!
+
+128 *Ki 512 *Ki 1 *Mi triple  // [ underload soft hard ] : block bytes limit
+100000 500000 1000000 triple  // gas limits
+1000 5000 10000 triple        // lt limits
+triple dup untriple config.mc_block_limits!
+untriple config.block_limits!
+
+GR$1.7 GR$1 config.block_create_fees!
+smc1_addr config.collector_smc!
+smc1_addr config.minter_smc!
+
+1000000000000 -17 of-cc 666666666666 239 of-cc cc+ config.to_mint!
+
+"validator-keys" +suffix +".pub" file>B
+{ dup Blen } { 32 B| swap dup ."Validator public key = " Bx. cr
+  17 add-validator } while drop
+// newkeypair nip dup ."Validator #1 public key = " Bx. cr 
+// 17 add-validator
+// newkeypair nip dup ."Validator #2 public key = " Bx. cr
+// 239 add-validator
+now dup 1000000 + 0 config.validators!
+
+// SmartContract #5 (Config)
+PROGRAM{
+  recv_internal x{} PROC
+  recv_external PROC:<{
+    512 INT LDSLICEX DUP 32 LDU 32 PLDU   // sign cs cnt valid-until
+    NOW LEQ 35 THROWIF    // ( fail if now >= valid-until )   
+    c4 PUSH CTOS LDREF 32 LDU 256 LDU ENDS  // sign cs cnt dict cnt' pubk
+    s1 s3 XCPU            // sign cs cnt dict pubk cnt' cnt 
+    EQUAL 33 THROWIFNOT   // ( seqno mismatch? )
+    s3 PUSH HASHSU        // sign cs cnt dict pubk hash
+    s0 s5 s5 XC2PU        // pubk cs cnt dict hash sign pubk
+    CHKSIGNU              // pubk cs cnt dict ?
+    34 THROWIFNOT         // signature mismatch
+    ACCEPT
+    ROT 64 LDU NIP 32 LDI LDREF ENDS      // pubk cnt dict index value
+    s0 s2 XCHG 32 INT     // pubk cnt value index dict 32
+    DICTISETREF ROTREV    // dict' pubk cnt
+    INC NEWC 32 STU 256 STU STREF ENDC c4 POP
+  }>
+  run_ticktock PROC:<{
+    // store (now >> 8) into config param #-17, if the new value is different
+    c4 PUSH CTOS LDREF SWAP  // s' D
+    NOW 8 RSHIFT# TUCK       // s' t D t
+    NEWC 32 STU ENDC         // s' t D c
+    -17 INT ROT 32 INT       // s' t c -17 D 32 
+    DICTISETGETREF           // s' t D' c' -1 or s' t D' 0
+    IF:<{ CTOS 32 LDU ENDS }>ELSE<{ ZERO }>  // s' t D' y'
+    ROT EQUAL IFNOT:         // s' D'
+    NEWC STREF STSLICE ENDC  // c
+    c4 POP
+  }>
+}END>c
+// code
+<b 0 32 u, 
+   "config-master" +suffix +".pk" load-generate-keypair drop
+   B,
+   configdict ref,
+b> // data
+empty_cell  // libraries
+1  // balance
+0 1 2 register_smc  // tock
+dup set_config_smc
+Masterchain swap
+."config smart contract address = " 2dup .addr cr 2dup 7 .Addr cr
+"config-master" +suffix +".addr" save-address-verbose
+// Other data
+
+create_state
+cr cr ."new state is:" cr dup <s csr. cr
+dup 31 boc+>B dup Bx. cr
+dup "zerostate" +suffix +".boc" tuck B>file
+."(Initial masterchain state saved to file " type .")" cr
+Bhash dup =: zerostate_fhash
+."file hash=" dup x. space 256 u>B dup B>base64url type cr
+"zerostate" +suffix +".fhash" B>file
+hash dup =: zerostate_rhash ."root hash=" dup x. space 256 u>B dup B>base64url type cr
+"zerostate" +suffix +".rhash" B>file
+basestate0_rhash ."Basestate0 root hash=" dup x. space 256 u>B B>base64url type cr
+basestate0_fhash ."Basestate0 file hash=" dup x. space 256 u>B B>base64url type cr
+zerostate_rhash ."Zerostate root hash=" dup x. space 256 u>B B>base64url type cr
+zerostate_fhash ."Zerostate file hash=" dup x. space 256 u>B B>base64url type cr
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/gen-zerostate.fif b/submodules/ton/tonlib-src/crypto/smartcont/gen-zerostate.fif
new file mode 100644
index 0000000000..16db6296dc
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/gen-zerostate.fif
@@ -0,0 +1,241 @@
+"TonUtil.fif" include
+"Asm.fif" include
+
+def? $1 { @' $1 } { "" } cond constant suffix 
+{ suffix $+ } : +suffix
+
+wc_master setworkchain
+-17 setglobalid   // negative value means a test instance of the blockchain
+
+// Initial state of Workchain 0 (Basic workchain)
+
+0 mkemptyShardState 
+
+cr ."initial basechain state is:" cr dup <s csr. cr
+dup dup 31 boc+>B dup Bx. cr
+dup "basestate0" +suffix +".boc" tuck B>file
+."(Initial basechain state saved to file " type .")" cr
+Bhash dup =: basestate0_fhash
+."file hash=" dup x. space 256 u>B dup B>base64url type cr
+"basestate0" +suffix +".fhash" B>file
+hash dup =: basestate0_rhash
+."root hash=" dup x. space 256 u>B dup B>base64url type cr
+"basestate0" +suffix +".rhash" B>file
+
+basestate0_rhash basestate0_fhash now 0 2 32 0 add-std-workchain
+config.workchains!
+
+// SmartContract #1 (Simple wallet)
+
+<{ SETCP0 DUP IFNOTRET // return if recv_internal
+   DUP 85143 INT EQUAL IFJMP:<{ // "seqno" get-method
+     DROP c4 PUSHCTR CTOS 32 PLDU  // cnt
+   }>
+   INC 32 THROWIF  // fail unless recv_external
+   512 INT LDSLICEX DUP 32 PLDU   // sign cs cnt
+   c4 PUSHCTR CTOS 32 LDU 256 LDU ENDS  // sign cs cnt cnt' pubk
+   s1 s2 XCPU            // sign cs cnt pubk cnt' cnt
+   EQUAL 33 THROWIFNOT   // ( seqno mismatch? )
+   s2 PUSH HASHSU        // sign cs cnt pubk hash
+   s0 s4 s4 XC2PU        // pubk cs cnt hash sign pubk
+   CHKSIGNU              // pubk cs cnt ?
+   34 THROWIFNOT         // signature mismatch
+   ACCEPT
+   SWAP 32 LDU NIP 8 LDU LDREF ENDS      // pubk cnt mode msg
+   SWAP SENDRAWMSG       // pubk cnt ; ( message sent )
+   INC NEWC 32 STU 256 STU ENDC c4 POPCTR
+}>c
+// code
+<b 0 32 u, 
+   "main-wallet" +suffix +".pk" load-generate-keypair drop
+   B, 
+b> // data
+Libs{
+  x{ABACABADABACABA} s>c public_lib
+  x{1234} x{5678} |_ s>c private_lib
+}Libs  // libraries
+GR$1700000000 // balance
+0 // split_depth
+0 // ticktock
+2 // mode: create
+register_smc
+dup make_special dup constant smc1_addr  
+Masterchain over 
+2dup ."wallet address = " .addr cr 2dup 6 .Addr cr
+"main-wallet" +suffix +".addr" save-address-verbose
+
+// SmartContract #2 (Simple money giver for test network)
+<{ SETCP0 DUP IFNOTRET // return if recv_internal
+   DUP 85143 INT EQUAL IFJMP:<{ // "seqno" get-method
+     DROP c4 PUSHCTR CTOS 32 PLDU  // cnt
+   }>
+   32 LDU SWAP                         // cs cnt
+   c4 PUSHCTR CTOS 32 LDU ENDS         // cs cnt cnt'
+   TUCK EQUAL 33 THROWIFNOT            // ( seqno mismatch? )
+   ACCEPT                              // cs cnt'
+   SWAP 8 LDU LDREF ENDS               // cnt'' mode msg
+   GR$20 INT 3 INT RAWRESERVE          // reserve all but 20 Grams from the balance
+   SWAP SENDRAWMSG
+   INC NEWC 32 STU ENDC c4 POPCTR      // store cnt''
+}>c
+// code
+<b 0 32 u, b> // data
+empty_cell    // libraries
+GR$1000000    // initial balance (1m test Grams)
+0 0 2 register_smc
+dup make_special dup constant smc2_addr
+Masterchain over 
+2dup ."free test gram giver address = " .addr cr 2dup 6 .Addr cr
+"testgiver" +suffix +".addr" save-address-verbose
+
+// SmartContract #3
+PROGRAM{
+  recv_internal x{} PROC
+  run_ticktock PROC:<{
+    c4 PUSHCTR CTOS 32 LDU 256 LDU ENDS
+    NEWC ROT INC 32 STUR OVER 256 STUR ENDC
+    c4 POPCTR
+    // first 32 bits of persistent data have been increased
+    // remaining 256 bits with an address have been fetched
+    // create new empty message with 0.1 Grams to that address
+    NEWC b{00100010011111111} STSLICECONST TUCK 256 STU
+    100000000 INT STGRAMS  // store 0.1 Grams
+    1 4 + 4 + 64 + 32 + 1+ 1+ INT STZEROES ENDC
+    // send raw message from Cell
+    ZERO SENDRAWMSG
+    -17 INT 256 STIR 130000000 INT STGRAMS
+    107 INT STZEROES ENDC 
+    ZERO // another message with 0.13 Grams to account -17
+    NEWC b{11000100100000} "test" $>s |+ STSLICECONST
+    123456789 INT STGRAMS
+    107 INT STZEROES "Hello, world!" $>s STSLICECONST ENDC
+    ZERO SENDRAWMSG SENDRAWMSG // external message to address "test"
+  }>
+}END>c
+// code
+<b x{11EF55AA} s, smc1_addr 256 u, b> // data
+// empty_cell // libraries
+Libs{
+  x{ABACABADABACABA} s>c public_lib
+  x{1234} x{5678} |_ s>c public_lib
+}Libs  // libraries
+0x333333333 // balance
+0 // split_depth
+3 // ticktock: tick
+2 // mode: create
+register_smc
+dup make_special dup constant smc3_addr
+."address = " x. cr
+
+/*
+ *
+ * SmartContract #4 (elector)
+ *
+ */
+"elector-code.fif" include   // code in separate source file
+<b 0 1 1+ 1+ 4 + 32 + u, 0 256 u, b>  // data: dict dict dict grams uint32 uint256
+empty_cell  // libraries
+GR$10  // balance: 10 grams
+0 // split_depth
+2 // ticktock: tick
+2 // mode: create
+register_smc
+dup make_special dup constant smc4_addr dup constant elector_addr
+Masterchain swap
+."elector smart contract address = " 2dup .addr cr 2dup 7 .Addr cr
+"elector" +suffix +".addr" save-address-verbose
+
+/*
+ *
+ * Configuration Parameters
+ *
+ */
+// version capabilities
+0 capCreateStats config.version!
+// max-validators max-main-validators min-validators
+// 9 4 1 config.validator_num!
+1000 100 5 config.validator_num!
+// min-stake max-stake min-total-stake max-factor
+GR$10000 GR$10000000 GR$1000000 sg~10 config.validator_stake_limits!
+// elected-for elect-start-before elect-end-before stakes-frozen-for
+// 400000 200000 4000 400000 config.election_params!
+4000 2000 500 1000 config.election_params!  // DEBUG
+// config-addr = -1:5555...5555
+256 1<<1- 3 / constant config_addr
+config_addr config.config_smc!
+// elector-addr
+elector_addr config.elector_smc!
+
+// 1 sg* 100 sg* 1000 sg* 1000000 sg* config.storage_prices!  // old values (too high)
+1 500 1000 500000 config.storage_prices!
+config.special!
+
+// gas_price gas_limit special_gas_limit gas_credit block_gas_limit freeze_due_limit delete_due_limit -- 
+1000 sg* 1 *M dup 10000 10 *M GR$0.1 GR$1.0 config.gas_prices!
+10000 sg* 1 *M 10 *M 10000 10 *M GR$0.1 GR$1.0 config.mc_gas_prices!
+// lump_price bit_price cell_price ihr_factor first_frac next_frac
+1000000 1000 sg* 100000 sg* 3/2 sg*/ 1/3 sg*/ 1/3 sg*/ config.fwd_prices!
+10000000 10000 sg* 1000000 sg* 3/2 sg*/ 1/3 sg*/ 1/3 sg*/ config.mc_fwd_prices!
+// mc-cc-lifetime sh-cc-lifetime sh-val-lifetime sh-val-num
+250 250 1000 7 config.catchain_params!
+// round-candidates next-cand-delay-ms consensus-timeout-ms fast-attempts attempt-duration cc-max-deps max-block-size max-collated-size
+3 2000 16000 3 8 4 2 *Mi 2 *Mi config.consensus_params!
+
+
+128 *Ki 512 *Ki 1 *Mi triple  // [ underload soft hard ] : block bytes limit
+100000 500000 1000000 triple  // gas limits
+1000 5000 10000 triple        // lt limits
+triple dup untriple config.mc_block_limits!
+untriple config.block_limits!
+
+GR$1.7 GR$1 config.block_create_fees!
+// smc1_addr config.collector_smc!
+smc1_addr config.minter_smc!
+
+1000000000000 -17 of-cc 666666666666 239 of-cc cc+ config.to_mint!
+
+"validator-keys" +suffix +".pub" file>B
+{ dup Blen } { 32 B| swap dup ."Validator public key = " Bx. cr
+  17 add-validator } while drop
+// newkeypair nip dup ."Validator #1 public key = " Bx. cr 
+// 17 add-validator
+// newkeypair nip dup ."Validator #2 public key = " Bx. cr
+// 239 add-validator
+// 100000 =: orig_vset_valid_for
+100 =: orig_vset_valid_for  // original validator set valid 100 seconds only (DEBUG)
+now dup orig_vset_valid_for + 0 config.validators!
+
+/*
+ *
+ * SmartContract #5 (Configuration smart contract)
+ *
+ */
+"config-code.fif" include   // code in separate source file
+<b 0 32 u, 
+   "config-master" +suffix +".pk" load-generate-keypair drop
+   B,
+   configdict ref,
+b> // data
+empty_cell  // libraries
+GR$10  // balance
+0 1 config_addr 6 register_smc  // tock
+dup set_config_smc
+Masterchain swap
+."config smart contract address = " 2dup .addr cr 2dup 7 .Addr cr
+"config-master" +suffix +".addr" save-address-verbose
+// Other data
+
+create_state
+cr cr ."new state is:" cr dup <s csr. cr
+dup 31 boc+>B dup Bx. cr
+dup "zerostate" +suffix +".boc" tuck B>file
+."(Initial masterchain state saved to file " type .")" cr
+Bhash dup =: zerostate_fhash
+."file hash= " dup X. space 256 u>B dup B>base64url type cr
+"zerostate" +suffix +".fhash" B>file
+hash dup =: zerostate_rhash ."root hash= " dup X. space 256 u>B dup B>base64url type cr
+"zerostate" +suffix +".rhash" B>file
+basestate0_rhash ."Basestate0 root hash= " dup X. space 256 u>B B>base64url type cr
+basestate0_fhash ."Basestate0 file hash= " dup X. space 256 u>B B>base64url type cr
+zerostate_rhash ."Zerostate root hash= " dup X. space 256 u>B B>base64url type cr
+zerostate_fhash ."Zerostate file hash= " dup X. space 256 u>B B>base64url type cr
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/new-pinger.fif b/submodules/ton/tonlib-src/crypto/smartcont/new-pinger.fif
new file mode 100644
index 0000000000..b833268889
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/new-pinger.fif
@@ -0,0 +1,53 @@
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+"Asm.fif" include
+
+{ ."usage: " @' $0 type ." <workchain-id> <dest-addr> [<filename-base>]" cr
+  ."Creates a new pinger in specified workchain, with destination address <dest-addr>. " cr
+  ."Resulting initialization query is saved into <filename-base>-query.boc ('new-pinger-query.boc' by default)" cr 1 halt
+} : usage
+def? $# { @' $# dup 1 < swap 3 > or ' usage if } if
+
+Basechain 256 1<<1- 3 15 */ 2constant dest-addr
+
+Basechain constant wc  // create a wallet in workchain 0 (basechain)
+def? $1 { @' $1 parse-workchain-id =: wc } if   // set workchain id from command line argument
+def? $2 { @' $2 false parse-load-address drop 2=: dest-addr } if
+def? $3 { @' $3 } { "new-pinger" } cond constant file-base
+
+."Creating new pinger in workchain " wc . cr
+
+// Create new simple pinger
+<{  SETCP0 DUP INC 1 RSHIFT# 32 THROWIF  // fail unless recv_internal or recv_external
+    c4 PUSHCTR CTOS 32 LDU TUCK 8 LDI 256 LDU ENDS     // body sel s seqno wc addr : destination address loaded
+    s4 PUSH IF:<{
+      s2 s5 XCHG2    // addr sel s wc seqno body
+      32 PLDU OVER EQUAL 33 THROWIFNOT   // seqno mismatch?
+      ACCEPT         // addr sel s wc seqno
+      INC NEWC 32 STU  // addr sel s wc b
+      s1 s2 XCHG STSLICE  // addr sel wc b'
+      ENDC c4 POPCTR  // addr sel wc ; persistent data updated
+      ROT             // sel wc addr
+    }>
+    // create new empty message with 0.1 Grams to that address
+    SWAP NEWC b{001000100} STSLICECONST 8 STI 256 STU
+    GR$10/9 INT STGRAMS  // store 1.111..1 Grams
+    1 4 + 4 + 64 + 32 + 1+ 1+ INT STZEROES ENDC
+    // send raw message from Cell
+    ZERO SENDRAWMSG
+}>c
+// code
+<b 0 32 u, dest-addr addr, b> // data
+// no libraries
+<b b{00110} s, rot ref, swap ref, b>  // create StateInit
+dup ."StateInit: " <s csr. cr
+dup hash wc swap 2dup 2constant pinger_addr
+."new pinger address = " 2dup .addr cr
+2dup file-base +".addr" save-address-verbose
+."Non-bounceable address (for init): " 2dup 7 .Addr cr
+."Bounceable address (for later access): " 6 .Addr cr
+<b b{1000100} s, pinger_addr addr, b{000010} s, swap <s s, b{0} s, 0 32 u, "PING" $, b>
+dup ."External message for initialization is " <s csr. cr
+2 boc+>B dup Bx. cr
+file-base +"-query.boc" tuck B>file
+."(Saved pinger creating query to file " type .")" cr
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/new-wallet.fif b/submodules/ton/tonlib-src/crypto/smartcont/new-wallet.fif
new file mode 100644
index 0000000000..c1ad403ca5
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/new-wallet.fif
@@ -0,0 +1,62 @@
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+"Asm.fif" include
+
+{ ."usage: " @' $0 type ." <workchain-id> [<filename-base>]" cr
+  ."Creates a new wallet in specified workchain, with private key saved to or loaded from <filename-base>.pk" cr
+  ."('new-wallet.pk' by default)" cr 1 halt
+} : usage
+$# 1- -2 and ' usage if
+
+$1 parse-workchain-id =: wc    // set workchain id from command line argument
+def? $2 { @' $2 } { "new-wallet" } cond constant file-base
+
+."Creating new wallet in workchain " wc . cr
+
+// Create new simple wallet
+<{ SETCP0 DUP IFNOTRET // return if recv_internal
+   DUP 85143 INT EQUAL IFJMP:<{ // "seqno" get-method
+     DROP c4 PUSHCTR CTOS 32 PLDU  // cnt
+   }>
+   INC 32 THROWIF  // fail unless recv_external
+   512 INT LDSLICEX DUP 32 PLDU   // sign cs cnt
+   c4 PUSHCTR CTOS 32 LDU 256 LDU ENDS  // sign cs cnt cnt' pubk
+   s1 s2 XCPU            // sign cs cnt pubk cnt' cnt
+   EQUAL 33 THROWIFNOT   // ( seqno mismatch? )
+   s2 PUSH HASHSU        // sign cs cnt pubk hash
+   s0 s4 s4 XC2PU        // pubk cs cnt hash sign pubk
+   CHKSIGNU              // pubk cs cnt ?
+   34 THROWIFNOT         // signature mismatch
+   ACCEPT
+   SWAP 32 LDU NIP 
+   DUP SREFS IF:<{
+     // 3 INT 35 LSHIFT# 3 INT RAWRESERVE    // reserve all but 103 Grams from the balance
+     8 LDU LDREF         // pubk cnt mode msg cs
+     s0 s2 XCHG SENDRAWMSG  // pubk cnt cs ; ( message sent )
+   }>
+   ENDS
+   INC NEWC 32 STU 256 STU ENDC c4 POPCTR
+}>c // >libref
+// code
+<b 0 32 u, 
+   file-base +".pk" load-generate-keypair
+   constant wallet_pk
+   B, 
+b> // data
+null // no libraries
+// Libs{ x{ABACABADABACABA} drop x{AAAA} s>c public_lib x{1234} x{5678} |_ s>c public_lib }Libs
+<b b{0011} s, 3 roll ref, rot ref, swap dict, b>  // create StateInit
+dup ."StateInit: " <s csr. cr
+dup hash wc swap 2dup 2constant wallet_addr
+."new wallet address = " 2dup .addr cr
+2dup file-base +".addr" save-address-verbose
+."Non-bounceable address (for init): " 2dup 7 .Addr cr
+."Bounceable address (for later access): " 6 .Addr cr
+<b 0 32 u, b>
+dup ."signing message: " <s csr. cr
+dup hash wallet_pk ed25519_sign_uint rot
+<b b{1000100} s, wallet_addr addr, b{000010} s, swap <s s, b{0} s, swap B, swap <s s, b>
+dup ."External message for initialization is " <s csr. cr
+2 boc+>B dup Bx. cr
+file-base +"-query.boc" tuck B>file
+."(Saved wallet creating query to file " type .")" cr
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/recover-stake.fif b/submodules/ton/tonlib-src/crypto/smartcont/recover-stake.fif
new file mode 100644
index 0000000000..573cb336a2
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/recover-stake.fif
@@ -0,0 +1,17 @@
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+
+{ ."usage: " @' $0 type ." [<savefile>]" cr
+  ."Creates the message body to be sent from a validator controlling smart contract (wallet) to recover its share of unfrozen stakes and bonuses." cr
+  ."The result is saved into <savefile> (`recover-query.boc` by default) and output in hexadecimal form, to be sent later as the body of a message from the wallet to elections smart contract, along with a small value (say, one Gram) to cover forwarding and processing fees" cr 1 halt
+} : usage
+
+$# dup 0 < swap 1 > or ' usage if
+def? $1 { @' $1 } { "recover-query.boc" } cond constant output_fname
+now constant query_id
+."query_id for stake recovery message is set to " query_id . cr
+
+<b x{47657424} s, query_id 64 u, b>
+cr ."Message body is " dup <s csr. cr
+
+2 boc+>B output_fname tuck B>file ."Saved to file " type cr
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/show-addr.fif b/submodules/ton/tonlib-src/crypto/smartcont/show-addr.fif
new file mode 100644
index 0000000000..74536528f8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/show-addr.fif
@@ -0,0 +1,21 @@
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+
+{ ."usage: " @' $0 type ." <filename-base>" cr
+  ."Shows the address of a simple wallet created by new-wallet.fif, with address in <filename-base>.addr "
+  ."and private key in file <filename-base>.pk" cr 1 halt
+} : usage
+def? $# { @' $# 1 > ' usage if } if
+def? $1 { @' $1 } { "new-wallet" } cond constant file-base
+
+file-base +".addr" dup ."Loading wallet address from " type cr file>B 32 B| 
+dup Blen { 32 B>i@ } { drop Basechain } cond constant wallet_wc
+256 B>u@ dup constant wallet_addr
+."Source wallet address = " wallet_wc ._ .":" x. cr
+wallet_wc wallet_addr 2dup 7 smca>$ ."Non-bounceable address (for init only): " type cr
+6 smca>$ ."Bounceable address (for later access): " type cr
+
+file-base +".pk" dup file-exists? {
+  dup file>B dup Blen 32 <> abort"Private key must be exactly 32 bytes long"
+  =: wallet_pk ."Private key available in file " type cr
+} { ."Private key file " type ." not found" cr } cond
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/simple-wallet-code.fc b/submodules/ton/tonlib-src/crypto/smartcont/simple-wallet-code.fc
new file mode 100644
index 0000000000..266bc9ac1f
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/simple-wallet-code.fc
@@ -0,0 +1,25 @@
+;; Simple wallet smart contract
+
+() recv_internal(slice in_msg) impure {
+  ;; do nothing for internal messages
+}
+
+() recv_external(slice in_msg) impure {
+  var signature = in_msg~load_bits(512);
+  var cs = in_msg;
+  int msg_seqno = cs~load_uint(32);
+  var cs2 = begin_parse(get_data());
+  var stored_seqno = cs2~load_uint(32);
+  var public_key = cs2~load_uint(256);
+  cs2.end_parse();
+  throw_unless(33, msg_seqno == stored_seqno);
+  throw_unless(34, check_signature(slice_hash(in_msg), signature, public_key));
+  accept_message();
+  cs~touch_slice();
+  if (cs.slice_refs()) {
+    var mode = cs~load_uint(8);
+    send_raw_message(cs~load_ref(), mode);
+  }
+  cs.end_parse();
+  set_data(begin_cell().store_uint(stored_seqno + 1, 32).store_uint(public_key, 256).end_cell());
+}
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/simple-wallet-code.fif b/submodules/ton/tonlib-src/crypto/smartcont/simple-wallet-code.fif
new file mode 100644
index 0000000000..c052d4b656
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/simple-wallet-code.fif
@@ -0,0 +1,45 @@
+// automatically generated from `smartcont/stdlib.fc` `smartcont/simple-wallet-code.fc` 
+PROGRAM{
+  DECLPROC recv_internal
+  DECLPROC recv_external
+  recv_internal PROC:<{
+    //  in_msg
+    DROP	// 
+  }>
+  recv_external PROC:<{
+    //  in_msg
+    9 PUSHPOW2	//  in_msg _3=512
+    LDSLICEX	//  signature in_msg
+    DUP	//  signature in_msg cs
+    32 LDU	//  signature in_msg msg_seqno cs
+    c4 PUSH	//  signature in_msg msg_seqno cs _11
+    CTOS	//  signature in_msg msg_seqno cs cs2
+    32 LDU	//  signature in_msg msg_seqno cs stored_seqno cs2
+    256 LDU	//  signature in_msg msg_seqno cs stored_seqno public_key cs2
+    ENDS
+    s3 s1 XCPU	//  signature in_msg public_key cs stored_seqno msg_seqno stored_seqno
+    EQUAL	//  signature in_msg public_key cs stored_seqno _23
+    33 THROWIFNOT
+    s0 s3 XCHG	//  signature stored_seqno public_key cs in_msg
+    HASHSU	//  signature stored_seqno public_key cs _26
+    s0 s4 s2 XC2PU	//  cs stored_seqno public_key _26 signature public_key
+    CHKSIGNU	//  cs stored_seqno public_key _27
+    34 THROWIFNOT
+    ACCEPT
+    s2 s0 XCPU	//  public_key stored_seqno cs cs
+    SREFS	//  public_key stored_seqno cs _32
+    IF:<{	//  public_key stored_seqno cs
+      8 LDU	//  public_key stored_seqno mode cs
+      LDREF	//  public_key stored_seqno mode _37 cs
+      s0 s2 XCHG	//  public_key stored_seqno cs _37 mode
+      SENDRAWMSG
+    }>	//  public_key stored_seqno cs
+    ENDS
+    INC	//  public_key _42
+    NEWC	//  public_key _42 _43
+    32 STU	//  public_key _45
+    256 STU	//  _47
+    ENDC	//  _48
+    c4 POP
+  }>
+}END>c
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/stdlib.fc b/submodules/ton/tonlib-src/crypto/smartcont/stdlib.fc
new file mode 100644
index 0000000000..4fb30bdd10
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/stdlib.fc
@@ -0,0 +1,101 @@
+;; Standard library for funC
+;;
+
+int now() asm "NOW";
+slice my_address() asm "MYADDR";
+
+int cell_hash(cell c) asm "HASHCU";
+int slice_hash(slice s) asm "HASHSU";
+int string_hash(slice s) asm "SHA256U";
+
+int check_signature(int hash, slice signature, int public_key) asm "CHKSIGNU";
+int check_data_signature(slice data, slice signature, int public_key) asm "CHKSIGNS";
+
+;; () throw_if(int excno, int cond) impure asm "THROWARGIF";
+
+() dump_stack() impure asm "DUMPSTK";
+
+cell get_data() asm "c4 PUSH";
+() set_data(cell c) impure asm "c4 POP";
+() set_c3(cell c) impure asm "c3 POP";
+() accept_message() impure asm "ACCEPT";
+
+int min(int x, int y) asm "MIN";
+int max(int x, int y) asm "MAX";
+
+slice begin_parse(cell c) asm "CTOS";
+() end_parse(slice s) impure asm "ENDS";
+(slice, cell) load_ref(slice s) asm( -> 1 0) "LDREF";
+cell preload_ref(slice s) asm "PLDREF";
+;; (slice, int) ~load_int(slice s, int len) asm(s len -> 1 0) "LDIX";
+;; (slice, int) ~load_uint(slice s, int len) asm( -> 1 0) "LDUX";
+;; int preload_int(slice s, int len) asm "PLDIX";
+;; int preload_uint(slice s, int len) asm "PLDUX";
+;; (slice, slice) load_bits(slice s, int len) asm(s len -> 1 0) "LDSLICEX";
+;; slice preload_bits(slice s, int len) asm "PLDSLICEX";
+(slice, int) load_grams(slice s) asm( -> 1 0) "LDGRAMS";
+slice skip_bits(slice s, int len) asm "SDSKIPFIRST";
+slice first_bits(slice s, int len) asm "SDCUTFIRST";
+(slice, cell) load_dict(slice s) asm( -> 1 0) "LDDICT";
+cell preload_dict(slice s) asm "PLDDICT";
+slice skip_dict(slice s) asm "SKIPDICT";
+
+int slice_refs(slice s) asm "SREFS";
+int slice_bits(slice s) asm "SBITS";
+(int, int) slice_bits_refs(slice s) asm "SBITREFS";
+int slice_empty?(slice s) asm "SEMPTY";
+int slice_data_empty?(slice s) asm "SDEMPTY";
+int slice_refs_empty?(slice s) asm "SREMPTY";
+
+builder begin_cell() asm "NEWC";
+cell end_cell(builder b) asm "ENDC";
+builder store_ref(builder b, cell c) asm(c b) "STREF";
+;; builder store_uint(builder b, int x, int len) asm(x b len) "STUX";
+;; builder store_int(builder b, int x, int len) asm(x b len) "STIX";
+builder store_slice(builder b, slice s) asm "STSLICER";
+builder store_grams(builder b, int x) asm "STGRAMS";
+builder store_dict(builder b, cell c) asm(c b) "STDICT";
+
+(slice, slice) load_msg_addr(slice s) asm( -> 1 0) "LDMSGADDR";
+tuple parse_addr(slice s) asm "PARSEMSGADDR";
+(int, int) parse_std_addr(slice s) asm "REWRITESTDADDR";
+(int, slice) parse_var_addr(slice s) asm "REWRITEVARADDR";
+
+cell idict_set_ref(cell dict, int key_len, int index, cell value) asm(value index dict key_len) "DICTISETREF";
+(cell, ()) ~idict_set_ref(cell dict, int key_len, int index, cell value) asm(value index dict key_len) "DICTISETREF";
+cell idict_get_ref(cell dict, int key_len, int index) asm(index dict key_len) "DICTIGETOPTREF";
+(cell, cell) idict_set_get_ref(cell dict, int key_len, int index, cell value) asm(value index dict key_len) "DICTISETGETOPTREF";
+(cell, int) idict_delete?(cell dict, int key_len, int index) asm(index dict key_len) "DICTIDEL";
+(slice, int) idict_get?(cell dict, int key_len, int index) asm(index dict key_len) "DICTIGET" "NULLSWAPIFNOT";
+(slice, int) udict_get?(cell dict, int key_len, int index) asm(index dict key_len) "DICTUGET" "NULLSWAPIFNOT";
+(cell, slice, int) idict_delete_get?(cell dict, int key_len, int index) asm(index dict key_len) "DICTIDELGET" "NULLSWAPIFNOT";
+(cell, slice, int) udict_delete_get?(cell dict, int key_len, int index) asm(index dict key_len) "DICTUDELGET" "NULLSWAPIFNOT";
+(cell, (slice, int)) ~idict_delete_get?(cell dict, int key_len, int index) asm(index dict key_len) "DICTIDELGET" "NULLSWAPIFNOT";
+(cell, (slice, int)) ~udict_delete_get?(cell dict, int key_len, int index) asm(index dict key_len) "DICTUDELGET" "NULLSWAPIFNOT";
+cell udict_set_builder(cell dict, int key_len, int index, builder value) asm(value index dict key_len) "DICTUSETB";
+(cell, ()) ~udict_set_builder(cell dict, int key_len, int index, builder value) asm(value index dict key_len) "DICTUSETB";
+cell idict_set_builder(cell dict, int key_len, int index, builder value) asm(value index dict key_len) "DICTISETB";
+(cell, ()) ~idict_set_builder(cell dict, int key_len, int index, builder value) asm(value index dict key_len) "DICTISETB";
+cell dict_set_builder(cell dict, int key_len, slice index, builder value) asm(value index dict key_len) "DICTSETB";
+(cell, ()) ~dict_set_builder(cell dict, int key_len, slice index, builder value) asm(value index dict key_len) "DICTSETB";
+(cell, int) udict_add_builder?(cell dict, int key_len, int index, builder value) asm(value index dict key_len) "DICTUADDB";
+(cell, int) udict_replace_builder?(cell dict, int key_len, int index, builder value) asm(value index dict key_len) "DICTUREPLACEB";
+(cell, int, slice, int) udict_delete_get_min(cell dict, int key_len) asm(-> 0 2 1 3) "DICTUREMMIN" "NULLSWAPIFNOT" "NULLSWAPIFNOT";
+(cell, (int, slice, int)) ~udict::delete_get_min(cell dict, int key_len) asm(-> 0 2 1 3) "DICTUREMMIN" "NULLSWAPIFNOT" "NULLSWAPIFNOT";
+(cell, slice, slice, int) dict_delete_get_min(cell dict, int key_len) asm(-> 0 2 1 3) "DICTREMMIN" "NULLSWAPIFNOT" "NULLSWAPIFNOT";
+(cell, (slice, slice, int)) ~dict::delete_get_min(cell dict, int key_len) asm(-> 0 2 1 3) "DICTREMMIN" "NULLSWAPIFNOT" "NULLSWAPIFNOT";
+(int, slice, int) udict_get_next?(cell dict, int key_len, int pivot) asm(pivot dict key_len -> 1 0 2) "DICTUGETNEXT" "NULLSWAPIFNOT" "NULLSWAPIFNOT";
+(int, slice, int) udict_get_prev?(cell dict, int key_len, int pivot) asm(pivot dict key_len -> 1 0 2) "DICTUGETPREV" "NULLSWAPIFNOT" "NULLSWAPIFNOT";
+cell new_dict() asm "NEWDICT";
+int dict_empty?(cell c) asm "DICTEMPTY";
+
+cell config_param(int x) asm "CONFIGOPTPARAM";
+int cell_null?(cell c) asm "ISNULL";
+
+() raw_reserve(int amount, int mode) impure asm "RAWRESERVE";
+() raw_reserve_extra(slice currencies, int mode) impure asm "RAWRESERVEX";
+() send_raw_message(cell msg, int mode) impure asm "SENDRAWMSG";
+() set_code(cell new_code) impure asm "SETCODE";
+
+slice touch_slice(slice s) asm "NOP";
+(slice,()) ~touch_slice(slice s) asm "NOP";
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/testgiver.fif b/submodules/ton/tonlib-src/crypto/smartcont/testgiver.fif
new file mode 100644
index 0000000000..1b90fdb817
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/testgiver.fif
@@ -0,0 +1,35 @@
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+
+{ ."usage: " @' $0 type ." <dest-addr> <seqno> <amount> [<savefile>]" cr
+  ."Creates a request to TestGiver and saves it into <savefile>.boc" cr
+  ."('testgiver-query.boc' by default)" cr 1 halt
+} : usage
+
+$# 3 - -2 and ' usage if
+
+// "testgiver.addr" load-address 
+Masterchain 0x8156775b79325e5d62e742d9b96c30b6515a5cd2f1f64c5da4b193c03f070e0d
+2constant giver_addr
+ ."Test giver address = " giver_addr 2dup .addr cr 6 .Addr cr
+
+$1 true parse-load-address =: bounce 2=: dest_addr
+$2 parse-int =: seqno
+$3 $>GR =: amount
+def? $4 { @' $4 } { "testgiver-query" } cond constant savefile
+
+."Requesting " amount .GR ."to account "
+dest_addr 2dup bounce 7 + .Addr ." = " .addr
+."seqno=0x" seqno x. ."bounce=" bounce . cr
+
+// create a message (NB: 01b00.., b = bounce)
+<b b{01} s, bounce 1 i, b{000100} s, dest_addr addr, 
+   amount Gram, 0 9 64 32 + + 1+ 1+ u, "GIFT" $, b>
+<b seqno 32 u, 1 8 u, swap ref, b>
+dup ."enveloping message: " <s csr. cr
+<b b{1000100} s, giver_addr addr, 0 Gram, b{00} s,
+   swap <s s, b>
+dup ."resulting external message: " <s csr. cr
+2 boc+>B dup Bx. cr
+savefile +".boc" tuck B>file
+."(Saved to file " type .")" cr
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/update-config-smc.fif b/submodules/ton/tonlib-src/crypto/smartcont/update-config-smc.fif
new file mode 100644
index 0000000000..3840e128f8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/update-config-smc.fif
@@ -0,0 +1,43 @@
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+
+{ ."usage: " @' $0 type ." <filename-base> <seqno> [<savefile>]" cr
+  ."Creates a request to simple configuration smart contract requesting to change configuration smart contract code to the one currently stored in config-code.fif, "
+  ."with private key loaded from file <filename-base>.pk, "
+  ."and saves it into <savefile>.boc ('config-query.boc' by default)" cr 1 halt
+} : usage
+def? $# { @' $# dup 2 < swap 3 > or ' usage if } if
+
+"config-master" constant file-base
+0 constant seqno
+-1 constant idx
+true constant bounce
+"config-code.fif" constant config-source
+100 constant interval  // valid for 100 seconds
+
+def? $2 {
+  @' $1 =: file-base
+  @' $2 parse-int =: seqno
+} if
+def? $5 { @' $5 } { "config-query" } cond constant savefile
+
+file-base +".addr" load-address
+2dup 2constant config_addr
+."Configuration smart contract address = " 2dup .addr cr 6 .Addr cr
+file-base +".pk" load-keypair nip constant config_pk
+
+."Loading new configuration smart contract code from file file " config-source type cr
+"Asm.fif" include
+config-source include
+dup <s csr. cr
+
+// create a message
+<b x{4e436f64} s, seqno 32 u, now interval + 32 u, swap ref, b>
+dup ."signing message: " <s csr. cr
+dup hash config_pk ed25519_sign_uint
+<b b{1000100} s, config_addr addr, 0 Gram, b{00} s,
+   swap B, swap <s s, b>
+dup ."resulting external message: " <s csr. cr
+2 boc+>B dup Bx. cr
+savefile +".boc" tuck B>file
+."(Saved to file " type .")" cr
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/update-config.fif b/submodules/ton/tonlib-src/crypto/smartcont/update-config.fif
new file mode 100644
index 0000000000..9956a8ce33
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/update-config.fif
@@ -0,0 +1,48 @@
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+
+{ ."usage: " @' $0 type ." <filename-base> <seqno> <index> <new-value-boc> [<savefile>]" cr
+  ."Creates a request to simple configuration smart contract created by mc0.fif requesting to change configuration parameter <index> to <new-value-boc>, "
+  ."with private key loaded from file <filename-base>.pk, "
+  ."and saves it into <savefile>.boc ('config-query.boc' by default)" cr 1 halt
+} : usage
+def? $# { @' $# dup 4 < swap 5 > or ' usage if } if
+
+"config-master" constant file-base
+0 constant seqno
+-1 constant idx
+true constant bounce
+"new-value.boc" constant boc-filename
+100 constant interval  // valid for 100 seconds
+
+def? $4 {
+  @' $1 =: file-base
+  @' $2 parse-int =: seqno
+  @' $3 parse-int =: idx
+  @' $4 =: boc-filename
+} if
+def? $5 { @' $5 } { "config-query" } cond constant savefile
+
+file-base +".addr" load-address
+2dup 2constant config_addr
+."Configuration smart contract address = " 2dup .addr cr 6 .Addr cr
+file-base +".pk" load-keypair nip constant config_pk
+
+."Loading new value of configuration parameter " idx . ."from file " boc-filename type cr
+boc-filename file>B B>boc
+dup <s csr. cr
+
+{ 2drop true } : is-valid-config?
+
+dup idx is-valid-config? not abort"not a valid value for chosen configuration parameter"
+
+// create a message
+<b x{43665021} s, seqno 32 u, now interval + 32 u, idx 32 i, swap ref, b>
+dup ."signing message: " <s csr. cr
+dup hash config_pk ed25519_sign_uint
+<b b{1000100} s, config_addr addr, 0 Gram, b{00} s,
+   swap B, swap <s s, b>
+dup ."resulting external message: " <s csr. cr
+2 boc+>B dup Bx. cr
+savefile +".boc" tuck B>file
+."(Saved to file " type .")" cr
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/update-elector-smc.fif b/submodules/ton/tonlib-src/crypto/smartcont/update-elector-smc.fif
new file mode 100644
index 0000000000..df153f605c
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/update-elector-smc.fif
@@ -0,0 +1,43 @@
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+
+{ ."usage: " @' $0 type ." <filename-base> <seqno> [<savefile>]" cr
+  ."Creates a request to simple configuration smart contract requesting to change elector smart contract code to the one currently stored in elector-code.fif, "
+  ."with private key loaded from file <filename-base>.pk, "
+  ."and saves it into <savefile>.boc ('config-query.boc' by default)" cr 1 halt
+} : usage
+def? $# { @' $# dup 2 < swap 3 > or ' usage if } if
+
+"config-master" constant file-base
+0 constant seqno
+-1 constant idx
+true constant bounce
+"elector-code.fif" constant elector-source
+100 constant interval  // valid for 100 seconds
+
+def? $2 {
+  @' $1 =: file-base
+  @' $2 parse-int =: seqno
+} if
+def? $5 { @' $5 } { "config-query" } cond constant savefile
+
+file-base +".addr" load-address
+2dup 2constant config_addr
+."Configuration smart contract address = " 2dup .addr cr 6 .Addr cr
+file-base +".pk" load-keypair nip constant config_pk
+
+."Loading new elector smart contract code from file file " elector-source type cr
+"Asm.fif" include
+elector-source include
+dup <s csr. cr
+
+// create a message
+<b x{4e43ef05} s, seqno 32 u, now interval + 32 u, swap ref, b>
+dup ."signing message: " <s csr. cr
+dup hash config_pk ed25519_sign_uint
+<b b{1000100} s, config_addr addr, 0 Gram, b{00} s,
+   swap B, swap <s s, b>
+dup ."resulting external message: " <s csr. cr
+2 boc+>B dup Bx. cr
+savefile +".boc" tuck B>file
+."(Saved to file " type .")" cr
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/validator-elect-req.fif b/submodules/ton/tonlib-src/crypto/smartcont/validator-elect-req.fif
new file mode 100644
index 0000000000..c2aca4b5b6
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/validator-elect-req.fif
@@ -0,0 +1,30 @@
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+
+{ ."usage: " @' $0 type ." <wallet-addr> <elect-utime> <max-factor> <adnl-addr> [<savefile>]" cr
+  ."Creates a request to participate in validator elections starting at <elect-utime> on behalf of smart-contract with address <wallet-addr> (prefix with '@' to load address from file) and hexadecimal adnl address <adnl-addr> (empty string or '0' for none)." cr
+  ."The result is saved into <savefile> and output in hexadecimal form, to be signed later by the validator public key" cr 1 halt
+} : usage
+
+$# dup 3 < swap 5 > or ' usage if
+$1 true parse-load-address drop swap 1+ abort"only masterchain smartcontracts may participate in validator elections"
+constant src_addr
+$2 (number) 1 <> { 0 } if dup 0<= abort"<elect-utime> must be a positive integer"
+constant elect_time
+$3 (number) dup 0= abort"<max-factor> must be a real number 1..100"
+1 = { 16 << } { 16 <</r } cond
+dup 65536 < over 6553600 > or abort"<max-factor> must be a real number 1..100"
+constant max_factor
+def? $4 { @' $4 dup $len 1 > { parse-adnl-address } { drop 0 } cond } ' 0 cond
+constant adnl_addr
+def? $5 { @' $5 } { "validator-to-sign.bin" } cond constant output_fname
+
+."Creating a request to participate in validator elections at time " elect_time .
+."from smart contract " -1 src_addr 2dup 1 .Addr ." = " .addr
+." with maximal stake factor with respect to the minimal stake " max_factor ._
+."/65536 and validator ADNL address " adnl_addr x. cr
+
+B{654c5074} elect_time 32 u>B B+ max_factor 32 u>B B+ src_addr 256 u>B B+ adnl_addr 256 u>B B+
+dup Bx. cr
+dup B>base64url type cr
+output_fname tuck B>file ."Saved to file " type cr
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/validator-elect-signed.fif b/submodules/ton/tonlib-src/crypto/smartcont/validator-elect-signed.fif
new file mode 100644
index 0000000000..9755bfac67
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/validator-elect-signed.fif
@@ -0,0 +1,43 @@
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+
+{ ."usage: " @' $0 type ." <wallet-addr> <elect-utime> <max-factor> <adnl-addr> <validator-pubkey> <validator-signature> [<savefile>]" cr
+  ."Creates a message body for participating in validator elections starting at <elect-utime> on behalf of smart-contract with address <wallet-addr> (prefix with '@' to load address from file) and hexadecimal adnl address <adnl-addr> (empty string or '0' for none)." cr
+  ."<validator-pubkey> is the main public key of the future validator (as a Base64 string), and <validator-signature> is the signature of the previously created validator request by that key (also Base64)" cr
+  ."The result is saved into <savefile> (`validator-query.boc` by default) and output in hexadecimal form, to be sent later as the body of a message from <wallet-addr> to elections smart contract, along with the desired stake" cr 1 halt
+} : usage
+
+$# dup 6 < swap 7 > or ' usage if
+$1 true parse-load-address drop swap 1+ abort"only masterchain smartcontracts may participate in validator elections"
+constant src_addr
+$2 (number) 1 <> { 0 } if dup 0<= abort"<elect-utime> must be a positive integer"
+constant elect_time
+$3 (number) dup 0= abort"<max-factor> must be a real number 1..100"
+1 = { 16 << } { 16 <</r } cond
+dup 65536 < over 6553600 > or abort"<max-factor> must be a real number 1..100"
+constant max_factor
+$4 dup $len 1 > { parse-adnl-address } { drop 0 } cond constant adnl_addr
+$5 base64>B dup Blen 36 <> abort"validator Ed25519 public key must be exactly 36 bytes long"
+  32 B>u@+ 0xC6B41348 <> abort"invalid Ed25519 public key: unknown magic number"
+  constant pubkey
+$6 base64>B dup Blen 64 <> abort"validator Ed25519 signature must be exactly 64 bytes long"
+constant signature
+def? $7 { @' $7 } { "validator-query.boc" } cond constant output_fname
+
+."Creating a request to participate in validator elections at time " elect_time .
+."from smart contract " -1 src_addr 2dup 1 .Addr ." = " .addr
+." with maximal stake factor with respect to the minimal stake " max_factor ._
+."/65536 and validator ADNL address " adnl_addr x. cr
+
+B{654c5074} elect_time 32 u>B B+ max_factor 32 u>B B+ src_addr 256 u>B B+ adnl_addr 256 u>B B+
+."String to sign is: " dup Bx. cr constant to_sign
+
+to_sign signature pubkey ed25519_chksign not abort"Ed25519 signature is invalid"
+."Provided a valid Ed25519 signature " signature Bx. ." with validator public key " pubkey Bx. cr
+now dup constant query_id ."query_id set to " . cr
+
+<b x{4e73744b} s, query_id 64 u, pubkey B, elect_time 32 u, max_factor 32 u, adnl_addr 256 u, 
+  <b signature B, b> ref, b>
+cr ."Message body is " dup <s csr. cr
+
+2 boc+>B output_fname tuck B>file ."Saved to file " type cr
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/wallet-code.fc b/submodules/ton/tonlib-src/crypto/smartcont/wallet-code.fc
new file mode 100644
index 0000000000..d0c1fd1c79
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/wallet-code.fc
@@ -0,0 +1,31 @@
+;; Simple wallet smart contract
+
+() recv_internal(slice in_msg) impure {
+  ;; do nothing for internal messages
+}
+
+() recv_external(slice in_msg) impure {
+  var signature = in_msg~load_bits(512);
+  var cs = in_msg;
+  var (msg_seqno, valid_until) = (cs~load_uint(32), cs~load_uint(32));
+  throw_if(35, valid_until < now());
+  var ds = get_data().begin_parse();
+  var (stored_seqno, public_key) = (ds~load_uint(32), ds~load_uint(256));
+  ds.end_parse();
+  throw_unless(33, msg_seqno == stored_seqno);
+  throw_unless(34, check_signature(slice_hash(in_msg), signature, public_key));
+  accept_message();
+  cs~touch();
+  while (cs.slice_refs()) {
+    var mode = cs~load_uint(8);
+    send_raw_message(cs~load_ref(), mode);
+  }
+  cs.end_parse();
+  set_data(begin_cell().store_uint(stored_seqno + 1, 32).store_uint(public_key, 256).end_cell());
+}
+
+;; Get methods
+
+int seqno() method_id {
+  return get_data().begin_parse().preload_uint(32);
+}
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/wallet-code.fif b/submodules/ton/tonlib-src/crypto/smartcont/wallet-code.fif
new file mode 100644
index 0000000000..558c346dd9
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/wallet-code.fif
@@ -0,0 +1,59 @@
+// automatically generated from `smartcont/stdlib.fc` `smartcont/wallet-code.fc` 
+PROGRAM{
+  DECLPROC recv_internal
+  DECLPROC recv_external
+  85143 DECLMETHOD seqno
+  recv_internal PROC:<{
+    //  in_msg
+    DROP	// 
+  }>
+  recv_external PROC:<{
+    //  in_msg
+    9 PUSHPOW2	//  in_msg _3=512
+    LDSLICEX	//  signature in_msg
+    DUP	//  signature in_msg cs
+    32 LDU	//  signature in_msg _8 cs
+    32 LDU	//  signature in_msg msg_seqno valid_until cs
+    NOW	//  signature in_msg msg_seqno valid_until cs _15
+    s1 s2 XCHG	//  signature in_msg msg_seqno cs valid_until _15
+    LESS	//  signature in_msg msg_seqno cs _16
+    35 THROWIF
+    c4 PUSH	//  signature in_msg msg_seqno cs _19
+    CTOS	//  signature in_msg msg_seqno cs ds
+    32 LDU	//  signature in_msg msg_seqno cs _23 ds
+    256 LDU	//  signature in_msg msg_seqno cs stored_seqno public_key ds
+    ENDS
+    s3 s1 XCPU	//  signature in_msg public_key cs stored_seqno msg_seqno stored_seqno
+    EQUAL	//  signature in_msg public_key cs stored_seqno _31
+    33 THROWIFNOT
+    s0 s3 XCHG	//  signature stored_seqno public_key cs in_msg
+    HASHSU	//  signature stored_seqno public_key cs _34
+    s0 s4 s2 XC2PU	//  cs stored_seqno public_key _34 signature public_key
+    CHKSIGNU	//  cs stored_seqno public_key _35
+    34 THROWIFNOT
+    ACCEPT
+    s0 s2 XCHG	//  public_key stored_seqno cs
+    WHILE:<{
+      DUP	//  public_key stored_seqno cs cs
+      SREFS	//  public_key stored_seqno cs _40
+    }>DO<{	//  public_key stored_seqno cs
+      8 LDU	//  public_key stored_seqno mode cs
+      LDREF	//  public_key stored_seqno mode _45 cs
+      s0 s2 XCHG	//  public_key stored_seqno cs _45 mode
+      SENDRAWMSG
+    }>	//  public_key stored_seqno cs
+    ENDS
+    INC	//  public_key _50
+    NEWC	//  public_key _50 _51
+    32 STU	//  public_key _53
+    256 STU	//  _55
+    ENDC	//  _56
+    c4 POP
+  }>
+  seqno PROC:<{
+    // 
+    c4 PUSH	//  _0
+    CTOS	//  _1
+    32 PLDU	//  _3
+  }>
+}END>c
diff --git a/submodules/ton/tonlib-src/crypto/smartcont/wallet.fif b/submodules/ton/tonlib-src/crypto/smartcont/wallet.fif
new file mode 100644
index 0000000000..8742e3cc69
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/smartcont/wallet.fif
@@ -0,0 +1,45 @@
+#!/usr/bin/env fift -s
+"TonUtil.fif" include
+
+{ ."usage: " @' $0 type ." <filename-base> <dest-addr> <seqno> <amount> [-B <body-boc>] [<savefile>]" cr
+  ."Creates a request to simple wallet created by new-wallet.fif, with private key loaded from file <filename-base>.pk "
+  ."and address from <filename-base>.addr, and saves it into <savefile>.boc ('wallet-query.boc' by default)" cr 1 halt
+} : usage
+$# dup 4 < swap 5 > or ' usage if
+def? $6 { @' $5 "-B" $= { @' $6 =: body-boc-file [forget] $6 def? $7 { @' $7 =: $5 [forget] $7 } { [forget] $5 } cond
+  @' $# 2- =: $# } if } if
+
+true constant bounce
+
+$1 =: file-base
+$2 bounce parse-load-address =: bounce 2=: dest_addr
+$3 parse-int =: seqno
+$4 $>GR =: amount
+def? $5 { @' $5 } { "wallet-query" } cond constant savefile
+
+file-base +".addr" load-address
+2dup 2constant wallet_addr
+."Source wallet address = " 2dup .addr cr 6 .Addr cr
+file-base +".pk" load-keypair nip constant wallet_pk
+
+def? body-boc-file { @' body-boc-file file>B B>boc } { <b "TEST" $, b> } cond
+constant body-cell
+
+."Transferring " amount .GR ."to account "
+dest_addr 2dup bounce 7 + .Addr ." = " .addr 
+."seqno=0x" seqno x. ."bounce=" bounce . cr
+."Body of transfer message is " body-cell <s csr. cr
+  
+// create a message
+<b b{01} s, bounce 1 i, b{000100} s, dest_addr addr, amount Gram, 0 9 64 32 + + 1+ u, 
+  body-cell <s 2dup s-fits? not rot over 1 i, -rot { drop body-cell ref, } { s, } cond
+b>
+<b seqno 32 u, 1 8 u, swap ref, b>
+dup ."signing message: " <s csr. cr
+dup hash wallet_pk ed25519_sign_uint
+<b b{1000100} s, wallet_addr addr, 0 Gram, b{00} s,
+   swap B, swap <s s, b>
+dup ."resulting external message: " <s csr. cr
+2 boc+>B dup Bx. cr
+savefile +".boc" tuck B>file
+."(Saved to file " type .")" cr
diff --git a/submodules/ton/tonlib-src/crypto/test/Ed25519.cpp b/submodules/ton/tonlib-src/crypto/test/Ed25519.cpp
new file mode 100644
index 0000000000..4d943abbfd
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/Ed25519.cpp
@@ -0,0 +1,144 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "crypto/Ed25519.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/Slice.h"
+#include "td/utils/tests.h"
+
+#include <string>
+
+unsigned char fixed_privkey[32] = "abacabadabacabaeabacabadabacaba";
+unsigned char fixed_pubkey[32] = {0x6f, 0x9e, 0x5b, 0xde, 0xce, 0x87, 0x21, 0xeb, 0x57, 0x37, 0xfb,
+                                  0xb5, 0x92, 0x28, 0xba, 0x07, 0xf7, 0x88, 0x0f, 0x73, 0xce, 0x5b,
+                                  0xfa, 0xa1, 0xb7, 0x15, 0x73, 0x03, 0xd4, 0x20, 0x1e, 0x74};
+
+unsigned char rfc8032_secret_key1[32] = {0x9d, 0x61, 0xb1, 0x9d, 0xef, 0xfd, 0x5a, 0x60, 0xba, 0x84, 0x4a,
+                                         0xf4, 0x92, 0xec, 0x2c, 0xc4, 0x44, 0x49, 0xc5, 0x69, 0x7b, 0x32,
+                                         0x69, 0x19, 0x70, 0x3b, 0xac, 0x03, 0x1c, 0xae, 0x7f, 0x60};
+
+unsigned char rfc8032_public_key1[32] = {0xd7, 0x5a, 0x98, 0x01, 0x82, 0xb1, 0x0a, 0xb7, 0xd5, 0x4b, 0xfe,
+                                         0xd3, 0xc9, 0x64, 0x07, 0x3a, 0x0e, 0xe1, 0x72, 0xf3, 0xda, 0xa6,
+                                         0x23, 0x25, 0xaf, 0x02, 0x1a, 0x68, 0xf7, 0x07, 0x51, 0x1a};
+
+unsigned char rfc8032_signature1[64] = {
+    0xe5, 0x56, 0x43, 0x00, 0xc3, 0x60, 0xac, 0x72, 0x90, 0x86, 0xe2, 0xcc, 0x80, 0x6e, 0x82, 0x8a,
+    0x84, 0x87, 0x7f, 0x1e, 0xb8, 0xe5, 0xd9, 0x74, 0xd8, 0x73, 0xe0, 0x65, 0x22, 0x49, 0x01, 0x55,
+    0x5f, 0xb8, 0x82, 0x15, 0x90, 0xa3, 0x3b, 0xac, 0xc6, 0x1e, 0x39, 0x70, 0x1c, 0xf9, 0xb4, 0x6b,
+    0xd2, 0x5b, 0xf5, 0xf0, 0x59, 0x5b, 0xbe, 0x24, 0x65, 0x51, 0x41, 0x43, 0x8e, 0x7a, 0x10, 0x0b,
+};
+
+unsigned char rfc8032_secret_key2[32] = {
+    0xc5, 0xaa, 0x8d, 0xf4, 0x3f, 0x9f, 0x83, 0x7b, 0xed, 0xb7, 0x44, 0x2f, 0x31, 0xdc, 0xb7, 0xb1,
+    0x66, 0xd3, 0x85, 0x35, 0x07, 0x6f, 0x09, 0x4b, 0x85, 0xce, 0x3a, 0x2e, 0x0b, 0x44, 0x58, 0xf7,
+};
+
+unsigned char rfc8032_public_key2[32] = {
+    0xfc, 0x51, 0xcd, 0x8e, 0x62, 0x18, 0xa1, 0xa3, 0x8d, 0xa4, 0x7e, 0xd0, 0x02, 0x30, 0xf0, 0x58,
+    0x08, 0x16, 0xed, 0x13, 0xba, 0x33, 0x03, 0xac, 0x5d, 0xeb, 0x91, 0x15, 0x48, 0x90, 0x80, 0x25,
+};
+
+unsigned char rfc8032_message2[2] = {0xaf, 0x82};
+
+unsigned char rfc8032_signature2[64] = {
+    0x62, 0x91, 0xd6, 0x57, 0xde, 0xec, 0x24, 0x02, 0x48, 0x27, 0xe6, 0x9c, 0x3a, 0xbe, 0x01, 0xa3,
+    0x0c, 0xe5, 0x48, 0xa2, 0x84, 0x74, 0x3a, 0x44, 0x5e, 0x36, 0x80, 0xd7, 0xdb, 0x5a, 0xc3, 0xac,
+    0x18, 0xff, 0x9b, 0x53, 0x8d, 0x16, 0xf2, 0x90, 0xae, 0x67, 0xf7, 0x60, 0x98, 0x4d, 0xc6, 0x59,
+    0x4a, 0x7c, 0x15, 0xe9, 0x71, 0x6e, 0xd2, 0x8d, 0xc0, 0x27, 0xbe, 0xce, 0xea, 0x1e, 0xc4, 0x0a,
+};
+
+TEST(Crypto, ed25519) {
+  td::Ed25519::generate_private_key().ensure();
+
+  auto PK1 = td::Ed25519::generate_private_key().move_as_ok();
+  auto PK2 = td::Ed25519::PrivateKey(td::SecureString(td::Slice(fixed_privkey, 32)));
+  LOG(ERROR) << "PK1 = " << td::buffer_to_hex(PK1.as_octet_string());
+  auto priv2_export = PK2.as_octet_string();
+  LOG(ERROR) << "PK2 = " << td::buffer_to_hex(priv2_export);
+  auto PK3 = td::Ed25519::PrivateKey(std::move(priv2_export));
+
+  auto PubK1 = PK1.get_public_key().move_as_ok();
+  LOG(ERROR) << "PubK1 = " << td::buffer_to_hex(PubK1.as_octet_string());
+  auto PubK2 = PK2.get_public_key().move_as_ok();
+  LOG(ERROR) << "PubK2 = " << td::buffer_to_hex(PubK2.as_octet_string());
+  CHECK(td::Slice(fixed_pubkey, 32) == PubK2.as_octet_string());
+  auto PubK3 = PK3.get_public_key().move_as_ok();
+  LOG(ERROR) << "PubK3 = " << td::buffer_to_hex(PubK3.as_octet_string());
+  CHECK(td::Slice(fixed_pubkey, 32) == PubK3.as_octet_string());
+  LOG(ERROR) << "PubK1 = " << td::buffer_to_hex(PubK1.as_octet_string());
+
+  auto secret22 = td::Ed25519::compute_shared_secret(PubK3, PK2).move_as_ok();
+  LOG(ERROR) << "secret(PK2, PubK2)=" << td::buffer_to_hex(secret22);
+
+  auto secret12 = td::Ed25519::compute_shared_secret(PubK3, PK1).move_as_ok();
+  LOG(ERROR) << "secret(PK1, PubK2)=" << td::buffer_to_hex(secret12);
+  auto secret21 = td::Ed25519::compute_shared_secret(PubK1, PK2).move_as_ok();
+  LOG(ERROR) << "secret(PK2, PubK1)=" << td::buffer_to_hex(secret21);
+  CHECK(secret12 == secret21);
+
+  //  for (int i = 0; i < 1000; i++) {
+  //    td::Ed25519::compute_shared_secret(PubK2, PK1).ensure();
+  //    td::Ed25519::compute_shared_secret(PubK1, PK2).ensure();
+  //  }
+
+  auto signature = PK1.sign("abc").move_as_ok();
+  LOG(ERROR) << "PK1.signature=" << td::buffer_to_hex(signature);
+
+  // signature[63] ^= 1;
+  auto ok = PubK1.verify_signature("abc", signature);
+  LOG(ERROR) << "PubK1.check_signature=" << ok;
+  ok.ensure();
+
+  td::Ed25519::PrivateKey PK4(td::SecureString(td::Slice(rfc8032_secret_key1, 32)));
+  auto PubK4 = PK4.get_public_key().move_as_ok();
+  LOG(ERROR) << "PK4.private_key = " << td::buffer_to_hex(PK4.as_octet_string());
+  LOG(ERROR) << "PK4.public_key = " << td::buffer_to_hex(PubK4.as_octet_string());
+  CHECK(td::Slice(rfc8032_public_key1, 32) == PubK4.as_octet_string());
+  signature = PK4.sign("").move_as_ok();
+  LOG(ERROR) << "PK4.signature('') = " << td::buffer_to_hex(signature);
+  CHECK(signature == td::Slice(rfc8032_signature1, 64));
+
+  td::Ed25519::PrivateKey PK5(td::SecureString(td::Slice(rfc8032_secret_key2, 32)));
+  auto PubK5 = PK5.get_public_key().move_as_ok();
+  LOG(ERROR) << "PK5.private_key = " << td::buffer_to_hex(PK5.as_octet_string());
+  LOG(ERROR) << "PK5.public_key = " << td::buffer_to_hex(PubK5.as_octet_string());
+  CHECK(td::Slice(rfc8032_public_key2, 32) == PubK5.as_octet_string());
+  signature = PK5.sign(td::Slice(rfc8032_message2, 2)).move_as_ok();
+  LOG(ERROR) << "PK5.signature('') = " << td::buffer_to_hex(signature);
+  CHECK(signature == td::Slice(rfc8032_signature2, 64));
+
+  //  for (int i = 0; i < 100000; i++) {
+  //    PK5.sign(td::Slice(rfc8032_message2, 2));
+  //  }
+  //  for (int i = 0; i < 1000; i++) {
+  //    PubK5.verify_signature(td::Slice(rfc8032_message2, 2), signature).ensure();
+  //  }
+
+  /*
+  unsigned char temp_pubkey[32];
+  crypto::Ed25519::TempKeyGenerator TKG; // use one generator a lot of times
+
+  TKG.create_temp_shared_secret(temp_pubkey, secret12, PubK1, (const unsigned char*)"abc", 3);
+  LOG(ERROR) << "secret12=" << td::buffer_to_hex(secret12) << "; temp_pubkey=" << td::buffer_to_hex(temp_pubkey);
+
+  PK1.compute_temp_shared_secret(secret21, temp_pubkey);
+  LOG(ERROR) << "secret21=" << td::buffer_to_hex(secret21);
+  assert(!std::memcmp(secret12, secret21, 32));
+*/
+}
diff --git a/submodules/ton/tonlib-src/crypto/test/fift.cpp b/submodules/ton/tonlib-src/crypto/test/fift.cpp
new file mode 100644
index 0000000000..59b912c34e
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift.cpp
@@ -0,0 +1,92 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "fift/words.h"
+#include "fift/Fift.h"
+#include "fift/utils.h"
+
+#include "td/utils/tests.h"
+#include "td/utils/PathView.h"
+#include "td/utils/port/path.h"
+#include "td/utils/filesystem.h"
+
+std::string current_dir() {
+  return td::PathView(td::realpath(__FILE__).move_as_ok()).parent_dir().str();
+}
+
+std::string load_test(std::string name) {
+  return td::read_file_str(current_dir() + "fift/" + name).move_as_ok();
+}
+
+td::Status run_fift(std::string name, bool preload_fift = true) {
+  TRY_RESULT(res, fift::mem_run_fift(load_test(name)));
+  REGRESSION_VERIFY(res.output);
+  return td::Status::OK();
+}
+
+TEST(Fift, testvm) {
+  run_fift("testvm.fif");
+}
+TEST(Fift, testvm2) {
+  run_fift("testvm2.fif");
+}
+TEST(Fift, testvm3) {
+  run_fift("testvm3.fif");
+}
+TEST(Fift, testvm4) {
+  run_fift("testvm2.fif");
+}
+TEST(Fift, testvm4a) {
+  run_fift("testvm4a.fif");
+}
+TEST(Fift, testvm4b) {
+  run_fift("testvm4b.fif");
+}
+TEST(Fift, testvm4c) {
+  run_fift("testvm4c.fif");
+}
+TEST(Fift, testvm4d) {
+  run_fift("testvm4d.fif");
+}
+TEST(Fift, testvm5) {
+  run_fift("testvm5.fif");
+}
+TEST(Fift, testvm6) {
+  run_fift("testvm6.fif");
+}
+TEST(Fift, testvm7) {
+  run_fift("testvm7.fif");
+}
+TEST(Fift, testvm8) {
+  run_fift("testvm8.fif");
+}
+TEST(Fift, testvmprog) {
+  run_fift("testvmprog.fif");
+}
+TEST(Fift, bug) {
+  run_fift("bug.fif");
+}
+TEST(Fift, contfrac) {
+  run_fift("contfrac.fif");
+}
+TEST(Fift, test) {
+  run_fift("test.fif");
+}
+TEST(Fift, bug_div) {
+  run_fift("bug_div.fif");
+}
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/bug.fif b/submodules/ton/tonlib-src/crypto/test/fift/bug.fif
new file mode 100644
index 0000000000..24440fed06
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/bug.fif
@@ -0,0 +1,3 @@
+10000000000000000000000000000000000000000000000000000000 dup .
+dup 1 */ .
+
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/bug_div.fif b/submodules/ton/tonlib-src/crypto/test/fift/bug_div.fif
new file mode 100644
index 0000000000..27ad386a2a
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/bug_div.fif
@@ -0,0 +1,12 @@
+"Asm.fif" include
+
+1000 1 /r
+
+x{7A71A905} runvmcode
+
+<{ 1000 INT 1 INT DIVR }>s
+dup csr.
+runvmcode
+
+.s
+
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/cmdline.fif b/submodules/ton/tonlib-src/crypto/test/fift/cmdline.fif
new file mode 100755
index 0000000000..1194a4281b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/cmdline.fif
@@ -0,0 +1,8 @@
+#!/usr/bin/fift -s
+{ ."usage: " $0 type ." <num1> <num2>" cr 
+  ."Computes the product of two integers." cr bye } : usage
+{ ' usage if } : ?usage
+$# 2 <> ?usage
+$1 (number) 1- ?usage
+$2 (number) 1- ?usage
+* . cr
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/contfrac.fif b/submodules/ton/tonlib-src/crypto/test/fift/contfrac.fif
new file mode 100644
index 0000000000..585f9e1832
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/contfrac.fif
@@ -0,0 +1,18 @@
+{ dup 2over rot } : 3dup
+{ 2drop drop } : 3drop
+{ { 5 roll } 3 times } : 3swap
+{ -rot over + rot over + -rot over + rot } : step1
+{ negate -rot negate swap negate } : step2
+{ 0 3 -roll { 3dup step1 dup 0> } { 3swap 3drop 3 roll 1+ 3 -roll } while 3drop step2 } : nsteps1
+{ ' nsteps1 swap times 3drop } : qcontfrac
+{ -1 0 2swap qcontfrac } : sqrtcontfrac
+{ rot 2 pick * + swap } : revstep1
+{ 1 0 rot ' revstep1 swap times } : computecontfrac
+1 { 10 * } 74 times constant One
+{ 100 sqrtcontfrac 100 computecontfrac */r } : *sqrtint
+{ One swap *sqrtint } : sqrtint
+2 sqrtint .
+3 sqrtint .
+6 sqrtint .
+7 sqrtint .
+239 sqrtint .
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/fixed.fif b/submodules/ton/tonlib-src/crypto/test/fift/fixed.fif
new file mode 100644
index 0000000000..779920cc54
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/fixed.fif
@@ -0,0 +1,19 @@
+1 { 10 * } 70 times constant One
+{ bl word (number) dup 0= abort"invalid fixed-point constant"  
+  1- { One swap */r } { One * } cond 1 'nop } ::_ F$
+' + : F+
+' - : F-
+{ One */r } : F*
+{ One swap */r } : F/
+{ One dup rot */r } : Finv
+{ One { 2dup F/ F+ 2/ } 9 times nip } : Fsqrt
+{ ' Fsqrt 128 times One F- 128 << } : Fln
+{ dup abs <# ' # 70 times char . hold #s rot sign #>
+  nip -trailing0 type space } : .F
+F$17/12 .F
+F$3.14159265 .F
+{ 1 0 rot { -rot over + swap rot 2dup >= } until drop
+} : fib-gtr
+One fib-gtr F/ .F
+F$2 Fsqrt .F
+F$2 Fln .F
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/sort.fif b/submodules/ton/tonlib-src/crypto/test/fift/sort.fif
new file mode 100644
index 0000000000..ac66cd60b8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/sort.fif
@@ -0,0 +1,27 @@
+{ null null rot
+  { dup null? not }
+  { uncons swap rot cons -rot } while drop
+} : split
+variable 'sort  variable 'merge  variable 'compare       
+{ 'sort @ execute } : sort
+{ 'merge @ execute } : merge
+{ 'compare @ execute } : compare
+' < 'compare !
+{ dup null? { drop } {
+    over null? { nip } {
+      over car over car compare ' swap if
+      uncons rot merge cons
+    } cond
+  } cond
+} 'merge !
+{ dup null? {
+    dup cdr null? {
+      split sort swap sort merge
+    } ifnot
+  } ifnot
+} 'sort !
+3 1 4 1 5 9 2 6 5  9 list
+dup .l cr sort .l cr
+"once" "upon" "a" "time" "there" "lived" "a" "very" "little" "kitten"  10 list
+{ $cmp 0< } 'compare !
+dup .l cr sort .l cr
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/sort2.fif b/submodules/ton/tonlib-src/crypto/test/fift/sort2.fif
new file mode 100644
index 0000000000..5611b1792d
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/sort2.fif
@@ -0,0 +1,28 @@
+{ hole dup 1 { @ execute } does create 1 ' ! does create } : defvect
+defvect sort :sort
+defvect merge :merge
+defvect less :less
+' < :less
+{ null null rot
+  { dup null? not }
+  { uncons swap rot cons -rot } while drop
+} : split
+{ dup null? { drop } {
+    over null? { nip } {
+      over car over car less ' swap if
+      uncons rot merge cons
+    } cond
+  } cond
+} :merge
+{ dup null? {
+    dup cdr null? {
+      split sort swap sort merge
+    } ifnot
+  } ifnot
+} :sort
+3 1 4 1 5 9 2 6 5  9 list
+dup .l cr sort .l cr
+"once" "upon" "a" "time" "there" "lived" "a" "very" "little" "kitten"  10 list
+{ $cmp 0< } :less
+dup .l cr sort .l cr
+
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/test.fif b/submodules/ton/tonlib-src/crypto/test/fift/test.fif
new file mode 100644
index 0000000000..3221117c81
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/test.fif
@@ -0,0 +1,24 @@
+{ bl word 1 2 ' (create) } "::" 1 (create)
+{ bl word 0 2 ' (create) } :: :
+{ bl word 2 2 ' (create) } :: :_
+{ bl word 3 2 ' (create) } :: ::_
+{ bl word 0 (create) } : create
+{ char " word 1 ' type } ::_ ."
+{ char " word 1 { swap { abort } if drop } } ::_ abort"
+{ dup * } : square
+6 square .
+{ swap ({) over 2+ -roll swap (compile) (}) } : does
+{ 1 'nop does create } : constant
+10 constant ten
+ten .
+ten ten * .
+{ 1 ' emit does create } : emits
+42 emits star
+34 emits quote
+30000 emits figna
+star star quote figna quote
+{ 0 word drop 0 'nop } ::_ //
+star quote // end-to-line comment
+{ 1 ' * does create } : mulby
+3 mulby 3*
+4 3* .
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testdb.fif b/submodules/ton/tonlib-src/crypto/test/fift/testdb.fif
new file mode 100644
index 0000000000..cbaa98178f
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testdb.fif
@@ -0,0 +1,102 @@
+"Asm.fif" include
+
+PROGRAM{
+
+NEWPROC load_dict
+NEWPROC generate_dict
+NEWPROC save_dict
+
+NEWPROC do_get
+NEWPROC do_set
+NEWPROC do_erase
+
+main PROC:<{
+  DUP 1 INT EQUAL IF:<{
+   DROP
+   do_get CALL
+  }>ELSE<{
+  DUP 2 INT EQUAL IF:<{
+   DROP
+   do_set CALL
+  }>ELSE<{
+  DUP 3 INT EQUAL IF:<{
+   DROP
+   do_erase CALL
+  }> }> }>
+  -1 INT
+}>
+
+do_get PROC:<{
+ load_dict CALL
+ 32 INT
+ DICTIGET
+}>
+
+do_set PROC:<{
+ load_dict CALL
+ 32 INT
+ DICTISET
+ save_dict CALL
+}>
+
+do_erase PROC:<{
+ load_dict CALL
+ 32 INT
+ DICTIDEL
+ DROP
+ save_dict CALL
+}>
+
+generate_dict PROC:<{
+  4 INT 100 INT REPEAT:<{
+    DUP 2DUP MUL ROT 617 INT ADD 1000 INT MOD
+  }>
+  DROP 100 INT
+  NEWDICT
+  SWAP REPEAT:<{
+    s0 s2 XCHG
+    NEWC
+    16 STU
+    s0 s2 XCHG
+    32 INT
+    DICTISETB
+  }>
+}>
+
+load_dict PROC:<{
+  PUSHROOT
+  CTOS DUP SEMPTY IF:<{
+    DROP
+    generate_dict CALL
+  }>
+}>
+
+save_dict PROC:<{
+  NEWC
+  STSLICE
+  ENDC
+  POPROOT
+}>
+
+}END>s constant pmc_prog
+
+{ 1 2 rot pmc_prog } : task_pmc_get
+{ 2 3 rot pmc_prog } : task_pmc_set
+{ 3 2 rot pmc_prog } : task_pmc_erase
+
+{ task_pmc_get dbrunvm 2drop } : pmc_get
+{ task_pmc_set dbrunvm 2drop } : pmc_set
+{ task_pmc_erase dbrunvm 2drop } : pmc_erase
+
+<b x{abacaba} s, <b x{dead} s, x{1dead} sr, b> <s sr, b> <s constant test_value
+
+// 123 "a" pmc_get
+// { csr. } if
+//  123 "a" pmc_set
+
+// test_value 123 x{a} task_pmc_set test_value 123 x{b} task_pmc_set test_value 123 x{c} task_pmc_set 3 3 dbrunvm-parallel
+
+{ test_value 150 rot task_pmc_set } 0 { 1 + 2dup swap execute 7 roll 7 roll } 10000 times 2drop 10000 4 dbrunvm-parallel
+
+// 123 "a" task_pmc_get 123 "b" task_pmc_get 123 "c" task_pmc_get 3 dbrunvm-parallel
+
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testdict.fif b/submodules/ton/tonlib-src/crypto/test/fift/testdict.fif
new file mode 100644
index 0000000000..307bd2e805
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testdict.fif
@@ -0,0 +1,24 @@
+"Lisp.fif" include
+16 constant key-bits
+16 constant val-bits
+{ val-bits u, } : val,
+{ val-bits u@ } : val@
+{ swap unpair <b swap val, b> <s swap rot key-bits udict! not abort"cannot add key-value" } : +dictpair
+{ dictnew { over null? not } { swap uncons swap rot +dictpair } while nip } : mkdict
+{ dup null? { ."(null) " drop } { val@ . } cond } : .val
+{ key-bits { swap . ."-> " .val ."; " true } dictforeach drop cr } : show-dict
+{ key-bits { rot . ."-> " swap .val .val ."; " true } dictdiff drop cr } : show-dict-diff
+{ key-bits { val@ swap val@ + val, true } dictmerge } : dict-sum
+{ null swap key-bits { val@ pair swap cons true } dictforeach drop  } : dict>list-rev
+{ dict>list-rev list-reverse } : dict>list
+( _( 13 169 ) _( 17 289 ) _( 10 100 ) ) mkdict =: Dict
+_( 4 16 ) _( 9 81 ) Dict +dictpair +dictpair =: Dict1
+_( 4 20 ) _( 101 10201 ) Dict +dictpair +dictpair =: Dict2
+."Dict1 = " Dict1 show-dict 
+Dict1 dict>list .l cr
+Dict1 <s csr. cr
+."Dict2 = " Dict2 show-dict 
+Dict2 dict>list .l cr
+Dict2 <s csr. cr
+Dict1 Dict2 show-dict-diff
+Dict2 Dict1 show-dict-diff
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm.fif
new file mode 100644
index 0000000000..a839659700
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm.fif
@@ -0,0 +1,10 @@
+{ bl word 0 (create) } : create
+{ swap ({) over 2+ -roll swap (compile) (}) } : does
+{ 1 'nop does create } : constant
+1 2 3 <b 0x01 8 u, 0x58 8 u, b> .s <s .s runvmcode .s
+x{5352A85354A8A15224A8460525A8A104A85042A8A15112A90402A904} constant solvelineq_code
+x{2523A82525A8A10322A80521A815A103A80314A80102A10122A90402A904} constant solvelineq_simple_code
+x{2523A82525A8A1220104A80521A815A11504A81402A8A10122A90402A904} constant solvelineq_compiled_code
+2 3 1 1 29 12 solvelineq_code runvmcode .s
+2 3 1 1 29 12 solvelineq_simple_code runvmcode .s
+2 3 1 1 29 12 solvelineq_compiled_code runvmcode .s
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm2.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm2.fif
new file mode 100644
index 0000000000..523c6a7d27
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm2.fif
@@ -0,0 +1,22 @@
+239 x{9220A8D8A601} runvmcode .s
+55 x{719C2272B9DC5921A801A50220D920D83031} runvmcode .s
+10 x{9E21C102925B71E021A50120D8A820D9} runvmcode .s
+55 x{7101209466A801A5E430} runvmcode .s
+x{71209A21A00121A020B7B5FCC4E60171804592A70AE401A985} runvmcode .s
+x{71804592A70AE471209821A00121A05302BEE601A985} runvmcode .s
+20 x{710192A70AE471209821A00121A05302BEE601A984} runvmcode .s
+239 x{9F202071B093A703A492AB00E220C001E6} runvmcode drop .s
+239 x{9320C301992093A703A4E380AB00E8} runvmcode drop .s
+x{7791A0EC11717322D802D8} runvmcode drop .s
+x{917720ED50D8} runvmcode drop .s
+10 x{9A20C10DE30820C213E308EDF931} runvmcode drop .s
+10 x{9720C11401C20CB0D8} runvmcode drop .s
+15 x{9A20C10DE30820C213E308EDF931} runvmcode drop .s
+15 x{9720C11401C20CB0D8} runvmcode drop .s
+20 x{9A20C10DE30820C213E308EDF931} runvmcode drop .s
+20 x{9720C11401C20CB0D8} runvmcode drop .s
+x{E3C03077F001A4} x{3020A8} |_ runvmdict drop .s
+x{71B0E30277F001A4} x{20A8} |_ runvmdict .s
+17 x{30ED44D0D71131A020C8CB3FC9ED54} <b x{0000000012345678} s, b> runvm .s
+100 19 7 x{92A9069620C004F2F571F321A0} runvmcode .s
+19 0 x{92A9069620C004F2F571F321A0} runvmcode .s
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm3.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm3.fif
new file mode 100644
index 0000000000..d35369da55
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm3.fif
@@ -0,0 +1,8 @@
+ x{C8}
+  x{62_}
+   x{A68054C_} |_
+   x{A08090C_} |_ |_
+  x{BEFDF21} |_ 
+dup csr. s>c
+13 x{218010F40C} runvmcode .s drop swap csr.
+
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm4.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm4.fif
new file mode 100644
index 0000000000..f6cd5a2ef4
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm4.fif
@@ -0,0 +1,14 @@
+169 13 
+239 dup dup * swap
+289 17 
+3
+x{6D01E502C8CB0F028010F442} runvmcode .s drop dup <s csr.
+
+1 { dup 2dup * swap rot 1+ } 100 times drop 100 .s
+x{6D01E502C8CB0FC9D0028010F414} runvmcode .s drop dup <s csr.
+
+0 { dup 2dup * rot 617 + 1000 mod } 1000 times drop 1000 .s
+x{6D01E502C8CB0F028020F442} runvmcode .s drop dup <s csr.
+
+<b x{C_} s, over ref, b> dup 15 boc+>B .s
+B>boc .s
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm4a.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm4a.fif
new file mode 100644
index 0000000000..390faeb636
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm4a.fif
@@ -0,0 +1,5 @@
+169 13 
+239 dup dup * swap
+289 17 
+3
+x{6D01E502C8CB0F028010F442} runvmcode drop dup <s csr.
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm4b.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm4b.fif
new file mode 100644
index 0000000000..2cc122cccf
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm4b.fif
@@ -0,0 +1,16 @@
+169 13 
+239 dup dup * swap
+289 17 
+3
+x{6D01E502C8CB0F028010F442} runvmcode .s drop dup <s csr.
+
+1 { dup 2dup * swap rot 1+ } 100 times drop 100 .s
+x{6D01E502C8CB0FC9D0028010F414} runvmcode .s drop dup <s csr.
+
+0 { dup 2dup * rot 617 + 1000 mod } 1000 times drop 1000 .s
+x{6D01E502C8CB0F028020F442} runvmcode .s drop dup <s csr.
+
+<b x{C_} s, over ref, b> dup 15 boc+>B .s
+"dict1000.boc" B>file
+"dict1000.boc" file>B
+B>boc .s
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm4c.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm4c.fif
new file mode 100644
index 0000000000..7e32cb55c1
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm4c.fif
@@ -0,0 +1,52 @@
+"Asm.fif" include
+<{ NEWDICT SWAP REPEAT:
+   s2 XCHG0 NEWC 16 STU s2 XCHG0
+   16 INT DICTISETB }>s
+dup csr. constant mkdict(16,16).code
+{ mkdict(16,16).code runvmcode abort"cannot create 16->16 dictionary" } : mkdict(16,16)
+
+<{ ZERO WHILE:<{ SWAP 16 INT DICTIREMMAX }>DO<{ // n d' x i
+     SWAP 16 LDU ENDS  // n d' i s
+     2SWAP SWAP INC
+   }> DROP
+}>s dup csr. constant explode_dict(16,16).code
+{ explode_dict(16,16).code runvmcode abort"cannot explode 16->16 dictionary" } : xdict(16,16)
+{ xdict(16,16) ."{ " { swap . ."-> " . ."; " } swap times ."}" cr } : .dict(16,16)
+{ xdict(16,16) { dup 0< not { ."+" } if ._ 64 + emit } swap times space } : .v
+169 13 
+239 dup dup * swap
+289 17 
+3
+mkdict(16,16) constant dict
+
+{ 16 { 16 i@+ s> 1+ 16 i, true } dictmap } : dict:1+
+{ 16 { 16 i@+ s> swap 16 i@+ s> + 16 i, true } dictmerge } : dict:+
+
+dict dict:1+ dup <s csr. constant dict2
+
+dict .dict(16,16)
+dict2 .dict(16,16)
+
+10 13  20 20  2 mkdict(16,16) constant dict3
+
+0 mkdict(16,16) constant dict0
+169 13  1 mkdict(16,16) constant dict1a
+100 10  1 mkdict(16,16) constant dict1b
+
+
+dict dict3
+2dup swap <s csr. <s csr. dict:+ dup <s csr. .dict(16,16)
+
+{ 1 mkdict(16,16) } : cst*
+{ 1 cst* } : A*
+{ 2 cst* } : B*
+{ 3 cst* } : C*
+{ 4 cst* } : D*
+{ 5 cst* } : E*
+{ 6 cst* } : F*
+' dict:+ : v+
+2 A* 3 C* v+ 9 F* v+
+1 A* 6 D* v+ 2 E* v+
+over .v cr dup .v cr
+v+ .v cr
+
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm4d.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm4d.fif
new file mode 100644
index 0000000000..0629f37676
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm4d.fif
@@ -0,0 +1,26 @@
+"Asm.fif" include
+
+<{ NEWDICT SWAP REPEAT:
+   s2 XCHG0 NEWC 16 STU s2 XCHG0
+   16 INT DICTISETB }>s
+dup csr. constant mkdict(16,16).code
+
+{ mkdict(16,16).code runvmcode abort"cannot create 16->16 dictionary" } : mkdict(16,16)
+
+<{ ZERO WHILE:<{ SWAP 16 INT DICTIREMMAX }>DO<{ // n d' x i
+     SWAP 16 LDU ENDS  // n d' i s
+     2SWAP SWAP INC
+   }> DROP
+}>s dup csr. constant explode_dict(16,16).code
+
+{ explode_dict(16,16).code runvmcode abort"cannot explode 16->16 dictionary" } : xdict(16,16)
+{ xdict(16,16) ."{ " { swap . ."-> " . ."; " } swap times ."}" cr } : .dict(16,16)
+
+{ 16 { 16 i@+ s> 1+ 16 i, true } dictmap } : dict:1+
+{ 16 { 16 i@+ s> swap 16 i@+ s> + 16 i, true } dictmerge } : dict:+
+
+{ 1 swap dup 1 { 2dup dup * + 2 swap 2swap 1+ } 100 times nip mkdict(16,16) } : mdisqpb
+
+0 mdisqpb 0 { 1+ tuck dup * mdisqpb tuck dict:+ dict:+ swap } 100 times drop
+dup <s csr. .dict(16,16)
+
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm4e.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm4e.fif
new file mode 100644
index 0000000000..323c15d431
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm4e.fif
@@ -0,0 +1,61 @@
+"Asm.fif" include
+
+<{ NEWDICT SWAP REPEAT:
+   s2 XCHG0 NEWC 16 STU s2 XCHG0
+   16 INT DICTUSETB }>s
+dup csr. constant mkdict(16,16).code
+
+{ mkdict(16,16).code runvmcode abort"cannot create 16->16 dictionary" } : mkdict(16,16)
+
+<{ ZERO WHILE:<{ SWAP 16 INT DICTUREMMAX }>DO<{ // n d' x i
+     SWAP 16 LDU ENDS  // n d' i s
+     2SWAP SWAP INC
+   }> DROP
+}>s dup csr. constant explode_dict(16,16).code
+
+{ explode_dict(16,16).code runvmcode abort"cannot explode 16->16 dictionary" } : xdict(16,16)
+{ xdict(16,16) ."{ " { swap x. ."-> " x. ."; " } swap times ."}" } : .dict(16,16)
+
+{ 16 { 16 u@+ s> 1+ 16 u, true } dictmap } : dict:1+
+{ 16 { 16 u@+ s> swap 16 u@+ s> + 16 u, true } dictmerge } : dict:+
+
+0x1000 0x1000
+0x1234 0x1234
+0x1357 0x1357
+0xABCD 0xABCD
+0xBFFF 0xBFFF
+5 mkdict(16,16) constant D
+D dup dict>s csr. .dict(16,16) ." <-- D" cr
+
+D <{ 0 INT 0 INT ROT 16 INT SUBDICTUGET }>s dup csr. runvmcode drop
+dup dict>s csr. .dict(16,16) ." <-- SubDict(D,_)" cr
+
+D <{ 0x1 INT 4 INT ROT 16 INT SUBDICTUGET }>s runvmcode drop
+dup dict>s csr. .dict(16,16) ." <-- SubDict(D,0001)" cr 
+
+D <{ 0x10 INT 8 INT ROT 16 INT SUBDICTUGET }>s runvmcode drop
+dup dict>s csr. .dict(16,16) ." <-- SubDict(D,00010000)" cr
+
+D <{ 0x12 INT 8 INT ROT 16 INT SUBDICTUGET }>s runvmcode drop
+dup dict>s csr. .dict(16,16) ." <-- SubDict(D,00010010)" cr
+
+D <{ 0x1357 INT 16 INT ROT OVER SUBDICTUGET }>s runvmcode drop
+dup dict>s csr. .dict(16,16) ." <-- SubDict(D,x1357)" cr
+
+D <{ 0 INT 2 INT ROT 16 INT SUBDICTUGET }>s runvmcode .s drop
+dup dict>s csr. .dict(16,16) ." <-- SubDict(D,00)" cr
+
+D <{ 1 INT 2 INT ROT 16 INT SUBDICTUGET }>s runvmcode .s drop
+dup dict>s csr. .dict(16,16) ." <-- SubDict(D,01)" cr
+
+D <{ 0 INT 1 INT ROT 16 INT SUBDICTUGET }>s runvmcode .s drop
+dup dict>s csr. .dict(16,16) ." <-- SubDict(D,0)" cr
+
+D <{ 1 INT 1 INT ROT 16 INT SUBDICTUGET }>s runvmcode .s drop
+dup dict>s csr. .dict(16,16) ." <-- SubDict(D,1)" cr
+
+D <{ 0xA INT 4 INT ROT 16 INT SUBDICTUGET }>s runvmcode .s drop
+dup dict>s csr. .dict(16,16) ." <-- SubDict(D,1010)" cr
+
+D <{ 0xB INT 4 INT ROT 16 INT SUBDICTUGET }>s runvmcode .s drop
+dup dict>s csr. .dict(16,16) ." <-- SubDict(D,1011)" cr
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm5.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm5.fif
new file mode 100644
index 0000000000..9578fc55f8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm5.fif
@@ -0,0 +1,11 @@
+"Asm.fif" include
+<{ 2SWAP ADD s2 POP FALSE }>s b{00}
+<{ 2SWAP MUL s2 POP FALSE }>s b{1}
+<{ 2SWAP SUB s2 POP FALSE }>s b{01}
+3
+<{ NEWDICT SWAP REPEAT: 8 INT PFXDICTADD 11 THROWIFNOT }>s runvmcode 
+abort"cannot create prefix code dictionary"
+dup dict>s csr. 
+<{ <{ rot 8 PFXDICTSWITCH TRUE }>UNTIL SDEMPTY 11 THROWIFNOT }>s
+dup csr.
+1 2 3 4 5 b{001011} 6 roll runvmcode .s
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm6.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm6.fif
new file mode 100644
index 0000000000..6b57eea09c
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm6.fif
@@ -0,0 +1,66 @@
+"Asm.fif" include
+
+<{ 1 INT 70 INT
+   REPEAT:<{ 10 MULCONST }>
+   1 INT DUP <{ TUCK ADD DUP s3 PUSH GREATER }>UNTIL
+   MULDIVR
+ }>s
+dup csr.
+
+runvmcode .s
+
+<{ 1 INT 70 INT REPEAT:<{ 10 MULCONST }>
+   1 INT DUP <{ TUCK ADD TUCK ADD SWAP DUP s3 PUSH GREATER }>UNTIL
+   MULDIVR
+ }>s
+dup csr.
+
+runvmcode .s
+
+<{ WHILE:<{
+     DUP DEC
+   }>DO<{
+     DUP DUP 1 INT AND IF:<{
+       3 MULCONST INC
+     }>ELSE<{
+       1 RSHIFT#
+     }>
+   }>
+}>s
+dup csr.
+
+<{ WHILE:<{
+     DUP DEC
+   }>DO:
+     DUP DUP 1 INT AND IF:<{
+       3 MULCONST INC
+     }>ELSE:
+       1 RSHIFT#
+}>s
+
+dup csr.
+nip
+
+17 swap runvmcode .s
+
+<{ CONT:<{
+     TUCK DIVR SWAP DUP MUL NEGATE SWAP ZERO ONE
+     <{ SWAP s2 s1 PUSH2 DIVR ADD SWAP 2 ADDCONST
+        2SWAP OVER DIVR 2SWAP s2 PUSH ISZERO }>UNTIL
+     DROP s2 POP DROP
+   }>
+   8 PUSHPOW2 70 INT REPEAT:<{ 10 MULCONST }>
+   DUP 2 LSHIFT# 5 INT s3 PUSH EXECUTE
+   s0 s2 XCHG 239 INT SWAP EXECUTE SUB
+   6 RSHIFTR#
+}>s dup csr.
+
+runvmcode .s
+
+<{ 8 PUSHPOW2 70 INT REPEAT:<{ 10 MULCONST }>
+   ZERO DUP
+   <{ s2 PUSH ADD -ROT INC TUCK DIVR -ROT SWAP s2 PUSH ISZERO }>UNTIL
+   NIP NIP 8 RSHIFTR#
+}>s dup csr.
+
+runvmcode .s
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm7.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm7.fif
new file mode 100644
index 0000000000..796c771ca6
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm7.fif
@@ -0,0 +1,47 @@
+"Asm.fif" include
+<{ -1 INT ZERO ROT
+   100 INT REPEAT:<{
+     ZERO WHILE:<{
+       3 3 BLKPUSH
+       // -ROT OVER ADD ROT OVER ADD -ROT OVER ADD ROT
+       s2 s1 PUXC ADD TUCK ADD s2 s1 PUXC ADD SWAP
+       DUP ISPOS 
+     }>DO<{
+       s4 POP s4 POP s4 POP INC
+     }>
+     3 BLKDROP
+     s3 XCHG0 NEGATE s2 XCHG0 NEGATE SWAP NEGATE s2 XCHG0
+   }>
+   3 BLKDROP
+}>s dup csr.
+// 61 swap runvmcode .s
+drop
+
+<{ -1 INT ZERO ROT  ONE ZERO s0 s1 PUSH2
+  <{ 3 6 BLKPUSH  // a b c m11 m12 m21 m22 a' b' c'
+     s2 s1 PUXC ADD TUCK ADD s2 s1 PUXC ADD SWAP
+     DUP ISPOS IF:<{
+       s7 POP s7 POP s7 POP   // a' b' c' m11 m12 m21 m22
+       s2 PUSH ADD SWAP s3 PUSH ADD SWAP
+     }>ELSE<{
+       3 BLKDROP // a b c m11 m12 m21 m22
+       2SWAP
+       3 4 BLKSWAP  // m m m m a b c
+       NEGATE SWAP NEGATE // .. a -c -b
+       ROT NEGATE   // -c -b -a
+       4 3 BLKSWAP
+     }>
+     DUP 250 QFITS ISNAN
+   }>UNTIL
+   2DROP s3 POP s3 POP DROP 
+}>s dup csr.
+1 { 10 * } 75 times constant One
+{ One swap */r } : frac*One
+61 over runvmcode drop frac*One swap
+2 over runvmcode drop frac*One swap
+3 over runvmcode drop frac*One swap
+5 over runvmcode drop frac*One swap
+6 over runvmcode drop frac*One swap
+7 over runvmcode drop frac*One swap
+8 over runvmcode drop frac*One swap
+.s
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm8.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm8.fif
new file mode 100644
index 0000000000..fba2f51b34
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm8.fif
@@ -0,0 +1,5 @@
+"Asm.fif" include
+<{ 7 INT -4 INT NEWC 64 STI 4 STU ENDC
+   CTOS 64 LDI 4 LDU ENDS }>s
+dup csr.
+runvmcode .s
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvm9.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvm9.fif
new file mode 100644
index 0000000000..81306b061f
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvm9.fif
@@ -0,0 +1,7 @@
+"Asm.fif" include
+<{ 2 INT 3 INT 9 INT NULL CONS CONS CONS }>s dup csr. runvmcode .s
+drop =: L
+<{ ZERO WHILE:<{ OVER ISNULL NOT }>DO<{ SWAP SECOND SWAP INC }> NIP }>s dup csr. =: ListLength
+L ListLength runvmcode .s 2drop
+<{ CONT:<{ DUP ISNULL IF:<{ 2DROP ZERO }>ELSE: CDR OVER EXECUTE INC }> TUCK JMPX }>s dup csr. =: ListLengthRec
+L ListLengthRec runvmcode .s 2drop
diff --git a/submodules/ton/tonlib-src/crypto/test/fift/testvmprog.fif b/submodules/ton/tonlib-src/crypto/test/fift/testvmprog.fif
new file mode 100644
index 0000000000..c2f19f77a8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/fift/testvmprog.fif
@@ -0,0 +1,40 @@
+"Asm.fif" include
+
+PROGRAM{
+
+NEWPROC add
+NEWPROC sub
+NEWPROC mul
+
+sub <{ s3 s3 XCHG2 SUB s2 XCHG0 SUB }>s PROC
+
+// compute (5+i)^4 * (239-i)
+main PROC:<{
+  5 INT 1 INT  // 5+i
+  2DUP
+  mul CALL
+  2DUP
+  mul CALL
+  239 INT -1 INT
+  mul JMP
+}>
+
+add PROC:<{
+  s1 s2 XCHG
+  ADD -ROT ADD SWAP
+}>
+
+// a b c d -- ac-bd ad+bc : complex number multiplication
+mul PROC:<{
+  s3 s1 PUSH2  // a b c d a c
+  MUL          // a b c d ac
+  s3 s1 PUSH2  // a b c d ac b d
+  MUL          // a b c d ac bd
+  SUB          // a b c d ac-bd
+  s4 s4 XCHG2  // ac-bd b c a d
+  MUL          // ac-bd b c ad
+  -ROT MUL ADD
+}>
+
+}END>s
+dup csr. runvmdict .s
diff --git a/submodules/ton/tonlib-src/crypto/test/test-cells.cpp b/submodules/ton/tonlib-src/crypto/test/test-cells.cpp
new file mode 100644
index 0000000000..17d5415719
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/test-cells.cpp
@@ -0,0 +1,656 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <algorithm>
+#include <string>
+#include <vector>
+#include <iostream>
+#include <sstream>
+#include <memory>
+#include <cstring>
+#include <cstdlib>
+#include <cmath>
+#include "common/refcnt.hpp"
+#include "common/bigint.hpp"
+#include "common/refint.h"
+#include "common/bigexp.h"
+#include "common/bitstring.h"
+#include "common/util.h"
+#include "vm/cells.h"
+#include "vm/cellslice.h"
+
+#include "td/utils/tests.h"
+#include "td/utils/crypto.h"
+#include "td/utils/misc.h"
+
+static std::stringstream create_ss() {
+  std::stringstream ss;
+  ss.imbue(std::locale::classic());
+  ss.setf(std::ios_base::fixed, std::ios_base::floatfield);
+  ss.precision(6);
+  return ss;
+}
+static std::stringstream os = create_ss();
+
+void show_total_cells(std::ostream& stream) {
+  stream << "total cells = " << vm::DataCell::get_total_data_cells() << std::endl;
+}
+
+TEST(Cells, simple) {
+  os = create_ss();
+  using namespace td::literals;
+  vm::CellBuilder cb1, cb2;
+  cb1.store_bytes("Hello, ", 7).reserve_slice(48) = td::BitSlice{(const unsigned char*)"world!", 48};
+  cb2.store_bits(td::BitSlice{(const unsigned char*)"\xd0", 4})
+      .store_long(17239, 16)
+      .store_long(-17, 11)
+      .store_long(1000000239, 32)
+      .store_long(1000000239LL * 1000000239)
+      .store_int256("-1000000000000000000000000239"_i256, 91);
+  cb1.store_ref(cb2.finalize_copy());
+  show_total_cells(os);
+  cb2.store_bytes("<->", 3);
+  td::Ref<vm::DataCell> c1{cb1.finalize_copy()}, c2{cb2.finalize_copy()};
+  unsigned char hbuff[vm::Cell::hash_bytes];
+  os << "cb1 = " << cb1 << "; hash=" << td::buffer_to_hex(td::Slice(cb1.compute_hash(hbuff), 32)) << "; c1 = " << *c1
+     << std::endl;
+  os << "cb2 = " << cb2 << "; hash=" << td::buffer_to_hex(td::Slice(cb2.compute_hash(hbuff), 32)) << "; c2 = " << *c2
+     << std::endl;
+  show_total_cells(os);
+
+  vm::CellSlice cr1(c1);
+  cr1.dump(os);
+  os << "fetch_octet() = " << cr1.fetch_octet() << std::endl;
+  cr1.dump(os);
+  os << "fetch_octet() = " << cr1.fetch_octet() << std::endl;
+  cr1.dump(os);
+  os << "fetch_octet() = " << cr1.fetch_octet() << std::endl;
+  cr1.dump(os);
+  os << "fetch_octet() = " << cr1.fetch_octet() << std::endl;
+  cr1.dump(os);
+  os << "fetch_ref()=" << td::buffer_to_hex(cr1.prefetch_ref()->get_hash().as_slice()) << std::endl;
+
+  vm::CellSlice cr(vm::NoVm(), cr1.fetch_ref());
+  cr.dump(os);
+  os << "prefetch_ulong(4)=" << cr.prefetch_ulong(4) << std::endl;
+  cr.dump(os);
+  os << "fetch_ulong(4)=" << cr.fetch_ulong(4) << std::endl;
+  cr.dump(os);
+  os << "fetch_long(16)=" << cr.fetch_long(16) << std::endl;
+  cr.dump(os);
+  os << "prefetch_long(11)=" << cr.prefetch_long(11) << std::endl;
+  cr.dump(os);
+  os << "fetch_int256(11)=" << cr.fetch_int256(11) << std::endl;
+  cr.dump(os);
+  os << "fetch_long(32)=" << cr.fetch_long(32) << std::endl;
+  cr.dump(os);
+  os << "prefetch_long(64)=" << cr.prefetch_long(64) << std::endl;
+  cr.dump(os);
+  os << "fetch_long(64)=" << cr.fetch_long(64) << std::endl;
+  cr.dump(os);
+  os << "prefetch_int256(91)=" << cr.prefetch_int256(91) << std::endl;
+  cr.dump(os);
+  os << "fetch_int256(91)=" << cr.fetch_int256(91) << std::endl;
+  cr.dump(os);
+  os << "fetch_long(24)=" << cr.fetch_long(24) << std::endl;
+  cr.dump(os);
+  cr.clear();
+
+  REGRESSION_VERIFY(os.str());
+}
+
+void test_two_bitstrings(const td::BitSlice& bs1, const td::BitSlice& bs2) {
+  using td::to_binary;
+  using td::to_hex;
+  os << "bs1 = " << bs1.to_binary() << " = " << bs1.to_hex() << std::endl;
+  os << "bs2 = " << to_binary(bs2) << " = " << to_hex(bs2) << std::endl;
+  td::BitString st{bs1};
+  //td::BitString st;
+  //st.append(bs1);
+  os << "st = " << to_binary(st) << " = " << to_hex(st) << std::endl;
+  st.append(bs2);
+  os << "st = " << to_binary(st) << " = " << to_hex(st) << std::endl;
+  ASSERT_EQ(to_binary(st), to_binary(bs1) + to_binary(bs2));
+  auto bs3 = st.subslice(bs1.size(), bs2.size());
+  os << "bs3 = " << to_binary(bs3) << " = " << to_hex(bs3) << std::endl;
+  ASSERT_EQ(to_binary(bs3), to_binary(bs2));
+  ASSERT_EQ(to_hex(bs3), to_hex(bs2));
+  bs1.dump(os);
+  bs2.dump(os);
+  bs3.dump(os);
+  std::string bs2_bin = to_binary(bs2);
+  for (unsigned i = 0; i <= bs2.size(); i++) {
+    for (unsigned j = 0; j <= bs2.size() - i; j++) {
+      auto bs4 = bs2.subslice(i, j);
+      auto bs5 = bs3.subslice(i, j);
+      if (!(to_binary(bs4) == to_binary(bs5) && to_hex(bs4) == to_hex(bs5) && to_binary(bs4) == bs2_bin.substr(i, j))) {
+        bs4.dump(os);
+        bs5.dump(os);
+        os << "bs2.subslice(" << i << ", " << j << ") = " << to_binary(bs4) << " = " << to_hex(bs4) << std::endl;
+        os << "bs3.subslice(" << i << ", " << j << ") = " << to_binary(bs5) << " = " << to_hex(bs5) << std::endl;
+      }
+      ASSERT_EQ(to_binary(bs4), to_binary(bs5));
+      ASSERT_EQ(to_hex(bs4), to_hex(bs5));
+      ASSERT_EQ(to_binary(bs4), bs2_bin.substr(i, j));
+    }
+  }
+}
+
+void test_one_bitstring(const td::BitSlice& bs) {
+  std::string bs_bin = bs.to_binary();
+  for (unsigned i1 = 0; i1 <= bs.size(); i1++) {
+    for (unsigned j1 = 0; j1 <= bs.size() - i1; j1++) {
+      auto bs1 = bs.subslice(i1, j1);
+      ASSERT_EQ(bs1.to_binary(), bs_bin.substr(i1, j1));
+      for (unsigned i2 = 0; i2 <= bs.size() && i2 < 8; i2++) {
+        for (unsigned j2 = 0; j2 <= bs.size() - i2; j2++) {
+          os << "(" << i1 << "," << j1 << ")+(" << i2 << "," << j2 << ")" << std::endl;
+          auto bs2 = bs.subslice(i2, j2);
+          ASSERT_EQ(bs2.to_binary(), bs_bin.substr(i2, j2));
+          test_two_bitstrings(bs1, bs2);
+        }
+      }
+    }
+  }
+}
+
+void test_bitstring_fill(unsigned n, unsigned p, unsigned k) {
+  td::BitString bs{n * 2};
+  std::string s;
+  auto sl1 = td::BitSlice{(const unsigned char*)"\x40", 2};
+  for (unsigned i = 0; i < n; i++) {
+    bs.append(sl1);
+    s += "01";
+  }
+  os << td::to_binary(bs) << " = " << td::to_hex(bs) << std::endl;
+  ASSERT_EQ(td::to_binary(bs), s);
+  unsigned q = k %= p;
+  for (unsigned i = 0; i < p; i++) {
+    unsigned a = (q * n * 2) / p;
+    unsigned b = ((q + 1) * n * 2) / p;
+    bs.subslice_write(a, b - a) = (q & 1);
+    std::fill(s.begin() + a, s.begin() + b, (q & 1) + '0');
+    os << "Step " << i << " (" << a << "," << b << "): " << td::to_binary(bs) << " = " << td::to_hex(bs) << std::endl;
+    ASSERT_EQ(td::to_binary(bs), s);
+    q = (q + k) % p;
+  }
+  bs.subslice_write(4, 16) = td::BitSlice{(const unsigned char*)"\x69\x96", 16};
+  os << td::to_binary(bs) << " = " << td::to_hex(bs) << std::endl;
+  std::string t = "0110100110010110";
+  std::copy(t.begin(), t.end(), s.begin() + 4);
+  ASSERT_EQ(td::to_binary(bs), s);
+}
+
+TEST(Bitstrings, main) {
+  os = create_ss();
+  auto test = td::BitSlice{(const unsigned char*)"test", 32};
+  ASSERT_EQ(test.to_hex(), "74657374");
+  test_two_bitstrings({(const unsigned char*)"\xf1\xd0", 12}, test);
+  test_two_bitstrings({(const unsigned char*)"\x9f", 3}, {(const unsigned char*)"t", 3});
+  test_bitstring_fill(17 * 3, 17, 4);
+  //test_one_bitstring({(const unsigned char*)"SuperTest", 72});
+  REGRESSION_VERIFY(os.str());
+}
+
+void test_parse_dec(std::string s) {
+  td::BigInt256 x, y;
+  os << "s=\"" << s << "\"" << std::endl;
+  x.parse_dec_slow(s);
+  y.parse_dec(s);
+  x.dump(os);
+  y.dump(os);
+  ASSERT_TRUE(x == y);
+  std::string s1 = x.to_dec_string();
+  os << s1 << std::endl;
+  ASSERT_EQ(s, s1);
+  std::string s2 = x.to_hex_string();
+  os << s2 << std::endl;
+  std::string s3 = x.to_hex_string_slow();
+  os << s3 << std::endl;
+  ASSERT_EQ(s2, s3);
+}
+
+void test_pow2(int exponent) {
+  td::BigInt256 x;
+  x.set_pow2(exponent);
+  os << "2^" << exponent << " = " << x.to_dec_string() << " = 0x" << x.to_hex_string() << std::endl;
+  x.dump(os);
+}
+
+void test_fits(const td::BigInt256& x) {
+  int m = 0, n = 0;
+  const int limit = 300;
+  os << "x=" << x.to_dec_string() << "; log2(|x|)=" << std::log2(std::abs(x.to_double())) << std::endl;
+  x.dump(os);
+  while (m < limit && !x.unsigned_fits_bits(m)) {
+    m++;
+  }
+  for (int i = m; i < limit; i++) {
+    ASSERT_TRUE(x.unsigned_fits_bits(i));
+  }
+  int su = x.bit_size(false);
+  while (n < limit && !x.signed_fits_bits(n)) {
+    n++;
+  }
+  for (int i = n; i < limit; i++) {
+    ASSERT_TRUE(x.signed_fits_bits(i));
+  }
+  int ss = x.bit_size();
+  os << "x=" << x.to_dec_string() << "=0x" << x.to_hex_string() << "; x=" << x.to_double()
+     << "; log2(|x|)=" << std::log2(std::abs(x.to_double())) << "; unsigned: " << m << "=" << su
+     << " bits; signed: " << n << "=" << ss << " bits" << std::endl;
+  ASSERT_TRUE(su == m || (su == 0x7fffffff && m == limit));
+  ASSERT_EQ(ss, n);
+  ASSERT_EQ(x.to_hex_string(), x.to_hex_string_slow());
+  td::BigInt256 y, z;
+  ASSERT_TRUE(y.parse_hex(x.to_hex_string()) && y == x);
+  ASSERT_TRUE(z.parse_dec(x.to_dec_string()) && z == x);
+}
+
+void test_divmod(const td::BigInt256& x, const td::BigInt256& y) {
+  td::BigInt256 q, r(x);
+  os << "x = " << x << " = ";
+  x.dump(os);
+  os << "y = " << y << " = ";
+  y.dump(os);
+  if (!r.mod_div_bool(y, q)) {
+    os << "division error!\n";
+    ASSERT_TRUE(0);
+  } else {
+    q.dump(os);
+    r.dump(os);
+    if (!q.normalize_bool() || !r.normalize_bool()) {
+      os << "cannot normalize q or r!\n";
+      ASSERT_TRUE(0);
+    } else {
+      os << "q = " << q << "; r = " << r << std::endl;
+      if (y.sgn() > 0) {
+        ASSERT_TRUE(r.sgn() >= 0);
+        ASSERT_TRUE(r.cmp(y) < 0);
+      } else {
+        ASSERT_TRUE(r.sgn() <= 0);
+        ASSERT_TRUE(r.cmp(y) > 0);
+      }
+      r.add_mul(q, y);
+      ASSERT_TRUE(r.normalize() == x);
+    }
+  }
+}
+
+void test_export_int(const td::BigInt256& x, bool sgnd = true) {
+  os << "x = " << x.to_hex_string() << std::endl;
+  int bad = 0, ok = 0;
+  for (int i = 1; i <= 33; i++) {
+    unsigned char buff[33];
+    std::memset(buff, 0xcc, sizeof(buff));
+    if (!x.export_bytes(buff, i, sgnd)) {
+      ASSERT_EQ(bad, i - 1);
+      bad = i;
+      continue;
+    } else if (++ok < 5) {
+      if (bad == i - 1) {
+        os << "export(" << bad << ", " << sgnd << ") = (bad)" << std::endl;
+      }
+      os << "export(" << i << ", " << sgnd << ") =";
+      char tmp[33 * 3 + 1];
+      for (int j = 0; j < i; j++) {
+        sprintf(tmp + 3 * j, " %02x", buff[j]);
+      }
+      os << tmp << std::endl;
+      td::BigInt256 y;
+      ASSERT_TRUE(y.import_bytes(buff, i, sgnd));
+      os << "import() = " << y.to_hex_string() << std::endl;
+      ASSERT_TRUE(!x.cmp_un(y));
+    }
+  }
+  if (!ok) {
+    os << "export(" << bad << ", " << sgnd << ") = (bad)" << std::endl;
+  }
+}
+
+TEST(Bigint, main) {
+  os = create_ss();
+  using namespace td::literals;
+  td::BigInt256 x, y, z;
+  test_parse_dec("0");
+  test_parse_dec("1");
+  test_parse_dec("-1");
+  test_parse_dec("123");
+  test_parse_dec("-239");
+  test_parse_dec("-115792089237316195423570985008687907853269984665640564039457584007913129639936");
+  test_parse_dec("115792089237316195423570985008687907853269984665640564039457584007913129639935");
+  test_parse_dec("143126893554044595713052252685501316785002612509329899766666973726012466208042");
+  test_parse_dec("100000000000000000000000000000000000000000000000000000000000000000000000000001");
+  x.parse_dec("11111111111111111111111111111111111111111111111111111111111111111111111111111");
+  y.parse_dec("22222222222222222222222222222222222");
+  x += y;
+  os << x.to_dec_string() << std::endl;
+  x -= y;
+  os << x.to_dec_string() << std::endl;
+  x -= y;
+  os << x.to_dec_string() << std::endl;
+  y -= x;
+  os << y.to_dec_string() << std::endl;
+  y += x;
+  os << x.to_dec_string() << std::endl;
+  x.parse_dec("10000000000000000000000000000001");
+  y.parse_dec("11111111111111111111111111111111");
+  z.add_mul(x, y);
+  os << x.to_dec_string() << " * " << y.to_dec_string() << " = " << z.to_dec_string() << std::endl;
+  test_pow2(0);
+  test_pow2(1);
+  test_pow2(54);
+  test_pow2(55);
+  test_pow2(56);
+  test_pow2(57);
+  test_pow2(4 * 56 - 2);
+  test_pow2(4 * 56 - 1);
+  test_pow2(4 * 56);
+  test_pow2(4 * 56 + 1);
+  test_pow2(255);
+  test_pow2(256);
+  test_fits("1111111111111111111111111111"_i256);
+  test_fits(
+      "0000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffffffffffffffff"_x256);
+  for (int i = 10; i >= -10; --i) {
+    test_fits(td::BigInt256(i));
+  }
+  test_export_int("10000000000000000000000000000000000000"_i256);
+  for (int k = 127; k <= 129; k++) {
+    x.set_pow2(k).add_tiny(-1);
+    test_export_int(x, true);
+    test_export_int(x, false);
+    x.add_tiny(1);
+    test_export_int(x, true);
+    test_export_int(x, false);
+    x.add_tiny(1);
+    test_export_int(x, true);
+    test_export_int(x, false);
+    x.negate();
+    test_export_int(x, true);
+    test_export_int(x, false);
+    x.add_tiny(1);
+    test_export_int(x, true);
+    test_export_int(x, false);
+    x.add_tiny(1);
+    test_export_int(x, true);
+    test_export_int(x, false);
+  }
+  for (x = 1, y.set_pow2(256).divmod_tiny(3); x.cmp(y) < 0; x.mul_tiny(3).normalize()) {
+    test_export_int(x, true);
+    x.negate();
+    test_export_int(x, true);
+    x.negate();
+  }
+  test_export_int("7fffffffffffffffffffffffffffffff"_x256);
+  test_export_int("ffffffffffffffffffffffffffffffff"_x256);
+  test_export_int("7fffffffffffffffffffffffffffffff"_x256);
+  test_export_int("ffffffffffffffffffffffffffffffff"_x256);
+  for (int i = 0; i <= 257; i++) {
+    x.set_pow2(i).add_tiny(-3);
+    for (int j = -3; j <= 3; j++) {
+      x.negate().normalize();
+      os << "-2^" << i << "+" << -j << ": ";
+      test_fits(x);
+      x.negate().normalize();
+      os << "2^" << i << "+" << j << ": ";
+      test_fits(x);
+      x.add_tiny(1);
+    }
+  }
+
+  for (auto t : {"fffffffffffffffffffffffffffffffffffffff"_x256, td::BigInt256{-1},
+                 "123456789abcdef0123456789abcdef0123456789abcdef"_x256, "-8000000000000000000000000001"_x256}) {
+    for (int i = 0; i <= 256; i++) {
+      (x = t).mod_pow2(i).dump(os);
+      os << "mod 2^" << i << " : " << x.to_hex_string() << std::endl;
+    }
+  }
+
+  test_divmod(x.set_pow2(224), "10000000000000"_i256);
+  test_divmod(x.set_pow2(256), "100000000000000000000000000000000000000000"_i256);
+  test_divmod(x.set_pow2(256), "100000000000000000000000000000000000000000000"_i256);
+  test_divmod(x.set_pow2(80), "-100000000000000000000000000000000000000000000"_i256);
+  test_divmod(x.set_pow2(256), y.set_pow2(128).add_tiny(-1));
+  test_divmod(x.set_pow2(224), y.set_pow2(112).add_tiny(-1));
+  test_divmod(x.set_pow2(222), y.set_pow2(111).add_tiny(-1));
+  test_divmod(td::BigInt256(-1), y.set_pow2(256));
+  test_divmod("10000000000000000000000000000000000000000000000000000000000000000"_i256,
+              "142857142857142857142857142857142857"_i256);
+  test_divmod("100000000"_i256, "-253"_i256);
+  test_divmod("-100000000"_i256, "-253"_i256);
+  test_divmod("-100000000"_i256, "253"_i256);
+
+  test_divmod(x.set_pow2(222), td::BigInt256{std::numeric_limits<td::BigInt256::word_t>::min()});
+  test_divmod(x.set_pow2(222).negate(), td::BigInt256{std::numeric_limits<td::BigInt256::word_t>::min()});
+  REGRESSION_VERIFY(os.str());
+}
+
+TEST(RefInt, main) {
+  os = create_ss();
+  using namespace td::literals;
+  auto x = "10000000000000000000000"_ri256;
+  td::RefInt256 y{true, -239}, z{false};
+  auto v = x + y;
+  std::move(v);
+  os << x << " + " << y << " = " << x + y << std::endl;
+  os << x << " - " << y << " = " << x - y << std::endl;
+  os << x << " * " << y << " = " << x * y << std::endl;
+  os << x << " / " << y << " = " << x / y << std::endl;
+  os << x << " % " << y << " = " << x % y << std::endl;
+  os << x << " + " << y << " = " << x + y << std::endl;
+  os << "10000000000000000000000000000000000000000"_ri256 / "27182818284590"_ri256 << std::endl;
+  {
+    auto w(x + y);
+    z = w;
+  }
+  os << "(x-y)*(x+y) = " << (x - y) * (x + y) << std::endl;
+  os << "z = " << z << std::endl;
+  z = x;
+  x += y;
+  os << "new x = " << x << " = 0x" << hex_string(x) << std::endl;
+  os << "z = (old x) = " << std::move(z) << std::endl;
+  os << "x + y = " << std::move(x) + std::move(y) << std::endl;
+  z = "10000000000000000000000000000000000000000000000000000000000000000000000"_ri256;
+  //z = td::RefInt256{true}
+  //z.unique_write()->set_pow2(256);
+  x = td::RefInt256{true, 0};
+  int i = 1;
+  while (z->sgn() > 0) {
+    x += z;
+    z.write().add_tiny(i >> 1).divmod_tiny(i);
+    ++i;
+  }
+  x.write().normalize();
+  os << x << " = " << hex_string(x) << std::endl;
+  REGRESSION_VERIFY(os.str());
+}
+
+TEST(crc16, main) {
+  os = create_ss();
+  std::string s = "EMSI_FCK";
+  unsigned crc16 = td::crc16(td::Slice{s});
+  os << "s = `" << s << "`; crc16 = " << std::hex << crc16 << std::dec << std::endl;
+  REGRESSION_VERIFY(os.str());
+}
+
+TEST(base64, main) {
+  os = create_ss();
+  std::vector<std::string> arr = {"TEST STRING NUMBER ONE", "TEST STRING NUMBER FOUR", "TEST STRING NUMBER THREE"};
+  for (std::string s : arr) {
+    std::string t = td::str_base64_encode(s);
+    std::string u = td::str_base64_decode(t);
+    os << "`" << s << "` -> `" << t << "` -> `" << u << "`" << std::endl;
+    os << (s == u) << std::endl;
+  }
+  std::string s;
+  int k = 0;
+  for (int i = 0; i < 1024; i++) {
+    s.push_back((char)(k >> 8));
+    k = 69069 * k + 1;
+  }
+  std::string t = td::str_base64_encode(s);
+  std::string u = td::str_base64_decode(t, true);
+  os << t << std::endl;
+  os << (s == u) << std::endl;
+  t = td::str_base64_encode(s, true);
+  u = td::str_base64_decode(t, true);
+  os << t << std::endl;
+  os << (s == u) << std::endl;
+  u = td::sha256(td::Slice{s});
+  for (int i = 0; i < 32; i++) {
+    os << std::hex << ((u[i] >> 4) & 15) << (u[i] & 15);
+  }
+  os << std::dec << std::endl;
+  REGRESSION_VERIFY(os.str());
+}
+
+void check_bits256_scan(std::ostream& stream, td::Bits256 a, td::Bits256 b) {
+  auto c = a ^ b;
+  auto bit = c.count_leading_zeroes();
+  auto bit2 = a.count_matching(b);
+  // stream << a.to_hex() << " and " << b.to_hex() << " match in " << bit << " or " << bit2 << " first bits" << std::endl;
+  // std::cerr << a.to_hex() << " and " << b.to_hex() << " match in " << bit << " or " << bit2 << " first bits (a XOR b = " << c.to_hex() << ")" << std::endl;
+  CHECK((int)bit >= 0 && bit <= 256);
+  for (td::uint32 i = 0; i < bit; i++) {
+    CHECK(a[i] == b[i]);
+  }
+  CHECK(bit == 256 || a[bit] != b[bit]);
+  CHECK(bit == bit2);
+}
+
+void check_bits_scan(std::ostream& stream, td::ConstBitPtr a, bool value) {
+  auto bit = (unsigned)a.scan(value, 256);
+  CHECK((int)bit >= 0 && bit <= 256);
+  for (td::uint32 i = 0; i < bit; i++) {
+    CHECK(a[i] == value);
+  }
+  CHECK(bit == 256 || a[bit] != value);
+}
+
+TEST(bits256_scan, main) {
+  os = create_ss();
+  td::Bits256 a, b;
+  int k = 0;
+  unsigned char r[1024];
+  for (auto& c : r) {
+    c = (k & 0x80) ? (unsigned char)(k >> 8) : 0;
+    k = 69069 * k + 1;
+  }
+  for (k = 0; k < 32; k++) {
+    a = td::ConstBitPtr{r + 32 * k};
+    for (int j = 0; j < 32; j++) {
+      b = td::ConstBitPtr{r + 32 * j};
+      check_bits256_scan(os, a, b);
+    }
+    b = a;
+    unsigned i = r[7 + k];
+    b[i] = b[i] ^ true;
+    check_bits256_scan(os, a, b);
+  }
+  for (k = 0; k < 256; k++) {
+    check_bits_scan(os, td::ConstBitPtr{r} + k, false);
+    check_bits_scan(os, td::ConstBitPtr{r} + k, true);
+  }
+  os << "bits256_scan test OK";
+  REGRESSION_VERIFY(os.str());
+}
+
+bool check_exp(std::ostream& stream, const td::NegExpBinTable& tab, double x) {
+  long long xx = lround(x * (1LL << 52));
+  td::BigInt256 yy;
+  if (!tab.nexpf(yy, -xx, 52)) {
+    stream << "cannot compute exp(" << x << ") = exp(" << xx << " * 2^(-52))" << std::endl;
+    return false;
+  }
+  double y = yy.to_double() * exp2(-252);
+  double y0 = exp(x);
+  bool ok = (abs(y - y0) < 1e-15);
+  if (!ok) {
+    stream << "exp(" << x << ") = exp(" << xx << " * 2^(-52)) = " << yy << " / 2^252 = " << y << " (correct value is "
+           << y0 << ") " << (ok ? "match" : "incorrect") << std::endl;
+  }
+  return ok;
+}
+
+TEST(bigexp, main) {
+  os = create_ss();
+  td::NegExpBinTable tab(252, 32, -128);
+  bool ok = true;
+  if (!tab.is_valid()) {
+    os << "cannot initialize td::NegExpBinTable(252, 32, -128)" << std::endl;
+    ok = false;
+  } else {
+    // for (int i = -128; i < 32; i++) {
+    //  os << "exp(-2^" << i << ") = " << tab.exp_pw2_ref(i) << " / 2^252 = " << tab.exp_pw2_ref(i)->to_double() * exp2(-252) << " (correct value is " << exp(-exp2(i)) << ")" << std::endl;
+    // }
+    ok &= check_exp(os, tab, -2.39);
+    ok &= check_exp(os, tab, 0);
+    ok &= check_exp(os, tab, -1);
+    ok &= check_exp(os, tab, -2);
+    ok &= check_exp(os, tab, -16);
+    ok &= check_exp(os, tab, -17);
+    ok &= check_exp(os, tab, -0.5);
+    ok &= check_exp(os, tab, -0.25);
+    ok &= check_exp(os, tab, -3.1415926535);
+    ok &= check_exp(os, tab, -1e-9);
+  }
+  if (ok) {
+    os << "bigexp test OK\n";
+  } else {
+    os << "bigexp test FAILED\n";
+  }
+  REGRESSION_VERIFY(os.str());
+}
+
+bool check_intexp(std::ostream& stream, td::uint64 x, unsigned k, td::uint64 yc = 0) {
+  td::uint64 y = td::umulnexps32(x, k);
+  long long delta = (long long)(y - yc);
+  bool ok = (y <= x && std::abs(delta) <= 1);
+  if (!ok) {
+    stream << x << "*exp(-" << k << "/65536) = " << y << " (correct value " << yc << ", delta = " << delta << ")"
+           << std::endl;
+  }
+  return ok;
+}
+
+TEST(uint64_exp, main) {
+  os = create_ss();
+  bool ok = true;
+  ok &= check_intexp(os, 3167801306015831286, 4003, 2980099890648636481);
+  ok &= check_intexp(os, 1583900653007915643, 4003, 1490049945324318240);
+  ok &= check_intexp(os, 9094494907266047891, 17239, 6990995826652297465);
+  ok &= check_intexp(os, 5487867407433215099, 239017, 143048684491504152);
+  ok &= check_intexp(os, 46462010749955243, 239017, 1211095134625318);  // up
+  ok &= check_intexp(os, 390263500024095125, 2700001, 1);
+  ok &= check_intexp(os, 390263500024095124, 2700001, 1);
+  ok &= check_intexp(os, std::numeric_limits<td::uint64>::max(), 2952601, 1);
+  ok &= check_intexp(os, std::numeric_limits<td::uint64>::max(), 2952696, 1);
+  ok &= check_intexp(os, std::numeric_limits<td::uint64>::max(), 2952697, 0);
+  ok &= check_intexp(os, std::numeric_limits<td::uint64>::max(), 2952800, 0);
+  ok &= check_intexp(os, std::numeric_limits<td::uint64>::max(), 295269700, 0);
+  ok &= check_intexp(os, std::numeric_limits<td::uint64>::max(), 2000018, 1028453);
+  ok &= check_intexp(os, 1ULL << 60, 2770991, 1);
+  ok &= check_intexp(os, 1ULL << 60, 2770992, 0);
+  if (ok) {
+    os << "uint64_exp test OK\n";
+  } else {
+    os << "uint64_exp test FAILED\n";
+  }
+  REGRESSION_VERIFY(os.str());
+}
diff --git a/submodules/ton/tonlib-src/crypto/test/test-db.cpp b/submodules/ton/tonlib-src/crypto/test/test-db.cpp
new file mode 100644
index 0000000000..28f05ff8e5
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/test-db.cpp
@@ -0,0 +1,2008 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/boc.h"
+#include "vm/cellslice.h"
+#include "vm/cells.h"
+#include "common/AtomicRef.h"
+#include "vm/cells/MerkleProof.h"
+#include "vm/cells/MerkleUpdate.h"
+#include "vm/db/BlobView.h"
+#include "vm/db/CellStorage.h"
+#include "vm/db/CellHashTable.h"
+#include "vm/db/TonDb.h"
+#include "vm/db/StaticBagOfCellsDb.h"
+
+#include "td/utils/base64.h"
+#include "td/utils/benchmark.h"
+#include "td/utils/crypto.h"
+#include "td/utils/Random.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+#include "td/utils/Timer.h"
+#include "td/utils/filesystem.h"
+#include "td/utils/port/path.h"
+#include "td/utils/format.h"
+#include "td/utils/misc.h"
+#include "td/utils/tests.h"
+#include "td/utils/tl_parsers.h"
+#include "td/utils/tl_helpers.h"
+
+#include "td/db/RocksDb.h"
+#include "td/db/MemoryKeyValue.h"
+
+#include <set>
+#include <map>
+
+#include <openssl/sha.h>
+
+struct Step {
+  std::function<void()> func;
+  td::uint32 weight;
+};
+class RandomSteps {
+ public:
+  RandomSteps(std::vector<Step> steps) : steps_(std::move(steps)) {
+    for (auto &step : steps_) {
+      steps_sum_ += step.weight;
+    }
+  }
+  template <class Random>
+  void step(Random &rnd) {
+    auto w = rnd() % steps_sum_;
+    for (auto &step : steps_) {
+      if (w < step.weight) {
+        step.func();
+        break;
+      }
+      w -= step.weight;
+    }
+  }
+
+ private:
+  std::vector<Step> steps_;
+  td::int32 steps_sum_ = 0;
+};
+
+namespace vm {
+
+std::vector<int> do_get_serialization_modes() {
+  std::vector<int> res;
+  for (int i = 0; i < 32; i++) {
+    if ((i & BagOfCells::Mode::WithCacheBits) && !(i & BagOfCells::Mode::WithIndex)) {
+      continue;
+    }
+    res.push_back(i);
+  }
+  return res;
+}
+const std::vector<int> &get_serialization_modes() {
+  static auto modes = do_get_serialization_modes();
+  return modes;
+}
+
+template <class T>
+int get_random_serialization_mode(T &rnd) {
+  auto &modes = get_serialization_modes();
+  return modes[rnd.fast(0, (int)modes.size() - 1)];
+}
+
+class BenchSha256 : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "SHA256";
+  }
+
+  void run(int n) override {
+    int res = 0;
+    for (int i = 0; i < n; i++) {
+      digest::SHA256 hasher;
+      hasher.feed("abcd", 4);
+      unsigned char buf[32];
+      hasher.extract(buf);
+      res += buf[0];
+    }
+    td::do_not_optimize_away(res);
+  }
+};
+class BenchSha256Reuse : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "SHA256 reuse";
+  }
+
+  void run(int n) override {
+    int res = 0;
+    digest::SHA256 hasher;
+    for (int i = 0; i < n; i++) {
+      hasher.reset();
+      hasher.feed("abcd", 4);
+      unsigned char buf[32];
+      hasher.extract(buf);
+      res += buf[0];
+    }
+    td::do_not_optimize_away(res);
+  }
+};
+class BenchSha256Low : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "SHA256 low level";
+  }
+
+  void run(int n) override {
+    int res = 0;
+    SHA256_CTX ctx;
+    for (int i = 0; i < n; i++) {
+      SHA256_Init(&ctx);
+      SHA256_Update(&ctx, "abcd", 4);
+      unsigned char buf[32];
+      SHA256_Final(buf, &ctx);
+      res += buf[0];
+    }
+    td::do_not_optimize_away(res);
+  }
+};
+class BenchSha256Tdlib : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "SHA256 TDLib";
+  }
+
+  void run(int n) override {
+    int res = 0;
+    static TD_THREAD_LOCAL td::Sha256State *ctx;
+    for (int i = 0; i < n; i++) {
+      td::init_thread_local<td::Sha256State>(ctx);
+      ctx->init();
+      ctx->feed("abcd");
+      unsigned char buf[32];
+      ctx->extract(td::MutableSlice(buf, 32), false);
+      res += buf[0];
+    }
+    td::do_not_optimize_away(res);
+  }
+};
+TEST(Cell, sha_benchmark) {
+  bench(BenchSha256Tdlib());
+  bench(BenchSha256Low());
+  bench(BenchSha256Reuse());
+  bench(BenchSha256());
+}
+
+std::string serialize_boc(Ref<Cell> cell, int mode = 31) {
+  CHECK(cell.not_null());
+  vm::BagOfCells boc;
+  boc.add_root(std::move(cell));
+  boc.import_cells().ensure();
+  auto res = boc.serialize_to_string(mode);
+  CHECK(res.size() != 0);
+  return res;
+}
+std::string serialize_boc(td::Span<Ref<Cell>> cells, int mode = 31) {
+  CHECK(!cells.empty());
+  vm::BagOfCells boc;
+  for (auto cell : cells) {
+    boc.add_root(std::move(cell));
+  }
+  boc.import_cells().ensure();
+  auto res = boc.serialize_to_string(mode);
+  CHECK(res.size() != 0);
+  return res;
+}
+
+Ref<Cell> deserialize_boc(td::Slice serialized) {
+  vm::BagOfCells boc;
+  boc.deserialize(serialized).ensure();
+  return boc.get_root_cell();
+}
+std::vector<Ref<Cell>> deserialize_boc_multiple(td::Slice serialized) {
+  vm::BagOfCells boc;
+  boc.deserialize(serialized).ensure();
+  std::vector<Ref<Cell>> res;
+  for (int i = 0; i < boc.get_root_count(); i++) {
+    res.push_back(boc.get_root_cell(i));
+  }
+  return res;
+}
+
+class CellExplorer {
+ public:
+  struct Op {
+    enum { Pop, ReadCellSlice } type;
+    bool should_load;
+    int children_mask;
+  };
+  struct Exploration {
+    std::vector<Op> ops;
+    std::string log;
+    std::set<Cell::Hash> visited;
+    std::vector<Ref<Cell>> visited_cells;
+  };
+
+  static Exploration explore(Ref<Cell> root, std::vector<Op> ops) {
+    CellExplorer e(root);
+    for (auto op : ops) {
+      e.do_op(op);
+    }
+    return e.get_exploration();
+  }
+
+  template <class T>
+  static Exploration random_explore(Ref<Cell> root, T &rnd) {
+    CellExplorer e(root);
+    int it = 0;
+    int cnt = rnd.fast(1, 100);
+    while (it++ < cnt && e.do_random_op(rnd)) {
+    }
+    return e.get_exploration();
+  }
+
+ private:
+  CellExplorer(Ref<Cell> root) {
+    if (root.not_null()) {
+      cells_.push_back(std::move(root));
+    }
+  }
+
+  std::vector<Ref<Cell>> cells_;
+  Ref<CellSlice> cs_;
+  std::vector<Op> ops_;
+  std::set<Cell::Hash> visited_;
+  std::map<Cell::Hash, Ref<Cell>> visited_cells_;
+  td::StringBuilder log_{{}, true};
+
+  void do_op(Op op) {
+    ops_.push_back(op);
+    log_op(op);
+    switch (op.type) {
+      case op.Pop: {
+        CHECK(!cells_.empty());
+        CHECK(cs_.is_null());
+        auto cell = std::move(cells_.back());
+        cells_.pop_back();
+        visited_cells_.emplace(cell->get_hash(), cell);
+        log_cell(cell);
+        if (op.should_load) {
+          log_loaded_cell(cell);
+          visited_.insert(cell->get_hash());
+          // It is ok to visit the same vertex multiple times
+          cs_ = Ref<CellSlice>{true, NoVm(), std::move(cell)};
+        }
+        break;
+      }
+      case op.ReadCellSlice: {
+        CHECK(cs_.not_null());
+        log_cell_slice(cs_);
+        for (unsigned i = 0; i < cs_->size_refs(); i++) {
+          if ((op.children_mask >> i) % 2 != 0) {
+            cells_.push_back(cs_->prefetch_ref(i));
+          }
+        }
+        cs_ = {};
+        break;
+      }
+    }
+  }
+
+  template <class T>
+  bool do_random_op(T &rnd) {
+    if (cs_.not_null()) {
+      int children_mask = 0;
+      if (cs_->size_refs() != 0 && rnd.fast(0, 3) != 0) {
+        //children_mask = rnd.fast(1, (1 << cs_->size_refs()) - 1);
+        children_mask = (1 << cs_->size_refs()) - 1;
+      }
+      do_op({Op::ReadCellSlice, false, children_mask});
+      return true;
+    }
+    if (!cells_.empty()) {
+      do_op({Op::Pop, rnd.fast(0, 30) != 0, 0});
+      return true;
+    }
+    return false;
+  }
+
+  Exploration get_exploration() {
+    std::vector<Ref<Cell>> visited_cells;
+    for (auto &it : visited_cells_) {
+      visited_cells.push_back(it.second);
+    }
+    return {std::move(ops_), log_.as_cslice().str(), std::move(visited_), std::move(visited_cells)};
+  }
+
+  void log_op(Op op) {
+    switch (op.type) {
+      case op.Pop:
+        log_ << "pop" << (op.should_load ? " and load" : "") << "\n";
+        break;
+      case op.ReadCellSlice:
+        log_ << "read slice " << op.children_mask << "\n";
+        break;
+    }
+  }
+  void log_cell(const Ref<Cell> &cell) {
+    log_ << cell->get_level_mask().get_mask() << " " << cell->get_hash() << "\n";
+  }
+  void log_loaded_cell(const Ref<Cell> &cell) {
+    log_ << "depth: ";
+    for (unsigned i = 0; i <= cell->get_level(); i++) {
+      log_ << cell->get_depth(i) << " ";
+    }
+    log_ << "\n";
+  }
+  void log_cell_slice(const Ref<CellSlice> &cs) {
+    log_ << cs->special_type() << " " << cs->size() << " " << cs->size_refs() << " "
+         << td::bitstring::bits_to_hex(cs->data_bits(), cs->size()) << "\n";
+  }
+};
+
+class RandomBagOfCells {
+ public:
+  template <class T>
+  RandomBagOfCells(size_t size, T &rnd, bool with_prunned_branches, std::vector<Ref<Cell>> cells) {
+    std::map<CellHash, int> depth;
+
+    for (auto &cell : cells) {
+      nodes_.emplace_back(cell, calc_depth(cell, depth));
+    }
+
+    for (size_t i = 0; i < size; i++) {
+      add_random_cell(rnd, with_prunned_branches);
+    }
+  }
+
+  Ref<Cell> get_root() {
+    CHECK(!nodes_.empty());
+    // Fix root to be zero level
+    while (nodes_.back().cell->get_level() != 0) {
+      nodes_.emplace_back(CellBuilder::create_merkle_proof(nodes_.back().cell), nodes_.back().merkle_depth + 1);
+    }
+    return nodes_.back().cell;
+  }
+  template <class T>
+  std::vector<Ref<Cell>> get_random_roots(size_t size, T &rnd) {
+    CHECK(!nodes_.empty());
+    std::vector<Ref<Cell>> res(size);
+    for (auto &c : res) {
+      c = nodes_[rnd.fast(0, static_cast<int>(nodes_.size()) - 1)].cell;
+    }
+    return res;
+  }
+
+  size_t get_size() const {
+    return nodes_.size();
+  }
+
+  template <class T>
+  void add_random_cell(T &rnd, bool with_prunned_branches = true) {
+    int cnt = 0;
+    while (true) {
+      CellBuilder cb;
+      int next_cnt = rnd.fast(0, Cell::max_refs);
+      int merkle_depth = 0;
+      for (int j = 0; j < next_cnt && !nodes_.empty(); j++) {
+        int to = rnd.fast(j == 0 && nodes_.size() > 3 ? (int)nodes_.size() - 3 : 0, (int)nodes_.size() - 1);
+        merkle_depth = td::max(merkle_depth, nodes_.at(to).merkle_depth);
+        cb.store_ref(nodes_[to].cell);
+      }
+      int size = rnd.fast(0, 4);
+      for (int j = 0; j < size; j++) {
+        cb.store_bytes(&"ab"[rnd.fast(0, 1)], 1);
+      }
+      if (rnd.fast(0, 4) == 4) {
+        cb.store_bits(rnd.fast(0, 1) ? "\xff" : "\x55", rnd.fast(1, 7));
+      }
+      Ref<Cell> cell = cb.finalize();
+      auto cell_level = cell->get_level();
+      if (with_prunned_branches) {
+        if (rnd.fast(0, 5) == 0 && cell_level + 1 < Cell::max_level) {
+          cell = CellBuilder::create_pruned_branch(std::move(cell), cell_level + 1);
+        }
+        if (merkle_depth + 1 + cell->get_level() < Cell::max_level && rnd.fast(0, 10) == 0) {
+          cell = CellBuilder::create_merkle_proof(std::move(cell));
+          merkle_depth++;
+        }
+      }
+      if (merkle_depth + cell->get_level() >= Cell::max_level) {
+        cnt++;
+        CHECK(cnt < 1000);
+        continue;
+      }
+      CHECK(cell.not_null());
+      nodes_.emplace_back(std::move(cell), merkle_depth);
+      break;
+    }
+  }
+
+ private:
+  struct Node {
+    Node() = default;
+    Node(Ref<Cell> cell, int merkle_depth) : cell(std::move(cell)), merkle_depth(merkle_depth) {
+    }
+    Ref<Cell> cell;
+    int merkle_depth;
+  };
+  std::vector<Node> nodes_;
+
+  auto calc_depth(const Ref<Cell> &root, std::map<CellHash, int> &depth) -> int {
+    auto it_flag = depth.emplace(root->get_hash(), 0);
+    if (!it_flag.second) {
+      return it_flag.first->second;
+    }
+    auto res = 0;
+    CellSlice cs(NoVm(), root);
+    for (unsigned i = 0; i < cs.size_refs(); i++) {
+      res = std::max(res, calc_depth(cs.prefetch_ref(i), depth));
+    }
+    if (cs.special_type() == Cell::SpecialType::MerkleProof) {
+      res++;
+    }
+    depth[root->get_hash()] = res;
+    return res;
+  };
+};
+
+template <class T>
+void random_shuffle(td::MutableSpan<T> v, td::Random::Xorshift128plus &rnd) {
+  for (std::size_t i = 1; i < v.size(); i++) {
+    auto pos = static_cast<std::size_t>(rnd() % (i + 1));
+    std::swap(v[i], v[pos]);
+  }
+}
+Ref<Cell> gen_random_cell(int size, td::Random::Xorshift128plus &rnd, bool with_prunned_branches = true,
+                          std::vector<Ref<Cell>> cells = {}) {
+  if (!cells.empty()) {
+    random_shuffle(td::MutableSpan<Ref<Cell>>(cells), rnd);
+    cells.resize(cells.size() % rnd());
+  }
+  return RandomBagOfCells(size, rnd, with_prunned_branches, std::move(cells)).get_root();
+}
+std::vector<Ref<Cell>> gen_random_cells(int roots, int size, td::Random::Xorshift128plus &rnd,
+                                        bool with_prunned_branches = true, std::vector<Ref<Cell>> cells = {}) {
+  if (!cells.empty()) {
+    random_shuffle(td::MutableSpan<Ref<Cell>>(cells), rnd);
+    cells.resize(cells.size() % rnd());
+  }
+  return RandomBagOfCells(size, rnd, with_prunned_branches, std::move(cells)).get_random_roots(roots, rnd);
+}
+
+TEST(Cell, MerkleProof) {
+  td::Random::Xorshift128plus rnd{123};
+  for (int t = 0; t < 1000; t++) {
+    bool with_prunned_branches = true;
+    auto cell = gen_random_cell(rnd.fast(1, 1000), rnd, with_prunned_branches);
+    auto exploration = CellExplorer::random_explore(cell, rnd);
+
+    auto usage_tree = std::make_shared<CellUsageTree>();
+    auto usage_cell = UsageCell::create(cell, usage_tree->root_ptr());
+    auto exploration2 = CellExplorer::explore(usage_cell, exploration.ops);
+    ASSERT_EQ(exploration.log, exploration2.log);
+
+    auto is_prunned = [&](const Ref<Cell> &cell) { return exploration.visited.count(cell->get_hash()) == 0; };
+    auto proof = MerkleProof::generate(cell, is_prunned);
+    // CellBuilder::virtualize(proof, 1);
+    //ASSERT_EQ(1u, proof->get_level());
+    auto virtualized_proof = MerkleProof::virtualize(proof, 1);
+    auto exploration3 = CellExplorer::explore(virtualized_proof, exploration.ops);
+    ASSERT_EQ(exploration.log, exploration3.log);
+
+    auto proof2 = MerkleProof::generate(cell, usage_tree.get());
+    CHECK(proof2->get_depth() == proof->get_depth());
+    auto virtualized_proof2 = MerkleProof::virtualize(proof2, 1);
+    auto exploration4 = CellExplorer::explore(virtualized_proof2, exploration.ops);
+    ASSERT_EQ(exploration.log, exploration4.log);
+  }
+};
+
+TEST(Cell, MerkleProofCombine) {
+  td::Random::Xorshift128plus rnd{123};
+  for (int t = 0; t < 1000; t++) {
+    bool with_prunned_branches = true;
+    auto cell = gen_random_cell(rnd.fast(1, 1000), rnd, with_prunned_branches);
+    auto exploration1 = CellExplorer::random_explore(cell, rnd);
+    auto exploration2 = CellExplorer::random_explore(cell, rnd);
+
+    Ref<Cell> proof1;
+    {
+      auto usage_tree = std::make_shared<CellUsageTree>();
+      auto usage_cell = UsageCell::create(cell, usage_tree->root_ptr());
+      CellExplorer::explore(usage_cell, exploration1.ops);
+      proof1 = MerkleProof::generate(cell, usage_tree.get());
+
+      auto virtualized_proof = MerkleProof::virtualize(proof1, 1);
+      auto exploration = CellExplorer::explore(virtualized_proof, exploration1.ops);
+      ASSERT_EQ(exploration.log, exploration1.log);
+    }
+
+    Ref<Cell> proof2;
+    {
+      auto usage_tree = std::make_shared<CellUsageTree>();
+      auto usage_cell = UsageCell::create(cell, usage_tree->root_ptr());
+      CellExplorer::explore(usage_cell, exploration2.ops);
+      proof2 = MerkleProof::generate(cell, usage_tree.get());
+
+      auto virtualized_proof = MerkleProof::virtualize(proof2, 1);
+      auto exploration = CellExplorer::explore(virtualized_proof, exploration2.ops);
+      ASSERT_EQ(exploration.log, exploration2.log);
+    }
+
+    Ref<Cell> proof12;
+    {
+      auto usage_tree = std::make_shared<CellUsageTree>();
+      auto usage_cell = UsageCell::create(cell, usage_tree->root_ptr());
+      CellExplorer::explore(usage_cell, exploration1.ops);
+      CellExplorer::explore(usage_cell, exploration2.ops);
+      proof12 = MerkleProof::generate(cell, usage_tree.get());
+
+      auto virtualized_proof = MerkleProof::virtualize(proof12, 1);
+      auto exploration_a = CellExplorer::explore(virtualized_proof, exploration1.ops);
+      auto exploration_b = CellExplorer::explore(virtualized_proof, exploration2.ops);
+      ASSERT_EQ(exploration_a.log, exploration1.log);
+      ASSERT_EQ(exploration_b.log, exploration2.log);
+    }
+
+    Ref<Cell> proof_union;
+    {
+      proof_union = MerkleProof::combine(proof1, proof2);
+      ASSERT_EQ(proof_union->get_hash(), proof12->get_hash());
+
+      auto virtualized_proof = MerkleProof::virtualize(proof_union, 1);
+      auto exploration_a = CellExplorer::explore(virtualized_proof, exploration1.ops);
+      auto exploration_b = CellExplorer::explore(virtualized_proof, exploration2.ops);
+      ASSERT_EQ(exploration_a.log, exploration1.log);
+      ASSERT_EQ(exploration_b.log, exploration2.log);
+    }
+    {
+      auto cell = MerkleProof::virtualize(proof12, 1);
+
+      auto usage_tree = std::make_shared<CellUsageTree>();
+      auto usage_cell = UsageCell::create(cell, usage_tree->root_ptr());
+      CellExplorer::explore(usage_cell, exploration1.ops);
+      auto proof = MerkleProof::generate(cell, usage_tree.get());
+
+      auto virtualized_proof = MerkleProof::virtualize(proof, 2);
+      auto exploration = CellExplorer::explore(virtualized_proof, exploration1.ops);
+      ASSERT_EQ(exploration.log, exploration1.log);
+      if (proof->get_hash() != proof1->get_hash()) {
+        CellSlice(NoVm(), proof12).print_rec(std::cerr);
+        CellSlice(NoVm(), proof).print_rec(std::cerr);
+        CellSlice(NoVm(), proof1).print_rec(std::cerr);
+        LOG(ERROR) << proof->get_level() << " " << proof->get_hash().to_hex();
+        LOG(ERROR) << proof->get_level() << " " << proof1->get_hash().to_hex();
+        LOG(FATAL) << "?";
+      }
+    }
+  }
+};
+
+int X = 20;
+Ref<Cell> gen_random_cell(int size, Ref<Cell> from, td::Random::Xorshift128plus &rnd,
+                          bool with_prunned_branches = true) {
+  auto exploration = CellExplorer::random_explore(from, rnd);
+  return gen_random_cell(size, rnd, with_prunned_branches, std::move(exploration.visited_cells));
+}
+auto gen_merkle_update(Ref<Cell> cell, td::Random::Xorshift128plus &rnd, bool with_prunned_branches) {
+  auto usage_tree = std::make_shared<CellUsageTree>();
+  auto usage_cell = UsageCell::create(cell, usage_tree->root_ptr());
+  auto new_cell = gen_random_cell(rnd.fast(1, X), usage_cell, rnd, with_prunned_branches);
+  auto update = MerkleUpdate::generate(cell, new_cell, usage_tree.get());
+  return std::make_tuple(new_cell, update, usage_tree);
+};
+
+void check_merkle_update(Ref<Cell> A, Ref<Cell> B, Ref<Cell> AB) {
+  CHECK(AB.not_null());
+  CHECK(A.not_null());
+  MerkleUpdate::may_apply(A, AB).ensure();
+  MerkleUpdate::validate(AB).ensure();
+  auto got_B = MerkleUpdate::apply(A, AB);
+  ASSERT_EQ(B->get_hash(), got_B->get_hash());
+};
+
+TEST(Cell, MerkleUpdate) {
+  td::Random::Xorshift128plus rnd{123};
+  for (int t = 0; t < 1000; t++) {
+    bool with_prunned_branches = true;
+    auto A = gen_random_cell(rnd.fast(1, 1000), rnd, with_prunned_branches);
+
+    Ref<Cell> B;
+    Ref<Cell> AB;
+    std::tie(B, AB, std::ignore) = gen_merkle_update(A, rnd, with_prunned_branches);
+    check_merkle_update(A, B, AB);
+  }
+};
+
+TEST(Cell, MerkleUpdateCombine) {
+  td::Random::Xorshift128plus rnd{123};
+  for (int t = 0; t < 1000; t++) {
+    bool with_prunned_branches = true;
+    auto A = gen_random_cell(rnd.fast(1, X), rnd, with_prunned_branches);
+
+    Ref<Cell> B;
+    Ref<Cell> AB;
+    std::tie(B, AB, std::ignore) = gen_merkle_update(A, rnd, with_prunned_branches);
+    check_merkle_update(A, B, AB);
+
+    Ref<Cell> C;
+    Ref<Cell> BC;
+    std::tie(C, BC, std::ignore) = gen_merkle_update(B, rnd, with_prunned_branches);
+    check_merkle_update(B, C, BC);
+
+    check_merkle_update(A, C, MerkleUpdate::combine(AB, BC));
+  }
+};
+
+class BenchCellBuilder : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "BenchCellBuilder";
+  }
+
+  void run(int n) override {
+    td::Random::Xorshift128plus rnd(123);
+    std::string data(128, ' ');
+    for (auto &c : data) {
+      c = static_cast<char>(rnd());
+    }
+
+    for (int i = 0; i < n; i++) {
+      CellBuilder cb;
+      cb.store_bytes(data.data(), rnd() & 127);
+      cb.finalize(false);
+    }
+  }
+};
+TEST(TonDb, BenchCellBuilder) {
+  td::bench(BenchCellBuilder());
+}
+class BenchCellBuilder2 : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "BenchCellBuilder";
+  }
+
+  void run(int n) override {
+    td::Random::Xorshift128plus rnd(123);
+
+    for (int i = 0; i < n; i++) {
+      gen_random_cell(rnd.fast(1, 1000), rnd);
+    }
+  }
+};
+TEST(TonDb, BenchCellBuilder2) {
+  td::bench(BenchCellBuilder2());
+}
+class BenchCellBuilder3 : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "BenchCellBuilder";
+  }
+
+  void run(int n) override {
+    td::Random::Xorshift128plus rnd(123);
+
+    for (int i = 0; i < n; i++) {
+      auto cell = gen_random_cell(rnd.fast(1, 1000), rnd, false);
+      auto cell_hash = cell->get_hash().to_hex();
+
+      int mode = get_random_serialization_mode(rnd);
+
+      auto serialized = serialize_boc(std::move(cell), mode);
+      CHECK(serialized.size() != 0);
+
+      auto loaded_cell = deserialize_boc(serialized);
+      ASSERT_EQ(cell_hash, loaded_cell->get_hash().to_hex());
+
+      auto new_serialized = serialize_boc(std::move(loaded_cell), mode);
+      ASSERT_EQ(serialized, new_serialized);
+    }
+  }
+};
+TEST(TonDb, BenchCellBuilder3) {
+  td::bench(BenchCellBuilder3());
+}
+
+TEST(TonDb, Boc) {
+  td::Random::Xorshift128plus rnd{123};
+  for (int t = 0; t < 1000; t++) {
+    auto cell = gen_random_cell(rnd.fast(1, 1000), rnd);
+    auto cell_hash = cell->get_hash();
+    auto mode = get_random_serialization_mode(rnd);
+
+    auto serialized = serialize_boc(std::move(cell), mode);
+    CHECK(serialized.size() != 0);
+
+    auto loaded_cell = deserialize_boc(serialized);
+    ASSERT_EQ(cell_hash, loaded_cell->get_hash());
+
+    auto new_serialized = serialize_boc(std::move(loaded_cell), mode);
+    ASSERT_EQ(serialized, new_serialized);
+  }
+};
+TEST(TonDb, BocMultipleRoots) {
+  td::Random::Xorshift128plus rnd{123};
+  for (int t = 0; t < 200; t++) {
+    auto cells = gen_random_cells(rnd.fast(1, 10), rnd.fast(1, 1000), rnd);
+    std::vector<Cell::Hash> cell_hashes;
+    for (size_t i = 0; i < cells.size(); i++) {
+      cell_hashes.push_back(cells[i]->get_hash());
+    }
+    auto mode = get_random_serialization_mode(rnd);
+    auto serialized = serialize_boc(cells, mode);
+    CHECK(serialized.size() != 0);
+
+    auto loaded_cells = deserialize_boc_multiple(serialized);
+    ASSERT_EQ(cell_hashes.size(), loaded_cells.size());
+
+    for (size_t i = 0; i < cell_hashes.size(); i++) {
+      ASSERT_EQ(cell_hashes[i], loaded_cells[i]->get_hash());
+    }
+    auto new_serialized = serialize_boc(std::move(loaded_cells), mode);
+    ASSERT_EQ(serialized, new_serialized);
+  }
+};
+
+TEST(TonDb, DynamicBoc) {
+  td::Random::Xorshift128plus rnd{123};
+  std::string old_root_hash;
+  std::string old_root_serialization;
+  auto kv = std::make_shared<td::MemoryKeyValue>();
+  auto dboc = DynamicBagOfCellsDb::create();
+  dboc->set_loader(std::make_unique<CellLoader>(kv));
+  for (int t = 1000; t >= 0; t--) {
+    if (rnd() % 10 == 0) {
+      dboc = DynamicBagOfCellsDb::create();
+    }
+    dboc->set_loader(std::make_unique<CellLoader>(kv));
+    Ref<Cell> old_root;
+    if (!old_root_hash.empty()) {
+      old_root = dboc->load_cell(old_root_hash).move_as_ok();
+      auto serialization = serialize_boc(old_root);
+      ASSERT_EQ(old_root_serialization, serialization);
+    }
+
+    auto cell = gen_random_cell(rnd.fast(1, 1000), rnd);
+    old_root_hash = cell->get_hash().as_slice().str();
+    old_root_serialization = serialize_boc(cell);
+
+    // Check that DynamicBagOfCells properly loads cells
+    cell = vm::StaticBagOfCellsDbLazy::create(vm::BufferSliceBlobView::create(td::BufferSlice(old_root_serialization)))
+               .move_as_ok()
+               ->get_root_cell(0)
+               .move_as_ok();
+
+    dboc->dec(old_root);
+    if (t != 0) {
+      dboc->inc(cell);
+    }
+    dboc->prepare_commit();
+    {
+      CellStorer cell_storer(*kv);
+      dboc->commit(cell_storer);
+    }
+  }
+  ASSERT_EQ(0u, kv->count("").ok());
+};
+
+TEST(TonDb, DynamicBoc2) {
+  int VERBOSITY_NAME(boc) = VERBOSITY_NAME(DEBUG) + 10;
+  td::Random::Xorshift128plus rnd{123};
+  int total_roots = 10000;
+  int max_roots = 20;
+  std::vector<std::string> root_hashes(max_roots);
+  std::vector<Ref<Cell>> roots(max_roots);
+  int last_commit_at = 0;
+  int first_root_id = 0;
+  int last_root_id = 0;
+  auto kv = std::make_shared<td::MemoryKeyValue>();
+  auto dboc = DynamicBagOfCellsDb::create();
+  dboc->set_loader(std::make_unique<CellLoader>(kv));
+
+  auto add_root = [&](Ref<Cell> root) {
+    dboc->inc(root);
+    root_hashes[last_root_id % max_roots] = (root->get_hash().as_slice().str());
+    roots[last_root_id % max_roots] = root;
+    last_root_id++;
+  };
+
+  auto get_root = [&](int root_id) {
+    VLOG(boc) << "  from older root #" << root_id;
+    auto from_root = roots[root_id % max_roots];
+    if (from_root.is_null()) {
+      VLOG(boc) << "  from db";
+      auto from_root_hash = root_hashes[root_id % max_roots];
+      from_root = dboc->load_cell(from_root_hash).move_as_ok();
+    } else {
+      VLOG(boc) << "FROM MEMORY";
+    }
+    return from_root;
+  };
+  auto new_root = [&] {
+    if (last_root_id == total_roots) {
+      return;
+    }
+    if (last_root_id - first_root_id >= max_roots) {
+      return;
+    }
+    VLOG(boc) << "add root";
+    Ref<Cell> from_root;
+    if (first_root_id != last_root_id) {
+      from_root = get_root(rnd.fast(first_root_id, last_root_id - 1));
+    }
+    VLOG(boc) << "  ...";
+    add_root(gen_random_cell(rnd.fast(1, 20), from_root, rnd));
+    VLOG(boc) << "  OK";
+  };
+
+  auto commit = [&] {
+    VLOG(boc) << "commit";
+    dboc->prepare_commit();
+    {
+      CellStorer cell_storer(*kv);
+      dboc->commit(cell_storer);
+    }
+    dboc->set_loader(std::make_unique<CellLoader>(kv));
+    for (int i = last_commit_at; i < last_root_id; i++) {
+      roots[i % max_roots].clear();
+    }
+    last_commit_at = last_root_id;
+  };
+  auto reset = [&] {
+    VLOG(boc) << "reset";
+    commit();
+    dboc = DynamicBagOfCellsDb::create();
+    dboc->set_loader(std::make_unique<CellLoader>(kv));
+  };
+
+  auto delete_root = [&] {
+    VLOG(boc) << "Delete root";
+    if (first_root_id == last_root_id) {
+      return;
+    }
+    dboc->dec(get_root(first_root_id));
+    first_root_id++;
+    VLOG(boc) << "  OK";
+  };
+
+  RandomSteps steps({{new_root, 10}, {delete_root, 9}, {commit, 2}, {reset, 1}});
+  while (first_root_id != total_roots) {
+    VLOG(boc) << first_root_id << " " << last_root_id << " " << kv->count("").ok();
+    steps.step(rnd);
+  }
+  commit();
+  ASSERT_EQ(0u, kv->count("").ok());
+}
+
+template <class BocDeserializerT>
+td::Status test_boc_deserializer(std::vector<Ref<Cell>> cells, int mode) {
+  auto total_data_cells_before = vm::DataCell::get_total_data_cells();
+  SCOPE_EXIT {
+    auto total_data_cells_after = vm::DataCell::get_total_data_cells();
+    ASSERT_EQ(total_data_cells_before, total_data_cells_after);
+  };
+  auto serialized = serialize_boc(cells, mode);
+  CHECK(serialized.size() != 0);
+
+  TRY_RESULT(boc_deserializer, BocDeserializerT::create(serialized));
+  TRY_RESULT(root_count, boc_deserializer->get_root_count());
+  ASSERT_EQ(cells.size(), root_count);
+
+  std::vector<Ref<Cell>> loaded_cells;
+  for (size_t root_i = 0; root_i < root_count; root_i++) {
+    TRY_RESULT(loaded_cell, boc_deserializer->get_root_cell(root_i));
+    auto cell = cells[root_i];
+    ASSERT_EQ(cell->get_level(), loaded_cell->get_level());
+    for (int i = 0; i <= (int)cell->get_level(); i++) {
+      ASSERT_EQ(cell->get_hash(i), loaded_cell->get_hash(i));
+    }
+    ASSERT_EQ(loaded_cell->get_hash(cell->get_level()), loaded_cell->get_hash());
+    loaded_cells.push_back(std::move(loaded_cell));
+  }
+
+  auto new_serialized = serialize_boc(std::move(loaded_cells), mode);
+  ASSERT_EQ(serialized, new_serialized);
+  return td::Status::OK();
+}
+
+template <class BocDeserializerT>
+td::Status test_boc_deserializer_threads(Ref<Cell> cell, int mode, td::Random::Xorshift128plus &rnd,
+                                         size_t threads_n = 4) {
+  auto serialized = serialize_boc(cell, mode);
+  CHECK(serialized.size() != 0);
+  std::vector<CellExplorer::Exploration> explorations;
+  for (size_t i = 0; i < threads_n; i++) {
+    explorations.push_back(CellExplorer::random_explore(cell, rnd));
+  }
+  TRY_RESULT(boc_deserializer, BocDeserializerT::create(serialized));
+  TRY_RESULT(root_count, boc_deserializer->get_root_count());
+  ASSERT_EQ(1u, root_count);
+  TRY_RESULT(loaded_cell, boc_deserializer->get_root_cell(0));
+  std::vector<td::thread> threads;
+  for (auto &exploration : explorations) {
+    threads.emplace_back([&] {
+      auto exploration2 = CellExplorer::explore(loaded_cell, exploration.ops);
+      ASSERT_EQ(exploration.log, exploration2.log);
+    });
+  }
+  for (auto &thread : threads) {
+    thread.join();
+  }
+
+  return td::Status::OK();
+}
+
+td::Status test_boc_deserializer_full(std::vector<Ref<Cell>> cells) {
+  for (auto mode : get_serialization_modes()) {
+    TRY_STATUS(vm::test_boc_deserializer<vm::StaticBagOfCellsDbBaseline>(cells, mode));
+    TRY_STATUS(vm::test_boc_deserializer<vm::StaticBagOfCellsDbLazy>(cells, mode));
+  }
+  return td::Status::OK();
+}
+td::Status test_boc_deserializer_full(Ref<Cell> cell) {
+  return test_boc_deserializer_full(std::vector<Ref<Cell>>{std::move(cell)});
+}
+
+template <class BocDeserializerT>
+void test_boc_deserializer() {
+  td::Random::Xorshift128plus rnd{123};
+  for (int t = 0; t < 1000; t++) {
+    auto cells = gen_random_cells(rnd.fast(1, 10), static_cast<int>(rnd() % 1000 + 1), rnd);
+    for (auto mode : get_serialization_modes()) {
+      test_boc_deserializer<BocDeserializerT>(cells, mode).ensure();
+    }
+  }
+}
+
+TEST(TonDb, BocDeserializerBaseline) {
+  test_boc_deserializer<StaticBagOfCellsDbBaseline>();
+}
+
+TEST(TonDb, BocDeserializerSimple) {
+  test_boc_deserializer<StaticBagOfCellsDbLazy>();
+}
+
+template <class BocDeserializerT>
+void test_boc_deserializer_threads() {
+  td::Random::Xorshift128plus rnd{123};
+  for (int t = 0; t < 20; t++) {
+    auto cell = gen_random_cell(static_cast<int>(rnd() % 1000 + 1), rnd);
+    for (auto mode : get_serialization_modes()) {
+      test_boc_deserializer_threads<BocDeserializerT>(cell, mode, rnd).ensure();
+    }
+  }
+}
+
+TEST(TonDb, BocDeserializerSimpleThreads) {
+  test_boc_deserializer_threads<StaticBagOfCellsDbLazy>();
+}
+
+class CompactArray {
+ public:
+  CompactArray(size_t size) {
+    root_ = create(size, 0);
+    size_ = size;
+  }
+  CompactArray(size_t size, Ref<Cell> root) {
+    root_ = std::move(root);
+    size_ = size;
+  }
+  CompactArray(td::Span<td::uint64> span) {
+    root_ = create(span);
+    size_ = span.size();
+  }
+  CompactArray(CompactArray &&other) = default;
+  CompactArray &operator=(CompactArray &&other) = default;
+
+  td::Slice hash() const {
+    return root()->get_hash().as_slice();
+  }
+  void set(size_t pos, td::uint64 value) {
+    root_ = set(root_, size_, pos, value);
+  }
+  td::uint64 get(size_t pos) {
+    return get(root_, size_, pos, nullptr);
+  }
+
+  const Ref<Cell> &root() const {
+    return root_;
+  }
+  size_t size() const {
+    return size_;
+  }
+
+  Ref<Cell> merkle_proof(std::vector<size_t> keys) {
+    std::set<Cell::Hash> hashes;
+    for (auto key : keys) {
+      get(root_, size_, key, &hashes);
+    }
+
+    auto is_prunned = [&](const Ref<Cell> &cell) { return hashes.count(cell->get_hash()) == 0; };
+    return MerkleProof::generate_raw(root_, is_prunned);
+  }
+
+ private:
+  Ref<Cell> root_;
+  size_t size_;
+
+  static Ref<DataCell> create_list(td::uint64 value) {
+    CellBuilder cb;
+    cb.store_long(value, 64);
+    return cb.finalize();
+  }
+  static Ref<DataCell> create_node(Ref<Cell> left, Ref<Cell> right) {
+    CellBuilder cb;
+    cb.store_ref(std::move(left));
+    cb.store_ref(std::move(right));
+    return cb.finalize();
+  }
+  static Ref<DataCell> create(size_t size, td::uint64 value) {
+    if (size == 1) {
+      return create_list(value);
+    }
+    return create_node(create(size / 2, value), create((size + 1) / 2, value));
+  }
+  static Ref<DataCell> create(td::Span<td::uint64> value) {
+    if (value.size() == 1) {
+      return create_list(value[0]);
+    }
+    return create_node(create(value.substr(0, value.size() / 2)), create(value.substr(value.size() / 2)));
+  }
+
+  static td::uint64 get(Ref<Cell> any_cell, size_t size, size_t pos, std::set<Cell::Hash> *hashes) {
+    if (hashes) {
+      hashes->insert(any_cell->get_hash());
+    }
+    CellSlice cs(NoVm(), any_cell);
+    assert(pos < size);
+    if (size == 1) {
+      return cs.fetch_long(64);
+    }
+    auto left = cs.fetch_ref();
+    if (pos < size / 2) {
+      return get(left, size / 2, pos, hashes);
+    }
+    pos -= size / 2;
+    auto right = cs.fetch_ref();
+    return get(right, (size + 1) / 2, pos, hashes);
+  }
+
+  static Ref<DataCell> set(Ref<Cell> any_cell, size_t size, size_t pos, td::uint64 value) {
+    CellSlice cs(NoVm(), any_cell);
+    assert(pos < size);
+    if (size == 1) {
+      return create_list(value);
+    }
+    //LOG(ERROR) << cell->size_refs() << " " << cell->size_bits();
+    auto left = cs.fetch_ref();
+    auto right = cs.fetch_ref();
+    if (pos < size / 2) {
+      left = set(left, size / 2, pos, value);
+    } else {
+      pos -= size / 2;
+      right = set(right, (size + 1) / 2, pos, value);
+    }
+    return create_node(left, right);
+  }
+};
+
+class FastCompactArray {
+ public:
+  FastCompactArray(size_t size) : v_(size) {
+  }
+  void set(size_t pos, td::uint64 value) {
+    v_.at(pos) = value;
+  }
+  td::uint64 get(size_t pos) {
+    return v_.at(pos);
+  }
+  td::Span<td::uint64> as_span() const {
+    return v_;
+  }
+
+ private:
+  std::vector<td::uint64> v_;
+};
+
+TEST(Cell, BocHands) {
+  serialize_boc(CellBuilder{}.store_bytes("AAAAAAAA").finalize());
+  auto a = CellBuilder{}.store_bytes("abcd").store_ref(CellBuilder{}.store_bytes("???").finalize()).finalize();
+  a = CellBuilder{}
+          .store_bits("XXX", 3)
+          .store_ref(CellBuilder::create_pruned_branch(std::move(a), Cell::max_level))
+          .finalize();
+  auto serialized = serialize_boc(a);
+  deserialize_boc(serialized);
+  deserialize_boc(serialize_boc(std::vector<Ref<Cell>>{a, a}));
+
+  // CHECK backward compatibility with
+  // serialized_boc_idx and serialized_boc_idx_crc32c
+  //auto serialized_idx_crc_x = serialize_boc(a, BagOfCells::WithIndex | BagOfCells::WithCRC32C);
+  //LOG(ERROR) << td::format::escaped(serialized_idx_crc_x);
+  std::string serialized_idx_crc =
+      td::Slice(
+          "\254\303\247(\001\001\002\001\000*\004*\201\001P\001\210H\001\004\024\271\313\264\253\277\265\350dN\250{,"
+          "\372\021\012:I\354\322|\255\245\330\204+&\345\214\026\300\064\000\001\032\231\063\274")
+          .str();
+  //auto serialized_idx_x = serialize_boc(a, BagOfCells::WithIndex);
+  //LOG(ERROR) << td::format::escaped(serialized_idx_x);
+  std::string serialized_idx =
+      td::Slice(
+          "h\377e\363\001\001\002\001\000*\004*\201\001P\001\210H\001\004\024\271\313\264\253\277\265\350dN\250{,"
+          "\372\021\012:I\354\322|\255\245\330\204+&\345\214\026\300\064\000\001")
+          .str();
+
+  ASSERT_EQ(serialized, serialize_boc(deserialize_boc(serialized_idx)));
+  ASSERT_EQ(serialized, serialize_boc(deserialize_boc(serialized_idx_crc)));
+}
+
+TEST(Cell, MerkleProofHands) {
+  // data has a reference, because we do not prune lists
+  auto data = CellBuilder{}.store_bytes("pruned data").store_ref(CellBuilder{}.finalize()).finalize();
+  auto prunned_data = CellBuilder::create_pruned_branch(data, data->get_level() + 1);
+  ASSERT_EQ(1u, prunned_data->get_level());
+  ASSERT_EQ(prunned_data->get_hash(0), data->get_hash(0));
+  ASSERT_EQ(data->get_hash(0), data->get_hash(1));
+  ASSERT_TRUE(prunned_data->get_hash(1) != prunned_data->get_hash(0));
+
+  auto node = CellBuilder{}.store_bytes("protected data").store_ref(data).finalize();
+  auto proof = CellBuilder{}.store_bits(node->get_data(), node->get_bits()).store_ref(prunned_data).finalize();
+  ASSERT_EQ(0u, node->get_level());
+  ASSERT_EQ(1u, proof->get_level());
+  ASSERT_EQ(proof->get_hash(0), node->get_hash(0));
+  ASSERT_TRUE(proof->get_hash(1) != node->get_hash(1));
+  test_boc_deserializer_full(proof).ensure();
+
+  auto merkle_proof = CellBuilder::create_merkle_proof(proof);
+  ASSERT_EQ(0u, merkle_proof->get_level());
+  test_boc_deserializer_full(merkle_proof).ensure();
+
+  {
+    auto virtual_node = proof->virtualize({0, 1});
+    ASSERT_EQ(0u, virtual_node->get_level());
+    ASSERT_EQ(1u, virtual_node->get_virtualization());
+    CellSlice cs{NoVm(), virtual_node};
+    auto virtual_data = cs.fetch_ref();
+    ASSERT_EQ(0u, virtual_data->get_level());
+    ASSERT_EQ(1u, virtual_data->get_virtualization());
+    ASSERT_EQ(data->get_hash(), virtual_data->get_hash());
+
+    auto virtual_node_copy =
+        CellBuilder{}.store_bits(node->get_data(), node->get_bits()).store_ref(virtual_data).finalize();
+    ASSERT_EQ(0u, virtual_node_copy->get_level());
+    ASSERT_EQ(1u, virtual_node_copy->get_virtualization());
+    ASSERT_EQ(virtual_node->get_hash(), virtual_node_copy->get_hash());
+
+    {
+      auto two_nodes = CellBuilder{}.store_ref(virtual_node).store_ref(node).finalize();
+      ASSERT_EQ(0u, two_nodes->get_level());
+      ASSERT_EQ(1u, two_nodes->get_virtualization());
+      CellSlice cs2(NoVm(), two_nodes);
+      ASSERT_EQ(1u, cs2.prefetch_ref(0)->get_virtualization());
+      ASSERT_EQ(0u, cs2.prefetch_ref(1)->get_virtualization());
+    }
+  }
+  LOG(ERROR) << td::NamedThreadSafeCounter::get_default();
+}
+
+TEST(Cell, MerkleProofArrayHands) {
+  // create simple array
+  CompactArray arr(17);
+  for (size_t i = 0; i < arr.size(); i++) {
+    arr.set(i, i / 3);
+  }
+
+  // create merke proof for 4 5 6 and 16th elements
+  std::vector<size_t> keys = {4, 5, 6, 16};
+  auto proof = arr.merkle_proof(keys);
+
+  ASSERT_EQ(1u, proof->get_level());
+  ASSERT_EQ(proof->get_hash(0), arr.root()->get_hash(0));
+  ASSERT_TRUE(proof->get_hash(1) != arr.root()->get_hash(1));
+  ASSERT_EQ(arr.root()->get_hash(0), arr.root()->get_hash(1));
+
+  CompactArray new_arr(arr.size(), proof->virtualize({0, 1}));
+  for (auto k : keys) {
+    ASSERT_EQ(arr.get(k), new_arr.get(k));
+  }
+  test_boc_deserializer_full(proof).ensure();
+  test_boc_deserializer_full(CellBuilder::create_merkle_proof(proof)).ensure();
+}
+TEST(Cell, MerkleUpdateHands) {
+  auto data = CellBuilder{}.store_bytes("pruned data").store_ref(CellBuilder{}.finalize()).finalize();
+  auto node = CellBuilder{}.store_bytes("protected data").store_ref(data).finalize();
+  auto other_node = CellBuilder{}.store_bytes("other protected data").store_ref(data).finalize();
+  auto usage_tree = std::make_shared<CellUsageTree>();
+  auto other_usage_tree = std::make_shared<CellUsageTree>();
+  auto usage_cell = UsageCell::create(node, usage_tree->root_ptr());
+  auto child = CellSlice(vm::NoVm(), usage_cell).prefetch_ref(0);
+  auto new_node = CellBuilder{}.store_bytes("new data").store_ref(child).finalize();
+  auto new_child = CellSlice(vm::NoVm(), new_node).prefetch_ref(0);
+  auto update = MerkleUpdate::generate(usage_cell, new_node, usage_tree.get());
+
+  MerkleUpdate::may_apply(node, update).ensure();
+  MerkleUpdate::validate(update).ensure();
+  auto x = MerkleUpdate::apply(node, update);
+  ASSERT_TRUE(serialize_boc(new_node) == serialize_boc(x));
+
+  MerkleUpdate::may_apply(other_node, update).ensure_error();
+  ASSERT_TRUE(MerkleUpdate::apply(other_node, update).is_null());
+  auto other_update = CellBuilder::create_merkle_update(CellBuilder::create_pruned_branch(other_node, 1),
+                                                        CellBuilder::create_pruned_branch(new_node, 1));
+  MerkleUpdate::may_apply(node, other_update).ensure_error();
+  MerkleUpdate::validate(other_update).ensure_error();
+  ASSERT_TRUE(MerkleUpdate::apply(other_node, other_update).is_null());
+  auto bad_update = CellBuilder::create_merkle_update(CellBuilder::create_pruned_branch(new_node, 1),
+                                                      CellBuilder::create_pruned_branch(other_node, 1));
+  CHECK(MerkleUpdate::combine(update, bad_update).is_null());
+}
+
+TEST(Cell, MerkleUpdateArray) {
+  // create simple array
+  size_t n = 1 << 20;
+  std::vector<td::uint64> data;
+  for (size_t i = 0; i < n; i++) {
+    data.push_back(i / 3);
+  }
+  CompactArray arr(data);
+  auto root = arr.root();
+  auto usage_tree = std::make_shared<CellUsageTree>();
+  auto usage_cell = UsageCell::create(root, usage_tree->root_ptr());
+  arr = CompactArray(n, usage_cell);
+  arr.set(n / 2, 0);
+  arr.set(n / 2 + 1, 1);
+  arr.set(n / 2 + 2, 2414221111);
+  arr.set(n / 2 + 3, 2);
+
+  auto update = MerkleUpdate::generate(usage_cell, arr.root(), usage_tree.get());
+  CellStorageStat stat;
+  stat.compute_used_storage(update, false);
+  ASSERT_EQ(stat.cells, 81u);
+  //CellSlice(NoVm(), update).print_rec(std::cerr);
+
+  check_merkle_update(root, arr.root(), update);
+}
+
+TEST(Cell, MerkleUpdateCombineArray) {
+  size_t n = 1 << 10;
+  std::vector<td::uint64> data;
+  for (size_t i = 0; i < n; i++) {
+    data.push_back(i / 3);
+  }
+  CompactArray arr(data);
+  auto from = arr.root();
+  std::shared_ptr<CellUsageTree> usage_tree;
+  Ref<Cell> usage_cell;
+
+  std::vector<Ref<Cell>> updates;
+
+  auto apply_op = [&](auto op) {
+    auto A = arr.root();
+    usage_tree = std::make_shared<CellUsageTree>();
+    usage_cell = UsageCell::create(arr.root(), usage_tree->root_ptr());
+    arr = CompactArray(n, usage_cell);
+    op();
+    updates.push_back(MerkleUpdate::generate(A, arr.root(), usage_tree.get()));
+  };
+
+  auto combine_all = [&]() {
+    while (updates.size() > 1) {
+      size_t i = updates.size() - 2;
+      updates[i] = MerkleUpdate::combine(updates[i], updates[i + 1]);
+      updates.pop_back();
+      CellStorageStat stat;
+      stat.compute_used_storage(updates[i], false);
+    }
+  };
+  auto validate = [&](size_t size) {
+    combine_all();
+    check_merkle_update(from, arr.root(), updates.at(0));
+    CellStorageStat stat;
+    stat.compute_used_storage(updates[0], false);
+    if (size != 0) {
+      ASSERT_EQ(size, stat.cells);
+    }
+  };
+  apply_op([] {});
+  validate(3);
+  apply_op([] {});
+  apply_op([] {});
+  apply_op([] {});
+  validate(3);
+
+  apply_op([&] {
+    for (size_t i = 0; i < n; i++) {
+      arr.set(i, i / 3 + 10);
+    }
+  });
+  apply_op([&] {
+    for (size_t i = 0; i < n; i++) {
+      arr.set(i, i / 3);
+    }
+  });
+  validate(3);
+
+  for (size_t i = 0; i + 1 < n; i++) {
+    apply_op([&] {
+      arr.set(i, i / 3 + 1);
+      if (i != 0) {
+        arr.set(i - 1, (i - 1) / 3);
+      }
+    });
+  }
+
+  validate(41);
+}
+
+}  // namespace vm
+
+class BenchBocSerializerImport : public td::Benchmark {
+ public:
+  BenchBocSerializerImport() {
+    std::vector<td::uint64> v(array_size);
+    td::Random::Xorshift128plus rnd{123};
+    for (auto &x : v) {
+      x = rnd();
+    }
+    arr = vm::CompactArray(v);
+    //serialization_ = td::BufferSlice(boc.serialize_to_string(15));
+  }
+  std::string get_description() const override {
+    return "BenchBocSerializer";
+  }
+
+  void run(int n) override {
+    for (int i = 0; i < n; i++) {
+      vm::BagOfCells boc;
+      boc.add_root(arr.root());
+      boc.import_cells().ensure();
+    }
+  }
+
+ private:
+  td::BufferSlice serialization_;
+  static constexpr td::uint32 array_size = 1024;
+  vm::CompactArray arr{1};
+};
+
+class BenchBocSerializerSerialize : public td::Benchmark {
+ public:
+  BenchBocSerializerSerialize() {
+    std::vector<td::uint64> v(array_size);
+    td::Random::Xorshift128plus rnd{123};
+    for (auto &x : v) {
+      x = rnd();
+    }
+    arr = vm::CompactArray(v);
+    boc.add_root(arr.root());
+    boc.import_cells().ensure();
+  }
+  std::string get_description() const override {
+    return "BenchBocSerializer";
+  }
+
+  void run(int n) override {
+    for (int i = 0; i < n; i++) {
+      boc.serialize_to_string(31);
+    }
+  }
+
+ private:
+  td::BufferSlice serialization_;
+  static constexpr td::uint32 array_size = 1024;
+  vm::CompactArray arr{1};
+  vm::BagOfCells boc;
+};
+
+struct BenchBocDeserializerConfig {
+  enum BlobType { File, Memory, FileMemoryMap, RocksDb } blob_type;
+  int k{100};
+  enum Mode { Prefix, Range, Random } mode{Random};
+  bool with_index{true};
+  int threads_n{1};
+};
+
+td::StringBuilder &operator<<(td::StringBuilder &sb, const BenchBocDeserializerConfig &config) {
+  sb << "load from ";
+  switch (config.blob_type) {
+    case BenchBocDeserializerConfig::File:
+      sb << "file";
+      break;
+    case BenchBocDeserializerConfig::Memory:
+      sb << "memory";
+      break;
+    case BenchBocDeserializerConfig::FileMemoryMap:
+      sb << "file mmap";
+      break;
+    case BenchBocDeserializerConfig::RocksDb:
+      sb << "rocksdb";
+      break;
+  }
+  sb << td::tag("k", config.k) << " ";
+  switch (config.mode) {
+    case BenchBocDeserializerConfig::Prefix:
+      sb << "prefix";
+      break;
+    case BenchBocDeserializerConfig::Range:
+      sb << "range";
+      break;
+    case BenchBocDeserializerConfig::Random:
+      sb << "random";
+      break;
+  }
+  sb << " " << (config.with_index ? "with" : "without") << " index";
+  sb << " " << config.threads_n << " threads";
+  return sb;
+}
+
+template <class DeserializerT>
+class BenchBocDeserializer : public td::Benchmark {
+ public:
+  BenchBocDeserializer(std::string name, BenchBocDeserializerConfig config) : name_(std::move(name)), config_(config) {
+    fast_array_ = vm::FastCompactArray(array_size);
+    td::Random::Xorshift128plus rnd{123};
+    for (td::uint32 i = 0; i < array_size; i++) {
+      auto val = rnd();
+      fast_array_.set(i, val);
+    }
+    vm::CompactArray arr(fast_array_.as_span());
+    auto db_path = "serialization_rocksdb";
+    if (config.blob_type == BenchBocDeserializerConfig::RocksDb) {
+      {
+        td::RocksDb::destroy(td::Slice(db_path)).ensure();
+        auto db = vm::TonDbImpl::open(td::Slice(db_path)).move_as_ok();
+        auto txn = db->begin_transaction();
+        auto smt = txn->begin_smartcontract();
+        SCOPE_EXIT {
+          db->commit_transaction(std::move(txn));
+        };
+        SCOPE_EXIT {
+          txn->commit_smartcontract(std::move(smt));
+        };
+        smt->set_root(arr.root());
+      }
+      db_ = vm::TonDbImpl::open(td::Slice(db_path)).move_as_ok();
+    } else {
+      serialization_ = td::BufferSlice(serialize_boc(
+          arr.root(), vm::BagOfCells::WithIntHashes | vm::BagOfCells::WithTopHash |
+                          (config.with_index ? vm::BagOfCells::WithIndex | vm::BagOfCells::WithCacheBits : 0)));
+
+      if (config.blob_type == BenchBocDeserializerConfig::File ||
+          config.blob_type == BenchBocDeserializerConfig::FileMemoryMap) {
+        td::unlink("serialization").ignore();
+        td::write_file("serialization", serialization_.as_slice()).ensure();
+      }
+    }
+    root_ = arr.root();
+  }
+  std::string get_description() const override {
+    return PSTRING() << "BocDeserializer " << name_ << " " << config_;
+  }
+
+  vm::Ref<vm::Cell> load_root() {
+    if (config_.blob_type == BenchBocDeserializerConfig::RocksDb) {
+      auto txn = db_->begin_transaction();
+      auto smt = txn->begin_smartcontract();
+      SCOPE_EXIT {
+        db_->abort_transaction(std::move(txn));
+      };
+      SCOPE_EXIT {
+        txn->commit_smartcontract(std::move(smt));
+      };
+      LOG(ERROR) << "load root from rocksdb";
+      return smt->get_root();
+    }
+    auto blob = [&] {
+      switch (config_.blob_type) {
+        case BenchBocDeserializerConfig::File:
+          return vm::FileBlobView::create("serialization").move_as_ok();
+        case BenchBocDeserializerConfig::Memory:
+          return vm::BufferSliceBlobView::create(serialization_.clone());
+        case BenchBocDeserializerConfig::FileMemoryMap:
+          return vm::FileMemoryMappingBlobView::create("serialization").move_as_ok();
+        default:
+          UNREACHABLE();
+      }
+      UNREACHABLE();
+    }();
+    auto boc_deserializer = DeserializerT::create(std::move(blob)).move_as_ok();
+    ASSERT_EQ(1u, boc_deserializer->get_root_count().move_as_ok());
+    return boc_deserializer->get_root_cell(0).move_as_ok();
+  }
+
+  void run(int n) override {
+    td::Random::Xorshift128plus rnd{123};
+
+    std::vector<td::thread> threads;
+    //TODO: use config.k
+    auto K = config_.k == 0 ? n : config_.k;
+    td::Stage stage;
+    vm::Ref<vm::Cell> root;
+    for (int t = 0; t < config_.threads_n; t++) {
+      threads.emplace_back([&, seed = rnd(), thread_i = t] {
+        for (int round_i = 0; round_i < n / K; round_i++) {
+          if (thread_i == 0) {
+            root = load_root();
+          }
+          stage.wait(config_.threads_n * (2 * round_i + 1));
+
+          vm::CompactArray array(array_size, root);
+          td::Random::Xorshift128plus rnd{seed};
+          td::uint64 start_pos =
+              config_.mode == BenchBocDeserializerConfig::Range ? array_size / config_.threads_n * thread_i : 0;
+          for (int k = 0; k < K; k++) {
+            auto pos = start_pos;
+            switch (config_.mode) {
+              case BenchBocDeserializerConfig::Prefix:
+              case BenchBocDeserializerConfig::Range:
+                pos = (pos + k) % array_size;
+                break;
+              case BenchBocDeserializerConfig::Random:
+                pos = rnd() % array_size;
+                break;
+            }
+            ASSERT_EQ(fast_array_.get(td::narrow_cast<std::size_t>(pos)), array.get(td::narrow_cast<std::size_t>(pos)));
+          }
+          stage.wait(config_.threads_n * (2 * round_i + 2));
+        }
+      });
+    }
+    for (auto &thread : threads) {
+      thread.join();
+    }
+  }
+
+ private:
+  std::string name_;
+  td::BufferSlice serialization_;
+  BenchBocDeserializerConfig config_;
+  static constexpr td::uint32 array_size = 1024 * 1024;
+  vm::FastCompactArray fast_array_{array_size};
+  vm::Ref<vm::Cell> root_;
+  vm::TonDb db_;
+};
+
+TEST(TonDb, BenchBocSerializerImport) {
+  if (0) {
+    BenchBocSerializerImport b;
+    while (true) {
+      td::bench_n(b, 1000000);
+    }
+  }
+  td::bench(BenchBocSerializerImport());
+}
+TEST(TonDb, BenchBocSerializerSerialize) {
+  td::bench(BenchBocSerializerSerialize());
+}
+
+template <class DeserializerT>
+void bench_deserializer(std::string name, bool full) {
+  using Config = BenchBocDeserializerConfig;
+  if (full) {
+    for (auto k : {1, 10, 100}) {
+      for (auto with_index : {false, true}) {
+        for (auto mode : {Config::Prefix, Config::Range, Config::Random}) {
+          for (auto blob_type : {Config::Memory, Config::File, Config::FileMemoryMap}) {
+            BenchBocDeserializerConfig config;
+            config.k = k;
+            config.with_index = with_index;
+            config.mode = mode;
+            config.blob_type = blob_type;
+            td::bench(BenchBocDeserializer<DeserializerT>(name, config));
+          }
+        }
+      }
+    }
+  } else {
+    td::bench(BenchBocDeserializer<DeserializerT>(name, BenchBocDeserializerConfig()));
+  }
+}
+template <class DeserializerT>
+void bench_deserializer_threads(std::string name) {
+  using Config = BenchBocDeserializerConfig;
+  for (auto threads_n : {1, 4, 16}) {
+    //for (auto threads_n : {16}) {
+    //for (auto with_index : {false, true}) {
+    //for (auto mode : {BenchBocDeserializerConfig::Prefix, BenchBocDeserializerConfig::Range,
+    //BenchBocDeserializerConfig::Random}) {
+    //for (auto from_file : {false, true}) {
+    BenchBocDeserializerConfig config;
+    config.threads_n = threads_n;
+    config.k = 0;
+    config.with_index = true;
+    config.mode = Config::Random;
+    config.mode = Config::Range;
+    config.mode = Config::Prefix;
+    config.blob_type = Config::Memory;
+    td::bench(BenchBocDeserializer<DeserializerT>(name, config));
+    //td::bench_n(BenchBocThreadsDeserializer<DeserializerT>(name, config), 1000000);
+    //}
+    //}
+    //}
+  }
+}
+
+TEST(TonDb, BenchBocThreadsDeserializerSimple) {
+  //td::bench_n(BenchBocDeserializer<vm::StaticBagOfCellsDbLazy>("simple", BenchBocDeserializerConfig()), 1000000);
+  //std::exit(0);
+  bench_deserializer_threads<vm::StaticBagOfCellsDbLazy>("simple");
+}
+TEST(TonDb, BenchBocDeserializerSimple) {
+  //td::bench_n(BenchBocDeserializer<vm::StaticBagOfCellsDbLazy>("simple", BenchBocDeserializerConfig()), 1000000);
+  //std::exit(0);
+  bench_deserializer<vm::StaticBagOfCellsDbLazy>("simple", false);
+}
+TEST(TonDb, BenchBocDeserializerBaseline) {
+  //td::bench_n(BenchBocDeserializer<vm::StaticBagOfCellsDbBaseline>("baseline", BenchBocDeserializerConfig()), 1000000);
+  //std::exit(0);
+  bench_deserializer<vm::StaticBagOfCellsDbBaseline>("baseline", false);
+}
+TEST(TonDb, BenchBocDeserializerRocksDb) {
+  //td::bench_n(BenchBocDeserializer<vm::StaticBagOfCellsDbBaseline>("baseline", BenchBocDeserializerConfig()), 1000000);
+  //std::exit(0);
+  auto config = BenchBocDeserializerConfig();
+  config.blob_type = BenchBocDeserializerConfig::RocksDb;
+  config.threads_n = 4;
+  config.k = 0;
+  td::bench(BenchBocDeserializer<vm::StaticBagOfCellsDbBaseline>("rockdb", config));
+}
+
+TEST(TonDb, CompactArray) {
+  SET_VERBOSITY_LEVEL(VERBOSITY_NAME(ERROR));
+  td::Slice db_path = "compact_array_db";
+  td::RocksDb::destroy(db_path).ensure();
+
+  td::Random::Xorshift128plus rnd(123);
+
+  auto next_array_size = [&rnd]() {
+    static std::vector<size_t> array_sizes = {1, 2, 4, 10, 37, 100, 1000, 10000};
+    return array_sizes[rnd() % array_sizes.size()];
+  };
+
+  vm::CompactArray array(2);
+  vm::FastCompactArray fast_array(2);
+  auto next_pos = [&] { return static_cast<size_t>(rnd() % array.size()); };
+
+  auto db = vm::TonDbImpl::open(db_path).move_as_ok();
+  auto txn = db->begin_transaction();
+  auto smt = txn->begin_smartcontract();
+  SCOPE_EXIT {
+    db->commit_transaction(std::move(txn));
+  };
+  SCOPE_EXIT {
+    txn->commit_smartcontract(std::move(smt));
+  };
+
+  auto flush_to_db = [&] {
+    if (rnd() % 10 != 0) {
+      return;
+    }
+    bool restart_db = rnd() % 20 == 0;
+    bool reload_array = rnd() % 5 == 0;
+    smt->set_root(array.root());
+    txn->commit_smartcontract(std::move(smt));
+    db->commit_transaction(std::move(txn));
+    if (restart_db) {
+      db->clear_cache();
+      //db.reset();
+      //db = vm::TonDbImpl::open(db_path).move_as_ok();
+    }
+    txn = db->begin_transaction();
+    smt = txn->begin_smartcontract();
+    smt->validate_meta().ensure();
+    ASSERT_EQ(smt->get_root()->get_hash(), array.root()->get_hash());
+    if (reload_array) {
+      auto size = array.size();
+      array = vm::CompactArray(size, smt->get_root());
+    }
+  };
+
+  auto do_validate = [&](size_t pos) { ASSERT_EQ(array.get(pos), fast_array.get(pos)); };
+  auto validate = [&] { do_validate(next_pos()); };
+  auto validate_full = [&] {
+    for (size_t pos = 0; pos < array.size(); pos++) {
+      do_validate(pos);
+    }
+  };
+
+  auto set_value = [&] {
+    auto pos = static_cast<size_t>(rnd() % array.size());
+    auto value = rnd() % 3;
+    array.set(pos, value);
+    fast_array.set(pos, value);
+  };
+
+  auto reset_array = [&] {
+    auto size = next_array_size();
+    array = vm::CompactArray(size);
+    fast_array = vm::FastCompactArray(size);
+  };
+
+  RandomSteps steps({{reset_array, 1}, {set_value, 1000}, {validate, 10}, {validate_full, 2}, {flush_to_db, 1}});
+  for (size_t t = 0; t < 100000; t++) {
+    if (t % 10000 == 0) {
+      LOG(ERROR) << t;
+    }
+    steps.step(rnd);
+  }
+};
+
+TEST(TonDb, CompactArrayOld) {
+  SET_VERBOSITY_LEVEL(VERBOSITY_NAME(ERROR));
+  using namespace vm;
+  //auto kv = std::make_unique<MemoryKeyValue>();
+  td::RocksDb::destroy("ttt").ensure();
+
+  auto ton_db = vm::TonDbImpl::open("ttt").move_as_ok();
+
+  //auto storage = std::make_unique<CellStorage>(kv.get());
+
+  size_t array_size = 1000;
+  std::string hash;
+  td::Random::Xorshift128plus rnd(123);
+  FastCompactArray fast_array(array_size);
+  {
+    auto txn = ton_db->begin_transaction();
+    SCOPE_EXIT {
+      ton_db->commit_transaction(std::move(txn));
+    };
+    auto smart = txn->begin_smartcontract("");
+    SCOPE_EXIT {
+      txn->commit_smartcontract(std::move(smart));
+    };
+    CompactArray arr(array_size);
+    arr.set(array_size / 2, 124);
+    fast_array.set(array_size / 2, 124);
+    //for (size_t i = 0; i < array_size; i++) {
+    //int x = rnd() % 2;
+    //arr.set(i, x);
+    //fast_array.set(i, x);
+    //}
+    smart->set_root(arr.root());
+    LOG(ERROR) << smart->get_root()->get_hash().to_hex();
+  }
+  //LOG(ERROR) << "OK";
+
+  for (int i = 0; i < 100; i++) {
+    if (i % 10 == 9) {
+      //LOG(ERROR) << ton_db->stat();
+      ton_db.reset();
+      ton_db = vm::TonDbImpl::open("ttt").move_as_ok();
+    }
+    auto txn = ton_db->begin_transaction();
+    SCOPE_EXIT {
+      ton_db->commit_transaction(std::move(txn));
+    };
+    auto smart = txn->begin_smartcontract("");
+    //smart->validate_meta();
+    SCOPE_EXIT {
+      txn->commit_smartcontract(std::move(smart));
+    };
+    if (i % 1000 == 0) {
+      LOG(ERROR) << "i = " << i;
+    }
+    CompactArray arr(array_size, smart->get_root());
+    auto key = static_cast<size_t>(rnd() % array_size);
+    auto value = rnd() % 2;
+    arr.set(key, value);
+    fast_array.set(key, value);
+    smart->set_root(arr.root());
+    //LOG(ERROR) << storage->size();
+  }
+  {
+    auto txn = ton_db->begin_transaction();
+    SCOPE_EXIT {
+      ton_db->abort_transaction(std::move(txn));
+    };
+    auto smart = txn->begin_smartcontract("");
+    SCOPE_EXIT {
+      txn->abort_smartcontract(std::move(smart));
+    };
+
+    CompactArray arr(array_size, smart->get_root());
+    for (size_t i = 0; i < array_size; i++) {
+      ASSERT_EQ(fast_array.get(i), arr.get(i));
+    }
+  }
+}
+
+TEST(TonDb, StackOverflow) {
+  try {
+    td::Ref<vm::Cell> cell = vm::CellBuilder().finalize();
+    for (int i = 0; i < 10000000; i++) {
+      vm::CellBuilder cb;
+      cb.store_ref(std::move(cell));
+      cell = cb.finalize();
+    }
+    LOG(ERROR) << "A";
+    vm::test_boc_deserializer<vm::StaticBagOfCellsDbBaseline>({cell}, 31);
+    LOG(ERROR) << "B";
+    vm::test_boc_deserializer<vm::StaticBagOfCellsDbLazy>({cell}, 31);
+    LOG(ERROR) << "C";
+  } catch (...) {
+  }
+
+  struct A : public td::CntObject {
+    explicit A(td::Ref<A> next) : next(next) {
+    }
+    td::Ref<A> next;
+  };
+  {
+    td::Ref<A> head;
+    for (int i = 0; i < 10000000; i++) {
+      td::Ref<A> new_head = td::Ref<A>(true, std::move(head));
+      head = std::move(new_head);
+    }
+  }
+}
+
+TEST(TonDb, BocRespectsUsageCell) {
+  td::Random::Xorshift128plus rnd(123);
+  auto cell = vm::gen_random_cell(20, rnd, true);
+  auto usage_tree = std::make_shared<vm::CellUsageTree>();
+  auto usage_cell = vm::UsageCell::create(cell, usage_tree->root_ptr());
+  auto serialization = serialize_boc(usage_cell);
+  auto proof = vm::MerkleProof::generate(cell, usage_tree.get());
+  auto virtualized_proof = vm::MerkleProof::virtualize(proof, 1);
+  auto serialization_of_virtualized_cell = serialize_boc(virtualized_proof);
+  ASSERT_STREQ(serialization, serialization_of_virtualized_cell);
+}
+
+TEST(TonDb, DynamicBocRespectsUsageCell) {
+  td::Random::Xorshift128plus rnd(123);
+  auto cell = vm::gen_random_cell(20, rnd, true);
+  auto usage_tree = std::make_shared<vm::CellUsageTree>();
+  auto usage_cell = vm::UsageCell::create(cell, usage_tree->root_ptr());
+
+  auto kv = std::make_shared<td::MemoryKeyValue>();
+  auto dboc = vm::DynamicBagOfCellsDb::create();
+  dboc->set_loader(std::make_unique<vm::CellLoader>(kv));
+  dboc->inc(usage_cell);
+  {
+    vm::CellStorer cell_storer(*kv);
+    dboc->commit(cell_storer);
+  }
+
+  auto proof = vm::MerkleProof::generate(cell, usage_tree.get());
+  auto virtualized_proof = vm::MerkleProof::virtualize(proof, 1);
+  auto serialization_of_virtualized_cell = serialize_boc(virtualized_proof);
+  auto serialization = serialize_boc(cell);
+  ASSERT_STREQ(serialization, serialization_of_virtualized_cell);
+}
+
+TEST(TonDb, DoNotMakeListsPrunned) {
+  auto cell = vm::CellBuilder().store_bytes("abc").finalize();
+  auto is_prunned = [&](const td::Ref<vm::Cell> &cell) { return true; };
+  auto proof = vm::MerkleProof::generate(cell, is_prunned);
+  auto virtualized_proof = vm::MerkleProof::virtualize(proof, 1);
+  ASSERT_TRUE(virtualized_proof->get_virtualization() == 0);
+}
+
+TEST(TonDb, CellStat) {
+  td::Random::Xorshift128plus rnd(123);
+  bool with_prunned_branches = true;
+  for (int i = 0; i < 1000; i++) {
+    auto A = vm::gen_random_cell(100, rnd, with_prunned_branches);
+    td::Ref<vm::Cell> B, AB, B_proof;
+    std::shared_ptr<vm::CellUsageTree> usage_tree;
+    std::tie(B, AB, usage_tree) = gen_merkle_update(A, rnd, with_prunned_branches);
+    B_proof = vm::CellSlice(vm::NoVm(), AB).prefetch_ref(1);
+
+    vm::CellStorageStat stat;
+    stat.add_used_storage(B);
+
+    vm::NewCellStorageStat new_stat;
+    new_stat.add_cell({});
+    new_stat.add_cell(B);
+    ASSERT_EQ(stat.cells, new_stat.get_stat().cells);
+    ASSERT_EQ(stat.bits, new_stat.get_stat().bits);
+
+    vm::CellStorageStat proof_stat;
+    proof_stat.add_used_storage(B_proof);
+
+    vm::NewCellStorageStat new_proof_stat;
+    new_proof_stat.add_proof(B, usage_tree.get());
+    CHECK(new_proof_stat.get_stat().cells == 0);
+    CHECK(new_proof_stat.get_proof_stat().cells <= proof_stat.cells);
+    //CHECK(new_proof_stat.get_proof_stat().cells + new_proof_stat.get_proof_stat().external_refs >= proof_stat.cells);
+
+    vm::NewCellStorageStat new_all_stat;
+    new_all_stat.add_cell_and_proof(B, usage_tree.get());
+    CHECK(new_proof_stat.get_proof_stat() == new_all_stat.get_proof_stat());
+    CHECK(new_stat.get_stat() == new_all_stat.get_stat());
+
+    stat.add_used_storage(A);
+    auto AB_stat = new_stat.get_stat() + const_cast<vm::NewCellStorageStat &>(new_stat).tentative_add_cell(A);
+    new_stat.add_cell(A);
+    CHECK(AB_stat == new_stat.get_stat());
+    ASSERT_EQ(stat.cells, new_stat.get_stat().cells);
+    ASSERT_EQ(stat.bits, new_stat.get_stat().bits);
+
+    CHECK(usage_tree.unique());
+    usage_tree.reset();
+    td::Ref<vm::Cell> C, BC, C_proof;
+    std::shared_ptr<vm::CellUsageTree> usage_tree_B;
+    std::tie(C, BC, usage_tree_B) = gen_merkle_update(B, rnd, with_prunned_branches);
+    C_proof = vm::CellSlice(vm::NoVm(), BC).prefetch_ref(1);
+
+    auto BC_proof_stat = new_proof_stat.get_proof_stat() + new_proof_stat.tentative_add_proof(C, usage_tree_B.get());
+    new_proof_stat.add_proof(C, usage_tree_B.get());
+    CHECK(BC_proof_stat == new_proof_stat.get_proof_stat());
+  }
+}
+
+struct String {
+  String() {
+    total_strings.add(1);
+  }
+  String(std::string str) : str(std::move(str)) {
+    total_strings.add(1);
+  }
+  ~String() {
+    total_strings.add(-1);
+  }
+  static td::ThreadSafeCounter total_strings;
+  std::string str;
+};
+
+td::ThreadSafeCounter String::total_strings;
+TEST(Ref, AtomicRef) {
+  struct Node {
+    td::AtomicRefLockfree<td::Cnt<String>> name_;
+    char pad[64];
+  };
+
+  int threads_n = 10;
+  std::vector<Node> nodes(threads_n);
+  std::vector<td::thread> threads(threads_n);
+  int thread_id = 0;
+  for (auto &thread : threads) {
+    thread = td::thread([&] {
+      for (int i = 0; i < 1000000; i++) {
+        auto &node = nodes[td::Random::fast(0, threads_n / 3 - 1)];
+        auto name = node.name_.load();
+        if (name.not_null()) {
+          CHECK(name->str == "one" || name->str == "twotwo");
+        }
+        if (td::Random::fast(0, 5) == 0) {
+          auto new_string = td::Ref<td::Cnt<String>>{true, td::Random::fast(0, 1) == 0 ? "one" : "twotwo"};
+          node.name_.store(std::move(new_string));
+        }
+      }
+    });
+    thread_id++;
+  }
+  for (auto &thread : threads) {
+    thread.join();
+  }
+  nodes.clear();
+  LOG(ERROR) << String::total_strings.sum();
+}
+
+//TEST(Tmp, Boc) {
+//LOG(ERROR) << "A";
+//auto data = td::read_file("boc");
+//LOG(ERROR) << "B";
+//auto cell = vm::deserialize_boc(data.move_as_ok().as_slice());
+//vm::CellStorageStat stat;
+//stat.add_used_storage(cell, false);
+//LOG(ERROR) << stat.cells;
+////LOG(ERROR) << "C";
+////auto new_data = vm::serialize_boc(cell);
+////LOG(ERROR) << "D";
+//vm::test_boc_deserializer<vm::StaticBagOfCellsDbLazy>({cell}, 31);
+//}
diff --git a/submodules/ton/tonlib-src/crypto/test/test-ed25519-crypto.cpp b/submodules/ton/tonlib-src/crypto/test/test-ed25519-crypto.cpp
new file mode 100644
index 0000000000..85ae51499b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/test-ed25519-crypto.cpp
@@ -0,0 +1,314 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <iostream>
+#include <iomanip>
+#include <string>
+#include <cstring>
+
+#include "crypto/ellcurve/Ed25519.h"
+
+static void my_assert_impl(bool cond, const char* str, const char* file, int line) {
+  if (!cond) {
+    std::cerr << "Failed " << str << " in " << file << " at " << line << ".\n";
+  }
+}
+#define my_assert(x) my_assert_impl(x, #x, __FILE__, __LINE__)
+
+void print_buffer(const unsigned char buffer[32]) {
+  for (int i = 0; i < 32; i++) {
+    char buff[4];
+    sprintf(buff, "%02x", buffer[i]);
+    std::cout << buff;
+  }
+}
+
+std::string buffer_to_hex(const unsigned char* buffer, std::size_t size = 32) {
+  const char* hex = "0123456789ABCDEF";
+  std::string res(2 * size, '\0');
+  for (std::size_t i = 0; i < size; i++) {
+    auto c = buffer[i];
+    res[2 * i] = hex[c & 15];
+    res[2 * i + 1] = hex[c >> 4];
+  }
+  return res;
+}
+
+// export of (17/12)G on twisted Edwards curve
+unsigned char test_vector1[32] = {0xfc, 0xb7, 0x42, 0x1e, 0x26, 0xad, 0x1b, 0x17, 0xf6, 0xb1, 0x52,
+                                  0x0c, 0xdb, 0x8a, 0x64, 0x7d, 0x28, 0xa7, 0x56, 0x69, 0xd4, 0xb6,
+                                  0x0c, 0xec, 0x63, 0x72, 0x5e, 0xe6, 0x32, 0x4d, 0xf7, 0xe6};
+
+unsigned char rfc7748_output[32] = {
+    0x95, 0xcb, 0xde, 0x94, 0x76, 0xe8, 0x90, 0x7d, 0x7a, 0xad, 0xe4, 0x5c, 0xb4, 0xb8, 0x73, 0xf8,
+    0x8b, 0x59, 0x5a, 0x68, 0x79, 0x9f, 0xa1, 0x52, 0xe6, 0xf8, 0xf7, 0x64, 0x7a, 0xac, 0x79, 0x57,
+};
+
+bool test_ed25519_impl(void) {
+  std::cout << "************** Testing Curve25519 / Ed25519 operations ************\n";
+  auto& E = ellcurve::Curve25519();
+  auto& Edw = ellcurve::Ed25519();
+  arith::Bignum L = E.get_ell();
+  my_assert(arith::is_prime(L));
+  my_assert(L == Edw.get_ell());
+  arith::ResidueRing Fl(L);
+  arith::Bignum s = Fl.frac(17, 12).extract();
+  arith::Bignum t = Fl.frac(12, 17).extract();
+  std::cout << "l = " << L << std::endl;
+  std::cout << "s = 17/12 mod l = " << s << std::endl;
+  std::cout << "t = 12/17 mod l = " << t << std::endl;
+  auto sG = E.power_gen_xz(s);
+  auto u_sG = sG.get_u();
+  std::cout << "Curve25519 u(sG) = " << sG.get_u().extract() << std::endl;
+  std::cout << "Curve25519 y(sG) = " << sG.get_y().extract() << std::endl;
+  auto sG1 = Edw.power_gen(s);
+  std::cout << "Ed25519 u(sG) = " << sG1.get_u().extract() << std::endl;
+  std::cout << "Ed25519 y(sG) = " << sG1.get_y().extract() << std::endl;
+  std::cout << "Ed25519 x(sG) = " << sG1.get_x().extract() << std::endl;
+  my_assert(sG1.get_x().extract() != sG1.get_y().extract());
+  my_assert(sG.get_u() == sG1.get_u());
+  my_assert(sG.get_y() == sG1.get_y());
+
+  my_assert(
+      sG1.get_x().extract() ==
+      arith::Bignum(arith::dec_string{"9227429025021714590777223519505276506601225973596506606120015751301699519597"}));
+  my_assert(sG1.get_y().extract() ==
+            arith::Bignum(
+                arith::dec_string{"46572854587220149033453000581008590225032365765275643343836649812808016508924"}));
+
+  auto sG2 = Edw.power_gen(s, true);
+  my_assert(sG1.get_u() == sG2.get_u());
+  my_assert(sG1.get_y() == sG2.get_y());
+  unsigned char buff[32];
+  std::memset(buff, 0, 32);
+  my_assert(sG1.export_point(buff));
+  std::cout << "sG export = " << buffer_to_hex(buff) << std::endl;
+  bool ok;
+  auto sG3 = Edw.import_point(buff, ok);
+  my_assert(ok);
+  my_assert(!std::memcmp(buff, test_vector1, 32));
+  my_assert(sG3.get_u() == sG1.get_u());
+  my_assert(sG2.get_x() == sG2.get_x());
+  my_assert(sG2.get_y() == sG2.get_y());
+
+  auto stG = E.power_xz(u_sG, t);
+  std::cout << "Curve25519 u(stG) = " << stG.get_u().extract() << std::endl;
+  my_assert(stG.get_u().extract() == 9);
+  auto stG1 = Edw.power_point(sG1, t);
+  std::cout << "Ed25519 u(stG) = " << stG1.get_u().extract() << std::endl;
+  my_assert(stG1.get_u().extract() == 9);
+  stG1.normalize();
+  my_assert(stG1.XY == Edw.get_base_point().XY);
+  my_assert(stG1.X == Edw.get_base_point().X);
+  my_assert(stG1.Y == Edw.get_base_point().Y);
+  my_assert(stG1.Z == Edw.get_base_point().Z);
+  auto stG2 = Edw.power_point(sG2, t, true);
+  my_assert(stG2.get_u().extract() == 9);
+  stG2.normalize();
+  my_assert(stG2.XY == stG1.XY && stG2.X == stG1.X && stG2.Y == stG1.Y);
+  auto stG3 = Edw.power_point(sG3, t).normalize();
+  auto stG4 = Edw.power_point(sG3, t, true).normalize();
+  my_assert(stG3.XY == stG1.XY && stG3.X == stG1.X && stG3.Y == stG1.Y);
+  my_assert(stG4.XY == stG1.XY && stG4.X == stG1.X && stG4.Y == stG1.Y);
+
+  // RFC7748 test vector
+  auto u =
+      arith::Bignum(arith::dec_string{"8883857351183929894090759386610649319417338800022198945255395922347792736741"});
+  //u[255] = 0;
+  auto n =
+      arith::Bignum(arith::dec_string{"35156891815674817266734212754503633747128614016119564763269015315466259359304"});
+  //n[255] = 0; n[254] = 1;
+  //n[0] = n[1] = n[2] = 0;
+  auto umodp = arith::Residue(u, E.get_base_ring());
+  auto nP = E.power_xz(umodp, n);
+  std::cout << "u(P) = " << u.to_hex() << std::endl;
+  std::cout << "n = " << n.to_hex() << std::endl;
+  std::cout << "u(nP) = " << nP.get_u().extract().to_hex() << std::endl;
+  unsigned char buffer[32];
+  std::memset(buffer, 0, 32);
+  nP.export_point_u(buffer);
+  std::cout << "u(nP) export = " << buffer_to_hex(buffer) << std::endl;
+  my_assert(!std::memcmp(buffer, rfc7748_output, 32));
+
+  std::cout << "********* ok\n\n";
+  return true;
+}
+
+unsigned char fixed_privkey[32] = "abacabadabacabaeabacabadabacaba";
+unsigned char fixed_pubkey[32] = {0x6f, 0x9e, 0x5b, 0xde, 0xce, 0x87, 0x21, 0xeb, 0x57, 0x37, 0xfb,
+                                  0xb5, 0x92, 0x28, 0xba, 0x07, 0xf7, 0x88, 0x0f, 0x73, 0xce, 0x5b,
+                                  0xfa, 0xa1, 0xb7, 0x15, 0x73, 0x03, 0xd4, 0x20, 0x1e, 0x74};
+
+unsigned char rfc8032_secret_key1[32] = {0x9d, 0x61, 0xb1, 0x9d, 0xef, 0xfd, 0x5a, 0x60, 0xba, 0x84, 0x4a,
+                                         0xf4, 0x92, 0xec, 0x2c, 0xc4, 0x44, 0x49, 0xc5, 0x69, 0x7b, 0x32,
+                                         0x69, 0x19, 0x70, 0x3b, 0xac, 0x03, 0x1c, 0xae, 0x7f, 0x60};
+
+unsigned char rfc8032_public_key1[32] = {0xd7, 0x5a, 0x98, 0x01, 0x82, 0xb1, 0x0a, 0xb7, 0xd5, 0x4b, 0xfe,
+                                         0xd3, 0xc9, 0x64, 0x07, 0x3a, 0x0e, 0xe1, 0x72, 0xf3, 0xda, 0xa6,
+                                         0x23, 0x25, 0xaf, 0x02, 0x1a, 0x68, 0xf7, 0x07, 0x51, 0x1a};
+
+unsigned char rfc8032_signature1[64] = {
+    0xe5, 0x56, 0x43, 0x00, 0xc3, 0x60, 0xac, 0x72, 0x90, 0x86, 0xe2, 0xcc, 0x80, 0x6e, 0x82, 0x8a,
+    0x84, 0x87, 0x7f, 0x1e, 0xb8, 0xe5, 0xd9, 0x74, 0xd8, 0x73, 0xe0, 0x65, 0x22, 0x49, 0x01, 0x55,
+    0x5f, 0xb8, 0x82, 0x15, 0x90, 0xa3, 0x3b, 0xac, 0xc6, 0x1e, 0x39, 0x70, 0x1c, 0xf9, 0xb4, 0x6b,
+    0xd2, 0x5b, 0xf5, 0xf0, 0x59, 0x5b, 0xbe, 0x24, 0x65, 0x51, 0x41, 0x43, 0x8e, 0x7a, 0x10, 0x0b,
+};
+
+unsigned char rfc8032_secret_key2[32] = {
+    0xc5, 0xaa, 0x8d, 0xf4, 0x3f, 0x9f, 0x83, 0x7b, 0xed, 0xb7, 0x44, 0x2f, 0x31, 0xdc, 0xb7, 0xb1,
+    0x66, 0xd3, 0x85, 0x35, 0x07, 0x6f, 0x09, 0x4b, 0x85, 0xce, 0x3a, 0x2e, 0x0b, 0x44, 0x58, 0xf7,
+};
+
+unsigned char rfc8032_public_key2[32] = {
+    0xfc, 0x51, 0xcd, 0x8e, 0x62, 0x18, 0xa1, 0xa3, 0x8d, 0xa4, 0x7e, 0xd0, 0x02, 0x30, 0xf0, 0x58,
+    0x08, 0x16, 0xed, 0x13, 0xba, 0x33, 0x03, 0xac, 0x5d, 0xeb, 0x91, 0x15, 0x48, 0x90, 0x80, 0x25,
+};
+
+unsigned char rfc8032_message2[2] = {0xaf, 0x82};
+
+unsigned char rfc8032_signature2[64] = {
+    0x62, 0x91, 0xd6, 0x57, 0xde, 0xec, 0x24, 0x02, 0x48, 0x27, 0xe6, 0x9c, 0x3a, 0xbe, 0x01, 0xa3,
+    0x0c, 0xe5, 0x48, 0xa2, 0x84, 0x74, 0x3a, 0x44, 0x5e, 0x36, 0x80, 0xd7, 0xdb, 0x5a, 0xc3, 0xac,
+    0x18, 0xff, 0x9b, 0x53, 0x8d, 0x16, 0xf2, 0x90, 0xae, 0x67, 0xf7, 0x60, 0x98, 0x4d, 0xc6, 0x59,
+    0x4a, 0x7c, 0x15, 0xe9, 0x71, 0x6e, 0xd2, 0x8d, 0xc0, 0x27, 0xbe, 0xce, 0xea, 0x1e, 0xc4, 0x0a,
+};
+
+bool test_ed25519_crypto() {
+  std::cout << "************** Testing Curve25519 / Ed25519 cryptographic primitives ************\n";
+  crypto::Ed25519::PrivateKey PK1, PK2, PK3, PK4, PK5;
+  PK1.random_private_key();
+  PK2.import_private_key(fixed_privkey);
+  unsigned char priv2_export[32];
+  bool ok = PK1.export_private_key(priv2_export);
+  std::cout << "PK1 = " << ok << " " << buffer_to_hex(priv2_export) << std::endl;
+  my_assert(ok);
+  ok = PK2.export_private_key(priv2_export);
+  std::cout << "PK2 = " << ok << " " << buffer_to_hex(priv2_export) << std::endl;
+  my_assert(ok);
+  PK3.import_private_key(priv2_export);
+  std::cout << "PK3 = " << PK3.ok() << std::endl;
+  my_assert(PK3.ok());
+
+  unsigned char pub_export[32];
+  ok = PK1.export_public_key(pub_export);
+  std::cout << "PubK1 = " << ok << " " << buffer_to_hex(pub_export) << std::endl;
+  my_assert(ok);
+  crypto::Ed25519::PublicKey PubK1(pub_export);
+  ok = PK2.export_public_key(pub_export);
+  std::cout << "PubK2 = " << ok << " " << buffer_to_hex(pub_export) << std::endl;
+  my_assert(ok);
+  my_assert(!std::memcmp(pub_export, fixed_pubkey, 32));
+  crypto::Ed25519::PublicKey PubK2(pub_export);
+  ok = PK3.export_public_key(pub_export);
+  std::cout << "PubK3 = " << ok << " " << buffer_to_hex(pub_export) << std::endl;
+  my_assert(ok);
+  my_assert(!std::memcmp(pub_export, fixed_pubkey, 32));
+  crypto::Ed25519::PublicKey PubK3(pub_export);
+  ok = PubK1.export_public_key(pub_export);
+  std::cout << "PubK1 = " << ok << " " << buffer_to_hex(pub_export) << std::endl;
+  my_assert(ok);
+
+  unsigned char secret22[32];
+  ok = PK2.compute_shared_secret(secret22, PubK3);
+  std::cout << "secret(PK2,PubK2)=" << ok << " " << buffer_to_hex(secret22) << std::endl;
+  my_assert(ok);
+
+  unsigned char secret12[32], secret21[32];
+  ok = PK1.compute_shared_secret(secret12, PubK3);
+  std::cout << "secret(PK1,PubK2)=" << ok << " " << buffer_to_hex(secret12) << std::endl;
+  my_assert(ok);
+  ok = PK2.compute_shared_secret(secret21, PubK1);
+  std::cout << "secret(PK2,PubK1)=" << ok << " " << buffer_to_hex(secret21) << std::endl;
+  my_assert(ok);
+  my_assert(!std::memcmp(secret12, secret21, 32));
+
+  //  for (int i = 0; i < 1000; i++) {
+  //    ok = PK1.compute_shared_secret(secret12, PubK3);
+  //    my_assert(ok);
+  //    ok = PK2.compute_shared_secret(secret21, PubK1);
+  //    my_assert(ok);
+  //  }
+
+  unsigned char signature[64];
+  ok = PK1.sign_message(signature, (const unsigned char*)"abc", 3);
+  std::cout << "PK1.signature=" << ok << " " << buffer_to_hex(signature, 64) << std::endl;
+  my_assert(ok);
+
+  // signature[63] ^= 1;
+  ok = PubK1.check_message_signature(signature, (const unsigned char*)"abc", 3);
+  std::cout << "PubK1.check_signature=" << ok << std::endl;
+  my_assert(ok);
+
+  PK4.import_private_key(rfc8032_secret_key1);
+  PK4.export_public_key(pub_export);
+  std::cout << "PK4.private_key = " << buffer_to_hex(rfc8032_secret_key1) << std::endl;
+  std::cout << "PK4.public_key = " << buffer_to_hex(pub_export) << std::endl;
+  my_assert(!std::memcmp(pub_export, rfc8032_public_key1, 32));
+  ok = PK4.sign_message(signature, (const unsigned char*)"", 0);
+  std::cout << "PK4.signature('') = " << buffer_to_hex(signature, 64) << std::endl;
+  my_assert(ok);
+  my_assert(!std::memcmp(signature, rfc8032_signature1, 32));
+
+  PK5.import_private_key(rfc8032_secret_key2);
+  PK5.export_public_key(pub_export);
+  std::cout << "PK5.private_key = " << buffer_to_hex(rfc8032_secret_key2) << std::endl;
+  std::cout << "PK5.public_key = " << buffer_to_hex(pub_export) << std::endl;
+  my_assert(!std::memcmp(pub_export, rfc8032_public_key2, 32));
+  ok = PK5.sign_message(signature, rfc8032_message2, 2);
+  std::cout << "PK5.signature('') = " << buffer_to_hex(signature, 64) << std::endl;
+  my_assert(ok);
+  my_assert(!std::memcmp(signature, rfc8032_signature2, 32));
+  crypto::Ed25519::PublicKey PubK5(pub_export);
+
+  //  for (int i = 0; i < 10000; i++) {
+  //    ok = PK5.sign_message (signature, rfc8032_message2, 2);
+  //    my_assert (ok);
+  //  }
+  //  for (int i = 0; i < 10000; i++) {
+  //    ok = PubK5.check_message_signature (signature, rfc8032_message2, 2);
+  //    my_assert (ok);
+  //  }
+
+  unsigned char temp_pubkey[32];
+  crypto::Ed25519::TempKeyGenerator TKG;  // use one generator a lot of times
+
+  TKG.create_temp_shared_secret(temp_pubkey, secret12, PubK1, (const unsigned char*)"abc", 3);
+  std::cout << "secret12=" << buffer_to_hex(secret12) << "; temp_pubkey=" << buffer_to_hex(temp_pubkey) << std::endl;
+
+  PK1.compute_temp_shared_secret(secret21, temp_pubkey);
+  std::cout << "secret21=" << buffer_to_hex(secret21) << std::endl;
+  my_assert(!std::memcmp(secret12, secret21, 32));
+
+  std::cout << "********* ok\n\n";
+  return true;
+}
+
+int main(void) {
+  test_ed25519_impl();
+  test_ed25519_crypto();
+  return 0;
+}
diff --git a/submodules/ton/tonlib-src/crypto/test/vm.cpp b/submodules/ton/tonlib-src/crypto/test/vm.cpp
new file mode 100644
index 0000000000..72e2f8c61b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/test/vm.cpp
@@ -0,0 +1,427 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/continuation.h"
+#include "vm/cp0.h"
+#include "vm/dict.h"
+#include "fift/utils.h"
+#include "common/bigint.hpp"
+
+#include "td/utils/tests.h"
+#include "td/utils/ScopeGuard.h"
+#include "td/utils/StringBuilder.h"
+
+std::string run_vm(td::Ref<vm::Cell> cell) {
+  vm::init_op_cp0();
+  vm::DictionaryBase::get_empty_dictionary();
+
+  class Logger : public td::LogInterface {
+   public:
+    void append(td::CSlice slice) override {
+      res.append(slice.data(), slice.size());
+    }
+    std::string res;
+  };
+  static Logger logger;
+  logger.res = "";
+  td::set_log_fatal_error_callback([](td::CSlice message) { td::default_log_interface->append(logger.res); });
+  vm::VmLog log{&logger, td::LogOptions::plain()};
+  log.log_options.level = 4;
+  log.log_options.fix_newlines = true;
+  log.log_mask |= vm::VmLog::DumpStack;
+
+  auto total_data_cells_before = vm::DataCell::get_total_data_cells();
+  SCOPE_EXIT {
+    auto total_data_cells_after = vm::DataCell::get_total_data_cells();
+    ASSERT_EQ(total_data_cells_before, total_data_cells_after);
+  };
+
+  vm::Stack stack;
+  try {
+    vm::run_vm_code(vm::load_cell_slice_ref(cell), stack, 0 /*flags*/, nullptr /*data*/, std::move(log) /*VmLog*/);
+  } catch (...) {
+    LOG(FATAL) << "catch unhandled exception";
+  }
+  return logger.res;  // must be a copy
+}
+
+td::Ref<vm::Cell> to_cell(const unsigned char *buff, int bits) {
+  return vm::CellBuilder().store_bits(buff, bits, 0).finalize();
+}
+void test_run_vm(td::Ref<vm::Cell> code) {
+  auto a = run_vm(code);
+  auto b = run_vm(code);
+  ASSERT_EQ(a, b);
+  REGRESSION_VERIFY(a);
+}
+
+void test_run_vm(td::Slice code_hex) {
+  unsigned char buff[128];
+  int bits = (int)td::bitstring::parse_bitstring_hex_literal(buff, sizeof(buff), code_hex.begin(), code_hex.end());
+  CHECK(bits >= 0);
+  test_run_vm(to_cell(buff, bits));
+}
+
+TEST(VM, simple) {
+  test_run_vm("ABCBABABABA");
+}
+
+TEST(VM, memory_leak_old) {
+  test_run_vm("90787FDB3B");
+}
+
+TEST(VM, memory_leak) {
+  test_run_vm("90707FDB3B");
+}
+
+TEST(VM, bug_div_short_any) {
+  test_run_vm("6883FF73A98D");
+}
+TEST(VM, assert_pfx_dict_lookup) {
+  test_run_vm("778B04216D73F43E018B04591277F473");
+}
+
+TEST(VM, assert_lookup_prefix) {
+  test_run_vm("78E58B008B028B04010000016D90ED5272F43A755D77F4A8");
+}
+
+TEST(VM, assert_code_not_null) {
+  test_run_vm("76ED40DE");
+}
+
+TEST(VM, bug_exec_dict_getnear) {
+  test_run_vm("8B048B00006D72F47573655F6D656D6D656D8B007F");
+}
+
+TEST(VM, bug_stack_overflow) {
+  test_run_vm("72A93AF8");
+}
+
+TEST(VM, assert_extract_minmax_key) {
+  test_run_vm("6D6DEB21807AF49C2180EB21807AF41C");
+}
+
+TEST(VM, memory_leak_new) {
+  test_run_vm("72E5ED40DB3603");
+}
+
+TEST(VM, unhandled_exception_1) {
+  test_run_vm("70EDA2ED00");
+}
+
+TEST(VM, unhandled_exception_2) {
+  // infinite loop now
+  // test_run_vm("EBEDB4");
+}
+
+TEST(VM, unhandled_exception_3) {
+  // infinite loop now
+  // test_run_vm("EBEDC0");
+}
+
+TEST(VM, unhandled_exception_4) {
+  test_run_vm("7F853EA1C8CB3E");
+}
+
+TEST(VM, unhandled_exception_5) {
+  test_run_vm("738B04016D21F41476A721F49F");
+}
+
+TEST(VM, bigint) {
+  td::StringBuilder sb({}, true);
+
+  using word_t = td::BigIntInfo::word_t;
+  std::vector<word_t> numbers{1,
+                              -1,
+                              2,
+                              -2,
+                              100,
+                              -100,
+                              std::numeric_limits<word_t>::max(),
+                              std::numeric_limits<word_t>::min(),
+                              std::numeric_limits<word_t>::max() - 1,
+                              std::numeric_limits<word_t>::min() + 1};
+  for (auto x : numbers) {
+    for (auto y : numbers) {
+      word_t a;
+      word_t b;
+      td::BigIntInfo::set_mul(&a, &b, x, y);
+      sb << "set_mul " << x << " * " << y << " = " << a << " " << b << "\n";
+      td::BigIntInfo::add_mul(&a, &b, x, y);
+      sb << "add_mul " << x << " " << y << " = " << a << " " << b << "\n";
+      td::BigIntInfo::sub_mul(&a, &b, x, y);
+      sb << "sub_mul " << x << " " << y << " = " << a << " " << b << "\n";
+    }
+  }
+  auto base = td::BigIntInfo::Base;
+  std::vector<word_t> lo_numbers{1, -1, 2, -2, 100, -100, base - 1, base - 2, -base + 1, -base + 2};
+  for (auto x : numbers) {
+    for (auto y : lo_numbers) {
+      for (auto z : numbers) {
+        word_t a;
+        word_t b;
+        td::BigIntInfo::dbl_divmod(&a, &b, x, y, z);
+        sb << "dbl_divmod " << x << " " << y << " / " << z << " = " << a << " " << b << "\n";
+      }
+    }
+  }
+
+  REGRESSION_VERIFY(sb.as_cslice());
+}
+
+TEST(VM, report3_1) {
+  //WA: expect (1, 2, 6, 3)
+  td::Slice test1 =
+      R"A(
+CONT:<{
+DEPTH
+}>
+3 SETNUMARGS
+c0 POPCTR
+1 INT
+2 INT
+3 INT
+4 INT
+5 INT
+6 INT
+4 RETURNARGS
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
+
+TEST(VM, report3_2) {
+  td::Slice test1 =
+      R"A(
+CONT:<{
+DEPTH
+}>
+2 SETNUMARGS
+c0 POPCTR
+1 INT
+2 INT
+3 INT
+4 INT
+2 RETARGS
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
+
+TEST(VM, report3_3) {
+  // WA: expect (9)
+  td::Slice test1 =
+      R"A(
+CONT:<{
+ 8 INT
+}>
+c0 POPCTR
+CONT:<{
+ 9 INT
+}>
+c1 POPCTR
+0 INT
+BRANCH
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
+
+TEST(VM, report3_4) {
+  td::Slice test1 =
+      R"A(
+CONT:<{
+1 INT
+2 INT
+3 INT
+2 RETARGS
+}>
+CALLX
+ADD
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
+
+TEST(VM, report3_6) {
+  // WA: expect StackOverflow
+  td::Slice test1 =
+      R"A(
+10 INT
+20 INT
+30 INT
+CONT:<{
+  DEPTH
+  40 INT
+  SWAP
+}>
+2 SETNUMARGS
+3 1 CALLXARGS
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
+
+//TEST(VM, report3_ce) {
+//td::Slice test1 =
+//R"A(
+//s16 POP
+//s16 PUSH
+//s0 s16 XCHG
+//)A";
+//test_run_vm(fift::compile_asm(test1).move_as_ok());
+//}
+
+TEST(VM, report3_int_overflow_1) {
+  td::Slice test1 =
+      R"A(
+4 INT
+16 INT
+-115792089237316195423570985008687907853269984665640564039457584007913129639936 INT
+MULDIVMOD
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
+TEST(VM, report3_int_overflow_2) {
+  td::Slice test1 =
+      R"A(
+4 INT
+16 INT
+-115792089237316195423570985008687907853269984665640564039457584007913129639936 INT
+MULDIVR
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
+
+TEST(VM, report3_qnot) {
+  td::Slice test1 =
+      R"A(
+PUSHNAN
+QNOT
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
+
+TEST(VM, report3_loop_1) {
+  //WA
+  td::Slice test1 =
+      R"A(
+CONT:<{
+  2 INT
+}>
+ATEXITALT
+CONT:<{
+ 1 INT
+ RETALT
+ -1 INT
+}>
+AGAIN
+3 INT
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
+
+TEST(VM, report3_loop_2) {
+  //WA
+  td::Slice test1 =
+      R"A(
+CONT:<{
+  2 INT
+}>
+ATEXITALT
+CONT:<{
+ 1 INT
+ RETALT
+ -1 INT
+}>
+UNTIL
+3 INT
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
+
+TEST(VM, report3_loop_3) {
+  //WA
+  td::Slice test1 =
+      R"A(
+1 INT
+CONT:<{
+  UNTILEND
+  RET
+  -1 INT
+}>
+CALLX
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
+
+TEST(VM, report3_loop_4) {
+  //WA
+  td::Slice test1 =
+      R"A(
+CONT:<{
+  2 INT
+}>
+ATEXITALT
+CONT:<{
+  1 INT
+  RETALT
+  -1 PUSHINT
+}>
+CONT:<{
+  -1 INT
+}>
+WHILE
+3 INT
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
+TEST(VM, report3_loop_5) {
+  //WA
+  td::Slice test1 =
+      R"A(
+CONT:<{
+  1 INT
+  2 INT
+}>
+ATEXITALT
+3 INT
+AGAINEND
+DEC
+DUP
+IFRET
+DROP
+RETALT
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
+
+TEST(VM, report3_loop_6) {
+  //WA
+  td::Slice test1 =
+      R"A(
+CONT:<{
+  1 INT
+  2 INT
+}>
+3 INT
+AGAINEND
+DEC
+DUP
+IFRET
+DROP
+ATEXITALT
+RETALT
+)A";
+  test_run_vm(fift::compile_asm(test1).move_as_ok());
+}
diff --git a/submodules/ton/tonlib-src/crypto/tl/boc.tlb b/submodules/ton/tonlib-src/crypto/tl/boc.tlb
new file mode 100644
index 0000000000..c296cb6ffb
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/tl/boc.tlb
@@ -0,0 +1,45 @@
+//
+//  Bag-of-Cells (BoC) serialization formats
+//
+
+serialized_boc_idx#68ff65f3 size:(## 8) { size <= 4 }
+  off_bytes:(## 8) { off_bytes <= 8 } 
+  cells:(##(size * 8)) 
+  roots:(##(size * 8)) { roots = 1 }
+  absent:(##(size * 8)) { roots + absent <= cells }
+  tot_cells_size:(##(off_bytes * 8))
+  index:(cells * ##(off_bytes * 8))
+  cell_data:(tot_cells_size * [ uint8 ])
+  = BagOfCells;
+
+serialized_boc_idx_crc32c#acc3a728 size:(## 8) { size <= 4 }
+  off_bytes:(## 8) { off_bytes <= 8 } 
+  cells:(##(size * 8)) 
+  roots:(##(size * 8)) { roots = 1 }
+  absent:(##(size * 8)) { roots + absent <= cells }
+  tot_cells_size:(##(off_bytes * 8))
+  index:(cells * ##(off_bytes * 8))
+  cell_data:(tot_cells_size * [ uint8 ])
+  crc32c:uint32 = BagOfCells;
+
+serialized_boc#b5ee9c72 has_idx:(## 1) has_crc32c:(## 1) 
+  has_cache_bits:(## 1) flags:(## 2) { flags = 0 }
+  size:(## 3) { size <= 4 }
+  off_bytes:(## 8) { off_bytes <= 8 } 
+  cells:(##(size * 8)) 
+  roots:(##(size * 8)) { roots >= 1 }
+  absent:(##(size * 8)) { roots + absent <= cells }
+  tot_cells_size:(##(off_bytes * 8))
+  root_list:(roots * ##(size * 8))
+  index:(cells * ##(off_bytes * 8))
+  cell_data:(tot_cells_size * [ uint8 ])
+  = BagOfCells;
+
+compiled_smart_contract
+  compiled_at:uint32 code:^Cell data:^Cell
+  description:(Maybe ^TinyString)
+  ^[ source_file:(Maybe ^TinyString)
+       compiler_version:(Maybe ^TinyString) ]
+  = CompiledSmartContract;
+
+tiny_string#_ len:(#<= 126) str:(len * [ uint8 ]) = TinyString; 
diff --git a/submodules/ton/tonlib-src/crypto/tl/hashmap.tlb b/submodules/ton/tonlib-src/crypto/tl/hashmap.tlb
new file mode 100644
index 0000000000..0ec55a6596
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/tl/hashmap.tlb
@@ -0,0 +1,60 @@
+bit#_ _:(## 1) = Bit;
+
+// ordinary Hashmap / HashmapE, with fixed length keys
+//
+hm_edge#_ {n:#} {X:Type} {l:#} {m:#} label:(HmLabel ~l n) 
+          {n = (~m) + l} node:(HashmapNode m X) = Hashmap n X;
+
+hmn_leaf#_ {X:Type} value:X = HashmapNode 0 X;
+hmn_fork#_ {n:#} {X:Type} left:^(Hashmap n X) 
+           right:^(Hashmap n X) = HashmapNode (n + 1) X;
+
+hml_short$0 {m:#} {n:#} len:(Unary ~n) s:(n * Bit) = HmLabel ~n m;
+hml_long$10 {m:#} n:(#<= m) s:(n * Bit) = HmLabel ~n m;
+hml_same$11 {m:#} v:Bit n:(#<= m) = HmLabel ~n m;
+
+unary_zero$0 = Unary ~0;
+unary_succ$1 {n:#} x:(Unary ~n) = Unary ~(n + 1);
+
+hme_empty$0 {n:#} {X:Type} = HashmapE n X;
+hme_root$1 {n:#} {X:Type} root:^(Hashmap n X) = HashmapE n X;
+
+true#_ = True;
+_ {n:#} _:(Hashmap n True) = BitstringSet n;
+
+
+// VarHashmap / VarHashmapE, with variable-length keys
+//
+vhm_edge#_ {n:#} {X:Type} {l:#} {m:#} label:(HmLabel ~l n) 
+           {n = (~m) + l} node:(VarHashmapNode m X) 
+           = VarHashmap n X;
+vhmn_leaf$00 {n:#} {X:Type} value:X = VarHashmapNode n X;
+vhmn_fork$01 {n:#} {X:Type} left:^(VarHashmap n X) 
+             right:^(VarHashmap n X) value:(Maybe X) 
+             = VarHashmapNode (n + 1) X;
+vhmn_cont$1 {n:#} {X:Type} branch:Bit child:^(VarHashmap n X) 
+            value:X = VarHashmapNode (n + 1) X;
+
+nothing$0 {X:Type} = Maybe X;
+just$1 {X:Type} value:X = Maybe X;
+
+vhme_empty$0 {n:#} {X:Type} = VarHashmapE n X;
+vhme_root$1 {n:#} {X:Type} root:^(VarHashmap n X) 
+            = VarHashmapE n X;
+
+//
+// PfxHashmap / PfxHashmapE, with variable-length keys
+//                           constituting a prefix code
+//
+
+phm_edge#_ {n:#} {X:Type} {l:#} {m:#} label:(HmLabel ~l n) 
+           {n = (~m) + l} node:(PfxHashmapNode m X) 
+           = PfxHashmap n X;
+
+phmn_leaf$0 {n:#} {X:Type} value:X = PfxHashmapNode n X;
+phmn_fork$1 {n:#} {X:Type} left:^(PfxHashmap n X) 
+            right:^(PfxHashmap n X) = PfxHashmapNode (n + 1) X;
+
+phme_empty$0 {n:#} {X:Type} = PfxHashmapE n X;
+phme_root$1 {n:#} {X:Type} root:^(PfxHashmap n X) 
+            = PfxHashmapE n X;
diff --git a/submodules/ton/tonlib-src/crypto/tl/tlbc-aux.h b/submodules/ton/tonlib-src/crypto/tl/tlbc-aux.h
new file mode 100644
index 0000000000..54f72bccc5
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/tl/tlbc-aux.h
@@ -0,0 +1,262 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <vector>
+#include <string>
+#include <memory>
+#include <ostream>
+
+namespace tlbc {
+
+static constexpr unsigned long long All = 1ULL << 63;
+
+struct BitPfxCollection {
+  std::vector<unsigned long long> pfx;
+  void clear() {
+    pfx.clear();
+  }
+  void all() {
+    pfx.clear();
+    pfx.push_back(All);
+  }
+  BitPfxCollection() = default;
+  BitPfxCollection(unsigned long long one_pfx) {
+    if (one_pfx) {
+      pfx.push_back(one_pfx);
+    }
+  }
+  bool empty() const {
+    return pfx.empty();
+  }
+  unsigned long long min() const {
+    return pfx.empty() ? 0 : pfx[0];
+  }
+  bool is_all() const {
+    return pfx.size() == 1 && pfx[0] == All;
+  }
+  BitPfxCollection& operator*=(unsigned long long prepend);
+  BitPfxCollection operator*(unsigned long long prepend) const;
+  BitPfxCollection operator+(const BitPfxCollection& other) const;
+  bool operator+=(const BitPfxCollection& other);
+  bool operator==(const BitPfxCollection& other) const {
+    return pfx == other.pfx;
+  }
+  bool operator!=(const BitPfxCollection& other) const {
+    return pfx != other.pfx;
+  }
+  void merge_back(unsigned long long z);
+  void show(std::ostream& os) const;
+};
+
+std::ostream& operator<<(std::ostream& os, const BitPfxCollection& p);
+
+struct AdmissibilityInfo {
+  enum { side = 4 };
+  std::vector<bool> info;
+  int dim;
+  AdmissibilityInfo() : info(1, false), dim(0) {
+  }
+  void extend(int dim1);
+  bool operator[](std::size_t i) {
+    return info[i & (info.size() - 1)];
+  }
+  void operator|=(const AdmissibilityInfo& other);
+  void set_all(bool val = true);
+  void clear_all() {
+    set_all(false);
+  }
+  void set_by_pattern(int pdim, int pattern[]);
+  void show(std::ostream& os) const;
+  bool is_set_all() const {
+    return !dim && info[0];
+  }
+  bool extract1(char A[side], char tag, int p1) const;
+  bool extract2(char A[side][side], char tag, int p1, int p2) const;
+  bool extract3(char A[side][side][side], char tag, int p1, int p2, int p3) const;
+  int conflicts_at(const AdmissibilityInfo& other) const;
+  bool conflicts_with(const AdmissibilityInfo& other) const {
+    return conflicts_at(other) >= 0;
+  }
+};
+
+std::ostream& operator<<(std::ostream& os, const AdmissibilityInfo& p);
+
+struct ConflictSet {
+  unsigned long long x;
+  explicit ConflictSet(unsigned long long _x = 0) : x(_x) {
+  }
+  bool operator[](int i) const {
+    return (x >> i) & 1;
+  }
+  ConflictSet& operator|=(ConflictSet other) {
+    x |= other.x;
+    return *this;
+  }
+  int size() const {
+    return td::count_bits64(x);
+  }
+  int min() const {
+    return x ? td::count_trailing_zeroes_non_zero64(x) : 0x7fffffff;
+  }
+  int max() const {
+    return x ? 63 - td::count_leading_zeroes_non_zero64(x) : -1;
+  }
+  void remove(int i) {
+    x &= ~(1ULL << i);
+  }
+  void insert(int i) {
+    x |= (1ULL << i);
+  }
+};
+
+struct ConflictGraph {
+  std::array<ConflictSet, 64> g;
+  ConflictSet& operator[](int i) {
+    return g[i];
+  }
+  const ConflictSet& operator[](int i) const {
+    return g[i];
+  }
+  void set_clique(ConflictSet set);
+};
+
+struct BinTrie {
+  std::unique_ptr<BinTrie> left, right;
+  unsigned long long tag, down_tag;
+  int useful_depth;
+  BinTrie(unsigned long long _tag = 0, std::unique_ptr<BinTrie> _left = {}, std::unique_ptr<BinTrie> _right = {})
+      : left(std::move(_left)), right(std::move(_right)), tag(_tag), down_tag(0), useful_depth(0) {
+  }
+  void ins_path(unsigned long long path, unsigned long long new_tag);
+  unsigned long long lookup_tag(unsigned long long path) const;
+  const BinTrie* lookup_node_const(unsigned long long path) const;
+  BinTrie* lookup_node(unsigned long long path);
+  bool is_unique() const {
+    return !(down_tag & (down_tag - 1));
+  }
+  int unique_value() const {
+    return down_tag ? td::count_trailing_zeroes_non_zero64(down_tag) : -1;
+  }
+  static std::unique_ptr<BinTrie> insert_path(std::unique_ptr<BinTrie> root, unsigned long long path,
+                                              unsigned long long tag);
+  static std::unique_ptr<BinTrie> insert_paths(std::unique_ptr<BinTrie> root, const BitPfxCollection& paths,
+                                               unsigned long long tag);
+  void set_conflict_graph(ConflictGraph& gr, unsigned long long colors = 0) const;
+  int compute_useful_depth(unsigned long long colors = 0);
+  unsigned long long find_conflict_path(unsigned long long colors = 0, unsigned long long mask = ~0ULL) const;
+  unsigned long long build_submap_at(int depth, unsigned long long A[], unsigned long long pfx) const;
+  unsigned long long build_submap(int depth, unsigned long long A[]) const;
+  void show(std::ostream& os, unsigned long long pfx = 1ULL << 63) const;
+};
+
+std::ostream& operator<<(std::ostream& os, const BinTrie& bt);
+
+struct MinMaxSize {
+  enum : unsigned long long { Any = 0x7ff07, OneRef = 0x100000001ULL, Impossible = (0x7ff07ULL << 32) };
+  unsigned long long minmax_size;
+  unsigned min_size() const {
+    return (unsigned)(minmax_size >> 32);
+  }
+  unsigned max_size() const {
+    return (unsigned)(minmax_size & 0xffffffff);
+  }
+  unsigned long long get() const {
+    return minmax_size;
+  }
+  bool is_fixed() const {
+    return min_size() == max_size();
+  }
+  int fixed_bit_size() const {
+    return is_fixed() && !(min_size() & 0xff) ? (min_size() >> 8) : -1;
+  }
+  bool fits_into_cell() const {
+    return !((0x3ff04 - min_size()) & 0x80000080U);
+  }
+  bool is_possible() const {
+    return !((max_size() - min_size()) & 0x80000080U);
+  }
+  void normalize();
+  MinMaxSize& clear() {
+    minmax_size = 0;
+    return *this;
+  }
+  MinMaxSize& clear_min() {
+    minmax_size &= (1ULL << 32) - 1;
+    return *this;
+  }
+  MinMaxSize& infinite_max() {
+    minmax_size |= 0x3ff07;
+    return *this;
+  }
+  MinMaxSize(unsigned long long _size = Impossible, bool _normalize = false) : minmax_size(_size) {
+    if (_normalize) {
+      normalize();
+    }
+  }
+  static unsigned convert_size(unsigned z) {
+    return ((z & 0xff) << 16) | (z >> 8);
+  }
+  unsigned convert_min_size() const {
+    return convert_size(min_size());
+  }
+  unsigned convert_max_size() const {
+    return convert_size(max_size());
+  }
+  MinMaxSize operator+(MinMaxSize y) {
+    return MinMaxSize(get() + y.get(), true);
+  }
+  MinMaxSize& operator+=(MinMaxSize y) {
+    minmax_size += y.get();
+    normalize();
+    return *this;
+  }
+  MinMaxSize& operator|=(MinMaxSize y);
+  bool operator==(MinMaxSize y) {
+    return get() == y.get();
+  }
+  bool operator!=(MinMaxSize y) {
+    return get() != y.get();
+  }
+  MinMaxSize& repeat(int count);
+  MinMaxSize& repeat_at_least(int count);
+  static MinMaxSize fixed_size(unsigned sz) {
+    return MinMaxSize(sz * 0x10000000100ULL);
+  }
+  static MinMaxSize size_range(unsigned min_sz, unsigned max_sz) {
+    return MinMaxSize((((unsigned long long)min_sz << 32) + max_sz) << 8);
+  }
+  void show(std::ostream& os) const;
+  struct unpacked {
+    unsigned min_bits, min_refs, max_bits, max_refs;
+    unpacked(MinMaxSize val);
+    MinMaxSize pack() const;
+    void show(std::ostream& os) const;
+  };
+
+ private:
+  void nrm(unsigned long long a, unsigned long long b) {
+    if (minmax_size & a) {
+      minmax_size = (minmax_size | (a | b)) - a;
+    }
+  }
+};
+
+std::ostream& operator<<(std::ostream& os, MinMaxSize t);
+
+}  // namespace tlbc
diff --git a/submodules/ton/tonlib-src/crypto/tl/tlbc-data.h b/submodules/ton/tonlib-src/crypto/tl/tlbc-data.h
new file mode 100644
index 0000000000..2aae4e8a12
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/tl/tlbc-data.h
@@ -0,0 +1,340 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <string>
+#include <vector>
+
+namespace tlbc {
+
+using src::Lexem;
+using src::Lexer;
+using sym::sym_idx_t;
+
+struct Type;
+struct Constructor;
+
+struct TypeExpr {
+  enum {
+    te_Unknown,
+    te_Type,
+    te_Param,
+    te_Apply,
+    te_Add,
+    te_GetBit,
+    te_MulConst,
+    te_IntConst,
+    te_Tuple,
+    te_Ref,
+    te_CondType
+  };
+  enum { max_const_expr = 100000, const_htable_size = 170239 };
+  int tp;
+  int value;
+  Type* type_applied;
+  bool is_nat;          // we keep integer expressions in 'TypeExpr' as well
+  bool is_nat_subtype;  // this is # or a subtype of #
+  bool negated;         // is it linearly negative
+  bool tchk_only;       // type to be used as RHS of <field>:<type-expr> only
+  int is_constexpr;     // if non-zero, it is an index in `const_type_expr`, the table of all constant type expressions
+  src::SrcLocation where;
+  std::vector<TypeExpr*> args;
+  TypeExpr(const src::SrcLocation& loc, int _tp, int _value = 0, bool _pol = false)
+      : tp(_tp)
+      , value(_value)
+      , type_applied(nullptr)
+      , is_nat_subtype(false)
+      , negated(_pol)
+      , tchk_only(false)
+      , is_constexpr(0)
+      , where(loc) {
+    init_is_nat();
+  }
+  TypeExpr(const src::SrcLocation& loc, int _tp, int _value, std::initializer_list<TypeExpr*> _arglist,
+           bool _pol = false)
+      : tp(_tp)
+      , value(_value)
+      , type_applied(nullptr)
+      , is_nat_subtype(false)
+      , negated(_pol)
+      , tchk_only(false)
+      , is_constexpr(0)
+      , where(loc)
+      , args(std::move(_arglist)) {
+    init_is_nat();
+  }
+  TypeExpr(const src::SrcLocation& loc, int _tp, int _value, std::vector<TypeExpr*> _arglist, bool _pol = false)
+      : tp(_tp)
+      , value(_value)
+      , type_applied(nullptr)
+      , is_nat_subtype(false)
+      , negated(_pol)
+      , tchk_only(false)
+      , is_constexpr(0)
+      , where(loc)
+      , args(std::move(_arglist)) {
+    init_is_nat();
+  }
+  void check_mode(const src::SrcLocation& loc, int mode);
+  bool no_tchk() const;
+  bool close(const src::SrcLocation& loc);
+  bool bind_value(bool value_negated, Constructor& cs, bool checking_type = false);
+  int abstract_interpret_nat() const;
+  MinMaxSize compute_size() const;
+  bool compute_any_bits() const;
+  bool detect_constexpr();
+  int is_integer() const;
+  bool is_anon() const;
+  bool is_ref_to_anon() const;
+  bool equal(const TypeExpr& other) const;
+  void const_type_name(std::ostream& os) const;
+  static TypeExpr* mk_intconst(const src::SrcLocation& loc, std::string int_const);
+  static TypeExpr* mk_intconst(const src::SrcLocation& loc, unsigned int_const);
+  static TypeExpr* mk_apply_gen(const src::SrcLocation& loc, TypeExpr* expr1, TypeExpr* expr2);
+  static TypeExpr* mk_mulint(const src::SrcLocation& loc, TypeExpr* expr1, TypeExpr* expr2);
+  static TypeExpr* mk_cellref(const src::SrcLocation& loc, TypeExpr* expr1);
+  static TypeExpr* mk_apply(const src::SrcLocation& loc, int tp, TypeExpr* expr1, TypeExpr* expr2);
+  static TypeExpr* mk_apply_empty(const src::SrcLocation& loc, sym_idx_t name, Type* type_applied);
+  void show(std::ostream& os, const Constructor* cs = nullptr, int prio = 0, int mode = 0) const;
+
+ private:
+  void init_is_nat() {
+    is_nat = (tp >= te_Add && tp <= te_IntConst);
+  }
+  unsigned long long compute_hash() const;
+  static TypeExpr* const_htable[const_htable_size];
+};
+
+// extern TypeExpr* TypeExpr::const_htable[TypeExpr::const_htable_size];
+extern TypeExpr* const_type_expr[TypeExpr::max_const_expr];
+extern int const_type_expr_num;
+
+std::ostream& operator<<(std::ostream& os, const TypeExpr* te);
+
+struct Field {
+  int field_idx;
+  bool implicit;
+  bool known;
+  bool constraint;
+  bool used;
+  bool subrec;
+  sym_idx_t name;
+  TypeExpr* type;
+  const src::SrcLocation loc;
+  Field(const src::SrcLocation& where, bool impl, int idx, sym_idx_t fname = 0, TypeExpr* ftype = nullptr)
+      : field_idx(idx)
+      , implicit(impl)
+      , known(false)
+      , constraint(false)
+      , used(false)
+      , subrec(false)
+      , name(fname)
+      , type(ftype)
+      , loc(where) {
+  }
+  void register_sym() const;
+  std::string get_name() const;
+  bool isomorphic_to(const Field& f, bool allow_other_names = true) const;
+};
+
+struct Constructor {
+  sym_idx_t constr_name;
+  sym_idx_t type_name;
+  Type* type_defined;
+  src::SrcLocation where;
+  unsigned long long tag;
+  int tag_bits;
+  int fields_num;
+  int type_arity;
+  bool is_fwd;
+  bool is_enum;
+  bool is_simple_enum;
+  bool is_special;
+  bool has_fixed_size;
+  bool any_bits;
+  MinMaxSize size;
+  BitPfxCollection begins_with;
+  std::vector<Field> fields;
+  std::vector<TypeExpr*> params;
+  std::vector<bool> param_negated;
+  std::vector<int> param_const_val;  // -1 -- not integer or not constant
+  AdmissibilityInfo admissible_params;
+  void set_tag(unsigned long long new_tag) {
+    tag = new_tag;
+    tag_bits = (tag ? 63 - td::count_trailing_zeroes_non_zero64(tag) : -1);
+  }
+  Constructor(const src::SrcLocation& _loc = {}, sym_idx_t cname = 0, sym_idx_t tname = 0, unsigned long long _tag = 0,
+              Type* type = nullptr)
+      : constr_name(cname)
+      , type_name(tname)
+      , type_defined(type)
+      , where(_loc)
+      , fields_num(0)
+      , type_arity(0)
+      , is_fwd(false)
+      , is_enum(false)
+      , is_simple_enum(false)
+      , is_special(false)
+      , has_fixed_size(false)
+      , any_bits(false) {
+    set_tag(_tag);
+  }
+  Field& new_field(const src::SrcLocation& where, bool implicit, sym_idx_t name);
+  void show(std::ostream& os, int mode = 0) const;
+  std::string get_name() const;
+  std::string get_qualified_name() const;
+  bool isomorphic_to(const Constructor& cs, bool allow_other_names) const;
+  unsigned long long compute_tag() const;
+  void check_assign_tag();
+  bool compute_is_fwd();
+  bool recompute_begins_with();
+  bool recompute_minmax_size();
+  bool recompute_any_bits();
+  bool compute_admissible_params();
+  int get_const_param(unsigned idx) const {
+    return idx < param_const_val.size() ? param_const_val[idx] : -1;
+  }
+};
+
+std::ostream& operator<<(std::ostream& os, const Constructor& cs);
+
+struct Type {
+  enum { _IsType = 1, _IsNat = 2, _IsPos = 4, _IsNeg = 8, _NonConst = 16 };
+  sym_idx_t type_name;
+  int type_idx;
+  int parent_type_idx;
+  int constr_num;
+  int arity;
+  int used;
+  int last_declared;
+  static int last_declared_counter;
+  bool produces_nat;
+  bool is_final;
+  bool is_builtin;
+  bool is_enum;
+  bool is_simple_enum;
+  bool is_special;
+  bool is_pfx_determ;
+  bool is_param_determ;
+  bool is_const_param_determ;
+  bool is_const_param_pfx_determ;
+  bool is_param_pfx_determ;
+  bool is_determ;
+  bool has_fixed_size;
+  bool any_bits;
+  bool is_auto;
+  bool is_anon;
+  bool is_unit;
+  bool is_bool;
+  signed char is_integer;
+  int useful_depth;
+  int const_param_idx;
+  int conflict1, conflict2;
+  MinMaxSize size;
+  std::vector<Constructor*> constructors;
+  std::vector<int> args;
+  BitPfxCollection begins_with;
+  AdmissibilityInfo admissible_params;
+  std::unique_ptr<BinTrie> cs_trie;
+
+  Type(int idx, sym_idx_t _tname = 0, bool pnat = false, int _arity = -1, bool _final = false, bool _nonempty = false)
+      : type_name(_tname)
+      , type_idx(idx)
+      , parent_type_idx(-1)
+      , constr_num(0)
+      , arity(_arity)
+      , used(0)
+      , last_declared(0)
+      , produces_nat(pnat)
+      , is_final(_final)
+      , is_builtin(_final)
+      , is_enum(!_final)
+      , is_simple_enum(!_final)
+      , is_special(false)
+      , is_pfx_determ(false)
+      , is_param_determ(false)
+      , is_const_param_determ(false)
+      , is_const_param_pfx_determ(false)
+      , is_param_pfx_determ(false)
+      , is_determ(false)
+      , has_fixed_size(false)
+      , any_bits(false)
+      , is_auto(false)
+      , is_anon(false)
+      , is_unit(false)
+      , is_bool(false)
+      , is_integer(pnat)
+      , useful_depth(-1)
+      , const_param_idx(-1)
+      , conflict1(-1)
+      , conflict2(-1) {
+    if (arity > 0) {
+      args.resize(arity, 0);
+    }
+    if (_nonempty) {
+      begins_with.all();
+    }
+  }
+  void bind_constructor(const src::SrcLocation& loc, Constructor* cs);
+  bool unique_constructor_equals(const Constructor& cs, bool allow_other_names = false) const;
+  void print_name(std::ostream& os) const;
+  std::string get_name() const;
+  bool recompute_begins_with();
+  bool recompute_minmax_size();
+  bool recompute_any_bits();
+  bool compute_admissible_params();
+  void compute_constructor_trie();
+  int detect_const_params();
+  bool check_conflicts();
+  void show_constructor_conflict();
+  void detect_basic_types();
+  bool cons_all_exact() const;
+  int cons_common_len() const;
+  bool is_const_arg(int p) const;
+  std::vector<int> get_all_param_values(int p) const;
+  std::vector<int> get_constr_by_param_value(int p, int pv) const;
+  void renew_last_declared() {
+    last_declared = ++last_declared_counter;
+  }
+};
+
+extern TypeExpr type_Type;
+
+struct SymVal : sym::SymValBase {
+  TypeExpr* sym_type;
+  SymVal(int _type, int _idx, TypeExpr* _stype = nullptr) : sym::SymValBase(_type, _idx), sym_type(_stype) {
+  }
+  TypeExpr* get_type() const {
+    return sym_type;
+  }
+};
+
+struct SymValType : SymVal {
+  Type* type_ref;
+  explicit SymValType(Type* _type = nullptr) : SymVal(sym::SymValBase::_Typename, 0, &type_Type), type_ref(_type) {
+  }
+};
+
+extern sym_idx_t Nat_name, Eq_name, Less_name, Leq_name;
+extern Type *Nat_type, *Eq_type;
+extern Type *NatWidth_type, *NatLess_type, *NatLeq_type, *Int_type, *UInt_type;
+
+extern int types_num, builtin_types_num;
+extern std::vector<Type> types;
+
+}  // namespace tlbc
diff --git a/submodules/ton/tonlib-src/crypto/tl/tlbc-gen-cpp.cpp b/submodules/ton/tonlib-src/crypto/tl/tlbc-gen-cpp.cpp
new file mode 100644
index 0000000000..5ab0620cce
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/tl/tlbc-gen-cpp.cpp
@@ -0,0 +1,3434 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tlbc-gen-cpp.h"
+#include "td/utils/bits.h"
+#include "td/utils/filesystem.h"
+
+namespace tlbc {
+
+/*
+ * 
+ *   C++ CODE GENERATION
+ * 
+ */
+
+CppIdentSet global_cpp_ids;
+
+std::vector<std::unique_ptr<CppTypeCode>> cpp_type;
+
+bool add_type_members;
+
+std::set<std::string> forbidden_cpp_idents, local_forbidden_cpp_idents;
+std::vector<std::string> const_type_expr_cpp_idents;
+std::vector<bool> const_type_expr_simple;
+
+void init_forbidden_cpp_idents() {
+  std::set<std::string>& f = forbidden_cpp_idents;
+  f.insert("true");
+  f.insert("false");
+  f.insert("int");
+  f.insert("bool");
+  f.insert("unsigned");
+  f.insert("long");
+  f.insert("short");
+  f.insert("char");
+  f.insert("void");
+  f.insert("class");
+  f.insert("struct");
+  f.insert("enum");
+  f.insert("union");
+  f.insert("public");
+  f.insert("private");
+  f.insert("protected");
+  f.insert("extern");
+  f.insert("static");
+  f.insert("final");
+  f.insert("if");
+  f.insert("else");
+  f.insert("while");
+  f.insert("do");
+  f.insert("for");
+  f.insert("break");
+  f.insert("continue");
+  f.insert("return");
+  f.insert("virtual");
+  f.insert("explicit");
+  f.insert("override");
+  f.insert("new");
+  f.insert("delete");
+  f.insert("operator");
+  f.insert("Ref");
+  f.insert("Cell");
+  f.insert("CellSlice");
+  f.insert("Anything");
+  f.insert("RefAnything");
+  f.insert("Nat");
+  f.insert("t_Nat");
+  f.insert("t_RefCell");
+  f.insert("t_Anything");
+  f.insert("TLB");
+  f.insert("TLB_Complex");
+  f.insert("PrettyPrinter");
+  std::set<std::string>& l = local_forbidden_cpp_idents;
+  l.insert("cons_len");
+  l.insert("cons_len_exact");
+  l.insert("cons_tag");
+  l.insert("skip");
+  l.insert("validate_skip");
+  l.insert("get_size");
+  l.insert("pack");
+  l.insert("unpack");
+  l.insert("cs");
+  l.insert("cb");
+  l.insert("cell_ref");
+  l.insert("type_class");
+  l.insert("pp");
+  l.insert("weak");
+}
+
+std::string CppIdentSet::compute_cpp_ident(std::string orig_ident, int count) {
+  std::ostringstream os;
+  int a, r = 0, cnt = 0;
+  bool prev_skip = false;
+  for (int c : orig_ident) {
+    bool pp = prev_skip;
+    prev_skip = true;
+    if (c & 0x80) {
+      if ((c & 0xe0) == 0xc0) {
+        a = (c & 0x1f);
+        r = 1;
+        continue;
+      } else if ((c & 0xf0) == 0xe0) {
+        a = (c & 0x0f);
+        r = 2;
+        continue;
+      }
+      if ((c & 0xc0) != 0x80) {
+        continue;
+      }
+      if (!r) {
+        continue;
+      }
+      a = (a << 6) | (c & 0x3f);
+      if (--r) {
+        continue;
+      }
+      c = a;
+    }
+    prev_skip = false;
+    if ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z') || c == '_') {
+      os << (char)c;
+      cnt++;
+      continue;
+    }
+    if (c >= '0' && c <= '9') {
+      if (!cnt) {
+        os << '_';
+        cnt++;
+      }
+      os << (char)c;
+      cnt++;
+      continue;
+    }
+    if (c >= 0x410 && c < 0x450) {
+      os << (char)(0xc0 + (c >> 6)) << (char)(0x80 + (c & 0x3f));
+      cnt++;
+      continue;
+    }
+    prev_skip = true;
+    if (!pp) {
+      os << '_';
+    }
+  }
+  if (!cnt) {
+    os << '_';
+    prev_skip = true;
+  }
+  if (count) {
+    os << count;
+  }
+  return os.str();
+}
+
+bool CppIdentSet::is_good_ident(std::string ident) {
+  return !defined(ident) && !forbidden_cpp_idents.count(ident) &&
+         !(extra_forbidden_idents && extra_forbidden_idents->count(ident));
+}
+
+std::string CppIdentSet::new_ident(std::string orig_ident, int count, std::string suffix) {
+  while (true) {
+    std::string ident = compute_cpp_ident(orig_ident, count) + suffix;
+    if (is_good_ident(ident)) {
+      cpp_idents.insert(ident);
+      return ident;
+    }
+    ++count;
+  }
+}
+
+struct SizeWriter {
+  int sz;
+  explicit SizeWriter(int _sz) : sz(_sz) {
+  }
+  void write(std::ostream& os) const;
+};
+
+void SizeWriter::write(std::ostream& os) const {
+  if (sz < 0x10000) {
+    os << sz;
+  } else {
+    os << "0x" << std::hex << sz << std::dec;
+  }
+}
+
+std::ostream& operator<<(std::ostream& os, SizeWriter w) {
+  w.write(os);
+  return os;
+}
+
+unsigned long long CppTypeCode::compute_selector_mask() const {
+  unsigned long long z = 0, w = 1;
+  int c = 0;
+  for (int v : cons_tag_map) {
+    if (v > c) {
+      c = v;
+      z |= w;
+    }
+    w <<= 1;
+  }
+  return z;
+}
+
+struct HexConstWriter {
+  unsigned long long mask;
+  explicit HexConstWriter(unsigned long long _mask) : mask(_mask){};
+  void write(std::ostream& os) const;
+};
+
+void HexConstWriter::write(std::ostream& os) const {
+  if (mask < 32) {
+    os << mask;
+  } else {
+    os << "0x" << std::hex << mask << std::dec;
+  }
+  if (mask >= (1ULL << 31)) {
+    os << (mask >= (1ULL << 32) ? "ULL" : "U");
+  }
+}
+
+std::ostream& operator<<(std::ostream& os, HexConstWriter w) {
+  w.write(os);
+  return os;
+}
+
+cpp_val_type detect_cpp_type(const TypeExpr* expr) {
+  if (expr->tp == TypeExpr::te_Ref) {
+    return ct_cell;
+  }
+  if (expr->is_nat) {
+    return ct_int32;
+  }
+  MinMaxSize sz = expr->compute_size();
+  int l = sz.fixed_bit_size();
+  if (expr->is_nat_subtype) {
+    return l == 1 ? ct_bool : ct_int32;
+  }
+  if (expr->tp == TypeExpr::te_CondType) {
+    cpp_val_type subtype = detect_cpp_type(expr->args.at(1));
+    if (subtype == ct_slice || subtype == ct_cell || subtype == ct_integer || subtype == ct_bitstring ||
+        subtype == ct_enum) {
+      return subtype;
+    }
+    if ((subtype == ct_int32 || subtype == ct_int64) && expr->args[1]->is_integer() > 0) {
+      return subtype;
+    }
+    return ct_slice;
+  }
+  int x = expr->is_integer();
+  if (sz.max_size() & 0xff) {
+    return ct_slice;
+  }
+  if (!x) {
+    const Type* ta = expr->type_applied;
+    if (expr->tp == TypeExpr::te_Apply && ta && ta->is_simple_enum) {
+      return ct_enum;
+    }
+    if (expr->tp == TypeExpr::te_Apply && ta && ta->type_idx < builtin_types_num &&
+        (ta == Bits_type || ta->get_name().at(0) == 'b')) {
+      return (l >= 0 && l <= 256) ? ct_bits : ct_bitstring;
+    }
+    if (expr->tp == TypeExpr::te_Tuple && expr->args[1]->tp == TypeExpr::te_Apply &&
+        expr->args[1]->type_applied->is_bool) {
+      return (l >= 0 && l <= 256) ? ct_bits : ct_bitstring;
+    }
+    return ct_slice;
+  }
+  l = (sz.max_size() >> 8);
+  if (x > 0 && l == 1) {
+    return ct_bool;
+  }
+  if (l < 32) {
+    return ct_int32;
+  }
+  if (l == 32) {
+    return (x < 0 ? ct_int32 : ct_uint32);
+  }
+  if (l < 64) {
+    return ct_int64;
+  }
+  if (l == 64) {
+    return (x < 0 ? ct_int64 : ct_uint64);
+  }
+  return ct_integer;
+}
+
+cpp_val_type detect_field_cpp_type(const Field& field) {
+  return field.subrec ? ct_subrecord : detect_cpp_type(field.type);
+}
+
+void show_valtype(std::ostream& os, cpp_val_type x, int size = -1, bool pass_value = false) {
+  switch (x) {
+    case ct_void:
+      os << "void";
+      break;
+    case ct_slice:
+      os << "Ref<CellSlice>";
+      break;
+    case ct_cell:
+      os << "Ref<Cell>";
+      break;
+    case ct_typeptr:
+      os << "const TLB*";
+      break;
+    case ct_typeref:
+      os << "const TLB&";
+      break;
+    case ct_bitstring:
+      os << "Ref<td::BitString>";
+      break;
+    case ct_bits:
+      if (pass_value) {
+        os << "const ";
+      }
+      os << "td::BitArray<" << size << ">";
+      if (pass_value) {
+        os << "&";
+      }
+      break;
+    case ct_integer:
+      os << "RefInt256";
+      break;
+    case ct_bool:
+      os << "bool";
+      break;
+    case ct_enum:
+      os << "char";
+      break;
+    case ct_int32:
+      os << "int";
+      break;
+    case ct_uint32:
+      os << "unsigned";
+      break;
+    case ct_int64:
+      os << "long long";
+      break;
+    case ct_uint64:
+      os << "unsigned long long";
+      break;
+    case ct_subrecord:
+      if (pass_value) {
+        os << "const ";
+      }
+      os << "<unknown-cpp-type>::Record";
+      if (pass_value) {
+        os << "&";
+      }
+      break;
+    default:
+      os << "<unknown-cpp-scalar-type>";
+  }
+}
+
+bool CppValType::needs_move() const {
+  return (vt == ct_cell || vt == ct_slice || vt == ct_bitstring || vt == ct_integer);
+}
+
+void CppValType::show(std::ostream& os, bool pass_value) const {
+  show_valtype(os, vt, size, pass_value);
+}
+
+std::ostream& operator<<(std::ostream& os, CppValType cvt) {
+  cvt.show(os);
+  return os;
+}
+
+void CppTypeCode::ConsField::print_type(std::ostream& os, bool pass_value) const {
+  if (ctype != ct_subrecord) {
+    get_cvt().show(os, pass_value);
+  } else {
+    assert(subrec);
+    if (pass_value) {
+      os << "const ";
+    }
+    subrec->print_full_name(os);
+    if (pass_value) {
+      os << "&";
+    }
+  }
+}
+
+void CppTypeCode::ConsRecord::print_full_name(std::ostream& os) const {
+  os << cpp_type.cpp_type_class_name << "::" << cpp_name;
+}
+
+void CppTypeCode::assign_class_name() {
+  std::string type_name = type.get_name();
+  sym_idx_t name = type.type_name;
+  if (!name && type.parent_type_idx >= 0) {
+    int i = type.parent_type_idx;
+    while (true) {
+      name = types.at(i).type_name;
+      if (name || types.at(i).parent_type_idx < 0) {
+        break;
+      }
+      i = types.at(i).parent_type_idx;
+    }
+    if (name) {
+      type_name = sym::symbols.get_name(name) + "_aux";
+    }
+  }
+  cpp_type_class_name = global_cpp_ids.new_ident(type_name);
+  if (params) {
+    cpp_type_template_name = global_cpp_ids.new_ident(cpp_type_class_name + "T");
+  } else {
+    cpp_type_var_name = global_cpp_ids.new_ident(std::string{"t_"} + cpp_type_class_name);
+  }
+}
+
+void CppTypeCode::assign_cons_names() {
+  cons_enum_name.resize(cons_num);
+  for (int i = 0; i < cons_num; i++) {
+    sym_idx_t cons = type.constructors.at(i)->constr_name;
+    if (cons) {
+      cons_enum_name[i] = local_cpp_ids.new_ident(sym::symbols.get_name(cons));
+    } else if (type.const_param_idx >= 0) {
+      int pv = type.constructors[i]->get_const_param(type.const_param_idx);
+      cons_enum_name[i] = local_cpp_ids.new_ident(pv ? "cons" : "cons0", pv);
+    } else {
+      cons_enum_name[i] = local_cpp_ids.new_ident("cons", i + 1);
+    }
+  }
+}
+
+void CppTypeCode::assign_cons_values() {
+  std::vector<std::pair<unsigned long long, int>> a;
+  a.reserve(cons_num);
+  for (int i = 0; i < cons_num; i++) {
+    a.emplace_back(type.constructors[i]->begins_with.min(), i);
+  }
+  std::sort(a.begin(), a.end());
+  cons_enum_value.resize(cons_num);
+  cons_idx_by_enum.resize(cons_num);
+  int i = 0;
+  for (auto z : a) {
+    cons_enum_value[z.second] = i;
+    cons_idx_by_enum[i++] = z.second;
+  }
+}
+
+std::vector<std::string> std_field_names = {"x", "y", "z", "t", "u", "v", "w"};
+
+void CppTypeCode::assign_record_cons_names() {
+  for (int i = 0; i < cons_num; i++) {
+    const Constructor& ctor = *type.constructors.at(i);
+    records.emplace_back(*this, ctor, i);
+    ConsRecord& record = records.back();
+    record.has_trivial_name = (cons_num <= 1 || !ctor.constr_name);
+    record.declared = false;
+    record.cpp_name = local_cpp_ids.new_ident(cons_num <= 1 ? "Record" : std::string{"Record_"} + cons_enum_name[i]);
+    CppIdentSet rec_cpp_ids;
+    rec_cpp_ids.insert("type_class");
+    rec_cpp_ids.insert(record.cpp_name);
+    // maybe : add field identifiers from type class context (?)
+    for (int j = 0; j < ctor.fields_num; j++) {
+      const Field& field = ctor.fields.at(j);
+      if (field.constraint) {
+      } else if (!field.implicit) {
+        MinMaxSize sz = field.type->compute_size();
+        if (!sz.max_size()) {
+          continue;
+        }
+        std::string field_name;
+        const ConsRecord* subrec = nullptr;
+        if (field.name) {
+          field_name = rec_cpp_ids.new_ident(field.get_name());
+        } else if (field.subrec) {
+          field_name = rec_cpp_ids.new_ident("r", 1);
+          subrec = &cpp_type.at(field.type->args.at(0)->type_applied->type_idx)->records.at(0);
+        } else if (field.type->tp == TypeExpr::te_Ref) {
+          field_name = rec_cpp_ids.new_ident("ref", 1);
+        }
+        record.cpp_fields.emplace_back(field, field_name, detect_field_cpp_type(field), sz.fixed_bit_size(), j, subrec);
+      } else if (field.used && (add_type_members || field.type->is_nat_subtype)) {
+        std::string field_name = rec_cpp_ids.new_ident(field.get_name());
+        record.cpp_fields.emplace_back(field, field_name, field.type->is_nat_subtype ? ct_int32 : ct_typeptr, -1, j,
+                                       nullptr, true);
+      }
+    }
+    auto q = std_field_names.cbegin();
+    for (auto& fi : record.cpp_fields) {
+      if (fi.name.empty()) {
+        bool is_ok = false;
+        while (q < std_field_names.cend()) {
+          if (!rec_cpp_ids.defined(*q)) {
+            fi.name = rec_cpp_ids.new_ident(*q++);
+            is_ok = true;
+            break;
+          }
+        }
+        if (!is_ok) {
+          fi.name = rec_cpp_ids.new_ident("f", 1);
+        }
+      }
+    }
+    record.is_trivial = (record.cpp_fields.size() <= 1);
+    record.is_small = (record.cpp_fields.size() <= 3);
+    record.inline_record = (record.cpp_fields.size() <= 2);
+    cpp_val_type t = ct_unknown;
+    if (record.is_trivial) {
+      t = (record.cpp_fields.size() == 1) ? record.cpp_fields.at(0).ctype : ct_void;
+    }
+    std::vector<cpp_val_type> tv;
+    for (const auto& f : record.cpp_fields) {
+      if (f.ctype == ct_subrecord) {
+        record.is_trivial = record.is_small = false;
+      } else if (!f.implicit) {
+        tv.push_back(f.ctype);
+      }
+    }
+    record.equiv_cpp_type = t;
+    record.equiv_cpp_types = tv;
+    record.triv_conflict = false;
+    for (int j = 0; j < i; j++) {
+      if (records[j].equiv_cpp_types == tv) {
+        record.triv_conflict = records[j].triv_conflict = true;
+        break;
+      }
+    }
+  }
+}
+
+bool CppTypeCode::ConsRecord::recover_idents(CppIdentSet& idents) const {
+  bool is_ok = idents.insert(cpp_name) && idents.insert("type_class");
+  for (const auto& f : cpp_fields) {
+    is_ok &= idents.insert(f.name);
+  }
+  return is_ok;
+}
+
+void CppTypeCode::assign_class_field_names() {
+  char cn = 'm', ct = 'X';
+  int c = 0;
+  for (int z : type.args) {
+    bool f = z & Type::_IsNat;
+    bool neg = (z & Type::_IsNeg);
+    type_param_is_nat.push_back(f);
+    type_param_is_neg.push_back(neg);
+    std::string id;
+    if (!neg && !c++) {
+      template_args += ", ";
+      constructor_args += ", ";
+    }
+    if (f) {
+      id = local_cpp_ids.new_ident(std::string{cn}, 0, "_");
+      if (cn != 't') {
+        ++cn;
+      }
+      if (!neg) {
+        template_args += "int ";
+        constructor_args += "int ";
+      } else {
+        skip_extra_args += ", int& ";
+        skip_extra_args_pass += ", ";
+      }
+    } else {
+      id = local_cpp_ids.new_ident(std::string{ct}, 0, "_");
+      if (ct != 'Z') {
+        ++ct;
+      } else {
+        ct = 'T';
+      }
+      assert(!neg);
+      template_args += "typename ";
+      constructor_args += "const TLB& ";
+    }
+    type_param_name.push_back(id);
+    if (!neg) {
+      template_args += id;
+      constructor_args += id;
+    } else {
+      skip_extra_args += id;
+      skip_extra_args_pass += id;
+    }
+  }
+}
+
+bool CppTypeCode::compute_simple_cons_tags() {
+  if (!type.is_pfx_determ || type.useful_depth > 8) {
+    return false;
+  }
+  int d = type.useful_depth;
+  int n = (1 << d);
+  cons_tag_map.resize(n, 0);
+  //std::cerr << "compute_simple_cons_tags() for `" << type.get_name() << "` (d=" << d << ")\n";
+  for (int i = 0; i < cons_num; i++) {
+    int t = cons_enum_value.at(i) + 1;
+    for (unsigned long long z : type.constructors[i]->begins_with.pfx) {
+      int l = std::min(63 - td::count_trailing_zeroes_non_zero64(z), d);
+      assert(l <= d);
+      int a = d ? (int)((z & (z - 1)) >> (64 - d)) : 0;
+      int b = (1 << (d - l));
+      while (b-- > 0) {
+        assert(!cons_tag_map.at(a) || cons_tag_map[a] == t);
+        cons_tag_map[a++] = t;
+      }
+    }
+  }
+  int c = 0;
+  for (int v : cons_tag_map) {
+    if (v && v != c && v != ++c) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool CppTypeCode::check_incremental_cons_tags() const {
+  if (!cons_num || common_cons_len < 0) {
+    return false;
+  }
+  int l = common_cons_len;
+  if (!l || l > 32) {
+    return true;
+  }
+  for (int i = 0; i < cons_num; i++) {
+    unsigned long long tag = (type.constructors.at(i)->tag >> (64 - l));
+    if (tag != (unsigned)cons_enum_value.at(i)) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool CppTypeCode::init() {
+  builtin = type.is_builtin;
+  cons_num = type.constr_num;
+  params = ret_params = tot_params = 0;
+  for (int z : type.args) {
+    if ((z & Type::_IsNeg)) {
+      ++ret_params;
+    } else {
+      ++params;
+    }
+    ++tot_params;
+  }
+  assign_class_name();
+  assign_cons_names();
+  assign_class_field_names();
+  assign_cons_values();
+  assign_record_cons_names();
+  simple_get_size = type.has_fixed_size;
+  inline_skip = simple_get_size;
+  inline_validate_skip = (inline_skip && type.any_bits && !(type.size.min_size() & 0xff));
+  inline_get_tag = (type.is_pfx_determ && type.useful_depth <= 6);
+  simple_cons_tags = compute_simple_cons_tags();
+  common_cons_len = type.cons_common_len();
+  incremental_cons_tags = check_incremental_cons_tags();
+  return true;
+}
+
+void CppTypeCode::generate_cons_enum(std::ostream& os) {
+  os << "  enum { ";
+  for (int i = 0; i < cons_num; i++) {
+    if (i) {
+      os << ", ";
+    }
+    int k = cons_idx_by_enum.at(i);
+    os << cons_enum_name.at(k);
+    assert(cons_enum_value.at(k) == i);
+  }
+  os << " };\n";
+}
+
+void CppTypeCode::generate_cons_len_array(std::ostream& os, std::string nl, int options) {
+  bool f = (options & 2);
+  os << nl << (f ? "" : "static ") << ((options & 3) ? "constexpr " : "") << "char ";
+  if (f) {
+    os << cpp_type_class_name << "::";
+  }
+  os << "cons_len[" << cons_num << "]";
+  if (f) {
+    os << ";\n";
+    return;
+  }
+  os << " = { ";
+  for (int i = 0; i < cons_num; i++) {
+    int k = cons_idx_by_enum.at(i);
+    const Constructor& constr = *type.constructors.at(k);
+    if (i > 0) {
+      os << ", ";
+    }
+    os << constr.tag_bits;
+  }
+  os << " };\n";
+}
+
+void CppTypeCode::generate_cons_tag_array(std::ostream& os, std::string nl, int options) {
+  int m = -1;
+  for (int i = 0; i < cons_num; i++) {
+    int k = cons_idx_by_enum.at(i);
+    const Constructor& constr = *type.constructors.at(k);
+    if (constr.tag_bits > m) {
+      m = constr.tag_bits;
+    }
+  }
+  bool f = (options & 2);
+  os << nl << (f ? "" : "static ") << ((options & 3) ? "constexpr " : "");
+  if (m <= 8) {
+    os << "unsigned char ";
+  } else if (m <= 16) {
+    os << "unsigned short ";
+  } else if (m <= 32) {
+    os << "unsigned ";
+  } else {
+    os << "unsigned long long ";
+  }
+  if (f) {
+    os << cpp_type_class_name << "::";
+  }
+  os << "cons_tag[" << cons_num << "]";
+  if (f) {
+    os << ";\n";
+    return;
+  }
+  os << " = { ";
+  for (int i = 0; i < cons_num; i++) {
+    int k = cons_idx_by_enum.at(i);
+    const Constructor& constr = *type.constructors.at(k);
+    if (i > 0) {
+      os << ", ";
+    }
+    os << HexConstWriter{constr.tag_bits ? (constr.tag >> (64 - constr.tag_bits)) : 0};
+  }
+  os << " };\n";
+}
+
+void CppTypeCode::generate_cons_tag_info(std::ostream& os, std::string nl, int options) {
+  if (cons_num) {
+    if (common_cons_len == -1) {
+      generate_cons_len_array(os, nl, options);
+    } else if (options & 1) {
+      os << "  static constexpr int cons_len_exact = " << common_cons_len << ";\n";
+    }
+    if (common_cons_len != 0 && !incremental_cons_tags) {
+      generate_cons_tag_array(os, nl, options);
+    }
+  }
+}
+
+void CppTypeCode::generate_get_tag_subcase(std::ostream& os, std::string nl, const BinTrie* trie, int depth) const {
+  if (!trie || !trie->down_tag) {
+    os << nl << "return -1; // ???";
+    return;
+  }
+  if (trie->is_unique()) {
+    os << nl << "return " << cons_enum_name.at(trie->unique_value()) << ";";
+    return;
+  }
+  if (!trie->useful_depth) {
+    generate_get_tag_param(os, nl, trie->down_tag);
+    return;
+  }
+  assert(trie->left || trie->right);
+  if (!trie->right) {
+    generate_get_tag_subcase(os, nl, trie->left.get(), depth + 1);
+    return;
+  }
+  if (!trie->left) {
+    generate_get_tag_subcase(os, nl, trie->right.get(), depth + 1);
+    return;
+  }
+  if (trie->left->is_unique() && trie->right->is_unique()) {
+    os << nl << "return cs.bit_at(" << depth << ") ? ";
+    int a = trie->right->unique_value(), b = trie->left->unique_value();
+    os << (a >= 0 ? cons_enum_name.at(a) : "-1") << " : ";
+    os << (b >= 0 ? cons_enum_name.at(b) : "-1") << ";";
+    return;
+  }
+  os << nl << "if (cs.bit_at(" << depth << ")) {";
+  generate_get_tag_subcase(os, nl + "  ", trie->right.get(), depth + 1);
+  os << nl << "} else {";
+  generate_get_tag_subcase(os, nl + "  ", trie->left.get(), depth + 1);
+  os << nl << "}";
+}
+
+void CppTypeCode::generate_get_tag_param(std::ostream& os, std::string nl, unsigned long long tag,
+                                         unsigned long long tag_params) const {
+  if (!tag) {
+    os << nl << "return -1; // ???";
+    return;
+  }
+  if (!(tag & (tag - 1))) {
+    os << nl << "return " << cons_enum_name.at(td::count_trailing_zeroes64(tag)) << ";";
+    return;
+  }
+  int cnt = td::count_bits64(tag);
+  DCHECK(cnt >= 2);
+  int mdim = 0, mmdim = 0;
+  for (int c = 0; c < 64; c++) {
+    if ((tag >> c) & 1) {
+      int dim = type.constructors.at(c)->admissible_params.dim;
+      if (dim > mdim) {
+        mmdim = mdim;
+        mdim = dim;
+      } else if (dim > mmdim) {
+        mmdim = dim;
+      }
+    }
+  }
+  assert(mmdim > 0);
+  for (int p1 = 0; p1 < mmdim; p1++) {
+    char A[4];
+    std::memset(A, 0, sizeof(A));
+    int c;
+    for (c = 0; c < 64; c++) {
+      if ((tag >> c) & 1) {
+        if (!type.constructors[c]->admissible_params.extract1(A, (char)(c + 1), p1)) {
+          break;
+        }
+      }
+    }
+    if (c == 64) {
+      std::string param_name = get_nat_param_name(p1);
+      generate_get_tag_param1(os, nl, A, &param_name);
+      return;
+    }
+  }
+  for (int p2 = 0; p2 < mmdim; p2++) {
+    for (int p1 = 0; p1 < p2; p1++) {
+      char A[4][4];
+      std::memset(A, 0, sizeof(A));
+      int c;
+      for (c = 0; c < 64; c++) {
+        if ((tag >> c) & 1) {
+          if (!type.constructors[c]->admissible_params.extract2(A, (char)(c + 1), p1, p2)) {
+            break;
+          }
+        }
+      }
+      if (c == 64) {
+        std::string param_names[2];
+        param_names[0] = get_nat_param_name(p1);
+        param_names[1] = get_nat_param_name(p2);
+        generate_get_tag_param2(os, nl, A, param_names);
+        return;
+      }
+    }
+  }
+  for (int p3 = 0; p3 < mmdim; p3++) {
+    for (int p2 = 0; p2 < p3; p2++) {
+      for (int p1 = 0; p1 < p2; p1++) {
+        char A[4][4][4];
+        std::memset(A, 0, sizeof(A));
+        int c;
+        for (c = 0; c < 64; c++) {
+          if ((tag >> c) & 1) {
+            if (!type.constructors[c]->admissible_params.extract3(A, (char)(c + 1), p1, p2, p3)) {
+              break;
+            }
+          }
+        }
+        if (c == 64) {
+          std::string param_names[3];
+          param_names[0] = get_nat_param_name(p1);
+          param_names[1] = get_nat_param_name(p2);
+          param_names[2] = get_nat_param_name(p3);
+          generate_get_tag_param3(os, nl, A, param_names);
+          return;
+        }
+      }
+    }
+  }
+  os << nl << "// ??? cannot distinguish constructors for this type using up to three parameters\n";
+  throw src::Fatal{std::string{"cannot generate `"} + cpp_type_class_name + "::get_tag()` method for type `" +
+                   type.get_name() + "`"};
+}
+
+bool CppTypeCode::match_param_pattern(std::ostream& os, std::string nl, const char A[4], int mask, std::string pattern,
+                                      std::string param_name) const {
+  int v = 0, w = 0;
+  for (int i = 0; i < 4; i++) {
+    if (A[i]) {
+      if ((mask >> i) & 1) {
+        v = (v && v != A[i] ? -1 : A[i]);
+      } else {
+        w = (w && w != A[i] ? -1 : A[i]);
+      }
+    }
+  }
+  if (v <= 0 || w <= 0) {
+    return false;
+  }
+  os << nl << "return ";
+  for (char c : pattern) {
+    if (c != '#') {
+      os << c;
+    } else {
+      os << param_name;
+    }
+  }
+  os << " ? " << cons_enum_name.at(v - 1) << " : " << cons_enum_name.at(w - 1) << ";";
+  return true;
+}
+
+void CppTypeCode::generate_get_tag_param1(std::ostream& os, std::string nl, const char A[4],
+                                          const std::string param_names[1]) const {
+  os << nl << "// distinguish by parameter `" << param_names[0] << "` using";
+  for (int i = 0; i < 4; i++) {
+    os << ' ' << (int)A[i];
+  }
+  if (match_param_pattern(os, nl, A, 14, "#", param_names[0]) ||
+      match_param_pattern(os, nl, A, 2, "# == 1", param_names[0]) ||
+      match_param_pattern(os, nl, A, 3, "# <= 1", param_names[0]) ||
+      match_param_pattern(os, nl, A, 10, "(# & 1)", param_names[0]) ||
+      match_param_pattern(os, nl, A, 4, "# && !(# & 1)", param_names[0]) ||
+      match_param_pattern(os, nl, A, 8, "# > 1 && (# & 1)", param_names[0])) {
+    return;
+  }
+  os << nl << "static inline size_t nat_abs(int x) { return (x > 1) * 2 + (x & 1); }";
+  os << nl << "static signed char ctab[4] = { ";
+  for (int i = 0; i < 4; i++) {
+    if (i > 0) {
+      os << ", ";
+    }
+    os << (A[i] ? cons_enum_name.at(A[i] - 1) : "-1");
+  }
+  os << " };" << nl << "return ctab[nat_abs(" << param_names[0] << ")];";
+}
+
+void CppTypeCode::generate_get_tag_param2(std::ostream& os, std::string nl, const char A[4][4],
+                                          const std::string param_names[2]) const {
+  os << nl << "// distinguish by parameters `" << param_names[0] << "`, `" << param_names[1] << "` using";
+  for (int i = 0; i < 4; i++) {
+    for (int j = 0; j < 4; j++) {
+      os << ' ' << (int)A[i][j];
+    }
+  }
+  os << nl << "static inline size_t nat_abs(int x) { return (x > 1) * 2 + (x & 1); }";
+  os << nl << "static signed char ctab[4][4] = { ";
+  for (int i = 0; i < 16; i++) {
+    if (i > 0) {
+      os << ", ";
+    }
+    int v = A[i >> 2][i & 3];
+    os << (v ? cons_enum_name.at(v - 1) : "-1");
+  }
+  os << " };" << nl << "return ctab[nat_abs(" << param_names[0] << ")][nat_abs(" << param_names[1] << ")];";
+}
+
+void CppTypeCode::generate_get_tag_param3(std::ostream& os, std::string nl, const char A[4][4][4],
+                                          const std::string param_names[3]) const {
+  os << nl << "// distinguish by parameters `" << param_names[0] << "`, `" << param_names[1] << "`, `" << param_names[2]
+     << "` using";
+  for (int i = 0; i < 4; i++) {
+    for (int j = 0; j < 4; j++) {
+      for (int k = 0; k < 4; k++) {
+        os << ' ' << (int)A[i][j][k];
+      }
+    }
+  }
+  os << nl << "static inline size_t nat_abs(int x) { return (x > 1) * 2 + (x & 1); }";
+  os << nl << "static signed char ctab[4][4][4] = { ";
+  for (int i = 0; i < 64; i++) {
+    if (i > 0) {
+      os << ", ";
+    }
+    int v = A[i >> 4][(i >> 2) & 3][i & 3];
+    os << (v ? cons_enum_name.at(v - 1) : "-1");
+  }
+  os << " };" << nl << "return ctab[nat_abs(" << param_names[0] << ")][nat_abs(" << param_names[1] << ")][nat_abs("
+     << param_names[2] << ")];";
+}
+
+std::string CppTypeCode::get_nat_param_name(int idx) const {
+  for (int i = 0; i < tot_params; i++) {
+    if (!type_param_is_neg.at(i) && type_param_is_nat.at(i) && !idx--) {
+      return type_param_name.at(i);
+    }
+  }
+  return "???";
+}
+
+void CppTypeCode::generate_tag_pfx_selector(std::ostream& os, std::string nl, const BinTrie& trie, int d,
+                                            int min_size) const {
+  assert(d >= 0 && d <= 6);
+  int n = (1 << d);
+  unsigned long long A[64];
+  int c[65];
+  unsigned long long mask = trie.build_submap(d, A);
+  int l = 1;
+  c[0] = -1;
+  for (int i = 0; i < n; i++) {
+    assert(!(A[i] & (A[i] - 1)));
+    if ((mask >> l) & 1) {
+      c[l++] = A[i] ? td::count_trailing_zeroes_non_zero64(A[i]) : -1;
+    }
+  }
+  bool simple = (l > n / 2);
+  if (simple) {
+    l = n + 1;
+    for (int i = 0; i < n; i++) {
+      c[i + 1] = A[i] ? td::count_trailing_zeroes_non_zero64(A[i]) : -1;
+    }
+  }
+  os << nl << "static signed char ctab[" << l << "] = {";
+  for (int i = 0; i < l; i++) {
+    if (i > 0) {
+      os << ", ";
+    }
+    if (c[i] < 0) {
+      os << c[i];
+    } else {
+      os << cons_enum_name.at(c[i]);
+    }
+  }
+  os << "};" << nl << "return ctab[1 + ";
+  if (simple) {
+    os << "(long)cs.prefetch_ulong(" << d << ")];";
+  } else {
+    os << "(long)cs.bselect" << (d >= min_size ? "(" : "_ext(") << d << ", " << HexConstWriter{mask} << ")];";
+  }
+}
+
+bool CppTypeCode::generate_get_tag_pfx_distinguisher(std::ostream& os, std::string nl,
+                                                     const std::vector<int>& constr_list, bool in_block) const {
+  if (constr_list.empty()) {
+    os << nl << "  return -1;";
+    return false;
+  }
+  if (constr_list.size() == 1) {
+    os << nl << "  return " << cons_enum_name.at(constr_list[0]) << ";";
+    return false;
+  }
+  std::unique_ptr<BinTrie> trie;
+  for (int i : constr_list) {
+    trie = BinTrie::insert_paths(std::move(trie), type.constructors.at(i)->begins_with, 1ULL << i);
+  }
+  if (!trie) {
+    os << nl << "  return -1;";
+    return false;
+  }
+  int d = trie->compute_useful_depth();
+  bool is_pfx_determ = !trie->find_conflict_path();
+  assert(is_pfx_determ);
+  if (!in_block) {
+    os << " {";
+  }
+  generate_tag_pfx_selector(os, nl, *trie, d, (int)(type.size.min_size() >> 8));
+  return !in_block;
+}
+
+void CppTypeCode::generate_get_tag_body(std::ostream& os, std::string nl) {
+  int d = type.useful_depth;
+  cons_tag_exact.resize(cons_num, false);
+  if (type.is_pfx_determ) {
+    if (!cons_num) {
+      os << nl << "return -1;";
+      return;
+    }
+    if (!d) {
+      assert(simple_cons_tags && cons_num == 1);
+      cons_tag_exact[0] = !(type.constructors.at(0)->tag_bits);
+      os << nl << "return 0;";
+      return;
+    }
+    int min_size = (int)(type.size.min_size() >> 8);
+    bool always_has = (d <= min_size);
+    if (d <= 6 && simple_cons_tags) {
+      unsigned long long sm = compute_selector_mask();
+      if (always_has && sm + 1 == (2ULL << ((1 << d) - 1))) {
+        for (int i = 0; i < cons_num; i++) {
+          cons_tag_exact[i] = (type.constructors.at(i)->tag_bits <= d);
+        }
+        os << nl << "return (int)cs.prefetch_ulong(" << d << ");";
+        return;
+      }
+      for (int i = 0; i < cons_num; i++) {
+        unsigned long long tag = type.constructors.at(i)->tag;
+        int l = 63 - td::count_trailing_zeroes_non_zero64(tag);
+        if (l <= d) {
+          int a = (int)((tag & (tag - 1)) >> (64 - d));
+          int b = a + (1 << (d - l));
+          cons_tag_exact[i] = ((sm >> a) & 1) && (b == (1 << d) || ((sm >> b) & 1));
+        }
+      }
+      os << nl << "return cs.bselect" << (always_has ? "(" : "_ext(") << d << ", " << HexConstWriter{sm} << ");";
+      return;
+    }
+    if (d <= 6) {
+      generate_tag_pfx_selector(os, nl, *(type.cs_trie), d, min_size);
+      return;
+    }
+  }
+  if (type.is_const_param_determ || type.is_const_param_pfx_determ) {
+    int p = type.const_param_idx;
+    assert(p >= 0);
+    std::vector<int> param_values = type.get_all_param_values(p);
+    assert(param_values.size() > 1 && param_values.at(0) >= 0);
+    os << nl << "switch (" << type_param_name.at(p) << ") {";
+    for (int pv : param_values) {
+      assert(pv >= 0);
+      os << nl << "case " << pv << ":";
+      std::vector<int> constr_list = type.get_constr_by_param_value(p, pv);
+      assert(!constr_list.empty());
+      if (constr_list.size() == 1) {
+        os << nl << "  return " << cons_enum_name.at(constr_list[0]) << ";";
+        continue;
+      }
+      bool opbr = generate_get_tag_pfx_distinguisher(os, nl + "  ", constr_list, false);
+      if (opbr) {
+        os << nl << "}";
+      }
+    }
+    os << nl << "default:" << nl << "  return -1;" << nl << "}";
+    return;
+  }
+  if (d) {
+    int d1 = std::min(6, d);
+    int n = (1 << d1);
+    bool always_has = (d1 <= (int)(type.size.min_size() >> 8));
+    unsigned long long A[64], B[64];
+    unsigned long long mask = type.cs_trie->build_submap(d1, A);
+    int l = td::count_bits64(mask);
+    bool simple = (l > n / 2 || n <= 8);
+    if (!simple) {
+      int j = 0;
+      for (int i = 0; i < n; i++) {
+        if ((mask >> i) & 1) {
+          //std::cerr << i << ',' << std::hex << A[i] << std::dec << std::endl;
+          B[j] = (2 * i + 1ULL) << (63 - d1);
+          A[j++] = A[i];
+        }
+      }
+      assert(j == l);
+    } else {
+      for (int i = 0; i < n; i++) {
+        B[i] = (2 * i + 1ULL) << (63 - d1);
+      }
+      l = n;
+    }
+    os << nl << "switch (";
+    if (simple) {
+      os << "(int)cs.prefetch_ulong(" << d1;
+    } else {
+      os << "cs.bselect" << (always_has ? "(" : "_ext(") << d1 << ", " << HexConstWriter{mask};
+    }
+    os << ")) {";
+    for (int i = 0; i < l; i++) {
+      if (A[i] != 0) {
+        if ((long)A[i] > 0) {
+          int j;
+          for (j = 0; j < i; j++) {
+            if (A[j] == A[i]) {
+              break;
+            }
+          }
+          if (j < i) {
+            continue;
+          }
+        }
+        os << nl << "case " << i << ":";
+        if ((long)A[i] > 0) {
+          int j;
+          for (j = i + 1; j < l; j++) {
+            if (A[j] == A[i]) {
+              os << "  case " << j << ":";
+            }
+          }
+          if (!(A[i] & (A[i] - 1))) {
+            os << nl << "  return " << cons_enum_name.at(td::count_trailing_zeroes_non_zero64(A[i])) << ";";
+          }
+        } else {
+          generate_get_tag_subcase(os, nl + "  ", type.cs_trie->lookup_node_const(B[i]), d1);
+        }
+      }
+    }
+    os << nl << "default:" << nl << "  return -1;" << nl << "}";
+  } else {
+    generate_get_tag_subcase(os, nl, type.cs_trie.get(), 0);
+  }
+}
+
+void CppTypeCode::generate_type_fields(std::ostream& os, int options) {
+  int st = -1;
+  for (int i = 0; i < tot_params; i++) {
+    if (type_param_is_neg[i]) {
+      continue;
+    }
+    int nst = type_param_is_nat[i];
+    if (st != nst) {
+      if (st >= 0) {
+        os << ";\n";
+      }
+      os << (nst ? "  int " : "  const TLB ");
+      st = nst;
+    } else {
+      os << ", ";
+    }
+    if (!nst) {
+      os << '&';
+    }
+    os << type_param_name[i];
+  }
+  if (st >= 0) {
+    os << ";\n";
+  }
+}
+
+static std::string constr_arg_name(std::string type_field_name) {
+  if (type_field_name.size() <= 1 || type_field_name.back() != '_') {
+    return std::string{"_"} + type_field_name;
+  } else {
+    return {type_field_name, 0, type_field_name.size() - 1};
+  }
+}
+
+void CppTypeCode::generate_type_constructor(std::ostream& os, int options) {
+  os << "  " << cpp_type_class_name << "(";
+  for (int i = 0, j = 0; i < tot_params; i++) {
+    if (type_param_is_neg[i]) {
+      continue;
+    }
+    if (j++ > 0) {
+      os << ", ";
+    }
+    os << (type_param_is_nat[i] ? "int " : "const TLB& ");
+    os << constr_arg_name(type_param_name[i]);
+  }
+  os << ")";
+  for (int i = 0, j = 0; i < tot_params; i++) {
+    if (type_param_is_neg[i]) {
+      continue;
+    }
+    if (j++ > 0) {
+      os << ", ";
+    } else {
+      os << " : ";
+    }
+    os << type_param_name[i] << "(" << constr_arg_name(type_param_name[i]) << ")";
+  }
+  os << " {}\n";
+}
+
+void Action::show(std::ostream& os) const {
+  if (fixed_size >= 0) {
+    if (!fixed_size) {
+      os << "true";
+    } else if (fixed_size < 0x10000) {
+      os << "cs.advance(" << fixed_size << ")";
+    } else if (!(fixed_size & 0xffff)) {
+      os << "cs.advance_refs(" << (fixed_size >> 16) << ")";
+    } else {
+      os << "cs.advance_ext(0x" << std::hex << fixed_size << std::dec << ")";
+    }
+  } else {
+    os << action;
+  }
+}
+
+bool Action::may_combine(const Action& next) const {
+  return !fixed_size || !next.fixed_size || (fixed_size >= 0 && next.fixed_size >= 0);
+}
+
+bool Action::operator+=(const Action& next) {
+  if (!next.fixed_size) {
+    return true;
+  }
+  if (!fixed_size) {
+    fixed_size = next.fixed_size;
+    action = next.action;
+    return true;
+  }
+  if (fixed_size >= 0 && next.fixed_size >= 0) {
+    fixed_size += next.fixed_size;
+    return true;
+  }
+  return false;
+}
+
+void operator+=(std::vector<Action>& av, const Action& next) {
+  if (av.empty() || !(av.back() += next)) {
+    if (next.is_constraint && !av.empty() && av.back().fixed_size >= 0) {
+      Action last = av.back();
+      av.pop_back();
+      av.push_back(next);
+      av.push_back(last);
+    } else {
+      av.push_back(next);
+    }
+  }
+}
+
+void CppTypeCode::clear_context() {
+  actions.clear();
+  incomplete = 0;
+  tmp_ints = 0;
+  needs_tmp_cell = false;
+  tmp_vars.clear();
+  field_vars.clear();
+  field_var_set.clear();
+  param_var_set.clear();
+  param_constraint_used.clear();
+  tmp_cpp_ids.clear();
+  tmp_cpp_ids.new_ident("cs");
+  tmp_cpp_ids.new_ident("cb");
+  tmp_cpp_ids.new_ident("cell_ref");
+  tmp_cpp_ids.new_ident("t");
+}
+
+std::string CppTypeCode::new_tmp_var() {
+  char buffer[16];
+  while (true) {
+    sprintf(buffer, "t%d", ++tmp_ints);
+    if (tmp_cpp_ids.is_good_ident(buffer) && local_cpp_ids.is_good_ident(buffer)) {
+      break;
+    }
+  }
+  std::string s{buffer};
+  s = tmp_cpp_ids.new_ident(s);
+  tmp_vars.push_back(s);
+  return s;
+}
+
+std::string CppTypeCode::new_tmp_var(std::string hint) {
+  if (hint.empty() || hint == "_") {
+    return new_tmp_var();
+  }
+  int count = 0;
+  while (true) {
+    std::string s = local_cpp_ids.compute_cpp_ident(hint, count++);
+    if (tmp_cpp_ids.is_good_ident(s) && local_cpp_ids.is_good_ident(s)) {
+      s = tmp_cpp_ids.new_ident(s);
+      tmp_vars.push_back(s);
+      return s;
+    }
+  }
+}
+
+std::string compute_type_class_name(const Type* typ, int& fake_arg) {
+  fake_arg = -1;
+  int idx = typ->type_idx;
+  if (idx >= builtin_types_num) {
+    return cpp_type[idx]->cpp_type_class_name;
+  } else if (typ->produces_nat) {
+    if (typ == Nat_type) {
+      return "Nat";
+    } else if (typ == NatWidth_type) {
+      return "NatWidth";
+    } else if (typ == NatLeq_type) {
+      return "NatLeq";
+    } else if (typ == NatLess_type) {
+      return "NatLess";
+    }
+    // ...
+  } else if (typ == Any_type) {
+    return "Anything";
+  } else if (typ->has_fixed_size) {
+    fake_arg = (typ->size.min_size() >> 8);
+    int c = typ->get_name()[0];
+    return (c == 'b') ? "Bits" : ((c == 'u') ? "UInt" : "Int");
+  } else if (typ == Int_type) {
+    return "Int";
+  } else if (typ == UInt_type) {
+    return "UInt";
+  } else if (typ == Bits_type) {
+    return "Bits";
+  }
+  return "<Unknown_Builtin_Type>";
+}
+
+std::string compute_type_expr_class_name(const TypeExpr* expr, int& fake_arg) {
+  switch (expr->tp) {
+    case TypeExpr::te_Apply:
+      return compute_type_class_name(expr->type_applied, fake_arg);
+    case TypeExpr::te_Ref:
+      return "RefT";
+    case TypeExpr::te_Tuple:
+      return "TupleT";
+    case TypeExpr::te_CondType:
+      return "CondT";
+  }
+  return "<Unknown-Type-Class>";
+}
+
+void CppTypeCode::output_cpp_expr(std::ostream& os, const TypeExpr* expr, int prio, bool allow_type_neg) const {
+  if (expr->negated) {
+    if (!allow_type_neg || expr->tp != TypeExpr::te_Apply) {
+      throw src::Fatal{static_cast<std::ostringstream&&>(std::ostringstream{} << "cannot convert negated expression `"
+                                                                              << expr << "` into C++ code")
+                           .str()};
+    }
+  }
+  int pos_args = 0;
+  for (const TypeExpr* arg : expr->args) {
+    pos_args += !arg->negated;
+  }
+  switch (expr->tp) {
+    case TypeExpr::te_Param: {
+      int i = expr->value;
+      assert(field_var_set.at(i));
+      std::string fv = field_vars.at(i);
+      assert(!fv.empty());
+      os << fv;
+      return;
+    }
+    case TypeExpr::te_Apply:
+      if (!pos_args && expr->type_applied->type_idx >= builtin_types_num) {
+        int type_idx = expr->type_applied->type_idx;
+        const CppTypeCode& cc = *cpp_type.at(type_idx);
+        assert(!cc.cpp_type_var_name.empty());
+        os << cc.cpp_type_var_name;
+        return;
+      }
+      // fall through
+    case TypeExpr::te_Ref:
+    case TypeExpr::te_CondType:
+    case TypeExpr::te_Tuple:
+      if (expr->is_constexpr > 0) {
+        os << const_type_expr_cpp_idents.at(expr->is_constexpr);
+        return;
+      } else {
+        int fake_arg = -1;
+        os << compute_type_expr_class_name(expr, fake_arg);
+        os << "{";
+        int c = 0;
+        if (fake_arg >= 0) {
+          os << fake_arg;
+          c = 1;
+        }
+        for (const TypeExpr* arg : expr->args) {
+          if (!arg->negated) {
+            os << (c++ ? ", " : "");
+            output_cpp_expr(os, arg);
+          }
+        }
+        os << '}';
+        return;
+      }
+    case TypeExpr::te_Add:
+      if (prio > 10) {
+        os << "(";
+      }
+      output_cpp_expr(os, expr->args[0], 10);
+      os << " + ";
+      output_cpp_expr(os, expr->args[1], 10);
+      if (prio > 10) {
+        os << ")";
+      }
+      return;
+    case TypeExpr::te_MulConst:
+      if (prio > 20) {
+        os << "(";
+      }
+      os << expr->value;
+      os << " * ";
+      output_cpp_expr(os, expr->args[0], 20);
+      if (prio > 20) {
+        os << ")";
+      }
+      return;
+    case TypeExpr::te_GetBit:
+      if (prio > 0) {
+        os << "(";
+      }
+      output_cpp_expr(os, expr->args[0], 5);
+      os << " & ";
+      if (expr->args[1]->tp == TypeExpr::te_IntConst && (unsigned)expr->args[1]->value <= 31) {
+        int v = expr->args[1]->value;
+        if (v > 1024) {
+          os << "0x" << std::hex << (1 << v) << std::dec;
+        } else {
+          os << (1 << v);
+        }
+      } else {
+        os << "(1 << ";
+        output_cpp_expr(os, expr->args[1], 5);
+        os << ")";
+      }
+      if (prio > 0) {
+        os << ")";
+      }
+      return;
+    case TypeExpr::te_IntConst:
+      os << expr->value;
+      return;
+  }
+  os << "<unknown-expression>";
+}
+
+bool CppTypeCode::can_compute_sizeof(const TypeExpr* expr) const {
+  if (expr->negated || expr->is_nat) {
+    return false;
+  }
+  MinMaxSize sz = expr->compute_size();
+  if (sz.is_fixed()) {
+    return !(sz.min_size() & 0xff);
+  }
+  if (expr->tp == TypeExpr::te_Apply && (expr->type_applied == Int_type || expr->type_applied == UInt_type ||
+                                         expr->type_applied == NatWidth_type || expr->type_applied == Bits_type)) {
+    return true;
+  }
+  if (expr->tp != TypeExpr::te_CondType && expr->tp != TypeExpr::te_Tuple) {
+    return false;
+  }
+  return can_compute_sizeof(expr->args[1]);
+}
+
+void CppTypeCode::output_cpp_sizeof_expr(std::ostream& os, const TypeExpr* expr, int prio) const {
+  if (expr->negated) {
+    throw src::Fatal{static_cast<std::ostringstream&&>(std::ostringstream{}
+                                                       << "cannot compute size of negated type expression `" << expr
+                                                       << "` in C++ code")
+                         .str()};
+  }
+  if (expr->is_nat) {
+    throw src::Fatal{static_cast<std::ostringstream&&>(std::ostringstream{}
+                                                       << "cannot compute size of non-type expression `" << expr
+                                                       << "` in C++ code")
+                         .str()};
+  }
+  MinMaxSize sz = expr->compute_size();
+  if (sz.is_fixed()) {
+    os << SizeWriter{(int)sz.convert_min_size()};
+    return;
+  }
+  switch (expr->tp) {
+    case TypeExpr::te_CondType:
+      if (prio > 5) {
+        os << '(';
+      }
+      output_cpp_expr(os, expr->args[0], 5);
+      os << " ? ";
+      output_cpp_sizeof_expr(os, expr->args[1], 6);
+      os << " : 0";
+      if (prio > 5) {
+        os << ')';
+      }
+      return;
+    case TypeExpr::te_Tuple:
+      if (expr->args[0]->tp == TypeExpr::te_IntConst && expr->args[0]->value == 1) {
+        output_cpp_sizeof_expr(os, expr->args[1], prio);
+        return;
+      }
+      sz = expr->args[1]->compute_size();
+      if (sz.is_fixed() && sz.convert_min_size() == 1) {
+        output_cpp_expr(os, expr->args[0], prio);
+        return;
+      }
+      if (prio > 20) {
+        os << '(';
+      }
+      output_cpp_expr(os, expr->args[0], 20);
+      os << " * ";
+      output_cpp_sizeof_expr(os, expr->args[1], 20);
+      if (prio > 20) {
+        os << ')';
+      }
+      return;
+    case TypeExpr::te_Apply:
+      if (expr->type_applied == Int_type || expr->type_applied == UInt_type || expr->type_applied == NatWidth_type ||
+          expr->type_applied == Bits_type) {
+        output_cpp_expr(os, expr->args[0], prio);
+        return;
+      }
+      // no break
+  }
+  os << "<unknown-expression>";
+}
+
+bool CppTypeCode::can_compute(const TypeExpr* expr) const {
+  if (expr->negated) {
+    return false;
+  }
+  if (expr->tp == TypeExpr::te_Param) {
+    return field_var_set.at(expr->value);
+  }
+  for (const TypeExpr* arg : expr->args) {
+    if (!can_compute(arg)) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool CppTypeCode::can_use_to_compute(const TypeExpr* expr, int i) const {
+  if (!expr->negated || !expr->is_nat) {
+    return false;
+  }
+  if (expr->tp == TypeExpr::te_Param) {
+    return expr->value == i;
+  }
+  for (const TypeExpr* arg : expr->args) {
+    if (!(arg->negated ? can_use_to_compute(arg, i) : can_compute(arg))) {
+      return false;
+    }
+  }
+  return true;
+}
+
+void CppTypeCode::add_compute_actions(const TypeExpr* expr, int i, std::string bind_to) {
+  assert(expr->negated && expr->is_nat);
+  switch (expr->tp) {
+    case TypeExpr::te_MulConst: {
+      assert(expr->args.size() == 1 && expr->value > 0);
+      const TypeExpr* x = expr->args[0];
+      assert(x->negated);
+      std::string tmp;
+      if (x->tp != TypeExpr::te_Param || (x->value != i && i >= 0)) {
+        tmp = new_tmp_var();
+      } else {
+        i = x->value;
+        tmp = field_vars.at(i);
+        assert(!tmp.empty());
+        assert(!field_var_set[i]);
+        field_var_set[i] = true;
+        x = nullptr;
+      }
+      std::ostringstream ss;
+      ss << "mul_r1(" << tmp << ", " << expr->value << ", " << bind_to << ")";
+      actions += Action{std::move(ss), true};
+      if (x) {
+        add_compute_actions(x, i, tmp);
+      }
+      return;
+    }
+    case TypeExpr::te_Add: {
+      assert(expr->args.size() == 2);
+      const TypeExpr *x = expr->args[0], *y = expr->args[1];
+      assert(x->negated ^ y->negated);
+      if (!x->negated) {
+        std::swap(x, y);
+      }
+      std::string tmp;
+      if (x->tp != TypeExpr::te_Param || (x->value != i && i >= 0)) {
+        tmp = new_tmp_var();
+      } else {
+        i = x->value;
+        tmp = field_vars.at(i);
+        assert(!tmp.empty());
+        assert(!field_var_set[i]);
+        field_var_set[i] = true;
+        x = nullptr;
+      }
+      std::ostringstream ss;
+      ss << "add_r1(" << tmp << ", ";
+      output_cpp_expr(ss, y);
+      ss << ", " << bind_to << ")";
+      actions += Action{std::move(ss), true};
+      if (x) {
+        add_compute_actions(x, i, tmp);
+      }
+      return;
+    }
+    case TypeExpr::te_Param:
+      assert(expr->value == i || i < 0);
+      i = expr->value;
+      assert(!field_vars.at(i).empty());
+      if (!field_var_set.at(i)) {
+        actions += Action{std::string{"("} + field_vars.at(i) + " = " + bind_to + ") >= 0"};
+        field_var_set[i] = true;
+      } else {
+        actions += Action{field_vars.at(i) + " == " + bind_to};
+      }
+      return;
+  }
+  throw src::Fatal{static_cast<std::ostringstream&&>(std::ostringstream{} << "cannot use expression `" << expr << "` = "
+                                                                          << bind_to << " to set field variable "
+                                                                          << (i >= 0 ? field_vars.at(i) : "<unknown>"))
+                       .str()};
+}
+
+bool CppTypeCode::is_self(const TypeExpr* expr, const Constructor& constr) const {
+  if (expr->tp != TypeExpr::te_Apply || expr->type_applied != &type || (int)expr->args.size() != tot_params) {
+    return false;
+  }
+  assert(constr.params.size() == expr->args.size());
+  for (int i = 0; i < tot_params; i++) {
+    assert(type_param_is_neg[i] == expr->args[i]->negated);
+    assert(type_param_is_neg[i] == constr.param_negated[i]);
+    if (!type_param_is_neg[i] && !expr->args[i]->equal(*constr.params[i])) {
+      return false;
+    }
+  }
+  return true;
+}
+
+void CppTypeCode::init_cons_context(const Constructor& constr) {
+  clear_context();
+  field_vars.resize(constr.fields.size());
+  field_var_set.resize(constr.fields.size(), false);
+  param_var_set.resize(params + ret_params, false);
+  param_constraint_used.resize(params + ret_params, false);
+}
+
+void CppTypeCode::identify_cons_params(const Constructor& constr, int options) {
+  int j = 0;
+  for (const TypeExpr* pexpr : constr.params) {
+    if (pexpr->tp == TypeExpr::te_Param) {
+      if (!type_param_is_neg.at(j)) {
+        int i = pexpr->value;
+        if (field_var_set.at(i)) {
+          // field i and parameter j must be equal
+          actions += Action{type_param_name.at(j) + " == " + field_vars.at(i)};
+          param_constraint_used[j] = true;
+        } else if (field_vars.at(i).empty()) {
+          // identify field i with parameter j
+          field_vars[i] = type_param_name.at(j);
+          field_var_set[i] = true;
+          param_constraint_used[j] = true;
+        }
+      } else if (!(options & 2)) {
+        tmp_vars.push_back(type_param_name.at(j));
+      }
+    }
+    j++;
+  }
+}
+
+void CppTypeCode::identify_cons_neg_params(const Constructor& constr, int options) {
+  int j = 0;
+  for (const TypeExpr* pexpr : constr.params) {
+    if (pexpr->tp == TypeExpr::te_Param && type_param_is_neg.at(j)) {
+      int i = pexpr->value;
+      if (!field_var_set.at(i) && field_vars.at(i).empty()) {
+        // identify field i with parameter j
+        field_vars[i] = type_param_name.at(j);
+        param_constraint_used[j] = true;
+      }
+    }
+    j++;
+  }
+}
+
+void CppTypeCode::add_cons_tag_check(const Constructor& constr, int cidx, int options) {
+  if (constr.tag_bits) {
+    if ((options & 1) && ((options & 8) || cons_num == 1 || !cons_tag_exact.at(cidx))) {
+      std::ostringstream ss;
+      int l = constr.tag_bits;
+      unsigned long long tag = (constr.tag >> (64 - l));
+      if (l < 64) {
+        ss << "cs.fetch_ulong(" << l << ") == " << HexConstWriter{tag};
+      } else {
+        ss << "cs.begins_with_skip(" << l << ", " << HexConstWriter{tag} << ")";
+      }
+      actions.emplace_back(std::move(ss));
+    } else {
+      actions.emplace_back(constr.tag_bits);
+    }
+  }
+}
+
+void CppTypeCode::add_cons_tag_store(const Constructor& constr, int cidx) {
+  if (constr.tag_bits) {
+    std::ostringstream ss;
+    int l = constr.tag_bits;
+    unsigned long long tag = (constr.tag >> (64 - l));
+    ss << "cb.store_long_bool(" << HexConstWriter{tag} << ", " << l << ")";
+    actions.emplace_back(std::move(ss));
+  }
+}
+
+void CppTypeCode::add_remaining_param_constraints_check(const Constructor& constr, int options) {
+  int j = 0;
+  for (const TypeExpr* pexpr : constr.params) {
+    if (!param_constraint_used.at(j)) {
+      std::ostringstream ss;
+      if (!type_param_is_neg.at(j)) {
+        ss << type_param_name.at(j) << " == ";
+        output_cpp_expr(ss, pexpr);
+        actions += Action{std::move(ss)};
+      } else if (options & 2) {
+        ss << "(" << type_param_name.at(j) << " = ";
+        output_cpp_expr(ss, pexpr);
+        ss << ") >= 0";
+        actions += Action{std::move(ss), true};
+      }
+    }
+    ++j;
+  }
+}
+
+void CppTypeCode::output_actions(std::ostream& os, std::string nl, int options) {
+  bool opbr = false;
+  if (tmp_vars.size() || needs_tmp_cell) {
+    if (!(options & 4)) {
+      opbr = true;
+      os << " {";
+    }
+    if (tmp_vars.size()) {
+      os << nl << "int";
+      int c = 0;
+      for (auto t : tmp_vars) {
+        if (c++) {
+          os << ",";
+        }
+        os << " " << t;
+      }
+      os << ";";
+    }
+    if (needs_tmp_cell) {
+      os << nl << "Ref<vm::Cell> tmp_cell;";
+    }
+  }
+  if (!actions.size()) {
+    os << nl << "return true;";
+  } else {
+    for (std::size_t i = 0; i < actions.size(); i++) {
+      os << nl << (i ? "    && " : "return ");
+      actions[i].show(os);
+    }
+    os << ";";
+  }
+  if (incomplete) {
+    os << nl << "// ???";
+  }
+  if (opbr) {
+    os << nl << "}";
+  }
+}
+
+void CppTypeCode::compute_implicit_field(const Constructor& constr, const Field& field, int options) {
+  int i = field.field_idx;
+  if (field_vars.at(i).empty()) {
+    assert(!field_var_set.at(i));
+    assert(field.type->is_nat_subtype);
+    std::string id = new_tmp_var(field.get_name());
+    field_vars[i] = id;
+  }
+  int j = -1;
+  for (const TypeExpr* pexpr : constr.params) {
+    ++j;
+    if (!param_constraint_used.at(j) && !type_param_is_neg.at(j)) {
+      // std::cerr << "can_use_to_compute(" << pexpr << ", " << i << ") = " << can_use_to_compute(pexpr, i) << std::endl;
+      if (!field_var_set.at(i) && pexpr->tp == TypeExpr::te_Param && pexpr->value == i) {
+        std::ostringstream ss;
+        if (field.type->is_nat_subtype) {
+          ss << "(" << field_vars[i] << " = " << type_param_name.at(j) << ") >= 0";
+        } else {
+          ss << "(" << field_vars[i] << " = &" << type_param_name.at(j) << ")";
+        }
+        actions += Action{std::move(ss)};
+        field_vars[i] = type_param_name[j];
+        field_var_set[i] = true;
+        param_constraint_used[j] = true;
+      } else if (can_compute(pexpr)) {
+        std::ostringstream ss;
+        ss << type_param_name.at(j) << " == ";
+        output_cpp_expr(ss, pexpr);
+        actions += Action{std::move(ss), true};
+        param_constraint_used[j] = true;
+      } else if (!field_var_set.at(i) && can_use_to_compute(pexpr, i)) {
+        add_compute_actions(pexpr, i, type_param_name.at(j));
+        param_constraint_used[j] = true;
+      }
+    }
+  }
+}
+
+bool CppTypeCode::add_constraint_check(const Constructor& constr, const Field& field, int options) {
+  const TypeExpr* expr = field.type;
+  if (expr->tp == TypeExpr::te_Apply &&
+      (expr->type_applied == Eq_type || expr->type_applied == Less_type || expr->type_applied == Leq_type)) {
+    assert(expr->args.size() == 2);
+    const TypeExpr *x = expr->args[0], *y = expr->args[1];
+    if (x->negated || y->negated) {
+      assert(expr->type_applied == Eq_type);
+      assert(x->negated ^ y->negated);
+      if (!x->negated) {
+        std::swap(x, y);
+      }
+      std::ostringstream ss;
+      output_cpp_expr(ss, y);
+      add_compute_actions(x, -1, ss.str());
+    } else {
+      std::ostringstream ss;
+      output_cpp_expr(ss, x);
+      ss << (expr->type_applied == Eq_type ? " == " : (expr->type_applied == Less_type ? " < " : " <= "));
+      output_cpp_expr(ss, y);
+      actions += Action{std::move(ss), true};
+    }
+    return true;
+  } else {
+    // ...
+    ++incomplete;
+    actions += Action{"check_constraint_incomplete"};
+    return false;
+  }
+}
+
+void CppTypeCode::output_negative_type_arguments(std::ostream& os, const TypeExpr* expr) {
+  assert(expr->tp == TypeExpr::te_Apply);
+  for (const TypeExpr* arg : expr->args) {
+    if (arg->negated) {
+      int j = arg->value;
+      if (arg->tp == TypeExpr::te_Param && !field_var_set.at(j)) {
+        assert(!field_vars.at(j).empty());
+        os << ", " << field_vars.at(j);
+        field_var_set[j] = true;
+      } else {
+        std::string tmp = new_tmp_var();
+        os << ", " << tmp;
+        postponed_equate.emplace_back(tmp, arg);
+      }
+    }
+  }
+}
+
+void CppTypeCode::add_postponed_equate_actions() {
+  for (const auto& p : postponed_equate) {
+    add_compute_actions(p.second, -1, p.first);
+  }
+  postponed_equate.clear();
+}
+
+std::string CppTypeCode::add_fetch_nat_field(const Constructor& constr, const Field& field, int options) {
+  const TypeExpr* expr = field.type;
+  int i = field.field_idx;
+  std::string id = field_vars.at(i);
+  if (id.empty()) {
+    field_vars[i] = id = new_tmp_var(field.get_name());
+  }
+  const Type* ta = expr->type_applied;
+  assert(expr->tp == TypeExpr::te_Apply &&
+         (ta == Nat_type || ta == NatWidth_type || ta == NatLeq_type || ta == NatLess_type));
+  std::ostringstream ss;
+  ss << "cs.";
+  if (ta == Nat_type) {
+    ss << "fetch_uint_to(32, " << id << ")";
+  } else if (ta == NatWidth_type && expr->args.at(0)->tp == TypeExpr::te_IntConst && expr->args[0]->value == 1) {
+    ss << "fetch_bool_to(" << id << ")";
+  } else {
+    if (ta == NatWidth_type) {
+      ss << "fetch_uint_to(";
+    } else if (ta == NatLeq_type) {
+      ss << "fetch_uint_leq(";
+    } else if (ta == NatLess_type) {
+      ss << "fetch_uint_less(";
+    }
+    output_cpp_expr(ss, expr->args[0]);
+    ss << ", " << id << ")";
+  }
+  actions += Action{std::move(ss)};
+  field_var_set[i] = true;
+  return id;
+}
+
+void CppTypeCode::add_store_nat_field(const Constructor& constr, const Field& field, int options) {
+  const TypeExpr* expr = field.type;
+  int i = field.field_idx;
+  std::string id = field_vars.at(i);
+  assert(!id.empty());
+  const Type* ta = expr->type_applied;
+  assert(expr->tp == TypeExpr::te_Apply &&
+         (ta == Nat_type || ta == NatWidth_type || ta == NatLeq_type || ta == NatLess_type));
+  std::ostringstream ss;
+  ss << "cb.";
+  if (ta == Nat_type) {
+    ss << "store_ulong_rchk_bool(" << id << ", 32)";
+  } else if (ta == NatWidth_type) {
+    if (expr->args.at(0)->tp == TypeExpr::te_IntConst && expr->args[0]->value == 1) {
+      ss << "store_ulong_rchk_bool(" << id << ", 1)";
+    } else {
+      ss << "store_ulong_rchk_bool(" << id << ", ";
+      output_cpp_expr(ss, expr->args[0]);
+      ss << ")";
+    }
+  } else if (ta == NatLeq_type) {
+    ss << "store_uint_leq(";
+    output_cpp_expr(ss, expr->args[0]);
+    ss << ", " << id << ")";
+  } else if (ta == NatLess_type) {
+    ss << "store_uint_less(";
+    output_cpp_expr(ss, expr->args[0]);
+    ss << ", " << id << ")";
+  } else {
+    ss << "<store-unknown-nat-subtype>(" << id << ")";
+  }
+  actions += Action{std::move(ss)};
+  field_var_set[i] = true;
+}
+
+void CppTypeCode::generate_skip_field(const Constructor& constr, const Field& field, int options) {
+  const TypeExpr* expr = field.type;
+  MinMaxSize sz = expr->compute_size();
+  bool any_bits = expr->compute_any_bits();
+  bool validating = (options & 1);
+  // std::cerr << "field `" << field.get_name() << "` size is " << sz << "; fixed=" << sz.is_fixed() << "; any=" << any_bits << std::endl;
+  if (field.used || (validating && expr->is_nat_subtype && !any_bits)) {
+    // an explicit field of type # or ## which is used later or its value is not arbitrary
+    // (must load the value into an integer variable and check)
+    assert(expr->is_nat_subtype && "cannot use fields of non-`#` type");
+    add_fetch_nat_field(constr, field, options);
+    return;
+  }
+  if (sz.is_fixed() && (!validating || (!(sz.min_size() & 0xff) && any_bits))) {
+    // field has fixed size, and either its bits can have arbitrary values (and it has no references)
+    // ... or we are not validating
+    // simply skip the necessary amount of bits
+    // NB: if the field is a reference, and we are not validating, we arrive here
+    actions += Action{(int)sz.convert_min_size()};
+    return;
+  }
+  if (expr->negated) {
+    // the field type has some "negative" parameters, which will be computed while checking this field
+    // must invoke the correct validate_skip or skip method for the type in question
+    std::ostringstream ss;
+    if (!is_self(expr, constr)) {
+      output_cpp_expr(ss, expr, 100, true);
+      ss << '.';
+    }
+    ss << (validating ? "validate_skip(cs, weak" : "skip(cs");
+    output_negative_type_arguments(ss, expr);
+    ss << ")";
+    actions += Action{std::move(ss)};
+    add_postponed_equate_actions();
+    return;
+  }
+  // at this point, if the field type is a reference, we must be validating
+  if (expr->tp == TypeExpr::te_Ref && expr->args[0]->tp == TypeExpr::te_Apply &&
+      (expr->args[0]->type_applied == Cell_type || expr->args[0]->type_applied == Any_type)) {
+    // field type is a reference to a cell with arbitrary contents
+    actions += Action{0x10000};
+    return;
+  }
+  // remaining case: general positive type expression
+  std::ostringstream ss;
+  std::string tail;
+  while (expr->tp == TypeExpr::te_CondType) {
+    // optimization for (chains of) conditional types ( x?type )
+    assert(expr->args.size() == 2);
+    ss << "(!";
+    output_cpp_expr(ss, expr->args[0], 30);
+    ss << " || ";
+    expr = expr->args[1];
+    tail = std::string{")"} + tail;
+  }
+  if ((!validating || any_bits) && can_compute_sizeof(expr)) {
+    // field size can be computed at run-time, and either the contents is arbitrary, or we are not validating
+    ss << "cs.advance(";
+    output_cpp_sizeof_expr(ss, expr, 0);
+    ss << ")" << tail;
+    actions += Action{std::move(ss)};
+    return;
+  }
+  if (expr->tp != TypeExpr::te_Ref) {
+    // field type is not a reference, generate a type expression and invoke skip/validate_skip method
+    if (!is_self(expr, constr)) {
+      output_cpp_expr(ss, expr, 100);
+      ss << '.';
+    }
+    ss << (validating ? "validate_skip(cs, weak)" : "skip(cs)") << tail;
+    actions += Action{std::move(ss)};
+    return;
+  }
+  // the (remaining) field type is a reference
+  if (!validating || (expr->args[0]->tp == TypeExpr::te_Apply &&
+                      (expr->args[0]->type_applied == Cell_type || expr->args[0]->type_applied == Any_type))) {
+    // the subcase when the field type is either a reference to a cell with arbitrary contents
+    // or it is a reference, and we are not validating, so we simply skip the reference
+    ss << "cs.advance_refs(1)" << tail;
+    actions += Action{std::move(ss)};
+    return;
+  }
+  // general reference type, invoke validate_skip_ref()
+  // (notice that we are necessarily validating at this point)
+  expr = expr->args[0];
+  if (!is_self(expr, constr)) {
+    output_cpp_expr(ss, expr, 100);
+    ss << '.';
+  }
+  ss << "validate_skip_ref(cs, weak)" << tail;
+  actions += Action{ss.str()};
+}
+
+void CppTypeCode::generate_skip_cons_method(std::ostream& os, std::string nl, int cidx, int options) {
+  const Constructor& constr = *(type.constructors.at(cidx));
+  init_cons_context(constr);
+  identify_cons_params(constr, options);
+  identify_cons_neg_params(constr, options);
+  add_cons_tag_check(constr, cidx, options);
+  for (const Field& field : constr.fields) {
+    if (!field.implicit) {
+      generate_skip_field(constr, field, options);
+    } else if (!field.constraint) {
+      compute_implicit_field(constr, field, options);
+    } else {
+      add_constraint_check(constr, field, options);
+    }
+  }
+  add_remaining_param_constraints_check(constr, options);
+  output_actions(os, nl, options);
+  clear_context();
+}
+
+void CppTypeCode::generate_skip_method(std::ostream& os, int options) {
+  bool validate = options & 1;
+  bool ret_ext = options & 2;
+  os << "\nbool " << cpp_type_class_name << "::" << (validate ? "validate_" : "") << "skip(vm::CellSlice& cs"
+     << (validate ? ", bool weak" : "");
+  if (ret_ext) {
+    os << skip_extra_args;
+  }
+  os << ") const {";
+  if (cons_num > 1) {
+    os << "\n  switch (get_tag(cs)) {\n";
+    for (int i = 0; i < cons_num; i++) {
+      os << "  case " << cons_enum_name[i] << ":";
+      generate_skip_cons_method(os, "\n    ", i, options & ~4);
+      os << "\n";
+    }
+    os << "  }\n  return false;\n";
+  } else if (cons_num == 1) {
+    generate_skip_cons_method(os, "\n  ", 0, options | 4);
+    os << "\n";
+  } else {
+    os << "\n  return false;\n";
+  }
+  os << "}\n";
+}
+
+void CppTypeCode::generate_cons_tag_check(std::ostream& os, std::string nl, int cidx, bool force) {
+  const Constructor& constr = *(type.constructors.at(cidx));
+  if (!constr.tag_bits) {
+    os << nl << "return " << cons_enum_name[cidx] << ";";
+  } else if (force || cons_num == 1 || !cons_tag_exact.at(cidx)) {
+    os << nl << "return ";
+    int l = constr.tag_bits;
+    unsigned long long tag = (constr.tag >> (64 - l));
+    if (l < 64 || tag != ~0ULL) {
+      os << "cs.prefetch_ulong(" << l << ") == " << HexConstWriter{tag};
+    } else {
+      os << "cs.begins_with(" << l << ", " << HexConstWriter{tag} << ")";
+    }
+    os << " ? " << cons_enum_name[cidx] << " : -1;";
+  } else {
+    os << nl << "return cs.have(" << constr.tag_bits << ") ? " << cons_enum_name[cidx] << " : -1;";
+  }
+}
+
+void CppTypeCode::generate_check_tag_method(std::ostream& os) {
+  os << "\nint " << cpp_type_class_name << "::check_tag(const vm::CellSlice& cs) const {";
+  if (cons_num > 1) {
+    os << "\n  switch (get_tag(cs)) {\n";
+    for (int i = 0; i < cons_num; i++) {
+      os << "  case " << cons_enum_name[i] << ":";
+      generate_cons_tag_check(os, "\n    ", i);
+      os << "\n";
+    }
+    os << "  }\n  return -1;\n";
+  } else if (cons_num == 1) {
+    generate_cons_tag_check(os, "\n  ", 0);
+    os << "\n";
+  } else {
+    os << "\n  return -1;\n";
+  }
+  os << "}\n";
+}
+
+bool CppTypeCode::output_print_simple_field(std::ostream& os, const Field& field, std::string field_name,
+                                            const TypeExpr* expr) {
+  cpp_val_type cvt = detect_cpp_type(expr);
+  MinMaxSize sz = expr->compute_size();
+  int i = expr->is_integer();
+  int l = (sz.is_fixed() ? sz.convert_min_size() : -1);
+  switch (cvt) {
+    case ct_bitstring:
+    case ct_bits:
+      assert(!(sz.max_size() & 0xff));
+      os << "pp.fetch_bits_field(cs, ";
+      output_cpp_sizeof_expr(os, expr, 0);
+      if (!field_name.empty()) {
+        os << ", \"" << field_name << '"';
+      }
+      os << ")";
+      return true;
+    case ct_bool:
+    case ct_int32:
+    case ct_uint32:
+    case ct_int64:
+    case ct_uint64:
+      assert(i && l <= 64);
+      os << "pp.fetch_" << (i > 0 ? "u" : "") << "int_field(cs, ";
+      output_cpp_sizeof_expr(os, expr, 0);
+      if (!field_name.empty()) {
+        os << ", \"" << field_name << '"';
+      }
+      os << ")";
+      return true;
+    case ct_integer:
+      assert(i);
+      os << "pp.fetch_" << (i > 0 ? "u" : "") << "int256_field(cs, ";
+      output_cpp_sizeof_expr(os, expr, 0);
+      if (!field_name.empty()) {
+        os << ", \"" << field_name << '"';
+      }
+      os << ")";
+      return true;
+    default:
+      break;
+  }
+  return false;
+}
+
+void CppTypeCode::generate_print_field(const Constructor& constr, const Field& field, int options) {
+  const TypeExpr* expr = field.type;
+  MinMaxSize sz = expr->compute_size();
+  cpp_val_type cvt = detect_cpp_type(expr);
+  bool any_bits = expr->compute_any_bits();
+  bool is_simple = (cvt >= ct_bits && cvt <= ct_uint64 && cvt != ct_enum);
+  // std::cerr << "field `" << field.get_name() << "` size is " << sz << "; fixed=" << sz.is_fixed() << "; any=" << any_bits << std::endl;
+  std::string field_name = field.name ? field.get_name() : "";
+  if (field.used || expr->is_nat_subtype) {
+    // an explicit field of type # or ##
+    assert(expr->is_nat_subtype && "cannot use fields of non-`#` type");
+    std::ostringstream ss;
+    ss << "pp.field_int(" << add_fetch_nat_field(constr, field, options);
+    if (field.name) {
+      ss << ", \"" << field_name << '"';
+    }
+    ss << ')';
+    actions += Action{std::move(ss)};
+    return;
+  }
+  if (sz.is_fixed() && !(sz.min_size() & 0xff) && any_bits) {
+    // field has fixed size, and either its bits can have arbitrary values (and it has no references)
+    std::ostringstream ss;
+    if (output_print_simple_field(ss, field, field_name, expr)) {
+      actions += Action{std::move(ss)};
+      return;
+    }
+  }
+  bool cond_chain = (expr->tp == TypeExpr::te_CondType);
+  if (!cond_chain && !is_simple) {
+    if (field.name) {
+      actions += Action{std::string{"pp.field(\""} + field_name + "\")"};
+    } else {
+      actions += Action{"pp.field()"};
+    }
+  }
+  if (expr->negated) {
+    // the field type has some "negative" parameters, which will be computed while checking this field
+    // must invoke the correct validate_skip or skip method for the type in question
+    assert(!cond_chain);
+    std::ostringstream ss;
+    if (!is_self(expr, constr)) {
+      output_cpp_expr(ss, expr, 100, true);
+      ss << '.';
+    }
+    ss << "print_skip(pp, cs";
+    output_negative_type_arguments(ss, expr);
+    ss << ")";
+    actions += Action{std::move(ss)};
+    add_postponed_equate_actions();
+    return;
+  }
+  // remaining case: general positive type expression
+  std::ostringstream ss;
+  std::string tail;
+  while (expr->tp == TypeExpr::te_CondType) {
+    // optimization for (chains of) conditional types ( x?type )
+    assert(expr->args.size() == 2);
+    ss << "(!";
+    output_cpp_expr(ss, expr->args[0], 30);
+    ss << " || ";
+    expr = expr->args[1];
+    tail += ')';
+  }
+  if (output_print_simple_field(ss, field, field_name, expr)) {
+    ss << tail;
+    actions += Action{std::move(ss)};
+    return;
+  }
+  if (cond_chain) {
+    if (field.name) {
+      ss << "(pp.field(\"" + field_name + "\") && ";
+    } else {
+      ss << "(pp.field() && ";
+    }
+    tail += ')';
+  }
+  if (expr->tp != TypeExpr::te_Ref) {
+    // field type is not a reference, generate a type expression and invoke skip/validate_skip method
+    if (!is_self(expr, constr)) {
+      output_cpp_expr(ss, expr, 100);
+      ss << '.';
+    }
+    ss << "print_skip(pp, cs)" << tail;
+    actions += Action{std::move(ss)};
+    return;
+  }
+  // general reference type, invoke print_ref()
+  expr = expr->args[0];
+  if (!is_self(expr, constr)) {
+    output_cpp_expr(ss, expr, 100);
+    ss << '.';
+  }
+  ss << "print_ref(pp, cs.fetch_ref())" << tail;
+  actions += Action{ss.str()};
+}
+
+void CppTypeCode::generate_print_cons_method(std::ostream& os, std::string nl, int cidx, int options) {
+  const Constructor& constr = *(type.constructors.at(cidx));
+  init_cons_context(constr);
+  identify_cons_params(constr, options);
+  identify_cons_neg_params(constr, options);
+  add_cons_tag_check(constr, cidx, options);
+  bool do_open = !constr.is_enum;
+  if (do_open) {
+    if (constr.constr_name) {
+      actions += Action{std::string{"pp.open(\""} + constr.get_name() + "\")"};
+    } else {
+      actions += Action{"pp.open()"};
+    }
+  } else {
+    actions += Action{std::string{"pp.cons(\""} + constr.get_name() + "\")"};
+  }
+  for (const Field& field : constr.fields) {
+    if (!field.implicit) {
+      generate_print_field(constr, field, options);
+    } else if (!field.constraint) {
+      compute_implicit_field(constr, field, options);
+    } else {
+      add_constraint_check(constr, field, options);
+    }
+  }
+  add_remaining_param_constraints_check(constr, options);
+  if (do_open) {
+    actions += Action{"pp.close()"};
+  }
+  output_actions(os, nl, options);
+  clear_context();
+}
+
+void CppTypeCode::generate_print_method(std::ostream& os, int options) {
+  bool ret_ext = options & 2;
+  os << "\nbool " << cpp_type_class_name << "::print_skip(PrettyPrinter& pp, vm::CellSlice& cs";
+  if (ret_ext) {
+    os << skip_extra_args;
+  }
+  os << ") const {";
+  if (cons_num > 1) {
+    os << "\n  switch (get_tag(cs)) {\n";
+    for (int i = 0; i < cons_num; i++) {
+      os << "  case " << cons_enum_name[i] << ":";
+      generate_print_cons_method(os, "\n    ", i, options & ~4);
+      os << "\n";
+    }
+    os << "  }\n  return pp.fail(\"unknown constructor for " << type.get_name() << "\");\n";
+  } else if (cons_num == 1) {
+    generate_print_cons_method(os, "\n  ", 0, options | 4);
+    os << "\n";
+  } else {
+    os << "\n  return pp.fail(\"no constructors for " << type.get_name() << "\");\n";
+  }
+  os << "}\n";
+}
+
+void CppTypeCode::bind_record_fields(const CppTypeCode::ConsRecord& rec, int options) {
+  bool direct = options & 8;
+  bool read_only = options & 32;
+  for (const ConsField& fi : rec.cpp_fields) {
+    int i = fi.orig_idx;
+    assert(field_vars.at(i).empty() && !field_var_set.at(i));
+    if (!read_only || !rec.constr.fields.at(i).implicit) {
+      field_vars[i] = direct ? fi.name : std::string{"data."} + fi.name;
+      field_var_set[i] = read_only;
+    }
+  }
+}
+
+void CppTypeCode::output_fetch_field(std::ostream& os, std::string field_var, const TypeExpr* expr, cpp_val_type cvt) {
+  int i = expr->is_integer();
+  MinMaxSize sz = expr->compute_size();
+  int l = (sz.is_fixed() ? sz.convert_min_size() : -1);
+  switch (cvt) {
+    case ct_slice:
+      os << "cs.fetch_subslice_" << (sz.max_size() & 0xff ? "ext_" : "") << "to(";
+      output_cpp_sizeof_expr(os, expr, 0);
+      os << ", " << field_var << ")";
+      return;
+    case ct_bitstring:
+      assert(!(sz.max_size() & 0xff));
+      os << "cs.fetch_bitstring_to(";
+      output_cpp_sizeof_expr(os, expr, 0);
+      os << ", " << field_var << ")";
+      return;
+    case ct_bits:
+      assert(l >= 0 && l < 0x10000);
+      os << "cs.fetch_bits_to(" << field_var << ".bits(), " << l << ")";
+      return;
+    case ct_cell:
+      assert(l == 0x10000);
+      os << "cs.fetch_ref_to(" << field_var << ")";
+      return;
+    case ct_bool:
+      assert(i > 0 && l == 1);
+      os << "cs.fetch_bool_to(" << field_var << ")";
+      return;
+    case ct_int32:
+    case ct_uint32:
+    case ct_int64:
+    case ct_uint64:
+      assert(i && l <= 64);
+      os << "cs.fetch_" << (i > 0 ? "u" : "") << "int_to(";
+      output_cpp_sizeof_expr(os, expr, 0);
+      os << ", " << field_var << ")";
+      return;
+    case ct_integer:
+      assert(i);
+      os << "cs.fetch_" << (i > 0 ? "u" : "") << "int256_to(";
+      output_cpp_sizeof_expr(os, expr, 0);
+      os << ", " << field_var << ")";
+      return;
+    default:
+      break;
+  }
+  throw src::Fatal{"cannot fetch a field of unknown scalar type"};
+}
+
+void CppTypeCode::output_fetch_subrecord(std::ostream& os, std::string field_name, const ConsRecord* subrec) {
+  assert(subrec);
+  os << subrec->cpp_type.cpp_type_var_name << ".cell_unpack(cs.fetch_ref(), " << field_name << ")";
+}
+
+void CppTypeCode::generate_unpack_field(const CppTypeCode::ConsField& fi, const Constructor& constr, const Field& field,
+                                        int options) {
+  int i = field.field_idx;
+  const TypeExpr* expr = field.type;
+  MinMaxSize sz = expr->compute_size();
+  bool any_bits = expr->compute_any_bits();
+  bool validating = (options & 1);
+  cpp_val_type cvt = fi.ctype;
+  // std::cerr << "field `" << field.get_name() << "` size is " << sz << "; fixed=" << sz.is_fixed() << "; any=" << any_bits << std::endl;
+  if (field.used || expr->is_nat_subtype) {
+    assert(expr->is_nat_subtype && "cannot use fields of non-`#` type");
+    assert(cvt == ct_int32 || cvt == ct_bool);
+    add_fetch_nat_field(constr, field, options);
+    return;
+  }
+  if (sz.is_fixed() && cvt != ct_enum && (!validating || (!(sz.min_size() & 0xff) && any_bits))) {
+    // field has fixed size, and either its bits can have arbitrary values (and it has no references)
+    // ... or we are not validating
+    // simply skip the necessary amount of bits
+    // NB: if the field is a reference, and we are not validating, we arrive here
+    if (cvt == ct_cell) {
+      assert(sz.min_size() == 1);
+    }
+    std::ostringstream ss;
+    if (cvt == ct_subrecord && field.subrec) {
+      output_fetch_subrecord(ss, field_vars.at(i), fi.subrec);
+    } else {
+      output_fetch_field(ss, field_vars.at(i), expr, cvt);
+    }
+    actions += Action{std::move(ss)};
+    field_var_set[i] = true;
+    return;
+  }
+  if (expr->negated) {
+    // the field type has some "negative" parameters, which will be computed while checking this field
+    // must invoke the correct validate_skip or skip method for the type in question
+    std::ostringstream ss;
+    assert(cvt == ct_slice);
+    if (!is_self(expr, constr)) {
+      output_cpp_expr(ss, expr, 100, true);
+      ss << '.';
+    }
+    ss << (validating ? "validate_fetch_to(cs, weak, " : "fetch_to(cs, ") << field_vars.at(i);
+    output_negative_type_arguments(ss, expr);
+    ss << ")";
+    actions += Action{std::move(ss)};
+    add_postponed_equate_actions();
+    field_var_set[i] = true;
+    return;
+  }
+  // at this point, if the field type is a reference, we must be validating
+  if (expr->tp == TypeExpr::te_Ref && expr->args[0]->tp == TypeExpr::te_Apply &&
+      (expr->args[0]->type_applied == Cell_type || expr->args[0]->type_applied == Any_type)) {
+    // field type is a reference to a cell with arbitrary contents
+    assert(cvt == ct_cell);
+    actions += Action{"cs.fetch_ref_to(" + field_vars.at(i) + ")"};
+    field_var_set[i] = true;
+    return;
+  }
+  // remaining case: general positive type expression
+  std::ostringstream ss;
+  std::string tail;
+  while (expr->tp == TypeExpr::te_CondType) {
+    // optimization for (chains of) conditional types ( x?type )
+    assert(expr->args.size() == 2);
+    ss << "(!";
+    output_cpp_expr(ss, expr->args[0], 30);
+    ss << " || ";
+    expr = expr->args[1];
+    tail = std::string{")"} + tail;
+  }
+  if ((!validating || any_bits) && can_compute_sizeof(expr) && cvt != ct_enum) {
+    // field size can be computed at run-time, and either the contents is arbitrary, or we are not validating
+    output_fetch_field(ss, field_vars.at(i), expr, cvt);
+    field_var_set[i] = true;
+    ss << tail;
+    actions += Action{std::move(ss)};
+    return;
+  }
+  if (expr->tp != TypeExpr::te_Ref) {
+    // field type is not a reference, generate a type expression and invoke skip/validate_skip method
+    assert(cvt == ct_slice || cvt == ct_enum);
+    if (!is_self(expr, constr)) {
+      output_cpp_expr(ss, expr, 100);
+      ss << '.';
+    }
+    ss << (validating ? "validate_" : "") << "fetch_" << (cvt == ct_enum ? "enum_" : "") << "to(cs, "
+       << (validating ? "weak, " : "") << field_vars.at(i) << ")" << tail;
+    field_var_set[i] = true;
+    actions += Action{std::move(ss)};
+    return;
+  }
+  // the (remaining) field type is a reference
+  if (!validating || (expr->args[0]->tp == TypeExpr::te_Apply &&
+                      (expr->args[0]->type_applied == Cell_type || expr->args[0]->type_applied == Any_type))) {
+    // the subcase when the field type is either a reference to a cell with arbitrary contents
+    // or it is a reference, and we are not validating, so we simply skip the reference
+    assert(cvt == ct_cell);
+    ss << "cs.fetch_ref_to(" << field_vars.at(i) << ")" << tail;
+    field_var_set[i] = true;
+    actions += Action{std::move(ss)};
+    return;
+  }
+  // general reference type, invoke validate_skip_ref()
+  // (notice that we are necessarily validating at this point)
+  expr = expr->args[0];
+  assert(cvt == ct_cell);
+  ss << "(cs.fetch_ref_to(" << field_vars.at(i) << ") && ";
+  if (!is_self(expr, constr)) {
+    output_cpp_expr(ss, expr, 100);
+    ss << '.';
+  }
+  ss << "validate_ref(" << field_vars.at(i) << "))" << tail;
+  actions += Action{ss.str()};
+}
+
+void CppTypeCode::generate_unpack_method(std::ostream& os, CppTypeCode::ConsRecord& rec, int options) {
+  std::ostringstream tmp;
+  if (!rec.declare_record_unpack(tmp, "", options)) {
+    return;
+  }
+  tmp.clear();
+  os << "\n";
+  bool res = rec.declare_record_unpack(os, "", options | 3072);
+  DCHECK(res);
+  if (options & 16) {
+    // cell unpack version
+    os << "\n  if (cell_ref.is_null()) { return false; }"
+       << "\n  auto cs = load_cell_slice(std::move(cell_ref));"
+       << "\n  return " << (options & 1 ? "validate_" : "") << "unpack";
+    if (!(options & 8)) {
+      os << "(cs, data";
+    } else {
+      os << "_" << cons_enum_name.at(rec.cons_idx) << "(cs";
+      for (const auto& f : rec.cpp_fields) {
+        os << ", " << f.name;
+      }
+    }
+    if (options & 2) {
+      os << skip_extra_args_pass;
+    }
+    os << ") && cs.empty_ext();\n}\n";
+    return;
+  }
+  init_cons_context(rec.constr);
+  bind_record_fields(rec, options);
+  identify_cons_params(rec.constr, options);
+  identify_cons_neg_params(rec.constr, options);
+  add_cons_tag_check(rec.constr, rec.cons_idx, 9 /* (options & 1) | 8 */);
+  auto it = rec.cpp_fields.cbegin(), end = rec.cpp_fields.cend();
+  for (const Field& field : rec.constr.fields) {
+    if (field.constraint) {
+      add_constraint_check(rec.constr, field, options);
+      continue;
+    }
+    if (!field.implicit) {
+      assert(it < end && it->orig_idx == field.field_idx);
+      generate_unpack_field(*it++, rec.constr, field, options);
+    } else {
+      if (it < end && it->orig_idx == field.field_idx) {
+        ++it;
+      }
+      compute_implicit_field(rec.constr, field, options);
+    }
+  }
+  assert(it == end);
+  add_remaining_param_constraints_check(rec.constr, options);
+  output_actions(os, "\n  ", options | 4);
+  clear_context();
+  os << "\n}\n";
+}
+
+void CppTypeCode::output_store_field(std::ostream& os, std::string field_var, const TypeExpr* expr, cpp_val_type cvt) {
+  int i = expr->is_integer();
+  MinMaxSize sz = expr->compute_size();
+  int l = (sz.is_fixed() ? sz.convert_min_size() : -1);
+  switch (cvt) {
+    case ct_slice:
+      os << "cb.append_cellslice_chk(" << field_var << ", ";
+      output_cpp_sizeof_expr(os, expr, 0);
+      os << ")";
+      return;
+    case ct_bitstring:
+      assert(!(sz.max_size() & 0xff));
+      os << "cb.append_bitstring_chk(" << field_var << ", ";
+      output_cpp_sizeof_expr(os, expr, 0);
+      os << ")";
+      return;
+    case ct_bits:
+      assert(l >= 0 && l < 0x10000);
+      os << "cb.store_bits_bool(" << field_var << ".cbits(), " << l << ")";
+      return;
+    case ct_cell:
+      assert(l == 0x10000);
+      os << "cb.store_ref_bool(" << field_var << ")";
+      return;
+    case ct_bool:
+      assert(i > 0 && l == 1);
+      // os << "cb.store_bool(" << field_var << ")";
+      // return;
+      // fall through
+    case ct_int32:
+    case ct_uint32:
+    case ct_int64:
+    case ct_uint64:
+      assert(i && l <= 64);
+      os << "cb.store_" << (i > 0 ? "u" : "") << "long_rchk_bool(" << field_var << ", ";
+      output_cpp_sizeof_expr(os, expr, 0);
+      os << ")";
+      return;
+    case ct_integer:
+      assert(i);
+      os << "cb.store_int256_bool(" << field_var << ", ";
+      output_cpp_sizeof_expr(os, expr, 0);
+      os << (i > 0 ? ", false)" : ")");
+      return;
+    default:
+      break;
+  }
+  throw src::Fatal{"cannot store a field of unknown scalar type"};
+}
+
+void CppTypeCode::add_store_subrecord(std::string field_name, const ConsRecord* subrec) {
+  assert(subrec);
+  needs_tmp_cell = true;
+  std::ostringstream ss;
+  ss << subrec->cpp_type.cpp_type_var_name << ".cell_pack(tmp_cell, " << field_name << ")";
+  actions += Action{std::move(ss)};
+  actions += Action{"cb.store_ref_bool(std::move(tmp_cell))"};
+}
+
+void CppTypeCode::generate_pack_field(const CppTypeCode::ConsField& fi, const Constructor& constr, const Field& field,
+                                      int options) {
+  int i = field.field_idx;
+  const TypeExpr* expr = field.type;
+  MinMaxSize sz = expr->compute_size();
+  bool any_bits = expr->compute_any_bits();
+  bool validating = (options & 1);
+  cpp_val_type cvt = fi.ctype;
+  // std::cerr << "field `" << field.get_name() << "` size is " << sz << "; fixed=" << sz.is_fixed() << "; any=" << any_bits << std::endl;
+  if (field.used || expr->is_nat_subtype) {
+    assert(expr->is_nat_subtype && "cannot use fields of non-`#` type");
+    assert(cvt == ct_int32 || cvt == ct_bool);
+    add_store_nat_field(constr, field, options);
+    return;
+  }
+  if (sz.is_fixed() && cvt != ct_enum && (!validating || (!(sz.min_size() & 0xff) && any_bits))) {
+    // field has fixed size, and either its bits can have arbitrary values (and it has no references)
+    // ... or we are not validating
+    // simply skip the necessary amount of bits
+    // NB: if the field is a reference, and we are not validating, we arrive here
+    if (cvt == ct_cell) {
+      assert(sz.min_size() == 1);
+    }
+    if (cvt == ct_subrecord && field.subrec) {
+      add_store_subrecord(field_vars.at(i), fi.subrec);
+    } else {
+      std::ostringstream ss;
+      output_store_field(ss, field_vars.at(i), expr, cvt);
+      actions += Action{std::move(ss)};
+    }
+    field_var_set[i] = true;
+    return;
+  }
+  if (expr->negated) {
+    // the field type has some "negative" parameters, which will be computed while checking this field
+    // must invoke the correct validate_skip or skip method for the type in question
+    std::ostringstream ss;
+    assert(cvt == ct_slice);
+    ss << "tlb::" << (validating ? "validate_" : "") << "store_from(cb, ";
+    if (!is_self(expr, constr)) {
+      output_cpp_expr(ss, expr, 5, true);
+    } else {
+      ss << "*this";
+    }
+    ss << ", " << field_vars.at(i);
+    output_negative_type_arguments(ss, expr);
+    ss << ")";
+    actions += Action{std::move(ss)};
+    add_postponed_equate_actions();
+    field_var_set[i] = true;
+    return;
+  }
+  // at this point, if the field type is a reference, we must be validating
+  if (expr->tp == TypeExpr::te_Ref && expr->args[0]->tp == TypeExpr::te_Apply &&
+      (expr->args[0]->type_applied == Cell_type || expr->args[0]->type_applied == Any_type)) {
+    // field type is a reference to a cell with arbitrary contents
+    assert(cvt == ct_cell);
+    actions += Action{"cb.store_ref_bool(" + field_vars.at(i) + ")"};
+    field_var_set[i] = true;
+    return;
+  }
+  // remaining case: general positive type expression
+  std::ostringstream ss;
+  std::string tail;
+  while (expr->tp == TypeExpr::te_CondType) {
+    // optimization for (chains of) conditional types ( x?type )
+    assert(expr->args.size() == 2);
+    ss << "(!";
+    output_cpp_expr(ss, expr->args[0], 30);
+    ss << " || ";
+    expr = expr->args[1];
+    tail = std::string{")"} + tail;
+  }
+  if ((!validating || any_bits) && can_compute_sizeof(expr) && cvt != ct_enum) {
+    // field size can be computed at run-time, and either the contents is arbitrary, or we are not validating
+    output_store_field(ss, field_vars.at(i), expr, cvt);
+    field_var_set[i] = true;
+    ss << tail;
+    actions += Action{std::move(ss)};
+    return;
+  }
+  if (expr->tp != TypeExpr::te_Ref) {
+    // field type is not a reference, generate a type expression and invoke skip/validate_skip method
+    assert(cvt == ct_slice || cvt == ct_enum);
+    if (!is_self(expr, constr)) {
+      output_cpp_expr(ss, expr, 100);
+      ss << '.';
+    }
+    ss << (validating ? "validate_" : "") << "store_" << (cvt == ct_enum ? "enum_" : "") << "from(cb, "
+       << field_vars.at(i) << ")" << tail;
+    field_var_set[i] = true;
+    actions += Action{std::move(ss)};
+    return;
+  }
+  // the (remaining) field type is a reference
+  if (!validating || (expr->args[0]->tp == TypeExpr::te_Apply &&
+                      (expr->args[0]->type_applied == Cell_type || expr->args[0]->type_applied == Any_type))) {
+    // the subcase when the field type is either a reference to a cell with arbitrary contents
+    // or it is a reference, and we are not validating, so we simply skip the reference
+    assert(cvt == ct_cell);
+    ss << "cb.store_ref_bool(" << field_vars.at(i) << ")" << tail;
+    field_var_set[i] = true;
+    actions += Action{std::move(ss)};
+    return;
+  }
+  // general reference type, invoke validate_skip_ref()
+  // (notice that we are necessarily validating at this point)
+  expr = expr->args[0];
+  assert(cvt == ct_cell);
+  ss << "(cb.store_ref_bool(" << field_vars.at(i) << ") && ";
+  if (!is_self(expr, constr)) {
+    output_cpp_expr(ss, expr, 100);
+    ss << '.';
+  }
+  ss << "validate_ref(" << field_vars.at(i) << "))" << tail;
+  actions += Action{ss.str()};
+}
+
+void CppTypeCode::generate_pack_method(std::ostream& os, CppTypeCode::ConsRecord& rec, int options) {
+  std::ostringstream tmp;
+  if (!rec.declare_record_pack(tmp, "", options)) {
+    return;
+  }
+  tmp.clear();
+  os << "\n";
+  bool res = rec.declare_record_pack(os, "", options | 3072);
+  DCHECK(res);
+  if (options & 16) {
+    // cell pack version
+    os << "\n  vm::CellBuilder cb;"
+       << "\n  return " << (options & 1 ? "validate_" : "") << "pack";
+    if (!(options & 8)) {
+      os << "(cb, data";
+    } else {
+      os << "_" << cons_enum_name.at(rec.cons_idx) << "(cb";
+      for (const auto& f : rec.cpp_fields) {
+        // skip SOME implicit fields ???
+        if (f.implicit) {
+        } else if (f.get_cvt().needs_move()) {
+          os << ", std::move(" << f.name << ")";
+        } else {
+          os << ", " << f.name;
+        }
+      }
+    }
+    if (options & 2) {
+      os << skip_extra_args_pass;
+    }
+    os << ") && std::move(cb).finalize_to(cell_ref);\n}\n";
+    return;
+  }
+  init_cons_context(rec.constr);
+  bind_record_fields(rec, options | 32);
+  identify_cons_params(rec.constr, options);
+  identify_cons_neg_params(rec.constr, options);
+  add_cons_tag_store(rec.constr, rec.cons_idx);
+  auto it = rec.cpp_fields.cbegin(), end = rec.cpp_fields.cend();
+  for (const Field& field : rec.constr.fields) {
+    if (field.constraint) {
+      add_constraint_check(rec.constr, field, options);
+      continue;
+    }
+    if (!field.implicit) {
+      assert(it < end && it->orig_idx == field.field_idx);
+      generate_pack_field(*it++, rec.constr, field, options);
+    } else {
+      if (it < end && it->orig_idx == field.field_idx) {
+        ++it;
+      }
+      compute_implicit_field(rec.constr, field, options);
+    }
+  }
+  assert(it == end);
+  add_remaining_param_constraints_check(rec.constr, options);
+  output_actions(os, "\n  ", options | 4);
+  clear_context();
+  os << "\n}\n";
+}
+
+void CppTypeCode::generate_ext_fetch_to(std::ostream& os, int options) {
+  std::string validate = (options & 1) ? "validate_" : "";
+  os << "\nbool " << cpp_type_class_name << "::" << validate << "fetch_to(vm::CellSlice& cs, Ref<vm::CellSlice>& res"
+     << skip_extra_args << ") const {\n"
+     << "  res = Ref<vm::CellSlice>{true, cs};\n"
+     << "  return " << validate << "skip(cs" << skip_extra_args_pass << ") && res.unique_write().cut_tail(cs);\n"
+     << "}\n";
+}
+
+void CppTypeCode::ConsRecord::declare_record(std::ostream& os, std::string nl, int options) {
+  bool force = options & 1024;
+  if (declared) {
+    return;
+  }
+  if (!force) {
+    os << nl << "struct " << cpp_name;
+    if (!inline_record) {
+      os << ";\n";
+      return;
+    }
+  } else {
+    os << "\n" << nl << "struct " << cpp_type.cpp_type_class_name << "::" << cpp_name;
+  }
+  os << " {\n";
+  os << nl << "  typedef " << cpp_type.cpp_type_class_name << " type_class;\n";
+  CppIdentSet rec_cpp_ids;
+  recover_idents(rec_cpp_ids);
+  std::size_t n = cpp_fields.size();
+  for (const ConsField& fi : cpp_fields) {
+    os << nl << "  ";
+    fi.print_type(os);
+    os << " " << fi.name << ";  \t// ";
+    if (fi.field.name) {
+      os << fi.field.get_name() << " : ";
+    }
+    fi.field.type->show(os, &constr);
+    os << std::endl;
+  }
+  if (n) {
+    os << nl << "  " << cpp_name << "() = default;\n";
+    std::vector<std::string> ctor_args;
+    os << nl << "  " << cpp_name << "(";
+    int i = 0, j = 0;
+    for (const ConsField& fi : cpp_fields) {
+      if (!fi.implicit) {
+        std::string arg = rec_cpp_ids.new_ident(std::string{"_"} + fi.name);
+        ctor_args.push_back(arg);
+        if (i++) {
+          os << ", ";
+        }
+        fi.print_type(os, true);
+        os << " " << arg;
+      }
+    }
+    os << ") : ";
+    i = 0;
+    for (const ConsField& fi : cpp_fields) {
+      if (i++) {
+        os << ", ";
+      }
+      os << fi.name << "(";
+      if (fi.implicit) {
+        os << (fi.ctype == ct_int32 ? "-1" : "nullptr");
+      } else if (fi.get_cvt().needs_move()) {
+        os << "std::move(" << ctor_args.at(j++) << ")";
+      } else {
+        os << ctor_args.at(j++);
+      }
+      os << ")";
+    }
+    os << " {}\n";
+  }
+  os << nl << "};\n";
+  declared = true;
+}
+
+bool CppTypeCode::ConsRecord::declare_record_unpack(std::ostream& os, std::string nl, int options) {
+  bool is_ok = false;
+  bool cell = options & 16;
+  std::string slice_arg = cell ? "Ref<vm::Cell> cell_ref" : "vm::CellSlice& cs";
+  std::string fun_name = (options & 1) ? "validate_unpack" : "unpack";
+  if (cell) {
+    fun_name = std::string{"cell_"} + fun_name;
+  }
+  std::string class_name;
+  if (options & 2048) {
+    class_name = cpp_type.cpp_type_class_name + "::";
+  }
+  if (!(options & 8)) {
+    os << nl << "bool " << class_name << fun_name << "(" << slice_arg << ", " << class_name << cpp_name << "& data";
+    is_ok = true;
+  } else if (is_small) {
+    os << nl << "bool " << class_name << fun_name << "_" << cpp_type.cons_enum_name.at(cons_idx) << "(" << slice_arg;
+    for (const auto& f : cpp_fields) {
+      os << ", " << f.get_cvt() << "& " << f.name;
+    }
+    is_ok = true;
+  }
+  if (is_ok) {
+    if (options & 2) {
+      os << cpp_type.skip_extra_args;
+    }
+    os << ") const" << (options & 1024 ? " {" : ";\n");
+  }
+  return is_ok;
+}
+
+bool CppTypeCode::ConsRecord::declare_record_pack(std::ostream& os, std::string nl, int options) {
+  bool is_ok = false;
+  bool cell = options & 16;
+  std::string builder_arg = cell ? "Ref<vm::Cell>& cell_ref" : "vm::CellBuilder& cb";
+  std::string fun_name = (options & 1) ? "validate_pack" : "pack";
+  if (cell) {
+    fun_name = std::string{"cell_"} + fun_name;
+  }
+  std::string class_name;
+  if (options & 2048) {
+    class_name = cpp_type.cpp_type_class_name + "::";
+  }
+  if (!(options & 8)) {
+    os << nl << "bool " << class_name << fun_name << "(" << builder_arg << ", const " << class_name << cpp_name
+       << "& data";
+    is_ok = true;
+  } else if (is_small) {
+    os << nl << "bool " << class_name << fun_name << "_" << cpp_type.cons_enum_name.at(cons_idx) << "(" << builder_arg;
+    for (const auto& f : cpp_fields) {
+      // skip SOME implicit fields ???
+      if (!f.implicit) {
+        os << ", " << f.get_cvt() << " " << f.name;
+      }
+    }
+    is_ok = true;
+  }
+  if (is_ok) {
+    if (options & 2) {
+      os << cpp_type.skip_extra_args;
+    }
+    os << ") const" << (options & 1024 ? " {" : ";\n");
+  }
+  return is_ok;
+}
+
+void CppTypeCode::generate_fetch_enum_method(std::ostream& os, int options) {
+  int minl = type.size.convert_min_size(), maxl = type.size.convert_max_size();
+  bool exact = type.cons_all_exact();
+  std::string ctag = incremental_cons_tags ? "(unsigned)t" : "cons_tag[t]";
+  os << "\nbool " << cpp_type_class_name << "::fetch_enum_to(vm::CellSlice& cs, char& value) const {\n";
+  if (!cons_num) {
+    os << "  value = -1;\n"
+          "  return false;\n";
+  } else if (!maxl) {
+    os << "  value = 0;\n"
+          "  return true;\n";
+  } else if (cons_num == 1) {
+    const Constructor& constr = *type.constructors.at(0);
+    os << "  value = (cs.fetch_ulong(" << minl << ") == " << HexConstWriter{constr.tag >> (64 - constr.tag_bits)}
+       << ") ? 0 : -1;\n";
+    os << "  return !value;\n";
+  } else if (minl == maxl) {
+    if (exact) {
+      os << "  value = (char)cs.fetch_ulong(" << minl << ");\n";
+      os << "  return value >= 0;\n";
+    } else {
+      os << "  int t = get_tag(cs);\n";
+      os << "  value = (char)t;\n";
+      os << "  return t >= 0 && cs.fetch_ulong(" << minl << ") == " << ctag << ";\n";
+    }
+  } else if (exact) {
+    os << "  int t = get_tag(cs);\n";
+    os << "  value = (char)t;\n";
+    os << "  return t >= 0 && cs.advance(cons_len[t]);\n";
+  } else {
+    os << "  int t = get_tag(cs);\n";
+    os << "  value = (char)t;\n";
+    os << "  return t >= 0 && cs.fetch_ulong(cons_len[t]) == " << ctag << ";\n";
+  }
+  os << "}\n";
+}
+
+void CppTypeCode::generate_store_enum_method(std::ostream& os, int options) {
+  int minl = type.size.convert_min_size(), maxl = type.size.convert_max_size();
+  bool exact = type.cons_all_exact();
+  std::string ctag = incremental_cons_tags ? "value" : "cons_tag[value]";
+  os << "\nbool " << cpp_type_class_name << "::store_enum_from(vm::CellBuilder& cb, int value) const {\n";
+  if (!cons_num) {
+    os << "  return false;\n";
+  } else if (!maxl) {
+    os << "  return !value;\n";
+  } else if (cons_num == 1) {
+    const Constructor& constr = *type.constructors.at(0);
+    os << "  return !value && cb.store_long_bool(" << HexConstWriter{constr.tag >> (64 - constr.tag_bits)} << ", "
+       << minl << ");\n";
+  } else if (minl == maxl) {
+    if (exact) {
+      os << "  return cb.store_long_rchk_bool(value, " << minl << ");\n";
+    } else if (incremental_cons_tags && cons_num > (1 << (minl - 1))) {
+      os << "  return cb.store_uint_less(" << cons_num << ", value);\n";
+    } else {
+      os << "  return (unsigned)value < " << cons_num << " && cb.store_long_bool(" << ctag << ", " << minl << ");\n";
+    }
+  } else {
+    os << "  return (unsigned)value < " << cons_num << " && cb.store_long_bool(" << ctag << ", cons_len[value]);\n";
+  }
+  os << "}\n";
+}
+
+void CppTypeCode::generate_print_type_body(std::ostream& os, std::string nl) {
+  std::string name = type.type_name ? type.get_name() : cpp_type_class_name;
+  if (!tot_params) {
+    os << nl << "return os << \"" << name << "\";";
+    return;
+  }
+  os << nl << "return os << \"(" << name;
+  for (int i = 0; i < tot_params; i++) {
+    if (type_param_is_neg[i]) {
+      os << " ~" << type_param_name[i];
+    } else {
+      os << " \" << " << type_param_name[i] << " << \"";
+    }
+  }
+  os << ")\";";
+}
+
+void CppTypeCode::generate_header(std::ostream& os, int options) {
+  os << "\nstruct " << cpp_type_class_name << " final : TLB_Complex {\n";
+  generate_cons_enum(os);
+  generate_cons_tag_info(os, "  ", 1);
+  if (params) {
+    generate_type_fields(os, options);
+    generate_type_constructor(os, options);
+  }
+  for (int i = 0; i < cons_num; i++) {
+    records.at(i).declare_record(os, "  ", options);
+  }
+  if (type.is_special) {
+    os << "  bool always_special() const override {\n";
+    os << "    return true;\n  }\n";
+  }
+  int sz = type.size.min_size();
+  sz = ((sz & 0xff) << 16) | (sz >> 8);
+  if (simple_get_size) {
+    os << "  int get_size(const vm::CellSlice& cs) const override {\n";
+    os << "    return " << SizeWriter{sz} << ";\n  }\n";
+  }
+  os << "  bool skip(vm::CellSlice& cs) const override";
+  if (!inline_skip) {
+    os << ";\n";
+  } else if (sz) {
+    os << " {\n    return cs.advance" << (sz < 0x10000 ? "(" : "_ext(") << SizeWriter{sz} << ");\n  }\n";
+  } else {
+    os << " {\n    return true;\n  }\n";
+  }
+  if (ret_params) {
+    os << "  bool skip(vm::CellSlice& cs" << skip_extra_args << ") const;\n";
+  }
+  os << "  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override";
+  if (!inline_validate_skip) {
+    os << ";\n";
+  } else if (sz) {
+    os << " {\n    return cs.advance(" << SizeWriter{sz} << ");\n  }\n";
+  } else {
+    os << " {\n    return true;\n  }\n";
+  }
+  if (ret_params) {
+    os << "  bool validate_skip(vm::CellSlice& cs, bool weak" << skip_extra_args << ") const;\n";
+    os << "  bool fetch_to(vm::CellSlice& cs, Ref<vm::CellSlice>& res" << skip_extra_args << ") const;\n";
+  }
+  if (type.is_simple_enum) {
+    os << "  bool fetch_enum_to(vm::CellSlice& cs, char& value) const;\n";
+    os << "  bool store_enum_from(vm::CellBuilder& cb, int value) const;\n";
+  }
+  for (int i = 0; i < cons_num; i++) {
+    records[i].declare_record_unpack(os, "  ", 2);
+    records[i].declare_record_unpack(os, "  ", 10);
+    records[i].declare_record_unpack(os, "  ", 18);
+    records[i].declare_record_unpack(os, "  ", 26);
+    records[i].declare_record_pack(os, "  ", 2);
+    records[i].declare_record_pack(os, "  ", 10);
+    records[i].declare_record_pack(os, "  ", 18);
+    records[i].declare_record_pack(os, "  ", 26);
+  }
+  os << "  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;\n";
+  if (ret_params) {
+    os << "  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs" << skip_extra_args << ") const;\n";
+  }
+  os << "  std::ostream& print_type(std::ostream& os) const override {";
+  generate_print_type_body(os, "\n    ");
+  os << "\n  }\n";
+  os << "  int check_tag(const vm::CellSlice& cs) const override;\n";
+  os << "  int get_tag(const vm::CellSlice& cs) const override";
+  if (inline_get_tag) {
+    os << " {";
+    generate_get_tag_body(os, "\n    ");
+    os << "\n  }\n";
+  } else {
+    os << ";\n";
+  }
+  os << "};\n";
+  for (int i = 0; i < cons_num; i++) {
+    records.at(i).declare_record(os, "", options | 1024);
+  }
+  if (!cpp_type_var_name.empty()) {
+    os << "\nextern const " << cpp_type_class_name << " " << cpp_type_var_name << ";\n";
+  }
+}
+
+void CppTypeCode::generate_body(std::ostream& os, int options) {
+  generate_cons_tag_info(os, "", 2);
+  if (!inline_get_tag) {
+    os << "\nint " << cpp_type_class_name << "::get_tag(const vm::CellSlice& cs) const {";
+    generate_get_tag_body(os, "\n  ");
+    os << "\n}\n";
+  }
+  generate_check_tag_method(os);
+  options &= -4;
+  if (!inline_skip) {
+    generate_skip_method(os, options);
+  }
+  if (ret_params) {
+    generate_skip_method(os, options + 2);
+  }
+  if (!inline_validate_skip) {
+    generate_skip_method(os, options + 1);
+  }
+  if (ret_params) {
+    generate_skip_method(os, options + 3);
+    generate_ext_fetch_to(os, options);
+  }
+  if (type.is_simple_enum) {
+    generate_fetch_enum_method(os, options);
+    generate_store_enum_method(os, options);
+  }
+  for (int i = 0; i < cons_num; i++) {
+    ConsRecord& rec = records.at(i);
+    generate_unpack_method(os, rec, 2);
+    generate_unpack_method(os, rec, 10);
+    generate_unpack_method(os, rec, 18);
+    generate_unpack_method(os, rec, 26);
+  }
+  for (int i = 0; i < cons_num; i++) {
+    ConsRecord& rec = records.at(i);
+    generate_pack_method(os, rec, 2);
+    generate_pack_method(os, rec, 10);
+    generate_pack_method(os, rec, 18);
+    generate_pack_method(os, rec, 26);
+  }
+  generate_print_method(os, options + 1);
+  if (ret_params) {
+    generate_print_method(os, options + 3);
+  }
+  if (!cpp_type_var_name.empty()) {
+    os << "\nconst " << cpp_type_class_name << " " << cpp_type_var_name << ";";
+  }
+  os << std::endl;
+}
+
+void CppTypeCode::generate(std::ostream& os, int options) {
+  std::string type_name = type.get_name();
+  if (!type.type_name && type.is_auto) {
+    type_name = cpp_type_class_name;
+  }
+  if (options & 1) {
+    os << "\n//\n// headers for " << (type.is_auto ? "auxiliary " : "") << "type `" << type_name << "`\n//\n";
+    generate_header(os, options);
+  } else if (options & 2) {
+    std::ostringstream tmp;
+    generate_header(tmp, options | 1);
+  }
+  if (options & 2) {
+    os << "\n//\n// code for " << (type.is_auto ? "auxiliary " : "") << "type `" << type_name << "`\n//\n";
+    generate_body(os, options);
+  }
+}
+
+void generate_type_constant(std::ostream& os, int i, TypeExpr* expr, std::string cpp_name, int mode) {
+  if (!mode) {
+    os << "// " << expr << std::endl;
+    os << "extern ";
+  }
+  std::string cls_name = "TLB";
+  int fake_arg = -1;
+  cls_name = compute_type_expr_class_name(expr, fake_arg);
+  os << "const " << cls_name << ' ' << cpp_name;
+  if (!mode) {
+    os << ";\n";
+    return;
+  }
+  int c = 0;
+  if (fake_arg >= 0) {
+    os << '{' << fake_arg;
+    c++;
+  }
+  for (const TypeExpr* arg : expr->args) {
+    if (!arg->negated) {
+      assert(arg->is_constexpr);
+      os << (c++ ? ", " : "{");
+      if (arg->is_nat) {
+        os << arg->value;
+      } else {
+        os << const_type_expr_cpp_idents.at(arg->is_constexpr);
+      }
+    }
+  }
+  if (c) {
+    os << '}';
+  }
+  os << ";\n";
+}
+
+void generate_type_constants(std::ostream& os, int mode) {
+  os << "\n// " << (mode ? "definitions" : "declarations") << " of constant types used\n\n";
+  for (int i = 1; i <= const_type_expr_num; i++) {
+    TypeExpr* expr = const_type_expr[i];
+    if (!expr->is_nat && !const_type_expr_simple[i]) {
+      generate_type_constant(os, i, expr, const_type_expr_cpp_idents[i], mode);
+    }
+  }
+}
+
+void assign_const_type_cpp_idents() {
+  const_type_expr_cpp_idents.resize(const_type_expr_num + 1, "");
+  const_type_expr_simple.resize(const_type_expr_num + 1, false);
+  for (int i = 1; i <= const_type_expr_num; i++) {
+    const TypeExpr* expr = const_type_expr[i];
+    if (!expr->is_nat) {
+      if (expr->tp == TypeExpr::te_Ref && expr->args[0]->tp == TypeExpr::te_Apply &&
+          (expr->args[0]->type_applied == Any_type || expr->args[0]->type_applied == Cell_type)) {
+        const_type_expr_cpp_idents[i] = "t_RefCell";
+        const_type_expr_simple[i] = true;
+        continue;
+      }
+      if (expr->tp == TypeExpr::te_Apply) {
+        const Type* typ = expr->type_applied;
+        int idx = typ->type_idx;
+        if (typ == Any_type || typ == Cell_type || typ == Nat_type) {
+          const_type_expr_cpp_idents[i] = (typ == Nat_type ? "t_Nat" : "t_Anything");
+          const_type_expr_simple[i] = true;
+          continue;
+        }
+        if (idx >= builtin_types_num && idx < types_num && !cpp_type[idx]->params) {
+          const_type_expr_cpp_idents[i] = cpp_type[idx]->cpp_type_var_name;
+          const_type_expr_simple[i] = true;
+          continue;
+        }
+      }
+      std::ostringstream ss;
+      ss << "t";
+      expr->const_type_name(ss);
+      const_type_expr_cpp_idents[i] = global_cpp_ids.new_ident(ss.str());
+    }
+  }
+}
+
+std::string cpp_namespace = "tlb";
+std::vector<std::string> cpp_namespace_list;
+std::string tlb_library_header_name = "tl/tlblib.hpp";
+
+void split_namespace_id() {
+  auto prev_it = cpp_namespace.cbegin();
+  for (auto it = cpp_namespace.cbegin(); it != cpp_namespace.cend(); ++it) {
+    if (it[0] == ':' && it + 2 != cpp_namespace.cend() && it[1] == ':') {
+      if (prev_it != it) {
+        cpp_namespace_list.emplace_back(prev_it, it);
+      }
+      ++it;
+      prev_it = it + 1;
+    }
+  }
+  if (prev_it != cpp_namespace.cend()) {
+    cpp_namespace_list.emplace_back(prev_it, cpp_namespace.cend());
+  }
+}
+
+std::vector<int> type_gen_order;
+
+void prepare_generate_cpp(int options = 0) {
+  std::vector<std::pair<int, int>> pairs;
+  pairs.reserve(types_num - builtin_types_num);
+  for (int i = builtin_types_num; i < types_num; i++) {
+    pairs.emplace_back(types.at(i).last_declared, i);
+  }
+  std::sort(pairs.begin(), pairs.end());
+  type_gen_order.reserve(pairs.size());
+  for (auto z : pairs) {
+    type_gen_order.push_back(z.second);
+  }
+  cpp_type.resize(types_num);
+  for (int i : type_gen_order) {
+    Type& type = types[i];
+    cpp_type[i] = std::make_unique<CppTypeCode>(type);
+    CppTypeCode& cc = *cpp_type[i];
+    if (!cpp_type[i] || !cc.is_ok()) {
+      throw src::Fatal{std::string{"cannot generate c++ code for type `"} + type.get_name() + "`"};
+    }
+  }
+  split_namespace_id();
+  assign_const_type_cpp_idents();
+}
+
+bool generate_prepared;
+bool gen_cpp;
+bool gen_hpp;
+bool append_suffix;
+
+void generate_cpp_output_to(std::ostream& os, int options = 0, std::vector<std::string> include_files = {}) {
+  if (!generate_prepared) {
+    prepare_generate_cpp(options);
+    generate_prepared = true;
+  }
+  if (options & 1) {
+    os << "#pragma once\n";
+  }
+  for (auto s : include_files) {
+    if (s.size() >= 10 && s.substr(s.size() - 10) == "tlblib.hpp") {
+      os << "#include <" << s << ">\n";
+    } else {
+      os << "#include \"" << s << "\"\n";
+    }
+  }
+  os << "/*\n *\n *  AUTO-GENERATED FROM";
+  for (auto s : source_list) {
+    if (s.empty()) {
+      os << " stdin";
+    } else {
+      os << " `" << s << "`";
+    }
+  }
+  os << "\n *\n */\n";
+  for (int i = 0; i < builtin_types_num; i++) {
+    Type& type = types[i];
+    if (type.used) {
+      os << "// uses built-in type `" << type.get_name() << "`\n";
+    }
+  }
+  for (auto cpp_nsp : cpp_namespace_list) {
+    os << "\nnamespace " << cpp_nsp << " {" << std::endl;
+  };
+  if (cpp_namespace != "tlb") {
+    os << "using namespace ::tlb;\n";
+  }
+  os << "using td::Ref;\n"
+     << "using vm::CellSlice;\n"
+     << "using vm::Cell;\n"
+     << "using td::RefInt256;\n";
+  for (int pass = 1; pass <= 2; pass++) {
+    if (options & pass) {
+      for (int i : type_gen_order) {
+        CppTypeCode& cc = *cpp_type[i];
+        cc.generate(os, (options & -4) | pass);
+      }
+      generate_type_constants(os, pass - 1);
+    }
+  }
+  for (auto it = cpp_namespace_list.rbegin(); it != cpp_namespace_list.rend(); ++it) {
+    os << "\n} // namespace " << *it << std::endl;
+  }
+}
+
+void generate_cpp_output_to(std::string filename, int options = 0, std::vector<std::string> include_files = {}) {
+  std::stringstream ss;
+  generate_cpp_output_to(ss, options, std::move(include_files));
+  auto new_content = ss.str();
+  auto r_old_content = td::read_file_str(filename);
+  if (r_old_content.is_ok() && r_old_content.ok() == new_content) {
+    return;
+  }
+  std::ofstream os{filename};
+  if (!os) {
+    throw src::Fatal{std::string{"cannot create output file `"} + filename + "`"};
+  }
+  os << new_content;
+}
+
+void generate_cpp_output(std::string filename = "", int options = 0) {
+  if (!gen_cpp && !gen_hpp) {
+    gen_cpp = gen_hpp = true;
+  }
+  options &= ~3;
+  options |= (gen_hpp ? 1 : 0) | (gen_cpp << 1);
+  if (filename.empty()) {
+    generate_cpp_output_to(std::cout, options, {tlb_library_header_name});
+  } else if (!append_suffix) {
+    generate_cpp_output_to(filename, options, {tlb_library_header_name});
+  } else {
+    if (gen_hpp) {
+      generate_cpp_output_to(filename + ".h", options & ~2, {tlb_library_header_name});
+    }
+    if (gen_cpp) {
+      generate_cpp_output_to(filename + ".cpp", options & ~1, {filename + ".h"});
+    }
+  }
+}
+
+}  // namespace tlbc
diff --git a/submodules/ton/tonlib-src/crypto/tl/tlbc-gen-cpp.h b/submodules/ton/tonlib-src/crypto/tl/tlbc-gen-cpp.h
new file mode 100644
index 0000000000..c84d825dd7
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/tl/tlbc-gen-cpp.h
@@ -0,0 +1,290 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace tlbc {
+
+extern std::set<std::string> forbidden_cpp_idents, local_forbidden_cpp_idents;
+
+struct CppIdentSet {
+  std::set<std::string> cpp_idents;
+  const std::set<std::string>* extra_forbidden_idents;
+  CppIdentSet(const std::set<std::string>* forbid = nullptr) : extra_forbidden_idents(forbid) {
+  }
+  static std::string compute_cpp_ident(std::string orig_ident, int count = 0);
+  std::string new_ident(std::string orig_ident, int count = 0, std::string suffix = "");
+  bool insert(std::string ident) {
+    return cpp_idents.insert(ident).second;
+  }
+  bool defined(std::string ident) {
+    return cpp_idents.count(ident);
+  }
+  bool is_good_ident(std::string ident);
+  void clear() {
+    cpp_idents.clear();
+  }
+};
+
+extern CppIdentSet global_cpp_ids;
+
+struct Action {
+  int fixed_size;
+  bool is_pure;
+  bool is_constraint;
+  std::string action;
+  Action(int _size) : fixed_size(_size), is_pure(false), is_constraint(false) {
+  }
+  Action(std::string _action, bool _cst = false)
+      : fixed_size(-1), is_pure(false), is_constraint(_cst), action(_action) {
+  }
+  Action(const std::ostringstream& ss, bool _cst = false)
+      : fixed_size(-1), is_pure(false), is_constraint(_cst), action(ss.str()) {
+  }
+  Action(std::ostringstream&& ss, bool _cst = false)
+      : fixed_size(-1), is_pure(false), is_constraint(_cst), action(std::move(ss).str()) {
+  }
+  void show(std::ostream& os) const;
+  bool may_combine(const Action& next) const;
+  bool operator+=(const Action& next);
+};
+
+enum cpp_val_type {
+  ct_unknown,
+  ct_void = 1,
+  ct_slice = 2,
+  ct_cell = 3,
+  ct_typeref = 4,
+  ct_typeptr = 5,
+  ct_bits = 6,
+  ct_bitstring = 7,
+  ct_integer = 8,
+  ct_bool = 10,
+  ct_enum = 11,
+  ct_int32 = 12,
+  ct_uint32 = 13,
+  ct_int64 = 14,
+  ct_uint64 = 15,
+  ct_subrecord = 16
+};
+
+struct CppValType {
+  cpp_val_type vt;
+  int size;
+  CppValType(cpp_val_type _vt = ct_unknown, int _size = -1) : vt(_vt), size(_size) {
+  }
+  cpp_val_type get() const {
+    return vt;
+  }
+  void show(std::ostream& os, bool pass_value = false) const;
+  bool needs_move() const;
+};
+
+extern std::ostream& operator<<(std::ostream& os, CppValType cvt);
+
+class CppTypeCode {
+  Type& type;
+  bool ok;
+  bool builtin;
+  bool inline_get_tag;
+  bool inline_skip;
+  bool inline_validate_skip;
+  bool simple_get_size;
+  bool simple_cons_tags;
+  bool incremental_cons_tags;
+
+ public:
+  int params;
+  int tot_params;
+  int ret_params;
+  int cons_num;
+  int common_cons_len;
+  std::vector<std::string> cons_enum_name;
+  std::vector<int> cons_enum_value;
+  std::vector<int> cons_tag_map;
+  std::vector<bool> cons_tag_exact;
+  std::vector<int> cons_idx_by_enum;
+  std::string cpp_type_var_name;
+  std::string cpp_type_class_name;
+  std::string cpp_type_template_name;
+
+  struct ConsRecord;
+
+  struct ConsField {
+    const Field& field;
+    const ConsRecord* subrec;
+    std::string name;
+    cpp_val_type ctype;
+    int size;
+    int orig_idx;
+    bool implicit;
+    ConsField(const Field& _field, std::string _name, cpp_val_type _ctype, int _size, int _idx,
+              const ConsRecord* _subrec = nullptr, bool _implicit = false)
+        : field(_field), subrec(_subrec), name(_name), ctype(_ctype), size(_size), orig_idx(_idx), implicit(_implicit) {
+      assert(ctype != ct_subrecord || subrec);
+    }
+    CppValType get_cvt() const {
+      return {ctype, size};
+    }
+    void print_type(std::ostream& os, bool pass_value = false) const;
+  };
+
+  struct ConsRecord {
+    const CppTypeCode& cpp_type;
+    const Constructor& constr;
+    int cons_idx;
+    bool is_trivial;
+    bool is_small;
+    bool triv_conflict;
+    bool has_trivial_name;
+    bool inline_record;
+    bool declared;
+    cpp_val_type equiv_cpp_type;
+    std::vector<cpp_val_type> equiv_cpp_types;
+    std::string cpp_name;
+    std::vector<ConsField> cpp_fields;
+    ConsRecord(const CppTypeCode& _cpp_type, const Constructor& _constr, int idx, bool _triv = false)
+        : cpp_type(_cpp_type), constr(_constr), cons_idx(idx), is_trivial(_triv), declared(false) {
+    }
+    bool recover_idents(CppIdentSet& idents) const;
+    void declare_record(std::ostream& os, std::string nl, int options);
+    bool declare_record_unpack(std::ostream& os, std::string nl, int options);
+    bool declare_record_pack(std::ostream& os, std::string nl, int options);
+    void print_full_name(std::ostream& os) const;
+  };
+  std::vector<ConsRecord> records;
+
+ private:
+  std::vector<std::string> type_param_name;
+  std::vector<bool> type_param_is_nat;
+  std::vector<bool> type_param_is_neg;
+  std::string template_args;
+  std::string constructor_args;
+  std::string skip_extra_args;
+  std::string skip_extra_args_pass;
+  CppIdentSet local_cpp_ids;
+  bool init();
+
+ public:
+  CppTypeCode(Type& _type) : type(_type), local_cpp_ids(&local_forbidden_cpp_idents) {
+    ok = init();
+  }
+  bool is_ok() const {
+    return ok;
+  }
+  void generate(std::ostream& os, int options = 0);
+
+ private:
+  bool compute_simple_cons_tags();
+  bool check_incremental_cons_tags() const;
+  unsigned long long compute_selector_mask() const;
+  void assign_class_name();
+  void assign_cons_names();
+  void assign_class_field_names();
+  void assign_cons_values();
+  void assign_record_cons_names();
+  void generate_cons_enum(std::ostream& os);
+  void generate_type_constructor(std::ostream& os, int options);
+  void generate_type_fields(std::ostream& os, int options);
+  void generate_header(std::ostream& os, int options = 0);
+  void generate_body(std::ostream& os, int options = 0);
+  void generate_cons_len_array(std::ostream& os, std::string nl, int options = 0);
+  void generate_cons_tag_array(std::ostream& os, std::string nl, int options = 0);
+  void generate_cons_tag_info(std::ostream& os, std::string nl, int options = 0);
+  void generate_skip_method(std::ostream& os, int options = 0);
+  void generate_skip_cons_method(std::ostream& os, std::string nl, int cidx, int options);
+  void generate_cons_tag_check(std::ostream& os, std::string nl, int cidx, bool force = false);
+  void generate_check_tag_method(std::ostream& os);
+  void generate_unpack_method(std::ostream& os, ConsRecord& rec, int options);
+  void generate_pack_method(std::ostream& os, ConsRecord& rec, int options);
+  void generate_ext_fetch_to(std::ostream& os, int options);
+  void generate_fetch_enum_method(std::ostream& os, int options);
+  void generate_store_enum_method(std::ostream& os, int options);
+  void generate_print_type_body(std::ostream& os, std::string nl);
+  void generate_print_method(std::ostream& os, int options = 0);
+  void generate_print_cons_method(std::ostream& os, std::string nl, int cidx, int options);
+  void generate_get_tag_body(std::ostream& os, std::string nl);
+  void generate_get_tag_subcase(std::ostream& os, std::string nl, const BinTrie* trie, int depth) const;
+  void generate_get_tag_param(std::ostream& os, std::string nl, unsigned long long tag,
+                              unsigned long long params = std::numeric_limits<td::uint64>::max()) const;
+  void generate_get_tag_param1(std::ostream& os, std::string nl, const char A[4],
+                               const std::string param_names[1]) const;
+  void generate_get_tag_param2(std::ostream& os, std::string nl, const char A[4][4],
+                               const std::string param_names[2]) const;
+  void generate_get_tag_param3(std::ostream& os, std::string nl, const char A[4][4][4],
+                               const std::string param_names[3]) const;
+  bool match_param_pattern(std::ostream& os, std::string nl, const char A[4], int mask, std::string pattern,
+                           std::string param_name) const;
+  std::string get_nat_param_name(int idx) const;
+  void generate_tag_pfx_selector(std::ostream& os, std::string nl, const BinTrie& trie, int d, int min_size) const;
+  bool generate_get_tag_pfx_distinguisher(std::ostream& os, std::string nl, const std::vector<int>& constr_list,
+                                          bool in_block) const;
+
+ private:
+  std::vector<Action> actions;
+  int incomplete;
+  int tmp_ints;
+  bool needs_tmp_cell;
+  std::vector<std::string> tmp_vars;
+  std::vector<std::string> field_vars;
+  std::vector<bool> field_var_set;
+  std::vector<bool> param_var_set;
+  std::vector<bool> param_constraint_used;
+  std::vector<std::pair<std::string, const TypeExpr*>> postponed_equate;
+  CppIdentSet tmp_cpp_ids;
+  void clear_context();
+  void init_cons_context(const Constructor& constr);
+  std::string new_tmp_var(std::string hint);
+  std::string new_tmp_var();
+  void add_action(const Action& act);
+  void output_actions(std::ostream& os, std::string nl, int options);
+  void output_cpp_expr(std::ostream& os, const TypeExpr* expr, int prio = 0, bool allow_type_neg = false) const;
+  void output_cpp_sizeof_expr(std::ostream& os, const TypeExpr* expr, int prio) const;
+  void output_negative_type_arguments(std::ostream& os, const TypeExpr* expr);
+  bool can_compute(const TypeExpr* expr) const;
+  bool can_use_to_compute(const TypeExpr* expr, int i) const;
+  bool can_compute_sizeof(const TypeExpr* expr) const;
+  bool is_self(const TypeExpr* expr, const Constructor& constr) const;
+  void add_compute_actions(const TypeExpr* expr, int i, std::string bind_to);
+  void identify_cons_params(const Constructor& constr, int options);
+  void identify_cons_neg_params(const Constructor& constr, int options);
+  void bind_record_fields(const ConsRecord& rec, int options);
+  void add_cons_tag_check(const Constructor& constr, int cidx, int options);
+  void add_cons_tag_store(const Constructor& constr, int cidx);
+  std::string add_fetch_nat_field(const Constructor& constr, const Field& field, int options);
+  void add_store_nat_field(const Constructor& constr, const Field& field, int options);
+  void add_remaining_param_constraints_check(const Constructor& constr, int options);
+  void compute_implicit_field(const Constructor& constr, const Field& field, int options);
+  bool add_constraint_check(const Constructor& constr, const Field& field, int options);
+  void add_postponed_equate_actions();
+  void output_fetch_field(std::ostream& os, std::string field_name, const TypeExpr* expr, cpp_val_type cvt);
+  void output_fetch_subrecord(std::ostream& os, std::string field_name, const ConsRecord* subrec);
+  void output_store_field(std::ostream& os, std::string field_name, const TypeExpr* expr, cpp_val_type cvt);
+  void add_store_subrecord(std::string field_name, const ConsRecord* subrec);
+  void generate_skip_field(const Constructor& constr, const Field& field, int options);
+  void generate_print_field(const Constructor& constr, const Field& field, int options);
+  bool output_print_simple_field(std::ostream& os, const Field& field, std::string field_name, const TypeExpr* expr);
+  void generate_unpack_field(const ConsField& fi, const Constructor& constr, const Field& field, int options);
+  void generate_pack_field(const ConsField& fi, const Constructor& constr, const Field& field, int options);
+};
+
+extern std::vector<std::unique_ptr<CppTypeCode>> cpp_type;
+
+extern bool add_type_members;
+
+}  // namespace tlbc
diff --git a/submodules/ton/tonlib-src/crypto/tl/tlbc.cpp b/submodules/ton/tonlib-src/crypto/tl/tlbc.cpp
new file mode 100644
index 0000000000..5d3d0fe4cb
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/tl/tlbc.cpp
@@ -0,0 +1,3155 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <vector>
+#include <string>
+#include <map>
+#include <set>
+#include <stack>
+#include <utility>
+#include <algorithm>
+#include <iostream>
+#include <fstream>
+#include <functional>
+#include <sstream>
+#include <cstdio>
+#include <cassert>
+#include <cstdlib>
+#include <getopt.h>
+
+#include "common/refcnt.hpp"
+#include "common/bigint.hpp"
+#include "common/refint.h"
+#include "parser/srcread.h"
+#include "parser/lexer.h"
+#include "parser/symtable.h"
+#include "td/utils/Slice-decl.h"
+#include "td/utils/format.h"
+#include "td/utils/crypto.h"
+#include "tlbc-aux.h"
+#include "tlbc-data.h"
+#include "tlbc-gen-cpp.h"
+
+int verbosity;
+
+namespace src {
+
+/*
+ * 
+ *   KEYWORD DEFINITION
+ * 
+ */
+
+enum { _Eof = -1, _Ident = 0, _Number, _Special, _Eq = 0x80, _Leq, _Geq, _Neq, _Type, _EMPTY };
+
+void define_keywords() {
+  sym::symbols.add_kw_char('+')
+      .add_kw_char('-')
+      .add_kw_char('*')
+      .add_kw_char(':')
+      .add_kw_char(';')
+      .add_kw_char('(')
+      .add_kw_char(')')
+      .add_kw_char('{')
+      .add_kw_char('}')
+      .add_kw_char('[')
+      .add_kw_char(']')
+      .add_kw_char('=')
+      .add_kw_char('_')
+      .add_kw_char('?')
+      .add_kw_char('.')
+      .add_kw_char('~')
+      .add_kw_char('^');
+
+  sym::symbols.add_keyword("==", _Eq)
+      .add_keyword("<=", _Leq)
+      .add_keyword(">=", _Geq)
+      .add_keyword("!=", _Neq)
+      .add_keyword("Type", _Type)
+      .add_keyword("EMPTY", _EMPTY);
+}
+
+// parses constant bitstrings in format \#[0-9a-f]*_? or \$[01]*_?
+unsigned long long get_special_value(std::string str) {
+  std::size_t i = 1, n = str.size();
+  if (n <= 1) {
+    return 0;
+  }
+  unsigned long long val = 0;
+  int bits = 0;
+  if (str[0] == '#') {
+    while (i < n) {
+      int c = str[i++];
+      if (c == '_') {
+        break;
+      }
+      if (c >= '0' && c <= '9') {
+        c -= '0';
+      } else if (c >= 'a' && c <= 'f') {
+        c -= 'a' - 10;
+      } else {
+        return 0;
+      }
+      if (bits > 60) {
+        return 0;
+      }
+      val |= (unsigned long long)c << (60 - bits);
+      bits += 4;
+    }
+  } else if (str[0] == '$') {
+    if (str[1] != '_') {
+      for (; i < n; i++) {
+        int c = str[i];
+        c -= '0';
+        if (c & -2) {
+          return 0;
+        }
+        if (bits > 63) {
+          return 0;
+        }
+        val |= (unsigned long long)c << (63 - bits);
+        bits++;
+      }
+    }
+  } else {
+    return 0;
+  }
+  if (i < n - 1) {
+    return 0;
+  }
+  if (i == n - 1 && bits) {
+    // trailing _
+    while (bits && !((val >> (64 - bits)) & 1)) {
+      --bits;
+    }
+  }
+  if (bits == 64) {
+    return 0;
+  }
+  return val | (1ULL << (63 - bits));
+}
+
+int lexem_is_special(std::string str) {
+  return get_special_value(str) ? Lexem::Special : 0;
+}
+
+}  // namespace src
+
+namespace sym {
+
+enum class IdSc : char { undef = 0, lc = 1, uc = 2, blc = 3 };
+// subclass:
+// 1 = first letter or first letter after last . is lowercase
+// 2 = ... uppercase
+// 3 = 1 + first character (after last ., if present) is a !
+// 0 = else
+int compute_symbol_subclass(std::string str) {
+  IdSc res = IdSc::undef;
+  int t = 0, s = 0;
+  for (char c : str) {
+    if (c == '.') {
+      res = IdSc::undef;
+      s = t = 0;
+    } else if (res == IdSc::undef) {
+      if (!s) {
+        s = (c == '!' ? 1 : -1);
+      }
+      if ((c | 0x20) >= 'a' && (c | 0x20) <= 'z') {
+        res = (c & 0x20 ? IdSc::lc : IdSc::uc);
+      }
+      if (t && (((unsigned)c & 0xc0) == 0x80)) {
+        t = (t << 6) | ((unsigned)c & 0x3f);
+        if (t >= 0x410 && t < 0x450) {
+          res = (t < 0x430 ? IdSc::uc : IdSc::lc);
+        }
+      }
+      t = (((unsigned)c & 0xe0) == 0xc0 ? (c & 0x1f) : 0);
+    }
+  }
+  if (s == 1 && res == IdSc::lc) {
+    res = IdSc::blc;
+  }
+  return (int)res;
+}
+
+inline bool is_lc_ident(sym_idx_t idx) {
+  auto sc = symbols.get_subclass(idx);
+  return sc == (int)IdSc::lc || sc == (int)IdSc::blc;
+}
+
+inline bool is_spec_lc_ident(sym_idx_t idx) {
+  auto sc = symbols.get_subclass(idx);
+  return sc == (int)IdSc::blc;
+}
+
+inline bool is_uc_ident(sym_idx_t idx) {
+  return symbols.get_subclass(idx) == (int)IdSc::uc;
+}
+
+}  // namespace sym
+
+namespace tlbc {
+
+/*
+ * 
+ *  AUXILIARY DATA TYPES
+ * 
+ */
+
+// headers are in tlbc-aux.h
+
+std::ostream& operator<<(std::ostream& os, const BitPfxCollection& p) {
+  p.show(os);
+  return os;
+}
+
+void BitPfxCollection::show(std::ostream& os) const {
+  char first = '{';
+  for (unsigned long long val : pfx) {
+    os << first;
+    while (val & (All - 1)) {
+      os << (val >> 63);
+      val <<= 1;
+    }
+    os << '*';
+    first = ',';
+  }
+  if (first == '{') {
+    os << '{';
+  }
+  os << '}';
+}
+
+void BitPfxCollection::merge_back(unsigned long long z) {
+  if (!pfx.size()) {
+    pfx.push_back(z);
+    return;
+  }
+  unsigned long long w = td::lower_bit64(z);
+  while (pfx.size()) {
+    unsigned long long t = z ^ pfx.back();
+    if (!t) {
+      return;
+    }
+    if (t != (w << 1)) {
+      break;
+    }
+    z -= w;
+    w <<= 1;
+    pfx.pop_back();
+  }
+  pfx.push_back(z);
+}
+
+BitPfxCollection& BitPfxCollection::operator*=(unsigned long long prepend) {
+  if (!prepend) {
+    clear();
+    return *this;
+  }
+  if (prepend == All) {
+    return *this;
+  }
+  int l = 63 - td::count_trailing_zeroes_non_zero64(prepend);
+  prepend &= prepend - 1;
+  std::size_t i, j = 0, n = pfx.size();
+  for (i = 0; i < n; i++) {
+    unsigned long long z = pfx[i], zw = td::lower_bit64(z);
+    z >>= l;
+    z |= prepend;
+    if (!(zw >> l)) {
+      z |= 1;
+    }
+    if (!j || pfx[j - 1] != z) {
+      pfx[j++] = z;
+    }
+  }
+  pfx.resize(j);
+  return *this;
+}
+
+BitPfxCollection BitPfxCollection::operator*(unsigned long long prepend) const {
+  if (!prepend) {
+    return BitPfxCollection{};
+  }
+  if (prepend == All) {
+    return *this;
+  }
+  BitPfxCollection res;
+  res.pfx.reserve(pfx.size());
+  int l = 63 - td::count_trailing_zeroes_non_zero64(prepend);
+  prepend &= prepend - 1;
+  std::size_t i, n = pfx.size();
+  for (i = 0; i < n; i++) {
+    unsigned long long z = pfx[i], zw = td::lower_bit64(z);
+    z >>= l;
+    z |= prepend;
+    if (!(zw >> l)) {
+      z |= 1;
+    }
+    res.merge_back(z);
+  }
+  return res;
+}
+
+BitPfxCollection BitPfxCollection::operator+(const BitPfxCollection& other) const {
+  if (!other.pfx.size()) {
+    return *this;
+  }
+  if (!pfx.size()) {
+    return other;
+  }
+  BitPfxCollection res;
+  res.pfx.reserve(pfx.size() + other.pfx.size());
+  std::size_t i = 0, j = 0, m = pfx.size(), n = other.pfx.size();
+  struct Interval {
+    unsigned long long z, a, b;
+    void operator=(unsigned long long _z) {
+      z = _z;
+      a = (_z & (_z - 1));
+      b = (_z | (_z - 1));
+    }
+    bool contains(const Interval& other) const {
+      return a <= other.a && other.b <= b;
+    }
+  };
+  Interval U, V;
+  U = pfx[0];
+  V = other.pfx[0];
+  while (i < m && j < n) {
+    if (U.b < V.b || (U.b == V.b && U.a >= V.a)) {
+      if (U.a < V.a) {
+        res.merge_back(U.z);
+      }
+      if (++i == m) {
+        break;
+      }
+      U = pfx[i];
+    } else {
+      if (V.a < U.a) {
+        res.merge_back(V.z);
+      }
+      if (++j == n) {
+        break;
+      }
+      V = other.pfx[j];
+    }
+  }
+  while (i < m) {
+    res.merge_back(pfx[i++]);
+  }
+  while (j < n) {
+    res.merge_back(other.pfx[j++]);
+  }
+  return res;
+}
+
+bool BitPfxCollection::operator+=(const BitPfxCollection& other) {
+  BitPfxCollection tmp = *this + other;
+  if (*this == tmp) {
+    return false;
+  } else {
+    *this = tmp;
+    return true;
+  }
+}
+
+void AdmissibilityInfo::set_all(bool val) {
+  dim = 0;
+  info.clear();
+  info.resize(1, val);
+}
+
+std::ostream& operator<<(std::ostream& os, const AdmissibilityInfo& p) {
+  p.show(os);
+  return os;
+}
+
+void AdmissibilityInfo::show(std::ostream& os) const {
+  os << '[';
+  for (bool x : info) {
+    os << (int)x;
+  }
+  os << ']';
+}
+
+void AdmissibilityInfo::extend(int dim1) {
+  if (dim < dim1) {
+    std::size_t i, n = info.size(), n1 = (size_t(1) << (2 * dim1));
+    assert(n);
+    info.resize(n1);
+    for (i = n; i < n1; i++) {
+      info[i] = info[i - n];
+    }
+    dim = dim1;
+  }
+}
+
+void AdmissibilityInfo::operator|=(const AdmissibilityInfo& other) {
+  extend(other.dim);
+  std::size_t i, j, n = info.size(), n1 = other.info.size();
+  assert(n1 && !(n1 & (n1 - 1)));
+  for (i = j = 0; i < n; i++) {
+    info[i] = info[i] | other.info[j];
+    j = (j + 1) & (n1 - 1);
+  }
+}
+
+void AdmissibilityInfo::set_by_pattern(int pdim, int pattern[]) {
+  extend(pdim);
+  std::size_t n = info.size();
+  for (std::size_t x = 0; x < n; x++) {
+    std::size_t y = x;
+    bool f = true;
+    for (int i = 0; i < pdim; i++) {
+      if (!((pattern[i] >> (y & 3)) & 1)) {
+        f = false;
+        break;
+      }
+      y >>= 2;
+    }
+    if (f) {
+      info[x] = true;
+    }
+  }
+}
+
+int AdmissibilityInfo::conflicts_at(const AdmissibilityInfo& other) const {
+  std::size_t i, n1 = info.size(), n2 = other.info.size(), n = std::max(n1, n2);
+  for (i = 0; i < n; i++) {
+    if (info[i & (n1 - 1)] && other.info[i & (n2 - 1)]) {
+      return (int)i;
+    }
+  }
+  return -1;
+}
+
+bool AdmissibilityInfo::extract1(char A[4], char tag, int p1) const {
+  char B[4];
+  std::memset(B, 0, sizeof(B));
+  p1 <<= 1;
+  std::size_t n = info.size() - 1;
+  for (std::size_t x = 0; x <= n; x++) {
+    if (info[x]) {
+      B[(x >> p1) & 3] = 1;
+    }
+  }
+  int m1 = ((n >> p1) & 3);
+  for (int i = 0; i < 4; i++) {
+    if (B[i & m1]) {
+      if (A[i] && A[i] != tag) {
+        A[i] = -1;
+        return false;
+      }
+      A[i] = tag;
+    }
+  }
+  return true;
+}
+
+bool AdmissibilityInfo::extract2(char A[4][4], char tag, int p1, int p2) const {
+  char B[4][4];
+  std::memset(B, 0, sizeof(B));
+  p1 <<= 1;
+  p2 <<= 1;
+  std::size_t n = info.size() - 1;
+  for (std::size_t x = 0; x <= n; x++) {
+    if (info[x]) {
+      B[(x >> p1) & 3][(x >> p2) & 3] = 1;
+    }
+  }
+  int m1 = ((n >> p1) & 3);
+  int m2 = ((n >> p2) & 3);
+  for (int i = 0; i < 4; i++) {
+    for (int j = 0; j < 4; j++) {
+      if (B[i & m1][j & m2]) {
+        if (A[i][j] && A[i][j] != tag) {
+          A[i][j] = -1;
+          return false;
+        }
+        A[i][j] = tag;
+      }
+    }
+  }
+  return true;
+}
+
+bool AdmissibilityInfo::extract3(char A[4][4][4], char tag, int p1, int p2, int p3) const {
+  char B[4][4][4];
+  std::memset(B, 0, sizeof(B));
+  p1 <<= 1;
+  p2 <<= 1;
+  p3 <<= 1;
+  std::size_t n = info.size() - 1;
+  for (std::size_t x = 0; x <= n; x++) {
+    if (info[x]) {
+      B[(x >> p1) & 3][(x >> p2) & 3][(x >> p3) & 3] = 1;
+    }
+  }
+  int m1 = ((n >> p1) & 3);
+  int m2 = ((n >> p2) & 3);
+  int m3 = ((n >> p3) & 3);
+  for (int i = 0; i < 4; i++) {
+    for (int j = 0; j < 4; j++) {
+      for (int k = 0; k < 4; k++) {
+        if (B[i & m1][j & m2][k & m3]) {
+          if (A[i][j][k] && A[i][j][k] != tag) {
+            A[i][j][k] = -1;
+            return false;
+          }
+          A[i][j][k] = tag;
+        }
+      }
+    }
+  }
+  return true;
+}
+
+void ConflictGraph::set_clique(ConflictSet set) {
+  if (set.x) {
+    for (int i = 0; i < 64; i++) {
+      if (set[i]) {
+        g[i] |= set;
+      }
+    }
+  }
+}
+
+std::ostream& operator<<(std::ostream& os, const BinTrie& bt) {
+  bt.show(os);
+  return os;
+}
+
+void BinTrie::show(std::ostream& os, unsigned long long pfx) const {
+  unsigned long long x = pfx, u = (td::lower_bit64(x) >> 1);
+  while (x & ((1ULL << 63) - 1)) {
+    os << (x >> 63);
+    x <<= 1;
+  }
+  os << " t=" << tag << "; dt=" << down_tag << "; ud=" << useful_depth << std::endl;
+  if (left) {
+    left->show(os, pfx - u);
+  }
+  if (right) {
+    right->show(os, pfx + u);
+  }
+}
+
+void BinTrie::ins_path(unsigned long long path, unsigned long long new_tag) {
+  if (!path || !new_tag) {
+    return;
+  }
+  if (!(path & ((1ULL << 63) - 1))) {
+    tag |= new_tag;
+    return;
+  } else if ((long long)path >= 0) {
+    left = insert_path(std::move(left), path << 1, new_tag);
+  } else {
+    right = insert_path(std::move(right), path << 1, new_tag);
+  }
+  if (left && right) {
+    tag |= left->tag & right->tag;
+  }
+}
+
+std::unique_ptr<BinTrie> BinTrie::insert_path(std::unique_ptr<BinTrie> root, unsigned long long path,
+                                              unsigned long long tag) {
+  if (!path || !tag) {
+    return root;
+  }
+  if (root) {
+    root->ins_path(path, tag);
+    return root;
+  }
+  if (!(path & ((1ULL << 63) - 1))) {
+    return std::make_unique<BinTrie>(tag);
+  }
+  if ((long long)path >= 0) {
+    return std::make_unique<BinTrie>(0, insert_path({}, path << 1, tag), std::unique_ptr<BinTrie>{});
+  } else {
+    return std::make_unique<BinTrie>(0, std::unique_ptr<BinTrie>{}, insert_path({}, path << 1, tag));
+  }
+}
+
+std::unique_ptr<BinTrie> BinTrie::insert_paths(std::unique_ptr<BinTrie> root, const BitPfxCollection& paths,
+                                               unsigned long long tag) {
+  if (tag) {
+    for (auto x : paths.pfx) {
+      root = insert_path(std::move(root), x, tag);
+    }
+  }
+  return root;
+}
+
+unsigned long long BinTrie::lookup_tag(unsigned long long path) const {
+  const BinTrie* node = lookup_node_const(path);
+  return node ? node->tag : 0;
+}
+
+BinTrie* BinTrie::lookup_node(unsigned long long path) {
+  if (!path) {
+    return nullptr;
+  }
+  if (!(path & ((1ULL << 63) - 1))) {
+    return this;
+  }
+  if ((long long)path >= 0) {
+    return left ? left->lookup_node(path << 1) : nullptr;
+  } else {
+    return right ? right->lookup_node(path << 1) : nullptr;
+  }
+}
+
+const BinTrie* BinTrie::lookup_node_const(unsigned long long path) const {
+  if (!path) {
+    return nullptr;
+  }
+  if (!(path & ((1ULL << 63) - 1))) {
+    return this;
+  }
+  if ((long long)path >= 0) {
+    return left ? left->lookup_node_const(path << 1) : nullptr;
+  } else {
+    return right ? right->lookup_node_const(path << 1) : nullptr;
+  }
+}
+
+void BinTrie::set_conflict_graph(ConflictGraph& gr, unsigned long long colors) const {
+  colors |= tag;
+  if (!left || !right) {
+    gr.set_clique(ConflictSet{colors});
+  }
+  if (left) {
+    left->set_conflict_graph(gr, colors);
+  }
+  if (right) {
+    right->set_conflict_graph(gr, colors);
+  }
+}
+
+int BinTrie::compute_useful_depth(unsigned long long colors) {
+  int res = 0;  // useless;
+  down_tag = tag = colors |= tag;
+  if (left) {
+    res = left->compute_useful_depth(colors);
+    down_tag |= left->down_tag;
+  }
+  if (right) {
+    res = std::max(res, right->compute_useful_depth(colors));
+    down_tag |= right->down_tag;
+  }
+  if (res > 0) {
+    return useful_depth = res + 1;
+  }
+  if (left && right && (left->down_tag & ~right->down_tag) != 0 && (right->down_tag & ~left->down_tag) != 0) {
+    return useful_depth = 1;
+  }
+  return useful_depth = 0;
+}
+
+unsigned long long BinTrie::build_submap(int depth, unsigned long long A[]) const {
+  if (!depth) {
+    A[0] = down_tag | (useful_depth ? (1ULL << 63) : 0);
+    return down_tag != 0;
+  }
+  int n = (1 << (depth - 1));
+  unsigned long long r1 = 0, r2 = 0;
+  if (left) {
+    r1 = left->build_submap(depth - 1, A);
+  } else {
+    std::memset(A, 0, n * 8);
+  }
+  if (right) {
+    r2 = right->build_submap(depth - 1, A + n);
+  } else {
+    std::memset(A + n, 0, n * 8);
+  }
+  if (A[n] != A[n - 1] || (long)A[n] < 0) {
+    r2 |= 1;
+  } else {
+    r2 &= ~1;
+  }
+  return r1 | (r2 << n);
+}
+
+unsigned long long BinTrie::build_submap_at(int depth, unsigned long long A[], unsigned long long pfx) const {
+  const BinTrie* node = lookup_node_const(pfx);
+  if (!node) {
+    std::memset(A, 0, 8 << depth);
+    return 0;
+  }
+  return node->build_submap(depth, A);
+}
+
+unsigned long long BinTrie::find_conflict_path(unsigned long long colors, unsigned long long mask) const {
+  colors |= tag & mask;
+  if (!left && !right) {
+    return colors & (colors - 1) ? (1ULL << 63) : 0;
+  }
+  if (!left) {
+    if (colors & (colors - 1)) {
+      return (1ULL << 62);  // $0
+    } else {
+      unsigned long long x = right->find_conflict_path(colors, mask);
+      return x ? ((x >> 1) | (1ULL << 63)) : 0;
+    }
+  } else if (!right) {
+    if (colors & (colors - 1)) {
+      return (3ULL << 62);  // $1
+    } else {
+      return left->find_conflict_path(colors, mask) >> 1;
+    }
+  }
+  unsigned long long x = left->find_conflict_path(colors, mask);
+  unsigned long long y = right->find_conflict_path(colors, mask);
+  if (td::lower_bit64(y) > td::lower_bit64(x)) {
+    return (y >> 1) | (1ULL << 63);
+  } else {
+    return x >> 1;
+  }
+}
+
+std::ostream& operator<<(std::ostream& os, MinMaxSize t) {
+  t.show(os);
+  return os;
+}
+
+void MinMaxSize::normalize() {
+  if (minmax_size & (0xfff800f8U * 0x100000001ULL)) {
+    nrm(0xf8, 0x7);
+    nrm(0xfff80000U, 0x7ff00);
+    nrm(0xf8ULL << 32, 7ULL << 32);
+    nrm(0xfff80000ULL << 32, 0x7ff00ULL << 32);
+  }
+}
+
+MinMaxSize::unpacked::unpacked(MinMaxSize val) {
+  val.normalize();
+  max_refs = val.minmax_size & 0xff;
+  max_bits = (val.minmax_size >> 8) & 0x7ff;
+  min_refs = (val.minmax_size >> 32) & 0xff;
+  min_bits = (val.minmax_size >> 40) & 0x7ff;
+}
+
+MinMaxSize MinMaxSize::unpacked::pack() const {
+  unsigned long long t = ((unsigned long long)(min_bits * 0x100 + min_refs) << 32);
+  t += (max_bits * 0x100 + max_refs);
+  return MinMaxSize{t};
+}
+
+MinMaxSize& MinMaxSize::repeat(int count) {
+  if (count <= 0) {
+    return clear();
+  }
+  if (count == 1) {
+    return *this;
+  }
+  unpacked z{*this};
+  count = std::min(count, 1024);
+  z.max_refs = std::min(z.max_refs * count, 7U);
+  z.max_bits = std::min(z.max_bits * count, 0x7ffU);
+  z.min_refs = std::min(z.min_refs * count, 7U);
+  z.min_bits = std::min(z.min_bits * count, 0x7ffU);
+  return *this = z.pack();
+}
+
+MinMaxSize& MinMaxSize::repeat_at_least(int count) {
+  count = std::min(std::max(count, 0), 1024);
+  unpacked z{*this};
+  if (z.max_refs) {
+    z.max_refs = 7;
+  }
+  if (z.max_bits) {
+    z.max_bits = 0x7ff;
+  }
+  z.min_refs = std::min(z.min_refs * count, 7U);
+  z.min_bits = std::min(z.min_bits * count, 0x7ffU);
+  return *this = z.pack();
+}
+
+MinMaxSize& MinMaxSize::operator|=(MinMaxSize y) {
+  unpacked z{*this}, w{y};
+  z.min_refs = std::min(z.min_refs, w.min_refs);
+  z.min_bits = std::min(z.min_bits, w.min_bits);
+  z.max_refs = std::max(z.max_refs, w.max_refs);
+  z.max_bits = std::max(z.max_bits, w.max_bits);
+  return *this = z.pack();
+}
+
+void MinMaxSize::show(std::ostream& os) const {
+  unpacked z{*this};
+  z.show(os);
+}
+
+void MinMaxSize::unpacked::show(std::ostream& os) const {
+  bool fixed = (min_bits == max_bits && min_refs == max_refs);
+  if (fixed) {
+    os << '=';
+  }
+  if (min_bits >= 1024 && min_refs >= 7) {
+    os << "infty";
+  } else {
+    os << min_bits;
+    if (min_refs) {
+      os << "+" << min_refs << "R";
+    }
+  }
+  if (!fixed) {
+    os << "..";
+    if (max_bits >= 1024 && max_refs >= 7) {
+      os << "infty";
+    } else {
+      os << max_bits;
+      if (max_refs) {
+        os << "+" << max_refs << "R";
+      }
+    }
+  }
+}
+
+}  // namespace tlbc
+
+namespace tlbc {
+
+using src::Lexem;
+using src::Lexer;
+using sym::sym_idx_t;
+
+/*
+ * 
+ *  DATA TYPES: Type Expressions, Types, Constructors
+ * 
+ */
+
+// headers in tlbc-data.h
+
+std::ostream& operator<<(std::ostream& os, const TypeExpr* te) {
+  if (te) {
+    te->show(os);
+  } else {
+    os << "(null-type)";
+  }
+  return os;
+}
+
+std::ostream& operator<<(std::ostream& os, const Constructor& cs) {
+  cs.show(os);
+  return os;
+}
+
+TypeExpr type_Type{{}, TypeExpr::te_Type};
+
+TypeExpr* const_type_expr[TypeExpr::max_const_expr];
+int const_type_expr_num;
+
+TypeExpr* TypeExpr::const_htable[TypeExpr::const_htable_size];
+
+sym_idx_t Nat_name, Eq_name, Less_name, Leq_name;
+Type* Nat_type;
+Type *Eq_type, *Less_type, *Leq_type;
+Type *NatWidth_type, *NatLess_type, *NatLeq_type, *Int_type, *UInt_type;
+Type* Bits_type;
+Type *Any_type, *Cell_type;
+
+int types_num, builtin_types_num;
+std::vector<Type> types;
+
+int Type::last_declared_counter;
+
+void TypeExpr::check_mode(const src::SrcLocation& loc, int mode) {
+  if (!(mode & (1 << (is_nat ? 1 : 0)))) {
+    if (is_nat) {
+      throw src::ParseError{loc, "type expression required"};
+    } else {
+      throw src::ParseError{loc, "integer expression required"};
+    }
+  }
+  if (tchk_only && !(mode & 8)) {
+    throw src::ParseError{where, "type expression can be used only in a type-checking context"};
+  }
+}
+
+bool TypeExpr::no_tchk() const {
+  if (tchk_only) {
+    throw src::ParseError{where, "type expression can be used only in a type-checking context"};
+    return false;
+  }
+  return true;
+}
+
+TypeExpr* TypeExpr::mk_intconst(const src::SrcLocation& loc, unsigned int_const) {
+  return new TypeExpr{loc, te_IntConst, (int)int_const};
+}
+
+TypeExpr* TypeExpr::mk_intconst(const src::SrcLocation& loc, std::string int_const) {
+  char* end_ptr = 0;
+  long long value = -1;
+  if (!int_const.empty()) {
+    value = std::strtoll(int_const.c_str(), &end_ptr, 0);
+  }
+  if (value < 0 || value >= (1LL << 31) || end_ptr != int_const.c_str() + int_const.size()) {
+    throw src::ParseError{loc, "integer constant does not fit in an unsigned 31-bit integer"};
+  }
+  return mk_intconst(loc, (unsigned)value);
+}
+
+TypeExpr* TypeExpr::mk_apply_gen(const src::SrcLocation& loc, TypeExpr* expr1, TypeExpr* expr2) {
+  if (expr1->tp != te_Apply) {
+    throw src::ParseError{loc, "cannot apply one expression to the other"};
+  }
+  expr1->args.push_back(expr2);
+  return expr1;
+}
+
+TypeExpr* TypeExpr::mk_mulint(const src::SrcLocation& loc, TypeExpr* expr1, TypeExpr* expr2) {
+  if (expr1->tp != te_IntConst && expr2->tp != te_IntConst) {
+    throw src::ParseError{loc, "multiplication allowed only by constant values"};
+  }
+  if (expr2->tp != te_IntConst) {
+    std::swap(expr1, expr2);
+  }
+  if (!expr1->is_nat) {
+    throw src::ParseError{expr1->where, "argument to integer multiplication should be a number"};
+  }
+  if (expr1->tp == te_IntConst) {
+    long long product = (long long)expr1->value * expr2->value;
+    if (product < 0 || product >= (1LL << 31)) {
+      throw src::ParseError{loc, "product does not git in 31 bits"};
+    }
+    return mk_intconst(loc, (unsigned)product);
+  }
+  int val = expr2->value;
+  if (!val) {
+    return expr2;
+  }
+  // delete expr2;
+  return new TypeExpr{loc, te_MulConst, val, {expr1}, expr1->negated};
+}
+
+TypeExpr* TypeExpr::mk_apply(const src::SrcLocation& loc, int tp, TypeExpr* expr1, TypeExpr* expr2) {
+  TypeExpr* expr = new TypeExpr{loc, tp, 0, {expr1, expr2}};
+  return expr;
+}
+
+TypeExpr* TypeExpr::mk_cellref(const src::SrcLocation& loc, TypeExpr* expr1) {
+  TypeExpr* expr = new TypeExpr{loc, te_Ref, 0, {expr1}};
+  return expr;
+}
+
+Field& Constructor::new_field(const src::SrcLocation& field_where, bool implicit, sym_idx_t name = 0) {
+  assert((long)fields_num == (long)fields.size());
+  if (name) {
+    sym::SymDef* sym_def = sym::lookup_symbol(name, 1);
+    if (sym_def) {
+      throw src::ParseError{field_where, "redefined field or parameter"};
+    }
+  }
+  fields.emplace_back(field_where, implicit, fields_num++, name);
+  return fields.back();
+}
+
+std::string Field::get_name() const {
+  return sym::symbols.get_name(name);
+}
+
+// register symbol in local symbol table
+void Field::register_sym() const {
+  if (name) {
+    sym::SymDef* sym_def = sym::lookup_symbol(name, 1);
+    if (sym_def) {
+      throw src::ParseError{loc, "redefined field or parameter"};
+    } else {
+      sym_def = sym::define_symbol(name, true, loc);
+      if (!sym_def) {
+        throw src::ParseError{loc, "cannot register field"};
+      }
+    }
+    delete sym_def->value;
+    sym_def->value = new SymVal((int)SymVal::_Param, field_idx, type);
+  }
+}
+
+bool TypeExpr::close(const src::SrcLocation& loc) {
+  if (tp != te_Apply) {
+    return true;
+  }
+  Type* type = type_applied;
+  assert(type);
+  if (type->arity < 0) {
+    type->arity = (int)args.size();
+    type->args.resize(type->arity, 0);
+  } else if (type->arity != (int)args.size()) {
+    throw src::ParseError{where,
+                          std::string{"operator `"} + sym::symbols.get_name(type->type_name) +
+                              "` applied with incorrect number of arguments, partial type applications not supported"};
+    return false;
+  }
+  is_nat_subtype = type->produces_nat;
+  bool is_eq = (type == Eq_type);
+  int neg_cnt = 0;
+  for (int i = 0; i < type->arity; i++) {
+    TypeExpr* arg = args[i];
+    int& x = type->args[i];
+    if (arg->negated) {
+      ++neg_cnt;
+      negated = true;
+      if (!is_eq) {
+        if (x & Type::_IsPos) {
+          throw src::ParseError{arg->where, std::string{"passed an argument of incorrect polarity to `"} +
+                                                sym::symbols.get_name(type->type_name) + "`"};
+        }
+        x |= Type::_IsNeg;
+      } else if (neg_cnt == 2) {
+        throw src::ParseError{loc, "cannot equate two expressions of negative polarity"};
+      }
+    }
+    arg->no_tchk();
+    if (arg->is_nat) {
+      x |= Type::_IsNat;
+    } else {
+      x |= Type::_IsType;
+      if (arg->negated) {
+        throw src::ParseError{arg->where, "cannot use negative types as arguments to other types"};
+      }
+    }
+  }
+  tchk_only = negated = neg_cnt;
+  return true;
+}
+
+TypeExpr* TypeExpr::mk_apply_empty(const src::SrcLocation& loc, sym_idx_t name, Type* type_applied) {
+  TypeExpr* expr = new TypeExpr{loc, te_Apply, name};
+  expr->type_applied = type_applied;
+  expr->is_nat_subtype = (type_applied->produces_nat && !type_applied->arity);
+  return expr;
+}
+
+void Type::print_name(std::ostream& os) const {
+  if (type_name) {
+    os << sym::symbols.get_name(type_name);
+  } else {
+    os << "TYPE_" << type_idx;
+  }
+}
+
+std::string Type::get_name() const {
+  if (type_name) {
+    return sym::symbols.get_name(type_name);
+  } else {
+    std::ostringstream os;
+    os << "TYPE_" << type_idx;
+    return os.str();
+  }
+}
+
+std::string Constructor::get_name() const {
+  return sym::symbols.get_name(constr_name);
+}
+
+std::string Constructor::get_qualified_name() const {
+  return type_defined->get_name() + "::" + get_name();
+}
+
+void TypeExpr::show(std::ostream& os, const Constructor* cs, int prio, int mode) const {
+  if (mode & 2) {
+    prio = 0;
+  }
+  switch (tp) {
+    case te_Type:
+      os << "Type";
+      break;
+    case te_Param: {
+      int i = value;
+      sym_idx_t param_name = 0;
+      if (cs && i >= 0 && i < cs->fields_num) {
+        param_name = cs->fields.at(i).name;
+      }
+      if (negated ^ (mode & 1)) {
+        os << '~';
+      }
+      if (param_name > 0) {
+        os << sym::symbols.get_name(param_name);
+      } else {
+        os << '_' << i + 1;
+      }
+      break;
+    }
+    case te_Apply:
+      if (!args.size() && !type_applied->type_name && type_applied->constr_num == 1 &&
+          !type_applied->constructors.at(0)->constr_name &&
+          !(type_applied->constructors[0]->tag & ((1ULL << 63) - 1))) {
+        type_applied->constructors[0]->show(os, mode | 4);
+      } else {
+        if (prio > 90 && args.size()) {
+          os << '(';
+        }
+        type_applied->print_name(os);
+        for (TypeExpr* arg : args) {
+          os << ' ';  // priority 90
+          arg->show(os, cs, 91, mode);
+        }
+        if (prio > 90 && args.size()) {
+          os << ')';
+        }
+      }
+      break;
+    case te_Add: {
+      assert(args.size() == 2);
+      if (prio > 20) {
+        os << '(';
+      }
+      args[0]->show(os, cs, 20, mode);
+      os << " + ";  // priority 20
+      args[1]->show(os, cs, 21, mode);
+      if (prio > 20) {
+        os << ')';
+      }
+      break;
+    }
+    case te_GetBit: {
+      assert(args.size() == 2);
+      if (prio > 97) {
+        os << '(';
+      }
+      args[0]->show(os, cs, 98, mode);
+      os << ".";  // priority 20
+      args[1]->show(os, cs, 98, mode);
+      if (prio > 97) {
+        os << ')';
+      }
+      break;
+    }
+    case te_IntConst: {
+      assert(args.empty());
+      os << value;
+      break;
+    }
+    case te_MulConst: {
+      if (prio > 30) {
+        os << '(';
+      }
+      assert(args.size() == 1);
+      os << value << " * ";  // priority 30
+      args[0]->show(os, cs, 31, mode);
+      if (prio > 30) {
+        os << ')';
+      }
+      break;
+    }
+    case te_Tuple: {
+      assert(args.size() == 2);
+      if (prio > 30) {
+        os << '(';
+      }
+      args[0]->show(os, cs, 30, mode);
+      os << " * ";  // priority 30
+      args[1]->show(os, cs, 31, mode);
+      if (prio > 30) {
+        os << ')';
+      }
+      break;
+    }
+    case te_CondType: {
+      assert(args.size() == 2);
+      if (prio > 95) {
+        os << '(';
+      }
+      args[0]->show(os, cs, 96, mode);
+      os << "?";  // priority 95
+      args[1]->show(os, cs, 96, mode);
+      if (prio > 95) {
+        os << ')';
+      }
+      break;
+    }
+    case te_Ref: {
+      assert(args.size() == 1);
+      os << '^';  // priority 100
+      args[0]->show(os, cs, 100, mode);
+      break;
+    }
+    default:
+      os << "(unknown-type)";
+  }
+}
+
+bool TypeExpr::equal(const TypeExpr& other) const {
+  if (tp != other.tp || value != other.value || type_applied != other.type_applied ||
+      args.size() != other.args.size()) {
+    return false;
+  }
+  for (std::size_t i = 0; i < args.size(); i++) {
+    if (!args[i]->equal(*other.args[i])) {
+      return false;
+    }
+  }
+  return true;
+}
+
+// 0 = 0, 1 = 1, 2 = any even >= 2, 3 = any odd >= 3
+// (We work in N/(4~2), or in the free semilattice generated by it.)
+int abstract_nat_const(int value) {
+  return 1 << ((value & 1) + (value >= 2 ? 2 : 0));
+}
+
+unsigned char abstract_add_base_table[4][4] = {{0, 1, 2, 3}, {1, 2, 3, 2}, {2, 3, 2, 3}, {3, 2, 3, 2}};
+unsigned char abstract_mul_base_table[4][4] = {{0, 0, 0, 0}, {0, 1, 2, 3}, {0, 2, 2, 2}, {0, 3, 2, 3}};
+unsigned char abstract_getbit_b_table[4][4] = {{1, 1, 1, 1}, {2, 1, 1, 1}, {1, 3, 3, 3}, {2, 3, 3, 3}};
+
+unsigned char abstract_add_table[16][16];
+unsigned char abstract_mul_table[16][16];
+unsigned char abstract_getbit_table[16][16];
+
+void compute_semilat_table(unsigned char table[16][16], const unsigned char base_table[4][4]) {
+  for (int x = 0; x < 16; x++) {
+    for (int y = 0; y < 16; y++) {
+      int res = 0;
+      for (int i = 0; i < 4; i++) {
+        if ((x >> i) & 1) {
+          for (int j = 0; j < 4; j++) {
+            if ((y >> j) & 1) {
+              res |= 1 << base_table[i][j];
+            }
+          }
+        }
+      }
+      table[x][y] = (unsigned char)res;
+    }
+  }
+}
+
+void compute_semilat_b_table(unsigned char table[16][16], const unsigned char b_table[4][4]) {
+  for (int x = 0; x < 16; x++) {
+    for (int y = 0; y < 16; y++) {
+      int res = 0;
+      for (int i = 0; i < 4; i++) {
+        if ((x >> i) & 1) {
+          for (int j = 0; j < 4; j++) {
+            if ((y >> j) & 1) {
+              res |= b_table[i][j];
+            }
+          }
+        }
+      }
+      table[x][y] = (unsigned char)res;
+    }
+  }
+}
+
+void init_abstract_tables() {
+  compute_semilat_table(abstract_add_table, abstract_add_base_table);
+  compute_semilat_table(abstract_mul_table, abstract_mul_base_table);
+  compute_semilat_b_table(abstract_getbit_table, abstract_getbit_b_table);
+}
+
+int abstract_add(int x, int y) {
+  return abstract_add_table[x & 15][y & 15];
+}
+
+int abstract_mul(int x, int y) {
+  return abstract_mul_table[x & 15][y & 15];
+}
+
+int abstract_getbit(int x, int y) {
+  return abstract_getbit_table[x & 15][y & 15];
+}
+
+int TypeExpr::abstract_interpret_nat() const {
+  if (!is_nat || tchk_only) {
+    return 0;
+  }
+  switch (tp) {
+    case te_Param:
+      return 0xf;  // for now, natural parameters can take arbitrary values
+    case te_Add:
+      assert(args.size() == 2);
+      return abstract_add(args[0]->abstract_interpret_nat(), args[1]->abstract_interpret_nat());
+    case te_GetBit:
+      assert(args.size() == 2);
+      return abstract_getbit(args[0]->abstract_interpret_nat(), args[1]->abstract_interpret_nat());
+    case te_IntConst:
+      return abstract_nat_const(value);
+    case te_MulConst:
+      assert(args.size() == 1);
+      return abstract_mul(args[0]->abstract_interpret_nat(), abstract_nat_const(value));
+    default:
+      return 0xf;
+  }
+}
+
+MinMaxSize TypeExpr::compute_size() const {
+  if (is_nat) {
+    return {0};
+  }
+  switch (tp) {
+    case te_Type:
+      return {0};
+    case te_Param:
+      return {MinMaxSize::Any};  // any size possible for type parameters
+    case te_Ref: {
+      assert(args.size() == 1);
+      bool f = args[0]->compute_size().is_possible();
+      return f ? MinMaxSize::OneRef : MinMaxSize::Impossible;
+    }
+    case te_CondType: {
+      assert(args.size() == 2);
+      int z = args[0]->abstract_interpret_nat();
+      if (!(z & ~1)) {
+        return {0};  // always 0
+      } else {
+        MinMaxSize t = args[1]->compute_size();
+        if (z & 1) {
+          t.clear_min();
+        }
+        return t;
+      }
+    }
+    case te_Tuple: {
+      assert(args.size() == 2);
+      int z = args[0]->abstract_interpret_nat();
+      if (!(z & ~1)) {
+        return {0};  // always 0
+      } else {
+        MinMaxSize t = args[1]->compute_size();
+        if (args[0]->tp == te_IntConst) {
+          t.repeat(args[0]->value);
+          return t;
+        }
+        if (z & 1) {
+          t.clear_min();  // zero repetition count possible
+        }
+        if (z & 12) {
+          // may be repeated more than once
+          int n = ((z & 1) ? 0 : ((z & 2) ? 1 : 2));  // minimal value of repetition count
+          t.repeat_at_least(n);                       // repetition count >= n
+        }
+        return t;
+      }
+    }
+    case te_Apply: {
+      if (args.size() == 1 && args[0]->tp == te_IntConst) {
+        int n = args[0]->value;
+        if (type_applied == NatWidth_type || type_applied == Int_type || type_applied == UInt_type ||
+            type_applied == Bits_type) {
+          return MinMaxSize::fixed_size(std::min(n, 2047));
+        } else if (type_applied == NatLeq_type) {
+          return MinMaxSize::fixed_size(32 - td::count_leading_zeroes32(n));
+        } else if (type_applied == NatLess_type) {
+          return MinMaxSize::fixed_size(n ? 32 - td::count_leading_zeroes32(n - 1) : 2047);
+        }
+      }
+      return type_applied->size;
+    }
+  }  // end switch
+  return {};
+}
+
+bool TypeExpr::compute_any_bits() const {
+  if (is_nat) {
+    return true;
+  }
+  switch (tp) {
+    case te_Type:
+      return true;
+    case te_Param:
+      return false;
+    case te_Ref:
+      return true;
+    case te_Tuple:
+    case te_CondType: {
+      assert(args.size() == 2);
+      int z = args[0]->abstract_interpret_nat();
+      if (!(z & ~1)) {
+        return true;  // always 0
+      } else {
+        return args[1]->compute_any_bits();
+      }
+    }
+    case te_Apply: {
+      if (args.size() == 1 && args[0]->tp == te_IntConst) {
+        int n = args[0]->value;
+        if (type_applied == NatLeq_type) {
+          return !(n & (n + 1));
+        } else if (type_applied == NatLess_type) {
+          return !(n & (n - 1));
+        }
+      }
+      return type_applied->any_bits;
+    }
+  }  // end switch
+  return false;
+}
+
+int TypeExpr::is_integer() const {
+  if (is_nat) {
+    return 1;
+  }
+  if (tp != te_Apply) {
+    return 0;
+  }
+  const Type* ta = type_applied;
+  if (ta == Int_type) {
+    return -1;
+  } else if (ta == UInt_type) {
+    return 1;
+  }
+  if (ta->is_bool) {
+    return 1;
+  }
+  if (ta->is_builtin) {
+    return ta->is_integer;
+  }
+  return 0;
+}
+
+bool TypeExpr::is_ref_to_anon() const {
+  return tp == te_Ref && args.at(0)->is_anon();
+}
+
+bool TypeExpr::is_anon() const {
+  return tp == te_Apply && args.empty() && type_applied->is_anon;
+}
+
+unsigned long long TypeExpr::compute_hash() const {
+  unsigned long long h = tp * 17239ULL + value * 23917ULL + 1;
+  if (type_applied) {
+    h += 239017 * type_applied->type_idx;
+  }
+  for (const TypeExpr* arg : args) {
+    h *= 170239;
+    if (!arg->negated) {
+      h += arg->is_constexpr;
+    }
+  }
+  return h;
+}
+
+bool TypeExpr::detect_constexpr() {
+  if (is_constexpr) {
+    return true;
+  }
+  bool c = !negated;
+  for (TypeExpr* arg : args) {
+    if (!arg->detect_constexpr() && !arg->negated) {
+      c = false;
+    }
+  }
+  if (!c || tp == te_Param) {
+    return false;
+  }
+  unsigned long long hash = compute_hash();
+  unsigned long long h1 = hash % const_htable_size, h2 = 1 + hash % (const_htable_size + 1);
+  while (const_htable[h1]) {
+    TypeExpr* other = const_htable[h1];
+    if (other->tp == tp && other->value == value && other->type_applied == type_applied &&
+        other->args.size() == args.size()) {
+      bool match = true;
+      for (std::size_t i = 0; i < args.size(); i++) {
+        if (other->args[i]->negated != args[i]->negated || other->args[i]->is_constexpr != args[i]->is_constexpr) {
+          match = false;
+          break;
+        }
+      }
+      if (match) {
+        is_constexpr = other->is_constexpr;
+        assert(is_constexpr);
+        return true;
+      }
+    }
+    h1 += h2;
+    if (h1 >= const_htable_size) {
+      h1 -= const_htable_size;
+    }
+  }
+  assert(const_type_expr_num < max_const_expr - 1);
+  const_type_expr[is_constexpr = ++const_type_expr_num] = this;
+  const_htable[h1] = this;
+  return true;
+}
+
+void TypeExpr::const_type_name(std::ostream& os) const {
+  if (negated) {
+    return;
+  }
+  switch (tp) {
+    case te_Type:
+      os << "_Type";
+      return;
+    case te_Param:
+      return;
+    case te_Add:
+      args[0]->const_type_name(os);
+      os << "_plus";
+      args[1]->const_type_name(os);
+      return;
+    case te_GetBit:
+      args[0]->const_type_name(os);
+      os << "_bit";
+      args[1]->const_type_name(os);
+      return;
+    case te_IntConst:
+      os << "_" << value;
+      return;
+    case te_MulConst:
+      os << "_mul" << value;
+      return;
+    case te_Ref:
+      os << "_Ref";
+      args[0]->const_type_name(os);
+      return;
+    case te_Tuple:
+      os << "_tuple";
+      args[0]->const_type_name(os);
+      args[1]->const_type_name(os);
+      return;
+    case te_CondType:
+      os << "_if";
+      args[0]->const_type_name(os);
+      args[1]->const_type_name(os);
+      return;
+    case te_Apply:
+      os << '_';
+      if (type_applied->produces_nat) {
+        if (type_applied == Nat_type) {
+          os << "nat";
+        } else if (type_applied == NatWidth_type) {
+          os << "natwidth";
+        } else if (type_applied == NatLeq_type) {
+          os << "natleq";
+        } else if (type_applied == NatLess_type) {
+          os << "natless";
+        }
+      } else {
+        os << type_applied->get_name();
+      }
+      for (const TypeExpr* arg : args) {
+        arg->const_type_name(os);
+      }
+      return;
+  }
+}
+
+bool TypeExpr::bind_value(bool value_negated, Constructor& cs, bool checking_type) {
+  // if checking_type == false:
+  //   negated = false, value_negated = false: compute expression, compare to value (only for integers)
+  //   negated = false, value_negated = true: compute expression, return it to the "value"
+  //   negated = true, value_negated = false: assign the value to the expression to compute some of the variables present in the expression
+  // if checking_type == true:
+  //   value_negated must be false
+  /* (debug output)
+  std::cerr << "binding " << (value_negated ? "negative" : "positive") << " value to expression " << (checking_type ? "of type " : ""); 
+  show(std::cerr, &cs); 
+  std::cerr << std::endl;
+  */
+  if (!checking_type) {
+    no_tchk();
+  } else {
+    if (is_nat) {
+      throw src::ParseError{where, "cannot use check a type against an integer expression"};
+    }
+    if (value_negated) {
+      throw src::ParseError{where, "cannot compute a value knowing only its type"};
+    }
+  }
+  if (negated && value_negated) {
+    // both the expression and the value cannot be negative
+    throw src::ParseError{where, "expression has wrong polarity"};
+  }
+  if (!is_nat) {
+    // for type expressions:
+    if (value_negated) {
+      // cannot "return" values that are not integer (i.e. types)
+      // throw src::ParseError{where, "cannot assign or return type expressions"};
+      // in reality, this check should be only when parsing type parameters after constructors
+    }
+    if (!checking_type) {
+      // "true" equality/assignment of type expressions
+      if (!negated && !value_negated) {
+        if (tp == te_Apply && args.empty()) {
+          throw src::ParseError{where, "use of a global type or an undeclared variable"};
+        } else {
+          throw src::ParseError{where, "cannot check type expressions for equality"};
+        }
+      }
+      // available only if the expression is a free variable
+      if (negated && tp != te_Param) {
+        throw src::ParseError{where, "types can be assigned only to free type variables"};
+      }
+    }
+  }
+  switch (tp) {
+    case te_Add: {
+      assert(is_nat && args.size() == 2 && !(args[0]->negated && args[1]->negated));
+      assert(negated == (args[0]->negated || args[1]->negated));
+      int i = args[0]->negated;
+      args[i]->bind_value(negated, cs);
+      args[1 - i]->bind_value(false, cs);
+      return true;
+    }
+    case te_IntConst: {
+      assert(is_nat && !negated);
+      return true;
+    }
+    case te_MulConst: {
+      assert(is_nat && args.size() == 1 && value > 0);
+      assert(negated == args[0]->negated);
+      args[0]->bind_value(value_negated, cs);
+      return true;
+    }
+    case te_GetBit: {
+      assert(is_nat && args.size() == 2 && !args[0]->negated && !args[1]->negated);
+      assert(!negated);
+      args[0]->bind_value(false, cs);
+      args[1]->bind_value(false, cs);
+      return true;
+    }
+    case te_Type: {
+      assert(!is_nat && !negated);
+      return true;
+    }
+    case te_Param: {
+      assert(value >= 0 && value < cs.fields_num);
+      Field& field = cs.fields.at(value);
+      if (!negated || checking_type) {
+        if (!field.known) {
+          throw src::ParseError{where,
+                                std::string{"variable `"} + field.get_name() + "` used before being assigned to"};
+        } else {
+          field.used = true;
+        }
+      } else if (!field.known) {
+        field.known = true;
+        // where.show_note(std::string{"variable `"} + field.get_name() + "` is assigned a value here");
+      }
+      return true;
+    }
+    case te_Apply:
+      if (type_applied == Eq_type) {
+        assert(args.size() == 2 && !(args[0]->negated && args[1]->negated));
+        assert(negated == (args[0]->negated || args[1]->negated));
+        int i = args[0]->negated;
+        args[i]->bind_value(negated, cs);
+        args[1 - i]->bind_value(false, cs);
+        return true;
+      } else {
+        assert(!negated || checking_type);
+        for (TypeExpr* arg : args) {
+          if (!arg->negated) {
+            arg->bind_value(true, cs);
+          }
+        }
+        for (TypeExpr* arg : args) {
+          if (arg->negated) {
+            arg->bind_value(false, cs);
+          }
+        }
+        return true;
+      }
+    case te_CondType:
+    case te_Tuple: {
+      assert(args.size() == 2);
+      assert(!negated && !args[0]->negated && !args[1]->negated);
+      assert(args[0]->is_nat);
+      assert(!args[1]->is_nat);
+      args[0]->bind_value(true, cs);
+      args[1]->bind_value(true, cs);
+      return true;
+    }
+    case te_Ref: {
+      assert(args.size() == 1);
+      return args[0]->bind_value(value_negated, cs, checking_type);
+    }
+    default:
+      throw src::ParseError{where, "cannot bind a value to an expression of unknown sort"};
+  }
+  return true;
+}
+
+void parse_implicit_param(Lexer& lex, Constructor& cs) {
+  // ident : # or ident : Type
+  if (lex.tp() != src::_Ident) {
+    lex.expect(src::_Ident);
+  }
+  Field& field = cs.new_field(lex.cur().loc, true, lex.cur().val);
+  lex.next();
+  lex.expect(':');
+  if (lex.tp() != src::_Type && (lex.tp() != src::_Ident || lex.cur().val != Nat_name)) {
+    throw src::ParseError{lex.cur().loc, "either `Type` or `#` implicit parameter type expected"};
+  }
+  if (lex.tp() == src::_Type) {
+    field.type = &type_Type;
+  } else {
+    field.type = TypeExpr::mk_apply_empty(lex.cur().loc, Nat_name, Nat_type);
+    assert(Nat_type->produces_nat);
+    assert(!Nat_type->arity);
+    assert(field.type->is_nat_subtype);
+  }
+  lex.next();
+  field.register_sym();
+}
+
+sym::SymDef* register_new_type(const src::SrcLocation& loc, sym_idx_t name) {
+  // unknown identifier, declare new type
+  if (!sym::is_uc_ident(name)) {
+    throw src::ParseError{loc, std::string{"implicitly defined type `"} + sym::symbols.get_name(name) +
+                                   "` must begin with an uppercase letter"};
+  }
+  sym::SymDef* sym_def = sym::define_global_symbol(name, true, loc);
+  assert(sym_def);
+  types.emplace_back(types_num++, name);
+  sym_def->value = new SymValType{&types.back()};
+  return sym_def;
+}
+
+void show_tag(std::ostream& os, unsigned long long tag) {
+  if (!tag) {
+    return;
+  }
+  if (!(tag & ((1ULL << 59) - 1))) {
+    os << '$';
+    int c = 0;
+    while (tag & ((1ULL << 63) - 1)) {
+      os << (tag >> 63);
+      tag <<= 1;
+      ++c;
+    }
+    if (!c) {
+      os << '_';
+    }
+  } else {
+    os << '#';
+    while (tag & ((1ULL << 63) - 1)) {
+      static const char hex_digits[] = "0123456789abcdef";
+      os << hex_digits[tag >> 60];
+      tag <<= 4;
+    }
+    if (!tag) {
+      os << '_';
+    }
+  }
+}
+
+void Constructor::show(std::ostream& os, int mode) const {
+  if (mode & 4) {
+    os << '[';
+  } else {
+    os << sym::symbols.get_name(constr_name);
+  }
+  if (!(mode & 8)) {
+    show_tag(os, tag);
+  }
+  for (const Field& field : fields) {
+    os << ' ';
+    if (field.implicit || field.constraint) {
+      if (!(mode & 2)) {
+        os << '{';
+      }
+      if (field.name) {
+        os << field.get_name() << ':';
+      }
+      field.type->show(os, this, 0, mode & ~1);
+      if (!(mode & 2)) {
+        os << '}';
+      }
+    } else {
+      if (field.name) {
+        os << field.get_name() << ':';
+      }
+      field.type->show(os, this, 95, mode & ~1);
+    }
+  }
+  if (mode & 4) {
+    os << " ]";
+    return;
+  }
+  os << " = ";
+  if (type_defined) {
+    type_defined->print_name(os);
+  } else {
+    os << sym::symbols.get_name(type_name);
+  }
+  for (int i = 0; i < type_arity; i++) {
+    os << ' ';
+    if (param_negated.at(i)) {
+      os << '~';
+    }
+    params.at(i)->show(os, this, 100, mode | 1);
+  }
+  if (!(mode & 2)) {
+    os << ';';
+  }
+}
+
+unsigned long long Constructor::compute_tag() const {
+  std::ostringstream os;
+  show(os, 10);
+  unsigned crc = td::crc32(td::Slice{os.str()});
+  if (verbosity > 2) {
+    std::cerr << "crc32('" << os.str() << "') = " << std::hex << crc << std::dec << std::endl;
+  }
+  return ((unsigned long long)crc << 32) | 0x80000000;
+}
+
+bool Constructor::compute_is_fwd() {
+  if (constr_name || tag_bits || type_arity || fields_num != 1) {
+    return is_fwd = false;
+  }
+  return is_fwd = (!fields[0].implicit && !fields[0].constraint);
+}
+
+bool show_tag_warnings;
+
+void Constructor::check_assign_tag() {
+  if (constr_name && (!tag || (tag & (1ULL << 63)) == (1ULL << 63))) {
+    unsigned long long computed_tag = compute_tag();
+    if (!tag) {
+      set_tag(computed_tag);
+      if (show_tag_warnings) {
+        std::ostringstream os;
+        os << "constructor `" << sym::symbols.get_name(type_name) << "::" << sym::symbols.get_name(constr_name)
+           << "` had no tag, assigned ";
+        show_tag(os, computed_tag);
+        where.show_warning(os.str());
+      }
+    } else if (tag != computed_tag && show_tag_warnings) {
+      std::ostringstream os;
+      os << "constructor `" << sym::symbols.get_name(type_name) << "::" << sym::symbols.get_name(constr_name)
+         << "` has explicit tag ";
+      show_tag(os, tag);
+      os << " different from its computed tag ";
+      show_tag(os, computed_tag);
+      where.show_warning(os.str());
+    }
+  } else if (!constr_name && !tag) {
+    set_tag(1ULL << 63);
+  }
+}
+
+void Type::bind_constructor(const src::SrcLocation& loc, Constructor* cs) {
+  if (is_final) {
+    throw src::ParseError{loc, std::string{"cannot add new constructor `"} + sym::symbols.get_name(cs->constr_name) +
+                                   "` to a finalized type `" + sym::symbols.get_name(type_name) + "`"};
+  }
+  if (arity < 0) {
+    arity = cs->type_arity;
+    assert(arity >= 0);
+    args.resize(arity, 0);
+  } else {
+    if (arity != cs->type_arity) {
+      throw src::ParseError{loc, std::string{"parametrized type `"} + sym::symbols.get_name(type_name) +
+                                     "` redefined with different arity"};
+    }
+  }
+  assert(arity == cs->type_arity && arity == (int)cs->params.size() && cs->params.size() == cs->param_negated.size());
+  int true_params = 0;
+  for (int i = 0; i < arity; i++) {
+    auto expr = cs->params.at(i);
+    bool negated = cs->param_negated.at(i);
+    int& x = args[i];
+    x |= (expr->is_nat ? _IsNat : _IsType);
+    if ((x & (_IsNat | _IsType)) == (_IsNat | _IsType)) {
+      throw src::ParseError{expr->where, std::string{"formal parameter to type `"} + sym::symbols.get_name(type_name) +
+                                             "` has incorrect type"};
+    }
+    x |= (negated ? _IsNeg : _IsPos);
+    if ((x & (_IsPos | _IsNeg)) == (_IsPos | _IsNeg)) {
+      throw src::ParseError{expr->where, std::string{"formal parameter to type `"} + sym::symbols.get_name(type_name) +
+                                             "` has incorrect polarity"};
+    }
+    if (cs->param_const_val.at(i) < 0) {
+      x |= _NonConst;
+    }
+    true_params += !negated;
+  }
+  assert(cs->fields_num >= 0 && (long long)cs->fields_num == (long long)cs->fields.size());
+  int explicit_fields = 0;
+  for (Field& field : cs->fields) {
+    if (field.constraint) {
+      field.type->bind_value(false, *cs, true);
+      field.known = true;
+    } else if (!field.implicit) {
+      ++explicit_fields;
+      field.type->bind_value(false, *cs, true);
+      if (!field.known) {
+        // field.loc.show_note(std::string{"variable `"} + field.get_name() + "` is assigned a value here");
+      }
+      field.known = true;
+    }
+  }
+  cs->is_enum = !explicit_fields;
+  cs->is_simple_enum = (cs->is_enum && !true_params);
+  for (int i = 0; i < arity; i++) {
+    auto expr = cs->params[i];
+    bool negated = cs->param_negated[i];
+    if (negated) {
+      expr->bind_value(true, *cs);
+    }
+  }
+  for (Field& field : cs->fields) {
+    if (!field.known) {
+      throw src::ParseError{field.loc, std::string{"field `"} + field.get_name() + "` is left unbound"};
+    }
+  }
+  if (cs->constr_name) {
+    for (auto c : constructors) {
+      if (c->constr_name == cs->constr_name) {
+        std::string tname = sym::symbols.get_name(type_name);
+        std::string cname = tname + "::" + sym::symbols.get_name(cs->constr_name);
+        c->where.show_note(std::string{"constructor `"} + cname + "` first defined here");
+        throw src::ParseError{cs->where, std::string{"constructor `"} + cname + "` redefined"};
+      }
+    }
+  }
+  if (!cs->type_defined && cs->type_name == type_name) {
+    cs->type_defined = this;
+  }
+  cs->check_assign_tag();
+  cs->compute_is_fwd();
+  is_enum &= cs->is_enum;
+  is_simple_enum &= cs->is_simple_enum;
+  if (constr_num && (is_special != cs->is_special)) {
+    throw src::ParseError{cs->where, std::string{"type `"} + sym::symbols.get_name(type_name) +
+                                         "` has mixed special and non-special constructors"};
+  }
+  is_special = cs->is_special;
+  ++(constr_num);
+  constructors.push_back(cs);
+}
+
+bool Type::unique_constructor_equals(const Constructor& cs, bool allow_other_names) const {
+  return constr_num == 1 && constructors.at(0)->isomorphic_to(cs, allow_other_names);
+}
+
+bool Constructor::isomorphic_to(const Constructor& cs, bool allow_other_names) const {
+  if (constr_name != cs.constr_name || tag != cs.tag || fields_num != cs.fields_num || type_arity != cs.type_arity ||
+      params.size() != cs.params.size()) {
+    return false;
+  }
+  for (int i = 0; i < fields_num; i++) {
+    if (!fields.at(i).isomorphic_to(cs.fields.at(i), allow_other_names)) {
+      return false;
+    }
+  }
+  for (std::size_t i = 0; i < params.size(); i++) {
+    if (!params.at(i)->equal(*cs.params.at(i))) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool Field::isomorphic_to(const Field& f, bool allow_other_names) const {
+  if (f.field_idx != field_idx || f.implicit != implicit || f.constraint != constraint ||
+      (!allow_other_names && f.name != name)) {
+    return false;
+  }
+  return f.type->equal(*type);
+}
+
+/*
+ * 
+ *  TL-B SOURCE PARSER
+ * 
+ */
+
+void parse_field_list(Lexer& lex, Constructor& cs);
+
+TypeExpr* parse_anonymous_constructor(Lexer& lex, Constructor& cs) {
+  sym::open_scope(lex);
+  Constructor* cs2 = new Constructor(lex.cur().loc);  // anonymous constructor
+  parse_field_list(lex, *cs2);
+  if (lex.tp() != ']') {
+    lex.expect(']');
+  }
+  cs2->set_tag(1ULL << 63);
+  for (int i = builtin_types_num; i < types_num; i++) {
+    if (types.at(i).is_auto && types[i].is_final && types[i].unique_constructor_equals(*cs2)) {
+      sym::close_scope(lex);
+      if (types[i].parent_type_idx >= 0) {
+        types[i].parent_type_idx = -2;
+      }
+      delete cs2;
+      return TypeExpr::mk_apply_empty(lex.cur().loc, 0, &types[i]);
+    }
+  }
+  types.emplace_back(types_num++, 0);
+  Type* type = &types.back();  // anonymous type
+  type->bind_constructor(lex.cur().loc, cs2);
+  type->is_final = true;
+  type->is_auto = true;
+  type->is_anon = true;
+  type->renew_last_declared();
+  sym::close_scope(lex);
+  return TypeExpr::mk_apply_empty(lex.cur().loc, 0, type);
+}
+
+TypeExpr* parse_expr(Lexer& lex, Constructor& cs, int mode);
+
+// ( E ) | [ {field-def} ] | id | ~id | num | ^T
+TypeExpr* parse_term(Lexer& lex, Constructor& cs, int mode) {
+  if (lex.tp() == '(') {
+    lex.next();
+    TypeExpr* expr = parse_expr(lex, cs, mode);
+    expr->check_mode(lex.cur().loc, mode);
+    lex.expect(')');
+    return expr;
+  }
+  if (lex.tp() == src::_Number) {
+    TypeExpr* expr = TypeExpr::mk_intconst(lex.cur().loc, lex.cur().str);
+    expr->check_mode(lex.cur().loc, mode);
+    lex.next();
+    return expr;
+  }
+  if (lex.tp() == '[') {
+    lex.next();
+    TypeExpr* expr = parse_anonymous_constructor(lex, cs);
+    expr->check_mode(lex.cur().loc, mode);
+    lex.expect(']');
+    return expr;
+  }
+  if (lex.tp() == '^') {
+    src::SrcLocation loc = lex.cur().loc;
+    lex.next();
+    TypeExpr* expr = parse_term(lex, cs, mode & ~2);
+    expr->close(lex.cur().loc);
+    if (expr->is_nat) {
+      throw src::ParseError{loc, "cannot create a cell reference type to a natural number"};
+    }
+    return TypeExpr::mk_cellref(loc, expr);
+  }
+  bool negate = false;
+  if (lex.tp() == '~') {
+    lex.next();
+    if (lex.tp() != src::_Ident) {
+      lex.expect(src::_Ident, "field identifier");
+    }
+    negate = true;
+  }
+  if (lex.tp() == src::_Ident) {
+    sym_idx_t name = lex.cur().val;
+    sym::SymDef* sym_def = sym::lookup_symbol(name);
+    if (!sym_def) {
+      if (negate) {
+        throw src::ParseError{lex.cur().loc, "field identifier expected"};
+      }
+      sym_def = register_new_type(lex.cur().loc, name);
+      if (verbosity > 2) {
+        std::cerr << "implicitly defined new type `" << sym::symbols.get_name(name) << "`" << std::endl;
+      }
+    }
+    if (!sym_def->value) {
+      throw src::ParseError{lex.cur().loc, "global symbol has no value"};
+    }
+    if (sym_def->value->type == sym::SymValBase::_Typename) {
+      // found a global type identifier
+      if (negate) {
+        throw src::ParseError{lex.cur().loc, "cannot negate a type"};
+      }
+      SymValType* svt = dynamic_cast<SymValType*>(sym_def->value);
+      assert(svt && svt->type_ref);
+      (svt->type_ref->used)++;
+      auto res = TypeExpr::mk_apply_empty(lex.cur().loc, name, svt->type_ref);
+      lex.next();
+      return res;
+    }
+    SymVal* sym_val = dynamic_cast<SymVal*>(sym_def->value);
+    if (sym_def->value->type != sym::SymValBase::_Param || !sym_val) {
+      throw src::ParseError{lex.cur().loc, "field identifier expected"};
+    }
+    if (sym_def->level != sym::scope_level) {
+      throw src::ParseError{lex.cur().loc, std::string{"cannot access field `"} + lex.cur().str + "` from outer scope"};
+    }
+    int i = sym_val->idx;
+    assert(i >= 0 && i < cs.fields_num);
+    auto res = new TypeExpr{lex.cur().loc, TypeExpr::te_Param, i};
+    auto field_type = cs.fields[i].type;
+    assert(field_type);
+    if ((mode & 4) && !cs.fields[i].known) {
+      // auto-negate, used for parsing type parameters in constructor RHS
+      negate = true;
+    }
+    res->is_nat = field_type->is_nat_subtype;
+    // std::cerr << "using field " << lex.cur().str << "; is_nat_subtype = " << res->is_nat << std::endl;
+    if (!res->is_nat && field_type->tp != TypeExpr::te_Type) {
+      throw src::ParseError{lex.cur().loc,
+                            "cannot use a field in an expression unless it is either an integer or a type"};
+    }
+    if (negate && !cs.fields[i].implicit) {
+      throw src::ParseError{lex.cur().loc, "cannot negate an explicit field"};
+    }
+    res->negated = negate;
+    res->check_mode(lex.cur().loc, mode);
+    lex.next();
+    return res;
+  } else {
+    lex.expect(src::_Ident, "type identifier");
+    return nullptr;
+  }
+}
+
+// E[.E]
+TypeExpr* parse_expr97(Lexer& lex, Constructor& cs, int mode) {
+  TypeExpr* expr = parse_term(lex, cs, mode | 3);
+  if (lex.tp() == '.') {
+    src::SrcLocation where = lex.cur().loc;
+    expr->close(lex.cur().loc);
+    // std::cerr << "parse ., mode " << mode << std::endl;
+    if (!(mode & 2)) {
+      throw src::ParseError{where, "bitfield expression cannot be used instead of a type expression"};
+    }
+    if (!expr->is_nat) {
+      throw src::ParseError{where, "cannot apply bit selection operator `.` to types"};
+    }
+    lex.next();
+    TypeExpr* expr2 = parse_term(lex, cs, mode & ~1);
+    expr2->close(lex.cur().loc);
+    if (expr->negated || expr2->negated) {
+      throw src::ParseError{where, "cannot apply bit selection operator `.` to values of negative polarity"};
+    }
+    expr = TypeExpr::mk_apply(where, TypeExpr::te_GetBit, expr, expr2);
+  }
+  expr->check_mode(lex.cur().loc, mode);
+  return expr;
+}
+
+// E ? E [ : E ]
+TypeExpr* parse_expr95(Lexer& lex, Constructor& cs, int mode) {
+  TypeExpr* expr = parse_expr97(lex, cs, mode | 3);
+  if (lex.tp() != '?') {
+    expr->check_mode(lex.cur().loc, mode);
+    return expr;
+  }
+  src::SrcLocation where = lex.cur().loc;
+  expr->close(where);
+  if (!expr->is_nat) {
+    throw src::ParseError{where, "cannot apply `?` with non-integer selectors"};
+  }
+  lex.next();
+  TypeExpr* expr2 = parse_term(lex, cs, mode & ~10);
+  expr2->close(lex.cur().loc);
+  expr2->no_tchk();
+  expr = TypeExpr::mk_apply(where, TypeExpr::te_CondType, expr, expr2);
+  expr->check_mode(lex.cur().loc, mode);
+  return expr;
+}
+
+// E E
+TypeExpr* parse_expr90(Lexer& lex, Constructor& cs, int mode) {
+  TypeExpr* expr = parse_expr95(lex, cs, mode | 3);
+  while (lex.tp() == '(' || lex.tp() == src::_Ident || lex.tp() == src::_Number || lex.tp() == '~' || lex.tp() == '^' ||
+         lex.tp() == '[') {
+    TypeExpr* expr2 = parse_expr95(lex, cs, mode | 3);
+    expr2->close(lex.cur().loc);
+    expr = TypeExpr::mk_apply_gen(lex.cur().loc, expr, expr2);
+  }
+  expr->check_mode(lex.cur().loc, mode);
+  return expr;
+}
+
+// E * E
+TypeExpr* parse_expr30(Lexer& lex, Constructor& cs, int mode) {
+  TypeExpr* expr = parse_expr90(lex, cs, mode);
+  while (lex.tp() == '*') {
+    src::SrcLocation where = lex.cur().loc;
+    expr->close(lex.cur().loc);
+    if (!expr->is_nat) {
+      throw src::ParseError{where, "cannot apply `*` to types"};
+    }
+    lex.next();
+    TypeExpr* expr2 = parse_expr90(lex, cs, mode);
+    expr2->close(lex.cur().loc);
+    if (expr2->is_nat) {
+      expr = TypeExpr::mk_mulint(where, expr, expr2);
+    } else {
+      expr2->no_tchk();
+      expr = TypeExpr::mk_apply(where, TypeExpr::te_Tuple, expr, expr2);
+    }
+  }
+  expr->check_mode(lex.cur().loc, mode);
+  return expr;
+}
+
+// E + E
+TypeExpr* parse_expr20(Lexer& lex, Constructor& cs, int mode) {
+  TypeExpr* expr = parse_expr30(lex, cs, mode);
+  while (lex.tp() == '+') {
+    src::SrcLocation where = lex.cur().loc;
+    expr->close(lex.cur().loc);
+    // std::cerr << "parse +, mode " << mode << std::endl;
+    if (!(mode & 2)) {
+      throw src::ParseError{where, "sum cannot be used instead of a type expression"};
+    }
+    if (!expr->is_nat) {
+      throw src::ParseError{where, "cannot apply `+` to types"};
+    }
+    lex.next();
+    TypeExpr* expr2 = parse_expr30(lex, cs, mode & ~1);
+    expr2->close(lex.cur().loc);
+    if (expr->negated && expr2->negated) {
+      throw src::ParseError{where, "cannot add two values of negative polarity"};
+    }
+    bool negated = expr->negated | expr2->negated;
+    expr = TypeExpr::mk_apply(where, TypeExpr::te_Add, expr, expr2);
+    expr->negated = negated;
+  }
+  expr->check_mode(lex.cur().loc, mode);
+  return expr;
+}
+
+// E | E = E | E <= E | E < E | E >= E | E > E
+TypeExpr* parse_expr10(Lexer& lex, Constructor& cs, int mode) {
+  TypeExpr* expr = parse_expr20(lex, cs, mode | 3);
+  int op = lex.tp();
+  if (!(op == '=' || op == '<' || op == '>' || op == src::_Leq || op == src::_Geq)) {
+    expr->check_mode(lex.cur().loc, mode);
+    return expr;
+  }
+  // std::cerr << "parse <=>, mode " << mode << std::endl;
+  sym_idx_t op_name = lex.cur().val;
+  src::SrcLocation where = lex.cur().loc;
+  expr->close(where);
+  if (!(mode & 1)) {
+    throw src::ParseError{where, "comparison result used as an integer"};
+  }
+  if (!expr->is_nat) {
+    throw src::ParseError{where, "cannot apply integer comparison to types"};
+  }
+  lex.next();
+  TypeExpr* expr2 = parse_expr20(lex, cs, (mode & ~1) | 2);
+  expr2->close(lex.cur().loc);
+  if (!expr2->is_nat) {
+    throw src::ParseError{lex.cur().loc, "cannot apply integer comparison to types"};
+  }
+  if (op == '>') {
+    std::swap(expr, expr2);
+    op = '<';
+    op_name = Less_name;
+  } else if (op == src::_Geq) {
+    std::swap(expr, expr2);
+    op = src::_Leq;
+    op_name = Leq_name;
+  }
+  auto sym_def = sym::lookup_symbol(op_name, 2);
+  assert(sym_def);
+  auto sym_val = dynamic_cast<SymValType*>(sym_def->value);
+  assert(sym_val);
+  auto expr0 = TypeExpr::mk_apply_empty(where, op_name, sym_val->type_ref);
+  expr = TypeExpr::mk_apply_gen(where, std::move(expr0), expr);
+  expr = TypeExpr::mk_apply_gen(lex.cur().loc, expr, std::move(expr2));
+  expr->check_mode(lex.cur().loc, mode);
+  return expr;
+}
+
+TypeExpr* parse_expr(Lexer& lex, Constructor& cs, int mode) {
+  return parse_expr10(lex, cs, mode);
+}
+
+void parse_param(Lexer& lex, Constructor& cs, bool named) {
+  // [ ( ident | _ ) : ] type-expr
+  src::SrcLocation loc = lex.cur().loc;
+  if (named && lex.tp() == '_') {
+    lex.next();
+    lex.expect(':');
+    named = false;
+  }
+  sym_idx_t param_name = 0;
+  if (named) {
+    if (lex.tp() != src::_Ident) {
+      lex.expect(src::_Ident);
+    }
+    param_name = lex.cur().val;
+    lex.next();
+    lex.expect(':');
+  }
+  Field& field = cs.new_field(loc, false, param_name);
+  field.type = parse_expr95(lex, cs, 9);  // must be a type expression
+  field.type->close(lex.cur().loc);
+  field.type->detect_constexpr();
+  field.subrec = field.type->is_ref_to_anon();
+  CHECK(!field.name || !field.subrec);
+  field.register_sym();
+}
+
+void parse_constraint(Lexer& lex, Constructor& cs) {
+  Field& field = cs.new_field(lex.cur().loc, true, 0);
+  field.type = parse_expr(lex, cs, 9);  // must be a type expression
+  field.type->close(lex.cur().loc);
+  field.type->detect_constexpr();
+  field.constraint = true;
+  field.register_sym();
+}
+
+void parse_field_list(Lexer& lex, Constructor& cs) {
+  while (lex.tp() != '=' && lex.tp() != ']') {
+    if (lex.tp() == '{') {
+      // either an implicit parameter or a constraint
+      lex.next();
+      if (lex.tp() == src::_Ident && lex.peek().tp == ':') {
+        parse_implicit_param(lex, cs);
+      } else {
+        parse_constraint(lex, cs);
+      }
+      lex.expect('}');
+    } else if ((lex.tp() == src::_Ident || lex.tp() == '_') && lex.peek().tp == ':') {
+      parse_param(lex, cs, true);
+    } else {
+      parse_param(lex, cs, false);
+    }
+  }
+}
+
+void parse_constructor_def(Lexer& lex) {
+  if (lex.tp() != '_' && (lex.tp() != src::_Ident || !sym::is_lc_ident(lex.cur().val))) {
+    throw src::ParseError{lex.cur().loc, "constructor name lowercase identifier expected"};
+  }
+  bool is_special = sym::is_spec_lc_ident(lex.cur().val);
+  sym::open_scope(lex);
+  Lexem constr_lex = lex.cur();
+  int orig_types_num = types_num;
+  sym_idx_t constr_name = (lex.tp() == src::_Ident ? lex.cur().val : 0);
+  src::SrcLocation where = lex.cur().loc;
+  lex.next();
+  unsigned long long tag = 0;
+  if (lex.tp() == src::_Special) {
+    tag = src::get_special_value(lex.cur().str);
+    assert(tag);
+    lex.next();
+  }
+  //std::cerr << "parsing constructor `" << sym::symbols.get_name(constr_name) << "` with tag " << std::hex << tag
+  //          << std::dec << std::endl;
+  auto cs_ref = new Constructor(where, constr_name, 0, tag);
+  Constructor& cs = *cs_ref;
+  cs.is_special = is_special;
+  parse_field_list(lex, cs);
+  lex.expect('=');
+  if (lex.tp() != src::_Ident || !sym::is_uc_ident(lex.cur().val)) {
+    throw src::ParseError{lex.cur().loc, "type name uppercase identifier expected"};
+  }
+  Lexem type_lex = lex.cur();
+  sym_idx_t type_name = lex.cur().val;
+  sym::SymDef* sym_def = sym::lookup_symbol(type_name, 2);
+  if (!sym_def) {
+    sym_def = register_new_type(lex.cur().loc, type_name);
+    if (verbosity > 2) {
+      std::cerr << "defined new type `" << sym::symbols.get_name(type_name) << "`" << std::endl;
+    }
+    assert(sym_def);
+  }
+  if (!sym_def || !sym_def->value || sym_def->value->type != sym::SymValBase::_Typename) {
+    throw src::ParseError{lex.cur().loc, "parametrized type identifier expected"};
+  }
+  SymValType* sym_val = dynamic_cast<SymValType*>(sym_def->value);
+  assert(sym_val);
+  cs.type_name = type_name;
+  cs.type_arity = 0;
+  Type* type = cs.type_defined = sym_val->type_ref;
+  if (type->is_final) {
+    throw src::ParseError{lex.cur().loc,
+                          std::string{"cannot add new constructor to a finalized type `"} + lex.cur().str + "`"};
+  }
+  lex.next();
+  while (lex.tp() != ';') {
+    bool negate = (lex.tp() == '~');
+    if (negate) {
+      lex.next();
+    }
+    TypeExpr* type_param = parse_term(lex, cs, negate ? 3 : 7);
+    type_param->close(lex.cur().loc);
+    int const_val = (!negate && type_param->tp == TypeExpr::te_IntConst) ? type_param->value : -1;
+    if (!negate) {
+      //std::cerr << "binding value to type parameter expression ";
+      //type_param->show(std::cerr, &cs);
+      //std::cerr << std::endl;
+      type_param->bind_value(negate, cs);
+    } else if (!type_param->is_nat) {
+      throw src::ParseError{type_param->where, "cannot return type expressions"};
+    }
+    cs.params.push_back(type_param);
+    cs.param_negated.push_back(negate);
+    cs.param_const_val.push_back(const_val);
+    ++cs.type_arity;
+  }
+  if (lex.tp() != ';') {
+    lex.expect(';');
+  }
+  type->bind_constructor(lex.cur().loc, cs_ref);
+  type->renew_last_declared();
+  lex.expect(';');
+  sym::close_scope(lex);
+  for (int i = orig_types_num; i < types_num; i++) {
+    if (types.at(i).is_auto && types[i].parent_type_idx == -1) {
+      types[i].parent_type_idx = type->type_idx;
+    }
+  }
+}
+
+/*
+ * 
+ *  SOURCE PARSER (TOP LEVEL)
+ * 
+ */
+
+bool parse_source(std::istream* is, const src::FileDescr* fdescr) {
+  src::SourceReader reader{is, fdescr};
+  src::Lexer lex{reader, true, "(){}:;? #$. ^~ #", "//", "/*", "*/"};
+  while (lex.tp() != src::_Eof) {
+    parse_constructor_def(lex);
+    // std::cerr << lex.cur().str << '\t' << lex.cur().name_str() << std::endl;
+  }
+  return true;
+}
+
+bool parse_source_file(const char* filename) {
+  if (!filename || !*filename) {
+    throw src::Fatal{"source file name is an empty string"};
+  }
+  src::FileDescr* cur_source = new src::FileDescr{filename};
+  std::ifstream ifs{filename};
+  if (ifs.fail()) {
+    throw src::Fatal{std::string{"cannot open source file `"} + filename + "`"};
+  }
+  return parse_source(&ifs, cur_source);
+}
+
+bool parse_source_stdin() {
+  return parse_source(&std::cin, new src::FileDescr{"stdin", true});
+}
+
+/*
+ * 
+ *   BUILT-IN TYPE DEFINITIONS
+ * 
+ */
+
+Type* define_builtin_type(std::string name_str, std::string args, bool produces_nat, int size = -1, int min_size = -1,
+                          bool any_bits = false, int is_int = 0) {
+  sym_idx_t name = sym::symbols.lookup_add(name_str);
+  assert(name_str.size() && name);
+  int arity = (int)args.size();
+  types.emplace_back(types_num++, name, produces_nat, arity, true, true);
+  auto type = &types.back();
+  type->args.resize(arity, 0);
+  int f = (name_str != "#" ? Type::_IsPos : 0);
+  for (int i = 0; i < arity; i++) {
+    type->args[i] = f | (args[i] == '#' ? Type::_IsNat : Type::_IsType);
+  }
+  if (is_int) {
+    type->is_integer = (char)is_int;
+  }
+  auto sym_def = sym::define_global_symbol(name, true);
+  assert(sym_def);
+  sym_def->value = new SymValType{type};
+  if (size < 0) {
+    type->size = MinMaxSize::Any;
+  } else if (min_size >= 0 && min_size != size) {
+    type->size = MinMaxSize::size_range(min_size, size);
+  } else {
+    type->size = MinMaxSize::fixed_size(size);
+    type->has_fixed_size = true;
+  }
+  type->any_bits = any_bits;
+  return type;
+}
+
+Type* lookup_type(std::string name_str) {
+  sym_idx_t name = sym::symbols.lookup(name_str);
+  if (name) {
+    auto sym_def = sym::lookup_symbol(name);
+    if (sym_def) {
+      auto sym_val = dynamic_cast<SymValType*>(sym_def->value);
+      if (sym_val) {
+        return sym_val->type_ref;
+      }
+    }
+  }
+  return nullptr;
+}
+
+void define_builtins() {
+  types.reserve(10000);
+  Nat_type = define_builtin_type("#", "", true, 32, 32, true);
+  NatWidth_type = define_builtin_type("##", "#", true, 32, 0, true);
+  NatLess_type = define_builtin_type("#<", "#", true, 32, 0);
+  NatLeq_type = define_builtin_type("#<=", "#", true, 32, 0);
+  Any_type = define_builtin_type("Any", "", false);
+  Cell_type = define_builtin_type("Cell", "", false);
+  Int_type = define_builtin_type("int", "#", false, 257, 0, true, -1);
+  UInt_type = define_builtin_type("uint", "#", false, 256, 0, true, 1);
+  Bits_type = define_builtin_type("bits", "#", false, 1023, 0, true, 0);
+  for (int i = 1; i <= 257; i++) {
+    char buff[8];
+    sprintf(buff, "uint%d", i);
+    define_builtin_type(buff + 1, "", false, i, i, true, -1);
+    if (i < 257) {
+      define_builtin_type(buff, "", false, i, i, true, 1);
+    }
+  }
+  for (int i = 1; i <= 1023; i++) {
+    char buff[12];
+    sprintf(buff, "bits%d", i);
+    define_builtin_type(buff, "", false, i, i, true, 0);
+  }
+  Eq_type = define_builtin_type("=", "##", false, 0, 0, true);
+  Less_type = define_builtin_type("<", "##", false, 0, 0, true);
+  Leq_type = define_builtin_type("<=", "##", false, 0, 0, true);
+  Nat_name = sym::symbols.lookup("#");
+  Eq_name = sym::symbols.lookup("=");
+  Less_name = sym::symbols.lookup("<");
+  Leq_name = sym::symbols.lookup("<=");
+  builtin_types_num = types_num;
+}
+
+/*
+ * 
+ *  SCHEME PROCESSING AND CHECKING
+ * 
+ */
+
+bool Type::cons_all_exact() const {
+  unsigned long long sum = 0;
+  for (const auto& cons : constructors) {
+    sum += (1ULL << (63 - cons->tag_bits));
+  }
+  return sum == (1ULL << 63);
+}
+
+int Type::cons_common_len() const {
+  if (!constr_num) {
+    return -1;
+  }
+  int len = constructors.at(0)->tag_bits;
+  for (const auto cons : constructors) {
+    if (cons->tag_bits != len) {
+      return -1;
+    }
+  }
+  return len;
+}
+
+bool Constructor::compute_admissible_params() {
+  int dim = 0;
+  int abs_param[4];
+  for (std::size_t i = 0; i < params.size(); i++) {
+    if (!param_negated[i] && params[i]->is_nat) {
+      int t = params[i]->abstract_interpret_nat();
+      assert(t >= 0 && t <= 15);
+      // std::cerr << "abstract_interpret( " << params[i] << " ) = " << t << std::endl;
+      abs_param[dim++] = t;
+      if (!t) {
+        admissible_params.clear_all();
+        return false;
+      }
+      if (dim == 4) {
+        break;
+      }
+    }
+  }
+  while (dim > 0 && abs_param[dim - 1] == 15) {
+    --dim;
+  }
+  if (!dim) {
+    admissible_params.set_all();
+    return true;
+  }
+  admissible_params.set_by_pattern(dim, abs_param);
+  return true;
+}
+
+bool Type::compute_admissible_params() {
+  bool admissible = false;
+  for (Constructor* cs : constructors) {
+    admissible |= cs->compute_admissible_params();
+    admissible_params |= cs->admissible_params;
+  }
+  return admissible;
+}
+
+void compute_admissible_params() {
+  for (int i = builtin_types_num; i < types_num; i++) {
+    (void)types[i].compute_admissible_params();
+  }
+}
+
+bool Constructor::recompute_begins_with() {
+  for (const Field& field : fields) {
+    if (!field.implicit && !field.constraint) {
+      TypeExpr* expr = field.type;
+      if (expr->tp == TypeExpr::te_Ref) {
+        continue;
+      }
+      if (expr->tp != TypeExpr::te_Apply) {
+        break;
+      }
+      BitPfxCollection add = expr->type_applied->begins_with * tag;
+      return (begins_with += add);
+    }
+  }
+  BitPfxCollection add{tag};
+  if (begins_with == add) {
+    return false;
+  }
+  begins_with += add;
+  return true;
+}
+
+bool Type::recompute_begins_with() {
+  bool changes = false;
+  for (Constructor* cs : constructors) {
+    if (cs->recompute_begins_with()) {
+      changes |= (begins_with += cs->begins_with);
+    }
+  }
+  return changes;
+}
+
+void compute_begins_with() {
+  bool changes = true;
+  while (changes) {
+    changes = false;
+    for (int i = builtin_types_num; i < types_num; i++) {
+      changes |= types[i].recompute_begins_with();
+    }
+  }
+}
+
+bool Constructor::recompute_minmax_size() {
+  MinMaxSize sz = MinMaxSize::fixed_size(tag_bits);
+  for (const Field& field : fields) {
+    if (!field.implicit && !field.constraint) {
+      sz += field.type->compute_size();
+    }
+  }
+  if (sz == size) {
+    return false;
+  }
+  size = sz;
+  has_fixed_size = sz.is_fixed();
+  return true;
+}
+
+bool Type::recompute_minmax_size() {
+  MinMaxSize sz;
+  bool changes = false;
+  for (Constructor* cs : constructors) {
+    changes |= cs->recompute_minmax_size();
+    sz |= cs->size;
+  }
+  if (sz == size) {
+    return changes;
+  }
+  size = sz;
+  has_fixed_size = sz.is_fixed();
+  return true;
+}
+
+void compute_minmax_sizes() {
+  bool changes = true;
+  while (changes) {
+    changes = false;
+    for (int i = builtin_types_num; i < types_num; i++) {
+      changes |= types[i].recompute_minmax_size();
+    }
+  }
+}
+
+bool Constructor::recompute_any_bits() {
+  bool res = true;
+  for (const Field& field : fields) {
+    if (!field.implicit && !field.constraint) {
+      res &= field.type->compute_any_bits();
+    }
+  }
+  if (res == any_bits) {
+    return false;
+  }
+  any_bits = res;
+  return true;
+}
+
+bool Type::recompute_any_bits() {
+  bool res = begins_with.is_all();
+  bool changes = false;
+  for (Constructor* cs : constructors) {
+    changes |= cs->recompute_any_bits();
+    res &= cs->any_bits;
+  }
+  if (res == any_bits) {
+    return changes;
+  }
+  any_bits = res;
+  return true;
+}
+
+void compute_any_bits() {
+  bool changes = true;
+  while (changes) {
+    changes = false;
+    for (int i = builtin_types_num; i < types_num; i++) {
+      changes |= types[i].recompute_any_bits();
+    }
+  }
+}
+
+void Type::detect_basic_types() {
+  if (!arity && constr_num > 0 && size.is_fixed() && any_bits) {
+    is_unit = !size.min_size();
+    is_bool = (size.min_size() == 0x100);
+  }
+}
+
+void detect_basic_types() {
+  for (int i = builtin_types_num; i < types_num; i++) {
+    types[i].detect_basic_types();
+  }
+}
+
+int show_size_warnings() {
+  int errors = 0;
+  for (int i = builtin_types_num; i < types_num; i++) {
+    Type& type = types[i];
+    if (!type.size.fits_into_cell() || !type.size.is_possible()) {
+      std::cerr << "error: type `" << type.get_name() << "`"
+                << (!type.size.is_possible() ? " cannot be instantiated" : " never fits into a cell") << " (size "
+                << type.size << ")\n";
+      ++errors;
+    }
+    for (Constructor* cs : type.constructors) {
+      if (!cs->size.fits_into_cell() || !cs->size.is_possible()) {
+        std::cerr << "error: constructor `" << cs->get_qualified_name() << "`"
+                  << (!cs->size.is_possible() ? " cannot be instantiated" : " never fits into a cell") << " (size "
+                  << cs->size << ")\n";
+        cs->show(std::cerr);
+        std::cerr << std::endl;
+        cs->where.show_note("defined here");
+        ++errors;
+      }
+    }
+  }
+  return errors;
+}
+
+bool Type::is_const_arg(int p) const {
+  return (args.at(p) & (_IsType | _IsNat | _IsPos | _IsNeg | _NonConst)) == (_IsNat | _IsPos);
+}
+
+int Type::detect_const_params() {
+  for (int i = 0; i < arity; i++) {
+    if (is_const_arg(i)) {
+      return const_param_idx = i;
+    }
+  }
+  return const_param_idx = -1;
+}
+
+std::vector<int> Type::get_all_param_values(int p) const {
+  if (p < 0 || p >= arity) {
+    return {};
+  }
+  std::vector<int> res;
+  res.reserve(constr_num);
+  for (const Constructor* cs : constructors) {
+    res.push_back(cs->param_const_val.at(p));
+  }
+  std::sort(res.begin(), res.end());
+  res.erase(std::unique(res.begin(), res.end()), res.end());
+  return res;
+}
+
+std::vector<int> Type::get_constr_by_param_value(int p, int pv) const {
+  std::vector<int> res;
+  if (p < 0 || p >= arity) {
+    return res;
+  }
+  for (int i = 0; i < constr_num; i++) {
+    if (constructors[i]->param_const_val[p] == pv) {
+      res.push_back(i);
+    }
+  }
+  return res;
+}
+
+void Type::compute_constructor_trie() {
+  if (cs_trie || !constr_num) {
+    return;
+  }
+  unsigned long long z = 1;
+  for (Constructor* cs : constructors) {
+    if (!z) {
+      throw src::ParseError{cs->where,
+                            std::string{"cannot work with more than 64 constructors for type `"} + get_name() + "`"};
+    }
+    cs_trie = BinTrie::insert_paths(std::move(cs_trie), cs->begins_with, z);
+    z <<= 1;
+  }
+  if (cs_trie) {
+    useful_depth = cs_trie->compute_useful_depth();
+    is_pfx_determ = !cs_trie->find_conflict_path();
+  } else {
+    useful_depth = 0;
+    is_pfx_determ = true;
+  }
+}
+
+bool Type::check_conflicts() {
+  compute_constructor_trie();
+  int cp = detect_const_params();
+  is_param_pfx_determ = is_param_determ = is_determ = true;
+  is_const_param_determ = is_const_param_pfx_determ = (cp >= 0);
+  if (!constr_num || !cs_trie) {
+    return false;
+  }
+  assert(constr_num <= 64);
+  // std::cerr << "prefix trie for constructors of `" << get_name() << "`" << std::endl;
+  // cs_trie->show(std::cerr);
+  ConflictGraph pfx_cg;
+  cs_trie->set_conflict_graph(pfx_cg);
+  for (int i = 0; i < constr_num; i++) {
+    AdmissibilityInfo& ap1 = constructors[i]->admissible_params;
+    for (int j = 0; j < i; j++) {
+      bool cp_same = (constructors[i]->get_const_param(cp) == constructors[j]->get_const_param(cp));
+      if (cp_same) {
+        is_const_param_determ = false;
+        if (pfx_cg[i][j]) {
+          is_const_param_pfx_determ = false;
+        }
+      }
+      if (ap1.conflicts_with(constructors[j]->admissible_params)) {
+        is_param_determ = false;
+        if (pfx_cg[i][j]) {
+          is_param_pfx_determ = false;
+          if (cp_same) {
+            conflict1 = j;
+            conflict2 = i;
+            is_determ = false;
+          }
+        }
+      }
+    }
+  }
+  return !is_determ;
+}
+
+void Type::show_constructor_conflict() {
+  assert(cs_trie);
+  assert(conflict1 != conflict2);
+  int i = conflict1, j = conflict2;
+  assert(i >= 0 && i <= j && j < 64 && j < constr_num);
+  unsigned long long mask = (1ULL << i) | (1ULL << j);
+  unsigned long long pfx = cs_trie->find_conflict_path(0, mask);
+  assert(pfx);
+  ConflictSet cs_set{cs_trie->lookup_tag(pfx)};
+  std::cerr << "found conflict between constructors of type `" << get_name() << "`: prefix ";
+  show_tag(std::cerr, pfx);
+  AdmissibilityInfo& info1 = constructors[i]->admissible_params;
+  AdmissibilityInfo& info2 = constructors[j]->admissible_params;
+  bool need_params = !(info1.is_set_all() && info2.is_set_all());
+  int params = info1.conflicts_at(info2);
+  assert(params >= 0);
+  for (int s = 0; s < 64 && s < constr_num; s++) {
+    if (cs_set[s] &&
+        !(need_params ? constructors[s]->admissible_params[params] : constructors[s]->admissible_params.is_set_all())) {
+      cs_set.remove(s);
+    }
+  }
+  assert(cs_set[i] && cs_set[j]);
+  std::cerr << " can be present in " << cs_set.size() << " constructors:" << std::endl;
+  for (int s = 0; s < 64 && s < constr_num; s++) {
+    if (cs_set[s]) {
+      std::cerr << "\t";
+      constructors[s]->show(std::cerr);
+      std::cerr << std::endl;
+      constructors[s]->where.show_note("defined here");
+    }
+  }
+  if (need_params) {
+    std::cerr << "when type parameters are instantiated as " << get_name();
+    char nat = 'a', t = 'A';
+    for (int x : args) {
+      if (x & _IsNeg) {
+        std::cerr << " ~" << (x & _IsNat ? nat++ : t++);
+      } else if (x & _IsType) {
+        std::cerr << ' ' << t++;
+      } else {
+        std::cerr << ' ' << (params & 3);
+        if (params & 2) {
+          std::cerr << "+2*" << nat++;
+        }
+      }
+    }
+    std::cerr << std::endl;
+  }
+}
+
+int check_conflicts() {
+  int c = 0;
+  for (int i = builtin_types_num; i < types_num; i++) {
+    if (types[i].check_conflicts()) {
+      ++c;
+      types[i].show_constructor_conflict();
+    }
+  }
+  return c;
+}
+
+void check_scheme() {
+  compute_admissible_params();
+  compute_begins_with();
+  compute_minmax_sizes();
+  compute_any_bits();
+  detect_basic_types();
+  if (show_size_warnings()) {
+    throw src::Fatal{"invalid scheme: some constructors or types cannot be instantiated or do not fit into cells"};
+  }
+  if (check_conflicts()) {
+    throw src::Fatal{"invalid scheme: have conflicts between constructors of some types"};
+  }
+}
+
+void dump_all_types() {
+  std::cerr << types_num << " types defined, out of them " << builtin_types_num << " built-in, "
+            << types_num - builtin_types_num << " user-defined\n";
+  for (int i = 0; i < builtin_types_num; i++) {
+    Type& type = types[i];
+    if (type.used) {
+      std::cerr << "built-in type #" << i << ": `" << type.get_name() << "`, arity " << type.arity << "; prefixes "
+                << type.begins_with << "; size " << type.size;
+      if (type.is_unit) {
+        std::cerr << " (UNIT)";
+      }
+      if (type.is_bool) {
+        std::cerr << " (BOOL)";
+      }
+      std::cerr << std::endl;
+    }
+  }
+  for (int i = builtin_types_num; i < types_num; i++) {
+    Type& type = types[i];
+    std::cerr << "type #" << i << ": `" << type.get_name() << "`, arity " << type.arity << ", " << type.constr_num
+              << " constructors\n";
+    if (type.const_param_idx >= 0) {
+      std::cerr << "  constant parameters:";
+      for (int j = 0; j < type.arity; j++) {
+        std::cerr << (type.is_const_arg(j) ? " const" : " *");
+      }
+      std::cerr << std::endl;
+    }
+    for (Constructor* cs : type.constructors) {
+      std::cerr << "  constructor `" << cs->get_name() << "`" << (cs->is_fwd ? " (simple forwarder)\n\t" : "\n\t");
+      cs->show(std::cerr);
+      std::cerr << "\n\tbegins with " << cs->begins_with << std::endl;
+      if (!cs->admissible_params.is_set_all()) {
+        std::cerr << "\tadmissibility " << cs->admissible_params << std::endl;
+      }
+      if (type.const_param_idx >= 0) {
+        std::cerr << "\tconstant parameter #" << type.const_param_idx + 1 << " = "
+                  << cs->get_const_param(type.const_param_idx) << std::endl;
+      }
+      std::cerr << "\tsize " << cs->size << (cs->has_fixed_size ? " (fixed)" : "")
+                << (cs->any_bits ? " (any bits)" : "") << std::endl;
+      for (const Field& field : cs->fields) {
+        std::cerr << "\t\tfield `" << field.get_name() << "`: " << field.type << " (used=" << field.used
+                  << ") (is_nat_subtype=" << field.type->is_nat_subtype << ")\n";
+      }
+    }
+    if (type.is_unit) {
+      std::cerr << "  (UNIT)\n";
+    }
+    if (type.is_bool) {
+      std::cerr << "  (BOOL)\n";
+    }
+    if (type.is_enum) {
+      std::cerr << (type.is_simple_enum ? "  (SIMPLE ENUM)" : "  (ENUM)") << std::endl;
+    }
+    if (type.constr_num > 1) {
+      std::cerr << "  constructor detection: ";
+      if (type.is_pfx_determ) {
+        std::cerr << "PFX(" << type.useful_depth << ") ";
+      }
+      if (type.is_param_determ) {
+        std::cerr << "PARAM ";
+      }
+      if (type.is_const_param_determ) {
+        std::cerr << "CONST_PARAM ";
+      }
+      if (type.is_const_param_pfx_determ && !type.is_pfx_determ && !type.is_const_param_determ) {
+        std::cerr << "PFX(" << type.useful_depth << ")+CONST_PARAM ";
+      }
+      if (type.is_param_pfx_determ && !type.is_pfx_determ && !type.is_param_determ && !type.is_const_param_pfx_determ) {
+        std::cerr << "PFX(" << type.useful_depth << ")+PARAM ";
+      }
+      if (type.is_determ && !type.is_const_param_pfx_determ && !type.is_param_pfx_determ) {
+        std::cerr << "PFX(" << type.useful_depth << ")+CONST_PARAM+PARAM ";
+      }
+      if (!type.is_determ) {
+        std::cerr << "<CONFLICT>";
+      }
+      std::cerr << std::endl;
+    }
+    std::cerr << "  type size " << type.size << (type.has_fixed_size ? " (fixed)" : "")
+              << (type.any_bits ? " (any bits)" : "") << std::endl;
+    std::cerr << "  type begins with " << type.begins_with << std::endl;
+    if (!type.admissible_params.is_set_all()) {
+      std::cerr << "  type admissibility " << type.admissible_params << std::endl;
+    }
+    std::cerr << std::endl;
+    if (!type.constr_num && !type.is_final) {
+      sym::SymDef* sym_def = sym::lookup_symbol(type.type_name);
+      assert(sym_def);
+      throw src::ParseError{
+          sym_def ? sym_def->loc : src::SrcLocation{},
+          std::string{"implicitly defined type `"} + sym::symbols.get_name(type.type_name) + "` has no constructors"};
+    }
+  }
+}
+
+void dump_all_constexpr() {
+  std::cerr << "****************\n" << const_type_expr_num << " constant expressions:\n";
+  for (int i = 1; i <= const_type_expr_num; i++) {
+    std::cerr << "expr #" << i << ": " << const_type_expr[i] << std::endl;
+  }
+}
+
+/*
+ * 
+ *   CODE GENERATION
+ * 
+ */
+
+std::vector<std::string> source_list;
+
+void register_source(std::string source) {
+  source_list.push_back(source);
+}
+
+}  // namespace tlbc
+
+#include "tlbc-gen-cpp.cpp"
+
+/*
+ * 
+ *   TLBC MAIN
+ * 
+ */
+
+void usage(const char* progname) {
+  std::cerr << "usage: " << progname
+            << " [-v][-i][-h][-c][-z][-t][-T][-q][-n<namespace>][-o<output-filename>] {<tlb-filename> ...}\n"
+            << "-v\tIncrease verbosity level\n"
+            << "-t\tShow tag mismatch warnings\n"
+            << "-q\tOmit code generation (TLB scheme check only)\n"
+            << "-h\tGenerate C++ header file only (usually .h or .hpp)\n"
+            << "-c\tGenerate C++ source file only (usually .cpp)\n"
+            << "-T\tAdd type pointer members into generated C++ data record classes\n"
+            << "-z\tAppend .cpp or .hpp to output filename\n"
+            << "-n<namespace>\tPut generated code into specified namespace (default `tlb`)\n";
+  std::exit(2);
+}
+
+std::string output_filename;
+
+int main(int argc, char* const argv[]) {
+  int i;
+  bool interactive = false;
+  bool no_code_gen = false;
+  while ((i = getopt(argc, argv, "chin:o:qTtvz")) != -1) {
+    switch (i) {
+      case 'i':
+        interactive = true;
+        break;
+      case 'v':
+        ++verbosity;
+        break;
+      case 'o':
+        output_filename = optarg;
+        break;
+      case 'c':
+        tlbc::gen_cpp = true;
+        break;
+      case 'h':
+        tlbc::gen_hpp = true;
+        break;
+      case 'q':
+        no_code_gen = true;
+        break;
+      case 'n':
+        tlbc::cpp_namespace = optarg;
+        break;
+      case 'T':
+        tlbc::add_type_members = true;
+        break;
+      case 't':
+        tlbc::show_tag_warnings = true;
+        break;
+      case 'z':
+        tlbc::append_suffix = true;
+        break;
+      default:
+        usage(argv[0]);
+    }
+  }
+  if (verbosity >= 3) {
+    tlbc::show_tag_warnings = true;
+  }
+
+  src::define_keywords();
+  tlbc::init_abstract_tables();
+  tlbc::define_builtins();
+
+  int ok = 0, proc = 0;
+  try {
+    while (optind < argc) {
+      tlbc::register_source(argv[optind]);
+      ok += tlbc::parse_source_file(argv[optind++]);
+      proc++;
+    }
+    if (interactive) {
+      tlbc::register_source("");
+      ok += tlbc::parse_source_stdin();
+      proc++;
+    }
+    if (ok < proc) {
+      throw src::Fatal{"output code generation omitted because of errors"};
+    }
+    if (!proc) {
+      throw src::Fatal{"no source files, no output"};
+    }
+    tlbc::check_scheme();
+    if (verbosity > 0) {
+      tlbc::dump_all_types();
+      tlbc::dump_all_constexpr();
+    }
+    if (!no_code_gen) {
+      tlbc::init_forbidden_cpp_idents();
+      tlbc::generate_cpp_output(output_filename);
+    }
+  } catch (src::Fatal& fatal) {
+    std::cerr << "fatal: " << fatal << std::endl;
+    std::exit(1);
+  } catch (src::Error& error) {
+    std::cerr << error << std::endl;
+    std::exit(1);
+  }
+}
diff --git a/submodules/ton/tonlib-src/crypto/tl/tlblib.cpp b/submodules/ton/tonlib-src/crypto/tl/tlblib.cpp
new file mode 100644
index 0000000000..40637c57b4
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/tl/tlblib.cpp
@@ -0,0 +1,342 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <tl/tlblib.hpp>
+
+namespace tlb {
+
+const False t_False;
+const True t_True;
+const Unit t_Unit;
+
+const Bool t_Bool;
+
+const Int t_int8{8}, t_int16{16}, t_int24{24}, t_int32{32}, t_int64{64}, t_int128{128}, t_int256{256}, t_int257{257};
+const UInt t_uint8{8}, t_uint16{16}, t_uint24{24}, t_uint32{32}, t_uint64{64}, t_uint128{128}, t_uint256{256};
+const NatWidth t_Nat{32};
+
+const Anything t_Anything;
+const RefAnything t_RefCell;
+
+bool Bool::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  int t = get_tag(cs);
+  return cs.advance(1) && pp.out(t ? "bool_true" : "bool_false");
+}
+
+bool NatWidth::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  long long value = (long long)cs.fetch_ulong(32);
+  return value >= 0 && pp.out_int(value);
+}
+
+bool NatLeq::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  long long value = (long long)as_uint(cs);
+  return value >= 0 && skip(cs) && pp.out_int(value);
+}
+
+bool NatLess::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  long long value = (long long)as_uint(cs);
+  return value >= 0 && skip(cs) && pp.out_int(value);
+}
+
+bool TupleT::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  pp.open("tuple ");
+  pp.os << n << " [";
+  pp.mode_nl();
+  int i = n;
+  for (; i > 0; --i) {
+    if (!X.print_skip(pp, cs)) {
+      return false;
+    }
+    pp.mode_nl();
+  }
+  return pp.close("]");
+}
+
+bool CondT::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  return (n > 0 ? X.print_skip(pp, cs) : (!n && pp.out("()")));
+}
+
+bool Int::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  if (n <= 64) {
+    long long value;
+    return cs.fetch_int_to(n, value) && pp.out_int(value);
+  } else {
+    return pp.out_integer(cs.fetch_int256(n, true));
+  }
+}
+
+bool UInt::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  if (n <= 64) {
+    unsigned long long value;
+    return cs.fetch_uint_to(n, value) && pp.out_uint(value);
+  } else {
+    return pp.out_integer(cs.fetch_int256(n, false));
+  }
+}
+
+bool Bits::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  if (cs.have(n)) {
+    pp.os << 'x' << cs.fetch_bits(n).to_hex();
+    return true;
+  } else {
+    return false;
+  }
+}
+
+bool TupleT::skip(vm::CellSlice& cs) const {
+  int i = n;
+  for (; i > 0; --i) {
+    if (!X.skip(cs)) {
+      break;
+    }
+  }
+  return !i;
+}
+
+bool TupleT::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int i = n;
+  for (; i > 0; --i) {
+    if (!X.validate_skip(cs, weak)) {
+      break;
+    }
+  }
+  return !i;
+}
+
+bool TLB::validate_ref_internal(Ref<vm::Cell> cell_ref, bool weak) const {
+  bool is_special;
+  auto cs = load_cell_slice_special(std::move(cell_ref), is_special);
+  return always_special() ? is_special : (is_special ? weak : (validate_skip(cs) && cs.empty_ext()));
+}
+
+bool TLB::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  pp.open("raw@");
+  pp << *this << ' ';
+  vm::CellSlice cs_copy{cs};
+  if (!validate_skip(cs) || !cs_copy.cut_tail(cs)) {
+    return pp.fail("invalid value");
+  }
+  pp.raw_nl();
+  cs_copy.print_rec(pp.os, pp.indent);
+  return pp.mkindent() && pp.close();
+}
+
+bool TLB::print_special(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  pp.open("raw@");
+  pp << *this << ' ';
+  pp.raw_nl();
+  cs.print_rec(pp.os, pp.indent);
+  return pp.mkindent() && pp.close();
+}
+
+bool TLB::print_ref(PrettyPrinter& pp, Ref<vm::Cell> cell_ref) const {
+  if (cell_ref.is_null()) {
+    return pp.fail("null cell reference");
+  }
+  bool is_special;
+  auto cs = load_cell_slice_special(std::move(cell_ref), is_special);
+  if (is_special) {
+    return print_special(pp, cs);
+  } else {
+    return print_skip(pp, cs) && (cs.empty_ext() || pp.fail("extra data in cell"));
+  }
+}
+
+bool TLB::print_skip(std::ostream& os, vm::CellSlice& cs, int indent) const {
+  PrettyPrinter pp{os, indent};
+  return pp.fail_unless(print_skip(pp, cs));
+}
+
+bool TLB::print(std::ostream& os, const vm::CellSlice& cs, int indent) const {
+  PrettyPrinter pp{os, indent};
+  return pp.fail_unless(print(pp, cs));
+}
+
+bool TLB::print_ref(std::ostream& os, Ref<vm::Cell> cell_ref, int indent) const {
+  PrettyPrinter pp{os, indent};
+  return pp.fail_unless(print_ref(pp, std::move(cell_ref)));
+}
+
+std::string TLB::as_string_skip(vm::CellSlice& cs, int indent) const {
+  std::ostringstream os;
+  print_skip(os, cs, indent);
+  return os.str();
+}
+
+std::string TLB::as_string(const vm::CellSlice& cs, int indent) const {
+  std::ostringstream os;
+  print(os, cs, indent);
+  return os.str();
+}
+
+std::string TLB::as_string_ref(Ref<vm::Cell> cell_ref, int indent) const {
+  std::ostringstream os;
+  print_ref(os, std::move(cell_ref), indent);
+  return os.str();
+}
+
+PrettyPrinter::~PrettyPrinter() {
+  if (failed || level) {
+    if (nl_used) {
+      nl(-2 * level);
+    }
+    os << "PRINTING FAILED";
+    while (level > 0) {
+      os << ')';
+      --level;
+    }
+  }
+  if (nl_used) {
+    os << std::endl;
+  }
+}
+
+bool PrettyPrinter::fail(std::string msg) {
+  os << "<FATAL: " << msg << ">";
+  failed = true;
+  return false;
+}
+
+bool PrettyPrinter::mkindent(int delta) {
+  indent += delta;
+  for (int i = 0; i < indent; i++) {
+    os << ' ';
+  }
+  nl_used = true;
+  return true;
+}
+
+bool PrettyPrinter::nl(int delta) {
+  os << std::endl;
+  return mkindent(delta);
+}
+bool PrettyPrinter::raw_nl(int delta) {
+  os << std::endl;
+  indent += delta;
+  nl_used = true;
+  return true;
+}
+
+bool PrettyPrinter::open(std::string msg) {
+  os << "(" << msg;
+  indent += 2;
+  level++;
+  return true;
+}
+
+bool PrettyPrinter::close() {
+  return close("");
+}
+
+bool PrettyPrinter::close(std::string msg) {
+  if (level <= 0) {
+    return fail("cannot close scope");
+  }
+  indent -= 2;
+  --level;
+  os << msg << ")";
+  return true;
+}
+
+bool PrettyPrinter::mode_nl() {
+  if (mode & 1) {
+    return nl();
+  } else {
+    os << ' ';
+    return true;
+  }
+}
+
+bool PrettyPrinter::field(std::string name) {
+  mode_nl();
+  os << name << ':';
+  return true;
+}
+
+bool PrettyPrinter::field() {
+  mode_nl();
+  return true;
+}
+
+bool PrettyPrinter::field_int(long long x, std::string name) {
+  os << ' ' << name << ':' << x;
+  return true;
+}
+
+bool PrettyPrinter::field_int(long long x) {
+  os << ' ' << x;
+  return true;
+}
+
+bool PrettyPrinter::field_uint(unsigned long long x, std::string name) {
+  os << ' ' << name << ':' << x;
+  return true;
+}
+
+bool PrettyPrinter::field_uint(unsigned long long x) {
+  os << ' ' << x;
+  return true;
+}
+
+bool PrettyPrinter::fetch_bits_field(vm::CellSlice& cs, int n) {
+  os << " x";
+  return cs.have(n) && out(cs.fetch_bits(n).to_hex());
+}
+
+bool PrettyPrinter::fetch_bits_field(vm::CellSlice& cs, int n, std::string name) {
+  os << ' ' << name << ":x";
+  return cs.have(n) && out(cs.fetch_bits(n).to_hex());
+}
+
+bool PrettyPrinter::fetch_int_field(vm::CellSlice& cs, int n) {
+  return cs.have(n) && field_int(cs.fetch_long(n));
+}
+
+bool PrettyPrinter::fetch_int_field(vm::CellSlice& cs, int n, std::string name) {
+  return cs.have(n) && field_int(cs.fetch_long(n), name);
+}
+
+bool PrettyPrinter::fetch_uint_field(vm::CellSlice& cs, int n) {
+  return cs.have(n) && field_uint(cs.fetch_ulong(n));
+}
+
+bool PrettyPrinter::fetch_uint_field(vm::CellSlice& cs, int n, std::string name) {
+  return cs.have(n) && field_uint(cs.fetch_ulong(n), name);
+}
+
+bool PrettyPrinter::fetch_int256_field(vm::CellSlice& cs, int n) {
+  os << ' ';
+  return out_integer(cs.fetch_int256(n, true));
+}
+
+bool PrettyPrinter::fetch_int256_field(vm::CellSlice& cs, int n, std::string name) {
+  os << ' ' << name << ':';
+  return out_integer(cs.fetch_int256(n, true));
+}
+
+bool PrettyPrinter::fetch_uint256_field(vm::CellSlice& cs, int n) {
+  os << ' ';
+  return out_integer(cs.fetch_int256(n, false));
+}
+
+bool PrettyPrinter::fetch_uint256_field(vm::CellSlice& cs, int n, std::string name) {
+  os << ' ' << name << ':';
+  return out_integer(cs.fetch_int256(n, false));
+}
+
+}  // namespace tlb
diff --git a/submodules/ton/tonlib-src/crypto/tl/tlblib.hpp b/submodules/ton/tonlib-src/crypto/tl/tlblib.hpp
new file mode 100644
index 0000000000..1e4f458c4e
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/tl/tlblib.hpp
@@ -0,0 +1,981 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <iostream>
+#include "vm/cellslice.h"
+
+namespace tlb {
+
+using td::Ref;
+using vm::CellSlice;
+
+struct PrettyPrinter;
+
+class TLB {
+ public:
+  virtual ~TLB() = default;
+  virtual int get_size(const vm::CellSlice& cs) const {
+    return -1;
+  }
+  virtual bool skip(vm::CellSlice& cs) const {
+    return cs.skip_ext(get_size(cs));
+  }
+  virtual bool validate(const vm::CellSlice& cs, bool weak = false) const {
+    return cs.have_ext(get_size(cs));
+  }
+  virtual bool validate_exact(const vm::CellSlice& cs, bool weak = false) const {
+    return (int)cs.size_ext() == get_size(cs);
+  }
+  bool validate_csr(Ref<vm::CellSlice> cs_ref, bool weak = false) const {
+    return cs_ref.not_null() && validate_skip_exact(cs_ref.write(), weak);
+  }
+  Ref<vm::CellSlice> fetch(vm::CellSlice& cs) const {
+    return cs.fetch_subslice_ext(get_size(cs));
+  }
+  Ref<vm::CellSlice> prefetch(const vm::CellSlice& cs) const {
+    return cs.prefetch_subslice_ext(get_size(cs));
+  }
+  virtual Ref<vm::CellSlice> validate_fetch(vm::CellSlice& cs, bool weak = false) const {
+    return validate(cs, weak) ? cs.fetch_subslice_ext(get_size(cs)) : Ref<vm::CellSlice>{};
+  }
+  virtual Ref<vm::CellSlice> validate_prefetch(const vm::CellSlice& cs, bool weak = false) const {
+    return validate(cs, weak) ? cs.prefetch_subslice_ext(get_size(cs)) : Ref<vm::CellSlice>{};
+  }
+  bool fetch_to(vm::CellSlice& cs, Ref<vm::CellSlice>& res) const {
+    return (res = fetch(cs)).not_null();
+  }
+  bool validate_fetch_to(vm::CellSlice& cs, Ref<vm::CellSlice>& res, bool weak = false) const {
+    return (res = validate_fetch(cs, weak)).not_null();
+  }
+  bool store_from(vm::CellBuilder& cb, Ref<vm::CellSlice> field) const {
+    return field.not_null() && get_size(*field) == (int)field->size_ext() && cb.append_cellslice_bool(std::move(field));
+  }
+  bool validate_store_from(vm::CellBuilder& cb, Ref<vm::CellSlice> field, bool weak = false) const {
+    if (field.is_null()) {
+      return false;
+    }
+    vm::CellSlice cs{*field};
+    return validate_skip(cs, weak) && cs.empty_ext() && cb.append_cellslice_bool(std::move(field));
+  }
+  virtual bool extract(vm::CellSlice& cs) const {
+    return cs.only_ext(get_size(cs));
+  }
+  virtual bool validate_extract(vm::CellSlice& cs, bool weak = false) const {
+    return validate(cs, weak) && extract(cs);
+  }
+  int get_size_by_skip(const vm::CellSlice& cs) const {
+    vm::CellSlice copy{cs};
+    return skip(copy) ? copy.subtract_base_ext(cs) : -1;
+  }
+  virtual bool validate_skip(vm::CellSlice& cs, bool weak = false) const {
+    return validate(cs, weak) && skip(cs);
+  }
+  bool validate_skip_exact(vm::CellSlice& cs, bool weak = false) const {
+    return validate_skip(cs, weak) && cs.empty_ext();
+  }
+  bool validate_by_skip(const vm::CellSlice& cs, bool weak = false) const {
+    vm::CellSlice copy{cs};
+    return validate_skip(copy, weak);
+  }
+  bool validate_by_skip_exact(const vm::CellSlice& cs, bool weak = false) const {
+    vm::CellSlice copy{cs};
+    return validate_skip_exact(copy, weak);
+  }
+  bool extract_by_skip(vm::CellSlice& cs) const {
+    vm::CellSlice copy{cs};
+    return skip(copy) && cs.cut_tail(copy);
+  }
+  bool validate_extract_by_skip(vm::CellSlice& cs, bool weak = false) const {
+    vm::CellSlice copy{cs};
+    return validate_skip(copy, weak) && cs.cut_tail(copy);
+  }
+  Ref<vm::CellSlice> validate_fetch_by_skip(vm::CellSlice& cs, bool weak = false) const {
+    Ref<vm::CellSlice> copy{true, cs};
+    return validate_skip(cs, weak) && copy.unique_write().cut_tail(cs) ? copy : Ref<vm::CellSlice>{};
+  }
+  Ref<vm::CellSlice> validate_prefetch_by_skip(const vm::CellSlice& cs, bool weak = false) const {
+    vm::CellSlice copy{cs};
+    return validate_skip(copy, false) ? cs.prefetch_subslice_ext(copy.subtract_base_ext(cs)) : Ref<vm::CellSlice>{};
+  }
+  virtual bool skip_copy(vm::CellBuilder& cb, vm::CellSlice& cs) const {
+    return cb.append_cellslice_bool(fetch(cs));
+  }
+  virtual bool copy(vm::CellBuilder& cb, const vm::CellSlice& cs) const {
+    return cb.append_cellslice_bool(prefetch(cs));
+  }
+  virtual bool always_special() const {
+    return false;
+  }
+  virtual int get_tag(const vm::CellSlice& cs) const {
+    return -1;
+  }
+  virtual int check_tag(const vm::CellSlice& cs) const {
+    return get_tag(cs);
+  }
+  bool has_valid_tag(const vm::CellSlice& cs) const {
+    return check_tag(cs) >= 0;
+  }
+  virtual long long as_int(const vm::CellSlice& cs) const {
+    return -1;
+  }
+  virtual unsigned long long as_uint(const vm::CellSlice& cs) const {
+    return static_cast<unsigned long long>(-1);
+  }
+  virtual td::RefInt256 as_integer(const vm::CellSlice& cs) const {
+    return {};
+  }
+  virtual td::RefInt256 as_integer_skip(vm::CellSlice& cs) const {
+    return {};
+  }
+  virtual td::RefInt256 as_integer(Ref<vm::CellSlice> cs) const {
+    return as_integer(*cs);
+  }
+  bool as_integer_skip_to(vm::CellSlice& cs, td::RefInt256& res) const {
+    return (res = as_integer_skip(cs)).not_null();
+  }
+  bool as_integer_to(const vm::CellSlice& cs, td::RefInt256& res) const {
+    return (res = as_integer(cs)).not_null();
+  }
+  bool as_integer_to(Ref<vm::CellSlice> cs_ref, td::RefInt256& res) const {
+    return (res = as_integer(std::move(cs_ref))).not_null();
+  }
+  bool validate_ref(Ref<vm::Cell> cell_ref, bool weak = false) const {
+    return cell_ref.not_null() && validate_ref_internal(std::move(cell_ref), weak);
+  }
+  bool force_validate_ref(Ref<vm::Cell> cell_ref) const {
+    return cell_ref.not_null() && validate_ref_internal(std::move(cell_ref), false);
+  }
+  bool validate_skip_ref(vm::CellSlice& cs, bool weak = false) const {
+    return validate_ref(cs.fetch_ref(), weak);
+  }
+  virtual bool null_value(vm::CellBuilder& cb) const {
+    return false;
+  }
+  virtual bool store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const {
+    return false;
+  }
+  virtual bool store_long(vm::CellBuilder& cb, long long value) const {
+    return store_integer_value(cb, td::BigInt256{value});
+  }
+  virtual bool store_integer_ref(vm::CellBuilder& cb, td::RefInt256 value) const {
+    return value.not_null() && store_integer_value(cb, *value);
+  }
+  virtual bool add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const {
+    td::RefInt256 x = as_integer_skip(cs1), y = as_integer_skip(cs2);
+    return x.not_null() && y.not_null() && store_integer_ref(cb, x += std::move(y));
+  }
+  // result: -1 = error, 0 = ok (zero), 1 = ok
+  virtual int sub_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const {
+    td::RefInt256 x = as_integer_skip(cs1), y = as_integer_skip(cs2);
+    return x.not_null() && y.not_null() && store_integer_ref(cb, x -= std::move(y)) ? (td::sgn(x) ? 1 : 0) : -1;
+  }
+  template <typename... Args>
+  bool unpack(Ref<vm::CellSlice> cs_ref, Args&... args) const {
+    return cs_ref.not_null() && unpack(cs_ref.write(), args...) && cs_ref->empty_ext();
+  }
+  virtual std::ostream& print_type(std::ostream& os) const {
+    return os << "<unknown-TLB-type>";
+  }
+  virtual bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const;
+  virtual bool print(PrettyPrinter& pp, const vm::CellSlice& cs) const {
+    vm::CellSlice cs_copy{cs};
+    return print_skip(pp, cs_copy);
+  }
+  bool print_special(PrettyPrinter& pp, vm::CellSlice& cs) const;
+  bool print_ref(PrettyPrinter& pp, Ref<vm::Cell> cell_ref) const;
+  bool print(PrettyPrinter& pp, Ref<vm::CellSlice> cs_ref) const {
+    return print(pp, *cs_ref);
+  }
+  bool print_skip(std::ostream& os, vm::CellSlice& cs, int indent = 0) const;
+  bool print(std::ostream& os, const vm::CellSlice& cs, int indent = 0) const;
+  bool print(std::ostream& os, Ref<vm::CellSlice> cs_ref, int indent = 0) const {
+    return print(os, *cs_ref, indent);
+  }
+  bool print_ref(std::ostream& os, Ref<vm::Cell> cell_ref, int indent = 0) const;
+  std::string as_string_skip(vm::CellSlice& cs, int indent = 0) const;
+  std::string as_string(const vm::CellSlice& cs, int indent = 0) const;
+  std::string as_string(Ref<vm::CellSlice> cs_ref, int indent = 0) const {
+    return cs_ref.not_null() ? as_string(*cs_ref, indent) : "<null>";
+  }
+  std::string as_string_ref(Ref<vm::Cell> cell_ref, int indent = 0) const;
+
+ protected:
+  bool validate_ref_internal(Ref<vm::Cell> cell_ref, bool weak = false) const;
+};
+
+static inline std::ostream& operator<<(std::ostream& os, const TLB& type) {
+  return type.print_type(os);
+}
+
+struct TLB_Complex : TLB {
+  bool skip(vm::CellSlice& cs) const override {
+    return validate_skip(cs);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override = 0;
+  int get_size(const vm::CellSlice& cs) const override {
+    return get_size_by_skip(cs);
+  }
+  bool validate(const vm::CellSlice& cs, bool weak = false) const override {
+    return validate_by_skip(cs, weak);
+  }
+  bool validate_exact(const vm::CellSlice& cs, bool weak = false) const override {
+    return validate_by_skip_exact(cs, weak);
+  }
+  bool extract(vm::CellSlice& cs) const override {
+    return extract_by_skip(cs);
+  }
+  bool validate_extract(vm::CellSlice& cs, bool weak = false) const override {
+    return validate_extract_by_skip(cs, weak);
+  }
+  Ref<vm::CellSlice> validate_fetch(vm::CellSlice& cs, bool weak = false) const override {
+    return validate_fetch_by_skip(cs, weak);
+  }
+  Ref<vm::CellSlice> validate_prefetch(const vm::CellSlice& cs, bool weak = false) const override {
+    return validate_prefetch_by_skip(cs, weak);
+  }
+  td::RefInt256 as_integer(const vm::CellSlice& cs) const override {
+    vm::CellSlice copy{cs};
+    auto res = as_integer_skip(copy);
+    return res.not_null() && copy.empty_ext() ? std::move(res) : td::RefInt256{};
+  }
+  td::RefInt256 as_integer(Ref<vm::CellSlice> cs) const override {
+    auto res = as_integer_skip(cs.write());
+    return res.not_null() && cs->empty_ext() ? std::move(res) : td::RefInt256{};
+  }
+};
+
+static inline bool add_chk(int x, int y, int z) {
+  return x + y == z && z >= 0;
+}
+
+static inline bool add_r1(int& x, int y, int z) {
+  return z >= y && (x = z - y) >= 0;
+}
+
+static inline bool add_r3(int& x, int y, int& z) {
+  return (z = (x + y)) >= 0;
+}
+
+static inline bool mul_chk(int x, int y, int z) {
+  return (long long)x * y == z;
+}
+
+static inline bool mul_r1(int& x, int y, int z) {
+  return y && !(z % y) && (x = z / y) >= 0;
+}
+
+static inline bool mul_r3(int x, int y, int& z) {
+  unsigned long long t = (unsigned long long)x * y;
+  if (t <= 0x7fffffff) {
+    z = (int)t;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+static inline int mul_bound(int x, int y) {
+  unsigned long long t = (unsigned long long)x * y;
+  return t <= 0x7fffffff ? (int)t : 0x7fffffff;
+}
+
+// templatized unpack functions
+template <typename R, typename... Args>
+bool unpack(vm::CellSlice& cs, R& rec, Args&... args) {
+  return (typename R::type_class{}).unpack(cs, rec, args...);
+}
+
+template <typename R, typename... Args>
+bool unpack_exact(vm::CellSlice& cs, R& rec, Args&... args) {
+  return (typename R::type_class{}).unpack(cs, rec, args...) && cs.empty_ext();
+}
+
+template <typename T, typename R, typename... Args>
+bool type_unpack(vm::CellSlice& cs, const T& type, R& rec, Args&... args) {
+  return type.unpack(cs, rec, args...);
+}
+
+template <typename T, typename R, typename... Args>
+bool type_unpack_exact(vm::CellSlice& cs, const T& type, R& rec, Args&... args) {
+  return type.unpack(cs, rec, args...) && cs.empty_ext();
+}
+
+template <typename R, typename... Args>
+bool csr_unpack(Ref<vm::CellSlice> csr, R& rec, Args&... args) {
+  return (typename R::type_class{}).unpack(csr.write(), rec, args...) && csr->empty_ext();
+}
+
+template <typename R, typename... Args>
+bool csr_unpack_safe(Ref<vm::CellSlice> csr, R& rec, Args&... args) {
+  return csr.not_null() && (typename R::type_class{}).unpack(csr.write(), rec, args...) && csr->empty_ext();
+}
+
+template <typename R, typename... Args>
+bool unpack_cell(Ref<vm::Cell> cell, R& rec, Args&... args) {
+  vm::CellSlice cs = vm::load_cell_slice(std::move(cell));
+  return cs.is_valid() && (typename R::type_class{}).unpack(cs, rec, args...) && cs.empty_ext();
+}
+
+template <typename R, typename... Args>
+bool unpack_cell_inexact(Ref<vm::Cell> cell, R& rec, Args&... args) {
+  vm::CellSlice cs = vm::load_cell_slice(std::move(cell));
+  return cs.is_valid() && (typename R::type_class{}).unpack(cs, rec, args...);
+}
+
+template <typename T, typename R, typename... Args>
+bool type_unpack_cell(Ref<vm::Cell> cell, const T& type, R& rec, Args&... args) {
+  vm::CellSlice cs = vm::load_cell_slice(std::move(cell));
+  return cs.is_valid() && type.unpack(cs, rec, args...) && cs.empty_ext();
+}
+
+template <typename T, typename R, typename... Args>
+bool csr_type_unpack(Ref<vm::CellSlice> csr, const T& type, R& rec, Args&... args) {
+  return type.unpack(csr.write(), rec, args...) && csr->empty_ext();
+}
+
+template <typename R, typename... Args>
+bool csr_unpack_inexact(Ref<vm::CellSlice> csr, R& rec, Args&... args) {
+  return (typename R::type_class{}).unpack(csr.write(), rec, args...);
+}
+
+template <typename T, typename R, typename... Args>
+bool csr_type_unpack_inexact(Ref<vm::CellSlice> csr, const T& type, R& rec, Args&... args) {
+  return type.unpack(csr.write(), rec, args...);
+}
+
+template <typename R, typename... Args>
+bool csr_unpack_skip(Ref<vm::CellSlice>& csr, R& rec, Args&... args) {
+  return (typename R::type_class{}).unpack(csr.write(), rec, args...);
+}
+
+template <typename T, typename R, typename... Args>
+bool csr_type_unpack_skip(Ref<vm::CellSlice>& csr, const T& type, R& rec, Args&... args) {
+  return type.unpack(csr.write(), rec, args...);
+}
+
+// templatized pack functions
+template <typename R, typename... Args>
+bool pack(vm::CellBuilder& cb, const R& rec, Args&... args) {
+  return (typename R::type_class{}).pack(cb, rec, args...);
+}
+
+template <typename T, typename R, typename... Args>
+bool type_pack(vm::CellBuilder& cb, const T& type, const R& rec, Args&... args) {
+  return type.pack(cb, rec, args...);
+}
+
+template <typename R, typename... Args>
+bool pack_cell(Ref<vm::Cell>& cell, const R& rec, Args&... args) {
+  vm::CellBuilder cb;
+  return pack(cb, rec, args...) && cb.finalize_to(cell);
+}
+
+template <typename T, typename R, typename... Args>
+bool type_pack_cell(Ref<vm::Cell>& cell, const T& type, const R& rec, Args&... args) {
+  vm::CellBuilder cb;
+  return type.pack(cb, rec, args...) && cb.finalize_to(cell);
+}
+
+template <typename R, typename... Args>
+bool csr_pack(Ref<vm::CellSlice>& csr, const R& rec, Args&... args) {
+  vm::CellBuilder cb;
+  Ref<vm::Cell> cell;
+  return pack(cb, rec, args...) && cb.finalize_to(cell) && (csr = vm::load_cell_slice_ref(std::move(cell))).not_null();
+}
+
+template <typename T, typename R, typename... Args>
+bool csr_type_pack(Ref<vm::CellSlice>& csr, const T& type, const R& rec, Args&... args) {
+  vm::CellBuilder cb;
+  Ref<vm::Cell> cell;
+  return type.pack(cb, rec, args...) && cb.finalize_to(cell) &&
+         (csr = vm::load_cell_slice_ref(std::move(cell))).not_null();
+}
+
+// templatized store_from function
+
+template <typename T, typename... Args>
+bool store_from(vm::CellBuilder& cb, const T& tlb_type, Ref<vm::CellSlice> field, Args&... args) {
+  if (field.is_null()) {
+    return false;
+  }
+  vm::CellSlice cs{*field};
+  return tlb_type.skip(cs, args...) && cs.empty_ext() && cb.append_cellslice_bool(std::move(field));
+}
+
+}  // namespace tlb
+
+namespace tlb {
+
+struct PrettyPrinter {
+  std::ostream& os;
+  int indent;
+  int level;
+  bool failed;
+  bool nl_used;
+  int mode;
+  PrettyPrinter(std::ostream& _os, int _indent = 0, int _mode = 1)
+      : os(_os), indent(_indent), level(0), failed(false), nl_used(false), mode(_mode) {
+  }
+  ~PrettyPrinter();
+  bool ok() const {
+    return !failed && !level;
+  }
+  bool fail_unless(bool res) {
+    if (!res) {
+      failed = true;
+    }
+    return res;
+  }
+  bool fail(std::string msg);
+  bool nl(int delta = 0);
+  bool raw_nl(int delta = 0);
+  bool mkindent(int delta = 0);
+  bool mode_nl();
+  bool open(std::string msg = "");
+  bool close();
+  bool close(std::string msg);
+  bool field(std::string name);
+  bool field();
+  bool field_int(long long value);
+  bool field_int(long long value, std::string name);
+  bool field_uint(unsigned long long value);
+  bool field_uint(unsigned long long value, std::string name);
+  bool out(std::string str) {
+    os << str;
+    return true;
+  }
+  bool out_int(long long value) {
+    os << value;
+    return true;
+  }
+  bool out_uint(unsigned long long value) {
+    os << value;
+    return true;
+  }
+  bool out_integer(td::RefInt256 value) {
+    if (value.not_null()) {
+      os << std::move(value);
+      return true;
+    } else {
+      return false;
+    }
+  }
+  bool cons(std::string str) {
+    return out(str);
+  }
+  bool fetch_bits_field(vm::CellSlice& cs, int n);
+  bool fetch_bits_field(vm::CellSlice& cs, int n, std::string name);
+  bool fetch_int_field(vm::CellSlice& cs, int n);
+  bool fetch_int_field(vm::CellSlice& cs, int n, std::string name);
+  bool fetch_uint_field(vm::CellSlice& cs, int n);
+  bool fetch_uint_field(vm::CellSlice& cs, int n, std::string name);
+  bool fetch_int256_field(vm::CellSlice& cs, int n);
+  bool fetch_int256_field(vm::CellSlice& cs, int n, std::string name);
+  bool fetch_uint256_field(vm::CellSlice& cs, int n);
+  bool fetch_uint256_field(vm::CellSlice& cs, int n, std::string name);
+  template <typename T>
+  PrettyPrinter& operator<<(const T& value) {
+    os << value;
+    return *this;
+  }
+};
+
+}  // namespace tlb
+
+namespace tlb {
+
+struct False final : TLB {
+  int get_size(const vm::CellSlice& cs) const override {
+    return -1;
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "False";
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override {
+    return false;
+  }
+};
+
+extern const False t_False;
+
+struct True final : TLB {
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "True";
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override {
+    return pp.out("true");
+  }
+};
+
+extern const True t_True;
+
+struct Unit final : TLB {
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Unit";
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override {
+    return pp.out("()");
+  }
+};
+
+struct FwdT final : TLB {
+  const TLB& X;
+  FwdT(const TLB& _X) : X(_X) {
+  }
+  int get_size(const vm::CellSlice& cs) const override {
+    return X.get_size(cs);
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return X.skip(cs);
+  }
+  bool validate(const vm::CellSlice& cs, bool weak = false) const override {
+    return X.validate(cs, weak);
+  }
+  Ref<vm::CellSlice> validate_fetch(vm::CellSlice& cs, bool weak = false) const override {
+    return X.validate_fetch(cs, weak);
+  }
+  Ref<vm::CellSlice> validate_prefetch(const vm::CellSlice& cs, bool weak = false) const override {
+    return X.validate_prefetch(cs, weak);
+  }
+  bool extract(vm::CellSlice& cs) const override {
+    return X.extract(cs);
+  }
+  bool validate_extract(vm::CellSlice& cs, bool weak = false) const override {
+    return X.validate_extract(cs, weak);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return X.validate_skip(cs, weak);
+  }
+  bool skip_copy(vm::CellBuilder& cb, vm::CellSlice& cs) const override {
+    return X.skip_copy(cb, cs);
+  }
+  bool copy(vm::CellBuilder& cb, const vm::CellSlice& cs) const override {
+    return X.copy(cb, cs);
+  }
+  int get_tag(const vm::CellSlice& cs) const override {
+    return X.get_tag(cs);
+  }
+  long long as_int(const vm::CellSlice& cs) const override {
+    return X.as_int(cs);
+  }
+  unsigned long long as_uint(const vm::CellSlice& cs) const override {
+    return X.as_uint(cs);
+  }
+  td::RefInt256 as_integer(const vm::CellSlice& cs) const override {
+    return X.as_integer(cs);
+  }
+  td::RefInt256 as_integer_skip(vm::CellSlice& cs) const override {
+    return X.as_integer_skip(cs);
+  }
+  td::RefInt256 as_integer(Ref<vm::CellSlice> cs) const override {
+    return X.as_integer(std::move(cs));
+  }
+  bool null_value(vm::CellBuilder& cb) const override {
+    return X.null_value(cb);
+  }
+  bool store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const override {
+    return X.store_integer_value(cb, value);
+  }
+  bool store_integer_ref(vm::CellBuilder& cb, td::RefInt256 value) const override {
+    return X.store_integer_ref(cb, std::move(value));
+  }
+  bool add_values(vm::CellBuilder& cb, vm::CellSlice& cs1, vm::CellSlice& cs2) const override {
+    return X.add_values(cb, cs1, cs2);
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return X.print_type(os);
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override {
+    return X.print_skip(pp, cs);
+  }
+};
+
+extern const Unit t_Unit;
+
+struct Bool final : TLB {
+  enum { bool_false = 0, bool_true = 1 };
+  int get_size(const vm::CellSlice& cs) const override {
+    return 1;
+  }
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Bool";
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+};
+
+extern const Bool t_Bool;
+
+struct NatWidth final : TLB {
+  int n;
+  NatWidth(int _n) : n(_n) {
+  }
+  int get_size(const vm::CellSlice& cs) const override {
+    return n <= 32 ? n : -1;
+  }
+  td::RefInt256 as_integer(const vm::CellSlice& cs) const override {
+    return cs.prefetch_int256(n, false);
+  }
+  td::RefInt256 as_integer_skip(vm::CellSlice& cs) const override {
+    return cs.fetch_int256(n, false);
+  }
+  unsigned long long as_uint(const vm::CellSlice& cs) const override {
+    return n <= 32 ? cs.prefetch_ulong(n) : -1;
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(## " << n << ')';
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+};
+
+extern const NatWidth t_Nat;
+
+struct NatLess final : TLB {
+  int n, w;
+  NatLess(int _n) : n(_n - 1), w(32 - td::count_leading_zeroes32(_n - 1)) {
+  }
+  int get_size(const vm::CellSlice& cs) const override {
+    return n >= 0 ? w : -1;
+  }
+  bool validate(const vm::CellSlice& cs, bool weak = false) const override {
+    return n >= 0 && (unsigned)cs.prefetch_ulong(w) <= (unsigned)n;
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return n >= 0 && (unsigned)cs.fetch_ulong(w) <= (unsigned)n;
+  }
+  unsigned long long as_uint(const vm::CellSlice& cs) const override {
+    unsigned long long r = cs.prefetch_ulong(w);
+    return n >= 0 && (unsigned)r <= (unsigned)n ? r : std::numeric_limits<td::uint64>::max();
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(#< " << n << ')';
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+};
+
+struct NatLeq final : TLB {
+  int n, w;
+  NatLeq(int _n) : n(_n), w(32 - td::count_leading_zeroes32(_n)) {
+  }
+  int get_size(const vm::CellSlice& cs) const override {
+    return n >= 0 ? w : -1;
+  }
+  bool validate(const vm::CellSlice& cs, bool weak = false) const override {
+    return n >= 0 && (unsigned)cs.prefetch_ulong(w) <= (unsigned)n;
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return n >= 0 && (unsigned)cs.fetch_ulong(w) <= (unsigned)n;
+  }
+  unsigned long long as_uint(const vm::CellSlice& cs) const override {
+    unsigned long long r = cs.prefetch_ulong(w);
+    return n >= 0 && (unsigned)r <= (unsigned)n ? r : std::numeric_limits<td::uint64>::max();
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(#<= " << n << ')';
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+};
+
+struct TupleT final : TLB_Complex {
+  int n;
+  const TLB& X;
+  TupleT(int _n, const TLB& _X) : n(_n), X(_X) {
+  }
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+};
+
+struct CondT final : TLB_Complex {
+  int n;
+  const TLB& X;
+  CondT(int _n, const TLB& _X) : n(_n), X(_X) {
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return !n || X.skip(cs);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return !n || (n > 0 && X.validate_skip(cs, weak));
+  }
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(CondT " << n << ' ' << X << ')';
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+};
+
+template <typename T>
+struct Cond final : TLB_Complex {
+  int n;
+  T field_type;
+  template <typename... Args>
+  Cond(int _n, Args... args) : n(_n), field_type(args...) {
+  }
+  bool skip(vm::CellSlice& cs) const override {
+    return !n || field_type.skip(cs);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return !n || (n > 0 && field_type.validate_skip(cs, weak));
+  }
+  int get_tag(const vm::CellSlice& cs) const override {
+    return 0;
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(Cond " << n << ' ' << field_type << ')';
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override {
+    return (n > 0 ? field_type.print_skip(pp, cs) : (!n && pp.out("()")));
+  }
+};
+
+struct Int final : TLB {
+  int n;
+  Int(int _n) : n(_n) {
+  }
+  int get_size(const vm::CellSlice& cs) const override {
+    return n;
+  }
+  td::RefInt256 as_integer(const vm::CellSlice& cs) const override {
+    return cs.prefetch_int256(n, true);
+  }
+  td::RefInt256 as_integer_skip(vm::CellSlice& cs) const override {
+    return cs.fetch_int256(n, true);
+  }
+  long long as_int(const vm::CellSlice& cs) const override {
+    return n <= 64 ? cs.prefetch_long(n) : (1ULL << 63);
+  }
+  bool null_value(vm::CellBuilder& cb) const override {
+    return cb.store_zeroes_bool(n);
+  }
+  bool store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const override {
+    return cb.store_int256_bool(value, n, true);
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "int" << n;
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+};
+
+extern const Int t_int8, t_int16, t_int24, t_int32, t_int64, t_int128, t_int256, t_int257;
+
+struct UInt final : TLB {
+  int n;
+  UInt(int _n) : n(_n) {
+  }
+  int get_size(const vm::CellSlice& cs) const override {
+    return n;
+  }
+  td::RefInt256 as_integer(const vm::CellSlice& cs) const override {
+    return cs.prefetch_int256(n, false);
+  }
+  td::RefInt256 as_integer_skip(vm::CellSlice& cs) const override {
+    return cs.fetch_int256(n, false);
+  }
+  unsigned long long as_uint(const vm::CellSlice& cs) const override {
+    return n <= 64 ? cs.prefetch_ulong(n) : -1;
+  }
+  bool null_value(vm::CellBuilder& cb) const override {
+    return cb.store_zeroes_bool(n);
+  }
+  bool store_integer_value(vm::CellBuilder& cb, const td::BigInt256& value) const override {
+    return cb.store_int256_bool(value, n, false);
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "uint" << n;
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+};
+
+extern const UInt t_uint8, t_uint16, t_uint24, t_uint32, t_uint64, t_uint128, t_uint256;
+
+struct Bits final : TLB {
+  int n;
+  Bits(int _n) : n(_n) {
+  }
+  int get_size(const vm::CellSlice& cs) const override {
+    return n;
+  }
+  bool null_value(vm::CellBuilder& cb) const override {
+    return cb.store_zeroes_bool(n);
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "bits" << n;
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+};
+
+template <class T>
+struct Maybe : TLB_Complex {
+  T field_type;
+  template <typename... Args>
+  Maybe(Args... args) : field_type(args...) {
+  }
+  bool skip(vm::CellSlice& cs) const override;
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override;
+  int get_tag(const vm::CellSlice& cs) const override {
+    return cs.have(1) ? (int)cs.prefetch_ulong(1) : -1;
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(Maybe " << field_type << ')';
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+};
+
+template <class T>
+bool Maybe<T>::skip(vm::CellSlice& cs) const {
+  int t = get_tag(cs);
+  if (t > 0) {
+    return cs.advance(1) && field_type.skip(cs);
+  } else if (!t) {
+    return cs.advance(1);
+  } else {
+    return false;
+  }
+}
+
+template <class T>
+bool Maybe<T>::validate_skip(vm::CellSlice& cs, bool weak) const {
+  int t = get_tag(cs);
+  if (t > 0) {
+    return cs.advance(1) && field_type.validate_skip(cs, weak);
+  } else if (!t) {
+    return cs.advance(1);
+  } else {
+    return false;
+  }
+}
+
+template <class T>
+bool Maybe<T>::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  if (!get_tag(cs)) {
+    return cs.advance(1) && pp.out("nothing");
+  } else {
+    return cs.advance(1) && pp.open("just ") && field_type.print_skip(pp, cs) && pp.close();
+  }
+}
+
+struct RefAnything final : TLB {
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0x10000;
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "^Cell";
+  }
+};
+
+extern const RefAnything t_RefCell;
+
+struct Anything final : TLB {
+  int get_size(const vm::CellSlice& cs) const override {
+    return cs.size_ext();
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "Any";
+  }
+};
+
+extern const Anything t_Anything;
+
+template <class T>
+struct RefTo final : TLB {
+  T ref_type;
+  template <typename... Args>
+  RefTo(Args... args) : ref_type(args...) {
+  }
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0x10000;
+  }
+  bool validate(const vm::CellSlice& cs, bool weak = false) const override {
+    return cs.size_refs() ? ref_type.validate_ref(cs.prefetch_ref(), weak) : false;
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return ref_type.validate_skip_ref(cs, weak);
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << '^' << ref_type;
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override {
+    return pp.out("^") && ref_type.print_ref(pp, cs.fetch_ref());
+  }
+};
+
+struct RefT final : TLB {
+  const TLB& X;
+  RefT(const TLB& _X) : X(_X) {
+  }
+  int get_size(const vm::CellSlice& cs) const override {
+    return 0x10000;
+  }
+  bool validate(const vm::CellSlice& cs, bool weak = false) const override {
+    return X.validate_ref(cs.prefetch_ref(), weak);
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return X.validate_skip_ref(cs, weak);
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << '^' << X;
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override {
+    return pp.out("^") && X.print_ref(pp, cs.fetch_ref());
+  }
+};
+
+template <class T1, class T2>
+struct Either final : TLB_Complex {
+  T1 left_type;
+  T2 right_type;
+  bool skip(vm::CellSlice& cs) const override {
+    return cs.have(1) ? (cs.fetch_ulong(1) ? right_type.skip(cs) : left_type.skip(cs)) : false;
+  }
+  bool validate_skip(vm::CellSlice& cs, bool weak = false) const override {
+    return cs.have(1) ? (cs.fetch_ulong(1) ? right_type.validate_skip(cs, weak) : left_type.validate_skip(cs, weak))
+                      : false;
+  }
+  int get_tag(const vm::CellSlice& cs) const override {
+    return (int)cs.prefetch_ulong(1);
+  }
+  std::ostream& print_type(std::ostream& os) const override {
+    return os << "(Either " << left_type << ' ' << right_type << ')';
+  }
+  bool print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const override;
+};
+
+template <class T1, class T2>
+bool Either<T1, T2>::print_skip(PrettyPrinter& pp, vm::CellSlice& cs) const {
+  if (!get_tag(cs)) {
+    return cs.advance(1) && pp.open("left ") && left_type.print_skip(pp, cs) && pp.close();
+  } else {
+    return cs.advance(1) && pp.open("right ") && right_type.print_skip(pp, cs) && pp.close();
+  }
+}
+
+}  // namespace tlb
diff --git a/submodules/ton/tonlib-src/crypto/vm/arithops.cpp b/submodules/ton/tonlib-src/crypto/vm/arithops.cpp
new file mode 100644
index 0000000000..19279cf167
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/arithops.cpp
@@ -0,0 +1,946 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <functional>
+#include "vm/arithops.h"
+#include "vm/log.h"
+#include "vm/opctable.h"
+#include "vm/stack.hpp"
+#include "vm/continuation.h"
+#include "vm/excno.hpp"
+#include "common/bigint.hpp"
+#include "common/refint.h"
+
+namespace vm {
+
+int exec_push_tinyint4(VmState* st, unsigned args) {
+  int x = (int)((args + 5) & 15) - 5;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSHINT " << x;
+  stack.push_smallint(x);
+  return 0;
+}
+
+std::string dump_push_tinyint4(CellSlice&, unsigned args) {
+  int x = (int)((args + 5) & 15) - 5;
+  std::ostringstream os{"PUSHINT "};
+  os << x;
+  return os.str();
+}
+
+int exec_push_tinyint8(VmState* st, unsigned args) {
+  int x = (signed char)args;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSHINT " << x;
+  stack.push_smallint(x);
+  return 0;
+}
+
+std::string dump_op_tinyint8(const char* op_prefix, CellSlice&, unsigned args) {
+  int x = (signed char)args;
+  std::ostringstream os{op_prefix};
+  os << x;
+  return os.str();
+}
+
+int exec_push_smallint(VmState* st, unsigned args) {
+  int x = (short)args;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSHINT " << x;
+  stack.push_smallint(x);
+  return 0;
+}
+
+std::string dump_push_smallint(CellSlice&, unsigned args) {
+  int x = (short)args;
+  std::ostringstream os{"PUSHINT "};
+  os << x;
+  return os.str();
+}
+
+int exec_push_int(VmState* st, CellSlice& cs, unsigned args, int pfx_bits) {
+  int l = (int)(args & 31) + 2;
+  if (!cs.have(pfx_bits + 3 + l * 8)) {
+    throw VmError{Excno::inv_opcode, "not enough bits for integer constant in PUSHINT"};
+  }
+  cs.advance(pfx_bits);
+  td::RefInt256 x = cs.fetch_int256(3 + l * 8);
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSHINT " << x;
+  stack.push_int(std::move(x));
+  return 0;
+}
+
+std::string dump_push_int(CellSlice& cs, unsigned args, int pfx_bits) {
+  int l = (int)(args & 31) + 2;
+  if (!cs.have(pfx_bits + 3 + l * 8)) {
+    return "";
+  }
+  cs.advance(pfx_bits);
+  td::RefInt256 x = cs.fetch_int256(3 + l * 8);
+  std::ostringstream os{"PUSHINT "};
+  os << x;
+  return os.str();
+}
+
+int compute_len_push_int(const CellSlice& cs, unsigned args, int pfx_bits) {
+  int l = (int)(args & 31) + 2;
+  if (!cs.have(pfx_bits + 3 + l * 8)) {
+    return 0;
+  } else {
+    return pfx_bits + 3 + l * 8;
+  }
+}
+
+int exec_push_pow2(VmState* st, unsigned args) {
+  int x = (args & 255) + 1;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSHPOW2 " << x;
+  td::RefInt256 r{true};
+  r.unique_write().set_pow2(x);
+  stack.push(std::move(r));
+  return 0;
+}
+
+int exec_push_nan(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSHNAN";
+  td::RefInt256 r{true};
+  r.unique_write().invalidate();
+  stack.push(std::move(r));
+  return 0;
+}
+
+int exec_push_pow2dec(VmState* st, unsigned args) {
+  int x = (args & 255) + 1;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSHPOW2DEC " << x;
+  td::RefInt256 r{true};
+  r.unique_write().set_pow2(x).add_tiny(-1).normalize();
+  stack.push(std::move(r));
+  return 0;
+}
+
+int exec_push_negpow2(VmState* st, unsigned args) {
+  int x = (args & 255) + 1;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSHNEGPOW2 " << x;
+  td::RefInt256 r{true};
+  r.unique_write().set_pow2(x).negate().normalize();
+  stack.push(std::move(r));
+  return 0;
+}
+
+void register_int_const_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mkfixed(0x7, 4, 4, dump_push_tinyint4, exec_push_tinyint4))
+      .insert(OpcodeInstr::mkfixed(0x80, 8, 8, std::bind(dump_op_tinyint8, "PUSHINT ", _1, _2), exec_push_tinyint8))
+      .insert(OpcodeInstr::mkfixed(0x81, 8, 16, dump_push_smallint, exec_push_smallint))
+      .insert(OpcodeInstr::mkextrange(0x82 << 5, (0x82 << 5) + 31, 13, 5, dump_push_int, exec_push_int,
+                                      compute_len_push_int))
+      .insert(OpcodeInstr::mkfixedrange(0x8300, 0x83ff, 16, 8, instr::dump_1c_l_add(1, "PUSHPOW2 "), exec_push_pow2))
+      .insert(OpcodeInstr::mksimple(0x83ff, 16, "PUSHNAN", exec_push_nan))
+      .insert(OpcodeInstr::mkfixed(0x84, 8, 8, instr::dump_1c_l_add(1, "PUSHPOW2DEC "), exec_push_pow2dec))
+      .insert(OpcodeInstr::mkfixed(0x85, 8, 8, instr::dump_1c_l_add(1, "PUSHNEGPOW2 "), exec_push_negpow2));
+}
+
+int exec_add(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ADD";
+  stack.check_underflow(2);
+  auto y = stack.pop_int();
+  stack.push_int_quiet(stack.pop_int() + std::move(y), quiet);
+  return 0;
+}
+
+int exec_sub(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SUB";
+  stack.check_underflow(2);
+  auto y = stack.pop_int();
+  stack.push_int_quiet(stack.pop_int() - std::move(y), quiet);
+  return 0;
+}
+
+int exec_subr(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SUBR";
+  stack.check_underflow(2);
+  auto y = stack.pop_int();
+  stack.push_int_quiet(std::move(y) - stack.pop_int(), quiet);
+  return 0;
+}
+
+int exec_negate(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute NEGATE";
+  stack.check_underflow(1);
+  stack.push_int_quiet(-stack.pop_int(), quiet);
+  return 0;
+}
+
+int exec_inc(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute INC";
+  stack.check_underflow(1);
+  stack.push_int_quiet(stack.pop_int() + 1, quiet);
+  return 0;
+}
+
+int exec_dec(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DEC";
+  stack.check_underflow(1);
+  stack.push_int_quiet(stack.pop_int() - 1, quiet);
+  return 0;
+}
+
+int exec_add_tinyint8(VmState* st, unsigned args, bool quiet) {
+  int x = (signed char)args;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ADDINT " << x;
+  stack.check_underflow(1);
+  stack.push_int_quiet(stack.pop_int() + x, quiet);
+  return 0;
+}
+
+int exec_mul_tinyint8(VmState* st, unsigned args, bool quiet) {
+  int x = (signed char)args;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute MULINT " << x;
+  stack.check_underflow(1);
+  stack.push_int_quiet(stack.pop_int() * x, quiet);
+  return 0;
+}
+
+int exec_mul(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute MUL";
+  stack.check_underflow(2);
+  auto y = stack.pop_int();
+  stack.push_int_quiet(stack.pop_int() * std::move(y), quiet);
+  return 0;
+}
+
+void register_add_mul_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mksimple(0xa0, 8, "ADD", std::bind(exec_add, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xa1, 8, "SUB", std::bind(exec_sub, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xa2, 8, "SUBR", std::bind(exec_subr, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xa3, 8, "NEGATE", std::bind(exec_negate, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xa4, 8, "INC", std::bind(exec_inc, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xa5, 8, "DEC", std::bind(exec_dec, _1, false)))
+      .insert(OpcodeInstr::mkfixed(0xa6, 8, 8, std::bind(dump_op_tinyint8, "ADDINT ", _1, _2),
+                                   std::bind(exec_add_tinyint8, _1, _2, false)))
+      .insert(OpcodeInstr::mkfixed(0xa7, 8, 8, std::bind(dump_op_tinyint8, "MULINT ", _1, _2),
+                                   std::bind(exec_mul_tinyint8, _1, _2, false)))
+      .insert(OpcodeInstr::mksimple(0xa8, 8, "MUL", std::bind(exec_mul, _1, false)));
+  cp0.insert(OpcodeInstr::mksimple(0xb7a0, 16, "QADD", std::bind(exec_add, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xb7a1, 16, "QSUB", std::bind(exec_sub, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xb7a2, 16, "QSUBR", std::bind(exec_subr, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xb7a3, 16, "QNEGATE", std::bind(exec_negate, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xb7a4, 16, "QINC", std::bind(exec_inc, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xb7a5, 16, "QDEC", std::bind(exec_dec, _1, true)))
+      .insert(OpcodeInstr::mkfixed(0xb7a6, 16, 8, std::bind(dump_op_tinyint8, "QADDINT ", _1, _2),
+                                   std::bind(exec_add_tinyint8, _1, _2, true)))
+      .insert(OpcodeInstr::mkfixed(0xb7a7, 16, 8, std::bind(dump_op_tinyint8, "QMULINT ", _1, _2),
+                                   std::bind(exec_mul_tinyint8, _1, _2, true)))
+      .insert(OpcodeInstr::mksimple(0xb7a8, 16, "QMUL", std::bind(exec_mul, _1, true)));
+}
+
+int exec_divmod(VmState* st, unsigned args, int quiet) {
+  int round_mode = (int)(args & 3) - 1;
+  if (!(args & 12) || round_mode == 2) {
+    throw VmError{Excno::inv_opcode};
+  }
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DIV/MOD " << (args & 15);
+  stack.check_underflow(2);
+  auto y = stack.pop_int();
+  auto x = stack.pop_int();
+  switch ((args >> 2) & 3) {
+    case 1:
+      stack.push_int_quiet(td::div(std::move(x), std::move(y), round_mode), quiet);
+      break;
+    case 2:
+      stack.push_int_quiet(td::mod(std::move(x), std::move(y), round_mode), quiet);
+      break;
+    case 3: {
+      auto dm = td::divmod(std::move(x), std::move(y), round_mode);
+      stack.push_int_quiet(std::move(dm.first), quiet);
+      stack.push_int_quiet(std::move(dm.second), quiet);
+      break;
+    }
+  }
+  return 0;
+}
+
+std::string dump_divmod(CellSlice&, unsigned args, bool quiet) {
+  int round_mode = (int)(args & 3);
+  if (!(args & 12) || round_mode == 3) {
+    return "";
+  }
+  std::string s = (args & 4) ? "DIV" : "";
+  if (args & 8) {
+    s += "MOD";
+  }
+  if (quiet) {
+    s = "Q" + s;
+  }
+  return s + "FRC"[round_mode];
+}
+
+int exec_shrmod(VmState* st, unsigned args, int mode) {
+  int y = -1;
+  if (mode & 2) {
+    y = (args & 0xff) + 1;
+    args >>= 8;
+  }
+  int round_mode = (int)(args & 3) - 1;
+  if (!(args & 12) || round_mode == 2) {
+    throw VmError{Excno::inv_opcode};
+  }
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SHR/MOD " << (args & 15) << ',' << y;
+  if (!(mode & 2)) {
+    stack.check_underflow(2);
+    y = stack.pop_smallint_range(256);
+  } else {
+    stack.check_underflow(1);
+  }
+  if (!y) {
+    round_mode = -1;
+  }
+  auto x = stack.pop_int();
+  switch ((args >> 2) & 3) {
+    case 1:
+      stack.push_int_quiet(td::rshift(std::move(x), y, round_mode), mode & 1);
+      break;
+    case 3:
+      stack.push_int_quiet(td::rshift(x, y, round_mode), mode & 1);
+      // fallthrough
+    case 2:
+      x.write().mod_pow2(y, round_mode).normalize();
+      stack.push_int_quiet(std::move(x), mode & 1);
+      break;
+  }
+  return 0;
+}
+
+std::string dump_shrmod(CellSlice&, unsigned args, int mode) {
+  int y = -1;
+  if (mode & 2) {
+    y = (args & 0xff) + 1;
+    args >>= 8;
+  }
+  int round_mode = (int)(args & 3);
+  if (!(args & 12) || round_mode == 3) {
+    return "";
+  }
+  std::string s;
+  switch (args & 12) {
+    case 4:
+      s = "RSHIFT";
+      break;
+    case 8:
+      s = "MODPOW2";
+      break;
+    case 12:
+      s = "RSHIFTMOD";
+      break;
+  }
+  if (mode & 1) {
+    s = "Q" + s;
+  }
+  s += "FRC"[round_mode];
+  if (mode & 2) {
+    char buff[8];
+    sprintf(buff, " %d", y);
+    s += buff;
+  }
+  return s;
+}
+
+int exec_muldivmod(VmState* st, unsigned args, int quiet) {
+  int round_mode = (int)(args & 3) - 1;
+  if (!(args & 12) || round_mode == 2) {
+    throw VmError{Excno::inv_opcode};
+  }
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute MULDIV/MOD " << (args & 15);
+  stack.check_underflow(3);
+  auto z = stack.pop_int();
+  auto y = stack.pop_int();
+  auto x = stack.pop_int();
+  typename td::BigInt256::DoubleInt tmp{0};
+  tmp.add_mul(*x, *y);
+  auto q = td::RefInt256{true};
+  tmp.mod_div(*z, q.unique_write(), round_mode);
+  switch ((args >> 2) & 3) {
+    case 1:
+      q.unique_write().normalize();
+      stack.push_int_quiet(std::move(q), quiet);
+      break;
+    case 3:
+      q.unique_write().normalize();
+      stack.push_int_quiet(std::move(q), quiet);
+      // fallthrough
+    case 2:
+      stack.push_int_quiet(td::RefInt256{true, tmp}, quiet);
+      break;
+  }
+  return 0;
+}
+
+std::string dump_muldivmod(CellSlice&, unsigned args, bool quiet) {
+  int round_mode = (int)(args & 3);
+  if (!(args & 12) || round_mode == 3) {
+    return "";
+  }
+  std::string s = (args & 4) ? "MULDIV" : "MUL";
+  if (args & 8) {
+    s += "MOD";
+  }
+  if (quiet) {
+    s = "Q" + s;
+  }
+  return s + "FRC"[round_mode];
+}
+
+int exec_mulshrmod(VmState* st, unsigned args, int mode) {
+  int z = -1;
+  if (mode & 2) {
+    z = (args & 0xff) + 1;
+    args >>= 8;
+  }
+  int round_mode = (int)(args & 3) - 1;
+  if (!(args & 12) || round_mode == 2) {
+    throw VmError{Excno::inv_opcode};
+  }
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute MULSHR/MOD " << (args & 15) << ',' << z;
+  if (!(mode & 2)) {
+    stack.check_underflow(3);
+    z = stack.pop_smallint_range(256);
+  } else {
+    stack.check_underflow(2);
+  }
+  if (!z) {
+    round_mode = -1;
+  }
+  auto y = stack.pop_int();
+  auto x = stack.pop_int();
+  typename td::BigInt256::DoubleInt tmp{0};
+  tmp.add_mul(*x, *y);
+  switch ((args >> 2) & 3) {
+    case 1:
+      tmp.rshift(z, round_mode).normalize();
+      stack.push_int_quiet(td::RefInt256{true, tmp}, mode & 1);
+      break;
+    case 3: {
+      typename td::BigInt256::DoubleInt tmp2{tmp};
+      tmp2.rshift(z, round_mode).normalize();
+      stack.push_int_quiet(td::RefInt256{true, tmp2}, mode & 1);
+    }
+      // fallthrough
+    case 2:
+      tmp.mod_pow2(z, round_mode).normalize();
+      stack.push_int_quiet(td::RefInt256{true, tmp}, mode & 1);
+      break;
+  }
+  return 0;
+}
+
+std::string dump_mulshrmod(CellSlice&, unsigned args, int mode) {
+  int y = -1;
+  if (mode & 2) {
+    y = (args & 0xff) + 1;
+    args >>= 8;
+  }
+  int round_mode = (int)(args & 3);
+  if (!(args & 12) || round_mode == 3) {
+    return "";
+  }
+  std::string s;
+  switch (args & 12) {
+    case 4:
+      s = "MULRSHIFT";
+      break;
+    case 8:
+      s = "MULMODPOW2";
+      break;
+    case 12:
+      s = "MULRSHIFTMOD";
+      break;
+  }
+  if (mode & 1) {
+    s = "Q" + s;
+  }
+  s += "FRC"[round_mode];
+  if (mode & 2) {
+    char buff[8];
+    sprintf(buff, " %d", y);
+    s += buff;
+  }
+  return s;
+}
+
+int exec_shldivmod(VmState* st, unsigned args, int mode) {
+  int y = -1;
+  if (mode & 2) {
+    y = (args & 0xff) + 1;
+    args >>= 8;
+  }
+  int round_mode = (int)(args & 3) - 1;
+  if (!(args & 12) || round_mode == 2) {
+    throw VmError{Excno::inv_opcode};
+  }
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SHLDIV/MOD " << (args & 15) << ',' << y;
+  if (!(mode & 2)) {
+    stack.check_underflow(3);
+    y = stack.pop_smallint_range(256);
+  } else {
+    stack.check_underflow(2);
+  }
+  auto z = stack.pop_int();
+  auto x = stack.pop_int();
+  typename td::BigInt256::DoubleInt tmp{*x};
+  tmp <<= y;
+  switch ((args >> 2) & 3) {
+    case 1: {
+      auto q = td::RefInt256{true};
+      tmp.mod_div(*z, q.unique_write(), round_mode);
+      q.unique_write().normalize();
+      stack.push_int_quiet(std::move(q), mode & 1);
+      break;
+    }
+    case 3: {
+      auto q = td::RefInt256{true};
+      tmp.mod_div(*z, q.unique_write(), round_mode);
+      q.unique_write().normalize();
+      stack.push_int_quiet(std::move(q), mode & 1);
+      stack.push_int_quiet(td::RefInt256{true, tmp}, mode & 1);
+      break;
+    }
+    case 2: {
+      typename td::BigInt256::DoubleInt tmp2;
+      tmp.mod_div(*z, tmp2, round_mode);
+      stack.push_int_quiet(td::RefInt256{true, tmp}, mode & 1);
+      break;
+    }
+  }
+  return 0;
+}
+
+std::string dump_shldivmod(CellSlice&, unsigned args, bool quiet) {
+  int round_mode = (int)(args & 3);
+  if (!(args & 12) || round_mode == 3) {
+    return "";
+  }
+  std::string s = (args & 4) ? "LSHIFTDIV" : "LSHIFT";
+  if (args & 8) {
+    s += "MOD";
+  }
+  if (quiet) {
+    s = "Q" + s;
+  }
+  return s + "FRC"[round_mode];
+}
+
+void register_div_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mkfixed(0xa90, 12, 4, std::bind(dump_divmod, _1, _2, false),
+                                  std::bind(exec_divmod, _1, _2, false)))
+      .insert(OpcodeInstr::mkfixed(0xa92, 12, 4, std::bind(dump_shrmod, _1, _2, 0), std::bind(exec_shrmod, _1, _2, 0)))
+      .insert(OpcodeInstr::mkfixed(0xa93, 12, 12, std::bind(dump_shrmod, _1, _2, 2), std::bind(exec_shrmod, _1, _2, 2)))
+      .insert(OpcodeInstr::mkfixed(0xa98, 12, 4, std::bind(dump_muldivmod, _1, _2, false),
+                                   std::bind(exec_muldivmod, _1, _2, false)))
+      .insert(OpcodeInstr::mkfixed(0xa9a, 12, 4, std::bind(dump_mulshrmod, _1, _2, 0),
+                                   std::bind(exec_mulshrmod, _1, _2, 0)))
+      .insert(OpcodeInstr::mkfixed(0xa9b, 12, 12, std::bind(dump_mulshrmod, _1, _2, 2),
+                                   std::bind(exec_mulshrmod, _1, _2, 2)))
+      .insert(OpcodeInstr::mkfixed(0xa9c, 12, 4, std::bind(dump_shldivmod, _1, _2, 0),
+                                   std::bind(exec_shldivmod, _1, _2, 0)))
+      .insert(OpcodeInstr::mkfixed(0xa9d, 12, 12, std::bind(dump_shldivmod, _1, _2, 2),
+                                   std::bind(exec_shldivmod, _1, _2, 2)));
+  cp0.insert(OpcodeInstr::mkfixed(0xb7a90, 20, 4, std::bind(dump_divmod, _1, _2, true),
+                                  std::bind(exec_divmod, _1, _2, true)))
+      .insert(
+          OpcodeInstr::mkfixed(0xb7a92, 20, 4, std::bind(dump_shrmod, _1, _2, 1), std::bind(exec_shrmod, _1, _2, 1)))
+      //     .insert(OpcodeInstr::mkfixed(0xb7a93, 20, 12, std::bind(dump_shrmod, _1, _2, 3), std::bind(exec_shrmod, _1, _2, 3)))
+      .insert(OpcodeInstr::mkfixed(0xb7a98, 20, 4, std::bind(dump_muldivmod, _1, _2, true),
+                                   std::bind(exec_muldivmod, _1, _2, true)))
+      .insert(OpcodeInstr::mkfixed(0xb7a9a, 20, 4, std::bind(dump_mulshrmod, _1, _2, 1),
+                                   std::bind(exec_mulshrmod, _1, _2, 1)))
+      //     .insert(OpcodeInstr::mkfixed(0xb7a9b, 20, 12, std::bind(dump_mulshrmod, _1, _2, 3), std::bind(exec_mulshrmod, _1, _2, 3)))
+      .insert(OpcodeInstr::mkfixed(0xb7a9c, 20, 4, std::bind(dump_shldivmod, _1, _2, 1),
+                                   std::bind(exec_shldivmod, _1, _2, 1)))
+      //     .insert(OpcodeInstr::mkfixed(0xb7a9d, 20, 12, std::bind(dump_shldivmod, _1, _2, 3), std::bind(exec_shldivmod, _1, _2, 3)))
+      ;
+}
+
+int exec_lshift_tinyint8(VmState* st, unsigned args, bool quiet) {
+  int x = (args & 0xff) + 1;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute LSHIFT " << x;
+  stack.check_underflow(1);
+  stack.push_int_quiet(stack.pop_int() << x, quiet);
+  return 0;
+}
+
+int exec_rshift_tinyint8(VmState* st, unsigned args, bool quiet) {
+  int x = (args & 0xff) + 1;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute RSHIFT " << x;
+  stack.check_underflow(1);
+  stack.push_int_quiet(stack.pop_int() >> x, quiet);
+  return 0;
+}
+
+int exec_lshift(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute LSHIFT";
+  stack.check_underflow(2);
+  int x = stack.pop_smallint_range(1023);
+  stack.push_int_quiet(stack.pop_int() << x, quiet);
+  return 0;
+}
+
+int exec_rshift(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute RSHIFT";
+  stack.check_underflow(2);
+  int x = stack.pop_smallint_range(1023);
+  stack.push_int_quiet(stack.pop_int() >> x, quiet);
+  return 0;
+}
+
+int exec_pow2(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute POW2";
+  stack.check_underflow(1);
+  int x = stack.pop_smallint_range(1023);
+  td::RefInt256 r{true};
+  r.unique_write().set_pow2(x);
+  stack.push_int_quiet(std::move(r), quiet);
+  return 0;
+}
+
+int exec_and(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute AND";
+  stack.check_underflow(2);
+  auto y = stack.pop_int();
+  stack.push_int_quiet(stack.pop_int() & std::move(y), quiet);
+  return 0;
+}
+
+int exec_or(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute OR";
+  stack.check_underflow(2);
+  auto y = stack.pop_int();
+  stack.push_int_quiet(stack.pop_int() | std::move(y), quiet);
+  return 0;
+}
+
+int exec_xor(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute XOR";
+  stack.check_underflow(2);
+  auto y = stack.pop_int();
+  stack.push_int_quiet(stack.pop_int() ^ std::move(y), quiet);
+  return 0;
+}
+
+int exec_not(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute NOT";
+  stack.check_underflow(1);
+  stack.push_int_quiet(~stack.pop_int(), quiet);
+  return 0;
+}
+
+int exec_fits_tinyint8(VmState* st, unsigned args, bool quiet) {
+  int y = (args & 0xff) + 1;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute FITS " << y;
+  stack.check_underflow(1);
+  auto x = stack.pop_int();
+  if (!x->signed_fits_bits(y)) {
+    x.write().invalidate();
+  }
+  stack.push_int_quiet(std::move(x), quiet);
+  return 0;
+}
+
+int exec_ufits_tinyint8(VmState* st, unsigned args, bool quiet) {
+  int y = (args & 0xff) + 1;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute UFITS " << y;
+  stack.check_underflow(1);
+  auto x = stack.pop_int();
+  if (!x->unsigned_fits_bits(y)) {
+    x.write().invalidate();
+  }
+  stack.push_int_quiet(std::move(x), quiet);
+  return 0;
+}
+
+int exec_fits(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute FITSX";
+  stack.check_underflow(2);
+  int y = stack.pop_smallint_range(1023);
+  auto x = stack.pop_int();
+  if (!x->signed_fits_bits(y)) {
+    x.write().invalidate();
+  }
+  stack.push_int_quiet(std::move(x), quiet);
+  return 0;
+}
+
+int exec_ufits(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute UFITSX";
+  stack.check_underflow(2);
+  int y = stack.pop_smallint_range(1023);
+  auto x = stack.pop_int();
+  if (!x->unsigned_fits_bits(y)) {
+    x.write().invalidate();
+  }
+  stack.push_int_quiet(std::move(x), quiet);
+  return 0;
+}
+
+int exec_bitsize(VmState* st, bool sgnd, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << (sgnd ? "" : "U") << "BITSIZE";
+  stack.check_underflow(1);
+  auto x = stack.pop_int();
+  int y = x->bit_size(sgnd);
+  if (y < 0x7fffffff) {
+    stack.push_smallint(y);
+  } else if (!quiet) {
+    throw VmError{Excno::range_chk, "CHKSIZE for negative integer"};
+  } else {
+    stack.push_int_quiet(td::RefInt256{true}, quiet);
+  }
+  return 0;
+}
+
+void register_shift_logic_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mkfixed(0xaa, 8, 8, instr::dump_1c_l_add(1, "LSHIFT "),
+                                  std::bind(exec_lshift_tinyint8, _1, _2, false)))
+      .insert(OpcodeInstr::mkfixed(0xab, 8, 8, instr::dump_1c_l_add(1, "RSHIFT "),
+                                   std::bind(exec_rshift_tinyint8, _1, _2, false)))
+      .insert(OpcodeInstr::mksimple(0xac, 8, "LSHIFT", std::bind(exec_lshift, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xad, 8, "RSHIFT", std::bind(exec_rshift, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xae, 8, "POW2", std::bind(exec_pow2, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xb0, 8, "AND", std::bind(exec_and, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xb1, 8, "OR", std::bind(exec_or, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xb2, 8, "XOR", std::bind(exec_xor, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xb3, 8, "NOT", std::bind(exec_not, _1, false)))
+      .insert(OpcodeInstr::mkfixed(0xb4, 8, 8, instr::dump_1c_l_add(1, "FITS "),
+                                   std::bind(exec_fits_tinyint8, _1, _2, false)))
+      .insert(OpcodeInstr::mkfixed(0xb5, 8, 8, instr::dump_1c_l_add(1, "UFITS "),
+                                   std::bind(exec_ufits_tinyint8, _1, _2, false)))
+      .insert(OpcodeInstr::mksimple(0xb600, 16, "FITSX", std::bind(exec_fits, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xb601, 16, "UFITSX", std::bind(exec_ufits, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xb602, 16, "BITSIZE", std::bind(exec_bitsize, _1, true, false)))
+      .insert(OpcodeInstr::mksimple(0xb603, 16, "UBITSIZE", std::bind(exec_bitsize, _1, false, false)));
+  cp0.insert(OpcodeInstr::mkfixed(0xb7aa, 16, 8, instr::dump_1c_l_add(1, "QLSHIFT "),
+                                  std::bind(exec_lshift_tinyint8, _1, _2, true)))
+      .insert(OpcodeInstr::mkfixed(0xb7ab, 16, 8, instr::dump_1c_l_add(1, "QRSHIFT "),
+                                   std::bind(exec_rshift_tinyint8, _1, _2, true)))
+      .insert(OpcodeInstr::mksimple(0xb7ac, 16, "QLSHIFT", std::bind(exec_lshift, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xb7ad, 16, "QRSHIFT", std::bind(exec_rshift, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xb7ae, 16, "QPOW2", std::bind(exec_pow2, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xb7b0, 16, "QAND", std::bind(exec_and, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xb7b1, 16, "QOR", std::bind(exec_or, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xb7b2, 16, "QXOR", std::bind(exec_xor, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xb7b3, 16, "QNOT", std::bind(exec_not, _1, true)))
+      .insert(OpcodeInstr::mkfixed(0xb7b4, 16, 8, instr::dump_1c_l_add(1, "QFITS "),
+                                   std::bind(exec_fits_tinyint8, _1, _2, true)))
+      .insert(OpcodeInstr::mkfixed(0xb7b5, 16, 8, instr::dump_1c_l_add(1, "QUFITS "),
+                                   std::bind(exec_ufits_tinyint8, _1, _2, true)))
+      .insert(OpcodeInstr::mksimple(0xb7b600, 24, "QFITSX", std::bind(exec_fits, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xb7b601, 24, "QUFITSX", std::bind(exec_ufits, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xb7b602, 24, "QBITSIZE", std::bind(exec_bitsize, _1, true, true)))
+      .insert(OpcodeInstr::mksimple(0xb7b603, 24, "QUBITSIZE", std::bind(exec_bitsize, _1, false, true)));
+}
+
+int exec_minmax(VmState* st, int mode) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute MINMAXOP " << mode;
+  stack.check_underflow(2);
+  auto x = stack.pop_int();
+  auto y = stack.pop_int();
+  if (!x->is_valid()) {
+    y = x;
+  } else if (!y->is_valid()) {
+    x = y;
+  } else if (cmp(x, y) > 0) {
+    swap(x, y);
+  }
+  if (mode & 2) {
+    stack.push_int_quiet(std::move(x), mode & 1);
+  }
+  if (mode & 4) {
+    stack.push_int_quiet(std::move(y), mode & 1);
+  }
+  return 0;
+}
+
+int exec_abs(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ABS";
+  stack.check_underflow(1);
+  auto x = stack.pop_int();
+  if (x->is_valid() && x->sgn() < 0) {
+    stack.push_int_quiet(-std::move(x), quiet);
+  } else {
+    stack.push_int_quiet(std::move(x), quiet);
+  }
+  return 0;
+}
+
+void register_other_arith_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mksimple(0xb608, 16, "MIN", std::bind(exec_minmax, _1, 2)))
+      .insert(OpcodeInstr::mksimple(0xb609, 16, "MAX", std::bind(exec_minmax, _1, 4)))
+      .insert(OpcodeInstr::mksimple(0xb60a, 16, "MINMAX", std::bind(exec_minmax, _1, 6)))
+      .insert(OpcodeInstr::mksimple(0xb60b, 16, "ABS", std::bind(exec_abs, _1, false)));
+  cp0.insert(OpcodeInstr::mksimple(0xb7b608, 24, "QMIN", std::bind(exec_minmax, _1, 3)))
+      .insert(OpcodeInstr::mksimple(0xb7b609, 24, "QMAX", std::bind(exec_minmax, _1, 5)))
+      .insert(OpcodeInstr::mksimple(0xb7b60a, 24, "QMINMAX", std::bind(exec_minmax, _1, 7)))
+      .insert(OpcodeInstr::mksimple(0xb7b60b, 24, "QABS", std::bind(exec_abs, _1, true)));
+}
+
+int exec_sgn(VmState* st, int mode, bool quiet, const char* name) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(1);
+  auto x = stack.pop_int();
+  if (!x->is_valid()) {
+    stack.push_int_quiet(std::move(x), quiet);
+  } else {
+    int y = td::sgn(std::move(x));
+    stack.push_smallint(((mode >> (4 + y * 4)) & 15) - 8);
+  }
+  return 0;
+}
+
+int exec_cmp(VmState* st, int mode, bool quiet, const char* name) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(2);
+  auto y = stack.pop_int();
+  auto x = stack.pop_int();
+  if (!x->is_valid() || !y->is_valid()) {
+    stack.push_int_quiet(std::move(x), quiet);
+  } else {
+    int z = td::cmp(std::move(x), std::move(y));
+    stack.push_smallint(((mode >> (4 + z * 4)) & 15) - 8);
+  }
+  return 0;
+}
+
+int exec_cmp_int(VmState* st, unsigned args, int mode, bool quiet, const char* name) {
+  int y = (signed char)args;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name << "INT " << y;
+  stack.check_underflow(1);
+  auto x = stack.pop_int();
+  if (!x->is_valid()) {
+    stack.push_int_quiet(std::move(x), quiet);
+  } else {
+    int z = td::cmp(std::move(x), y);
+    stack.push_smallint(((mode >> (4 + z * 4)) & 15) - 8);
+  }
+  return 0;
+}
+
+int exec_is_nan(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ISNAN";
+  stack.check_underflow(1);
+  auto x = stack.pop_int();
+  stack.push_smallint(x->is_valid() ? 0 : -1);
+  return 0;
+}
+
+int exec_chk_nan(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute CHKNAN";
+  stack.check_underflow(1);
+  auto x = stack.pop_int();
+  stack.push_int(std::move(x));
+  return 0;
+}
+
+void register_int_cmp_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mksimple(0xb8, 8, "SGN", std::bind(exec_sgn, _1, 0x987, false, "SGN")))
+      .insert(OpcodeInstr::mksimple(0xb9, 8, "LESS", std::bind(exec_cmp, _1, 0x887, false, "LESS")))
+      .insert(OpcodeInstr::mksimple(0xba, 8, "EQUAL", std::bind(exec_cmp, _1, 0x878, false, "EQUAL")))
+      .insert(OpcodeInstr::mksimple(0xbb, 8, "LEQ", std::bind(exec_cmp, _1, 0x877, false, "LEQ")))
+      .insert(OpcodeInstr::mksimple(0xbc, 8, "GREATER", std::bind(exec_cmp, _1, 0x788, false, "GREATER")))
+      .insert(OpcodeInstr::mksimple(0xbd, 8, "NEQ", std::bind(exec_cmp, _1, 0x787, false, "NEQ")))
+      .insert(OpcodeInstr::mksimple(0xbe, 8, "GEQ", std::bind(exec_cmp, _1, 0x778, false, "GEQ")))
+      .insert(OpcodeInstr::mksimple(0xbf, 8, "CMP", std::bind(exec_cmp, _1, 0x987, false, "CMP")))
+      .insert(OpcodeInstr::mkfixed(0xc0, 8, 8, std::bind(dump_op_tinyint8, "EQINT ", _1, _2),
+                                   std::bind(exec_cmp_int, _1, _2, 0x878, false, "EQ")))
+      .insert(OpcodeInstr::mkfixed(0xc1, 8, 8, std::bind(dump_op_tinyint8, "LESSINT ", _1, _2),
+                                   std::bind(exec_cmp_int, _1, _2, 0x887, false, "LESS")))
+      .insert(OpcodeInstr::mkfixed(0xc2, 8, 8, std::bind(dump_op_tinyint8, "GTINT ", _1, _2),
+                                   std::bind(exec_cmp_int, _1, _2, 0x788, false, "GT")))
+      .insert(OpcodeInstr::mkfixed(0xc3, 8, 8, std::bind(dump_op_tinyint8, "NEQINT ", _1, _2),
+                                   std::bind(exec_cmp_int, _1, _2, 0x787, false, "NEQ")))
+      .insert(OpcodeInstr::mksimple(0xc4, 8, "ISNAN", exec_is_nan))
+      .insert(OpcodeInstr::mksimple(0xc5, 8, "CHKNAN", exec_chk_nan));
+  cp0.insert(OpcodeInstr::mksimple(0xb7b8, 16, "QSGN", std::bind(exec_sgn, _1, 0x987, true, "QSGN")))
+      .insert(OpcodeInstr::mksimple(0xb7b9, 16, "QLESS", std::bind(exec_cmp, _1, 0x887, true, "QLESS")))
+      .insert(OpcodeInstr::mksimple(0xb7ba, 16, "QEQUAL", std::bind(exec_cmp, _1, 0x878, true, "QEQUAL")))
+      .insert(OpcodeInstr::mksimple(0xb7bb, 16, "QLEQ", std::bind(exec_cmp, _1, 0x877, true, "QLEQ")))
+      .insert(OpcodeInstr::mksimple(0xb7bc, 16, "QGREATER", std::bind(exec_cmp, _1, 0x788, true, "QGREATER")))
+      .insert(OpcodeInstr::mksimple(0xb7bd, 16, "QNEQ", std::bind(exec_cmp, _1, 0x787, true, "QNEQ")))
+      .insert(OpcodeInstr::mksimple(0xb7be, 16, "QGEQ", std::bind(exec_cmp, _1, 0x778, true, "QGEQ")))
+      .insert(OpcodeInstr::mksimple(0xb7bf, 16, "QCMP", std::bind(exec_cmp, _1, 0x987, true, "QCMP")))
+      .insert(OpcodeInstr::mkfixed(0xb7c0, 16, 8, std::bind(dump_op_tinyint8, "QEQINT ", _1, _2),
+                                   std::bind(exec_cmp_int, _1, _2, 0x878, true, "QEQ")))
+      .insert(OpcodeInstr::mkfixed(0xb7c1, 16, 8, std::bind(dump_op_tinyint8, "QLESSINT ", _1, _2),
+                                   std::bind(exec_cmp_int, _1, _2, 0x887, true, "QLESS")))
+      .insert(OpcodeInstr::mkfixed(0xb7c2, 16, 8, std::bind(dump_op_tinyint8, "QGTINT ", _1, _2),
+                                   std::bind(exec_cmp_int, _1, _2, 0x788, true, "QGT")))
+      .insert(OpcodeInstr::mkfixed(0xb7c3, 16, 8, std::bind(dump_op_tinyint8, "QNEQINT ", _1, _2),
+                                   std::bind(exec_cmp_int, _1, _2, 0x787, true, "QNEQ")));
+}
+
+void register_arith_ops(OpcodeTable& cp0) {
+  register_int_const_ops(cp0);
+  register_add_mul_ops(cp0);
+  register_div_ops(cp0);
+  register_shift_logic_ops(cp0);
+  register_other_arith_ops(cp0);
+  register_int_cmp_ops(cp0);
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/arithops.h b/submodules/ton/tonlib-src/crypto/vm/arithops.h
new file mode 100644
index 0000000000..1395d8b439
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/arithops.h
@@ -0,0 +1,27 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace vm {
+
+class OpcodeTable;
+
+void register_arith_ops(OpcodeTable& cp0);
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/atom.cpp b/submodules/ton/tonlib-src/crypto/vm/atom.cpp
new file mode 100644
index 0000000000..1b654fa1f7
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/atom.cpp
@@ -0,0 +1,97 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "atom.h"
+
+namespace vm {
+using td::Ref;
+
+std::atomic<Atom*> Atom::hashtable[hashtable_size] = {};
+std::atomic<int> Atom::atoms_defined{0};
+std::atomic<int> Atom::anon_atoms{0};
+
+void Atom::print_to(std::ostream& os) const {
+  if (name_.empty()) {
+    os << "atom#" << index_;
+  } else {
+    os << name_;
+  }
+}
+
+std::string Atom::make_name() const {
+  char buffer[16];
+  sprintf(buffer, "atom#%d", index_);
+  return buffer;
+}
+
+std::ostream& operator<<(std::ostream& os, const Atom& atom) {
+  atom.print_to(os);
+  return os;
+}
+
+std::ostream& operator<<(std::ostream& os, Ref<Atom> atom_ref) {
+  atom_ref->print_to(os);
+  return os;
+}
+
+std::pair<unsigned, unsigned> Atom::compute_hash(td::Slice name) {
+  unsigned h1 = 1, h2 = 1;
+  for (std::size_t i = 0; i < name.size(); i++) {
+    h1 = (239 * h1 + (unsigned char)name[i]) % hashtable_size;
+    h2 = (17 * h2 + (unsigned char)name[i]) % (hashtable_size - 1);
+  }
+  return std::make_pair(h1, h2 + 1);
+}
+
+Ref<Atom> Atom::find(td::Slice name, bool create) {
+  auto hash = compute_hash(name);
+  while (true) {
+    auto& pos = hashtable[hash.first];
+    Atom* ptr = pos.load(std::memory_order_acquire);
+    if (ptr) {
+      if (ptr->name_as_slice() == name) {
+        return Ref<Atom>(ptr);
+      }
+    } else if (!create) {
+      return {};
+    } else {
+      Atom* p2 = new Atom(name.str(), hash.first);
+      Atom* p1 = nullptr;
+      if (pos.compare_exchange_strong(p1, p2)) {
+        atoms_defined.fetch_add(1, std::memory_order_relaxed);
+        return Ref<Atom>(p2);
+      }
+      delete p2;
+      CHECK(p1);
+      if (p1->name_as_slice() == name) {
+        return Ref<Atom>(p1);
+      }
+    }
+    hash.first += hash.second;
+    if (hash.first >= hashtable_size) {
+      hash.first -= hashtable_size;
+    }
+  }
+}
+
+Ref<Atom> Atom::anon() {
+  int c = anon_atoms.fetch_add(1, std::memory_order_relaxed);
+  return Ref<Atom>{true, "", ~c};
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/atom.h b/submodules/ton/tonlib-src/crypto/vm/atom.h
new file mode 100644
index 0000000000..08e4063248
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/atom.h
@@ -0,0 +1,70 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <atomic>
+#include "vm/stack.hpp"
+#include "td/utils/Slice.h"
+
+namespace vm {
+using td::Ref;
+
+class Atom : public td::CntObject {
+  std::string name_;
+  int index_;
+  static constexpr unsigned hashtable_size = 170239;
+  static std::atomic<Atom*> hashtable[hashtable_size];
+  static std::atomic<int> atoms_defined;
+  static std::atomic<int> anon_atoms;
+  static std::pair<unsigned, unsigned> compute_hash(td::Slice name);
+
+ public:
+  Atom(const Atom&) = delete;
+  Atom &operator=(const Atom&) = delete;
+  Atom(Atom&&) = delete;
+  Atom &operator=(Atom&&) = delete;
+  ~Atom() override = default;
+  Atom(std::string name, int index) : name_(name), index_(index) {
+  }
+  static Ref<Atom> anon();
+  static Ref<Atom> find(td::Slice name, bool create = false);
+  static Ref<Atom> create(td::Slice name) {
+    return find(std::move(name), true);
+  }
+  std::string name() const {
+    return name_;
+  }
+  std::string name_ext() const {
+    return name_.empty() ? make_name() : name_;
+  }
+  td::Slice name_as_slice() const {
+    return td::Slice{name_};
+  }
+  int index() const {
+    return index_;
+  }
+  void print_to(std::ostream& os) const;
+
+ private:
+  std::string make_name() const;
+};
+
+std::ostream& operator<<(std::ostream& os, const Atom& atom);
+std::ostream& operator<<(std::ostream& os, Ref<Atom> atom_ref);
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/boc.cpp b/submodules/ton/tonlib-src/crypto/vm/boc.cpp
new file mode 100644
index 0000000000..0ea69f3b80
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/boc.cpp
@@ -0,0 +1,1133 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <iostream>
+#include <iomanip>
+#include <algorithm>
+#include "vm/boc.h"
+#include "vm/cells.h"
+#include "vm/cellslice.h"
+#include "td/utils/bits.h"
+#include "td/utils/Slice-decl.h"
+#include "td/utils/format.h"
+#include "td/utils/crypto.h"
+
+namespace vm {
+using td::Ref;
+
+td::Status CellSerializationInfo::init(td::Slice data, int ref_byte_size) {
+  if (data.size() < 2) {
+    return td::Status::Error(PSLICE() << "Not enough bytes " << td::tag("got", data.size())
+                                      << td::tag("expected", "at least 2"));
+  }
+  TRY_STATUS(init(data.ubegin()[0], data.ubegin()[1], ref_byte_size));
+  if (data.size() < end_offset) {
+    return td::Status::Error(PSLICE() << "Not enough bytes " << td::tag("got", data.size())
+                                      << td::tag("expected", end_offset));
+  }
+  return td::Status::OK();
+}
+
+td::Status CellSerializationInfo::init(td::uint8 d1, td::uint8 d2, int ref_byte_size) {
+  refs_cnt = d1 & 7;
+  level_mask = Cell::LevelMask(d1 >> 5);
+  special = (d1 & 8) != 0;
+  with_hashes = (d1 & 16) != 0;
+
+  if (refs_cnt > 4) {
+    if (refs_cnt != 7 || !with_hashes) {
+      return td::Status::Error("Invalid first byte");
+    }
+    refs_cnt = 0;
+    // ...
+    // do not deserialize absent cells!
+    return td::Status::Error("TODO: absent cells");
+  }
+
+  hashes_offset = 2;
+  auto n = level_mask.get_hashes_count();
+  depth_offset = hashes_offset + (with_hashes ? n * Cell::hash_bytes : 0);
+  data_offset = depth_offset + (with_hashes ? n * Cell::depth_bytes : 0);
+  data_len = (d2 >> 1) + (d2 & 1);
+  data_with_bits = (d2 & 1) != 0;
+  refs_offset = data_offset + data_len;
+  end_offset = refs_offset + refs_cnt * ref_byte_size;
+
+  return td::Status::OK();
+}
+
+td::Result<int> CellSerializationInfo::get_bits(td::Slice cell) const {
+  if (data_with_bits) {
+    DCHECK(data_len != 0);
+    int last = cell[data_offset + data_len - 1];
+    if (!last || last == 0x80) {
+      return td::Status::Error("overlong encoding");
+    }
+    return td::narrow_cast<int>((data_len - 1) * 8 + 7 - td::count_trailing_zeroes_non_zero32(last));
+  } else {
+    return td::narrow_cast<int>(data_len * 8);
+  }
+}
+
+// TODO: check usage when result is empty
+td::Result<Ref<DataCell>> CellSerializationInfo::create_data_cell(td::Slice cell_slice,
+                                                                  td::Span<Ref<Cell>> refs) const {
+  CellBuilder cb;
+  TRY_RESULT(bits, get_bits(cell_slice));
+  cb.store_bits(cell_slice.ubegin() + data_offset, bits);
+  DCHECK(refs_cnt == (td::int64)refs.size());
+  for (int k = 0; k < refs_cnt; k++) {
+    cb.store_ref(std::move(refs[k]));
+  }
+  auto res = cb.finalize_novm(special);
+  if (res.is_null()) {
+    return td::Status::Error("CellBuilder::finalize failed");
+  }
+  if (res->is_special() != special) {
+    return td::Status::Error("is_special mismatch");
+  }
+  if (res->get_level_mask() != level_mask) {
+    return td::Status::Error("level mask mismatch");
+  }
+  //return res;
+  if (with_hashes) {
+    auto hash_n = level_mask.get_hashes_count();
+    if (res->get_hash().as_slice() !=
+        cell_slice.substr(hashes_offset + Cell::hash_bytes * (hash_n - 1), Cell::hash_bytes)) {
+      return td::Status::Error("representation hash mismatch");
+    }
+    if (res->get_depth() !=
+        DataCell::load_depth(
+            cell_slice.substr(depth_offset + Cell::depth_bytes * (hash_n - 1), Cell::depth_bytes).ubegin())) {
+      return td::Status::Error("depth mismatch");
+    }
+
+    bool check_all_hashes = true;
+    for (unsigned level_i = 0, hash_i = 0, level = level_mask.get_level(); check_all_hashes && level_i < level;
+         level_i++) {
+      if (!level_mask.is_significant(level_i)) {
+        continue;
+      }
+      if (cell_slice.substr(hashes_offset + Cell::hash_bytes * hash_i, Cell::hash_bytes) !=
+          res->get_hash(level_i).as_slice()) {
+        // hash mismatch
+        return td::Status::Error("lower hash mismatch");
+      }
+      if (res->get_depth(level_i) !=
+          DataCell::load_depth(
+              cell_slice.substr(depth_offset + Cell::depth_bytes * hash_i, Cell::depth_bytes).ubegin())) {
+        return td::Status::Error("lower depth mismatch");
+      }
+      hash_i++;
+    }
+  }
+  return res;
+}
+
+void BagOfCells::clear() {
+  cells_clear();
+  roots.clear();
+  root_count = 0;
+  serialized.clear();
+}
+
+int BagOfCells::set_roots(const std::vector<td::Ref<vm::Cell>>& new_roots) {
+  clear();
+  return add_roots(new_roots);
+}
+
+int BagOfCells::set_root(td::Ref<vm::Cell> new_root) {
+  clear();
+  return add_root(std::move(new_root));
+}
+
+int BagOfCells::add_roots(const std::vector<td::Ref<vm::Cell>>& add_roots) {
+  int res = 0;
+  for (td::Ref<vm::Cell> root : add_roots) {
+    res += add_root(std::move(root));
+  }
+  return res;
+}
+
+int BagOfCells::add_root(td::Ref<vm::Cell> add_root) {
+  if (add_root.is_null()) {
+    return 0;
+  }
+  LOG_CHECK(add_root->get_virtualization() == 0) << "TODO: support serialization of virtualized cells";
+  //const Cell::Hash& hash = add_root->get_hash();
+  //for (const auto& root_info : roots) {
+  //if (root_info.cell->get_hash() == hash) {
+  //return 0;
+  //}
+  //}
+  roots.emplace_back(std::move(add_root), -1);
+  ++root_count;
+  cells_clear();
+  return 1;
+}
+
+td::Status BagOfCells::import_cells() {
+  cells_clear();
+  for (auto& root : roots) {
+    auto res = import_cell(root.cell, 0);
+    if (res.is_error()) {
+      return res.move_as_error();
+    }
+    root.idx = res.move_as_ok();
+  }
+  //LOG(INFO) << "[cells: " << cell_count << ", refs: " << int_refs << ", bytes: " << data_bytes << "]";
+  reorder_cells();
+  //LOG(INFO) << "[cells: " << cell_count << ", refs: " << int_refs << ", bytes: " << data_bytes
+  //<< ", internal hashes: " << int_hashes << ", top hashes: " << top_hashes << "]";
+  CHECK(cell_count != 0);
+  return td::Status::OK();
+}
+
+td::Result<int> BagOfCells::import_cell(td::Ref<vm::Cell> cell, int depth) {
+  if (depth > max_depth) {
+    return td::Status::Error("error while importing a cell into a bag of cells: cell depth too large");
+  }
+  if (cell.is_null()) {
+    return td::Status::Error("error while importing a cell into a bag of cells: cell is null");
+  }
+  auto it = cells.find(cell->get_hash());
+  if (it != cells.end()) {
+    auto pos = it->second;
+    cell_list_[pos].should_cache = true;
+    return pos;
+  }
+  if (cell->get_virtualization() != 0) {
+    return td::Status::Error(
+        "error while importing a cell into a bag of cells: cell has non-zero virtualization level");
+  }
+  auto r_loaded_dc = cell->load_cell();
+  if (r_loaded_dc.is_error()) {
+    return td::Status::Error("error while importing a cell into a bag of cells: " +
+                             r_loaded_dc.move_as_error().to_string());
+  }
+  auto loaded_dc = r_loaded_dc.move_as_ok();
+  CellSlice cs(std::move(loaded_dc));
+  std::array<int, 4> refs{-1};
+  DCHECK(cs.size_refs() <= 4);
+  unsigned sum_child_wt = 1;
+  for (unsigned i = 0; i < cs.size_refs(); i++) {
+    auto ref = import_cell(cs.prefetch_ref(i), depth + 1);
+    if (ref.is_error()) {
+      return ref.move_as_error();
+    }
+    refs[i] = ref.move_as_ok();
+    sum_child_wt += cell_list_[refs[i]].wt;
+    ++int_refs;
+  }
+  DCHECK(cell_list_.size() == static_cast<std::size_t>(cell_count));
+  auto dc = cs.move_as_loaded_cell().data_cell;
+  auto res = cells.emplace(dc->get_hash(), cell_count);
+  DCHECK(res.second);
+  cell_list_.emplace_back(dc, dc->size_refs(), refs);
+  CellInfo& dc_info = cell_list_.back();
+  dc_info.hcnt = static_cast<unsigned char>(dc->get_level_mask().get_hashes_count());
+  dc_info.wt = static_cast<unsigned char>(std::min(0xffU, sum_child_wt));
+  dc_info.new_idx = -1;
+  data_bytes += dc->get_serialized_size();
+  return cell_count++;
+}
+
+void BagOfCells::reorder_cells() {
+  int_hashes = 0;
+  for (int i = cell_count - 1; i >= 0; --i) {
+    CellInfo& dci = cell_list_[i];
+    int s = dci.ref_num, c = s, sum = max_cell_whs - 1, mask = 0;
+    for (int j = 0; j < s; ++j) {
+      CellInfo& dcj = cell_list_[dci.ref_idx[j]];
+      int limit = (max_cell_whs - 1 + j) / s;
+      if (dcj.wt <= limit) {
+        sum -= dcj.wt;
+        --c;
+        mask |= (1 << j);
+      }
+    }
+    if (c) {
+      for (int j = 0; j < s; ++j) {
+        if (!(mask & (1 << j))) {
+          CellInfo& dcj = cell_list_[dci.ref_idx[j]];
+          int limit = sum++ / c;
+          if (dcj.wt > limit) {
+            dcj.wt = static_cast<unsigned char>(limit);
+          }
+        }
+      }
+    }
+  }
+  for (int i = 0; i < cell_count; i++) {
+    CellInfo& dci = cell_list_[i];
+    int s = dci.ref_num, sum = 1;
+    for (int j = 0; j < s; ++j) {
+      sum += cell_list_[dci.ref_idx[j]].wt;
+    }
+    DCHECK(sum <= max_cell_whs);
+    if (sum <= dci.wt) {
+      dci.wt = static_cast<unsigned char>(sum);
+    } else {
+      dci.wt = 0;
+      int_hashes += dci.hcnt;
+    }
+  }
+  top_hashes = 0;
+  for (auto& root_info : roots) {
+    auto& cell_info = cell_list_[root_info.idx];
+    if (cell_info.is_root_cell) {
+      cell_info.is_root_cell = true;
+      if (cell_info.wt) {
+        top_hashes += cell_info.hcnt;
+      }
+    }
+  }
+  if (cell_count > 0) {
+    rv_idx = 0;
+    cell_list_tmp.clear();
+    cell_list_tmp.reserve(cell_count);
+
+    for (const auto& root_info : roots) {
+      revisit(root_info.idx, 0);
+      revisit(root_info.idx, 1);
+    }
+    for (const auto& root_info : roots) {
+      revisit(root_info.idx, 2);
+    }
+    for (auto& root_info : roots) {
+      root_info.idx = cell_list_[root_info.idx].new_idx;
+    }
+
+    DCHECK(rv_idx == cell_count);
+    //DCHECK(cell_list.back().new_idx == cell_count - 1);
+    DCHECK(cell_list_.size() == cell_list_tmp.size());
+    cell_list_ = std::move(cell_list_tmp);
+    cell_list_tmp.clear();
+  }
+}
+
+// force=0 : previsit (recursively until special cells are found; then visit them)
+// force=1 : visit (allocate and process all children)
+// force=2 : allocate (assign a new index; can be run only after visiting)
+int BagOfCells::revisit(int cell_idx, int force) {
+  DCHECK(cell_idx >= 0 && cell_idx < cell_count);
+  CellInfo& dci = cell_list_[cell_idx];
+  if (dci.new_idx >= 0) {
+    return dci.new_idx;
+  }
+  if (!force) {
+    // previsit
+    if (dci.new_idx != -1) {
+      // already previsited or visited
+      return dci.new_idx;
+    }
+    int n = dci.ref_num;
+    for (int j = n - 1; j >= 0; --j) {
+      int child_idx = dci.ref_idx[j];
+      // either previsit or visit child, depending on whether it is special
+      revisit(dci.ref_idx[j], cell_list_[child_idx].is_special());
+    }
+    return dci.new_idx = -2;  // mark as previsited
+  }
+  if (force > 1) {
+    // time to allocate
+    auto i = dci.new_idx = rv_idx++;
+    cell_list_tmp.emplace_back(std::move(dci));
+    return i;
+  }
+  if (dci.new_idx == -3) {
+    // already visited
+    return dci.new_idx;
+  }
+  if (dci.is_special()) {
+    // if current cell is special, previsit it first
+    revisit(cell_idx, 0);
+  }
+  // visit children
+  int n = dci.ref_num;
+  for (int j = n - 1; j >= 0; --j) {
+    revisit(dci.ref_idx[j], 1);
+  }
+  // allocate children
+  for (int j = n - 1; j >= 0; --j) {
+    dci.ref_idx[j] = revisit(dci.ref_idx[j], 2);
+  }
+  return dci.new_idx = -3;  // mark as visited (and all children processed)
+}
+
+td::uint64 BagOfCells::compute_sizes(int mode, int& r_size, int& o_size) {
+  int rs = 0, os = 0;
+  if (!root_count || !data_bytes) {
+    r_size = o_size = 0;
+    return 0;
+  }
+  while (cell_count >= (1 << (rs << 3))) {
+    rs++;
+  }
+  td::uint64 hashes =
+      (((mode & Mode::WithTopHash) ? top_hashes : 0) + ((mode & Mode::WithIntHashes) ? int_hashes : 0)) *
+      (Cell::hash_bytes + Cell::depth_bytes);
+  td::uint64 data_bytes_adj = data_bytes + (unsigned long long)int_refs * rs + hashes;
+  td::uint64 max_offset = (mode & Mode::WithCacheBits) ? data_bytes_adj * 2 : data_bytes_adj;
+  while (max_offset >= (1ULL << (os << 3))) {
+    os++;
+  }
+  if (rs > 4 || os > 8) {
+    r_size = o_size = 0;
+    return 0;
+  }
+  if (!(mode & Mode::WithIndex)) {
+    if (rs > 2 || os > 4) {
+      rs = std::max(3, rs);
+      os = 8;
+      data_bytes_adj = data_bytes + (unsigned long long)int_refs * rs + hashes;
+    } else {
+      os = 4;
+    }
+  }
+  r_size = rs;
+  o_size = os;
+  return data_bytes_adj;
+}
+
+std::size_t BagOfCells::estimate_serialized_size(int mode) {
+  if ((mode & Mode::WithCacheBits) && !(mode & Mode::WithIndex)) {
+    info.invalidate();
+    return 0;
+  }
+  auto data_bytes_adj = compute_sizes(mode, info.ref_byte_size, info.offset_byte_size);
+  if (!data_bytes_adj) {
+    info.invalidate();
+    return 0;
+  }
+  info.valid = true;
+  info.has_crc32c = mode & Mode::WithCRC32C;
+  info.has_index = mode & Mode::WithIndex;
+  info.has_cache_bits = mode & Mode::WithCacheBits;
+  info.root_count = root_count;
+  info.cell_count = cell_count;
+  info.absent_count = dangle_count;
+  int crc_size = info.has_crc32c ? 4 : 0;
+  info.roots_offset = 4 + 1 + 1 + 3 * info.ref_byte_size + info.offset_byte_size;
+  info.index_offset = info.roots_offset + info.root_count * info.ref_byte_size;
+  info.data_offset = info.index_offset;
+  if (info.has_index) {
+    info.data_offset += (long long)cell_count * info.offset_byte_size;
+  }
+  info.magic = Info::boc_generic;
+  info.data_size = data_bytes_adj;
+  info.total_size = info.data_offset + data_bytes_adj + crc_size;
+  auto res = td::narrow_cast_safe<size_t>(info.total_size);
+  if (res.is_error()) {
+    return 0;
+  }
+  return res.ok();
+}
+
+BagOfCells& BagOfCells::serialize(int mode) {
+  std::size_t size_est = estimate_serialized_size(mode);
+  if (!size_est) {
+    serialized.clear();
+    return *this;
+  }
+  serialized.resize(size_est);
+  if (serialize_to(const_cast<unsigned char*>(serialized.data()), serialized.size(), mode) != size_est) {
+    serialized.clear();
+  }
+  return *this;
+}
+
+std::string BagOfCells::serialize_to_string(int mode) {
+  std::size_t size_est = estimate_serialized_size(mode);
+  if (!size_est) {
+    return {};
+  }
+  std::string res;
+  res.resize(size_est, 0);
+  if (serialize_to(const_cast<unsigned char*>(reinterpret_cast<const unsigned char*>(res.data())), res.size(), mode) ==
+      res.size()) {
+    return res;
+  } else {
+    return {};
+  }
+}
+
+td::Result<td::BufferSlice> BagOfCells::serialize_to_slice(int mode) {
+  std::size_t size_est = estimate_serialized_size(mode);
+  if (!size_est) {
+    return td::Status::Error("no cells to serialize to this bag of cells");
+  }
+  td::BufferSlice res(size_est);
+  if (serialize_to(const_cast<unsigned char*>(reinterpret_cast<const unsigned char*>(res.data())), res.size(), mode) ==
+      res.size()) {
+    return std::move(res);
+  } else {
+    return td::Status::Error("error while serializing a bag of cells: actual serialized size differs from estimated");
+  }
+}
+
+std::string BagOfCells::extract_string() const {
+  return std::string{serialized.data(), serialized.data() + serialized.size()};
+}
+
+void BagOfCells::store_uint(unsigned long long value, unsigned bytes) {
+  unsigned char* ptr = store_ptr += bytes;
+  store_chk();
+  while (bytes) {
+    *--ptr = value & 0xff;
+    value >>= 8;
+    --bytes;
+  }
+  DCHECK(!bytes);
+}
+
+//serialized_boc#672fb0ac has_idx:(## 1) has_crc32c:(## 1)
+//  has_cache_bits:(## 1) flags:(## 2) { flags = 0 }
+//  size:(## 3) { size <= 4 }
+//  off_bytes:(## 8) { off_bytes <= 8 }
+//  cells:(##(size * 8))
+//  roots:(##(size * 8))
+//  absent:(##(size * 8)) { roots + absent <= cells }
+//  tot_cells_size:(##(off_bytes * 8))
+//  index:(cells * ##(off_bytes * 8))
+//  cell_data:(tot_cells_size * [ uint8 ])
+//  = BagOfCells;
+std::size_t BagOfCells::serialize_to(unsigned char* buffer, std::size_t buff_size, int mode) {
+  std::size_t size_est = estimate_serialized_size(mode);
+  if (!size_est || size_est > buff_size) {
+    return 0;
+  }
+  init_store(buffer, buffer + size_est);
+  store_uint(info.magic, 4);
+
+  td::uint8 byte{0};
+  if (info.has_index) {
+    byte |= 1 << 7;
+  }
+  if (info.has_crc32c) {
+    byte |= 1 << 6;
+  }
+  if (info.has_cache_bits) {
+    byte |= 1 << 5;
+  }
+  // 3, 4 - flags
+  if (info.ref_byte_size < 1 || info.ref_byte_size > 7) {
+    return 0;
+  }
+  byte |= static_cast<td::uint8>(info.ref_byte_size);
+  store_uint(byte, 1);
+
+  store_uint(info.offset_byte_size, 1);
+  store_ref(cell_count);
+  store_ref(root_count);
+  store_ref(0);
+  store_offset(info.data_size);
+  for (const auto& root_info : roots) {
+    int k = cell_count - 1 - root_info.idx;
+    DCHECK(k >= 0 && k < cell_count);
+    store_ref(k);
+  }
+  DCHECK(store_ptr - buffer == (long long)info.index_offset);
+  DCHECK((unsigned)cell_count == cell_list_.size());
+  if (info.has_index) {
+    std::size_t offs = 0;
+    for (int i = cell_count - 1; i >= 0; --i) {
+      const Ref<DataCell>& dc = cell_list_[i].dc_ref;
+      bool with_hash = (mode & Mode::WithIntHashes) && !cell_list_[i].wt;
+      if (cell_list_[i].is_root_cell && (mode & Mode::WithTopHash)) {
+        with_hash = true;
+      }
+      offs += dc->get_serialized_size(with_hash) + dc->size_refs() * info.ref_byte_size;
+      auto fixed_offset = offs;
+      if (info.has_cache_bits) {
+        fixed_offset = offs * 2 + cell_list_[i].should_cache;
+      }
+      store_offset(fixed_offset);
+    }
+    DCHECK(offs == info.data_size);
+  }
+  DCHECK(store_ptr - buffer == (long long)info.data_offset);
+  unsigned char* keep_ptr = store_ptr;
+  for (int i = 0; i < cell_count; ++i) {
+    const auto& dc_info = cell_list_[cell_count - 1 - i];
+    const Ref<DataCell>& dc = dc_info.dc_ref;
+    bool with_hash = (mode & Mode::WithIntHashes) && !dc_info.wt;
+    if (dc_info.is_root_cell && (mode & Mode::WithTopHash)) {
+      with_hash = true;
+    }
+    int s = dc->serialize(store_ptr, 256, with_hash);
+    store_ptr += s;
+    store_chk();
+    DCHECK(dc->size_refs() == dc_info.ref_num);
+    // std::cerr << (dc_info.is_special() ? '*' : ' ') << i << '<' << (int)dc_info.wt << ">:";
+    for (unsigned j = 0; j < dc_info.ref_num; ++j) {
+      int k = cell_count - 1 - dc_info.ref_idx[j];
+      DCHECK(k > i && k < cell_count);
+      store_ref(k);
+      // std::cerr << ' ' << k;
+    }
+    // std::cerr << std::endl;
+  }
+  store_chk();
+  DCHECK(store_ptr - keep_ptr == (long long)info.data_size);
+  DCHECK(store_end - store_ptr == (info.has_crc32c ? 4 : 0));
+  if (info.has_crc32c) {
+    // compute crc32c of buffer .. store_ptr
+    unsigned crc = td::crc32c(td::Slice{buffer, store_ptr});
+    store_uint(td::bswap32(crc), 4);
+  }
+  DCHECK(store_empty());
+  return store_ptr - buffer;
+}
+
+unsigned long long BagOfCells::Info::read_int(const unsigned char* ptr, unsigned bytes) {
+  unsigned long long res = 0;
+  while (bytes > 0) {
+    res = (res << 8) + *ptr++;
+    --bytes;
+  }
+  return res;
+}
+
+void BagOfCells::Info::write_int(unsigned char* ptr, unsigned long long value, int bytes) {
+  ptr += bytes;
+  while (bytes) {
+    *--ptr = value & 0xff;
+    value >>= 8;
+    --bytes;
+  }
+  DCHECK(!bytes);
+}
+
+long long BagOfCells::Info::parse_serialized_header(const td::Slice& slice) {
+  invalidate();
+  int sz = static_cast<int>(std::min(slice.size(), static_cast<std::size_t>(0xffff)));
+  if (sz < 4) {
+    return -10;  // want at least 10 bytes
+  }
+  const unsigned char* ptr = slice.ubegin();
+  magic = (unsigned)read_int(ptr, 4);
+  has_crc32c = false;
+  has_index = false;
+  has_cache_bits = false;
+  ref_byte_size = 0;
+  offset_byte_size = 0;
+  root_count = cell_count = absent_count = -1;
+  index_offset = data_offset = data_size = total_size = 0;
+  if (magic != boc_generic && magic != boc_idx && magic != boc_idx_crc32c) {
+    magic = 0;
+    return 0;
+  }
+  if (sz < 5) {
+    return -10;
+  }
+  td::uint8 byte = ptr[4];
+  if (magic == boc_generic) {
+    has_index = (byte >> 7) % 2 == 1;
+    has_crc32c = (byte >> 6) % 2 == 1;
+    has_cache_bits = (byte >> 5) % 2 == 1;
+  } else {
+    has_index = true;
+    has_crc32c = magic == boc_idx_crc32c;
+  }
+  if (has_cache_bits && !has_index) {
+    return 0;
+  }
+  ref_byte_size = byte & 7;
+  if (ref_byte_size > 4 || ref_byte_size < 1) {
+    return 0;
+  }
+  if (sz < 6) {
+    return -7 - 3 * ref_byte_size;
+  }
+  offset_byte_size = ptr[5];
+  if (offset_byte_size > 8 || offset_byte_size < 1) {
+    return 0;
+  }
+  roots_offset = 6 + 3 * ref_byte_size + offset_byte_size;
+  ptr += 6;
+  sz -= 6;
+  if (sz < ref_byte_size) {
+    return -(int)roots_offset;
+  }
+  cell_count = (int)read_ref(ptr);
+  if (cell_count < 0) {
+    cell_count = -1;
+    return 0;
+  }
+  if (sz < 2 * ref_byte_size) {
+    return -static_cast<int>(roots_offset);
+  }
+  root_count = (int)read_ref(ptr + ref_byte_size);
+  if (root_count <= 0) {
+    root_count = -1;
+    return 0;
+  }
+  index_offset = roots_offset;
+  if (magic == boc_generic) {
+    index_offset += root_count * ref_byte_size;
+    has_roots = true;
+  } else {
+    if (root_count != 1) {
+      return 0;
+    }
+  }
+  data_offset = index_offset;
+  if (has_index) {
+    data_offset += (long long)cell_count * offset_byte_size;
+  }
+  if (sz < 3 * ref_byte_size) {
+    return -static_cast<int>(roots_offset);
+  }
+  absent_count = (int)read_ref(ptr + 2 * ref_byte_size);
+  if (absent_count < 0 || absent_count > cell_count) {
+    return 0;
+  }
+  if (sz < 3 * ref_byte_size + offset_byte_size) {
+    return -(int)roots_offset;
+  }
+  data_size = read_offset(ptr + 3 * ref_byte_size);
+  if (data_size > ((unsigned long long)cell_count << 10)) {
+    return 0;
+  }
+  valid = true;
+  total_size = data_offset + data_size + (has_crc32c ? 4 : 0);
+  return total_size;
+}
+
+td::Result<td::Slice> BagOfCells::get_cell_slice(int idx, td::Slice data) {
+  unsigned long long offs = get_idx_entry(idx - 1);
+  unsigned long long offs_end = get_idx_entry(idx);
+  if (offs > offs_end || offs_end > data.size()) {
+    return td::Status::Error(PSLICE() << "invalid index entry [" << offs << "; " << offs_end << "], "
+                                      << td::tag("data.size()", data.size()));
+  }
+  return data.substr(offs, td::narrow_cast<size_t>(offs_end - offs));
+}
+
+td::Result<td::Ref<vm::DataCell>> BagOfCells::deserialize_cell(int idx, td::Slice cells_slice,
+                                                               td::Span<td::Ref<DataCell>> cells_span,
+                                                               std::vector<td::uint8>* cell_should_cache) {
+  TRY_RESULT(cell_slice, get_cell_slice(idx, cells_slice));
+  std::array<td::Ref<Cell>, 4> refs_buf;
+
+  CellSerializationInfo cell_info;
+  TRY_STATUS(cell_info.init(cell_slice, info.ref_byte_size));
+  if (cell_info.end_offset != cell_slice.size()) {
+    return td::Status::Error("unused space in cell serialization");
+  }
+
+  auto refs = td::MutableSpan<td::Ref<Cell>>(refs_buf).substr(0, cell_info.refs_cnt);
+  for (int k = 0; k < cell_info.refs_cnt; k++) {
+    int ref_idx = (int)info.read_ref(cell_slice.ubegin() + cell_info.refs_offset + k * info.ref_byte_size);
+    if (ref_idx <= idx) {
+      return td::Status::Error(PSLICE() << "bag-of-cells error: reference #" << k << " of cell #" << idx
+                                        << " is to cell #" << ref_idx << " with smaller index");
+    }
+    if (ref_idx >= cell_count) {
+      return td::Status::Error(PSLICE() << "bag-of-cells error: reference #" << k << " of cell #" << idx
+                                        << " is to non-existent cell #" << ref_idx << ", only " << cell_count
+                                        << " cells are defined");
+    }
+    refs[k] = cells_span[cell_count - ref_idx - 1];
+    if (cell_should_cache) {
+      auto& cnt = (*cell_should_cache)[ref_idx];
+      if (cnt < 2) {
+        cnt++;
+      }
+    }
+  }
+
+  return cell_info.create_data_cell(cell_slice, refs);
+}
+
+td::Result<long long> BagOfCells::deserialize(const td::Slice& data) {
+  clear();
+  long long size_est = info.parse_serialized_header(data);
+  //LOG(INFO) << "estimated size " << size_est << ", true size " << data.size();
+  if (size_est == 0) {
+    return td::Status::Error(PSLICE() << "cannot deserialize bag-of-cells: invalid header, error " << size_est);
+  }
+
+  if (size_est < 0) {
+    //LOG(ERROR) << "cannot deserialize bag-of-cells: not enough bytes (" << data.size() << " present, " << -size_est
+    //<< " required)";
+    return size_est;
+  }
+
+  if (size_est > (long long)data.size()) {
+    //LOG(ERROR) << "cannot deserialize bag-of-cells: not enough bytes (" << data.size() << " present, " << size_est
+    //<< " required)";
+    return -size_est;
+  }
+  //LOG(INFO) << "estimated size " << size_est << ", true size " << data.size();
+  if (info.has_crc32c) {
+    unsigned crc_computed = td::crc32c(td::Slice{data.ubegin(), data.uend() - 4});
+    unsigned crc_stored = td::as<unsigned>(data.uend() - 4);
+    if (crc_computed != crc_stored) {
+      return td::Status::Error(PSLICE() << "bag-of-cells CRC32C mismatch: expected " << td::format::as_hex(crc_computed)
+                                        << ", found " << td::format::as_hex(crc_stored));
+    }
+  }
+
+  cell_count = info.cell_count;
+  std::vector<td::uint8> cell_should_cache;
+  if (info.has_cache_bits) {
+    cell_should_cache.resize(cell_count, 0);
+  }
+  roots.clear();
+  roots.resize(info.root_count);
+  auto* roots_ptr = data.substr(info.roots_offset).ubegin();
+  for (int i = 0; i < info.root_count; i++) {
+    int idx = 0;
+    if (info.has_roots) {
+      idx = (int)info.read_ref(roots_ptr + i * info.ref_byte_size);
+    }
+    if (idx < 0 || idx >= info.cell_count) {
+      return td::Status::Error(PSLICE() << "bag-of-cells invalid root index " << idx);
+    }
+    roots[i].idx = info.cell_count - idx - 1;
+    if (info.has_cache_bits) {
+      auto& cnt = cell_should_cache[idx];
+      if (cnt < 2) {
+        cnt++;
+      }
+    }
+  }
+  if (info.has_index) {
+    index_ptr = data.substr(info.index_offset).ubegin();
+    // TODO: should we validate index here
+  } else {
+    index_ptr = nullptr;
+    unsigned long long cur = 0;
+    custom_index.reserve(info.cell_count);
+
+    auto cells_slice = data.substr(info.data_offset, info.data_size);
+
+    for (int i = 0; i < info.cell_count; i++) {
+      CellSerializationInfo cell_info;
+      auto status = cell_info.init(cells_slice, info.ref_byte_size);
+      if (status.is_error()) {
+        return td::Status::Error(PSLICE()
+                                 << "invalid bag-of-cells failed to deserialize cell #" << i << " " << status.error());
+      }
+      cells_slice = cells_slice.substr(cell_info.end_offset);
+      cur += cell_info.end_offset;
+      custom_index.push_back(cur);
+    }
+    if (!cells_slice.empty()) {
+      return td::Status::Error(PSLICE() << "invalid bag-of-cells last cell #" << info.cell_count - 1 << ": end offset "
+                                        << cur << " is different from total data size " << info.data_size);
+    }
+  }
+  auto cells_slice = data.substr(info.data_offset, info.data_size);
+  std::vector<Ref<DataCell>> cell_list;
+  cell_list.reserve(cell_count);
+  std::array<td::Ref<Cell>, 4> refs_buf;
+  for (int i = 0; i < cell_count; i++) {
+    // reconstruct cell with index cell_count - 1 - i
+    int idx = cell_count - 1 - i;
+    auto r_cell = deserialize_cell(idx, cells_slice, cell_list, info.has_cache_bits ? &cell_should_cache : nullptr);
+    if (r_cell.is_error()) {
+      return td::Status::Error(PSLICE() << "invalid bag-of-cells failed to deserialize cell #" << idx << " "
+                                        << r_cell.error());
+    }
+    cell_list.push_back(r_cell.move_as_ok());
+    DCHECK(cell_list.back().not_null());
+  }
+  if (info.has_cache_bits) {
+    for (int idx = 0; idx < cell_count; idx++) {
+      auto should_cache = cell_should_cache[idx] > 1;
+      auto stored_should_cache = get_cache_entry(idx);
+      if (should_cache != stored_should_cache) {
+        return td::Status::Error(PSLICE() << "invalid bag-of-cells cell #" << idx << " has wrong cache flag "
+                                          << stored_should_cache);
+      }
+    }
+  }
+  custom_index.clear();
+  index_ptr = nullptr;
+  root_count = info.root_count;
+  dangle_count = info.absent_count;
+  for (auto& root_info : roots) {
+    root_info.cell = cell_list[root_info.idx];
+  }
+  cell_list.clear();
+  return size_est;
+}
+
+unsigned long long BagOfCells::get_idx_entry(int index) {
+  auto raw = get_idx_entry_raw(index);
+  if (info.has_cache_bits) {
+    raw /= 2;
+  }
+  return raw;
+}
+
+bool BagOfCells::get_cache_entry(int index) {
+  if (!info.has_cache_bits) {
+    return true;
+  }
+  if (!info.has_index) {
+    return true;
+  }
+  auto raw = get_idx_entry_raw(index);
+  return raw % 2 == 1;
+}
+
+unsigned long long BagOfCells::get_idx_entry_raw(int index) {
+  if (index < 0) {
+    return 0;
+  }
+  if (!info.has_index) {
+    return custom_index.at(index);
+  } else if (index < info.cell_count && index_ptr) {
+    return info.read_offset(index_ptr + (long)index * info.offset_byte_size);
+  } else {
+    // throw ?
+    return 0;
+  }
+}
+
+/*
+ * 
+ *  Simple BoC serialization/deserialization functions
+ * 
+ */
+
+td::Result<Ref<Cell>> std_boc_deserialize(td::Slice data, bool can_be_empty) {
+  if (data.empty() && can_be_empty) {
+    return Ref<Cell>();
+  }
+  BagOfCells boc;
+  auto res = boc.deserialize(data);
+  if (res.is_error()) {
+    return res.move_as_error();
+  }
+  if (boc.get_root_count() != 1) {
+    return td::Status::Error("bag of cells is expected to have exactly one root");
+  }
+  auto root = boc.get_root_cell();
+  if (root.is_null()) {
+    return td::Status::Error("bag of cells has null root cell (?)");
+  }
+  if (root->get_level() != 0) {
+    return td::Status::Error("bag of cells has a root with non-zero level");
+  }
+  return std::move(root);
+}
+
+td::Result<std::vector<Ref<Cell>>> std_boc_deserialize_multi(td::Slice data) {
+  if (data.empty()) {
+    return std::vector<Ref<Cell>>{};
+  }
+  BagOfCells boc;
+  auto res = boc.deserialize(data);
+  if (res.is_error()) {
+    return res.move_as_error();
+  }
+  int n = boc.get_root_count();
+  std::vector<Ref<Cell>> roots;
+  for (int i = 0; i < n; i++) {
+    auto root = boc.get_root_cell(i);
+    if (root.is_null()) {
+      return td::Status::Error("bag of cells has a null root cell (?)");
+    }
+    if (root->get_level() != 0) {
+      return td::Status::Error("bag of cells has a root with non-zero level");
+    }
+    roots.emplace_back(std::move(root));
+  }
+  return std::move(roots);
+}
+
+td::Result<td::BufferSlice> std_boc_serialize(Ref<Cell> root, int mode) {
+  if (root.is_null()) {
+    return td::Status::Error("cannot serialize a null cell reference into a bag of cells");
+  }
+  BagOfCells boc;
+  boc.add_root(std::move(root));
+  auto res = boc.import_cells();
+  if (res.is_error()) {
+    return res.move_as_error();
+  }
+  return boc.serialize_to_slice(mode);
+}
+
+td::Result<td::BufferSlice> std_boc_serialize_multi(std::vector<Ref<Cell>> roots, int mode) {
+  if (roots.empty()) {
+    return td::BufferSlice{};
+  }
+  BagOfCells boc;
+  boc.add_roots(std::move(roots));
+  auto res = boc.import_cells();
+  if (res.is_error()) {
+    return res.move_as_error();
+  }
+  return boc.serialize_to_slice(mode);
+}
+
+/*
+ * 
+ *  Cell storage statistics
+ * 
+ */
+
+bool CellStorageStat::compute_used_storage(Ref<vm::CellSlice> cs_ref, bool kill_dup, bool skip_count_root) {
+  clear();
+  return add_used_storage(std::move(cs_ref), kill_dup, skip_count_root) && clear_seen();
+}
+
+bool CellStorageStat::compute_used_storage(const CellSlice& cs, bool kill_dup, bool skip_count_root) {
+  clear();
+  return add_used_storage(cs, kill_dup, skip_count_root) && clear_seen();
+}
+
+bool CellStorageStat::compute_used_storage(CellSlice&& cs, bool kill_dup, bool skip_count_root) {
+  clear();
+  return add_used_storage(std::move(cs), kill_dup, skip_count_root) && clear_seen();
+}
+
+bool CellStorageStat::compute_used_storage(Ref<vm::Cell> cell, bool kill_dup, bool skip_count_root) {
+  clear();
+  return add_used_storage(std::move(cell), kill_dup, skip_count_root) && clear_seen();
+}
+
+bool CellStorageStat::add_used_storage(Ref<vm::CellSlice> cs_ref, bool kill_dup, bool skip_count_root) {
+  if (cs_ref->is_unique()) {
+    return add_used_storage(std::move(cs_ref.unique_write()), kill_dup, skip_count_root);
+  } else {
+    return add_used_storage(*cs_ref, kill_dup, skip_count_root);
+  }
+}
+
+bool CellStorageStat::add_used_storage(const CellSlice& cs, bool kill_dup, bool skip_count_root) {
+  if (!skip_count_root) {
+    ++cells;
+  }
+  bits += cs.size();
+  for (unsigned i = 0; i < cs.size_refs(); i++) {
+    if (!add_used_storage(cs.prefetch_ref(i), kill_dup)) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool CellStorageStat::add_used_storage(CellSlice&& cs, bool kill_dup, bool skip_count_root) {
+  if (!skip_count_root) {
+    ++cells;
+  }
+  bits += cs.size();
+  while (cs.size_refs()) {
+    if (!add_used_storage(cs.fetch_ref(), kill_dup)) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool CellStorageStat::add_used_storage(Ref<vm::Cell> cell, bool kill_dup, bool skip_count_root) {
+  if (cell.is_null()) {
+    return false;
+  }
+  if (kill_dup) {
+    auto ins = seen.insert(cell->get_hash());
+    if (!ins.second) {
+      return true;
+    }
+  }
+  vm::CellSlice cs{vm::NoVm{}, std::move(cell)};
+  return add_used_storage(std::move(cs), kill_dup, skip_count_root);
+}
+
+void NewCellStorageStat::add_cell(Ref<Cell> cell) {
+  dfs(std::move(cell), true, false);
+}
+void NewCellStorageStat::add_proof(Ref<Cell> cell, const CellUsageTree* usage_tree) {
+  CHECK(usage_tree);
+  usage_tree_ = usage_tree;
+  dfs(std::move(cell), false, true);
+}
+void NewCellStorageStat::add_cell_and_proof(Ref<Cell> cell, const CellUsageTree* usage_tree) {
+  CHECK(usage_tree);
+  usage_tree_ = usage_tree;
+  dfs(std::move(cell), true, true);
+}
+
+NewCellStorageStat::Stat NewCellStorageStat::tentative_add_cell(Ref<Cell> cell) const {
+  NewCellStorageStat stat;
+  stat.parent_ = this;
+  stat.add_cell(std::move(cell));
+  return stat.get_stat();
+}
+
+NewCellStorageStat::Stat NewCellStorageStat::tentative_add_proof(Ref<Cell> cell,
+                                                                 const CellUsageTree* usage_tree) const {
+  NewCellStorageStat stat;
+  stat.parent_ = this;
+  stat.add_proof(std::move(cell), usage_tree);
+  return stat.get_proof_stat();
+}
+
+void NewCellStorageStat::dfs(Ref<Cell> cell, bool need_stat, bool need_proof_stat) {
+  if (cell.is_null()) {
+    // FIXME: save error flag?
+    return;
+  }
+  if (need_stat) {
+    stat_.internal_refs++;
+    if ((parent_ && parent_->seen_.count(cell->get_hash()) != 0) || !seen_.insert(cell->get_hash()).second) {
+      need_stat = false;
+    } else {
+      stat_.cells++;
+    }
+  }
+
+  if (need_proof_stat) {
+    auto tree_node = cell->get_tree_node();
+    if (!tree_node.empty() && tree_node.is_from_tree(usage_tree_)) {
+      proof_stat_.external_refs++;
+      need_proof_stat = false;
+    } else {
+      proof_stat_.internal_refs++;
+      if ((parent_ && parent_->proof_seen_.count(cell->get_hash()) != 0) ||
+          !proof_seen_.insert(cell->get_hash()).second) {
+        need_proof_stat = false;
+      } else {
+        proof_stat_.cells++;
+      }
+    }
+  }
+
+  if (!need_proof_stat && !need_stat) {
+    return;
+  }
+  vm::CellSlice cs{vm::NoVm{}, std::move(cell)};
+  if (need_stat) {
+    stat_.bits += cs.size();
+  }
+  if (need_proof_stat) {
+    proof_stat_.bits += cs.size();
+  }
+  while (cs.size_refs()) {
+    dfs(cs.fetch_ref(), need_stat, need_proof_stat);
+  }
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/boc.h b/submodules/ton/tonlib-src/crypto/vm/boc.h
new file mode 100644
index 0000000000..5b4e4e2c4b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/boc.h
@@ -0,0 +1,314 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <set>
+#include "vm/cells.h"
+#include "td/utils/Status.h"
+#include "td/utils/buffer.h"
+#include "td/utils/HashMap.h"
+
+namespace vm {
+using td::Ref;
+
+td::Result<Ref<Cell>> std_boc_deserialize(td::Slice data, bool can_be_empty = false);
+td::Result<td::BufferSlice> std_boc_serialize(Ref<Cell> root, int mode = 0);
+
+td::Result<std::vector<Ref<Cell>>> std_boc_deserialize_multi(td::Slice data);
+td::Result<td::BufferSlice> std_boc_serialize_multi(std::vector<Ref<Cell>> root, int mode = 0);
+
+class NewCellStorageStat {
+ public:
+  NewCellStorageStat() {
+  }
+
+  struct Stat {
+    Stat() {
+    }
+    Stat(td::uint64 cells_, td::uint64 bits_, td::uint64 internal_refs_ = 0, td::uint64 external_refs_ = 0)
+        : cells(cells_), bits(bits_), internal_refs(internal_refs_), external_refs(external_refs_) {
+    }
+    td::uint64 cells{0};
+    td::uint64 bits{0};
+    td::uint64 internal_refs{0};
+    td::uint64 external_refs{0};
+
+    auto key() const {
+      return std::make_tuple(cells, bits, internal_refs, external_refs);
+    }
+    bool operator==(const Stat& other) const {
+      return key() == other.key();
+    }
+    Stat& operator=(const Stat& other) = default;
+    Stat& operator+=(const Stat& other) {
+      cells += other.cells;
+      bits += other.bits;
+      internal_refs += other.internal_refs;
+      external_refs += other.external_refs;
+      return *this;
+    }
+    Stat operator+(const Stat& other) const {
+      return Stat{cells + other.cells, bits + other.bits, internal_refs + other.internal_refs,
+                  external_refs + other.external_refs};
+    }
+    bool fits_uint32() const {
+      return !((cells | bits | internal_refs | external_refs) >> 32);
+    }
+    void set_zero() {
+      cells = bits = internal_refs = external_refs = 0;
+    }
+  };
+
+  Stat get_stat() const {
+    return stat_;
+  }
+
+  Stat get_proof_stat() const {
+    return proof_stat_;
+  }
+
+  Stat get_total_stat() const {
+    return stat_ + proof_stat_;
+  }
+
+  void add_cell(Ref<Cell> cell);
+  void add_proof(Ref<Cell> cell, const CellUsageTree* usage_tree);
+  void add_cell_and_proof(Ref<Cell> cell, const CellUsageTree* usage_tree);
+  Stat tentative_add_cell(Ref<Cell> cell) const;
+  Stat tentative_add_proof(Ref<Cell> cell, const CellUsageTree* usage_tree) const;
+  void set_zero() {
+    stat_.set_zero();
+    proof_stat_.set_zero();
+  }
+
+ private:
+  const CellUsageTree* usage_tree_;
+  std::set<vm::Cell::Hash> seen_;
+  Stat stat_;
+  std::set<vm::Cell::Hash> proof_seen_;
+  Stat proof_stat_;
+  const NewCellStorageStat* parent_{nullptr};
+
+  void dfs(Ref<Cell> cell, bool need_stat, bool need_proof_stat);
+};
+
+struct CellStorageStat {
+  unsigned long long cells;
+  unsigned long long bits;
+  unsigned long long public_cells;
+  std::set<vm::Cell::Hash> seen;
+  CellStorageStat() : cells(0), bits(0), public_cells(0) {
+  }
+  bool clear_seen() {
+    seen.clear();
+    return true;
+  }
+  void clear() {
+    cells = bits = public_cells = 0;
+    clear_seen();
+  }
+  bool compute_used_storage(Ref<vm::CellSlice> cs_ref, bool kill_dup = true, bool skip_count_root = false);
+  bool compute_used_storage(const CellSlice& cs, bool kill_dup = true, bool skip_count_root = false);
+  bool compute_used_storage(CellSlice&& cs, bool kill_dup = true, bool skip_count_root = false);
+  bool compute_used_storage(Ref<vm::Cell> cell, bool kill_dup = true, bool skip_count_root = false);
+
+  bool add_used_storage(Ref<vm::CellSlice> cs_ref, bool kill_dup = true, bool skip_count_root = false);
+  bool add_used_storage(const CellSlice& cs, bool kill_dup = true, bool skip_count_root = false);
+  bool add_used_storage(CellSlice&& cs, bool kill_dup = true, bool skip_count_root = false);
+  bool add_used_storage(Ref<vm::Cell> cell, bool kill_dup = true, bool skip_count_root = false);
+};
+
+struct CellSerializationInfo {
+  bool special;
+  Cell::LevelMask level_mask;
+
+  bool with_hashes;
+  size_t hashes_offset;
+  size_t depth_offset;
+
+  size_t data_offset;
+  size_t data_len;
+  bool data_with_bits;
+
+  size_t refs_offset;
+  int refs_cnt;
+
+  size_t end_offset;
+
+  td::Status init(td::Slice data, int ref_byte_size);
+  td::Status init(td::uint8 d1, td::uint8 d2, int ref_byte_size);
+  td::Result<int> get_bits(td::Slice cell) const;
+
+  td::Result<Ref<DataCell>> create_data_cell(td::Slice data, td::Span<Ref<Cell>> refs) const;
+};
+
+class BagOfCells {
+ public:
+  enum { hash_bytes = vm::Cell::hash_bytes };
+  enum Mode { WithIndex = 1, WithCRC32C = 2, WithTopHash = 4, WithIntHashes = 8, WithCacheBits = 16, max = 31 };
+  enum { max_cell_whs = 64 };
+  using Hash = Cell::Hash;
+  struct Info {
+    enum : td::uint32 { boc_idx = 0x68ff65f3, boc_idx_crc32c = 0xacc3a728, boc_generic = 0xb5ee9c72 };
+
+    unsigned magic;
+    int root_count;
+    int cell_count;
+    int absent_count;
+    int ref_byte_size;
+    int offset_byte_size;
+    bool valid;
+    bool has_index;
+    bool has_roots{false};
+    bool has_crc32c;
+    bool has_cache_bits;
+    unsigned long long roots_offset, index_offset, data_offset, data_size, total_size;
+    Info() : magic(0), valid(false) {
+    }
+    void invalidate() {
+      valid = false;
+    }
+    long long parse_serialized_header(const td::Slice& slice);
+    unsigned long long read_int(const unsigned char* ptr, unsigned bytes);
+    unsigned long long read_ref(const unsigned char* ptr) {
+      return read_int(ptr, ref_byte_size);
+    }
+    unsigned long long read_offset(const unsigned char* ptr) {
+      return read_int(ptr, offset_byte_size);
+    }
+    void write_int(unsigned char* ptr, unsigned long long value, int bytes);
+    void write_ref(unsigned char* ptr, unsigned long long value) {
+      write_int(ptr, value, ref_byte_size);
+    }
+    void write_offset(unsigned char* ptr, unsigned long long value) {
+      write_int(ptr, value, offset_byte_size);
+    }
+  };
+
+ private:
+  int cell_count{0}, root_count{0}, dangle_count{0}, int_refs{0};
+  int int_hashes{0}, top_hashes{0};
+  int max_depth{1024};
+  Info info;
+  unsigned long long data_bytes{0};
+  unsigned char* store_ptr{nullptr};
+  unsigned char* store_end{nullptr};
+  td::HashMap<Hash, int> cells;
+  struct CellInfo {
+    Ref<DataCell> dc_ref;
+    std::array<int, 4> ref_idx;
+    unsigned char ref_num;
+    unsigned char wt;
+    unsigned char hcnt;
+    int new_idx;
+    bool should_cache{false};
+    bool is_root_cell{false};
+    CellInfo() : ref_num(0) {
+    }
+    CellInfo(Ref<DataCell> _dc) : dc_ref(std::move(_dc)), ref_num(0) {
+    }
+    CellInfo(Ref<DataCell> _dc, int _refs, const std::array<int, 4>& _ref_list)
+        : dc_ref(std::move(_dc)), ref_idx(_ref_list), ref_num(static_cast<unsigned char>(_refs)) {
+    }
+    bool is_special() const {
+      return !wt;
+    }
+  };
+  std::vector<CellInfo> cell_list_;
+  struct RootInfo {
+    RootInfo() = default;
+    RootInfo(Ref<Cell> cell, int idx) : cell(std::move(cell)), idx(idx) {
+    }
+    Ref<Cell> cell;
+    int idx{-1};
+  };
+  std::vector<CellInfo> cell_list_tmp;
+  std::vector<RootInfo> roots;
+  std::vector<unsigned char> serialized;
+  const unsigned char* index_ptr{nullptr};
+  const unsigned char* data_ptr{nullptr};
+  std::vector<unsigned long long> custom_index;
+
+ public:
+  void clear();
+  int set_roots(const std::vector<td::Ref<vm::Cell>>& new_roots);
+  int set_root(td::Ref<vm::Cell> new_root);
+  int add_roots(const std::vector<td::Ref<vm::Cell>>& add_roots);
+  int add_root(td::Ref<vm::Cell> add_root);
+  td::Status import_cells() TD_WARN_UNUSED_RESULT;
+  BagOfCells() = default;
+  std::size_t estimate_serialized_size(int mode = 0);
+  BagOfCells& serialize(int mode = 0);
+  std::string serialize_to_string(int mode = 0);
+  td::Result<td::BufferSlice> serialize_to_slice(int mode = 0);
+  std::size_t serialize_to(unsigned char* buffer, std::size_t buff_size, int mode = 0);
+  std::string extract_string() const;
+
+  td::Result<long long> deserialize(const td::Slice& data);
+  td::Result<long long> deserialize(const unsigned char* buffer, std::size_t buff_size) {
+    return deserialize(td::Slice{buffer, buff_size});
+  }
+  int get_root_count() const {
+    return root_count;
+  }
+  Ref<Cell> get_root_cell(int idx = 0) const {
+    return (idx >= 0 && idx < root_count) ? roots.at(idx).cell : Ref<Cell>{};
+  }
+
+  static int precompute_cell_serialization_size(const unsigned char* cell, std::size_t len, int ref_size,
+                                                int* refs_num_ptr = nullptr);
+
+ private:
+  int rv_idx;
+  td::Result<int> import_cell(td::Ref<vm::Cell> cell, int depth);
+  void cells_clear() {
+    cell_count = 0;
+    int_refs = 0;
+    data_bytes = 0;
+    cells.clear();
+    cell_list_.clear();
+  }
+  td::uint64 compute_sizes(int mode, int& r_size, int& o_size);
+  void init_store(unsigned char* from, unsigned char* to) {
+    store_ptr = from;
+    store_end = to;
+  }
+  void store_chk() const {
+    DCHECK(store_ptr <= store_end);
+  }
+  bool store_empty() const {
+    return store_ptr == store_end;
+  }
+  void store_uint(unsigned long long value, unsigned bytes);
+  void store_ref(unsigned long long value) {
+    store_uint(value, info.ref_byte_size);
+  }
+  void store_offset(unsigned long long value) {
+    store_uint(value, info.offset_byte_size);
+  }
+  void reorder_cells();
+  int revisit(int cell_idx, int force = 0);
+  unsigned long long get_idx_entry_raw(int index);
+  unsigned long long get_idx_entry(int index);
+  bool get_cache_entry(int index);
+  td::Result<td::Slice> get_cell_slice(int index, td::Slice data);
+  td::Result<td::Ref<vm::DataCell>> deserialize_cell(int index, td::Slice data, td::Span<td::Ref<DataCell>> cells,
+                                                     std::vector<td::uint8>* cell_should_cache);
+};
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/box.hpp b/submodules/ton/tonlib-src/crypto/vm/box.hpp
new file mode 100644
index 0000000000..a448c5d897
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/box.hpp
@@ -0,0 +1,63 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/stack.hpp"
+
+namespace vm {
+using td::Ref;
+
+class Box : public td::CntObject {
+  mutable StackEntry data_;
+
+ public:
+  Box() = default;
+  Box(const Box&) = default;
+  Box(Box&&) = default;
+  template <typename... Args>
+  Box(Args... args) : data_{std::move(args...)} {
+  }
+  ~Box() override = default;
+  Box(const StackEntry& data) : data_(data) {
+  }
+  Box(StackEntry&& data) : data_(std::move(data)) {
+  }
+  void operator=(const StackEntry& data) const {
+    data_ = data;
+  }
+  void operator=(StackEntry&& data) const {
+    data_ = data;
+  }
+  void set(const StackEntry& data) const {
+    data_ = data;
+  }
+  void set(StackEntry&& data) const {
+    data_ = data;
+  }
+  const StackEntry& get() const {
+    return data_;
+  }
+  void clear() const {
+    data_.clear();
+  }
+  bool empty() const {
+    return data_.empty();
+  }
+};
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cellops.cpp b/submodules/ton/tonlib-src/crypto/vm/cellops.cpp
new file mode 100644
index 0000000000..5346e16851
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cellops.cpp
@@ -0,0 +1,1420 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <functional>
+#include "vm/cellops.h"
+#include "vm/log.h"
+#include "vm/opctable.h"
+#include "vm/stack.hpp"
+#include "vm/continuation.h"
+#include "vm/excno.hpp"
+#include "vm/vmstate.h"
+#include "common/bigint.hpp"
+#include "common/refint.h"
+
+namespace vm {
+
+int exec_push_ref(VmState* st, CellSlice& cs, int mode, int pfx_bits) {
+  if (!cs.have_refs(1)) {
+    throw VmError{Excno::inv_opcode, "no references left for a PUSHREF instruction"};
+  }
+  cs.advance(pfx_bits);
+  auto cell = cs.fetch_ref();
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSHREF" << (mode == 2 ? "CONT" : (mode == 1 ? "SLICE" : "")) << " ("
+             << cell->get_hash().to_hex() << ")";
+  switch (mode) {
+    default:
+    case 0:
+      stack.push_cell(std::move(cell));
+      break;
+    case 1:
+      stack.push_cellslice(load_cell_slice_ref(std::move(cell)));
+      break;
+    case 2:
+      stack.push_cont(Ref<OrdCont>{true, load_cell_slice_ref(std::move(cell)), st->get_cp()});
+      break;
+  }
+  return 0;
+}
+
+std::string dump_push_ref(CellSlice& cs, unsigned args, int pfx_bits, std::string name) {
+  if (!cs.have_refs(1)) {
+    return "";
+  }
+  cs.advance(pfx_bits);
+  cs.advance_refs(1);
+  return name;
+}
+
+int compute_len_push_ref(const CellSlice& cs, unsigned args, int pfx_bits) {
+  return cs.have_refs(1) ? (0x10000 + pfx_bits) : 0;
+}
+
+int exec_push_slice_common(VmState* st, CellSlice& cs, unsigned data_bits, unsigned refs, int pfx_bits) {
+  if (!cs.have(pfx_bits + data_bits)) {
+    throw VmError{Excno::inv_opcode, "not enough data bits for a PUSHSLICE instruction"};
+  }
+  if (!cs.have_refs(refs)) {
+    throw VmError{Excno::inv_opcode, "not enough references for a PUSHSLICE instruction"};
+  }
+  Stack& stack = st->get_stack();
+  cs.advance(pfx_bits);
+  auto slice = cs.fetch_subslice(data_bits, refs);
+  slice.unique_write().remove_trailing();
+  VM_LOG(st) << "execute PUSHSLICE " << slice;
+  stack.push(std::move(slice));
+  return 0;
+}
+
+std::string dump_push_slice_common(CellSlice& cs, unsigned data_bits, unsigned refs, int pfx_bits,
+                                   const char* name = "PUSHSLICE ") {
+  if (!cs.have(pfx_bits + data_bits) || !cs.have_refs(refs)) {
+    return "";
+  }
+  cs.advance(pfx_bits);
+  auto slice = cs.fetch_subslice(data_bits, refs);
+  slice.unique_write().remove_trailing();
+  std::ostringstream os{name};
+  slice->dump_hex(os, 1, false);
+  return os.str();
+}
+
+int compute_len_push_slice_common(const CellSlice& cs, unsigned data_bits, unsigned refs, int pfx_bits) {
+  unsigned bits = pfx_bits + data_bits;
+  return cs.have(bits) && cs.have_refs(refs) ? (refs << 16) + bits : 0;
+}
+
+int exec_push_slice(VmState* st, CellSlice& cs, unsigned args, int pfx_bits) {
+  return exec_push_slice_common(st, cs, (args & 15) * 8 + 4, 0, pfx_bits);
+}
+
+std::string dump_push_slice(CellSlice& cs, unsigned args, int pfx_bits) {
+  return dump_push_slice_common(cs, (args & 15) * 8 + 4, 0, pfx_bits);
+}
+
+int compute_len_push_slice(const CellSlice& cs, unsigned args, int pfx_bits) {
+  return compute_len_push_slice_common(cs, (args & 15) * 8 + 4, 0, pfx_bits);
+}
+
+int exec_push_slice_r(VmState* st, CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = ((args >> 5) & 3) + 1;
+  unsigned data_bits = (args & 31) * 8 + 1;
+  return exec_push_slice_common(st, cs, data_bits, refs, pfx_bits);
+}
+
+std::string dump_push_slice_r(CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = ((args >> 5) & 3) + 1;
+  unsigned data_bits = (args & 31) * 8 + 1;
+  return dump_push_slice_common(cs, data_bits, refs, pfx_bits);
+}
+
+int compute_len_push_slice_r(const CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = ((args >> 5) & 3) + 1;
+  unsigned data_bits = (args & 31) * 8 + 1;
+  return compute_len_push_slice_common(cs, data_bits, refs, pfx_bits);
+}
+
+int exec_push_slice_r2(VmState* st, CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = (args >> 7) & 7;
+  unsigned data_bits = (args & 127) * 8 + 6;
+  return exec_push_slice_common(st, cs, data_bits, refs, pfx_bits);
+}
+
+std::string dump_push_slice_r2(CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = (args >> 7) & 7;
+  unsigned data_bits = (args & 127) * 8 + 6;
+  return dump_push_slice_common(cs, data_bits, refs, pfx_bits);
+}
+
+int compute_len_push_slice_r2(const CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = (args >> 7) & 7;
+  unsigned data_bits = (args & 127) * 8 + 6;
+  return compute_len_push_slice_common(cs, data_bits, refs, pfx_bits);
+}
+
+int exec_push_cont(VmState* st, CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = (args >> 7) & 3;
+  unsigned data_bits = (args & 127) * 8;
+  if (!cs.have(pfx_bits + data_bits)) {
+    throw VmError{Excno::inv_opcode, "not enough data bits for a PUSHCONT instruction"};
+  }
+  if (!cs.have_refs(refs)) {
+    throw VmError{Excno::inv_opcode, "not enough references for a PUSHCONT instruction"};
+  }
+  Stack& stack = st->get_stack();
+  cs.advance(pfx_bits);
+  auto slice = cs.fetch_subslice(data_bits, refs);
+
+  VM_LOG(st) << "execute PUSHCONT " << slice;
+
+  stack.push_cont(Ref<OrdCont>{true, std::move(slice), st->get_cp()});
+  return 0;
+}
+
+std::string dump_push_cont(CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = (args >> 7) & 3;
+  unsigned data_bits = (args & 127) * 8;
+  if (!cs.have(pfx_bits + data_bits) || !cs.have_refs(refs)) {
+    return "";
+  }
+  cs.advance(pfx_bits);
+  auto slice = cs.fetch_subslice(data_bits, refs);
+  std::ostringstream os{"PUSHCONT "};
+  slice->dump_hex(os, 1, false);
+  return os.str();
+}
+
+int compute_len_push_cont(const CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = (args >> 7) & 3;
+  unsigned data_bits = (args & 127) * 8;
+  return compute_len_push_slice_common(cs, data_bits, refs, pfx_bits);
+}
+
+int exec_push_cont_simple(VmState* st, CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned data_bits = (args & 15) * 8;
+  if (!cs.have(pfx_bits + data_bits)) {
+    throw VmError{Excno::inv_opcode, "not enough data bits for a PUSHCONT instruction"};
+  }
+  Stack& stack = st->get_stack();
+  cs.advance(pfx_bits);
+  auto slice = cs.fetch_subslice(data_bits);
+  VM_LOG(st) << "execute PUSHCONT " << slice;
+  stack.push_cont(Ref<OrdCont>{true, std::move(slice), st->get_cp()});
+  return 0;
+}
+
+std::string dump_push_cont_simple(CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned data_bits = (args & 15) * 8;
+  if (!cs.have(pfx_bits + data_bits)) {
+    return "";
+  }
+  cs.advance(pfx_bits);
+  auto slice = cs.fetch_subslice(data_bits);
+  std::ostringstream os{"PUSHCONT "};
+  slice->dump_hex(os, 1, false);
+  return os.str();
+}
+
+int compute_len_push_cont_simple(const CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned data_bits = (args & 15) * 8;
+  return compute_len_push_slice_common(cs, data_bits, 0, pfx_bits);
+}
+
+void register_cell_const_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mkext(0x88, 8, 0, std::bind(dump_push_ref, _1, _2, _3, "PUSHREF"),
+                                std::bind(exec_push_ref, _1, _2, 0, _4), compute_len_push_ref))
+      .insert(OpcodeInstr::mkext(0x89, 8, 0, std::bind(dump_push_ref, _1, _2, _3, "PUSHREFSLICE"),
+                                 std::bind(exec_push_ref, _1, _2, 1, _4), compute_len_push_ref))
+      .insert(OpcodeInstr::mkext(0x8a, 8, 0, std::bind(dump_push_ref, _1, _2, _3, "PUSHREFCONT"),
+                                 std::bind(exec_push_ref, _1, _2, 2, _4), compute_len_push_ref))
+      .insert(OpcodeInstr::mkext(0x8b, 8, 4, dump_push_slice, exec_push_slice, compute_len_push_slice))
+      .insert(OpcodeInstr::mkext(0x8c, 8, 7, dump_push_slice_r, exec_push_slice_r, compute_len_push_slice_r))
+      .insert(OpcodeInstr::mkextrange((0x8d * 8) << 7, (0x8d * 8 + 5) << 7, 18, 10, dump_push_slice_r2,
+                                      exec_push_slice_r2, compute_len_push_slice_r2))
+      .insert(OpcodeInstr::mkext(0x8e / 2, 7, 9, dump_push_cont, exec_push_cont, compute_len_push_cont))
+      .insert(OpcodeInstr::mkext(9, 4, 4, dump_push_cont_simple, exec_push_cont_simple, compute_len_push_cont_simple));
+}
+
+int exec_un_cs_cmp(VmState* st, const char* name, const std::function<bool(Ref<CellSlice>)>& func) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(1);
+  stack.push_smallint(func(stack.pop_cellslice()) ? -1 : 0);
+  return 0;
+}
+
+int exec_iun_cs_cmp(VmState* st, const char* name, const std::function<int(Ref<CellSlice>)>& func) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(1);
+  stack.push_smallint(func(stack.pop_cellslice()));
+  return 0;
+}
+
+int exec_bin_cs_cmp(VmState* st, const char* name, const std::function<bool(Ref<CellSlice>, Ref<CellSlice>)>& func) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(2);
+  auto cs2 = stack.pop_cellslice();
+  auto cs1 = stack.pop_cellslice();
+  stack.push_smallint(func(cs1, cs2) ? -1 : 0);
+  return 0;
+}
+
+int exec_ibin_cs_cmp(VmState* st, const char* name, const std::function<int(Ref<CellSlice>, Ref<CellSlice>)>& func) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(2);
+  auto cs2 = stack.pop_cellslice();
+  auto cs1 = stack.pop_cellslice();
+  stack.push_smallint(func(cs1, cs2));
+  return 0;
+}
+
+namespace {
+
+using namespace std::placeholders;
+
+void reg_un_cs_cmp(OpcodeTable& cp, unsigned code, unsigned len, const char* name,
+                   std::function<bool(Ref<CellSlice>)> func) {
+  cp.insert(OpcodeInstr::mksimple(code, len, name, std::bind(exec_un_cs_cmp, _1, name, std::move(func))));
+}
+
+void reg_iun_cs_cmp(OpcodeTable& cp, unsigned code, unsigned len, const char* name,
+                    std::function<int(Ref<CellSlice>)> func) {
+  cp.insert(OpcodeInstr::mksimple(code, len, name, std::bind(exec_iun_cs_cmp, _1, name, std::move(func))));
+}
+
+void reg_bin_cs_cmp(OpcodeTable& cp, unsigned code, unsigned len, const char* name,
+                    std::function<bool(Ref<CellSlice>, Ref<CellSlice>)> func) {
+  cp.insert(OpcodeInstr::mksimple(code, len, name, std::bind(exec_bin_cs_cmp, _1, name, std::move(func))));
+}
+
+void reg_ibin_cs_cmp(OpcodeTable& cp, unsigned code, unsigned len, const char* name,
+                     std::function<int(Ref<CellSlice>, Ref<CellSlice>)> func) {
+  cp.insert(OpcodeInstr::mksimple(code, len, name, std::bind(exec_ibin_cs_cmp, _1, name, std::move(func))));
+}
+
+}  // namespace
+
+void register_cell_cmp_ops(OpcodeTable& cp0) {
+  reg_un_cs_cmp(cp0, 0xc700, 16, "SEMPTY", [](auto cs) { return cs->empty() && !cs->size_refs(); });
+  reg_un_cs_cmp(cp0, 0xc701, 16, "SDEMPTY", [](auto cs) { return cs->empty(); });
+  reg_un_cs_cmp(cp0, 0xc702, 16, "SREMPTY", [](auto cs) { return !cs->size_refs(); });
+  reg_un_cs_cmp(cp0, 0xc703, 16, "SDFIRST", [](auto cs) { return cs->prefetch_long(1) == -1; });
+  reg_ibin_cs_cmp(cp0, 0xc704, 16, "SDLEXCMP", [](auto cs1, auto cs2) { return cs1->lex_cmp(*cs2); });
+  reg_bin_cs_cmp(cp0, 0xc705, 16, "SDEQ", [](auto cs1, auto cs2) { return !cs1->lex_cmp(*cs2); });
+  reg_bin_cs_cmp(cp0, 0xc708, 16, "SDPFX", [](auto cs1, auto cs2) { return cs1->is_prefix_of(*cs2); });
+  reg_bin_cs_cmp(cp0, 0xc709, 16, "SDPFXREV", [](auto cs1, auto cs2) { return cs2->is_prefix_of(*cs1); });
+  reg_bin_cs_cmp(cp0, 0xc70a, 16, "SDPPFX", [](auto cs1, auto cs2) { return cs1->is_proper_prefix_of(*cs2); });
+  reg_bin_cs_cmp(cp0, 0xc70b, 16, "SDPPFXREV", [](auto cs1, auto cs2) { return cs2->is_proper_prefix_of(*cs1); });
+  reg_bin_cs_cmp(cp0, 0xc70c, 16, "SDSFX", [](auto cs1, auto cs2) { return cs1->is_suffix_of(*cs2); });
+  reg_bin_cs_cmp(cp0, 0xc70d, 16, "SDSFXREV", [](auto cs1, auto cs2) { return cs2->is_suffix_of(*cs1); });
+  reg_bin_cs_cmp(cp0, 0xc70e, 16, "SDPSFX", [](auto cs1, auto cs2) { return cs1->is_proper_suffix_of(*cs2); });
+  reg_bin_cs_cmp(cp0, 0xc70f, 16, "SDPSFXREV", [](auto cs1, auto cs2) { return cs2->is_proper_suffix_of(*cs1); });
+  reg_iun_cs_cmp(cp0, 0xc710, 16, "SDCNTLEAD0", [](auto cs) { return cs->count_leading(0); });
+  reg_iun_cs_cmp(cp0, 0xc711, 16, "SDCNTLEAD1", [](auto cs) { return cs->count_leading(1); });
+  reg_iun_cs_cmp(cp0, 0xc712, 16, "SDCNTTRAIL0", [](auto cs) { return cs->count_trailing(0); });
+  reg_iun_cs_cmp(cp0, 0xc713, 16, "SDCNTTRAIL1", [](auto cs) { return cs->count_trailing(1); });
+}
+
+int exec_new_builder(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute NEWC";
+  stack.push_builder(Ref<CellBuilder>{true});
+  return 0;
+}
+
+int exec_builder_to_cell(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ENDC";
+  stack.check_underflow(1);
+  stack.push_cell(stack.pop_builder()->finalize_copy());
+  return 0;
+}
+
+int exec_builder_to_special_cell(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ENDXC";
+  stack.check_underflow(2);
+  bool special = stack.pop_bool();
+  stack.push_cell(stack.pop_builder()->finalize_copy(special));
+  return 0;
+}
+
+inline void check_space(const CellBuilder& builder, unsigned bits, unsigned refs = 0) {
+  if (!builder.can_extend_by(bits, refs)) {
+    throw VmError{Excno::cell_ov};
+  }
+}
+
+int store_int_common_fail(int code, Stack& stack, Ref<CellBuilder> builder, td::RefInt256 x, unsigned args) {
+  if (!(args & 2)) {
+    stack.push_int_quiet(std::move(x), true);
+    stack.push_builder(std::move(builder));
+  } else {
+    stack.push_builder(std::move(builder));
+    stack.push_int_quiet(std::move(x), true);
+  }
+  stack.push_smallint(code);
+  return 0;
+}
+
+int exec_store_int_common(Stack& stack, unsigned bits, unsigned args) {
+  bool sgnd = !(args & 1);
+  Ref<CellBuilder> builder;
+  td::RefInt256 x;
+  if (!(args & 2)) {
+    builder = stack.pop_builder();
+    x = stack.pop_int();
+  } else {
+    x = stack.pop_int();
+    builder = stack.pop_builder();
+  }
+  if (!builder->can_extend_by(bits)) {
+    if (args & 4) {
+      return store_int_common_fail(-1, stack, std::move(builder), std::move(x), args);
+    }
+    throw VmError{Excno::cell_ov};
+  }
+  if (!x->fits_bits(bits, sgnd)) {
+    if (args & 4) {
+      return store_int_common_fail(1, stack, std::move(builder), std::move(x), args);
+    }
+    throw VmError{Excno::range_chk};
+  }
+  builder.write().store_int256(*x, bits, sgnd);
+  stack.push_builder(std::move(builder));
+  if (args & 4) {
+    stack.push_smallint(0);
+  }
+  return 0;
+}
+
+int exec_store_int(VmState* st, unsigned args, bool sgnd) {
+  unsigned bits = (args & 0xff) + 1;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ST" << (sgnd ? 'I' : 'U') << ' ' << bits;
+  stack.check_underflow(2);
+  return exec_store_int_common(stack, bits, !sgnd);
+}
+
+int exec_store_ref(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute STREF" << (quiet ? "Q\n" : "\n");
+  stack.check_underflow(2);
+  auto builder = stack.pop_builder();
+  auto cell = stack.pop_cell();
+  if (!builder->can_extend_by(0, 1)) {
+    if (!quiet) {
+      throw VmError{Excno::cell_ov};
+    }
+    stack.push_cell(std::move(cell));
+    stack.push_builder(std::move(builder));
+    stack.push_smallint(-1);
+    return 0;
+  }
+  builder.write().store_ref(std::move(cell));
+  stack.push_builder(std::move(builder));
+  if (quiet) {
+    stack.push_smallint(0);
+  }
+  return 0;
+}
+
+int exec_store_ref_rev(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute STREFR" << (quiet ? "Q\n" : "\n");
+  stack.check_underflow(2);
+  auto cell = stack.pop_cell();
+  auto builder = stack.pop_builder();
+  if (!builder->can_extend_by(0, 1)) {
+    if (!quiet) {
+      throw VmError{Excno::cell_ov};
+    }
+    stack.push_builder(std::move(builder));
+    stack.push_cell(std::move(cell));
+    stack.push_smallint(-1);
+    return 0;
+  }
+  builder.write().store_ref(std::move(cell));
+  stack.push_builder(std::move(builder));
+  if (quiet) {
+    stack.push_smallint(0);
+  }
+  return 0;
+}
+
+int exec_store_builder_as_ref(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute STBREF\n";
+  stack.check_underflow(2);
+  auto builder = stack.pop_builder();
+  auto builder2 = stack.pop_builder();
+  if (!builder->can_extend_by(0, 1)) {
+    if (!quiet) {
+      throw VmError{Excno::cell_ov};
+    }
+    stack.push_builder(std::move(builder2));
+    stack.push_builder(std::move(builder));
+    stack.push_smallint(-1);
+    return 0;
+  }
+  builder.write().store_ref(builder2->finalize_copy());
+  stack.push_builder(std::move(builder));
+  if (quiet) {
+    stack.push_smallint(0);
+  }
+  return 0;
+}
+
+int exec_store_builder_as_ref_rev(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute STBREFR\n";
+  stack.check_underflow(2);
+  auto builder2 = stack.pop_builder();
+  auto builder = stack.pop_builder();
+  if (!builder->can_extend_by(0, 1)) {
+    if (!quiet) {
+      throw VmError{Excno::cell_ov};
+    }
+    stack.push_builder(std::move(builder));
+    stack.push_builder(std::move(builder2));
+    stack.push_smallint(-1);
+    return 0;
+  }
+  builder.write().store_ref(builder2->finalize_copy());
+  stack.push_builder(std::move(builder));
+  if (quiet) {
+    stack.push_smallint(0);
+  }
+  return 0;
+}
+
+int exec_store_slice(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute STSLICE\n";
+  stack.check_underflow(2);
+  auto builder = stack.pop_builder();
+  auto cs = stack.pop_cellslice();
+  if (!builder->can_extend_by(cs->size(), cs->size_refs())) {
+    if (!quiet) {
+      throw VmError{Excno::cell_ov};
+    }
+    stack.push_cellslice(std::move(cs));
+    stack.push_builder(std::move(builder));
+    stack.push_smallint(-1);
+    return 0;
+  }
+  cell_builder_add_slice(builder.write(), *cs);
+  stack.push_builder(std::move(builder));
+  if (quiet) {
+    stack.push_smallint(0);
+  }
+  return 0;
+}
+
+int exec_store_slice_rev(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute STSLICER\n";
+  stack.check_underflow(2);
+  auto cs = stack.pop_cellslice();
+  auto builder = stack.pop_builder();
+  if (!builder->can_extend_by(cs->size(), cs->size_refs())) {
+    if (!quiet) {
+      throw VmError{Excno::cell_ov};
+    }
+    stack.push_builder(std::move(builder));
+    stack.push_cellslice(std::move(cs));
+    stack.push_smallint(-1);
+    return 0;
+  }
+  cell_builder_add_slice(builder.write(), *cs);
+  stack.push_builder(std::move(builder));
+  if (quiet) {
+    stack.push_smallint(0);
+  }
+  return 0;
+}
+
+int exec_store_builder(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute STB\n";
+  stack.check_underflow(2);
+  auto builder = stack.pop_builder();
+  auto cb2 = stack.pop_builder();
+  if (!builder->can_extend_by(cb2->size(), cb2->size_refs())) {
+    if (!quiet) {
+      throw VmError{Excno::cell_ov};
+    }
+    stack.push_builder(std::move(cb2));
+    stack.push_builder(std::move(builder));
+    stack.push_smallint(-1);
+    return 0;
+  }
+  builder.write().append_builder(std::move(cb2));
+  stack.push_builder(std::move(builder));
+  if (quiet) {
+    stack.push_smallint(0);
+  }
+  return 0;
+}
+
+int exec_store_builder_rev(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute STBR\n";
+  stack.check_underflow(2);
+  auto cb2 = stack.pop_builder();
+  auto builder = stack.pop_builder();
+  if (!builder->can_extend_by(cb2->size(), cb2->size_refs())) {
+    if (!quiet) {
+      throw VmError{Excno::cell_ov};
+    }
+    stack.push_builder(std::move(builder));
+    stack.push_builder(std::move(cb2));
+    stack.push_smallint(-1);
+    return 0;
+  }
+  builder.write().append_builder(std::move(cb2));
+  stack.push_builder(std::move(builder));
+  if (quiet) {
+    stack.push_smallint(0);
+  }
+  return 0;
+}
+
+int exec_store_int_var(VmState* st, unsigned args) {
+  bool sgnd = !(args & 1);
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ST" << (sgnd ? 'I' : 'U') << 'X' << ((args & 2) ? "R" : "") << ((args & 4) ? "Q\n" : "\n");
+  stack.check_underflow(3);
+  unsigned bits = stack.pop_smallint_range(256 + sgnd);
+  return exec_store_int_common(stack, bits, args);
+}
+
+std::string dump_store_int_var(CellSlice& cs, unsigned args) {
+  bool sgnd = !(args & 1);
+  std::string s = "ST";
+  s += sgnd ? 'I' : 'U';
+  s += 'X';
+  if (args & 2) {
+    s += 'R';
+  }
+  if (args & 4) {
+    s += 'Q';
+  }
+  return s;
+}
+
+int exec_store_int_fixed(VmState* st, unsigned args) {
+  unsigned bits = (args & 0xff) + 1;
+  args >>= 8;
+  bool sgnd = !(args & 1);
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ST" << (sgnd ? 'I' : 'U') << ((args & 2) ? "R" : "") << ((args & 4) ? "Q " : " ") << bits;
+  stack.check_underflow(2);
+  return exec_store_int_common(stack, bits, args);
+}
+
+std::string dump_store_int_fixed(CellSlice& cs, unsigned args) {
+  unsigned bits = (args & 0xff) + 1;
+  bool sgnd = !(args & 0x100);
+  std::ostringstream s{"ST"};
+  s << (sgnd ? 'I' : 'U');
+  if (args & 0x200) {
+    s << 'R';
+  }
+  if (args & 0x400) {
+    s << 'Q';
+  }
+  s << ' ' << bits;
+  return s.str();
+}
+
+int exec_store_const_ref(VmState* st, CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = (args & 1) + 1;
+  if (!cs.have_refs(refs)) {
+    throw VmError{Excno::inv_opcode, "no references left for a STREFCONST instruction"};
+  }
+  cs.advance(pfx_bits);
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute STREF" << refs << "CONST\n";
+  stack.check_underflow(1);
+  auto builder = stack.pop_builder();
+  check_space(*builder, 0, refs);
+  do {
+    builder.write().store_ref(cs.fetch_ref());
+  } while (--refs > 0);
+  stack.push_builder(std::move(builder));
+  return 0;
+}
+
+std::string dump_store_const_ref(CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = (args & 1) + 1;
+  if (!cs.have_refs(refs)) {
+    return "";
+  }
+  cs.advance(pfx_bits);
+  cs.advance_refs(refs);
+  return refs > 1 ? (std::string{"STREF"} + (char)('0' + refs) + "CONST") : "STREFCONST";
+}
+
+int compute_len_store_const_ref(const CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = (args & 1) + 1;
+  return cs.have_refs(refs) ? ((refs << 16) + pfx_bits) : 0;
+}
+
+int exec_store_le_int(VmState* st, unsigned args) {
+  unsigned bits = (args & 2) ? 64 : 32;
+  bool sgnd = !(args & 1);
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ST" << (sgnd ? 'I' : 'U') << "LE" << bits / 8;
+  stack.check_underflow(2);
+  auto builder = stack.pop_builder();
+  auto x = stack.pop_int();
+  check_space(*builder, bits);
+  if (!(sgnd ? x->signed_fits_bits(bits) : x->unsigned_fits_bits(bits))) {
+    throw VmError{Excno::range_chk};
+  }
+  unsigned char buff[8];
+  st->ensure_throw(x->export_bytes_lsb(buff, bits >> 3, sgnd));
+  builder.write().store_bytes(buff, bits >> 3);
+  stack.push_builder(std::move(builder));
+  return 0;
+}
+
+std::string dump_store_le_int(CellSlice& cs, unsigned args) {
+  bool sgnd = !(args & 1);
+  return std::string{"ST"} + (sgnd ? 'I' : 'U') + "LE" + ((args & 2) ? '8' : '4');
+}
+
+int exec_int_builder_func(VmState* st, std::string name, const std::function<int(Ref<CellBuilder>)>& func) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(1);
+  stack.push_smallint(func(stack.pop_builder()));
+  return 0;
+}
+
+int exec_2int_builder_func(VmState* st, std::string name,
+                           const std::function<std::pair<int, int>(Ref<CellBuilder>)>& func) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(1);
+  std::pair<int, int> res = func(stack.pop_builder());
+  stack.push_smallint(res.first);
+  stack.push_smallint(res.second);
+  return 0;
+}
+
+int exec_builder_chk_bits(VmState* st, unsigned args, bool quiet) {
+  unsigned bits = (args & 0xff) + 1;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute BCHKBITS" << (quiet ? "Q " : " ") << bits;
+  stack.check_underflow(1);
+  auto builder = stack.pop_builder();
+  if (quiet) {
+    stack.push_smallint(builder->can_extend_by(bits) ? -1 : 0);
+  } else {
+    check_space(*builder, bits);
+  }
+  return 0;
+}
+
+int exec_builder_chk_bits_refs(VmState* st, unsigned mode) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute BCHK" << ((mode & 1) ? "BIT" : "") << ((mode & 2) ? "REFS" : "S") << ((mode & 4) ? "Q" : "");
+  stack.check_underflow(1 + (mode & 1) + ((mode & 2) >> 1));
+  unsigned refs = (mode & 2) ? stack.pop_smallint_range(7) : 0;
+  unsigned bits = (mode & 1) ? stack.pop_smallint_range(1023) : 0;
+  auto builder = stack.pop_builder();
+  if (mode & 4) {
+    stack.push_smallint(builder->can_extend_by(bits, refs) ? -1 : 0);
+  } else {
+    check_space(*builder, bits, refs);
+  }
+  return 0;
+}
+
+int exec_store_same(VmState* st, const char* name, int val) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(2 + (val < 0));
+  if (val < 0) {
+    val = stack.pop_smallint_range(1);
+  }
+  unsigned bits = stack.pop_smallint_range(1023);
+  auto builder = stack.pop_builder();
+  check_space(*builder, bits);
+  builder.write().reserve_slice(bits) = (bool)val;
+  stack.push_builder(std::move(builder));
+  return 0;
+}
+
+int exec_store_const_slice(VmState* st, CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = (args >> 3) & 3;
+  unsigned data_bits = (args & 7) * 8 + 2;
+  if (!cs.have(pfx_bits + data_bits)) {
+    throw VmError{Excno::inv_opcode, "not enough data bits for a STSLICECONST instruction"};
+  }
+  if (!cs.have_refs(refs)) {
+    throw VmError{Excno::inv_opcode, "not enough references for a STSLICECONST instruction"};
+  }
+  Stack& stack = st->get_stack();
+  cs.advance(pfx_bits);
+  auto slice = cs.fetch_subslice(data_bits, refs);
+  slice.unique_write().remove_trailing();
+  VM_LOG(st) << "execute STSLICECONST " << slice;
+  auto builder = stack.pop_builder();
+  check_space(*builder, slice->size(), slice->size_refs());
+  cell_builder_add_slice(builder.write(), *slice);
+  stack.push_builder(std::move(builder));
+  return 0;
+}
+
+std::string dump_store_const_slice(CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = (args >> 3) & 3;
+  unsigned data_bits = (args & 7) * 8 + 2;
+  return dump_push_slice_common(cs, data_bits, refs, pfx_bits, "STSLICECONST ");
+}
+
+int compute_len_store_const_slice(const CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned refs = (args >> 3) & 3;
+  unsigned data_bits = (args & 7) * 8 + 2;
+  return compute_len_push_slice_common(cs, data_bits, refs, pfx_bits);
+}
+
+void register_cell_serialize_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mksimple(0xc8, 8, "NEWC", exec_new_builder))
+      .insert(OpcodeInstr::mksimple(0xc9, 8, "ENDC", exec_builder_to_cell))
+      .insert(
+          OpcodeInstr::mkfixed(0xca, 8, 8, instr::dump_1c_l_add(1, "STI "), std::bind(exec_store_int, _1, _2, true)))
+      .insert(
+          OpcodeInstr::mkfixed(0xcb, 8, 8, instr::dump_1c_l_add(1, "STU "), std::bind(exec_store_int, _1, _2, false)))
+      .insert(OpcodeInstr::mksimple(0xcc, 8, "STREF", std::bind(exec_store_ref, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xcd, 8, "ENDCST", std::bind(exec_store_builder_as_ref_rev, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xce, 8, "STSLICE", std::bind(exec_store_slice, _1, false)))
+      .insert(OpcodeInstr::mkfixed(0xcf00 >> 3, 13, 3, dump_store_int_var, exec_store_int_var))
+      .insert(OpcodeInstr::mkfixed(0xcf08 >> 3, 13, 11, dump_store_int_fixed, exec_store_int_fixed))
+      .insert(OpcodeInstr::mksimple(0xcf10, 16, "STREF", std::bind(exec_store_ref, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xcf11, 16, "STBREF", std::bind(exec_store_builder_as_ref, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xcf12, 16, "STSLICE", std::bind(exec_store_slice, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xcf13, 16, "STB", std::bind(exec_store_builder, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xcf14, 16, "STREFR", std::bind(exec_store_ref_rev, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xcf15, 16, "STBREFR", std::bind(exec_store_builder_as_ref_rev, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xcf16, 16, "STSLICER", std::bind(exec_store_slice_rev, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xcf17, 16, "STBR", std::bind(exec_store_builder_rev, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xcf18, 16, "STREFQ", std::bind(exec_store_ref, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xcf19, 16, "STBREFQ", std::bind(exec_store_builder_as_ref, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xcf1a, 16, "STSLICEQ", std::bind(exec_store_slice, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xcf1b, 16, "STBQ", std::bind(exec_store_builder, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xcf1c, 16, "STREFRQ", std::bind(exec_store_ref_rev, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xcf1d, 16, "STBREFRQ", std::bind(exec_store_builder_as_ref_rev, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xcf1e, 16, "STSLICERQ", std::bind(exec_store_slice_rev, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xcf1f, 16, "STBRQ", std::bind(exec_store_builder_rev, _1, true)))
+      .insert(OpcodeInstr::mkextrange(0xcf20, 0xcf22, 16, 1, dump_store_const_ref, exec_store_const_ref,
+                                      compute_len_store_const_ref))
+      .insert(OpcodeInstr::mksimple(0xcf23, 16, "ENDXC", exec_builder_to_special_cell))
+      .insert(OpcodeInstr::mkfixed(0xcf28 >> 2, 14, 2, dump_store_le_int, exec_store_le_int))
+      .insert(OpcodeInstr::mksimple(
+          0xcf31, 16, "BBITS",
+          std::bind(exec_int_builder_func, _1, "BBITS", [](Ref<CellBuilder> b) { return b->size(); })))
+      .insert(OpcodeInstr::mksimple(
+          0xcf32, 16, "BREFS",
+          std::bind(exec_int_builder_func, _1, "BREFS", [](Ref<CellBuilder> b) { return b->size_refs(); })))
+      .insert(OpcodeInstr::mksimple(
+          0xcf33, 16, "BBITREFS",
+          std::bind(exec_2int_builder_func, _1, "BBITSREFS",
+                    [](Ref<CellBuilder> b) { return std::make_pair(b->size(), b->size_refs()); })))
+      .insert(OpcodeInstr::mksimple(
+          0xcf35, 16, "BREMBITS",
+          std::bind(exec_int_builder_func, _1, "BREMBITS", [](Ref<CellBuilder> b) { return b->remaining_bits(); })))
+      .insert(OpcodeInstr::mksimple(
+          0xcf36, 16, "BREMREFS",
+          std::bind(exec_int_builder_func, _1, "BREMREFS", [](Ref<CellBuilder> b) { return b->remaining_refs(); })))
+      .insert(OpcodeInstr::mksimple(
+          0xcf37, 16, "BREMBITREFS",
+          std::bind(exec_2int_builder_func, _1, "BREMBITSREFS",
+                    [](Ref<CellBuilder> b) { return std::make_pair(b->remaining_bits(), b->remaining_refs()); })))
+      .insert(OpcodeInstr::mkfixed(0xcf38, 16, 8, instr::dump_1c_l_add(1, "BCHKBITS "),
+                                   std::bind(exec_builder_chk_bits, _1, _2, false)))
+      .insert(OpcodeInstr::mksimple(0xcf39, 16, "BCHKBITS", std::bind(exec_builder_chk_bits_refs, _1, 1)))
+      .insert(OpcodeInstr::mksimple(0xcf3a, 16, "BCHKREFS", std::bind(exec_builder_chk_bits_refs, _1, 2)))
+      .insert(OpcodeInstr::mksimple(0xcf3b, 16, "BCHKBITREFS", std::bind(exec_builder_chk_bits_refs, _1, 3)))
+      .insert(OpcodeInstr::mkfixed(0xcf3c, 16, 8, instr::dump_1c_l_add(1, "BCHKBITSQ "),
+                                   std::bind(exec_builder_chk_bits, _1, _2, true)))
+      .insert(OpcodeInstr::mksimple(0xcf3d, 16, "BCHKBITSQ", std::bind(exec_builder_chk_bits_refs, _1, 5)))
+      .insert(OpcodeInstr::mksimple(0xcf3e, 16, "BCHKREFSQ", std::bind(exec_builder_chk_bits_refs, _1, 6)))
+      .insert(OpcodeInstr::mksimple(0xcf3f, 16, "BCHKBITREFSQ", std::bind(exec_builder_chk_bits_refs, _1, 7)))
+      .insert(OpcodeInstr::mksimple(0xcf40, 16, "STZEROES", std::bind(exec_store_same, _1, "STZEROES", 0)))
+      .insert(OpcodeInstr::mksimple(0xcf41, 16, "STONES", std::bind(exec_store_same, _1, "STONES", 1)))
+      .insert(OpcodeInstr::mksimple(0xcf42, 16, "STSAME", std::bind(exec_store_same, _1, "STSAME", -1)))
+      .insert(OpcodeInstr::mkext(0xcf80 >> 7, 9, 5, dump_store_const_slice, exec_store_const_slice,
+                                 compute_len_store_const_slice));
+}
+
+int exec_cell_to_slice(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute CTOS";
+  auto cell = stack.pop_cell();
+  stack.push_cellslice(load_cell_slice_ref(std::move(cell)));
+  return 0;
+}
+
+int exec_cell_to_slice_maybe_special(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute XCTOS";
+  bool is_special;
+  auto cell = stack.pop_cell();
+  stack.push_cellslice(load_cell_slice_ref_special(std::move(cell), is_special));
+  stack.push_bool(is_special);
+  return 0;
+}
+
+int exec_load_special_cell(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute XLOAD" << (quiet ? "Q" : "");
+  auto cell = stack.pop_cell();
+  stack.push_cell(cell);
+  if (quiet) {
+    stack.push_bool(true);
+  }
+  return 0;
+}
+
+int exec_slice_chk_empty(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ENDS";
+  auto cs = stack.pop_cellslice();
+  if (cs->size() || cs->size_refs()) {
+    throw VmError{Excno::cell_und, "extra data remaining in deserialized cell"};
+  }
+  return 0;
+}
+
+int exec_load_int_common(Stack& stack, unsigned bits, unsigned mode) {
+  auto cs = stack.pop_cellslice();
+  if (!cs->have(bits)) {
+    if (!(mode & 4)) {
+      throw VmError{Excno::cell_und};
+    }
+    if (!(mode & 2)) {
+      stack.push_cellslice(std::move(cs));
+    }
+    stack.push_smallint(0);
+    return 0;
+  }
+  bool sgnd = !(mode & 1);
+  if (mode & 2) {
+    stack.push_int(cs->prefetch_int256(bits, sgnd));
+  } else {
+    stack.push_int(cs.write().fetch_int256(bits, sgnd));
+    stack.push_cellslice(std::move(cs));
+  }
+  if (mode & 4) {
+    stack.push_smallint(-1);
+  }
+  return 0;
+}
+
+int exec_load_int_fixed(VmState* st, unsigned args, unsigned mode) {
+  unsigned bits = (args & 0xff) + 1;
+  bool sgnd = !(mode & 1);
+  VM_LOG(st) << "execute " << (mode & 2 ? "P" : "") << "LD" << (sgnd ? 'I' : 'U') << (mode & 4 ? "Q " : " ") << bits;
+  return exec_load_int_common(st->get_stack(), bits, mode);
+}
+
+int exec_preload_ref_fixed(VmState* st, unsigned args) {
+  unsigned idx = args & 3;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PLDREFIDX " << idx;
+  auto cs = stack.pop_cellslice();
+  if (!cs->have_refs(idx + 1)) {
+    throw VmError{Excno::cell_und};
+  }
+  stack.push_cell(cs->prefetch_ref(idx));
+  return 0;
+}
+
+int exec_preload_ref(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PLDREFVAR";
+  stack.check_underflow(2);
+  unsigned idx = stack.pop_smallint_range(3);
+  auto cs = stack.pop_cellslice();
+  if (!cs->have_refs(idx + 1)) {
+    throw VmError{Excno::cell_und};
+  }
+  stack.push_cell(cs->prefetch_ref(idx));
+  return 0;
+}
+
+int exec_load_ref(VmState* st, unsigned mode) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << (mode & 2 ? "P" : "") << "LDREF" << (mode & 4 ? "Q" : "");
+  auto cs = stack.pop_cellslice();
+  if (!cs->have_refs()) {
+    if (!(mode & 4)) {
+      throw VmError{Excno::cell_und};
+    }
+    stack.push_smallint(0);
+    return 0;
+  }
+  if (mode & 2) {
+    stack.push_cell(cs->prefetch_ref());
+  } else {
+    stack.push_cell(cs.write().fetch_ref());
+    stack.push_cellslice(std::move(cs));
+  }
+  if (mode & 4) {
+    stack.push_smallint(-1);
+  }
+  return 0;
+}
+
+int exec_load_ref_rev_to_slice(VmState* st, unsigned mode) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << (mode & 2 ? "P" : "") << "LDREFRTOS" << (mode & 4 ? "Q" : "");
+  auto cs = stack.pop_cellslice();
+  if (!cs->have_refs()) {
+    if (!(mode & 4)) {
+      throw VmError{Excno::cell_und};
+    }
+    stack.push_smallint(0);
+    return 0;
+  }
+  if (mode & 2) {
+    stack.push_cellslice(load_cell_slice_ref(cs->prefetch_ref()));
+  } else {
+    auto cell = cs.write().fetch_ref();
+    stack.push_cellslice(std::move(cs));
+    stack.push_cellslice(load_cell_slice_ref(std::move(cell)));
+  }
+  if (mode & 4) {
+    stack.push_smallint(-1);
+  }
+  return 0;
+}
+
+int exec_load_slice_common(Stack& stack, unsigned bits, unsigned mode) {
+  auto cs = stack.pop_cellslice();
+  if (!cs->have(bits)) {
+    if (!(mode & 2)) {
+      throw VmError{Excno::cell_und};
+    }
+    if (!(mode & 1)) {
+      stack.push_cellslice(std::move(cs));
+    }
+    stack.push_smallint(0);
+    return 0;
+  }
+  if (mode & 1) {
+    stack.push_cellslice(cs->prefetch_subslice(bits));
+  } else {
+    stack.push_cellslice(cs.write().fetch_subslice(bits));
+    stack.push_cellslice(std::move(cs));
+  }
+  if (mode & 2) {
+    stack.push_smallint(-1);
+  }
+  return 0;
+}
+
+int exec_load_slice_fixed(VmState* st, unsigned args) {
+  unsigned bits = (args & 0xff) + 1;
+  VM_LOG(st) << "execute LDSLICE " << bits;
+  return exec_load_slice_common(st->get_stack(), bits, 0);
+}
+
+int exec_load_int_var(VmState* st, unsigned args) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << (args & 2 ? "PLD" : "LD") << (args & 1 ? "UX" : "IX") << (args & 4 ? "Q\n" : "\n");
+  stack.check_underflow(2);
+  unsigned bits = stack.pop_smallint_range(257 - (args & 1));
+  return exec_load_int_common(stack, bits, args & 7);
+}
+
+std::string dump_load_int_var(CellSlice&, unsigned args) {
+  return (args & 2 ? std::string{"PLD"} : std::string{"LD"}) + (args & 1 ? "UX" : "IX") + (args & 4 ? "Q" : "");
+}
+
+int exec_load_int_fixed2(VmState* st, unsigned args) {
+  unsigned bits = (args & 0xff) + 1;
+  args >>= 8;
+  VM_LOG(st) << "execute " << (args & 2 ? "PLD" : "LD") << (args & 1 ? "U" : "I") << (args & 4 ? "Q " : " ") << bits;
+  return exec_load_int_common(st->get_stack(), bits, args & 7);
+}
+
+std::string dump_load_int_fixed2(CellSlice&, unsigned args) {
+  std::ostringstream os{args & 0x200 ? "PLD" : "LD"};
+  os << (args & 0x100 ? 'U' : 'I');
+  if (args & 0x400) {
+    os << 'Q';
+  }
+  os << ' ' << ((args & 0xff) + 1);
+  return os.str();
+}
+
+int exec_preload_uint_fixed_0e(VmState* st, unsigned args) {
+  unsigned bits = ((args & 7) + 1) << 5;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PLDUZ " << bits;
+  auto cs = stack.pop_cellslice();
+  auto x = cs->prefetch_int256_zeroext(bits, false);
+  stack.push_cellslice(std::move(cs));
+  stack.push_int(std::move(x));
+  return 0;
+}
+
+std::string dump_preload_uint_fixed_0e(CellSlice&, unsigned args) {
+  std::ostringstream os{"PLDUZ "};
+  unsigned bits = ((args & 7) + 1) << 5;
+  os << bits;
+  return os.str();
+}
+
+int exec_load_slice(VmState* st, unsigned args) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << (args & 1 ? "PLDSLICEX" : "LDSLICEX") << (args & 2 ? "Q\n" : "\n");
+  stack.check_underflow(2);
+  unsigned bits = stack.pop_smallint_range(1023);
+  return exec_load_slice_common(stack, bits, args);
+}
+
+std::string dump_load_slice(CellSlice&, unsigned args) {
+  return std::string{args & 1 ? "P" : ""} + "LDSLICEX" + (args & 2 ? "Q" : "");
+}
+
+int exec_load_slice_fixed2(VmState* st, unsigned args) {
+  unsigned bits = (args & 0xff) + 1;
+  args >>= 8;
+  VM_LOG(st) << "execute " << (args & 1 ? "PLDSLICE" : "LDSLICE") << (args & 2 ? "Q " : " ") << bits;
+  return exec_load_slice_common(st->get_stack(), bits, args);
+}
+
+std::string dump_load_slice_fixed2(CellSlice&, unsigned args) {
+  unsigned bits = (args & 0xff) + 1;
+  std::ostringstream os{args & 0x100 ? "PLDSLICE" : "LDSLICE"};
+  if (args & 0x200) {
+    os << 'Q';
+  }
+  os << ' ' << bits;
+  return os.str();
+}
+
+int exec_slice_op_args(VmState* st, const char* name, unsigned max_arg1,
+                       const std::function<bool(CellSlice&, unsigned)>& func) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(2);
+  unsigned x = stack.pop_smallint_range(max_arg1);
+  auto cs = stack.pop_cellslice();
+  if (!func(cs.write(), x)) {
+    throw VmError{Excno::cell_und};
+  }
+  stack.push_cellslice(std::move(cs));
+  return 0;
+}
+
+int exec_slice_op_args2(VmState* st, const char* name, unsigned max_arg1, unsigned max_arg2,
+                        const std::function<bool(CellSlice&, unsigned, unsigned)>& func) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(3);
+  unsigned y = stack.pop_smallint_range(max_arg2);
+  unsigned x = stack.pop_smallint_range(max_arg1);
+  auto cs = stack.pop_cellslice();
+  if (!func(cs.write(), x, y)) {
+    throw VmError{Excno::cell_und};
+  }
+  stack.push_cellslice(std::move(cs));
+  return 0;
+}
+
+int exec_slice_begins_with_common(VmState* st, Ref<CellSlice> cs2, bool quiet) {
+  Stack& stack = st->get_stack();
+  auto cs = stack.pop_cellslice();
+  if (!cs->has_prefix(*cs2)) {
+    if (!quiet) {
+      throw VmError{Excno::cell_und, "slice does not begin with expected data bits"};
+    }
+    stack.push_cellslice(std::move(cs));
+    stack.push_smallint(0);
+    return 0;
+  }
+  cs.write().advance(cs2->size());
+  stack.push_cellslice(std::move(cs));
+  if (quiet) {
+    stack.push_smallint(-1);
+  }
+  return 0;
+}
+
+int exec_slice_begins_with(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SDBEGINSX" << (quiet ? "Q\n" : "\n");
+  stack.check_underflow(2);
+  return exec_slice_begins_with_common(st, stack.pop_cellslice(), quiet);
+}
+
+int exec_slice_begins_with_const(VmState* st, CellSlice& cs, unsigned args, int pfx_bits) {
+  bool quiet = args & 128;
+  unsigned data_bits = (args & 127) * 8 + 3;
+  if (!cs.have(pfx_bits + data_bits)) {
+    throw VmError{Excno::inv_opcode, "not enough data bits for a SDBEGINS instruction"};
+  }
+  cs.advance(pfx_bits);
+  auto slice = cs.fetch_subslice(data_bits);
+  slice.unique_write().remove_trailing();
+  VM_LOG(st) << "execute SDBEGINS" << (quiet ? "Q " : " ") << slice;
+  return exec_slice_begins_with_common(st, slice, quiet);
+}
+
+std::string dump_slice_begins_with_const(CellSlice& cs, unsigned args, int pfx_bits) {
+  bool quiet = args & 128;
+  unsigned data_bits = (args & 127) * 8 + 3;
+  return dump_push_slice_common(cs, data_bits, 0, pfx_bits, quiet ? "SDBEGINSQ " : "SDBEGINS ");
+}
+
+int compute_len_slice_begins_with_const(const CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned data_bits = (args & 127) * 8 + 3;
+  return compute_len_push_slice_common(cs, data_bits, 0, pfx_bits);
+}
+
+int exec_subslice(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SUBSLICE\n";
+  stack.check_underflow(5);
+  unsigned r2 = stack.pop_smallint_range(4), l2 = stack.pop_smallint_range(1023);
+  unsigned r1 = stack.pop_smallint_range(4), l1 = stack.pop_smallint_range(1023);
+  auto cs = stack.pop_cellslice();
+  if (!cs.write().skip_first(l1, r1) || !cs.unique_write().only_first(l2, r2)) {
+    throw VmError{Excno::cell_und};
+  }
+  stack.push_cellslice(std::move(cs));
+  return 0;
+}
+
+int exec_split(VmState* st, bool quiet) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SPLIT" << (quiet ? "Q\n" : "\n");
+  stack.check_underflow(3);
+  unsigned refs = stack.pop_smallint_range(4), bits = stack.pop_smallint_range(1023);
+  auto cs = stack.pop_cellslice();
+  if (!cs->have(bits) || !cs->have_refs(refs)) {
+    if (!quiet) {
+      throw VmError{Excno::cell_und};
+    }
+    stack.push_cellslice(std::move(cs));
+    stack.push_smallint(0);
+    return 0;
+  }
+  auto cs2 = cs;
+  cs2.write().only_first(bits, refs);
+  cs.write().skip_first(bits, refs);
+  stack.push_cellslice(std::move(cs2));
+  stack.push_cellslice(std::move(cs));
+  if (quiet) {
+    stack.push_smallint(-1);
+  }
+  return 0;
+}
+
+int exec_slice_chk_op_args(VmState* st, const char* name, unsigned max_arg1, bool quiet,
+                           const std::function<bool(const CellSlice&, unsigned)>& func) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(2);
+  unsigned x = stack.pop_smallint_range(max_arg1);
+  auto cs = stack.pop_cellslice();
+  bool res = func(*cs, x);
+  if (quiet) {
+    stack.push_smallint(res ? -1 : 0);
+  } else if (!res) {
+    throw VmError{Excno::cell_und};
+  }
+  return 0;
+}
+
+int exec_slice_chk_op_args2(VmState* st, const char* name, unsigned max_arg1, unsigned max_arg2, bool quiet,
+                            const std::function<bool(const CellSlice&, unsigned, unsigned)>& func) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(3);
+  unsigned y = stack.pop_smallint_range(max_arg2);
+  unsigned x = stack.pop_smallint_range(max_arg1);
+  auto cs = stack.pop_cellslice();
+  bool res = func(*cs, x, y);
+  if (quiet) {
+    stack.push_smallint(res ? -1 : 0);
+  } else if (!res) {
+    throw VmError{Excno::cell_und};
+  }
+  return 0;
+}
+
+int exec_slice_bits_refs(VmState* st, unsigned mode) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute S" << (mode & 1 ? "BIT" : "") << (mode & 2 ? "REF" : "") << "S\n";
+  stack.check_underflow(1);
+  auto cs = stack.pop_cellslice();
+  if (mode & 1) {
+    stack.push_smallint(cs->size());
+  }
+  if (mode & 2) {
+    stack.push_smallint(cs->size_refs());
+  }
+  return 0;
+}
+
+int exec_load_le_int(VmState* st, unsigned args) {
+  unsigned len = (args & 2) ? 8 : 4;
+  bool sgnd = !(args & 1);
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << (args & 4 ? "PLD" : "LD") << (sgnd ? 'I' : 'U') << "LE" << len
+             << (args & 8 ? "Q\n" : "\n");
+  stack.check_underflow(1);
+  auto cs = stack.pop_cellslice();
+  if (!cs->have(len << 3)) {
+    if (args & 8) {
+      if (!(args & 4)) {
+        stack.push_cellslice(std::move(cs));
+      }
+      stack.push_smallint(0);
+      return 0;
+    }
+    throw VmError{Excno::cell_und};
+  }
+  unsigned char buff[8];
+  st->ensure_throw(cs->prefetch_bytes(buff, len));
+  td::RefInt256 x{true};
+  st->ensure_throw(x.unique_write().import_bytes_lsb(buff, len, sgnd));
+  stack.push_int(std::move(x));
+  if (!(args & 4)) {
+    st->ensure_throw(cs.write().advance(len << 3));
+    stack.push_cellslice(std::move(cs));
+  }
+  if (args & 8) {
+    stack.push_smallint(-1);
+  }
+  return 0;
+}
+
+std::string dump_load_le_int(CellSlice& cs, unsigned args) {
+  bool sgnd = !(args & 1);
+  return std::string{args & 4 ? "P" : ""} + "LD" + (sgnd ? 'I' : 'U') + "LE" + ((args & 2) ? '8' : '4') +
+         (args & 8 ? "Q" : "");
+}
+
+int exec_load_same(VmState* st, const char* name, int x) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(1 + (x < 0));
+  if (x < 0) {
+    x = stack.pop_smallint_range(1);
+  }
+  auto cs = stack.pop_cellslice();
+  unsigned n = cs->count_leading(x);
+  if (n > 0) {
+    cs.write().advance(n);
+  }
+  stack.push_smallint(n);
+  stack.push_cellslice(std::move(cs));
+  return 0;
+}
+
+void register_cell_deserialize_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mksimple(0xd0, 8, "CTOS", exec_cell_to_slice))
+      .insert(OpcodeInstr::mksimple(0xd1, 8, "ENDS", exec_slice_chk_empty))
+      .insert(
+          OpcodeInstr::mkfixed(0xd2, 8, 8, instr::dump_1c_l_add(1, "LDI "), std::bind(exec_load_int_fixed, _1, _2, 0)))
+      .insert(
+          OpcodeInstr::mkfixed(0xd3, 8, 8, instr::dump_1c_l_add(1, "LDU "), std::bind(exec_load_int_fixed, _1, _2, 1)))
+      .insert(OpcodeInstr::mksimple(0xd4, 8, "LDREF", std::bind(exec_load_ref, _1, 0)))
+      .insert(OpcodeInstr::mksimple(0xd5, 8, "LDREFRTOS", std::bind(exec_load_ref_rev_to_slice, _1, 0)))
+      .insert(OpcodeInstr::mkfixed(0xd6, 8, 8, instr::dump_1c_l_add(1, "LDSLICE "), exec_load_slice_fixed))
+      .insert(OpcodeInstr::mkfixed(0xd700 >> 3, 13, 3, dump_load_int_var, exec_load_int_var))
+      .insert(OpcodeInstr::mkfixed(0xd708 >> 3, 13, 11, dump_load_int_fixed2, exec_load_int_fixed2))
+      .insert(OpcodeInstr::mkfixed(0xd710 >> 3, 13, 3, dump_preload_uint_fixed_0e, exec_preload_uint_fixed_0e))
+      .insert(OpcodeInstr::mkfixed(0xd718 >> 2, 14, 2, dump_load_slice, exec_load_slice))
+      .insert(OpcodeInstr::mkfixed(0xd71c >> 2, 14, 10, dump_load_slice_fixed2, exec_load_slice_fixed2))
+      .insert(OpcodeInstr::mksimple(0xd720, 16, "SDCUTFIRST",
+                                    std::bind(exec_slice_op_args, _1, "SDCUTFIRST", 1023,
+                                              [](auto& cs, unsigned bits) { return cs.only_first(bits); })))
+      .insert(OpcodeInstr::mksimple(0xd721, 16, "SDSKIPFIRST",
+                                    std::bind(exec_slice_op_args, _1, "SDSKIPFIRST", 1023,
+                                              [](auto& cs, unsigned bits) { return cs.skip_first(bits); })))
+      .insert(OpcodeInstr::mksimple(0xd722, 16, "SDCUTLAST",
+                                    std::bind(exec_slice_op_args, _1, "SDCUTLAST", 1023,
+                                              [](auto& cs, unsigned bits) { return cs.only_last(bits); })))
+      .insert(OpcodeInstr::mksimple(0xd723, 16, "SDSKIPLAST",
+                                    std::bind(exec_slice_op_args, _1, "SDSKIPLAST", 1023,
+                                              [](auto& cs, unsigned bits) { return cs.skip_last(bits); })))
+      .insert(OpcodeInstr::mksimple(
+          0xd724, 16, "SDSUBSTR",
+          std::bind(exec_slice_op_args2, _1, "SDSUBSTR", 1023, 1023,
+                    [](auto& cs, unsigned offs, unsigned bits) { return cs.skip_first(offs) && cs.only_first(bits); })))
+      .insert(OpcodeInstr::mksimple(0xd726, 16, "SDBEGINSX", std::bind(exec_slice_begins_with, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xd727, 16, "SDBEGINSXQ", std::bind(exec_slice_begins_with, _1, true)))
+      .insert(OpcodeInstr::mkext(0xd728 >> 3, 13, 8, dump_slice_begins_with_const, exec_slice_begins_with_const,
+                                 compute_len_slice_begins_with_const))
+      .insert(OpcodeInstr::mksimple(
+          0xd730, 16, "SCUTFIRST",
+          std::bind(exec_slice_op_args2, _1, "SCUTFIRST", 1023, 4,
+                    [](auto& cs, unsigned bits, unsigned refs) { return cs.only_first(bits, refs); })))
+      .insert(OpcodeInstr::mksimple(
+          0xd731, 16, "SSKIPFIRST",
+          std::bind(exec_slice_op_args2, _1, "SSKIPFIRST", 1023, 4,
+                    [](auto& cs, unsigned bits, unsigned refs) { return cs.skip_first(bits, refs); })))
+      .insert(OpcodeInstr::mksimple(
+          0xd732, 16, "SCUTLAST",
+          std::bind(exec_slice_op_args2, _1, "SCUTLAST", 1023, 4,
+                    [](auto& cs, unsigned bits, unsigned refs) { return cs.only_last(bits, refs); })))
+      .insert(OpcodeInstr::mksimple(
+          0xd733, 16, "SSKIPLAST",
+          std::bind(exec_slice_op_args2, _1, "SSKIPLAST", 1023, 4,
+                    [](auto& cs, unsigned bits, unsigned refs) { return cs.skip_last(bits, refs); })))
+      .insert(OpcodeInstr::mksimple(0xd734, 16, "SUBSLICE", exec_subslice))
+      .insert(OpcodeInstr::mksimple(0xd736, 16, "SPLIT", std::bind(exec_split, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xd737, 16, "SPLITQ", std::bind(exec_split, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xd739, 16, "XCTOS", exec_cell_to_slice_maybe_special))
+      .insert(OpcodeInstr::mksimple(0xd73a, 16, "XLOAD", std::bind(exec_load_special_cell, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xd73b, 16, "XLOADQ", std::bind(exec_load_special_cell, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xd741, 16, "SCHKBITS",
+                                    std::bind(exec_slice_chk_op_args, _1, "SCHKBITS", 1023, false,
+                                              [](auto cs, unsigned bits) { return cs.have(bits); })))
+      .insert(OpcodeInstr::mksimple(0xd742, 16, "SCHKREFS",
+                                    std::bind(exec_slice_chk_op_args, _1, "SCHKREFS", 1023, false,
+                                              [](auto cs, unsigned refs) { return cs.have_refs(refs); })))
+      .insert(OpcodeInstr::mksimple(
+          0xd743, 16, "SCHKBITREFS",
+          std::bind(exec_slice_chk_op_args2, _1, "SCHKBITREFS", 1023, 4, false,
+                    [](auto cs, unsigned bits, unsigned refs) { return cs.have(bits) && cs.have_refs(refs); })))
+      .insert(OpcodeInstr::mksimple(0xd745, 16, "SCHKBITSQ",
+                                    std::bind(exec_slice_chk_op_args, _1, "SCHKBITSQ", 1023, true,
+                                              [](auto cs, unsigned bits) { return cs.have(bits); })))
+      .insert(OpcodeInstr::mksimple(0xd746, 16, "SCHKREFSQ",
+                                    std::bind(exec_slice_chk_op_args, _1, "SCHKREFSQ", 1023, true,
+                                              [](auto cs, unsigned refs) { return cs.have_refs(refs); })))
+      .insert(OpcodeInstr::mksimple(
+          0xd747, 16, "SCHKBITREFSQ",
+          std::bind(exec_slice_chk_op_args2, _1, "SCHKBITREFSQ", 1023, 4, true,
+                    [](auto cs, unsigned bits, unsigned refs) { return cs.have(bits) && cs.have_refs(refs); })))
+      .insert(OpcodeInstr::mksimple(0xd748, 16, "PLDREFVAR", exec_preload_ref))
+      .insert(OpcodeInstr::mksimple(0xd749, 16, "SBITS", std::bind(exec_slice_bits_refs, _1, 1)))
+      .insert(OpcodeInstr::mksimple(0xd74a, 16, "SREFS", std::bind(exec_slice_bits_refs, _1, 2)))
+      .insert(OpcodeInstr::mksimple(0xd74b, 16, "SBITREFS", std::bind(exec_slice_bits_refs, _1, 3)))
+      .insert(OpcodeInstr::mkfixed(0xd74c >> 2, 14, 2, instr::dump_1c_and(3, "PLDREFIDX "), exec_preload_ref_fixed))
+      .insert(OpcodeInstr::mkfixed(0xd75, 12, 4, dump_load_le_int, exec_load_le_int))
+      .insert(OpcodeInstr::mksimple(0xd760, 16, "LDZEROES", std::bind(exec_load_same, _1, "LDZEROES", 0)))
+      .insert(OpcodeInstr::mksimple(0xd761, 16, "LDONES", std::bind(exec_load_same, _1, "LDONES", 1)))
+      .insert(OpcodeInstr::mksimple(0xd762, 16, "LDSAME", std::bind(exec_load_same, _1, "LDSAME", -1)));
+}
+
+void register_cell_ops(OpcodeTable& cp0) {
+  register_cell_const_ops(cp0);
+  register_cell_cmp_ops(cp0);
+  register_cell_serialize_ops(cp0);
+  register_cell_deserialize_ops(cp0);
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cellops.h b/submodules/ton/tonlib-src/crypto/vm/cellops.h
new file mode 100644
index 0000000000..cc0f5ab864
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cellops.h
@@ -0,0 +1,31 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cellslice.h"
+
+namespace vm {
+
+class OpcodeTable;
+
+void register_cell_ops(OpcodeTable &cp0);
+
+std::string dump_push_ref(CellSlice &cs, unsigned args, int pfx_bits, std::string name);
+int compute_len_push_ref(const CellSlice &cs, unsigned args, int pfx_bits);
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cellparse.hpp b/submodules/ton/tonlib-src/crypto/vm/cellparse.hpp
new file mode 100644
index 0000000000..9e411632dd
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cellparse.hpp
@@ -0,0 +1,105 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cells.h"
+#include "vm/cellslice.h"
+
+namespace vm {
+
+class CellRefParser {
+  Ref<CellSlice> cs;
+  bool state;
+
+ public:
+  CellRefParser(Ref<CellSlice> _cs) : cs(std::move(_cs)), state(cs.not_null()) {
+  }
+  bool ok() const {
+    return state;
+  }
+  operator bool() const {
+    return state;
+  }
+  template <class T>
+  CellRefParser& deserialize(T& val) {
+    state = (state && val.deserialize(cs.write()));
+    return *this;
+  }
+  //template <class T>
+  //CellRefParser& deserialize(T& val) {
+  //  state = val.deserialize_ext(cs.write(), state);
+  //  return *this;
+  //}
+  template <class T>
+  CellRefParser& deserialize(const T& val) {
+    state = (state && val.deserialize(cs.write()));
+    return *this;
+  }
+  //template <class T>
+  //CellRefParser& deserialize(const T& val) {
+  //  state = val.deserialize_ext(cs.write(), state);
+  //  return *this;
+  //}
+};
+
+class CellParser {
+  CellSlice& cs;
+  bool state;
+
+ public:
+  CellParser(CellSlice& _cs) : cs(_cs), state(true) {
+  }
+  bool ok() const {
+    return state;
+  }
+  operator bool() const {
+    return state;
+  }
+  template <class T>
+  CellParser& deserialize(T& val) {
+    state = (state && val.deserialize(cs));
+    return *this;
+  }
+  // template <class T>
+  // CellParser& deserialize(T& val) {
+  //  state = val.deserialize_ext(cs, state);
+  //  return *this;
+  // }
+  template <class T>
+  CellParser& deserialize(const T& val) {
+    state = (state && val.deserialize(cs));
+    return *this;
+  }
+  // template <class T>
+  // CellParser& deserialize(const T& val) {
+  //  state = val.deserialize_ext(cs, state);
+  //  return *this;
+  // }
+};
+
+template <class P, class T>
+P& operator>>(P& cp, T& val) {
+  return cp.deserialize(val);
+}
+
+template <class P, class T>
+P& operator>>(P& cp, const T& val) {
+  return cp.deserialize(val);
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells.h b/submodules/ton/tonlib-src/crypto/vm/cells.h
new file mode 100644
index 0000000000..ea362597f8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells.h
@@ -0,0 +1,73 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <ostream>
+#include "common/refcnt.hpp"
+#include "common/bitstring.h"
+#include "common/bigint.hpp"
+#include "common/refint.h"
+
+#include "vm/cells/Cell.h"
+#include "vm/cells/CellBuilder.h"
+#include "vm/cells/DataCell.h"
+#include "vm/cells/UsageCell.h"
+#include "vm/cells/VirtualCell.h"
+
+#include "td/utils/Slice.h"
+#include "td/utils/StringBuilder.h"
+#include "openssl/digest.h"
+
+// H_i(cell) = H(cell_i)
+// cell.hash = sha256(
+//   d1, d2,
+//   (level == 0 || special_type == PrunnedBranch) ? data : cell_(level - 1).hash,
+//   for child in refs:
+//     child.depth, child.hash
+// )
+// lower hashes of Prunned branch are calculated from its data
+// cell_i.ref[j] = (special_type == MerkleProof || special_type == MerkleUpdate) ? cell.ref[j]_(i+1) : cell.ref[j]_i
+//
+// Ordinary cell:
+// cell_i.data = cell.data
+// cell_i.level_mask = cell.level_mask & ((1<<i) - 1)
+// (cell_i.level_mask = == BinaryOr(cell_i.ref[j].level_mask))
+// cell_i.level = 32 - count_leading_zeroes32(cell_i.level_mask)
+// cell_i.depth = if cell_i.has_ref then max(cell_i.ref[j].depth) + 1 else 0
+// cell_i.ref[j] = cell.ref[j]
+//
+//
+// Prunned branch
+// cell.level_mask = prunned_cell.level_mask + (1 << (cell.level + 1))
+// cell.level = <default> == cell.level + 1
+// cell_i = if i < cell.level then prunned_cell_i
+// prunned_cell.data = EXCEPTION
+// prunned_cell_i.hash = <from cell.data>
+// prunned_cell.level_mask = cell.level_mask ^ (1 << cell.level)
+// prunned_cell.level = <default>
+// prunned_cell_i.depth = <from cell.data>
+//
+// Merkle proof
+// cell.level_mask = proof_cell.level_mask >> 1
+// cell.level = <default> == max(0, proof.cell.level - 1)
+// cell_i.data = <default>
+// cell_i.level_mask = <default>
+// cell_i.ref[j] = cell.ref[j]_(i+1)
+// cell_i.depth = max_j(1 + cell_i.ref[j].depth)
+
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/Cell.cpp b/submodules/ton/tonlib-src/crypto/vm/cells/Cell.cpp
new file mode 100644
index 0000000000..d9e392eda8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/Cell.cpp
@@ -0,0 +1,59 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/cells/Cell.h"
+#include "vm/cells/VirtualCell.h"
+#include "vm/cells/DataCell.h"
+
+#include <iostream>
+
+namespace vm {
+td::Status Cell::check_equals_unloaded(const Ref<Cell>& other) const {
+  auto level_mask = get_level_mask();
+  if (level_mask != other->get_level_mask()) {
+    return td::Status::Error("level mismatch");
+  }
+  auto level = level_mask.get_level();
+  for (unsigned i = 0; i <= level; i++) {
+    if (!get_level_mask().is_significant(i)) {
+      continue;
+    }
+    if (get_hash(i) != other->get_hash(i)) {
+      return td::Status::Error("hash mismatch");
+    }
+  }
+  for (unsigned i = 0; i <= level; i++) {
+    if (!get_level_mask().is_significant(i)) {
+      continue;
+    }
+    if (get_depth(i) != other->get_depth(i)) {
+      return td::Status::Error("depth mismatch");
+    }
+  }
+  return td::Status::OK();
+}
+
+Ref<Cell> Cell::virtualize(VirtualizationParameters virt) const {
+  return VirtualCell::create(virt, Ref<Cell>(this));
+}
+
+std::ostream& operator<<(std::ostream& os, const Cell& c) {
+  return os << c.get_hash().to_hex();
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/Cell.h b/submodules/ton/tonlib-src/crypto/vm/cells/Cell.h
new file mode 100644
index 0000000000..2f5d2cc74a
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/Cell.h
@@ -0,0 +1,89 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "common/refcnt.hpp"
+#include "common/bitstring.h"
+
+#include "vm/cells/CellHash.h"
+#include "vm/cells/CellTraits.h"
+#include "vm/cells/CellUsageTree.h"
+#include "vm/cells/LevelMask.h"
+#include "vm/cells/VirtualizationParameters.h"
+
+#include "td/utils/Status.h"
+
+#include <iostream>
+
+namespace vm {
+using td::Ref;
+class DataCell;
+
+class Cell : public CellTraits {
+ public:
+  using LevelMask = detail::LevelMask;
+  using VirtualizationParameters = detail::VirtualizationParameters;
+  struct LoadedCell {
+    Ref<DataCell> data_cell;
+    VirtualizationParameters virt;
+    CellUsageTree::NodePtr tree_node;  // TODO: inline_vector?
+  };
+
+  using Hash = CellHash;
+  static_assert(std::is_standard_layout<Hash>::value, "Cell::Hash is not a standard layout type");
+  static_assert(sizeof(Hash) == hash_bytes, "Cell::Hash size is not equal to hash_bytes");
+  //typedef td::BitArray<hash_bits> hash_t;
+
+  Cell* make_copy() const final {
+    throw WriteError();
+  }
+
+  // load interface
+  virtual td::Result<LoadedCell> load_cell() const = 0;
+  virtual Ref<Cell> virtualize(VirtualizationParameters virt) const;
+  virtual td::uint32 get_virtualization() const = 0;
+  virtual CellUsageTree::NodePtr get_tree_node() const = 0;
+  virtual bool is_loaded() const = 0;
+
+  // hash and level
+  virtual LevelMask get_level_mask() const = 0;
+
+  // level helper function
+  td::uint32 get_level() const {
+    return get_level_mask().get_level();
+  }
+
+  // hash helper functions
+  const Hash get_hash(int level = max_level) const {
+    return do_get_hash(level);
+  }
+
+  // depth helper function
+  td::uint16 get_depth(int level = max_level) const {
+    return do_get_depth(level);
+  }
+
+  td::Status check_equals_unloaded(const Ref<Cell>& other) const;
+
+ private:
+  virtual td::uint16 do_get_depth(td::uint32 level) const = 0;
+  virtual const Hash do_get_hash(td::uint32 level) const = 0;
+};
+
+std::ostream& operator<<(std::ostream& os, const Cell& c);
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/CellBuilder.cpp b/submodules/ton/tonlib-src/crypto/vm/cells/CellBuilder.cpp
new file mode 100644
index 0000000000..ec933c071b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/CellBuilder.cpp
@@ -0,0 +1,593 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/cells/CellBuilder.h"
+
+#include "vm/cells/CellSlice.h"
+#include "vm/cells/DataCell.h"
+
+#include "td/utils/misc.h"
+#include "td/utils/format.h"
+
+#include "openssl/digest.h"
+
+namespace vm {
+
+using td::Ref;
+using td::RefAny;
+
+/*
+ * 
+ *   CELL BUILDERS
+ * 
+ */
+
+CellBuilder::~CellBuilder() {
+  get_thread_safe_counter().add(-1);
+}
+
+CellBuilder::CellBuilder() : bits(0), refs_cnt(0) {
+  get_thread_safe_counter().add(+1);
+}
+
+Ref<DataCell> CellBuilder::finalize_copy(bool special) const {
+  auto* vm_state_interface = VmStateInterface::get();
+  if (vm_state_interface) {
+    vm_state_interface->register_cell_create();
+  }
+  auto res = DataCell::create(data, size(), td::span(refs.data(), size_refs()), special);
+  if (res.is_error()) {
+    LOG(ERROR) << res.error();
+    throw CellWriteError{};
+  }
+  CHECK(res.ok().not_null());
+  return res.move_as_ok();
+}
+
+Ref<DataCell> CellBuilder::finalize_novm(bool special) {
+  auto res = DataCell::create(data, size(), td::mutable_span(refs.data(), size_refs()), special);
+  bits = refs_cnt = 0;
+  if (res.is_error()) {
+    LOG(ERROR) << res.error();
+    throw CellWriteError{};
+  }
+  CHECK(res.ok().not_null());
+  return res.move_as_ok();
+}
+
+Ref<DataCell> CellBuilder::finalize(bool special) {
+  auto* vm_state_interface = VmStateInterface::get();
+  if (vm_state_interface) {
+    vm_state_interface->register_cell_create();
+  }
+  return finalize_novm(special);
+}
+
+Ref<Cell> CellBuilder::create_pruned_branch(Ref<Cell> cell, td::uint32 new_level, td::uint32 virt_level) {
+  if (cell->is_loaded() && cell->get_level() <= virt_level && cell->get_virtualization() == 0) {
+    CellSlice cs(NoVm{}, cell);
+    if (cs.size_refs() == 0) {
+      return cell;
+    }
+  }
+  return do_create_pruned_branch(std::move(cell), new_level, virt_level);
+}
+Ref<DataCell> CellBuilder::do_create_pruned_branch(Ref<Cell> cell, td::uint32 new_level, td::uint32 virt_level) {
+  auto level_mask = cell->get_level_mask().apply(virt_level);
+  auto level = level_mask.get_level();
+  if (new_level < level + 1) {
+    throw CellWriteError();
+  }
+  CellBuilder cb;
+  cb.store_long(static_cast<td::uint8>(Cell::SpecialType::PrunnedBranch), 8);
+  cb.store_long(level_mask.apply_or(Cell::LevelMask::one_level(new_level)).get_mask(), 8);
+  for (td::uint32 i = 0; i <= level; i++) {
+    if (level_mask.is_significant(i)) {
+      cb.store_bytes(cell->get_hash(i).as_slice());
+    }
+  }
+  for (td::uint32 i = 0; i <= level; i++) {
+    if (level_mask.is_significant(i)) {
+      cb.store_long(cell->get_depth(i), 16);
+    }
+  }
+  return cb.finalize(true);
+}
+
+Ref<DataCell> CellBuilder::create_merkle_proof(Ref<Cell> cell_proof) {
+  CellBuilder cb;
+  cb.store_long(static_cast<td::uint8>(Cell::SpecialType::MerkleProof), 8);
+  cb.store_bytes(cell_proof->get_hash(0).as_slice());
+  cb.store_long(cell_proof->get_depth(0), Cell::depth_bytes * 8);
+  cb.store_ref(cell_proof);
+  return cb.finalize(true);
+}
+
+Ref<DataCell> CellBuilder::create_merkle_update(Ref<Cell> from_proof, Ref<Cell> to_proof) {
+  CellBuilder cb;
+  cb.store_long(static_cast<td::uint8>(Cell::SpecialType::MerkleUpdate), 8);
+  cb.store_bytes(from_proof->get_hash(0).as_slice());
+  cb.store_bytes(to_proof->get_hash(0).as_slice());
+  cb.store_long(from_proof->get_depth(0), Cell::depth_bytes * 8);
+  cb.store_long(to_proof->get_depth(0), Cell::depth_bytes * 8);
+  cb.store_ref(from_proof);
+  cb.store_ref(to_proof);
+  return cb.finalize(true);
+}
+
+void CellBuilder::reset(void) {
+  while (refs_cnt > 0) {
+    refs[--refs_cnt].clear();
+  }
+  bits = 0;
+}
+
+CellBuilder& CellBuilder::operator=(const CellBuilder& other) {
+  bits = other.bits;
+  refs_cnt = other.refs_cnt;
+  refs = other.refs;
+  std::memcpy(data, other.data, (bits + 7) >> 3);
+  return *this;
+}
+
+CellBuilder& CellBuilder::operator=(CellBuilder&& other) {
+  bits = other.bits;
+  refs_cnt = other.refs_cnt;
+  refs = std::move(other.refs);
+  other.refs_cnt = 0;
+  std::memcpy(data, other.data, (bits + 7) >> 3);
+  return *this;
+}
+
+bool CellBuilder::can_extend_by(std::size_t new_bits, unsigned new_refs) const {
+  return (new_bits <= Cell::max_bits - bits && new_refs <= (unsigned)Cell::max_refs - refs_cnt);
+}
+
+bool CellBuilder::can_extend_by(std::size_t new_bits) const {
+  return new_bits <= Cell::max_bits - bits;
+}
+
+CellBuilder& CellBuilder::store_bytes(const unsigned char* str, std::size_t len) {
+  ensure_throw(len <= Cell::max_bytes);
+  return store_bits(str, len * 8);
+}
+
+CellBuilder& CellBuilder::store_bytes(const unsigned char* str, const unsigned char* end) {
+  ensure_throw(end >= str && end <= str + Cell::max_bytes);
+  return store_bits(str, (end - str) * 8);
+}
+
+CellBuilder& CellBuilder::store_bytes(const char* str, std::size_t len) {
+  return store_bytes((const unsigned char*)(str), len);
+}
+
+CellBuilder& CellBuilder::store_bytes(const char* str, const char* end) {
+  return store_bytes((const unsigned char*)(str), (const unsigned char*)(end));
+}
+
+CellBuilder& CellBuilder::store_bytes(td::Slice s) {
+  return store_bytes((const unsigned char*)(s.data()), (const unsigned char*)(s.data() + s.size()));
+}
+
+bool CellBuilder::store_bytes_bool(const unsigned char* str, std::size_t len) {
+  return len <= Cell::max_bytes && store_bits_bool(str, len * 8);
+}
+
+bool CellBuilder::store_bytes_bool(const char* str, std::size_t len) {
+  return len <= Cell::max_bytes && store_bits_bool((const unsigned char*)str, len * 8);
+}
+
+bool CellBuilder::store_bytes_bool(td::Slice s) {
+  return store_bytes_bool((const unsigned char*)s.data(), s.size());
+}
+
+bool CellBuilder::store_bits_bool(const unsigned char* str, std::size_t bit_count, int bit_offset) {
+  unsigned pos = bits;
+  if (!prepare_reserve(bit_count)) {
+    return false;
+  }
+  td::bitstring::bits_memcpy(data, pos, str, bit_offset, bit_count);
+  return true;
+}
+
+CellBuilder& CellBuilder::store_bits(const unsigned char* str, std::size_t bit_count, int bit_offset) {
+  unsigned pos = bits;
+  if (prepare_reserve(bit_count)) {
+    td::bitstring::bits_memcpy(data, pos, str, bit_offset, bit_count);
+  }
+  return *this;
+}
+
+CellBuilder& CellBuilder::store_bits(const td::BitSlice& bs) {
+  return store_bits(bs.get_ptr(), bs.size(), bs.get_offs());
+}
+
+CellBuilder& CellBuilder::store_bits(const char* str, std::size_t bit_count, int bit_offset) {
+  return store_bits((const unsigned char*)str, bit_count, bit_offset);
+}
+
+CellBuilder& CellBuilder::store_bits(td::ConstBitPtr bs, std::size_t bit_count) {
+  return store_bits(bs.ptr, bit_count, bs.offs);
+}
+
+bool CellBuilder::store_bits_bool(td::ConstBitPtr bs, std::size_t bit_count) {
+  return store_bits_bool(bs.ptr, bit_count, bs.offs);
+}
+
+CellBuilder& CellBuilder::store_bits_same(std::size_t bit_count, bool val) {
+  unsigned pos = bits;
+  if (prepare_reserve(bit_count)) {
+    td::bitstring::bits_memset(data, pos, val, bit_count);
+  }
+  return *this;
+}
+
+bool CellBuilder::store_bits_same_bool(std::size_t bit_count, bool val) {
+  unsigned pos = bits;
+  if (!prepare_reserve(bit_count)) {
+    return false;
+  }
+  td::bitstring::bits_memset(data, pos, val, bit_count);
+  return true;
+}
+
+inline bool CellBuilder::prepare_reserve(std::size_t bit_count) {
+  if (!can_extend_by(bit_count)) {
+    return false;
+  } else {
+    bits += (unsigned)bit_count;
+    return true;
+  }
+}
+
+td::BitSliceWrite CellBuilder::reserve_slice(std::size_t bit_count) {
+  unsigned offs = bits;
+  if (prepare_reserve(bit_count)) {
+    return td::BitSliceWrite{Ref<CellBuilder>{this}, data, offs, (unsigned)bit_count};
+  } else {
+    return td::BitSliceWrite{};
+  }
+}
+
+CellBuilder& CellBuilder::reserve_slice(std::size_t bit_count, td::BitSliceWrite& bsw) {
+  unsigned offs = bits;
+  if (prepare_reserve(bit_count)) {
+    bsw.assign(Ref<CellBuilder>{this}, data, offs, (unsigned)bit_count);
+  } else {
+    bsw.forget();
+  }
+  return *this;
+}
+
+bool CellBuilder::store_bool_bool(bool val) {
+  if (can_extend_by_fast(1)) {
+    store_long(val, 1);
+    return true;
+  } else {
+    return false;
+  }
+}
+
+bool CellBuilder::store_long_bool(long long val, unsigned val_bits) {
+  if (val_bits > 64 || !can_extend_by(val_bits)) {
+    return false;
+  }
+  store_long(val, val_bits);
+  return true;
+}
+
+bool CellBuilder::store_long_rchk_bool(long long val, unsigned val_bits) {
+  if (val_bits > 64 || !can_extend_by(val_bits)) {
+    return false;
+  }
+  if (val_bits < 64 && (val < static_cast<long long>(std::numeric_limits<td::uint64>::max() << (val_bits - 1)) ||
+                        val >= (1LL << (val_bits - 1)))) {
+    return false;
+  }
+  store_long(val, val_bits);
+  return true;
+}
+
+bool CellBuilder::store_ulong_rchk_bool(unsigned long long val, unsigned val_bits) {
+  if (val_bits > 64 || !can_extend_by(val_bits)) {
+    return false;
+  }
+  if (val_bits < 64 && val >= (1ULL << val_bits)) {
+    return false;
+  }
+  store_long(val, val_bits);
+  return true;
+}
+
+CellBuilder& CellBuilder::store_long(long long val, unsigned val_bits) {
+  return store_long_top(val << (64 - val_bits), val_bits);
+}
+
+CellBuilder& CellBuilder::store_long_top(unsigned long long val, unsigned top_bits) {
+  unsigned pos = bits;
+  auto reserve_ok = prepare_reserve(top_bits);
+  ensure_throw(reserve_ok);
+  td::bitstring::bits_store_long_top(data, pos, val, top_bits);
+  return *this;
+}
+
+bool CellBuilder::store_uint_less(unsigned upper_bound, unsigned long long val) {
+  return val < upper_bound && store_long_bool(val, 32 - td::count_leading_zeroes32(upper_bound - 1));
+}
+
+bool CellBuilder::store_uint_leq(unsigned upper_bound, unsigned long long val) {
+  return val <= upper_bound && store_long_bool(val, 32 - td::count_leading_zeroes32(upper_bound));
+}
+
+bool CellBuilder::store_int256_bool(const td::BigInt256& val, unsigned val_bits, bool sgnd) {
+  unsigned pos = bits;
+  if (!prepare_reserve(val_bits)) {
+    return false;
+  }
+  if (val.export_bits(data, pos, val_bits, sgnd)) {
+    return true;
+  } else {
+    bits = pos;
+    return false;
+  }
+}
+
+CellBuilder& CellBuilder::store_int256(const td::BigInt256& val, unsigned val_bits, bool sgnd) {
+  return ensure_pass(store_int256_bool(val, val_bits, sgnd));
+}
+
+bool CellBuilder::store_int256_bool(td::RefInt256 val, unsigned val_bits, bool sgnd) {
+  return val.not_null() && store_int256_bool(*val, val_bits, sgnd);
+}
+
+bool CellBuilder::store_builder_ref_bool(vm::CellBuilder&& cb) {
+  return store_ref_bool(cb.finalize());
+}
+
+bool CellBuilder::store_ref_bool(Ref<Cell> ref) {
+  if (refs_cnt < Cell::max_refs && ref.not_null()) {
+    refs[refs_cnt++] = std::move(ref);
+    return true;
+  } else {
+    return false;
+  }
+}
+
+CellBuilder& CellBuilder::store_ref(Ref<Cell> ref) {
+  return ensure_pass(store_ref_bool(std::move(ref)));
+}
+
+bool CellBuilder::append_data_cell_bool(const DataCell& cell) {
+  unsigned len = cell.size();
+  if (can_extend_by(len, cell.size_refs())) {
+    unsigned pos = bits;
+    ensure_throw(prepare_reserve(len));
+    td::bitstring::bits_memcpy(data, pos, cell.get_data(), 0, len);
+    for (unsigned i = 0; i < cell.size_refs(); i++) {
+      refs[refs_cnt++] = cell.get_ref(i);
+    }
+    return true;
+  } else {
+    return false;
+  }
+}
+
+CellBuilder& CellBuilder::append_data_cell(const DataCell& cell) {
+  return ensure_pass(append_data_cell_bool(cell));
+}
+
+bool CellBuilder::append_data_cell_bool(Ref<DataCell> cell_ref) {
+  return append_data_cell_bool(*cell_ref);
+}
+
+CellBuilder& CellBuilder::append_data_cell(Ref<DataCell> cell_ref) {
+  return ensure_pass(append_data_cell_bool(std::move(cell_ref)));
+}
+
+bool CellBuilder::append_builder_bool(const CellBuilder& cb) {
+  unsigned len = cb.size();
+  if (can_extend_by(len, cb.size_refs())) {
+    unsigned pos = bits;
+    ensure_throw(prepare_reserve(len));
+    td::bitstring::bits_memcpy(data, pos, cb.get_data(), 0, len);
+    for (unsigned i = 0; i < cb.size_refs(); i++) {
+      refs[refs_cnt++] = cb.get_ref(i);
+    }
+    return true;
+  } else {
+    return false;
+  }
+}
+
+CellBuilder& CellBuilder::append_builder(const CellBuilder& cb) {
+  return ensure_pass(append_builder_bool(cb));
+}
+
+bool CellBuilder::append_builder_bool(Ref<CellBuilder> cb_ref) {
+  return append_builder_bool(*cb_ref);
+}
+
+CellBuilder& CellBuilder::append_builder(Ref<CellBuilder> cb_ref) {
+  return ensure_pass(append_builder_bool(std::move(cb_ref)));
+}
+
+bool CellBuilder::append_cellslice_bool(const CellSlice& cs) {
+  unsigned len = cs.size();
+  if (can_extend_by(len, cs.size_refs())) {
+    int pos = bits;
+    ensure_throw(prepare_reserve(len));
+    td::bitstring::bits_memcpy(td::BitPtr{data, pos}, cs.data_bits(), len);
+    for (unsigned i = 0; i < cs.size_refs(); i++) {
+      refs[refs_cnt++] = cs.prefetch_ref(i);
+    }
+    return true;
+  } else {
+    return false;
+  }
+}
+
+CellBuilder& CellBuilder::append_cellslice(const CellSlice& cs) {
+  return ensure_pass(append_cellslice_bool(cs));
+}
+
+bool CellBuilder::append_cellslice_bool(Ref<CellSlice> cs_ref) {
+  return cs_ref.not_null() && append_cellslice_bool(*cs_ref);
+}
+
+CellBuilder& CellBuilder::append_cellslice(Ref<CellSlice> cs) {
+  return ensure_pass(append_cellslice_bool(cs));
+}
+
+bool CellBuilder::append_cellslice_chk(const CellSlice& cs, unsigned size_ext) {
+  return cs.size_ext() == size_ext && append_cellslice_bool(cs);
+}
+
+bool CellBuilder::append_cellslice_chk(Ref<CellSlice> cs_ref, unsigned size_ext) {
+  return cs_ref.not_null() && append_cellslice_chk(*cs_ref, size_ext);
+}
+
+bool CellBuilder::append_bitstring(const td::BitString& bs) {
+  return store_bits_bool(bs.cbits(), bs.size());
+}
+
+bool CellBuilder::append_bitstring(Ref<td::BitString> bs_ref) {
+  return bs_ref.not_null() && append_bitstring(*bs_ref);
+}
+
+bool CellBuilder::append_bitstring_chk(const td::BitString& bs, unsigned size) {
+  return bs.size() == size && store_bits_bool(bs.cbits(), size);
+}
+
+bool CellBuilder::append_bitstring_chk(Ref<td::BitString> bs_ref, unsigned size) {
+  return bs_ref.not_null() && append_bitstring_chk(*bs_ref, size);
+}
+
+bool CellBuilder::append_bitslice(const td::BitSlice& bs) {
+  return store_bits_bool(bs.bits(), bs.size());
+}
+
+bool CellBuilder::store_maybe_ref(Ref<Cell> cell) {
+  if (cell.is_null()) {
+    return store_long_bool(0, 1);
+  } else {
+    return store_long_bool(1, 1) && store_ref_bool(std::move(cell));
+  }
+}
+
+void CellBuilder::flush(unsigned char d[2]) const {
+  assert(refs_cnt <= Cell::max_refs && bits <= Cell::max_bits);
+
+  unsigned l = (bits >> 3);
+  if (bits & 7) {
+    int m = (0x80 >> (bits & 7));
+    data[l] = static_cast<unsigned char>((data[l] & -m) | m);
+    d[1] = static_cast<unsigned char>(2 * l + 1);
+  } else {
+    d[1] = static_cast<unsigned char>(2 * l);
+  }
+  d[0] = static_cast<unsigned char>(refs_cnt);
+}
+
+const unsigned char* CellBuilder::compute_hash(unsigned char buffer[Cell::hash_bytes]) const {
+  unsigned char tmp[2];
+  flush(tmp);
+  digest::SHA256 hasher(tmp, 2);
+  hasher.feed(data, (bits + 7) >> 3);
+  for (unsigned i = 0; i < refs_cnt; i++) {
+    hasher.feed(refs[i]->get_hash().as_slice().data(), Cell::hash_bytes);
+  }
+  auto extracted_size = hasher.extract(buffer);
+  DCHECK(extracted_size == Cell::hash_bytes);
+  return buffer;
+}
+
+int CellBuilder::serialize(unsigned char* buff, int buff_size) const {
+  int len = get_serialized_size();
+  if (len > buff_size) {
+    return 0;
+  }
+  flush(buff);
+  std::memcpy(buff + 2, data, len - 2);
+  return len;
+}
+
+CellBuilder* CellBuilder::make_copy() const {
+  CellBuilder* c = new CellBuilder();
+  if (!c) {
+    throw CellWriteError();
+  }
+  c->bits = bits;
+  std::memcpy(c->data, data, (bits + 7) >> 3);
+  c->refs_cnt = refs_cnt;
+  for (unsigned i = 0; i < refs_cnt; i++) {
+    c->refs[i] = refs[i];
+  }
+  return c;
+}
+
+CellSlice CellBuilder::as_cellslice() const& {
+  return CellSlice{finalize_copy()};
+}
+
+Ref<CellSlice> CellBuilder::as_cellslice_ref() const& {
+  return Ref<CellSlice>{true, finalize_copy()};
+}
+
+CellSlice CellBuilder::as_cellslice() && {
+  return CellSlice{finalize()};
+}
+
+Ref<CellSlice> CellBuilder::as_cellslice_ref() && {
+  return Ref<CellSlice>{true, finalize()};
+}
+
+bool CellBuilder::contents_equal(const CellSlice& cs) const {
+  if (size() != cs.size() || size_refs() != cs.size_refs()) {
+    return false;
+  }
+  if (td::bitstring::bits_memcmp(data_bits(), cs.data_bits(), size())) {
+    return false;
+  }
+  for (unsigned i = 0; i < size_refs(); i++) {
+    if (refs[i]->get_hash() != cs.prefetch_ref(i)->get_hash()) {
+      return false;
+    }
+  }
+  return true;
+}
+
+std::string CellBuilder::serialize() const {
+  unsigned char buff[Cell::max_serialized_bytes];
+  int len = serialize(buff, sizeof(buff));
+  return std::string(buff, buff + len);
+}
+
+std::string CellBuilder::to_hex() const {
+  unsigned char buff[Cell::max_serialized_bytes];
+  int len = serialize(buff, sizeof(buff));
+  char hex_buff[Cell::max_serialized_bytes * 2 + 1];
+  for (int i = 0; i < len; i++) {
+    sprintf(hex_buff + 2 * i, "%02x", buff[i]);
+  }
+  return hex_buff;
+}
+
+std::ostream& operator<<(std::ostream& os, const CellBuilder& cb) {
+  return os << cb.to_hex();
+}
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/CellBuilder.h b/submodules/ton/tonlib-src/crypto/vm/cells/CellBuilder.h
new file mode 100644
index 0000000000..0095018e44
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/CellBuilder.h
@@ -0,0 +1,238 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cells/DataCell.h"
+#include "vm/cells/VirtualCell.h"
+#include "vm/vmstate.h"
+#include "common/refint.h"
+
+#include "td/utils/ThreadSafeCounter.h"
+
+namespace vm {
+
+class CellSlice;
+class DataCell;
+
+class CellBuilder : public td::CntObject {
+ public:
+  struct CellWriteError {};
+  struct CellCreateError {};
+
+ private:
+  unsigned bits;
+  unsigned refs_cnt;
+  std::array<Ref<Cell>, Cell::max_refs> refs;
+  mutable unsigned char data[Cell::max_bytes];
+  static td::NamedThreadSafeCounter::CounterRef get_thread_safe_counter() {
+    static auto res = td::NamedThreadSafeCounter::get_default().get_counter("CellBuilder");
+    return res;
+  }
+
+ public:
+  CellBuilder();
+  virtual ~CellBuilder() override;
+
+  static Ref<Cell> create_pruned_branch(Ref<Cell> cell, td::uint32 new_level, td::uint32 virt_level = Cell::max_level);
+  static Ref<DataCell> do_create_pruned_branch(Ref<Cell> cell, td::uint32 new_level,
+                                               td::uint32 virt_level = Cell::max_level);
+  static Ref<DataCell> create_merkle_proof(Ref<Cell> cell_proof);
+  static Ref<DataCell> create_merkle_update(Ref<Cell> from_proof, Ref<Cell> to_proof);
+
+  unsigned get_refs_cnt() const {
+    return refs_cnt;
+  }
+  unsigned get_bits() const {
+    return bits;
+  }
+  unsigned size_refs() const {
+    return refs_cnt;
+  }
+  unsigned size() const {
+    return bits;
+  }
+  unsigned size_ext() const {
+    return (refs_cnt << 16) + bits;
+  }
+  unsigned remaining_bits() const {
+    return Cell::max_bits - bits;
+  }
+  unsigned remaining_refs() const {
+    return Cell::max_refs - refs_cnt;
+  }
+  const unsigned char* get_data() const {
+    return data;
+  }
+  td::ConstBitPtr data_bits() const {
+    return data;
+  }
+  Ref<Cell> get_ref(unsigned idx) const {
+    return idx < refs_cnt ? refs[idx] : Ref<Cell>{};
+  }
+  void reset();
+  CellBuilder& operator=(const CellBuilder&);
+  CellBuilder& operator=(CellBuilder&&);
+  CellBuilder& store_bytes(const char* str, std::size_t len);
+  CellBuilder& store_bytes(const char* str, const char* end);
+  CellBuilder& store_bytes(const unsigned char* str, std::size_t len);
+  CellBuilder& store_bytes(const unsigned char* str, const unsigned char* end);
+  CellBuilder& store_bytes(td::Slice s);
+  bool store_bytes_bool(const unsigned char* str, std::size_t len);
+  bool store_bytes_bool(const char* str, std::size_t len);
+  bool store_bytes_bool(td::Slice s);
+  CellBuilder& store_bits(const unsigned char* str, std::size_t bit_count, int bit_offset = 0);
+  CellBuilder& store_bits(const char* str, std::size_t bit_count, int bit_offset = 0);
+  CellBuilder& store_bits(td::ConstBitPtr bs, std::size_t bit_count);
+  CellBuilder& store_bits(const td::BitSlice& bs);
+  CellBuilder& store_bits_same(std::size_t bit_count, bool val);
+  bool store_bits_bool(const unsigned char* str, std::size_t bit_count, int bit_offset = 0);
+  bool store_bits_bool(td::ConstBitPtr bs, std::size_t bit_count);
+  template <unsigned n>
+  bool store_bits_bool(const td::BitArray<n>& ba) {
+    return store_bits_bool(ba.cbits(), n);
+  }
+  bool store_bits_same_bool(std::size_t bit_count, bool val);
+  CellBuilder& store_zeroes(std::size_t bit_count) {
+    return store_bits_same(bit_count, false);
+  }
+  CellBuilder& store_ones(std::size_t bit_count) {
+    return store_bits_same(bit_count, true);
+  }
+  bool store_zeroes_bool(std::size_t bit_count) {
+    return store_bits_same_bool(bit_count, false);
+  }
+  bool store_ones_bool(std::size_t bit_count) {
+    return store_bits_same_bool(bit_count, true);
+  }
+  td::BitSliceWrite reserve_slice(std::size_t bit_count);
+  CellBuilder& reserve_slice(std::size_t bit_count, td::BitSliceWrite& bsw);
+  bool store_long_bool(long long val, unsigned val_bits = 64);
+  bool store_long_rchk_bool(long long val, unsigned val_bits = 64);
+  bool store_ulong_rchk_bool(unsigned long long val, unsigned val_bits = 64);
+  bool store_uint_less(unsigned upper_bound, unsigned long long val);
+  bool store_uint_leq(unsigned upper_bound, unsigned long long val);
+  CellBuilder& store_long(long long val, unsigned val_bits = 64);
+  // bool store_long_top_bool(unsigned long long val, unsigned top_bits);
+  CellBuilder& store_long_top(unsigned long long val, unsigned top_bits);
+  bool store_bool_bool(bool val);
+  bool store_int256_bool(const td::BigInt256& val, unsigned val_bits, bool sgnd = true);
+  bool store_int256_bool(td::RefInt256 val, unsigned val_bits, bool sgnd = true);
+  bool store_uint256_bool(const td::BigInt256& val, unsigned val_bits) {
+    return store_int256_bool(val, val_bits, false);
+  }
+  bool store_uint256_bool(td::RefInt256 val, unsigned val_bits) {
+    return store_int256_bool(std::move(val), val_bits, false);
+  }
+  CellBuilder& store_int256(const td::BigInt256& val, unsigned val_bits, bool sgnd = true);
+  CellBuilder& store_uint256(const td::BigInt256& val, unsigned val_bits) {
+    return store_int256(val, val_bits, false);
+  }
+  bool store_builder_ref_bool(vm::CellBuilder&& cb);
+  bool store_ref_bool(Ref<Cell> r);
+  CellBuilder& store_ref(Ref<Cell> r);
+  bool append_data_cell_bool(const DataCell& cell);
+  CellBuilder& append_data_cell(const DataCell& cell);
+  bool append_data_cell_bool(Ref<DataCell> cell_ref);
+  CellBuilder& append_data_cell(Ref<DataCell> cell_ref);
+  bool append_builder_bool(const CellBuilder& cb);
+  CellBuilder& append_builder(const CellBuilder& cb);
+  bool append_builder_bool(Ref<CellBuilder> cb_ref);
+  CellBuilder& append_builder(Ref<CellBuilder> cb_ref);
+  bool append_cellslice_bool(const CellSlice& cs);
+  CellBuilder& append_cellslice(const CellSlice& cs);
+  bool append_cellslice_bool(Ref<CellSlice> cs_ref);
+  CellBuilder& append_cellslice(Ref<CellSlice> cs_ref);
+  bool append_cellslice_chk(const CellSlice& cs, unsigned size_ext);
+  bool append_cellslice_chk(Ref<CellSlice> cs, unsigned size_ext);
+  bool append_bitstring(const td::BitString& bs);
+  bool append_bitstring(Ref<td::BitString> bs_ref);
+  bool append_bitstring_chk(const td::BitString& bs, unsigned size);
+  bool append_bitstring_chk(Ref<td::BitString> bs, unsigned size);
+  bool append_bitslice(const td::BitSlice& bs);
+  bool store_maybe_ref(Ref<Cell> cell);
+  bool contents_equal(const CellSlice& cs) const;
+  CellBuilder* make_copy() const override;
+  bool can_extend_by(std::size_t bits) const;
+  bool can_extend_by(std::size_t bits, unsigned refs) const;
+  Ref<DataCell> finalize_copy(bool special = false) const;
+  Ref<DataCell> finalize(bool special = false);
+  Ref<DataCell> finalize_novm(bool special = false);
+  bool finalize_to(Ref<Cell>& res, bool special = false) {
+    return (res = finalize(special)).not_null();
+  }
+  CellSlice as_cellslice() const &;
+  CellSlice as_cellslice() &&;
+  Ref<CellSlice> as_cellslice_ref() const &;
+  Ref<CellSlice> as_cellslice_ref() &&;
+  static td::int64 get_total_cell_builders() {
+    return get_thread_safe_counter().sum();
+  }
+  int get_serialized_size() const {
+    return ((bits + 23) >> 3);
+  }
+  int serialize(unsigned char* buff, int buff_size) const;
+  std::string serialize() const;
+  std::string to_hex() const;
+  const unsigned char* compute_hash(unsigned char buffer[Cell::hash_bytes]) const;
+
+  const CellBuilder& ensure_pass(bool cond) const {
+    ensure_throw(cond);
+    return *this;
+  }
+  CellBuilder& ensure_pass(bool cond) {
+    ensure_throw(cond);
+    return *this;
+  }
+  void ensure_throw(bool cond) const {
+    if (!cond) {
+      throw CellCreateError{};
+    }
+  }
+
+ private:
+  void flush(unsigned char d[2]) const;
+  bool prepare_reserve(std::size_t bit_count);
+  bool can_extend_by_fast(unsigned bits_req) const {
+    return (int)bits <= (int)(Cell::max_bits - bits_req);
+  }
+  bool can_extend_by_fast(unsigned bits_req, unsigned refs_req) const {
+    return (int)bits <= (int)(Cell::max_bits - bits_req) && (int)refs_cnt <= (int)(Cell::max_refs - refs_req);
+  }
+  bool can_extend_by_fast2(unsigned bits_req) const {
+    return bits + bits_req <= Cell::max_bits;
+  }
+  bool can_extend_by_fast2(unsigned bits_req, unsigned refs_req) const {
+    return bits + bits_req <= Cell::max_bits && refs_cnt + refs_req <= Cell::max_refs;
+  }
+};
+
+std::ostream& operator<<(std::ostream& os, const CellBuilder& cb);
+
+template <class T>
+CellBuilder& operator<<(CellBuilder& cb, const T& val) {
+  return cb.ensure_pass(val.serialize(cb));
+}
+
+template <class T>
+Ref<CellBuilder>& operator<<(Ref<CellBuilder>& cb_ref, const T& val) {
+  bool res = val.serialize(cb_ref.write());
+  cb_ref->ensure_throw(res);
+  return cb_ref;
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/CellHash.cpp b/submodules/ton/tonlib-src/crypto/vm/cells/CellHash.cpp
new file mode 100644
index 0000000000..f801e2e440
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/CellHash.cpp
@@ -0,0 +1,28 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/cells/CellHash.h"
+
+#include "td/utils/StringBuilder.h"
+#include "td/utils/Slice.h"
+
+namespace vm {
+td::StringBuilder &operator<<(td::StringBuilder &sb, const CellHash &hash) {
+  return sb << hash.to_hex();
+}
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/CellHash.h b/submodules/ton/tonlib-src/crypto/vm/cells/CellHash.h
new file mode 100644
index 0000000000..0b5c122da9
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/CellHash.h
@@ -0,0 +1,92 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cells/CellTraits.h"
+#include "common/bitstring.h"
+
+#include "td/utils/as.h"
+
+#include <array>
+namespace td {
+class StringBuilder;
+}
+
+namespace vm {
+struct CellHash {
+ public:
+  td::Slice as_slice() const {
+    return td::Slice(hash_.data(), hash_.size());
+  }
+  td::MutableSlice as_slice() {
+    return td::MutableSlice(hash_.data(), hash_.size());
+  }
+  bool operator==(const CellHash& other) const {
+    return hash_ == other.hash_;
+  }
+  bool operator<(const CellHash& other) const {
+    return hash_ < other.hash_;
+  }
+  bool operator!=(const CellHash& other) const {
+    return hash_ != other.hash_;
+  }
+  std::string to_hex() const {
+    return td::ConstBitPtr{hash_.data()}.to_hex(hash_.size() * 8);
+  }
+  friend td::StringBuilder& operator<<(td::StringBuilder& sb, const CellHash& hash);
+  td::ConstBitPtr bits() const {
+    return td::ConstBitPtr{hash_.data()};
+  }
+  td::BitPtr bits() {
+    return td::BitPtr{hash_.data()};
+  }
+  td::BitSlice as_bitslice() const {
+    return td::BitSlice{hash_.data(), (unsigned int)hash_.size() * 8};
+  }
+  const std::array<td::uint8, CellTraits::hash_bytes>& as_array() const {
+    return hash_;
+  }
+
+  static CellHash from_slice(td::Slice slice) {
+    CellHash res;
+    CHECK(slice.size() == res.hash_.size());
+    td::MutableSlice(res.hash_.data(), res.hash_.size()).copy_from(slice);
+    return res;
+  }
+
+ private:
+  std::array<td::uint8, CellTraits::hash_bytes> hash_;
+};
+}  // namespace vm
+
+namespace std {
+template <>
+struct hash<vm::CellHash> {
+  typedef vm::CellHash argument_type;
+  typedef std::size_t result_type;
+  result_type operator()(argument_type const& s) const noexcept {
+    return td::as<size_t>(s.as_slice().ubegin());
+  }
+};
+}  // namespace std
+namespace vm {
+template <class H>
+H AbslHashValue(H h, const CellHash& cell_hash) {
+  return H::combine(std::move(h), std::hash<vm::CellHash>()(cell_hash));
+}
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/CellSlice.cpp b/submodules/ton/tonlib-src/crypto/vm/cells/CellSlice.cpp
new file mode 100644
index 0000000000..3b2bb74523
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/CellSlice.cpp
@@ -0,0 +1,1066 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/cells/CellSlice.h"
+#include "vm/excno.hpp"
+#include "td/utils/bits.h"
+
+namespace vm {
+
+/*
+CellSlice::CellSlice(Ref<Cell>&& ref) : cell(std::move(ref)), bits_st(0), refs_st(0), ptr(0), zd(0) {
+  init_bits_refs();
+}
+*/
+
+CellSlice::CellSlice(VirtualCell::LoadedCell loaded_cell)
+    : virt(loaded_cell.virt)
+    , cell(std::move(loaded_cell.data_cell))
+    , tree_node(std::move(loaded_cell.tree_node))
+    , bits_st(0)
+    , refs_st(0)
+    , ptr(0)
+    , zd(0) {
+  init_bits_refs();
+}
+
+CellSlice::CellSlice() : bits_st(0), refs_st(0), bits_en(0), refs_en(0), ptr(0), zd(0) {
+}
+
+namespace {
+Cell::LoadedCell load_cell_nothrow(const Ref<Cell>& ref) {
+  auto res = ref->load_cell();
+  if (res.is_ok()) {
+    auto ld = res.move_as_ok();
+    CHECK(ld.virt.get_virtualization() == 0 || ld.data_cell->special_type() != Cell::SpecialType::PrunnedBranch);
+    return ld;
+  }
+  return {};
+}
+
+Cell::LoadedCell load_cell_nothrow(const Ref<Cell>& ref, int mode) {
+  auto res = ref->load_cell();
+  if (res.is_ok()) {
+    auto ld = res.move_as_ok();
+    CHECK(ld.virt.get_virtualization() == 0 || ld.data_cell->special_type() != Cell::SpecialType::PrunnedBranch);
+    if ((mode >> (ld.data_cell->is_special() ? 1 : 0)) & 1) {
+      return ld;
+    }
+  }
+  return {};
+}
+
+}  // namespace
+
+CellSlice::CellSlice(NoVm, Ref<Cell> ref) : CellSlice(load_cell_nothrow(std::move(ref))) {
+}
+CellSlice::CellSlice(NoVmOrd, Ref<Cell> ref) : CellSlice(load_cell_nothrow(std::move(ref), 1)) {
+}
+CellSlice::CellSlice(NoVmSpec, Ref<Cell> ref) : CellSlice(load_cell_nothrow(std::move(ref), 2)) {
+}
+CellSlice::CellSlice(Ref<DataCell> ref) : CellSlice(VirtualCell::LoadedCell{std::move(ref), {}, {}}) {
+}
+CellSlice::CellSlice(const CellSlice& cs) = default;
+
+bool CellSlice::load(VirtualCell::LoadedCell loaded_cell) {
+  virt = loaded_cell.virt;
+  cell = std::move(loaded_cell.data_cell);
+  tree_node = std::move(loaded_cell.tree_node);
+  bits_st = 0;
+  refs_st = 0;
+  ptr = 0;
+  zd = 0;
+  init_bits_refs();
+  return cell.not_null();
+}
+
+bool CellSlice::load(NoVm, Ref<Cell> cell_ref) {
+  return load(load_cell_nothrow(std::move(cell_ref)));
+}
+bool CellSlice::load(NoVmOrd, Ref<Cell> cell_ref) {
+  return load(load_cell_nothrow(std::move(cell_ref), 1));
+}
+bool CellSlice::load(NoVmSpec, Ref<Cell> cell_ref) {
+  return load(load_cell_nothrow(std::move(cell_ref), 2));
+}
+bool CellSlice::load(Ref<DataCell> dc_ref) {
+  return load(VirtualCell::LoadedCell{std::move(dc_ref), {}, {}});
+}
+
+/*
+CellSlice::CellSlice(Ref<DataCell> dc_ref, unsigned _bits_en, unsigned _refs_en, unsigned _bits_st, unsigned _refs_st)
+    : cell(std::move(dc_ref))
+    , bits_st(_bits_st)
+    , refs_st(_refs_st)
+    , bits_en(_bits_en)
+    , refs_en(_refs_en)
+    , ptr(0)
+    , zd(0) {
+  assert(bits_st <= bits_en && refs_st <= refs_en);
+  if (cell.is_null()) {
+    assert(!bits_en && !refs_en);
+  } else {
+    assert(bits_en <= cell->get_bits() && refs_en <= cell->get_refs_cnt());
+    if (bits_en) {
+      init_preload();
+    }
+  }
+}
+*/
+
+CellSlice::CellSlice(const CellSlice& cs, unsigned _bits_en, unsigned _refs_en, unsigned _bits_st, unsigned _refs_st)
+    : virt(cs.virt)
+    , cell(cs.cell)
+    , tree_node(cs.tree_node)
+    , bits_st(cs.bits_st + _bits_st)
+    , refs_st(cs.refs_st + _refs_st)
+    , bits_en(cs.bits_st + _bits_en)
+    , refs_en(cs.refs_st + _refs_en)
+    , ptr(0)
+    , zd(0) {
+  assert(_bits_st <= _bits_en && _refs_st <= _refs_en);
+  assert(_bits_en <= cs.size() && _refs_en <= cs.size_refs());
+  if (_bits_en > _bits_st) {
+    init_preload();
+  }
+}
+
+CellSlice::CellSlice(const CellSlice& cs, unsigned _bits_en, unsigned _refs_en)
+    : virt(cs.virt)
+    , cell(cs.cell)
+    , tree_node(cs.tree_node)
+    , bits_st(cs.bits_st)
+    , refs_st(cs.refs_st)
+    , bits_en(cs.bits_st + _bits_en)
+    , refs_en(cs.refs_st + _refs_en)
+    , ptr(0)
+    , zd(0) {
+  assert(_bits_en <= cs.size() && _refs_en <= cs.size_refs());
+  if (_bits_en) {
+    init_preload();
+  }
+}
+
+Cell::LoadedCell CellSlice::move_as_loaded_cell() {
+  Cell::LoadedCell res{std::move(cell), std::move(virt), std::move(tree_node)};
+  clear();
+  return res;
+}
+
+void CellSlice::init_bits_refs() {
+  if (cell.is_null()) {
+    bits_en = 0;
+    refs_en = 0;
+  } else {
+    bits_en = cell->get_bits();
+    refs_en = cell->get_refs_cnt();
+    if (bits_en) {
+      init_preload();
+    }
+  }
+}
+
+void CellSlice::init_preload() const {
+  if (bits_st >= bits_en) {
+    zd = 0;
+    return;
+  }
+  ptr = cell->get_data() + (bits_st >> 3) + 1;
+  unsigned t = 8 - (bits_st & 7);
+  z = (((unsigned long long)ptr[-1]) << (64 - t));
+  zd = std::min(t, size());
+}
+
+void CellSlice::clear() {
+  zd = 0;
+  bits_en = bits_st = 0;
+  refs_st = refs_en = 0;
+  ptr = 0;
+  cell.clear();
+}
+
+/*
+void CellSlice::error() {
+  // maybe throw a different simple exception, and convert it at the upper level of the vm
+  throw VmError{Excno::cell_und, "cell deserialization error"};
+}
+*/
+
+unsigned CellSlice::get_cell_level() const {
+  return cell->get_level_mask().apply(virt.get_level()).get_level();
+}
+
+unsigned CellSlice::get_level() const {
+  unsigned l = 0;
+  for (unsigned i = refs_st; i < refs_en; i++) {
+    auto res = cell->get_ref(i)->virtualize(child_virt());
+    unsigned l1 = res->get_level();
+    // maybe l1 = cell->get_ref(i)->get_level_mask().apply(virt.get_level()).get_level();
+    if (l1 > l) {
+      l = l1;
+    }
+  }
+  return l;
+}
+
+bool CellSlice::advance(unsigned bits) {
+  if (have(bits)) {
+    bits_st += bits;
+    if (zd <= bits) {  // NB: if we write here zd < bits, we obtain bug with z <<= 64
+      init_preload();
+    } else {
+      zd -= bits;
+      z <<= bits;
+    }
+    return true;
+  } else {
+    return false;
+  }
+}
+
+bool CellSlice::advance_refs(unsigned refs = 1) {
+  if (have_refs(refs)) {
+    refs_st += refs;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+bool CellSlice::advance_ext(unsigned bits, unsigned refs) {
+  if (have(bits) && have_refs(refs)) {
+    refs_st += refs;
+    return advance(bits);
+  } else {
+    return false;
+  }
+}
+
+bool CellSlice::advance_ext(unsigned bits_refs) {
+  return advance_ext(bits_refs >> 16, bits_refs & 0xffff);
+}
+
+// (PRIVATE)
+// assume: at least `req_bits` bits can be preloaded
+void CellSlice::preload_at_least(unsigned req_bits) const {
+  assert(req_bits <= 64 && have(req_bits) && ptr);
+  if (req_bits <= zd) {
+    return;
+  }
+  int remain = bits_en - bits_st - zd;
+  if (zd <= 32 && remain > 24) {
+    z |= (((unsigned long long)td::bswap32(td::as<unsigned>(ptr))) << (32 - zd));
+    ptr += 4;
+    if (remain <= 32) {
+      zd += remain;
+      return;
+    }
+    zd += 32;
+    remain -= 32;
+  }
+  while (zd < req_bits && remain > 0) {
+    if (zd > 56) {
+      z |= (*ptr >> (zd - 56));
+      return;
+    }
+    z |= (((unsigned long long)*ptr++) << (56 - zd));
+    if (remain <= 8) {
+      zd += remain;
+      return;
+    }
+    zd += 8;
+    remain -= 8;
+  }
+}
+
+int CellSlice::prefetch_octet() const {
+  if (!have(8)) {
+    return -1;
+  } else {
+    preload_at_least(8);
+    return (int)(z >> 56);
+  }
+}
+
+int CellSlice::fetch_octet() {
+  if (!have(8)) {
+    return -1;
+  } else {
+    preload_at_least(8);
+    int res = (int)(z >> 56);
+    z <<= 8;
+    zd -= 8;
+    return res;
+  }
+}
+
+unsigned long long CellSlice::fetch_ulong(unsigned bits) {
+  if (!have(bits) || bits > 64) {
+    return fetch_ulong_eof;
+  } else if (!bits) {
+    return 0;
+  } else if (bits <= 56) {
+    preload_at_least(bits);
+    unsigned long long res = (z >> (64 - bits));
+    z <<= bits;
+    assert(zd >= bits);
+    zd -= bits;
+    bits_st += bits;
+    return res;
+  } else {
+    preload_at_least(bits);
+    unsigned long long res = (z >> (64 - bits));
+    advance(bits);
+    return res;
+  }
+}
+
+unsigned long long CellSlice::prefetch_ulong(unsigned bits) const {
+  if (!have(bits) || bits > 64) {
+    return fetch_ulong_eof;
+  } else if (!bits) {
+    return 0;
+  } else {
+    preload_at_least(bits);
+    return (z >> (64 - bits));
+  }
+}
+
+unsigned long long CellSlice::prefetch_ulong_top(unsigned& bits) const {
+  if (bits > size()) {
+    bits = size();
+  }
+  if (!bits) {
+    return 0;
+  }
+  preload_at_least(bits);
+  return z;
+}
+
+long long CellSlice::fetch_long(unsigned bits) {
+  if (!have(bits) || bits > 64) {
+    return fetch_long_eof;
+  } else if (!bits) {
+    return 0;
+  } else if (bits <= 56) {
+    preload_at_least(bits);
+    long long res = ((long long)z >> (64 - bits));
+    z <<= bits;
+    assert(zd >= bits);
+    zd -= bits;
+    bits_st += bits;
+    return res;
+  } else {
+    preload_at_least(bits);
+    long long res = ((long long)z >> (64 - bits));
+    advance(bits);
+    return res;
+  }
+}
+
+long long CellSlice::prefetch_long(unsigned bits) const {
+  if (!have(bits) || bits > 64) {
+    return fetch_long_eof;
+  } else if (!bits) {
+    return 0;
+  } else {
+    preload_at_least(bits);
+    return ((long long)z >> (64 - bits));
+  }
+}
+
+bool CellSlice::fetch_long_bool(unsigned bits, long long& res) {
+  if (bits > 64 || !have(bits)) {
+    return false;
+  }
+  res = fetch_long(bits);
+  return true;
+}
+
+bool CellSlice::prefetch_long_bool(unsigned bits, long long& res) const {
+  if (bits > 64 || !have(bits)) {
+    return false;
+  }
+  res = prefetch_long(bits);
+  return true;
+}
+
+bool CellSlice::fetch_ulong_bool(unsigned bits, unsigned long long& res) {
+  if (bits > 64 || !have(bits)) {
+    return false;
+  }
+  res = fetch_ulong(bits);
+  return true;
+}
+
+bool CellSlice::prefetch_ulong_bool(unsigned bits, unsigned long long& res) const {
+  if (bits > 64 || !have(bits)) {
+    return false;
+  }
+  res = prefetch_ulong(bits);
+  return true;
+}
+
+bool CellSlice::fetch_bool_to(bool& res) {
+  if (!have(1)) {
+    return false;
+  } else {
+    res = (bool)fetch_ulong(1);
+    return true;
+  }
+}
+
+bool CellSlice::fetch_bool_to(int& res) {
+  if (!have(1)) {
+    return false;
+  } else {
+    res = (int)fetch_ulong(1);
+    return true;
+  }
+}
+
+bool CellSlice::fetch_bool_to(int& res, int mask) {
+  if (!have(1)) {
+    return false;
+  } else if (fetch_ulong(1)) {
+    res |= mask;
+  } else {
+    res &= ~mask;
+  }
+  return true;
+}
+
+bool CellSlice::fetch_uint_to(unsigned bits, unsigned long long& res) {
+  if (bits > 64 || !have(bits)) {
+    return false;
+  } else {
+    res = fetch_ulong(bits);
+    return true;
+  }
+}
+
+bool CellSlice::fetch_uint_to(unsigned bits, long long& res) {
+  if (bits > 64 || !have(bits)) {
+    return false;
+  } else {
+    res = (long long)fetch_ulong(bits);
+    return res >= 0;
+  }
+}
+
+bool CellSlice::fetch_uint_to(unsigned bits, unsigned long& res) {
+  if (bits > 8 * sizeof(unsigned long) || !have(bits)) {
+    return false;
+  } else {
+    res = static_cast<unsigned long>(fetch_ulong(bits));
+    return true;
+  }
+}
+
+bool CellSlice::fetch_uint_to(unsigned bits, long& res) {
+  if (bits > 8 * sizeof(long) || !have(bits)) {
+    return false;
+  } else {
+    res = static_cast<long>(fetch_ulong(bits));
+    return res >= 0;
+  }
+}
+
+bool CellSlice::fetch_uint_to(unsigned bits, unsigned& res) {
+  if (bits > 32 || !have(bits)) {
+    return false;
+  } else {
+    res = (unsigned)fetch_ulong(bits);
+    return true;
+  }
+}
+
+bool CellSlice::fetch_uint_to(unsigned bits, int& res) {
+  if (bits > 32 || !have(bits)) {
+    return false;
+  } else {
+    res = (int)fetch_ulong(bits);
+    return res >= 0;
+  }
+}
+
+bool CellSlice::fetch_int_to(unsigned bits, long long& res) {
+  if (bits > 64 || !have(bits)) {
+    return false;
+  } else {
+    res = fetch_long(bits);
+    return true;
+  }
+}
+
+bool CellSlice::fetch_int_to(unsigned bits, int& res) {
+  if (bits > 32 || !have(bits)) {
+    return false;
+  } else {
+    res = (int)fetch_long(bits);
+    return true;
+  }
+}
+
+bool CellSlice::fetch_uint_less(unsigned upper_bound, int& res) {
+  unsigned bits = 32 - td::count_leading_zeroes32(upper_bound - 1);
+  if (!upper_bound || bits > 31 || !have(bits)) {
+    return false;
+  } else {
+    res = (int)fetch_ulong(bits);
+    return (unsigned)res < upper_bound;
+  }
+}
+
+bool CellSlice::fetch_uint_less(unsigned upper_bound, unsigned& res) {
+  unsigned bits = 32 - td::count_leading_zeroes32(upper_bound - 1);
+  if (!upper_bound || bits > 32 || !have(bits)) {
+    return false;
+  } else {
+    res = (unsigned)fetch_ulong(bits);
+    return res < upper_bound;
+  }
+}
+
+bool CellSlice::fetch_uint_leq(unsigned upper_bound, int& res) {
+  unsigned bits = 32 - td::count_leading_zeroes32(upper_bound);
+  if (bits > 31 || !have(bits)) {
+    return false;
+  } else {
+    res = (int)fetch_ulong(bits);
+    return (unsigned)res <= upper_bound;
+  }
+}
+
+bool CellSlice::fetch_uint_leq(unsigned upper_bound, unsigned& res) {
+  unsigned bits = 32 - td::count_leading_zeroes32(upper_bound);
+  if (bits > 32 || !have(bits)) {
+    return false;
+  } else {
+    res = (unsigned)fetch_ulong(bits);
+    return res <= upper_bound;
+  }
+}
+
+int CellSlice::bselect(unsigned bits, unsigned long long mask) const {
+  if (bits > 6 || !have(bits)) {
+    return -1;
+  } else {
+    int n = (int)prefetch_ulong(bits);
+    return td::count_bits64(mask & ((2ULL << n) - 1)) - 1;
+  }
+}
+
+int CellSlice::bselect_ext(unsigned bits, unsigned long long mask) const {
+  if (bits > 6) {
+    return -1;
+  }
+  int n;
+  if (have(bits)) {
+    n = (int)prefetch_ulong(bits);
+  } else {
+    n = (int)prefetch_ulong(size()) << (bits - size());
+  }
+  return td::count_bits64(mask & ((2ULL << n) - 1)) - 1;
+}
+
+td::RefInt256 CellSlice::fetch_int256(unsigned bits, bool sgnd) {
+  if (!have(bits)) {
+    return {};
+  } else if (bits < td::BigInt256::word_shift) {
+    long long val = sgnd ? fetch_long(bits) : fetch_ulong(bits);
+    return td::RefInt256{true, val};
+  } else {
+    td::RefInt256 res{true};
+    res.unique_write().import_bits(data_bits(), bits, sgnd);
+    advance(bits);
+    return res;
+  }
+}
+
+td::RefInt256 CellSlice::prefetch_int256(unsigned bits, bool sgnd) const {
+  if (!have(bits)) {
+    return {};
+  } else if (bits < td::BigInt256::word_shift) {
+    long long val = sgnd ? prefetch_long(bits) : prefetch_ulong(bits);
+    return td::RefInt256{true, val};
+  } else {
+    td::RefInt256 res{true};
+    res.unique_write().import_bits(data_bits(), bits, sgnd);
+    return res;
+  }
+}
+
+td::RefInt256 CellSlice::prefetch_int256_zeroext(unsigned bits, bool sgnd) const {
+  if (bits > 256u + sgnd) {
+    return td::RefInt256{false};
+  } else {
+    unsigned ld_bits = std::min(bits, size());
+    if (bits < td::BigInt256::word_shift) {
+      long long val = sgnd ? prefetch_long(ld_bits) : prefetch_ulong(ld_bits);
+      val <<= bits - ld_bits;
+      return td::RefInt256{true, val};
+    } else {
+      td::RefInt256 res{true};
+      res.unique_write().import_bits(data_bits(), ld_bits, sgnd);
+      res <<= bits - ld_bits;
+      return res;
+    }
+  }
+}
+
+td::BitSlice CellSlice::fetch_bits(unsigned bits) {
+  if (!have(bits)) {
+    return {};
+  } else {
+    td::BitSlice res{cell, data(), (int)bits_st, bits};
+    advance(bits);
+    return res;
+  }
+}
+
+td::BitSlice CellSlice::prefetch_bits(unsigned bits) const {
+  if (!have(bits)) {
+    return {};
+  } else {
+    return td::BitSlice{cell, data(), (int)bits_st, bits};
+  }
+}
+
+bool CellSlice::fetch_bits_to(td::BitPtr buffer, unsigned bits) {
+  if (!have(bits)) {
+    return false;
+  }
+  fetch_bits(bits).copy_to(buffer);
+  return true;
+}
+
+bool CellSlice::prefetch_bits_to(td::BitPtr buffer, unsigned bits) const {
+  if (!have(bits)) {
+    return false;
+  }
+  prefetch_bits(bits).copy_to(buffer);
+  return true;
+}
+
+td::Ref<CellSlice> CellSlice::fetch_subslice(unsigned bits, unsigned refs) {
+  if (!have(bits, refs)) {
+    return {};
+  } else {
+    td::Ref<CellSlice> res{true, *this, bits, refs};
+    advance(bits);
+    advance_refs(refs);
+    return res;
+  }
+}
+
+td::Ref<CellSlice> CellSlice::prefetch_subslice(unsigned bits, unsigned refs) const {
+  if (!have(bits, refs)) {
+    return {};
+  } else {
+    return td::Ref<CellSlice>{true, *this, bits, refs};
+  }
+}
+
+td::Ref<CellSlice> CellSlice::fetch_subslice_ext(unsigned size) {
+  return fetch_subslice(size & 0xffff, size >> 16);
+}
+
+td::Ref<CellSlice> CellSlice::prefetch_subslice_ext(unsigned size) const {
+  return prefetch_subslice(size & 0xffff, size >> 16);
+}
+
+td::Ref<td::BitString> CellSlice::prefetch_bitstring(unsigned bits) const {
+  if (!have(bits)) {
+    return {};
+  } else {
+    return td::Ref<td::BitString>{true, prefetch_bits(bits)};
+  }
+}
+
+td::Ref<td::BitString> CellSlice::fetch_bitstring(unsigned bits) {
+  if (!have(bits)) {
+    return {};
+  } else {
+    return td::Ref<td::BitString>{true, fetch_bits(bits)};
+  }
+}
+
+bool CellSlice::prefetch_bytes(unsigned char* buffer, unsigned bytes) const {
+  if (!have(bytes * 8)) {
+    return false;
+  } else {
+    td::BitSliceWrite{buffer, bytes* 8} = prefetch_bits(bytes * 8);
+    return true;
+  }
+}
+
+bool CellSlice::fetch_bytes(unsigned char* buffer, unsigned bytes) {
+  if (prefetch_bytes(buffer, bytes)) {
+    advance(bytes * 8);
+    return true;
+  } else {
+    return false;
+  }
+}
+
+Ref<Cell> CellSlice::prefetch_ref(unsigned offset) const {
+  if (offset < size_refs()) {
+    auto ref_id = refs_st + offset;
+    auto res = cell->get_ref(ref_id)->virtualize(child_virt());
+    if (!tree_node.empty()) {
+      res = UsageCell::create(std::move(res), tree_node.create_child(ref_id));
+    }
+    return res;
+  } else {
+    return Ref<Cell>{};
+  }
+}
+
+Ref<Cell> CellSlice::fetch_ref() {
+  if (have_refs()) {
+    auto ref_id = refs_st++;
+    auto res = cell->get_ref(ref_id)->virtualize(child_virt());
+    if (!tree_node.empty()) {
+      res = UsageCell::create(std::move(res), tree_node.create_child(ref_id));
+    }
+    return res;
+  } else {
+    return Ref<Cell>{};
+  }
+}
+
+bool CellSlice::begins_with(unsigned bits, unsigned long long value) const {
+  return have(bits) && !((prefetch_ulong(bits) ^ value) & ((1ULL << bits) - 1));
+}
+
+bool CellSlice::begins_with(unsigned long long value) const {
+  return begins_with(63 - td::count_leading_zeroes_non_zero64(value), value);
+}
+
+bool CellSlice::begins_with_skip(unsigned long long value) {
+  return begins_with_skip(63 - td::count_leading_zeroes_non_zero64(value), value);
+}
+
+bool CellSlice::only_first(unsigned bits, unsigned refs) {
+  if (!have(bits, refs)) {
+    return false;
+  }
+  bits_en = bits_st + bits;
+  refs_en = refs_st + refs;
+  return true;
+}
+
+bool CellSlice::only_ext(unsigned size) {
+  return only_first(size & 0xffff, size >> 16);
+}
+
+bool CellSlice::skip_first(unsigned bits, unsigned refs) {
+  if (!have(bits, refs)) {
+    return false;
+  }
+  refs_st += refs;
+  return advance(bits);
+}
+
+bool CellSlice::skip_ext(unsigned size) {
+  return skip_first(size & 0xffff, size >> 16);
+}
+
+bool CellSlice::only_last(unsigned bits, unsigned refs) {
+  if (!have(bits, refs)) {
+    return false;
+  }
+  refs_st = refs_en - refs;
+  return advance(size() - bits);
+}
+
+bool CellSlice::skip_last(unsigned bits, unsigned refs) {
+  if (!have(bits, refs)) {
+    return false;
+  }
+  bits_en -= bits;
+  refs_en -= refs;
+  return true;
+}
+
+bool CellSlice::cut_tail(const CellSlice& tail_cs) {
+  return skip_last(tail_cs.size(), tail_cs.size_refs());
+}
+
+int CellSlice::lex_cmp(const CellSlice& cs2) const {
+  return td::bitstring::bits_lexcmp(data(), bits_st, size(), cs2.data(), cs2.bits_st, cs2.size());
+}
+
+bool CellSlice::contents_equal(const CellSlice& cs2) const {
+  if (size() != cs2.size() || size_refs() != cs2.size_refs()) {
+    return false;
+  }
+  if (td::bitstring::bits_memcmp(data_bits(), cs2.data_bits(), size())) {
+    return false;
+  }
+  for (unsigned i = 0; i < size_refs(); i++) {
+    if (prefetch_ref(i)->get_hash() != cs2.prefetch_ref(i)->get_hash()) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool CellSlice::is_prefix_of(const CellSlice& cs2) const {
+  return size() <= cs2.size() && !td::bitstring::bits_memcmp(data_bits(), cs2.data_bits(), size(), 0);
+}
+
+bool CellSlice::is_prefix_of(td::ConstBitPtr bs, unsigned len) const {
+  return size() <= len && !td::bitstring::bits_memcmp(data_bits(), bs, size(), 0);
+}
+
+/*
+bool CellSlice::is_prefix_of(const td::BitSlice& bs, unsigned offs, unsigned max_len) const {
+  max_len = std::min(max_len, size());
+  return max_len + offs <= bs.size() &&
+         !td::bitstring::bits_memcmp(data_bits(), bs.bits() + offs, max_len, 0);
+}
+*/
+
+bool CellSlice::is_suffix_of(const CellSlice& cs2) const {
+  return size() <= cs2.size() &&
+         !td::bitstring::bits_memcmp(data_bits(), cs2.data_bits() + (cs2.size() - size()), size(), 0);
+}
+
+bool CellSlice::has_prefix(const CellSlice& cs2) const {
+  return size() >= cs2.size() && !td::bitstring::bits_memcmp(data_bits(), cs2.data_bits(), cs2.size(), 0);
+}
+
+bool CellSlice::has_prefix(td::ConstBitPtr bs, unsigned len) const {
+  return size() >= len && !td::bitstring::bits_memcmp(data_bits(), bs, len, 0);
+}
+
+bool CellSlice::has_suffix(const CellSlice& cs2) const {
+  return size() >= cs2.size() &&
+         !td::bitstring::bits_memcmp(data_bits() + (size() - cs2.size()), cs2.data_bits(), cs2.size(), 0);
+}
+
+bool CellSlice::is_proper_prefix_of(const CellSlice& cs2) const {
+  return size() < cs2.size() && !td::bitstring::bits_memcmp(data_bits(), cs2.data_bits(), size(), 0);
+}
+
+bool CellSlice::is_proper_suffix_of(const CellSlice& cs2) const {
+  return size() < cs2.size() &&
+         !td::bitstring::bits_memcmp(data_bits(), cs2.data_bits() + (cs2.size() - size()), size(), 0);
+}
+
+int CellSlice::common_prefix_len(const CellSlice& cs2) const {
+  std::size_t same_upto = 0;
+  td::bitstring::bits_memcmp(data_bits(), cs2.data_bits(), std::min(size(), cs2.size()), &same_upto);
+  return (int)same_upto;
+}
+
+/*
+int CellSlice::common_prefix_len(const td::BitSlice& bs, unsigned offs, unsigned max_len) const {
+  return common_prefix_len(bs.bits() + offs, std::min(bs.size() - offs, max_len));
+}
+*/
+
+int CellSlice::common_prefix_len(td::ConstBitPtr bs, unsigned len) const {
+  std::size_t same_upto = 0;
+  td::bitstring::bits_memcmp(data_bits(), bs, std::min(size(), len), &same_upto);
+  return (int)same_upto;
+}
+
+int CellSlice::count_leading(bool bit) const {
+  return (int)td::bitstring::bits_memscan(data_bits(), size(), bit);
+}
+
+int CellSlice::count_trailing(bool bit) const {
+  return (int)td::bitstring::bits_memscan_rev(data_bits(), size(), bit);
+}
+
+int CellSlice::remove_trailing() {
+  if (bits_st == bits_en) {
+    return 0;
+  }
+  unsigned bits = bits_en - bits_st;
+  unsigned trailing = (unsigned)td::bitstring::bits_memscan_rev(data(), bits_st, bits, 0);
+  assert(trailing <= bits);
+  if (trailing == bits) {
+    bits_en -= trailing;
+  } else {
+    bits_en -= ++trailing;
+  }
+  return trailing;
+}
+
+bool cell_builder_add_slice_bool(CellBuilder& cb, const CellSlice& cs) {
+  if (!cb.can_extend_by(cs.size(), cs.size_refs())) {
+    return false;
+  }
+  for (unsigned cnt = 0; cnt < cs.size_refs(); cnt++) {
+    cb.store_ref(cs.prefetch_ref(cnt));
+  }
+  cb.store_bits(cs.as_bitslice());
+  return true;
+}
+
+CellBuilder& cell_builder_add_slice(CellBuilder& cb, const CellSlice& cs) {
+  return cb.ensure_pass(cell_builder_add_slice_bool(cb, cs));
+}
+
+void CellSlice::dump(std::ostream& os, int level, bool endl) const {
+  os << "Cell";
+  if (level > 0) {
+    os << "{" << cell->to_hex() << "}";
+  }
+  os << " bits: " << bits_st << ".." << bits_en;
+  os << "; refs: " << refs_st << ".." << refs_en;
+  if (level > 2) {
+    char tmp[64];
+    std::sprintf(tmp, "; ptr=data+%ld; z=%016llx",
+                 static_cast<long>(ptr && cell.not_null() ? ptr - cell->get_data() : -1), static_cast<long long>(z));
+    os << tmp << " (have " << size() << " bits; " << zd << " preloaded)";
+  }
+  if (endl) {
+    os << std::endl;
+  }
+}
+
+void CellSlice::dump_hex(std::ostream& os, int mode, bool endl) const {
+  os << "x" << as_bitslice().to_hex();
+  if (have_refs() && (mode & 1)) {
+    os << "," << size_refs();
+  }
+  if (endl) {
+    os << std::endl;
+  }
+}
+
+void CellSlice::print_rec(std::ostream& os, int indent) const {
+  for (int i = 0; i < indent; i++) {
+    os << ' ';
+  }
+  if (cell.is_null()) {
+    os << "NULL" << std::endl;
+    return;
+  }
+  if (is_special()) {
+    os << "SPECIAL ";
+  }
+  os << "x{" << as_bitslice().to_hex() << '}' << std::endl;
+  for (unsigned i = 0; i < size_refs(); i++) {
+    CellSlice cs{NoVm(), prefetch_ref(i)};
+    cs.print_rec(os, indent + 1);
+  }
+}
+
+td::StringBuilder& operator<<(td::StringBuilder& sb, const CellSlice& cs) {
+  std::ostringstream os;
+  cs.dump_hex(os, 1, false);
+  return sb << os.str();
+}
+
+std::ostream& operator<<(std::ostream& os, CellSlice cs) {
+  cs.dump_hex(os, 1, false);
+  return os;
+}
+
+std::ostream& operator<<(std::ostream& os, Ref<CellSlice> cs_ref) {
+  if (cs_ref.is_null()) {
+    os << "(null)";
+  } else {
+    cs_ref->dump_hex(os, 1, false);
+  }
+  return os;
+}
+
+// BEGIN (SLICE LOAD FUNCTIONS)
+// (if these functions become more complicated, move them into a separate file)
+
+// If can_be_special is not null, then it is allowed to load special cell
+// Flag whether loaded cell is actually special will be stored into can_be_special
+VirtualCell::LoadedCell load_cell_slice_impl(const Ref<Cell>& cell, bool* can_be_special) {
+  auto* vm_state_interface = VmStateInterface::get();
+  if (vm_state_interface) {
+    vm_state_interface->register_cell_load();
+  }
+  auto r_loaded_cell = cell->load_cell();
+  if (r_loaded_cell.is_error()) {
+    throw VmError{Excno::cell_und, "failed to load cell"};
+  }
+  auto loaded_cell = r_loaded_cell.move_as_ok();
+  if (loaded_cell.data_cell->special_type() == DataCell::SpecialType::PrunnedBranch) {
+    auto virtualization = loaded_cell.virt.get_virtualization();
+    if (virtualization != 0) {
+      throw VmVirtError{virtualization};
+    }
+  }
+  if (can_be_special) {
+    *can_be_special = loaded_cell.data_cell->is_special();
+  } else if (loaded_cell.data_cell->is_special()) {
+    if (loaded_cell.data_cell->special_type() == DataCell::SpecialType::Library) {
+      if (vm_state_interface) {
+        CellSlice cs(std::move(loaded_cell));
+        DCHECK(cs.size() == Cell::hash_bits + 8);
+        auto library_cell = vm_state_interface->load_library(cs.data_bits() + 8);
+        if (library_cell.not_null()) {
+          //TODO: fix infinity loop
+          return load_cell_slice_impl(library_cell, nullptr);
+        }
+        throw VmError{Excno::cell_und, "failed to load library cell"};
+      }
+      throw VmError{Excno::cell_und, "failed to load library cell (no vm_state_interface available)"};
+    } else if (loaded_cell.data_cell->special_type() == DataCell::SpecialType::PrunnedBranch) {
+      CHECK(loaded_cell.virt.get_virtualization() == 0);
+      throw VmError{Excno::cell_und, "trying to load prunned cell"};
+    }
+    throw VmError{Excno::cell_und, "unexpected special cell"};
+  }
+  return loaded_cell;
+}
+
+CellSlice load_cell_slice(const Ref<Cell>& cell) {
+  return CellSlice{load_cell_slice_impl(cell, nullptr)};
+}
+
+CellSlice load_cell_slice_special(const Ref<Cell>& cell, bool& special) {
+  return CellSlice{load_cell_slice_impl(cell, &special)};
+}
+
+Ref<CellSlice> load_cell_slice_ref(const Ref<Cell>& cell) {
+  return Ref<CellSlice>{true, CellSlice(load_cell_slice_impl(cell, nullptr))};
+}
+
+Ref<CellSlice> load_cell_slice_ref_special(const Ref<Cell>& cell, bool& special) {
+  return Ref<CellSlice>{true, CellSlice(load_cell_slice_impl(cell, &special))};
+}
+
+void print_load_cell(std::ostream& os, Ref<Cell> cell, int indent) {
+  auto cs = load_cell_slice(cell);
+  cs.print_rec(os, indent);
+}
+
+bool CellSlice::load(Ref<Cell> cell) {
+  return load(load_cell_slice_impl(std::move(cell), nullptr));
+}
+
+bool CellSlice::load_ord(Ref<Cell> cell) {
+  return load(load_cell_slice_impl(std::move(cell), nullptr));
+}
+
+// END (SLICE LOAD FUNCTIONS)
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/CellSlice.h b/submodules/ton/tonlib-src/crypto/vm/cells/CellSlice.h
new file mode 100644
index 0000000000..5d7f906bc4
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/CellSlice.h
@@ -0,0 +1,328 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "common/refcnt.hpp"
+#include "common/refint.h"
+#include "vm/cells.h"
+
+namespace td {
+class StringBuilder;
+}
+namespace vm {
+
+struct NoVm {};
+struct NoVmOrd {};
+struct NoVmSpec {};
+
+class CellSlice : public td::CntObject {
+  Cell::VirtualizationParameters virt;
+  Ref<DataCell> cell;
+  CellUsageTree::NodePtr tree_node;
+  unsigned bits_st, refs_st;
+  unsigned bits_en, refs_en;
+  mutable const unsigned char* ptr{nullptr};
+  mutable unsigned long long z;
+  mutable unsigned zd;
+
+ public:
+  static constexpr long long fetch_long_eof = (static_cast<unsigned long long>(-1LL) << 63);
+  static constexpr unsigned long long fetch_ulong_eof = (unsigned long long)-1LL;
+  struct CellReadError {};
+
+  CellSlice(NoVm, Ref<Cell> cell_ref);
+  CellSlice(NoVmOrd, Ref<Cell> cell_ref);
+  CellSlice(NoVmSpec, Ref<Cell> cell_ref);
+  CellSlice(Ref<DataCell> dc_ref);
+  CellSlice(VirtualCell::LoadedCell loaded_cell);
+  /*
+  CellSlice(Ref<DataCell> dc_ref, unsigned _bits_en, unsigned _refs_en, unsigned _bits_st = 0, unsigned _refs_st = 0);*/
+  CellSlice(const CellSlice& cs, unsigned _bits_en, unsigned _refs_en);
+  CellSlice(const CellSlice& cs, unsigned _bits_en, unsigned _refs_en, unsigned _bits_st, unsigned _refs_st);
+  CellSlice(const CellSlice&);
+  CellSlice& operator=(const CellSlice& other) = default;
+  CellSlice();
+  Cell::LoadedCell move_as_loaded_cell();
+  td::CntObject* make_copy() const override {
+    return new CellSlice{*this};
+  }
+  void clear();
+  bool load(VirtualCell::LoadedCell loaded_cell);
+  bool load(NoVm, Ref<Cell> cell_ref);
+  bool load(NoVmOrd, Ref<Cell> cell_ref);
+  bool load(NoVmSpec, Ref<Cell> cell_ref);
+  bool load(Ref<DataCell> dc_ref);
+  bool load(Ref<Cell> cell);
+  bool load_ord(Ref<Cell> cell);
+  unsigned size() const {
+    return bits_en - bits_st;
+  }
+  bool is_special() const {
+    return cell->is_special();
+  }
+  bool is_valid() const {
+    return cell.not_null();
+  }
+  Cell::SpecialType special_type() const {
+    return cell->special_type();
+  }
+  int child_merkle_depth(int merkle_depth) const {
+    if (merkle_depth == Cell::VirtualizationParameters::max_level()) {
+      return merkle_depth;
+    }
+    if (cell->special_type() == Cell::SpecialType::MerkleProof ||
+        cell->special_type() == Cell::SpecialType::MerkleUpdate) {
+      merkle_depth++;
+    }
+    return merkle_depth;
+  }
+  unsigned size_refs() const {
+    return refs_en - refs_st;
+  }
+  unsigned size_ext() const {
+    return size() + (size_refs() << 16);
+  }
+  bool have(unsigned bits) const {
+    return bits <= size();
+  }
+  bool have(unsigned bits, unsigned refs) const {
+    return bits <= size() && refs <= size_refs();
+  }
+  bool have_ext(unsigned ext_size) const {
+    return have(ext_size & 0xffff, ext_size >> 16);
+  }
+  bool empty() const {
+    return !size();
+  }
+  bool empty_ext() const {
+    return !size() && !size_refs();
+  }
+  bool have_refs(unsigned refs = 1) const {
+    return refs <= size_refs();
+  }
+  bool advance(unsigned bits);
+  bool advance_refs(unsigned refs);
+  bool advance_ext(unsigned bits_refs);
+  bool advance_ext(unsigned bits, unsigned refs);
+  unsigned cur_pos() const {
+    return bits_st;
+  }
+  unsigned cur_ref() const {
+    return refs_st;
+  }
+  const unsigned char* data() const {
+    return cell->get_data();
+  }
+  td::ConstBitPtr data_bits() const {
+    return td::ConstBitPtr{data(), (int)cur_pos()};
+  }
+  int subtract_base_ext(const CellSlice& base) {
+    return (bits_st - base.bits_st) | ((refs_st - base.refs_st) << 16);
+  }
+  unsigned get_cell_level() const;
+  unsigned get_level() const;
+  int fetch_octet();
+  int prefetch_octet() const;
+  unsigned long long prefetch_ulong_top(unsigned& bits) const;
+  unsigned long long fetch_ulong(unsigned bits);
+  unsigned long long prefetch_ulong(unsigned bits) const;
+  long long fetch_long(unsigned bits);
+  long long prefetch_long(unsigned bits) const;
+  bool fetch_long_bool(unsigned bits, long long& res);
+  bool prefetch_long_bool(unsigned bits, long long& res) const;
+  bool fetch_ulong_bool(unsigned bits, unsigned long long& res);
+  bool prefetch_ulong_bool(unsigned bits, unsigned long long& res) const;
+  bool fetch_bool_to(bool& res);
+  bool fetch_bool_to(int& res);
+  bool fetch_bool_to(int& res, int mask);
+  bool fetch_uint_to(unsigned bits, unsigned long long& res);
+  bool fetch_uint_to(unsigned bits, long long& res);
+  bool fetch_uint_to(unsigned bits, unsigned long& res);
+  bool fetch_uint_to(unsigned bits, long& res);
+  bool fetch_uint_to(unsigned bits, unsigned& res);
+  bool fetch_uint_to(unsigned bits, int& res);
+  bool fetch_uint_less(unsigned upper_bound, int& res);
+  bool fetch_uint_less(unsigned upper_bound, unsigned& res);
+  bool fetch_uint_leq(unsigned upper_bound, int& res);
+  bool fetch_uint_leq(unsigned upper_bound, unsigned& res);
+  bool fetch_int_to(unsigned bits, long long& res);
+  bool fetch_int_to(unsigned bits, int& res);
+  int bselect(unsigned bits, unsigned long long mask) const;
+  int bselect_ext(unsigned bits, unsigned long long mask) const;
+  int bit_at(unsigned i) const {
+    return have(i) ? data_bits()[i] : -1;
+  }
+  td::RefInt256 fetch_int256(unsigned bits, bool sgnd = true);
+  td::RefInt256 prefetch_int256(unsigned bits, bool sgnd = true) const;
+  td::RefInt256 prefetch_int256_zeroext(unsigned bits, bool sgnd = true) const;
+  bool fetch_int256_to(unsigned bits, td::RefInt256& res, bool sgnd = true) {
+    return (res = fetch_int256(bits, sgnd)).not_null();
+  }
+  bool fetch_uint256_to(unsigned bits, td::RefInt256& res) {
+    return (res = fetch_int256(bits, false)).not_null();
+  }
+  Ref<Cell> prefetch_ref(unsigned offset = 0) const;
+  Ref<Cell> fetch_ref();
+  bool fetch_ref_to(Ref<Cell>& ref) {
+    return (ref = fetch_ref()).not_null();
+  }
+  bool prefetch_ref_to(Ref<Cell>& ref, unsigned offset = 0) const {
+    return (ref = prefetch_ref(offset)).not_null();
+  }
+  td::BitSlice fetch_bits(unsigned bits);
+  td::BitSlice prefetch_bits(unsigned bits) const;
+  td::Ref<CellSlice> fetch_subslice(unsigned bits, unsigned refs = 0);
+  td::Ref<CellSlice> prefetch_subslice(unsigned bits, unsigned refs = 0) const;
+  td::Ref<CellSlice> fetch_subslice_ext(unsigned size);
+  td::Ref<CellSlice> prefetch_subslice_ext(unsigned size) const;
+  td::Ref<td::BitString> fetch_bitstring(unsigned size);
+  td::Ref<td::BitString> prefetch_bitstring(unsigned size) const;
+  bool fetch_subslice_to(unsigned bits, td::Ref<CellSlice>& res) {
+    return (res = fetch_subslice(bits)).not_null();
+  }
+  bool fetch_subslice_ext_to(unsigned bits, td::Ref<CellSlice>& res) {
+    return (res = fetch_subslice_ext(bits)).not_null();
+  }
+  bool fetch_bitstring_to(unsigned bits, td::Ref<td::BitString>& res) {
+    return (res = fetch_bitstring(bits)).not_null();
+  }
+  bool fetch_bits_to(td::BitPtr buffer, unsigned bits);
+  bool prefetch_bits_to(td::BitPtr buffer, unsigned bits) const;
+  template <unsigned n>
+  bool fetch_bits_to(td::BitArray<n>& buffer) {
+    return fetch_bits_to(buffer.bits(), n);
+  }
+  template <unsigned n>
+  bool prefetch_bits_to(td::BitArray<n>& buffer) const {
+    return prefetch_bits_to(buffer.bits(), n);
+  }
+  bool fetch_bytes(unsigned char* buffer, unsigned bytes);
+  bool prefetch_bytes(unsigned char* buffer, unsigned bytes) const;
+  td::BitSlice as_bitslice() const {
+    return prefetch_bits(size());
+  }
+  bool begins_with(unsigned bits, unsigned long long value) const;
+  bool begins_with(unsigned long long value) const;
+  bool begins_with_skip(unsigned bits, unsigned long long value) {
+    return begins_with(bits, value) && advance(bits);
+  }
+  bool begins_with_skip(unsigned long long value);
+  bool only_first(unsigned bits, unsigned refs = 0);
+  bool only_ext(unsigned size);
+  bool skip_first(unsigned bits, unsigned refs = 0);
+  bool skip_ext(unsigned size);
+  bool only_last(unsigned bits, unsigned refs = 0);
+  bool skip_last(unsigned bits, unsigned refs = 0);
+  bool cut_tail(const CellSlice& tail_cs);
+  int remove_trailing();
+  int count_leading(bool bit) const;
+  int count_trailing(bool bit) const;
+  int lex_cmp(const CellSlice& cs2) const;
+  int common_prefix_len(const CellSlice& cs2) const;
+  bool is_prefix_of(const CellSlice& cs2) const;
+  bool is_prefix_of(td::ConstBitPtr bs, unsigned len) const;
+  bool is_suffix_of(const CellSlice& cs2) const;
+  bool has_prefix(const CellSlice& cs2) const;
+  bool has_prefix(td::ConstBitPtr bs, unsigned len) const;
+  bool has_suffix(const CellSlice& cs2) const;
+  bool is_proper_prefix_of(const CellSlice& cs2) const;
+  bool is_proper_suffix_of(const CellSlice& cs2) const;
+  // int common_prefix_len(const td::BitSlice& bs, unsigned offs = 0, unsigned max_len = 0xffffffffU) const;
+  int common_prefix_len(td::ConstBitPtr bs, unsigned len) const;
+  // bool is_prefix_of(const td::BitSlice& bs, unsigned offs = 0, unsigned max_len = 0xffffffffU) const;
+  bool contents_equal(const CellSlice& cs2) const;
+  void dump(std::ostream& os, int level = 0, bool endl = true) const;
+  void dump_hex(std::ostream& os, int mode = 0, bool endl = false) const;
+  void print_rec(std::ostream& os, int indent = 0) const;
+  void error() const {
+    throw CellReadError{};
+  }
+  bool chk(bool cond) const {
+    if (!cond) {
+      error();
+    }
+    return cond;
+  }
+  bool have_chk(unsigned bits) const {
+    return chk(have(bits));
+  }
+  bool have_chk(unsigned bits, unsigned refs) const {
+    return chk(have(bits, refs));
+  }
+  bool have_refs_chk(unsigned refs = 1) const {
+    return chk(have_refs(refs));
+  }
+  CellSlice operator+(unsigned offs) const {
+    offs = std::min(offs, size());
+    return CellSlice{*this, size() - offs, size_refs(), offs, 0};
+  }
+
+ private:
+  void init_bits_refs();
+  void init_preload() const;
+  void preload_at_least(unsigned req_bits) const;
+  Cell::VirtualizationParameters child_virt() const {
+    return Cell::VirtualizationParameters(static_cast<td::uint8>(child_merkle_depth(virt.get_level())),
+                                          virt.get_virtualization());
+  }
+};
+
+td::StringBuilder& operator<<(td::StringBuilder& sb, const CellSlice& cs);
+
+bool cell_builder_add_slice_bool(CellBuilder& cb, const CellSlice& cs);
+CellBuilder& cell_builder_add_slice(CellBuilder& cb, const CellSlice& cs);
+
+std::ostream& operator<<(std::ostream& os, CellSlice cs);
+std::ostream& operator<<(std::ostream& os, Ref<CellSlice> cs_ref);
+
+template <class T>
+CellSlice& operator>>(CellSlice& cs, T& val) {
+  cs.chk(val.deserialize(cs));
+  return cs;
+}
+
+template <class T>
+Ref<CellSlice>& operator>>(Ref<CellSlice>& cs_ref, T& val) {
+  bool res = val.deserialize(cs_ref.write());
+  cs_ref->chk(res);
+  return cs_ref;
+}
+
+template <class T>
+CellSlice& operator>>(CellSlice& cs, const T& val) {
+  cs.chk(val.deserialize(cs));
+  return cs;
+}
+
+template <class T>
+Ref<CellSlice>& operator>>(Ref<CellSlice>& cs_ref, const T& val) {
+  bool res = val.deserialize(cs_ref.write());
+  cs_ref->chk(res);
+  return cs_ref;
+}
+
+// If can_be_special is not null, then it is allowed to load special cell
+// Flag whether loaded cell is actually special will be stored into can_be_special
+CellSlice load_cell_slice(const Ref<Cell>& cell);
+Ref<CellSlice> load_cell_slice_ref(const Ref<Cell>& cell);
+CellSlice load_cell_slice_special(const Ref<Cell>& cell, bool& is_special);
+Ref<CellSlice> load_cell_slice_ref_special(const Ref<Cell>& cell, bool& is_special);
+void print_load_cell(std::ostream& os, Ref<Cell> cell, int indent = 0);
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/CellTraits.cpp b/submodules/ton/tonlib-src/crypto/vm/cells/CellTraits.cpp
new file mode 100644
index 0000000000..b0ce738103
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/CellTraits.cpp
@@ -0,0 +1,45 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/cells/CellTraits.h"
+
+#include "td/utils/StringBuilder.h"
+#include "td/utils/Slice.h"
+
+namespace vm {
+td::StringBuilder& operator<<(td::StringBuilder& sb, CellTraits::SpecialType special_type) {
+  switch (special_type) {
+    case CellTraits::SpecialType::Ordinary:
+      sb << "Ordinary";
+      break;
+    case CellTraits::SpecialType::MerkleProof:
+      sb << "MerkleProof";
+      break;
+    case CellTraits::SpecialType::MerkleUpdate:
+      sb << "MerkleUpdate";
+      break;
+    case CellTraits::SpecialType::PrunnedBranch:
+      sb << "PrunnedBranch";
+      break;
+    case CellTraits::SpecialType::Library:
+      sb << "Library";
+      break;
+  }
+  return sb;
+}
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/CellTraits.h b/submodules/ton/tonlib-src/crypto/vm/cells/CellTraits.h
new file mode 100644
index 0000000000..9e55dd6739
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/CellTraits.h
@@ -0,0 +1,52 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/utils/int_types.h"
+#include "common/refcnt.hpp"
+
+namespace td {
+class StringBuilder;
+}
+
+namespace vm {
+class CellTraits : public td::CntObject {
+ public:
+  enum class SpecialType : td::uint8 {
+    Ordinary = 0,
+    PrunnedBranch = 1,
+    Library = 2,
+    MerkleProof = 3,
+    MerkleUpdate = 4
+  };
+  enum {
+    max_refs = 4,
+    max_bytes = 128,
+    max_bits = 1023,
+    hash_bytes = 32,
+    hash_bits = hash_bytes * 8,
+    depth_bytes = 2,
+    depth_bits = depth_bytes * 8,
+    max_level = 3,
+    max_depth = 1024,
+    max_virtualization = 7,
+    max_serialized_bytes = 2 + max_bytes + (max_level + 1) * (hash_bytes + depth_bytes)
+  };
+};
+td::StringBuilder& operator<<(td::StringBuilder& sb, CellTraits::SpecialType special_type);
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/CellUsageTree.cpp b/submodules/ton/tonlib-src/crypto/vm/cells/CellUsageTree.cpp
new file mode 100644
index 0000000000..117d1c3290
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/CellUsageTree.cpp
@@ -0,0 +1,136 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/cells/CellUsageTree.h"
+
+namespace vm {
+//
+// CellUsageTree::NodePtr
+//
+bool CellUsageTree::NodePtr::on_load() const {
+  auto tree = tree_weak_.lock();
+  if (!tree) {
+    return false;
+  }
+  tree->on_load(node_id_);
+  return true;
+}
+
+CellUsageTree::NodePtr CellUsageTree::NodePtr::create_child(unsigned ref_id) const {
+  auto tree = tree_weak_.lock();
+  if (!tree) {
+    return {};
+  }
+  return {tree_weak_, tree->create_child(node_id_, ref_id)};
+}
+
+bool CellUsageTree::NodePtr::is_from_tree(const CellUsageTree* master_tree) const {
+  DCHECK(master_tree);
+  auto tree = tree_weak_.lock();
+  if (tree.get() != master_tree) {
+    return false;
+  }
+  return true;
+}
+
+bool CellUsageTree::NodePtr::mark_path(CellUsageTree* master_tree) const {
+  DCHECK(master_tree);
+  auto tree = tree_weak_.lock();
+  if (tree.get() != master_tree) {
+    return false;
+  }
+  master_tree->mark_path(node_id_);
+  return true;
+}
+
+//
+// CellUsageTree
+//
+CellUsageTree::NodePtr CellUsageTree::root_ptr() {
+  return {shared_from_this(), 1};
+}
+
+CellUsageTree::NodeId CellUsageTree::root_id() const {
+  return 1;
+};
+
+bool CellUsageTree::is_loaded(NodeId node_id) const {
+  if (use_mark_) {
+    return nodes_[node_id].has_mark;
+  }
+  return nodes_[node_id].is_loaded;
+}
+
+bool CellUsageTree::has_mark(NodeId node_id) const {
+  return nodes_[node_id].has_mark;
+}
+
+void CellUsageTree::set_mark(NodeId node_id, bool mark) {
+  if (node_id == 0) {
+    return;
+  }
+  nodes_[node_id].has_mark = mark;
+}
+
+void CellUsageTree::mark_path(NodeId node_id) {
+  auto cur_node_id = get_parent(node_id);
+  while (cur_node_id != 0) {
+    if (has_mark(cur_node_id)) {
+      break;
+    }
+    set_mark(cur_node_id);
+    cur_node_id = get_parent(cur_node_id);
+  }
+}
+
+CellUsageTree::NodeId CellUsageTree::get_parent(NodeId node_id) {
+  return nodes_[node_id].parent;
+}
+
+CellUsageTree::NodeId CellUsageTree::get_child(NodeId node_id, unsigned ref_id) {
+  DCHECK(ref_id < CellTraits::max_refs);
+  return nodes_[node_id].children[ref_id];
+}
+
+void CellUsageTree::set_use_mark_for_is_loaded(bool use_mark) {
+  use_mark_ = use_mark;
+}
+
+void CellUsageTree::on_load(NodeId node_id) {
+  nodes_[node_id].is_loaded = true;
+}
+
+CellUsageTree::NodeId CellUsageTree::create_child(NodeId node_id, unsigned ref_id) {
+  DCHECK(ref_id < CellTraits::max_refs);
+  NodeId res = nodes_[node_id].children[ref_id];
+  if (res) {
+    return res;
+  }
+  res = create_node(node_id);
+  nodes_[node_id].children[ref_id] = res;
+  return res;
+}
+
+CellUsageTree::NodeId CellUsageTree::create_node(NodeId parent) {
+  NodeId res = static_cast<NodeId>(nodes_.size());
+  nodes_.emplace_back();
+  nodes_.back().parent = parent;
+  return res;
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/CellUsageTree.h b/submodules/ton/tonlib-src/crypto/vm/cells/CellUsageTree.h
new file mode 100644
index 0000000000..b3383984b7
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/CellUsageTree.h
@@ -0,0 +1,75 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "vm/cells/CellTraits.h"
+
+#include "td/utils/int_types.h"
+#include "td/utils/logging.h"
+
+namespace vm {
+class CellUsageTree : public std::enable_shared_from_this<CellUsageTree> {
+ public:
+  using NodeId = td::uint32;
+
+  struct NodePtr {
+   public:
+    NodePtr() = default;
+    NodePtr(std::weak_ptr<CellUsageTree> tree_weak, NodeId node_id)
+        : tree_weak_(std::move(tree_weak)), node_id_(node_id) {
+    }
+    bool empty() const {
+      return node_id_ == 0 || tree_weak_.expired();
+    }
+
+    bool on_load() const;
+    NodePtr create_child(unsigned ref_id) const;
+    bool mark_path(CellUsageTree* master_tree) const;
+    bool is_from_tree(const CellUsageTree* master_tree) const;
+
+   private:
+    std::weak_ptr<CellUsageTree> tree_weak_;
+    NodeId node_id_{0};
+  };
+
+  NodePtr root_ptr();
+  NodeId root_id() const;
+  bool is_loaded(NodeId node_id) const;
+  bool has_mark(NodeId node_id) const;
+  void set_mark(NodeId node_id, bool mark = true);
+  void mark_path(NodeId node_id);
+  NodeId get_parent(NodeId node_id);
+  NodeId get_child(NodeId node_id, unsigned ref_id);
+  void set_use_mark_for_is_loaded(bool use_mark = true);
+  NodeId create_child(NodeId node_id, unsigned ref_id);
+
+ private:
+  struct Node {
+    bool is_loaded{false};
+    bool has_mark{false};
+    NodeId parent{0};
+    std::array<td::uint32, CellTraits::max_refs> children{};
+  };
+  bool use_mark_{false};
+  std::vector<Node> nodes_{2};
+
+  void on_load(NodeId node_id);
+  NodeId create_node(NodeId parent);
+};
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/CellWithStorage.h b/submodules/ton/tonlib-src/crypto/vm/cells/CellWithStorage.h
new file mode 100644
index 0000000000..b9841e1cdc
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/CellWithStorage.h
@@ -0,0 +1,92 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace vm {
+namespace detail {
+template <class CellT, size_t Size = 0>
+class CellWithArrayStorage : public CellT {
+ public:
+  template <class... ArgsT>
+  CellWithArrayStorage(ArgsT&&... args) : CellT(std::forward<ArgsT>(args)...) {
+  }
+  ~CellWithArrayStorage() {
+    CellT::destroy_storage(get_storage());
+  }
+  template <class... ArgsT>
+  static std::unique_ptr<CellT> create(size_t storage_size, ArgsT&&... args) {
+    static_assert(CellT::max_storage_size <= 40 * 8, "");
+    //size = 128 + 32 + 8;
+    auto size = (storage_size + 7) / 8;
+#define CASE(size) \
+  case (size):     \
+    return std::make_unique<CellWithArrayStorage<CellT, (size)*8>>(std::forward<ArgsT>(args)...);
+#define CASE2(offset) CASE(offset) CASE(offset + 1)
+#define CASE8(offset) CASE2(offset) CASE2(offset + 2) CASE2(offset + 4) CASE2(offset + 6)
+#define CASE32(offset) CASE8(offset) CASE8(offset + 8) CASE8(offset + 16) CASE8(offset + 24)
+    switch (size) { CASE32(0) CASE8(32) }
+#undef CASE
+#undef CASE2
+#undef CASE8
+#undef CASE32
+    LOG(FATAL) << "TOO BIG " << storage_size;
+    UNREACHABLE();
+  }
+
+ private:
+  alignas(alignof(void*)) char storage_[Size];
+
+  const char* get_storage() const final {
+    return storage_;
+  }
+  char* get_storage() final {
+    return storage_;
+  }
+};
+
+template <class CellT>
+class CellWithUniquePtrStorage : public CellT {
+ public:
+  template <class... ArgsT>
+  CellWithUniquePtrStorage(size_t storage_size, ArgsT&&... args)
+      : CellT(std::forward<ArgsT>(args)...), storage_(std::make_unique<char[]>(storage_size)) {
+  }
+  ~CellWithUniquePtrStorage() {
+    CellT::destroy_storage(get_storage());
+  }
+
+  template <class... ArgsT>
+  static std::unique_ptr<CellT> create(size_t storage_size, ArgsT&&... args) {
+    return std::make_unique<CellWithUniquePtrStorage>(storage_size, std::forward<ArgsT>(args)...);
+  }
+
+ private:
+  std::unique_ptr<char[]> storage_;
+
+  const char* get_storage() const final {
+    CHECK(storage_);
+    return storage_.get();
+  }
+  char* get_storage() final {
+    CHECK(storage_);
+    return storage_.get();
+  }
+};
+}  // namespace detail
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/DataCell.cpp b/submodules/ton/tonlib-src/crypto/vm/cells/DataCell.cpp
new file mode 100644
index 0000000000..4a89a27646
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/DataCell.cpp
@@ -0,0 +1,368 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/cells/DataCell.h"
+
+#include "openssl/digest.h"
+
+#include "td/utils/ScopeGuard.h"
+
+#include "vm/cells/CellWithStorage.h"
+
+namespace vm {
+std::unique_ptr<DataCell> DataCell::create_empty_data_cell(Info info) {
+  return detail::CellWithUniquePtrStorage<DataCell>::create(info.get_storage_size(), info);
+}
+
+DataCell::DataCell(Info info) : info_(std::move(info)) {
+  get_thread_safe_counter().add(1);
+}
+DataCell::~DataCell() {
+  get_thread_safe_counter().add(-1);
+}
+
+void DataCell::destroy_storage(char* storage) {
+  auto* refs = info_.get_refs(storage);
+  for (size_t i = 0; i < get_refs_cnt(); i++) {
+    Ref<Cell>(refs[i], Ref<Cell>::acquire_t{});  // call destructor
+  }
+}
+
+td::Result<Ref<DataCell>> DataCell::create(td::ConstBitPtr data, unsigned bits, td::Span<Ref<Cell>> refs,
+                                           bool special) {
+  std::array<Ref<Cell>, max_refs> copied_refs;
+  CHECK(refs.size() <= copied_refs.size());
+  for (size_t i = 0; i < refs.size(); i++) {
+    copied_refs[i] = refs[i];
+  }
+  return create(std::move(data), bits, td::MutableSpan<Ref<Cell>>(copied_refs.data(), refs.size()), special);
+}
+
+DataCell::SpecialType DataCell::special_type() const {
+  if (is_special()) {
+    return static_cast<SpecialType>(td::bitstring::bits_load_ulong(get_data(), 8));
+  }
+  return SpecialType::Ordinary;
+}
+
+td::Result<Ref<DataCell>> DataCell::create(td::ConstBitPtr data, unsigned bits, td::MutableSpan<Ref<Cell>> refs,
+                                           bool special) {
+  for (auto& ref : refs) {
+    if (ref.is_null()) {
+      return td::Status::Error("Has null cell reference");
+    }
+  }
+
+  SpecialType type = SpecialType::Ordinary;
+  if (special) {
+    if (bits < 8) {
+      return td::Status::Error("Not enough data for a special cell");
+    }
+    type = static_cast<SpecialType>(td::bitstring::bits_load_ulong(data, 8));
+    if (type == SpecialType::Ordinary) {
+      return td::Status::Error("Special cell has Ordinary type");
+    }
+  }
+
+  LevelMask level_mask;
+  td::uint32 virtualization = 0;
+  switch (type) {
+    case SpecialType::Ordinary: {
+      for (auto& ref : refs) {
+        level_mask = level_mask.apply_or(ref->get_level_mask());
+        virtualization = td::max(virtualization, ref->get_virtualization());
+      }
+      break;
+    }
+
+    case SpecialType::PrunnedBranch: {
+      if (refs.size() != 0) {
+        return td::Status::Error("PrunnedBranch special cell has a cell reference");
+      }
+      if (bits < 16) {
+        return td::Status::Error("Not enough data for a PrunnedBranch special cell");
+      }
+      level_mask = LevelMask((td::bitstring::bits_load_ulong(data + 8, 8)) & 0xff);
+      auto level = level_mask.get_level();
+      if (level > max_level || level == 0) {
+        return td::Status::Error("Prunned Branch has an invalid level");
+      }
+      if (bits != (2 + level_mask.apply(level - 1).get_hashes_count() * (hash_bytes + depth_bytes)) * 8) {
+        return td::Status::Error("Not enouch data for a PrunnedBranch special cell");
+      }
+      // depth will be checked later!
+      break;
+    }
+
+    case SpecialType::Library: {
+      if (bits != 8 + hash_bytes * 8) {
+        return td::Status::Error("Not enouch data for a Library special cell");
+      }
+      break;
+    }
+
+    case SpecialType::MerkleProof: {
+      if (bits != 8 + (hash_bytes + depth_bytes) * 8) {
+        return td::Status::Error("Not enouch data for a MerkleProof special cell");
+      }
+      if (refs.size() != 1) {
+        return td::Status::Error("Wrong references count for a MerkleProof special cell");
+      }
+      if (td::bitstring::bits_memcmp(data + 8, refs[0]->get_hash(0).as_bitslice().get_ptr(), hash_bits) != 0) {
+        return td::Status::Error("Hash mismatch in a MerkleProof special cell");
+      }
+      if (td::bitstring::bits_load_ulong(data + 8 + hash_bits, depth_bytes * 8) != refs[0]->get_depth(0)) {
+        return td::Status::Error("Depth mismatch in a MerkleProof special cell");
+      }
+      level_mask = refs[0]->get_level_mask().shift_right();
+      virtualization = refs[0]->get_virtualization();
+      break;
+    }
+
+    case SpecialType::MerkleUpdate: {
+      if (bits != 8 + (hash_bytes + depth_bytes) * 8 * 2) {
+        return td::Status::Error("Not enouch data for a MerkleUpdate special cell");
+      }
+      if (refs.size() != 2) {
+        return td::Status::Error("Wrong references count for a MerkleUpdate special cell");
+      }
+      if (td::bitstring::bits_memcmp(data + 8, refs[0]->get_hash(0).as_bitslice().get_ptr(), hash_bits) != 0) {
+        return td::Status::Error("First hash mismatch in a MerkleProof special cell");
+      }
+      if (td::bitstring::bits_memcmp(data + 8 + hash_bits, refs[1]->get_hash(0).as_bitslice().get_ptr(), hash_bits) !=
+          0) {
+        return td::Status::Error("Second hash mismatch in a MerkleProof special cell");
+      }
+      if (td::bitstring::bits_load_ulong(data + 8 + 2 * hash_bits, depth_bytes * 8) != refs[0]->get_depth(0)) {
+        return td::Status::Error("First depth mismatch in a MerkleProof special cell");
+      }
+      if (td::bitstring::bits_load_ulong(data + 8 + 2 * hash_bits + depth_bytes * 8, depth_bytes * 8) !=
+          refs[1]->get_depth(0)) {
+        return td::Status::Error("Second depth mismatch in a MerkleProof special cell");
+      }
+
+      level_mask = refs[0]->get_level_mask().apply_or(refs[1]->get_level_mask()).shift_right();
+      virtualization = td::max(refs[0]->get_virtualization(), refs[1]->get_virtualization());
+      break;
+    }
+
+    default:
+      return td::Status::Error("Unknown special cell type");
+  }
+
+  Info info;
+  if (td::unlikely(bits > max_bits)) {
+    return td::Status::Error("Too many bits");
+  }
+  if (td::unlikely(refs.size() > max_refs)) {
+    return td::Status::Error("Too many cell references");
+  }
+  if (td::unlikely(virtualization > max_virtualization)) {
+    return td::Status::Error("Too big virtualization");
+  }
+
+  CHECK(level_mask.get_level() <= max_level);
+
+  auto hash_count = type == SpecialType::PrunnedBranch ? 1 : level_mask.get_hashes_count();
+  DCHECK(hash_count <= max_level + 1);
+
+  info.bits_ = bits;
+  info.refs_count_ = refs.size() & 7;
+  info.is_special_ = special;
+  info.level_mask_ = level_mask.get_mask() & 7;
+  info.hash_count_ = hash_count & 7;
+  info.virtualization_ = virtualization & 7;
+
+  auto data_cell = create_empty_data_cell(info);
+  auto* storage = data_cell->get_storage();
+
+  // init data
+  auto* data_ptr = info.get_data(storage);
+  td::BitPtr{data_ptr}.copy_from(data, bits);
+  // prepare for serialization
+  if (bits & 7) {
+    int m = (0x80 >> (bits & 7));
+    unsigned l = bits / 8;
+    data_ptr[l] = static_cast<unsigned char>((data_ptr[l] & -m) | m);
+  }
+
+  // init refs
+  auto refs_ptr = info.get_refs(storage);
+  for (size_t i = 0; i < refs.size(); i++) {
+    refs_ptr[i] = refs[i].release();
+  }
+
+  // init hashes and depth
+  auto* hashes_ptr = info.get_hashes(storage);
+  auto* depth_ptr = info.get_depth(storage);
+
+  // NB: be careful with special cells
+  auto total_hash_count = level_mask.get_hashes_count();
+  auto hash_i_offset = total_hash_count - hash_count;
+  for (td::uint32 level_i = 0, hash_i = 0, level = level_mask.get_level(); level_i <= level; level_i++) {
+    if (!level_mask.is_significant(level_i)) {
+      continue;
+    }
+    SCOPE_EXIT {
+      hash_i++;
+    };
+    if (hash_i < hash_i_offset) {
+      continue;
+    }
+    unsigned char tmp[2];
+    tmp[0] = info.d1(level_mask.apply(level_i));
+    tmp[1] = info.d2();
+
+    static TD_THREAD_LOCAL digest::SHA256* hasher;
+    td::init_thread_local<digest::SHA256>(hasher);
+    hasher->reset();
+
+    hasher->feed(td::Slice(tmp, 2));
+
+    if (hash_i == hash_i_offset) {
+      DCHECK(level_i == 0 || type == SpecialType::PrunnedBranch);
+      hasher->feed(td::Slice(data_ptr, (bits + 7) >> 3));
+    } else {
+      DCHECK(level_i != 0 && type != SpecialType::PrunnedBranch);
+      hasher->feed(hashes_ptr[hash_i - hash_i_offset - 1].as_slice());
+    }
+
+    auto dest_i = hash_i - hash_i_offset;
+
+    // calc depth
+    td::uint16 depth = 0;
+    for (int i = 0; i < info.refs_count_; i++) {
+      td::uint16 child_depth = 0;
+      if (type == SpecialType::MerkleProof || type == SpecialType::MerkleUpdate) {
+        child_depth = refs_ptr[i]->get_depth(level_i + 1);
+      } else {
+        child_depth = refs_ptr[i]->get_depth(level_i);
+      }
+
+      // add depth into hash
+      td::uint8 child_depth_buf[depth_bytes];
+      store_depth(child_depth_buf, child_depth);
+      hasher->feed(td::Slice(child_depth_buf, depth_bytes));
+
+      depth = std::max(depth, child_depth);
+    }
+    if (info.refs_count_ != 0) {
+      if (depth >= max_depth) {
+        return td::Status::Error("Depth is too big");
+      }
+      depth++;
+    }
+    depth_ptr[dest_i] = depth;
+
+    // children hash
+    for (int i = 0; i < info.refs_count_; i++) {
+      if (type == SpecialType::MerkleProof || type == SpecialType::MerkleUpdate) {
+        hasher->feed(refs_ptr[i]->get_hash(level_i + 1).as_slice());
+      } else {
+        hasher->feed(refs_ptr[i]->get_hash(level_i).as_slice());
+      }
+    }
+    auto extracted_size = hasher->extract(hashes_ptr[dest_i].as_slice());
+    DCHECK(extracted_size == hash_bytes);
+  }
+
+  return Ref<DataCell>(data_cell.release(), Ref<DataCell>::acquire_t{});
+}
+
+const DataCell::Hash DataCell::do_get_hash(td::uint32 level) const {
+  auto hash_i = get_level_mask().apply(level).get_hash_i();
+  if (special_type() == SpecialType::PrunnedBranch) {
+    auto this_hash_i = get_level_mask().get_hash_i();
+    if (hash_i != this_hash_i) {
+      return reinterpret_cast<const Hash*>(info_.get_data(get_storage()) + 2)[hash_i];
+    }
+    hash_i = 0;
+  }
+  return info_.get_hashes(get_storage())[hash_i];
+}
+
+td::uint16 DataCell::do_get_depth(td::uint32 level) const {
+  auto hash_i = get_level_mask().apply(level).get_hash_i();
+  if (special_type() == SpecialType::PrunnedBranch) {
+    auto this_hash_i = get_level_mask().get_hash_i();
+    if (hash_i != this_hash_i) {
+      return load_depth(info_.get_data(get_storage()) + 2 + hash_bytes * this_hash_i + hash_i * depth_bytes);
+    }
+    hash_i = 0;
+  }
+  return info_.get_depth(get_storage())[hash_i];
+}
+
+int DataCell::serialize(unsigned char* buff, int buff_size, bool with_hashes) const {
+  int len = get_serialized_size(with_hashes);
+  if (len > buff_size) {
+    return 0;
+  }
+  buff[0] = static_cast<unsigned char>(info_.d1() | (with_hashes * 16));
+  buff[1] = info_.d2();
+  int hs = 0;
+  if (with_hashes) {
+    hs = (get_level_mask().get_hashes_count()) * (hash_bytes + depth_bytes);
+    assert(len >= 2 + hs);
+    std::memset(buff + 2, 0, hs);
+    auto dest = td::MutableSlice(buff + 2, hs);
+    auto level = get_level();
+    // TODO: optimize for prunned brandh
+    for (unsigned i = 0; i <= level; i++) {
+      if (!get_level_mask().is_significant(i)) {
+        continue;
+      }
+      dest.copy_from(get_hash(i).as_slice());
+      dest.remove_prefix(hash_bytes);
+    }
+    for (unsigned i = 0; i <= level; i++) {
+      if (!get_level_mask().is_significant(i)) {
+        continue;
+      }
+      store_depth(dest.ubegin(), get_depth(i));
+      dest.remove_prefix(depth_bytes);
+    }
+    // buff[2] = 0;  // for testing hash verification in deserialization
+    buff += hs;
+    len -= hs;
+  }
+  std::memcpy(buff + 2, get_data(), len - 2);
+  return len + hs;
+}
+
+std::string DataCell::serialize() const {
+  unsigned char buff[max_serialized_bytes];
+  int len = serialize(buff, sizeof(buff));
+  return std::string(buff, buff + len);
+}
+
+std::string DataCell::to_hex() const {
+  unsigned char buff[max_serialized_bytes];
+  int len = serialize(buff, sizeof(buff));
+  char hex_buff[max_serialized_bytes * 2 + 1];
+  for (int i = 0; i < len; i++) {
+    sprintf(hex_buff + 2 * i, "%02x", buff[i]);
+  }
+  return hex_buff;
+}
+
+std::ostream& operator<<(std::ostream& os, const DataCell& c) {
+  return os << c.to_hex();
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/DataCell.h b/submodules/ton/tonlib-src/crypto/vm/cells/DataCell.h
new file mode 100644
index 0000000000..416d183571
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/DataCell.h
@@ -0,0 +1,212 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cells/Cell.h"
+
+#include "td/utils/Span.h"
+
+#include "td/utils/ThreadSafeCounter.h"
+
+namespace vm {
+
+class DataCell : public Cell {
+ public:
+  DataCell(const DataCell& other) = delete;
+  ~DataCell() override;
+
+  static void store_depth(td::uint8* dest, td::uint16 depth) {
+    td::bitstring::bits_store_long(dest, depth, depth_bits);
+  }
+  static td::uint16 load_depth(const td::uint8* src) {
+    return td::bitstring::bits_load_ulong(src, depth_bits) & 0xff;
+  }
+
+ protected:
+  struct Info {
+    unsigned bits_;
+
+    // d1
+    unsigned char refs_count_ : 3;
+    bool is_special_ : 1;
+    unsigned char level_mask_ : 3;
+
+    unsigned char hash_count_ : 3;
+
+    unsigned char virtualization_ : 3;
+
+    unsigned char d1() const {
+      return d1(LevelMask{level_mask_});
+    }
+    unsigned char d1(LevelMask level_mask) const {
+      // d1 = refs_count + 8 * is_special + 32 * level
+      //      + 16 * with_hashes - for seriazlization
+      // d1 = 7 + 16 + 32 * l - for absent cells
+      return static_cast<unsigned char>(refs_count_ + 8 * is_special_ + 32 * level_mask.get_mask());
+    }
+    unsigned char d2() const {
+      auto res = static_cast<unsigned char>((bits_ / 8) * 2);
+      if ((bits_ & 7) != 0) {
+        return static_cast<unsigned char>(res + 1);
+      }
+      return res;
+    }
+    size_t get_hashes_offset() const {
+      return 0;
+    }
+    size_t get_refs_offset() const {
+      return get_hashes_offset() + hash_bytes * hash_count_;
+    }
+    size_t get_depth_offset() const {
+      return get_refs_offset() + refs_count_ * sizeof(Cell*);
+    }
+    size_t get_data_offset() const {
+      return get_depth_offset() + sizeof(td::uint16) * hash_count_;
+    }
+    size_t get_storage_size() const {
+      return get_data_offset() + (bits_ + 7) / 8;
+    }
+
+    const Hash* get_hashes(const char* storage) const {
+      return reinterpret_cast<const Hash*>(storage + get_hashes_offset());
+    }
+
+    Hash* get_hashes(char* storage) const {
+      return reinterpret_cast<Hash*>(storage + get_hashes_offset());
+    }
+
+    const td::uint16* get_depth(const char* storage) const {
+      return reinterpret_cast<const td::uint16*>(storage + get_depth_offset());
+    }
+
+    td::uint16* get_depth(char* storage) const {
+      return reinterpret_cast<td::uint16*>(storage + get_depth_offset());
+    }
+
+    const unsigned char* get_data(const char* storage) const {
+      return reinterpret_cast<const unsigned char*>(storage + get_data_offset());
+    }
+    unsigned char* get_data(char* storage) const {
+      return reinterpret_cast<unsigned char*>(storage + get_data_offset());
+    }
+
+    Cell* const* get_refs(const char* storage) const {
+      return reinterpret_cast<Cell* const*>(storage + get_refs_offset());
+    }
+    Cell** get_refs(char* storage) const {
+      return reinterpret_cast<Cell**>(storage + get_refs_offset());
+    }
+  };
+
+  Info info_;
+  virtual char* get_storage() = 0;
+  virtual const char* get_storage() const = 0;
+  // TODO: we may also save three different pointers
+
+  void destroy_storage(char* storage);
+
+  explicit DataCell(Info info);
+  Cell* get_ref_raw_ptr(unsigned idx) const {
+    DCHECK(idx < get_refs_cnt());
+    return info_.get_refs(get_storage())[idx];
+  }
+
+ public:
+  td::Result<LoadedCell> load_cell() const override {
+    return LoadedCell{Ref<DataCell>{this}, {}, {}};
+  }
+  unsigned get_refs_cnt() const {
+    return info_.refs_count_;
+  }
+  unsigned get_bits() const {
+    return info_.bits_;
+  }
+  unsigned size_refs() const {
+    return info_.refs_count_;
+  }
+  unsigned size() const {
+    return info_.bits_;
+  }
+  const unsigned char* get_data() const {
+    return info_.get_data(get_storage());
+  }
+  Ref<Cell> get_ref(unsigned idx) const {
+    if (idx >= get_refs_cnt()) {
+      return Ref<Cell>{};
+    }
+    return Ref<Cell>(get_ref_raw_ptr(idx));
+  }
+
+  td::uint32 get_virtualization() const override {
+    return info_.virtualization_;
+  }
+  CellUsageTree::NodePtr get_tree_node() const override {
+    return {};
+  }
+  bool is_loaded() const override {
+    return true;
+  }
+  LevelMask get_level_mask() const override {
+    return LevelMask{info_.level_mask_};
+  }
+
+  bool is_special() const {
+    return info_.is_special_;
+  }
+  SpecialType special_type() const;
+  int get_serialized_size(bool with_hashes = false) const {
+    return ((get_bits() + 23) >> 3) +
+           (with_hashes ? get_level_mask().get_hashes_count() * (hash_bytes + depth_bytes) : 0);
+  }
+  int serialize(unsigned char* buff, int buff_size, bool with_hashes = false) const;
+  std::string serialize() const;
+  std::string to_hex() const;
+  static td::int64 get_total_data_cells() {
+    return get_thread_safe_counter().sum();
+  }
+
+  template <class StorerT>
+  void store(StorerT& storer) const {
+    storer.template store_binary<td::uint8>(info_.d1());
+    storer.template store_binary<td::uint8>(info_.d2());
+    storer.store_slice(td::Slice(get_data(), (get_bits() + 7) / 8));
+  }
+
+ protected:
+  static constexpr auto max_storage_size = max_refs * sizeof(void*) + (max_level + 1) * hash_bytes + max_bytes;
+
+ private:
+  static td::NamedThreadSafeCounter::CounterRef get_thread_safe_counter() {
+    static auto res = td::NamedThreadSafeCounter::get_default().get_counter("DataCell");
+    return res;
+  }
+  static std::unique_ptr<DataCell> create_empty_data_cell(Info info);
+
+  const Hash do_get_hash(td::uint32 level) const override;
+  td::uint16 do_get_depth(td::uint32 level) const override;
+
+  friend class CellBuilder;
+  static td::Result<Ref<DataCell>> create(td::ConstBitPtr data, unsigned bits, td::Span<Ref<Cell>> refs, bool special);
+  static td::Result<Ref<DataCell>> create(td::ConstBitPtr data, unsigned bits, td::MutableSpan<Ref<Cell>> refs,
+                                          bool special);
+};
+
+std::ostream& operator<<(std::ostream& os, const DataCell& c);
+
+}  // namespace vm
+
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/ExtCell.h b/submodules/ton/tonlib-src/crypto/vm/cells/ExtCell.h
new file mode 100644
index 0000000000..72490677f0
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/ExtCell.h
@@ -0,0 +1,140 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cells/Cell.h"
+#include "vm/cells/PrunnedCell.h"
+#include "common/AtomicRef.h"
+
+#include <mutex>
+#include "td/utils/port/thread_local.h"
+#include "td/utils/HazardPointers.h"
+#include "td/utils/optional.h"
+
+namespace vm {
+
+template <class ExtraT, class Loader>
+class ExtCell : public Cell {
+ private:
+  struct PrivateTag {};
+
+ public:
+  static td::Result<Ref<ExtCell<ExtraT, Loader>>> create(const PrunnedCellInfo& prunned_cell_info, ExtraT&& extra) {
+    TRY_RESULT(prunned_cell, PrunnedCell<ExtraT>::create(prunned_cell_info, std::move(extra)));
+    return Ref<ExtCell<ExtraT, Loader>>(true, std::move(prunned_cell), PrivateTag{});
+  }
+
+  ExtCell(Ref<PrunnedCell<ExtraT>> prunned_cell, PrivateTag) : prunned_cell_(std::move(prunned_cell)) {
+    get_thread_safe_counter().add(1);
+    get_thread_safe_counter_unloaded().add(prunned_cell_.load_unsafe().not_null());
+  }
+  ~ExtCell() {
+    get_thread_safe_counter().add(-1);
+    get_thread_safe_counter_unloaded().add(-static_cast<int>(prunned_cell_.load_unsafe().not_null()));
+  }
+
+  LevelMask get_level_mask() const override {
+    return CellView(this)->get_level_mask();
+  }
+
+  td::Result<LoadedCell> load_cell() const override {
+    TRY_RESULT(data_cell, load_data_cell());
+    return LoadedCell{std::move(data_cell), {}, {}};
+  }
+  td::uint32 get_virtualization() const override {
+    return 0;
+  }
+  CellUsageTree::NodePtr get_tree_node() const override {
+    return {};
+  }
+  bool is_loaded() const override {
+    return CellView(this)->is_loaded();
+  }
+
+ private:
+  mutable td::AtomicRef<DataCell> data_cell_;
+  mutable td::AtomicRef<PrunnedCell<ExtraT>> prunned_cell_;
+
+  static td::NamedThreadSafeCounter::CounterRef get_thread_safe_counter() {
+    static auto res = td::NamedThreadSafeCounter::get_default().get_counter("ExtCell");
+    return res;
+  }
+
+  static td::NamedThreadSafeCounter::CounterRef get_thread_safe_counter_unloaded() {
+    static auto res = td::NamedThreadSafeCounter::get_default().get_counter("ExtCell.unloaded");
+    return res;
+  }
+
+  struct CellView {
+    CellView(const ExtCell<ExtraT, Loader>* cell) {
+      cell_ = cell->data_cell_.get_unsafe();
+      if (cell_) {
+        return;
+      }
+
+      prunned_cell_ = cell->prunned_cell_.load();
+      if (!prunned_cell_.is_null()) {
+        cell_ = &*prunned_cell_;
+        return;
+      }
+      cell_ = cell->data_cell_.get_unsafe();
+      DCHECK(cell_);
+    }
+
+    const Cell* operator->() const {
+      return cell_;
+    }
+
+    td::Ref<PrunnedCell<ExtraT>> prunned_cell_;
+    const Cell* cell_;
+  };
+
+  const Hash do_get_hash(td::uint32 level) const override {
+    return CellView(this)->get_hash(level);
+  }
+
+  td::uint16 do_get_depth(td::uint32 level) const override {
+    return CellView(this)->get_depth(level);
+  }
+
+  td::Result<Ref<DataCell>> load_data_cell() const {
+    auto data_cell = data_cell_.get_unsafe();
+    if (data_cell) {
+      return Ref<DataCell>(data_cell);
+    }
+
+    auto prunned_cell = prunned_cell_.load();
+
+    if (prunned_cell.is_null()) {
+      data_cell = data_cell_.get_unsafe();
+      DCHECK(data_cell);
+      return Ref<DataCell>(data_cell);
+    }
+
+    TRY_RESULT(new_data_cell, Loader::load_data_cell(*this, prunned_cell->get_extra()));
+    TRY_STATUS(prunned_cell->check_equals_unloaded(new_data_cell));
+
+    if (data_cell_.store_if_empty(new_data_cell)) {
+      prunned_cell_.store({});
+      get_thread_safe_counter_unloaded().add(-1);
+    }
+
+    return data_cell_.load_unsafe();
+  }
+};
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/LevelMask.cpp b/submodules/ton/tonlib-src/crypto/vm/cells/LevelMask.cpp
new file mode 100644
index 0000000000..0a6dfb360b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/LevelMask.cpp
@@ -0,0 +1,32 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "LevelMask.h"
+
+namespace vm {
+namespace detail {
+td::StringBuilder& operator<<(td::StringBuilder& sb, LevelMask level_mask) {
+  sb << "LevelMask{";
+  for (int i = 0, level = level_mask.get_level(); i < level; i++) {
+    sb << "01"[(level_mask.get_mask() >> i) % 2];
+  }
+  sb << "}";
+  return sb;
+}
+}  // namespace detail
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/LevelMask.h b/submodules/ton/tonlib-src/crypto/vm/cells/LevelMask.h
new file mode 100644
index 0000000000..144fe3b4c1
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/LevelMask.h
@@ -0,0 +1,84 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/bits.h"
+#include "td/utils/int_types.h"
+#include "td/utils/StringBuilder.h"
+
+namespace td {
+class StringBuilder;
+}
+
+namespace vm {
+namespace detail {
+class LevelMask {
+ public:
+  explicit LevelMask(td::uint32 new_mask = 0) : mask_(new_mask) {
+  }
+  td::uint32 get_mask() const {
+    return mask_;
+  }
+  td::uint32 get_level() const {
+    return 32 - td::count_leading_zeroes32(mask_);
+  }
+  td::uint32 get_hash_i() const {
+    return td::count_bits32(mask_);
+  }
+  td::uint32 get_hashes_count() const {
+    return get_hash_i() + 1;
+  }
+  LevelMask apply(td::uint32 level) const {
+    DCHECK(level < 32);
+    return LevelMask{mask_ & ((1u << level) - 1)};
+  }
+  LevelMask apply_or(LevelMask other) const {
+    return LevelMask{mask_ | other.mask_};
+  }
+  LevelMask shift_right() const {
+    return LevelMask{mask_ >> 1};
+  }
+  bool is_significant(td::uint32 level) const {
+    DCHECK(level < 32);
+    bool res = level == 0 || ((mask_ >> (level - 1)) % 2 != 0);
+    CHECK(res == (apply(level).get_level() == level));
+    return res;
+  }
+
+  bool operator==(const LevelMask& other) const {
+    return mask_ == other.mask_;
+  }
+  bool operator!=(const LevelMask& other) const {
+    return !(*this == other);
+  }
+
+  static LevelMask one_level(td::uint32 level) {
+    DCHECK(level < 32);
+    if (level == 0) {
+      return LevelMask(0);
+    }
+    return LevelMask(1 << (level - 1));
+  }
+
+ private:
+  td::uint32 mask_;
+};
+td::StringBuilder& operator<<(td::StringBuilder& sb, LevelMask level_mask);
+}  // namespace detail
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/MerkleProof.cpp b/submodules/ton/tonlib-src/crypto/vm/cells/MerkleProof.cpp
new file mode 100644
index 0000000000..084a973ed8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/MerkleProof.cpp
@@ -0,0 +1,299 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/cells/MerkleProof.h"
+#include "vm/cells/CellBuilder.h"
+#include "vm/cells/CellSlice.h"
+#include "vm/boc.h"
+
+#include "td/utils/HashMap.h"
+#include "td/utils/HashSet.h"
+
+namespace vm {
+namespace detail {
+class MerkleProofImpl {
+ public:
+  explicit MerkleProofImpl(MerkleProof::IsPrunnedFunction is_prunned) : is_prunned_(std::move(is_prunned)) {
+  }
+  explicit MerkleProofImpl(CellUsageTree *usage_tree) : usage_tree_(usage_tree) {
+  }
+
+  Ref<Cell> create_from(Ref<Cell> cell) {
+    if (!is_prunned_) {
+      CHECK(usage_tree_);
+      dfs_usage_tree(cell, usage_tree_->root_id());
+      is_prunned_ = [this](const Ref<Cell> &cell) { return visited_cells_.count(cell->get_hash()) == 0; };
+    }
+    return dfs(cell, cell->get_level());
+  }
+
+ private:
+  using Key = std::pair<Cell::Hash, int>;
+  td::HashMap<Key, Ref<Cell>> cells_;
+  td::HashSet<Cell::Hash> visited_cells_;
+  CellUsageTree *usage_tree_{nullptr};
+  MerkleProof::IsPrunnedFunction is_prunned_;
+
+  void dfs_usage_tree(Ref<Cell> cell, CellUsageTree::NodeId node_id) {
+    if (!usage_tree_->is_loaded(node_id)) {
+      return;
+    }
+    visited_cells_.insert(cell->get_hash());
+    CellSlice cs(NoVm(), cell);
+    for (unsigned i = 0; i < cs.size_refs(); i++) {
+      dfs_usage_tree(cs.prefetch_ref(i), usage_tree_->get_child(node_id, i));
+    }
+  }
+
+  Ref<Cell> dfs(Ref<Cell> cell, int merkle_depth) {
+    CHECK(cell.not_null());
+    Key key{cell->get_hash(), merkle_depth};
+    {
+      auto it = cells_.find(key);
+      if (it != cells_.end()) {
+        CHECK(it->second.not_null());
+        return it->second;
+      }
+    }
+
+    if (is_prunned_(cell)) {
+      auto res = CellBuilder::create_pruned_branch(cell, merkle_depth + 1);
+      CHECK(res.not_null());
+      cells_.emplace(key, res);
+      return res;
+    }
+    CellSlice cs(NoVm(), cell);
+    int children_merkle_depth = cs.child_merkle_depth(merkle_depth);
+    CellBuilder cb;
+    cb.store_bits(cs.fetch_bits(cs.size()));
+    for (unsigned i = 0; i < cs.size_refs(); i++) {
+      cb.store_ref(dfs(cs.prefetch_ref(i), children_merkle_depth));
+    }
+    auto res = cb.finalize(cs.is_special());
+    CHECK(res.not_null());
+    cells_.emplace(key, res);
+    return res;
+  }
+};
+}  // namespace detail
+
+Ref<Cell> MerkleProof::generate_raw(Ref<Cell> cell, IsPrunnedFunction is_prunned) {
+  return detail::MerkleProofImpl(is_prunned).create_from(cell);
+}
+
+Ref<Cell> MerkleProof::generate_raw(Ref<Cell> cell, CellUsageTree *usage_tree) {
+  return detail::MerkleProofImpl(usage_tree).create_from(cell);
+}
+
+Ref<Cell> MerkleProof::virtualize_raw(Ref<Cell> cell, Cell::VirtualizationParameters virt) {
+  return cell->virtualize(virt);
+}
+
+Ref<Cell> MerkleProof::generate(Ref<Cell> cell, IsPrunnedFunction is_prunned) {
+  int cell_level = cell->get_level();
+  if (cell_level != 0) {
+    return {};
+  }
+  auto raw = generate_raw(std::move(cell), is_prunned);
+  return CellBuilder::create_merkle_proof(std::move(raw));
+}
+
+Ref<Cell> MerkleProof::generate(Ref<Cell> cell, CellUsageTree *usage_tree) {
+  int cell_level = cell->get_level();
+  if (cell_level != 0) {
+    return {};
+  }
+  auto raw = generate_raw(std::move(cell), usage_tree);
+  return CellBuilder::create_merkle_proof(std::move(raw));
+}
+
+td::Result<Ref<Cell>> unpack_proof(Ref<Cell> cell) {
+  CHECK(cell.not_null());
+  td::uint8 level = static_cast<td::uint8>(cell->get_level());
+  if (level != 0) {
+    return td::Status::Error("Level of MerkleProof must be zero");
+  }
+  CellSlice cs(NoVm(), std::move(cell));
+  if (cs.special_type() != Cell::SpecialType::MerkleProof) {
+    return td::Status::Error("Not a MekleProof cell");
+  }
+  return cs.fetch_ref();
+}
+
+Ref<Cell> MerkleProof::virtualize(Ref<Cell> cell, int virtualization) {
+  auto r_raw = unpack_proof(std::move(cell));
+  if (r_raw.is_error()) {
+    return {};
+  }
+  return virtualize_raw(r_raw.move_as_ok(), {0 /*level*/, static_cast<td::uint8>(virtualization)});
+}
+
+class MerkleProofCombine {
+ public:
+  MerkleProofCombine(Ref<Cell> a, Ref<Cell> b) : a_(std::move(a)), b_(std::move(b)) {
+  }
+  td::Result<Ref<Cell>> run() {
+    TRY_RESULT(a, unpack_proof(a_));
+    TRY_RESULT(b, unpack_proof(b_));
+    if (a->get_hash(0) != b->get_hash(0)) {
+      return td::Status::Error("Can't combine MerkleProofs with different roots");
+    }
+    dfs(a, 0);
+    dfs(b, 0);
+    return CellBuilder::create_merkle_proof(create_A(a, 0, 0));
+  }
+
+ private:
+  Ref<Cell> a_;
+  Ref<Cell> b_;
+
+  struct Info {
+    Ref<Cell> cell_;
+    Ref<Cell> prunned_cells_[Cell::max_level];  // Cache prunned cells with different levels to reuse them
+
+    Ref<Cell> get_prunned_cell(int depth) {
+      if (depth < Cell::max_level) {
+        return prunned_cells_[depth];
+      }
+      return {};
+    }
+    Ref<Cell> get_any_cell() const {
+      if (cell_.not_null()) {
+        return cell_;
+      }
+      for (auto &cell : prunned_cells_) {
+        if (cell.not_null()) {
+          return cell;
+        }
+      }
+      UNREACHABLE();
+    }
+  };
+
+  using Key = std::pair<Cell::Hash, int>;
+  td::HashMap<Cell::Hash, Info> cells_;
+  td::HashMap<Key, Ref<Cell>> create_A_res_;
+  td::HashSet<Key> visited_;
+
+  void dfs(Ref<Cell> cell, int merkle_depth) {
+    if (!visited_.emplace(cell->get_hash(), merkle_depth).second) {
+      return;
+    }
+
+    auto &info = cells_[cell->get_hash(merkle_depth)];
+    CellSlice cs(NoVm(), cell);
+    // check if prunned cell is bounded
+    if (cs.special_type() == Cell::SpecialType::PrunnedBranch && static_cast<int>(cell->get_level()) > merkle_depth) {
+      info.prunned_cells_[cell->get_level() - 1] = std::move(cell);
+      return;
+    }
+    info.cell_ = std::move(cell);
+
+    auto child_merkle_depth = cs.child_merkle_depth(merkle_depth);
+    for (size_t i = 0, size = cs.size_refs(); i < size; i++) {
+      dfs(cs.fetch_ref(), child_merkle_depth);
+    }
+  }
+
+  Ref<Cell> create_A(Ref<Cell> cell, int merkle_depth, int a_merkle_depth) {
+    merkle_depth = cell->get_level_mask().apply(merkle_depth).get_level();
+    auto key = Key(cell->get_hash(merkle_depth), a_merkle_depth);
+    auto it = create_A_res_.find(key);
+    if (it != create_A_res_.end()) {
+      return it->second;
+    }
+
+    auto res = do_create_A(std::move(cell), merkle_depth, a_merkle_depth);
+    create_A_res_.emplace(key, res);
+    return res;
+  }
+
+  Ref<Cell> do_create_A(Ref<Cell> cell, int merkle_depth, int a_merkle_depth) {
+    auto &info = cells_[cell->get_hash(merkle_depth)];
+
+    if (info.cell_.is_null()) {
+      Ref<Cell> res = info.get_prunned_cell(a_merkle_depth);
+      if (res.is_null()) {
+        res = CellBuilder::create_pruned_branch(info.get_any_cell(), a_merkle_depth + 1, merkle_depth);
+      }
+      return res;
+    }
+
+    CHECK(info.cell_.not_null());
+    CellSlice cs(NoVm(), info.cell_);
+
+    //CHECK(cs.size_refs() != 0);
+    if (cs.size_refs() == 0) {
+      return info.cell_;
+    }
+
+    auto child_merkle_depth = cs.child_merkle_depth(merkle_depth);
+    auto child_a_merkle_depth = cs.child_merkle_depth(a_merkle_depth);
+
+    CellBuilder cb;
+    cb.store_bits(cs.fetch_bits(cs.size()));
+    for (unsigned i = 0; i < cs.size_refs(); i++) {
+      cb.store_ref(create_A(cs.prefetch_ref(i), child_merkle_depth, child_a_merkle_depth));
+    }
+    return cb.finalize(cs.is_special());
+  }
+};
+
+Ref<Cell> MerkleProof::combine(Ref<Cell> a, Ref<Cell> b) {
+  auto res = MerkleProofCombine(std::move(a), std::move(b)).run();
+  if (res.is_error()) {
+    return {};
+  }
+  return res.move_as_ok();
+}
+
+MerkleProofBuilder::MerkleProofBuilder(Ref<Cell> root)
+    : usage_tree(std::make_shared<CellUsageTree>()), orig_root(std::move(root)) {
+  usage_root = UsageCell::create(orig_root, usage_tree->root_ptr());
+}
+
+void MerkleProofBuilder::reset(Ref<Cell> root) {
+  usage_tree = std::make_shared<CellUsageTree>();
+  orig_root = std::move(root);
+  usage_root = UsageCell::create(orig_root, usage_tree->root_ptr());
+}
+
+void MerkleProofBuilder::clear() {
+  usage_tree.reset();
+  orig_root.clear();
+  usage_root.clear();
+}
+
+Ref<Cell> MerkleProofBuilder::extract_proof() const {
+  return MerkleProof::generate(orig_root, usage_tree.get());
+}
+
+bool MerkleProofBuilder::extract_proof_to(Ref<Cell> &proof_root) const {
+  return orig_root.not_null() && (proof_root = extract_proof()).not_null();
+}
+
+td::Result<td::BufferSlice> MerkleProofBuilder::extract_proof_boc() const {
+  Ref<Cell> proof_root = extract_proof();
+  if (proof_root.is_null()) {
+    return td::Status::Error("cannot create Merkle proof");
+  } else {
+    return std_boc_serialize(std::move(proof_root));
+  }
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/MerkleProof.h b/submodules/ton/tonlib-src/crypto/vm/cells/MerkleProof.h
new file mode 100644
index 0000000000..8dfb43a65c
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/MerkleProof.h
@@ -0,0 +1,65 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cells/Cell.h"
+#include "td/utils/buffer.h"
+
+#include <utility>
+#include <functional>
+
+namespace vm {
+
+class MerkleProof {
+ public:
+  using IsPrunnedFunction = std::function<bool(const Ref<Cell> &)>;
+
+  // works with proofs wrapped in MerkleProof special cell
+  // cells must have zero level
+  static Ref<Cell> generate(Ref<Cell> cell, IsPrunnedFunction is_prunned);
+  static Ref<Cell> generate(Ref<Cell> cell, CellUsageTree *usage_tree);
+
+  // cell must have zero level and must be a MerkleProof
+  static Ref<Cell> virtualize(Ref<Cell> cell, int virtualization);
+
+  static Ref<Cell> combine(Ref<Cell> a, Ref<Cell> b);
+
+  // works with upwrapped proofs
+  // works fine with cell of non-zero level, but this is not supported (yet?) in MerkeProof special cell
+  static Ref<Cell> generate_raw(Ref<Cell> cell, IsPrunnedFunction is_prunned);
+  static Ref<Cell> generate_raw(Ref<Cell> cell, CellUsageTree *usage_tree);
+  static Ref<Cell> virtualize_raw(Ref<Cell> cell, Cell::VirtualizationParameters virt);
+};
+
+class MerkleProofBuilder {
+  std::shared_ptr<CellUsageTree> usage_tree;
+  Ref<vm::Cell> orig_root, usage_root;
+
+ public:
+  MerkleProofBuilder(Ref<Cell> root);
+  void reset(Ref<Cell> root);
+  void clear();
+  Ref<Cell> root() const {
+    return usage_root;
+  }
+  Ref<Cell> extract_proof() const;
+  bool extract_proof_to(Ref<Cell> &proof_root) const;
+  td::Result<td::BufferSlice> extract_proof_boc() const;
+};
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/MerkleUpdate.cpp b/submodules/ton/tonlib-src/crypto/vm/cells/MerkleUpdate.cpp
new file mode 100644
index 0000000000..30b5116ecf
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/MerkleUpdate.cpp
@@ -0,0 +1,510 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/cells/MerkleUpdate.h"
+#include "vm/cells/MerkleProof.h"
+
+#include "td/utils/HashMap.h"
+#include "td/utils/HashSet.h"
+
+namespace vm {
+namespace detail {
+class MerkleUpdateApply {
+ public:
+  Ref<Cell> apply(Ref<Cell> from, Ref<Cell> update_from, Ref<Cell> update_to, td::uint32 from_level,
+                  td::uint32 to_level) {
+    if (from_level != from->get_level()) {
+      return {};
+    }
+    dfs_both(from, update_from, from_level);
+    return dfs(update_to, to_level);
+  }
+
+ private:
+  using Key = std::pair<Cell::Hash, int>;
+  td::HashMap<Cell::Hash, Ref<Cell>> known_cells_;
+  td::HashMap<Key, Ref<Cell>> ready_cells_;
+
+  void dfs_both(Ref<Cell> original, Ref<Cell> update_from, int merkle_depth) {
+    CellSlice cs_update_from(NoVm(), update_from);
+    known_cells_.emplace(original->get_hash(merkle_depth), original);
+    if (cs_update_from.special_type() == Cell::SpecialType::PrunnedBranch) {
+      return;
+    }
+    int child_merkle_depth = cs_update_from.child_merkle_depth(merkle_depth);
+
+    CellSlice cs_original(NoVm(), original);
+    for (unsigned i = 0; i < cs_original.size_refs(); i++) {
+      dfs_both(cs_original.prefetch_ref(i), cs_update_from.prefetch_ref(i), child_merkle_depth);
+    }
+  }
+
+  Ref<Cell> dfs(Ref<Cell> cell, int merkle_depth) {
+    CellSlice cs(NoVm(), cell);
+    if (cs.special_type() == Cell::SpecialType::PrunnedBranch) {
+      if ((int)cell->get_level() == merkle_depth + 1) {
+        auto it = known_cells_.find(cell->get_hash(merkle_depth));
+        if (it != known_cells_.end()) {
+          return it->second;
+        }
+        return {};
+      }
+      return cell;
+    }
+    Key key{cell->get_hash(), merkle_depth};
+    {
+      auto it = ready_cells_.find(key);
+      if (it != ready_cells_.end()) {
+        return it->second;
+      }
+    }
+
+    int child_merkle_depth = cs.child_merkle_depth(merkle_depth);
+
+    CellBuilder cb;
+    cb.store_bits(cs.fetch_bits(cs.size()));
+    for (unsigned i = 0; i < cs.size_refs(); i++) {
+      auto ref = dfs(cs.prefetch_ref(i), child_merkle_depth);
+      if (ref.is_null()) {
+        return {};
+      }
+      cb.store_ref(std::move(ref));
+    }
+    auto res = cb.finalize(cs.is_special());
+    ready_cells_.emplace(key, res);
+    return res;
+  }
+};
+
+class MerkleUpdateValidator {
+ public:
+  td::Status validate(Ref<Cell> update_from, Ref<Cell> update_to, td::uint32 from_level, td::uint32 to_level) {
+    dfs_from(update_from, from_level);
+    return dfs_to(update_to, to_level);
+  }
+
+ private:
+  td::HashSet<Cell::Hash> known_cells_;
+  using Key = std::pair<Cell::Hash, int>;
+  td::HashSet<Key> visited_from_;
+  td::HashSet<Key> visited_to_;
+
+  void dfs_from(Ref<Cell> cell, int merkle_depth) {
+    if (!visited_from_.emplace(cell->get_hash(), merkle_depth).second) {
+      return;
+    }
+    CellSlice cs(NoVm(), cell);
+    known_cells_.insert(cell->get_hash(merkle_depth));
+    if (cs.special_type() == Cell::SpecialType::PrunnedBranch) {
+      return;
+    }
+    int child_merkle_depth = cs.child_merkle_depth(merkle_depth);
+    for (unsigned i = 0; i < cs.size_refs(); i++) {
+      dfs_from(cs.prefetch_ref(i), child_merkle_depth);
+    }
+  }
+
+  td::Status dfs_to(Ref<Cell> cell, int merkle_depth) {
+    if (!visited_to_.emplace(cell->get_hash(), merkle_depth).second) {
+      return td::Status::OK();
+    }
+    CellSlice cs(NoVm(), cell);
+    if (cs.special_type() == Cell::SpecialType::PrunnedBranch) {
+      if ((int)cell->get_level() == merkle_depth + 1) {
+        if (known_cells_.count(cell->get_hash(merkle_depth)) == 0) {
+          return td::Status::Error(PSLICE()
+                                   << "Unknown prunned cell (validate): " << cell->get_hash(merkle_depth).to_hex());
+        }
+      }
+      return td::Status::OK();
+    }
+    int child_merkle_depth = cs.child_merkle_depth(merkle_depth);
+
+    for (unsigned i = 0; i < cs.size_refs(); i++) {
+      TRY_STATUS(dfs_to(cs.prefetch_ref(i), child_merkle_depth));
+    }
+    return td::Status::OK();
+  }
+};
+}  // namespace detail
+
+td::Status MerkleUpdate::may_apply(Ref<Cell> from, Ref<Cell> update) {
+  if (update->get_level() != 0 || from->get_level() != 0) {
+    return td::Status::Error("Level of update of from is not zero");
+  }
+  CellSlice cs(NoVm(), std::move(update));
+  if (cs.special_type() != Cell::SpecialType::MerkleUpdate) {
+    return td::Status::Error("Update cell is not a MerkeUpdate");
+  }
+  auto update_from = cs.fetch_ref();
+  if (from->get_hash(0) != update_from->get_hash(0)) {
+    return td::Status::Error("Hash mismatch");
+  }
+  return td::Status::OK();
+}
+
+Ref<Cell> MerkleUpdate::apply(Ref<Cell> from, Ref<Cell> update) {
+  if (update->get_level() != 0 || from->get_level() != 0) {
+    return {};
+  }
+  CellSlice cs(NoVm(), std::move(update));
+  if (cs.special_type() != Cell::SpecialType::MerkleUpdate) {
+    return {};
+  }
+  auto update_from = cs.fetch_ref();
+  auto update_to = cs.fetch_ref();
+  return apply_raw(std::move(from), std::move(update_from), std::move(update_to), 0, 0);
+}
+
+Ref<Cell> MerkleUpdate::apply_raw(Ref<Cell> from, Ref<Cell> update_from, Ref<Cell> update_to, td::uint32 from_level,
+                                  td::uint32 to_level) {
+  if (from->get_hash(from_level) != update_from->get_hash(from_level)) {
+    LOG(DEBUG) << "invalid Merkle update: expected old value hash = " << update_from->get_hash(from_level).to_hex()
+               << ", applied to value with hash = " << from->get_hash(from_level).to_hex();
+    return {};
+  }
+  return detail::MerkleUpdateApply().apply(from, std::move(update_from), std::move(update_to), from_level, to_level);
+}
+
+std::pair<Ref<Cell>, Ref<Cell>> MerkleUpdate::generate_raw(Ref<Cell> from, Ref<Cell> to, CellUsageTree *usage_tree) {
+  // create Merkle update cell->new_cell
+  auto update_to = MerkleProof::generate_raw(to, [tree = usage_tree](const Ref<Cell> &cell) {
+    auto loaded_cell = cell->load_cell().move_as_ok();  // FIXME
+    if (loaded_cell.data_cell->size_refs() == 0) {
+      return false;
+    }
+    return !loaded_cell.tree_node.empty() && loaded_cell.tree_node.mark_path(tree);
+  });
+  usage_tree->set_use_mark_for_is_loaded(true);
+  auto update_from = MerkleProof::generate_raw(from, usage_tree);
+
+  return {std::move(update_from), std::move(update_to)};
+}
+
+td::Status MerkleUpdate::validate_raw(Ref<Cell> update_from, Ref<Cell> update_to, td::uint32 from_level,
+                                      td::uint32 to_level) {
+  return detail::MerkleUpdateValidator().validate(std::move(update_from), std::move(update_to), from_level, to_level);
+}
+
+td::Status MerkleUpdate::validate(Ref<Cell> update) {
+  if (update->get_level() != 0) {
+    return td::Status::Error("nonzero level");
+  }
+  CellSlice cs(NoVm(), std::move(update));
+  if (cs.special_type() != Cell::SpecialType::MerkleUpdate) {
+    return td::Status::Error("not a MerkleUpdate cell");
+  }
+  auto update_from = cs.fetch_ref();
+  auto update_to = cs.fetch_ref();
+  return validate_raw(std::move(update_from), std::move(update_to), 0, 0);
+}
+
+Ref<Cell> MerkleUpdate::generate(Ref<Cell> from, Ref<Cell> to, CellUsageTree *usage_tree) {
+  auto from_level = from->get_level();
+  auto to_level = to->get_level();
+  if (from_level != 0 || to_level != 0) {
+    return {};
+  }
+  auto res = generate_raw(std::move(from), std::move(to), usage_tree);
+  return CellBuilder::create_merkle_update(res.first, res.second);
+}
+
+namespace detail {
+class MerkleCombine {
+ public:
+  MerkleCombine(Ref<Cell> AB, Ref<Cell> CD) : AB_(std::move(AB)), CD_(std::move(CD)) {
+  }
+
+  td::Result<Ref<Cell>> run() {
+    TRY_RESULT(AB, unpack_update(std::move(AB_)));
+    TRY_RESULT(CD, unpack_update(std::move(CD_)));
+    std::tie(A_, B_) = AB;
+    std::tie(C_, D_) = CD;
+    if (B_->get_hash(0) != C_->get_hash(0)) {
+      return td::Status::Error("Impossible to combine merkle updates");
+    }
+
+    auto log = [](td::Slice name, auto cell) {
+      CellSlice cs(NoVm(), cell);
+      LOG(ERROR) << name << " " << cell->get_level();
+      cs.print_rec(std::cerr);
+    };
+    if (0) {
+      log("A", A_);
+      log("B", B_);
+      log("C", C_);
+      log("D", D_);
+    }
+
+    // We have four bags of cells. A, B, C and D.
+    // X = Virtualize(A), A is subtree (merkle proof) of X
+    // Y = Virtualize(B) = Virtualize(C), B and C are  subrees of Y
+    // Z = Virtualize(D), D is subtree of Z
+    //
+    // Prunned cells bounded by merkle proof P are essentially cells which are impossible to load during traversal of Virtualize(P)
+    //
+    // We want to create new_A and new_D
+    // Virtualize(new_A) = X
+    // Virtualize(new_D) = Z
+    // All prunned branches bounded by new_D must be in new_A
+    // i.e. if we have all cells reachable in Virtualize(new_A) we may construct Z from them (and from new_D)
+    //
+    // Main idea is following
+    // 1. Create maximum subtrees of X and Z with all cells in A, B, C and D
+    // Max(V) - such maximum subtree
+    //
+    // 2. Max(A) and Max(D) should be merkle update already. But win want to minimize it
+    // So we cut all branches of Max(D) which are in maxA
+    // When we cut branch q in Max(D) we mark some path to q in Max(A)
+    // Then we cut all branches of Max(A) which are not marked.
+    //
+    // How to create Max(A)?
+    // We just store all cells reachable from A, B, C and D in big cache.
+    // It we reach bounded prunned cell during traversion we may continue traversial with a cell from the cache.
+    //
+    //
+    // 1. load_cells(root) - caches all cell reachable in Virtualize(root);
+    visited_.clear();
+    load_cells(A_, 0);
+    visited_.clear();
+    load_cells(B_, 0);
+    visited_.clear();
+    load_cells(C_, 0);
+    visited_.clear();
+    load_cells(D_, 0);
+
+    // 2. mark_A(A) - Traverse Max(A), but uses all cached cells from step 1. Mark all visited cells
+    A_usage_tree_ = std::make_shared<CellUsageTree>();
+    mark_A(A_, 0, A_usage_tree_->root_id());
+
+    // 3. create_D(D) - create new_D. Traverse Max(D), and stop at marked cells. Mark path in A to marked cells
+    auto new_D = create_D(D_, 0, 0);
+    if (new_D.is_null()) {
+      return td::Status::Error("Failed to combine updates. One of them is probably an invalid update");
+    }
+
+    // 4. create_A(A) - create new_A. Traverse Max(A), and stop at cells not marked at step 3.
+    auto new_A = create_A(A_, 0, 0);
+    if (0) {
+      log("NewD", new_D);
+    }
+
+    return CellBuilder::create_merkle_update(new_A, new_D);
+  }
+
+ private:
+  Ref<Cell> AB_, CD_;
+  Ref<Cell> A_, B_, C_, D_;
+
+  std::shared_ptr<CellUsageTree> A_usage_tree_;
+
+  struct Info {
+    Ref<Cell> cell_;
+    Ref<Cell> prunned_cells_[Cell::max_level];  // Cache prunned cells with different levels to reuse them
+    CellUsageTree::NodeId A_node_id{0};
+
+    Ref<Cell> get_prunned_cell(int depth) {
+      if (depth < Cell::max_level) {
+        return prunned_cells_[depth];
+      }
+      return {};
+    }
+    Ref<Cell> get_any_cell() const {
+      if (cell_.not_null()) {
+        return cell_;
+      }
+      for (auto &cell : prunned_cells_) {
+        if (cell.not_null()) {
+          return cell;
+        }
+      }
+      UNREACHABLE();
+    }
+  };
+  using Key = std::pair<Cell::Hash, int>;
+  td::HashMap<Cell::Hash, Info> cells_;
+  td::HashMap<Key, Ref<Cell>> create_A_res_;
+  td::HashMap<Key, Ref<Cell>> create_D_res_;
+  td::HashSet<Key> visited_;
+
+  void load_cells(Ref<Cell> cell, int merkle_depth) {
+    if (!visited_.emplace(cell->get_hash(), merkle_depth).second) {
+      return;
+    }
+
+    auto &info = cells_[cell->get_hash(merkle_depth)];
+    CellSlice cs(NoVm(), cell);
+
+    // check if prunned cell is bounded
+    if (cs.special_type() == Cell::SpecialType::PrunnedBranch && static_cast<int>(cell->get_level()) > merkle_depth) {
+      info.prunned_cells_[cell->get_level() - 1] = std::move(cell);
+      return;
+    }
+
+    info.cell_ = std::move(cell);
+
+    auto child_merkle_depth = cs.child_merkle_depth(merkle_depth);
+    for (size_t i = 0, size = cs.size_refs(); i < size; i++) {
+      load_cells(cs.fetch_ref(), child_merkle_depth);
+    }
+  }
+
+  void mark_A(Ref<Cell> cell, int merkle_depth, CellUsageTree::NodeId node_id) {
+    CHECK(node_id != 0);
+
+    // cell in cache may be virtualized with different level
+    // so we make merkle_depth as small as possible
+    merkle_depth = cell->get_level_mask().apply(merkle_depth).get_level();
+
+    auto &info = cells_[cell->get_hash(merkle_depth)];
+    if (info.A_node_id != 0) {
+      return;
+    }
+    info.A_node_id = node_id;
+    if (info.cell_.is_null()) {
+      return;
+    }
+
+    CellSlice cs(NoVm(), info.cell_);
+    auto child_merkle_depth = cs.child_merkle_depth(merkle_depth);
+    for (int i = 0, size = cs.size_refs(); i < size; i++) {
+      mark_A(cs.fetch_ref(), child_merkle_depth, A_usage_tree_->create_child(node_id, i));
+    }
+  }
+
+  Ref<Cell> create_D(Ref<Cell> cell, int merkle_depth, int d_merkle_depth) {
+    merkle_depth = cell->get_level_mask().apply(merkle_depth).get_level();
+    auto key = Key(cell->get_hash(merkle_depth), d_merkle_depth);
+    auto it = create_D_res_.find(key);
+    if (it != create_D_res_.end()) {
+      return it->second;
+    }
+
+    auto res = do_create_D(std::move(cell), merkle_depth, d_merkle_depth);
+    if (res.is_null()) {
+      return {};
+    }
+    create_D_res_.emplace(key, res);
+    return res;
+  }
+
+  Ref<Cell> do_create_D(Ref<Cell> cell, int merkle_depth, int d_merkle_depth) {
+    auto &info = cells_[cell->get_hash(merkle_depth)];
+    if (info.A_node_id != 0) {
+      A_usage_tree_->mark_path(info.A_node_id);
+      Ref<Cell> res = info.get_prunned_cell(d_merkle_depth);
+      if (res.is_null()) {
+        res = CellBuilder::create_pruned_branch(info.get_any_cell(), d_merkle_depth + 1, merkle_depth);
+      }
+      return res;
+    }
+
+    if (info.cell_.is_null()) {
+      return {};
+    }
+
+    CellSlice cs(NoVm(), info.cell_);
+
+    if (cs.size_refs() == 0) {
+      return info.cell_;
+    }
+
+    auto child_merkle_depth = cs.child_merkle_depth(merkle_depth);
+    auto child_d_merkle_depth = cs.child_merkle_depth(d_merkle_depth);
+
+    CellBuilder cb;
+    cb.store_bits(cs.fetch_bits(cs.size()));
+    for (unsigned i = 0; i < cs.size_refs(); i++) {
+      auto ref = create_D(cs.prefetch_ref(i), child_merkle_depth, child_d_merkle_depth);
+      if (ref.is_null()) {
+        return {};
+      }
+      cb.store_ref(std::move(ref));
+    }
+    return cb.finalize(cs.is_special());
+  }
+
+  Ref<Cell> create_A(Ref<Cell> cell, int merkle_depth, int a_merkle_depth) {
+    merkle_depth = cell->get_level_mask().apply(merkle_depth).get_level();
+    auto key = Key(cell->get_hash(merkle_depth), a_merkle_depth);
+    auto it = create_A_res_.find(key);
+    if (it != create_A_res_.end()) {
+      return it->second;
+    }
+
+    auto res = do_create_A(std::move(cell), merkle_depth, a_merkle_depth);
+    create_A_res_.emplace(key, res);
+    return res;
+  }
+
+  Ref<Cell> do_create_A(Ref<Cell> cell, int merkle_depth, int a_merkle_depth) {
+    auto &info = cells_[cell->get_hash(merkle_depth)];
+
+    CHECK(info.A_node_id != 0);
+    if (!A_usage_tree_->has_mark(info.A_node_id)) {
+      Ref<Cell> res = info.get_prunned_cell(a_merkle_depth);
+      if (res.is_null()) {
+        res = CellBuilder::create_pruned_branch(info.get_any_cell(), a_merkle_depth + 1, merkle_depth);
+      }
+      return res;
+    }
+
+    CHECK(info.cell_.not_null());
+    CellSlice cs(NoVm(), info.cell_);
+
+    CHECK(cs.size_refs() != 0);
+    if (cs.size_refs() == 0) {
+      return info.cell_;
+    }
+
+    auto child_merkle_depth = cs.child_merkle_depth(merkle_depth);
+    auto child_a_merkle_depth = cs.child_merkle_depth(a_merkle_depth);
+
+    CellBuilder cb;
+    cb.store_bits(cs.fetch_bits(cs.size()));
+    for (unsigned i = 0; i < cs.size_refs(); i++) {
+      cb.store_ref(create_A(cs.prefetch_ref(i), child_merkle_depth, child_a_merkle_depth));
+    }
+    return cb.finalize(cs.is_special());
+  }
+
+  td::Result<std::pair<Ref<Cell>, Ref<Cell>>> unpack_update(Ref<Cell> update) const {
+    if (update->get_level() != 0) {
+      return td::Status::Error("level is not zero");
+    }
+    CellSlice cs(NoVm(), std::move(update));
+    if (cs.special_type() != Cell::SpecialType::MerkleUpdate) {
+      return td::Status::Error("Not a Merkle Update cell");
+    }
+    auto update_from = cs.fetch_ref();
+    auto update_to = cs.fetch_ref();
+    return std::make_pair(std::move(update_from), std::move(update_to));
+  }
+};
+}  // namespace detail
+
+Ref<Cell> MerkleUpdate::combine(Ref<Cell> ab, Ref<Cell> bc) {
+  detail::MerkleCombine combine(ab, bc);
+  auto res = combine.run();
+  if (res.is_error()) {
+    return {};
+  }
+  return res.move_as_ok();
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/MerkleUpdate.h b/submodules/ton/tonlib-src/crypto/vm/cells/MerkleUpdate.h
new file mode 100644
index 0000000000..2978ecc696
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/MerkleUpdate.h
@@ -0,0 +1,50 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cells/Cell.h"
+#include "vm/cells/CellSlice.h"
+#include "vm/cells/CellBuilder.h"
+
+#include "td/utils/Status.h"
+
+#include <utility>
+
+namespace vm {
+class MerkleUpdate {
+ public:
+  // from + update == to
+  static Ref<Cell> generate(Ref<Cell> from, Ref<Cell> to, CellUsageTree *usage_tree);
+  // Returns empty Ref<Cell> if something go wrong. If validate(from).is_ok() and may_apply(from, to).is_ok(), then it
+  // must not fail.
+  static Ref<Cell> apply(Ref<Cell> from, Ref<Cell> update);
+
+  // check if update is valid
+  static TD_WARN_UNUSED_RESULT td::Status validate(Ref<Cell> update);
+  // check that hash in from is same as hash stored in update. Do not validate update
+  static TD_WARN_UNUSED_RESULT td::Status may_apply(Ref<Cell> from, Ref<Cell> update);
+
+  static Ref<Cell> apply_raw(Ref<Cell> from, Ref<Cell> update_from, Ref<Cell> update_to, td::uint32 from_level,
+                             td::uint32 to_level);
+  static std::pair<Ref<Cell>, Ref<Cell>> generate_raw(Ref<Cell> from, Ref<Cell> to, CellUsageTree *usage_tree);
+  static td::Status validate_raw(Ref<Cell> update_from, Ref<Cell> update_to, td::uint32 from_level,
+                                 td::uint32 to_level);
+
+  static Ref<Cell> combine(Ref<Cell> ab, Ref<Cell> bc);
+};
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/PrunnedCell.h b/submodules/ton/tonlib-src/crypto/vm/cells/PrunnedCell.h
new file mode 100644
index 0000000000..caacf1f34f
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/PrunnedCell.h
@@ -0,0 +1,139 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cells/CellWithStorage.h"
+#include "vm/cells/Cell.h"
+
+namespace vm {
+struct PrunnedCellInfo {
+  Cell::LevelMask level_mask;
+  td::Slice hash;
+  td::Slice depth;
+};
+
+template <class ExtraT>
+class PrunnedCell : public Cell {
+ public:
+  const ExtraT& get_extra() const {
+    return extra_;
+  }
+
+  static td::Result<Ref<PrunnedCell<ExtraT>>> create(const PrunnedCellInfo& prunned_cell_info, ExtraT&& extra) {
+    auto level_mask = prunned_cell_info.level_mask;
+    if (level_mask.get_level() > max_level) {
+      return td::Status::Error("Level is too big");
+    }
+    Info info(level_mask);
+    auto prunned_cell =
+        detail::CellWithUniquePtrStorage<PrunnedCell<ExtraT>>::create(info.get_storage_size(), info, std::move(extra));
+    TRY_STATUS(prunned_cell->init(prunned_cell_info));
+    return Ref<PrunnedCell<ExtraT>>(prunned_cell.release(), typename Ref<PrunnedCell<ExtraT>>::acquire_t{});
+  }
+
+  LevelMask get_level_mask() const override {
+    return LevelMask(info_.level_mask_);
+  }
+
+ protected:
+  struct Info {
+    Info(LevelMask level_mask) {
+      level_mask_ = level_mask.get_mask() & 7;
+      hash_count_ = level_mask.get_hashes_count() & 7;
+    }
+    unsigned char level_mask_ : 3;
+    unsigned char hash_count_ : 3;
+    size_t get_hashes_offset() const {
+      return 0;
+    }
+    size_t get_depth_offset() const {
+      return get_hashes_offset() + hash_bytes * hash_count_;
+    }
+    size_t get_storage_size() const {
+      return get_depth_offset() + sizeof(td::uint16) * hash_count_;
+    }
+    const Hash* get_hashes(const char* storage) const {
+      return reinterpret_cast<const Hash*>(storage + get_hashes_offset());
+    }
+    Hash* get_hashes(char* storage) const {
+      return reinterpret_cast<Hash*>(storage + get_hashes_offset());
+    }
+    const td::uint16* get_depth(const char* storage) const {
+      return reinterpret_cast<const td::uint16*>(storage + get_depth_offset());
+    }
+    td::uint16* get_depth(char* storage) const {
+      return reinterpret_cast<td::uint16*>(storage + get_depth_offset());
+    }
+  };
+
+  Info info_;
+  ExtraT extra_;
+  virtual char* get_storage() = 0;
+  virtual const char* get_storage() const = 0;
+  void destroy_storage(char* storage) {
+    // noop
+  }
+
+  td::Status init(const PrunnedCellInfo& prunned_cell_info) {
+    auto storage = get_storage();
+    auto& new_hash = prunned_cell_info.hash;
+    auto* hash = info_.get_hashes(storage);
+    size_t n = prunned_cell_info.level_mask.get_hashes_count();
+    CHECK(new_hash.size() == n * hash_bytes);
+    for (td::uint32 i = 0; i < n; i++) {
+      hash[i].as_slice().copy_from(new_hash.substr(i * Cell::hash_bytes, Cell::hash_bytes));
+    }
+
+    auto& new_depth = prunned_cell_info.depth;
+    CHECK(new_depth.size() == n * depth_bytes);
+    auto* depth = info_.get_depth(storage);
+    for (td::uint32 i = 0; i < n; i++) {
+      depth[i] = DataCell::load_depth(new_depth.substr(i * Cell::depth_bytes, Cell::depth_bytes).ubegin());
+      if (depth[i] > max_depth) {
+        return td::Status::Error("Depth is too big");
+      }
+    }
+    return td::Status::OK();
+  }
+
+  explicit PrunnedCell(Info info, ExtraT&& extra) : info_(info), extra_(std::move(extra)) {
+  }
+  td::uint32 get_virtualization() const override {
+    return 0;
+  }
+  CellUsageTree::NodePtr get_tree_node() const override {
+    return {};
+  }
+  bool is_loaded() const override {
+    return false;
+  }
+
+ private:
+  const Hash do_get_hash(td::uint32 level) const override {
+    return info_.get_hashes(get_storage())[get_level_mask().apply(level).get_hash_i()];
+  }
+
+  td::uint16 do_get_depth(td::uint32 level) const override {
+    return info_.get_depth(get_storage())[get_level_mask().apply(level).get_hash_i()];
+  }
+
+  td::Result<LoadedCell> load_cell() const override {
+    return td::Status::Error("Can't load prunned branch");
+  }
+};
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/UsageCell.h b/submodules/ton/tonlib-src/crypto/vm/cells/UsageCell.h
new file mode 100644
index 0000000000..09defae21b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/UsageCell.h
@@ -0,0 +1,88 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cells/Cell.h"
+#include "vm/cells/CellUsageTree.h"
+
+namespace vm {
+class UsageCell : public Cell {
+ private:
+  struct PrivateTag {};
+
+ public:
+  UsageCell(Ref<Cell> cell, CellUsageTree::NodePtr tree_node, PrivateTag)
+      : cell_(std::move(cell)), tree_node_(std::move(tree_node)) {
+  }
+  static Ref<Cell> create(Ref<Cell> cell, CellUsageTree::NodePtr tree_node) {
+    if (tree_node.empty()) {
+      return cell;
+    }
+    return Ref<UsageCell>{true, std::move(cell), std::move(tree_node), PrivateTag{}};
+  }
+
+  // load interface
+  td::Result<LoadedCell> load_cell() const override {
+    TRY_RESULT(loaded_cell, cell_->load_cell());
+    if (tree_node_.on_load()) {
+      CHECK(loaded_cell.tree_node.empty());
+      loaded_cell.tree_node = tree_node_;
+    }
+    return std::move(loaded_cell);
+  }
+  Ref<Cell> virtualize(VirtualizationParameters virt) const override {
+    auto virtualized_cell = cell_->virtualize(virt);
+    if (tree_node_.empty()) {
+      return virtualized_cell;
+    }
+    if (virtualized_cell.get() == cell_.get()) {
+      return Ref<Cell>(this);
+    }
+    return create(std::move(virtualized_cell), tree_node_);
+  }
+
+  td::uint32 get_virtualization() const override {
+    return cell_->get_virtualization();
+  }
+
+  CellUsageTree::NodePtr get_tree_node() const override {
+    return tree_node_;
+  }
+
+  bool is_loaded() const override {
+    return cell_->is_loaded();
+  }
+
+  // hash and level
+  LevelMask get_level_mask() const override {
+    return cell_->get_level_mask();
+  }
+
+ protected:
+  const Hash do_get_hash(td::uint32 level) const override {
+    return cell_->get_hash(level);
+  }
+  td::uint16 do_get_depth(td::uint32 level) const override {
+    return cell_->get_depth(level);
+  }
+
+ private:
+  Ref<Cell> cell_;
+  CellUsageTree::NodePtr tree_node_;
+};
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/VirtualCell.h b/submodules/ton/tonlib-src/crypto/vm/cells/VirtualCell.h
new file mode 100644
index 0000000000..8b6a1ac4d7
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/VirtualCell.h
@@ -0,0 +1,87 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cells/Cell.h"
+
+namespace vm {
+class VirtualCell : public Cell {
+ private:
+  struct PrivateTag {};
+
+ public:
+  static Ref<Cell> create(VirtualizationParameters virt, Ref<Cell> cell) {
+    if (cell->get_level() <= virt.get_level()) {
+      return cell;
+    }
+    return Ref<VirtualCell>{true, virt, std::move(cell), PrivateTag{}};
+  }
+
+  VirtualCell(VirtualizationParameters virt, Ref<Cell> cell, PrivateTag) : virt_(virt), cell_(std::move(cell)) {
+    CHECK(cell_->get_virtualization() <= virt_.get_virtualization());
+  }
+
+  // load interface
+  td::Result<LoadedCell> load_cell() const override {
+    TRY_RESULT(loaded_cell, cell_->load_cell());
+    loaded_cell.virt = loaded_cell.virt.apply(virt_);
+    return std::move(loaded_cell);
+  }
+
+  Ref<Cell> virtualize(VirtualizationParameters virt) const override {
+    auto new_virt = virt_.apply(virt);
+    if (new_virt == virt_) {
+      return Ref<Cell>(this);
+    }
+    return create(new_virt, cell_);
+  }
+
+  td::uint32 get_virtualization() const override {
+    return virt_.get_virtualization();
+  }
+
+  CellUsageTree::NodePtr get_tree_node() const override {
+    return cell_->get_tree_node();
+  }
+
+  bool is_loaded() const override {
+    return cell_->is_loaded();
+  }
+
+  // hash and level
+  LevelMask get_level_mask() const override {
+    return cell_->get_level_mask().apply(virt_.get_level());
+  }
+
+ protected:
+  const Hash do_get_hash(td::uint32 level) const override {
+    return cell_->get_hash(fix_level(level));
+  }
+  td::uint16 do_get_depth(td::uint32 level) const override {
+    return cell_->get_depth(fix_level(level));
+  }
+
+ private:
+  VirtualizationParameters virt_;
+  Ref<Cell> cell_;
+
+  int fix_level(int level) const {
+    return get_level_mask().apply(level).get_level();
+  }
+};
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cells/VirtualizationParameters.h b/submodules/ton/tonlib-src/crypto/vm/cells/VirtualizationParameters.h
new file mode 100644
index 0000000000..b2a64ffb8a
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cells/VirtualizationParameters.h
@@ -0,0 +1,72 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/int_types.h"
+#include "td/utils/logging.h"
+
+#include <limits>
+
+namespace vm {
+namespace detail {
+class VirtualizationParameters {
+ public:
+  static constexpr td::uint8 max_level() {
+    return std::numeric_limits<td::uint8>::max();
+  }
+
+  VirtualizationParameters() = default;
+
+  VirtualizationParameters(td::uint8 level, td::uint8 virtualization) : level_(level), virtualization_(virtualization) {
+    CHECK(virtualization_ != 0 || empty());
+  }
+
+  bool empty() const {
+    return level_ == max_level() && virtualization_ == 0;
+  }
+
+  VirtualizationParameters apply(VirtualizationParameters outer) const {
+    if (outer.level_ >= level_) {
+      return *this;
+    }
+    CHECK(virtualization_ <= outer.virtualization_);
+    return {outer.level_, outer.virtualization_};
+  }
+
+  td::uint8 get_level() const {
+    return level_;
+  }
+
+  td::uint8 get_virtualization() const {
+    return virtualization_;
+  }
+
+  bool operator==(const VirtualizationParameters &other) const {
+    return level_ == other.level_ && virtualization_ == other.virtualization_;
+  }
+
+ private:
+  td::uint8 level_ = max_level();
+  td::uint8 virtualization_ = 0;
+};
+inline td::StringBuilder &operator<<(td::StringBuilder &sb, const VirtualizationParameters &virt) {
+  return sb << "{level: " << virt.get_level() << ", virtualization: " << virt.get_virtualization() << "}";
+}
+}  // namespace detail
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cellslice.h b/submodules/ton/tonlib-src/crypto/vm/cellslice.h
new file mode 100644
index 0000000000..4fe4dcc8cf
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cellslice.h
@@ -0,0 +1,19 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/cells/CellSlice.h"
diff --git a/submodules/ton/tonlib-src/crypto/vm/continuation.cpp b/submodules/ton/tonlib-src/crypto/vm/continuation.cpp
new file mode 100644
index 0000000000..24157d3b2a
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/continuation.cpp
@@ -0,0 +1,877 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/dispatch.h"
+#include "vm/continuation.h"
+#include "vm/dict.h"
+#include "vm/log.h"
+
+namespace vm {
+
+int Continuation::jump_w(VmState* st) & {
+  return static_cast<const Continuation*>(this)->jump(st);
+}
+
+bool Continuation::has_c0() const {
+  const ControlData* cont_data = get_cdata();
+  return cont_data && cont_data->save.c[0].not_null();
+}
+
+StackEntry ControlRegs::get(unsigned idx) const {
+  if (idx < creg_num) {
+    return get_c(idx);
+  } else if (idx >= dreg_idx && idx < dreg_idx + dreg_num) {
+    return get_d(idx);
+  } else if (idx == 7) {
+    return c7;
+  } else {
+    return {};
+  }
+}
+
+bool ControlRegs::set(unsigned idx, StackEntry value) {
+  if (idx < creg_num) {
+    auto v = std::move(value).as_cont();
+    return v.not_null() && set_c(idx, std::move(v));
+  } else if (idx >= dreg_idx && idx < dreg_idx + dreg_num) {
+    auto v = std::move(value).as_cell();
+    return v.not_null() && set_d(idx, std::move(v));
+  } else if (idx == 7) {
+    auto v = std::move(value).as_tuple();
+    return v.not_null() && set_c7(std::move(v));
+  } else {
+    return false;
+  }
+}
+
+bool ControlRegs::define(unsigned idx, StackEntry value) {
+  if (idx < creg_num) {
+    auto v = std::move(value).as_cont();
+    return v.not_null() && define_c(idx, std::move(v));
+  } else if (idx >= dreg_idx && idx < dreg_idx + dreg_num) {
+    auto v = std::move(value).as_cell();
+    return v.not_null() && define_d(idx, std::move(v));
+  } else if (idx == 7) {
+    auto v = std::move(value).as_tuple();
+    return v.not_null() && define_c7(std::move(v));
+  } else {
+    return false;
+  }
+}
+
+ControlRegs& ControlRegs::operator^=(const ControlRegs& save) {
+  for (int i = 0; i < creg_num; i++) {
+    c[i] ^= save.c[i];
+  }
+  for (int i = 0; i < dreg_num; i++) {
+    d[i] ^= save.d[i];
+  }
+  c7 ^= save.c7;
+  return *this;
+}
+
+ControlRegs& ControlRegs::operator^=(ControlRegs&& save) {
+  for (int i = 0; i < creg_num; i++) {
+    c[i] ^= std::move(save.c[i]);
+  }
+  for (int i = 0; i < dreg_num; i++) {
+    d[i] ^= std::move(save.d[i]);
+  }
+  c7 ^= std::move(save.c7);
+  return *this;
+}
+
+ControlRegs& ControlRegs::operator&=(const ControlRegs& save) {
+  for (int i = 0; i < creg_num; i++) {
+    c[i] &= save.c[i].is_null();
+  }
+  for (int i = 0; i < dreg_num; i++) {
+    d[i] &= save.d[i].is_null();
+  }
+  c7 &= save.c7.is_null();
+  return *this;
+}
+
+int ExcQuitCont::jump(VmState* st) const & {
+  int n = 0;
+  try {
+    n = st->get_stack().pop_smallint_range(0xffff);
+  } catch (const VmError& vme) {
+    n = vme.get_errno();
+  }
+  VM_LOG(st) << "default exception handler, terminating vm with exit code " << n;
+  return ~n;
+}
+
+int PushIntCont::jump(VmState* st) const & {
+  VM_LOG(st) << "execute implicit PUSH " << push_val << " (slow)";
+  st->get_stack().push_smallint(push_val);
+  return st->jump(next);
+}
+
+int PushIntCont::jump_w(VmState* st) & {
+  VM_LOG(st) << "execute implicit PUSH " << push_val;
+  st->get_stack().push_smallint(push_val);
+  return st->jump(std::move(next));
+}
+
+int ArgContExt::jump(VmState* st) const & {
+  st->adjust_cr(data.save);
+  if (data.cp != -1) {
+    st->force_cp(data.cp);
+  }
+  return ext->jump(st);
+}
+
+int ArgContExt::jump_w(VmState* st) & {
+  st->adjust_cr(std::move(data.save));
+  if (data.cp != -1) {
+    st->force_cp(data.cp);
+  }
+  return st->jump_to(std::move(ext));
+}
+
+int RepeatCont::jump(VmState* st) const & {
+  VM_LOG(st) << "repeat " << count << " more times (slow)\n";
+  if (count <= 0) {
+    return st->jump(after);
+  }
+  if (body->has_c0()) {
+    return st->jump(body);
+  }
+  st->set_c0(Ref<RepeatCont>{true, body, after, count - 1});
+  return st->jump(body);
+}
+
+int RepeatCont::jump_w(VmState* st) & {
+  VM_LOG(st) << "repeat " << count << " more times\n";
+  if (count <= 0) {
+    body.clear();
+    return st->jump(std::move(after));
+  }
+  if (body->has_c0()) {
+    after.clear();
+    return st->jump(std::move(body));
+  }
+  // optimization: since this is unique, reuse *this instead of creating new object
+  --count;
+  st->set_c0(Ref<RepeatCont>{this});
+  return st->jump(body);
+}
+
+int VmState::repeat(Ref<Continuation> body, Ref<Continuation> after, long long count) {
+  if (count <= 0) {
+    body.clear();
+    return jump(std::move(after));
+  } else {
+    return jump(Ref<RepeatCont>{true, std::move(body), std::move(after), count});
+  }
+}
+
+int AgainCont::jump(VmState* st) const & {
+  VM_LOG(st) << "again an infinite loop iteration (slow)\n";
+  if (!body->has_c0()) {
+    st->set_c0(Ref<AgainCont>{this});
+  }
+  return st->jump(body);
+}
+
+int AgainCont::jump_w(VmState* st) & {
+  VM_LOG(st) << "again an infinite loop iteration\n";
+  if (!body->has_c0()) {
+    st->set_c0(Ref<AgainCont>{this});
+    return st->jump(body);
+  } else {
+    return st->jump(std::move(body));
+  }
+}
+
+int VmState::again(Ref<Continuation> body) {
+  return jump(Ref<AgainCont>{true, std::move(body)});
+}
+
+int UntilCont::jump(VmState* st) const & {
+  VM_LOG(st) << "until loop body end (slow)\n";
+  if (st->get_stack().pop_bool()) {
+    VM_LOG(st) << "until loop terminated\n";
+    return st->jump(after);
+  }
+  if (!body->has_c0()) {
+    st->set_c0(Ref<UntilCont>{this});
+  }
+  return st->jump(body);
+}
+
+int UntilCont::jump_w(VmState* st) & {
+  VM_LOG(st) << "until loop body end\n";
+  if (st->get_stack().pop_bool()) {
+    VM_LOG(st) << "until loop terminated\n";
+    body.clear();
+    return st->jump(std::move(after));
+  }
+  if (!body->has_c0()) {
+    st->set_c0(Ref<UntilCont>{this});
+    return st->jump(body);
+  } else {
+    after.clear();
+    return st->jump(std::move(body));
+  }
+}
+
+int VmState::until(Ref<Continuation> body, Ref<Continuation> after) {
+  if (!body->has_c0()) {
+    set_c0(Ref<UntilCont>{true, body, std::move(after)});
+  }
+  return jump(std::move(body));
+}
+
+int WhileCont::jump(VmState* st) const & {
+  if (chkcond) {
+    VM_LOG(st) << "while loop condition end (slow)\n";
+    if (!st->get_stack().pop_bool()) {
+      VM_LOG(st) << "while loop terminated\n";
+      return st->jump(after);
+    }
+    if (!body->has_c0()) {
+      st->set_c0(Ref<WhileCont>{true, cond, body, after, false});
+    }
+    return st->jump(body);
+  } else {
+    VM_LOG(st) << "while loop body end (slow)\n";
+    if (!cond->has_c0()) {
+      st->set_c0(Ref<WhileCont>{true, cond, body, after, true});
+    }
+    return st->jump(cond);
+  }
+}
+
+int WhileCont::jump_w(VmState* st) & {
+  if (chkcond) {
+    VM_LOG(st) << "while loop condition end\n";
+    if (!st->get_stack().pop_bool()) {
+      VM_LOG(st) << "while loop terminated\n";
+      cond.clear();
+      body.clear();
+      return st->jump(std::move(after));
+    }
+    if (!body->has_c0()) {
+      chkcond = false;  // re-use current object since we hold the unique pointer to it
+      st->set_c0(Ref<WhileCont>{this});
+      return st->jump(body);
+    } else {
+      cond.clear();
+      after.clear();
+      return st->jump(std::move(body));
+    }
+  } else {
+    VM_LOG(st) << "while loop body end\n";
+    if (!cond->has_c0()) {
+      chkcond = true;  // re-use current object
+      st->set_c0(Ref<WhileCont>{this});
+      return st->jump(cond);
+    } else {
+      body.clear();
+      after.clear();
+      return st->jump(std::move(cond));
+    }
+  }
+}
+
+int VmState::loop_while(Ref<Continuation> cond, Ref<Continuation> body, Ref<Continuation> after) {
+  if (!cond->has_c0()) {
+    set_c0(Ref<WhileCont>{true, cond, std::move(body), std::move(after), true});
+  }
+  return jump(std::move(cond));
+}
+
+int OrdCont::jump(VmState* st) const & {
+  st->adjust_cr(data.save);
+  st->set_code(code, data.cp);
+  return 0;
+}
+
+int OrdCont::jump_w(VmState* st) & {
+  st->adjust_cr(std::move(data.save));
+  st->set_code(std::move(code), data.cp);
+  return 0;
+}
+
+void VmState::init_cregs(bool same_c3, bool push_0) {
+  cr.set_c0(quit0);
+  cr.set_c1(quit1);
+  cr.set_c2(Ref<ExcQuitCont>{true});
+  if (same_c3) {
+    cr.set_c3(Ref<OrdCont>{true, code, cp});
+    if (push_0) {
+      VM_LOG(this) << "implicit PUSH 0 at start\n";
+      get_stack().push_smallint(0);
+    }
+  } else {
+    cr.set_c3(Ref<QuitCont>{true, 11});
+  }
+  if (cr.d[0].is_null() || cr.d[1].is_null()) {
+    auto empty_cell = CellBuilder{}.finalize();
+    for (int i = 0; i < ControlRegs::dreg_num; i++) {
+      if (cr.d[i].is_null()) {
+        cr.d[i] = empty_cell;
+      }
+    }
+  }
+  if (cr.c7.is_null()) {
+    cr.set_c7(Ref<Tuple>{true});
+  }
+}
+
+VmState::VmState() : cp(-1), dispatch(&dummy_dispatch_table), quit0(true, 0), quit1(true, 1) {
+  ensure_throw(init_cp(0));
+  init_cregs();
+}
+
+VmState::VmState(Ref<CellSlice> _code)
+    : code(std::move(_code)), cp(-1), dispatch(&dummy_dispatch_table), quit0(true, 0), quit1(true, 1) {
+  ensure_throw(init_cp(0));
+  init_cregs();
+}
+
+VmState::VmState(Ref<CellSlice> _code, Ref<Stack> _stack, int flags, Ref<Cell> _data, VmLog log,
+                 std::vector<Ref<Cell>> _libraries)
+    : code(std::move(_code))
+    , stack(std::move(_stack))
+    , cp(-1)
+    , dispatch(&dummy_dispatch_table)
+    , quit0(true, 0)
+    , quit1(true, 1)
+    , log(log)
+    , libraries(std::move(_libraries)) {
+  ensure_throw(init_cp(0));
+  set_c4(std::move(_data));
+  init_cregs(flags & 1, flags & 2);
+}
+
+VmState::VmState(Ref<CellSlice> _code, Ref<Stack> _stack, const GasLimits& gas, int flags, Ref<Cell> _data, VmLog log,
+                 std::vector<Ref<Cell>> _libraries)
+    : code(std::move(_code))
+    , stack(std::move(_stack))
+    , cp(-1)
+    , dispatch(&dummy_dispatch_table)
+    , quit0(true, 0)
+    , quit1(true, 1)
+    , log(log)
+    , gas(gas)
+    , libraries(std::move(_libraries)) {
+  ensure_throw(init_cp(0));
+  set_c4(std::move(_data));
+  init_cregs(flags & 1, flags & 2);
+}
+
+Ref<CellSlice> VmState::convert_code_cell(Ref<Cell> code_cell) {
+  if (code_cell.is_null()) {
+    return {};
+  }
+  Ref<CellSlice> csr{true, NoVmOrd(), code_cell};
+  if (csr->is_valid()) {
+    return csr;
+  }
+  return load_cell_slice_ref(CellBuilder{}.store_ref(std::move(code_cell)).finalize());
+}
+
+bool VmState::init_cp(int new_cp) {
+  const DispatchTable* dt = DispatchTable::get_table(new_cp);
+  if (dt) {
+    cp = new_cp;
+    dispatch = dt;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+bool VmState::set_cp(int new_cp) {
+  return new_cp == cp || init_cp(new_cp);
+}
+
+void VmState::force_cp(int new_cp) {
+  if (!set_cp(new_cp)) {
+    throw VmError{Excno::inv_opcode, "unsupported codepage"};
+  }
+}
+
+// simple call to a continuation cont
+int VmState::call(Ref<Continuation> cont) {
+  const ControlData* cont_data = cont->get_cdata();
+  if (cont_data) {
+    if (cont_data->save.c[0].not_null()) {
+      // call reduces to a jump
+      return jump(std::move(cont));
+    }
+    if (cont_data->stack.not_null() || cont_data->nargs >= 0) {
+      // if cont has non-empty stack or expects fixed number of arguments, call is not simple
+      return call(std::move(cont), -1, -1);
+    }
+    // create return continuation, to be stored into new c0
+    Ref<OrdCont> ret = Ref<OrdCont>{true, std::move(code), cp};
+    ret.unique_write().get_cdata()->save.set_c0(std::move(cr.c[0]));
+    cr.set_c0(
+        std::move(ret));  // set c0 to its final value before switching to cont; notice that cont.save.c0 is not set
+    return jump_to(std::move(cont));
+  }
+  // create return continuation, to be stored into new c0
+  Ref<OrdCont> ret = Ref<OrdCont>{true, std::move(code), cp};
+  ret.unique_write().get_cdata()->save.set_c0(std::move(cr.c[0]));
+  // general implementation of a simple call
+  cr.set_c0(std::move(ret));  // set c0 to its final value before switching to cont; notice that cont.save.c0 is not set
+  return jump_to(std::move(cont));
+}
+
+// call with parameters to continuation cont
+int VmState::call(Ref<Continuation> cont, int pass_args, int ret_args) {
+  const ControlData* cont_data = cont->get_cdata();
+  if (cont_data) {
+    if (cont_data->save.c[0].not_null()) {
+      // call reduces to a jump
+      return jump(std::move(cont), pass_args);
+    }
+    int depth = stack->depth();
+    if (pass_args > depth || cont_data->nargs > depth) {
+      throw VmError{Excno::stk_und, "stack underflow while calling a continuation: not enough arguments on stack"};
+    }
+    if (cont_data->nargs > pass_args && pass_args >= 0) {
+      throw VmError{Excno::stk_und,
+                    "stack underflow while calling a closure continuation: not enough arguments passed"};
+    }
+    auto old_c0 = std::move(cr.c[0]);
+    // optimization(?): decrease refcnts of unused continuations in c[i] as early as possible
+    preclear_cr(cont_data->save);
+    // no exceptions should be thrown after this point
+    int copy = cont_data->nargs, skip = 0;
+    if (pass_args >= 0) {
+      if (copy >= 0) {
+        skip = pass_args - copy;
+      } else {
+        copy = pass_args;
+      }
+    }
+    // copy=-1 : pass whole stack, else pass top `copy` elements, drop next `skip` elements.
+    Ref<Stack> new_stk;
+    if (cont_data->stack.not_null() && !cont_data->stack->is_empty()) {
+      // `cont` already has a stack, create resulting stack from it
+      if (copy < 0) {
+        copy = stack->depth();
+      }
+      if (cont->is_unique()) {
+        // optimization: avoid copying stack if we hold the only copy of `cont`
+        new_stk = std::move(cont.unique_write().get_cdata()->stack);
+      } else {
+        new_stk = cont_data->stack;
+      }
+      new_stk.write().move_from_stack(get_stack(), copy);
+      if (skip > 0) {
+        get_stack().pop_many(skip);
+      }
+    } else if (copy >= 0) {
+      new_stk = get_stack().split_top(copy, skip);
+    } else {
+      new_stk = std::move(stack);
+      stack.clear();
+    }
+    // create return continuation using the remainder of current stack
+    Ref<OrdCont> ret = Ref<OrdCont>{true, std::move(code), cp, std::move(stack), ret_args};
+    ret.unique_write().get_cdata()->save.set_c0(std::move(old_c0));
+    Ref<OrdCont> ord_cont = static_cast<Ref<OrdCont>>(cont);
+    set_stack(std::move(new_stk));
+    cr.set_c0(std::move(ret));  // ??? if codepage of code in ord_cont is unknown, will end up with incorrect c0
+    return jump_to(std::move(cont));
+  } else {
+    // have no continuation data, situation is somewhat simpler
+    int depth = stack->depth();
+    if (pass_args > depth) {
+      throw VmError{Excno::stk_und, "stack underflow while calling a continuation: not enough arguments on stack"};
+    }
+    // create new stack from the top `pass_args` elements of the current stack
+    Ref<Stack> new_stk = (pass_args >= 0 ? get_stack().split_top(pass_args) : std::move(stack));
+    // create return continuation using the remainder of the current stack
+    Ref<OrdCont> ret = Ref<OrdCont>{true, std::move(code), cp, std::move(stack), ret_args};
+    ret.unique_write().get_cdata()->save.set_c0(std::move(cr.c[0]));
+    set_stack(std::move(new_stk));
+    cr.set_c0(std::move(ret));  // ??? if codepage of code in ord_cont is unknown, will end up with incorrect c0
+    return jump_to(std::move(cont));
+  }
+}
+
+// simple jump to continuation cont
+int VmState::jump(Ref<Continuation> cont) {
+  const ControlData* cont_data = cont->get_cdata();
+  if (cont_data && (cont_data->stack.not_null() || cont_data->nargs >= 0)) {
+    // if cont has non-empty stack or expects fixed number of arguments, jump is not simple
+    return jump(std::move(cont), -1);
+  } else {
+    return jump_to(std::move(cont));
+  }
+}
+
+// general jump to continuation cont
+int VmState::jump(Ref<Continuation> cont, int pass_args) {
+  const ControlData* cont_data = cont->get_cdata();
+  if (cont_data) {
+    // first do the checks
+    int depth = stack->depth();
+    if (pass_args > depth || cont_data->nargs > depth) {
+      throw VmError{Excno::stk_und, "stack underflow while jumping to a continuation: not enough arguments on stack"};
+    }
+    if (cont_data->nargs > pass_args && pass_args >= 0) {
+      throw VmError{Excno::stk_und,
+                    "stack underflow while jumping to closure continuation: not enough arguments passed"};
+    }
+    // optimization(?): decrease refcnts of unused continuations in c[i] as early as possible
+    preclear_cr(cont_data->save);
+    // no exceptions should be thrown after this point
+    int copy = cont_data->nargs;
+    if (pass_args >= 0 && copy < 0) {
+      copy = pass_args;
+    }
+    // copy=-1 : pass whole stack, else pass top `copy` elements, drop the remainder.
+    if (cont_data->stack.not_null() && !cont_data->stack->is_empty()) {
+      // `cont` already has a stack, create resulting stack from it
+      if (copy < 0) {
+        copy = get_stack().depth();
+      }
+      Ref<Stack> new_stk;
+      if (cont->is_unique()) {
+        // optimization: avoid copying the stack if we hold the only copy of `cont`
+        new_stk = std::move(cont.unique_write().get_cdata()->stack);
+      } else {
+        new_stk = cont_data->stack;
+      }
+      new_stk.write().move_from_stack(get_stack(), copy);
+      set_stack(std::move(new_stk));
+    } else {
+      if (copy >= 0) {
+        get_stack().drop_bottom(stack->depth() - copy);
+      }
+    }
+    return jump_to(std::move(cont));
+  } else {
+    // have no continuation data, situation is somewhat simpler
+    if (pass_args >= 0) {
+      int depth = get_stack().depth();
+      if (pass_args > depth) {
+        throw VmError{Excno::stk_und, "stack underflow while jumping to a continuation: not enough arguments on stack"};
+      }
+      get_stack().drop_bottom(depth - pass_args);
+    }
+    return jump_to(std::move(cont));
+  }
+}
+
+int VmState::ret() {
+  Ref<Continuation> cont = quit0;
+  cont.swap(cr.c[0]);
+  return jump(std::move(cont));
+}
+
+int VmState::ret(int ret_args) {
+  Ref<Continuation> cont = quit0;
+  cont.swap(cr.c[0]);
+  return jump(std::move(cont), ret_args);
+}
+
+int VmState::ret_alt() {
+  Ref<Continuation> cont = quit1;
+  cont.swap(cr.c[1]);
+  return jump(std::move(cont));
+}
+
+int VmState::ret_alt(int ret_args) {
+  Ref<Continuation> cont = quit1;
+  cont.swap(cr.c[1]);
+  return jump(std::move(cont), ret_args);
+}
+
+Ref<OrdCont> VmState::extract_cc(int save_cr, int stack_copy, int cc_args) {
+  Ref<Stack> new_stk;
+  if (stack_copy < 0 || stack_copy == stack->depth()) {
+    new_stk = std::move(stack);
+    stack.clear();
+  } else if (stack_copy > 0) {
+    stack->check_underflow(stack_copy);
+    new_stk = get_stack().split_top(stack_copy);
+  } else {
+    new_stk = Ref<Stack>{true};
+  }
+  Ref<OrdCont> cc = Ref<OrdCont>{true, std::move(code), cp, std::move(stack), cc_args};
+  stack = std::move(new_stk);
+  if (save_cr & 7) {
+    ControlData* cdata = cc.unique_write().get_cdata();
+    if (save_cr & 1) {
+      cdata->save.set_c0(std::move(cr.c[0]));
+      cr.set_c0(quit0);
+    }
+    if (save_cr & 2) {
+      cdata->save.set_c1(std::move(cr.c[1]));
+      cr.set_c1(quit1);
+    }
+    if (save_cr & 4) {
+      cdata->save.set_c2(std::move(cr.c[2]));
+      // cr.set_c2(Ref<ExcQuitCont>{true});
+    }
+  }
+  return cc;
+}
+
+int VmState::throw_exception(int excno) {
+  Stack& stack_ref = get_stack();
+  stack_ref.clear();
+  stack_ref.push_smallint(0);
+  stack_ref.push_smallint(excno);
+  code.clear();
+  consume_gas(exception_gas_price);
+  return jump(get_c2());
+}
+
+int VmState::throw_exception(int excno, StackEntry&& arg) {
+  Stack& stack_ref = get_stack();
+  stack_ref.clear();
+  stack_ref.push(std::move(arg));
+  stack_ref.push_smallint(excno);
+  code.clear();
+  consume_gas(exception_gas_price);
+  return jump(get_c2());
+}
+
+void GasLimits::gas_exception() const {
+  throw VmNoGas{};
+}
+
+void GasLimits::set_limits(long long _max, long long _limit, long long _credit) {
+  gas_max = _max;
+  gas_limit = _limit;
+  gas_credit = _credit;
+  change_base(_limit + _credit);
+}
+
+void GasLimits::change_limit(long long _limit) {
+  _limit = std::min(std::max(_limit, 0LL), gas_max);
+  gas_credit = 0;
+  gas_limit = _limit;
+  change_base(_limit);
+}
+
+bool VmState::set_gas_limits(long long _max, long long _limit, long long _credit) {
+  gas.set_limits(_max, _limit, _credit);
+  return true;
+}
+
+void VmState::change_gas_limit(long long new_limit) {
+  VM_LOG(this) << "changing gas limit to " << std::min(new_limit, gas.gas_max);
+  gas.change_limit(new_limit);
+}
+
+int VmState::step() {
+  assert(!code.is_null());
+  //VM_LOG(st) << "stack:";  stack->dump(VM_LOG(st));
+  //VM_LOG(st) << "; cr0.refcnt = " << get_c0()->get_refcnt() - 1 << std::endl;
+  if (stack_trace) {
+    stack->dump(std::cerr);
+  }
+  ++steps;
+  if (code->size()) {
+    return dispatch->dispatch(this, code.write());
+  } else if (code->size_refs()) {
+    VM_LOG(this) << "execute implicit JMPREF\n";
+    Ref<Continuation> cont = Ref<OrdCont>{true, load_cell_slice_ref(code->prefetch_ref()), get_cp()};
+    return jump(std::move(cont));
+  } else {
+    VM_LOG(this) << "execute implicit RET\n";
+    return ret();
+  }
+}
+
+int VmState::run() {
+  int res;
+  Guard guard(this);
+  do {
+    // LOG(INFO) << "[BS] data cells: " << DataCell::get_total_data_cells();
+    try {
+      try {
+        res = step();
+        gas.check();
+      } catch (vm::CellBuilder::CellWriteError) {
+        throw VmError{Excno::cell_ov};
+      } catch (vm::CellBuilder::CellCreateError) {
+        throw VmError{Excno::cell_ov};
+      } catch (vm::CellSlice::CellReadError) {
+        throw VmError{Excno::cell_und};
+      }
+    } catch (const VmError& vme) {
+      VM_LOG(this) << "handling exception code " << vme.get_errno() << ": " << vme.get_msg();
+      try {
+        // LOG(INFO) << "[EX] data cells: " << DataCell::get_total_data_cells();
+        ++steps;
+        res = throw_exception(vme.get_errno());
+      } catch (const VmError& vme2) {
+        VM_LOG(this) << "exception " << vme2.get_errno() << " while handling exception: " << vme.get_msg();
+        // LOG(INFO) << "[EXX] data cells: " << DataCell::get_total_data_cells();
+        return ~vme2.get_errno();
+      }
+    } catch (VmNoGas vmoog) {
+      ++steps;
+      VM_LOG(this) << "unhandled out-of-gas exception: gas consumed=" << gas.gas_consumed()
+                   << ", limit=" << gas.gas_limit;
+      get_stack().clear();
+      get_stack().push_smallint(gas.gas_consumed());
+      return vmoog.get_errno();  // no ~ for unhandled exceptions (to make their faking impossible)
+    }
+  } while (!res);
+  // LOG(INFO) << "[EN] data cells: " << DataCell::get_total_data_cells();
+  return res;
+}
+
+ControlData* force_cdata(Ref<Continuation>& cont) {
+  if (!cont->get_cdata()) {
+    cont = Ref<ArgContExt>{true, cont};
+    return cont.unique_write().get_cdata();
+  } else {
+    return cont.write().get_cdata();
+  }
+}
+
+ControlRegs* force_cregs(Ref<Continuation>& cont) {
+  return &force_cdata(cont)->save;
+}
+
+int run_vm_code(Ref<CellSlice> code, Ref<Stack>& stack, int flags, Ref<Cell>* data_ptr, VmLog log, long long* steps,
+                GasLimits* gas_limits, std::vector<Ref<Cell>> libraries) {
+  VmState vm{
+      code, std::move(stack),    gas_limits ? *gas_limits : GasLimits{}, flags, data_ptr ? *data_ptr : Ref<Cell>{},
+      log,  std::move(libraries)};
+  int res = vm.run();
+  stack = vm.get_stack_ref();
+  if (res == -1 && data_ptr) {
+    *data_ptr = vm.get_c4();
+  }
+  if (steps) {
+    *steps = vm.get_steps_count();
+  }
+  if (gas_limits) {
+    *gas_limits = vm.get_gas_limits();
+    LOG(INFO) << "steps: " << vm.get_steps_count() << " gas: used=" << gas_limits->gas_consumed()
+              << ", max=" << gas_limits->gas_max << ", limit=" << gas_limits->gas_limit
+              << ", credit=" << gas_limits->gas_credit;
+  }
+  if ((vm.get_log().log_mask & vm::VmLog::DumpStack) != 0) {
+    VM_LOG(&vm) << "BEGIN_STACK_DUMP";
+    for (int i = stack->depth(); i > 0; i--) {
+      VM_LOG(&vm) << (*stack)[i - 1].to_string();
+    }
+    VM_LOG(&vm) << "END_STACK_DUMP";
+  }
+
+  return ~res;
+}
+
+int run_vm_code(Ref<CellSlice> code, Stack& stack, int flags, Ref<Cell>* data_ptr, VmLog log, long long* steps,
+                GasLimits* gas_limits, std::vector<Ref<Cell>> libraries) {
+  Ref<Stack> stk{true};
+  stk.unique_write().set_contents(std::move(stack));
+  stack.clear();
+  int res = run_vm_code(code, stk, flags, data_ptr, log, steps, gas_limits, std::move(libraries));
+  CHECK(stack.is_unique());
+  if (stk.is_null()) {
+    stack.clear();
+  } else if (&(*stk) != &stack) {
+    VmState* st = nullptr;
+    if (stk->is_unique()) {
+      VM_LOG(st) << "move resulting stack (" << stk->depth() << " entries)";
+      stack.set_contents(std::move(stk.unique_write()));
+    } else {
+      VM_LOG(st) << "copying resulting stack (" << stk->depth() << " entries)";
+      stack.set_contents(*stk);
+    }
+  }
+  return res;
+}
+
+// may throw a dictionary exception; returns nullptr if library is not found in context
+Ref<Cell> VmState::load_library(td::ConstBitPtr hash) {
+  std::unique_ptr<VmStateInterface> tmp_ctx;
+  // install temporary dummy vm state interface to prevent charging for cell load operations during library lookup
+  VmStateInterface::Guard(tmp_ctx.get());
+  for (const auto& lib_collection : libraries) {
+    auto lib = lookup_library_in(hash, lib_collection);
+    if (lib.not_null()) {
+      return lib;
+    }
+  }
+  return {};
+}
+
+bool VmState::register_library_collection(Ref<Cell> lib) {
+  if (lib.is_null()) {
+    return true;
+  }
+  libraries.push_back(std::move(lib));
+  return true;
+}
+
+void VmState::register_cell_load() {
+  consume_gas(cell_load_gas_price);
+}
+
+void VmState::register_cell_create() {
+  consume_gas(cell_create_gas_price);
+}
+
+td::BitArray<256> VmState::get_state_hash() const {
+  // TODO: implement properly, by serializing the stack etc, and computing the Merkle hash
+  td::BitArray<256> res;
+  res.clear();
+  return res;
+}
+
+td::BitArray<256> VmState::get_final_state_hash(int exit_code) const {
+  // TODO: implement properly, by serializing the stack etc, and computing the Merkle hash
+  td::BitArray<256> res;
+  res.clear();
+  return res;
+}
+
+Ref<vm::Cell> lookup_library_in(td::ConstBitPtr key, vm::Dictionary& dict) {
+  try {
+    auto val = dict.lookup(key, 256);
+    if (val.is_null() || !val->have_refs()) {
+      return {};
+    }
+    auto root = val->prefetch_ref();
+    if (root.not_null() && !root->get_hash().bits().compare(key, 256)) {
+      return root;
+    }
+    return {};
+  } catch (vm::VmError) {
+    return {};
+  }
+}
+
+Ref<vm::Cell> lookup_library_in(td::ConstBitPtr key, Ref<vm::Cell> lib_root) {
+  if (lib_root.is_null()) {
+    return lib_root;
+  }
+  vm::Dictionary dict{std::move(lib_root), 256};
+  return lookup_library_in(key, dict);
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/continuation.h b/submodules/ton/tonlib-src/crypto/vm/continuation.h
new file mode 100644
index 0000000000..80f19e156d
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/continuation.h
@@ -0,0 +1,585 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "common/refcnt.hpp"
+#include "vm/cellslice.h"
+#include "vm/stack.hpp"
+#include "vm/vmstate.h"
+#include "vm/log.h"
+
+namespace vm {
+
+using td::Ref;
+
+class VmState;
+class Continuation;
+class DispatchTable;
+
+struct ControlRegs {
+  static constexpr int creg_num = 4, dreg_num = 2, dreg_idx = 4;
+  Ref<Continuation> c[creg_num];  // c0..c3
+  Ref<Cell> d[dreg_num];          // c4..c5
+  Ref<Tuple> c7;                  // c7
+  Ref<Continuation> get_c(unsigned idx) const {
+    return idx < creg_num ? c[idx] : Ref<Continuation>{};
+  }
+  Ref<Cell> get_d(unsigned idx) const {
+    idx -= dreg_idx;
+    return idx < dreg_num ? d[idx] : Ref<Cell>{};
+  }
+  Ref<Tuple> get_c7() const {
+    return c7;
+  }
+  StackEntry get(unsigned idx) const;
+  static bool valid_idx(unsigned idx) {
+    return idx < creg_num || (idx >= dreg_idx && idx < dreg_idx + dreg_num) || idx == 7;
+  }
+  void set_c0(Ref<Continuation> cont) {
+    c[0] = std::move(cont);
+  }
+  void set_c1(Ref<Continuation> cont) {
+    c[1] = std::move(cont);
+  }
+  void set_c2(Ref<Continuation> cont) {
+    c[2] = std::move(cont);
+  }
+  void set_c3(Ref<Continuation> cont) {
+    c[3] = std::move(cont);
+  }
+  void set_c4(Ref<Cell> cell) {
+    d[0] = std::move(cell);
+  }
+  bool set_c(unsigned idx, Ref<Continuation> cont) {
+    if (idx < creg_num) {
+      c[idx] = std::move(cont);
+      return true;
+    } else {
+      return false;
+    }
+  }
+  bool set_d(unsigned idx, Ref<Cell> cell) {
+    idx -= dreg_idx;
+    if (idx < dreg_num) {
+      d[idx] = std::move(cell);
+      return true;
+    } else {
+      return false;
+    }
+  }
+  bool set_c7(Ref<Tuple> tuple) {
+    c7 = std::move(tuple);
+    return true;
+  }
+  bool set(unsigned idx, StackEntry value);
+  void define_c0(Ref<Continuation> cont) {
+    if (c[0].is_null()) {
+      c[0] = std::move(cont);
+    }
+  }
+  void define_c1(Ref<Continuation> cont) {
+    if (c[1].is_null()) {
+      c[1] = std::move(cont);
+    }
+  }
+  void define_c2(Ref<Continuation> cont) {
+    if (c[2].is_null()) {
+      c[2] = std::move(cont);
+    }
+  }
+  bool define_c(unsigned idx, Ref<Continuation> cont) {
+    if (idx < creg_num && c[idx].is_null()) {
+      c[idx] = std::move(cont);
+      return true;
+    } else {
+      return false;
+    }
+  }
+  bool define_d(unsigned idx, Ref<Cell> cell) {
+    idx -= dreg_idx;
+    if (idx < dreg_num && d[idx].is_null()) {
+      d[idx] = std::move(cell);
+      return true;
+    } else {
+      return false;
+    }
+  }
+  void define_c4(Ref<Cell> cell) {
+    if (d[0].is_null()) {
+      d[0] = std::move(cell);
+    }
+  }
+  bool define_c7(Ref<Tuple> tuple) {
+    if (c7.is_null()) {
+      c7 = std::move(tuple);
+    }
+    return true;
+  }
+  bool define(unsigned idx, StackEntry value);
+  ControlRegs& operator&=(const ControlRegs& save);  // clears all c[i]'s which are present in save
+  ControlRegs& operator^=(const ControlRegs& save);  // sets c[i]=save.c[i] for all save.c[i] != 0
+  ControlRegs& operator^=(ControlRegs&& save);
+};
+
+struct ControlData {
+  Ref<Stack> stack;
+  ControlRegs save;
+  int nargs;
+  int cp;
+  ControlData() : nargs(-1), cp(-1) {
+  }
+  ControlData(int _cp) : nargs(-1), cp(_cp) {
+  }
+  ControlData(Ref<Stack> _stack) : stack(std::move(_stack)), nargs(-1), cp(-1) {
+  }
+  ControlData(int _cp, Ref<Stack> _stack, int _nargs = -1) : stack(std::move(_stack)), nargs(_nargs), cp(_cp) {
+  }
+};
+
+class Continuation : public td::CntObject {
+ public:
+  virtual int jump(VmState* st) const & = 0;
+  virtual int jump_w(VmState* st) &;
+  virtual ControlData* get_cdata() {
+    return 0;
+  }
+  virtual const ControlData* get_cdata() const {
+    return 0;
+  }
+  bool has_c0() const;
+  Continuation() {
+  }
+  Continuation(const Continuation&) = default;
+  Continuation(Continuation&&) {
+  }
+  Continuation& operator=(const Continuation&) {
+    return *this;
+  }
+  Continuation& operator=(Continuation&&) {
+    return *this;
+  }
+  ~Continuation() override = default;
+};
+
+class QuitCont : public Continuation {
+  int exit_code;
+
+ public:
+  QuitCont(int _code = 0) : exit_code(_code) {
+  }
+  ~QuitCont() override = default;
+  int jump(VmState* st) const & override {
+    return ~exit_code;
+  }
+};
+
+class ExcQuitCont : public Continuation {
+ public:
+  ExcQuitCont() = default;
+  ~ExcQuitCont() override = default;
+  int jump(VmState* st) const & override;
+};
+
+class PushIntCont : public Continuation {
+  int push_val;
+  Ref<Continuation> next;
+
+ public:
+  PushIntCont(int val, Ref<Continuation> _next) : push_val(val), next(_next) {
+  }
+  ~PushIntCont() override = default;
+  int jump(VmState* st) const & override;
+  int jump_w(VmState* st) & override;
+};
+
+class RepeatCont : public Continuation {
+  Ref<Continuation> body, after;
+  long long count;
+
+ public:
+  RepeatCont(Ref<Continuation> _body, Ref<Continuation> _after, long long _count)
+      : body(std::move(_body)), after(std::move(_after)), count(_count) {
+  }
+  ~RepeatCont() override = default;
+  int jump(VmState* st) const & override;
+  int jump_w(VmState* st) & override;
+};
+
+class AgainCont : public Continuation {
+  Ref<Continuation> body;
+
+ public:
+  AgainCont(Ref<Continuation> _body) : body(std::move(_body)) {
+  }
+  ~AgainCont() override = default;
+  int jump(VmState* st) const & override;
+  int jump_w(VmState* st) & override;
+};
+
+class UntilCont : public Continuation {
+  Ref<Continuation> body, after;
+
+ public:
+  UntilCont(Ref<Continuation> _body, Ref<Continuation> _after) : body(std::move(_body)), after(std::move(_after)) {
+  }
+  ~UntilCont() override = default;
+  int jump(VmState* st) const & override;
+  int jump_w(VmState* st) & override;
+};
+
+class WhileCont : public Continuation {
+  Ref<Continuation> cond, body, after;
+  bool chkcond;
+
+ public:
+  WhileCont(Ref<Continuation> _cond, Ref<Continuation> _body, Ref<Continuation> _after, bool _chk = true)
+      : cond(std::move(_cond)), body(std::move(_body)), after(std::move(_after)), chkcond(_chk) {
+  }
+  ~WhileCont() override = default;
+  int jump(VmState* st) const & override;
+  int jump_w(VmState* st) & override;
+};
+
+class ArgContExt : public Continuation {
+  ControlData data;
+  Ref<Continuation> ext;
+
+ public:
+  ArgContExt(Ref<Continuation> _ext) : data(), ext(_ext) {
+  }
+  ArgContExt(Ref<Continuation> _ext, Ref<Stack> _stack) : data(_stack), ext(_ext) {
+  }
+  ArgContExt(const ArgContExt&) = default;
+  ArgContExt(ArgContExt&&) = default;
+  ~ArgContExt() override = default;
+  int jump(VmState* st) const & override;
+  int jump_w(VmState* st) & override;
+  ControlData* get_cdata() override {
+    return &data;
+  }
+  const ControlData* get_cdata() const override {
+    return &data;
+  }
+  td::CntObject* make_copy() const override {
+    return new ArgContExt{*this};
+  }
+};
+
+class OrdCont : public Continuation {
+  ControlData data;
+  Ref<CellSlice> code;
+  friend class VmState;
+
+ public:
+  OrdCont() : data(), code() {
+  }
+  //OrdCont(Ref<CellSlice> _code) : data(), code(std::move(_code)) {}
+  OrdCont(Ref<CellSlice> _code, int _cp) : data(_cp), code(std::move(_code)) {
+  }
+  //OrdCont(Ref<CellSlice> _code, Ref<Stack> _stack) : data(std::move(_stack)), code(std::move(_code)) {}
+  OrdCont(Ref<CellSlice> _code, int _cp, Ref<Stack> _stack, int nargs = -1)
+      : data(_cp, std::move(_stack), nargs), code(std::move(_code)) {
+  }
+  OrdCont(const OrdCont&) = default;
+  OrdCont(OrdCont&&) = default;
+  ~OrdCont() override = default;
+
+  td::CntObject* make_copy() const override {
+    return new OrdCont{*this};
+  }
+  int jump(VmState* st) const & override;
+  int jump_w(VmState* st) & override;
+
+  ControlData* get_cdata() override {
+    return &data;
+  }
+  const ControlData* get_cdata() const override {
+    return &data;
+  }
+  Stack& get_stack() {
+    return data.stack.write();
+  }
+  const Stack& get_stack_const() const {
+    return *(data.stack);
+  }
+  Ref<Stack> get_stack_ref() const {
+    return data.stack;
+  }
+  Ref<OrdCont> copy_ord() const & {
+    return Ref<OrdCont>{true, *this};
+  }
+  Ref<OrdCont> copy_ord() && {
+    return Ref<OrdCont>{true, *this};
+  }
+};
+
+struct GasLimits {
+  static constexpr long long infty = (1ULL << 63) - 1;
+  long long gas_max, gas_limit, gas_credit, gas_remaining, gas_base;
+  GasLimits() : gas_max(infty), gas_limit(infty), gas_credit(0), gas_remaining(infty), gas_base(infty) {
+  }
+  GasLimits(long long _limit, long long _max = infty, long long _credit = 0)
+      : gas_max(_max)
+      , gas_limit(_limit)
+      , gas_credit(_credit)
+      , gas_remaining(_limit + _credit)
+      , gas_base(gas_remaining) {
+  }
+  long long gas_consumed() const {
+    return gas_base - gas_remaining;
+  }
+  void set_limits(long long _max, long long _limit, long long _credit = 0);
+  void change_base(long long _base) {
+    gas_remaining += _base - gas_base;
+    gas_base = _base;
+  }
+  void change_limit(long long _limit);
+  void consume(long long amount) {
+    // LOG(DEBUG) << "consume " << amount << " gas (" << gas_remaining << " remaining)";
+    gas_remaining -= amount;
+  }
+  bool try_consume(long long amount) {
+    // LOG(DEBUG) << "try consume " << amount << " gas (" << gas_remaining << " remaining)";
+    return (gas_remaining -= amount) >= 0;
+  }
+  void gas_exception() const;
+  void gas_exception(bool cond) const {
+    if (!cond) {
+      gas_exception();
+    }
+  }
+  void consume_chk(long long amount) {
+    gas_exception(try_consume(amount));
+  }
+  void check() const {
+    gas_exception(gas_remaining >= 0);
+  }
+  bool final_ok() const {
+    return gas_remaining >= gas_credit;
+  }
+};
+
+class VmState final : public VmStateInterface {
+  Ref<CellSlice> code;
+  Ref<Stack> stack;
+  ControlRegs cr;
+  int cp;
+  long long steps{0};
+  const DispatchTable* dispatch;
+  Ref<QuitCont> quit0, quit1;
+  VmLog log;
+  GasLimits gas;
+  std::vector<Ref<Cell>> libraries;
+  int stack_trace{0}, debug_off{0};
+
+ public:
+  static constexpr unsigned cell_load_gas_price = 100, cell_create_gas_price = 500, exception_gas_price = 50,
+                            tuple_entry_gas_price = 1;
+  VmState();
+  VmState(Ref<CellSlice> _code);
+  VmState(Ref<CellSlice> _code, Ref<Stack> _stack, int flags = 0, Ref<Cell> _data = {}, VmLog log = {},
+          std::vector<Ref<Cell>> _libraries = {});
+  VmState(Ref<CellSlice> _code, Ref<Stack> _stack, const GasLimits& _gas, int flags = 0, Ref<Cell> _data = {},
+          VmLog log = {}, std::vector<Ref<Cell>> _libraries = {});
+  template <typename... Args>
+  VmState(Ref<Cell> code_cell, Args&&... args)
+      : VmState(convert_code_cell(std::move(code_cell)), std::forward<Args>(args)...) {
+  }
+  bool set_gas_limits(long long _max, long long _limit, long long _credit = 0);
+  bool final_gas_ok() const {
+    return gas.final_ok();
+  }
+  long long gas_consumed() const {
+    return gas.gas_consumed();
+  }
+  void consume_gas(long long amount) {
+    gas.consume(amount);
+  }
+  void consume_tuple_gas(unsigned tuple_len) {
+    consume_gas(tuple_len * tuple_entry_gas_price);
+  }
+  void consume_tuple_gas(const Ref<vm::Tuple>& tup) {
+    if (tup.not_null()) {
+      consume_tuple_gas((unsigned)tup->size());
+    }
+  }
+  GasLimits get_gas_limits() const {
+    return gas;
+  }
+  void change_gas_limit(long long new_limit);
+  template <typename... Args>
+  void check_underflow(Args... args) {
+    stack->check_underflow(args...);
+  }
+  bool register_library_collection(Ref<Cell> lib);
+  Ref<Cell> load_library(
+      td::ConstBitPtr hash) override;  // may throw a dictionary exception; returns nullptr if library is not found
+  void register_cell_load() override;
+  void register_cell_create() override;
+  bool init_cp(int new_cp);
+  bool set_cp(int new_cp);
+  void force_cp(int new_cp);
+  int get_cp() const {
+    return cp;
+  }
+  int incr_stack_trace(int v) {
+    return stack_trace += v;
+  }
+  long long get_steps_count() const {
+    return steps;
+  }
+  td::BitArray<256> get_state_hash() const;
+  td::BitArray<256> get_final_state_hash(int exit_code) const;
+  int step();
+  int run();
+  Stack& get_stack() {
+    return stack.write();
+  }
+  const Stack& get_stack_const() const {
+    return *stack;
+  }
+  Ref<Stack> get_stack_ref() const {
+    return stack;
+  }
+  Ref<Continuation> get_c0() const {
+    return cr.c[0];
+  }
+  Ref<Continuation> get_c1() const {
+    return cr.c[1];
+  }
+  Ref<Continuation> get_c2() const {
+    return cr.c[2];
+  }
+  Ref<Continuation> get_c3() const {
+    return cr.c[3];
+  }
+  Ref<Cell> get_c4() const {
+    return cr.d[0];
+  }
+  Ref<Tuple> get_c7() const {
+    return cr.c7;
+  }
+  Ref<Continuation> get_c(unsigned idx) const {
+    return cr.get_c(idx);
+  }
+  Ref<Cell> get_d(unsigned idx) const {
+    return cr.get_d(idx);
+  }
+  StackEntry get(unsigned idx) const {
+    return cr.get(idx);
+  }
+  const VmLog& get_log() const {
+    return log;
+  }
+  void define_c0(Ref<Continuation> cont) {
+    cr.define_c0(std::move(cont));
+  }
+  void set_c0(Ref<Continuation> cont) {
+    cr.set_c0(std::move(cont));
+  }
+  void set_c1(Ref<Continuation> cont) {
+    cr.set_c1(std::move(cont));
+  }
+  void set_c2(Ref<Continuation> cont) {
+    cr.set_c2(std::move(cont));
+  }
+  bool set_c(unsigned idx, Ref<Continuation> val) {
+    return cr.set_c(idx, std::move(val));
+  }
+  bool set_d(unsigned idx, Ref<Cell> val) {
+    return cr.set_d(idx, std::move(val));
+  }
+  void set_c4(Ref<Cell> val) {
+    cr.set_c4(std::move(val));
+  }
+  bool set_c7(Ref<Tuple> val) {
+    return cr.set_c7(std::move(val));
+  }
+  bool set(unsigned idx, StackEntry val) {
+    return cr.set(idx, std::move(val));
+  }
+  void set_stack(Ref<Stack> new_stk) {
+    stack = std::move(new_stk);
+  }
+  Ref<Stack> swap_stack(Ref<Stack> new_stk) {
+    stack.swap(new_stk);
+    return new_stk;
+  }
+  void ensure_throw(bool cond) const {
+    if (!cond) {
+      fatal();
+    }
+  }
+  void set_code(Ref<CellSlice> _code, int _cp) {
+    code = std::move(_code);
+    force_cp(_cp);
+  }
+  Ref<CellSlice> get_code() const {
+    return code;
+  }
+  void push_code() {
+    get_stack().push_cellslice(get_code());
+  }
+  void adjust_cr(const ControlRegs& save) {
+    cr ^= save;
+  }
+  void adjust_cr(ControlRegs&& save) {
+    cr ^= save;
+  }
+  void preclear_cr(const ControlRegs& save) {
+    cr &= save;
+  }
+  int call(Ref<Continuation> cont);
+  int call(Ref<Continuation> cont, int pass_args, int ret_args = -1);
+  int jump(Ref<Continuation> cont);
+  int jump(Ref<Continuation> cont, int pass_args);
+  int ret();
+  int ret(int ret_args);
+  int ret_alt();
+  int ret_alt(int ret_args);
+  int repeat(Ref<Continuation> body, Ref<Continuation> after, long long count);
+  int again(Ref<Continuation> body);
+  int until(Ref<Continuation> body, Ref<Continuation> after);
+  int loop_while(Ref<Continuation> cond, Ref<Continuation> body, Ref<Continuation> after);
+  int throw_exception(int excno, StackEntry&& arg);
+  int throw_exception(int excno);
+  Ref<OrdCont> extract_cc(int save_cr = 1, int stack_copy = -1, int cc_args = -1);
+  void fatal(void) const {
+    throw VmFatal{};
+  }
+  int jump_to(Ref<Continuation> cont) {
+    return cont->is_unique() ? cont.unique_write().jump_w(this) : cont->jump(this);
+  }
+  static Ref<CellSlice> convert_code_cell(Ref<Cell> code_cell);
+
+ private:
+  void init_cregs(bool same_c3 = false, bool push_0 = true);
+};
+
+int run_vm_code(Ref<CellSlice> _code, Ref<Stack>& _stack, int flags = 0, Ref<Cell>* data_ptr = 0, VmLog log = {},
+                long long* steps = nullptr, GasLimits* gas_limits = nullptr, std::vector<Ref<Cell>> libraries = {});
+int run_vm_code(Ref<CellSlice> _code, Stack& _stack, int flags = 0, Ref<Cell>* data_ptr = 0, VmLog log = {},
+                long long* steps = nullptr, GasLimits* gas_limits = nullptr, std::vector<Ref<Cell>> libraries = {});
+
+ControlData* force_cdata(Ref<Continuation>& cont);
+ControlRegs* force_cregs(Ref<Continuation>& cont);
+
+Ref<vm::Cell> lookup_library_in(td::ConstBitPtr key, Ref<vm::Cell> lib_root);
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/contops.cpp b/submodules/ton/tonlib-src/crypto/vm/contops.cpp
new file mode 100644
index 0000000000..0039439e6b
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/contops.cpp
@@ -0,0 +1,1043 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <functional>
+#include "vm/contops.h"
+#include "vm/log.h"
+#include "vm/opctable.h"
+#include "vm/stack.hpp"
+#include "vm/continuation.h"
+#include "vm/cellops.h"
+#include "vm/excno.hpp"
+
+namespace vm {
+
+int exec_execute(VmState* st) {
+  VM_LOG(st) << "execute EXECUTE\n";
+  auto cont = st->get_stack().pop_cont();
+  return st->call(std::move(cont));
+}
+
+int exec_callx_args(VmState* st, unsigned args) {
+  unsigned params = (args >> 4) & 15, retvals = (args & 15);
+  VM_LOG(st) << "execute CALLXARGS " << params << ',' << retvals;
+  auto cont = st->get_stack().pop_cont();
+  return st->call(std::move(cont), params, retvals);
+}
+
+int exec_callx_args_p(VmState* st, unsigned args) {
+  unsigned params = (args & 15);
+  VM_LOG(st) << "execute CALLXARGS " << params << ",-1\n";
+  auto cont = st->get_stack().pop_cont();
+  return st->call(std::move(cont), params, -1);
+}
+
+int exec_jmpx(VmState* st) {
+  VM_LOG(st) << "execute JMPX\n";
+  auto cont = st->get_stack().pop_cont();
+  return st->jump(std::move(cont));
+}
+
+int exec_jmpx_args(VmState* st, unsigned args) {
+  unsigned params = args & 15;
+  VM_LOG(st) << "execute JMPXARGS " << params;
+  auto cont = st->get_stack().pop_cont();
+  return st->jump(std::move(cont), params);
+}
+
+int exec_ret(VmState* st) {
+  VM_LOG(st) << "execute RET\n";
+  return st->ret();
+}
+
+int exec_ret_args(VmState* st, unsigned args) {
+  unsigned params = args & 15;
+  VM_LOG(st) << "execute RETARGS " << params;
+  return st->ret(params);
+}
+
+int exec_ret_alt(VmState* st) {
+  VM_LOG(st) << "execute RETALT\n";
+  return st->ret_alt();
+}
+
+int exec_ret_bool(VmState* st) {
+  VM_LOG(st) << "execute RETBOOL\n";
+  return st->get_stack().pop_bool() ? st->ret() : st->ret_alt();
+}
+
+int exec_callcc(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute CALLCC\n";
+  auto cont = stack.pop_cont();
+  auto cc = st->extract_cc(3);
+  st->get_stack().push_cont(std::move(cc));
+  return st->jump(std::move(cont));
+}
+
+int exec_jmpx_data(VmState* st) {
+  VM_LOG(st) << "execute JMPXDATA\n";
+  auto cont = st->get_stack().pop_cont();
+  st->push_code();
+  return st->jump(std::move(cont));
+}
+
+int exec_callcc_args(VmState* st, unsigned args) {
+  int params = (args >> 4) & 15, retvals = ((args + 1) & 15) - 1;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute CALLCCARGS " << params << ',' << retvals;
+  stack.check_underflow(params + 1);
+  auto cont = stack.pop_cont();
+  auto cc = st->extract_cc(3, params, retvals);
+  st->get_stack().push_cont(std::move(cc));
+  return st->jump(std::move(cont));
+}
+
+int exec_callx_varargs(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute CALLXVARARGS\n";
+  stack.check_underflow(3);
+  int retvals = stack.pop_smallint_range(254, -1);
+  int params = stack.pop_smallint_range(254, -1);
+  return st->call(stack.pop_cont(), params, retvals);
+}
+
+int exec_ret_varargs(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute RETVARARGS\n";
+  int retvals = stack.pop_smallint_range(254, -1);
+  return st->ret(retvals);
+}
+
+int exec_jmpx_varargs(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute JMPXVARARGS\n";
+  stack.check_underflow(2);
+  int params = stack.pop_smallint_range(254, -1);
+  stack.check_underflow(params + 1);
+  return st->jump(stack.pop_cont(), params);
+}
+
+int exec_callcc_varargs(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute CALLCCVARARGS\n";
+  stack.check_underflow(3);
+  int retvals = stack.pop_smallint_range(254, -1);
+  int params = stack.pop_smallint_range(254, -1);
+  stack.check_underflow(params + 1);
+  auto cont = stack.pop_cont();
+  auto cc = st->extract_cc(3, params, retvals);
+  st->get_stack().push_cont(std::move(cc));
+  return st->jump(std::move(cont));
+}
+
+int exec_do_with_ref(VmState* st, CellSlice& cs, int pfx_bits, const std::function<int(VmState*, Ref<OrdCont>)>& func,
+                     const char* name) {
+  if (!cs.have_refs(1)) {
+    throw VmError{Excno::inv_opcode, "no references left for a CALLREF instruction"};
+  }
+  cs.advance(pfx_bits);
+  auto cell = cs.fetch_ref();
+  VM_LOG(st) << "execute " << name << " (" << cell->get_hash().to_hex() << ")";
+  return func(st, Ref<OrdCont>{true, load_cell_slice_ref(std::move(cell)), st->get_cp()});
+}
+
+int exec_ret_data(VmState* st) {
+  VM_LOG(st) << "execute RETDATA\n";
+  st->push_code();
+  return st->ret();
+}
+
+void register_continuation_jump_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mksimple(0xd8, 8, "EXECUTE", exec_execute))
+      .insert(OpcodeInstr::mksimple(0xd9, 8, "JMPX", exec_jmpx))
+      .insert(OpcodeInstr::mkfixed(0xda, 8, 8, instr::dump_2c("CALLXARGS ", ","), exec_callx_args))
+      .insert(OpcodeInstr::mkfixed(0xdb0, 12, 4, instr::dump_1c("CALLXARGS ", ",-1"), exec_callx_args_p))
+      .insert(OpcodeInstr::mkfixed(0xdb1, 12, 4, instr::dump_1c("JMPXARGS "), exec_jmpx_args))
+      .insert(OpcodeInstr::mkfixed(0xdb2, 12, 4, instr::dump_1c("RETARGS "), exec_ret_args))
+      .insert(OpcodeInstr::mksimple(0xdb30, 16, "RET", exec_ret))
+      .insert(OpcodeInstr::mksimple(0xdb31, 16, "RETALT", exec_ret_alt))
+      .insert(OpcodeInstr::mksimple(0xdb32, 16, "RETBOOL", exec_ret_bool))
+      .insert(OpcodeInstr::mksimple(0xdb34, 16, "CALLCC", exec_callcc))
+      .insert(OpcodeInstr::mksimple(0xdb35, 16, "JMPXDATA", exec_jmpx_data))
+      .insert(OpcodeInstr::mkfixed(0xdb36, 16, 8, instr::dump_2c("CALLCCARGS ", ","), exec_callcc_args))
+      .insert(OpcodeInstr::mksimple(0xdb38, 16, "CALLXVARARGS", exec_callx_varargs))
+      .insert(OpcodeInstr::mksimple(0xdb39, 16, "RETVARARGS", exec_ret_varargs))
+      .insert(OpcodeInstr::mksimple(0xdb3a, 16, "JMPXVARARGS", exec_jmpx_varargs))
+      .insert(OpcodeInstr::mksimple(0xdb3b, 16, "CALLCCVARARGS", exec_callcc_varargs))
+      .insert(OpcodeInstr::mkext(0xdb3c, 16, 0, std::bind(dump_push_ref, _1, _2, _3, "CALLREF"),
+                                 std::bind(exec_do_with_ref, _1, _2, _4,
+                                           [](auto st, auto cont) { return st->call(std::move(cont)); }, "CALLREF"),
+                                 compute_len_push_ref))
+      .insert(OpcodeInstr::mkext(0xdb3d, 16, 0, std::bind(dump_push_ref, _1, _2, _3, "JMPREF"),
+                                 std::bind(exec_do_with_ref, _1, _2, _4,
+                                           [](auto st, auto cont) { return st->jump(std::move(cont)); }, "JMPREF"),
+                                 compute_len_push_ref))
+      .insert(OpcodeInstr::mkext(0xdb3e, 16, 0, std::bind(dump_push_ref, _1, _2, _3, "JMPREFDATA"),
+                                 std::bind(exec_do_with_ref, _1, _2, _4,
+                                           [](auto st, auto cont) {
+                                             st->push_code();
+                                             return st->jump(std::move(cont));
+                                           },
+                                           "JMPREFDATA"),
+                                 compute_len_push_ref))
+      .insert(OpcodeInstr::mksimple(0xdb3f, 16, "RETDATA", exec_ret_data));
+}
+
+int exec_if(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute IF\n";
+  stack.check_underflow(2);
+  auto cont = stack.pop_cont();
+  if (stack.pop_bool()) {
+    return st->call(std::move(cont));
+  }
+  return 0;
+}
+
+int exec_ifnot(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute IFNOT\n";
+  stack.check_underflow(2);
+  auto cont = stack.pop_cont();
+  if (!stack.pop_bool()) {
+    return st->call(std::move(cont));
+  }
+  return 0;
+}
+
+int exec_if_jmp(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute IFJMP\n";
+  stack.check_underflow(2);
+  auto cont = stack.pop_cont();
+  if (stack.pop_bool()) {
+    return st->jump(std::move(cont));
+  }
+  return 0;
+}
+
+int exec_ifnot_jmp(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute IFNOTJMP\n";
+  stack.check_underflow(2);
+  auto cont = stack.pop_cont();
+  if (!stack.pop_bool()) {
+    return st->jump(std::move(cont));
+  }
+  return 0;
+}
+
+int exec_ifret(VmState* st) {
+  VM_LOG(st) << "execute IFRET\n";
+  if (st->get_stack().pop_bool()) {
+    return st->ret();
+  }
+  return 0;
+}
+
+int exec_ifnotret(VmState* st) {
+  VM_LOG(st) << "execute IFNOTRET\n";
+  if (!st->get_stack().pop_bool()) {
+    return st->ret();
+  }
+  return 0;
+}
+
+int exec_if_else(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute IFELSE\n";
+  stack.check_underflow(3);
+  auto cont0 = stack.pop_cont();
+  auto cont1 = stack.pop_cont();
+  if (stack.pop_bool()) {
+    std::swap(cont0, cont1);
+  }
+  cont1.clear();
+  return st->call(std::move(cont0));
+}
+
+int exec_condsel(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute CONDSEL\n";
+  stack.check_underflow(3);
+  auto y = stack.pop();
+  auto x = stack.pop();
+  stack.push(stack.pop_bool() ? std::move(x) : std::move(y));
+  return 0;
+}
+
+int exec_condsel_chk(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute CONDSELCHK\n";
+  stack.check_underflow(3);
+  auto y = stack.pop();
+  auto x = stack.pop();
+  if (x.type() != y.type()) {
+    throw VmError{Excno::type_chk, "two arguments of CONDSELCHK have different type"};
+  }
+  stack.push(stack.pop_bool() ? std::move(x) : std::move(y));
+  return 0;
+}
+
+int exec_ifretalt(VmState* st) {
+  VM_LOG(st) << "execute IFRETALT\n";
+  if (st->get_stack().pop_bool()) {
+    return st->ret_alt();
+  }
+  return 0;
+}
+
+int exec_ifnotretalt(VmState* st) {
+  VM_LOG(st) << "execute IFNOTRETALT\n";
+  if (!st->get_stack().pop_bool()) {
+    return st->ret_alt();
+  }
+  return 0;
+}
+
+int exec_if_bit_jmp(VmState* st, unsigned args) {
+  bool negate = args & 0x20;
+  unsigned bit = args & 0x1f;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute IF" << (negate ? "NBITJMP " : "BITJMP ") << bit;
+  stack.check_underflow(2);
+  auto cont = stack.pop_cont();
+  auto x = stack.pop_int_finite();
+  bool val = x->get_bit(bit);
+  stack.push_int(std::move(x));
+  if (val ^ negate) {
+    return st->jump(std::move(cont));
+  }
+  return 0;
+}
+
+std::string dump_if_bit_jmp(CellSlice& cs, unsigned args) {
+  std::ostringstream os{args & 0x20 ? "IFN" : " IF"};
+  os << "BITJMP " << (args & 0x1f);
+  return os.str();
+}
+
+int exec_if_bit_jmpref(VmState* st, CellSlice& cs, unsigned args, int pfx_bits) {
+  if (!cs.have_refs()) {
+    throw VmError{Excno::inv_opcode, "no references left for a IFBITJMPREF instruction"};
+  }
+  cs.advance(pfx_bits);
+  auto cell = cs.fetch_ref();
+  bool negate = args & 0x20;
+  unsigned bit = args & 0x1f;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute IF" << (negate ? "N" : "") << "BITJMPREF " << bit << " (" << cell->get_hash().to_hex() << ")";
+  auto x = stack.pop_int_finite();
+  bool val = x->get_bit(bit);
+  stack.push_int(std::move(x));
+  if (val ^ negate) {
+    return st->jump(Ref<OrdCont>{true, load_cell_slice_ref(std::move(cell)), st->get_cp()});
+  }
+  return 0;
+}
+
+std::string dump_if_bit_jmpref(CellSlice& cs, unsigned args, int pfx_bits) {
+  if (!cs.have_refs()) {
+    return "";
+  }
+  cs.advance(pfx_bits);
+  cs.advance_refs(1);
+  std::ostringstream os{args & 0x20 ? "IFN" : " IF"};
+  os << "BITJMPREF " << (args & 0x1f);
+  return os.str();
+}
+
+int exec_repeat(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute REPEAT\n";
+  stack.check_underflow(2);
+  auto cont = stack.pop_cont();
+  int c = stack.pop_smallint_range(0x7fffffff, 0x80000000);
+  if (c <= 0) {
+    return 0;
+  }
+  return st->repeat(std::move(cont), st->extract_cc(1), c);
+}
+
+int exec_repeat_end(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute REPEATEND\n";
+  stack.check_underflow(1);
+  int c = stack.pop_smallint_range(0x7fffffff, 0x80000000);
+  if (c <= 0) {
+    return st->ret();
+  }
+  auto cont = st->extract_cc(0);
+  return st->repeat(std::move(cont), st->get_c0(), c);
+}
+
+int exec_until(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute UNTIL\n";
+  auto cont = stack.pop_cont();
+  return st->until(std::move(cont), st->extract_cc(1));
+}
+
+int exec_until_end(VmState* st) {
+  VM_LOG(st) << "execute UNTILEND\n";
+  auto cont = st->extract_cc(0);
+  return st->until(std::move(cont), st->get_c0());
+}
+
+int exec_while(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute WHILE\n";
+  stack.check_underflow(2);
+  auto body = stack.pop_cont();
+  auto cond = stack.pop_cont();
+  return st->loop_while(std::move(cond), std::move(body), st->extract_cc(1));
+}
+
+int exec_while_end(VmState* st) {
+  VM_LOG(st) << "execute WHILEEND\n";
+  auto cond = st->get_stack().pop_cont();
+  auto body = st->extract_cc(0);
+  return st->loop_while(std::move(cond), std::move(body), st->get_c0());
+}
+
+int exec_again(VmState* st) {
+  VM_LOG(st) << "execute AGAIN\n";
+  return st->again(st->get_stack().pop_cont());
+}
+
+int exec_again_end(VmState* st) {
+  VM_LOG(st) << "execute AGAINEND\n";
+  return st->again(st->extract_cc(0));
+}
+
+void register_continuation_cond_loop_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mksimple(0xdc, 8, "IFRET", exec_ifret))
+      .insert(OpcodeInstr::mksimple(0xdd, 8, "IFNOTRET", exec_ifnotret))
+      .insert(OpcodeInstr::mksimple(0xde, 8, "IF", exec_if))
+      .insert(OpcodeInstr::mksimple(0xdf, 8, "IFNOT", exec_ifnot))
+      .insert(OpcodeInstr::mksimple(0xe0, 8, "IFJMP", exec_if_jmp))
+      .insert(OpcodeInstr::mksimple(0xe1, 8, "IFNOTJMP", exec_ifnot_jmp))
+      .insert(OpcodeInstr::mksimple(0xe2, 8, "IFELSE", exec_if_else))
+      .insert(OpcodeInstr::mkext(
+          0xe300, 16, 0, std::bind(dump_push_ref, _1, _2, _3, "IFREF"),
+          std::bind(exec_do_with_ref, _1, _2, _4,
+                    [](auto st, auto cont) { return st->get_stack().pop_bool() ? st->call(std::move(cont)) : 0; },
+                    "IFREF"),
+          compute_len_push_ref))
+      .insert(OpcodeInstr::mkext(
+          0xe301, 16, 0, std::bind(dump_push_ref, _1, _2, _3, "IFNOTREF"),
+          std::bind(exec_do_with_ref, _1, _2, _4,
+                    [](auto st, auto cont) { return st->get_stack().pop_bool() ? 0 : st->call(std::move(cont)); },
+                    "IFNOTREF"),
+          compute_len_push_ref))
+      .insert(OpcodeInstr::mkext(
+          0xe302, 16, 0, std::bind(dump_push_ref, _1, _2, _3, "IFJMPREF"),
+          std::bind(exec_do_with_ref, _1, _2, _4,
+                    [](auto st, auto cont) { return st->get_stack().pop_bool() ? st->jump(std::move(cont)) : 0; },
+                    "IFJMPREF"),
+          compute_len_push_ref))
+      .insert(OpcodeInstr::mkext(
+          0xe303, 16, 0, std::bind(dump_push_ref, _1, _2, _3, "IFNOTJMPREF"),
+          std::bind(exec_do_with_ref, _1, _2, _4,
+                    [](auto st, auto cont) { return st->get_stack().pop_bool() ? 0 : st->jump(std::move(cont)); },
+                    "IFNOTJMPREF"),
+          compute_len_push_ref))
+      .insert(OpcodeInstr::mksimple(0xe304, 16, "CONDSEL", exec_condsel))
+      .insert(OpcodeInstr::mksimple(0xe305, 16, "CONDSELCHK", exec_condsel_chk))
+      .insert(OpcodeInstr::mksimple(0xe308, 16, "IFRETALT", exec_ifretalt))
+      .insert(OpcodeInstr::mksimple(0xe309, 16, "IFNOTRETALT", exec_ifnotretalt))
+      .insert(OpcodeInstr::mkfixed(0xe380 >> 6, 10, 6, dump_if_bit_jmp, exec_if_bit_jmp))
+      .insert(OpcodeInstr::mkext(0xe3c0 >> 6, 10, 6, dump_if_bit_jmpref, exec_if_bit_jmpref, compute_len_push_ref))
+      .insert(OpcodeInstr::mksimple(0xe4, 8, "REPEAT", exec_repeat))
+      .insert(OpcodeInstr::mksimple(0xe5, 8, "REPEATEND", exec_repeat_end))
+      .insert(OpcodeInstr::mksimple(0xe6, 8, "UNTIL", exec_until))
+      .insert(OpcodeInstr::mksimple(0xe7, 8, "UNTILEND", exec_until_end))
+      .insert(OpcodeInstr::mksimple(0xe8, 8, "WHILE", exec_while))
+      .insert(OpcodeInstr::mksimple(0xe9, 8, "WHILEEND", exec_while_end))
+      .insert(OpcodeInstr::mksimple(0xea, 8, "AGAIN", exec_again))
+      .insert(OpcodeInstr::mksimple(0xeb, 8, "AGAINEND", exec_again_end));
+}
+
+int exec_setcontargs_common(VmState* st, int copy, int more) {
+  Stack& stack = st->get_stack();
+  stack.check_underflow(copy + 1);
+  auto cont = stack.pop_cont();
+  if (copy || more >= 0) {
+    ControlData* cdata = force_cdata(cont);
+    if (copy > 0) {
+      if (cdata->nargs >= 0 && cdata->nargs < copy) {
+        throw VmError{Excno::stk_ov, "too many arguments copied into a closure continuation"};
+      }
+      if (cdata->stack.is_null()) {
+        cdata->stack = stack.split_top(copy);
+      } else {
+        cdata->stack.write().move_from_stack(stack, copy);
+      }
+      if (cdata->nargs >= 0) {
+        cdata->nargs -= copy;
+      }
+    }
+    if (more >= 0) {
+      if (cdata->nargs > more) {
+        cdata->nargs = 0x40000000;  // will throw an exception if run
+      } else if (cdata->nargs < 0) {
+        cdata->nargs = more;
+      }
+    }
+  }
+  st->get_stack().push_cont(std::move(cont));
+  return 0;
+}
+
+int exec_setcontargs(VmState* st, unsigned args) {
+  int copy = (args >> 4) & 15, more = ((args + 1) & 15) - 1;
+  VM_LOG(st) << "execute SETCONTARGS " << copy << ',' << more;
+  return exec_setcontargs_common(st, copy, more);
+}
+
+std::string dump_setcontargs(CellSlice& cs, unsigned args, const char* name) {
+  int copy = (args >> 4) & 15, more = ((args + 1) & 15) - 1;
+  std::ostringstream os{name};
+  os << ' ' << copy << ',' << more;
+  return os.str();
+}
+
+int exec_setcont_varargs(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SETCONTVARARGS\n";
+  stack.check_underflow(2);
+  int more = stack.pop_smallint_range(255, -1);
+  int copy = stack.pop_smallint_range(255);
+  return exec_setcontargs_common(st, copy, more);
+}
+
+int exec_setnum_varargs(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SETNUMVARARGS\n";
+  stack.check_underflow(2);
+  int more = stack.pop_smallint_range(255, -1);
+  return exec_setcontargs_common(st, 0, more);
+}
+
+int exec_return_args_common(VmState* st, int count) {
+  Stack& stack = st->get_stack();
+  stack.check_underflow(count);
+  if (stack.depth() == count) {
+    return 0;
+  }
+  int copy = stack.depth() - count;
+  Ref<Stack> alt_stk = st->swap_stack(stack.split_top(count));
+  auto cont = st->get_c0();
+  ControlData* cdata = force_cdata(cont);
+  if (cdata->nargs >= 0 && cdata->nargs < copy) {
+    throw VmError{Excno::stk_ov, "too many arguments copied into a closure continuation"};
+  }
+  if (cdata->stack.is_null()) {
+    cdata->stack = std::move(alt_stk);
+  } else {
+    cdata->stack.write().move_from_stack(alt_stk.write(), copy);
+    alt_stk.clear();
+  }
+  if (cdata->nargs >= 0) {
+    cdata->nargs -= copy;
+  }
+  st->set_c0(std::move(cont));
+  return 0;
+}
+
+int exec_return_args(VmState* st, unsigned args) {
+  int count = args & 15;
+  VM_LOG(st) << "execute RETURNARGS " << count;
+  return exec_return_args_common(st, count);
+}
+
+int exec_return_varargs(VmState* st) {
+  VM_LOG(st) << "execute RETURNVARARGS\n";
+  return exec_return_args_common(st, st->get_stack().pop_smallint_range(255));
+}
+
+int exec_bless(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute BLESS\n";
+  stack.push_cont(Ref<OrdCont>{true, stack.pop_cellslice(), st->get_cp()});
+  return 0;
+}
+
+int exec_bless_args_common(VmState* st, int copy, int more) {
+  Stack& stack = st->get_stack();
+  stack.check_underflow(copy + 1);
+  auto cs = stack.pop_cellslice();
+  auto new_stk = stack.split_top(copy);
+  stack.push_cont(Ref<OrdCont>{true, std::move(cs), st->get_cp(), std::move(new_stk), more});
+  return 0;
+}
+
+int exec_bless_varargs(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute BLESSVARARGS\n";
+  stack.check_underflow(2);
+  int more = stack.pop_smallint_range(255, -1);
+  int copy = stack.pop_smallint_range(255);
+  return exec_bless_args_common(st, copy, more);
+}
+
+int exec_bless_args(VmState* st, unsigned args) {
+  int copy = (args >> 4) & 15, more = ((args + 1) & 15) - 1;
+  VM_LOG(st) << "execute BLESSARGS " << copy << ',' << more;
+  return exec_bless_args_common(st, copy, more);
+}
+
+int exec_push_ctr(VmState* st, unsigned args) {
+  unsigned idx = args & 15;
+  VM_LOG(st) << "execute PUSH c" << idx;
+  st->get_stack().push(st->get(idx));
+  return 0;
+}
+
+namespace {
+inline void throw_typechk(bool ok) {
+  if (!ok) {
+    throw VmError{Excno::type_chk, "invalid value type for control register"};
+  }
+}
+
+inline void throw_rangechk(bool ok) {
+  if (!ok) {
+    throw VmError{Excno::range_chk, "control register index out of range"};
+  }
+}
+}  // namespace
+
+int exec_pop_ctr(VmState* st, unsigned args) {
+  unsigned idx = args & 15;
+  VM_LOG(st) << "execute POP c" << idx;
+  throw_typechk(st->set(idx, st->get_stack().pop_chk()));
+  return 0;
+}
+
+int exec_setcont_ctr(VmState* st, unsigned args) {
+  unsigned idx = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SETCONTCTR c" << idx;
+  stack.check_underflow(2);
+  auto cont = stack.pop_cont();
+  throw_typechk(force_cregs(cont)->define(idx, stack.pop_chk()));
+  st->get_stack().push_cont(std::move(cont));
+  return 0;
+}
+
+int exec_setret_ctr(VmState* st, unsigned args) {
+  unsigned idx = args & 15;
+  VM_LOG(st) << "execute SETRETCTR c" << idx;
+  auto cont = st->get_c0();
+  throw_typechk(force_cregs(cont)->define(idx, st->get_stack().pop_chk()));
+  st->set_c0(std::move(cont));
+  return 0;
+}
+
+int exec_setalt_ctr(VmState* st, unsigned args) {
+  unsigned idx = args & 15;
+  VM_LOG(st) << "execute SETALTCTR c" << idx;
+  auto cont = st->get_c1();
+  throw_typechk(force_cregs(cont)->define(idx, st->get_stack().pop_chk()));
+  st->set_c1(std::move(cont));
+  return 0;
+}
+
+int exec_popsave_ctr(VmState* st, unsigned args) {
+  unsigned idx = args & 15;
+  VM_LOG(st) << "execute POPSAVE c" << idx;
+  auto val = st->get_stack().pop_chk();
+  auto c0 = st->get_c0();
+  throw_typechk(idx || val.is(StackEntry::t_vmcont));
+  force_cregs(c0)->define(idx, st->get(idx));
+  if (!idx) {
+    st->set_c0(std::move(c0));
+    throw_typechk(st->set(idx, std::move(val)));
+  } else {
+    throw_typechk(st->set(idx, std::move(val)));
+    st->set_c0(std::move(c0));
+  }
+  return 0;
+}
+
+int exec_save_ctr(VmState* st, unsigned args) {
+  unsigned idx = args & 15;
+  VM_LOG(st) << "execute SAVECTR c" << idx;
+  auto c0 = st->get_c0();
+  throw_typechk(force_cregs(c0)->define(idx, st->get(idx)));
+  st->set_c0(std::move(c0));
+  return 0;
+}
+
+int exec_savealt_ctr(VmState* st, unsigned args) {
+  unsigned idx = args & 15;
+  VM_LOG(st) << "execute SAVEALTCTR c" << idx;
+  auto c1 = st->get_c1();
+  throw_typechk(force_cregs(c1)->define(idx, st->get(idx)));
+  st->set_c1(std::move(c1));
+  return 0;
+}
+
+int exec_saveboth_ctr(VmState* st, unsigned args) {
+  unsigned idx = args & 15;
+  VM_LOG(st) << "execute SAVEBOTHCTR c" << idx;
+  auto c0 = st->get_c0(), c1 = st->get_c1();
+  auto val = st->get(idx);
+  force_cregs(c0)->define(idx, val);
+  force_cregs(c1)->define(idx, std::move(val));
+  st->set_c0(std::move(c0));
+  st->set_c1(std::move(c1));
+  return 0;
+}
+
+int exec_push_ctr_var(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSHCTRX\n";
+  unsigned idx = stack.pop_smallint_range(16);
+  auto val = st->get(idx);
+  throw_rangechk(!val.empty());
+  stack.push(std::move(val));
+  return 0;
+}
+
+int exec_pop_ctr_var(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute POPCTRX\n";
+  stack.check_underflow(2);
+  unsigned idx = stack.pop_smallint_range(16);
+  throw_rangechk(ControlRegs::valid_idx(idx));
+  throw_typechk(st->set(idx, stack.pop_chk()));
+  return 0;
+}
+
+int exec_setcont_ctr_var(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SETCONTCTRX\n";
+  stack.check_underflow(3);
+  unsigned idx = stack.pop_smallint_range(16);
+  throw_rangechk(ControlRegs::valid_idx(idx));
+  auto cont = stack.pop_cont();
+  throw_typechk(force_cregs(cont)->define(idx, stack.pop_chk()));
+  st->get_stack().push_cont(std::move(cont));
+  return 0;
+}
+
+int exec_compos(VmState* st, unsigned mask, const char* name) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << name;
+  stack.check_underflow(2);
+  auto val = stack.pop_cont();
+  auto cont = stack.pop_cont();
+  ControlRegs* regs = force_cregs(cont);
+  switch (mask) {
+    case 1:
+      regs->define_c0(std::move(val));
+      break;
+    case 3:
+      regs->define_c0(val);
+      // fallthrough
+    case 2:
+      regs->define_c1(std::move(val));
+      break;
+  }
+  st->get_stack().push_cont(std::move(cont));
+  return 0;
+}
+
+int exec_atexit(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ATEXIT\n";
+  auto cont = stack.pop_cont();
+  force_cregs(cont)->define_c0(st->get_c0());
+  st->set_c0(std::move(cont));
+  return 0;
+}
+
+int exec_atexit_alt(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ATEXITALT\n";
+  auto cont = stack.pop_cont();
+  force_cregs(cont)->define_c1(st->get_c1());
+  st->set_c1(std::move(cont));
+  return 0;
+}
+
+int exec_setexit_alt(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SETEXITALT\n";
+  auto cont = stack.pop_cont();
+  force_cregs(cont)->define_c0(st->get_c0());
+  force_cregs(cont)->define_c1(st->get_c1());
+  st->set_c1(std::move(cont));
+  return 0;
+}
+
+int exec_thenret(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute THENRET\n";
+  auto cont = stack.pop_cont();
+  force_cregs(cont)->define_c0(st->get_c0());
+  stack.push_cont(std::move(cont));
+  return 0;
+}
+
+int exec_thenret_alt(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute THENRETALT\n";
+  auto cont = stack.pop_cont();
+  force_cregs(cont)->define_c0(st->get_c1());
+  stack.push_cont(std::move(cont));
+  return 0;
+}
+
+int exec_invert(VmState* st) {
+  VM_LOG(st) << "execute INVERT\n";
+  auto c0 = st->get_c0(), c1 = st->get_c1();
+  st->set_c0(std::move(c1));
+  st->set_c1(std::move(c0));
+  return 0;
+}
+
+int exec_booleval(VmState* st) {
+  VM_LOG(st) << "execute BOOLEVAL\n";
+  auto cont = st->get_stack().pop_cont();
+  auto cc = st->extract_cc(3);
+  st->set_c0(Ref<PushIntCont>{true, -1, cc});
+  st->set_c1(Ref<PushIntCont>{true, 0, std::move(cc)});
+  return st->jump(std::move(cont));
+}
+
+void reg_ctr_oprange(OpcodeTable& cp, unsigned opcode, std::string name, exec_arg_instr_func_t exec_ctr) {
+  cp.insert(OpcodeInstr::mkfixedrange(opcode, opcode + 4, 16, 4, instr::dump_1c(name + " c"), exec_ctr))
+      .insert(OpcodeInstr::mkfixedrange(opcode + 4, opcode + 6, 16, 4, instr::dump_1c(name + " c"), exec_ctr))
+      .insert(OpcodeInstr::mkfixedrange(opcode + 7, opcode + 8, 16, 4, instr::dump_1c(name + " c"), exec_ctr));
+}
+
+void register_continuation_change_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mkfixed(0xec, 8, 8, std::bind(dump_setcontargs, _1, _2, "SETCONTARGS"), exec_setcontargs))
+      .insert(OpcodeInstr::mkfixed(0xed0, 12, 4, instr::dump_1c("RETURNARGS "), exec_return_args))
+      .insert(OpcodeInstr::mksimple(0xed10, 16, "RETURNVARARGS", exec_return_varargs))
+      .insert(OpcodeInstr::mksimple(0xed11, 16, "SETCONTVARARGS", exec_setcont_varargs))
+      .insert(OpcodeInstr::mksimple(0xed12, 16, "SETNUMVARARGS", exec_setnum_varargs))
+      .insert(OpcodeInstr::mksimple(0xed1e, 16, "BLESS", exec_bless))
+      .insert(OpcodeInstr::mksimple(0xed1f, 16, "BLESSVARARGS", exec_bless_varargs));
+
+  reg_ctr_oprange(cp0, 0xed40, "PUSH", exec_push_ctr);
+  reg_ctr_oprange(cp0, 0xed50, "POP", exec_pop_ctr);
+  reg_ctr_oprange(cp0, 0xed60, "SETCONTCTR", exec_setcont_ctr);
+  reg_ctr_oprange(cp0, 0xed70, "SETRETCTR", exec_setret_ctr);
+  reg_ctr_oprange(cp0, 0xed80, "SETALTCTR", exec_setalt_ctr);
+  reg_ctr_oprange(cp0, 0xed90, "POPSAVE", exec_popsave_ctr);
+  reg_ctr_oprange(cp0, 0xeda0, "SAVECTR", exec_save_ctr);
+  reg_ctr_oprange(cp0, 0xedb0, "SAVEALTCTR", exec_savealt_ctr);
+  reg_ctr_oprange(cp0, 0xedc0, "SAVEBOTHCTR", exec_saveboth_ctr);
+
+  cp0.insert(OpcodeInstr::mksimple(0xede0, 16, "PUSHCTRX", exec_push_ctr_var))
+      .insert(OpcodeInstr::mksimple(0xede1, 16, "POPCTRX", exec_pop_ctr_var))
+      .insert(OpcodeInstr::mksimple(0xede2, 16, "SETCONTCTRX", exec_setcont_ctr_var))
+      .insert(OpcodeInstr::mksimple(0xedf0, 16, "BOOLAND", std::bind(exec_compos, _1, 1, "BOOLAND")))
+      .insert(OpcodeInstr::mksimple(0xedf1, 16, "BOOLOR", std::bind(exec_compos, _1, 2, "BOOLOR")))
+      .insert(OpcodeInstr::mksimple(0xedf2, 16, "COMPOSBOTH", std::bind(exec_compos, _1, 3, "COMPOSBOTH")))
+      .insert(OpcodeInstr::mksimple(0xedf3, 16, "ATEXIT", exec_atexit))
+      .insert(OpcodeInstr::mksimple(0xedf4, 16, "ATEXITALT", exec_atexit_alt))
+      .insert(OpcodeInstr::mksimple(0xedf5, 16, "SETEXITALT", exec_setexit_alt))
+      .insert(OpcodeInstr::mksimple(0xedf6, 16, "THENRET", exec_thenret))
+      .insert(OpcodeInstr::mksimple(0xedf7, 16, "THENRETALT", exec_thenret_alt))
+      .insert(OpcodeInstr::mksimple(0xedf8, 16, "INVERT", exec_invert))
+      .insert(OpcodeInstr::mksimple(0xedf9, 16, "BOOLEVAL", exec_booleval))
+      .insert(OpcodeInstr::mkfixed(0xee, 8, 8, std::bind(dump_setcontargs, _1, _2, "BLESSARGS"), exec_bless_args));
+}
+
+int exec_calldict_short(VmState* st, unsigned args) {
+  args &= 0xff;
+  VM_LOG(st) << "execute CALLDICT " << args;
+  st->get_stack().push_smallint(args);
+  return st->call(st->get_c3());
+}
+
+int exec_calldict(VmState* st, unsigned args) {
+  args &= 0x3fff;
+  VM_LOG(st) << "execute CALLDICT " << args;
+  st->get_stack().push_smallint(args);
+  return st->call(st->get_c3());
+}
+
+int exec_jmpdict(VmState* st, unsigned args) {
+  args &= 0x3fff;
+  VM_LOG(st) << "execute JMPDICT " << args;
+  st->get_stack().push_smallint(args);
+  return st->jump(st->get_c3());
+}
+
+int exec_preparedict(VmState* st, unsigned args) {
+  args &= 0x3fff;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PREPAREDICT " << args;
+  stack.push_smallint(args);
+  stack.push_cont(st->get_c3());
+  return 0;
+}
+
+void register_continuation_dict_jump_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mkfixed(0xf0, 8, 8, instr::dump_1c_and(255, "CALLDICT "), exec_calldict_short))
+      .insert(OpcodeInstr::mkfixed(0xf100 >> 6, 10, 14, instr::dump_1c_and(0x3fff, "CALLDICT "), exec_calldict))
+      .insert(OpcodeInstr::mkfixed(0xf140 >> 6, 10, 14, instr::dump_1c_and(0x3fff, "JMPDICT "), exec_jmpdict))
+      .insert(OpcodeInstr::mkfixed(0xf180 >> 6, 10, 14, instr::dump_1c_and(0x3fff, "PREPAREDICT "), exec_preparedict));
+}
+
+int exec_throw_fixed(VmState* st, unsigned args, unsigned mask, int mode) {
+  unsigned excno = args & mask;
+  VM_LOG(st) << "execute THROW" << (mode ? "IF" : "") << (mode == 2 ? "NOT " : " ") << excno;
+  if (mode && st->get_stack().pop_bool() != (bool)(mode & 1)) {
+    return 0;
+  } else {
+    return st->throw_exception(excno);
+  }
+}
+
+int exec_throw_arg_fixed(VmState* st, unsigned args, unsigned mask, int mode) {
+  unsigned excno = args & mask;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute THROWARG" << (mode ? "IF" : "") << (mode == 2 ? "NOT " : " ") << excno;
+  stack.check_underflow(mode ? 2 : 1);
+  if (mode && stack.pop_bool() != (bool)(mode & 1)) {
+    stack.pop();
+    return 0;
+  } else {
+    return st->throw_exception(excno, stack.pop());
+  }
+}
+
+int exec_throw_any(VmState* st, unsigned args) {
+  bool has_param = args & 1;
+  bool has_cond = args & 6;
+  bool throw_cond = args & 2;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute THROW" << (has_param ? "ARG" : "") << "ANY" << (has_cond ? (throw_cond ? "IF" : "IFNOT") : "");
+  stack.check_underflow(1 + (int)has_cond + (int)has_param);
+  bool flag = has_cond ? stack.pop_bool() : throw_cond;
+  int excno = stack.pop_smallint_range(0xffff);
+  if (flag != throw_cond) {
+    if (has_param) {
+      stack.pop();
+    }
+    return 0;
+  } else if (has_param) {
+    return st->throw_exception(excno, stack.pop());
+  } else {
+    return st->throw_exception(excno);
+  }
+}
+
+std::string dump_throw_any(CellSlice& cs, unsigned args) {
+  bool has_param = args & 1;
+  bool has_cond = args & 6;
+  bool throw_cond = args & 2;
+  std::ostringstream os{has_param ? "THROWARG" : "THROW"};
+  os << "ANY";
+  if (has_cond) {
+    os << (throw_cond ? "IF" : "IFNOT");
+  }
+  return os.str();
+}
+
+int exec_try(VmState* st, int args) {
+  int params = (args >> 4) & 15, retvals = args & 15;
+  Stack& stack = st->get_stack();
+  if (args < 0) {
+    VM_LOG(st) << "execute TRY";
+  } else {
+    VM_LOG(st) << "execute TRYARGS " << params << "," << retvals;
+  }
+  stack.check_underflow(args >= 0 ? params + 2 : 2);
+  auto handler_cont = stack.pop_cont();
+  auto cont = stack.pop_cont();
+  auto old_c2 = st->get_c2();
+  auto cc = (args >= 0 ? st->extract_cc(7, params, retvals) : st->extract_cc(7));
+  ControlRegs* handler_cr = force_cregs(handler_cont);
+  handler_cr->define_c2(std::move(old_c2));
+  handler_cr->define_c0(cc);
+  st->set_c0(std::move(cc));
+  st->set_c2(std::move(handler_cont));
+  return st->jump(std::move(cont));
+}
+
+void register_exception_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mkfixed(0xf200 >> 6, 10, 6, instr::dump_1c_and(0x3f, "THROW "),
+                                  std::bind(exec_throw_fixed, _1, _2, 63, 0)))
+      .insert(OpcodeInstr::mkfixed(0xf240 >> 6, 10, 6, instr::dump_1c_and(0x3f, "THROWIF "),
+                                   std::bind(exec_throw_fixed, _1, _2, 63, 3)))
+      .insert(OpcodeInstr::mkfixed(0xf280 >> 6, 10, 6, instr::dump_1c_and(0x3f, "THROWIFNOT "),
+                                   std::bind(exec_throw_fixed, _1, _2, 63, 2)))
+      .insert(OpcodeInstr::mkfixed(0xf2c0 >> 3, 13, 11, instr::dump_1c_and(0x7ff, "THROW "),
+                                   std::bind(exec_throw_fixed, _1, _2, 0x7ff, 0)))
+      .insert(OpcodeInstr::mkfixed(0xf2c8 >> 3, 13, 11, instr::dump_1c_and(0x7ff, "THROWARG "),
+                                   std::bind(exec_throw_arg_fixed, _1, _2, 0x7ff, 0)))
+      .insert(OpcodeInstr::mkfixed(0xf2d0 >> 3, 13, 11, instr::dump_1c_and(0x7ff, "THROWIF "),
+                                   std::bind(exec_throw_fixed, _1, _2, 0x7ff, 3)))
+      .insert(OpcodeInstr::mkfixed(0xf2d8 >> 3, 13, 11, instr::dump_1c_and(0x7ff, "THROWARGIF "),
+                                   std::bind(exec_throw_arg_fixed, _1, _2, 0x7ff, 3)))
+      .insert(OpcodeInstr::mkfixed(0xf2e0 >> 3, 13, 11, instr::dump_1c_and(0x7ff, "THROWIFNOT "),
+                                   std::bind(exec_throw_fixed, _1, _2, 0x7ff, 2)))
+      .insert(OpcodeInstr::mkfixed(0xf2e8 >> 3, 13, 11, instr::dump_1c_and(0x7ff, "THROWARGIFNOT "),
+                                   std::bind(exec_throw_arg_fixed, _1, _2, 0x7ff, 2)))
+      .insert(OpcodeInstr::mkfixedrange(0xf2f0, 0xf2f6, 16, 3, dump_throw_any, exec_throw_any))
+      .insert(OpcodeInstr::mksimple(0xf2ff, 16, "TRY", std::bind(exec_try, _1, -1)))
+      .insert(OpcodeInstr::mkfixed(0xf3, 8, 8, instr::dump_2c("TRYARGS ", ","), exec_try));
+}
+
+int exec_set_cp_generic(VmState* st, int new_codepage) {
+  st->force_cp(new_codepage);
+  return 0;
+}
+
+int exec_set_cp(VmState* st, int args) {
+  int cp = ((args + 0x10) & 0xff) - 0x10;
+  VM_LOG(st) << "execute SETCP " << cp;
+  return exec_set_cp_generic(st, cp);
+}
+
+int exec_set_cp_any(VmState* st) {
+  VM_LOG(st) << "execute SETCPX";
+  int cp = st->get_stack().pop_smallint_range(0x7fff, -0x8000);
+  return exec_set_cp_generic(st, cp);
+}
+
+void register_codepage_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mkfixedrange(0xff00, 0xfff0, 16, 8, instr::dump_1c_and(0xff, "SETCP "), exec_set_cp))
+      .insert(OpcodeInstr::mkfixedrange(0xfff1, 0x10000, 16, 8, instr::dump_1c_l_add(-256, "SETCP "), exec_set_cp))
+      .insert(OpcodeInstr::mksimple(0xfff0, 16, "SETCPX", exec_set_cp_any));
+}
+
+void register_continuation_ops(OpcodeTable& cp0) {
+  register_continuation_jump_ops(cp0);
+  register_continuation_cond_loop_ops(cp0);
+  register_continuation_change_ops(cp0);
+  register_continuation_dict_jump_ops(cp0);
+  register_exception_ops(cp0);
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/contops.h b/submodules/ton/tonlib-src/crypto/vm/contops.h
new file mode 100644
index 0000000000..5919b07ec9
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/contops.h
@@ -0,0 +1,28 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace vm {
+
+class OpcodeTable;
+
+void register_continuation_ops(OpcodeTable& cp0);
+void register_codepage_ops(OpcodeTable& cp0);
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cp0.cpp b/submodules/ton/tonlib-src/crypto/vm/cp0.cpp
new file mode 100644
index 0000000000..3e062140f2
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cp0.cpp
@@ -0,0 +1,50 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "cp0.h"
+#include "opctable.h"
+#include "stackops.h"
+#include "tupleops.h"
+#include "arithops.h"
+#include "cellops.h"
+#include "contops.h"
+#include "dictops.h"
+#include "debugops.h"
+#include "tonops.h"
+
+namespace vm {
+
+const OpcodeTable* init_op_cp0() {
+  static const OpcodeTable* static_op_cp0 = [] {
+    auto op_cp0 = new OpcodeTable("TEST CODEPAGE", Codepage::test_cp);
+    register_stack_ops(*op_cp0);         // stackops.cpp
+    register_tuple_ops(*op_cp0);         // tupleops.cpp
+    register_arith_ops(*op_cp0);         // arithops.cpp
+    register_cell_ops(*op_cp0);          // cellops.cpp
+    register_continuation_ops(*op_cp0);  // contops.cpp
+    register_dictionary_ops(*op_cp0);    // dictops.cpp
+    register_ton_ops(*op_cp0);           // tonops.cpp
+    register_debug_ops(*op_cp0);         // debugops.cpp
+    register_codepage_ops(*op_cp0);      // contops.cpp
+    op_cp0->finalize()->register_table(Codepage::test_cp);
+    return op_cp0;
+  }();
+  return static_op_cp0;
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/cp0.h b/submodules/ton/tonlib-src/crypto/vm/cp0.h
new file mode 100644
index 0000000000..34fc971142
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/cp0.h
@@ -0,0 +1,28 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/dispatch.h"
+
+namespace vm {
+
+class OpcodeTable;
+
+const OpcodeTable* init_op_cp0();
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/db/BlobView.cpp b/submodules/ton/tonlib-src/crypto/vm/db/BlobView.cpp
new file mode 100644
index 0000000000..2f0ecb0f61
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/db/BlobView.cpp
@@ -0,0 +1,181 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/db/BlobView.h"
+
+#include "td/utils/port/FileFd.h"
+#include "td/utils/HashMap.h"
+
+#include "td/utils/format.h"
+#include "td/utils/port/RwMutex.h"
+#include "td/utils/port/MemoryMapping.h"
+
+#include <limits>
+#include <mutex>
+
+namespace vm {
+td::Result<td::Slice> BlobView::view(td::MutableSlice slice, td::uint64 offset) {
+  if (offset > size() || slice.size() > size() - offset) {
+    return td::Status::Error(PSLICE() << "BlobView: invalid range requested " << td::tag("slice offset", offset)
+                                      << td::tag("slice size", slice.size()) << td::tag("blob size", size()));
+  }
+  return view_impl(slice, offset);
+}
+namespace {
+class BufferSliceBlobViewImpl : public BlobView {
+ public:
+  BufferSliceBlobViewImpl(td::BufferSlice slice) : slice_(std::move(slice)) {
+  }
+  td::Result<td::Slice> view_impl(td::MutableSlice slice, td::uint64 offset) override {
+    // optimize anyway
+    if (offset > std::numeric_limits<std::size_t>::max()) {
+      return td::Slice();
+    }
+    return slice_.as_slice().substr(static_cast<std::size_t>(offset), slice.size());
+  }
+  td::uint64 size() override {
+    return slice_.size();
+  }
+
+ private:
+  td::BufferSlice slice_;
+};
+}  // namespace
+
+std::unique_ptr<BlobView> BufferSliceBlobView::create(td::BufferSlice slice) {
+  return std::make_unique<BufferSliceBlobViewImpl>(std::move(slice));
+}
+
+class FileBlobViewImpl : public BlobView {
+ public:
+  FileBlobViewImpl(td::FileFd fd, td::uint64 file_size) : fd_(std::move(fd)), file_size_(file_size) {
+  }
+
+  td::uint64 size() override {
+    return file_size_;
+  }
+  td::Result<td::Slice> view_impl(td::MutableSlice slice, td::uint64 offset) override {
+    CHECK(offset < size());
+    CHECK(size() - offset >= slice.size());
+    slice.truncate(file_size_ - offset);
+    auto first_page = offset / page_size;
+    auto last_page = (offset + slice.size() - 1) / page_size;
+    td::uint64 res_offset = 0;
+    for (auto page_i = first_page; page_i <= last_page; page_i++) {
+      auto page_offset = page_i * page_size;
+      auto from = td::max(page_offset, offset);
+      auto till = td::min(page_offset + page_size, offset + slice.size());
+      CHECK(from < till);
+      TRY_RESULT(page, load_page(page_i));
+      auto len = till - from;
+      slice.substr(res_offset, len).copy_from(page.substr(from - page_offset, len));
+      res_offset += len;
+    }
+    CHECK(slice.size() == res_offset);
+    total_view_size_ += slice.size();
+    return slice;
+  }
+  ~FileBlobViewImpl() {
+    //LOG(ERROR) << "LOADED " << pages_.size() << " " << total_view_size_;
+  }
+
+ private:
+  td::FileFd fd_;
+  td::uint64 file_size_;
+  const td::uint64 page_size = 4096;
+  td::uint64 total_view_size_{0};
+
+  td::RwMutex pages_rw_mutex_;
+  td::HashMap<td::uint64, td::BufferSlice> pages_;
+
+  std::mutex fd_mutex_;
+
+  td::Result<td::Slice> load_page(td::uint64 page_i) {
+    {
+      auto pages_guard = pages_rw_mutex_.lock_read();
+      auto it = pages_.find(page_i);
+      if (it != pages_.end()) {
+        return it->second.as_slice();
+      }
+    }
+
+    std::lock_guard<std::mutex> fd_guard(fd_mutex_);
+    {
+      auto pages_guard = pages_rw_mutex_.lock_read();
+      auto it = pages_.find(page_i);
+      if (it != pages_.end()) {
+        return it->second.as_slice();
+      }
+    }
+    auto offset = page_i * page_size;
+
+    auto size = td::min(file_size_ - offset, page_size);
+    auto buffer_slice = td::BufferSlice(size);
+    TRY_RESULT(read_size, fd_.pread(buffer_slice.as_slice(), offset));
+    if (read_size != buffer_slice.size()) {
+      return td::Status::Error("not enough data in file");
+    }
+
+    auto pages_guard = pages_rw_mutex_.lock_write();
+    auto &res = pages_[page_i];
+    res = std::move(buffer_slice);
+    return res.as_slice();
+  }
+};
+td::Result<std::unique_ptr<BlobView>> FileBlobView::create(td::CSlice file_path, td::uint64 file_size) {
+  TRY_RESULT(fd, td::FileFd::open(file_path, td::FileFd::Flags::Read));
+  TRY_RESULT(stat, fd.stat());
+  if (file_size == 0) {
+    file_size = stat.size_;
+  } else if (file_size != (td::uint64)stat.size_) {
+    return td::Status::Error("Wrong file size");
+  }
+  return std::make_unique<FileBlobViewImpl>(std::move(fd), file_size);
+}
+
+class FileMemoryMappingBlobViewImpl : public BlobView {
+ public:
+  FileMemoryMappingBlobViewImpl(td::MemoryMapping mapping) : mapping_(std::move(mapping)) {
+  }
+  td::Result<td::Slice> view_impl(td::MutableSlice slice, td::uint64 offset) override {
+    // optimize anyway
+    return mapping_.as_slice().substr(offset, slice.size());
+  }
+  td::uint64 size() override {
+    return mapping_.as_slice().size();
+  }
+
+ private:
+  td::MemoryMapping mapping_;
+};
+
+td::Result<std::unique_ptr<BlobView>> FileMemoryMappingBlobView::create(td::CSlice file_path, td::uint64 file_size) {
+  TRY_RESULT(fd, td::FileFd::open(file_path, td::FileFd::Flags::Read));
+  TRY_RESULT(stat, fd.stat());
+  if (file_size == 0) {
+    file_size = stat.size_;
+  } else if (file_size != (td::uint64)stat.size_) {
+    return td::Status::Error("Wrong file size");
+  }
+
+  TRY_RESULT(mapping, td::MemoryMapping::create_from_file(fd));
+
+  return std::make_unique<FileMemoryMappingBlobViewImpl>(std::move(mapping));
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/db/BlobView.h b/submodules/ton/tonlib-src/crypto/vm/db/BlobView.h
new file mode 100644
index 0000000000..8ba6f215f2
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/db/BlobView.h
@@ -0,0 +1,45 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/utils/buffer.h"
+
+namespace vm {
+class BlobView {
+ public:
+  virtual ~BlobView() = default;
+  td::Result<td::Slice> view(td::MutableSlice slice, td::uint64 offset);
+  virtual td::uint64 size() = 0;
+
+ private:
+  virtual td::Result<td::Slice> view_impl(td::MutableSlice slice, td::uint64 offset) = 0;
+};
+
+class BufferSliceBlobView {
+ public:
+  static std::unique_ptr<BlobView> create(td::BufferSlice slice);
+};
+class FileBlobView {
+ public:
+  static td::Result<std::unique_ptr<BlobView>> create(td::CSlice file_path, td::uint64 file_size = 0);
+};
+class FileMemoryMappingBlobView {
+ public:
+  static td::Result<std::unique_ptr<BlobView>> create(td::CSlice file_path, td::uint64 file_size = 0);
+};
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/db/CellHashTable.h b/submodules/ton/tonlib-src/crypto/vm/db/CellHashTable.h
new file mode 100644
index 0000000000..057c9070fb
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/db/CellHashTable.h
@@ -0,0 +1,71 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/Slice.h"
+
+#include <set>
+
+namespace vm {
+template <class InfoT>
+class CellHashTable {
+ public:
+  template <class F>
+  InfoT &apply(td::Slice hash, F &&f) {
+    auto it = set_.find(hash);
+    if (it != set_.end()) {
+      auto &res = const_cast<InfoT &>(*it);
+      f(res);
+      return res;
+    }
+    InfoT info;
+    f(info);
+    auto &res = const_cast<InfoT &>(*(set_.insert(std::move(info)).first));
+    return res;
+  }
+
+  template <class F>
+  void for_each(F &&f) {
+    for (auto &info : set_) {
+      f(info);
+    }
+  }
+  template <class F>
+  void filter(F &&f) {
+    for (auto it = set_.begin(); it != set_.end();) {
+      if (f(*it)) {
+        it++;
+      } else {
+        it = set_.erase(it);
+      }
+    }
+  }
+  void erase(td::Slice hash) {
+    auto it = set_.find(hash);
+    CHECK(it != set_.end());
+    set_.erase(it);
+  }
+  size_t size() const {
+    return set_.size();
+  }
+
+ private:
+  std::set<InfoT, std::less<>> set_;
+};
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/db/CellStorage.cpp b/submodules/ton/tonlib-src/crypto/vm/db/CellStorage.cpp
new file mode 100644
index 0000000000..317fead335
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/db/CellStorage.cpp
@@ -0,0 +1,163 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/db/CellStorage.h"
+#include "vm/db/DynamicBagOfCellsDb.h"
+#include "vm/boc.h"
+#include "td/utils/base64.h"
+#include "td/utils/tl_parsers.h"
+#include "td/utils/tl_helpers.h"
+
+namespace vm {
+namespace {
+class RefcntCellStorer {
+ public:
+  RefcntCellStorer(td::int32 refcnt, const DataCell &cell) : refcnt_(refcnt), cell_(cell) {
+  }
+
+  template <class StorerT>
+  void store(StorerT &storer) const {
+    using td::store;
+    store(refcnt_, storer);
+    store(cell_, storer);
+    for (unsigned i = 0; i < cell_.size_refs(); i++) {
+      auto cell = cell_.get_ref(i);
+      auto level_mask = cell->get_level_mask();
+      auto level = level_mask.get_level();
+      td::uint8 x = static_cast<td::uint8>(level_mask.get_mask());
+      storer.store_slice(td::Slice(&x, 1));
+      for (unsigned level_i = 0; level_i <= level; level_i++) {
+        if (!level_mask.is_significant(level_i)) {
+          continue;
+        }
+        storer.store_slice(cell->get_hash(level_i).as_slice());
+      }
+      for (unsigned level_i = 0; level_i <= level; level_i++) {
+        if (!level_mask.is_significant(level_i)) {
+          continue;
+        }
+        td::uint8 depth_buf[Cell::depth_bytes];
+        DataCell::store_depth(depth_buf, cell->get_depth(level_i));
+        storer.store_slice(td::Slice(depth_buf, Cell::depth_bytes));
+      }
+    }
+  }
+
+ private:
+  td::int32 refcnt_;
+  const DataCell &cell_;
+};
+
+class RefcntCellParser {
+ public:
+  RefcntCellParser(bool need_data) : need_data_(need_data) {
+  }
+  td::int32 refcnt;
+  Ref<DataCell> cell;
+
+  template <class ParserT>
+  void parse(ParserT &parser, ExtCellCreator &ext_cell_creator) {
+    using ::td::parse;
+    parse(refcnt, parser);
+    if (!need_data_) {
+      return;
+    }
+    auto status = [&]() -> td::Status {
+      TRY_STATUS(parser.get_status());
+      auto size = parser.get_left_len();
+      td::Slice data = parser.template fetch_string_raw<td::Slice>(size);
+      CellSerializationInfo info;
+      auto cell_data = data;
+      TRY_STATUS(info.init(cell_data, 0 /*ref_byte_size*/));
+      data = data.substr(info.end_offset);
+
+      Ref<Cell> refs[Cell::max_refs];
+      for (int i = 0; i < info.refs_cnt; i++) {
+        if (data.size() < 1) {
+          return td::Status::Error("Not enought data");
+        }
+        Cell::LevelMask level_mask(data[0]);
+        auto n = level_mask.get_hashes_count();
+        auto end_offset = 1 + n * (Cell::hash_bytes + Cell::depth_bytes);
+        if (data.size() < end_offset) {
+          return td::Status::Error("Not enought data");
+        }
+
+        TRY_RESULT(ext_cell, ext_cell_creator.ext_cell(level_mask, data.substr(1, n * Cell::hash_bytes),
+                                                       data.substr(1 + n * Cell::hash_bytes, n * Cell::depth_bytes)));
+        refs[i] = std::move(ext_cell);
+        CHECK(refs[i]->get_level() == level_mask.get_level());
+        data = data.substr(end_offset);
+      }
+      if (!data.empty()) {
+        return td::Status::Error("Too much data");
+      }
+      TRY_RESULT(data_cell, info.create_data_cell(cell_data, td::Span<Ref<Cell>>(refs, info.refs_cnt)));
+      cell = std::move(data_cell);
+      return td::Status::OK();
+    }();
+    if (status.is_error()) {
+      parser.set_error(status.message().str());
+      return;
+    }
+  }
+
+ private:
+  bool need_data_;
+};
+}  // namespace
+
+CellLoader::CellLoader(std::shared_ptr<KeyValueReader> reader) : reader_(std::move(reader)) {
+  CHECK(reader_);
+}
+
+td::Result<CellLoader::LoadResult> CellLoader::load(td::Slice hash, bool need_data, ExtCellCreator &ext_cell_creator) {
+  //LOG(ERROR) << "Storage: load cell " << hash.size() << " " << td::base64_encode(hash);
+  LoadResult res;
+  std::string serialized;
+  TRY_RESULT(get_status, reader_->get(hash, serialized));
+  if (get_status != KeyValue::GetStatus::Ok) {
+    DCHECK(get_status == KeyValue::GetStatus::NotFound);
+    return res;
+  }
+
+  res.status = LoadResult::Ok;
+
+  RefcntCellParser refcnt_cell(need_data);
+  td::TlParser parser(serialized);
+  refcnt_cell.parse(parser, ext_cell_creator);
+  TRY_STATUS(parser.get_status());
+
+  res.refcnt_ = refcnt_cell.refcnt;
+  res.cell_ = std::move(refcnt_cell.cell);
+  //CHECK(res.cell_->get_hash() == hash);
+
+  return res;
+}
+
+CellStorer::CellStorer(KeyValue &kv) : kv_(kv) {
+}
+
+td::Status CellStorer::erase(td::Slice hash) {
+  return kv_.erase(hash);
+}
+
+td::Status CellStorer::set(td::int32 refcnt, const DataCell &cell) {
+  return kv_.set(cell.get_hash().as_slice(), td::serialize(RefcntCellStorer(refcnt, cell)));
+}
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/db/CellStorage.h b/submodules/ton/tonlib-src/crypto/vm/db/CellStorage.h
new file mode 100644
index 0000000000..26e023304c
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/db/CellStorage.h
@@ -0,0 +1,65 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/db/KeyValue.h"
+#include "vm/db/DynamicBagOfCellsDb.h"
+#include "vm/cells.h"
+
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+namespace vm {
+using KeyValue = td::KeyValue;
+using KeyValueReader = td::KeyValueReader;
+
+class CellLoader {
+ public:
+  struct LoadResult {
+   public:
+    enum { Ok, NotFound } status{NotFound};
+
+    Ref<DataCell> &cell() {
+      DCHECK(status == Ok);
+      return cell_;
+    }
+
+    td::int32 refcnt() const {
+      return refcnt_;
+    }
+
+    Ref<DataCell> cell_;
+    td::int32 refcnt_{0};
+  };
+  CellLoader(std::shared_ptr<KeyValueReader> reader);
+  td::Result<LoadResult> load(td::Slice hash, bool need_data, ExtCellCreator &ext_cell_creator);
+
+ private:
+  std::shared_ptr<KeyValueReader> reader_;
+};
+
+class CellStorer {
+ public:
+  CellStorer(KeyValue &kv);
+  td::Status erase(td::Slice hash);
+  td::Status set(td::int32 refcnt, const DataCell &cell);
+
+ private:
+  KeyValue &kv_;
+};
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/db/DynamicBagOfCellsDb.cpp b/submodules/ton/tonlib-src/crypto/vm/db/DynamicBagOfCellsDb.cpp
new file mode 100644
index 0000000000..732c1691b0
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/db/DynamicBagOfCellsDb.cpp
@@ -0,0 +1,500 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/db/DynamicBagOfCellsDb.h"
+#include "vm/db/CellStorage.h"
+#include "vm/db/CellHashTable.h"
+
+#include "vm/cells/ExtCell.h"
+
+#include "td/utils/base64.h"
+#include "td/utils/format.h"
+#include "td/utils/ThreadSafeCounter.h"
+
+#include "vm/cellslice.h"
+
+namespace vm {
+namespace {
+
+class CellDbReader {
+ public:
+  virtual ~CellDbReader() = default;
+  virtual td::Result<Ref<DataCell>> load_cell(td::Slice hash) = 0;
+};
+
+struct DynamicBocExtCellExtra {
+  std::shared_ptr<CellDbReader> reader;
+};
+
+class DynamicBocCellLoader {
+ public:
+  static td::Result<Ref<DataCell>> load_data_cell(const Cell &cell, const DynamicBocExtCellExtra &extra) {
+    return extra.reader->load_cell(cell.get_hash().as_slice());
+  }
+};
+
+using DynamicBocExtCell = ExtCell<DynamicBocExtCellExtra, DynamicBocCellLoader>;
+
+struct CellInfo {
+  bool sync_with_db{false};
+  bool in_db{false};
+
+  bool was_dfs_new_cells{false};
+  bool was{false};
+
+  td::int32 db_refcnt{0};
+  td::int32 refcnt_diff{0};
+  Ref<Cell> cell;
+  Cell::Hash key() const {
+    return cell->get_hash();
+  }
+  bool operator<(const CellInfo &other) const {
+    return key() < other.key();
+  }
+};
+
+bool operator<(const CellInfo &a, td::Slice b) {
+  return a.key().as_slice() < b;
+}
+
+bool operator<(td::Slice a, const CellInfo &b) {
+  return a < b.key().as_slice();
+}
+
+class DynamicBagOfCellsDbImpl : public DynamicBagOfCellsDb, private ExtCellCreator {
+ public:
+  DynamicBagOfCellsDbImpl() {
+    get_thread_safe_counter().add(1);
+  }
+  ~DynamicBagOfCellsDbImpl() {
+    get_thread_safe_counter().add(-1);
+    reset_cell_db_reader();
+  }
+  td::Result<Ref<Cell>> ext_cell(Cell::LevelMask level_mask, td::Slice hash, td::Slice depth) override {
+    return get_cell_info_lazy(level_mask, hash, depth).cell;
+  }
+  td::Result<Ref<DataCell>> load_cell(td::Slice hash) override {
+    TRY_RESULT(loaded_cell, get_cell_info_force(hash).cell->load_cell());
+    return std::move(loaded_cell.data_cell);
+  }
+  CellInfo &get_cell_info_force(td::Slice hash) {
+    return hash_table_.apply(hash, [&](CellInfo &info) { update_cell_info_force(info, hash); });
+  }
+  CellInfo &get_cell_info_lazy(Cell::LevelMask level_mask, td::Slice hash, td::Slice depth) {
+    return hash_table_.apply(hash.substr(hash.size() - Cell::hash_bytes),
+                             [&](CellInfo &info) { update_cell_info_lazy(info, level_mask, hash, depth); });
+  }
+  CellInfo &get_cell_info(const Ref<Cell> &cell) {
+    return hash_table_.apply(cell->get_hash().as_slice(), [&](CellInfo &info) { update_cell_info(info, cell); });
+  }
+
+  void inc(const Ref<Cell> &cell) override {
+    if (cell.is_null()) {
+      return;
+    }
+    if (cell->get_virtualization() != 0) {
+      return;
+    }
+    //LOG(ERROR) << "INC";
+    //CellSlice(cell, nullptr).print_rec(std::cout);
+    to_inc_.push_back(cell);
+  }
+  void dec(const Ref<Cell> &cell) override {
+    if (cell.is_null()) {
+      return;
+    }
+    if (cell->get_virtualization() != 0) {
+      return;
+    }
+    //LOG(ERROR) << "DEC";
+    //CellSlice(cell, nullptr).print_rec(std::cout);
+    to_dec_.push_back(cell);
+  }
+
+  bool is_prepared_for_commit() {
+    return to_inc_.empty() && to_dec_.empty();
+  }
+
+  Stats get_stats_diff() override {
+    CHECK(is_prepared_for_commit());
+    return stats_diff_;
+  }
+
+  td::Status prepare_commit() override {
+    if (is_prepared_for_commit()) {
+      return td::Status::OK();
+    }
+    //LOG(ERROR) << "dfs_new_cells_in_db";
+    for (auto &new_cell : to_inc_) {
+      auto &new_cell_info = get_cell_info(new_cell);
+      dfs_new_cells_in_db(new_cell_info);
+    }
+    //return td::Status::OK();
+    //LOG(ERROR) << "dfs_new_cells";
+    for (auto &new_cell : to_inc_) {
+      auto &new_cell_info = get_cell_info(new_cell);
+      dfs_new_cells(new_cell_info);
+    }
+
+    //LOG(ERROR) << "dfs_old_cells";
+    for (auto &old_cell : to_dec_) {
+      auto &old_cell_info = get_cell_info(old_cell);
+      dfs_old_cells(old_cell_info);
+    }
+
+    //LOG(ERROR) << "save_diff_prepare";
+    save_diff_prepare();
+
+    to_inc_.clear();
+    to_dec_.clear();
+
+    return td::Status::OK();
+  }
+
+  td::Status commit(CellStorer &storer) override {
+    prepare_commit();
+    save_diff(storer);
+    // Some elements are erased from hash table, to keep it small.
+    // Hash table is no longer represents the difference between the loader and
+    // the current bag of cells.
+    reset_cell_db_reader();
+    return td::Status::OK();
+  }
+
+  td::Status set_loader(std::unique_ptr<CellLoader> loader) override {
+    reset_cell_db_reader();
+    loader_ = std::move(loader);
+    //cell_db_reader_ = std::make_shared<CellDbReaderImpl>(this);
+    // Temporary(?) fix to make ExtCell thread safe.
+    // Downside(?) - loaded cells won't be cached
+    cell_db_reader_ = std::make_shared<CellDbReaderImpl>(std::make_unique<CellLoader>(*loader_));
+    stats_diff_ = {};
+    return td::Status::OK();
+  }
+
+ private:
+  std::unique_ptr<CellLoader> loader_;
+  std::vector<Ref<Cell>> to_inc_;
+  std::vector<Ref<Cell>> to_dec_;
+  CellHashTable<CellInfo> hash_table_;
+  std::vector<CellInfo *> visited_;
+  Stats stats_diff_;
+
+  static td::NamedThreadSafeCounter::CounterRef get_thread_safe_counter() {
+    static auto res = td::NamedThreadSafeCounter::get_default().get_counter("DynamicBagOfCellsDb");
+    return res;
+  }
+
+  class CellDbReaderImpl : public CellDbReader,
+                           private ExtCellCreator,
+                           public std::enable_shared_from_this<CellDbReaderImpl> {
+   public:
+    CellDbReaderImpl(std::unique_ptr<CellLoader> cell_loader) : db_(nullptr), cell_loader_(std::move(cell_loader)) {
+      if (cell_loader_) {
+        get_thread_safe_counter().add(1);
+      }
+    }
+    CellDbReaderImpl(DynamicBagOfCellsDb *db) : db_(db) {
+    }
+    ~CellDbReaderImpl() {
+      if (cell_loader_) {
+        get_thread_safe_counter().add(-1);
+      }
+    }
+    void set_loader(std::unique_ptr<CellLoader> cell_loader) {
+      if (cell_loader_) {
+        // avoid race
+        return;
+      }
+      cell_loader_ = std::move(cell_loader);
+      db_ = nullptr;
+      if (cell_loader_) {
+        get_thread_safe_counter().add(1);
+      }
+    }
+
+    td::Result<Ref<Cell>> ext_cell(Cell::LevelMask level_mask, td::Slice hash, td::Slice depth) override {
+      CHECK(!db_);
+      TRY_RESULT(ext_cell, DynamicBocExtCell::create(PrunnedCellInfo{level_mask, hash, depth},
+                                                     DynamicBocExtCellExtra{shared_from_this()}));
+      return std::move(ext_cell);
+    }
+
+    td::Result<Ref<DataCell>> load_cell(td::Slice hash) override {
+      if (db_) {
+        return db_->load_cell(hash);
+      }
+      TRY_RESULT(load_result, cell_loader_->load(hash, true, *this));
+      CHECK(load_result.status == CellLoader::LoadResult::Ok);
+      return std::move(load_result.cell());
+    }
+
+   private:
+    static td::NamedThreadSafeCounter::CounterRef get_thread_safe_counter() {
+      static auto res = td::NamedThreadSafeCounter::get_default().get_counter("DynamicBagOfCellsDbLoader");
+      return res;
+    }
+    DynamicBagOfCellsDb *db_;
+    std::unique_ptr<CellLoader> cell_loader_;
+  };
+
+  std::shared_ptr<CellDbReaderImpl> cell_db_reader_;
+
+  void reset_cell_db_reader() {
+    if (!cell_db_reader_) {
+      return;
+    }
+    cell_db_reader_->set_loader(std::move(loader_));
+    cell_db_reader_.reset();
+    //EXPERIMENTAL: clear cache to drop all references to old reader.
+    hash_table_ = {};
+  }
+
+  bool is_in_db(CellInfo &info) {
+    if (info.in_db) {
+      return true;
+    }
+    load_cell(info);
+    return info.in_db;
+  }
+  bool is_loaded(CellInfo &info) {
+    return info.sync_with_db;
+  }
+
+  void load_cell(CellInfo &info) {
+    if (is_loaded(info)) {
+      return;
+    }
+    do_load_cell(info);
+  }
+
+  bool dfs_new_cells_in_db(CellInfo &info) {
+    if (info.sync_with_db) {
+      return is_in_db(info);
+    }
+    if (info.in_db) {
+      return true;
+    }
+
+    bool not_in_db = false;
+    for_each(
+        info, [&not_in_db, this](auto &child_info) { not_in_db |= !dfs_new_cells_in_db(child_info); }, false);
+
+    if (not_in_db) {
+      CHECK(!info.in_db);
+      info.sync_with_db = true;
+    }
+    return is_in_db(info);
+  }
+
+  void dfs_new_cells(CellInfo &info) {
+    info.refcnt_diff++;
+    if (!info.was) {
+      info.was = true;
+      visited_.push_back(&info);
+    }
+    //LOG(ERROR) << "dfs new " << td::format::escaped(info.cell->hash());
+
+    if (info.was_dfs_new_cells) {
+      return;
+    }
+    info.was_dfs_new_cells = true;
+
+    if (is_in_db(info)) {
+      return;
+    }
+
+    CHECK(is_loaded(info));
+    for_each(info, [this](auto &child_info) { dfs_new_cells(child_info); });
+  }
+
+  void dfs_old_cells(CellInfo &info) {
+    info.refcnt_diff--;
+    if (!info.was) {
+      info.was = true;
+      visited_.push_back(&info);
+    }
+    //LOG(ERROR) << "dfs old " << td::format::escaped(info.cell->hash());
+
+    load_cell(info);
+
+    auto new_refcnt = info.refcnt_diff + info.db_refcnt;
+    CHECK(new_refcnt >= 0);
+    if (new_refcnt != 0) {
+      return;
+    }
+
+    for_each(info, [this](auto &child_info) { dfs_old_cells(child_info); });
+  }
+
+  void save_diff_prepare() {
+    stats_diff_ = {};
+    for (auto info_ptr : visited_) {
+      save_cell_prepare(*info_ptr);
+    }
+  }
+
+  void save_diff(CellStorer &storer) {
+    //LOG(ERROR) << hash_table_.size();
+    for (auto info_ptr : visited_) {
+      save_cell(*info_ptr, storer);
+    }
+    visited_.clear();
+  }
+
+  void save_cell_prepare(CellInfo &info) {
+    if (info.refcnt_diff == 0) {
+      //CellSlice(info.cell, nullptr).print_rec(std::cout);
+      return;
+    }
+    load_cell(info);
+
+    auto loaded_cell = info.cell->load_cell().move_as_ok();
+    if (info.db_refcnt + info.refcnt_diff == 0) {
+      CHECK(info.in_db);
+      // erase
+      stats_diff_.cells_total_count--;
+      stats_diff_.cells_total_size -= loaded_cell.data_cell->get_serialized_size(true);
+    } else {
+      //save
+      if (info.in_db == false) {
+        stats_diff_.cells_total_count++;
+        stats_diff_.cells_total_size += loaded_cell.data_cell->get_serialized_size(true);
+      }
+    }
+  }
+
+  void save_cell(CellInfo &info, CellStorer &storer) {
+    auto guard = td::ScopeExit{} + [&] {
+      info.was_dfs_new_cells = false;
+      info.was = false;
+    };
+    if (info.refcnt_diff == 0) {
+      //CellSlice(info.cell, nullptr).print_rec(std::cout);
+      return;
+    }
+    CHECK(info.sync_with_db);
+
+    info.db_refcnt += info.refcnt_diff;
+    info.refcnt_diff = 0;
+
+    if (info.db_refcnt == 0) {
+      CHECK(info.in_db);
+      //LOG(ERROR) << "ERASE";
+      //CellSlice(NoVm(), info.cell).print_rec(std::cout);
+      storer.erase(info.cell->get_hash().as_slice());
+      info.in_db = false;
+      hash_table_.erase(info.cell->get_hash().as_slice());
+      guard.dismiss();
+    } else {
+      //LOG(ERROR) << "SAVE " << info.db_refcnt;
+      //CellSlice(NoVm(), info.cell).print_rec(std::cout);
+      auto loaded_cell = info.cell->load_cell().move_as_ok();
+      storer.set(info.db_refcnt, *loaded_cell.data_cell);
+      info.in_db = true;
+    }
+  }
+
+  template <class F>
+  void for_each(CellInfo &info, F &&f, bool force = true) {
+    auto cell = info.cell;
+
+    if (!cell->is_loaded()) {
+      if (!force) {
+        return;
+      }
+      load_cell(info);
+      cell = info.cell;
+    }
+    if (!cell->is_loaded()) {
+      cell->load_cell().ensure();
+    }
+    CHECK(cell->is_loaded());
+    vm::CellSlice cs(vm::NoVm{}, cell);  // FIXME
+    for (unsigned i = 0; i < cs.size_refs(); i++) {
+      //LOG(ERROR) << "---> " << td::format::escaped(cell->ref(i)->hash());
+      f(get_cell_info(cs.prefetch_ref(i)));
+    }
+  }
+
+  void do_load_cell(CellInfo &info) {
+    update_cell_info_force(info, info.cell->get_hash().as_slice());
+  }
+
+  void update_cell_info(CellInfo &info, const Ref<Cell> &cell) {
+    CHECK(!cell.is_null());
+    if (info.sync_with_db) {
+      return;
+    }
+    info.cell = cell;
+  }
+
+  void update_cell_info_lazy(CellInfo &info, Cell::LevelMask level_mask, td::Slice hash, td::Slice depth) {
+    if (info.sync_with_db) {
+      CHECK(info.cell.not_null());
+      CHECK(info.cell->get_level_mask() == level_mask);
+      return;
+    }
+    if (info.cell.is_null()) {
+      auto ext_cell_r = create_empty_ext_cell(level_mask, hash, depth);
+      if (ext_cell_r.is_error()) {
+        //FIXME
+        LOG(ERROR) << "Failed to create ext_cell" << ext_cell_r.error();
+        return;
+      }
+      info.cell = ext_cell_r.move_as_ok();
+      info.in_db = true;  // TODO
+    }
+  }
+  void update_cell_info_force(CellInfo &info, td::Slice hash) {
+    if (info.sync_with_db) {
+      return;
+    }
+
+    do {
+      CHECK(loader_);
+      auto r_res = loader_->load(hash, true, *this);
+      if (r_res.is_error()) {
+        //FIXME
+        LOG(ERROR) << "Failed to load cell from db" << r_res.error();
+        break;
+      }
+      auto res = r_res.move_as_ok();
+      if (res.status != CellLoader::LoadResult::Ok) {
+        break;
+      }
+      info.cell = std::move(res.cell());
+      CHECK(info.cell->get_hash().as_slice() == hash);
+      info.in_db = true;
+      info.db_refcnt = res.refcnt();
+    } while (false);
+    info.sync_with_db = true;
+  }
+
+  td::Result<Ref<Cell>> create_empty_ext_cell(Cell::LevelMask level_mask, td::Slice hash, td::Slice depth) {
+    TRY_RESULT(res, DynamicBocExtCell::create(PrunnedCellInfo{level_mask, hash, depth},
+                                              DynamicBocExtCellExtra{cell_db_reader_}));
+    return std::move(res);
+  }
+};
+}  // namespace
+
+std::unique_ptr<DynamicBagOfCellsDb> DynamicBagOfCellsDb::create() {
+  return std::make_unique<DynamicBagOfCellsDbImpl>();
+}
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/db/DynamicBagOfCellsDb.h b/submodules/ton/tonlib-src/crypto/vm/db/DynamicBagOfCellsDb.h
new file mode 100644
index 0000000000..54055a2569
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/db/DynamicBagOfCellsDb.h
@@ -0,0 +1,62 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cells.h"
+
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+namespace vm {
+class CellLoader;
+class CellStorer;
+}  // namespace vm
+
+namespace vm {
+class ExtCellCreator {
+ public:
+  virtual ~ExtCellCreator() = default;
+  virtual td::Result<Ref<Cell>> ext_cell(Cell::LevelMask level_mask, td::Slice hash, td::Slice depth) = 0;
+};
+
+class DynamicBagOfCellsDb {
+ public:
+  virtual ~DynamicBagOfCellsDb() = default;
+  virtual td::Result<Ref<DataCell>> load_cell(td::Slice hash) = 0;
+  struct Stats {
+    td::int64 cells_total_count{0};
+    td::int64 cells_total_size{0};
+    void apply_diff(Stats diff) {
+      cells_total_count += diff.cells_total_count;
+      cells_total_size += diff.cells_total_size;
+    }
+  };
+  virtual void inc(const Ref<Cell> &old_root) = 0;
+  virtual void dec(const Ref<Cell> &old_root) = 0;
+
+  virtual td::Status prepare_commit() = 0;
+  virtual Stats get_stats_diff() = 0;
+  virtual td::Status commit(CellStorer &) = 0;
+
+  // restart with new loader will also reset stats_diff
+  virtual td::Status set_loader(std::unique_ptr<CellLoader> loader) = 0;
+
+  static std::unique_ptr<DynamicBagOfCellsDb> create();
+};
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/db/StaticBagOfCellsDb.cpp b/submodules/ton/tonlib-src/crypto/vm/db/StaticBagOfCellsDb.cpp
new file mode 100644
index 0000000000..b69b917def
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/db/StaticBagOfCellsDb.cpp
@@ -0,0 +1,545 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/db/StaticBagOfCellsDb.h"
+
+#include "vm/cells/CellWithStorage.h"
+#include "vm/boc.h"
+
+#include "vm/cells/ExtCell.h"
+
+#include "td/utils/crypto.h"
+#include "td/utils/format.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/RwMutex.h"
+#include "td/utils/ConcurrentHashTable.h"
+
+#include <limits>
+
+namespace vm {
+//
+// Common interface
+//
+template <class ExtraT>
+class RootCell : public Cell {
+  struct PrivateTag {};
+
+ public:
+  td::Result<LoadedCell> load_cell() const override {
+    return cell_->load_cell();
+  }
+  Ref<Cell> virtualize(VirtualizationParameters virt) const override {
+    return cell_->virtualize(virt);
+  }
+  td::uint32 get_virtualization() const override {
+    return cell_->get_virtualization();
+  }
+  CellUsageTree::NodePtr get_tree_node() const override {
+    return cell_->get_tree_node();
+  }
+  bool is_loaded() const override {
+    return cell_->is_loaded();
+  }
+
+  // hash and level
+  LevelMask get_level_mask() const override {
+    return cell_->get_level_mask();
+  }
+
+  template <class T>
+  static Ref<Cell> create(Ref<Cell> cell, T&& extra) {
+    return Ref<RootCell>(true, std::move(cell), std::forward<T>(extra), PrivateTag{});
+  }
+  template <class T>
+  RootCell(Ref<Cell> cell, T&& extra, PrivateTag) : cell_(std::move(cell)), extra_(std::forward<T>(extra)) {
+  }
+
+ private:
+  Ref<Cell> cell_;
+  ExtraT extra_;
+  td::uint16 do_get_depth(td::uint32 level) const override {
+    return cell_->get_depth(level);
+  }
+  const Hash do_get_hash(td::uint32 level) const override {
+    return cell_->get_hash(level);
+  }
+};
+
+class DataCellCacheNoop {
+ public:
+  Ref<DataCell> store(int idx, Ref<DataCell> cell) {
+    return cell;
+  }
+  Ref<DataCell> load(int idx) {
+    return {};
+  }
+  void clear() {
+  }
+};
+class DataCellCacheMutex {
+ public:
+  Ref<DataCell> store(int idx, Ref<DataCell> cell) {
+    auto lock = cells_rw_mutex_.lock_write();
+    return cells_.emplace(idx, std::move(cell)).first->second;
+  }
+  Ref<DataCell> load(int idx) {
+    auto lock = cells_rw_mutex_.lock_read();
+    auto it = cells_.find(idx);
+    if (it != cells_.end()) {
+      return it->second;
+    }
+    return {};
+  }
+  void clear() {
+    auto guard = cells_rw_mutex_.lock_write();
+    cells_.clear();
+  }
+
+ private:
+  td::RwMutex cells_rw_mutex_;
+  td::HashMap<int, Ref<DataCell>> cells_;
+};
+
+class DataCellCacheTdlib {
+ public:
+  Ref<DataCell> store(int idx, Ref<DataCell> cell) {
+    return Ref<DataCell>(cells_.insert(as_key(idx), cell.get()));
+  }
+  Ref<DataCell> load(int idx) {
+    return Ref<DataCell>(cells_.find(as_key(idx), nullptr));
+  }
+
+  void clear() {
+    cells_.for_each([](auto key, auto value) { Ref<DataCell>{value}; });
+  }
+
+ private:
+  td::ConcurrentHashMap<td::uint32, const DataCell*> cells_;
+  td::uint32 as_key(int idx) {
+    td::uint32 key = static_cast<td::uint32>(idx + 1);
+    key *= 1000000007;
+    return key;
+  }
+};
+
+struct StaticBocExtCellExtra {
+  int idx;
+  std::weak_ptr<StaticBagOfCellsDb> deserializer;
+};
+
+class StaticBocLoader {
+ public:
+  static td::Result<Ref<DataCell>> load_data_cell(const Cell& cell, const StaticBocExtCellExtra& extra) {
+    auto deserializer = extra.deserializer.lock();
+    if (!deserializer) {
+      return td::Status::Error("StaticBocDb is already destroyed, cannot fetch cell");
+    }
+    return deserializer->load_by_idx(extra.idx);
+  }
+};
+using StaticBocExtCell = ExtCell<StaticBocExtCellExtra, StaticBocLoader>;
+using StaticBocRootCell = RootCell<std::shared_ptr<StaticBagOfCellsDb>>;
+
+td::Result<Ref<Cell>> StaticBagOfCellsDb::create_ext_cell(Cell::LevelMask level_mask, td::Slice hash, td::Slice depth,
+                                                          int idx) {
+  TRY_RESULT(res, StaticBocExtCell::create(PrunnedCellInfo{level_mask, hash, depth},
+                                           StaticBocExtCellExtra{idx, shared_from_this()}));
+  return std::move(res);
+}
+
+//
+// Baseline implementation
+//
+class StaticBagOfCellsDbBaselineImpl : public StaticBagOfCellsDb {
+ public:
+  StaticBagOfCellsDbBaselineImpl(std::vector<Ref<Cell>> roots) : roots_(std::move(roots)) {
+  }
+  td::Result<size_t> get_root_count() override {
+    return roots_.size();
+  };
+  td::Result<Ref<Cell>> get_root_cell(size_t idx) override {
+    if (idx >= roots_.size()) {
+      return td::Status::Error(PSLICE() << "invalid root_cell index: " << idx);
+    }
+    return roots_[idx];
+  };
+
+ private:
+  std::vector<Ref<Cell>> roots_;
+
+  td::Result<Ref<DataCell>> load_by_idx(int idx) override {
+    UNREACHABLE();
+  }
+};
+
+td::Result<std::shared_ptr<StaticBagOfCellsDb>> StaticBagOfCellsDbBaseline::create(std::unique_ptr<BlobView> data) {
+  std::string buf(data->size(), '\0');
+  TRY_RESULT(slice, data->view(buf, 0));
+  return create(slice);
+}
+
+td::Result<std::shared_ptr<StaticBagOfCellsDb>> StaticBagOfCellsDbBaseline::create(td::Slice data) {
+  BagOfCells boc;
+  TRY_RESULT(x, boc.deserialize(data));
+  if (x <= 0) {
+    return td::Status::Error("failed to deserialize");
+  }
+  std::vector<Ref<Cell>> roots(boc.get_root_count());
+  for (int i = 0; i < boc.get_root_count(); i++) {
+    roots[i] = boc.get_root_cell(i);
+  }
+  return std::make_shared<StaticBagOfCellsDbBaselineImpl>(std::move(roots));
+}
+
+//
+// Main implementation
+//
+class StaticBagOfCellsDbLazyImpl : public StaticBagOfCellsDb {
+ public:
+  explicit StaticBagOfCellsDbLazyImpl(std::unique_ptr<BlobView> data, StaticBagOfCellsDbLazy::Options options)
+      : data_(std::move(data)), options_(std::move(options)) {
+    get_thread_safe_counter().add(1);
+  }
+  td::Result<size_t> get_root_count() override {
+    TRY_STATUS(check_status());
+    TRY_STATUS(check_result(load_header()));
+    return info_.root_count;
+  };
+  td::Result<Ref<Cell>> get_root_cell(size_t idx) override {
+    TRY_STATUS(check_status());
+    TRY_RESULT(root_count, get_root_count());
+    if (idx >= root_count) {
+      return td::Status::Error(PSLICE() << "invalid root_cell index: " << idx);
+    }
+    TRY_RESULT(cell_idx, load_root_idx(td::narrow_cast<int>(idx)));
+    // Load DataCell in order to ensure lower hashes correctness
+    // They will be valid for all non-root cell automaically
+    TRY_RESULT(data_cell, check_result(load_data_cell(td::narrow_cast<int>(cell_idx))));
+    return create_root_cell(std::move(data_cell));
+  };
+
+  ~StaticBagOfCellsDbLazyImpl() {
+    //LOG(ERROR) << deserialize_cell_cnt_ << " " << deserialize_cell_hash_cnt_;
+    get_thread_safe_counter().add(-1);
+  }
+
+ private:
+  std::atomic<bool> should_cache_cells_{true};
+  std::unique_ptr<BlobView> data_;
+  StaticBagOfCellsDbLazy::Options options_;
+  bool has_info_{false};
+  BagOfCells::Info info_;
+
+  std::mutex index_i_mutex_;
+  td::RwMutex index_data_rw_mutex_;
+  std::string index_data_;
+  std::atomic<int> index_i_{0};
+  size_t index_offset_{0};
+  DataCellCacheMutex cells_;
+  //DataCellCacheNoop cells_;
+  //DataCellCacheTdlib cells_;
+  int next_idx_{0};
+  Ref<Cell> empty_cell_;
+
+  //stats
+  td::ThreadSafeCounter deserialize_cell_cnt_;
+  td::ThreadSafeCounter deserialize_cell_hash_cnt_;
+
+  std::atomic<bool> has_error_{false};
+  std::mutex status_mutex_;
+  td::Status status_;
+
+  static td::NamedThreadSafeCounter::CounterRef get_thread_safe_counter() {
+    static auto res = td::NamedThreadSafeCounter::get_default().get_counter("StaticBagOfCellsDbLazy");
+    return res;
+  }
+
+  td::Status check_status() TD_WARN_UNUSED_RESULT {
+    if (has_error_.load(std::memory_order_relaxed)) {
+      std::lock_guard<std::mutex> guard(status_mutex_);
+      return status_.clone();
+    }
+    return td::Status::OK();
+  }
+  template <class T>
+  T check_result(T&& to_check) {
+    CHECK(status_.is_ok());
+    if (to_check.is_error()) {
+      std::lock_guard<std::mutex> guard(status_mutex_);
+      has_error_.store(true);
+      status_ = to_check.error().clone();
+    }
+    return std::forward<T>(to_check);
+  }
+
+  td::Result<Ref<DataCell>> load_by_idx(int idx) override {
+    TRY_STATUS(check_status());
+    return check_result(load_data_cell(idx));
+  }
+
+  struct Ptr {
+    td::MutableSlice as_slice() {
+      return data;
+    }
+    td::string data;
+  };
+  // May be optimized
+  auto alloc(size_t size) {
+    //return td::StackAllocator::alloc(size);
+    return Ptr{std::string(size, '\0')};
+  }
+
+  td::Result<size_t> load_idx_offset(int idx) {
+    if (idx < 0) {
+      return 0;
+    }
+    td::Slice offset_view;
+    CHECK(info_.offset_byte_size <= 8);
+    char arr[8];
+    td::RwMutex::ReadLock guard;
+    if (info_.has_index) {
+      TRY_RESULT(new_offset_view, data_->view(td::MutableSlice(arr, info_.offset_byte_size),
+                                              info_.index_offset + idx * info_.offset_byte_size));
+      offset_view = new_offset_view;
+    } else {
+      guard = index_data_rw_mutex_.lock_read().move_as_ok();
+      offset_view = td::Slice(index_data_).substr(idx * info_.offset_byte_size, info_.offset_byte_size);
+    }
+
+    CHECK(offset_view.size() == (size_t)info_.offset_byte_size);
+    return td::narrow_cast<std::size_t>(info_.read_offset(offset_view.ubegin()));
+  }
+
+  td::Result<td::int64> load_root_idx(int root_i) {
+    CHECK(root_i >= 0 && root_i < info_.root_count);
+    if (!info_.has_roots) {
+      return 0;
+    }
+    char arr[8];
+    TRY_RESULT(idx_view, data_->view(td::MutableSlice(arr, info_.ref_byte_size),
+                                     info_.roots_offset + root_i * info_.ref_byte_size));
+    CHECK(idx_view.size() == (size_t)info_.ref_byte_size);
+    return info_.read_ref(idx_view.ubegin());
+  }
+
+  struct CellLocation {
+    std::size_t begin;
+    std::size_t end;
+    bool should_cache;
+  };
+  td::Result<CellLocation> get_cell_location(int idx) {
+    CHECK(idx >= 0);
+    CHECK(idx < info_.cell_count);
+    TRY_STATUS(preload_index(idx));
+    TRY_RESULT(from, load_idx_offset(idx - 1));
+    TRY_RESULT(till, load_idx_offset(idx));
+    CellLocation res;
+    res.begin = from;
+    res.end = till;
+    res.should_cache = true;
+    if (info_.has_cache_bits) {
+      res.begin /= 2;
+      res.should_cache = res.end % 2 == 1;
+      res.end /= 2;
+    }
+    CHECK(std::numeric_limits<std::size_t>::max() - res.begin >= info_.data_offset);
+    CHECK(std::numeric_limits<std::size_t>::max() - res.end >= info_.data_offset);
+    res.begin += static_cast<std::size_t>(info_.data_offset);
+    res.end += static_cast<std::size_t>(info_.data_offset);
+    return res;
+  }
+
+  td::Status load_header() {
+    if (has_info_) {
+      return td::Status::OK();
+    }
+    std::string header(1000, '\0');
+    TRY_RESULT(header_view, data_->view(td::MutableSlice(header).truncate(data_->size()), 0))
+    auto parse_res = info_.parse_serialized_header(header_view);
+    if (parse_res <= 0) {
+      return td::Status::Error("bag-of-cell error: failed to read header");
+    }
+    if (info_.total_size < data_->size()) {
+      return td::Status::Error("bag-of-cell error: not enough data");
+    }
+    if (options_.check_crc32c && info_.has_crc32c) {
+      std::string buf(td::narrow_cast<std::size_t>(info_.total_size), '\0');
+      TRY_RESULT(data, data_->view(td::MutableSlice(buf), 0));
+      unsigned crc_computed = td::crc32c(td::Slice{data.ubegin(), data.uend() - 4});
+      unsigned crc_stored = td::as<unsigned>(data.uend() - 4);
+      if (crc_computed != crc_stored) {
+        return td::Status::Error(PSLICE()
+                                 << "bag-of-cells CRC32C mismatch: expected " << td::format::as_hex(crc_computed)
+                                 << ", found " << td::format::as_hex(crc_stored));
+      }
+    }
+    has_info_ = true;
+    return td::Status::OK();
+  }
+
+  td::Status preload_index(int idx) {
+    if (info_.has_index) {
+      return td::Status::OK();
+    }
+
+    CHECK(idx < info_.cell_count);
+    if (index_i_.load(std::memory_order_relaxed) > idx) {
+      return td::Status::OK();
+    }
+
+    std::lock_guard<std::mutex> index_i_guard(index_i_mutex_);
+    std::array<char, 1024> buf;
+    auto buf_slice = td::MutableSlice(buf.data(), buf.size());
+    for (; index_i_ <= idx; index_i_++) {
+      auto offset = td::narrow_cast<size_t>(info_.data_offset + index_offset_);
+      CHECK(data_->size() >= offset);
+      TRY_RESULT(cell, data_->view(buf_slice.copy().truncate(data_->size() - offset), offset));
+      CellSerializationInfo cell_info;
+      TRY_STATUS(cell_info.init(cell, info_.ref_byte_size));
+      index_offset_ += cell_info.end_offset;
+      LOG_CHECK((unsigned)info_.offset_byte_size <= 8) << info_.offset_byte_size;
+      td::uint8 tmp[8];
+      info_.write_offset(tmp, index_offset_);
+      auto guard = index_data_rw_mutex_.lock_write();
+      index_data_.append(reinterpret_cast<const char*>(tmp), info_.offset_byte_size);
+    }
+    return td::Status::OK();
+  }
+
+  Ref<Cell> get_any_cell(int idx) {
+    return get_data_cell(idx);
+  }
+
+  Ref<DataCell> get_data_cell(int idx) {
+    return cells_.load(idx);
+  }
+
+  Ref<DataCell> set_data_cell(int idx, Ref<DataCell> cell) {
+    if (/*idx >= info_.root_count || */ !should_cache_cells_.load(std::memory_order_relaxed)) {
+      return cell;
+    }
+    CHECK(cell.not_null());
+    return cells_.store(idx, std::move(cell));
+  }
+
+  Ref<Cell> set_any_cell(int idx, Ref<Cell> cell) {
+    auto data_cell = Ref<DataCell>(cell);
+    if (data_cell.is_null()) {
+      return cell;
+    }
+    return set_data_cell(idx, std::move(data_cell));
+  }
+
+  td::Result<Ref<Cell>> load_any_cell(int idx) {
+    {
+      auto cell = get_any_cell(idx);
+      if (cell.not_null()) {
+        return std::move(cell);
+      }
+    }
+
+    TRY_RESULT(cell_location, get_cell_location(idx));
+    auto buf = alloc(cell_location.end - cell_location.begin);
+    TRY_RESULT(cell_slice, data_->view(buf.as_slice(), cell_location.begin));
+    TRY_RESULT(res, deserialize_any_cell(idx, cell_slice, cell_location.should_cache));
+    return std::move(res);
+  }
+
+  td::Result<Ref<DataCell>> load_data_cell(int idx) {
+    {
+      auto cell = get_data_cell(idx);
+      if (cell.not_null()) {
+        return std::move(cell);
+      }
+    }
+
+    TRY_RESULT(cell_location, get_cell_location(idx));
+    auto buf = alloc(cell_location.end - cell_location.begin);
+    TRY_RESULT(cell_slice, data_->view(buf.as_slice(), cell_location.begin));
+    TRY_RESULT(res, deserialize_data_cell(idx, cell_slice, cell_location.should_cache));
+    return std::move(res);
+  }
+
+  td::Result<Ref<DataCell>> deserialize_data_cell(int idx, td::Slice cell_slice, bool should_cache) {
+    CellSerializationInfo cell_info;
+    TRY_STATUS(cell_info.init(cell_slice, info_.ref_byte_size));
+    if (cell_slice.size() != cell_info.end_offset) {
+      return td::Status::Error(PSLICE() << "unused space in cell #" << idx << " serialization");
+    }
+    return deserialize_data_cell(idx, cell_slice, cell_info, should_cache);
+  }
+
+  td::Result<Ref<DataCell>> deserialize_data_cell(int idx, td::Slice cell_slice, const CellSerializationInfo& cell_info,
+                                                  bool should_cache) {
+    deserialize_cell_cnt_.add(1);
+    Ref<Cell> refs[4];
+    CHECK(cell_info.refs_cnt <= 4);
+    auto* ref_ptr = cell_slice.ubegin() + cell_info.refs_offset;
+    for (int k = 0; k < cell_info.refs_cnt; k++, ref_ptr += info_.ref_byte_size) {
+      int ref_idx = td::narrow_cast<int>(info_.read_ref(ref_ptr));
+      if (ref_idx >= info_.cell_count) {
+        return td::Status::Error(PSLICE() << "invalid bag-of-cells cell #" << idx << " refers to cell #" << ref_idx
+                                          << " which is too big " << td::tag("cell_count", info_.cell_count));
+      }
+      if (idx >= ref_idx) {
+        return td::Status::Error(PSLICE() << "invalid bag-of-cells cell #" << idx << " refers to cell #" << ref_idx
+                                          << " which is a backward reference");
+      }
+      TRY_RESULT(ref, load_any_cell(ref_idx));
+      refs[k] = std::move(ref);
+    }
+
+    TRY_RESULT(data_cell, cell_info.create_data_cell(cell_slice, td::Span<Ref<Cell>>(refs, cell_info.refs_cnt)));
+    if (!should_cache) {
+      return std::move(data_cell);
+    }
+    return set_data_cell(idx, std::move(data_cell));
+  }
+
+  td::Result<Ref<Cell>> deserialize_any_cell(int idx, td::Slice cell_slice, bool should_cache) {
+    CellSerializationInfo cell_info;
+    TRY_STATUS(cell_info.init(cell_slice, info_.ref_byte_size));
+    if (cell_info.with_hashes) {
+      deserialize_cell_hash_cnt_.add(1);
+      int n = cell_info.level_mask.get_hashes_count();
+      return create_ext_cell(cell_info.level_mask, cell_slice.substr(cell_info.hashes_offset, n * Cell::hash_bytes),
+                             cell_slice.substr(cell_info.depth_offset, n * Cell::depth_bytes), idx);
+    }
+    TRY_RESULT(data_cell, deserialize_data_cell(idx, cell_slice, cell_info, should_cache));
+    return std::move(data_cell);
+  }
+  td::Result<Ref<Cell>> create_root_cell(Ref<DataCell> data_cell) {
+    return StaticBocRootCell::create(std::move(data_cell), shared_from_this());
+  }
+};
+
+td::Result<std::shared_ptr<StaticBagOfCellsDb>> StaticBagOfCellsDbLazy::create(std::unique_ptr<BlobView> data,
+                                                                               Options options) {
+  return std::make_shared<StaticBagOfCellsDbLazyImpl>(std::move(data), std::move(options));
+}
+
+td::Result<std::shared_ptr<StaticBagOfCellsDb>> StaticBagOfCellsDbLazy::create(td::BufferSlice data, Options options) {
+  return std::make_shared<StaticBagOfCellsDbLazyImpl>(vm::BufferSliceBlobView::create(std::move(data)),
+                                                      std::move(options));
+}
+
+td::Result<std::shared_ptr<StaticBagOfCellsDb>> StaticBagOfCellsDbLazy::create(std::string data, Options options) {
+  return create(BufferSliceBlobView::create(td::BufferSlice(data)), std::move(options));
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/db/StaticBagOfCellsDb.h b/submodules/ton/tonlib-src/crypto/vm/db/StaticBagOfCellsDb.h
new file mode 100644
index 0000000000..4a129fb7a0
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/db/StaticBagOfCellsDb.h
@@ -0,0 +1,60 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "vm/cells.h"
+#include "vm/db/BlobView.h"
+
+#include "td/utils/Status.h"
+
+namespace vm {
+class StaticBagOfCellsDb : public std::enable_shared_from_this<StaticBagOfCellsDb> {
+ public:
+  virtual ~StaticBagOfCellsDb() = default;
+  // TODO: handle errors
+  virtual td::Result<size_t> get_root_count() = 0;
+  virtual td::Result<Ref<Cell>> get_root_cell(size_t idx) = 0;
+
+ protected:
+  virtual td::Result<Ref<DataCell>> load_by_idx(int idx) = 0;
+  friend class StaticBocLoader;
+  friend class StaticBocRootLoader;
+  td::Result<Ref<Cell>> create_ext_cell(Cell::LevelMask level_mask, td::Slice hash, td::Slice depth, int idx);
+  td::Result<Ref<Cell>> create_root_ext_cell(Cell::LevelMask level_mask, td::Slice hash, td::Slice depth, int idx);
+};
+
+class StaticBagOfCellsDbBaseline {
+ public:
+  static td::Result<std::shared_ptr<StaticBagOfCellsDb>> create(std::unique_ptr<BlobView> data);
+  static td::Result<std::shared_ptr<StaticBagOfCellsDb>> create(td::Slice data);
+};
+
+class StaticBagOfCellsDbLazy {
+ public:
+  struct Options {
+    Options() {
+    }
+    bool check_crc32c{false};
+  };
+  static td::Result<std::shared_ptr<StaticBagOfCellsDb>> create(std::unique_ptr<BlobView> data, Options options = {});
+  static td::Result<std::shared_ptr<StaticBagOfCellsDb>> create(td::BufferSlice data, Options options = {});
+  static td::Result<std::shared_ptr<StaticBagOfCellsDb>> create(std::string data, Options options = {});
+};
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/db/TonDb.cpp b/submodules/ton/tonlib-src/crypto/vm/db/TonDb.cpp
new file mode 100644
index 0000000000..f478c99237
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/db/TonDb.cpp
@@ -0,0 +1,325 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/db/TonDb.h"
+
+#include "td/utils/tl_helpers.h"
+#include "td/utils/Random.h"
+
+#if TDDB_USE_ROCKSDB
+#include "td/db/RocksDb.h"
+#endif
+
+namespace vm {
+
+template <class StorerT>
+void SmartContractMeta::store(StorerT &storer) const {
+  using td::store;
+  store(stats.cells_total_count, storer);
+  store(stats.cells_total_size, storer);
+  store(type, storer);
+}
+template <class ParserT>
+void SmartContractMeta::parse(ParserT &parser) {
+  using td::parse;
+  parse(stats.cells_total_count, parser);
+  parse(stats.cells_total_size, parser);
+  parse(type, parser);
+}
+
+//
+// SmartContractDbImpl
+//
+Ref<Cell> SmartContractDbImpl::get_root() {
+  if (sync_root_with_db_ || !new_root_.is_null()) {
+    return new_root_;
+  }
+
+  sync_root_with_db();
+  return new_root_;
+}
+
+void SmartContractDbImpl::set_root(Ref<Cell> new_root) {
+  CHECK(new_root.not_null());
+  sync_root_with_db();
+  if (is_dynamic()) {
+    cell_db_->dec(new_root_);
+  }
+  new_root_ = std::move(new_root);
+  if (is_dynamic()) {
+    cell_db_->inc(new_root_);
+  }
+}
+
+SmartContractDbImpl::SmartContractDbImpl(td::Slice hash, std::shared_ptr<KeyValueReader> kv)
+    : hash_(hash.str()), kv_(std::move(kv)) {
+  cell_db_ = DynamicBagOfCellsDb::create();
+}
+
+SmartContractMeta SmartContractDbImpl::get_meta() {
+  sync_root_with_db();
+  return meta_;
+}
+td::Status SmartContractDbImpl::validate_meta() {
+  if (!is_dynamic()) {
+    return td::Status::OK();
+  }
+  sync_root_with_db();
+  TRY_RESULT(in_db, kv_->count({}));
+  if (static_cast<td::int64>(in_db) != meta_.stats.cells_total_count + 2) {
+    return td::Status::Error(PSLICE() << "Invalid meta " << td::tag("expected_count", in_db)
+                                      << td::tag("meta_count", meta_.stats.cells_total_count + 2));
+  }
+  return td::Status::OK();
+}
+
+bool SmartContractDbImpl::is_dynamic() const {
+  return meta_.type == SmartContractMeta::Dynamic;
+}
+
+bool SmartContractDbImpl::is_root_changed() const {
+  return !new_root_.is_null() && (db_root_.is_null() || db_root_->get_hash() != new_root_->get_hash());
+}
+
+void SmartContractDbImpl::sync_root_with_db() {
+  if (sync_root_with_db_) {
+    return;
+  }
+  std::string root_hash;
+  kv_->get("root", root_hash);
+  std::string meta_serialized;
+  kv_->get("meta", meta_serialized);
+  // TODO: proper serialization
+  td::unserialize(meta_, meta_serialized).ignore();
+  sync_root_with_db_ = true;
+
+  if (root_hash.empty()) {
+    meta_.type = SmartContractMeta::Static;
+    //meta_.type = SmartContractMeta::Dynamic;
+  } else {
+    if (is_dynamic()) {
+      //FIXME: error handling
+      db_root_ = cell_db_->load_cell(root_hash).move_as_ok();
+    } else {
+      std::string boc_serialized;
+      kv_->get("boc", boc_serialized);
+      BagOfCells boc;
+      //TODO: check error
+      boc.deserialize(boc_serialized);
+      db_root_ = boc.get_root_cell();
+    }
+    CHECK(db_root_->get_hash().as_slice() == root_hash);
+    new_root_ = db_root_;
+  }
+}
+
+enum { boc_size = 2000 };
+void SmartContractDbImpl::prepare_commit_dynamic(bool force) {
+  if (!is_dynamic()) {
+    CHECK(force);
+    meta_.stats = {};
+    cell_db_->inc(new_root_);
+  }
+  cell_db_->prepare_commit();
+  meta_.stats.apply_diff(cell_db_->get_stats_diff());
+
+  if (!force && meta_.stats.cells_total_size < boc_size) {
+    //LOG(ERROR) << "DYNAMIC -> BOC";
+    return prepare_commit_static(true);
+  }
+  is_dynamic_commit_ = true;
+};
+
+void SmartContractDbImpl::prepare_commit_static(bool force) {
+  BagOfCells boc;
+  boc.add_root(new_root_);
+  boc.import_cells().ensure();  // FIXME
+  if (!force && boc.estimate_serialized_size(15) > boc_size) {
+    //LOG(ERROR) << "BOC -> DYNAMIC ";
+    return prepare_commit_dynamic(true);
+  }
+  if (is_dynamic()) {
+    cell_db_->dec(new_root_);
+    cell_db_->prepare_commit();
+    // stats is invalid now
+  }
+  is_dynamic_commit_ = false;
+  boc_to_commit_ = boc.serialize_to_string(15);
+  meta_.stats = {};
+}
+
+void SmartContractDbImpl::prepare_transaction() {
+  sync_root_with_db();
+  if (!is_root_changed()) {
+    return;
+  }
+
+  if (is_dynamic()) {
+    prepare_commit_dynamic(false);
+  } else {
+    prepare_commit_static(false);
+  }
+}
+
+void SmartContractDbImpl::commit_transaction(KeyValue &kv) {
+  if (!is_root_changed()) {
+    return;
+  }
+
+  if (is_dynamic_commit_) {
+    //LOG(ERROR) << "STORE DYNAMIC";
+    if (!is_dynamic() && db_root_.not_null()) {
+      kv.erase("boc");
+    }
+    CellStorer storer(kv);
+    cell_db_->commit(storer);
+    meta_.type = SmartContractMeta::Dynamic;
+  } else {
+    //LOG(ERROR) << "STORE BOC";
+    if (is_dynamic() && db_root_.not_null()) {
+      //LOG(ERROR) << "Clear Dynamic db";
+      CellStorer storer(kv);
+      cell_db_->commit(storer);
+      cell_db_ = DynamicBagOfCellsDb::create();
+    }
+    meta_.type = SmartContractMeta::Static;
+    kv.set("boc", boc_to_commit_);
+    boc_to_commit_ = {};
+  }
+
+  kv.set("root", new_root_->get_hash().as_slice());
+  kv.set("meta", td::serialize(meta_));
+  db_root_ = new_root_;
+}
+
+void SmartContractDbImpl::set_reader(std::shared_ptr<KeyValueReader> reader) {
+  kv_ = std::move(reader);
+  cell_db_->set_loader(std::make_unique<CellLoader>(kv_));
+}
+
+//
+// TonDbTransactionImpl
+//
+SmartContractDb TonDbTransactionImpl::begin_smartcontract(td::Slice hash) {
+  SmartContractDb res;
+  contracts_.apply(hash, [&](auto &info) {
+    if (!info.is_inited) {
+      info.is_inited = true;
+      info.hash = hash.str();
+      info.smart_contract_db = std::make_unique<SmartContractDbImpl>(hash, nullptr);
+    }
+    LOG_CHECK(info.generation_ != generation_) << "Cannot begin one smartcontract twice during the same transaction";
+    CHECK(info.smart_contract_db);
+    info.smart_contract_db->set_reader(std::make_shared<td::PrefixedKeyValueReader>(reader_, hash));
+    res = std::move(info.smart_contract_db);
+  });
+  return res;
+}
+
+void TonDbTransactionImpl::commit_smartcontract(SmartContractDb txn) {
+  commit_smartcontract(SmartContractDiff(std::move(txn)));
+}
+void TonDbTransactionImpl::commit_smartcontract(SmartContractDiff txn) {
+  {
+    td::PrefixedKeyValue kv(kv_, txn.hash());
+    txn.commit_transaction(kv);
+  }
+  end_smartcontract(txn.extract_smartcontract());
+}
+
+void TonDbTransactionImpl::abort_smartcontract(SmartContractDb txn) {
+  end_smartcontract(std::move(txn));
+}
+void TonDbTransactionImpl::abort_smartcontract(SmartContractDiff txn) {
+  end_smartcontract(txn.extract_smartcontract());
+}
+
+TonDbTransactionImpl::TonDbTransactionImpl(std::shared_ptr<KeyValue> kv) : kv_(std::move(kv)) {
+  CHECK(kv_ != nullptr);
+  reader_.reset(kv_->snapshot().release());
+}
+
+void TonDbTransactionImpl::begin() {
+  kv_->begin_transaction();
+  generation_++;
+}
+void TonDbTransactionImpl::commit() {
+  kv_->commit_transaction();
+  reader_.reset(kv_->snapshot().release());
+}
+void TonDbTransactionImpl::abort() {
+  kv_->abort_transaction();
+}
+void TonDbTransactionImpl::clear_cache() {
+  contracts_ = {};
+}
+
+void TonDbTransactionImpl::end_smartcontract(SmartContractDb smart_contract) {
+  contracts_.apply(smart_contract->hash(), [&](auto &info) {
+    CHECK(info.hash == smart_contract->hash());
+    CHECK(!info.smart_contract_db);
+    info.smart_contract_db = std::move(smart_contract);
+  });
+}
+
+//
+// TonDbImpl
+//
+TonDbImpl::TonDbImpl(std::unique_ptr<KeyValue> kv)
+    : kv_(std::move(kv)), transaction_(std::make_unique<TonDbTransactionImpl>(kv_)) {
+}
+TonDbImpl::~TonDbImpl() {
+  CHECK(transaction_);
+  kv_->flush();
+}
+TonDbTransaction TonDbImpl::begin_transaction() {
+  CHECK(transaction_);
+  transaction_->begin();
+  return std::move(transaction_);
+}
+void TonDbImpl::commit_transaction(TonDbTransaction transaction) {
+  CHECK(!transaction_);
+  CHECK(&transaction->kv() == kv_.get());
+  transaction_ = std::move(transaction);
+  transaction_->commit();
+}
+void TonDbImpl::abort_transaction(TonDbTransaction transaction) {
+  CHECK(!transaction_);
+  CHECK(&transaction->kv() == kv_.get());
+  transaction_ = std::move(transaction);
+  transaction_->abort();
+}
+void TonDbImpl::clear_cache() {
+  CHECK(transaction_);
+  transaction_->clear_cache();
+}
+
+std::string TonDbImpl::stats() const {
+  return kv_->stats();
+}
+
+td::Result<TonDb> TonDbImpl::open(td::Slice path) {
+#if TDDB_USE_ROCKSDB
+  TRY_RESULT(rocksdb, td::RocksDb::open(path.str()));
+  return std::make_unique<TonDbImpl>(std::make_unique<td::RocksDb>(std::move(rocksdb)));
+#else
+  return td::Status::Error("TonDb is not supported in this build");
+#endif
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/db/TonDb.h b/submodules/ton/tonlib-src/crypto/vm/db/TonDb.h
new file mode 100644
index 0000000000..2f4ba090a0
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/db/TonDb.h
@@ -0,0 +1,179 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cellslice.h"
+#include "vm/cells.h"
+#include "vm/boc.h"
+#include "td/db/KeyValue.h"
+#include "vm/db/CellStorage.h"
+#include "vm/db/CellHashTable.h"
+
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+namespace vm {
+class SmartContractDbImpl;
+using SmartContractDb = std::unique_ptr<SmartContractDbImpl>;
+using KeyValue = td::KeyValue;
+using KeyValueReader = td::KeyValueReader;
+
+struct SmartContractMeta {
+  DynamicBagOfCellsDb::Stats stats;
+  enum BagOfCellsType { Dynamic, Static } type{Static};
+
+  template <class StorerT>
+  void store(StorerT &storer) const;
+  template <class ParserT>
+  void parse(ParserT &parser);
+};
+
+class SmartContractDbImpl {
+ public:
+  Ref<Cell> get_root();
+  SmartContractMeta get_meta();
+  td::Status validate_meta();
+
+  void set_root(Ref<Cell> new_root);
+
+  SmartContractDbImpl(td::Slice hash, std::shared_ptr<KeyValueReader> kv);
+
+ private:
+  std::string hash_;
+  std::shared_ptr<KeyValueReader> kv_;
+
+  bool sync_root_with_db_{false};
+  Ref<Cell> db_root_;
+  Ref<Cell> new_root_;
+  SmartContractMeta meta_;
+  bool is_dynamic_commit_;
+  std::string boc_to_commit_;
+
+  std::unique_ptr<DynamicBagOfCellsDb> cell_db_;
+  std::unique_ptr<BagOfCells> bag_of_cells_;
+
+  friend class SmartContractDiff;
+  friend class TonDbTransactionImpl;
+
+  void sync_root_with_db();
+
+  td::Slice hash() const {
+    return hash_;
+  }
+
+  void prepare_transaction();
+  void commit_transaction(KeyValue &kv);
+
+  void set_reader(std::shared_ptr<KeyValueReader> reader);
+
+  bool is_dynamic() const;
+  void prepare_commit_dynamic(bool force);
+  void prepare_commit_static(bool force);
+  bool is_root_changed() const;
+};
+
+class SmartContractDiff {
+ public:
+  explicit SmartContractDiff(SmartContractDb db) : db_(std::move(db)) {
+    db_->prepare_transaction();
+  }
+
+  SmartContractDb extract_smartcontract() {
+    return std::move(db_);
+  }
+
+  td::Slice hash() const {
+    return db_->hash();
+  }
+
+  void commit_transaction(KeyValue &kv) {
+    db_->commit_transaction(kv);
+  }
+
+ private:
+  SmartContractDb db_;
+};
+
+class TonDbTransactionImpl;
+using TonDbTransaction = std::unique_ptr<TonDbTransactionImpl>;
+class TonDbTransactionImpl {
+ public:
+  SmartContractDb begin_smartcontract(td::Slice hash = {});
+
+  void commit_smartcontract(SmartContractDb txn);
+  void commit_smartcontract(SmartContractDiff txn);
+
+  void abort_smartcontract(SmartContractDb txn);
+  void abort_smartcontract(SmartContractDiff txn);
+
+  TonDbTransactionImpl(std::shared_ptr<KeyValue> kv);
+
+ private:
+  std::shared_ptr<KeyValue> kv_;
+  std::shared_ptr<KeyValueReader> reader_;
+  td::uint64 generation_{0};
+
+  struct SmartContractInfo {
+    bool is_inited{false};
+    td::uint64 generation_{0};
+    std::string hash;
+    SmartContractDb smart_contract_db;
+    bool operator<(const SmartContractInfo &other) const {
+      return hash < other.hash;
+    }
+    friend bool operator<(const SmartContractInfo &info, td::Slice hash) {
+      return info.hash < hash;
+    }
+    friend bool operator<(td::Slice hash, const SmartContractInfo &info) {
+      return hash < info.hash;
+    }
+  };
+
+  CellHashTable<SmartContractInfo> contracts_;
+
+  KeyValue &kv() {
+    return *kv_;
+  }
+  friend class TonDbImpl;
+
+  void begin();
+  void commit();
+  void abort();
+  void clear_cache();
+
+  void end_smartcontract(SmartContractDb smart_contract);
+};
+
+class TonDbImpl;
+using TonDb = std::unique_ptr<TonDbImpl>;
+class TonDbImpl {
+ public:
+  TonDbImpl(std::unique_ptr<KeyValue> kv);
+  ~TonDbImpl();
+  TonDbTransaction begin_transaction();
+  void commit_transaction(TonDbTransaction transaction);
+  void abort_transaction(TonDbTransaction transaction);
+  void clear_cache();
+  static td::Result<TonDb> open(td::Slice path);
+  std::string stats() const;
+
+ private:
+  std::shared_ptr<KeyValue> kv_;
+  TonDbTransaction transaction_;
+};
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/debugops.cpp b/submodules/ton/tonlib-src/crypto/vm/debugops.cpp
new file mode 100644
index 0000000000..911d6313b8
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/debugops.cpp
@@ -0,0 +1,110 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <functional>
+#include "vm/debugops.h"
+#include "vm/log.h"
+#include "vm/opctable.h"
+#include "vm/stack.hpp"
+#include "vm/continuation.h"
+#include "vm/excno.hpp"
+
+namespace vm {
+
+bool vm_debug_enabled = true;
+
+int exec_dummy_debug(VmState* st, int args) {
+  VM_LOG(st) << "execute DEBUG " << (args & 0xff);
+  return 0;
+}
+
+// similar to PUSHSLICE instruction in cellops.cpp
+int exec_dummy_debug_str(VmState* st, CellSlice& cs, unsigned args, int pfx_bits) {
+  int data_bits = ((args & 15) + 1) * 8;
+  if (!cs.have(pfx_bits + data_bits)) {
+    throw VmError{Excno::inv_opcode, "not enough data bits for a DEBUGSTR instruction"};
+  }
+  cs.advance(pfx_bits);
+  auto slice = cs.fetch_subslice(data_bits);
+  VM_LOG(st) << "execute DEBUGSTR " << slice->as_bitslice().to_hex();
+  return 0;
+}
+
+std::string dump_dummy_debug_str(CellSlice& cs, unsigned args, int pfx_bits) {
+  int data_bits = ((args & 15) + 1) * 8;
+  if (!cs.have(pfx_bits + data_bits)) {
+    return "";
+  }
+  cs.advance(pfx_bits);
+  auto slice = cs.fetch_subslice(data_bits);
+  slice.unique_write().remove_trailing();
+  std::ostringstream os;
+  os << "DEBUGSTR ";
+  slice->dump_hex(os, 1, false);
+  return os.str();
+}
+
+int compute_len_debug_str(const CellSlice& cs, unsigned args, int pfx_bits) {
+  unsigned bits = pfx_bits + ((args & 15) + 1) * 8;
+  return cs.have(bits) ? bits : 0;
+}
+
+int exec_dump_stack(VmState* st) {
+  VM_LOG(st) << "execute DUMPSTK";
+  Stack& stack = st->get_stack();
+  int d = stack.depth();
+  std::cerr << "#DEBUG#: stack(" << d << " values) : ";
+  if (d > 255) {
+    std::cerr << "... ";
+    d = 255;
+  }
+  for (int i = d; i > 0; i--) {
+    std::cerr << stack[i - 1].to_string() << " ";
+  }
+  std::cerr << std::endl;
+  return 0;
+}
+
+int exec_dump_value(VmState* st, unsigned arg) {
+  arg &= 15;
+  VM_LOG(st) << "execute DUMP s" << arg;
+  Stack& stack = st->get_stack();
+  if ((int)arg < stack.depth()) {
+    std::cerr << "#DEBUG#: s" << arg << " = " << stack[arg].to_string() << std::endl;
+  } else {
+    std::cerr << "#DEBUG#: s" << arg << " is absent" << std::endl;
+  }
+  return 0;
+}
+
+void register_debug_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  if (!vm_debug_enabled) {
+    cp0.insert(OpcodeInstr::mkfixedrange(0xfe00, 0xfef0, 16, 8, instr::dump_1c_and(0xff, "DEBUG "), exec_dummy_debug))
+        .insert(OpcodeInstr::mkext(0xfef, 12, 4, dump_dummy_debug_str, exec_dummy_debug_str, compute_len_debug_str));
+  } else {
+    // NB: all non-redefined opcodes in fe00..feff should be redirected to dummy debug definitions
+    cp0.insert(OpcodeInstr::mksimple(0xfe00, 16, "DUMPSTK", exec_dump_stack))
+        .insert(OpcodeInstr::mkfixedrange(0xfe01, 0xfe20, 16, 8, instr::dump_1c_and(0xff, "DEBUG "), exec_dummy_debug))
+        .insert(OpcodeInstr::mkfixed(0xfe2, 12, 4, instr::dump_1sr("DUMP"), exec_dump_value))
+        .insert(OpcodeInstr::mkfixedrange(0xfe30, 0xfef0, 16, 8, instr::dump_1c_and(0xff, "DEBUG "), exec_dummy_debug))
+        .insert(OpcodeInstr::mkext(0xfef, 12, 4, dump_dummy_debug_str, exec_dummy_debug_str, compute_len_debug_str));
+  }
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/debugops.h b/submodules/ton/tonlib-src/crypto/vm/debugops.h
new file mode 100644
index 0000000000..7c7b27d010
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/debugops.h
@@ -0,0 +1,29 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace vm {
+
+class OpcodeTable;
+
+extern bool vm_debug_enabled;
+
+void register_debug_ops(OpcodeTable& cp0);
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/dict.cpp b/submodules/ton/tonlib-src/crypto/vm/dict.cpp
new file mode 100644
index 0000000000..7037e7e41c
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/dict.cpp
@@ -0,0 +1,2647 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/dict.h"
+#include "vm/cells.h"
+#include "vm/cellslice.h"
+#include "vm/stack.hpp"
+#include "common/bitstring.h"
+
+#include "td/utils/bits.h"
+
+namespace vm {
+
+/*
+ * 
+ *  DictionaryBase : basic (common) dictionary manipulation
+ * 
+ */
+
+DictionaryBase::DictionaryBase(Ref<CellSlice> _root, int _n, bool validate)
+    : root(std::move(_root)), root_cell(), key_bits(_n), flags(f_root_cached) {
+  if (validate) {
+    force_validate();
+  }
+}
+
+DictionaryBase::DictionaryBase(const CellSlice& root_cs, int _n, bool validate)
+    : root(), root_cell(), key_bits(_n), flags(0) {
+  int f = (int)root_cs.prefetch_ulong(1);
+  if (f < 0) {
+    flags |= f_invalid;
+  } else if (f > 0) {
+    if (root_cs.size_refs()) {
+      root_cell = root_cs.prefetch_ref();
+    } else {
+      flags |= f_invalid;
+    }
+  }
+  if (validate) {
+    force_validate();
+  }
+}
+
+DictionaryBase::DictionaryBase(DictAdvance, CellSlice& root_cs, int _n, bool validate)
+    : root(), root_cell(), key_bits(_n), flags(0) {
+  int f = (int)root_cs.prefetch_ulong(1);
+  if (!f) {
+    root_cs.advance(1);
+  } else if (f > 0 && root_cs.size_refs()) {
+    root_cs.advance(1);
+    root_cell = root_cs.fetch_ref();
+  } else {
+    flags |= f_invalid;
+  }
+  if (validate) {
+    force_validate();
+  }
+}
+
+DictionaryBase::DictionaryBase(Ref<Cell> cell, int _n, bool validate)
+    : root(), root_cell(std::move(cell)), key_bits(_n), flags(0) {
+  if (validate) {
+    force_validate();
+  }
+}
+
+DictionaryBase::DictionaryBase(int _n, bool validate) : root(), root_cell(), key_bits(_n), flags(0) {
+  if (validate) {
+    force_validate();
+  }
+}
+
+DictionaryBase::DictionaryBase(DictNonEmpty, Ref<CellSlice> _root, int _n, bool validate)
+    : root(), root_cell(), key_bits(_n), flags(0) {
+  if (_root.is_null() || !init_root_for_nonempty(*_root)) {  // empty ?
+    invalidate();                                            // invalidate
+  }
+  if (validate) {
+    force_validate();
+  }
+}
+
+DictionaryBase::DictionaryBase(DictNonEmpty, const CellSlice& _root, int _n, bool validate)
+    : root(), root_cell(), key_bits(_n), flags(0) {
+  if (!init_root_for_nonempty(_root)) {
+    invalidate();
+  }
+  if (validate) {
+    force_validate();
+  }
+}
+
+bool DictionaryBase::init_root_for_nonempty(const CellSlice& cs) {
+  vm::CellBuilder cb;
+  return cb.append_cellslice_bool(cs) && cb.finalize_to(root_cell);
+}
+
+Ref<Cell> DictionaryBase::construct_root_from(const CellSlice& root_node_cs) {
+  vm::CellBuilder cb;
+  if (cb.append_cellslice_bool(root_node_cs)) {
+    return cb.finalize();
+  } else {
+    return {};
+  }
+}
+
+void DictionaryBase::force_validate() {
+  if (!is_valid() && !validate()) {
+    throw VmError{Excno::dict_err, "invalid dictionary"};
+  }
+}
+
+bool DictionaryBase::validate() {
+  if (is_valid()) {
+    return true;
+  }
+  if (flags & f_invalid) {
+    return false;
+  }
+  if (key_bits < 0 || key_bits > max_key_bits) {
+    return invalidate();
+  }
+  if (flags & f_root_cached) {
+    if (root.is_null() || root->size() != 1) {
+      return invalidate();
+    }
+    bool non_empty = root->prefetch_ulong(1);
+    if (root->size_refs() != (non_empty ? 1u : 0u)) {
+      return invalidate();
+    }
+    if (root_cell.not_null()) {
+      return invalidate();
+    }
+    if (non_empty) {
+      root_cell = root->prefetch_ref();
+    }
+  } else if (root.not_null()) {
+    return invalidate();
+  }
+  flags |= f_valid;
+  return true;
+}
+
+Ref<CellSlice> DictionaryBase::get_root() const {
+  if (!(flags & f_root_cached) && !compute_root()) {
+    return {};
+  }
+  return root;
+}
+
+Ref<CellSlice> DictionaryBase::extract_root() && {
+  if (!(flags & f_root_cached) && !compute_root()) {
+    return {};
+  }
+  flags = f_invalid;
+  return std::move(root);
+}
+
+bool DictionaryBase::append_dict_to_bool(CellBuilder& cb) && {
+  if (!is_valid()) {
+    return false;
+  }
+  flags = f_invalid;
+  return cb.store_maybe_ref(std::move(root_cell));
+}
+
+bool DictionaryBase::append_dict_to_bool(CellBuilder& cb) const& {
+  return is_valid() && cb.store_maybe_ref(root_cell);
+}
+
+bool DictionaryBase::compute_root() const {
+  if (!is_valid()) {
+    return false;
+  }
+  if (root_cell.is_null()) {
+    root = get_empty_dictionary();
+    flags |= f_root_cached;
+    return true;
+  }
+  CellBuilder cb;
+  cb.store_long(1, 1);
+  cb.store_ref(root_cell);
+  root = Ref<CellSlice>{true, cb.finalize()};
+  flags |= f_root_cached;
+  return true;
+}
+
+Ref<CellSlice> DictionaryBase::get_empty_dictionary() {
+  static Ref<CellSlice> empty_dict{new_empty_dictionary()};
+  return empty_dict;
+}
+
+Ref<CellSlice> DictionaryBase::new_empty_dictionary() {
+  CellBuilder cb;  // Builder
+  cb.store_long(0, 1);
+  return Ref<CellSlice>{true, cb.finalize()};
+}
+
+Ref<Cell> DictionaryFixed::finish_create_leaf(CellBuilder& cb, const CellSlice& value) const {
+  if (!cb.append_cellslice_bool(value)) {
+    throw VmError{Excno::dict_err, "cannot store new value into a dictionary leaf cell"};
+  }
+  return cb.finalize();
+}
+
+Ref<Cell> DictionaryFixed::finish_create_fork(CellBuilder& cb, Ref<Cell> c1, Ref<Cell> c2, int n) const {
+  assert(n > 0);
+  if (!(cb.store_ref_bool(std::move(c1)) && cb.store_ref_bool(std::move(c2)))) {
+    throw VmError{Excno::dict_err, "cannot store branch references into a dictionary fork cell"};
+  }
+  return cb.finalize();
+}
+
+bool DictionaryFixed::check_fork_raw(Ref<CellSlice> cs_ref, int n) const {
+  if (cs_ref.is_null()) {
+    return false;
+  }
+  Ref<Cell> c1, c2;
+  CellSlice& cs = cs_ref.write();
+  return cs.fetch_ref_to(c1) && cs.fetch_ref_to(c2) && check_fork(cs, std::move(c1), std::move(c2), n);
+}
+
+/*
+ * 
+ *  Label parser (HmLabel n ~l) for all dictionary types
+ *
+ */
+
+namespace dict {
+
+LabelParser::LabelParser(Ref<CellSlice> cs, int max_label_len, int auto_validate) : remainder(), l_offs(0), l_same(0) {
+  if (!parse_label(cs.write(), max_label_len)) {
+    l_offs = 0;
+  } else {
+    s_bits = (l_same ? 0 : l_bits);
+    remainder = std::move(cs);
+  }
+  if (auto_validate) {
+    if (auto_validate > 2) {
+      validate_ext(max_label_len);
+    } else if (auto_validate == 2) {
+      validate_simple(max_label_len);
+    } else {
+      validate();
+    }
+  }
+}
+
+LabelParser::LabelParser(Ref<Cell> cell, int max_label_len, int auto_validate) : remainder(), l_offs(0), l_same(0) {
+  Ref<CellSlice> cs = load_cell_slice_ref(std::move(cell));
+  if (!parse_label(cs.unique_write(), max_label_len)) {
+    l_offs = 0;
+  } else {
+    s_bits = (l_same ? 0 : l_bits);
+    remainder = std::move(cs);
+  }
+  if (auto_validate) {
+    if (auto_validate > 2) {
+      validate_ext(max_label_len);
+    } else if (auto_validate == 2) {
+      validate_simple(max_label_len);
+    } else {
+      validate();
+    }
+  }
+}
+
+bool LabelParser::parse_label(CellSlice& cs, int max_label_len) {
+  int ltype = (int)cs.prefetch_ulong(2);
+  // std::cerr << "parse_label of type " << ltype << " and maximal length " << max_label_len << " in ";
+  // cs.dump_hex(std::cerr, 0, true);
+  switch (ltype) {
+    case 0: {
+      l_bits = 0;
+      l_offs = 2;
+      cs.advance(2);
+      return true;
+    }
+    case 1: {
+      cs.advance(1);
+      l_bits = cs.count_leading(1);
+      // std::cerr << "unary-encoded l_bits = " << l_bits << ", have " << cs.size() << std::endl;
+      if (l_bits > max_label_len || !cs.have(2 * l_bits + 1)) {
+        return false;
+      }
+      l_offs = l_bits + 2;
+      cs.advance(l_bits + 1);
+      return true;
+    }
+    case 2: {
+      int len_bits = 32 - td::count_leading_zeroes32(max_label_len);
+      cs.advance(2);
+      l_bits = (int)cs.fetch_ulong(len_bits);
+      if (l_bits < 0 || l_bits > max_label_len) {
+        return false;
+      }
+      l_offs = len_bits + 2;
+      return cs.have(l_bits);
+    }
+    case 3: {
+      int len_bits = 32 - td::count_leading_zeroes32(max_label_len);
+      // std::cerr << "len_bits = " << len_bits << ", have " << cs.size() << std::endl;
+      if (!cs.have(3 + len_bits)) {
+        return false;
+      }
+      l_same = (int)cs.fetch_ulong(3);
+      l_bits = (int)cs.fetch_ulong(len_bits);
+      // std::cerr << "l_bits = " << l_bits << ", l_same = " << l_same << std::endl;
+      if (l_bits < 0 || l_bits > max_label_len) {
+        return false;
+      }
+      l_offs = -1;
+      return true;
+    }
+    default:
+      return false;
+  }
+}
+
+void LabelParser::validate() const {
+  if (!is_valid()) {
+    throw VmError{Excno::cell_und, "error while parsing a dictionary node label"};
+  }
+}
+
+void LabelParser::validate_ext(int n) const {
+  validate();
+  if (l_bits > n) {
+    throw VmError{Excno::dict_err, "invalid dictionary node"};
+  } else if (l_bits < n && (remainder->size() != s_bits || remainder->size_refs() != 2)) {
+    throw VmError{Excno::dict_err, "invalid dictionary fork node"};
+  }
+}
+
+void LabelParser::validate_simple(int n) const {
+  validate();
+  if (l_bits > n) {
+    throw VmError{Excno::dict_err, "invalid dictionary node"};
+  } else if (l_bits < n && (remainder->size() < s_bits || remainder->size_refs() < 2)) {
+    throw VmError{Excno::dict_err, "invalid dictionary fork node"};
+  }
+}
+
+bool LabelParser::is_prefix_of(td::ConstBitPtr key, int len) const {
+  if (l_bits > len) {
+    return false;
+  } else if (!l_same) {
+    //std::cerr << "key is " << key.to_hex(len) << "; len = " << len << "; label_bits = " << l_bits << "; remainder = ";
+    //remainder->dump_hex(std::cerr, 0, true);
+    return remainder->has_prefix(key, l_bits);
+  } else {
+    return td::bitstring::bits_memscan(key, l_bits, l_same & 1) == (unsigned)l_bits;
+  }
+}
+
+bool LabelParser::has_prefix(td::ConstBitPtr key, int len) const {
+  return len >= 0 && len <= l_bits && common_prefix_len(key, len) == len;
+}
+
+int LabelParser::common_prefix_len(td::ConstBitPtr key, int len) const {
+  if (!l_same) {
+    //std::cerr << "key is " << key.to_hex(len) << "; len = " << len << "; label_bits = " << l_bits << "; remainder = ";
+    //remainder->dump_hex(std::cerr, 0, true);
+    return remainder->common_prefix_len(key, std::min(l_bits, len));
+  } else {
+    return (int)td::bitstring::bits_memscan(key, std::min(l_bits, len), l_same & 1);
+  }
+}
+
+int LabelParser::extract_label_to(td::BitPtr to) {
+  if (!l_same) {
+    to.copy_from(remainder->data_bits(), l_bits);
+    remainder.write().advance(l_bits);
+  } else {
+    to.fill(l_same & 1, l_bits);
+  }
+  return l_bits;
+}
+
+int LabelParser::copy_label_prefix_to(td::BitPtr to, int max_len) const {
+  if (max_len <= 0) {
+    return max_len;
+  }
+  int sz = std::min(max_len, l_bits);
+  if (!l_same) {
+    to.copy_from(remainder->data_bits(), sz);
+  } else {
+    to.fill(l_same & 1, sz);
+  }
+  return sz;
+}
+
+}  // namespace dict
+
+/*
+ * 
+ *   Usual Dictionary
+ * 
+ */
+
+using dict::LabelParser;
+
+BitSlice DictionaryFixed::integer_key(td::RefInt256 x, unsigned n, bool sgnd, unsigned char buffer[128], bool quiet) {
+  if (x.not_null() && x->fits_bits(n, sgnd)) {
+    if (buffer) {
+      if (x->export_bits(buffer, 0, n, sgnd)) {
+        return BitSlice{{}, buffer, 0, n};
+      }
+    } else {
+      Ref<td::BitString> bs{true, n};
+      if (x->export_bits(bs.unique_write().reserve_bitslice(n), sgnd)) {
+        return static_cast<BitSlice>(*bs);
+      }
+    }
+  }
+  if (!quiet) {
+    throw VmError{Excno::range_chk, "dictionary index out of bounds"};
+  }
+  return {};
+}
+
+bool DictionaryFixed::integer_key_simple(td::RefInt256 x, unsigned n, bool sgnd, td::BitPtr buffer, bool quiet) {
+  if (x.not_null() && x->fits_bits(n, sgnd) && x->export_bits(buffer, n, sgnd)) {
+    return true;
+  }
+  if (!quiet) {
+    throw VmError{Excno::range_chk, "dictionary index out of bounds"};
+  }
+  return false;
+}
+
+Ref<Cell> Dictionary::extract_value_ref(Ref<CellSlice> cs) {
+  if (cs.is_null()) {
+    return {};
+  } else if (!cs->size() && cs->size_refs() == 1) {
+    return cs->prefetch_ref();
+  } else {
+    throw VmError{Excno::dict_err, "dictionary value does not consist of exactly one reference"};
+  }
+}
+
+Ref<CellSlice> DictionaryFixed::lookup(td::ConstBitPtr key, int key_len) {
+  force_validate();
+  if (key_len != get_key_bits() || is_empty()) {
+    return {};
+  }
+  //std::cerr << "dictionary lookup for key = " << key.to_hex(key_len) << std::endl;
+  Ref<Cell> cell = get_root_cell();
+  int n = key_len;
+  while (true) {
+    LabelParser label{std::move(cell), n, label_mode()};
+    if (!label.is_prefix_of(key, n)) {
+      //std::cerr << "(not a prefix)\n";
+      return {};
+    }
+    n -= label.l_bits;
+    if (n <= 0) {
+      assert(!n);
+      label.skip_label();
+      return std::move(label.remainder);
+    }
+    key += label.l_bits;
+    bool sw = *key++;
+    //std::cerr << "key bit at position " << key_bits - n << " equals " << sw << std::endl;
+    --n;
+    cell = label.remainder->prefetch_ref(sw);
+  }
+}
+
+Ref<Cell> Dictionary::lookup_ref(td::ConstBitPtr key, int key_len) {
+  return extract_value_ref(lookup(key, key_len));
+}
+
+bool DictionaryFixed::has_common_prefix(td::ConstBitPtr prefix, int prefix_len) {
+  force_validate();
+  if (is_empty() || prefix_len <= 0) {
+    return true;
+  }
+  if (prefix_len > get_key_bits()) {
+    return false;
+  }
+  LabelParser label{get_root_cell(), get_key_bits(), label_mode()};
+  return label.has_prefix(prefix, prefix_len);
+}
+
+int DictionaryFixed::get_common_prefix(td::BitPtr buffer, unsigned buffer_len) {
+  force_validate();
+  if (is_empty()) {
+    return 0;
+  }
+  LabelParser label{get_root_cell(), get_key_bits(), label_mode()};
+  return label.copy_label_prefix_to(buffer, (int)buffer_len);
+}
+
+bool DictionaryFixed::key_exists(td::ConstBitPtr key, int key_len) {
+  return lookup(key, key_len).not_null();
+}
+
+bool DictionaryFixed::int_key_exists(long long key) {
+  force_validate();
+  int l = get_key_bits();
+  if (is_empty() || l > 64) {
+    return false;
+  }
+  if (l < 64) {
+    long long m = (1LL << (l - 1));
+    if (key < -m || key >= m) {
+      return false;
+    }
+  }
+  td::BitArray<64> a;
+  a.bits().store_int(key, l);
+  return key_exists(a.cbits(), l);
+}
+
+bool DictionaryFixed::uint_key_exists(unsigned long long key) {
+  force_validate();
+  int l = get_key_bits();
+  if (is_empty() || l > 64) {
+    return false;
+  }
+  if (l < 64 && key >= (1ULL << l)) {
+    return false;
+  }
+  td::BitArray<64> a;
+  a.bits().store_uint(key, l);
+  return key_exists(a.cbits(), l);
+}
+
+namespace {
+
+void append_dict_label_same(CellBuilder& cb, bool same, int len, int max_len) {
+  int k = 32 - td::count_leading_zeroes32(max_len);
+  assert(len >= 0 && len <= max_len && max_len <= 1023);
+  // options: mode '0', requires 2n+2 bits (always for n=0)
+  // mode '10', requires 2+k+n bits (only for n<=1)
+  // mode '11', requires 3+k bits (for n>=2, k<2n-1)
+  if (len > 1 && k < 2 * len - 1) {
+    // mode '11'
+    cb.store_long(6 + same, 3).store_long(len, k);
+  } else if (k < len) {
+    // mode '10'
+    cb.store_long(2, 2).store_long(len, k).store_long(-static_cast<int>(same), len);
+  } else {
+    // mode '0'
+    cb.store_long(0, 1).store_long(-2, len + 1).store_long(-static_cast<int>(same), len);
+  }
+}
+
+void append_dict_label(CellBuilder& cb, td::ConstBitPtr label, int len, int max_len) {
+  assert(len <= max_len && max_len <= 1023);
+  if (len > 0 && (int)td::bitstring::bits_memscan(label, len, *label) == len) {
+    return append_dict_label_same(cb, *label, len, max_len);
+  }
+  int k = 32 - td::count_leading_zeroes32(max_len);
+  // two options: mode '0', requires 2n+2 bits
+  // mode '10', requires 2+k+n bits
+  if (k < len) {
+    cb.store_long(2, 2).store_long(len, k);
+  } else {
+    cb.store_long(0, 1).store_long(-2, len + 1);
+  }
+  if ((int)cb.remaining_bits() < len) {
+    throw VmError{Excno::cell_ov, "cannot store a label into a dictionary cell"};
+  }
+  cb.store_bits(label, len);
+}
+
+std::pair<Ref<Cell>, bool> dict_set(Ref<Cell> dict, td::ConstBitPtr key, int n,
+                                    const Dictionary::store_value_func_t& store_val, Dictionary::SetMode mode) {
+  //std::cerr << "dictionary modification for " << n << "-bit key = " << key.to_hex(n) << std::endl;
+  if (dict.is_null()) {
+    // the dictionary is very empty
+    if (mode == Dictionary::SetMode::Replace) {
+      return std::make_pair<Ref<Cell>, bool>({}, false);
+    }
+    // create an one-element dictionary
+    CellBuilder cb;
+    append_dict_label(cb, key, n, n);
+    if (!store_val(cb)) {
+      throw VmError{Excno::cell_ov, "cannot store new value into a dictionary cell"};
+    }
+    return std::make_pair(cb.finalize(), true);
+  }
+  LabelParser label{std::move(dict), n};
+  label.validate();
+  int pfx_len = label.common_prefix_len(key, n);
+  assert(pfx_len >= 0 && pfx_len <= label.l_bits && label.l_bits <= n);
+  if (pfx_len < label.l_bits) {
+    // have to insert a new node (fork) inside the current edge
+    if (mode == Dictionary::SetMode::Replace) {
+      // key not found, return unchanged dictionary
+      return std::make_pair(Ref<Cell>{}, false);
+    }
+    // first, create the edge + new leaf cell
+    int m = n - pfx_len - 1;
+    CellBuilder cb;
+    append_dict_label(cb, key + (pfx_len + 1), m, m);
+    if (!store_val(cb)) {
+      throw VmError{Excno::cell_ov, "cannot store new value into a dictionary cell"};
+    }
+    Ref<Cell> c1 = cb.finalize();  // new leaf cell corresponding to `key`
+    //cb.reset();
+    // create the lower portion of the old edge
+    int t = label.l_bits - pfx_len - 1;
+    auto cs = std::move(label.remainder);
+    if (label.l_same) {
+      append_dict_label_same(cb, label.l_same & 1, t, m);
+    } else {
+      cs.write().advance(pfx_len + 1);
+      append_dict_label(cb, cs->data_bits(), t, m);
+      cs.unique_write().advance(t);
+    }
+    // now cs is the old payload of the edge, either a value or two subdictionary references
+    if (!cell_builder_add_slice_bool(cb, *cs)) {
+      throw VmError{Excno::cell_ov, "cannot change label of an old dictionary cell (?)"};
+    }
+    Ref<Cell> c2 = cb.finalize();  // the other child of the new fork
+    // cb.reset();
+    append_dict_label(cb, key, pfx_len, n);
+    bool sw_bit = key[pfx_len];
+    if (sw_bit) {
+      c1.swap(c2);
+    }
+    cb.store_ref(std::move(c1)).store_ref(std::move(c2));
+    return std::make_pair(cb.finalize(), true);
+  }
+  if (label.l_bits == n) {
+    // the edge leads to a leaf node
+    // this leaf node already contains a value for the key wanted
+    if (mode == Dictionary::SetMode::Add) {
+      // return unchanged dictionary
+      return std::make_pair(Ref<Cell>{}, false);
+    }
+    // replace the value of the only element of the dictionary
+    CellBuilder cb;
+    append_dict_label(cb, key, n, n);
+    if (!store_val(cb)) {
+      throw VmError{Excno::cell_ov, "cannot store new value into a dictionary cell"};
+    }
+    return std::make_pair(cb.finalize(), true);
+  }
+  // main case: the edge leads to a fork, have to insert new value either in the right or in the left subtree
+  auto c1 = label.remainder->prefetch_ref(0);
+  auto c2 = label.remainder->prefetch_ref(1);
+  label.remainder.clear();
+  if (key[label.l_bits]) {
+    // insert key into the right child (c2)
+    auto res = dict_set(std::move(c2), key + (label.l_bits + 1), n - label.l_bits - 1, store_val, mode);
+    if (!res.second) {
+      // return unchanged dictionary
+      return std::make_pair(Ref<Cell>{}, false);
+    }
+    c2 = std::move(res.first);
+  } else {
+    // insert key into the left child (c1)
+    auto res = dict_set(std::move(c1), key + (label.l_bits + 1), n - label.l_bits - 1, store_val, mode);
+    if (!res.second) {
+      // return unchanged dictionary
+      return std::make_pair(Ref<Cell>{}, false);
+    }
+    c1 = std::move(res.first);
+  }
+  // create a new label with the same content
+  CellBuilder cb;
+  append_dict_label(cb, key, label.l_bits, n);
+  cb.store_ref(std::move(c1)).store_ref(std::move(c2));
+  return std::make_pair(cb.finalize(), true);
+}
+
+std::tuple<Ref<CellSlice>, Ref<Cell>, bool> dict_lookup_set(Ref<Cell> dict, td::ConstBitPtr key, int n,
+                                                            const Dictionary::store_value_func_t& store_val,
+                                                            Dictionary::SetMode mode) {
+  //std::cerr << "dictionary lookup/modification for " << n << "-bit key = " << key.to_hex(n) << std::endl;
+  if (dict.is_null()) {
+    // the dictionary is very empty
+    if (mode == Dictionary::SetMode::Replace) {
+      return std::make_tuple<Ref<CellSlice>, Ref<Cell>, bool>({}, {}, false);
+    }
+    // create an one-element dictionary
+    CellBuilder cb;
+    append_dict_label(cb, key, n, n);
+    if (!store_val(cb)) {
+      throw VmError{Excno::cell_ov, "cannot store new value into a dictionary cell"};
+    }
+    return std::make_tuple<Ref<CellSlice>, Ref<Cell>, bool>({}, cb.finalize(), true);
+  }
+  LabelParser label{std::move(dict), n};
+  int pfx_len = label.common_prefix_len(key, n);
+  assert(pfx_len >= 0 && pfx_len <= label.l_bits && label.l_bits <= n);
+  if (pfx_len < label.l_bits) {
+    // have to insert a new node (fork) inside the current edge
+    if (mode == Dictionary::SetMode::Replace) {
+      // key not found, return unchanged dictionary
+      return std::make_tuple<Ref<CellSlice>, Ref<Cell>, bool>({}, {}, false);
+    }
+    // first, create the edge + new leaf cell
+    int m = n - pfx_len - 1;
+    CellBuilder cb;
+    append_dict_label(cb, key + (pfx_len + 1), m, m);
+    if (!store_val(cb)) {
+      throw VmError{Excno::cell_ov, "cannot store new value into a dictionary cell"};
+    }
+    Ref<Cell> c1 = cb.finalize();  // new leaf cell corresponding to `key`
+    //cb.reset();
+    // create the lower portion of the old edge
+    int t = label.l_bits - pfx_len - 1;
+    auto cs = std::move(label.remainder);
+    if (label.l_same) {
+      append_dict_label_same(cb, label.l_same & 1, t, m);
+    } else {
+      cs.write().advance(pfx_len + 1);
+      append_dict_label(cb, cs->data_bits(), t, m);
+      cs.unique_write().fetch_bits(t);
+    }
+    // now cs is the old payload of the edge, either a value or two subdictionary references
+    if (!cell_builder_add_slice_bool(cb, *cs)) {
+      throw VmError{Excno::cell_ov, "cannot change label of an old dictionary cell (?)"};
+    }
+    Ref<Cell> c2 = cb.finalize();  // the other child of the new fork
+    //cb.reset();
+    append_dict_label(cb, key, pfx_len, n);
+    bool sw_bit = key[pfx_len];
+    if (sw_bit) {
+      c1.swap(c2);
+    }
+    cb.store_ref(std::move(c1)).store_ref(std::move(c2));
+    return std::make_tuple<Ref<CellSlice>, Ref<Cell>, bool>({}, cb.finalize(), true);
+  }
+  if (label.l_bits == n) {
+    // the edge leads to a leaf node
+    // this leaf node already contains a value for the key wanted
+    auto old_val = std::move(label.remainder);
+    old_val.write().advance(label.s_bits);
+    if (mode == Dictionary::SetMode::Add) {
+      // return unchanged dictionary
+      return std::make_tuple<Ref<CellSlice>, Ref<Cell>, bool>(std::move(old_val), {}, false);
+    }
+    // replace the value of the only element of the dictionary
+    CellBuilder cb;
+    append_dict_label(cb, key, n, n);
+    if (!store_val(cb)) {
+      throw VmError{Excno::cell_ov, "cannot store new value into a dictionary cell"};
+    }
+    return std::make_tuple(std::move(old_val), cb.finalize(), true);
+  }
+  // main case: the edge leads to a fork, have to insert new value either in the right or in the left subtree
+  auto c1 = label.remainder->prefetch_ref(0);
+  auto c2 = label.remainder->prefetch_ref(1);
+  Ref<CellSlice> old_val;
+  label.remainder.clear();
+  if (key[label.l_bits]) {
+    // insert key into the right child (c2)
+    auto res = dict_lookup_set(std::move(c2), key + (label.l_bits + 1), n - label.l_bits - 1, store_val, mode);
+    old_val = std::get<Ref<CellSlice>>(res);
+    if (!std::get<bool>(res)) {
+      // return unchanged dictionary
+      return std::make_tuple<Ref<CellSlice>, Ref<Cell>, bool>(std::move(old_val), {}, false);
+    }
+    c2 = std::get<Ref<Cell>>(std::move(res));
+  } else {
+    // insert key into the left child (c1)
+    auto res = dict_lookup_set(std::move(c1), key + (label.l_bits + 1), n - label.l_bits - 1, store_val, mode);
+    old_val = std::get<Ref<CellSlice>>(res);
+    if (!std::get<bool>(res)) {
+      // return unchanged dictionary
+      return std::make_tuple(std::move(old_val), Ref<Cell>{}, false);
+    }
+    c1 = std::get<Ref<Cell>>(std::move(res));
+  }
+  // create a new label with the same content
+  CellBuilder cb;
+  append_dict_label(cb, key, label.l_bits, n);
+  cb.store_ref(std::move(c1)).store_ref(std::move(c2));
+  return std::make_tuple<Ref<CellSlice>, Ref<Cell>, bool>(std::move(old_val), cb.finalize(), true);
+}
+
+std::pair<Ref<Cell>, bool> pfx_dict_set(Ref<Cell> dict, td::ConstBitPtr key, int m, int n,
+                                        const PrefixDictionary::store_value_func_t& store_val,
+                                        Dictionary::SetMode mode) {
+  std::cerr << "up to " << n << "-bit prefix code dictionary modification for " << m << "-bit key = " << key.to_hex(m)
+            << std::endl;
+  if (m > n) {
+    return std::make_pair(Ref<Cell>{}, false);
+  }
+  if (dict.is_null()) {
+    // the dictionary is very empty
+    if (mode == Dictionary::SetMode::Replace) {
+      return std::make_pair(Ref<Cell>{}, false);
+    }
+    // create an one-element dictionary
+    CellBuilder cb;
+    append_dict_label(cb, key, m, n);
+    cb.store_long(0, 1);
+    if (!store_val(cb)) {
+      throw VmError{Excno::cell_ov, "cannot store new value into a dictionary cell"};
+    }
+    return std::make_pair(cb.finalize(), true);
+  }
+  LabelParser label{std::move(dict), n, 1};
+  int l = label.common_prefix_len(key, m);
+  assert(l >= 0 && l <= label.l_bits && label.l_bits <= n && l <= m && m <= n);
+  if (l < label.l_bits) {
+    // have to insert a new node (fork) inside the current edge
+    if (l == m || mode == Dictionary::SetMode::Replace) {
+      // key not found, return unchanged dictionary
+      return std::make_pair(Ref<Cell>{}, false);
+    }
+    // first, create the edge + new leaf cell
+    int q = l + 1;
+    CellBuilder cb;
+    append_dict_label(cb, key + q, m - q, n - q);
+    cb.store_long(0, 1);
+    if (!store_val(cb)) {
+      throw VmError{Excno::cell_ov, "cannot store new value into a prefix dictionary cell"};
+    }
+    Ref<Cell> c1 = cb.finalize();  // new leaf cell corresponding to `key`
+    // cb.reset(); // contained in finalize()
+    // create the lower portion of the old edge
+    int t = label.l_bits - q;
+    auto cs = std::move(label.remainder);
+    if (label.l_same) {
+      append_dict_label_same(cb, label.l_same & 1, t, n - q);
+    } else {
+      cs.write().advance(l + 1);
+      append_dict_label(cb, cs->data_bits(), t, n - q);
+      cs.unique_write().advance(t);
+    }
+    // now cs is the old payload of the edge, either a value or two subdictionary references
+    if (!cell_builder_add_slice_bool(cb, *cs)) {
+      throw VmError{Excno::cell_ov, "cannot change label of an old dictionary cell (?)"};
+    }
+    Ref<Cell> c2 = cb.finalize();  // the other child of the new fork
+    //cb.reset();
+    append_dict_label(cb, key, l, n);
+    bool sw_bit = key[l];
+    if (sw_bit) {
+      c1.swap(c2);
+    }
+    cb.store_long(1, 1).store_ref(c1).store_ref(c2);
+    return std::make_pair<Ref<Cell>, bool>(cb.finalize(), true);
+  }
+  assert(label.l_bits == l);
+  label.skip_label();
+  if (!label.remainder->have(1)) {
+    throw VmError{Excno::dict_err, "no node constructor in a prefix code dictionary"};
+  }
+  if (!label.remainder.unique_write().fetch_ulong(1)) {
+    // the edge leads to a leaf node
+    if (l != m || mode == Dictionary::SetMode::Add) {
+      // return unchanged dictionary
+      return std::make_pair<Ref<Cell>, bool>({}, false);
+    }
+    // this leaf node already contains a value for the key wanted
+    // replace the value of the only element of the dictionary
+    CellBuilder cb;
+    append_dict_label(cb, key, m, n);
+    cb.store_long(0, 1);
+    if (!store_val(cb)) {
+      throw VmError{Excno::cell_ov, "cannot store new value into a dictionary cell"};
+    }
+    return std::make_pair<Ref<Cell>, bool>(cb.finalize(), true);
+  }
+  // main case: the edge leads to a fork, have to insert new value either in the right or in the left subtree
+  if (label.remainder->size() || label.remainder->size_refs() != 2) {
+    throw VmError{Excno::dict_err, "invalid fork node in a prefix code dictionary"};
+  }
+  if (m == l) {
+    // cannot insert a value into a fork
+    return std::make_pair(Ref<Cell>{}, false);
+  }
+  auto c1 = label.remainder->prefetch_ref(0);
+  auto c2 = label.remainder->prefetch_ref(1);
+  label.remainder.clear();
+  if (key[l++]) {
+    // insert key into the right child (c2)
+    auto res = pfx_dict_set(std::move(c2), key + l, m - l, n - l, store_val, mode);
+    if (!res.second) {
+      // return unchanged dictionary
+      return std::make_pair(Ref<Cell>{}, false);
+    }
+    c2 = std::move(res.first);
+  } else {
+    // insert key into the left child (c1)
+    auto res = pfx_dict_set(std::move(c1), key + l, m - l, n - l, store_val, mode);
+    if (!res.second) {
+      // return unchanged dictionary
+      return std::make_pair(Ref<Cell>{}, false);
+    }
+    c1 = std::move(res.first);
+  }
+  // create a new label with the same content
+  CellBuilder cb;
+  append_dict_label(cb, key, l - 1, n);
+  cb.store_long(1, 1).store_ref(std::move(c1)).store_ref(std::move(c2));
+  return std::make_pair(cb.finalize(), true);
+}
+
+std::pair<Ref<CellSlice>, Ref<Cell>> pfx_dict_lookup_delete(Ref<Cell> dict, td::ConstBitPtr key, int m, int n) {
+  //std::cerr << "up to " << n << "-bit prefix dictionary delete for " << m << "-bit key = " << key.to_hex(m) << std::endl;
+  if (dict.is_null()) {
+    // the dictionary is very empty
+    return std::make_pair(Ref<CellSlice>{}, Ref<Cell>{});
+  }
+  LabelParser label{std::move(dict), n, 1};
+  int l = label.common_prefix_len(key, m);
+  assert(l >= 0 && l <= label.l_bits && l <= m && m <= n && label.l_bits <= n);
+  if (l < label.l_bits) {
+    // key not found
+    return std::make_pair(Ref<CellSlice>{}, Ref<Cell>{});
+  }
+  assert(label.l_bits == l);
+  label.skip_label();
+  if (!label.remainder->have(1)) {
+    throw VmError{Excno::dict_err, "no node constructor in a prefix code dictionary"};
+  }
+  if (!label.remainder.unique_write().fetch_ulong(1)) {
+    // the edge leads to a leaf node
+    if (l < m) {
+      // key not found
+      return std::make_pair(Ref<CellSlice>{}, Ref<Cell>{});
+    }
+    // this leaf node contains the value for the key wanted
+    return std::make_pair(std::move(label.remainder), Ref<Cell>{});
+  }
+  // main case: the edge leads to a fork, have to delete the key either from the right or from the left subtree
+  if (label.remainder->size() || label.remainder->size_refs() != 2) {
+    throw VmError{Excno::dict_err, "invalid fork node in a prefix code dictionary"};
+  }
+  if (l == m) {
+    // the fork itself cannot correspond to a key, key not found
+    return std::make_pair(Ref<CellSlice>{}, Ref<Cell>{});
+  }
+  auto c1 = label.remainder->prefetch_ref(0);
+  auto c2 = label.remainder->prefetch_ref(1);
+  Ref<CellSlice> old_val;
+  label.remainder.clear();
+  bool sw_bit = key[l++];
+  if (sw_bit) {
+    // delete key from the right child (c2)
+    auto res = pfx_dict_lookup_delete(std::move(c2), key + l, m - l, n - l);
+    if (res.first.is_null()) {
+      // return unchanged dictionary
+      return std::make_pair(Ref<CellSlice>{}, Ref<Cell>{});
+    }
+    old_val = std::move(res.first);
+    c2 = std::move(res.second);
+  } else {
+    // delete key from the left child (c1)
+    auto res = pfx_dict_lookup_delete(std::move(c1), key + l, m - l, n - l);
+    if (res.first.is_null()) {
+      // return unchanged dictionary
+      return std::make_pair(Ref<CellSlice>{}, Ref<Cell>{});
+    }
+    old_val = std::move(res.first);
+    c1 = std::move(res.second);
+  }
+  if (c1.not_null() && c2.not_null()) {
+    // create a new label with the same content leading to a fork with modified children
+    CellBuilder cb;
+    append_dict_label(cb, key, label.l_bits, n);
+    cb.store_long(1, 1).store_ref(std::move(c1)).store_ref(std::move(c2));
+    return std::make_pair(std::move(old_val), cb.finalize());
+  }
+  // have to merge current edge with the edge leading to c1 or c2
+  if (!sw_bit) {
+    c1.swap(c2);
+  }
+  assert(c1.not_null() && c2.is_null());
+  unsigned char buffer[Dictionary::max_key_bytes];
+  td::BitPtr bw{buffer};
+  bw.concat(key, label.l_bits);
+  bw.concat_same(!sw_bit, 1);
+  LabelParser label2{std::move(c1), n - l, 1};
+  bw += label2.extract_label_to(bw);
+  assert(bw.offs >= 0 && bw.offs <= Dictionary::max_key_bits);
+  CellBuilder cb;
+  append_dict_label(cb, td::ConstBitPtr{buffer}, bw.offs, n);
+  if (!cell_builder_add_slice_bool(cb, *label2.remainder)) {
+    throw VmError{Excno::cell_ov, "cannot change label of an old prefix code dictionary cell while merging edges"};
+  }
+  label2.remainder.clear();
+  return std::make_pair(std::move(old_val), cb.finalize());
+}
+
+Ref<Cell> dict_map(Ref<Cell> dict, td::BitPtr key_buffer, int n, int total_key_len,
+                   const Dictionary::map_func_t& map_func) {
+  if (dict.is_null()) {
+    // dictionary is empty
+    return dict;
+  }
+  LabelParser label{std::move(dict), n};
+  int l = label.l_bits;
+  label.extract_label_to(key_buffer);
+  if (l == n) {
+    // leaf node, value left in label.remainder
+    CellBuilder cb;
+    append_dict_label(cb, key_buffer, l, n);
+    if (!map_func(cb, std::move(label.remainder), key_buffer + n - total_key_len, total_key_len)) {
+      return {};  // leaf to be omitted from the result altogether
+    }
+    return cb.finalize();
+  }
+  assert(l >= 0 && l < n);
+  // a fork with two children, c1 and c2
+  auto c1 = label.remainder->prefetch_ref(0);
+  auto c2 = label.remainder->prefetch_ref(1);
+  key_buffer += l + 1;
+  key_buffer[-1] = 0;
+  // recursive map applied to both children
+  c1 = dict_map(std::move(c1), key_buffer, n - l - 1, total_key_len, map_func);
+  key_buffer[-1] = 1;
+  c2 = dict_map(std::move(c2), key_buffer, n - l - 1, total_key_len, map_func);
+  if (c1.is_null() && c2.is_null()) {
+    return {};  // both children have become empty
+  }
+  if (c1.is_null() || c2.is_null()) {
+    if (c1.is_null()) {
+      c1 = std::move(c2);
+      // notice that the label of c2 is still in key_buffer
+    } else {
+      // recover label of c1
+      key_buffer[-1] = 0;
+    }
+    // one of children is empty, have to combine current edge with the root edge of c1
+    LabelParser label1{std::move(c1), n - l - 1};
+    label1.extract_label_to(key_buffer);
+    CellBuilder cb;
+    key_buffer -= l + 1;
+    // store combined label for the new edge
+    append_dict_label(cb, key_buffer, l + 1 + label1.l_bits, n);
+    // store payload
+    if (!cell_builder_add_slice_bool(cb, *label1.remainder)) {
+      throw VmError{Excno::cell_ov, "cannot change label of an old dictionary cell while merging edges"};
+    }
+    return cb.finalize();
+  }
+  // main case: both children c1 and c2 remain non-empty
+  key_buffer -= l + 1;
+  CellBuilder cb;
+  append_dict_label(cb, key_buffer, l, n);
+  return cb.store_ref(std::move(c1)).store_ref(std::move(c2)).finalize();
+}
+
+}  // namespace
+
+bool Dictionary::set_gen(td::ConstBitPtr key, int key_len, const std::function<bool(CellBuilder&)>& store_val,
+                         SetMode mode) {
+  force_validate();
+  if (key_len != get_key_bits()) {
+    return false;
+  }
+  auto res = dict_set(get_root_cell(), key, key_len, store_val, mode);
+  if (res.second) {
+    set_root_cell(std::move(res.first));
+  }
+  return res.second;
+}
+
+bool Dictionary::set(td::ConstBitPtr key, int key_len, Ref<CellSlice> value, SetMode mode) {
+  return set_gen(key, key_len, [value](CellBuilder& cb) { return cell_builder_add_slice_bool(cb, *value); }, mode);
+}
+
+bool Dictionary::set_ref(td::ConstBitPtr key, int key_len, Ref<Cell> val_ref, SetMode mode) {
+  return set_gen(key, key_len, [val_ref](CellBuilder& cb) { return cb.store_ref_bool(val_ref); }, mode);
+}
+
+bool Dictionary::set_builder(td::ConstBitPtr key, int key_len, Ref<CellBuilder> val_b, SetMode mode) {
+  return set_gen(key, key_len, [val_b](CellBuilder& cb) { return cb.append_builder_bool(val_b); }, mode);
+}
+
+bool Dictionary::set_builder(td::ConstBitPtr key, int key_len, const CellBuilder& val_b, SetMode mode) {
+  return set_gen(key, key_len, [&val_b](CellBuilder& cb) { return cb.append_builder_bool(val_b); }, mode);
+}
+
+Ref<CellSlice> Dictionary::lookup_set_gen(td::ConstBitPtr key, int key_len, const store_value_func_t& store_val,
+                                          SetMode mode) {
+  force_validate();
+  if (key_len != get_key_bits()) {
+    return {};
+  }
+  auto res = dict_lookup_set(get_root_cell(), key, key_len, store_val, mode);
+  if (std::get<bool>(res)) {
+    set_root_cell(std::get<Ref<Cell>>(res));
+  }
+  return std::get<Ref<CellSlice>>(std::move(res));
+}
+
+Ref<CellSlice> Dictionary::lookup_set(td::ConstBitPtr key, int key_len, Ref<CellSlice> value, SetMode mode) {
+  return lookup_set_gen(key, key_len, [value](CellBuilder& cb) { return cell_builder_add_slice_bool(cb, *value); },
+                        mode);
+}
+
+Ref<Cell> Dictionary::lookup_set_ref(td::ConstBitPtr key, int key_len, Ref<Cell> val_ref, SetMode mode) {
+  return extract_value_ref(
+      lookup_set_gen(key, key_len, [val_ref](CellBuilder& cb) { return cb.store_ref_bool(val_ref); }, mode));
+}
+
+Ref<CellSlice> Dictionary::lookup_set_builder(td::ConstBitPtr key, int key_len, Ref<CellBuilder> val_b, SetMode mode) {
+  return lookup_set_gen(key, key_len, [val_b](CellBuilder& cb) { return cb.append_builder_bool(val_b); }, mode);
+}
+
+std::pair<Ref<CellSlice>, Ref<Cell>> DictionaryFixed::dict_lookup_delete(Ref<Cell> dict, td::ConstBitPtr key,
+                                                                         int n) const {
+  // std::cerr << "dictionary delete for " << n << "-bit key = " << key.to_hex(n) << std::endl;
+  if (dict.is_null()) {
+    // the dictionary is very empty
+    return std::make_pair(Ref<CellSlice>{}, Ref<Cell>{});
+  }
+  LabelParser label{std::move(dict), n, label_mode()};
+  int pfx_len = label.common_prefix_len(key, n);
+  assert(pfx_len >= 0 && pfx_len <= label.l_bits && label.l_bits <= n);
+  if (pfx_len < label.l_bits) {
+    // key not found
+    return std::make_pair(Ref<CellSlice>{}, Ref<Cell>{});
+  }
+  if (label.l_bits == n) {
+    // the edge leads to a leaf node
+    // this leaf node contains the value for the key wanted
+    label.skip_label();
+    return std::make_pair(std::move(label.remainder), Ref<Cell>{});
+  }
+  // main case: the edge leads to a fork, have to delete the key either from the right or from the left subtree
+  auto c1 = label.remainder->prefetch_ref(0);
+  auto c2 = label.remainder->prefetch_ref(1);
+  Ref<CellSlice> old_val;
+  label.remainder.clear();
+  bool sw_bit = key[label.l_bits];
+  if (sw_bit) {
+    // delete key from the right child (c2)
+    auto res = dict_lookup_delete(std::move(c2), key + (label.l_bits + 1), n - label.l_bits - 1);
+    if (res.first.is_null()) {
+      // return unchanged dictionary
+      return std::make_pair(Ref<CellSlice>{}, Ref<Cell>{});
+    }
+    old_val = std::move(res.first);
+    c2 = std::move(res.second);
+  } else {
+    // delete key from the left child (c1)
+    auto res = dict_lookup_delete(std::move(c1), key + (label.l_bits + 1), n - label.l_bits - 1);
+    if (res.first.is_null()) {
+      // return unchanged dictionary
+      return std::make_pair(Ref<CellSlice>{}, Ref<Cell>{});
+    }
+    old_val = std::move(res.first);
+    c1 = std::move(res.second);
+  }
+  if (c1.not_null() && c2.not_null()) {
+    // create a new label with the same content leading to a fork with modified children
+    CellBuilder cb;
+    append_dict_label(cb, key, label.l_bits, n);
+    return std::make_pair(std::move(old_val), finish_create_fork(cb, std::move(c1), std::move(c2), n - label.l_bits));
+  }
+  // have to merge current edge with the edge leading to c1 or c2
+  if (!sw_bit) {
+    c1.swap(c2);
+  }
+  assert(c1.not_null() && c2.is_null());
+  unsigned char buffer[Dictionary::max_key_bytes];
+  td::BitPtr bw{buffer};
+  bw.concat(key, label.l_bits);
+  bw.concat_same(!sw_bit, 1);
+  LabelParser label2{std::move(c1), n - label.l_bits - 1, label_mode()};
+  bw += label2.extract_label_to(bw);
+  assert(bw.offs >= 0 && bw.offs <= Dictionary::max_key_bits);
+  CellBuilder cb;
+  append_dict_label(cb, td::ConstBitPtr{buffer}, bw.offs, n);
+  if (!cell_builder_add_slice_bool(cb, *label2.remainder)) {
+    throw VmError{Excno::cell_ov, "cannot change label of an old dictionary cell while merging edges"};
+  }
+  label2.remainder.clear();
+  return std::make_pair(std::move(old_val), cb.finalize());
+}
+
+Ref<CellSlice> DictionaryFixed::lookup_delete(td::ConstBitPtr key, int key_len) {
+  force_validate();
+  if (key_len != get_key_bits()) {
+    return {};
+  }
+  auto res = dict_lookup_delete(get_root_cell(), key, key_len);
+  if (res.first.not_null()) {
+    set_root_cell(std::move(res.second));
+  }
+  return std::move(res.first);
+}
+
+Ref<Cell> Dictionary::lookup_delete_ref(td::ConstBitPtr key, int key_len) {
+  return extract_value_ref(lookup_delete(key, key_len));
+}
+
+Ref<CellSlice> DictionaryFixed::dict_lookup_minmax(Ref<Cell> dict, td::BitPtr key_buffer, int n, int mode) const {
+  if (dict.is_null()) {
+    return {};
+  }
+  while (1) {
+    LabelParser label{std::move(dict), n, label_mode()};
+    int l = label.extract_label_to(key_buffer);
+    assert(l >= 0 && l <= n);
+    key_buffer += l;
+    n -= l;
+    if (!n) {
+      return std::move(label.remainder);
+    }
+    if (l) {
+      mode >>= 1;
+    }
+    bool bit = mode & 1;
+    dict = label.remainder->prefetch_ref(bit);
+    *key_buffer++ = bit;
+    --n;
+    mode >>= 1;
+  }
+}
+
+Ref<CellSlice> DictionaryFixed::dict_lookup_nearest(Ref<Cell> dict, td::BitPtr key_buffer, int n, bool allow_eq,
+                                                    int mode) const {
+  if (dict.is_null()) {
+    return {};
+  }
+  LabelParser label{dict, n, label_mode()};
+  int pfx_len = label.common_prefix_len(key_buffer, n);
+  assert(pfx_len >= 0 && pfx_len <= label.l_bits && label.l_bits <= n);
+  if (pfx_len < label.l_bits) {
+    if (key_buffer[pfx_len] == ((mode >> static_cast<int>(pfx_len != 0)) & 1)) {
+      return {};
+    } else {
+      return dict_lookup_minmax(std::move(dict), key_buffer, n, ~mode);
+    }
+  }
+  dict.clear();
+  if (label.l_bits) {
+    mode >>= 1;
+  }
+  key_buffer += label.l_bits;
+  n -= label.l_bits;
+  if (!n) {
+    if (!allow_eq) {
+      return {};
+    }
+    label.skip_label();
+    return std::move(label.remainder);
+  }
+  bool bit = *key_buffer++;
+  auto res = dict_lookup_nearest(label.remainder->prefetch_ref(bit), key_buffer, n - 1, allow_eq, mode >> 1);
+  if (res.not_null() || bit == (mode & 1)) {
+    return res;
+  }
+  key_buffer[-1] = mode & 1;
+  dict = label.remainder->prefetch_ref(mode & 1);
+  label.remainder.clear();
+  return dict_lookup_minmax(std::move(dict), key_buffer, n - 1, ~mode >> 1);
+}
+
+Ref<CellSlice> DictionaryFixed::lookup_nearest_key(td::BitPtr key_buffer, int key_len, bool fetch_next, bool allow_eq,
+                                                   bool invert_first) {
+  force_validate();
+  if (key_len != get_key_bits()) {
+    return {};
+  }
+  return dict_lookup_nearest(get_root_cell(), key_buffer, key_len, allow_eq,
+                             (-static_cast<int>(fetch_next)) ^ static_cast<int>(invert_first));
+}
+
+Ref<CellSlice> DictionaryFixed::get_minmax_key(td::BitPtr key_buffer, int key_len, bool fetch_max, bool invert_first) {
+  force_validate();
+  if (key_len != get_key_bits()) {
+    return {};
+  }
+  return dict_lookup_minmax(get_root_cell(), key_buffer, key_len,
+                            (-static_cast<int>(fetch_max)) ^ static_cast<int>(invert_first));
+}
+
+Ref<Cell> Dictionary::get_minmax_key_ref(td::BitPtr key_buffer, int key_len, bool fetch_max, bool invert_first) {
+  return extract_value_ref(get_minmax_key(key_buffer, key_len, fetch_max, invert_first));
+}
+
+Ref<CellSlice> DictionaryFixed::extract_minmax_key(td::BitPtr key_buffer, int key_len, bool fetch_max,
+                                                   bool invert_first) {
+  force_validate();
+  if (key_len != get_key_bits()) {
+    return {};
+  }
+  auto val = dict_lookup_minmax(get_root_cell(), key_buffer, key_len, -(fetch_max ? 1 : 0) ^ (invert_first ? 1 : 0));
+  if (val.is_null()) {
+    return {};
+  }
+  auto res = dict_lookup_delete(get_root_cell(), key_buffer, key_len);
+  assert(res.first.not_null());
+  set_root_cell(std::move(res.second));
+  return val;
+}
+
+Ref<Cell> Dictionary::extract_minmax_key_ref(td::BitPtr key_buffer, int key_len, bool fetch_max, bool invert_first) {
+  return extract_value_ref(extract_minmax_key(key_buffer, key_len, fetch_max, invert_first));
+}
+
+std::pair<Ref<Cell>, bool> DictionaryFixed::extract_prefix_subdict_internal(Ref<Cell> dict, td::ConstBitPtr prefix,
+                                                                            int prefix_len, bool remove_prefix) const {
+  if (is_empty() || prefix_len <= 0) {
+    return {{}, false};  // unchanged
+  }
+  if (prefix_len > get_key_bits()) {
+    return {{}, true};  // empty dict
+  }
+  int n = get_key_bits(), m = 0;
+  while (true) {
+    LabelParser label{std::move(dict), n - m, label_mode()};
+    int l = std::min(prefix_len - m, label.l_bits);
+    if (label.common_prefix_len(prefix + m, l) < l) {
+      return {{}, true};  // empty dict
+    }
+    if (m + label.l_bits < prefix_len) {
+      m += label.l_bits;
+      dict = label.remainder->prefetch_ref(prefix[m++]);
+      continue;
+    }
+    // end, have consumed all of prefix
+    vm::CellBuilder cb;
+    if (!remove_prefix) {
+      if (!m) {
+        // dictionary unchanged: all keys already begin with prefix
+        return {{}, false};
+      }
+      // concatenate prefix with a suffix of the label
+      assert(m <= prefix_len);
+      unsigned char buffer[max_key_bytes];
+      auto p = td::BitPtr{buffer};
+      p.copy_from(prefix, m);
+      label.extract_label_to(p + m);
+      append_dict_label(cb, p, m + label.l_bits, key_bits);
+    } else if (!label.l_same) {
+      m += label.l_bits - prefix_len;  // leave that many last bits of the label
+      append_dict_label(cb, label.bits_end() - m, m, key_bits - prefix_len);
+      label.skip_label();
+    } else {
+      m += label.l_bits - prefix_len;  // leave that many last bits of the label
+      append_dict_label_same(cb, label.l_same & 1, m, key_bits - prefix_len);
+    }
+    if (!cb.append_cellslice_bool(*label.remainder)) {
+      throw VmError{Excno::cell_ov, "cannot create new dictionary root while constructing prefix subdictionary"};
+    }
+    return {Ref<Cell>{cb.finalize()}, true};
+  }
+}
+
+bool DictionaryFixed::cut_prefix_subdict(td::ConstBitPtr prefix, int prefix_len, bool remove_prefix) {
+  force_validate();
+  if (prefix_len < 0) {
+    return false;
+  }
+  if (prefix_len > key_bits && remove_prefix) {
+    return false;
+  }
+  auto res = extract_prefix_subdict_internal(get_root_cell(), prefix, prefix_len, remove_prefix);
+  if (remove_prefix) {
+    key_bits -= prefix_len;
+  }
+  if (res.second) {
+    set_root_cell(std::move(res.first));
+  }
+  return true;
+}
+
+Ref<vm::Cell> DictionaryFixed::extract_prefix_subdict_root(td::ConstBitPtr prefix, int prefix_len, bool remove_prefix) {
+  force_validate();
+  auto res = extract_prefix_subdict_internal(get_root_cell(), prefix, prefix_len, remove_prefix);
+  return res.second ? res.first : root_cell;
+}
+
+std::pair<Ref<Cell>, int> DictionaryFixed::dict_filter(Ref<Cell> dict, td::BitPtr key, int n,
+                                                       const DictionaryFixed::filter_func_t& check_leaf) const {
+  // std::cerr << "dictionary filter for " << n << "-bit key = " << (key + n - key_bits).to_hex(key_bits - n)
+  //           << std::endl;
+  if (dict.is_null()) {
+    // empty dictionary, return unchanged
+    return {{}, 0};
+  }
+  LabelParser label{std::move(dict), n, label_mode()};
+  assert(label.l_bits >= 0 && label.l_bits <= n);
+  label.extract_label_to(key);
+  key += label.l_bits;
+  if (label.l_bits == n) {
+    // leaf
+    int res = check_leaf(label.remainder.write(), key - key_bits, key_bits);
+    return {{}, res < 0 ? res : !res};
+  }
+  // fork, process left and right subtrees
+  ++key;
+  key[-1] = false;
+  int delta = label.l_bits + 1;
+  n -= delta;
+  auto left_res = dict_filter(label.remainder->prefetch_ref(0), key, n, check_leaf);
+  if (left_res.second < 0) {
+    return left_res;
+  }
+  key[-1] = true;
+  auto right_res = dict_filter(label.remainder->prefetch_ref(1), key, n, check_leaf);
+  if ((left_res.second | right_res.second) <= 0) {
+    // error in right, or both left and right unchanged
+    return right_res;
+  }
+  auto left = left_res.second ? std::move(left_res.first) : label.remainder->prefetch_ref(0);
+  auto right = right_res.second ? std::move(right_res.first) : label.remainder->prefetch_ref(1);
+  auto changes = left_res.second + right_res.second;
+  label.clear();
+  if (left.is_null()) {
+    if (right.is_null()) {
+      // both branches are empty => the result is an empty tree
+      return {{}, changes};
+    }
+    std::swap(left, right);
+  } else if (right.is_null()) {
+    key[-1] = false;
+  } else {
+    // both new branches are non-empty => create new fork
+    CellBuilder cb;
+    append_dict_label(cb, key - delta, label.l_bits, n + delta);
+    return {finish_create_fork(cb, std::move(left), std::move(right), n + 1), changes};
+  }
+  // only one child (in `left`) remains, collapse an edge
+  // NB: similar to code in lookup_delete()
+  assert(left.not_null() && right.is_null());
+  LabelParser label2{std::move(left), n, label_mode()};
+  label2.extract_label_to(key);
+  CellBuilder cb;
+  append_dict_label(cb, key - delta, delta + label2.l_bits, n + delta);
+  if (!cell_builder_add_slice_bool(cb, *label2.remainder)) {
+    throw VmError{Excno::cell_ov, "cannot change label of an old dictionary cell while merging edges"};
+  }
+  label2.remainder.clear();
+  return {cb.finalize(), changes};
+}
+
+int DictionaryFixed::filter(DictionaryFixed::filter_func_t check_leaf) {
+  force_validate();
+  unsigned char buffer[DictionaryFixed::max_key_bytes];
+  auto res = dict_filter(get_root_cell(), td::BitPtr{buffer}, key_bits, check_leaf);
+  if (res.second > 0) {
+    // std::cerr << "after filter (" << res.second << " changes): new augmented dictionary root is:\n";
+    // vm::load_cell_slice(res.first).print_rec(std::cerr);
+    set_root_cell(std::move(res.first));
+  }
+  return res.second;
+}
+
+void Dictionary::map(const map_func_t& map_func) {
+  force_validate();
+  int key_len = get_key_bits();
+  unsigned char key_buffer[max_key_bytes];
+  auto res = dict_map(get_root_cell(), td::BitPtr{key_buffer}, key_len, key_len, map_func);
+  set_root_cell(std::move(res));
+}
+
+void Dictionary::map(const simple_map_func_t& simple_map_func) {
+  using namespace std::placeholders;
+  map_func_t map_func = std::bind(simple_map_func, _1, _2);
+  map(map_func);
+}
+
+// mode: +1 = forbid empty dict1 with non-empty dict2
+//       +2 = forbid empty dict2 with non-empty dict1
+Ref<Cell> DictionaryFixed::dict_combine_with(Ref<Cell> dict1, Ref<Cell> dict2, td::BitPtr key_buffer, int n,
+                                             int total_key_len, const DictionaryFixed::combine_func_t& combine_func,
+                                             int mode, int skip1, int skip2) const {
+  if (dict1.is_null()) {
+    assert(!skip2);
+    if ((mode & 1) && dict2.is_null()) {
+      throw CombineError{};
+    }
+    return dict2;
+  } else if (dict2.is_null()) {
+    assert(!skip1);
+    if ((mode & 2)) {
+      throw CombineError{};
+    }
+    return dict1;
+  }
+  // both dictionaries non-empty
+  // skip1: remove that much first bits from all keys in dictionary dict1 (its keys are actually n + skip1 bits long)
+  // skip2: similar for dict2
+  // resulting dictionary will have n-bit keys
+  LabelParser label1{dict1, n + skip1, label_mode()}, label2{dict2, n + skip2, label_mode()};
+  int l1 = label1.l_bits - skip1, l2 = label2.l_bits - skip2;
+  assert(l1 >= 0 && l2 >= 0);
+  assert(!skip1 || label1.common_prefix_len(key_buffer - skip1, skip1) == skip1);
+  assert(!skip2 || label2.common_prefix_len(key_buffer - skip2, skip2) == skip2);
+  label1.extract_label_to(key_buffer - skip1);
+  int c = label2.common_prefix_len(key_buffer - skip2, skip2 + l1) - skip2;
+  assert(c >= 0 && c <= l1 && c <= l2);
+  if (c < l1 && c < l2) {
+    // the two dictionaries have disjoint keys
+    dict1.clear();
+    dict2.clear();
+    if ((mode & 3)) {
+      throw CombineError{};
+    }
+    CellBuilder cb;
+    append_dict_label(cb, key_buffer + c + 1, l1 - c - 1, n - c - 1);
+    if (!cell_builder_add_slice_bool(cb, *label1.remainder)) {
+      throw VmError{Excno::cell_ov, "cannot prune label of an old dictionary cell while merging dictionaries"};
+    }
+    label1.remainder.clear();
+    dict1 = cb.finalize();
+    // cb.reset(); // included into finalize();
+    // now dict1 has been "pruned" -- first skip1+c+1 bits removed from its root egde label
+    label2.extract_label_to(key_buffer - skip2);
+    append_dict_label(cb, key_buffer + c + 1, l2 - c - 1, n - c - 1);
+    if (!cell_builder_add_slice_bool(cb, *label2.remainder)) {
+      throw VmError{Excno::cell_ov, "cannot change label of an old dictionary cell while merging edges"};
+    }
+    label2.remainder.clear();
+    dict2 = cb.finalize();
+    // now dict2 has also been pruned
+    if (!key_buffer[c]) {
+      std::swap(dict1, dict2);
+    }
+    // put dict1 into the left tree (with smaller labels), dict2 into the right tree
+    append_dict_label(cb, key_buffer, c, n);
+    return finish_create_fork(cb, std::move(dict1), std::move(dict2), n - c);
+  }
+  if (c == l1 && c == l2) {
+    // funny enough, the non-skipped parts of labels of l1 and l2 match
+    dict1.clear();
+    dict2.clear();
+    label2.skip_label();
+    CellBuilder cb;
+    append_dict_label(cb, key_buffer, c, n);
+    if (c == n) {
+      // our two dictionaries are in fact leafs with matching edge labels (keys)
+      if (!combine_func(cb, std::move(label1.remainder), std::move(label2.remainder), key_buffer + n - total_key_len,
+                        total_key_len)) {
+        // alas, the two values did not combine, this key will be absent from resulting dictionary
+        return {};
+      }
+      return cb.finalize();
+    }
+    assert(c < n);
+    key_buffer += c + 1;
+    key_buffer[-1] = 0;
+    // combine left subtrees
+    auto c1 = dict_combine_with(label1.remainder->prefetch_ref(0), label2.remainder->prefetch_ref(0), key_buffer,
+                                n - c - 1, total_key_len, combine_func);
+    key_buffer[-1] = 1;
+    // combine right subtrees
+    auto c2 = dict_combine_with(label1.remainder->prefetch_ref(1), label2.remainder->prefetch_ref(1), key_buffer,
+                                n - c - 1, total_key_len, combine_func);
+    label1.remainder.clear();
+    label2.remainder.clear();
+    // c1 and c2 are merged left and right children of dict1 and dict2
+    if (!c1.is_null() && !c2.is_null()) {
+      // both children non-empty, simply put them into the new node
+      return finish_create_fork(cb, std::move(c1), std::move(c2), n - c);
+    }
+    if (c1.is_null() && c2.is_null()) {
+      return {};  // both children empty, resulting dictionary also empty
+    }
+    // exactly one of c1 and c2 is non-empty, have to merge labels
+    bool sw = c1.is_null();
+    key_buffer[-1] = sw;
+    if (sw) {
+      c1 = std::move(c2);
+    }
+    LabelParser label3{std::move(c1), n - c - 1, label_mode()};
+    label3.extract_label_to(key_buffer);
+    key_buffer -= c + 1;
+    // store combined label for the new edge
+    cb.reset();
+    append_dict_label(cb, key_buffer, c + 1 + label3.l_bits, n);
+    // store payload
+    if (!cell_builder_add_slice_bool(cb, *label3.remainder)) {
+      throw VmError{Excno::cell_ov, "cannot change label of an old dictionary cell while merging edges"};
+    }
+    return cb.finalize();
+  }
+  if (c == l1) {
+    assert(c < l2);
+    dict1.clear();
+    if ((mode & 2)) {
+      throw CombineError{};
+    }
+    // children of root node of dict1
+    auto c1 = label1.remainder->prefetch_ref(0);
+    auto c2 = label1.remainder->prefetch_ref(1);
+    label1.remainder.clear();
+    // have to merge dict2 with one of the children of dict1
+    label2.extract_label_to(key_buffer - skip2);  // dict2 has longer label, extract it
+    bool sw = key_buffer[c];
+    if (!sw) {
+      // merge c1 with dict2
+      c1 = dict_combine_with(std::move(c1), std::move(dict2), key_buffer + c + 1, n - c - 1, total_key_len,
+                             combine_func, mode, 0, skip2 + c + 1);
+    } else {
+      // merge c2 with dict2
+      c2 = dict_combine_with(std::move(c2), std::move(dict2), key_buffer + c + 1, n - c - 1, total_key_len,
+                             combine_func, mode, 0, skip2 + c + 1);
+    }
+    if (!c1.is_null() && !c2.is_null()) {
+      CellBuilder cb;
+      append_dict_label(cb, key_buffer, c, n);
+      return finish_create_fork(cb, std::move(c1), std::move(c2), n - c);
+    }
+    // one of children is empty, have to merge root edges
+    key_buffer[c] = !sw;
+    if (!sw) {
+      std::swap(c1, c2);
+    }
+    assert(!c1.is_null() && c2.is_null());
+    LabelParser label3{std::move(c1), n - c - 1, label_mode()};
+    label3.extract_label_to(key_buffer + c + 1);
+    CellBuilder cb;
+    append_dict_label(cb, key_buffer, c + 1 + label3.l_bits, n);
+    // store payload
+    if (!cell_builder_add_slice_bool(cb, *label3.remainder)) {
+      throw VmError{Excno::cell_ov, "cannot change label of an old dictionary cell while merging edges"};
+    }
+    return cb.finalize();
+  } else {
+    assert(c == l2 && c < l1);
+    dict2.clear();
+    if ((mode & 1)) {
+      throw CombineError{};
+    }
+    // children of root node of dict2
+    label2.skip_label();  // dict2 had shorter label anyway, label1 is already unpacked
+    auto c1 = label2.remainder->prefetch_ref(0);
+    auto c2 = label2.remainder->prefetch_ref(1);
+    label2.remainder.clear();
+    // have to merge dict1 with one of the children of dict2
+    bool sw = key_buffer[c];
+    if (!sw) {
+      // merge dict1 with c1
+      c1 = dict_combine_with(std::move(dict1), std::move(c1), key_buffer + c + 1, n - c - 1, total_key_len,
+                             combine_func, mode, skip1 + c + 1, 0);
+    } else {
+      // merge dict1 with c2
+      c2 = dict_combine_with(std::move(dict1), std::move(c2), key_buffer + c + 1, n - c - 1, total_key_len,
+                             combine_func, mode, skip1 + c + 1, 0);
+    }
+    if (!c1.is_null() && !c2.is_null()) {
+      CellBuilder cb;
+      append_dict_label(cb, key_buffer, c, n);
+      return finish_create_fork(cb, std::move(c1), std::move(c2), n - c);
+    }
+    // one of children is empty, have to merge root edges
+    key_buffer[c] = !sw;
+    if (!sw) {
+      std::swap(c1, c2);
+    }
+    assert(!c1.is_null() && c2.is_null());
+    LabelParser label3{std::move(c1), n - c - 1, label_mode()};
+    label3.extract_label_to(key_buffer + c + 1);
+    CellBuilder cb;
+    append_dict_label(cb, key_buffer, c + 1 + label3.l_bits, n);
+    // store payload
+    if (!cell_builder_add_slice_bool(cb, *label3.remainder)) {
+      throw VmError{Excno::cell_ov, "cannot change label of an old dictionary cell while merging edges"};
+    }
+    return cb.finalize();
+  }
+}
+
+bool DictionaryFixed::combine_with(DictionaryFixed& dict2, const combine_func_t& combine_func, int mode) {
+  force_validate();
+  dict2.force_validate();
+  int key_len = get_key_bits();
+  if (key_len != dict2.get_key_bits()) {
+    throw VmError{Excno::dict_err, "cannot combine dictionaries with different key lengths"};
+  }
+  unsigned char key_buffer[max_key_bytes];
+  try {
+    auto res = dict_combine_with(get_root_cell(), dict2.get_root_cell(), td::BitPtr{key_buffer}, key_len, key_len,
+                                 combine_func, mode);
+    set_root_cell(std::move(res));
+    return true;
+  } catch (CombineError) {
+    return false;
+  }
+}
+
+bool DictionaryFixed::combine_with(DictionaryFixed& dict2, const simple_combine_func_t& simple_combine_func, int mode) {
+  using namespace std::placeholders;
+  combine_func_t combine_func = std::bind(simple_combine_func, _1, _2, _3);
+  return combine_with(dict2, combine_func, mode);
+}
+
+bool DictionaryFixed::combine_with(DictionaryFixed& dict2) {
+  return combine_with(dict2,
+                      [](CellBuilder&, Ref<CellSlice>, Ref<CellSlice>, td::ConstBitPtr key, int key_len) -> bool {
+                        LOG(WARNING) << "dictionary merge conflict for key " << key.to_hex(key_len);
+                        throw CombineError{};
+                      });
+}
+
+bool DictionaryFixed::dict_check_for_each(Ref<Cell> dict, td::BitPtr key_buffer, int n, int total_key_len,
+                                          const DictionaryFixed::foreach_func_t& foreach_func,
+                                          bool invert_first) const {
+  if (dict.is_null()) {
+    return true;
+  }
+  LabelParser label{std::move(dict), n, label_mode()};
+  int l = label.l_bits;
+  label.extract_label_to(key_buffer);
+  if (l == n) {
+    // leaf node, value left in label.remainder
+    return foreach_func(std::move(label.remainder), key_buffer + n - total_key_len, total_key_len);
+  }
+  assert(l >= 0 && l < n);
+  // a fork with two children, c1 and c2
+  auto c1 = label.remainder->prefetch_ref(0);
+  auto c2 = label.remainder->prefetch_ref(1);
+  label.remainder.clear();
+  key_buffer += l + 1;
+  if (l) {
+    invert_first = false;
+  } else if (invert_first) {
+    std::swap(c1, c2);
+  }
+  key_buffer[-1] = invert_first;
+  // recursive check_foreach applied to both children
+  if (!dict_check_for_each(std::move(c1), key_buffer, n - l - 1, total_key_len, foreach_func)) {
+    return false;
+  }
+  key_buffer[-1] = !invert_first;
+  return dict_check_for_each(std::move(c2), key_buffer, n - l - 1, total_key_len, foreach_func);
+}
+
+bool DictionaryFixed::check_for_each(const foreach_func_t& foreach_func, bool invert_first) {
+  force_validate();
+  if (is_empty()) {
+    return true;
+  }
+  int key_len = get_key_bits();
+  unsigned char key_buffer[max_key_bytes];
+  return dict_check_for_each(get_root_cell(), td::BitPtr{key_buffer}, key_len, key_len, foreach_func, invert_first);
+}
+
+static inline bool set_bit(td::BitPtr ptr, bool value = true) {
+  *ptr = value;
+  return true;
+}
+
+// mode: +1 = check augmentation of dict1, +2 = ... of dict2
+bool DictionaryFixed::dict_scan_diff(Ref<Cell> dict1, Ref<Cell> dict2, td::BitPtr key_buffer, int n, int total_key_len,
+                                     const scan_diff_func_t& diff_func, int mode, int skip1, int skip2) const {
+  // skip1: remove that much first bits from all keys in dictionary dict1 (its keys are actually n + skip1 bits long)
+  // skip2: similar for dict2
+  // pretending to compare subdictionaries with n-bit keys
+  if (dict1.is_null()) {
+    if (dict2.is_null()) {
+      return true;  // both dictionaries are empty
+    }
+    assert(!skip2);
+    // dict1 empty, dict2 non-empty -> parse label of dict2
+    LabelParser label{dict2, n, label_mode()};
+    label.extract_label_to(key_buffer);
+    if (label.l_bits >= n) {
+      assert(label.l_bits == n);
+      // leaf in dict2, empty dict1
+      auto key = key_buffer + label.l_bits - total_key_len;
+      if ((mode & 2) && !check_leaf(label.remainder, key, total_key_len)) {
+        throw VmError{Excno::dict_err, "invalid leaf in the second dictionary being compared"};
+      }
+      return diff_func(key, total_key_len, {}, std::move(label.remainder));
+    }
+    n -= label.l_bits + 1;
+    key_buffer += label.l_bits + 1;
+    if ((mode & 2) && !check_fork_raw(label.remainder, n + 1)) {
+      throw VmError{Excno::dict_err, "invalid fork in the second dictionary being compared"};
+    }
+    // compare {} with each of children of dict2
+    for (unsigned sw = 0; sw < 2; sw++) {
+      key_buffer[-1] = (bool)sw;
+      if (!dict_scan_diff({}, label.remainder->prefetch_ref(sw), key_buffer, n, total_key_len, diff_func, mode)) {
+        return false;
+      }
+    }
+    return true;
+  } else if (dict2.is_null()) {
+    assert(!skip1);
+    // dict2 empty, dict1 non-empty -> parse label of dict1
+    LabelParser label{dict1, n, label_mode()};
+    label.extract_label_to(key_buffer);
+    if (label.l_bits >= n) {
+      assert(label.l_bits == n);
+      // leaf in dict1, empty dict2
+      auto key = key_buffer + label.l_bits - total_key_len;
+      if ((mode & 1) && !check_leaf(label.remainder, key, total_key_len)) {
+        throw VmError{Excno::dict_err, "invalid leaf in the first dictionary being compared"};
+      }
+      return diff_func(key, total_key_len, std::move(label.remainder), {});
+    }
+    n -= label.l_bits + 1;
+    key_buffer += label.l_bits + 1;
+    if ((mode & 1) && !check_fork_raw(label.remainder, n + 1)) {
+      throw VmError{Excno::dict_err, "invalid fork in the first dictionary being compared"};
+    }
+    // compare each of children of dict1 with {}
+    for (unsigned sw = 0; sw < 2; sw++) {
+      key_buffer[-1] = (bool)sw;
+      if (!dict_scan_diff(label.remainder->prefetch_ref(sw), {}, key_buffer, n, total_key_len, diff_func, mode)) {
+        return false;
+      }
+    }
+    return true;
+  }
+  // both dictionaries non-empty
+  if (skip1 == skip2 && (dict1 == dict2 || dict1->get_hash() == dict2->get_hash())) {
+    // dictionaries match, subtree comparison not necessary
+    return true;
+  }
+  LabelParser label1{dict1, n + skip1, label_mode()}, label2{dict2, n + skip2, label_mode()};
+  int l1 = label1.l_bits - skip1, l2 = label2.l_bits - skip2;
+  assert(l1 >= 0 && l2 >= 0);
+  assert(!skip1 || label1.common_prefix_len(key_buffer - skip1, skip1) == skip1);
+  assert(!skip2 || label2.common_prefix_len(key_buffer - skip2, skip2) == skip2);
+  label1.extract_label_to(key_buffer - skip1);
+  int c = label2.common_prefix_len(key_buffer - skip2, skip2 + l1) - skip2;
+  assert(c >= 0 && c <= l1 && c <= l2);
+  if (c < l1 && c < l2) {
+    // the two dictionaries have disjoint keys
+    if (!key_buffer[c]) {
+      // all keys of dict1 are before dict2
+      return dict_scan_diff(std::move(dict1), {}, key_buffer - skip1, n + skip1, total_key_len, diff_func, mode) &&
+             dict_scan_diff({}, std::move(dict2), key_buffer - skip2, n + skip2, total_key_len, diff_func, mode);
+    } else {
+      // all keys of dict2 are before dict1
+      return dict_scan_diff({}, std::move(dict2), key_buffer - skip2, n + skip2, total_key_len, diff_func, mode) &&
+             dict_scan_diff(std::move(dict1), {}, key_buffer - skip1, n + skip1, total_key_len, diff_func, mode);
+    }
+  }
+  if (c == l1 && c == l2) {
+    // funny enough, the non-skipped parts of labels of l1 and l2 match
+    dict1.clear();
+    dict2.clear();
+    label2.skip_label();
+    if (c == n) {
+      // our two dictionaries are in fact leafs with matching edge labels (keys)
+      auto key = key_buffer + n - total_key_len;
+      if ((mode & 1) && !check_leaf(label1.remainder, key, total_key_len)) {
+        throw VmError{Excno::dict_err, "invalid leaf in the first dictionary being compared"};
+      }
+      if ((mode & 2) && !check_leaf(label2.remainder, key, total_key_len)) {
+        throw VmError{Excno::dict_err, "invalid leaf in the second dictionary being compared"};
+      }
+      return label1.remainder->contents_equal(*label2.remainder) ||
+             diff_func(key, total_key_len, std::move(label1.remainder), std::move(label2.remainder));
+    }
+    assert(c < n);
+    key_buffer += c + 1;
+    n -= c + 1;
+    if ((mode & 1) && !check_fork_raw(label1.remainder, n + 1)) {
+      throw VmError{Excno::dict_err, "invalid fork in the first dictionary being compared"};
+    }
+    if ((mode & 2) && !check_fork_raw(label2.remainder, n + 1)) {
+      throw VmError{Excno::dict_err, "invalid fork in the second dictionary being compared"};
+    }
+    for (unsigned sw = 0; sw <= 1; sw++) {
+      key_buffer[-1] = (bool)sw;
+      // compare left and then right subtrees
+      if (!dict_scan_diff(label1.remainder->prefetch_ref(sw), label2.remainder->prefetch_ref(sw), key_buffer, n,
+                          total_key_len, diff_func, mode)) {
+        return false;
+      }
+    }
+    return true;
+  }
+  if (c == l1) {
+    assert(c < l2);
+    dict1.clear();
+    if ((mode & 1) && !check_fork_raw(label1.remainder, n - c)) {
+      throw VmError{Excno::dict_err, "invalid fork in the first dictionary being compared"};
+    }
+    // children of root node of dict1
+    auto c1 = label1.remainder->prefetch_ref(0);
+    auto c2 = label1.remainder->prefetch_ref(1);
+    label1.remainder.clear();
+    // have to compare dict2 with one of the children of dict1
+    label2.extract_label_to(key_buffer - skip2);  // dict2 has longer label, extract it
+    key_buffer += c + 1;
+    n -= c + 1;
+    bool sw = key_buffer[-1];
+    key_buffer[-1] = false;
+    if (!sw) {
+      // compare c1 with dict2, then c2 with {}
+      return dict_scan_diff(std::move(c1), std::move(dict2), key_buffer, n, total_key_len, diff_func, mode, 0,
+                            skip2 + c + 1) &&
+             set_bit(key_buffer - 1) &&
+             dict_scan_diff(std::move(c2), {}, key_buffer, n, total_key_len, diff_func, mode);
+    } else {
+      // compare c1 with {}, then c2 with dict2
+      return dict_scan_diff(std::move(c1), {}, key_buffer, n, total_key_len, diff_func, mode) &&
+             set_bit(key_buffer - 1) &&
+             dict_scan_diff(std::move(c2), std::move(dict2), key_buffer, n, total_key_len, diff_func, mode, 0,
+                            skip2 + c + 1);
+    }
+  } else {
+    assert(c == l2 && c < l1);
+    dict2.clear();
+    label2.skip_label();  // dict2 had shorter label anyway, label1 is already unpacked
+    if ((mode & 2) && !check_fork_raw(label2.remainder, n - c)) {
+      throw VmError{Excno::dict_err, "invalid fork in the second dictionary being compared"};
+    }
+    // children of root node of dict2
+    auto c1 = label2.remainder->prefetch_ref(0);
+    auto c2 = label2.remainder->prefetch_ref(1);
+    label2.remainder.clear();
+    // have to compare dict1 with one of the children of dict2
+    key_buffer += c + 1;
+    n -= c + 1;
+    bool sw = key_buffer[-1];
+    key_buffer[-1] = false;
+    if (!sw) {
+      // compare dict1 with c1, then {} with c2
+      return dict_scan_diff(std::move(dict1), std::move(c1), key_buffer, n, total_key_len, diff_func, mode,
+                            skip1 + c + 1, 0) &&
+             set_bit(key_buffer - 1) &&
+             dict_scan_diff({}, std::move(c2), key_buffer, n, total_key_len, diff_func, mode);
+    } else {
+      // compare {} with c1, then dict1 with c2
+      return dict_scan_diff({}, std::move(c1), key_buffer, n, total_key_len, diff_func, mode) &&
+             set_bit(key_buffer - 1) &&
+             dict_scan_diff(std::move(dict1), std::move(c2), key_buffer, n, total_key_len, diff_func, mode,
+                            skip1 + c + 1, 0);
+    }
+  }
+}
+
+bool DictionaryFixed::scan_diff(DictionaryFixed& dict2, const scan_diff_func_t& diff_func, int check_augm) {
+  force_validate();
+  dict2.force_validate();
+  int key_len = get_key_bits();
+  if (key_len != dict2.get_key_bits()) {
+    throw VmError{Excno::dict_err, "cannot compare dictionaries with different key lengths"};
+  }
+  unsigned char key_buffer[max_key_bytes];
+  try {
+    return dict_scan_diff(get_root_cell(), dict2.get_root_cell(), td::BitPtr{key_buffer}, key_len, key_len, diff_func,
+                          check_augm);
+  } catch (CombineError) {
+    return false;
+  }
+}
+
+bool DictionaryFixed::dict_validate_check(Ref<Cell> dict, td::BitPtr key_buffer, int n, int total_key_len,
+                                          const DictionaryFixed::foreach_func_t& foreach_func,
+                                          bool invert_first) const {
+  //LOG(DEBUG) << "dict_validate_check for " << total_key_len - n << "-bit key prefix " << (key_buffer - n + total_key_len).to_hex(total_key_len - n);
+  if (dict.is_null()) {
+    return true;
+  }
+  LabelParser label{std::move(dict), n, label_mode()};
+  int l = label.l_bits;
+  label.extract_label_to(key_buffer);
+  if (l == n) {
+    // leaf node, value left in label.remainder
+    vm::CellSlice cs{*label.remainder};
+    auto key = key_buffer + n - total_key_len;
+    if (!(check_leaf(cs, key, total_key_len) && foreach_func(std::move(label.remainder), key, total_key_len))) {
+      LOG(DEBUG) << "invalid dictionary leaf node with " << total_key_len << "-bit key " << key.to_hex(total_key_len);
+      return false;
+    }
+    return true;
+  }
+  assert(l >= 0 && l < n);
+  // a fork with two children, c1 and c2
+  auto c1 = label.remainder.write().fetch_ref();
+  auto c2 = label.remainder.unique_write().fetch_ref();
+  key_buffer += l + 1;
+  n -= l + 1;
+  if (!check_fork(label.remainder.write(), c1, c2, n + 1)) {
+    LOG(DEBUG) << "invalid dictionary fork augmentation for fork node with " << total_key_len - n - 1
+               << "-bit key prefix " << (key_buffer + n - total_key_len).to_hex(total_key_len - n - 1);
+    return false;
+  }
+  label.remainder.clear();
+  if (l) {
+    invert_first = false;
+  } else if (invert_first) {
+    std::swap(c1, c2);
+  }
+  key_buffer[-1] = invert_first;
+  // recursive check_foreach applied to both children
+  if (!dict_validate_check(std::move(c1), key_buffer, n, total_key_len, foreach_func)) {
+    return false;
+  }
+  key_buffer[-1] = !invert_first;
+  return dict_validate_check(std::move(c2), key_buffer, n, total_key_len, foreach_func);
+}
+
+bool DictionaryFixed::validate_check(const DictionaryFixed::foreach_func_t& foreach_func, bool invert_first) {
+  if (!validate()) {
+    return false;
+  }
+  if (is_empty()) {
+    return true;
+  }
+  int key_len = get_key_bits();
+  unsigned char key_buffer[max_key_bytes];
+  return dict_validate_check(get_root_cell(), td::BitPtr{key_buffer}, key_len, key_len, foreach_func, invert_first);
+}
+
+bool DictionaryFixed::validate_all() {
+  return validate_check([](Ref<CellSlice> value, td::ConstBitPtr key, int n) { return true; }) || invalidate();
+}
+
+/*
+ * 
+ *   PREFIX DICTIONARIES
+ * 
+ */
+
+std::pair<Ref<CellSlice>, int> PrefixDictionary::lookup_prefix(td::ConstBitPtr key, int key_len) {
+  force_validate();
+  int n = get_key_bits();
+  if (is_empty()) {
+    return std::make_pair(Ref<CellSlice>{}, 0);
+  }
+  //std::cerr << "dictionary lookup for key = " << key.to_hex(key_len) << std::endl;
+  Ref<Cell> cell = get_root_cell();
+  int m = key_len;
+  while (true) {
+    LabelParser label{std::move(cell), n, 1};
+    int l = label.common_prefix_len(key, m);
+    if (l < label.l_bits) {
+      //std::cerr << "(not a prefix)\n";
+      return std::make_pair(Ref<CellSlice>{}, key_len - m + l);
+    }
+    n -= label.l_bits;
+    m -= label.l_bits;
+    assert(m >= 0);
+    label.skip_label();
+    Ref<CellSlice> cs = std::move(label.remainder);
+    if (!cs->have(1)) {
+      throw VmError{Excno::dict_err, "no node constructor in a prefix code dictionary"};
+    }
+    if (!cs.unique_write().fetch_ulong(1)) {
+      return std::make_pair(std::move(cs), key_len - m);
+    }
+    if (!n) {
+      throw VmError{Excno::dict_err, "a fork node in a prefix code dictionary with zero remaining key length"};
+    }
+    if (cs->size() != 0 || cs->size_refs() != 2) {
+      throw VmError{Excno::dict_err, "invalid fork node in a prefix code dictionary"};
+    }
+    if (!m) {
+      return std::make_pair(Ref<CellSlice>{}, key_len);
+    }
+    key += label.l_bits;
+    bool sw = *key++;
+    //std::cerr << "key bit at position " << key_bits - n << " equals " << sw << std::endl;
+    --n;
+    --m;
+    cell = cs->prefetch_ref(sw);
+  }
+}
+
+Ref<CellSlice> PrefixDictionary::lookup(td::ConstBitPtr key, int key_len) {
+  force_validate();
+  if (key_len > get_key_bits()) {
+    return {};
+  }
+  auto res = lookup_prefix(key, key_len);
+  return res.second == key_len ? std::move(res.first) : Ref<CellSlice>{};
+}
+
+bool PrefixDictionary::set_gen(td::ConstBitPtr key, int key_len, const std::function<bool(CellBuilder&)>& store_val,
+                               SetMode mode) {
+  force_validate();
+  if (key_len > get_key_bits() || key_len < 0) {
+    return false;
+  }
+  auto res = pfx_dict_set(get_root_cell(), key, key_len, get_key_bits(), store_val, mode);
+  if (res.second) {
+    set_root_cell(std::move(res.first));
+  }
+  return res.second;
+}
+
+bool PrefixDictionary::set(td::ConstBitPtr key, int key_len, Ref<CellSlice> value, SetMode mode) {
+  return set_gen(key, key_len, [value](CellBuilder& cb) { return cell_builder_add_slice_bool(cb, *value); }, mode);
+}
+
+bool PrefixDictionary::set_builder(td::ConstBitPtr key, int key_len, Ref<CellBuilder> val_b, SetMode mode) {
+  return set_gen(key, key_len, [val_b](CellBuilder& cb) { return cb.append_builder_bool(val_b); }, mode);
+}
+
+Ref<CellSlice> PrefixDictionary::lookup_delete(td::ConstBitPtr key, int key_len) {
+  force_validate();
+  if (key_len > get_key_bits() || key_len < 0) {
+    return {};
+  }
+  auto res = pfx_dict_lookup_delete(get_root_cell(), key, key_len, get_key_bits());
+  if (res.first.not_null()) {
+    set_root_cell(std::move(res.second));
+  }
+  return std::move(res.first);
+}
+
+/*
+ * 
+ *   AUGMENTED DICTIONARIES
+ * 
+ */
+
+namespace dict {
+
+bool AugmentationData::check_empty(vm::CellSlice& cs) const {
+  vm::CellBuilder cb;
+  return eval_empty(cb) && cb.contents_equal(cs);
+}
+
+bool AugmentationData::check_leaf(vm::CellSlice& cs, vm::CellSlice& val_cs) const {
+  vm::CellBuilder cb;
+  return eval_leaf(cb, val_cs) && cb.contents_equal(cs);
+}
+
+bool AugmentationData::check_fork(vm::CellSlice& cs, vm::CellSlice& left_cs, vm::CellSlice& right_cs) const {
+  vm::CellBuilder cb;
+  return eval_fork(cb, left_cs, right_cs) && cb.contents_equal(cs);
+}
+
+Ref<vm::CellSlice> AugmentationData::extract_extra(vm::CellSlice& cs) const {
+  Ref<CellSlice> res{true, cs};
+  return skip_extra(cs) && res.write().cut_tail(cs) ? std::move(res) : Ref<CellSlice>{};
+}
+
+Ref<vm::CellSlice> AugmentationData::extract_extra(Ref<vm::CellSlice> cs_ref) const {
+  CellSlice cs{*cs_ref};
+  return skip_extra(cs) && cs_ref.write().cut_tail(cs) ? std::move(cs_ref) : Ref<CellSlice>{};
+}
+
+bool AugmentationData::extract_extra_to(vm::CellSlice& cs, vm::CellSlice& extra) const {
+  extra = cs;
+  return cs.is_valid() && skip_extra(cs) && extra.cut_tail(cs);
+}
+
+}  // namespace dict
+
+using dict::AugmentationData;
+using dict::LabelParser;
+
+AugmentedDictionary::AugmentedDictionary(int _n, const AugmentationData& _aug, bool validate)
+    : DictionaryFixed(_n, false), aug(_aug) {
+  if (validate) {
+    force_validate();
+  }
+}
+
+AugmentedDictionary::AugmentedDictionary(Ref<CellSlice> _root, int _n, const AugmentationData& _aug, bool validate)
+    : DictionaryFixed(std::move(_root), _n, false), aug(_aug) {
+  if (validate) {
+    force_validate();
+  }
+}
+
+AugmentedDictionary::AugmentedDictionary(Ref<Cell> cell, int _n, const AugmentationData& _aug, bool validate)
+    : DictionaryFixed(std::move(cell), _n, false), aug(_aug) {
+  if (validate) {
+    force_validate();
+  }
+}
+
+AugmentedDictionary::AugmentedDictionary(DictNonEmpty, Ref<CellSlice> _root, int _n, const AugmentationData& _aug,
+                                         bool validate)
+    : DictionaryFixed(DictNonEmpty{}, std::move(_root), _n, false), aug(_aug) {
+  if (validate) {
+    force_validate();
+  }
+}
+
+bool AugmentedDictionary::validate() {
+  if (is_valid()) {
+    return true;
+  }
+  if (flags & f_invalid) {
+    return false;
+  }
+  if (key_bits < 0 || key_bits > max_key_bits) {
+    return invalidate();
+  }
+  if (flags & f_root_cached) {
+    if (root.is_null() || !root->size()) {
+      return invalidate();
+    }
+    bool non_empty = root->prefetch_ulong(1);
+    if (non_empty && !root->size_refs()) {
+      return invalidate();
+    }
+    if (root_cell.not_null()) {
+      return invalidate();
+    }
+    vm::CellSlice cs{*root};
+    if (!cs.advance(1)) {
+      return invalidate();
+    }
+    if (non_empty) {
+      root_cell = cs.fetch_ref();
+      auto root_extra = get_root_extra();
+      if (!(root_extra.not_null() && root_extra->contents_equal(cs))) {
+        return invalidate();
+      }
+    } else {
+      if (!aug.check_empty(cs)) {
+        return invalidate();
+      }
+    }
+  } else if (root.not_null()) {
+    return invalidate();
+  }
+  flags |= f_valid;
+  return true;
+}
+
+Ref<CellSlice> AugmentedDictionary::get_root() const {
+  if (!(flags & f_root_cached) && !compute_root()) {
+    return {};
+  }
+  return root;
+}
+
+Ref<CellSlice> AugmentedDictionary::extract_root() && {
+  if (!(flags & f_root_cached) && !compute_root()) {
+    return {};
+  }
+  flags = f_invalid;
+  return std::move(root);
+}
+
+bool AugmentedDictionary::append_dict_to_bool(CellBuilder& cb) const& {
+  if (!is_valid()) {
+    return false;
+  }
+  if (root_cell.is_null()) {
+    return cb.store_zeroes_bool(1) && aug.eval_empty(cb);
+  } else {
+    return cb.store_ones_bool(1) && cb.store_ref_bool(root_cell) && cb.append_cellslice_bool(get_root_extra());
+  }
+}
+
+bool AugmentedDictionary::append_dict_to_bool(CellBuilder& cb) && {
+  if (!is_valid()) {
+    return false;
+  }
+  flags = f_invalid;
+  if (root_cell.is_null()) {
+    return cb.store_zeroes_bool(1) && aug.eval_empty(cb);
+  } else {
+    return cb.store_ones_bool(1) && cb.store_ref_bool(root_cell) && cb.append_cellslice_bool(get_root_extra());
+  }
+}
+
+bool AugmentedDictionary::compute_root() const {
+  if (!is_valid()) {
+    return false;
+  }
+  if (root_cell.is_null()) {
+    root = get_empty_dictionary();
+    flags |= f_root_cached;
+    return true;
+  }
+  CellBuilder cb;
+  if (cb.store_long_bool(1, 1) && cb.store_ref_bool(root_cell) && cb.append_cellslice_bool(get_root_extra())) {
+    root = Ref<CellSlice>{true, cb.finalize()};
+    flags |= f_root_cached;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+Ref<CellSlice> AugmentedDictionary::get_empty_dictionary() const {
+  CellBuilder cb;
+  cb.store_long(0, 1);
+  return aug.eval_empty(cb) ? Ref<CellSlice>{true, cb.finalize()} : Ref<CellSlice>{};
+}
+
+Ref<CellSlice> AugmentedDictionary::get_node_extra(Ref<Cell> cell_ref, int n) const {
+  if (cell_ref.is_null()) {
+    CellBuilder cb;
+    if (!aug.eval_empty(cb)) {
+      return {};
+    }
+    return Ref<CellSlice>{true, cb.finalize()};
+  }
+  LabelParser label{std::move(cell_ref), n, 2};
+  label.skip_label();
+  if (label.l_bits == n) {
+    return aug.extract_extra(std::move(label.remainder));
+  } else if (label.remainder.write().advance_refs(2)) {
+    vm::CellSlice cs{*label.remainder};
+    if (aug.skip_extra(cs) && cs.empty_ext()) {
+      return std::move(label.remainder);
+    }
+  }
+  return {};
+}
+
+Ref<CellSlice> AugmentedDictionary::get_root_extra() const {
+  return get_node_extra(root_cell, key_bits);
+}
+
+Ref<CellSlice> AugmentedDictionary::extract_value(Ref<CellSlice> value_extra) const {
+  if (value_extra.not_null() && aug.skip_extra(value_extra.write())) {
+    return value_extra;
+  } else {
+    return {};
+  }
+}
+
+Ref<Cell> AugmentedDictionary::extract_value_ref(Ref<CellSlice> value_extra) const {
+  if (value_extra.not_null() && aug.skip_extra(value_extra.write()) && value_extra->size_ext() == 0x10000) {
+    return value_extra->prefetch_ref();
+  } else {
+    return {};
+  }
+}
+
+std::pair<Ref<CellSlice>, Ref<CellSlice>> AugmentedDictionary::decompose_value_extra(Ref<CellSlice> value_extra) const {
+  if (value_extra.is_null()) {
+    return {};
+  }
+  auto extra = aug.extract_extra(value_extra.write());
+  if (extra.is_null()) {
+    return {};
+  } else {
+    return {std::move(value_extra), std::move(extra)};
+  }
+}
+
+std::pair<Ref<Cell>, Ref<CellSlice>> AugmentedDictionary::decompose_value_ref_extra(Ref<CellSlice> value_extra) const {
+  if (value_extra.is_null()) {
+    return {};
+  }
+  auto extra = aug.extract_extra(value_extra.write());
+  if (extra.is_null() || value_extra->size_ext() != 0x10000) {
+    return {};
+  } else {
+    return {value_extra->prefetch_ref(), std::move(extra)};
+  }
+}
+
+Ref<CellSlice> AugmentedDictionary::lookup_with_extra(td::ConstBitPtr key, int key_len) {
+  return DictionaryFixed::lookup(key, key_len);
+}
+
+Ref<CellSlice> AugmentedDictionary::lookup(td::ConstBitPtr key, int key_len) {
+  return extract_value(lookup_with_extra(key, key_len));
+}
+
+Ref<Cell> AugmentedDictionary::lookup_ref(td::ConstBitPtr key, int key_len) {
+  return extract_value_ref(lookup_with_extra(key, key_len));
+}
+
+std::pair<Ref<CellSlice>, Ref<CellSlice>> AugmentedDictionary::lookup_extra(td::ConstBitPtr key, int key_len) {
+  return decompose_value_extra(lookup_with_extra(key, key_len));
+}
+
+std::pair<Ref<Cell>, Ref<CellSlice>> AugmentedDictionary::lookup_ref_extra(td::ConstBitPtr key, int key_len) {
+  return decompose_value_ref_extra(lookup_with_extra(key, key_len));
+}
+
+Ref<CellSlice> AugmentedDictionary::lookup_delete_with_extra(td::ConstBitPtr key, int key_len) {
+  return DictionaryFixed::lookup_delete(key, key_len);
+}
+
+Ref<CellSlice> AugmentedDictionary::lookup_delete(td::ConstBitPtr key, int key_len) {
+  return extract_value(lookup_delete_with_extra(key, key_len));
+}
+
+Ref<Cell> AugmentedDictionary::lookup_delete_ref(td::ConstBitPtr key, int key_len) {
+  return extract_value_ref(lookup_delete_with_extra(key, key_len));
+}
+
+std::pair<Ref<CellSlice>, Ref<CellSlice>> AugmentedDictionary::lookup_delete_extra(td::ConstBitPtr key, int key_len) {
+  return decompose_value_extra(lookup_delete_with_extra(key, key_len));
+}
+
+bool AugmentedDictionary::check_leaf(CellSlice& cs, td::ConstBitPtr key, int key_len) const {
+  vm::CellSlice extra;
+  return aug.extract_extra_to(cs, extra) && aug.check_leaf_key_extra(cs, extra, key, key_len);
+}
+
+bool AugmentedDictionary::check_fork(CellSlice& cs, Ref<Cell> c1, Ref<Cell> c2, int n) const {
+  if (n <= 0) {
+    return false;
+  }
+  auto extra1 = get_node_extra(std::move(c1), n - 1);
+  auto extra2 = get_node_extra(std::move(c2), n - 1);
+  return extra1.not_null() && extra2.not_null() && aug.check_fork(cs, extra1.write(), extra2.write());
+}
+
+Ref<Cell> AugmentedDictionary::finish_create_leaf(CellBuilder& cb, const CellSlice& value) const {
+  CellSlice value_copy{value};
+  if (!aug.eval_leaf(cb, value_copy)) {
+    throw VmError{Excno::dict_err, "cannot compute and store extra value into an augmented dictionary cell"};
+  }
+  if (!cb.append_cellslice_bool(value)) {
+    throw VmError{Excno::dict_err, "cannot store new value into an augmented dictionary cell"};
+  }
+  return cb.finalize();
+}
+
+Ref<Cell> AugmentedDictionary::finish_create_fork(CellBuilder& cb, Ref<Cell> c1, Ref<Cell> c2, int n) const {
+  assert(n > 0);
+  if (!(cb.store_ref_bool(c1) && cb.store_ref_bool(c2))) {
+    throw VmError{Excno::dict_err, "cannot store branch references into an augmented dictionary cell"};
+  }
+  auto extra1 = get_node_extra(std::move(c1), n - 1);
+  auto extra2 = get_node_extra(std::move(c2), n - 1);
+  if (extra1.is_null()) {
+    throw VmError{Excno::dict_err, "cannot extract extra value from left branch of an augmented dictionary fork node"};
+  }
+  if (extra2.is_null()) {
+    throw VmError{Excno::dict_err, "cannot extract extra value from left branch of an augmented dictionary fork node"};
+  }
+  if (!aug.eval_fork(cb, extra1.write(), extra2.write())) {
+    throw VmError{Excno::dict_err, "cannot compute extra value for an augmented dictionary fork node"};
+  }
+  return cb.finalize();
+}
+
+std::pair<Ref<Cell>, bool> AugmentedDictionary::dict_set(Ref<Cell> dict, td::ConstBitPtr key, int n,
+                                                         const CellSlice& value, Dictionary::SetMode mode) const {
+  //std::cerr << "augmented dictionary modification for " << n << "-bit key = " << key.to_hex(n) << std::endl;
+  if (dict.is_null()) {
+    // the dictionary is very empty
+    if (mode == Dictionary::SetMode::Replace) {
+      return std::make_pair<Ref<Cell>, bool>({}, false);
+    }
+    // create an one-element dictionary
+    CellBuilder cb;
+    append_dict_label(cb, key, n, n);
+    return std::make_pair(finish_create_leaf(cb, value), true);
+  }
+  LabelParser label{std::move(dict), n, 2};
+  label.validate();
+  int pfx_len = label.common_prefix_len(key, n);
+  assert(pfx_len >= 0 && pfx_len <= label.l_bits && label.l_bits <= n);
+  if (pfx_len < label.l_bits) {
+    // have to insert a new node (fork) inside the current edge
+    if (mode == Dictionary::SetMode::Replace) {
+      // key not found, return unchanged dictionary
+      return std::make_pair(Ref<Cell>{}, false);
+    }
+    // first, create the edge + new leaf cell
+    int m = n - pfx_len - 1;
+    CellBuilder cb;
+    append_dict_label(cb, key + (pfx_len + 1), m, m);
+    Ref<Cell> c1 = finish_create_leaf(cb, value);  // new leaf cell corresponding to `key`
+    //cb.reset();
+    // create the lower portion of the old edge
+    int t = label.l_bits - pfx_len - 1;
+    auto cs = std::move(label.remainder);
+    if (label.l_same) {
+      append_dict_label_same(cb, label.l_same & 1, t, m);
+    } else {
+      cs.write().advance(pfx_len + 1);
+      append_dict_label(cb, cs->data_bits(), t, m);
+      cs.unique_write().advance(t);
+    }
+    // now cs is the old payload of the edge, either a value or two subdictionary references
+    if (!cell_builder_add_slice_bool(cb, *cs)) {
+      throw VmError{Excno::cell_ov, "cannot change label of an old augmented dictionary cell (?)"};
+    }
+    Ref<Cell> c2 = cb.finalize();  // the other child of the new fork
+    // cb.reset();
+    append_dict_label(cb, key, pfx_len, n);
+    bool sw_bit = key[pfx_len];
+    if (sw_bit) {
+      c1.swap(c2);
+    }
+    return std::make_pair(finish_create_fork(cb, std::move(c1), std::move(c2), n - pfx_len), true);
+  }
+  if (label.l_bits == n) {
+    // the edge leads to a leaf node
+    // this leaf node already contains a value for the key wanted
+    if (mode == Dictionary::SetMode::Add) {
+      // return unchanged dictionary
+      return std::make_pair(Ref<Cell>{}, false);
+    }
+    // replace the value of the only element of the dictionary
+    CellBuilder cb;
+    append_dict_label(cb, key, n, n);
+    return std::make_pair(finish_create_leaf(cb, value), true);
+  }
+  // main case: the edge leads to a fork, have to insert new value either in the right or in the left subtree
+  auto c1 = label.remainder->prefetch_ref(0);
+  auto c2 = label.remainder->prefetch_ref(1);
+  label.remainder.clear();
+  if (key[label.l_bits]) {
+    // insert key into the right child (c2)
+    auto res = dict_set(std::move(c2), key + (label.l_bits + 1), n - label.l_bits - 1, value, mode);
+    if (!res.second) {
+      // return unchanged dictionary
+      return std::make_pair(Ref<Cell>{}, false);
+    }
+    c2 = std::move(res.first);
+  } else {
+    // insert key into the left child (c1)
+    auto res = dict_set(std::move(c1), key + (label.l_bits + 1), n - label.l_bits - 1, value, mode);
+    if (!res.second) {
+      // return unchanged dictionary
+      return std::make_pair(Ref<Cell>{}, false);
+    }
+    c1 = std::move(res.first);
+  }
+  // create a new label with the same content
+  CellBuilder cb;
+  append_dict_label(cb, key, label.l_bits, n);
+  return std::make_pair(finish_create_fork(cb, std::move(c1), std::move(c2), n - label.l_bits), true);
+}
+
+bool AugmentedDictionary::set(td::ConstBitPtr key, int key_len, Ref<CellSlice> value, SetMode mode) {
+  return value.not_null() && set(key, key_len, *value, mode);
+}
+
+bool AugmentedDictionary::set(td::ConstBitPtr key, int key_len, const CellSlice& value, SetMode mode) {
+  force_validate();
+  if (key_len != get_key_bits()) {
+    return false;
+  }
+  auto res = dict_set(get_root_cell(), key, key_len, value, mode);
+  if (res.second) {
+    //vm::CellSlice cs{vm::NoVm{}, res.first};
+    //std::cerr << "new augmented dictionary root is:\n";
+    //cs.print_rec(std::cerr);
+    set_root_cell(std::move(res.first));
+  }
+  return res.second;
+}
+
+bool AugmentedDictionary::set_ref(td::ConstBitPtr key, int key_len, Ref<Cell> value_ref, SetMode mode) {
+  if (value_ref.not_null()) {
+    CellBuilder cb;
+    cb.store_ref(std::move(value_ref));
+    return set(key, key_len, load_cell_slice(cb.finalize()));
+  } else {
+    return false;
+  }
+}
+
+bool AugmentedDictionary::set_builder(td::ConstBitPtr key, int key_len, const CellBuilder& value, SetMode mode) {
+  return set(key, key_len, load_cell_slice(value.finalize_copy()));
+}
+
+bool AugmentedDictionary::check_for_each_extra(const foreach_extra_func_t& foreach_extra_func, bool invert_first) {
+  force_validate();
+  const auto& augm = aug;
+  foreach_func_t foreach_func = [&foreach_extra_func, &augm](Ref<vm::CellSlice> value_extra, td::ConstBitPtr key,
+                                                             int key_len) {
+    auto extra = augm.extract_extra(value_extra.write());
+    return extra.not_null() && foreach_extra_func(std::move(value_extra), std::move(extra), key, key_len);
+  };
+  return DictionaryFixed::check_for_each(foreach_func, invert_first);
+}
+
+std::pair<Ref<CellSlice>, Ref<CellSlice>> AugmentedDictionary::dict_traverse_extra(
+    Ref<Cell> dict, td::BitPtr key_buffer, int n, const traverse_func_t& traverse_node) const {
+  int m = get_key_bits();
+  while (true) {
+    CHECK(dict.not_null());
+    LabelParser label{std::move(dict), n, 2};
+    label.extract_label_to(key_buffer);
+    key_buffer += label.l_bits;
+    n -= label.l_bits;
+    if (n <= 0) {
+      // reached a leaf, check it
+      assert(!n);
+      auto pair = decompose_value_extra(std::move(label.remainder));
+      if (pair.first.is_null()) {
+        throw VmError{Excno::dict_err, "invalid leaf value/extra in an augmented dictionary"};
+      }
+      int r = traverse_node(key_buffer - m, m, pair.second /* extra */, pair.first /* value */);
+      if (r < 0) {
+        throw CombineErrorValue{r};
+      } else if (r > 0) {
+        return pair;
+      } else {
+        return {};
+      }
+    }
+    // visit (traverse) fork
+    auto c1 = label.remainder.write().fetch_ref(), c2 = label.remainder.write().fetch_ref();
+    int r = traverse_node(key_buffer + n - m, m - n, std::move(label.remainder) /* extra */, {});
+    if (r < 0 || (r & 3) == 3) {
+      throw CombineErrorValue{r};
+    } else if (!(r & 3)) {
+      return {};
+    }
+    // r = 1 : visit only left, 2 = visit only right, 5 = visit right, then left, 6 = visit left, then right
+    ++key_buffer;
+    --n;
+    bool sw = r & 1;
+    if (sw) {
+      std::swap(c1, c2);
+    }
+    if (r & 4) {
+      // have to visit both children in some order; do a recursive call to visit the first child
+      key_buffer[-1] = sw;
+      auto tmp = dict_traverse_extra(std::move(c1), key_buffer, n, traverse_node);
+      if (tmp.first.not_null()) {
+        return tmp;
+      }
+    }
+    // visit the remaining child
+    key_buffer[-1] = !sw;
+    dict = std::move(c2);
+  }
+}
+
+std::pair<Ref<CellSlice>, Ref<CellSlice>> AugmentedDictionary::traverse_extra(td::BitPtr key_buffer, int key_len,
+                                                                              const traverse_func_t& traverse_node) {
+  force_validate();
+  if (key_len != get_key_bits() || is_empty()) {
+    return {};
+  }
+  return dict_traverse_extra(get_root_cell(), key_buffer, key_len, traverse_node);
+}
+
+bool AugmentedDictionary::validate_check_extra(const AugmentedDictionary::foreach_extra_func_t& foreach_extra_func,
+                                               bool invert_first) {
+  const AugmentationData& augm = aug;
+  int key_len = get_key_bits();
+  return validate_check(
+      [&foreach_extra_func, &augm, key_len](Ref<CellSlice> value_extra, td::ConstBitPtr key, int value) {
+        auto extra = augm.extract_extra(value_extra.write());
+        return extra.not_null() && foreach_extra_func(std::move(value_extra), std::move(extra), key, key_len);
+      },
+      invert_first);
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/dict.h b/submodules/ton/tonlib-src/crypto/vm/dict.h
new file mode 100644
index 0000000000..11234277dd
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/dict.h
@@ -0,0 +1,474 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "common/bitstring.h"
+#include "vm/cells.h"
+#include "vm/cellslice.h"
+#include "vm/stack.hpp"
+#include <functional>
+
+namespace vm {
+using td::BitSlice;
+using td::Ref;
+
+namespace dict {
+
+struct LabelParser {
+  enum { chk_none = 0, chk_min = 1, chk_size = 2, chk_all = 3 };
+  Ref<CellSlice> remainder;
+  int l_offs;
+  int l_same;
+  int l_bits;
+  unsigned s_bits;
+  LabelParser(Ref<CellSlice> cs, int max_label_len, int auto_validate = chk_all);
+  LabelParser(Ref<Cell> cell, int max_label_len, int auto_validate = chk_all);
+  int is_valid() const {
+    return l_offs;
+  }
+  void validate() const;
+  void validate_simple(int n) const;
+  void validate_ext(int n) const;
+  bool is_prefix_of(td::ConstBitPtr key, int len) const;
+  bool has_prefix(td::ConstBitPtr key, int len) const;
+  int common_prefix_len(td::ConstBitPtr key, int len) const;
+  int extract_label_to(td::BitPtr to);
+  int copy_label_prefix_to(td::BitPtr to, int max_len) const;
+  td::ConstBitPtr bits() const {
+    return remainder->data_bits();
+  }
+  td::ConstBitPtr bits_end() const {
+    return bits() + l_bits;
+  }
+  void skip_label() {
+    remainder.write().advance(s_bits);
+  }
+  void clear() {
+    remainder.clear();
+  }
+
+ private:
+  bool parse_label(CellSlice& cs, int max_label_len);
+};
+
+struct AugmentationData {
+  virtual ~AugmentationData() = default;
+  virtual bool skip_extra(vm::CellSlice& cs) const = 0;
+  virtual bool eval_leaf(vm::CellBuilder& cb, vm::CellSlice& val_cs) const = 0;
+  virtual bool eval_fork(vm::CellBuilder& cb, vm::CellSlice& left_cs, vm::CellSlice& right_cs) const = 0;
+  virtual bool eval_empty(vm::CellBuilder& cb) const = 0;
+  virtual bool check_leaf(vm::CellSlice& cs, vm::CellSlice& val_cs) const;
+  virtual bool check_fork(vm::CellSlice& cs, vm::CellSlice& left_cs, vm::CellSlice& right_cs) const;
+  virtual bool check_empty(vm::CellSlice& cs) const;
+  virtual bool check_leaf_key_extra(vm::CellSlice& val_cs, vm::CellSlice& extra_cs, td::ConstBitPtr key,
+                                    int key_len) const {
+    return check_leaf(extra_cs, val_cs);
+  }
+  Ref<vm::CellSlice> extract_extra(vm::CellSlice& cs) const;
+  Ref<vm::CellSlice> extract_extra(Ref<vm::CellSlice> cs_ref) const;
+  bool extract_extra_to(vm::CellSlice& cs, Ref<vm::CellSlice>& extra_csr) const {
+    return (extra_csr = extract_extra(cs)).not_null();
+  }
+  bool extract_extra_to(Ref<vm::CellSlice> cs_ref, Ref<vm::CellSlice>& extra_csr) const {
+    return (extra_csr = extract_extra(std::move(cs_ref))).not_null();
+  }
+  bool extract_extra_to(vm::CellSlice& cs, vm::CellSlice& extra) const;
+};
+
+static inline bool store_cell_dict(vm::CellBuilder& cb, Ref<vm::Cell> dict_root) {
+  return dict_root.not_null() ? cb.store_long_bool(1, 1) && cb.store_ref_bool(std::move(dict_root))
+                              : cb.store_long_bool(0, 1);
+}
+
+}  // namespace dict
+
+struct CombineError {};  // thrown by Dictionary::combine_with
+struct CombineErrorValue {
+  int arg_;
+};
+
+struct DictNonEmpty {};
+struct DictAdvance {};
+
+class DictionaryBase {
+ protected:
+  mutable Ref<CellSlice> root;
+  Ref<Cell> root_cell;
+  int key_bits;
+  mutable int flags;
+  enum { f_valid = 1, f_root_cached = 2, f_invalid = 0x80 };
+
+ public:
+  enum class SetMode : int { Set = 3, Replace = 1, Add = 2 };
+  enum { max_key_bits = 1023, max_key_bytes = (max_key_bits + 7) / 8 };
+
+  typedef std::function<bool(CellBuilder&)> store_value_func_t;
+
+  DictionaryBase(int _n, bool validate = true);
+  DictionaryBase(Ref<CellSlice> _root, int _n, bool validate = true);
+  DictionaryBase(const CellSlice& root_cs, int _n, bool validate = true);
+  DictionaryBase(DictAdvance, CellSlice& root_cs, int _n, bool validate = true);
+  DictionaryBase(Ref<Cell> cell, int _n, bool validate = true);
+  DictionaryBase(DictNonEmpty, Ref<CellSlice> _root, int _n, bool validate = true);
+  DictionaryBase(DictNonEmpty, const CellSlice& root_cs, int _n, bool validate = true);
+  virtual ~DictionaryBase() = default;
+
+  static Ref<Cell> construct_root_from(const CellSlice& root_node_cs);
+  Ref<CellSlice> get_root() const;
+  Ref<CellSlice> extract_root() &&;
+  Ref<Cell> get_root_cell() const {
+    return root_cell;
+  }
+  Ref<Cell> extract_root_cell() && {
+    return std::move(root_cell);
+  }
+  bool append_dict_to_bool(CellBuilder& cb) &&;
+  bool append_dict_to_bool(CellBuilder& cb) const &;
+  int get_key_bits() const {
+    return key_bits;
+  }
+  bool is_valid() const {
+    return flags & f_valid;
+  }
+  void reset() {
+    root.clear();
+    root_cell.clear();
+    flags = f_valid;
+  }
+  virtual bool validate();
+  void force_validate();
+  bool is_empty() const {
+    return root_cell.is_null();
+  }
+  static Ref<CellSlice> get_empty_dictionary();
+
+ protected:
+  bool init_root_for_nonempty(const CellSlice& cs);
+  bool invalidate() {
+    flags |= f_invalid;
+    return false;
+  }
+  bool compute_root() const;
+  static Ref<CellSlice> new_empty_dictionary();
+  void set_root_cell(Ref<Cell> cell) {
+    root_cell = std::move(cell);
+    flags &= ~f_root_cached;
+  }
+};
+
+class DictionaryFixed : public DictionaryBase {
+ public:
+  typedef std::function<int(vm::CellSlice&, td::ConstBitPtr, int)> filter_func_t;
+  typedef std::function<bool(CellBuilder&, Ref<CellSlice>, Ref<CellSlice>)> simple_combine_func_t;
+  typedef std::function<bool(CellBuilder&, Ref<CellSlice>, Ref<CellSlice>, td::ConstBitPtr, int)> combine_func_t;
+  typedef std::function<bool(Ref<CellSlice>, td::ConstBitPtr, int)> foreach_func_t;
+  typedef std::function<bool(td::ConstBitPtr, int, Ref<CellSlice>, Ref<CellSlice>)> scan_diff_func_t;
+
+  DictionaryFixed(int _n, bool validate = true) : DictionaryBase(_n, validate) {
+  }
+  DictionaryFixed(Ref<CellSlice> _root, int _n, bool validate = true) : DictionaryBase(std::move(_root), _n, validate) {
+  }
+  DictionaryFixed(const CellSlice& root_cs, int _n, bool validate = true) : DictionaryBase(root_cs, _n, validate) {
+  }
+  DictionaryFixed(DictAdvance, CellSlice& root_cs, int _n, bool validate = true)
+      : DictionaryBase(DictAdvance(), root_cs, _n, validate) {
+  }
+  DictionaryFixed(Ref<Cell> cell, int _n, bool validate = true) : DictionaryBase(std::move(cell), _n, validate) {
+  }
+  DictionaryFixed(DictNonEmpty, Ref<CellSlice> _root, int _n, bool validate = true)
+      : DictionaryBase(DictNonEmpty(), std::move(_root), _n, validate) {
+  }
+  DictionaryFixed(DictNonEmpty, const CellSlice& root_cs, int _n, bool validate = true)
+      : DictionaryBase(DictNonEmpty(), root_cs, _n, validate) {
+  }
+  static BitSlice integer_key(td::RefInt256 x, unsigned n, bool sgnd = true, unsigned char buffer[128] = 0,
+                              bool quiet = false);
+  static bool integer_key_simple(td::RefInt256 x, unsigned n, bool sgnd, td::BitPtr buffer, bool quiet = false);
+  bool key_exists(td::ConstBitPtr key, int key_len);
+  bool int_key_exists(long long key);
+  bool uint_key_exists(unsigned long long key);
+  Ref<CellSlice> lookup(td::ConstBitPtr key, int key_len);
+  Ref<CellSlice> lookup_delete(td::ConstBitPtr key, int key_len);
+  Ref<CellSlice> get_minmax_key(td::BitPtr key_buffer, int key_len, bool fetch_max = false, bool invert_first = false);
+  Ref<CellSlice> extract_minmax_key(td::BitPtr key_buffer, int key_len, bool fetch_max = false,
+                                    bool invert_first = false);
+  Ref<CellSlice> lookup_nearest_key(td::BitPtr key_buffer, int key_len, bool fetch_next = false, bool allow_eq = false,
+                                    bool invert_first = false);
+  bool has_common_prefix(td::ConstBitPtr prefix, int prefix_len);
+  int get_common_prefix(td::BitPtr buffer, unsigned buffer_len);
+  bool cut_prefix_subdict(td::ConstBitPtr prefix, int prefix_len, bool remove_prefix = false);
+  Ref<vm::Cell> extract_prefix_subdict_root(td::ConstBitPtr prefix, int prefix_len, bool remove_prefix = false);
+  bool check_for_each(const foreach_func_t& foreach_func, bool invert_first = false);
+  int filter(filter_func_t check);
+  bool combine_with(DictionaryFixed& dict2, const combine_func_t& combine_func, int mode = 0);
+  bool combine_with(DictionaryFixed& dict2, const simple_combine_func_t& simple_combine_func, int mode = 0);
+  bool combine_with(DictionaryFixed& dict2);
+  bool scan_diff(DictionaryFixed& dict2, const scan_diff_func_t& diff_func, int check_augm = 0);
+  bool validate_check(const foreach_func_t& foreach_func, bool invert_first = false);
+  bool validate_all();
+  template <typename T>
+  bool key_exists(const T& key) {
+    return key_exists(key.bits(), key.size());
+  }
+  template <typename T>
+  Ref<CellSlice> lookup(const T& key) {
+    return lookup(key.bits(), key.size());
+  }
+  template <typename T>
+  Ref<CellSlice> lookup_delete(const T& key) {
+    return lookup_delete(key.bits(), key.size());
+  }
+  template <typename T>
+  Ref<CellSlice> get_minmax_key(T& key_buffer, bool fetch_max = false, bool invert_first = false) {
+    return get_minmax_key(key_buffer.bits(), key_buffer.size(), fetch_max, invert_first);
+  }
+
+ protected:
+  virtual int label_mode() const {
+    return dict::LabelParser::chk_all;
+  }
+  virtual Ref<Cell> finish_create_leaf(CellBuilder& cb, const CellSlice& value) const;
+  virtual Ref<Cell> finish_create_fork(CellBuilder& cb, Ref<Cell> c1, Ref<Cell> c2, int n) const;
+  virtual bool check_fork(CellSlice& cs, Ref<Cell> c1, Ref<Cell> c2, int n) const {
+    return true;
+  }
+  virtual bool check_leaf(CellSlice& cs, td::ConstBitPtr key, int key_len) const {
+    return true;
+  }
+  bool check_leaf(Ref<CellSlice> cs_ref, td::ConstBitPtr key, int key_len) const {
+    return check_leaf(cs_ref.write(), key, key_len);
+  }
+  bool check_fork_raw(Ref<CellSlice> cs_ref, int n) const;
+
+ private:
+  std::pair<Ref<CellSlice>, Ref<Cell>> dict_lookup_delete(Ref<Cell> dict, td::ConstBitPtr key, int n) const;
+  Ref<CellSlice> dict_lookup_minmax(Ref<Cell> dict, td::BitPtr key_buffer, int n, int mode) const;
+  Ref<CellSlice> dict_lookup_nearest(Ref<Cell> dict, td::BitPtr key_buffer, int n, bool allow_eq, int mode) const;
+  std::pair<Ref<Cell>, bool> extract_prefix_subdict_internal(Ref<Cell> dict, td::ConstBitPtr prefix, int prefix_len,
+                                                             bool remove_prefix = false) const;
+  bool dict_check_for_each(Ref<Cell> dict, td::BitPtr key_buffer, int n, int total_key_len,
+                           const foreach_func_t& foreach_func, bool invert_first = false) const;
+  std::pair<Ref<Cell>, int> dict_filter(Ref<Cell> dict, td::BitPtr key, int n, const filter_func_t& check_leaf) const;
+  Ref<Cell> dict_combine_with(Ref<Cell> dict1, Ref<Cell> dict2, td::BitPtr key_buffer, int n, int total_key_len,
+                              const combine_func_t& combine_func, int mode = 0, int skip1 = 0, int skip2 = 0) const;
+  bool dict_scan_diff(Ref<Cell> dict1, Ref<Cell> dict2, td::BitPtr key_buffer, int n, int total_key_len,
+                      const scan_diff_func_t& diff_func, int mode = 0, int skip1 = 0, int skip2 = 0) const;
+  bool dict_validate_check(Ref<Cell> dict, td::BitPtr key_buffer, int n, int total_key_len,
+                           const foreach_func_t& foreach_func, bool invert_first = false) const;
+};
+
+class Dictionary final : public DictionaryFixed {
+ public:
+  typedef std::function<bool(CellBuilder&, Ref<CellSlice>)> simple_map_func_t;
+  typedef std::function<bool(CellBuilder&, Ref<CellSlice>, td::ConstBitPtr, int)> map_func_t;
+  Dictionary(int _n, bool validate = true) : DictionaryFixed(_n, validate) {
+  }
+  Dictionary(Ref<CellSlice> _root, int _n, bool validate = true) : DictionaryFixed(std::move(_root), _n, validate) {
+  }
+  Dictionary(const CellSlice& root_cs, int _n, bool validate = true) : DictionaryFixed(root_cs, _n, validate) {
+  }
+  Dictionary(DictAdvance, CellSlice& root_cs, int _n, bool validate = true)
+      : DictionaryFixed(DictAdvance(), root_cs, _n, validate) {
+  }
+  Dictionary(Ref<Cell> cell, int _n, bool validate = true) : DictionaryFixed(std::move(cell), _n, validate) {
+  }
+  Dictionary(DictNonEmpty, Ref<CellSlice> _root, int _n, bool validate = true)
+      : DictionaryFixed(DictNonEmpty(), std::move(_root), _n, validate) {
+  }
+  Dictionary(DictNonEmpty, const CellSlice& root_cs, int _n, bool validate = true)
+      : DictionaryFixed(DictNonEmpty(), root_cs, _n, validate) {
+  }
+  Ref<Cell> lookup_ref(td::ConstBitPtr key, int key_len);
+  Ref<Cell> lookup_delete_ref(td::ConstBitPtr key, int key_len);
+  bool set(td::ConstBitPtr key, int key_len, Ref<CellSlice> value, SetMode mode = SetMode::Set);
+  bool set_ref(td::ConstBitPtr key, int key_len, Ref<Cell> val_ref, SetMode mode = SetMode::Set);
+  bool set_builder(td::ConstBitPtr key, int key_len, Ref<CellBuilder> val_b, SetMode mode = SetMode::Set);
+  bool set_builder(td::ConstBitPtr key, int key_len, const CellBuilder& val_b, SetMode mode = SetMode::Set);
+  bool set_gen(td::ConstBitPtr key, int key_len, const store_value_func_t& store_val, SetMode mode = SetMode::Set);
+  Ref<CellSlice> lookup_set(td::ConstBitPtr key, int key_len, Ref<CellSlice> value, SetMode mode = SetMode::Set);
+  Ref<Cell> lookup_set_ref(td::ConstBitPtr key, int key_len, Ref<Cell> val_ref, SetMode mode = SetMode::Set);
+  Ref<CellSlice> lookup_set_builder(td::ConstBitPtr key, int key_len, Ref<CellBuilder> val_b,
+                                    SetMode mode = SetMode::Set);
+  Ref<CellSlice> lookup_set_gen(td::ConstBitPtr key, int key_len, const store_value_func_t& store_val,
+                                SetMode mode = SetMode::Set);
+  Ref<Cell> get_minmax_key_ref(td::BitPtr key_buffer, int key_len, bool fetch_max = false, bool invert_first = false);
+  Ref<Cell> extract_minmax_key_ref(td::BitPtr key_buffer, int key_len, bool fetch_max = false,
+                                   bool invert_first = false);
+  void map(const map_func_t& map_func);
+  void map(const simple_map_func_t& simple_map_func);
+  template <typename T>
+  Ref<Cell> lookup_ref(const T& key) {
+    return lookup_ref(key.bits(), key.size());
+  }
+  template <typename T>
+  Ref<Cell> lookup_delete_ref(const T& key) {
+    return lookup_delete_ref(key.bits(), key.size());
+  }
+  template <typename T>
+  bool set(const T& key, Ref<CellSlice> value, SetMode mode = SetMode::Set) {
+    return set(key.bits(), key.size(), std::move(value), mode);
+  }
+  template <typename T>
+  bool set_ref(const T& key, Ref<Cell> val_ref, SetMode mode = SetMode::Set) {
+    return set_ref(key.bits(), key.size(), std::move(val_ref), mode);
+  }
+  template <typename T>
+  bool set_builder(const T& key, const CellBuilder& val_b, SetMode mode = SetMode::Set) {
+    return set_builder(key.bits(), key.size(), val_b, mode);
+  }
+  template <typename T>
+  bool set_builder(const T& key, Ref<vm::CellBuilder> val_ref, SetMode mode = SetMode::Set) {
+    return set_builder(key.bits(), key.size(), std::move(val_ref), mode);
+  }
+  template <typename T>
+  Ref<CellSlice> lookup_set(const T& key, Ref<CellSlice> value, SetMode mode = SetMode::Set) {
+    return lookup_set(key.bits(), key.size(), std::move(value), mode);
+  }
+  template <typename T>
+  Ref<Cell> lookup_set_ref(const T& key, Ref<Cell> val_ref, SetMode mode = SetMode::Set) {
+    return lookup_set_ref(key.bits(), key.size(), std::move(val_ref), mode);
+  }
+  template <typename T>
+  Ref<CellSlice> lookup_set_builder(const T& key, const CellBuilder& val_b, SetMode mode = SetMode::Set) {
+    return lookup_set_builder(key.bits(), key.size(), val_b, mode);
+  }
+  template <typename T>
+  Ref<CellSlice> lookup_set_builder(const T& key, Ref<vm::CellBuilder> val_ref, SetMode mode = SetMode::Set) {
+    return lookup_set_builder(key.bits(), key.size(), std::move(val_ref), mode);
+  }
+
+ private:
+  bool check_fork(CellSlice& cs, Ref<Cell> c1, Ref<Cell> c2, int n) const override {
+    return cs.empty_ext();
+  }
+  static Ref<Cell> extract_value_ref(Ref<CellSlice> cs);
+  std::pair<Ref<Cell>, int> dict_filter(Ref<Cell> dict, td::BitPtr key, int n, const filter_func_t& check_leaf) const;
+};
+
+class PrefixDictionary final : public DictionaryBase {
+ public:
+  PrefixDictionary(int _n, bool validate = true) : DictionaryBase(_n, validate) {
+  }
+  PrefixDictionary(Ref<CellSlice> _root, int _n, bool validate = true)
+      : DictionaryBase(std::move(_root), _n, validate) {
+  }
+  PrefixDictionary(Ref<Cell> cell, int _n, bool validate = true) : DictionaryBase(std::move(cell), _n, validate) {
+  }
+  Ref<CellSlice> lookup(td::ConstBitPtr key, int key_len);
+  std::pair<Ref<CellSlice>, int> lookup_prefix(td::ConstBitPtr key, int key_len);
+  Ref<CellSlice> lookup_delete(td::ConstBitPtr key, int key_len);
+  bool set(td::ConstBitPtr key, int key_len, Ref<CellSlice> value, SetMode mode = SetMode::Set);
+  bool set_builder(td::ConstBitPtr key, int key_len, Ref<CellBuilder> val_b, SetMode mode = SetMode::Set);
+  bool set_gen(td::ConstBitPtr key, int key_len, const store_value_func_t& store_val, SetMode mode = SetMode::Set);
+};
+
+using dict::AugmentationData;
+
+class AugmentedDictionary final : public DictionaryFixed {
+  const AugmentationData& aug;
+
+ public:
+  typedef std::function<bool(Ref<CellSlice>, Ref<CellSlice>, td::ConstBitPtr, int)> foreach_extra_func_t;
+  // return value of traverse_func: < 0 = error, 0 = skip, 1 = visit only left, 2 = visit only right, 5 = visit right, then left, 6 = visit left, then right
+  // for leaf nodes, all >0 values mean accept and return node as the final result, 0 = skip (continue scanning)
+  typedef std::function<int(td::ConstBitPtr key_prefix, int key_pfx_len, Ref<CellSlice> extra, Ref<CellSlice> value)>
+      traverse_func_t;
+  AugmentedDictionary(int _n, const AugmentationData& _aug, bool validate = true);
+  AugmentedDictionary(Ref<CellSlice> _root, int _n, const AugmentationData& _aug, bool validate = true);
+  AugmentedDictionary(Ref<Cell> cell, int _n, const AugmentationData& _aug, bool validate = true);
+  AugmentedDictionary(DictNonEmpty, Ref<CellSlice> _root, int _n, const AugmentationData& _aug, bool validate = true);
+  Ref<CellSlice> get_empty_dictionary() const;
+  Ref<CellSlice> get_root() const;
+  Ref<CellSlice> extract_root() &&;
+  bool append_dict_to_bool(CellBuilder& cb) &&;
+  bool append_dict_to_bool(CellBuilder& cb) const &;
+  Ref<CellSlice> get_root_extra() const;
+  Ref<CellSlice> lookup(td::ConstBitPtr key, int key_len);
+  Ref<Cell> lookup_ref(td::ConstBitPtr key, int key_len);
+  Ref<CellSlice> lookup_with_extra(td::ConstBitPtr key, int key_len);
+  std::pair<Ref<CellSlice>, Ref<CellSlice>> lookup_extra(td::ConstBitPtr key, int key_len);
+  std::pair<Ref<Cell>, Ref<CellSlice>> lookup_ref_extra(td::ConstBitPtr key, int key_len);
+  Ref<CellSlice> lookup_delete(td::ConstBitPtr key, int key_len);
+  Ref<Cell> lookup_delete_ref(td::ConstBitPtr key, int key_len);
+  Ref<CellSlice> lookup_delete_with_extra(td::ConstBitPtr key, int key_len);
+  std::pair<Ref<CellSlice>, Ref<CellSlice>> lookup_delete_extra(td::ConstBitPtr key, int key_len);
+  std::pair<Ref<Cell>, Ref<CellSlice>> lookup_delete_ref_extra(td::ConstBitPtr key, int key_len);
+  bool set(td::ConstBitPtr key, int key_len, const CellSlice& value, SetMode mode = SetMode::Set);
+  bool set(td::ConstBitPtr key, int key_len, Ref<CellSlice> value, SetMode mode = SetMode::Set);
+  bool set_ref(td::ConstBitPtr key, int key_len, Ref<Cell> val_ref, SetMode mode = SetMode::Set);
+  bool set_builder(td::ConstBitPtr key, int key_len, const CellBuilder& value, SetMode mode = SetMode::Set);
+  bool check_for_each_extra(const foreach_extra_func_t& foreach_extra_func, bool invert_first = false);
+  std::pair<Ref<CellSlice>, Ref<CellSlice>> traverse_extra(td::BitPtr key_buffer, int key_len,
+                                                           const traverse_func_t& traverse_node);
+  bool validate_check_extra(const foreach_extra_func_t& foreach_extra_func, bool invert_first = false);
+  bool validate() override;
+  template <typename T>
+  Ref<CellSlice> lookup(const T& key) {
+    return lookup(key.bits(), key.size());
+  }
+  template <typename T>
+  Ref<Cell> lookup_ref(const T& key) {
+    return lookup_ref(key.bits(), key.size());
+  }
+  template <typename T>
+  bool set(const T& key, Ref<CellSlice> val_ref, SetMode mode = SetMode::Set) {
+    return set(key.bits(), key.size(), std::move(val_ref), mode);
+  }
+  template <typename T>
+  bool set(const T& key, const CellSlice& value, SetMode mode = SetMode::Set) {
+    return set(key.bits(), key.size(), value, mode);
+  }
+  template <typename T>
+  bool set_ref(const T& key, Ref<Cell> val_ref, SetMode mode = SetMode::Set) {
+    return set_ref(key.bits(), key.size(), std::move(val_ref), mode);
+  }
+  template <typename T>
+  bool set_builder(const T& key, const CellBuilder& val_b, SetMode mode = SetMode::Set) {
+    return set_builder(key.bits(), key.size(), val_b, mode);
+  }
+  template <typename T>
+  Ref<CellSlice> lookup_delete(const T& key) {
+    return lookup_delete(key.bits(), key.size());
+  }
+  template <typename T>
+  Ref<Cell> lookup_delete_ref(const T& key) {
+    return lookup_delete_ref(key.bits(), key.size());
+  }
+
+  Ref<CellSlice> extract_value(Ref<CellSlice> value_extra) const;
+  Ref<Cell> extract_value_ref(Ref<CellSlice> value_extra) const;
+  std::pair<Ref<CellSlice>, Ref<CellSlice>> decompose_value_extra(Ref<CellSlice> value_extra) const;
+  std::pair<Ref<Cell>, Ref<CellSlice>> decompose_value_ref_extra(Ref<CellSlice> value_extra) const;
+
+ private:
+  bool compute_root() const;
+  Ref<CellSlice> get_node_extra(Ref<Cell> cell_ref, int n) const;
+  bool check_leaf(CellSlice& cs, td::ConstBitPtr key, int key_len) const override;
+  bool check_fork(CellSlice& cs, Ref<Cell> c1, Ref<Cell> c2, int n) const override;
+  Ref<Cell> finish_create_leaf(CellBuilder& cb, const CellSlice& value) const override;
+  Ref<Cell> finish_create_fork(CellBuilder& cb, Ref<Cell> c1, Ref<Cell> c2, int n) const override;
+  std::pair<Ref<Cell>, bool> dict_set(Ref<Cell> dict, td::ConstBitPtr key, int n, const CellSlice& value,
+                                      SetMode mode = SetMode::Set) const;
+  int label_mode() const override {
+    return dict::LabelParser::chk_size;
+  }
+  std::pair<Ref<CellSlice>, Ref<CellSlice>> dict_traverse_extra(Ref<Cell> dict, td::BitPtr key_buffer, int n,
+                                                                const traverse_func_t& traverse_node) const;
+};
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/dictops.cpp b/submodules/ton/tonlib-src/crypto/vm/dictops.cpp
new file mode 100644
index 0000000000..9f4faed9c6
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/dictops.cpp
@@ -0,0 +1,811 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <functional>
+#include "vm/log.h"
+#include "vm/opctable.h"
+#include "vm/stack.hpp"
+#include "vm/continuation.h"
+#include "vm/excno.hpp"
+#include "common/bigint.hpp"
+#include "common/refint.h"
+#include "vm/dictops.h"
+#include "vm/dict.h"
+
+namespace vm {
+
+template <typename T>
+void push_dict(Stack& stack, T&& dict) {
+  stack.push_maybe_cell(std::move(dict).extract_root_cell());
+}
+
+template <typename T>
+void push_dict(Stack& stack, const T& dict) {
+  stack.push_maybe_cell(dict.get_root_cell());
+}
+
+int exec_dict_empty(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DICTEMPTY";
+  auto dict = stack.pop_cellslice();
+  if (!dict->have(1)) {
+    throw VmError{Excno::cell_und};
+  }
+  stack.push_smallint(~dict->prefetch_long(1));
+  return 0;
+}
+
+int exec_store_dict(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute STDICT";
+  stack.check_underflow(2);
+  auto cb = stack.pop_builder();
+  auto d = stack.pop_maybe_cell();
+  if (!cb.write().store_maybe_ref(std::move(d))) {
+    throw VmError{Excno::cell_ov};
+  }
+  stack.push_builder(std::move(cb));
+  return 0;
+}
+
+int dict_nonempty(const CellSlice& dict) {
+  if (!dict.have(1)) {
+    return -1;
+  }
+  int res = (int)dict.prefetch_ulong(1);
+  return dict.have_refs(res) ? res : -1;
+}
+
+int dict_nonempty_chk(const CellSlice& dict) {
+  int res = dict_nonempty(dict);
+  if (res < 0) {
+    throw VmError{Excno::cell_und};
+  }
+  return res;
+}
+
+int exec_skip_dict(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SKIPDICT\n";
+  auto dict = stack.pop_cellslice();
+  int res = dict_nonempty_chk(*dict);
+  dict.write().advance_ext(1, res);
+  stack.push_cellslice(std::move(dict));
+  return 0;
+}
+
+int exec_load_optref(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute LDOPTREF\n";
+  auto dict = stack.pop_cellslice();
+  int res = dict_nonempty_chk(*dict);
+  dict.write().advance(1);
+  if (res) {
+    auto cell = dict.write().fetch_ref();
+    stack.push_cellslice(std::move(dict));
+    stack.push_cell(std::move(cell));
+  } else {
+    stack.push_cellslice(std::move(dict));
+  }
+  stack.push_smallint(-res);
+  return 0;
+}
+
+int exec_preload_optref(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PLDOPTREF\n";
+  auto dict = stack.pop_cellslice();
+  int res = dict_nonempty_chk(*dict);
+  if (res) {
+    stack.push_cell(dict->prefetch_ref());
+  }
+  stack.push_smallint(-res);
+  return 0;
+}
+
+int exec_load_dict_slice(VmState* st, unsigned args) {
+  bool preload = args & 1, quiet = args & 2;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << (preload ? "P" : "") << "LDDICTS" << (quiet ? "Q\n" : "\n");
+  auto cs = stack.pop_cellslice();
+  int res = dict_nonempty(*cs);
+  if (res < 0) {
+    if (!quiet) {
+      throw VmError{Excno::cell_und};
+    }
+    if (!preload) {
+      stack.push_cellslice(std::move(cs));
+    }
+  } else {
+    if (preload) {
+      stack.push_cellslice(cs->prefetch_subslice(1, res));
+    } else {
+      stack.push_cellslice(cs.write().fetch_subslice(1, res));
+      stack.push_cellslice(std::move(cs));
+    }
+  }
+  if (quiet) {
+    stack.push_bool(res >= 0);
+  }
+  return 0;
+}
+
+int exec_load_dict(VmState* st, unsigned args) {
+  bool preload = args & 1, quiet = args & 2;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute " << (preload ? "P" : "") << "LDDICT" << (quiet ? "Q\n" : "\n");
+  auto cs = stack.pop_cellslice();
+  int res = dict_nonempty(*cs);
+  if (res < 0) {
+    if (!quiet) {
+      throw VmError{Excno::cell_und};
+    }
+    if (!preload) {
+      stack.push_cellslice(std::move(cs));
+    }
+  } else {
+    stack.push_maybe_cell(res ? cs->prefetch_ref() : Ref<Cell>{});
+    if (!preload) {
+      cs.write().advance_ext(1, res);
+      stack.push_cellslice(std::move(cs));
+    }
+  }
+  if (quiet) {
+    stack.push_bool(res >= 0);
+  }
+  return 0;
+}
+
+std::string dump_dictop(unsigned args, const char* name) {
+  std::ostringstream os{"DICT"};
+  if (args & 4) {
+    os << (args & 2 ? 'U' : 'I');
+  }
+  os << name;
+  if (args & 1) {
+    os << "REF";
+  }
+  return os.str();
+}
+
+std::string dump_dictop2(unsigned args, const char* name) {
+  std::ostringstream os{"DICT"};
+  if (args & 2) {
+    os << (args & 1 ? 'U' : 'I');
+  }
+  os << name;
+  return os.str();
+}
+
+std::string dump_subdictop2(unsigned args, const char* name) {
+  std::ostringstream os{"SUBDICT"};
+  if (args & 2) {
+    os << (args & 1 ? 'U' : 'I');
+  }
+  os << name;
+  return os.str();
+}
+
+int exec_dict_get(VmState* st, unsigned args) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DICT" << (args & 4 ? (args & 2 ? "U" : "I") : "") << "GET" << (args & 1 ? "REF" : "");
+  stack.check_underflow(3);
+  int n = stack.pop_smallint_range(Dictionary::max_key_bits);
+  Dictionary dict{stack.pop_maybe_cell(), n};
+  BitSlice key;
+  unsigned char buffer[Dictionary::max_key_bytes];
+  if (args & 4) {
+    key = dict.integer_key(stack.pop_int(), n, !(args & 2), buffer, true);
+    if (!key.is_valid()) {
+      stack.push_smallint(0);
+      return 0;
+    }
+  } else {
+    key = stack.pop_cellslice()->prefetch_bits(n);
+  }
+  if (!key.is_valid()) {
+    throw VmError{Excno::cell_und, "not enough bits for a dictionary key"};
+  }
+  if (args & 1) {
+    auto value = dict.lookup_ref(key);
+    if (value.not_null()) {
+      stack.push_cell(std::move(value));
+      stack.push_smallint(-1);
+    } else {
+      stack.push_smallint(0);
+    }
+  } else {
+    auto value = dict.lookup(key);
+    if (value.not_null()) {
+      stack.push_cellslice(std::move(value));
+      stack.push_smallint(-1);
+    } else {
+      stack.push_smallint(0);
+    }
+  }
+  return 0;
+}
+
+int exec_dict_get_optref(VmState* st, unsigned args) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DICT" << (args & 2 ? (args & 1 ? "U" : "I") : "") << "GETOPTREF";
+  stack.check_underflow(3);
+  int n = stack.pop_smallint_range(Dictionary::max_key_bits);
+  Dictionary dict{stack.pop_maybe_cell(), n};
+  BitSlice key;
+  unsigned char buffer[Dictionary::max_key_bytes];
+  if (args & 2) {
+    key = dict.integer_key(stack.pop_int(), n, !(args & 1), buffer, true);
+    if (!key.is_valid()) {
+      stack.push_null();
+      return 0;
+    }
+  } else {
+    key = stack.pop_cellslice()->prefetch_bits(n);
+  }
+  if (!key.is_valid()) {
+    throw VmError{Excno::cell_und, "not enough bits for a dictionary key"};
+  }
+  stack.push_maybe_cell(dict.lookup_ref(key));
+  return 0;
+}
+
+int exec_dict_set(VmState* st, unsigned args, Dictionary::SetMode mode, const char* name, bool bld = false) {
+  args <<= (bld ? 1 : 0);
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DICT" << (args & 4 ? (args & 2 ? "U" : "I") : "") << name
+             << (args & 1 ? "REF" : (bld ? "B" : ""));
+  stack.check_underflow(4);
+  int n = stack.pop_smallint_range(Dictionary::max_key_bits);
+  Dictionary dict{stack.pop_maybe_cell(), n};
+  BitSlice key;
+  unsigned char buffer[Dictionary::max_key_bytes];
+  if (args & 4) {
+    key = dict.integer_key(stack.pop_int(), n, !(args & 2), buffer);
+  } else {
+    key = stack.pop_cellslice()->prefetch_bits(n);
+  }
+  bool res;
+  if (bld) {
+    auto new_value = stack.pop_builder();
+    if (!key.is_valid()) {
+      throw VmError{Excno::cell_und, "not enough bits for a dictionary key"};
+    }
+    res = dict.set_builder(key, std::move(new_value), mode);
+  } else if (!(args & 1)) {
+    auto new_value = stack.pop_cellslice();
+    if (!key.is_valid()) {
+      throw VmError{Excno::cell_und, "not enough bits for a dictionary key"};
+    }
+    res = dict.set(key, std::move(new_value), mode);
+  } else {
+    auto new_value_ref = stack.pop_cell();
+    if (!key.is_valid()) {
+      throw VmError{Excno::cell_und, "not enough bits for a dictionary key"};
+    }
+    res = dict.set_ref(key, std::move(new_value_ref), mode);
+  }
+  push_dict(stack, std::move(dict));
+  if (mode == Dictionary::SetMode::Set) {
+    st->ensure_throw(res);
+  } else {
+    stack.push_bool(res);
+  }
+  return 0;
+}
+
+int exec_dict_setget(VmState* st, unsigned args, Dictionary::SetMode mode, const char* name, bool bld = false) {
+  args <<= (bld ? 1 : 0);
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DICT" << (args & 4 ? (args & 2 ? "U" : "I") : "") << name
+             << (args & 1 ? "REF\n" : (bld ? "B\n" : "\n"));
+  stack.check_underflow(4);
+  int n = stack.pop_smallint_range(Dictionary::max_key_bits);
+  Dictionary dict{stack.pop_maybe_cell(), n};
+  BitSlice key;
+  unsigned char buffer[Dictionary::max_key_bytes];
+  if (args & 4) {
+    key = dict.integer_key(stack.pop_int(), n, !(args & 2), buffer);
+  } else {
+    key = stack.pop_cellslice()->prefetch_bits(n);
+  }
+  bool ok_f = (mode != Dictionary::SetMode::Add);
+  if (bld) {
+    auto new_value = stack.pop_builder();
+    if (!key.is_valid()) {
+      throw VmError{Excno::cell_und, "not enough bits for a dictionary key"};
+    }
+    auto res = dict.lookup_set_builder(key, std::move(new_value), mode);
+    push_dict(stack, std::move(dict));
+    if (res.not_null()) {
+      stack.push_cellslice(std::move(res));
+      stack.push_bool(ok_f);
+    } else {
+      stack.push_bool(!ok_f);
+    }
+  } else if (!(args & 1)) {
+    auto new_value = stack.pop_cellslice();
+    if (!key.is_valid()) {
+      throw VmError{Excno::cell_und, "not enough bits for a dictionary key"};
+    }
+    auto res = dict.lookup_set(key, std::move(new_value), mode);
+    push_dict(stack, std::move(dict));
+    if (res.not_null()) {
+      stack.push_cellslice(std::move(res));
+      stack.push_bool(ok_f);
+    } else {
+      stack.push_bool(!ok_f);
+    }
+  } else {
+    auto new_value_ref = stack.pop_cell();
+    if (!key.is_valid()) {
+      throw VmError{Excno::cell_und, "not enough bits for a dictionary key"};
+    }
+    auto res = dict.lookup_set_ref(key, std::move(new_value_ref), mode);
+    push_dict(stack, std::move(dict));
+    if (res.not_null()) {
+      stack.push_cell(std::move(res));
+      stack.push_bool(ok_f);
+    } else {
+      stack.push_bool(!ok_f);
+    }
+  }
+  return 0;
+}
+
+int exec_dict_delete(VmState* st, unsigned args) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DICT" << (args & 2 ? (args & 1 ? "U" : "I") : "") << "DEL\n";
+  stack.check_underflow(3);
+  int n = stack.pop_smallint_range(Dictionary::max_key_bits);
+  Dictionary dict{stack.pop_maybe_cell(), n};
+  BitSlice key;
+  unsigned char buffer[Dictionary::max_key_bytes];
+  if (args & 2) {
+    key = dict.integer_key(stack.pop_int(), n, !(args & 1), buffer);
+    if (!key.is_valid()) {
+      push_dict(stack, std::move(dict));
+      stack.push_smallint(0);
+      return 0;
+    }
+  } else {
+    key = stack.pop_cellslice()->prefetch_bits(n);
+  }
+  if (!key.is_valid()) {
+    throw VmError{Excno::cell_und, "not enough bits for a dictionary key"};
+  }
+  bool res = dict.lookup_delete(key).not_null();
+  push_dict(stack, std::move(dict));
+  stack.push_bool(res);
+  return 0;
+}
+
+int exec_dict_deleteget(VmState* st, unsigned args) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DICT" << (args & 4 ? (args & 2 ? "U" : "I") : "") << "DELGET" << (args & 1 ? "REF\n" : "\n");
+  stack.check_underflow(3);
+  int n = stack.pop_smallint_range(Dictionary::max_key_bits);
+  Dictionary dict{stack.pop_maybe_cell(), n};
+  BitSlice key;
+  unsigned char buffer[Dictionary::max_key_bytes];
+  if (args & 4) {
+    key = dict.integer_key(stack.pop_int(), n, !(args & 2), buffer);
+    if (!key.is_valid()) {
+      push_dict(stack, std::move(dict));
+      stack.push_smallint(0);
+      return 0;
+    }
+  } else {
+    key = stack.pop_cellslice()->prefetch_bits(n);
+  }
+  if (!key.is_valid()) {
+    throw VmError{Excno::cell_und, "not enough bits for a dictionary key"};
+  }
+  if (!(args & 1)) {
+    auto res = dict.lookup_delete(key);
+    push_dict(stack, std::move(dict));
+    bool ok = res.not_null();
+    if (ok) {
+      stack.push_cellslice(std::move(res));
+    }
+    stack.push_bool(ok);
+  } else {
+    auto res = dict.lookup_delete_ref(key);
+    push_dict(stack, std::move(dict));
+    bool ok = res.not_null();
+    if (ok) {
+      stack.push_cell(std::move(res));
+    }
+    stack.push_bool(ok);
+  }
+  return 0;
+}
+
+int exec_dict_setget_optref(VmState* st, unsigned args) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DICT" << (args & 2 ? (args & 1 ? "U" : "I") : "") << "SETGETOPTREF";
+  stack.check_underflow(4);
+  int n = stack.pop_smallint_range(Dictionary::max_key_bits);
+  Dictionary dict{stack.pop_maybe_cell(), n};
+  BitSlice key;
+  unsigned char buffer[Dictionary::max_key_bytes];
+  if (args & 2) {
+    key = dict.integer_key(stack.pop_int(), n, !(args & 1), buffer);
+  } else {
+    key = stack.pop_cellslice()->prefetch_bits(n);
+  }
+  auto new_value = stack.pop_maybe_cell();
+  if (!key.is_valid()) {
+    throw VmError{Excno::cell_und, "not enough bits for a dictionary key"};
+  }
+  Ref<vm::Cell> value;
+  if (new_value.not_null()) {
+    value = dict.lookup_set_ref(key, std::move(new_value));
+  } else {
+    value = dict.lookup_delete_ref(key);
+  }
+  push_dict(stack, std::move(dict));
+  stack.push_maybe_cell(std::move(value));
+  return 0;
+}
+
+int exec_dict_getmin(VmState* st, unsigned args) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DICT" << (args & 4 ? (args & 2 ? "U" : "I") : "") << (args & 16 ? "REM" : "")
+             << (args & 8 ? "MAX" : "MIN") << (args & 1 ? "REF\n" : "\n");
+  stack.check_underflow(2);
+  int n = stack.pop_smallint_range(args & 4 ? (args & 2 ? 256 : 257) : Dictionary::max_key_bits);
+  Dictionary dict{stack.pop_maybe_cell(), n};
+  unsigned char buffer[Dictionary::max_key_bytes];
+  bool flip_first = !(args & 2);
+  if (!(args & 1)) {
+    auto res = (args & 16) ? dict.extract_minmax_key(buffer, n, args & 8, flip_first)
+                           : dict.get_minmax_key(buffer, n, args & 8, flip_first);
+    if (args & 16) {
+      push_dict(stack, std::move(dict));
+    }
+    if (res.is_null()) {
+      stack.push_bool(false);
+      return 0;
+    }
+    stack.push_cellslice(std::move(res));
+  } else {
+    auto res = (args & 16) ? dict.extract_minmax_key_ref(buffer, n, args & 8, flip_first)
+                           : dict.get_minmax_key_ref(buffer, n, args & 8, flip_first);
+    if (args & 16) {
+      push_dict(stack, std::move(dict));
+    }
+    if (res.is_null()) {
+      stack.push_bool(false);
+      return 0;
+    }
+    stack.push_cell(std::move(res));
+  }
+  if (args & 4) {
+    td::RefInt256 x{true};
+    x.unique_write().import_bits(td::ConstBitPtr{buffer}, n, !(args & 2));
+    stack.push_int(std::move(x));
+  } else {
+    stack.push_cellslice(Ref<CellSlice>{true, CellBuilder().store_bits(td::ConstBitPtr{buffer}, n).finalize()});
+  }
+  stack.push_bool(true);
+  return 0;
+}
+
+std::string dump_dictop_getnear(CellSlice& cs, unsigned args) {
+  std::ostringstream os{"DICT"};
+  if (args & 8) {
+    os << (args & 4 ? 'U' : 'I');
+  }
+  os << "GET" << (args & 2 ? "PREV" : "NEXT") << (args & 1 ? "EQ" : "");
+  return os.str();
+}
+
+int exec_dict_getnear(VmState* st, unsigned args) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DICT" << (args & 8 ? (args & 4 ? "U" : "I") : "") << "GET" << (args & 2 ? "PREV" : "NEXT")
+             << (args & 1 ? "EQ\n" : "\n");
+  stack.check_underflow(3);
+  int n = stack.pop_smallint_range(args & 8 ? (args & 4 ? 256 : 257) : Dictionary::max_key_bits);
+  Dictionary dict{stack.pop_maybe_cell(), n};
+  unsigned char buffer[Dictionary::max_key_bytes];
+  bool sgnd = !(args & 4), go_up = !(args & 2), allow_eq = args & 1;
+  if (!(args & 8)) {
+    auto key_hint = stack.pop_cellslice()->prefetch_bits(n);
+    if (!key_hint.is_valid()) {
+      throw VmError{Excno::cell_und, "not enough bits for a dictionary key hint"};
+    }
+    td::BitPtr{buffer}.copy_from(key_hint.bits(), n);
+    key_hint.forget();
+    auto res = dict.lookup_nearest_key(td::BitPtr{buffer}, n, go_up, allow_eq, false);
+    if (res.is_null()) {
+      stack.push_bool(false);
+      return 0;
+    }
+    stack.push_cellslice(std::move(res));
+    stack.push_cellslice(Ref<CellSlice>{true, CellBuilder().store_bits(td::ConstBitPtr{buffer}, n).finalize()});
+  } else {
+    auto key = stack.pop_int_finite();
+    Ref<CellSlice> res;
+    if (key->export_bits(td::BitPtr{buffer}, n, sgnd)) {
+      res = dict.lookup_nearest_key(buffer, n, go_up, allow_eq, sgnd);
+    } else if ((td::sgn(key) >= 0) ^ go_up) {
+      res = dict.get_minmax_key(buffer, n, !go_up, sgnd);
+    }
+    if (res.is_null()) {
+      stack.push_bool(false);
+      return 0;
+    }
+    stack.push_cellslice(std::move(res));
+    key.write().import_bits(td::ConstBitPtr{buffer}, n, sgnd);
+    stack.push_int(std::move(key));
+  }
+  stack.push_bool(true);
+  return 0;
+}
+
+int exec_pfx_dict_set(VmState* st, Dictionary::SetMode mode, const char* name) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PFXDICT" << name;
+  stack.check_underflow(3);
+  int n = stack.pop_smallint_range(PrefixDictionary::max_key_bits);
+  PrefixDictionary dict{stack.pop_maybe_cell(), n};
+  auto key_slice = stack.pop_cellslice();
+  auto new_value = stack.pop_cellslice();
+  bool res = dict.set(key_slice->data_bits(), key_slice->size(), std::move(new_value), mode);
+  push_dict(stack, std::move(dict));
+  stack.push_bool(res);
+  return 0;
+}
+
+int exec_pfx_dict_delete(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PFXDICTDEL\n";
+  stack.check_underflow(2);
+  int n = stack.pop_smallint_range(PrefixDictionary::max_key_bits);
+  PrefixDictionary dict{stack.pop_maybe_cell(), n};
+  auto key_slice = stack.pop_cellslice();
+  bool res = dict.lookup_delete(key_slice->data_bits(), key_slice->size()).not_null();
+  push_dict(stack, std::move(dict));
+  stack.push_bool(res);
+  return 0;
+}
+
+int exec_dict_get_exec(VmState* st, unsigned args) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DICT" << (args & 1 ? 'U' : 'I') << "GET" << (args & 2 ? "EXEC\n" : "JMP\n");
+  stack.check_underflow(3);
+  int n = stack.pop_smallint_range(Dictionary::max_key_bits);
+  Dictionary dict{stack.pop_maybe_cell(), n};
+  unsigned char buffer[Dictionary::max_key_bytes];
+  dict.integer_key_simple(stack.pop_int(), n, !(args & 1), td::BitPtr{buffer});
+  auto value = dict.lookup(td::BitPtr{buffer}, n);
+  if (value.not_null()) {
+    Ref<OrdCont> cont{true, std::move(value), st->get_cp()};
+    return (args & 2) ? st->call(std::move(cont)) : st->jump(std::move(cont));
+  } else {
+    return 0;
+  }
+}
+
+std::string dump_dict_get_exec(CellSlice& cs, unsigned args) {
+  return std::string{"DICT"} + (args & 1 ? 'U' : 'I') + "GET" + (args & 2 ? "EXEC" : "JMP");
+}
+
+int exec_push_const_dict(VmState* st, CellSlice& cs, unsigned args, int pfx_bits) {
+  if (!cs.have(pfx_bits)) {
+    throw VmError{Excno::inv_opcode, "not enough data bits for a DICTPUSHCONST instruction"};
+  }
+  if (!cs.have_refs(1)) {
+    throw VmError{Excno::inv_opcode, "not enough references for a DICTPUSHCONST instruction"};
+  }
+  Stack& stack = st->get_stack();
+  cs.advance(pfx_bits - 11);
+  auto slice = cs.fetch_subslice(1, 1);
+  int n = (int)cs.fetch_ulong(10);
+  VM_LOG(st) << "execute DICTPUSHCONST " << n << " (" << slice << ")";
+  stack.push_cell(slice->prefetch_ref());
+  stack.push_smallint(n);
+  return 0;
+}
+
+std::string dump_push_const_dict(CellSlice& cs, int pfx_bits, const char* name) {
+  if (!cs.have(pfx_bits, 1)) {
+    return "";
+  }
+  cs.advance(pfx_bits - 11);
+  auto slice = cs.fetch_subslice(1, 1);
+  int n = (int)cs.fetch_ulong(10);
+  std::ostringstream os{name};
+  os << ' ' << n << " (";
+  slice->dump_hex(os, false);
+  os << ')';
+  return os.str();
+}
+
+int compute_len_push_const_dict(const CellSlice& cs, unsigned args, int pfx_bits) {
+  if (!cs.have(pfx_bits, 1)) {
+    return 0;
+  }
+  return 0x10000 + pfx_bits;
+}
+
+int exec_pfx_dict_get(VmState* st, int op, const char* name_suff) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PFXDICTGET" << name_suff;
+  stack.check_underflow(3);
+  int n = stack.pop_smallint_range(PrefixDictionary::max_key_bits);
+  PrefixDictionary dict{stack.pop_maybe_cell(), n};
+  auto cs = stack.pop_cellslice();
+  auto res = dict.lookup_prefix(cs->data_bits(), cs->size());
+  if (res.first.is_null()) {
+    if (op & 1) {
+      throw VmError{Excno::cell_und, "cannot parse a prefix belonging to a given prefix code dictionary"};
+    }
+    stack.push_cellslice(std::move(cs));
+    if (!op) {
+      stack.push_bool(false);
+    }
+    return 0;
+  }
+  stack.push_cellslice(cs.write().fetch_subslice(res.second));
+  if (!(op & 2)) {
+    stack.push_cellslice(std::move(res.first));
+  }
+  stack.push_cellslice(std::move(cs));
+  if (!op) {
+    stack.push_bool(true);
+    return 0;
+  }
+  if (op == 1) {
+    return 0;
+  }
+  Ref<OrdCont> cont{true, std::move(res.first), st->get_cp()};
+  return op & 1 ? st->call(std::move(cont)) : st->jump(std::move(cont));
+}
+
+int exec_const_pfx_dict_switch(VmState* st, CellSlice& cs, unsigned args, int pfx_bits) {
+  if (!cs.have(pfx_bits)) {
+    throw VmError{Excno::inv_opcode, "not enough data bits for a PFXDICTSWITCH instruction"};
+  }
+  if (!cs.have_refs(1)) {
+    throw VmError{Excno::inv_opcode, "not enough references for a PFXDICTSWITCH instruction"};
+  }
+  Stack& stack = st->get_stack();
+  cs.advance(pfx_bits - 11);
+
+  auto dict_slice = cs.fetch_subslice(1, 1);
+  int n = (int)cs.fetch_ulong(10);
+
+  VM_LOG(st) << "execute PFXDICTSWITCH " << n << " (" << dict_slice << ")";
+
+  PrefixDictionary dict{std::move(dict_slice), n};
+  auto cs1 = stack.pop_cellslice();
+  auto res = dict.lookup_prefix(cs1->data_bits(), cs1->size());
+
+  if (res.first.is_null()) {
+    stack.push_cellslice(std::move(cs1));
+    return 0;
+  } else {
+    stack.push_cellslice(cs1.write().fetch_subslice(res.second));
+    stack.push_cellslice(std::move(cs1));
+    Ref<OrdCont> cont{true, std::move(res.first), st->get_cp()};
+    return st->jump(std::move(cont));
+  }
+}
+
+int exec_subdict_get(VmState* st, unsigned args) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SUBDICT" << (args & 2 ? (args & 1 ? "U" : "I") : "") << (args & 4 ? "RP" : "") << "GET";
+  stack.check_underflow(4);
+  int n = stack.pop_smallint_range(Dictionary::max_key_bits);
+  Dictionary dict{stack.pop_maybe_cell(), n};
+  int mk = (args & 2 ? (args & 1 ? 256 : 257) : Dictionary::max_key_bits);
+  int k = stack.pop_smallint_range(std::min(mk, n));
+  BitSlice key;
+  unsigned char buffer[Dictionary::max_key_bytes];
+  if (args & 2) {
+    key = dict.integer_key(stack.pop_int(), k, !(args & 1), buffer, true);
+  } else {
+    key = stack.pop_cellslice()->prefetch_bits(k);
+  }
+  if (!key.is_valid()) {
+    throw VmError{Excno::cell_und, "not enough bits for a dictionary key prefix"};
+  }
+  if (!dict.cut_prefix_subdict(key.bits(), k, args & 4)) {
+    throw VmError{Excno::dict_err, "cannot construct subdictionary by key prefix"};
+  }
+  push_dict(stack, std::move(dict));
+  return 0;
+}
+
+void register_dictionary_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mksimple(0xf400, 16, "STDICT", exec_store_dict))
+      .insert(OpcodeInstr::mksimple(0xf401, 16, "SKIPDICT", exec_skip_dict))
+      .insert(OpcodeInstr::mksimple(0xf402, 16, "LDDICTS", std::bind(exec_load_dict_slice, _1, 0)))
+      .insert(OpcodeInstr::mksimple(0xf403, 16, "PLDDICTS", std::bind(exec_load_dict_slice, _1, 1)))
+      .insert(OpcodeInstr::mksimple(0xf404, 16, "LDDICT", std::bind(exec_load_dict, _1, 0)))
+      .insert(OpcodeInstr::mksimple(0xf405, 16, "PLDDICT", std::bind(exec_load_dict, _1, 1)))
+      .insert(OpcodeInstr::mksimple(0xf406, 16, "LDDICTQ", std::bind(exec_load_dict, _1, 2)))
+      .insert(OpcodeInstr::mksimple(0xf407, 16, "PLDDICTQ", std::bind(exec_load_dict, _1, 3)))
+      .insert(OpcodeInstr::mkfixedrange(0xf40a, 0xf410, 16, 3, std::bind(dump_dictop, _2, "GET"), exec_dict_get))
+      .insert(OpcodeInstr::mkfixedrange(0xf412, 0xf418, 16, 3, std::bind(dump_dictop, _2, "SET"),
+                                        std::bind(exec_dict_set, _1, _2, Dictionary::SetMode::Set, "SET", false)))
+      .insert(OpcodeInstr::mkfixedrange(0xf41a, 0xf420, 16, 3, std::bind(dump_dictop, _2, "SETGET"),
+                                        std::bind(exec_dict_setget, _1, _2, Dictionary::SetMode::Set, "SETGET", false)))
+      .insert(
+          OpcodeInstr::mkfixedrange(0xf422, 0xf428, 16, 3, std::bind(dump_dictop, _2, "REPLACE"),
+                                    std::bind(exec_dict_set, _1, _2, Dictionary::SetMode::Replace, "REPLACE", false)))
+      .insert(OpcodeInstr::mkfixedrange(
+          0xf42a, 0xf430, 16, 3, std::bind(dump_dictop, _2, "REPLACEGET"),
+          std::bind(exec_dict_setget, _1, _2, Dictionary::SetMode::Replace, "REPLACEGET", false)))
+      .insert(OpcodeInstr::mkfixedrange(0xf432, 0xf438, 16, 3, std::bind(dump_dictop, _2, "ADD"),
+                                        std::bind(exec_dict_set, _1, _2, Dictionary::SetMode::Add, "ADD", false)))
+      .insert(OpcodeInstr::mkfixedrange(0xf43a, 0xf440, 16, 3, std::bind(dump_dictop, _2, "ADDGET"),
+                                        std::bind(exec_dict_setget, _1, _2, Dictionary::SetMode::Add, "ADDGET", false)))
+      .insert(OpcodeInstr::mkfixedrange(0xf441, 0xf444, 16, 2, std::bind(dump_dictop2, _2, "SETB"),
+                                        std::bind(exec_dict_set, _1, _2, Dictionary::SetMode::Set, "SET", true)))
+      .insert(OpcodeInstr::mkfixedrange(0xf445, 0xf448, 16, 2, std::bind(dump_dictop2, _2, "SETGETB"),
+                                        std::bind(exec_dict_setget, _1, _2, Dictionary::SetMode::Set, "SETGET", true)))
+      .insert(
+          OpcodeInstr::mkfixedrange(0xf449, 0xf44c, 16, 2, std::bind(dump_dictop2, _2, "REPLACEB"),
+                                    std::bind(exec_dict_set, _1, _2, Dictionary::SetMode::Replace, "REPLACE", true)))
+      .insert(OpcodeInstr::mkfixedrange(
+          0xf44d, 0xf450, 16, 2, std::bind(dump_dictop2, _2, "REPLACEGETB"),
+          std::bind(exec_dict_setget, _1, _2, Dictionary::SetMode::Replace, "REPLACEGET", true)))
+      .insert(OpcodeInstr::mkfixedrange(0xf451, 0xf454, 16, 2, std::bind(dump_dictop2, _2, "ADDB"),
+                                        std::bind(exec_dict_set, _1, _2, Dictionary::SetMode::Add, "ADD", true)))
+      .insert(OpcodeInstr::mkfixedrange(0xf455, 0xf458, 16, 2, std::bind(dump_dictop2, _2, "ADDGETB"),
+                                        std::bind(exec_dict_setget, _1, _2, Dictionary::SetMode::Add, "ADDGET", true)))
+      .insert(OpcodeInstr::mkfixedrange(0xf459, 0xf45c, 16, 2, std::bind(dump_dictop2, _2, "DEL"), exec_dict_delete))
+      .insert(
+          OpcodeInstr::mkfixedrange(0xf462, 0xf468, 16, 3, std::bind(dump_dictop, _2, "DELGET"), exec_dict_deleteget))
+      .insert(OpcodeInstr::mkfixedrange(0xf469, 0xf46c, 16, 2, std::bind(dump_dictop2, _2, "GETOPTREF"),
+                                        exec_dict_get_optref))
+      .insert(OpcodeInstr::mkfixedrange(0xf46d, 0xf470, 16, 2, std::bind(dump_dictop2, _2, "SETGETOPTREF"),
+                                        exec_dict_setget_optref))
+      .insert(OpcodeInstr::mksimple(0xf470, 16, "PFXDICTSET",
+                                    std::bind(exec_pfx_dict_set, _1, PrefixDictionary::SetMode::Set, "SET")))
+      .insert(OpcodeInstr::mksimple(0xf471, 16, "PFXDICTREPLACE",
+                                    std::bind(exec_pfx_dict_set, _1, PrefixDictionary::SetMode::Replace, "REPLACE")))
+      .insert(OpcodeInstr::mksimple(0xf472, 16, "PFXDICTADD",
+                                    std::bind(exec_pfx_dict_set, _1, PrefixDictionary::SetMode::Add, "ADD")))
+      .insert(OpcodeInstr::mksimple(0xf473, 16, "PFXDICTDEL", exec_pfx_dict_delete))
+      .insert(OpcodeInstr::mkfixedrange(0xf474, 0xf480, 16, 4, dump_dictop_getnear, exec_dict_getnear))
+      .insert(OpcodeInstr::mkfixedrange(0xf482, 0xf488, 16, 5, std::bind(dump_dictop, _2, "MIN"), exec_dict_getmin))
+      .insert(OpcodeInstr::mkfixedrange(0xf48a, 0xf490, 16, 5, std::bind(dump_dictop, _2, "MAX"), exec_dict_getmin))
+      .insert(OpcodeInstr::mkfixedrange(0xf492, 0xf498, 16, 5, std::bind(dump_dictop, _2, "REMMIN"), exec_dict_getmin))
+      .insert(OpcodeInstr::mkfixedrange(0xf49a, 0xf4a0, 16, 5, std::bind(dump_dictop, _2, "REMMAX"), exec_dict_getmin))
+      .insert(OpcodeInstr::mkfixed(0xf4a0 >> 2, 14, 2, dump_dict_get_exec, exec_dict_get_exec))
+      .insert(OpcodeInstr::mkextrange(0xf4a400, 0xf4a800, 24, 11,
+                                      std::bind(dump_push_const_dict, _1, _3, "DICTPUSHCONST"), exec_push_const_dict,
+                                      compute_len_push_const_dict))
+      .insert(OpcodeInstr::mksimple(0xf4a8, 16, "PFXDICTGETQ", std::bind(exec_pfx_dict_get, _1, 0, "Q")))
+      .insert(OpcodeInstr::mksimple(0xf4a9, 16, "PFXDICTGET", std::bind(exec_pfx_dict_get, _1, 1, "")))
+      .insert(OpcodeInstr::mksimple(0xf4aa, 16, "PFXDICTGETJMP", std::bind(exec_pfx_dict_get, _1, 2, "JMP")))
+      .insert(OpcodeInstr::mksimple(0xf4ab, 16, "PFXDICTGETEXEC", std::bind(exec_pfx_dict_get, _1, 3, "EXEC")))
+      .insert(OpcodeInstr::mkextrange(0xf4ac00, 0xf4b000, 24, 11,
+                                      std::bind(dump_push_const_dict, _1, _3, "PFXDICTSWITCH"),
+                                      exec_const_pfx_dict_switch, compute_len_push_const_dict))
+      .insert(OpcodeInstr::mkfixedrange(0xf4b1, 0xf4b4, 16, 3, std::bind(dump_subdictop2, _2, "GET"), exec_subdict_get))
+      .insert(
+          OpcodeInstr::mkfixedrange(0xf4b5, 0xf4b8, 16, 3, std::bind(dump_subdictop2, _2, "RPGET"), exec_subdict_get));
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/dictops.h b/submodules/ton/tonlib-src/crypto/vm/dictops.h
new file mode 100644
index 0000000000..d555cf7a63
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/dictops.h
@@ -0,0 +1,27 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace vm {
+
+class OpcodeTable;
+
+void register_dictionary_ops(OpcodeTable& cp0);
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/dispatch.cpp b/submodules/ton/tonlib-src/crypto/vm/dispatch.cpp
new file mode 100644
index 0000000000..741982dce3
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/dispatch.cpp
@@ -0,0 +1,71 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/dispatch.h"
+#include "vm/excno.hpp"
+#include <cassert>
+#include <map>
+#include <mutex>
+
+namespace vm {
+
+namespace {
+std::mutex dispatch_tables_mutex;
+std::map<int, const DispatchTable*> dispatch_tables;
+}  // namespace
+
+DummyDispatchTable dummy_dispatch_table;
+
+bool DispatchTable::register_table(Codepage _cp, const DispatchTable& dt) {
+  assert(dt.is_final());
+  int cp = (int)_cp;
+  if (cp < -0x8000 || cp >= 0x8000 || cp == -1) {
+    return false;
+  } else {
+    std::lock_guard<std::mutex> guard(dispatch_tables_mutex);
+    return dispatch_tables.emplace(cp, &dt).second;
+  }
+}
+
+bool DispatchTable::register_table(Codepage cp) const {
+  return register_table(cp, *this);
+}
+
+const DispatchTable* DispatchTable::get_table(Codepage cp) {
+  return get_table((int)cp);
+}
+
+const DispatchTable* DispatchTable::get_table(int cp) {
+  std::lock_guard<std::mutex> guard(dispatch_tables_mutex);
+  auto entry = dispatch_tables.find(cp);
+  return entry != dispatch_tables.end() ? entry->second : 0;
+}
+
+int DummyDispatchTable::dispatch(VmState* st, CellSlice& cs) const {
+  throw VmError{Excno::inv_opcode, "empty opcode table"};
+}
+
+std::string DummyDispatchTable::dump_instr(CellSlice& cs) const {
+  return "";
+}
+
+int DummyDispatchTable::instr_len(const CellSlice& cs) const {
+  return 0;
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/dispatch.h b/submodules/ton/tonlib-src/crypto/vm/dispatch.h
new file mode 100644
index 0000000000..509ecfca56
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/dispatch.h
@@ -0,0 +1,62 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <string>
+
+namespace vm {
+
+class VmState;
+class CellSlice;
+
+enum class Codepage { test_cp = 0 };
+
+class DispatchTable {
+ public:
+  DispatchTable() = default;
+  virtual ~DispatchTable() = default;
+  virtual int dispatch(VmState* st, CellSlice& cs) const = 0;
+  virtual std::string dump_instr(CellSlice& cs) const = 0;
+  virtual int instr_len(const CellSlice& cs) const = 0;
+  virtual DispatchTable* finalize() = 0;
+  virtual bool is_final() const = 0;
+  static const DispatchTable* get_table(Codepage cp);
+  static const DispatchTable* get_table(int cp);
+  static bool register_table(Codepage cp, const DispatchTable& dt);
+  bool register_table(Codepage cp) const;
+};
+
+class DummyDispatchTable : public DispatchTable {
+ public:
+  DummyDispatchTable() : DispatchTable() {
+  }
+  ~DummyDispatchTable() override = default;
+  int dispatch(VmState* st, CellSlice& cs) const override;
+  std::string dump_instr(CellSlice& cs) const override;
+  int instr_len(const CellSlice& cs) const override;
+  DispatchTable* finalize() override {
+    return this;
+  }
+  bool is_final() const override {
+    return true;
+  }
+};
+
+extern DummyDispatchTable dummy_dispatch_table;
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/excno.hpp b/submodules/ton/tonlib-src/crypto/vm/excno.hpp
new file mode 100644
index 0000000000..f67d8a4e92
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/excno.hpp
@@ -0,0 +1,98 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace vm {
+
+enum class Excno : int {
+  none = 0,
+  alt = 1,
+  stk_und = 2,
+  stk_ov = 3,
+  int_ov = 4,
+  range_chk = 5,
+  inv_opcode = 6,
+  type_chk = 7,
+  cell_ov = 8,
+  cell_und = 9,
+  dict_err = 10,
+  unknown = 11,
+  fatal = 12,
+  out_of_gas = 13,
+  virt_err = 14,
+  total
+};
+
+const char* get_exception_msg(Excno exc_no);
+
+class VmError {
+  Excno exc_no;
+  const char* msg;
+  long long arg;
+
+ public:
+  VmError(Excno _excno, const char* _msg) : exc_no(_excno), msg(_msg), arg(0) {
+  }
+  VmError(Excno _excno) : exc_no(_excno), msg(0), arg(0) {
+  }
+  VmError(Excno _excno, const char* _msg, long long _arg) : exc_no(_excno), msg(_msg), arg(_arg) {
+  }
+  int get_errno() const {
+    return static_cast<int>(exc_no);
+  }
+  const char* get_msg() const {
+    return msg ? msg : get_exception_msg(exc_no);
+  }
+  long long get_arg() const {
+    return arg;
+  }
+};
+
+struct VmNoGas {
+  VmNoGas() = default;
+  int get_errno() const {
+    return static_cast<int>(Excno::out_of_gas);
+  }
+  const char* get_msg() const {
+    return "out of gas";
+  }
+  operator VmError() const {
+    return VmError{Excno::out_of_gas, "out of gas"};
+  }
+};
+
+struct VmVirtError {
+  int virtualization{0};
+  VmVirtError() = default;
+  VmVirtError(int virtualization) : virtualization(virtualization) {
+  }
+  int get_errno() const {
+    return static_cast<int>(Excno::virt_err);
+  }
+  const char* get_msg() const {
+    return "prunned branch";
+  }
+  operator VmError() const {
+    return VmError{Excno::virt_err, "prunned branch", virtualization};
+  }
+};
+
+struct VmFatal {};
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/fmt.hpp b/submodules/ton/tonlib-src/crypto/vm/fmt.hpp
new file mode 100644
index 0000000000..13096fbefa
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/fmt.hpp
@@ -0,0 +1,503 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "common/refint.h"
+#include "vm/cells.h"
+#include "vm/cellslice.h"
+#include "vm/cellparse.hpp"
+#include <type_traits>
+
+namespace vm {
+
+namespace fmt {
+
+// main idea: use cs >> i(32,x) >> ... or cs >> i32(x) to deserialize integers, instead of cs.write().fetch_long(32, true)
+// and cb << i(32,x+y) or cb << i32(x+y) will serialize 32-bit integers
+
+// i, u, i16, u16, i32, u32, ub=u1, ib=i1 for integers
+
+template <bool S, class T, bool C = true>
+class ConstInt {
+  int bits;
+  T value;
+
+ public:
+  ConstInt(int _bits, T _val) : bits(_bits), value(_val) {
+  }
+  bool serialize(CellBuilder& cb) const {
+    if (C) {
+      return (S ? cb.store_long_rchk_bool(value, bits) : cb.store_ulong_rchk_bool(value, bits));
+    } else {
+      return cb.store_long_bool(value, bits);
+    }
+  }
+  bool deserialize(CellSlice& cs) const {
+    if (S) {
+      long long x;
+      return cs.fetch_long_bool(bits, x) && x == value;
+    } else {
+      unsigned long long x;
+      return cs.fetch_ulong_bool(bits, x) && x == value;
+    }
+  }
+};
+
+template <bool S, class T, bool C = true>
+class Int {
+  int bits;
+  T& value;
+
+ public:
+  Int(int _bits, T& _val) : bits(_bits), value(_val) {
+  }
+  bool deserialize(CellSlice& cs) const {
+    if (S) {
+      long long x;
+      if (cs.fetch_long_bool(bits, x)) {
+        value = static_cast<T>(x);
+        return true;
+      }
+    } else {
+      unsigned long long x;
+      if (cs.fetch_ulong_bool(bits, x)) {
+        value = static_cast<T>(x);
+        return true;
+      }
+    }
+    return false;
+  }
+  bool serialize(CellBuilder& cb) const {
+    if (C) {
+      return S ? cb.store_long_rchk_bool(value, bits) : cb.store_ulong_rchk_bool(value, bits);
+    } else {
+      return cb.store_long_bool(value, bits);
+    }
+  }
+};
+
+template <bool S, class T>
+class PrefetchInt {
+  int bits;
+  T& value;
+
+ public:
+  PrefetchInt(int _bits, T& _val) : bits(_bits), value(_val) {
+  }
+  bool deserialize(CellSlice& cs) const {
+    if (S) {
+      long long x;
+      if (cs.prefetch_long_bool(bits, x)) {
+        value = static_cast<T>(x);
+        return true;
+      }
+    } else {
+      unsigned long long x;
+      if (cs.prefetch_ulong_bool(bits, x)) {
+        value = static_cast<T>(x);
+        return true;
+      }
+    }
+    return false;
+  }
+};
+
+template <bool S>
+class ConstRefInt {
+  int bits;
+  const td::RefInt256& value;
+
+ public:
+  ConstRefInt(int _bits, const td::RefInt256& _val) : bits(_bits), value(_val) {
+  }
+  bool serialize(CellBuilder& cb) const {
+    return value.not_null() && cb.store_int256_bool(*value, bits, S);
+  }
+};
+
+template <bool S>
+class ConstRefIntVal {
+  int bits;
+  td::RefInt256 value;
+
+ public:
+  ConstRefIntVal(int _bits, const td::RefInt256& _val) : bits(_bits), value(_val) {
+  }
+  ConstRefIntVal(int _bits, td::RefInt256&& _val) : bits(_bits), value(std::move(_val)) {
+  }
+  bool serialize(CellBuilder& cb) const {
+    return value.not_null() && cb.store_int256_bool(*value, bits, S);
+  }
+};
+
+template <bool S>
+class ConstBigInt {
+  int bits;
+  const td::BigInt256& value;
+
+ public:
+  ConstBigInt(int _bits, const td::BigInt256& _val) : bits(_bits), value(_val) {
+  }
+  bool serialize(CellBuilder& cb) const {
+    return cb.store_int256_bool(value, bits, S);
+  }
+};
+
+template <bool S>
+class RefInt {
+  int bits;
+  td::RefInt256& value;
+
+ public:
+  RefInt(int _bits, td::RefInt256& _val) : bits(_bits), value(_val) {
+  }
+  bool deserialize(CellSlice& cs) const {
+    value = cs.fetch_int256(bits, S);
+    return value.not_null();
+  }
+  bool serialize(CellBuilder& cb) const {
+    return value.not_null() && cb.store_int256_bool(*value, bits, S);
+  }
+};
+
+inline ConstRefInt<true> i(int l, const td::RefInt256& val) {
+  return {l, val};
+}
+
+inline ConstRefIntVal<true> i(int l, td::RefInt256&& val) {
+  return {l, std::move(val)};
+}
+
+inline ConstBigInt<true> i(int l, const td::BigInt256& val) {
+  return {l, val};
+}
+
+inline RefInt<true> i(int l, td::RefInt256& val) {
+  return {l, val};
+}
+
+inline ConstRefInt<false> u(int l, const td::RefInt256& val) {
+  return {l, val};
+}
+
+inline ConstRefIntVal<false> u(int l, td::RefInt256&& val) {
+  return {l, std::move(val)};
+}
+
+inline ConstBigInt<false> u(int l, const td::BigInt256& val) {
+  return {l, val};
+}
+
+inline RefInt<false> u(int l, td::RefInt256& val) {
+  return {l, val};
+}
+
+template <class T>
+const ConstInt<true, T> i(int l, const T& val) {
+  return {l, val};
+}
+
+template <class T>
+Int<true, T> i(int l, T& val) {
+  return {l, val};
+}
+
+template <class T>
+PrefetchInt<true, T> pi(int l, T& val) {
+  return {l, val};
+}
+
+template <class T>
+const ConstInt<false, T> u(int l, const T& val) {
+  return {l, val};
+}
+
+template <class T>
+Int<false, T> u(int l, T& val) {
+  return {l, val};
+}
+
+template <class T>
+PrefetchInt<false, T> pu(int l, T& val) {
+  return {l, val};
+}
+
+template <class T>
+const ConstInt<true, T, false> iw(int l, const T& val) {
+  return {l, val};
+}
+
+template <class T>
+Int<true, T, false> iw(int l, T& val) {
+  return {l, val};
+}
+
+inline ConstInt<true, bool> ib(bool flag) {
+  return {1, flag};
+}
+
+template <class T>
+Int<true, T> ib(T& val) {
+  return {1, val};
+}
+
+template <class T>
+PrefetchInt<true, T> pib(T& val) {
+  return {1, val};
+}
+
+inline ConstInt<false, bool> ub(bool flag) {
+  return {1, flag};
+}
+
+template <class T>
+Int<false, T> ub(T& val) {
+  return {1, val};
+}
+
+template <class T>
+PrefetchInt<false, T> pub(T& val) {
+  return {1, val};
+}
+
+inline ConstInt<true, signed char> i8(signed char val) {
+  return {8, val};
+}
+
+template <class T>
+Int<true, T> i8(T& val) {
+  return {8, val};
+}
+
+inline ConstInt<false, unsigned char> u8(unsigned char val) {
+  return {8, val};
+}
+
+template <class T>
+Int<false, T> u8(T& val) {
+  return {8, val};
+}
+
+inline ConstInt<true, short> i16(short val) {
+  return {16, val};
+}
+
+template <class T>
+Int<true, T> i16(T& val) {
+  static_assert(sizeof(T) >= 2, "i16 needs at least 16-bit integer variable as a result");
+  return {16, val};
+}
+
+inline ConstInt<false, unsigned short> u16(unsigned short val) {
+  return {16, val};
+}
+
+template <class T>
+Int<false, T> u16(T& val) {
+  static_assert(sizeof(T) >= 2, "u16 needs at least 16-bit integer variable as a result");
+  return {16, val};
+}
+
+template <class T>
+const ConstInt<true, T> i32(const T& val) {
+  return {32, val};
+}
+
+template <class T>
+Int<true, T> i32(T& val) {
+  static_assert(sizeof(T) >= 4, "i32 needs at least 32-bit integer variable as a result");
+  return {32, val};
+}
+
+template <class T>
+PrefetchInt<true, T> pi32(T& val) {
+  static_assert(sizeof(T) >= 4, "pi32 needs at least 32-bit integer variable as a result");
+  return {32, val};
+}
+
+template <class T>
+const ConstInt<false, unsigned> u32(const T& val) {
+  return {32, val};
+}
+
+template <class T>
+Int<false, T> u32(T& val) {
+  static_assert(sizeof(T) >= 4, "u32 needs at least 32-bit integer variable as a result");
+  return {32, val};
+}
+
+template <class T>
+PrefetchInt<false, T> pu32(T& val) {
+  static_assert(sizeof(T) >= 4, "pu32 needs at least 32-bit integer variable as a result");
+  return {32, val};
+}
+
+template <class T>
+const ConstInt<true, T> i64(const T& val) {
+  return {64, val};
+}
+
+template <class T>
+Int<true, T> i64(T& val) {
+  static_assert(sizeof(T) >= 8, "i64 needs 64-bit integer variable as a result");
+  return {64, val};
+}
+
+template <class T>
+const ConstInt<false, T> u64(const T& val) {
+  return {64, val};
+}
+
+template <class T>
+Int<false, T> u64(T& val) {
+  static_assert(sizeof(T) >= 8, "u64 needs 64-bit integer variable as a result");
+  return {64, val};
+}
+
+/*
+ * 
+ *   non-integer types
+ * 
+ */
+
+// cr(Ref<Cell>& cell_ref) for (de)serializing cell references
+
+class ConstCellRef {
+  const td::Ref<vm::Cell>& value;
+
+ public:
+  ConstCellRef(const td::Ref<vm::Cell>& _val) : value(_val) {
+  }
+  bool serialize(CellBuilder& cb) const {
+    return cb.store_ref_bool(value);
+  }
+};
+
+class ConstCellRefVal {
+  td::Ref<vm::Cell> value;
+
+ public:
+  ConstCellRefVal(const td::Ref<vm::Cell>& _val) : value(_val) {
+  }
+  ConstCellRefVal(td::Ref<vm::Cell>&& _val) : value(std::move(_val)) {
+  }
+  bool serialize(CellBuilder& cb) const {
+    return cb.store_ref_bool(std::move(value));
+  }
+};
+
+class CellRefFmt {
+  td::Ref<vm::Cell>& value;
+
+ public:
+  CellRefFmt(td::Ref<vm::Cell>& _val) : value(_val) {
+  }
+  bool deserialize(CellSlice& cs) const {
+    value = cs.fetch_ref();
+    return value.not_null();
+  }
+};
+
+inline ConstCellRef cr(const td::Ref<vm::Cell>& val) {
+  return {val};
+}
+
+inline ConstCellRefVal cr(td::Ref<vm::Cell>&& val) {
+  return {std::move(val)};
+}
+
+inline CellRefFmt cr(td::Ref<vm::Cell>& val) {
+  return {val};
+}
+
+// skip(n) will skip n bits
+
+class SkipFmt {
+  int bits;
+
+ public:
+  explicit SkipFmt(int _bits) : bits(_bits) {
+  }
+  bool deserialize(CellSlice& cs) const {
+    return cs.advance(bits);
+  }
+};
+
+inline SkipFmt skip(int bits) {
+  return SkipFmt{bits};
+}
+
+// end will throw an exception if any bits or references remain, or if a previous operation failed
+// ends similar, but checks only bits
+
+class ChkEnd {
+ public:
+  explicit ChkEnd() = default;
+  bool deserialize(CellSlice& cs) const {
+    return (cs.empty() && !cs.size_refs());
+  }
+};
+
+class ChkEndS {
+ public:
+  explicit ChkEndS() = default;
+  bool deserialize(CellSlice& cs) const {
+    return cs.empty();
+  }
+};
+
+template <class Cond>
+class Chk {
+  Cond cond;
+
+ public:
+  template <typename... Args>
+  explicit constexpr Chk(Args... args) : cond(args...){};
+  bool deserialize_ext(CellSlice& cs, bool state) const {
+    if (!state || !cond.deserialize(cs)) {
+      cs.error();
+    }
+    return true;
+  }
+};
+
+class ChkOk {
+ public:
+  explicit ChkOk() = default;
+  bool deserialize_ext(CellSlice& cs, bool state) const {
+    if (!state) {
+      cs.error();
+    }
+    return true;
+  }
+};
+
+constexpr ChkEnd end = ChkEnd{};
+constexpr ChkEndS ends = ChkEndS{};
+constexpr Chk<ChkEnd> okend = Chk<ChkEnd>{};
+constexpr Chk<ChkEndS> okends = Chk<ChkEndS>{};
+constexpr Chk<ChkEndS> oke = Chk<ChkEndS>{};
+constexpr ChkOk ok = ChkOk{};
+
+inline ::vm::CellParser parser(CellSlice& cs) {
+  return ::vm::CellParser{cs};
+}
+
+}  // namespace fmt
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/log.h b/submodules/ton/tonlib-src/crypto/vm/log.h
new file mode 100644
index 0000000000..e063141135
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/log.h
@@ -0,0 +1,53 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/logging.h"
+
+#define VM_LOG_IMPL(st, mask)                                                             \
+  LOG_IMPL_FULL(get_log_interface(st), get_log_options(st), DEBUG, VERBOSITY_NAME(DEBUG), \
+                (get_log_mask(st) & mask) != 0, "")
+
+#define VM_LOG(st) VM_LOG_IMPL(st, 1)
+#define VM_LOG_MASK(st, mask) VM_LOG_IMPL(st, mask)
+
+namespace vm {
+struct VmLog {
+  td::LogInterface *log_interface{td::log_interface};
+  td::LogOptions log_options{td::log_options};
+  enum { DumpStack = 2 };
+  int log_mask{1};
+};
+
+template <class State>
+td::LogInterface &get_log_interface(State *st) {
+  return st ? *st->get_log().log_interface : *::td::log_interface;
+}
+
+template <class State>
+auto get_log_options(State *st) {
+  return st ? st->get_log().log_options : ::td::log_options;
+}
+
+template <class State>
+auto get_log_mask(State *st) {
+  return st ? st->get_log().log_mask : 1;
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/opctable.cpp b/submodules/ton/tonlib-src/crypto/vm/opctable.cpp
new file mode 100644
index 0000000000..fbdc2578c1
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/opctable.cpp
@@ -0,0 +1,450 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <cassert>
+#include <iterator>
+#include "vm/opctable.h"
+#include "vm/cellslice.h"
+#include "vm/excno.hpp"
+#include "vm/continuation.h"
+#include <iostream>
+#include <iomanip>
+#include <sstream>
+#include <functional>
+
+#include "td/utils/format.h"
+
+namespace vm {
+
+DispatchTable* OpcodeTable::finalize() {
+  if (final) {
+    return this;
+  }
+  instruction_list.clear();
+  instruction_list.reserve(instructions.size() * 2 + 1);
+
+  unsigned upto = 0;
+  for (const auto& x : instructions) {
+    auto range = x.second->get_opcode_range();
+    assert(range.first == x.first);
+    assert(range.first < range.second);
+    assert(range.first >= upto);
+    assert(range.second <= top_opcode);
+    if (range.first > upto) {
+      instruction_list.emplace_back(upto, new OpcodeInstrDummy{upto, range.first});
+    }
+    instruction_list.emplace_back(x);
+    upto = range.second;
+  }
+
+  if (upto < top_opcode) {
+    instruction_list.emplace_back(upto, new OpcodeInstrDummy{upto, top_opcode});
+  }
+
+  instruction_list.shrink_to_fit();
+  final = true;
+  return this;
+}
+
+OpcodeTable& OpcodeTable::insert(const OpcodeInstr* instr) {
+  LOG_IF(FATAL, !insert_bool(instr)) << td::format::lambda([&](auto& sb) {
+    sb << "cannot insert instruction into table " << name << ": ";
+    if (!instr) {
+      sb << "instruction is null";
+    } else if (final) {
+      sb << "instruction table already finalized";
+    } else {
+      auto range = instr->get_opcode_range();
+      sb << "opcode range " << td::format::as_hex(range.first) << ".." << td::format::as_hex(range.second - 1)
+         << " already occupied or invalid";
+    }
+  });
+  return *this;
+}
+
+bool OpcodeTable::insert_bool(const OpcodeInstr* instr) {
+  if (!instr || final) {
+    return false;
+  }
+  auto range = instr->get_opcode_range();
+  assert(range.first < range.second);
+  assert(range.second <= top_opcode);
+  auto it = instructions.lower_bound(range.first);
+  if (it != instructions.end() && it->first < range.second) {
+    return false;
+  }
+  if (it != instructions.begin()) {
+    auto prev_range = std::prev(it)->second->get_opcode_range();
+    assert(prev_range.first < prev_range.second);
+    assert(prev_range.first == std::prev(it)->first);
+    if (prev_range.second > range.first) {
+      return false;
+    }
+  }
+  instructions.emplace_hint(it, range.first, instr);
+  return true;
+}
+
+const OpcodeInstr* OpcodeTable::lookup_instr(unsigned opcode, unsigned bits) const {
+  std::size_t i = 0, j = instruction_list.size();
+  assert(j);
+  while (j - i > 1) {
+    auto k = ((j + i) >> 1);
+    if (instruction_list[k].first <= opcode) {
+      i = k;
+    } else {
+      j = k;
+    }
+  }
+  return instruction_list[i].second;
+}
+
+const OpcodeInstr* OpcodeTable::lookup_instr(const CellSlice& cs, unsigned& opcode, unsigned& bits) const {
+  bits = max_opcode_bits;
+  unsigned long long prefetch = cs.prefetch_ulong_top(bits);
+  opcode = (unsigned)(prefetch >> (64 - max_opcode_bits));
+  opcode &= (static_cast<int32_t>(static_cast<td::uint32>(-1) << max_opcode_bits) >> bits);
+  return lookup_instr(opcode, bits);
+}
+
+int OpcodeTable::dispatch(VmState* st, CellSlice& cs) const {
+  assert(final);
+  unsigned bits, opcode;
+  auto instr = lookup_instr(cs, opcode, bits);
+  //std::cerr << "lookup_instr: cs.size()=" << cs.size() << "; bits=" << bits << "; opcode=" << std::setw(6) << std::setfill('0') << std::hex << opcode << std::dec << std::endl;
+  return instr->dispatch(st, cs, opcode, bits);
+}
+
+std::string OpcodeTable::dump_instr(CellSlice& cs) const {
+  assert(final);
+  unsigned bits, opcode;
+  auto instr = lookup_instr(cs, opcode, bits);
+  return instr->dump(cs, opcode, bits);
+}
+
+int OpcodeTable::instr_len(const CellSlice& cs) const {
+  assert(final);
+  unsigned bits, opcode;
+  auto instr = lookup_instr(cs, opcode, bits);
+  return instr->instr_len(cs, opcode, bits);
+}
+
+OpcodeInstr::OpcodeInstr(unsigned _opcode, unsigned _bits, bool)
+    : min_opcode(_opcode << (max_opcode_bits - _bits)), max_opcode((_opcode + 1) << (max_opcode_bits - _bits)) {
+  assert(_opcode < (1U << _bits) && _bits <= max_opcode_bits);
+}
+
+int OpcodeInstrDummy::dispatch(VmState* st, CellSlice& cs, unsigned opcode, unsigned bits) const {
+  st->consume_gas(gas_per_instr);
+  throw VmError{Excno::inv_opcode, "invalid opcode", opcode};
+}
+
+std::string OpcodeInstr::dump(CellSlice& cs, unsigned opcode, unsigned bits) const {
+  return "";
+}
+
+int OpcodeInstr::instr_len(const CellSlice& cs, unsigned opcode, unsigned bits) const {
+  return 0;
+}
+
+OpcodeInstrSimple::OpcodeInstrSimple(unsigned opcode, unsigned _opc_bits, std::string _name, exec_instr_func_t exec)
+    : OpcodeInstr(opcode, _opc_bits, false)
+    , opc_bits(static_cast<unsigned char>(_opc_bits))
+    , name(_name)
+    , exec_instr(exec) {
+}
+
+int OpcodeInstrSimple::dispatch(VmState* st, CellSlice& cs, unsigned opcode, unsigned bits) const {
+  st->consume_gas(gas_per_instr + opc_bits * gas_per_bit);
+  if (bits < opc_bits) {
+    throw VmError{Excno::inv_opcode, "invalid or too short opcode", opcode + (bits << max_opcode_bits)};
+  }
+  cs.advance(opc_bits);
+  return exec_instr(st, cs, opcode >> (max_opcode_bits - opc_bits), opc_bits);
+}
+
+std::string OpcodeInstrSimple::dump(CellSlice& cs, unsigned opcode, unsigned bits) const {
+  if (bits < opc_bits) {
+    return "";
+  }
+  cs.advance(opc_bits);
+  return name;
+}
+
+int OpcodeInstrSimple::instr_len(const CellSlice& cs, unsigned opcode, unsigned bits) const {
+  if (bits < opc_bits) {
+    return 0;
+  } else {
+    return opc_bits;
+  }
+}
+
+OpcodeInstrSimplest::OpcodeInstrSimplest(unsigned opcode, unsigned _opc_bits, std::string _name,
+                                         exec_simple_instr_func_t exec)
+    : OpcodeInstr(opcode, _opc_bits, false)
+    , opc_bits(static_cast<unsigned char>(_opc_bits))
+    , name(_name)
+    , exec_instr(exec) {
+}
+
+int OpcodeInstrSimplest::dispatch(VmState* st, CellSlice& cs, unsigned opcode, unsigned bits) const {
+  st->consume_gas(gas_per_instr + opc_bits * gas_per_bit);
+  if (bits < opc_bits) {
+    throw VmError{Excno::inv_opcode, "invalid or too short opcode", opcode + (bits << max_opcode_bits)};
+  }
+  cs.advance(opc_bits);
+  return exec_instr(st);
+}
+
+std::string OpcodeInstrSimplest::dump(CellSlice& cs, unsigned opcode, unsigned bits) const {
+  if (bits < opc_bits) {
+    return "";
+  }
+  cs.advance(opc_bits);
+  return name;
+}
+
+int OpcodeInstrSimplest::instr_len(const CellSlice& cs, unsigned opcode, unsigned bits) const {
+  if (bits < opc_bits) {
+    return 0;
+  } else {
+    return opc_bits;
+  }
+}
+
+OpcodeInstrFixed::OpcodeInstrFixed(unsigned opcode, unsigned _opc_bits, unsigned _arg_bits, dump_arg_instr_func_t dump,
+                                   exec_arg_instr_func_t exec)
+    : OpcodeInstr(opcode, _opc_bits, false)
+    , opc_bits(static_cast<unsigned char>(_opc_bits))
+    , tot_bits(static_cast<unsigned char>(_opc_bits + _arg_bits))
+    , dump_instr(dump)
+    , exec_instr(exec) {
+  assert(_arg_bits <= max_opcode_bits && _opc_bits <= max_opcode_bits && _arg_bits + _opc_bits <= max_opcode_bits);
+}
+
+OpcodeInstrFixed::OpcodeInstrFixed(unsigned opcode_min, unsigned opcode_max, unsigned _tot_bits, unsigned _arg_bits,
+                                   dump_arg_instr_func_t dump, exec_arg_instr_func_t exec)
+    : OpcodeInstr(opcode_min << (max_opcode_bits - _tot_bits), opcode_max << (max_opcode_bits - _tot_bits))
+    , opc_bits(static_cast<unsigned char>(_tot_bits - _arg_bits))
+    , tot_bits(static_cast<unsigned char>(_tot_bits))
+    , dump_instr(dump)
+    , exec_instr(exec) {
+  assert(_arg_bits <= _tot_bits && _tot_bits <= max_opcode_bits);
+  assert(opcode_min < opcode_max && opcode_max <= (1U << _tot_bits));
+}
+
+int OpcodeInstrFixed::dispatch(VmState* st, CellSlice& cs, unsigned opcode, unsigned bits) const {
+  st->consume_gas(gas_per_instr + tot_bits * gas_per_bit);
+  if (bits < tot_bits) {
+    throw VmError{Excno::inv_opcode, "invalid or too short opcode", opcode + (bits << max_opcode_bits)};
+  }
+  cs.advance(tot_bits);
+  return exec_instr(st, opcode >> (max_opcode_bits - tot_bits));
+}
+
+std::string OpcodeInstrFixed::dump(CellSlice& cs, unsigned opcode, unsigned bits) const {
+  if (bits < tot_bits) {
+    return "";
+  }
+  cs.advance(tot_bits);
+  return dump_instr(cs, opcode >> (max_opcode_bits - tot_bits));
+}
+
+int OpcodeInstrFixed::instr_len(const CellSlice& cs, unsigned opcode, unsigned bits) const {
+  if (bits < tot_bits) {
+    return 0;
+  } else {
+    return tot_bits;
+  }
+}
+
+OpcodeInstrExt::OpcodeInstrExt(unsigned opcode, unsigned _opc_bits, unsigned _arg_bits, dump_instr_func_t dump,
+                               exec_instr_func_t exec, compute_instr_len_func_t comp_len)
+    : OpcodeInstr(opcode, _opc_bits, false)
+    , opc_bits(static_cast<unsigned char>(_opc_bits))
+    , tot_bits(static_cast<unsigned char>(_opc_bits + _arg_bits))
+    , dump_instr(dump)
+    , exec_instr(exec)
+    , compute_instr_len(comp_len) {
+  assert(_arg_bits <= max_opcode_bits && _opc_bits <= max_opcode_bits && _arg_bits + _opc_bits <= max_opcode_bits);
+}
+
+OpcodeInstrExt::OpcodeInstrExt(unsigned opcode_min, unsigned opcode_max, unsigned _tot_bits, unsigned _arg_bits,
+                               dump_instr_func_t dump, exec_instr_func_t exec, compute_instr_len_func_t comp_len)
+    : OpcodeInstr(opcode_min << (max_opcode_bits - _tot_bits), opcode_max << (max_opcode_bits - _tot_bits))
+    , opc_bits(static_cast<unsigned char>(_tot_bits - _arg_bits))
+    , tot_bits(static_cast<unsigned char>(_tot_bits))
+    , dump_instr(dump)
+    , exec_instr(exec)
+    , compute_instr_len(comp_len) {
+  assert(_arg_bits <= _tot_bits && _tot_bits <= max_opcode_bits);
+  assert(opcode_min < opcode_max && opcode_max <= (1U << _tot_bits));
+}
+
+int OpcodeInstrExt::dispatch(VmState* st, CellSlice& cs, unsigned opcode, unsigned bits) const {
+  st->consume_gas(gas_per_instr + tot_bits * gas_per_bit);
+  if (bits < tot_bits) {
+    throw VmError{Excno::inv_opcode, "invalid or too short opcode", opcode + (bits << max_opcode_bits)};
+  }
+  return exec_instr(st, cs, opcode >> (max_opcode_bits - tot_bits), tot_bits);
+}
+
+std::string OpcodeInstrExt::dump(CellSlice& cs, unsigned opcode, unsigned bits) const {
+  if (bits < tot_bits) {
+    return "";
+  }
+  return dump_instr(cs, opcode >> (max_opcode_bits - tot_bits), (int)tot_bits);
+}
+
+int OpcodeInstrExt::instr_len(const CellSlice& cs, unsigned opcode, unsigned bits) const {
+  if (bits < tot_bits) {
+    return 0;
+  } else {
+    return compute_instr_len(cs, opcode >> (max_opcode_bits - tot_bits), (int)tot_bits);
+  }
+}
+
+/*
+OpcodeInstr* OpcodeInstr::mksimple(unsigned opcode, unsigned opc_bits, std::string _name, exec_instr_func_t exec) {
+  return new OpcodeInstrSimple(opcode, opc_bits, _name, exec);
+}
+*/
+
+OpcodeInstr* OpcodeInstr::mksimple(unsigned opcode, unsigned opc_bits, std::string _name,
+                                   exec_simple_instr_func_t exec) {
+  return new OpcodeInstrSimplest(opcode, opc_bits, _name, exec);
+}
+
+OpcodeInstr* OpcodeInstr::mkfixed(unsigned opcode, unsigned opc_bits, unsigned arg_bits, dump_arg_instr_func_t dump,
+                                  exec_arg_instr_func_t exec) {
+  return new OpcodeInstrFixed(opcode, opc_bits, arg_bits, dump, exec);
+}
+
+OpcodeInstr* OpcodeInstr::mkfixedrange(unsigned opcode_min, unsigned opcode_max, unsigned tot_bits, unsigned arg_bits,
+                                       dump_arg_instr_func_t dump, exec_arg_instr_func_t exec) {
+  return new OpcodeInstrFixed(opcode_min, opcode_max, tot_bits, arg_bits, dump, exec);
+}
+
+OpcodeInstr* OpcodeInstr::mkext(unsigned opcode, unsigned opc_bits, unsigned arg_bits, dump_instr_func_t dump,
+                                exec_instr_func_t exec, compute_instr_len_func_t comp_len) {
+  return new OpcodeInstrExt(opcode, opc_bits, arg_bits, dump, exec, comp_len);
+}
+
+OpcodeInstr* OpcodeInstr::mkextrange(unsigned opcode_min, unsigned opcode_max, unsigned tot_bits, unsigned arg_bits,
+                                     dump_instr_func_t dump, exec_instr_func_t exec,
+                                     compute_instr_len_func_t comp_len) {
+  return new OpcodeInstrExt(opcode_min, opcode_max, tot_bits, arg_bits, dump, exec, comp_len);
+}
+
+namespace instr {
+
+using namespace std::placeholders;
+
+dump_arg_instr_func_t dump_1sr(std::string prefix, std::string suffix) {
+  return [prefix, suffix](CellSlice&, unsigned args) -> std::string {
+    std::ostringstream os{prefix};
+    os << 's' << (args & 15) << suffix;
+    return os.str();
+  };
+}
+
+dump_arg_instr_func_t dump_1sr_l(std::string prefix, std::string suffix) {
+  return [prefix, suffix](CellSlice&, unsigned args) -> std::string {
+    std::ostringstream os{prefix};
+    os << 's' << (args & 255) << suffix;
+    return os.str();
+  };
+}
+
+dump_arg_instr_func_t dump_2sr(std::string prefix, std::string suffix) {
+  return [prefix, suffix](CellSlice&, unsigned args) -> std::string {
+    std::ostringstream os{prefix};
+    os << 's' << ((args >> 4) & 15) << ",s" << (args & 15) << suffix;
+    return os.str();
+  };
+}
+
+dump_arg_instr_func_t dump_2sr_adj(unsigned adj, std::string prefix, std::string suffix) {
+  return [adj, prefix, suffix](CellSlice&, unsigned args) -> std::string {
+    std::ostringstream os{prefix};
+    os << 's' << (int)((args >> 4) & 15) - (int)((adj >> 4) & 15) << ",s" << (int)(args & 15) - (int)(adj & 15)
+       << suffix;
+    return os.str();
+  };
+}
+
+dump_arg_instr_func_t dump_3sr(std::string prefix, std::string suffix) {
+  return [prefix, suffix](CellSlice&, unsigned args) -> std::string {
+    std::ostringstream os{prefix};
+    os << 's' << ((args >> 8) & 15) << ",s" << ((args >> 4) & 15) << ",s" << (args & 15) << suffix;
+    return os.str();
+  };
+}
+
+dump_arg_instr_func_t dump_3sr_adj(unsigned adj, std::string prefix, std::string suffix) {
+  return [adj, prefix, suffix](CellSlice&, unsigned args) -> std::string {
+    std::ostringstream os{prefix};
+    os << 's' << (int)((args >> 8) & 15) - (int)((adj >> 8) & 15) << ",s"
+       << (int)((args >> 4) & 15) - (int)((adj >> 4) & 15) << ",s" << (int)(args & 15) - (int)(adj & 15) << suffix;
+    return os.str();
+  };
+}
+
+dump_arg_instr_func_t dump_1c(std::string prefix, std::string suffix) {
+  return [prefix, suffix](CellSlice&, unsigned args) -> std::string {
+    std::ostringstream os{prefix};
+    os << (args & 15) << suffix;
+    return os.str();
+  };
+}
+
+dump_arg_instr_func_t dump_1c_l_add(int adj, std::string prefix, std::string suffix) {
+  return [adj, prefix, suffix](CellSlice&, unsigned args) -> std::string {
+    std::ostringstream os{prefix};
+    os << (int)(args & 255) + adj << suffix;
+    return os.str();
+  };
+}
+
+dump_arg_instr_func_t dump_1c_and(unsigned mask, std::string prefix, std::string suffix) {
+  return [mask, prefix, suffix](CellSlice&, unsigned args) -> std::string {
+    std::ostringstream os{prefix};
+    os << (args & mask) << suffix;
+    return os.str();
+  };
+}
+
+dump_arg_instr_func_t dump_2c(std::string prefix, std::string interfix, std::string suffix) {
+  return [prefix, interfix, suffix](CellSlice&, unsigned args) -> std::string {
+    std::ostringstream os{prefix};
+    os << ((args >> 4) & 15) << interfix << (args & 15) << suffix;
+    return os.str();
+  };
+}
+
+dump_arg_instr_func_t dump_2c_add(unsigned add, std::string prefix, std::string interfix, std::string suffix) {
+  return [add, prefix, interfix, suffix](CellSlice&, unsigned args) -> std::string {
+    std::ostringstream os{prefix};
+    os << ((args >> 4) & 15) + ((add >> 4) & 15) << interfix << (args & 15) + (add & 15) << suffix;
+    return os.str();
+  };
+}
+
+}  // namespace instr
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/opctable.h b/submodules/ton/tonlib-src/crypto/vm/opctable.h
new file mode 100644
index 0000000000..d441fd7801
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/opctable.h
@@ -0,0 +1,191 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/dispatch.h"
+#include <functional>
+#include <utility>
+#include <vector>
+#include <map>
+
+namespace vm {
+
+typedef std::function<int(const CellSlice&, unsigned, int)> compute_instr_len_func_t;
+//typedef std::function<int(unsigned, int)> compute_arg_instr_len_func_t;
+typedef std::function<std::string(CellSlice&, unsigned, int)> dump_instr_func_t;
+typedef std::function<std::string(CellSlice&, unsigned)> dump_arg_instr_func_t;
+typedef std::function<int(VmState* st, CellSlice&, unsigned, int)> exec_instr_func_t;
+typedef std::function<int(VmState* st, unsigned)> exec_arg_instr_func_t;
+typedef std::function<int(VmState* st)> exec_simple_instr_func_t;
+
+enum { max_opcode_bits = 24 };
+const unsigned top_opcode = (1U << max_opcode_bits);
+
+class OpcodeInstr {
+  unsigned min_opcode, max_opcode;
+
+ public:
+  static constexpr unsigned gas_per_instr = 10, gas_per_bit = 1;
+  virtual ~OpcodeInstr() = default;
+  virtual int dispatch(VmState* st, CellSlice& cs, unsigned opcode, unsigned bits) const = 0;
+  virtual std::string dump(CellSlice& cs, unsigned opcode, unsigned bits) const;
+  virtual int instr_len(const CellSlice& cs, unsigned opcode, unsigned bits) const;
+  OpcodeInstr(unsigned _min, unsigned _max) : min_opcode(_min), max_opcode(_max) {
+  }
+  OpcodeInstr(unsigned _opcode, unsigned _bits, bool);
+  unsigned get_opcode_min() const {
+    return min_opcode;
+  }
+  unsigned get_opcode_max() const {
+    return max_opcode;
+  }
+  std::pair<unsigned, unsigned> get_opcode_range() const {
+    return {min_opcode, max_opcode};
+  }
+  //static OpcodeInstr* mksimple(unsigned opcode, unsigned opc_bits, std::string _name, exec_instr_func_t exec);
+  static OpcodeInstr* mksimple(unsigned opcode, unsigned opc_bits, std::string _name, exec_simple_instr_func_t exec);
+  static OpcodeInstr* mkfixed(unsigned opcode, unsigned opc_bits, unsigned arg_bits, dump_arg_instr_func_t dump,
+                              exec_arg_instr_func_t exec);
+  static OpcodeInstr* mkfixedrange(unsigned opcode_min, unsigned opcode_max, unsigned tot_bits, unsigned arg_bits,
+                                   dump_arg_instr_func_t dump, exec_arg_instr_func_t exec);
+  static OpcodeInstr* mkext(unsigned opcode, unsigned opc_bits, unsigned arg_bits, dump_instr_func_t dump,
+                            exec_instr_func_t exec, compute_instr_len_func_t comp_len);
+  static OpcodeInstr* mkextrange(unsigned opcode_min, unsigned opcode_max, unsigned tot_bits, unsigned arg_bits,
+                                 dump_instr_func_t dump, exec_instr_func_t exec, compute_instr_len_func_t comp_len);
+};
+
+namespace instr {
+
+dump_arg_instr_func_t dump_1sr(std::string prefix, std::string suffix = "");
+dump_arg_instr_func_t dump_1sr_l(std::string prefix, std::string suffix = "");
+dump_arg_instr_func_t dump_2sr(std::string prefix, std::string suffix = "");
+dump_arg_instr_func_t dump_2sr_adj(unsigned adj, std::string prefix, std::string suffix = "");
+dump_arg_instr_func_t dump_3sr(std::string prefix, std::string suffix = "");
+dump_arg_instr_func_t dump_3sr_adj(unsigned adj, std::string prefix, std::string suffix = "");
+dump_arg_instr_func_t dump_1c(std::string prefix, std::string suffix = "");
+dump_arg_instr_func_t dump_1c_l_add(int adj, std::string prefix, std::string suffix = "");
+dump_arg_instr_func_t dump_1c_and(unsigned mask, std::string prefix, std::string suffix = "");
+dump_arg_instr_func_t dump_2c(std::string prefix, std::string interfix, std::string suffix = "");
+dump_arg_instr_func_t dump_2c_add(unsigned add, std::string prefix, std::string interfix, std::string suffix = "");
+
+}  // namespace instr
+
+class OpcodeTable : public DispatchTable {
+  std::map<unsigned, const OpcodeInstr*> instructions;
+  std::vector<std::pair<unsigned, const OpcodeInstr*>> instruction_list;
+  std::string name;
+  Codepage codepage;
+  bool final;
+
+ public:
+  OpcodeTable(std::string _name, Codepage cp) : name(_name), codepage(cp), final(false) {
+  }
+  OpcodeTable(const OpcodeTable&) = delete;
+  OpcodeTable(OpcodeTable&&) = delete;
+  OpcodeTable& operator=(const OpcodeTable&) = delete;
+  OpcodeTable& operator=(OpcodeTable&&) = delete;
+  ~OpcodeTable() override = default;
+  DispatchTable* finalize() override;
+  bool is_final() const override {
+    return final;
+  }
+  int dispatch(VmState* st, CellSlice& cs) const override;
+  std::string dump_instr(CellSlice& cs) const override;
+  int instr_len(const CellSlice& cs) const override;
+  bool insert_bool(const OpcodeInstr*);
+  OpcodeTable& insert(const OpcodeInstr*);
+
+ private:
+  const OpcodeInstr* lookup_instr(unsigned opcode, unsigned bits) const;
+  const OpcodeInstr* lookup_instr(const CellSlice& cs, unsigned& opcode, unsigned& bits) const;
+};
+
+class OpcodeInstrDummy : public OpcodeInstr {
+ public:
+  OpcodeInstrDummy() = delete;
+  OpcodeInstrDummy(unsigned _minopc, unsigned _maxopc) : OpcodeInstr(_minopc, _maxopc) {
+  }
+  ~OpcodeInstrDummy() override = default;
+  int dispatch(VmState* st, CellSlice& cs, unsigned opcode, unsigned bits) const override;
+};
+
+class OpcodeInstrSimple : public OpcodeInstr {
+  unsigned char opc_bits;
+  std::string name;
+  exec_instr_func_t exec_instr;
+
+ public:
+  OpcodeInstrSimple() = delete;
+  OpcodeInstrSimple(unsigned opcode, unsigned _opc_bits, std::string _name, exec_instr_func_t exec);
+  ~OpcodeInstrSimple() override = default;
+  int dispatch(VmState* st, CellSlice& cs, unsigned opcode, unsigned bits) const override;
+  std::string dump(CellSlice& cs, unsigned opcode, unsigned bits) const override;
+  int instr_len(const CellSlice& cs, unsigned opcode, unsigned bits) const override;
+};
+
+class OpcodeInstrSimplest : public OpcodeInstr {
+  unsigned char opc_bits;
+  std::string name;
+  exec_simple_instr_func_t exec_instr;
+
+ public:
+  OpcodeInstrSimplest() = delete;
+  OpcodeInstrSimplest(unsigned opcode, unsigned _opc_bits, std::string _name, exec_simple_instr_func_t exec);
+  ~OpcodeInstrSimplest() override = default;
+  int dispatch(VmState* st, CellSlice& cs, unsigned opcode, unsigned bits) const override;
+  std::string dump(CellSlice& cs, unsigned opcode, unsigned bits) const override;
+  int instr_len(const CellSlice& cs, unsigned opcode, unsigned bits) const override;
+};
+
+class OpcodeInstrFixed : public OpcodeInstr {
+  unsigned char opc_bits, tot_bits;
+  std::string name;
+  dump_arg_instr_func_t dump_instr;
+  exec_arg_instr_func_t exec_instr;
+
+ public:
+  OpcodeInstrFixed() = delete;
+  OpcodeInstrFixed(unsigned opcode, unsigned _opc_bits, unsigned _arg_bits, dump_arg_instr_func_t dump,
+                   exec_arg_instr_func_t exec);
+  OpcodeInstrFixed(unsigned opcode_min, unsigned opcode_max, unsigned _tot_bits, unsigned _arg_bits,
+                   dump_arg_instr_func_t dump, exec_arg_instr_func_t exec);
+  ~OpcodeInstrFixed() override = default;
+  int dispatch(VmState* st, CellSlice& cs, unsigned opcode, unsigned bits) const override;
+  std::string dump(CellSlice& cs, unsigned opcode, unsigned bits) const override;
+  int instr_len(const CellSlice& cs, unsigned opcode, unsigned bits) const override;
+};
+
+class OpcodeInstrExt : public OpcodeInstr {
+  unsigned char opc_bits, tot_bits;
+  dump_instr_func_t dump_instr;
+  exec_instr_func_t exec_instr;
+  compute_instr_len_func_t compute_instr_len;
+
+ public:
+  OpcodeInstrExt() = delete;
+  OpcodeInstrExt(unsigned opcode, unsigned _opc_bits, unsigned _arg_bits, dump_instr_func_t dump,
+                 exec_instr_func_t exec, compute_instr_len_func_t comp_len);
+  OpcodeInstrExt(unsigned opcode_min, unsigned opcode_max, unsigned _tot_bits, unsigned _arg_bits,
+                 dump_instr_func_t dump, exec_instr_func_t exec, compute_instr_len_func_t comp_len);
+  ~OpcodeInstrExt() override = default;
+  int dispatch(VmState* st, CellSlice& cs, unsigned opcode, unsigned bits) const override;
+  std::string dump(CellSlice& cs, unsigned opcode, unsigned bits) const override;
+  int instr_len(const CellSlice& cs, unsigned opcode, unsigned bits) const override;
+};
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/stack.cpp b/submodules/ton/tonlib-src/crypto/vm/stack.cpp
new file mode 100644
index 0000000000..0b63aec9cc
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/stack.cpp
@@ -0,0 +1,632 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/stack.hpp"
+#include "vm/continuation.h"
+#include "vm/box.hpp"
+#include "vm/atom.h"
+
+namespace td {
+template class td::Cnt<std::string>;
+template class td::Ref<td::Cnt<std::string>>;
+template class td::Cnt<std::vector<vm::StackEntry>>;
+template class td::Ref<td::Cnt<std::vector<vm::StackEntry>>>;
+}  // namespace td
+
+namespace vm {
+
+// from_object_t from_object{};
+
+const char* exception_messages[(int)(Excno::total)] = {
+    "normal termination",   "alternative termination", "stack underflow",  "stack overflow", "integer overflow",
+    "integer out of range", "invalid opcode",          "type check error", "cell overflow",  "cell underflow",
+    "dictionary error",     "unknown error",           "fatal error"};
+
+const char* get_exception_msg(Excno exc_no) {
+  if (exc_no >= Excno::none && exc_no < Excno::total) {
+    return exception_messages[static_cast<int>(exc_no)];
+  } else {
+    return "unknown vm exception";
+  }
+}
+
+static const char HEX_digits[] = "0123456789ABCDEF";
+
+std::string str_to_hex(std::string data, std::string prefix) {
+  prefix.reserve(prefix.size() + data.size() * 2);
+  for (char c : data) {
+    prefix += HEX_digits[(c >> 4) & 15];
+    prefix += HEX_digits[c & 15];
+  }
+  return prefix;
+}
+
+std::string StackEntry::to_string() const {
+  std::ostringstream os;
+  dump(os);
+  return std::move(os).str();
+}
+
+void StackEntry::dump(std::ostream& os) const {
+  switch (tp) {
+    case t_null:
+      os << "(null)";
+      break;
+    case t_int:
+      os << dec_string(as_int());
+      break;
+    case t_cell:
+      os << "C{" << static_cast<Ref<Cell>>(ref)->get_hash().to_hex() << "}";
+      break;
+    case t_builder:
+      os << "BC{" << static_cast<Ref<CellBuilder>>(ref)->to_hex() << "}";
+      break;
+    case t_slice: {
+      os << "CS{";
+      static_cast<Ref<CellSlice>>(ref)->dump(os, 1, false);
+      os << '}';
+      break;
+    }
+    case t_string:
+      os << "\"" << as_string() << "\"";
+      break;
+    case t_bytes:
+      os << "BYTES:" << str_to_hex(as_bytes());
+      break;
+    case t_box: {
+      os << "Box{" << (const void*)&*ref << "}";
+      break;
+    }
+    case t_atom:
+      os << as_atom();
+      break;
+    case t_tuple: {
+      const auto& tuple = *static_cast<Ref<Tuple>>(ref);
+      auto n = tuple.size();
+      if (!n) {
+        os << "[]";
+      } else if (n == 1) {
+        os << "[ ";
+        tuple[0].dump(os);
+        os << " ]";
+      } else {
+        os << "[ ";
+        for (const auto& entry : tuple) {
+          entry.dump(os);
+          os << ' ';
+        }
+        os << ']';
+      }
+      break;
+    }
+    case t_object: {
+      os << "Object{" << (const void*)&*ref << "}";
+      break;
+    }
+    default:
+      os << "???";
+  }
+}
+
+void StackEntry::print_list(std::ostream& os) const {
+  switch (tp) {
+    case t_null:
+      os << "()";
+      break;
+    case t_tuple: {
+      const auto& tuple = *static_cast<Ref<Tuple>>(ref);
+      auto n = tuple.size();
+      if (!n) {
+        os << "[]";
+      } else if (n == 1) {
+        os << "[";
+        tuple[0].print_list(os);
+        os << "]";
+      } else if (n != 2) {
+        os << "[";
+        unsigned c = 0;
+        for (const auto& entry : tuple) {
+          if (c++) {
+            os << " ";
+          }
+          entry.print_list(os);
+        }
+        os << ']';
+      } else {
+        os << '(';
+        tuple[0].print_list(os);
+        tuple[1].print_list_tail(os);
+      }
+      break;
+    }
+    default:
+      dump(os);
+  }
+}
+
+void StackEntry::print_list_tail(std::ostream& os) const {
+  switch (tp) {
+    case t_null:
+      os << ')';
+      break;
+    case t_tuple: {
+      const auto& tuple = *static_cast<Ref<Tuple>>(ref);
+      if (tuple.size() == 2) {
+        os << ' ';
+        tuple[0].print_list(os);
+        tuple[1].print_list_tail(os);
+        break;
+      }
+    }
+    // fall through
+    default:
+      os << " . ";
+      print_list(os);
+      os << ')';
+  }
+}
+
+StackEntry::StackEntry(Ref<Stack> stack_ref) : ref(std::move(stack_ref)), tp(t_stack) {
+}
+
+StackEntry::StackEntry(Ref<Continuation> cont_ref) : ref(std::move(cont_ref)), tp(t_vmcont) {
+}
+
+Ref<Continuation> StackEntry::as_cont() const & {
+  return as<Continuation, t_vmcont>();
+}
+
+Ref<Continuation> StackEntry::as_cont() && {
+  return move_as<Continuation, t_vmcont>();
+}
+
+StackEntry::StackEntry(Ref<Box> box_ref) : ref(std::move(box_ref)), tp(t_box) {
+}
+
+Ref<Box> StackEntry::as_box() const & {
+  return as<Box, t_box>();
+}
+
+Ref<Box> StackEntry::as_box() && {
+  return move_as<Box, t_box>();
+}
+
+StackEntry::StackEntry(Ref<Tuple> tuple_ref) : ref(std::move(tuple_ref)), tp(t_tuple) {
+}
+
+StackEntry::StackEntry(const std::vector<StackEntry>& tuple_components)
+    : ref(Ref<Tuple>{true, tuple_components}), tp(t_tuple) {
+}
+
+StackEntry::StackEntry(std::vector<StackEntry>&& tuple_components)
+    : ref(Ref<Tuple>{true, std::move(tuple_components)}), tp(t_tuple) {
+}
+
+Ref<Tuple> StackEntry::as_tuple() const & {
+  return as<Tuple, t_tuple>();
+}
+
+Ref<Tuple> StackEntry::as_tuple() && {
+  return move_as<Tuple, t_tuple>();
+}
+
+Ref<Tuple> StackEntry::as_tuple_range(unsigned max_len, unsigned min_len) const & {
+  auto t = as<Tuple, t_tuple>();
+  if (t.not_null() && t->size() <= max_len && t->size() >= min_len) {
+    return t;
+  } else {
+    return {};
+  }
+}
+
+Ref<Tuple> StackEntry::as_tuple_range(unsigned max_len, unsigned min_len) && {
+  auto t = move_as<Tuple, t_tuple>();
+  if (t.not_null() && t->size() <= max_len && t->size() >= min_len) {
+    return t;
+  } else {
+    return {};
+  }
+}
+
+StackEntry::StackEntry(Ref<Atom> atom_ref) : ref(std::move(atom_ref)), tp(t_atom) {
+}
+
+Ref<Atom> StackEntry::as_atom() const & {
+  return as<Atom, t_atom>();
+}
+
+Ref<Atom> StackEntry::as_atom() && {
+  return move_as<Atom, t_atom>();
+}
+
+const StackEntry& tuple_index(const Tuple& tup, unsigned idx) {
+  if (idx >= tup->size()) {
+    throw VmError{Excno::range_chk, "tuple index out of range"};
+  }
+  return (*tup)[idx];
+}
+
+StackEntry tuple_extend_index(const Ref<Tuple>& tup, unsigned idx) {
+  if (tup.is_null() || idx >= tup->size()) {
+    return {};
+  } else {
+    return tup->at(idx);
+  }
+}
+
+unsigned tuple_extend_set_index(Ref<Tuple>& tup, unsigned idx, StackEntry&& value, bool force) {
+  if (tup.is_null()) {
+    if (value.empty() && !force) {
+      return 0;
+    }
+    tup = Ref<Tuple>{true, idx + 1};
+    tup.unique_write().at(idx) = std::move(value);
+    return idx + 1;
+  }
+  if (tup->size() <= idx) {
+    if (value.empty() && !force) {
+      return 0;
+    }
+    auto& tuple = tup.write();
+    tuple.resize(idx + 1);
+    tuple.at(idx) = std::move(value);
+    return idx + 1;
+  } else {
+    tup.write().at(idx) = std::move(value);
+    return (unsigned)tup->size();
+  }
+}
+
+Stack::Stack(const Stack& old_stack, unsigned copy_elem, unsigned skip_top) {
+  push_from_stack(old_stack, copy_elem, skip_top);
+}
+
+Stack::Stack(Stack&& old_stack, unsigned copy_elem, unsigned skip_top) {
+  push_from_stack(old_stack, copy_elem, skip_top);
+}
+
+void Stack::push_from_stack(const Stack& old_stack, unsigned copy_elem, unsigned skip_top) {
+  unsigned n = old_stack.depth();
+  if (skip_top > n || copy_elem > n - skip_top) {
+    throw VmError{Excno::stk_und, "cannot construct stack from another one: not enough elements"};
+  }
+  stack.reserve(stack.size() + copy_elem);
+  auto it = old_stack.stack.cend() - skip_top;
+  std::copy(it - copy_elem, it, std::back_inserter(stack));
+}
+
+void Stack::push_from_stack(Stack&& old_stack, unsigned copy_elem, unsigned skip_top) {
+  unsigned n = old_stack.depth();
+  if (skip_top > n || copy_elem > n - skip_top) {
+    throw VmError{Excno::stk_und, "cannot construct stack from another one: not enough elements"};
+  }
+  stack.reserve(stack.size() + copy_elem);
+  auto it = old_stack.stack.cend() - skip_top;
+  std::move(it - copy_elem, it, std::back_inserter(stack));
+}
+
+void Stack::move_from_stack(Stack& old_stack, unsigned copy_elem) {
+  unsigned n = old_stack.depth();
+  if (copy_elem > n) {
+    throw VmError{Excno::stk_und, "cannot construct stack from another one: not enough elements"};
+  }
+  LOG(DEBUG) << "moving " << copy_elem << " top elements to another stack\n";
+  stack.reserve(stack.size() + copy_elem);
+  auto it = old_stack.stack.cend();
+  std::move(it - copy_elem, it, std::back_inserter(stack));
+  old_stack.pop_many(copy_elem);
+}
+
+void Stack::pop_null() {
+  check_underflow(1);
+  if (!pop().empty()) {
+    throw VmError{Excno::type_chk, "not an null"};
+  }
+}
+
+td::RefInt256 Stack::pop_int() {
+  check_underflow(1);
+  td::RefInt256 res = pop().as_int();
+  if (res.is_null()) {
+    throw VmError{Excno::type_chk, "not an integer"};
+  }
+  return res;
+}
+
+td::RefInt256 Stack::pop_int_finite() {
+  auto res = pop_int();
+  if (!res->is_valid()) {
+    throw VmError{Excno::int_ov};
+  }
+  return res;
+}
+
+bool Stack::pop_bool() {
+  return sgn(pop_int_finite()) != 0;
+}
+
+long long Stack::pop_long() {
+  return pop_int()->to_long();
+}
+
+long long Stack::pop_long_range(long long max, long long min) {
+  auto res = pop_long();
+  if (res > max || res < min) {
+    throw VmError{Excno::range_chk};
+  }
+  return res;
+}
+
+int Stack::pop_smallint_range(int max, int min) {
+  return (int)pop_long_range(max, min);
+}
+
+Ref<Cell> Stack::pop_cell() {
+  check_underflow(1);
+  auto res = pop().as_cell();
+  if (res.is_null()) {
+    throw VmError{Excno::type_chk, "not a cell"};
+  }
+  return res;
+}
+
+Ref<Cell> Stack::pop_maybe_cell() {
+  check_underflow(1);
+  auto tmp = pop();
+  if (tmp.empty()) {
+    return {};
+  }
+  auto res = std::move(tmp).as_cell();
+  if (res.is_null()) {
+    throw VmError{Excno::type_chk, "not a cell"};
+  }
+  return res;
+}
+
+Ref<CellBuilder> Stack::pop_builder() {
+  check_underflow(1);
+  auto res = pop().as_builder();
+  if (res.is_null()) {
+    throw VmError{Excno::type_chk, "not a cell builder"};
+  }
+  return res;
+}
+
+Ref<CellSlice> Stack::pop_cellslice() {
+  check_underflow(1);
+  auto res = pop().as_slice();
+  if (res.is_null()) {
+    throw VmError{Excno::type_chk, "not a cell slice"};
+  }
+  return res;
+}
+
+std::string Stack::pop_string() {
+  check_underflow(1);
+  auto res = pop().as_string_ref();
+  if (res.is_null()) {
+    throw VmError{Excno::type_chk, "not a string"};
+  }
+  return *res;
+}
+
+std::string Stack::pop_bytes() {
+  check_underflow(1);
+  auto res = pop().as_bytes_ref();
+  if (res.is_null()) {
+    throw VmError{Excno::type_chk, "not a bytes chunk"};
+  }
+  return *res;
+}
+
+Ref<Continuation> Stack::pop_cont() {
+  check_underflow(1);
+  auto res = pop().as_cont();
+  if (res.is_null()) {
+    throw VmError{Excno::type_chk, "not a continuation"};
+  }
+  return res;
+}
+
+Ref<Box> Stack::pop_box() {
+  check_underflow(1);
+  auto res = pop().as_box();
+  if (res.is_null()) {
+    throw VmError{Excno::type_chk, "not a box"};
+  }
+  return res;
+}
+
+Ref<Tuple> Stack::pop_tuple() {
+  check_underflow(1);
+  auto res = pop().as_tuple();
+  if (res.is_null()) {
+    throw VmError{Excno::type_chk, "not a tuple"};
+  }
+  return res;
+}
+
+Ref<Tuple> Stack::pop_tuple_range(unsigned max_len, unsigned min_len) {
+  check_underflow(1);
+  auto res = pop().as_tuple();
+  if (res.is_null() || res->size() > max_len || res->size() < min_len) {
+    throw VmError{Excno::type_chk, "not a tuple of valid size"};
+  }
+  return res;
+}
+
+Ref<Tuple> Stack::pop_maybe_tuple() {
+  check_underflow(1);
+  auto val = pop();
+  if (val.empty()) {
+    return {};
+  }
+  auto res = std::move(val).as_tuple();
+  if (res.is_null()) {
+    throw VmError{Excno::type_chk, "not a tuple"};
+  }
+  return res;
+}
+
+Ref<Tuple> Stack::pop_maybe_tuple_range(unsigned max_len) {
+  check_underflow(1);
+  auto val = pop();
+  if (val.empty()) {
+    return {};
+  }
+  auto res = std::move(val).as_tuple();
+  if (res.is_null() || res->size() > max_len) {
+    throw VmError{Excno::type_chk, "not a tuple of valid size"};
+  }
+  return res;
+}
+
+Ref<Atom> Stack::pop_atom() {
+  check_underflow(1);
+  auto res = pop().as_atom();
+  if (res.is_null()) {
+    throw VmError{Excno::type_chk, "not an atom"};
+  }
+  return res;
+}
+
+void Stack::push_null() {
+  push({});
+}
+
+void Stack::push_int(td::RefInt256 val) {
+  if (!val->signed_fits_bits(257)) {
+    throw VmError{Excno::int_ov};
+  }
+  push(std::move(val));
+}
+
+void Stack::push_int_quiet(td::RefInt256 val, bool quiet) {
+  if (!val->signed_fits_bits(257)) {
+    if (!quiet) {
+      throw VmError{Excno::int_ov};
+    } else if (val->is_valid()) {
+      push(td::RefInt256{true});
+      return;
+    }
+  }
+  push(std::move(val));
+}
+
+void Stack::push_string(std::string str) {
+  push(std::move(str));
+}
+
+void Stack::push_string(td::Slice slice) {
+  push(slice.str());
+}
+
+void Stack::push_bytes(std::string str) {
+  push(std::move(str), true);
+}
+
+void Stack::push_bytes(td::Slice slice) {
+  push(slice.str(), true);
+}
+
+void Stack::push_cell(Ref<Cell> cell) {
+  push(std::move(cell));
+}
+
+void Stack::push_maybe_cell(Ref<Cell> cell) {
+  push_maybe(std::move(cell));
+}
+
+void Stack::push_builder(Ref<CellBuilder> cb) {
+  push(std::move(cb));
+}
+
+void Stack::push_smallint(long long val) {
+  push(td::RefInt256{true, val});
+}
+
+void Stack::push_bool(bool val) {
+  push_smallint(val ? -1 : 0);
+}
+
+void Stack::push_cont(Ref<Continuation> cont) {
+  push(std::move(cont));
+}
+
+void Stack::push_box(Ref<Box> box) {
+  push(std::move(box));
+}
+
+void Stack::push_tuple(Ref<Tuple> tuple) {
+  push(std::move(tuple));
+}
+
+void Stack::push_maybe_tuple(Ref<Tuple> tuple) {
+  if (tuple.not_null()) {
+    push(std::move(tuple));
+  } else {
+    push_null();
+  }
+}
+
+void Stack::push_tuple(const std::vector<StackEntry>& components) {
+  push(components);
+}
+
+void Stack::push_tuple(std::vector<StackEntry>&& components) {
+  push(std::move(components));
+}
+
+void Stack::push_atom(Ref<Atom> atom) {
+  push(std::move(atom));
+}
+
+Ref<Stack> Stack::split_top(unsigned top_cnt, unsigned drop_cnt) {
+  unsigned n = depth();
+  if (top_cnt > n || drop_cnt > n - top_cnt) {
+    return Ref<Stack>{};
+  }
+  Ref<Stack> new_stk = Ref<Stack>{true};
+  if (top_cnt) {
+    new_stk.unique_write().move_from_stack(*this, top_cnt);
+  }
+  if (drop_cnt) {
+    pop_many(drop_cnt);
+  }
+  return new_stk;
+}
+
+void Stack::dump(std::ostream& os, bool cr) const {
+  os << " [ ";
+  for (const auto& x : stack) {
+    os << x.to_string() << ' ';
+  }
+  os << "] ";
+  if (cr) {
+    os << std::endl;
+  }
+}
+void Stack::push_cellslice(Ref<CellSlice> cs) {
+  push(std::move(cs));
+}
+
+void Stack::push_maybe_cellslice(Ref<CellSlice> cs) {
+  push_maybe(std::move(cs));
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/stack.hpp b/submodules/ton/tonlib-src/crypto/vm/stack.hpp
new file mode 100644
index 0000000000..c87bd4d937
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/stack.hpp
@@ -0,0 +1,496 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <cassert>
+#include <algorithm>
+#include <string>
+#include <vector>
+#include <iostream>
+#include <sstream>
+#include <memory>
+#include "common/refcnt.hpp"
+#include "common/bigint.hpp"
+#include "common/refint.h"
+#include "common/bitstring.h"
+#include "vm/cells.h"
+#include "vm/cellslice.h"
+#include "vm/excno.hpp"
+
+namespace td {
+extern template class td::Cnt<std::string>;
+extern template class td::Ref<td::Cnt<std::string>>;
+}  // namespace td
+
+namespace vm {
+
+using td::Cnt;
+using td::Ref;
+using td::RefAny;
+
+const char* get_exception_msg(Excno exc_no);
+std::string str_to_hex(std::string data, std::string prefix = "");
+
+class StackEntry;
+class Stack;
+class Continuation;
+class Box;
+class Atom;
+
+using Tuple = td::Cnt<std::vector<StackEntry>>;
+
+struct from_object_t {};
+constexpr from_object_t from_object{};
+
+class StackEntry {
+ public:
+  enum Type {
+    t_null,
+    t_int,
+    t_cell,
+    t_builder,
+    t_slice,
+    t_vmcont,
+    t_tuple,
+    t_stack,
+    t_string,
+    t_bytes,
+    t_bitstring,
+    t_box,
+    t_atom,
+    t_object
+  };
+
+ private:
+  RefAny ref;
+  Type tp;
+
+ public:
+  StackEntry() : ref(), tp(t_null) {
+  }
+  ~StackEntry() {
+  }
+  StackEntry(Ref<Cell> cell_ref) : ref(std::move(cell_ref)), tp(t_cell) {
+  }
+  StackEntry(Ref<CellBuilder> cb_ref) : ref(std::move(cb_ref)), tp(t_builder) {
+  }
+  StackEntry(Ref<CellSlice> cs_ref) : ref(std::move(cs_ref)), tp(t_slice) {
+  }
+  StackEntry(td::RefInt256 int_ref) : ref(std::move(int_ref)), tp(t_int) {
+  }
+  StackEntry(std::string str, bool bytes = false) : ref(), tp(bytes ? t_bytes : t_string) {
+    ref = Ref<Cnt<std::string>>{true, std::move(str)};
+  }
+  StackEntry(Ref<Stack> stack_ref);
+  StackEntry(Ref<Continuation> cont_ref);
+  StackEntry(Ref<Box> box_ref);
+  StackEntry(Ref<Tuple> tuple_ref);
+  StackEntry(const std::vector<StackEntry>& tuple_components);
+  StackEntry(std::vector<StackEntry>&& tuple_components);
+  StackEntry(Ref<Atom> atom_ref);
+  StackEntry(const StackEntry& se) : ref(se.ref), tp(se.tp) {
+  }
+  StackEntry(StackEntry&& se) noexcept : ref(std::move(se.ref)), tp(se.tp) {
+    se.tp = t_null;
+  }
+  template <class T>
+  StackEntry(from_object_t, Ref<T> obj_ref) : ref(std::move(obj_ref)), tp(t_object) {
+  }
+  StackEntry& operator=(const StackEntry& se) {
+    ref = se.ref;
+    tp = se.tp;
+    return *this;
+  }
+  StackEntry& operator=(StackEntry&& se) {
+    ref = std::move(se.ref);
+    tp = se.tp;
+    se.tp = t_null;
+    return *this;
+  }
+  StackEntry& clear() {
+    ref.clear();
+    tp = t_null;
+    return *this;
+  }
+  bool empty() const {
+    return tp == t_null;
+  }
+  bool is_tuple() const {
+    return tp == t_tuple;
+  }
+  bool is_atom() const {
+    return tp == t_atom;
+  }
+  bool is(int wanted) const {
+    return tp == wanted;
+  }
+  void swap(StackEntry& se) {
+    ref.swap(se.ref);
+    std::swap(tp, se.tp);
+  }
+  bool operator==(const StackEntry& other) const {
+    return tp == other.tp && ref == other.ref;
+  }
+  bool operator!=(const StackEntry& other) const {
+    return !(tp == other.tp && ref == other.ref);
+  }
+  Type type() const {
+    return tp;
+  }
+
+ private:
+  template <typename T, Type tag>
+  Ref<T> dynamic_as() const & {
+    return tp == tag ? static_cast<Ref<T>>(ref) : td::Ref<T>{};
+  }
+  template <typename T, Type tag>
+  Ref<T> dynamic_as() && {
+    return tp == tag ? static_cast<Ref<T>>(std::move(ref)) : td::Ref<T>{};
+  }
+  template <typename T, Type tag>
+  Ref<T> dynamic_move_as() & {
+    return tp == tag ? static_cast<Ref<T>>(std::move(ref)) : td::Ref<T>{};
+  }
+  template <typename T, Type tag>
+  Ref<T> as() const & {
+    return tp == tag ? Ref<T>{td::static_cast_ref(), ref} : td::Ref<T>{};
+  }
+  template <typename T, Type tag>
+  Ref<T> as() && {
+    return tp == tag ? Ref<T>{td::static_cast_ref(), std::move(ref)} : td::Ref<T>{};
+  }
+  template <typename T, Type tag>
+  Ref<T> move_as() & {
+    return tp == tag ? Ref<T>{td::static_cast_ref(), std::move(ref)} : td::Ref<T>{};
+  }
+
+ public:
+  template <typename T>
+  static StackEntry maybe(Ref<T> ref) {
+    if (ref.is_null()) {
+      return {};
+    } else {
+      return ref;
+    }
+  }
+  td::RefInt256 as_int() const & {
+    return as<td::CntInt256, t_int>();
+  }
+  td::RefInt256 as_int() && {
+    return move_as<td::CntInt256, t_int>();
+  }
+  Ref<Cell> as_cell() const & {
+    return as<Cell, t_cell>();
+  }
+  Ref<Cell> as_cell() && {
+    return move_as<Cell, t_cell>();
+  }
+  Ref<CellBuilder> as_builder() const & {
+    return as<CellBuilder, t_builder>();
+  }
+  Ref<CellBuilder> as_builder() && {
+    return move_as<CellBuilder, t_builder>();
+  }
+  Ref<CellSlice> as_slice() const & {
+    return as<CellSlice, t_slice>();
+  }
+  Ref<CellSlice> as_slice() && {
+    return move_as<CellSlice, t_slice>();
+  }
+  Ref<Continuation> as_cont() const &;
+  Ref<Continuation> as_cont() &&;
+  Ref<Cnt<std::string>> as_string_ref() const {
+    return as<Cnt<std::string>, t_string>();
+  }
+  Ref<Cnt<std::string>> as_bytes_ref() const {
+    return as<Cnt<std::string>, t_bytes>();
+  }
+  std::string as_string() const {
+    //assert(!as_string_ref().is_null());
+    return tp == t_string ? *as_string_ref() : "";
+  }
+  std::string as_bytes() const {
+    return tp == t_bytes ? *as_bytes_ref() : "";
+  }
+  Ref<Box> as_box() const &;
+  Ref<Box> as_box() &&;
+  Ref<Tuple> as_tuple() const &;
+  Ref<Tuple> as_tuple() &&;
+  Ref<Tuple> as_tuple_range(unsigned max_len = 255, unsigned min_len = 0) const &;
+  Ref<Tuple> as_tuple_range(unsigned max_len = 255, unsigned min_len = 0) &&;
+  Ref<Atom> as_atom() const &;
+  Ref<Atom> as_atom() &&;
+  template <class T>
+  Ref<T> as_object() const & {
+    return dynamic_as<T, t_object>();
+  }
+  template <class T>
+  Ref<T> as_object() && {
+    return dynamic_move_as<T, t_object>();
+  }
+  void dump(std::ostream& os) const;
+  void print_list(std::ostream& os) const;
+  void print_list_tail(std::ostream& os) const;
+  std::string to_string() const;
+};
+
+inline void swap(StackEntry& se1, StackEntry& se2) {
+  se1.swap(se2);
+}
+
+template <typename... Args>
+Ref<Tuple> make_tuple_ref(Args&&... args) {
+  return td::make_cnt_ref<std::vector<vm::StackEntry>>(std::vector<vm::StackEntry>{std::forward<Args>(args)...});
+}
+
+const StackEntry& tuple_index(const Tuple& tup, unsigned idx);
+StackEntry tuple_extend_index(const Ref<Tuple>& tup, unsigned idx);
+unsigned tuple_extend_set_index(Ref<Tuple>& tup, unsigned idx, StackEntry&& value, bool force = false);
+
+class Stack : public td::CntObject {
+  std::vector<StackEntry> stack;
+
+ public:
+  Stack() {
+  }
+  ~Stack() override = default;
+  Stack(const std::vector<StackEntry>& _stack) : stack(_stack) {
+  }
+  Stack(std::vector<StackEntry>&& _stack) : stack(std::move(_stack)) {
+  }
+  Stack(const Stack& old_stack, unsigned copy_elem, unsigned skip_top);
+  Stack(Stack&& old_stack, unsigned copy_elem, unsigned skip_top);
+  td::CntObject* make_copy() const override {
+    std::cerr << "copy stack at " << (const void*)this << " (" << depth() << " entries)\n";
+    return new Stack{stack};
+  }
+  void push_from_stack(const Stack& old_stack, unsigned copy_elem, unsigned skip_top = 0);
+  void push_from_stack(Stack&& old_stack, unsigned copy_elem, unsigned skip_top = 0);
+  void move_from_stack(Stack& old_stack, unsigned copy_elem);
+  Ref<Stack> split_top(unsigned top_cnt, unsigned drop_cnt = 0);
+
+  StackEntry& push() {
+    stack.emplace_back();
+    return stack.back();
+  }
+  template <typename... Args>
+  StackEntry& push(Args&&... args) {
+    stack.emplace_back(args...);
+    return stack.back();
+  }
+  StackEntry& push(const StackEntry& se) {
+    stack.push_back(se);
+    return stack.back();
+  }
+  StackEntry& push(StackEntry&& se) {
+    stack.emplace_back(std::move(se));
+    return stack.back();
+  }
+  void pop(StackEntry& se) {
+    stack.back().swap(se);
+    stack.pop_back();
+  }
+  StackEntry pop() {
+    StackEntry res = std::move(stack.back());
+    stack.pop_back();
+    return res;
+  }
+  StackEntry pop_chk() {
+    check_underflow(1);
+    return pop();
+  }
+  void pop_many(int count) {
+    stack.resize(stack.size() - count);
+  }
+  void drop_bottom(int count) {
+    std::move(stack.cbegin() + count, stack.cend(), stack.begin());
+    pop_many(count);
+  }
+  StackEntry& operator[](int idx) {  // NB: we sometimes use idx=-1
+    return stack[stack.size() - idx - 1];
+  }
+  const StackEntry& operator[](int idx) const {
+    return stack[stack.size() - idx - 1];
+  }
+  StackEntry& at(int idx) {
+    return stack.at(stack.size() - idx - 1);
+  }
+  const StackEntry& at(int idx) const {
+    return stack.at(stack.size() - idx - 1);
+  }
+  StackEntry fetch(int idx) const {
+    return stack[stack.size() - idx - 1];
+  }
+  StackEntry& tos() {
+    return stack.back();
+  }
+  const StackEntry& tos() const {
+    return stack.back();
+  }
+  bool is_empty() const {
+    return stack.empty();
+  }
+  int depth() const {
+    return (int)stack.size();
+  }
+  std::vector<StackEntry>::iterator top() {
+    return stack.end();
+  }
+  std::vector<StackEntry>::const_iterator top() const {
+    return stack.cend();
+  }
+  std::vector<StackEntry>::iterator from_top(int offs) {
+    return stack.end() - offs;
+  }
+  std::vector<StackEntry>::const_iterator from_top(int offs) const {
+    return stack.cend() - offs;
+  }
+  bool at_least(int req) const {
+    return depth() >= req;
+  }
+  template <typename... Args>
+  bool at_least(int req, Args... args) const {
+    return at_least(req) && at_least(args...);
+  }
+  bool more_than(int req) const {
+    return depth() > req;
+  }
+  template <typename... Args>
+  bool more_than(int req, Args... args) const {
+    return more_than(req) && more_than(args...);
+  }
+  void clear() {
+    stack.clear();
+  }
+  Stack& set_contents(const Stack& other_stack) {
+    stack = other_stack.stack;
+    return *this;
+  }
+  Stack& set_contents(Stack&& other_stack) {
+    stack = std::move(other_stack.stack);
+    return *this;
+  }
+  Stack& set_contents(Ref<Stack> ref) {
+    if (ref.is_null()) {
+      clear();
+    } else if (ref->is_unique()) {
+      set_contents(std::move(ref.unique_write()));
+    } else {
+      set_contents(*ref);
+    }
+    return *this;
+  }
+  template <typename... Args>
+  const Stack& check_underflow(Args... args) const {
+    if (!at_least(args...)) {
+      throw VmError{Excno::stk_und};
+    }
+    return *this;
+  }
+  template <typename... Args>
+  Stack& check_underflow(Args... args) {
+    if (!at_least(args...)) {
+      throw VmError{Excno::stk_und};
+    }
+    return *this;
+  }
+  template <typename... Args>
+  const Stack& check_underflow_p(Args... args) const {
+    if (!more_than(args...)) {
+      throw VmError{Excno::stk_und};
+    }
+    return *this;
+  }
+  template <typename... Args>
+  Stack& check_underflow_p(Args... args) {
+    if (!more_than(args...)) {
+      throw VmError{Excno::stk_und};
+    }
+    return *this;
+  }
+  Stack& reserve(int cnt) {
+    stack.reserve(cnt);
+    return *this;
+  }
+  void pop_null();
+  td::RefInt256 pop_int();
+  td::RefInt256 pop_int_finite();
+  bool pop_bool();
+  long long pop_long();
+  long long pop_long_range(long long max, long long min = 0);
+  int pop_smallint_range(int max, int min = 0);
+  Ref<Cell> pop_cell();
+  Ref<Cell> pop_maybe_cell();
+  Ref<CellBuilder> pop_builder();
+  Ref<CellSlice> pop_cellslice();
+  Ref<Continuation> pop_cont();
+  Ref<Box> pop_box();
+  Ref<Tuple> pop_tuple();
+  Ref<Tuple> pop_tuple_range(unsigned max_len = 255, unsigned min_len = 0);
+  Ref<Tuple> pop_maybe_tuple();
+  Ref<Tuple> pop_maybe_tuple_range(unsigned max_len = 255);
+  Ref<Atom> pop_atom();
+  std::string pop_string();
+  std::string pop_bytes();
+  void push_null();
+  void push_int(td::RefInt256 val);
+  void push_int_quiet(td::RefInt256 val, bool quiet = true);
+  void push_smallint(long long val);
+  void push_bool(bool val);
+  void push_string(std::string str);
+  void push_string(td::Slice slice);
+  void push_bytes(std::string str);
+  void push_bytes(td::Slice slice);
+  void push_cell(Ref<Cell> cell);
+  void push_maybe_cell(Ref<Cell> cell);
+  void push_maybe_cellslice(Ref<CellSlice> cs);
+  void push_builder(Ref<CellBuilder> cb);
+  void push_cellslice(Ref<CellSlice> cs);
+  void push_cont(Ref<Continuation> cont);
+  void push_box(Ref<Box> box);
+  void push_tuple(Ref<Tuple> tuple);
+  void push_tuple(const std::vector<StackEntry>& components);
+  void push_tuple(std::vector<StackEntry>&& components);
+  void push_maybe_tuple(Ref<Tuple> tuple);
+  void push_atom(Ref<Atom> atom);
+  template <typename T>
+  void push_object(Ref<T> obj) {
+    push({vm::from_object, std::move(obj)});
+  }
+  template <typename T, typename... Args>
+  void push_make_object(Args&&... args) {
+    push_object<T>(td::make_ref<T>(std::forward<Args>(args)...));
+  }
+  template <typename T>
+  void push_maybe(Ref<T> val) {
+    if (val.is_null()) {
+      push({});
+    } else {
+      push(std::move(val));
+    }
+  }
+  void dump(std::ostream& os, bool cr = true) const;
+};
+
+}  // namespace vm
+
+namespace td {
+extern template class td::Cnt<std::vector<vm::StackEntry>>;
+extern template class td::Ref<td::Cnt<std::vector<vm::StackEntry>>>;
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/crypto/vm/stackops.cpp b/submodules/ton/tonlib-src/crypto/vm/stackops.cpp
new file mode 100644
index 0000000000..7fdbcba044
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/stackops.cpp
@@ -0,0 +1,576 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/log.h"
+#include "vm/stackops.h"
+#include "vm/opctable.h"
+#include "vm/stack.hpp"
+#include "vm/continuation.h"
+#include "vm/excno.hpp"
+
+namespace vm {
+
+int exec_nop(VmState* st) {
+  VM_LOG(st) << "execute NOP\n";
+  return 0;
+}
+
+// basic stack manipulation primitives
+
+int exec_swap(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute SWAP\n";
+  stack.check_underflow(2);
+  swap(stack[0], stack[1]);
+  return 0;
+}
+
+int exec_xchg0(VmState* st, unsigned args) {
+  int x = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute XCHG s" << x;
+  stack.check_underflow_p(x);
+  swap(stack[0], stack[x]);
+  return 0;
+}
+
+int exec_xchg0_l(VmState* st, unsigned args) {
+  int x = args & 255;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute XCHG s" << x;
+  stack.check_underflow_p(x);
+  swap(stack[0], stack[x]);
+  return 0;
+}
+
+int exec_xchg(VmState* st, unsigned args) {
+  int x = (args >> 4) & 15, y = args & 15;
+  if (!x || x >= y) {
+    throw VmError{Excno::inv_opcode, "invalid XCHG arguments"};
+  }
+  VM_LOG(st) << "execute XCHG s" << x << ",s" << y;
+  Stack& stack = st->get_stack();
+  stack.check_underflow_p(y);
+  swap(stack[x], stack[y]);
+  return 0;
+}
+
+std::string dump_xchg(CellSlice&, unsigned args) {
+  int x = (args >> 4) & 15, y = args & 15;
+  if (!x || x >= y) {
+    return "";
+  }
+  std::ostringstream os{"XCHG s"};
+  os << x << ",s" << y;
+  return os.str();
+}
+
+int exec_xchg1(VmState* st, unsigned args) {
+  int x = args & 15;
+  assert(x >= 2);
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute XCHG s1,s" << x;
+  stack.check_underflow_p(x);
+  swap(stack[1], stack[x]);
+  return 0;
+}
+
+int exec_dup(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DUP\n";
+  stack.check_underflow(1);
+  stack.push(stack.fetch(0));
+  return 0;
+}
+
+int exec_over(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute OVER\n";
+  stack.check_underflow(2);
+  stack.push(stack.fetch(1));
+  return 0;
+}
+
+int exec_push(VmState* st, unsigned args) {
+  int x = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSH s" << x;
+  stack.check_underflow_p(x);
+  stack.push(stack.fetch(x));
+  return 0;
+}
+
+int exec_push_l(VmState* st, unsigned args) {
+  int x = args & 255;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSH s" << x;
+  stack.check_underflow_p(x);
+  stack.push(stack.fetch(x));
+  return 0;
+}
+
+int exec_drop(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DROP\n";
+  stack.check_underflow(1);
+  stack.pop();
+  return 0;
+}
+
+int exec_nip(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute NIP\n";
+  stack.check_underflow(2);
+  stack.pop(stack[1]);
+  return 0;
+}
+
+int exec_pop(VmState* st, unsigned args) {
+  int x = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute POP s" << x;
+  stack.check_underflow_p(x);
+  stack.pop(stack[x]);
+  return 0;
+}
+
+int exec_pop_l(VmState* st, unsigned args) {
+  int x = args & 255;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute POP s" << x;
+  stack.check_underflow_p(x);
+  stack.pop(stack[x]);
+  return 0;
+}
+
+// compound stack manipulation primitives
+
+int exec_xchg2(VmState* st, unsigned args) {
+  int x = (args >> 4) & 15, y = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute XCHG2 s" << x << ",s" << y;
+  stack.check_underflow_p(x, y, 1);
+  swap(stack[1], stack[x]);
+  swap(stack[0], stack[y]);
+  return 0;
+}
+
+int exec_xcpu(VmState* st, unsigned args) {
+  int x = (args >> 4) & 15, y = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute XCPU s" << x << ",s" << y;
+  stack.check_underflow_p(x, y);
+  swap(stack[0], stack[x]);
+  stack.push(stack.fetch(y));
+  return 0;
+}
+
+int exec_puxc(VmState* st, unsigned args) {
+  int x = (args >> 4) & 15, y = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUXC s" << x << ",s" << y - 1;
+  stack.check_underflow_p(x).check_underflow(y);
+  stack.push(stack.fetch(x));
+  swap(stack[0], stack[1]);
+  swap(stack[0], stack[y]);
+  return 0;
+}
+
+int exec_push2(VmState* st, unsigned args) {
+  int x = (args >> 4) & 15, y = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSH2 s" << x << ",s" << y;
+  stack.check_underflow_p(x, y);
+  stack.push(stack.fetch(x));
+  stack.push(stack.fetch(y + 1));
+  return 0;
+}
+
+int exec_xchg3(VmState* st, unsigned args) {
+  int x = (args >> 8) & 15, y = (args >> 4) & 15, z = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute XCHG3 s" << x << ",s" << y << ",s" << z;
+  stack.check_underflow_p(x, y, z, 2);
+  swap(stack[2], stack[x]);
+  swap(stack[1], stack[y]);
+  swap(stack[0], stack[z]);
+  return 0;
+}
+
+int exec_xc2pu(VmState* st, unsigned args) {
+  int x = (args >> 8) & 15, y = (args >> 4) & 15, z = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute XC2PU s" << x << ",s" << y << ",s" << z;
+  stack.check_underflow_p(x, y, z, 1);
+  swap(stack[1], stack[x]);
+  swap(stack[0], stack[y]);
+  stack.push(stack.fetch(z));
+  return 0;
+}
+
+int exec_xcpuxc(VmState* st, unsigned args) {
+  int x = (args >> 8) & 15, y = (args >> 4) & 15, z = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute XCPUXC s" << x << ",s" << y << ",s" << z - 1;
+  stack.check_underflow_p(x, y, 1).check_underflow(z);
+  swap(stack[1], stack[x]);
+  stack.push(stack.fetch(y));
+  swap(stack[0], stack[1]);
+  swap(stack[0], stack[z]);
+  return 0;
+}
+
+int exec_xcpu2(VmState* st, unsigned args) {
+  int x = (args >> 8) & 15, y = (args >> 4) & 15, z = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute XCPU2 s" << x << ",s" << y << ",s" << z;
+  stack.check_underflow_p(x, y, z);
+  swap(stack[0], stack[x]);
+  stack.push(stack.fetch(y));
+  stack.push(stack.fetch(z + 1));
+  return 0;
+}
+
+int exec_puxc2(VmState* st, unsigned args) {
+  int x = (args >> 8) & 15, y = (args >> 4) & 15, z = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUXC2 s" << x << ",s" << y - 1 << ",s" << z - 1;
+  stack.check_underflow_p(x, 1).check_underflow(y, z);
+  stack.push(stack.fetch(x));
+  swap(stack[2], stack[0]);
+  swap(stack[1], stack[y]);
+  swap(stack[0], stack[z]);
+  return 0;
+}
+
+int exec_puxcpu(VmState* st, unsigned args) {
+  int x = (args >> 8) & 15, y = (args >> 4) & 15, z = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUXCPU s" << x << ",s" << y - 1 << ",s" << z - 1;
+  stack.check_underflow_p(x).check_underflow(y, z);
+  stack.push(stack.fetch(x));
+  swap(stack[0], stack[1]);
+  swap(stack[0], stack[y]);
+  stack.push(stack.fetch(z));
+  return 0;
+}
+
+int exec_pu2xc(VmState* st, unsigned args) {
+  int x = (args >> 8) & 15, y = (args >> 4) & 15, z = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PU2XC s" << x << ",s" << y - 1 << ",s" << z - 2;
+  stack.check_underflow_p(x).check_underflow(y, z - 1);
+  stack.push(stack.fetch(x));
+  swap(stack[1], stack[0]);
+  stack.push(stack.fetch(y));
+  swap(stack[1], stack[0]);
+  swap(stack[0], stack[z]);
+  return 0;
+}
+
+int exec_push3(VmState* st, unsigned args) {
+  int x = (args >> 8) & 15, y = (args >> 4) & 15, z = args & 15;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PUSH3 s" << x << ",s" << y << ",s" << z;
+  stack.check_underflow_p(x, y, z);
+  stack.push(stack.fetch(x));
+  stack.push(stack.fetch(y + 1));
+  stack.push(stack.fetch(z + 2));
+  return 0;
+}
+
+// exotic stack manipulation primitives
+
+int exec_blkswap(VmState* st, unsigned args) {
+  int x = ((args >> 4) & 15) + 1, y = (args & 15) + 1;
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute BLKSWAP " << x << ',' << y;
+  stack.check_underflow(x + y);
+  std::reverse(stack.from_top(x + y), stack.from_top(y));
+  std::reverse(stack.from_top(y), stack.top());
+  std::reverse(stack.from_top(x + y), stack.top());
+  return 0;
+}
+
+int exec_rot(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ROT\n";
+  stack.check_underflow(3);
+  swap(stack[1], stack[2]);
+  swap(stack[0], stack[1]);
+  return 0;
+}
+
+int exec_rotrev(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ROTREV\n";
+  stack.check_underflow(3);
+  swap(stack[0], stack[1]);
+  swap(stack[1], stack[2]);
+  return 0;
+}
+
+int exec_2swap(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute 2SWAP\n";
+  stack.check_underflow(4);
+  swap(stack[1], stack[3]);
+  swap(stack[0], stack[2]);
+  return 0;
+}
+
+int exec_2drop(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute 2DROP\n";
+  stack.check_underflow(2);
+  stack.pop();
+  stack.pop();
+  return 0;
+}
+
+int exec_2dup(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute 2DUP\n";
+  stack.check_underflow(2);
+  stack.push(stack.fetch(1));
+  stack.push(stack.fetch(1));
+  return 0;
+}
+
+int exec_2over(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute 2OVER\n";
+  stack.check_underflow(4);
+  stack.push(stack.fetch(3));
+  stack.push(stack.fetch(3));
+  return 0;
+}
+
+int exec_reverse(VmState* st, unsigned args) {
+  int x = ((args >> 4) & 15) + 2, y = (args & 15);
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute REVERSE " << x << ',' << y;
+  stack.check_underflow(x + y);
+  std::reverse(stack.from_top(x + y), stack.from_top(y));
+  return 0;
+}
+
+int exec_blkdrop(VmState* st, unsigned args) {
+  int x = (args & 15);
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute BLKDROP " << x;
+  stack.check_underflow(x);
+  stack.pop_many(x);
+  return 0;
+}
+
+int exec_blkpush(VmState* st, unsigned args) {
+  int x = ((args >> 4) & 15), y = (args & 15);
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute BLKPUSH " << x << ',' << y;
+  stack.check_underflow_p(y);
+  while (--x >= 0) {
+    stack.push(stack.fetch(y));
+  }
+  return 0;
+}
+
+int exec_pick(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute PICK\n";
+  stack.check_underflow(1);
+  int x = stack.pop_smallint_range(255);
+  stack.check_underflow_p(x);
+  stack.push(stack.fetch(x));
+  return 0;
+}
+
+int exec_roll(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ROLL\n";
+  stack.check_underflow(1);
+  int x = stack.pop_smallint_range(255);
+  stack.check_underflow_p(x);
+  while (--x >= 0) {
+    swap(stack[x], stack[x + 1]);
+  }
+  return 0;
+}
+
+int exec_rollrev(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ROLLREV\n";
+  stack.check_underflow(1);
+  int x = stack.pop_smallint_range(255);
+  stack.check_underflow_p(x);
+  for (int i = 0; i < x; i++) {
+    swap(stack[i], stack[i + 1]);
+  }
+  return 0;
+}
+
+int exec_blkswap_x(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute BLKSWX\n";
+  stack.check_underflow(2);
+  int y = stack.pop_smallint_range(255);
+  int x = stack.pop_smallint_range(255);
+  stack.check_underflow(x + y);
+  if (x > 0 && y > 0) {
+    std::reverse(stack.from_top(x + y), stack.from_top(y));
+    std::reverse(stack.from_top(y), stack.top());
+    std::reverse(stack.from_top(x + y), stack.top());
+  }
+  return 0;
+}
+
+int exec_reverse_x(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute REVX\n";
+  stack.check_underflow(2);
+  int y = stack.pop_smallint_range(255);
+  int x = stack.pop_smallint_range(255);
+  stack.check_underflow(x + y);
+  std::reverse(stack.from_top(x + y), stack.from_top(y));
+  return 0;
+}
+
+int exec_drop_x(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DROPX\n";
+  stack.check_underflow(1);
+  int x = stack.pop_smallint_range(255);
+  stack.check_underflow(x);
+  stack.pop_many(x);
+  return 0;
+}
+
+int exec_tuck(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute TUCK\n";
+  stack.check_underflow(2);
+  swap(stack[0], stack[1]);
+  stack.push(stack.fetch(1));
+  return 0;
+}
+
+int exec_xchg_x(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute XCHGX\n";
+  stack.check_underflow(1);
+  int x = stack.pop_smallint_range(255);
+  stack.check_underflow_p(x);
+  swap(stack[0], stack[x]);
+  return 0;
+}
+
+int exec_depth(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute DEPTH\n";
+  stack.push_smallint(stack.depth());
+  return 0;
+}
+
+int exec_chkdepth(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute CHKDEPTH\n";
+  stack.check_underflow(1);
+  int x = stack.pop_smallint_range(255);
+  stack.check_underflow(x);
+  return 0;
+}
+
+int exec_onlytop_x(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ONLYTOPX\n";
+  stack.check_underflow(1);
+  int x = stack.pop_smallint_range(255);
+  stack.check_underflow(x);
+  int n = stack.depth(), d = n - x;
+  if (d > 0) {
+    for (int i = n - 1; i >= d; i--) {
+      stack[i] = std::move(stack[i - d]);
+    }
+  }
+  stack.pop_many(d);
+  return 0;
+}
+
+int exec_only_x(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ONLYX\n";
+  stack.check_underflow(1);
+  int x = stack.pop_smallint_range(255);
+  stack.check_underflow(x);
+  stack.pop_many(stack.depth() - x);
+  return 0;
+}
+
+void register_stack_ops(OpcodeTable& cp0) {
+  cp0.insert(OpcodeInstr::mksimple(0x00, 8, "NOP", exec_nop))
+      .insert(OpcodeInstr::mksimple(0x01, 8, "SWAP", exec_swap))
+      .insert(OpcodeInstr::mkfixedrange(0x02, 0x10, 8, 4, instr::dump_1sr("XCHG "), exec_xchg0))
+      .insert(OpcodeInstr::mkfixed(0x10, 8, 8, dump_xchg, exec_xchg))
+      .insert(OpcodeInstr::mkfixed(0x11, 8, 8, instr::dump_1sr_l("XCHG "), exec_xchg0_l))
+      .insert(OpcodeInstr::mkfixedrange(0x12, 0x20, 8, 4, instr::dump_1sr("XCHG s1,"), exec_xchg1))
+      .insert(OpcodeInstr::mksimple(0x20, 8, "DUP", exec_dup))
+      .insert(OpcodeInstr::mksimple(0x21, 8, "OVER", exec_over))
+      .insert(OpcodeInstr::mkfixedrange(0x22, 0x30, 8, 4, instr::dump_1sr("PUSH "), exec_push))
+      .insert(OpcodeInstr::mksimple(0x30, 8, "DROP", exec_drop))
+      .insert(OpcodeInstr::mksimple(0x31, 8, "NIP", exec_nip))
+      .insert(OpcodeInstr::mkfixedrange(0x32, 0x40, 8, 4, instr::dump_1sr("POP "), exec_pop))
+      .insert(OpcodeInstr::mkfixed(0x4, 4, 12, instr::dump_3sr("XCHG3 "), exec_xchg3))
+      .insert(OpcodeInstr::mkfixed(0x50, 8, 8, instr::dump_2sr("XCHG2 "), exec_xchg2))
+      .insert(OpcodeInstr::mkfixed(0x51, 8, 8, instr::dump_2sr("XCPU "), exec_xcpu))
+      .insert(OpcodeInstr::mkfixed(0x52, 8, 8, instr::dump_2sr_adj(1, "PUXC "), exec_puxc))
+      .insert(OpcodeInstr::mkfixed(0x53, 8, 8, instr::dump_2sr("PUSH2 "), exec_push2))
+      .insert(OpcodeInstr::mkfixed(0x540, 12, 12, instr::dump_3sr("XCHG3 "), exec_xchg3))
+      .insert(OpcodeInstr::mkfixed(0x541, 12, 12, instr::dump_3sr("XC2PU "), exec_xc2pu))
+      .insert(OpcodeInstr::mkfixed(0x542, 12, 12, instr::dump_3sr_adj(1, "XCPUXC "), exec_xcpuxc))
+      .insert(OpcodeInstr::mkfixed(0x543, 12, 12, instr::dump_3sr("XCPU2 "), exec_xcpu2))
+      .insert(OpcodeInstr::mkfixed(0x544, 12, 12, instr::dump_3sr_adj(0x11, "PUXC2 "), exec_puxc2))
+      .insert(OpcodeInstr::mkfixed(0x545, 12, 12, instr::dump_3sr_adj(0x11, "PUXCPU "), exec_puxcpu))
+      .insert(OpcodeInstr::mkfixed(0x546, 12, 12, instr::dump_3sr_adj(0x12, "PU2XC "), exec_pu2xc))
+      .insert(OpcodeInstr::mkfixed(0x547, 12, 12, instr::dump_3sr("PUSH3 "), exec_push3))
+      .insert(OpcodeInstr::mkfixed(0x55, 8, 8, instr::dump_2c_add(0x11, "BLKSWAP ", ","), exec_blkswap))
+      .insert(OpcodeInstr::mkfixed(0x56, 8, 8, instr::dump_1sr_l("PUSH "), exec_push_l))
+      .insert(OpcodeInstr::mkfixed(0x57, 8, 8, instr::dump_1sr_l("POP "), exec_pop_l))
+      .insert(OpcodeInstr::mksimple(0x58, 8, "ROT", exec_rot))
+      .insert(OpcodeInstr::mksimple(0x59, 8, "ROTREV", exec_rotrev))
+      .insert(OpcodeInstr::mksimple(0x5a, 8, "2SWAP", exec_2swap))
+      .insert(OpcodeInstr::mksimple(0x5b, 8, "2DROP", exec_2drop))
+      .insert(OpcodeInstr::mksimple(0x5c, 8, "2DUP", exec_2dup))
+      .insert(OpcodeInstr::mksimple(0x5d, 8, "2OVER", exec_2over))
+      .insert(OpcodeInstr::mkfixed(0x5e, 8, 8, instr::dump_2c_add(0x20, "REVERSE ", ","), exec_reverse))
+      .insert(OpcodeInstr::mkfixed(0x5f0, 12, 4, instr::dump_1c("BLKDROP "), exec_blkdrop))
+      .insert(OpcodeInstr::mkfixedrange(0x5f10, 0x6000, 16, 8, instr::dump_2c("BLKPUSH ", ","), exec_blkpush))
+      .insert(OpcodeInstr::mksimple(0x60, 8, "PICK", exec_pick))
+      .insert(OpcodeInstr::mksimple(0x61, 8, "ROLL", exec_roll))
+      .insert(OpcodeInstr::mksimple(0x62, 8, "ROLLREV", exec_rollrev))
+      .insert(OpcodeInstr::mksimple(0x63, 8, "BLKSWX", exec_blkswap_x))
+      .insert(OpcodeInstr::mksimple(0x64, 8, "REVX", exec_reverse_x))
+      .insert(OpcodeInstr::mksimple(0x65, 8, "DROPX", exec_drop_x))
+      .insert(OpcodeInstr::mksimple(0x66, 8, "TUCK", exec_tuck))
+      .insert(OpcodeInstr::mksimple(0x67, 8, "XCHGX", exec_xchg_x))
+      .insert(OpcodeInstr::mksimple(0x68, 8, "DEPTH", exec_depth))
+      .insert(OpcodeInstr::mksimple(0x69, 8, "CHKDEPTH", exec_chkdepth))
+      .insert(OpcodeInstr::mksimple(0x6a, 8, "ONLYTOPX", exec_onlytop_x))
+      .insert(OpcodeInstr::mksimple(0x6b, 8, "ONLYX", exec_only_x));
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/stackops.h b/submodules/ton/tonlib-src/crypto/vm/stackops.h
new file mode 100644
index 0000000000..7ae940d3f5
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/stackops.h
@@ -0,0 +1,27 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace vm {
+
+class OpcodeTable;
+
+void register_stack_ops(OpcodeTable& cp0);
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/tonops.cpp b/submodules/ton/tonlib-src/crypto/vm/tonops.cpp
new file mode 100644
index 0000000000..30d3d14b88
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/tonops.cpp
@@ -0,0 +1,675 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <functional>
+#include "vm/tonops.h"
+#include "vm/log.h"
+#include "vm/opctable.h"
+#include "vm/stack.hpp"
+#include "vm/continuation.h"
+#include "vm/excno.hpp"
+#include "vm/dict.h"
+#include "Ed25519.h"
+
+namespace vm {
+
+namespace {
+
+bool debug(const char* str) TD_UNUSED;
+bool debug(const char* str) {
+  std::cerr << str;
+  return true;
+}
+
+bool debug(int x) TD_UNUSED;
+bool debug(int x) {
+  if (x < 100) {
+    std::cerr << '[' << (char)(64 + x) << ']';
+  } else {
+    std::cerr << '[' << (char)(64 + x / 100) << x % 100 << ']';
+  }
+  return true;
+}
+}  // namespace
+
+#define DBG_START int dbg = 0;
+#define DBG debug(++dbg)&&
+#define DEB_START DBG_START
+#define DEB DBG
+
+int exec_set_gas_generic(VmState* st, long long new_gas_limit) {
+  if (new_gas_limit < st->gas_consumed()) {
+    throw VmNoGas{};
+  }
+  st->change_gas_limit(new_gas_limit);
+  return 0;
+}
+
+int exec_accept(VmState* st) {
+  VM_LOG(st) << "execute ACCEPT";
+  return exec_set_gas_generic(st, GasLimits::infty);
+}
+
+int exec_set_gas_limit(VmState* st) {
+  VM_LOG(st) << "execute SETGASLIMIT";
+  td::RefInt256 x = st->get_stack().pop_int_finite();
+  long long gas = 0;
+  if (x->sgn() > 0) {
+    gas = x->unsigned_fits_bits(63) ? x->to_long() : GasLimits::infty;
+  }
+  return exec_set_gas_generic(st, gas);
+}
+
+void register_basic_gas_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mksimple(0xf800, 16, "ACCEPT", exec_accept))
+      .insert(OpcodeInstr::mksimple(0xf801, 16, "SETGASLIMIT", exec_set_gas_limit));
+}
+
+void register_ton_gas_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+}
+
+int exec_get_param(VmState* st, unsigned idx, const char* name) {
+  if (name) {
+    VM_LOG(st) << "execute " << name;
+  }
+  Stack& stack = st->get_stack();
+  auto tuple = st->get_c7();
+  auto t1 = tuple_index(*tuple, 0).as_tuple_range(255);
+  if (t1.is_null()) {
+    throw VmError{Excno::type_chk, "intermediate value is not a tuple"};
+  }
+  stack.push(tuple_index(*t1, idx));
+  return 0;
+}
+
+int exec_get_var_param(VmState* st, unsigned idx) {
+  idx &= 15;
+  VM_LOG(st) << "execute GETPARAM " << idx;
+  return exec_get_param(st, idx, nullptr);
+}
+
+int exec_get_config_dict(VmState* st) {
+  exec_get_param(st, 9, "CONFIGDICT");
+  st->get_stack().push_smallint(32);
+  return 0;
+}
+
+int exec_get_config_param(VmState* st, bool opt) {
+  VM_LOG(st) << "execute CONFIG" << (opt ? "OPTPARAM" : "PARAM");
+  Stack& stack = st->get_stack();
+  auto idx = stack.pop_int();
+  exec_get_param(st, 9, nullptr);
+  Dictionary dict{stack.pop_maybe_cell(), 32};
+  td::BitArray<32> key;
+  Ref<vm::Cell> value;
+  if (idx->export_bits(key.bits(), key.size(), true)) {
+    value = dict.lookup_ref(key);
+  }
+  if (opt) {
+    stack.push_maybe_cell(std::move(value));
+  } else if (value.not_null()) {
+    stack.push_cell(std::move(value));
+    stack.push_bool(true);
+  } else {
+    stack.push_bool(false);
+  }
+  return 0;
+}
+
+int exec_get_global_common(VmState* st, unsigned n) {
+  st->get_stack().push(tuple_extend_index(st->get_c7(), n));
+  return 0;
+}
+
+int exec_get_global(VmState* st, unsigned args) {
+  args &= 31;
+  VM_LOG(st) << "execute GETGLOB " << args;
+  return exec_get_global_common(st, args);
+}
+
+int exec_get_global_var(VmState* st) {
+  VM_LOG(st) << "execute GETGLOBVAR";
+  st->check_underflow(1);
+  unsigned args = st->get_stack().pop_smallint_range(254);
+  return exec_get_global_common(st, args);
+}
+
+int exec_set_global_common(VmState* st, unsigned idx) {
+  Stack& stack = st->get_stack();
+  auto x = stack.pop();
+  auto tuple = st->get_c7();
+  if (idx >= 255) {
+    throw VmError{Excno::range_chk, "tuple index out of range"};
+  }
+  auto tpay = tuple_extend_set_index(tuple, idx, std::move(x));
+  if (tpay > 0) {
+    st->consume_tuple_gas(tpay);
+  }
+  st->set_c7(std::move(tuple));
+  return 0;
+}
+
+int exec_set_global(VmState* st, unsigned args) {
+  args &= 31;
+  VM_LOG(st) << "execute SETGLOB " << args;
+  st->check_underflow(1);
+  return exec_set_global_common(st, args);
+}
+
+int exec_set_global_var(VmState* st) {
+  VM_LOG(st) << "execute SETGLOBVAR";
+  st->check_underflow(2);
+  unsigned args = st->get_stack().pop_smallint_range(254);
+  return exec_set_global_common(st, args);
+}
+
+void register_ton_config_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mkfixedrange(0xf820, 0xf823, 16, 4, instr::dump_1c("GETPARAM "), exec_get_var_param))
+      .insert(OpcodeInstr::mksimple(0xf823, 16, "NOW", std::bind(exec_get_param, _1, 3, "NOW")))
+      .insert(OpcodeInstr::mksimple(0xf824, 16, "BLOCKLT", std::bind(exec_get_param, _1, 4, "BLOCKLT")))
+      .insert(OpcodeInstr::mksimple(0xf825, 16, "LTIME", std::bind(exec_get_param, _1, 5, "LTIME")))
+      .insert(OpcodeInstr::mkfixedrange(0xf826, 0xf828, 16, 4, instr::dump_1c("GETPARAM "), exec_get_var_param))
+      .insert(OpcodeInstr::mksimple(0xf828, 16, "MYADDR", std::bind(exec_get_param, _1, 8, "MYADDR")))
+      .insert(OpcodeInstr::mksimple(0xf829, 16, "CONFIGROOT", std::bind(exec_get_param, _1, 9, "CONFIGROOT")))
+      .insert(OpcodeInstr::mkfixedrange(0xf82a, 0xf830, 16, 4, instr::dump_1c("GETPARAM "), exec_get_var_param))
+      .insert(OpcodeInstr::mksimple(0xf830, 16, "CONFIGDICT", exec_get_config_dict))
+      .insert(OpcodeInstr::mksimple(0xf832, 16, "CONFIGPARAM", std::bind(exec_get_config_param, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xf833, 16, "CONFIGOPTPARAM", std::bind(exec_get_config_param, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xf840, 16, "GETGLOBVAR", exec_get_global_var))
+      .insert(OpcodeInstr::mkfixedrange(0xf841, 0xf860, 16, 5, instr::dump_1c_and(31, "GETGLOB "), exec_get_global))
+      .insert(OpcodeInstr::mksimple(0xf860, 16, "SETGLOBVAR", exec_set_global_var))
+      .insert(OpcodeInstr::mkfixedrange(0xf861, 0xf880, 16, 5, instr::dump_1c_and(31, "SETGLOB "), exec_set_global));
+}
+
+int exec_compute_hash(VmState* st, int mode) {
+  VM_LOG(st) << "execute HASH" << (mode & 1 ? 'S' : 'C') << 'U';
+  Stack& stack = st->get_stack();
+  std::array<unsigned char, 32> hash;
+  if (!(mode & 1)) {
+    auto cell = stack.pop_cell();
+    hash = cell->get_hash().as_array();
+  } else {
+    auto cs = stack.pop_cellslice();
+    vm::CellBuilder cb;
+    CHECK(cb.append_cellslice_bool(std::move(cs)));
+    // TODO: use cb.get_hash() instead
+    hash = cb.finalize()->get_hash().as_array();
+  }
+  td::RefInt256 res{true};
+  CHECK(res.write().import_bytes(hash.data(), hash.size(), false));
+  stack.push_int(std::move(res));
+  return 0;
+}
+
+int exec_compute_sha256(VmState* st) {
+  VM_LOG(st) << "execute SHA256U";
+  Stack& stack = st->get_stack();
+  auto cs = stack.pop_cellslice();
+  if (cs->size() & 7) {
+    throw VmError{Excno::cell_und, "Slice does not consist of an integer number of bytes"};
+  }
+  auto len = (cs->size() >> 3);
+  unsigned char data[128], hash[32];
+  CHECK(len <= sizeof(data));
+  CHECK(cs->prefetch_bytes(data, len));
+  digest::hash_str<digest::SHA256>(hash, data, len);
+  td::RefInt256 res{true};
+  CHECK(res.write().import_bytes(hash, 32, false));
+  stack.push_int(std::move(res));
+  return 0;
+}
+
+int exec_ed25519_check_signature(VmState* st, bool from_slice) {
+  VM_LOG(st) << "execute CHKSIGN" << (from_slice ? 'S' : 'U');
+  Stack& stack = st->get_stack();
+  stack.check_underflow(3);
+  auto key_int = stack.pop_int();
+  auto signature_cs = stack.pop_cellslice();
+  unsigned char data[128], key[32], signature[64];
+  unsigned data_len;
+  if (from_slice) {
+    auto cs = stack.pop_cellslice();
+    if (cs->size() & 7) {
+      throw VmError{Excno::cell_und, "Slice does not consist of an integer number of bytes"};
+    }
+    data_len = (cs->size() >> 3);
+    CHECK(data_len <= sizeof(data));
+    CHECK(cs->prefetch_bytes(data, data_len));
+  } else {
+    auto hash_int = stack.pop_int();
+    data_len = 32;
+    if (!hash_int->export_bytes(data, data_len, false)) {
+      throw VmError{Excno::range_chk, "data hash must fit in an unsigned 256-bit integer"};
+    }
+  }
+  if (!signature_cs->prefetch_bytes(signature, 64)) {
+    throw VmError{Excno::cell_und, "Ed25519 signature must contain at least 512 data bits"};
+  }
+  if (!key_int->export_bytes(key, 32, false)) {
+    throw VmError{Excno::range_chk, "Ed25519 public key must fit in an unsigned 256-bit integer"};
+  }
+  td::Ed25519::PublicKey pub_key{td::SecureString(td::Slice{key, 32})};
+  auto res = pub_key.verify_signature(td::Slice{data, data_len}, td::Slice{signature, 64});
+  stack.push_bool(res.is_ok());
+  return 0;
+}
+
+void register_ton_crypto_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mksimple(0xf900, 16, "HASHCU", std::bind(exec_compute_hash, _1, 0)))
+      .insert(OpcodeInstr::mksimple(0xf901, 16, "HASHSU", std::bind(exec_compute_hash, _1, 1)))
+      .insert(OpcodeInstr::mksimple(0xf902, 16, "SHA256U", exec_compute_sha256))
+      .insert(OpcodeInstr::mksimple(0xf910, 16, "CHKSIGNU", std::bind(exec_ed25519_check_signature, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xf911, 16, "CHKSIGNS", std::bind(exec_ed25519_check_signature, _1, true)));
+}
+
+int exec_load_var_integer(VmState* st, int len_bits, bool sgnd, bool quiet) {
+  if (len_bits == 4 && !sgnd) {
+    VM_LOG(st) << "execute LDGRAMS" << (quiet ? "Q" : "");
+  } else {
+    VM_LOG(st) << "execute LDVAR" << (sgnd ? "" : "U") << "INT" << (1 << len_bits) << (quiet ? "Q" : "");
+  }
+  Stack& stack = st->get_stack();
+  auto csr = stack.pop_cellslice();
+  td::RefInt256 x;
+  int len;
+  if (!(csr.write().fetch_uint_to(len_bits, len) && csr.unique_write().fetch_int256_to(len * 8, x, sgnd))) {
+    if (quiet) {
+      stack.push_bool(false);
+    } else {
+      throw VmError{Excno::cell_und, "cannot deserialize a variable-length integer"};
+    }
+  } else {
+    stack.push_int(std::move(x));
+    stack.push_cellslice(std::move(csr));
+    if (quiet) {
+      stack.push_bool(true);
+    }
+  }
+  return 0;
+}
+
+int exec_store_var_integer(VmState* st, int len_bits, bool sgnd, bool quiet) {
+  if (len_bits == 4 && !sgnd) {
+    VM_LOG(st) << "execute STGRAMS" << (quiet ? "Q" : "");
+  } else {
+    VM_LOG(st) << "execute STVAR" << (sgnd ? "" : "U") << "INT" << (1 << len_bits) << (quiet ? "Q" : "");
+  }
+  Stack& stack = st->get_stack();
+  stack.check_underflow(2);
+  auto x = stack.pop_int();
+  auto cbr = stack.pop_builder();
+  unsigned len = ((x->bit_size(sgnd) + 7) >> 3);
+  if (len >= (1u << len_bits)) {
+    throw VmError{Excno::range_chk};
+  }
+  if (!(cbr.write().store_long_bool(len, len_bits) && cbr.unique_write().store_int256_bool(*x, len * 8, sgnd))) {
+    if (quiet) {
+      stack.push_bool(false);
+    } else {
+      throw VmError{Excno::cell_ov, "cannot serialize a variable-length integer"};
+    }
+  } else {
+    stack.push_builder(std::move(cbr));
+    if (quiet) {
+      stack.push_bool(true);
+    }
+  }
+  return 0;
+}
+
+bool skip_maybe_anycast(CellSlice& cs) {
+  if (cs.prefetch_ulong(1) != 1) {
+    return cs.advance(1);
+  }
+  unsigned depth;
+  return cs.advance(1)                    // just$1
+         && cs.fetch_uint_leq(30, depth)  // anycast_info$_ depth:(#<= 30)
+         && depth >= 1                    // { depth >= 1 }
+         && cs.advance(depth);            // rewrite_pfx:(bits depth) = Anycast;
+}
+
+bool skip_message_addr(CellSlice& cs) {
+  switch ((unsigned)cs.fetch_ulong(2)) {
+    case 0:  // addr_none$00 = MsgAddressExt;
+      return true;
+    case 1: {  // addr_extern$01
+      unsigned len;
+      return cs.fetch_uint_to(9, len)  // len:(## 9)
+             && cs.advance(len);       // external_address:(bits len) = MsgAddressExt;
+    }
+    case 2: {                         // addr_std$10
+      return skip_maybe_anycast(cs)   // anycast:(Maybe Anycast)
+             && cs.advance(8 + 256);  // workchain_id:int8 address:bits256  = MsgAddressInt;
+    }
+    case 3: {  // addr_var$11
+      unsigned len;
+      return skip_maybe_anycast(cs)       // anycast:(Maybe Anycast)
+             && cs.fetch_uint_to(9, len)  // addr_len:(## 9)
+             && cs.advance(32 + len);     // workchain_id:int32 address:(bits addr_len) = MsgAddressInt;
+    }
+    default:
+      return false;
+  }
+}
+
+int exec_load_message_addr(VmState* st, bool quiet) {
+  VM_LOG(st) << "execute LDMSGADDR" << (quiet ? "Q" : "");
+  Stack& stack = st->get_stack();
+  auto csr = stack.pop_cellslice(), csr_copy = csr;
+  auto& cs = csr.write();
+  if (!(skip_message_addr(cs) && csr_copy.write().cut_tail(cs))) {
+    csr.clear();
+    if (quiet) {
+      stack.push_cellslice(std::move(csr_copy));
+      stack.push_bool(false);
+    } else {
+      throw VmError{Excno::cell_und, "cannot load a MsgAddress"};
+    }
+  } else {
+    stack.push_cellslice(std::move(csr_copy));
+    stack.push_cellslice(std::move(csr));
+    if (quiet) {
+      stack.push_bool(true);
+    }
+  }
+  return 0;
+}
+
+bool parse_maybe_anycast(CellSlice& cs, StackEntry& res) {
+  res = StackEntry{};
+  if (cs.prefetch_ulong(1) != 1) {
+    return cs.advance(1);
+  }
+  unsigned depth;
+  Ref<CellSlice> pfx;
+  if (cs.advance(1)                           // just$1
+      && cs.fetch_uint_leq(30, depth)         // anycast_info$_ depth:(#<= 30)
+      && depth >= 1                           // { depth >= 1 }
+      && cs.fetch_subslice_to(depth, pfx)) {  // rewrite_pfx:(bits depth) = Anycast;
+    res = std::move(pfx);
+    return true;
+  }
+  return false;
+}
+
+bool parse_message_addr(CellSlice& cs, std::vector<StackEntry>& res) {
+  res.clear();
+  switch ((unsigned)cs.fetch_ulong(2)) {
+    case 0:                                      // addr_none$00 = MsgAddressExt;
+      res.emplace_back(td::RefInt256{true, 0});  // -> (0)
+      return true;
+    case 1: {  // addr_extern$01
+      unsigned len;
+      Ref<CellSlice> addr;
+      if (cs.fetch_uint_to(9, len)               // len:(## 9)
+          && cs.fetch_subslice_to(len, addr)) {  // external_address:(bits len) = MsgAddressExt;
+        res.emplace_back(td::RefInt256{true, 1});
+        res.emplace_back(std::move(addr));
+        return true;
+      }
+      break;
+    }
+    case 2: {  // addr_std$10
+      StackEntry v;
+      int workchain;
+      Ref<CellSlice> addr;
+      if (parse_maybe_anycast(cs, v)             // anycast:(Maybe Anycast)
+          && cs.fetch_int_to(8, workchain)       // workchain_id:int8
+          && cs.fetch_subslice_to(256, addr)) {  // address:bits256  = MsgAddressInt;
+        res.emplace_back(td::RefInt256{true, 2});
+        res.emplace_back(std::move(v));
+        res.emplace_back(td::RefInt256{true, workchain});
+        res.emplace_back(std::move(addr));
+        return true;
+      }
+      break;
+    }
+    case 3: {  // addr_var$11
+      StackEntry v;
+      int len, workchain;
+      Ref<CellSlice> addr;
+      if (parse_maybe_anycast(cs, v)             // anycast:(Maybe Anycast)
+          && cs.fetch_uint_to(9, len)            // addr_len:(## 9)
+          && cs.fetch_int_to(32, workchain)      // workchain_id:int32
+          && cs.fetch_subslice_to(len, addr)) {  // address:(bits addr_len) = MsgAddressInt;
+        res.emplace_back(td::RefInt256{true, 3});
+        res.emplace_back(std::move(v));
+        res.emplace_back(td::RefInt256{true, workchain});
+        res.emplace_back(std::move(addr));
+        return true;
+      }
+      break;
+    }
+  }
+  return false;
+}
+
+int exec_parse_message_addr(VmState* st, bool quiet) {
+  VM_LOG(st) << "execute PARSEMSGADDR" << (quiet ? "Q" : "");
+  Stack& stack = st->get_stack();
+  auto csr = stack.pop_cellslice();
+  auto& cs = csr.write();
+  std::vector<StackEntry> res;
+  if (!(parse_message_addr(cs, res) && cs.empty_ext())) {
+    if (quiet) {
+      stack.push_bool(false);
+    } else {
+      throw VmError{Excno::cell_und, "cannot parse a MsgAddress"};
+    }
+  } else {
+    stack.push_tuple(std::move(res));
+    if (quiet) {
+      stack.push_bool(true);
+    }
+  }
+  return 0;
+}
+
+// replaces first bits of `addr` with those of `prefix`
+Ref<CellSlice> do_rewrite_addr(Ref<CellSlice> addr, Ref<CellSlice> prefix) {
+  if (prefix.is_null() || !prefix->size()) {
+    return std::move(addr);
+  }
+  if (prefix->size() > addr->size()) {
+    return {};
+  }
+  if (prefix->size() == addr->size()) {
+    return std::move(prefix);
+  }
+  vm::CellBuilder cb;
+  if (!(addr.write().advance(prefix->size()) && cb.append_cellslice_bool(std::move(prefix)) &&
+        cb.append_cellslice_bool(std::move(addr)))) {
+    return {};
+  }
+  return vm::load_cell_slice_ref(cb.finalize());
+}
+
+int exec_rewrite_message_addr(VmState* st, bool allow_var_addr, bool quiet) {
+  VM_LOG(st) << "execute REWRITE" << (allow_var_addr ? "VAR" : "STD") << "ADDR" << (quiet ? "Q" : "");
+  Stack& stack = st->get_stack();
+  auto csr = stack.pop_cellslice();
+  auto& cs = csr.write();
+  std::vector<StackEntry> tuple;
+  if (!(parse_message_addr(cs, tuple) && cs.empty_ext())) {
+    if (quiet) {
+      stack.push_bool(false);
+      return 0;
+    }
+    throw VmError{Excno::cell_und, "cannot parse a MsgAddress"};
+  }
+  int t = (int)std::move(tuple[0]).as_int()->to_long();
+  if (t != 2 && t != 3) {
+    if (quiet) {
+      stack.push_bool(false);
+      return 0;
+    }
+    throw VmError{Excno::cell_und, "cannot parse a MsgAddressInt"};
+  }
+  auto addr = std::move(tuple[3]).as_slice();
+  auto prefix = std::move(tuple[1]).as_slice();
+  if (!allow_var_addr) {
+    if (addr->size() != 256) {
+      if (quiet) {
+        stack.push_bool(false);
+        return 0;
+      }
+      throw VmError{Excno::cell_und, "MsgAddressInt is not a standard 256-bit address"};
+    }
+    td::Bits256 rw_addr;
+    td::RefInt256 int_addr{true};
+    CHECK(addr->prefetch_bits_to(rw_addr) &&
+          (prefix.is_null() || prefix->prefetch_bits_to(rw_addr.bits(), prefix->size())) &&
+          int_addr.unique_write().import_bits(rw_addr, false));
+    stack.push(std::move(tuple[2]));
+    stack.push(std::move(int_addr));
+  } else {
+    addr = do_rewrite_addr(std::move(addr), std::move(prefix));
+    if (addr.is_null()) {
+      if (quiet) {
+        stack.push_bool(false);
+        return 0;
+      }
+      throw VmError{Excno::cell_und, "cannot rewrite address in a MsgAddressInt"};
+    }
+    stack.push(std::move(tuple[2]));
+    stack.push(std::move(addr));
+  }
+  if (quiet) {
+    stack.push_bool(true);
+  }
+  return 0;
+}
+
+void register_ton_currency_address_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mksimple(0xfa00, 16, "LDGRAMS", std::bind(exec_load_var_integer, _1, 4, false, false)))
+      .insert(OpcodeInstr::mksimple(0xfa01, 16, "LDVARINT16", std::bind(exec_load_var_integer, _1, 4, true, false)))
+      .insert(OpcodeInstr::mksimple(0xfa02, 16, "STGRAMS", std::bind(exec_store_var_integer, _1, 4, false, false)))
+      .insert(OpcodeInstr::mksimple(0xfa03, 16, "STVARINT16", std::bind(exec_store_var_integer, _1, 4, true, false)))
+      .insert(OpcodeInstr::mksimple(0xfa04, 16, "LDVARUINT32", std::bind(exec_load_var_integer, _1, 5, false, false)))
+      .insert(OpcodeInstr::mksimple(0xfa05, 16, "LDVARINT32", std::bind(exec_load_var_integer, _1, 5, true, false)))
+      .insert(OpcodeInstr::mksimple(0xfa06, 16, "STVARUINT32", std::bind(exec_store_var_integer, _1, 5, false, false)))
+      .insert(OpcodeInstr::mksimple(0xfa07, 16, "STVARINT32", std::bind(exec_store_var_integer, _1, 5, true, false)))
+      .insert(OpcodeInstr::mksimple(0xfa40, 16, "LDMSGADDR", std::bind(exec_load_message_addr, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xfa41, 16, "LDMSGADDRQ", std::bind(exec_load_message_addr, _1, true)))
+      .insert(OpcodeInstr::mksimple(0xfa42, 16, "PARSEMSGADDR", std::bind(exec_parse_message_addr, _1, false)))
+      .insert(OpcodeInstr::mksimple(0xfa43, 16, "PARSEMSGADDRQ", std::bind(exec_parse_message_addr, _1, true)))
+      .insert(
+          OpcodeInstr::mksimple(0xfa44, 16, "REWRITESTDADDR", std::bind(exec_rewrite_message_addr, _1, false, false)))
+      .insert(
+          OpcodeInstr::mksimple(0xfa45, 16, "REWRITESTDADDRQ", std::bind(exec_rewrite_message_addr, _1, false, true)))
+      .insert(
+          OpcodeInstr::mksimple(0xfa46, 16, "REWRITEVARADDR", std::bind(exec_rewrite_message_addr, _1, true, false)))
+      .insert(
+          OpcodeInstr::mksimple(0xfa47, 16, "REWRITEVARADDRQ", std::bind(exec_rewrite_message_addr, _1, true, true)));
+}
+
+static constexpr int output_actions_idx = 5;
+
+int install_output_action(VmState* st, Ref<Cell> new_action_head) {
+  // TODO: increase actions:uint16 and msgs_sent:uint16 in SmartContractInfo at first reference of c5
+  VM_LOG(st) << "installing an output action";
+  st->set_d(output_actions_idx, std::move(new_action_head));
+  return 0;
+}
+
+static inline Ref<Cell> get_actions(VmState* st) {
+  return st->get_d(output_actions_idx);
+}
+
+int exec_send_raw_message(VmState* st) {
+  VM_LOG(st) << "execute SENDRAWMSG";
+  Stack& stack = st->get_stack();
+  stack.check_underflow(2);
+  int f = stack.pop_smallint_range(255);
+  Ref<Cell> msg_cell = stack.pop_cell();
+  CellBuilder cb;
+  if (!(cb.store_ref_bool(get_actions(st))     // out_list$_ {n:#} prev:^(OutList n)
+        && cb.store_long_bool(0x0ec3c86d, 32)  // action_send_msg#0ec3c86d
+        && cb.store_long_bool(f, 8)            // mode:(## 8)
+        && cb.store_ref_bool(std::move(msg_cell)))) {
+    throw VmError{Excno::cell_ov, "cannot serialize raw output message into an output action cell"};
+  }
+  return install_output_action(st, cb.finalize());
+}
+
+bool store_grams(CellBuilder& cb, td::RefInt256 value) {
+  int k = value->bit_size(false);
+  return k <= 15 * 8 && cb.store_long_bool((k + 7) >> 3, 4) && cb.store_int256_bool(*value, (k + 7) & -8, false);
+}
+
+int exec_reserve_raw(VmState* st, int mode) {
+  VM_LOG(st) << "execute RESERVERAW" << (mode & 1 ? "X" : "");
+  Stack& stack = st->get_stack();
+  stack.check_underflow(2);
+  int f = stack.pop_smallint_range(3);
+  td::RefInt256 x;
+  Ref<CellSlice> csr;
+  if (mode & 1) {
+    csr = stack.pop_cellslice();
+  } else {
+    x = stack.pop_int_finite();
+    if (td::sgn(x) < 0) {
+      throw VmError{Excno::range_chk, "amount of nanograms must be non-negative"};
+    }
+  }
+  CellBuilder cb;
+  if (!(cb.store_ref_bool(get_actions(st))     // out_list$_ {n:#} prev:^(OutList n)
+        && cb.store_long_bool(0x36e6b809, 32)  // action_reserve_currency#36e6b809
+        && cb.store_long_bool(f, 8)            // mode:(## 8)
+        && (mode & 1 ? cb.append_cellslice_bool(std::move(csr))
+                     : (store_grams(cb, std::move(x)) && cb.store_bool_bool(false))))) {
+    throw VmError{Excno::cell_ov, "cannot serialize raw reserved currency amount into an output action cell"};
+  }
+  return install_output_action(st, cb.finalize());
+}
+
+int exec_set_code(VmState* st) {
+  VM_LOG(st) << "execute SETCODE";
+  auto code = st->get_stack().pop_cell();
+  CellBuilder cb;
+  if (!(cb.store_ref_bool(get_actions(st))         // out_list$_ {n:#} prev:^(OutList n)
+        && cb.store_long_bool(0xad4de08e, 32)      // action_set_code#ad4de08e
+        && cb.store_ref_bool(std::move(code)))) {  // new_code:^Cell = OutAction;
+    throw VmError{Excno::cell_ov, "cannot serialize new smart contract code into an output action cell"};
+  }
+  return install_output_action(st, cb.finalize());
+}
+
+void register_ton_message_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mksimple(0xfb00, 16, "SENDRAWMSG", exec_send_raw_message))
+      .insert(OpcodeInstr::mksimple(0xfb02, 16, "RESERVERAW", std::bind(exec_reserve_raw, _1, 0)))
+      .insert(OpcodeInstr::mksimple(0xfb03, 16, "RESERVERAWX", std::bind(exec_reserve_raw, _1, 1)))
+      .insert(OpcodeInstr::mksimple(0xfb04, 16, "SETCODE", exec_set_code));
+}
+
+void register_ton_ops(OpcodeTable& cp0) {
+  register_basic_gas_ops(cp0);
+  register_ton_gas_ops(cp0);
+  register_ton_config_ops(cp0);
+  register_ton_crypto_ops(cp0);
+  register_ton_currency_address_ops(cp0);
+  register_ton_message_ops(cp0);
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/tonops.h b/submodules/ton/tonlib-src/crypto/vm/tonops.h
new file mode 100644
index 0000000000..c2809e9175
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/tonops.h
@@ -0,0 +1,27 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace vm {
+
+class OpcodeTable;
+
+void register_ton_ops(OpcodeTable& cp0);
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/tupleops.cpp b/submodules/ton/tonlib-src/crypto/vm/tupleops.cpp
new file mode 100644
index 0000000000..de4de83465
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/tupleops.cpp
@@ -0,0 +1,381 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "vm/log.h"
+#include "vm/stackops.h"
+#include "vm/opctable.h"
+#include "vm/stack.hpp"
+#include "vm/continuation.h"
+#include "vm/excno.hpp"
+
+namespace vm {
+
+int exec_push_null(VmState* st) {
+  VM_LOG(st) << "execute PUSHNULL";
+  st->get_stack().push({});
+  return 0;
+}
+
+int exec_is_null(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ISNULL";
+  stack.push_bool(stack.pop_chk().empty());
+  return 0;
+}
+
+int exec_null_swap_if(VmState* st, bool cond, int depth) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute NULL" << (depth ? "ROTR" : "SWAP") << (cond ? "IF" : "IFNOT");
+  stack.check_underflow(depth + 1);
+  auto x = stack.pop_int_finite();
+  if (!x->sgn() != cond) {
+    stack.push({});
+    for (int i = 0; i < depth; i++) {
+      swap(stack[i], stack[i + 1]);
+    }
+  }
+  stack.push_int(std::move(x));
+  return 0;
+}
+
+int exec_mktuple_common(VmState* st, unsigned n) {
+  Stack& stack = st->get_stack();
+  stack.check_underflow(n);
+  Ref<Tuple> ref{true};
+  auto& tuple = ref.unique_write();
+  tuple.reserve(n);
+  for (int i = n - 1; i >= 0; i--) {
+    tuple.push_back(std::move(stack[i]));
+  }
+  stack.pop_many(n);
+  st->consume_tuple_gas(n);
+  stack.push_tuple(std::move(ref));
+  return 0;
+}
+
+int exec_mktuple(VmState* st, unsigned args) {
+  args &= 15;
+  VM_LOG(st) << "execute TUPLE " << args;
+  return exec_mktuple_common(st, args);
+}
+
+int exec_mktuple_var(VmState* st) {
+  VM_LOG(st) << "execute TUPLEVAR";
+  unsigned args = st->get_stack().pop_smallint_range(255);
+  return exec_mktuple_common(st, args);
+}
+
+int exec_tuple_index_common(Stack& stack, unsigned n) {
+  auto tuple = stack.pop_tuple_range(255);
+  stack.push(tuple_index(*tuple, n));
+  return 0;
+}
+
+int exec_tuple_index(VmState* st, unsigned args) {
+  args &= 15;
+  VM_LOG(st) << "execute INDEX " << args;
+  return exec_tuple_index_common(st->get_stack(), args);
+}
+
+int exec_tuple_index_var(VmState* st) {
+  VM_LOG(st) << "execute INDEXVAR";
+  st->check_underflow(2);
+  unsigned args = st->get_stack().pop_smallint_range(254);
+  return exec_tuple_index_common(st->get_stack(), args);
+}
+
+int exec_tuple_quiet_index_common(Stack& stack, unsigned n) {
+  stack.push(tuple_extend_index(stack.pop_maybe_tuple_range(255), n));
+  return 0;
+}
+
+int exec_tuple_quiet_index(VmState* st, unsigned args) {
+  args &= 15;
+  VM_LOG(st) << "execute INDEXQ " << args;
+  return exec_tuple_quiet_index_common(st->get_stack(), args);
+}
+
+int exec_tuple_quiet_index_var(VmState* st) {
+  VM_LOG(st) << "execute INDEXVARQ";
+  st->check_underflow(2);
+  unsigned args = st->get_stack().pop_smallint_range(254);
+  return exec_tuple_quiet_index_common(st->get_stack(), args);
+}
+
+int do_explode_tuple(VmState* st, Ref<Tuple> tuple, unsigned n) {
+  auto& stack = st->get_stack();
+  if (tuple.is_unique()) {
+    auto& tw = tuple.unique_write();
+    for (unsigned i = 0; i < n; i++) {
+      stack.push(std::move(tw[i]));
+    }
+  } else {
+    const auto& t = *tuple;
+    for (unsigned i = 0; i < n; i++) {
+      stack.push(t[i]);
+    }
+  }
+  st->consume_tuple_gas(n);
+  return 0;
+}
+
+int exec_untuple_common(VmState* st, unsigned n) {
+  return do_explode_tuple(st, st->get_stack().pop_tuple_range(n, n), n);
+}
+
+int exec_untuple(VmState* st, unsigned args) {
+  args &= 15;
+  VM_LOG(st) << "execute UNTUPLE " << args;
+  return exec_untuple_common(st, args);
+}
+
+int exec_untuple_var(VmState* st) {
+  VM_LOG(st) << "execute UNTUPLEVAR";
+  st->check_underflow(2);
+  unsigned args = st->get_stack().pop_smallint_range(255);
+  return exec_untuple_common(st, args);
+}
+
+int exec_untuple_first_common(VmState* st, unsigned n) {
+  return do_explode_tuple(st, st->get_stack().pop_tuple_range(255, n), n);
+}
+
+int exec_untuple_first(VmState* st, unsigned args) {
+  args &= 15;
+  VM_LOG(st) << "execute UNPACKFIRST " << args;
+  return exec_untuple_first_common(st, args);
+}
+
+int exec_untuple_first_var(VmState* st) {
+  VM_LOG(st) << "execute UNPACKFIRSTVAR";
+  st->check_underflow(2);
+  unsigned args = st->get_stack().pop_smallint_range(255);
+  return exec_untuple_first_common(st, args);
+}
+
+int exec_explode_tuple_common(VmState* st, unsigned n) {
+  auto t = st->get_stack().pop_tuple_range(n);
+  unsigned l = (unsigned)(t->size());
+  do_explode_tuple(st, std::move(t), l);
+  st->get_stack().push_smallint(l);
+  return 0;
+}
+
+int exec_explode_tuple(VmState* st, unsigned args) {
+  args &= 15;
+  VM_LOG(st) << "execute EXPLODE " << args;
+  return exec_explode_tuple_common(st, args);
+}
+
+int exec_explode_tuple_var(VmState* st) {
+  VM_LOG(st) << "execute EXPLODEVAR";
+  st->check_underflow(2);
+  unsigned args = st->get_stack().pop_smallint_range(255);
+  return exec_explode_tuple_common(st, args);
+}
+
+int exec_tuple_set_index_common(VmState* st, unsigned idx) {
+  Stack& stack = st->get_stack();
+  auto x = stack.pop();
+  auto tuple = stack.pop_tuple_range(255);
+  if (idx >= tuple->size()) {
+    throw VmError{Excno::range_chk, "tuple index out of range"};
+  }
+  tuple.write()[idx] = std::move(x);
+  st->consume_tuple_gas(tuple);
+  stack.push(std::move(tuple));
+  return 0;
+}
+
+int exec_tuple_set_index(VmState* st, unsigned args) {
+  args &= 15;
+  VM_LOG(st) << "execute SETINDEX " << args;
+  st->check_underflow(2);
+  return exec_tuple_set_index_common(st, args);
+}
+
+int exec_tuple_set_index_var(VmState* st) {
+  VM_LOG(st) << "execute SETINDEXVAR";
+  st->check_underflow(3);
+  unsigned args = st->get_stack().pop_smallint_range(254);
+  return exec_tuple_set_index_common(st, args);
+}
+
+int exec_tuple_quiet_set_index_common(VmState* st, unsigned idx) {
+  Stack& stack = st->get_stack();
+  auto x = stack.pop();
+  auto tuple = stack.pop_maybe_tuple_range(255);
+  if (idx >= 255) {
+    throw VmError{Excno::range_chk, "tuple index out of range"};
+  }
+  auto tpay = tuple_extend_set_index(tuple, idx, std::move(x));
+  if (tpay > 0) {
+    st->consume_tuple_gas(tpay);
+  }
+  stack.push_maybe_tuple(std::move(tuple));
+  return 0;
+}
+
+int exec_tuple_quiet_set_index(VmState* st, unsigned args) {
+  args &= 15;
+  VM_LOG(st) << "execute SETINDEXQ " << args;
+  st->check_underflow(2);
+  return exec_tuple_quiet_set_index_common(st, args);
+}
+
+int exec_tuple_quiet_set_index_var(VmState* st) {
+  VM_LOG(st) << "execute SETINDEXVARQ";
+  st->check_underflow(3);
+  unsigned args = st->get_stack().pop_smallint_range(254);
+  return exec_tuple_quiet_set_index_common(st, args);
+}
+
+int exec_tuple_length(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute TLEN";
+  auto t = stack.pop_tuple_range(255);
+  stack.push_smallint((long long)(t->size()));
+  return 0;
+}
+
+int exec_tuple_length_quiet(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute QTLEN";
+  auto t = stack.pop_chk();
+  stack.push_smallint(t.is_tuple() ? (long long)(t.as_tuple()->size()) : -1LL);
+  return 0;
+}
+
+int exec_is_tuple(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute ISTUPLE";
+  stack.push_bool(stack.pop_chk().is_tuple());
+  return 0;
+}
+
+int exec_tuple_last(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute LAST";
+  auto t = stack.pop_tuple_range(255, 1);
+  stack.push(t->back());
+  return 0;
+}
+
+int exec_tuple_push(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute TPUSH";
+  stack.check_underflow(2);
+  auto x = stack.pop();
+  auto t = stack.pop_tuple_range(254);
+  t.write().push_back(std::move(x));
+  st->consume_tuple_gas(t);
+  stack.push(std::move(t));
+  return 0;
+}
+
+int exec_tuple_pop(VmState* st) {
+  Stack& stack = st->get_stack();
+  VM_LOG(st) << "execute TPOP";
+  auto t = stack.pop_tuple_range(255, 1);
+  auto x = std::move(t.write().back());
+  t.write().pop_back();
+  st->consume_tuple_gas(t);
+  stack.push(std::move(t));
+  stack.push(std::move(x));
+  return 0;
+}
+
+int exec_tuple_index2(VmState* st, unsigned args) {
+  unsigned i = (args >> 2) & 3, j = args & 3;
+  VM_LOG(st) << "execute INDEX2 " << i << "," << j;
+  Stack& stack = st->get_stack();
+  auto tuple = stack.pop_tuple_range(255);
+  auto t1 = tuple_index(*tuple, i).as_tuple_range(255);
+  if (t1.is_null()) {
+    throw VmError{Excno::type_chk, "intermediate value is not a tuple"};
+  }
+  stack.push(tuple_index(*t1, j));
+  return 0;
+}
+
+std::string dump_tuple_index2(CellSlice& cs, unsigned args) {
+  unsigned i = (args >> 2) & 3, j = args & 3;
+  std::ostringstream os;
+  os << "INDEX2 " << i << ',' << j;
+  return os.str();
+}
+
+int exec_tuple_index3(VmState* st, unsigned args) {
+  unsigned i = (args >> 4) & 3, j = (args >> 2) & 3, k = args & 3;
+  VM_LOG(st) << "execute INDEX3 " << i << "," << j << "," << k;
+  Stack& stack = st->get_stack();
+  auto tuple = stack.pop_tuple_range(255);
+  auto t1 = tuple_index(*tuple, i).as_tuple_range(255);
+  if (t1.is_null()) {
+    throw VmError{Excno::type_chk, "intermediate value is not a tuple"};
+  }
+  auto t2 = tuple_index(*t1, j).as_tuple_range(255);
+  if (t2.is_null()) {
+    throw VmError{Excno::type_chk, "intermediate value is not a tuple"};
+  }
+  stack.push(tuple_index(*t2, k));
+  return 0;
+}
+
+std::string dump_tuple_index3(CellSlice& cs, unsigned args) {
+  unsigned i = (args >> 4) & 3, j = (args >> 2) & 3, k = args & 3;
+  std::ostringstream os;
+  os << "INDEX3 " << i << ',' << j << ',' << k;
+  return os.str();
+}
+
+void register_tuple_ops(OpcodeTable& cp0) {
+  using namespace std::placeholders;
+  cp0.insert(OpcodeInstr::mksimple(0x6d, 8, "PUSHNULL", exec_push_null))
+      .insert(OpcodeInstr::mksimple(0x6e, 8, "ISNULL", exec_is_null))
+      .insert(OpcodeInstr::mkfixed(0x6f0, 12, 4, instr::dump_1c("TUPLE "), exec_mktuple))
+      .insert(OpcodeInstr::mkfixed(0x6f1, 12, 4, instr::dump_1c("INDEX "), exec_tuple_index))
+      .insert(OpcodeInstr::mkfixed(0x6f2, 12, 4, instr::dump_1c("UNTUPLE "), exec_untuple))
+      .insert(OpcodeInstr::mkfixed(0x6f3, 12, 4, instr::dump_1c("UNPACKFIRST "), exec_untuple_first))
+      .insert(OpcodeInstr::mkfixed(0x6f4, 12, 4, instr::dump_1c("EXPLODE "), exec_explode_tuple))
+      .insert(OpcodeInstr::mkfixed(0x6f5, 12, 4, instr::dump_1c("SETINDEX "), exec_tuple_set_index))
+      .insert(OpcodeInstr::mkfixed(0x6f6, 12, 4, instr::dump_1c("INDEXQ "), exec_tuple_quiet_index))
+      .insert(OpcodeInstr::mkfixed(0x6f7, 12, 4, instr::dump_1c("SETINDEXQ "), exec_tuple_quiet_set_index))
+      .insert(OpcodeInstr::mksimple(0x6f80, 16, "TUPLEVAR", exec_mktuple_var))
+      .insert(OpcodeInstr::mksimple(0x6f81, 16, "INDEXVAR", exec_tuple_index_var))
+      .insert(OpcodeInstr::mksimple(0x6f82, 16, "UNTUPLEVAR", exec_untuple_var))
+      .insert(OpcodeInstr::mksimple(0x6f83, 16, "UNPACKFIRSTVAR", exec_untuple_first_var))
+      .insert(OpcodeInstr::mksimple(0x6f84, 16, "EXPLODEVAR", exec_explode_tuple_var))
+      .insert(OpcodeInstr::mksimple(0x6f85, 16, "SETINDEXVAR", exec_tuple_set_index_var))
+      .insert(OpcodeInstr::mksimple(0x6f86, 16, "INDEXVARQ", exec_tuple_quiet_index_var))
+      .insert(OpcodeInstr::mksimple(0x6f87, 16, "SETINDEXVARQ", exec_tuple_quiet_set_index_var))
+      .insert(OpcodeInstr::mksimple(0x6f88, 16, "TLEN", exec_tuple_length))
+      .insert(OpcodeInstr::mksimple(0x6f89, 16, "QTLEN", exec_tuple_length_quiet))
+      .insert(OpcodeInstr::mksimple(0x6f8a, 16, "ISTUPLE", exec_is_tuple))
+      .insert(OpcodeInstr::mksimple(0x6f8b, 16, "LAST", exec_tuple_last))
+      .insert(OpcodeInstr::mksimple(0x6f8c, 16, "TPUSH", exec_tuple_push))
+      .insert(OpcodeInstr::mksimple(0x6f8d, 16, "TPOP", exec_tuple_pop))
+      .insert(OpcodeInstr::mksimple(0x6fa0, 16, "NULLSWAPIF", std::bind(exec_null_swap_if, _1, true, 0)))
+      .insert(OpcodeInstr::mksimple(0x6fa1, 16, "NULLSWAPIFNOT", std::bind(exec_null_swap_if, _1, false, 0)))
+      .insert(OpcodeInstr::mksimple(0x6fa2, 16, "NULLROTRIF", std::bind(exec_null_swap_if, _1, true, 1)))
+      .insert(OpcodeInstr::mksimple(0x6fa3, 16, "NULLROTRIFNOT", std::bind(exec_null_swap_if, _1, false, 1)))
+      .insert(OpcodeInstr::mkfixed(0x6fb, 12, 4, dump_tuple_index2, exec_tuple_index2))
+      .insert(OpcodeInstr::mkfixed(0x6fc >> 2, 10, 6, dump_tuple_index3, exec_tuple_index3));
+}
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/tupleops.h b/submodules/ton/tonlib-src/crypto/vm/tupleops.h
new file mode 100644
index 0000000000..cef8a0f4b5
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/tupleops.h
@@ -0,0 +1,27 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace vm {
+
+class OpcodeTable;
+
+void register_tuple_ops(OpcodeTable& cp0);
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/crypto/vm/vmstate.h b/submodules/ton/tonlib-src/crypto/vm/vmstate.h
new file mode 100644
index 0000000000..312b662688
--- /dev/null
+++ b/submodules/ton/tonlib-src/crypto/vm/vmstate.h
@@ -0,0 +1,39 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "common/refcnt.hpp"
+#include "vm/cells.h"
+
+#include "td/utils/Context.h"
+
+namespace vm {
+using td::Ref;
+
+class VmStateInterface : public td::Context<VmStateInterface> {
+ public:
+  virtual ~VmStateInterface() = default;
+  virtual Ref<vm::Cell> load_library(
+      td::ConstBitPtr hash) {  // may throw a dictionary exception; returns nullptr if library is not found
+    return {};
+  }
+  virtual void register_cell_load(){};
+  virtual void register_cell_create(){};
+};
+
+}  // namespace vm
diff --git a/submodules/ton/tonlib-src/keys/CMakeLists.txt b/submodules/ton/tonlib-src/keys/CMakeLists.txt
new file mode 100644
index 0000000000..486119de60
--- /dev/null
+++ b/submodules/ton/tonlib-src/keys/CMakeLists.txt
@@ -0,0 +1,14 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+set(KEYS_SOURCE
+  keys.cpp
+  encryptor.cpp
+  keys.hpp
+  encryptor.h
+  encryptor.hpp
+)
+
+add_library(keys STATIC ${KEYS_SOURCE})
+
+target_include_directories(keys PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/..>)
+target_link_libraries(keys PUBLIC tdactor ton_crypto tl_api tl-utils )
diff --git a/submodules/ton/tonlib-src/keys/encryptor.cpp b/submodules/ton/tonlib-src/keys/encryptor.cpp
new file mode 100644
index 0000000000..9f7989e7c5
--- /dev/null
+++ b/submodules/ton/tonlib-src/keys/encryptor.cpp
@@ -0,0 +1,205 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/crypto.h"
+#include "td/utils/overloaded.h"
+
+#include "encryptor.h"
+#include "encryptor.hpp"
+#include "auto/tl/ton_api.hpp"
+
+#include "common/status.h"
+#include "common/errorcode.h"
+#include "keys.hpp"
+
+namespace ton {
+
+td::Result<std::unique_ptr<Encryptor>> Encryptor::create(const ton_api::PublicKey *id) {
+  td::Result<std::unique_ptr<Encryptor>> res;
+  ton_api::downcast_call(
+      *const_cast<ton_api::PublicKey *>(id),
+      td::overloaded([&](const ton_api::pub_unenc &obj) { res = std::make_unique<EncryptorNone>(); },
+                     [&](const ton_api::pub_ed25519 &obj) { res = std::make_unique<EncryptorEd25519>(obj.key_); },
+                     [&](const ton_api::pub_overlay &obj) { res = std::make_unique<EncryptorOverlay>(); },
+                     [&](const ton_api::pub_aes &obj) { res = std::make_unique<EncryptorAES>(obj.key_); }));
+  return res;
+}
+
+td::Result<std::unique_ptr<Decryptor>> Decryptor::create(const ton_api::PrivateKey *id) {
+  td::Result<std::unique_ptr<Decryptor>> res;
+  ton_api::downcast_call(
+      *const_cast<ton_api::PrivateKey *>(id),
+      td::overloaded([&](const ton_api::pk_unenc &obj) { res = std::make_unique<DecryptorNone>(); },
+                     [&](const ton_api::pk_ed25519 &obj) { res = std::make_unique<DecryptorEd25519>(obj.key_); },
+                     [&](const ton_api::pk_overlay &obj) { res = std::make_unique<DecryptorFail>(); },
+                     [&](const ton_api::pk_aes &obj) { res = std::make_unique<DecryptorAES>(obj.key_); }));
+  return res;
+}
+
+td::Result<td::BufferSlice> EncryptorEd25519::encrypt(td::Slice data) {
+  TRY_RESULT_PREFIX(pk, td::Ed25519::generate_private_key(), "failed to generate private key: ");
+  TRY_RESULT_PREFIX(pubkey, pk.get_public_key(), "failed to get public key from private: ");
+  auto pubkey_str = pubkey.as_octet_string();
+
+  td::BufferSlice msg(pubkey_str.size() + 32 + data.size());
+  td::MutableSlice slice = msg.as_slice();
+  slice.copy_from(pubkey_str);
+  slice.remove_prefix(pubkey_str.size());
+
+  TRY_RESULT_PREFIX(shared_secret, td::Ed25519::compute_shared_secret(pub_, pk), "failed to compute shared secret: ");
+
+  td::MutableSlice digest = slice.substr(0, 32);
+  slice.remove_prefix(32);
+  td::sha256(data, digest);
+
+  td::SecureString key(32);
+  {
+    auto S = key.as_mutable_slice();
+    S.copy_from(td::Slice(shared_secret).truncate(16));
+    S.remove_prefix(16);
+    S.copy_from(digest.copy().remove_prefix(16).truncate(16));
+  }
+
+  td::SecureString iv(16);
+  {
+    auto S = iv.as_mutable_slice();
+    S.copy_from(digest.copy().truncate(4));
+    S.remove_prefix(4);
+    S.copy_from(td::Slice(shared_secret).remove_prefix(20).truncate(12));
+  }
+
+  td::AesCtrState ctr;
+  ctr.init(key, iv);
+  ctr.encrypt(data, slice);
+
+  return std::move(msg);
+}
+
+td::Status EncryptorEd25519::check_signature(td::Slice message, td::Slice signature) {
+  return td::status_prefix(pub_.verify_signature(message, signature), "bad signature: ");
+}
+
+td::Result<td::BufferSlice> DecryptorEd25519::decrypt(td::Slice data) {
+  if (data.size() < td::Ed25519::PublicKey::LENGTH + 32) {
+    return td::Status::Error(ErrorCode::protoviolation, "message is too short");
+  }
+
+  td::Slice pub = data.substr(0, td::Ed25519::PublicKey::LENGTH);
+  data.remove_prefix(td::Ed25519::PublicKey::LENGTH);
+
+  td::Slice digest = data.substr(0, 32);
+  data.remove_prefix(32);
+
+  TRY_RESULT_PREFIX(shared_secret,
+                    td::Ed25519::compute_shared_secret(td::Ed25519::PublicKey(td::SecureString(pub)), pk_),
+                    "failed to generate shared secret: ");
+
+  td::SecureString key(32);
+  key.as_mutable_slice().copy_from(td::Slice(shared_secret).substr(0, 16));
+  key.as_mutable_slice().substr(16).copy_from(digest.substr(16, 16));
+
+  td::SecureString iv(16);
+  iv.as_mutable_slice().copy_from(digest.substr(0, 4));
+  iv.as_mutable_slice().substr(4).copy_from(td::Slice(shared_secret).substr(20, 12));
+
+  td::BufferSlice res(data.size());
+
+  td::AesCtrState ctr;
+  ctr.init(key, iv);
+  ctr.encrypt(data, res.as_slice());
+
+  td::UInt256 real_digest;
+  td::sha256(res.as_slice(), as_slice(real_digest));
+
+  if (as_slice(real_digest) != digest) {
+    return td::Status::Error(ErrorCode::protoviolation, "sha256 mismatch after decryption");
+  }
+
+  return std::move(res);
+}
+
+td::Result<td::BufferSlice> DecryptorEd25519::sign(td::Slice data) {
+  TRY_RESULT_PREFIX(signature, pk_.sign(data), "failed to sign: ");
+  return td::BufferSlice(signature);
+}
+
+td::Result<td::BufferSlice> EncryptorAES::encrypt(td::Slice data) {
+  td::BufferSlice msg(32 + data.size());
+  td::MutableSlice slice = msg.as_slice();
+
+  td::MutableSlice digest = slice.substr(0, 32);
+  slice.remove_prefix(32);
+  td::sha256(data, digest);
+
+  td::SecureString key(32);
+  key.as_mutable_slice().copy_from(shared_secret_.as_slice().substr(0, 16));
+  key.as_mutable_slice().substr(16).copy_from(digest.substr(16, 16));
+
+  td::SecureString iv(16);
+  iv.as_mutable_slice().copy_from(digest.substr(0, 4));
+  iv.as_mutable_slice().substr(4).copy_from(shared_secret_.as_slice().substr(20, 12));
+
+  td::AesCtrState ctr;
+  ctr.init(key, iv);
+  ctr.encrypt(data, slice);
+
+  return std::move(msg);
+}
+
+td::Result<td::BufferSlice> DecryptorAES::decrypt(td::Slice data) {
+  if (data.size() < 32) {
+    return td::Status::Error(ErrorCode::protoviolation, "message is too short");
+  }
+
+  td::Slice digest = data.substr(0, 32);
+  data.remove_prefix(32);
+
+  td::SecureString key(32);
+  key.as_mutable_slice().copy_from(shared_secret_.as_slice().substr(0, 16));
+  key.as_mutable_slice().substr(16).copy_from(digest.substr(16, 16));
+
+  td::SecureString iv(16);
+  iv.as_mutable_slice().copy_from(digest.substr(0, 4));
+  iv.as_mutable_slice().substr(4).copy_from(shared_secret_.as_slice().substr(20, 12));
+
+  td::BufferSlice res(data.size());
+
+  td::AesCtrState ctr;
+  ctr.init(key, iv);
+  ctr.encrypt(data, res.as_slice());
+
+  td::UInt256 real_digest;
+  td::sha256(res.as_slice(), as_slice(real_digest));
+
+  if (as_slice(real_digest) != digest) {
+    return td::Status::Error(ErrorCode::protoviolation, "sha256 mismatch after decryption");
+  }
+
+  return std::move(res);
+}
+
+std::vector<td::Result<td::BufferSlice>> Decryptor::sign_batch(std::vector<td::Slice> data) {
+  std::vector<td::Result<td::BufferSlice>> r;
+  r.resize(data.size());
+  for (size_t i = 0; i < data.size(); i++) {
+    r[i] = sign(data[i]);
+  }
+  return r;
+}
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/keys/encryptor.h b/submodules/ton/tonlib-src/keys/encryptor.h
new file mode 100644
index 0000000000..22e3b30ede
--- /dev/null
+++ b/submodules/ton/tonlib-src/keys/encryptor.h
@@ -0,0 +1,109 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/actor.h"
+#include "td/utils/buffer.h"
+#include "td/utils/Status.h"
+#include "td/actor/PromiseFuture.h"
+#include "auto/tl/ton_api.h"
+
+namespace ton {
+
+class Encryptor {
+ public:
+  virtual td::Result<td::BufferSlice> encrypt(td::Slice data) = 0;
+  virtual td::Status check_signature(td::Slice message, td::Slice signature) = 0;
+  virtual ~Encryptor() = default;
+  static td::Result<std::unique_ptr<Encryptor>> create(const ton_api::PublicKey *id);
+};
+
+class Decryptor {
+ public:
+  virtual td::Result<td::BufferSlice> decrypt(td::Slice data) = 0;
+  virtual td::Result<td::BufferSlice> sign(td::Slice data) = 0;
+  virtual std::vector<td::Result<td::BufferSlice>> sign_batch(std::vector<td::Slice> data);
+  virtual ~Decryptor() = default;
+  static td::Result<std::unique_ptr<Decryptor>> create(const ton_api::PrivateKey *id);
+};
+
+class EncryptorAsync : public td::actor::Actor {
+ private:
+  std::unique_ptr<Encryptor> encryptor_;
+
+ public:
+  EncryptorAsync(std::unique_ptr<Encryptor> encryptor) : encryptor_(std::move(encryptor)) {
+  }
+  void check_signature(td::BufferSlice data, td::BufferSlice signature, td::Promise<td::Unit> promise) {
+    auto res = encryptor_->check_signature(data.as_slice(), signature.as_slice());
+    if (res.is_ok()) {
+      promise.set_value(td::Unit());
+    } else {
+      promise.set_error(res.move_as_error());
+    }
+  }
+  void encrypt(td::BufferSlice data, td::Promise<td::BufferSlice> promise) {
+    promise.set_result(encryptor_->encrypt(data.as_slice()));
+  }
+  template <class T>
+  static td::Result<td::actor::ActorOwn<EncryptorAsync>> create(T &id) {
+    TRY_RESULT(d, Encryptor::create(id));
+    return td::actor::create_actor<EncryptorAsync>("encryptor", std::move(d));
+  }
+  template <class T>
+  static td::Result<td::actor::ActorOwn<EncryptorAsync>> create(T *id) {
+    TRY_RESULT(d, Encryptor::create(id));
+    return td::actor::create_actor<EncryptorAsync>("encryptor", std::move(d));
+  }
+};
+
+class DecryptorAsync : public td::actor::Actor {
+ private:
+  std::unique_ptr<Decryptor> decryptor_;
+
+ public:
+  DecryptorAsync(std::unique_ptr<Decryptor> decryptor) : decryptor_(std::move(decryptor)) {
+  }
+  auto decrypt(td::BufferSlice data) {
+    return decryptor_->decrypt(data.as_slice());
+  }
+  auto sign(td::BufferSlice data) {
+    return decryptor_->sign(data.as_slice());
+  }
+  auto sign_batch(std::vector<td::BufferSlice> data) {
+    std::vector<td::Slice> v;
+    v.resize(data.size());
+    for (size_t i = 0; i < data.size(); i++) {
+      v[i] = data[i].as_slice();
+    }
+    return decryptor_->sign_batch(v);
+  }
+  template <class T>
+  static td::Result<td::actor::ActorOwn<DecryptorAsync>> create(T &id) {
+    TRY_RESULT(d, Decryptor::create(id));
+    return td::actor::create_actor<DecryptorAsync>("decryptor", std::move(d));
+  }
+  template <class T>
+  static td::Result<td::actor::ActorOwn<DecryptorAsync>> create(T *id) {
+    TRY_RESULT(d, Decryptor::create(id));
+    return td::actor::create_actor<DecryptorAsync>("decryptor", std::move(d));
+  }
+};
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/keys/encryptor.hpp b/submodules/ton/tonlib-src/keys/encryptor.hpp
new file mode 100644
index 0000000000..a07f635501
--- /dev/null
+++ b/submodules/ton/tonlib-src/keys/encryptor.hpp
@@ -0,0 +1,154 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "encryptor.h"
+#include "crypto/Ed25519.h"
+#include "auto/tl/ton_api.h"
+#include "tl-utils/tl-utils.hpp"
+
+namespace ton {
+
+class EncryptorNone : public Encryptor {
+ public:
+  td::Result<td::BufferSlice> encrypt(td::Slice data) override {
+    return td::BufferSlice(data);
+  }
+  td::Status check_signature(td::Slice message, td::Slice signature) override {
+    return td::Status::OK();
+  }
+
+  EncryptorNone() {
+  }
+};
+
+class DecryptorNone : public Decryptor {
+ public:
+  td::Result<td::BufferSlice> decrypt(td::Slice data) override {
+    return td::BufferSlice(data);
+  }
+  td::Result<td::BufferSlice> sign(td::Slice data) override {
+    return td::BufferSlice("");
+  }
+  DecryptorNone() {
+  }
+};
+
+class EncryptorFail : public Encryptor {
+ public:
+  td::Result<td::BufferSlice> encrypt(td::Slice data) override {
+    return td::Status::Error("Fail encryptor");
+  }
+  td::Status check_signature(td::Slice message, td::Slice signature) override {
+    return td::Status::Error("Fail encryptor");
+  }
+
+  EncryptorFail() {
+  }
+};
+
+class DecryptorFail : public Decryptor {
+ public:
+  td::Result<td::BufferSlice> decrypt(td::Slice data) override {
+    return td::Status::Error("Fail decryptor");
+  }
+  td::Result<td::BufferSlice> sign(td::Slice data) override {
+    return td::Status::Error("Fail decryptor");
+  }
+  DecryptorFail() {
+  }
+};
+
+class EncryptorEd25519 : public Encryptor {
+ private:
+  td::Ed25519::PublicKey pub_;
+
+ public:
+  td::Result<td::BufferSlice> encrypt(td::Slice data) override;
+  td::Status check_signature(td::Slice message, td::Slice signature) override;
+
+  EncryptorEd25519(td::Bits256 key) : pub_(td::SecureString(as_slice(key))) {
+  }
+};
+
+class DecryptorEd25519 : public Decryptor {
+ private:
+  td::Ed25519::PrivateKey pk_;
+
+ public:
+  td::Result<td::BufferSlice> decrypt(td::Slice data) override;
+  td::Result<td::BufferSlice> sign(td::Slice data) override;
+  DecryptorEd25519(td::Bits256 key) : pk_(td::SecureString(as_slice(key))) {
+  }
+};
+
+class EncryptorOverlay : public Encryptor {
+ public:
+  EncryptorOverlay() {
+  }
+  td::Result<td::BufferSlice> encrypt(td::Slice data) override {
+    return td::Status::Error("overlay id can not be used for encryption");
+  }
+  td::Status check_signature(td::Slice message, td::Slice signature) override {
+    auto R = fetch_tl_object<ton_api::dht_keyDescription>(message, true);
+    if (R.is_error()) {
+      return R.move_as_error();
+    }
+    if (signature.size() > 0) {
+      return td::Status::Error("overlay signature must be empty");
+    }
+    auto G = R.move_as_ok();
+    if (G->update_rule_->get_id() != ton_api::dht_updateRule_overlayNodes::ID) {
+      return td::Status::Error("overlay update rule should be 'overlayNodes'");
+    }
+    if (G->signature_.size() > 0) {
+      return td::Status::Error("overlay signature must be empty");
+    }
+    return td::Status::OK();
+  }
+};
+
+class EncryptorAES : public Encryptor {
+ private:
+  td::Bits256 shared_secret_;
+
+ public:
+  td::Result<td::BufferSlice> encrypt(td::Slice data) override;
+  td::Status check_signature(td::Slice message, td::Slice signature) override {
+    return td::Status::Error("can no sign channel messages");
+  }
+
+  EncryptorAES(td::Bits256 shared_secret) : shared_secret_(shared_secret) {
+  }
+};
+
+class DecryptorAES : public Decryptor {
+ private:
+  td::Bits256 shared_secret_;
+
+ public:
+  td::Result<td::BufferSlice> decrypt(td::Slice data) override;
+  td::Result<td::BufferSlice> sign(td::Slice data) override {
+    return td::Status::Error("can no sign channel messages");
+  }
+  DecryptorAES(td::Bits256 shared_secret) : shared_secret_(shared_secret) {
+  }
+};
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/keys/keys.cpp b/submodules/ton/tonlib-src/keys/keys.cpp
new file mode 100644
index 0000000000..97814cb3f6
--- /dev/null
+++ b/submodules/ton/tonlib-src/keys/keys.cpp
@@ -0,0 +1,198 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "keys.hpp"
+#include "auto/tl/ton_api.hpp"
+#include "td/utils/overloaded.h"
+#include "tl-utils/tl-utils.hpp"
+#include "encryptor.h"
+#include "crypto/Ed25519.h"
+
+namespace ton {
+
+PublicKeyHash::PublicKeyHash(const tl_object_ptr<ton_api::PublicKey> &value) {
+  value_ = get_tl_object_sha_bits256(value);
+}
+
+PublicKey::PublicKey(const tl_object_ptr<ton_api::PublicKey> &id) {
+  ton_api::downcast_call(
+      *const_cast<ton_api::PublicKey *>(id.get()),
+      td::overloaded([&](const ton_api::pub_ed25519 &obj) { this->pub_key_ = pubkeys::Ed25519{obj}; },
+                     [&](const ton_api::pub_aes &obj) { this->pub_key_ = pubkeys::AES{obj}; },
+                     [&](const ton_api::pub_unenc &obj) { this->pub_key_ = pubkeys::Unenc{obj}; },
+                     [&](const ton_api::pub_overlay &obj) { this->pub_key_ = pubkeys::Overlay{obj}; }));
+}
+
+PublicKeyHash PublicKey::compute_short_id() const {
+  return PublicKeyHash{get_tl_object_sha_bits256(tl())};
+}
+
+td::uint32 PublicKey::serialized_size() const {
+  td::uint32 res = 0;
+  pub_key_.visit([&](auto &obj) { res = obj.serialized_size(); });
+  return res;
+}
+
+tl_object_ptr<ton_api::PublicKey> PublicKey::tl() const {
+  tl_object_ptr<ton_api::PublicKey> res;
+  pub_key_.visit([&](auto &obj) { res = obj.tl(); });
+  return res;
+}
+
+td::BufferSlice PublicKey::export_as_slice() const {
+  return serialize_tl_object(tl(), true);
+}
+
+td::Result<PublicKey> PublicKey::import(td::Slice s) {
+  TRY_RESULT(x, fetch_tl_object<ton_api::PublicKey>(s, true));
+  return PublicKey{x};
+}
+
+td::Result<std::unique_ptr<Encryptor>> PublicKey::create_encryptor() const {
+  return Encryptor::create(tl().get());
+}
+
+td::Result<td::actor::ActorOwn<EncryptorAsync>> PublicKey::create_encryptor_async() const {
+  return EncryptorAsync::create(tl().get());
+}
+
+bool PublicKey::empty() const {
+  return pub_key_.get_offset() == pub_key_.offset<Empty>();
+}
+
+tl_object_ptr<ton_api::PublicKey> privkeys::Ed25519::pub_tl() const {
+  td::Ed25519::PrivateKey pkey(td::SecureString(as_slice(data_)));
+  auto r_public_key = pkey.get_public_key();
+  if (r_public_key.is_error()) {
+    return nullptr;
+  } else {
+    auto public_key = r_public_key.ok().as_octet_string();
+    td::Bits256 X;
+    as_slice(X).copy_from(public_key);
+    return create_tl_object<ton_api::pub_ed25519>(X);
+  }
+}
+
+pubkeys::Ed25519 privkeys::Ed25519::pub() const {
+  td::Ed25519::PrivateKey pkey(td::SecureString(as_slice(data_)));
+  return pubkeys::Ed25519{pkey.get_public_key().move_as_ok()};
+}
+
+privkeys::Ed25519 privkeys::Ed25519::random() {
+  while (true) {
+    auto key = td::Ed25519::generate_private_key();
+    if (key.is_error()) {
+      LOG(WARNING) << "failed to generate private key: " << key.move_as_error();
+    }
+    return Ed25519{key.move_as_ok()};
+  }
+}
+
+privkeys::Ed25519::Ed25519(td::Ed25519::PrivateKey key) {
+  auto s = key.as_octet_string();
+  CHECK(s.length() == 32);
+  data_.as_slice().copy_from(td::Slice(s));
+}
+
+pubkeys::Ed25519::Ed25519(td::Ed25519::PublicKey key) {
+  auto s = key.as_octet_string();
+  CHECK(s.length() == 32);
+  data_.as_slice().copy_from(td::Slice(s));
+}
+
+PrivateKey::PrivateKey(const tl_object_ptr<ton_api::PrivateKey> &id) {
+  ton_api::downcast_call(
+      *const_cast<ton_api::PrivateKey *>(id.get()),
+      td::overloaded([&](const ton_api::pk_ed25519 &obj) { this->priv_key_ = privkeys::Ed25519{obj}; },
+                     [&](const ton_api::pk_aes &obj) { this->priv_key_ = privkeys::AES{obj}; },
+                     [&](const ton_api::pk_unenc &obj) { this->priv_key_ = privkeys::Unenc{obj}; },
+                     [&](const ton_api::pk_overlay &obj) { this->priv_key_ = privkeys::Overlay{obj}; }));
+}
+
+bool PrivateKey::empty() const {
+  return priv_key_.get_offset() == priv_key_.offset<Empty>();
+}
+
+PublicKey PrivateKey::compute_public_key() const {
+  PublicKey res;
+  priv_key_.visit([&](auto &obj) { res = obj.pub(); });
+  return res;
+}
+
+PublicKeyHash PrivateKey::compute_short_id() const {
+  tl_object_ptr<ton_api::PublicKey> res;
+  priv_key_.visit([&](auto &obj) { res = obj.pub_tl(); });
+  return PublicKeyHash{res};
+}
+
+td::SecureString PrivateKey::export_as_slice() const {
+  td::SecureString res;
+  priv_key_.visit([&](auto &obj) { res = obj.export_as_slice(); });
+  return res;
+}
+
+bool PrivateKey::exportable() const {
+  bool res;
+  priv_key_.visit([&](auto &obj) { res = obj.exportable(); });
+  return res;
+}
+
+td::Result<PrivateKey> PrivateKey::import(td::Slice s) {
+  if (s.size() < 4) {
+    return td::Status::Error(ErrorCode::protoviolation, "too short key");
+  }
+  td::int32 id;
+  td::MutableSlice{reinterpret_cast<char *>(&id), 4}.copy_from(s.copy().truncate(4));
+  s.remove_prefix(4);
+  switch (id) {
+    case ton_api::pk_ed25519::ID: {
+      auto R = privkeys::Ed25519::import(s);
+      if (R.is_error()) {
+        return R.move_as_error();
+      } else {
+        return R.move_as_ok();
+      }
+    } break;
+    case ton_api::pk_aes::ID: {
+      auto R = privkeys::AES::import(s);
+      if (R.is_error()) {
+        return R.move_as_error();
+      } else {
+        return R.move_as_ok();
+      }
+    } break;
+    default:
+      return td::Status::Error(ErrorCode::protoviolation, PSTRING() << "unknown magic " << id);
+  }
+}
+
+tl_object_ptr<ton_api::PrivateKey> PrivateKey::tl() const {
+  tl_object_ptr<ton_api::PrivateKey> res;
+  priv_key_.visit([&](auto &obj) { res = obj.tl(); });
+  return res;
+}
+
+td::Result<std::unique_ptr<Decryptor>> PrivateKey::create_decryptor() const {
+  return Decryptor::create(tl().get());
+}
+
+td::Result<td::actor::ActorOwn<DecryptorAsync>> PrivateKey::create_decryptor_async() const {
+  return DecryptorAsync::create(tl().get());
+}
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/keys/keys.hpp b/submodules/ton/tonlib-src/keys/keys.hpp
new file mode 100644
index 0000000000..9710d9f4dd
--- /dev/null
+++ b/submodules/ton/tonlib-src/keys/keys.hpp
@@ -0,0 +1,477 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/int_types.h"
+#include "td/utils/buffer.h"
+#include "auto/tl/ton_api.h"
+#include "td/utils/UInt.h"
+#include "td/utils/Variant.h"
+#include "td/actor/actor.h"
+#include "crypto/common/bitstring.h"
+#include "crypto/Ed25519.h"
+#include "common/errorcode.h"
+
+namespace ton {
+
+class Encryptor;
+class EncryptorAsync;
+class Decryptor;
+class DecryptorAsync;
+
+class PublicKeyHash {
+ public:
+  explicit PublicKeyHash(td::Bits256 value) : value_(value) {
+  }
+  explicit PublicKeyHash(const tl_object_ptr<ton_api::PublicKey> &value);
+  PublicKeyHash() {
+  }
+  static PublicKeyHash zero() {
+    return PublicKeyHash{td::Bits256::zero()};
+  }
+  explicit PublicKeyHash(td::Slice data) {
+    CHECK(data.size() == 32);
+    value_.as_slice().copy_from(data);
+  }
+
+  td::UInt256 uint256_value() const {
+    td::UInt256 x;
+    x.as_slice().copy_from(value_.as_slice());
+    return x;
+  }
+  td::Bits256 bits256_value() const {
+    return value_;
+  }
+  auto tl() const {
+    return value_;
+  }
+
+  bool operator<(const PublicKeyHash &with) const {
+    return value_ < with.value_;
+  }
+  bool operator==(const PublicKeyHash &with) const {
+    return value_ == with.value_;
+  }
+  bool operator!=(const PublicKeyHash &with) const {
+    return value_ != with.value_;
+  }
+  td::Slice as_slice() const {
+    return td::as_slice(value_);
+  }
+  bool is_zero() const {
+    return value_.is_zero();
+  }
+
+ private:
+  td::Bits256 value_;
+};
+
+namespace pubkeys {
+
+class Ed25519 {
+ private:
+  td::Bits256 data_;
+
+ public:
+  Ed25519(const ton_api::pub_ed25519 &obj) {
+    data_ = obj.key_;
+  }
+  Ed25519(td::Bits256 id) : data_(id) {
+  }
+  Ed25519() {
+  }
+  Ed25519(td::Ed25519::PublicKey pk);
+  td::Ed25519::PublicKey export_key() {
+    return td::Ed25519::PublicKey{td::SecureString(data_.as_slice())};
+  }
+
+  auto raw() const {
+    return data_;
+  }
+  td::uint32 serialized_size() const {
+    return 36;
+  }
+  tl_object_ptr<ton_api::pub_ed25519> tl() const {
+    return create_tl_object<ton_api::pub_ed25519>(data_);
+  }
+  bool operator==(const Ed25519 &with) const {
+    return data_ == with.data_;
+  }
+  bool operator!=(const Ed25519 &with) const {
+    return data_ != with.data_;
+  }
+};
+
+class AES {
+ private:
+  td::Bits256 data_;
+
+ public:
+  ~AES() {
+    data_.set_zero_s();
+  }
+  AES(const ton_api::pub_aes &obj) {
+    data_ = obj.key_;
+  }
+  AES(td::Slice data) {
+    CHECK(data.size() == 32);
+    data_.as_slice().copy_from(data);
+  }
+  AES(td::Bits256 data) : data_(data) {
+  }
+  td::uint32 serialized_size() const {
+    return 36;
+  }
+  tl_object_ptr<ton_api::pub_aes> tl() const {
+    return create_tl_object<ton_api::pub_aes>(data_);
+  }
+  bool operator==(const AES &with) const {
+    return data_ == with.data_;
+  }
+  bool operator!=(const AES &with) const {
+    return data_ != with.data_;
+  }
+};
+
+class Unenc {
+ private:
+  td::SharedSlice data_;
+
+ public:
+  Unenc(const ton_api::pub_unenc &obj) {
+    data_ = td::SharedSlice{obj.data_.as_slice()};
+  }
+  Unenc(const Unenc &obj) {
+    data_ = obj.data_.clone();
+  }
+  explicit Unenc(td::BufferSlice data) : data_(td::SharedSlice{data.as_slice()}) {
+  }
+  explicit Unenc(td::Slice data) : data_(td::SharedSlice{data}) {
+  }
+  explicit Unenc(td::SharedSlice data) : data_(std::move(data)) {
+  }
+  td::uint32 serialized_size() const {
+    return static_cast<td::uint32>(data_.size()) + 8;
+  }
+  tl_object_ptr<ton_api::pub_unenc> tl() const {
+    return create_tl_object<ton_api::pub_unenc>(data_.clone_as_buffer_slice());
+  }
+  bool operator==(const Unenc &with) const {
+    return data_.as_slice() == with.data_.as_slice();
+  }
+  bool operator!=(const Unenc &with) const {
+    return data_.as_slice() != with.data_.as_slice();
+  }
+};  // namespace pubkeys
+
+class Overlay {
+ private:
+  td::SharedSlice data_;
+
+ public:
+  Overlay(const ton_api::pub_overlay &obj) {
+    data_ = td::SharedSlice{obj.name_.as_slice()};
+  }
+  Overlay(const Overlay &obj) {
+    data_ = obj.data_.clone();
+  }
+  explicit Overlay(td::BufferSlice data) : data_(td::SharedSlice{data.as_slice()}) {
+  }
+  explicit Overlay(td::Slice data) : data_(td::SharedSlice{data}) {
+  }
+  explicit Overlay(td::SharedSlice data) : data_(std::move(data)) {
+  }
+  td::uint32 serialized_size() const {
+    return static_cast<td::uint32>(data_.size()) + 8;
+  }
+  tl_object_ptr<ton_api::pub_overlay> tl() const {
+    return create_tl_object<ton_api::pub_overlay>(data_.clone_as_buffer_slice());
+  }
+  bool operator==(const Overlay &with) const {
+    return data_.as_slice() == with.data_.as_slice();
+  }
+  bool operator!=(const Overlay &with) const {
+    return data_.as_slice() != with.data_.as_slice();
+  }
+};
+
+}  // namespace pubkeys
+
+class PublicKey {
+ private:
+  class Empty {
+   public:
+    tl_object_ptr<ton_api::PublicKey> tl() const {
+      UNREACHABLE();
+    }
+    td::uint32 serialized_size() const {
+      UNREACHABLE();
+    }
+    bool operator==(const Empty &with) const {
+      return false;
+    }
+    bool operator!=(const Empty &with) const {
+      return true;
+    }
+  };
+  td::Variant<Empty, pubkeys::Ed25519, pubkeys::AES, pubkeys::Unenc, pubkeys::Overlay> pub_key_{Empty{}};
+
+ public:
+  explicit PublicKey(const tl_object_ptr<ton_api::PublicKey> &id);
+  PublicKey() {
+  }
+  PublicKey(pubkeys::Ed25519 pub) : pub_key_(std::move(pub)) {
+  }
+  PublicKey(pubkeys::AES pub) : pub_key_(std::move(pub)) {
+  }
+  PublicKey(pubkeys::Unenc pub) : pub_key_(std::move(pub)) {
+  }
+  PublicKey(pubkeys::Overlay pub) : pub_key_(std::move(pub)) {
+  }
+
+  bool empty() const;
+
+  PublicKeyHash compute_short_id() const;
+  td::uint32 serialized_size() const;
+  tl_object_ptr<ton_api::PublicKey> tl() const;
+  td::BufferSlice export_as_slice() const;
+  static td::Result<PublicKey> import(td::Slice s);
+
+  pubkeys::Ed25519 ed25519_value() const {
+    CHECK(pub_key_.get_offset() == pub_key_.offset<pubkeys::Ed25519>());
+    return pub_key_.get<pubkeys::Ed25519>();
+  }
+
+  td::Result<std::unique_ptr<Encryptor>> create_encryptor() const;
+  td::Result<td::actor::ActorOwn<EncryptorAsync>> create_encryptor_async() const;
+
+  bool operator==(const PublicKey &with) const {
+    return pub_key_ == with.pub_key_;
+  }
+  bool operator!=(const PublicKey &with) const {
+    return !(pub_key_ == with.pub_key_);
+  }
+};
+
+namespace privkeys {
+
+class Ed25519 {
+ private:
+  td::Bits256 data_;
+
+ public:
+  ~Ed25519() {
+    data_.set_zero_s();
+  }
+  Ed25519(const ton_api::pk_ed25519 &obj) {
+    data_ = obj.key_;
+  }
+  Ed25519(td::Bits256 id) : data_(id) {
+    id.set_zero_s();
+  }
+  Ed25519(td::Slice data) {
+    CHECK(data.size() == 32);
+    data_.as_slice().copy_from(data);
+  }
+  Ed25519() {
+  }
+  Ed25519(td::Ed25519::PrivateKey pk);
+  td::Ed25519::PrivateKey export_key() {
+    return td::Ed25519::PrivateKey{td::SecureString(data_.as_slice())};
+  }
+  td::SecureString export_as_slice() const {
+    td::SecureString s{36};
+    auto id = ton_api::pk_ed25519::ID;
+    s.as_mutable_slice().copy_from(td::Slice{reinterpret_cast<const td::uint8 *>(&id), 4});
+    s.as_mutable_slice().remove_prefix(4).copy_from(data_.as_slice());
+    return s;
+  }
+  bool exportable() const {
+    return true;
+  }
+  static td::Result<Ed25519> import(td::Slice slice) {
+    if (slice.size() != 32) {
+      return td::Status::Error(ErrorCode::error, "bad length");
+    }
+    return Ed25519{slice};
+  }
+  tl_object_ptr<ton_api::pk_ed25519> tl() const {
+    return create_tl_object<ton_api::pk_ed25519>(data_);
+  }
+  tl_object_ptr<ton_api::PublicKey> pub_tl() const;
+  pubkeys::Ed25519 pub() const;
+  static Ed25519 random();
+};
+
+class AES {
+ private:
+  td::Bits256 data_;
+
+ public:
+  ~AES() {
+    data_.set_zero_s();
+  }
+  AES(const ton_api::pk_aes &obj) {
+    data_ = obj.key_;
+  }
+  AES(td::Slice data) {
+    CHECK(data.size() == 32);
+    data_.as_slice().copy_from(data);
+  }
+  td::SecureString export_as_slice() const {
+    td::SecureString s{40};
+    auto id = ton_api::pk_aes::ID;
+    s.as_mutable_slice().copy_from(td::Slice{reinterpret_cast<const td::uint8 *>(&id), 4});
+    s.as_mutable_slice().remove_prefix(4).copy_from(data_.as_slice());
+    return s;
+  }
+  bool exportable() const {
+    return true;
+  }
+  static td::Result<AES> import(td::Slice slice) {
+    if (slice.size() != 32) {
+      return td::Status::Error(ErrorCode::error, "bad length");
+    }
+    return AES{slice};
+  }
+  tl_object_ptr<ton_api::pk_aes> tl() const {
+    return create_tl_object<ton_api::pk_aes>(data_);
+  }
+  tl_object_ptr<ton_api::PublicKey> pub_tl() const {
+    return create_tl_object<ton_api::pub_aes>(data_);
+  }
+  pubkeys::AES pub() const {
+    return pubkeys::AES{data_};
+  }
+};
+
+class Unenc {
+ private:
+  td::SharedSlice data_;
+
+ public:
+  Unenc(const ton_api::pk_unenc &obj) {
+    data_ = td::SharedSlice{obj.data_.as_slice()};
+  }
+  Unenc(const Unenc &obj) {
+    data_ = obj.data_.clone();
+  }
+  explicit Unenc(td::BufferSlice data) : data_(td::SharedSlice{data.as_slice()}) {
+  }
+  explicit Unenc(td::Slice data) : data_(td::SharedSlice{data}) {
+  }
+  explicit Unenc(td::SharedSlice data) : data_(std::move(data)) {
+  }
+  td::SecureString export_as_slice() const {
+    UNREACHABLE();
+  }
+  bool exportable() const {
+    return false;
+  }
+  tl_object_ptr<ton_api::pk_unenc> tl() const {
+    return create_tl_object<ton_api::pk_unenc>(data_.clone_as_buffer_slice());
+  }
+  tl_object_ptr<ton_api::PublicKey> pub_tl() const {
+    return create_tl_object<ton_api::pub_unenc>(data_.clone_as_buffer_slice());
+  }
+  pubkeys::Unenc pub() const {
+    return pubkeys::Unenc{data_.clone()};
+  }
+};
+
+class Overlay {
+ private:
+  td::SharedSlice data_;
+
+ public:
+  Overlay(const ton_api::pk_overlay &obj) {
+    data_ = td::SharedSlice{obj.name_.as_slice()};
+  }
+  Overlay(const Overlay &obj) {
+    data_ = obj.data_.clone();
+  }
+  explicit Overlay(td::BufferSlice data) : data_(td::SharedSlice{data.as_slice()}) {
+  }
+  explicit Overlay(td::Slice data) : data_(td::SharedSlice{data}) {
+  }
+  explicit Overlay(td::SharedSlice data) : data_(std::move(data)) {
+  }
+  td::SecureString export_as_slice() const {
+    UNREACHABLE();
+  }
+  bool exportable() const {
+    return false;
+  }
+  tl_object_ptr<ton_api::pk_overlay> tl() const {
+    return create_tl_object<ton_api::pk_overlay>(data_.clone_as_buffer_slice());
+  }
+  tl_object_ptr<ton_api::PublicKey> pub_tl() const {
+    return create_tl_object<ton_api::pub_overlay>(data_.clone_as_buffer_slice());
+  }
+  pubkeys::Overlay pub() const {
+    return pubkeys::Overlay{data_.clone()};
+  }
+};
+
+}  // namespace privkeys
+
+class PrivateKey {
+ private:
+  class Empty {
+   public:
+    td::SecureString export_as_slice() const {
+      UNREACHABLE();
+    }
+    bool exportable() const {
+      return false;
+    }
+    tl_object_ptr<ton_api::PrivateKey> tl() const {
+      UNREACHABLE();
+    }
+    tl_object_ptr<ton_api::PublicKey> pub_tl() const {
+      UNREACHABLE();
+    }
+    PublicKey pub() const {
+      UNREACHABLE();
+    }
+  };
+  td::Variant<Empty, privkeys::Ed25519, privkeys::AES, privkeys::Unenc, privkeys::Overlay> priv_key_{Empty{}};
+
+ public:
+  explicit PrivateKey(const tl_object_ptr<ton_api::PrivateKey> &pk);
+  template <class T>
+  PrivateKey(T key) : priv_key_(std::move(key)) {
+  }
+  PrivateKey() {
+  }
+
+  bool empty() const;
+
+  PublicKey compute_public_key() const;
+  PublicKeyHash compute_short_id() const;
+  td::SecureString export_as_slice() const;
+  static td::Result<PrivateKey> import(td::Slice s);
+  bool exportable() const;
+  tl_object_ptr<ton_api::PrivateKey> tl() const;
+
+  td::Result<std::unique_ptr<Decryptor>> create_decryptor() const;
+  td::Result<td::actor::ActorOwn<DecryptorAsync>> create_decryptor_async() const;
+};
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/lite-client/CMakeLists.txt b/submodules/ton/tonlib-src/lite-client/CMakeLists.txt
new file mode 100644
index 0000000000..a1afd52920
--- /dev/null
+++ b/submodules/ton/tonlib-src/lite-client/CMakeLists.txt
@@ -0,0 +1,8 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+add_library(lite-client-common lite-client-common.cpp lite-client-common.h)
+target_link_libraries(lite-client-common PUBLIC tdutils tdactor adnllite tl_api tl_lite_api tl-lite-utils ton_crypto ton_block)
+
+add_executable(lite-client lite-client.cpp lite-client.h)
+target_link_libraries(lite-client tdutils tdactor adnllite tl_api tl_lite_api tl-lite-utils ton_crypto ton_block
+  terminal lite-client-common)
diff --git a/submodules/ton/tonlib-src/lite-client/lite-client-common.cpp b/submodules/ton/tonlib-src/lite-client/lite-client-common.cpp
new file mode 100644
index 0000000000..cc6949deac
--- /dev/null
+++ b/submodules/ton/tonlib-src/lite-client/lite-client-common.cpp
@@ -0,0 +1,77 @@
+#include "lite-client-common.h"
+
+#include "auto/tl/lite_api.hpp"
+#include "tl-utils/lite-utils.hpp"
+#include "ton/lite-tl.hpp"
+#include "td/utils/overloaded.h"
+
+using namespace std::literals::string_literals;
+
+namespace liteclient {
+td::Result<std::unique_ptr<block::BlockProofChain>> deserialize_proof_chain(
+    ton::lite_api::object_ptr<ton::lite_api::liteServer_partialBlockProof> f) {
+  // deserialize proof chain
+  auto chain = std::make_unique<block::BlockProofChain>(ton::create_block_id(f->from_), ton::create_block_id(f->to_));
+  chain->complete = f->complete_;
+  for (auto& s : f->steps_) {
+    bool ok = false;
+    td::BufferSlice dest_proof, proof, state_proof;
+    ton::lite_api::downcast_call(
+        *s,
+        td::overloaded(
+            [&](ton::lite_api::liteServer_blockLinkBack& s) {
+              auto& link = chain->new_link(ton::create_block_id(s.from_), ton::create_block_id(s.to_), s.to_key_block_);
+              link.is_fwd = false;
+              // dest_proof:bytes state_proof:bytes proof:bytes
+              dest_proof = std::move(s.dest_proof_);
+              state_proof = std::move(s.state_proof_);
+              proof = std::move(s.proof_);
+              ok = true;
+            },
+            [&](ton::lite_api::liteServer_blockLinkForward& s) {
+              auto& link = chain->new_link(ton::create_block_id(s.from_), ton::create_block_id(s.to_), s.to_key_block_);
+              link.is_fwd = true;
+              // dest_proof:bytes config_proof:bytes signatures:liteServer.SignatureSet
+              dest_proof = std::move(s.dest_proof_);
+              proof = std::move(s.config_proof_);
+              link.cc_seqno = s.signatures_->catchain_seqno_;
+              link.validator_set_hash = s.signatures_->validator_set_hash_;
+              for (auto& sig : s.signatures_->signatures_) {
+                link.signatures.emplace_back(std::move(sig->node_id_short_), std::move(sig->signature_));
+              }
+              ok = true;
+            },
+            [&](auto& obj) {}));
+    if (!ok) {
+      return td::Status::Error("unknown constructor of liteServer.BlockLink");
+    }
+    auto& link = chain->last_link();
+    if (!dest_proof.empty()) {
+      auto d_res = vm::std_boc_deserialize(std::move(dest_proof));
+      if (d_res.is_error()) {
+        return td::Status::Error("cannot deserialize dest_proof in a block proof link: "s +
+                                 d_res.move_as_error().to_string());
+      }
+      link.dest_proof = d_res.move_as_ok();
+    }
+    auto d_res = vm::std_boc_deserialize(std::move(proof));
+    if (d_res.is_error()) {
+      return td::Status::Error("cannot deserialize proof in a block proof link: "s + d_res.move_as_error().to_string());
+    }
+    link.proof = d_res.move_as_ok();
+    if (!link.is_fwd) {
+      d_res = vm::std_boc_deserialize(std::move(state_proof));
+      if (d_res.is_error()) {
+        return td::Status::Error("cannot deserialize state_proof in a block proof link: "s +
+                                 d_res.move_as_error().to_string());
+      }
+      link.state_proof = d_res.move_as_ok();
+    }
+    LOG(DEBUG) << "deserialized a " << (link.is_fwd ? "forward" : "backward") << " BlkProofLink from "
+               << link.from.to_str() << " to " << link.to.to_str() << " with " << link.signatures.size()
+               << " signatures";
+  }
+  LOG(DEBUG) << "deserialized a BlkProofChain of " << chain->link_count() << " links";
+  return std::move(chain);
+}
+}  // namespace liteclient
diff --git a/submodules/ton/tonlib-src/lite-client/lite-client-common.h b/submodules/ton/tonlib-src/lite-client/lite-client-common.h
new file mode 100644
index 0000000000..cbadd2b429
--- /dev/null
+++ b/submodules/ton/tonlib-src/lite-client/lite-client-common.h
@@ -0,0 +1,10 @@
+#pragma once
+
+#include "crypto/block/block.h"
+
+#include "auto/tl/lite_api.hpp"
+
+namespace liteclient {
+td::Result<std::unique_ptr<block::BlockProofChain>> deserialize_proof_chain(
+    ton::lite_api::object_ptr<ton::lite_api::liteServer_partialBlockProof> f);
+}
diff --git a/submodules/ton/tonlib-src/lite-client/lite-client.cpp b/submodules/ton/tonlib-src/lite-client/lite-client.cpp
new file mode 100644
index 0000000000..0d446e6ec7
--- /dev/null
+++ b/submodules/ton/tonlib-src/lite-client/lite-client.cpp
@@ -0,0 +1,2254 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "lite-client.h"
+
+#include "lite-client-common.h"
+
+#include "adnl/adnl-ext-client.h"
+#include "tl-utils/lite-utils.hpp"
+#include "auto/tl/ton_api_json.h"
+#include "auto/tl/lite_api.hpp"
+#include "td/utils/OptionsParser.h"
+#include "td/utils/Time.h"
+#include "td/utils/filesystem.h"
+#include "td/utils/format.h"
+#include "td/utils/Random.h"
+#include "td/utils/crypto.h"
+#include "td/utils/overloaded.h"
+#include "td/utils/port/signals.h"
+#include "td/utils/port/stacktrace.h"
+#include "td/utils/port/StdStreams.h"
+#include "td/utils/port/FileFd.h"
+#include "terminal/terminal.h"
+#include "ton/lite-tl.hpp"
+#include "block/block-db.h"
+#include "block/block.h"
+#include "block/block-parse.h"
+#include "block/block-auto.h"
+#include "block/mc-config.h"
+#include "block/check-proof.h"
+#include "vm/boc.h"
+#include "vm/cellops.h"
+#include "vm/cells/MerkleProof.h"
+#include "vm/continuation.h"
+#include "vm/cp0.h"
+#include "ton/ton-shard.h"
+
+#if TD_DARWIN || TD_LINUX
+#include <unistd.h>
+#include <fcntl.h>
+#endif
+#include <iostream>
+#include <sstream>
+
+using namespace std::literals::string_literals;
+using td::Ref;
+
+int verbosity;
+
+std::unique_ptr<ton::adnl::AdnlExtClient::Callback> TestNode::make_callback() {
+  class Callback : public ton::adnl::AdnlExtClient::Callback {
+   public:
+    void on_ready() override {
+      td::actor::send_closure(id_, &TestNode::conn_ready);
+    }
+    void on_stop_ready() override {
+      td::actor::send_closure(id_, &TestNode::conn_closed);
+    }
+    Callback(td::actor::ActorId<TestNode> id) : id_(std::move(id)) {
+    }
+
+   private:
+    td::actor::ActorId<TestNode> id_;
+  };
+  return std::make_unique<Callback>(actor_id(this));
+}
+
+void TestNode::run() {
+  class Cb : public td::TerminalIO::Callback {
+   public:
+    void line_cb(td::BufferSlice line) override {
+      td::actor::send_closure(id_, &TestNode::parse_line, std::move(line));
+    }
+    Cb(td::actor::ActorId<TestNode> id) : id_(id) {
+    }
+
+   private:
+    td::actor::ActorId<TestNode> id_;
+  };
+  io_ = td::TerminalIO::create("> ", readline_enabled_, std::make_unique<Cb>(actor_id(this)));
+  td::actor::send_closure(io_, &td::TerminalIO::set_log_interface);
+
+  if (remote_public_key_.empty()) {
+    auto G = td::read_file(global_config_).move_as_ok();
+    auto gc_j = td::json_decode(G.as_slice()).move_as_ok();
+    ton::ton_api::liteclient_config_global gc;
+    ton::ton_api::from_json(gc, gc_j.get_object()).ensure();
+    CHECK(gc.liteservers_.size() > 0);
+    auto idx = liteserver_idx_ >= 0 ? liteserver_idx_
+                                    : td::Random::fast(0, static_cast<td::uint32>(gc.liteservers_.size() - 1));
+    CHECK(idx >= 0 && static_cast<td::uint32>(idx) <= gc.liteservers_.size());
+    auto& cli = gc.liteservers_[idx];
+    remote_addr_.init_host_port(td::IPAddress::ipv4_to_str(cli->ip_), cli->port_).ensure();
+    remote_public_key_ = ton::PublicKey{cli->id_};
+    td::TerminalIO::out() << "using liteserver " << idx << " with addr " << remote_addr_ << "\n";
+    if (gc.validator_ && gc.validator_->zero_state_) {
+      zstate_id_.workchain = gc.validator_->zero_state_->workchain_;
+      if (zstate_id_.workchain != ton::workchainInvalid) {
+        zstate_id_.root_hash = gc.validator_->zero_state_->root_hash_;
+        zstate_id_.file_hash = gc.validator_->zero_state_->file_hash_;
+        td::TerminalIO::out() << "zerostate set to " << zstate_id_.to_str() << "\n";
+      }
+    }
+  }
+
+  client_ =
+      ton::adnl::AdnlExtClient::create(ton::adnl::AdnlNodeIdFull{remote_public_key_}, remote_addr_, make_callback());
+}
+
+void TestNode::got_result() {
+  running_queries_--;
+  if (!running_queries_ && ex_queries_.size() > 0) {
+    auto data = std::move(ex_queries_[0]);
+    ex_queries_.erase(ex_queries_.begin());
+    parse_line(std::move(data));
+  }
+  if (ex_mode_ && !running_queries_ && ex_queries_.size() == 0) {
+    std::_Exit(0);
+  }
+}
+
+bool TestNode::envelope_send_query(td::BufferSlice query, td::Promise<td::BufferSlice> promise) {
+  running_queries_++;
+  if (!ready_ || client_.empty()) {
+    LOG(ERROR) << "failed to send query to server: not ready";
+    return false;
+  }
+  auto P = td::PromiseCreator::lambda(
+      [ SelfId = actor_id(this), promise = std::move(promise) ](td::Result<td::BufferSlice> R) mutable {
+        if (R.is_error()) {
+          auto err = R.move_as_error();
+          LOG(ERROR) << "failed query: " << err;
+          promise.set_error(std::move(err));
+          return;
+        }
+        auto data = R.move_as_ok();
+        auto F = ton::fetch_tl_object<ton::lite_api::liteServer_error>(data.clone(), true);
+        if (F.is_ok()) {
+          auto f = F.move_as_ok();
+          auto err = td::Status::Error(f->code_, f->message_);
+          LOG(ERROR) << "received error: " << err;
+          promise.set_error(std::move(err));
+          return;
+        }
+        promise.set_result(std::move(data));
+        td::actor::send_closure(SelfId, &TestNode::got_result);
+      });
+  td::BufferSlice b =
+      ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_query>(std::move(query)), true);
+  td::actor::send_closure(client_, &ton::adnl::AdnlExtClient::send_query, "query", std::move(b),
+                          td::Timestamp::in(10.0), std::move(P));
+  return true;
+}
+
+bool TestNode::register_blkid(const ton::BlockIdExt& blkid) {
+  for (const auto& id : known_blk_ids_) {
+    if (id == blkid) {
+      return false;
+    }
+  }
+  known_blk_ids_.push_back(blkid);
+  return true;
+}
+
+bool TestNode::show_new_blkids(bool all) {
+  if (all) {
+    shown_blk_ids_ = 0;
+  }
+  int cnt = 0;
+  while (shown_blk_ids_ < known_blk_ids_.size()) {
+    td::TerminalIO::out() << "BLK#" << shown_blk_ids_ + 1 << " = " << known_blk_ids_[shown_blk_ids_].to_str()
+                          << std::endl;
+    ++shown_blk_ids_;
+    ++cnt;
+  }
+  return cnt;
+}
+
+bool TestNode::complete_blkid(ton::BlockId partial_blkid, ton::BlockIdExt& complete_blkid) const {
+  auto n = known_blk_ids_.size();
+  while (n) {
+    --n;
+    if (known_blk_ids_[n].id == partial_blkid) {
+      complete_blkid = known_blk_ids_[n];
+      return true;
+    }
+  }
+  if (partial_blkid.is_masterchain() && partial_blkid.seqno == ~0U) {
+    complete_blkid.id = ton::BlockId{ton::masterchainId, ton::shardIdAll, ~0U};
+    complete_blkid.root_hash.set_zero();
+    complete_blkid.file_hash.set_zero();
+    return true;
+  }
+  return false;
+}
+
+bool TestNode::get_server_time() {
+  auto b = ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_getTime>(), true);
+  return envelope_send_query(std::move(b), [&, Self = actor_id(this) ](td::Result<td::BufferSlice> res)->void {
+    if (res.is_error()) {
+      LOG(ERROR) << "cannot get server time";
+      return;
+    } else {
+      auto F = ton::fetch_tl_object<ton::lite_api::liteServer_currentTime>(res.move_as_ok(), true);
+      if (F.is_error()) {
+        LOG(ERROR) << "cannot parse answer to liteServer.getTime";
+      } else {
+        server_time_ = F.move_as_ok()->now_;
+        server_time_got_at_ = static_cast<td::uint32>(td::Clocks::system());
+        LOG(INFO) << "server time is " << server_time_ << " (delta " << server_time_ - server_time_got_at_ << ")";
+      }
+    }
+  });
+}
+
+bool TestNode::get_server_version(int mode) {
+  auto b = ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_getVersion>(), true);
+  return envelope_send_query(std::move(b), [ Self = actor_id(this), mode ](td::Result<td::BufferSlice> res) {
+    td::actor::send_closure_later(Self, &TestNode::got_server_version, std::move(res), mode);
+  });
+};
+
+void TestNode::got_server_version(td::Result<td::BufferSlice> res, int mode) {
+  server_ok_ = false;
+  if (res.is_error()) {
+    LOG(ERROR) << "cannot get server version and time (server too old?)";
+  } else {
+    auto F = ton::fetch_tl_object<ton::lite_api::liteServer_version>(res.move_as_ok(), true);
+    if (F.is_error()) {
+      LOG(ERROR) << "cannot parse answer to liteServer.getVersion";
+    } else {
+      auto a = F.move_as_ok();
+      set_server_version(a->version_, a->capabilities_);
+      set_server_time(a->now_);
+    }
+  }
+  if (!server_ok_) {
+    LOG(ERROR) << "server version is too old (at least " << (min_ls_version >> 8) << "." << (min_ls_version & 0xff)
+               << " with capabilities " << min_ls_capabilities << " required), some queries are unavailable";
+  }
+  if (mode & 0x100) {
+    get_server_mc_block_id();
+  }
+}
+
+void TestNode::set_server_version(td::int32 version, td::int64 capabilities) {
+  if (server_version_ != version || server_capabilities_ != capabilities) {
+    server_version_ = version;
+    server_capabilities_ = capabilities;
+    LOG(WARNING) << "server version is " << (server_version_ >> 8) << "." << (server_version_ & 0xff)
+                 << ", capabilities " << server_capabilities_;
+  }
+  server_ok_ = (server_version_ >= min_ls_version) && !(~server_capabilities_ & min_ls_capabilities);
+}
+
+void TestNode::set_server_time(int server_utime) {
+  server_time_ = server_utime;
+  server_time_got_at_ = static_cast<td::uint32>(td::Clocks::system());
+  LOG(INFO) << "server time is " << server_time_ << " (delta " << server_time_ - server_time_got_at_ << ")";
+}
+
+bool TestNode::get_server_mc_block_id() {
+  int mode = (server_capabilities_ & 2) ? 0 : -1;
+  if (mode < 0) {
+    auto b = ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_getMasterchainInfo>(), true);
+    return envelope_send_query(std::move(b), [Self = actor_id(this)](td::Result<td::BufferSlice> res)->void {
+      if (res.is_error()) {
+        LOG(ERROR) << "cannot get masterchain info from server";
+        return;
+      } else {
+        auto F = ton::fetch_tl_object<ton::lite_api::liteServer_masterchainInfo>(res.move_as_ok(), true);
+        if (F.is_error()) {
+          LOG(ERROR) << "cannot parse answer to liteServer.getMasterchainInfo";
+        } else {
+          auto f = F.move_as_ok();
+          auto blk_id = create_block_id(f->last_);
+          auto zstate_id = create_zero_state_id(f->init_);
+          LOG(INFO) << "last masterchain block is " << blk_id.to_str();
+          td::actor::send_closure_later(Self, &TestNode::got_server_mc_block_id, blk_id, zstate_id, 0);
+        }
+      }
+    });
+  } else {
+    auto b =
+        ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_getMasterchainInfoExt>(mode), true);
+    return envelope_send_query(std::move(b), [ Self = actor_id(this), mode ](td::Result<td::BufferSlice> res)->void {
+      if (res.is_error()) {
+        LOG(ERROR) << "cannot get extended masterchain info from server";
+        return;
+      } else {
+        auto F = ton::fetch_tl_object<ton::lite_api::liteServer_masterchainInfoExt>(res.move_as_ok(), true);
+        if (F.is_error()) {
+          LOG(ERROR) << "cannot parse answer to liteServer.getMasterchainInfoExt";
+        } else {
+          auto f = F.move_as_ok();
+          auto blk_id = create_block_id(f->last_);
+          auto zstate_id = create_zero_state_id(f->init_);
+          LOG(INFO) << "last masterchain block is " << blk_id.to_str();
+          td::actor::send_closure_later(Self, &TestNode::got_server_mc_block_id_ext, blk_id, zstate_id, mode,
+                                        f->version_, f->capabilities_, f->last_utime_, f->now_);
+        }
+      }
+    });
+  }
+}
+
+void TestNode::got_server_mc_block_id(ton::BlockIdExt blkid, ton::ZeroStateIdExt zstateid, int created) {
+  if (!zstate_id_.is_valid()) {
+    zstate_id_ = zstateid;
+    LOG(INFO) << "zerostate id set to " << zstate_id_.to_str();
+  } else if (zstate_id_ != zstateid) {
+    LOG(FATAL) << "fatal: masterchain zero state id suddenly changed: expected " << zstate_id_.to_str() << ", found "
+               << zstateid.to_str();
+    _exit(3);
+    return;
+  }
+  register_blkid(blkid);
+  register_blkid(ton::BlockIdExt{ton::masterchainId, ton::shardIdAll, 0, zstateid.root_hash, zstateid.file_hash});
+  if (!mc_last_id_.is_valid()) {
+    mc_last_id_ = blkid;
+    request_block(blkid);
+    // request_state(blkid);
+  } else if (mc_last_id_.id.seqno < blkid.id.seqno) {
+    mc_last_id_ = blkid;
+  }
+  td::TerminalIO::out() << "latest masterchain block known to server is " << blkid.to_str();
+  if (created > 0) {
+    td::TerminalIO::out() << " created at " << created << " (" << static_cast<td::int32>(td::Clocks::system()) - created
+                          << " seconds ago)\n";
+  } else {
+    td::TerminalIO::out() << "\n";
+  }
+  show_new_blkids();
+}
+
+void TestNode::got_server_mc_block_id_ext(ton::BlockIdExt blkid, ton::ZeroStateIdExt zstateid, int mode, int version,
+                                          long long capabilities, int last_utime, int server_now) {
+  set_server_version(version, capabilities);
+  set_server_time(server_now);
+  if (last_utime > server_now) {
+    LOG(WARNING) << "server claims to have a masterchain block " << blkid.to_str() << " created at " << last_utime
+                 << " (" << last_utime - server_now << " seconds in the future)";
+  } else if (last_utime < server_now - 60) {
+    LOG(WARNING) << "server appears to be out of sync: its newest masterchain block is " << blkid.to_str()
+                 << " created at " << last_utime << " (" << server_now - last_utime
+                 << " seconds ago according to the server's clock)";
+  } else if (last_utime < server_time_got_at_ - 60) {
+    LOG(WARNING) << "either the server is out of sync, or the local clock is set incorrectly: the newest masterchain "
+                    "block known to server is "
+                 << blkid.to_str() << " created at " << last_utime << " (" << server_now - server_time_got_at_
+                 << " seconds ago according to the local clock)";
+  }
+  got_server_mc_block_id(blkid, zstateid, last_utime);
+}
+
+bool TestNode::request_block(ton::BlockIdExt blkid) {
+  auto b = ton::serialize_tl_object(
+      ton::create_tl_object<ton::lite_api::liteServer_getBlock>(ton::create_tl_lite_block_id(blkid)), true);
+  return envelope_send_query(std::move(b), [ Self = actor_id(this), blkid ](td::Result<td::BufferSlice> res)->void {
+    if (res.is_error()) {
+      LOG(ERROR) << "cannot obtain block " << blkid.to_str() << " from server";
+      return;
+    } else {
+      auto F = ton::fetch_tl_object<ton::lite_api::liteServer_blockData>(res.move_as_ok(), true);
+      if (F.is_error()) {
+        LOG(ERROR) << "cannot parse answer to liteServer.getBlock";
+      } else {
+        auto f = F.move_as_ok();
+        auto blk_id = ton::create_block_id(f->id_);
+        LOG(INFO) << "obtained block " << blk_id.to_str() << " from server";
+        if (blk_id != blkid) {
+          LOG(ERROR) << "block id mismatch: expected data for block " << blkid.to_str() << ", obtained for "
+                     << blk_id.to_str();
+        }
+        td::actor::send_closure_later(Self, &TestNode::got_mc_block, blk_id, std::move(f->data_));
+      }
+    }
+  });
+}
+
+bool TestNode::request_state(ton::BlockIdExt blkid) {
+  auto b = ton::serialize_tl_object(
+      ton::create_tl_object<ton::lite_api::liteServer_getState>(ton::create_tl_lite_block_id(blkid)), true);
+  return envelope_send_query(std::move(b), [ Self = actor_id(this), blkid ](td::Result<td::BufferSlice> res)->void {
+    if (res.is_error()) {
+      LOG(ERROR) << "cannot obtain state " << blkid.to_str() << " from server";
+      return;
+    } else {
+      auto F = ton::fetch_tl_object<ton::lite_api::liteServer_blockState>(res.move_as_ok(), true);
+      if (F.is_error()) {
+        LOG(ERROR) << "cannot parse answer to liteServer.getState";
+      } else {
+        auto f = F.move_as_ok();
+        auto blk_id = ton::create_block_id(f->id_);
+        LOG(INFO) << "obtained state " << blk_id.to_str() << " from server";
+        if (blk_id != blkid) {
+          LOG(ERROR) << "block id mismatch: expected state for block " << blkid.to_str() << ", obtained for "
+                     << blk_id.to_str();
+        }
+        td::actor::send_closure_later(Self, &TestNode::got_mc_state, blk_id, f->root_hash_, f->file_hash_,
+                                      std::move(f->data_));
+      }
+    }
+  });
+}
+
+void TestNode::got_mc_block(ton::BlockIdExt blkid, td::BufferSlice data) {
+  LOG(INFO) << "obtained " << data.size() << " data bytes for block " << blkid.to_str();
+  ton::FileHash fhash;
+  td::sha256(data.as_slice(), fhash.as_slice());
+  if (fhash != blkid.file_hash) {
+    LOG(ERROR) << "file hash mismatch for block " << blkid.to_str() << ": expected " << blkid.file_hash.to_hex()
+               << ", computed " << fhash.to_hex();
+    return;
+  }
+  register_blkid(blkid);
+  last_block_id_ = blkid;
+  last_block_data_ = data.clone();
+  if (!db_root_.empty()) {
+    auto res = save_db_file(fhash, std::move(data));
+    if (res.is_error()) {
+      LOG(ERROR) << "error saving block file: " << res.to_string();
+    }
+  }
+  show_new_blkids();
+}
+
+void TestNode::got_mc_state(ton::BlockIdExt blkid, ton::RootHash root_hash, ton::FileHash file_hash,
+                            td::BufferSlice data) {
+  LOG(INFO) << "obtained " << data.size() << " state bytes for block " << blkid.to_str();
+  ton::FileHash fhash;
+  td::sha256(data.as_slice(), fhash.as_slice());
+  if (fhash != file_hash) {
+    LOG(ERROR) << "file hash mismatch for state " << blkid.to_str() << ": expected " << file_hash.to_hex()
+               << ", computed " << fhash.to_hex();
+    return;
+  }
+  register_blkid(blkid);
+  last_state_id_ = blkid;
+  last_state_data_ = data.clone();
+  if (!db_root_.empty()) {
+    auto res = save_db_file(fhash, std::move(data));
+    if (res.is_error()) {
+      LOG(ERROR) << "error saving state file: " << res.to_string();
+    }
+  }
+  show_new_blkids();
+}
+
+td::Status TestNode::save_db_file(ton::FileHash file_hash, td::BufferSlice data) {
+  std::string fname = block::compute_db_filename(db_root_ + '/', file_hash);
+  for (int i = 0; i < 10; i++) {
+    std::string tmp_fname = block::compute_db_tmp_filename(db_root_ + '/', file_hash, i);
+    auto res = block::save_binary_file(tmp_fname, data);
+    if (res.is_ok()) {
+      if (std::rename(tmp_fname.c_str(), fname.c_str()) < 0) {
+        int err = errno;
+        LOG(ERROR) << "cannot rename " << tmp_fname << " to " << fname << " : " << std::strerror(err);
+        return td::Status::Error(std::string{"cannot rename file: "} + std::strerror(err));
+      } else {
+        LOG(INFO) << data.size() << " bytes saved into file " << fname;
+        return td::Status::OK();
+      }
+    } else if (i == 9) {
+      return res;
+    }
+  }
+  return td::Status::Error("cannot save data file");
+}
+
+void TestNode::run_init_queries() {
+  get_server_version(0x100);
+}
+
+std::string TestNode::get_word(char delim) {
+  if (delim == ' ' || !delim) {
+    skipspc();
+  }
+  const char* ptr = parse_ptr_;
+  while (ptr < parse_end_ && *ptr != delim && (*ptr != '\t' || delim != ' ')) {
+    ptr++;
+  }
+  std::swap(ptr, parse_ptr_);
+  return std::string{ptr, parse_ptr_};
+}
+
+bool TestNode::get_word_to(std::string& str, char delim) {
+  str = get_word(delim);
+  return !str.empty();
+}
+
+int TestNode::skipspc() {
+  int i = 0;
+  while (parse_ptr_ < parse_end_ && (*parse_ptr_ == ' ' || *parse_ptr_ == '\t')) {
+    i++;
+    parse_ptr_++;
+  }
+  return i;
+}
+
+std::string TestNode::get_line_tail(bool remove_spaces) const {
+  const char *ptr = parse_ptr_, *end = parse_end_;
+  if (remove_spaces) {
+    while (ptr < end && (*ptr == ' ' || *ptr == '\t')) {
+      ptr++;
+    }
+    while (ptr < end && (end[-1] == ' ' || end[-1] == '\t')) {
+      --end;
+    }
+  }
+  return std::string{ptr, end};
+}
+
+bool TestNode::eoln() const {
+  return parse_ptr_ == parse_end_;
+}
+
+bool TestNode::seekeoln() {
+  skipspc();
+  return eoln();
+}
+
+bool TestNode::parse_account_addr(ton::WorkchainId& wc, ton::StdSmcAddress& addr) {
+  return block::parse_std_account_addr(get_word(), wc, addr) || set_error("cannot parse account address");
+}
+
+bool TestNode::convert_uint64(std::string word, td::uint64& val) {
+  val = ~0ULL;
+  if (word.empty()) {
+    return false;
+  }
+  const char* ptr = word.c_str();
+  char* end = nullptr;
+  val = std::strtoull(ptr, &end, 10);
+  if (end == ptr + word.size()) {
+    return true;
+  } else {
+    val = ~0ULL;
+    return false;
+  }
+}
+
+bool TestNode::convert_int64(std::string word, td::int64& val) {
+  val = (~0ULL << 63);
+  if (word.empty()) {
+    return false;
+  }
+  const char* ptr = word.c_str();
+  char* end = nullptr;
+  val = std::strtoll(ptr, &end, 10);
+  if (end == ptr + word.size()) {
+    return true;
+  } else {
+    val = (~0ULL << 63);
+    return false;
+  }
+}
+
+bool TestNode::convert_uint32(std::string word, td::uint32& val) {
+  td::uint64 tmp;
+  if (convert_uint64(word, tmp) && (td::uint32)tmp == tmp) {
+    val = (td::uint32)tmp;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+bool TestNode::convert_int32(std::string word, td::int32& val) {
+  td::int64 tmp;
+  if (convert_int64(word, tmp) && (td::int32)tmp == tmp) {
+    val = (td::int32)tmp;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+bool TestNode::parse_lt(ton::LogicalTime& lt) {
+  return convert_uint64(get_word(), lt) || set_error("cannot parse logical time");
+}
+
+bool TestNode::parse_uint32(td::uint32& val) {
+  return convert_uint32(get_word(), val) || set_error("cannot parse 32-bit unsigned integer");
+}
+
+bool TestNode::set_error(td::Status error) {
+  if (error.is_ok()) {
+    return true;
+  }
+  LOG(ERROR) << "error: " << error.to_string();
+  if (error_.is_ok()) {
+    error_ = std::move(error);
+  }
+  return false;
+}
+
+int TestNode::parse_hex_digit(int c) {
+  if (c >= '0' && c <= '9') {
+    return c - '0';
+  }
+  c |= 0x20;
+  if (c >= 'a' && c <= 'z') {
+    return c - 'a' + 10;
+  }
+  return -1;
+}
+
+bool TestNode::parse_hash(const char* str, ton::Bits256& hash) {
+  unsigned char* data = hash.data();
+  for (int i = 0; i < 32; i++) {
+    int a = parse_hex_digit(str[2 * i]);
+    if (a < 0) {
+      return false;
+    }
+    int b = parse_hex_digit(str[2 * i + 1]);
+    if (b < 0) {
+      return false;
+    }
+    data[i] = (unsigned char)((a << 4) + b);
+  }
+  return true;
+}
+
+bool TestNode::parse_block_id_ext(std::string blkid_str, ton::BlockIdExt& blkid, bool allow_incomplete) const {
+  if (blkid_str.empty()) {
+    return false;
+  }
+  auto fc = blkid_str[0];
+  if (fc == 'B' || fc == '#') {
+    unsigned n = 0;
+    if (sscanf(blkid_str.c_str(), fc == 'B' ? "BLK#%u" : "#%u", &n) != 1 || !n || n > known_blk_ids_.size()) {
+      return false;
+    }
+    blkid = known_blk_ids_.at(n - 1);
+    return true;
+  }
+  if (blkid_str[0] != '(') {
+    return false;
+  }
+  auto pos = blkid_str.find(')');
+  if (pos == std::string::npos || pos >= 38) {
+    return false;
+  }
+  char buffer[40];
+  std::memcpy(buffer, blkid_str.c_str(), pos + 1);
+  buffer[pos + 1] = 0;
+  unsigned long long shard;
+  if (sscanf(buffer, "(%d,%016llx,%u)", &blkid.id.workchain, &shard, &blkid.id.seqno) != 3) {
+    return false;
+  }
+  blkid.id.shard = shard;
+  if (!blkid.id.is_valid_full()) {
+    return false;
+  }
+  pos++;
+  if (pos == blkid_str.size()) {
+    blkid.root_hash.set_zero();
+    blkid.file_hash.set_zero();
+    return complete_blkid(blkid.id, blkid) || allow_incomplete;
+  }
+  return pos + 2 * 65 == blkid_str.size() && blkid_str[pos] == ':' && blkid_str[pos + 65] == ':' &&
+         parse_hash(blkid_str.c_str() + pos + 1, blkid.root_hash) &&
+         parse_hash(blkid_str.c_str() + pos + 66, blkid.file_hash) && blkid.is_valid_full();
+}
+
+bool TestNode::parse_block_id_ext(ton::BlockIdExt& blk, bool allow_incomplete) {
+  return parse_block_id_ext(get_word(), blk, allow_incomplete) || set_error("cannot parse BlockIdExt");
+}
+
+bool TestNode::parse_hash(ton::Bits256& hash) {
+  auto word = get_word();
+  return (!word.empty() && parse_hash(word.c_str(), hash)) || set_error("cannot parse hash");
+}
+
+bool TestNode::convert_shard_id(std::string str, ton::ShardIdFull& shard) {
+  shard.workchain = ton::workchainInvalid;
+  shard.shard = 0;
+  auto pos = str.find(':');
+  if (pos == std::string::npos || pos > 10) {
+    return false;
+  }
+  if (!convert_int32(str.substr(0, pos), shard.workchain)) {
+    return false;
+  }
+  int t = 64;
+  while (++pos < str.size()) {
+    int z = parse_hex_digit(str[pos]);
+    if (z < 0) {
+      if (t == 64) {
+        shard.shard = ton::shardIdAll;
+      }
+      return pos == str.size() - 1 && str[pos] == '_';
+    }
+    t -= 4;
+    if (t >= 0) {
+      shard.shard |= ((td::uint64)z << t);
+    }
+  }
+  return true;
+}
+
+bool TestNode::parse_shard_id(ton::ShardIdFull& shard) {
+  return convert_shard_id(get_word(), shard) || set_error("cannot parse full shard identifier or prefix");
+}
+
+bool TestNode::parse_stack_value(td::Slice str, vm::StackEntry& value) {
+  if (str.empty() || str.size() > 65535) {
+    return false;
+  }
+  int l = (int)str.size();
+  if (str[0] == '"') {
+    vm::CellBuilder cb;
+    if (l == 1 || str.back() != '"' || l >= 127 + 2 || !cb.store_bytes_bool(str.data() + 1, l - 2)) {
+      return false;
+    }
+    value = vm::StackEntry{vm::load_cell_slice_ref(cb.finalize())};
+    return true;
+  }
+  if (l >= 3 && (str[0] == 'x' || str[0] == 'b') && str[1] == '{' && str.back() == '}') {
+    unsigned char buff[128];
+    int bits =
+        (str[0] == 'x')
+            ? (int)td::bitstring::parse_bitstring_hex_literal(buff, sizeof(buff), str.begin() + 2, str.end() - 1)
+            : (int)td::bitstring::parse_bitstring_binary_literal(buff, sizeof(buff), str.begin() + 2, str.end() - 1);
+    if (bits < 0) {
+      return false;
+    }
+    value =
+        vm::StackEntry{Ref<vm::CellSlice>{true, vm::CellBuilder().store_bits(td::ConstBitPtr{buff}, bits).finalize()}};
+    return true;
+  }
+  auto num = td::RefInt256{true};
+  auto& x = num.unique_write();
+  if (l >= 3 && str[0] == '0' && str[1] == 'x') {
+    if (x.parse_hex(str.data() + 2, l - 2) != l - 2) {
+      return false;
+    }
+  } else if (l >= 4 && str[0] == '-' && str[1] == '0' && str[2] == 'x') {
+    if (x.parse_hex(str.data() + 3, l - 3) != l - 3) {
+      return false;
+    }
+    x.negate().normalize();
+  } else if (!l || x.parse_dec(str.data(), l) != l) {
+    return false;
+  }
+  value = vm::StackEntry{std::move(num)};
+  return true;
+}
+
+bool TestNode::parse_stack_value(vm::StackEntry& value) {
+  return parse_stack_value(td::Slice{get_word()}, value) || set_error("invalid vm stack value");
+}
+
+bool TestNode::set_error(std::string err_msg) {
+  return set_error(td::Status::Error(-1, err_msg));
+}
+
+void TestNode::parse_line(td::BufferSlice data) {
+  line_ = data.as_slice().str();
+  parse_ptr_ = line_.c_str();
+  parse_end_ = parse_ptr_ + line_.size();
+  error_ = td::Status::OK();
+  if (seekeoln()) {
+    return;
+  }
+  if (!do_parse_line() || error_.is_error()) {
+    show_context();
+    LOG(ERROR) << (error_.is_ok() ? "Syntax error" : error_.to_string());
+    error_ = td::Status::OK();
+  }
+  show_new_blkids();
+}
+
+void TestNode::show_context() const {
+  const char* ptr = line_.c_str();
+  CHECK(parse_ptr_ >= ptr && parse_ptr_ <= parse_end_);
+  auto out = td::TerminalIO::out();
+  for (; ptr < parse_ptr_; ptr++) {
+    out << (char)(*ptr == '\t' ? *ptr : ' ');
+  }
+  out << "^" << '\n';
+}
+
+bool TestNode::show_help(std::string command) {
+  td::TerminalIO::out()
+      << "list of available commands:\n"
+         "time\tGet server time\n"
+         "remote-version\tShows server time, version and capabilities\n"
+         "last\tGet last block and state info from server\n"
+         "sendfile <filename>\tLoad a serialized message from <filename> and send it to server\n"
+         "status\tShow connection and local database status\n"
+         "getaccount <addr> [<block-id-ext>]\tLoads the most recent state of specified account; <addr> is in "
+         "[<workchain>:]<hex-or-base64-addr> format\n"
+         "saveaccount[code|data] <filename> <addr> [<block-id-ext>]\tSaves into specified file the most recent state "
+         "(StateInit) or just the code or data of specified account; <addr> is in "
+         "[<workchain>:]<hex-or-base64-addr> format\n"
+         "runmethod <addr> [<block-id-ext>] <method-id> <params>...\tRuns GET method <method-id> of account <addr> "
+         "with specified parameters\n"
+         "allshards [<block-id-ext>]\tShows shard configuration from the most recent masterchain "
+         "state or from masterchain state corresponding to <block-id-ext>\n"
+         "getconfig [<param>...]\tShows specified or all configuration parameters from the latest masterchain state\n"
+         "getconfigfrom <block-id-ext> [<param>...]\tShows specified or all configuration parameters from the "
+         "masterchain state of <block-id-ext>\n"
+         "saveconfig <filename> [<block-id-ext>]\tSaves all configuration parameters into specified file\n"
+         "gethead <block-id-ext>\tShows block header for <block-id-ext>\n"
+         "getblock <block-id-ext>\tDownloads block\n"
+         "dumpblock <block-id-ext>\tDownloads and dumps specified block\n"
+         "getstate <block-id-ext>\tDownloads state corresponding to specified block\n"
+         "dumpstate <block-id-ext>\tDownloads and dumps state corresponding to specified block\n"
+         "dumptrans <block-id-ext> <account-id> <trans-lt>\tDumps one transaction of specified account\n"
+         "lasttrans[dump] <account-id> <trans-lt> <trans-hash> [<count>]\tShows or dumps specified transaction and "
+         "several preceding "
+         "ones\n"
+         "listblocktrans[rev] <block-id-ext> <count> [<start-account-id> <start-trans-lt>]\tLists block transactions, "
+         "starting immediately after or before the specified one\n"
+         "blkproofchain[step] <from-block-id-ext> [<to-block-id-ext>]\tDownloads and checks proof of validity of the "
+         "second "
+         "indicated block (or the last known masterchain block) starting from given block\n"
+         "byseqno <workchain> <shard-prefix> <seqno>\tLooks up a block by workchain, shard and seqno, and shows its "
+         "header\n"
+         "bylt <workchain> <shard-prefix> <lt>\tLooks up a block by workchain, shard and logical time, and shows its "
+         "header\n"
+         "byutime <workchain> <shard-prefix> <utime>\tLooks up a block by workchain, shard and creation time, and "
+         "shows its header\n"
+         "known\tShows the list of all known block ids\n"
+         "privkey <filename>\tLoads a private key from file\n"
+         "help [<command>]\tThis help\n"
+         "quit\tExit\n";
+  return true;
+}
+
+bool TestNode::do_parse_line() {
+  ton::WorkchainId workchain = ton::masterchainId;  // change to basechain later
+  ton::StdSmcAddress addr{};
+  ton::BlockIdExt blkid{};
+  ton::LogicalTime lt{};
+  ton::Bits256 hash{};
+  ton::ShardIdFull shard{};
+  ton::BlockSeqno seqno{};
+  ton::UnixTime utime{};
+  unsigned count{};
+  std::string word = get_word();
+  skipspc();
+  if (word == "time") {
+    return eoln() && get_server_time();
+  } else if (word == "remote-version") {
+    return eoln() && get_server_version();
+  } else if (word == "last") {
+    return eoln() && get_server_mc_block_id();
+  } else if (word == "sendfile") {
+    return !eoln() && set_error(send_ext_msg_from_filename(get_line_tail()));
+  } else if (word == "getaccount") {
+    return parse_account_addr(workchain, addr) &&
+           (seekeoln() ? get_account_state(workchain, addr, mc_last_id_)
+                       : parse_block_id_ext(blkid) && seekeoln() && get_account_state(workchain, addr, blkid));
+  } else if (word == "saveaccount" || word == "saveaccountcode" || word == "saveaccountdata") {
+    std::string filename;
+    int mode = ((word.c_str()[11] >> 1) & 3);
+    return get_word_to(filename) && parse_account_addr(workchain, addr) &&
+           (seekeoln()
+                ? get_account_state(workchain, addr, mc_last_id_, filename, mode)
+                : parse_block_id_ext(blkid) && seekeoln() && get_account_state(workchain, addr, blkid, filename, mode));
+  } else if (word == "runmethod") {
+    std::string method;
+    return parse_account_addr(workchain, addr) && get_word_to(method) &&
+           (parse_block_id_ext(method, blkid) ? get_word_to(method) : (blkid = mc_last_id_).is_valid()) &&
+           parse_run_method(workchain, addr, blkid, method);
+  } else if (word == "allshards") {
+    return eoln() ? get_all_shards() : (parse_block_id_ext(blkid) && seekeoln() && get_all_shards(false, blkid));
+  } else if (word == "saveconfig") {
+    blkid = mc_last_id_;
+    std::string filename;
+    return get_word_to(filename) && (seekeoln() || parse_block_id_ext(blkid)) && seekeoln() &&
+           get_config_params(blkid, -1, filename);
+  } else if (word == "getconfig" || word == "getconfigfrom") {
+    blkid = mc_last_id_;
+    return (word == "getconfig" || parse_block_id_ext(blkid)) && get_config_params(blkid, 0);
+  } else if (word == "getblock") {
+    return parse_block_id_ext(blkid) && seekeoln() && get_block(blkid, false);
+  } else if (word == "dumpblock") {
+    return parse_block_id_ext(blkid) && seekeoln() && get_block(blkid, true);
+  } else if (word == "getstate") {
+    return parse_block_id_ext(blkid) && seekeoln() && get_state(blkid, false);
+  } else if (word == "dumpstate") {
+    return parse_block_id_ext(blkid) && seekeoln() && get_state(blkid, true);
+  } else if (word == "gethead") {
+    return parse_block_id_ext(blkid) && seekeoln() && get_block_header(blkid, 0xffff);
+  } else if (word == "dumptrans") {
+    return parse_block_id_ext(blkid) && parse_account_addr(workchain, addr) && parse_lt(lt) && seekeoln() &&
+           get_one_transaction(blkid, workchain, addr, lt, true);
+  } else if (word == "lasttrans" || word == "lasttransdump") {
+    return parse_account_addr(workchain, addr) && parse_lt(lt) && parse_hash(hash) && seekeoln() &&
+           get_last_transactions(workchain, addr, lt, hash, 10, word == "lasttransdump");
+  } else if (word == "listblocktrans" || word == "listblocktransrev") {
+    lt = 0;
+    int mode = (word == "listblocktrans" ? 7 : 0x47);
+    return parse_block_id_ext(blkid) && parse_uint32(count) &&
+           (seekeoln() || (parse_hash(hash) && parse_lt(lt) && (mode |= 128) && seekeoln())) &&
+           get_block_transactions(blkid, mode, count, hash, lt);
+  } else if (word == "blkproofchain" || word == "blkproofchainstep") {
+    ton::BlockIdExt blkid2{};
+    return parse_block_id_ext(blkid) && (seekeoln() || parse_block_id_ext(blkid2)) && seekeoln() &&
+           get_block_proof(blkid, blkid2, blkid2.is_valid() + (word == "blkproofchain") * 0x1000);
+  } else if (word == "byseqno") {
+    return parse_shard_id(shard) && parse_uint32(seqno) && seekeoln() && lookup_block(shard, 1, seqno);
+  } else if (word == "byutime") {
+    return parse_shard_id(shard) && parse_uint32(utime) && seekeoln() && lookup_block(shard, 4, utime);
+  } else if (word == "bylt") {
+    return parse_shard_id(shard) && parse_lt(lt) && seekeoln() && lookup_block(shard, 2, lt);
+  } else if (word == "known") {
+    return eoln() && show_new_blkids(true);
+  } else if (word == "quit" && eoln()) {
+    LOG(INFO) << "Exiting";
+    stop();
+    // std::exit(0);
+    return true;
+  } else if (word == "help") {
+    return show_help(get_line_tail());
+  } else {
+    td::TerminalIO::out() << "unknown command: " << word << " ; type `help` to get help" << '\n';
+    return false;
+  }
+}
+
+td::Result<std::pair<Ref<vm::Cell>, std::shared_ptr<vm::StaticBagOfCellsDb>>> lazy_boc_deserialize(
+    td::BufferSlice data) {
+  vm::StaticBagOfCellsDbLazy::Options options;
+  options.check_crc32c = true;
+  TRY_RESULT(boc, vm::StaticBagOfCellsDbLazy::create(vm::BufferSliceBlobView::create(std::move(data)), options));
+  TRY_RESULT(rc, boc->get_root_count());
+  if (rc != 1) {
+    return td::Status::Error(-668, "bag-of-cells is not standard (exactly one root cell expected)");
+  }
+  TRY_RESULT(root, boc->get_root_cell(0));
+  return std::make_pair(std::move(root), std::move(boc));
+}
+
+td::Status TestNode::send_ext_msg_from_filename(std::string filename) {
+  auto F = td::read_file(filename);
+  if (F.is_error()) {
+    auto err = F.move_as_error();
+    LOG(ERROR) << "failed to read file `" << filename << "`: " << err.to_string();
+    return err;
+  }
+  if (ready_ && !client_.empty()) {
+    LOG(ERROR) << "sending query from file " << filename;
+    auto P = td::PromiseCreator::lambda([](td::Result<td::BufferSlice> R) {
+      if (R.is_error()) {
+        return;
+      }
+      auto F = ton::fetch_tl_object<ton::lite_api::liteServer_sendMsgStatus>(R.move_as_ok(), true);
+      if (F.is_error()) {
+        LOG(ERROR) << "cannot parse answer to liteServer.sendMessage";
+      } else {
+        int status = F.move_as_ok()->status_;
+        LOG(INFO) << "external message status is " << status;
+      }
+    });
+    auto b =
+        ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_sendMessage>(F.move_as_ok()), true);
+    return envelope_send_query(std::move(b), std::move(P)) ? td::Status::OK()
+                                                           : td::Status::Error("cannot send query to server");
+  } else {
+    return td::Status::Error("server connection not ready");
+  }
+}
+
+bool TestNode::get_account_state(ton::WorkchainId workchain, ton::StdSmcAddress addr, ton::BlockIdExt ref_blkid,
+                                 std::string filename, int mode) {
+  if (!ref_blkid.is_valid()) {
+    return set_error("must obtain last block information before making other queries");
+  }
+  if (!(ready_ && !client_.empty())) {
+    return set_error("server connection not ready");
+  }
+  auto a = ton::create_tl_object<ton::lite_api::liteServer_accountId>(workchain, addr);
+  auto b = ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_getAccountState>(
+                                        ton::create_tl_lite_block_id(ref_blkid), std::move(a)),
+                                    true);
+  LOG(INFO) << "requesting account state for " << workchain << ":" << addr.to_hex() << " with respect to "
+            << ref_blkid.to_str() << " with savefile `" << filename << "` and mode " << mode;
+  return envelope_send_query(std::move(b), [ Self = actor_id(this), workchain, addr, ref_blkid, filename,
+                                             mode ](td::Result<td::BufferSlice> R) {
+    if (R.is_error()) {
+      return;
+    }
+    auto F = ton::fetch_tl_object<ton::lite_api::liteServer_accountState>(R.move_as_ok(), true);
+    if (F.is_error()) {
+      LOG(ERROR) << "cannot parse answer to liteServer.getAccountState";
+    } else {
+      auto f = F.move_as_ok();
+      td::actor::send_closure_later(Self, &TestNode::got_account_state, ref_blkid, ton::create_block_id(f->id_),
+                                    ton::create_block_id(f->shardblk_), std::move(f->shard_proof_),
+                                    std::move(f->proof_), std::move(f->state_), workchain, addr, filename, mode);
+    }
+  });
+}
+
+bool TestNode::parse_run_method(ton::WorkchainId workchain, ton::StdSmcAddress addr, ton::BlockIdExt ref_blkid,
+                                std::string method_name) {
+  std::vector<vm::StackEntry> params;
+  while (!seekeoln()) {
+    vm::StackEntry param;
+    if (!parse_stack_value(param)) {
+      return false;
+    }
+    params.push_back(std::move(param));
+  }
+  if (!ref_blkid.is_valid()) {
+    return set_error("must obtain last block information before making other queries");
+  }
+  if (!(ready_ && !client_.empty())) {
+    return set_error("server connection not ready");
+  }
+  auto a = ton::create_tl_object<ton::lite_api::liteServer_accountId>(workchain, addr);
+  auto b = ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_getAccountState>(
+                                        ton::create_tl_lite_block_id(ref_blkid), std::move(a)),
+                                    true);
+  LOG(INFO) << "requesting account state for " << workchain << ":" << addr.to_hex() << " with respect to "
+            << ref_blkid.to_str() << " to run method " << method_name << " with " << params.size() << " parameters";
+  return envelope_send_query(
+      std::move(b), [ Self = actor_id(this), workchain, addr, ref_blkid, method_name,
+                      params = std::move(params) ](td::Result<td::BufferSlice> R) mutable {
+        if (R.is_error()) {
+          return;
+        }
+        auto F = ton::fetch_tl_object<ton::lite_api::liteServer_accountState>(R.move_as_ok(), true);
+        if (F.is_error()) {
+          LOG(ERROR) << "cannot parse answer to liteServer.getAccountState";
+        } else {
+          auto f = F.move_as_ok();
+          td::actor::send_closure_later(Self, &TestNode::run_smc_method, ref_blkid, ton::create_block_id(f->id_),
+                                        ton::create_block_id(f->shardblk_), std::move(f->shard_proof_),
+                                        std::move(f->proof_), std::move(f->state_), workchain, addr, method_name,
+                                        std::move(params));
+        }
+      });
+}
+
+bool TestNode::get_one_transaction(ton::BlockIdExt blkid, ton::WorkchainId workchain, ton::StdSmcAddress addr,
+                                   ton::LogicalTime lt, bool dump) {
+  if (!blkid.is_valid_full()) {
+    return set_error("invalid block id");
+  }
+  if (!ton::shard_contains(blkid.shard_full(), ton::extract_addr_prefix(workchain, addr))) {
+    return set_error("the shard of this block cannot contain this account");
+  }
+  if (!(ready_ && !client_.empty())) {
+    return set_error("server connection not ready");
+  }
+  auto a = ton::create_tl_object<ton::lite_api::liteServer_accountId>(workchain, addr);
+  auto b = ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_getOneTransaction>(
+                                        ton::create_tl_lite_block_id(blkid), std::move(a), lt),
+                                    true);
+  LOG(INFO) << "requesting transaction " << lt << " of " << workchain << ":" << addr.to_hex() << " from block "
+            << blkid.to_str();
+  return envelope_send_query(
+      std::move(b), [ Self = actor_id(this), workchain, addr, lt, blkid, dump ](td::Result<td::BufferSlice> R)->void {
+        if (R.is_error()) {
+          return;
+        }
+        auto F = ton::fetch_tl_object<ton::lite_api::liteServer_transactionInfo>(R.move_as_ok(), true);
+        if (F.is_error()) {
+          LOG(ERROR) << "cannot parse answer to liteServer.getOneTransaction";
+        } else {
+          auto f = F.move_as_ok();
+          td::actor::send_closure_later(Self, &TestNode::got_one_transaction, blkid, ton::create_block_id(f->id_),
+                                        std::move(f->proof_), std::move(f->transaction_), workchain, addr, lt, dump);
+        }
+      });
+}
+
+bool TestNode::get_last_transactions(ton::WorkchainId workchain, ton::StdSmcAddress addr, ton::LogicalTime lt,
+                                     ton::Bits256 hash, unsigned count, bool dump) {
+  if (!(ready_ && !client_.empty())) {
+    return set_error("server connection not ready");
+  }
+  auto a = ton::create_tl_object<ton::lite_api::liteServer_accountId>(workchain, addr);
+  auto b = ton::serialize_tl_object(
+      ton::create_tl_object<ton::lite_api::liteServer_getTransactions>(count, std::move(a), lt, hash), true);
+  LOG(INFO) << "requesting " << count << " last transactions from " << lt << ":" << hash.to_hex() << " of " << workchain
+            << ":" << addr.to_hex();
+  return envelope_send_query(
+      std::move(b), [ Self = actor_id(this), workchain, addr, lt, hash, count, dump ](td::Result<td::BufferSlice> R) {
+        if (R.is_error()) {
+          return;
+        }
+        auto F = ton::fetch_tl_object<ton::lite_api::liteServer_transactionList>(R.move_as_ok(), true);
+        if (F.is_error()) {
+          LOG(ERROR) << "cannot parse answer to liteServer.getTransactions";
+        } else {
+          auto f = F.move_as_ok();
+          std::vector<ton::BlockIdExt> blkids;
+          for (auto& id : f->ids_) {
+            blkids.push_back(ton::create_block_id(std::move(id)));
+          }
+          td::actor::send_closure_later(Self, &TestNode::got_last_transactions, std::move(blkids),
+                                        std::move(f->transactions_), workchain, addr, lt, hash, count, dump);
+        }
+      });
+}
+
+void TestNode::got_account_state(ton::BlockIdExt ref_blk, ton::BlockIdExt blk, ton::BlockIdExt shard_blk,
+                                 td::BufferSlice shard_proof, td::BufferSlice proof, td::BufferSlice state,
+                                 ton::WorkchainId workchain, ton::StdSmcAddress addr, std::string filename, int mode) {
+  LOG(INFO) << "got account state for " << workchain << ":" << addr.to_hex() << " with respect to blocks "
+            << blk.to_str() << (shard_blk == blk ? "" : std::string{" and "} + shard_blk.to_str());
+  block::AccountState account_state;
+  account_state.blk = blk;
+  account_state.shard_blk = shard_blk;
+  account_state.shard_proof = std::move(shard_proof);
+  account_state.proof = std::move(proof);
+  account_state.state = std::move(state);
+  auto r_info = account_state.validate(ref_blk, block::StdAddress(workchain, addr));
+  if (r_info.is_error()) {
+    LOG(ERROR) << r_info.error().message();
+    return;
+  }
+  auto out = td::TerminalIO::out();
+  auto info = r_info.move_as_ok();
+  if (mode < 0) {
+    if (info.root.not_null()) {
+      out << "account state is ";
+      std::ostringstream outp;
+      block::gen::t_Account.print_ref(outp, info.root);
+      vm::load_cell_slice(info.root).print_rec(outp);
+      out << outp.str();
+      out << "last transaction lt = " << info.last_trans_lt << " hash = " << info.last_trans_hash.to_hex() << std::endl;
+    } else {
+      out << "account state is empty" << std::endl;
+    }
+  } else if (info.root.not_null()) {
+    block::gen::Account::Record_account acc;
+    block::gen::AccountStorage::Record store;
+    if (!(tlb::unpack_cell(info.root, acc) && tlb::csr_unpack(acc.storage, store))) {
+      LOG(ERROR) << "error unpacking account state";
+      return;
+    }
+    int tag = block::gen::t_AccountState.get_tag(*store.state);
+    switch (tag) {
+      case block::gen::AccountState::account_uninit:
+        out << "account not initialized (no StateInit to save into file)" << std::endl;
+        return;
+      case block::gen::AccountState::account_frozen:
+        out << "account frozen (no StateInit to save into file)" << std::endl;
+        return;
+    }
+    CHECK(store.state.write().fetch_ulong(1) == 1);  // account_init$1 _:StateInit = AccountState;
+    block::gen::StateInit::Record state;
+    CHECK(tlb::csr_unpack(store.state, state));
+    Ref<vm::Cell> cell;
+    const char* name = "<unknown-information>";
+    if (mode == 0) {
+      // save all state
+      vm::CellBuilder cb;
+      CHECK(cb.append_cellslice_bool(store.state) && cb.finalize_to(cell));
+      name = "StateInit";
+    } else if (mode == 1) {
+      // save code
+      cell = state.code->prefetch_ref();
+      name = "code";
+    } else if (mode == 2) {
+      // save data
+      cell = state.data->prefetch_ref();
+      name = "data";
+    }
+    if (cell.is_null()) {
+      out << "no " << name << " to save to file" << std::endl;
+      return;
+    }
+    auto res = vm::std_boc_serialize(std::move(cell), 2);
+    if (res.is_error()) {
+      LOG(ERROR) << "cannot serialize extracted information from account state : " << res.move_as_error();
+      return;
+    }
+    auto len = res.ok().size();
+    auto res1 = td::write_file(filename, res.move_as_ok());
+    if (res1.is_error()) {
+      LOG(ERROR) << "cannot write " << name << " of account " << workchain << ":" << addr.to_hex() << " to file `"
+                 << filename << "` : " << res1.move_as_error();
+      return;
+    }
+    out << "written " << name << " of account " << workchain << ":" << addr.to_hex() << " to file `" << filename
+        << "` (" << len << " bytes)" << std::endl;
+  } else {
+    out << "account state is empty (nothing saved to file `" << filename << "`)" << std::endl;
+  }
+}
+
+void TestNode::run_smc_method(ton::BlockIdExt ref_blk, ton::BlockIdExt blk, ton::BlockIdExt shard_blk,
+                              td::BufferSlice shard_proof, td::BufferSlice proof, td::BufferSlice state,
+                              ton::WorkchainId workchain, ton::StdSmcAddress addr, std::string method,
+                              std::vector<vm::StackEntry> params) {
+  LOG(INFO) << "got account state for " << workchain << ":" << addr.to_hex() << " with respect to blocks "
+            << blk.to_str() << (shard_blk == blk ? "" : std::string{" and "} + shard_blk.to_str());
+  block::AccountState account_state;
+  account_state.blk = blk;
+  account_state.shard_blk = shard_blk;
+  account_state.shard_proof = std::move(shard_proof);
+  account_state.proof = std::move(proof);
+  account_state.state = std::move(state);
+  auto r_info = account_state.validate(ref_blk, block::StdAddress(workchain, addr));
+  if (r_info.is_error()) {
+    LOG(ERROR) << r_info.error().message();
+    return;
+  }
+  auto out = td::TerminalIO::out();
+  auto info = r_info.move_as_ok();
+  if (info.root.is_null()) {
+    LOG(ERROR) << "account state of " << workchain << ":" << addr.to_hex() << " is empty (cannot run method `" << method
+               << "`)";
+    return;
+  }
+  block::gen::Account::Record_account acc;
+  block::gen::AccountStorage::Record store;
+  if (!(tlb::unpack_cell(info.root, acc) && tlb::csr_unpack(acc.storage, store))) {
+    LOG(ERROR) << "error unpacking account state";
+    return;
+  }
+  int tag = block::gen::t_AccountState.get_tag(*store.state);
+  switch (tag) {
+    case block::gen::AccountState::account_uninit:
+      LOG(ERROR) << "account " << workchain << ":" << addr.to_hex() << " not initialized yet (cannot run any methods)";
+      return;
+    case block::gen::AccountState::account_frozen:
+      LOG(ERROR) << "account " << workchain << ":" << addr.to_hex() << " frozen (cannot run any methods)";
+      return;
+  }
+  CHECK(store.state.write().fetch_ulong(1) == 1);  // account_init$1 _:StateInit = AccountState;
+  block::gen::StateInit::Record state_init;
+  CHECK(tlb::csr_unpack(store.state, state_init));
+  auto code = state_init.code->prefetch_ref();
+  auto data = state_init.data->prefetch_ref();
+  auto stack = td::make_ref<vm::Stack>(std::move(params));
+  td::int64 method_id;
+  if (!convert_int64(method, method_id)) {
+    method_id = (td::crc16(td::Slice{method}) & 0xffff) | 0x10000;
+  }
+  stack.write().push_smallint(method_id);
+  {
+    std::ostringstream os;
+    os << "arguments: ";
+    stack->dump(os);
+    out << os.str();
+  }
+  long long gas_limit = vm::GasLimits::infty;
+  // OstreamLogger ostream_logger(ctx.error_stream);
+  // auto log = create_vm_log(ctx.error_stream ? &ostream_logger : nullptr);
+  vm::GasLimits gas{gas_limit};
+  LOG(DEBUG) << "creating VM";
+  vm::VmState vm{code, std::move(stack), gas, 1, data, vm::VmLog()};
+  LOG(INFO) << "starting VM to run method `" << method << "` (" << method_id << ") of smart contract " << workchain
+            << ":" << addr.to_hex();
+  int exit_code = ~vm.run();
+  LOG(DEBUG) << "VM terminated with exit code " << exit_code;
+  if (exit_code != 0) {
+    LOG(ERROR) << "VM terminated with error code " << exit_code;
+    out << "result: error " << exit_code << std::endl;
+    return;
+  }
+  stack = vm.get_stack_ref();
+  {
+    std::ostringstream os;
+    os << "result: ";
+    stack->dump(os);
+    out << os.str();
+  }
+}
+
+void TestNode::got_one_transaction(ton::BlockIdExt req_blkid, ton::BlockIdExt blkid, td::BufferSlice proof,
+                                   td::BufferSlice transaction, ton::WorkchainId workchain, ton::StdSmcAddress addr,
+                                   ton::LogicalTime trans_lt, bool dump) {
+  LOG(INFO) << "got transaction " << trans_lt << " for " << workchain << ":" << addr.to_hex()
+            << " with respect to block " << blkid.to_str();
+  if (blkid != req_blkid) {
+    LOG(ERROR) << "obtained TransactionInfo for a different block " << blkid.to_str() << " instead of requested "
+               << req_blkid.to_str();
+    return;
+  }
+  if (!ton::shard_contains(blkid.shard_full(), ton::extract_addr_prefix(workchain, addr))) {
+    LOG(ERROR) << "received data from block " << blkid.to_str() << " that cannot contain requested account "
+               << workchain << ":" << addr.to_hex();
+    return;
+  }
+  Ref<vm::Cell> root;
+  if (!transaction.empty()) {
+    auto R = vm::std_boc_deserialize(std::move(transaction));
+    if (R.is_error()) {
+      LOG(ERROR) << "cannot deserialize transaction";
+      return;
+    }
+    root = R.move_as_ok();
+    CHECK(root.not_null());
+  }
+  auto P = vm::std_boc_deserialize(std::move(proof));
+  if (P.is_error()) {
+    LOG(ERROR) << "cannot deserialize block transaction proof";
+    return;
+  }
+  auto proof_root = P.move_as_ok();
+  try {
+    auto block_root = vm::MerkleProof::virtualize(std::move(proof_root), 1);
+    if (block_root.is_null()) {
+      LOG(ERROR) << "transaction block proof is invalid";
+      return;
+    }
+    auto res1 = block::check_block_header_proof(block_root, blkid);
+    if (res1.is_error()) {
+      LOG(ERROR) << "error in transaction block header proof : " << res1.move_as_error().to_string();
+      return;
+    }
+    auto trans_root_res = block::get_block_transaction_try(std::move(block_root), workchain, addr, trans_lt);
+    if (trans_root_res.is_error()) {
+      LOG(ERROR) << trans_root_res.move_as_error().message();
+      return;
+    }
+    auto trans_root = trans_root_res.move_as_ok();
+    if (trans_root.is_null() && root.not_null()) {
+      LOG(ERROR) << "error checking transaction proof: proof claims there is no such transaction, but we have got "
+                    "transaction data with hash "
+                 << root->get_hash().bits().to_hex(256);
+      return;
+    }
+    if (trans_root.not_null() && root.is_null()) {
+      LOG(ERROR) << "error checking transaction proof: proof claims there is such a transaction with hash "
+                 << trans_root->get_hash().bits().to_hex(256)
+                 << ", but we have got no "
+                    "transaction data";
+      return;
+    }
+    if (trans_root.not_null() && trans_root->get_hash().bits().compare(root->get_hash().bits(), 256)) {
+      LOG(ERROR) << "transaction hash mismatch: Merkle proof expects " << trans_root->get_hash().bits().to_hex(256)
+                 << " but received data has " << root->get_hash().bits().to_hex(256);
+      return;
+    }
+  } catch (vm::VmError err) {
+    LOG(ERROR) << "error while traversing block transaction proof : " << err.get_msg();
+    return;
+  } catch (vm::VmVirtError err) {
+    LOG(ERROR) << "virtualization error while traversing block transaction proof : " << err.get_msg();
+    return;
+  }
+  auto out = td::TerminalIO::out();
+  if (root.is_null()) {
+    out << "transaction not found" << std::endl;
+  } else {
+    out << "transaction is ";
+    std::ostringstream outp;
+    block::gen::t_Transaction.print_ref(outp, root);
+    vm::load_cell_slice(root).print_rec(outp);
+    out << outp.str();
+  }
+}
+
+bool unpack_addr(std::ostream& os, Ref<vm::CellSlice> csr) {
+  ton::WorkchainId wc;
+  ton::StdSmcAddress addr;
+  if (!block::tlb::t_MsgAddressInt.extract_std_address(std::move(csr), wc, addr)) {
+    os << "<cannot unpack address>";
+    return false;
+  }
+  os << wc << ":" << addr.to_hex();
+  return true;
+}
+
+bool unpack_message(std::ostream& os, Ref<vm::Cell> msg, int mode) {
+  if (msg.is_null()) {
+    os << "<message not found>";
+    return true;
+  }
+  vm::CellSlice cs{vm::NoVmOrd(), msg};
+  switch (block::gen::t_CommonMsgInfo.get_tag(cs)) {
+    case block::gen::CommonMsgInfo::ext_in_msg_info: {
+      block::gen::CommonMsgInfo::Record_ext_in_msg_info info;
+      if (!tlb::unpack(cs, info)) {
+        LOG(DEBUG) << "cannot unpack inbound external message";
+        return false;
+      }
+      os << "EXT-IN-MSG";
+      if (!(mode & 2)) {
+        os << " TO: ";
+        if (!unpack_addr(os, std::move(info.dest))) {
+          return false;
+        }
+      }
+      return true;
+    }
+    case block::gen::CommonMsgInfo::ext_out_msg_info: {
+      block::gen::CommonMsgInfo::Record_ext_out_msg_info info;
+      if (!tlb::unpack(cs, info)) {
+        LOG(DEBUG) << "cannot unpack outbound external message";
+        return false;
+      }
+      os << "EXT-OUT-MSG";
+      if (!(mode & 1)) {
+        os << " FROM: ";
+        if (!unpack_addr(os, std::move(info.src))) {
+          return false;
+        }
+      }
+      os << " LT:" << info.created_lt << " UTIME:" << info.created_at;
+      return true;
+    }
+    case block::gen::CommonMsgInfo::int_msg_info: {
+      block::gen::CommonMsgInfo::Record_int_msg_info info;
+      if (!tlb::unpack(cs, info)) {
+        LOG(DEBUG) << "cannot unpack internal message";
+        return false;
+      }
+      os << "INT-MSG";
+      if (!(mode & 1)) {
+        os << " FROM: ";
+        if (!unpack_addr(os, std::move(info.src))) {
+          return false;
+        }
+      }
+      if (!(mode & 2)) {
+        os << " TO: ";
+        if (!unpack_addr(os, std::move(info.dest))) {
+          return false;
+        }
+      }
+      os << " LT:" << info.created_lt << " UTIME:" << info.created_at;
+      td::RefInt256 value;
+      Ref<vm::Cell> extra;
+      if (!block::unpack_CurrencyCollection(info.value, value, extra)) {
+        LOG(ERROR) << "cannot unpack message value";
+        return false;
+      }
+      os << " VALUE:" << value;
+      if (extra.not_null()) {
+        os << "+extra";
+      }
+      return true;
+    }
+    default:
+      LOG(ERROR) << "cannot unpack message";
+      return false;
+  }
+}
+
+std::string message_info_str(Ref<vm::Cell> msg, int mode) {
+  std::ostringstream os;
+  if (!unpack_message(os, msg, mode)) {
+    return "<cannot unpack message>";
+  } else {
+    return os.str();
+  }
+}
+
+void TestNode::got_last_transactions(std::vector<ton::BlockIdExt> blkids, td::BufferSlice transactions_boc,
+                                     ton::WorkchainId workchain, ton::StdSmcAddress addr, ton::LogicalTime lt,
+                                     ton::Bits256 hash, unsigned count, bool dump) {
+  LOG(INFO) << "got up to " << count << " transactions for " << workchain << ":" << addr.to_hex()
+            << " from last transaction " << lt << ":" << hash.to_hex();
+  block::TransactionList transaction_list;
+  transaction_list.blkids = blkids;
+  transaction_list.lt = lt;
+  transaction_list.hash = hash;
+  transaction_list.transactions_boc = std::move(transactions_boc);
+  auto r_account_state_info = transaction_list.validate();
+  if (r_account_state_info.is_error()) {
+    LOG(ERROR) << "got_last_transactions: " << r_account_state_info.error();
+    return;
+  }
+  auto account_state_info = r_account_state_info.move_as_ok();
+  unsigned c = 0;
+  auto out = td::TerminalIO::out();
+  CHECK(!account_state_info.transactions.empty());
+  for (auto& info : account_state_info.transactions) {
+    const auto& blkid = info.blkid;
+    out << "transaction #" << c << " from block " << blkid.to_str() << (dump ? " is " : "\n");
+    if (dump) {
+      std::ostringstream outp;
+      block::gen::t_Transaction.print_ref(outp, info.transaction);
+      vm::load_cell_slice(info.transaction).print_rec(outp);
+      out << outp.str();
+    }
+    block::gen::Transaction::Record trans;
+    if (!tlb::unpack_cell(info.transaction, trans)) {
+      LOG(ERROR) << "cannot unpack transaction #" << c;
+      return;
+    }
+    out << "  time=" << trans.now << " outmsg_cnt=" << trans.outmsg_cnt << std::endl;
+    auto in_msg = trans.r1.in_msg->prefetch_ref();
+    if (in_msg.is_null()) {
+      out << "  (no inbound message)" << std::endl;
+    } else {
+      out << "  inbound message: " << message_info_str(in_msg, 2 * 0) << std::endl;
+      if (dump) {
+        out << "    " << block::gen::t_Message_Any.as_string_ref(in_msg, 4);  // indentation = 4 spaces
+      }
+    }
+    vm::Dictionary dict{trans.r1.out_msgs, 15};
+    for (int x = 0; x < trans.outmsg_cnt && x < 100; x++) {
+      auto out_msg = dict.lookup_ref(td::BitArray<15>{x});
+      out << "  outbound message #" << x << ": " << message_info_str(out_msg, 1 * 0) << std::endl;
+      if (dump) {
+        out << "    " << block::gen::t_Message_Any.as_string_ref(out_msg, 4);
+      }
+    }
+    register_blkid(blkid);  // unsafe?
+  }
+  auto& last = account_state_info.transactions.back();
+  if (last.prev_trans_lt > 0) {
+    out << "previous transaction has lt " << last.prev_trans_lt << " hash " << last.prev_trans_hash.to_hex()
+        << std::endl;
+    if (account_state_info.transactions.size() < count) {
+      LOG(WARNING) << "obtained less transactions than required";
+    }
+  } else {
+    out << "no preceding transactions (list complete)" << std::endl;
+  }
+}
+
+bool TestNode::get_block_transactions(ton::BlockIdExt blkid, int mode, unsigned count, ton::Bits256 acc_addr,
+                                      ton::LogicalTime lt) {
+  if (!(ready_ && !client_.empty())) {
+    return set_error("server connection not ready");
+  }
+  auto a = ton::create_tl_object<ton::lite_api::liteServer_transactionId3>(acc_addr, lt);
+  auto b = ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_listBlockTransactions>(
+                                        ton::create_tl_lite_block_id(blkid), mode, count, std::move(a), false, false),
+                                    true);
+  LOG(INFO) << "requesting " << count << " transactions from block " << blkid.to_str() << " starting from account "
+            << acc_addr.to_hex() << " lt " << lt;
+  return envelope_send_query(std::move(b), [ Self = actor_id(this), mode ](td::Result<td::BufferSlice> R) {
+    if (R.is_error()) {
+      return;
+    }
+    auto F = ton::fetch_tl_object<ton::lite_api::liteServer_blockTransactions>(R.move_as_ok(), true);
+    if (F.is_error()) {
+      LOG(ERROR) << "cannot parse answer to liteServer.listBlockTransactions";
+    } else {
+      auto f = F.move_as_ok();
+      std::vector<TransId> transactions;
+      for (auto& id : f->ids_) {
+        transactions.emplace_back(id->account_, id->lt_, id->hash_);
+      }
+      td::actor::send_closure_later(Self, &TestNode::got_block_transactions, ton::create_block_id(f->id_), mode,
+                                    f->req_count_, f->incomplete_, std::move(transactions), std::move(f->proof_));
+    }
+  });
+}
+
+void TestNode::got_block_transactions(ton::BlockIdExt blkid, int mode, unsigned req_count, bool incomplete,
+                                      std::vector<TestNode::TransId> trans, td::BufferSlice proof) {
+  LOG(INFO) << "got up to " << req_count << " transactions from block " << blkid.to_str();
+  auto out = td::TerminalIO::out();
+  int count = 0;
+  for (auto& t : trans) {
+    out << "transaction #" << ++count << ": account " << t.acc_addr.to_hex() << " lt " << t.trans_lt << " hash "
+        << t.trans_hash.to_hex() << std::endl;
+  }
+  out << (incomplete ? "(block transaction list incomplete)" : "(end of block transaction list)") << std::endl;
+}
+
+bool TestNode::get_all_shards(bool use_last, ton::BlockIdExt blkid) {
+  if (use_last) {
+    blkid = mc_last_id_;
+  }
+  if (!blkid.is_valid_full()) {
+    return set_error(use_last ? "must obtain last block information before making other queries"
+                              : "invalid masterchain block id");
+  }
+  if (!blkid.is_masterchain()) {
+    return set_error("only masterchain blocks contain shard configuration");
+  }
+  if (!(ready_ && !client_.empty())) {
+    return set_error("server connection not ready");
+  }
+  auto b = ton::serialize_tl_object(
+      ton::create_tl_object<ton::lite_api::liteServer_getAllShardsInfo>(ton::create_tl_lite_block_id(blkid)), true);
+  LOG(INFO) << "requesting recent shard configuration";
+  return envelope_send_query(std::move(b), [Self = actor_id(this)](td::Result<td::BufferSlice> R)->void {
+    if (R.is_error()) {
+      return;
+    }
+    auto F = ton::fetch_tl_object<ton::lite_api::liteServer_allShardsInfo>(R.move_as_ok(), true);
+    if (F.is_error()) {
+      LOG(ERROR) << "cannot parse answer to liteServer.getAllShardsInfo";
+    } else {
+      auto f = F.move_as_ok();
+      td::actor::send_closure_later(Self, &TestNode::got_all_shards, ton::create_block_id(f->id_), std::move(f->proof_),
+                                    std::move(f->data_));
+    }
+  });
+}
+
+void TestNode::got_all_shards(ton::BlockIdExt blk, td::BufferSlice proof, td::BufferSlice data) {
+  LOG(INFO) << "got shard configuration with respect to block " << blk.to_str();
+  if (data.empty()) {
+    td::TerminalIO::out() << "shard configuration is empty" << '\n';
+  } else {
+    auto R = vm::std_boc_deserialize(data.clone());
+    if (R.is_error()) {
+      LOG(ERROR) << "cannot deserialize shard configuration";
+      return;
+    }
+    auto root = R.move_as_ok();
+    auto out = td::TerminalIO::out();
+    out << "shard configuration is ";
+    std::ostringstream outp;
+    block::gen::t_ShardHashes.print_ref(outp, root);
+    vm::load_cell_slice(root).print_rec(outp);
+    out << outp.str();
+    block::ShardConfig sh_conf;
+    if (!sh_conf.unpack(vm::load_cell_slice_ref(root))) {
+      out << "cannot extract shard block list from shard configuration\n";
+    } else {
+      auto ids = sh_conf.get_shard_hash_ids(true);
+      int cnt = 0;
+      for (auto id : ids) {
+        auto ref = sh_conf.get_shard_hash(ton::ShardIdFull(id));
+        if (ref.not_null()) {
+          register_blkid(ref->top_block_id());
+          out << "shard #" << ++cnt << " : " << ref->top_block_id().to_str() << " @ " << ref->created_at() << " lt "
+              << ref->start_lt() << " .. " << ref->end_lt() << std::endl;
+        } else {
+          out << "shard #" << ++cnt << " : " << id.to_str() << " (cannot unpack)\n";
+        }
+      }
+    }
+  }
+  show_new_blkids();
+}
+
+bool TestNode::get_config_params(ton::BlockIdExt blkid, int mode, std::string filename) {
+  std::vector<int> params;
+  if (mode >= 0 && !seekeoln()) {
+    mode |= 0x1000;
+    while (!seekeoln()) {
+      int x;
+      if (!convert_int32(get_word(), x)) {
+        return set_error("integer configuration parameter id expected");
+      }
+      params.push_back(x);
+    }
+  }
+  if (!(ready_ && !client_.empty())) {
+    return set_error("server connection not ready");
+  }
+  if (!blkid.is_masterchain_ext()) {
+    return set_error("only masterchain blocks contain configuration");
+  }
+  auto params_copy = params;
+  auto b = (mode & 0x3000) == 0x1000
+               ? ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_getConfigParams>(
+                                              0, ton::create_tl_lite_block_id(blkid), std::move(params_copy)),
+                                          true)
+               : ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_getConfigAll>(
+                                              0, ton::create_tl_lite_block_id(blkid)),
+                                          true);
+  LOG(INFO) << "requesting " << params.size() << " configuration parameters with respect to masterchain block "
+            << blkid.to_str();
+  return envelope_send_query(std::move(b), [ Self = actor_id(this), mode, filename,
+                                             params = std::move(params) ](td::Result<td::BufferSlice> R) mutable {
+    if (R.is_error()) {
+      return;
+    }
+    auto F = ton::fetch_tl_object<ton::lite_api::liteServer_configInfo>(R.move_as_ok(), true);
+    if (F.is_error()) {
+      LOG(ERROR) << "cannot parse answer to liteServer.getConfigParams";
+    } else {
+      auto f = F.move_as_ok();
+      td::actor::send_closure_later(Self, &TestNode::got_config_params, ton::create_block_id(f->id_),
+                                    std::move(f->state_proof_), std::move(f->config_proof_), mode, filename,
+                                    std::move(params));
+    }
+  });
+}
+
+void TestNode::got_config_params(ton::BlockIdExt blkid, td::BufferSlice state_proof, td::BufferSlice cfg_proof,
+                                 int mode, std::string filename, std::vector<int> params) {
+  LOG(INFO) << "got configuration parameters";
+  if (!blkid.is_masterchain_ext()) {
+    LOG(ERROR) << "reference block " << blkid.to_str() << " for the configuration is not a valid masterchain block";
+    return;
+  }
+  auto R = block::check_extract_state_proof(blkid, state_proof.as_slice(), cfg_proof.as_slice());
+  if (R.is_error()) {
+    LOG(ERROR) << "masterchain state proof for " << blkid.to_str() << " is invalid : " << R.move_as_error().to_string();
+    return;
+  }
+  try {
+    auto res = block::Config::extract_from_state(R.move_as_ok(), mode >= 0 ? mode & 0xfff : 0);
+    if (res.is_error()) {
+      LOG(ERROR) << "cannot unpack configuration: " << res.move_as_error().to_string();
+      return;
+    }
+    auto config = res.move_as_ok();
+    if (mode < 0) {
+      auto F = vm::std_boc_serialize(config->get_root_cell(), 2);
+      if (F.is_error()) {
+        LOG(ERROR) << "cannot serialize configuration: " << F.move_as_error().to_string();
+        return;
+      }
+      auto size = F.ok().size();
+      auto W = td::write_file(filename, F.move_as_ok());
+      if (W.is_error()) {
+        LOG(ERROR) << "cannot save file `" << filename << "` : " << W.move_as_error().to_string();
+        return;
+      }
+      td::TerminalIO::out() << "saved configuration dictionary into file `" << filename << "` (" << size
+                            << " bytes written)" << std::endl;
+      return;
+    }
+    auto out = td::TerminalIO::out();
+    if (mode & 0x1000) {
+      for (int i : params) {
+        out << "ConfigParam(" << i << ") = ";
+        auto value = config->get_config_param(i);
+        if (value.is_null()) {
+          out << "(null)\n";
+        } else {
+          std::ostringstream os;
+          if (i >= 0) {
+            block::gen::ConfigParam{i}.print_ref(os, value);
+            os << std::endl;
+          }
+          vm::load_cell_slice(value).print_rec(os);
+          out << os.str() << std::endl;
+        }
+      }
+    } else {
+      config->foreach_config_param([&out](int i, Ref<vm::Cell> value) {
+        out << "ConfigParam(" << i << ") = ";
+        if (value.is_null()) {
+          out << "(null)\n";
+        } else {
+          std::ostringstream os;
+          if (i >= 0) {
+            block::gen::ConfigParam{i}.print_ref(os, value);
+            os << std::endl;
+          }
+          vm::load_cell_slice(value).print_rec(os);
+          out << os.str() << std::endl;
+        }
+        return true;
+      });
+    }
+  } catch (vm::VmError& err) {
+    LOG(ERROR) << "error while traversing configuration: " << err.get_msg();
+  } catch (vm::VmVirtError& err) {
+    LOG(ERROR) << "virtualization error while traversing configuration: " << err.get_msg();
+  }
+}
+
+bool TestNode::get_block(ton::BlockIdExt blkid, bool dump) {
+  LOG(INFO) << "got block download request for " << blkid.to_str();
+  auto b = ton::serialize_tl_object(
+      ton::create_tl_object<ton::lite_api::liteServer_getBlock>(ton::create_tl_lite_block_id(blkid)), true);
+  return envelope_send_query(
+      std::move(b), [ Self = actor_id(this), blkid, dump ](td::Result<td::BufferSlice> res)->void {
+        if (res.is_error()) {
+          LOG(ERROR) << "cannot obtain block " << blkid.to_str()
+                     << " from server : " << res.move_as_error().to_string();
+          return;
+        } else {
+          auto F = ton::fetch_tl_object<ton::lite_api::liteServer_blockData>(res.move_as_ok(), true);
+          if (F.is_error()) {
+            LOG(ERROR) << "cannot parse answer to liteServer.getBlock : " << res.move_as_error().to_string();
+          } else {
+            auto f = F.move_as_ok();
+            auto blk_id = ton::create_block_id(f->id_);
+            LOG(INFO) << "obtained block " << blk_id.to_str() << " from server";
+            if (blk_id != blkid) {
+              LOG(ERROR) << "block id mismatch: expected data for block " << blkid.to_str() << ", obtained for "
+                         << blk_id.to_str();
+              return;
+            }
+            td::actor::send_closure_later(Self, &TestNode::got_block, blk_id, std::move(f->data_), dump);
+          }
+        }
+      });
+}
+
+bool TestNode::get_state(ton::BlockIdExt blkid, bool dump) {
+  LOG(INFO) << "got state download request for " << blkid.to_str();
+  auto b = ton::serialize_tl_object(
+      ton::create_tl_object<ton::lite_api::liteServer_getState>(ton::create_tl_lite_block_id(blkid)), true);
+  return envelope_send_query(
+      std::move(b), [ Self = actor_id(this), blkid, dump ](td::Result<td::BufferSlice> res)->void {
+        if (res.is_error()) {
+          LOG(ERROR) << "cannot obtain state " << blkid.to_str()
+                     << " from server : " << res.move_as_error().to_string();
+          return;
+        } else {
+          auto F = ton::fetch_tl_object<ton::lite_api::liteServer_blockState>(res.move_as_ok(), true);
+          if (F.is_error()) {
+            LOG(ERROR) << "cannot parse answer to liteServer.getState";
+          } else {
+            auto f = F.move_as_ok();
+            auto blk_id = ton::create_block_id(f->id_);
+            LOG(INFO) << "obtained state " << blk_id.to_str() << " from server";
+            if (blk_id != blkid) {
+              LOG(ERROR) << "block id mismatch: expected state for block " << blkid.to_str() << ", obtained for "
+                         << blk_id.to_str();
+              return;
+            }
+            td::actor::send_closure_later(Self, &TestNode::got_state, blk_id, f->root_hash_, f->file_hash_,
+                                          std::move(f->data_), dump);
+          }
+        }
+      });
+}
+
+void TestNode::got_block(ton::BlockIdExt blkid, td::BufferSlice data, bool dump) {
+  LOG(INFO) << "obtained " << data.size() << " data bytes for block " << blkid.to_str();
+  ton::FileHash fhash;
+  td::sha256(data.as_slice(), fhash.as_slice());
+  if (fhash != blkid.file_hash) {
+    LOG(ERROR) << "file hash mismatch for block " << blkid.to_str() << ": expected " << blkid.file_hash.to_hex()
+               << ", computed " << fhash.to_hex();
+    return;
+  }
+  register_blkid(blkid);
+  if (!db_root_.empty()) {
+    auto res = save_db_file(fhash, data.clone());
+    if (res.is_error()) {
+      LOG(ERROR) << "error saving block file: " << res.to_string();
+    }
+  }
+  if (dump) {
+    auto res = vm::std_boc_deserialize(std::move(data));
+    if (res.is_error()) {
+      LOG(ERROR) << "cannot deserialize block data : " << res.move_as_error().to_string();
+      return;
+    }
+    auto root = res.move_as_ok();
+    ton::RootHash rhash{root->get_hash().bits()};
+    if (rhash != blkid.root_hash) {
+      LOG(ERROR) << "block root hash mismatch: data has " << rhash.to_hex() << " , expected "
+                 << blkid.root_hash.to_hex();
+      return;
+    }
+    auto out = td::TerminalIO::out();
+    out << "block contents is ";
+    std::ostringstream outp;
+    block::gen::t_Block.print_ref(outp, root);
+    vm::load_cell_slice(root).print_rec(outp);
+    out << outp.str();
+    show_block_header(blkid, std::move(root), 0xffff);
+  } else {
+    auto res = lazy_boc_deserialize(std::move(data));
+    if (res.is_error()) {
+      LOG(ERROR) << "cannot lazily deserialize block data : " << res.move_as_error().to_string();
+      return;
+    }
+    auto pair = res.move_as_ok();
+    auto root = std::move(pair.first);
+    ton::RootHash rhash{root->get_hash().bits()};
+    if (rhash != blkid.root_hash) {
+      LOG(ERROR) << "block root hash mismatch: data has " << rhash.to_hex() << " , expected "
+                 << blkid.root_hash.to_hex();
+      return;
+    }
+    show_block_header(blkid, std::move(root), 0xffff);
+  }
+  show_new_blkids();
+}
+
+void TestNode::got_state(ton::BlockIdExt blkid, ton::RootHash root_hash, ton::FileHash file_hash, td::BufferSlice data,
+                         bool dump) {
+  LOG(INFO) << "obtained " << data.size() << " state bytes for block " << blkid.to_str();
+  ton::FileHash fhash;
+  td::sha256(data.as_slice(), fhash.as_slice());
+  if (fhash != file_hash) {
+    LOG(ERROR) << "file hash mismatch for state " << blkid.to_str() << ": expected " << file_hash.to_hex()
+               << ", computed " << fhash.to_hex();
+    return;
+  }
+  register_blkid(blkid);
+  if (!db_root_.empty()) {
+    auto res = save_db_file(fhash, data.clone());
+    if (res.is_error()) {
+      LOG(ERROR) << "error saving state file: " << res.to_string();
+    }
+  }
+  if (dump) {
+    auto res = vm::std_boc_deserialize(std::move(data));
+    if (res.is_error()) {
+      LOG(ERROR) << "cannot deserialize block data : " << res.move_as_error().to_string();
+      return;
+    }
+    auto root = res.move_as_ok();
+    ton::RootHash rhash{root->get_hash().bits()};
+    if (rhash != root_hash) {
+      LOG(ERROR) << "block state root hash mismatch: data has " << rhash.to_hex() << " , expected "
+                 << root_hash.to_hex();
+      return;
+    }
+    auto out = td::TerminalIO::out();
+    out << "shard state contents is ";
+    std::ostringstream outp;
+    block::gen::t_ShardState.print_ref(outp, root);
+    vm::load_cell_slice(root).print_rec(outp);
+    out << outp.str();
+    show_state_header(blkid, std::move(root), 0xffff);
+  } else {
+    auto res = lazy_boc_deserialize(std::move(data));
+    if (res.is_error()) {
+      LOG(ERROR) << "cannot lazily deserialize block data : " << res.move_as_error().to_string();
+      return;
+    }
+    auto pair = res.move_as_ok();
+    auto root = std::move(pair.first);
+    ton::RootHash rhash{root->get_hash().bits()};
+    if (rhash != root_hash) {
+      LOG(ERROR) << "block state root hash mismatch: data has " << rhash.to_hex() << " , expected "
+                 << root_hash.to_hex();
+      return;
+    }
+    show_state_header(blkid, std::move(root), 0xffff);
+  }
+  show_new_blkids();
+}
+
+bool TestNode::get_block_header(ton::BlockIdExt blkid, int mode) {
+  LOG(INFO) << "got block header request for " << blkid.to_str() << " with mode " << mode;
+  auto b = ton::serialize_tl_object(
+      ton::create_tl_object<ton::lite_api::liteServer_getBlockHeader>(ton::create_tl_lite_block_id(blkid), mode), true);
+  return envelope_send_query(std::move(b), [ Self = actor_id(this), blkid ](td::Result<td::BufferSlice> res)->void {
+    if (res.is_error()) {
+      LOG(ERROR) << "cannot obtain block header for " << blkid.to_str()
+                 << " from server : " << res.move_as_error().to_string();
+      return;
+    } else {
+      auto F = ton::fetch_tl_object<ton::lite_api::liteServer_blockHeader>(res.move_as_ok(), true);
+      if (F.is_error()) {
+        LOG(ERROR) << "cannot parse answer to liteServer.getBlockHeader : " << res.move_as_error().to_string();
+      } else {
+        auto f = F.move_as_ok();
+        auto blk_id = ton::create_block_id(f->id_);
+        LOG(INFO) << "obtained block header for " << blk_id.to_str() << " from server";
+        if (blk_id != blkid) {
+          LOG(ERROR) << "block id mismatch: expected data for block " << blkid.to_str() << ", obtained for "
+                     << blk_id.to_str();
+        }
+        td::actor::send_closure_later(Self, &TestNode::got_block_header, blk_id, std::move(f->header_proof_), f->mode_);
+      }
+    }
+  });
+  return false;
+}
+
+bool TestNode::lookup_block(ton::ShardIdFull shard, int mode, td::uint64 arg) {
+  ton::BlockId id{shard, mode & 1 ? (td::uint32)arg : 0};
+  LOG(INFO) << "got block lookup request for " << id.to_str() << " with mode " << mode << " and argument " << arg;
+  auto b = ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_lookupBlock>(
+                                        mode, ton::create_tl_lite_block_id_simple(id), arg, (td::uint32)arg),
+                                    true);
+  return envelope_send_query(
+      std::move(b), [ Self = actor_id(this), id, mode, arg ](td::Result<td::BufferSlice> res)->void {
+        if (res.is_error()) {
+          LOG(ERROR) << "cannot look up block header for " << id.to_str() << " with mode " << mode << " and argument "
+                     << arg << " from server : " << res.move_as_error().to_string();
+          return;
+        } else {
+          auto F = ton::fetch_tl_object<ton::lite_api::liteServer_blockHeader>(res.move_as_ok(), true);
+          if (F.is_error()) {
+            LOG(ERROR) << "cannot parse answer to liteServer.lookupBlock : " << res.move_as_error().to_string();
+          } else {
+            auto f = F.move_as_ok();
+            auto blk_id = ton::create_block_id(f->id_);
+            LOG(INFO) << "obtained block header for " << blk_id.to_str() << " from server";
+            td::actor::send_closure_later(Self, &TestNode::got_block_header, blk_id, std::move(f->header_proof_),
+                                          f->mode_);
+          }
+        }
+      });
+}
+
+bool TestNode::show_block_header(ton::BlockIdExt blkid, Ref<vm::Cell> root, int mode) {
+  ton::RootHash vhash{root->get_hash().bits()};
+  if (vhash != blkid.root_hash) {
+    LOG(ERROR) << " block header for block " << blkid.to_str() << " has incorrect root hash " << vhash.to_hex()
+               << " instead of " << blkid.root_hash.to_hex();
+    return false;
+  }
+  std::vector<ton::BlockIdExt> prev;
+  ton::BlockIdExt mc_blkid;
+  bool after_split;
+  auto res = block::unpack_block_prev_blk_ext(root, blkid, prev, mc_blkid, after_split);
+  if (res.is_error()) {
+    LOG(ERROR) << "cannot unpack header for block " << blkid.to_str() << " : " << res.to_string();
+    return false;
+  }
+  block::gen::Block::Record blk;
+  block::gen::BlockInfo::Record info;
+  if (!(tlb::unpack_cell(root, blk) && tlb::unpack_cell(blk.info, info))) {
+    LOG(ERROR) << "cannot unpack header for block " << blkid.to_str();
+    return false;
+  }
+  auto out = td::TerminalIO::out();
+  out << "block header of " << blkid.to_str() << " @ " << info.gen_utime << " lt " << info.start_lt << " .. "
+      << info.end_lt << std::endl;
+  out << "global_id=" << blk.global_id << " version=" << info.version << " not_master=" << info.not_master
+      << " after_merge=" << info.after_merge << " after_split=" << info.after_split
+      << " before_split=" << info.before_split << " want_merge=" << info.want_merge << " want_split=" << info.want_split
+      << " validator_list_hash_short=" << info.gen_validator_list_hash_short
+      << " catchain_seqno=" << info.gen_catchain_seqno << " min_ref_mc_seqno=" << info.min_ref_mc_seqno;
+  if (!info.not_master) {
+    out << " is_key_block=" << info.key_block << " prev_key_block_seqno=" << info.prev_key_block_seqno;
+  }
+  out << std::endl;
+  register_blkid(blkid);
+  int cnt = 0;
+  for (auto id : prev) {
+    out << "previous block #" << ++cnt << " : " << id.to_str() << std::endl;
+    register_blkid(id);
+  }
+  out << "reference masterchain block : " << mc_blkid.to_str() << std::endl;
+  register_blkid(mc_blkid);
+  return true;
+}
+
+bool TestNode::show_state_header(ton::BlockIdExt blkid, Ref<vm::Cell> root, int mode) {
+  return true;
+}
+
+void TestNode::got_block_header(ton::BlockIdExt blkid, td::BufferSlice data, int mode) {
+  LOG(INFO) << "obtained " << data.size() << " data bytes as block header for " << blkid.to_str();
+  auto res = vm::std_boc_deserialize(data.clone());
+  if (res.is_error()) {
+    LOG(ERROR) << "cannot deserialize block header data : " << res.move_as_error().to_string();
+    return;
+  }
+  auto root = res.move_as_ok();
+  std::ostringstream outp;
+  vm::CellSlice cs{vm::NoVm{}, root};
+  cs.print_rec(outp);
+  td::TerminalIO::out() << outp.str();
+  try {
+    auto virt_root = vm::MerkleProof::virtualize(root, 1);
+    if (virt_root.is_null()) {
+      LOG(ERROR) << " block header proof for block " << blkid.to_str() << " is not a valid Merkle proof";
+      return;
+    }
+    show_block_header(blkid, std::move(virt_root), mode);
+  } catch (vm::VmError err) {
+    LOG(ERROR) << "error processing header for " << blkid.to_str() << " : " << err.get_msg();
+  } catch (vm::VmVirtError err) {
+    LOG(ERROR) << "error processing header for " << blkid.to_str() << " : " << err.get_msg();
+  }
+  show_new_blkids();
+}
+
+bool TestNode::get_block_proof(ton::BlockIdExt from, ton::BlockIdExt to, int mode) {
+  if (!(mode & 1)) {
+    to.invalidate_clear();
+  }
+  if (!(mode & 0x2000)) {
+    LOG(INFO) << "got block proof request from " << from.to_str() << " to "
+              << ((mode & 1) ? to.to_str() : "last masterchain block") << " with mode=" << mode;
+  } else {
+    LOG(DEBUG) << "got block proof request from " << from.to_str() << " to "
+               << ((mode & 1) ? to.to_str() : "last masterchain block") << " with mode=" << mode;
+  }
+  if (!from.is_masterchain_ext()) {
+    LOG(ERROR) << "source block " << from.to_str() << " is not a valid masterchain block id";
+    return false;
+  }
+  if ((mode & 1) && !to.is_masterchain_ext()) {
+    LOG(ERROR) << "destination block " << to.to_str() << " is not a valid masterchain block id";
+    return false;
+  }
+  auto b =
+      ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_getBlockProof>(
+                                   mode & 0xfff, ton::create_tl_lite_block_id(from), ton::create_tl_lite_block_id(to)),
+                               true);
+  return envelope_send_query(std::move(b), [ Self = actor_id(this), from, to, mode ](td::Result<td::BufferSlice> res) {
+    if (res.is_error()) {
+      LOG(ERROR) << "cannot obtain block proof for " << ((mode & 1) ? to.to_str() : "last masterchain block")
+                 << " starting from " << from.to_str() << " from server : " << res.move_as_error().to_string();
+    } else {
+      td::actor::send_closure_later(Self, &TestNode::got_block_proof, from, to, mode, res.move_as_ok());
+    }
+  });
+}
+
+void TestNode::got_block_proof(ton::BlockIdExt from, ton::BlockIdExt to, int mode, td::BufferSlice pchain) {
+  LOG(INFO) << "got block proof from " << from.to_str() << " to "
+            << ((mode & 1) ? to.to_str() : "last masterchain block") << " with mode=" << mode << " (" << pchain.size()
+            << " bytes)";
+  auto r_f = ton::fetch_tl_object<ton::lite_api::liteServer_partialBlockProof>(std::move(pchain), true);
+  if (r_f.is_error()) {
+    LOG(ERROR) << "cannot deserialize liteServer.partialBlockProof: " << r_f.move_as_error();
+    return;
+  }
+  auto f = r_f.move_as_ok();
+  auto res = liteclient::deserialize_proof_chain(std::move(f));
+  if (res.is_error()) {
+    LOG(ERROR) << "cannot deserialize liteServer.partialBlockProof: " << res.move_as_error();
+    return;
+  }
+  auto chain = res.move_as_ok();
+  if (chain->from != from) {
+    LOG(ERROR) << "block proof chain starts from block " << chain->from.to_str() << ", not from requested block "
+               << from.to_str();
+    return;
+  }
+  auto err = chain->validate();
+  if (err.is_error()) {
+    LOG(ERROR) << "block proof chain is invalid: " << err;
+    return;
+  }
+  // TODO: if `from` was a trusted key block, then mark `to` as a trusted key block, and update the known value of latest trusted key block if `to` is newer
+  if (!chain->complete && (mode & 0x1000)) {
+    LOG(INFO) << "valid " << (chain->complete ? "" : "in") << "complete proof chain: last block is "
+              << chain->to.to_str() << ", last key block is "
+              << (chain->has_key_block ? chain->key_blkid.to_str() : "(undefined)");
+    get_block_proof(chain->to, to, mode | 0x2000);
+    return;
+  }
+  td::TerminalIO::out() << "valid " << (chain->complete ? "" : "in") << "complete proof chain: last block is "
+                        << chain->to.to_str() << ", last key block is "
+                        << (chain->has_key_block ? chain->key_blkid.to_str() : "(undefined)") << std::endl;
+  if (chain->has_key_block) {
+    register_blkid(chain->key_blkid);
+  }
+  register_blkid(chain->to);
+  auto now = static_cast<td::uint32>(td::Clocks::system());
+  if (!(mode & 1) || (chain->last_utime > now - 3600)) {
+    td::TerminalIO::out() << "last block in chain was generated at " << chain->last_utime << " ("
+                          << now - chain->last_utime << " seconds ago)\n";
+  }
+  show_new_blkids();
+}
+
+int main(int argc, char* argv[]) {
+  SET_VERBOSITY_LEVEL(verbosity_INFO);
+  td::set_default_failure_signal_handler();
+
+  td::actor::ActorOwn<TestNode> x;
+
+  td::OptionsParser p;
+  p.set_description("Test Lite Client for TON Blockchain");
+  p.add_option('h', "help", "prints_help", [&]() {
+    char b[10240];
+    td::StringBuilder sb(td::MutableSlice{b, 10000});
+    sb << p;
+    std::cout << sb.as_cslice().c_str();
+    std::exit(2);
+    return td::Status::OK();
+  });
+  p.add_option('C', "global-config", "file to read global config", [&](td::Slice fname) {
+    td::actor::send_closure(x, &TestNode::set_global_config, fname.str());
+    return td::Status::OK();
+  });
+  p.add_option('r', "disable-readline", "", [&]() {
+    td::actor::send_closure(x, &TestNode::set_readline_enabled, false);
+    return td::Status::OK();
+  });
+  p.add_option('R', "enable-readline", "", [&]() {
+    td::actor::send_closure(x, &TestNode::set_readline_enabled, true);
+    return td::Status::OK();
+  });
+  p.add_option('D', "db", "root for dbs", [&](td::Slice fname) {
+    td::actor::send_closure(x, &TestNode::set_db_root, fname.str());
+    return td::Status::OK();
+  });
+  p.add_option('v', "verbosity", "set verbosity level", [&](td::Slice arg) {
+    verbosity = td::to_integer<int>(arg);
+    SET_VERBOSITY_LEVEL(VERBOSITY_NAME(FATAL) + verbosity);
+    return (verbosity >= 0 && verbosity <= 9) ? td::Status::OK() : td::Status::Error("verbosity must be 0..9");
+  });
+  p.add_option('i', "idx", "set liteserver idx", [&](td::Slice arg) {
+    auto idx = td::to_integer<int>(arg);
+    td::actor::send_closure(x, &TestNode::set_liteserver_idx, idx);
+    return td::Status::OK();
+  });
+  p.add_option('a', "addr", "connect to ip:port", [&](td::Slice arg) {
+    td::IPAddress addr;
+    TRY_STATUS(addr.init_host_port(arg.str()));
+    td::actor::send_closure(x, &TestNode::set_remote_addr, addr);
+    return td::Status::OK();
+  });
+  p.add_option('c', "cmd", "schedule command", [&](td::Slice arg) {
+    td::actor::send_closure(x, &TestNode::add_cmd, td::BufferSlice{arg});
+    return td::Status::OK();
+  });
+  p.add_option('t', "timeout", "timeout in batch mode", [&](td::Slice arg) {
+    auto d = td::to_double(arg);
+    td::actor::send_closure(x, &TestNode::set_fail_timeout, td::Timestamp::in(d));
+    return td::Status::OK();
+  });
+  p.add_option('p', "pub", "remote public key", [&](td::Slice arg) {
+    td::actor::send_closure(x, &TestNode::set_public_key, td::BufferSlice{arg});
+    return td::Status::OK();
+  });
+  p.add_option('d', "daemonize", "set SIGHUP", [&]() {
+    td::set_signal_handler(td::SignalType::HangUp,
+                           [](int sig) {
+#if TD_DARWIN || TD_LINUX
+                             close(0);
+                             setsid();
+#endif
+                           })
+        .ensure();
+    return td::Status::OK();
+  });
+#if TD_DARWIN || TD_LINUX
+  p.add_option('l', "logname", "log to file", [&](td::Slice fname) {
+    auto FileLog = td::FileFd::open(td::CSlice(fname.str().c_str()),
+                                    td::FileFd::Flags::Create | td::FileFd::Flags::Append | td::FileFd::Flags::Write)
+                       .move_as_ok();
+
+    dup2(FileLog.get_native_fd().fd(), 1);
+    dup2(FileLog.get_native_fd().fd(), 2);
+    return td::Status::OK();
+  });
+#endif
+
+  vm::init_op_cp0();
+
+  td::actor::Scheduler scheduler({2});
+
+  scheduler.run_in_context([&] { x = td::actor::create_actor<TestNode>("testnode"); });
+
+  scheduler.run_in_context([&] { p.run(argc, argv).ensure(); });
+  scheduler.run_in_context([&] {
+    td::actor::send_closure(x, &TestNode::run);
+    x.release();
+  });
+  scheduler.run();
+
+  return 0;
+}
diff --git a/submodules/ton/tonlib-src/lite-client/lite-client.h b/submodules/ton/tonlib-src/lite-client/lite-client.h
new file mode 100644
index 0000000000..19fe481e13
--- /dev/null
+++ b/submodules/ton/tonlib-src/lite-client/lite-client.h
@@ -0,0 +1,255 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "adnl/adnl-ext-client.h"
+#include "tl-utils/tl-utils.hpp"
+#include "ton/ton-types.h"
+#include "terminal/terminal.h"
+#include "vm/cells.h"
+#include "vm/stack.hpp"
+#include "block/block.h"
+#include "td/utils/filesystem.h"
+
+using td::Ref;
+
+class TestNode : public td::actor::Actor {
+ private:
+  std::string global_config_ = "ton-global.config";
+  enum {
+    min_ls_version = 0x101,
+    min_ls_capabilities = 1
+  };  // server version >= 1.1, capabilities at least +1 = build proof chains
+  td::actor::ActorOwn<ton::adnl::AdnlExtClient> client_;
+  td::actor::ActorOwn<td::TerminalIO> io_;
+
+  bool readline_enabled_ = true;
+  bool server_ok_ = false;
+  td::int32 liteserver_idx_ = -1;
+
+  bool ready_ = false;
+  bool inited_ = false;
+  std::string db_root_;
+
+  int server_time_ = 0;
+  int server_time_got_at_ = 0;
+  int server_version_ = 0;
+  long long server_capabilities_ = 0;
+
+  ton::ZeroStateIdExt zstate_id_;
+  ton::BlockIdExt mc_last_id_;
+
+  ton::BlockIdExt last_block_id_, last_state_id_;
+  td::BufferSlice last_block_data_, last_state_data_;
+
+  std::string line_;
+  const char *parse_ptr_, *parse_end_;
+  td::Status error_;
+
+  td::IPAddress remote_addr_;
+  ton::PublicKey remote_public_key_;
+
+  std::vector<ton::BlockIdExt> known_blk_ids_;
+  std::size_t shown_blk_ids_ = 0;
+
+  td::Timestamp fail_timeout_;
+  td::uint32 running_queries_ = 0;
+  bool ex_mode_ = false;
+  std::vector<td::BufferSlice> ex_queries_;
+
+  std::unique_ptr<ton::adnl::AdnlExtClient::Callback> make_callback();
+
+  struct TransId {
+    ton::Bits256 acc_addr;
+    ton::LogicalTime trans_lt;
+    ton::Bits256 trans_hash;
+    TransId(const ton::Bits256& addr_, ton::LogicalTime lt_, const ton::Bits256& hash_)
+        : acc_addr(addr_), trans_lt(lt_), trans_hash(hash_) {
+    }
+  };
+
+  void run_init_queries();
+  bool get_server_time();
+  bool get_server_version(int mode = 0);
+  void got_server_version(td::Result<td::BufferSlice> res, int mode);
+  bool get_server_mc_block_id();
+  void got_server_mc_block_id(ton::BlockIdExt blkid, ton::ZeroStateIdExt zstateid, int created_at);
+  void got_server_mc_block_id_ext(ton::BlockIdExt blkid, ton::ZeroStateIdExt zstateid, int mode, int version,
+                                  long long capabilities, int last_utime, int server_now);
+  void set_server_version(td::int32 version, td::int64 capabilities);
+  void set_server_time(int server_utime);
+  bool request_block(ton::BlockIdExt blkid);
+  bool request_state(ton::BlockIdExt blkid);
+  void got_mc_block(ton::BlockIdExt blkid, td::BufferSlice data);
+  void got_mc_state(ton::BlockIdExt blkid, ton::RootHash root_hash, ton::FileHash file_hash, td::BufferSlice data);
+  td::Status send_ext_msg_from_filename(std::string filename);
+  td::Status save_db_file(ton::FileHash file_hash, td::BufferSlice data);
+  bool get_account_state(ton::WorkchainId workchain, ton::StdSmcAddress addr, ton::BlockIdExt ref_blkid,
+                         std::string filename = "", int mode = -1);
+  void got_account_state(ton::BlockIdExt ref_blk, ton::BlockIdExt blk, ton::BlockIdExt shard_blk,
+                         td::BufferSlice shard_proof, td::BufferSlice proof, td::BufferSlice state,
+                         ton::WorkchainId workchain, ton::StdSmcAddress addr, std::string filename, int mode);
+  bool parse_run_method(ton::WorkchainId workchain, ton::StdSmcAddress addr, ton::BlockIdExt ref_blkid,
+                        std::string method_name);
+  void run_smc_method(ton::BlockIdExt ref_blk, ton::BlockIdExt blk, ton::BlockIdExt shard_blk,
+                      td::BufferSlice shard_proof, td::BufferSlice proof, td::BufferSlice state,
+                      ton::WorkchainId workchain, ton::StdSmcAddress addr, std::string method,
+                      std::vector<vm::StackEntry> params);
+  bool get_all_shards(bool use_last = true, ton::BlockIdExt blkid = {});
+  void got_all_shards(ton::BlockIdExt blk, td::BufferSlice proof, td::BufferSlice data);
+  bool get_config_params(ton::BlockIdExt blkid, int mode = 0, std::string filename = "");
+  void got_config_params(ton::BlockIdExt blkid, td::BufferSlice state_proof, td::BufferSlice cfg_proof, int mode,
+                         std::string filename, std::vector<int> params);
+  bool get_block(ton::BlockIdExt blk, bool dump = false);
+  void got_block(ton::BlockIdExt blkid, td::BufferSlice data, bool dump);
+  bool get_state(ton::BlockIdExt blk, bool dump = false);
+  void got_state(ton::BlockIdExt blkid, ton::RootHash root_hash, ton::FileHash file_hash, td::BufferSlice data,
+                 bool dump);
+  bool get_block_header(ton::BlockIdExt blk, int mode);
+  bool lookup_block(ton::ShardIdFull shard, int mode, td::uint64 arg);
+  void got_block_header(ton::BlockIdExt blkid, td::BufferSlice data, int mode);
+  bool show_block_header(ton::BlockIdExt blkid, Ref<vm::Cell> root, int mode);
+  bool show_state_header(ton::BlockIdExt blkid, Ref<vm::Cell> root, int mode);
+  bool get_one_transaction(ton::BlockIdExt blkid, ton::WorkchainId workchain, ton::StdSmcAddress addr,
+                           ton::LogicalTime lt, bool dump = false);
+  void got_one_transaction(ton::BlockIdExt req_blkid, ton::BlockIdExt blkid, td::BufferSlice proof,
+                           td::BufferSlice transaction, ton::WorkchainId workchain, ton::StdSmcAddress addr,
+                           ton::LogicalTime trans_lt, bool dump);
+  bool get_last_transactions(ton::WorkchainId workchain, ton::StdSmcAddress addr, ton::LogicalTime lt,
+                             ton::Bits256 hash, unsigned count, bool dump);
+  void got_last_transactions(std::vector<ton::BlockIdExt> blkids, td::BufferSlice transactions_boc,
+                             ton::WorkchainId workchain, ton::StdSmcAddress addr, ton::LogicalTime lt,
+                             ton::Bits256 hash, unsigned count, bool dump);
+  bool get_block_transactions(ton::BlockIdExt blkid, int mode, unsigned count, ton::Bits256 acc_addr,
+                              ton::LogicalTime lt);
+  void got_block_transactions(ton::BlockIdExt blkid, int mode, unsigned req_count, bool incomplete,
+                              std::vector<TransId> trans, td::BufferSlice proof);
+  bool get_block_proof(ton::BlockIdExt from, ton::BlockIdExt to, int mode);
+  void got_block_proof(ton::BlockIdExt from, ton::BlockIdExt to, int mode, td::BufferSlice res);
+  bool do_parse_line();
+  bool show_help(std::string command);
+  std::string get_word(char delim = ' ');
+  bool get_word_to(std::string& str, char delim = ' ');
+  int skipspc();
+  std::string get_line_tail(bool remove_spaces = true) const;
+  bool eoln() const;
+  bool seekeoln();
+  bool set_error(td::Status error);
+  bool set_error(std::string err_msg);
+  void show_context() const;
+  bool parse_account_addr(ton::WorkchainId& wc, ton::StdSmcAddress& addr);
+  static int parse_hex_digit(int c);
+  static bool parse_hash(const char* str, ton::Bits256& hash);
+  static bool convert_uint64(std::string word, td::uint64& val);
+  static bool convert_int64(std::string word, td::int64& val);
+  static bool convert_uint32(std::string word, td::uint32& val);
+  static bool convert_int32(std::string word, td::int32& val);
+  static bool convert_shard_id(std::string str, ton::ShardIdFull& shard);
+  bool parse_hash(ton::Bits256& hash);
+  bool parse_lt(ton::LogicalTime& lt);
+  bool parse_uint32(td::uint32& val);
+  bool parse_shard_id(ton::ShardIdFull& shard);
+  bool parse_block_id_ext(ton::BlockIdExt& blkid, bool allow_incomplete = false);
+  bool parse_block_id_ext(std::string blk_id_string, ton::BlockIdExt& blkid, bool allow_incomplete = false) const;
+  bool parse_stack_value(td::Slice str, vm::StackEntry& value);
+  bool parse_stack_value(vm::StackEntry& value);
+  bool register_blkid(const ton::BlockIdExt& blkid);
+  bool show_new_blkids(bool all = false);
+  bool complete_blkid(ton::BlockId partial_blkid, ton::BlockIdExt& complete_blkid) const;
+
+ public:
+  void conn_ready() {
+    LOG(ERROR) << "conn ready";
+    ready_ = true;
+    if (!inited_) {
+      run_init_queries();
+    }
+  }
+  void conn_closed() {
+    ready_ = false;
+  }
+  void set_global_config(std::string str) {
+    global_config_ = str;
+  }
+  void set_db_root(std::string db_root) {
+    db_root_ = db_root;
+  }
+  void set_readline_enabled(bool value) {
+    readline_enabled_ = value;
+  }
+  void set_liteserver_idx(td::int32 idx) {
+    liteserver_idx_ = idx;
+  }
+  void set_remote_addr(td::IPAddress addr) {
+    remote_addr_ = addr;
+  }
+  void set_public_key(td::BufferSlice file_name) {
+    auto R = [&]() -> td::Result<ton::PublicKey> {
+      TRY_RESULT_PREFIX(conf_data, td::read_file(file_name.as_slice().str()), "failed to read: ");
+      return ton::PublicKey::import(conf_data.as_slice());
+    }();
+
+    if (R.is_error()) {
+      LOG(FATAL) << "bad server public key: " << R.move_as_error();
+    }
+    remote_public_key_ = R.move_as_ok();
+  }
+  void set_fail_timeout(td::Timestamp ts) {
+    fail_timeout_ = ts;
+    alarm_timestamp().relax(fail_timeout_);
+  }
+  void add_cmd(td::BufferSlice data) {
+    ex_mode_ = true;
+    ex_queries_.push_back(std::move(data));
+    readline_enabled_ = false;
+  }
+  void alarm() override {
+    if (fail_timeout_.is_in_past()) {
+      std::_Exit(7);
+    }
+    if (ex_mode_ && !running_queries_ && ex_queries_.size() == 0) {
+      std::_Exit(0);
+    }
+    alarm_timestamp().relax(fail_timeout_);
+  }
+
+  void start_up() override {
+  }
+  void tear_down() override {
+    // FIXME: do not work in windows
+    //td::actor::SchedulerContext::get()->stop();
+  }
+
+  void got_result();
+  bool envelope_send_query(td::BufferSlice query, td::Promise<td::BufferSlice> promise);
+  void parse_line(td::BufferSlice data);
+
+  TestNode() {
+  }
+
+  void run();
+};
diff --git a/submodules/ton/tonlib-src/memprof/CMakeLists.txt b/submodules/ton/tonlib-src/memprof/CMakeLists.txt
new file mode 100644
index 0000000000..8559c4d9ca
--- /dev/null
+++ b/submodules/ton/tonlib-src/memprof/CMakeLists.txt
@@ -0,0 +1,22 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+set(MEMPROF_SOURCE
+  memprof/memprof.cpp
+  memprof/memprof.h
+)
+
+# memprof - simple library for memory usage profiling
+add_library(memprof STATIC ${MEMPROF_SOURCE})
+target_include_directories(memprof PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+target_link_libraries(memprof PRIVATE tdutils)
+if (MEMPROF)
+  target_compile_definitions(memprof PRIVATE -DUSE_MEMPROF=1)
+  if (MEMPROF STREQUAL "SAFE")
+    target_compile_definitions(memprof PRIVATE -DUSE_MEMPROF_SAFE=1)
+  elseif (MEMPROF STREQUAL "FAST")
+    target_compile_definitions(memprof PRIVATE -DUSE_MEMPROF_FAST=1)
+  elseif (NOT MEMPROF)
+    message(FATAL_ERROR "Unsupported MEMPROF value \"${MEMPROF}\"")
+  endif()
+endif()
+
diff --git a/submodules/ton/tonlib-src/memprof/memprof/memprof.cpp b/submodules/ton/tonlib-src/memprof/memprof/memprof.cpp
new file mode 100644
index 0000000000..b1b7dc445c
--- /dev/null
+++ b/submodules/ton/tonlib-src/memprof/memprof/memprof.cpp
@@ -0,0 +1,370 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#undef NDEBUG
+#include "memprof/memprof.h"
+
+#include "td/utils/port/platform.h"
+
+#if (TD_DARWIN || TD_LINUX) && defined(USE_MEMPROF)
+#include <algorithm>
+#include <atomic>
+#include <cassert>
+#include <cstddef>
+#include <cstdint>
+#include <cstdlib>
+#include <cstring>
+#include <functional>
+#include <new>
+#include <utility>
+#include <vector>
+
+#include <dlfcn.h>
+#include <execinfo.h>
+
+bool is_memprof_on() {
+  return true;
+}
+
+#if USE_MEMPROF_SAFE
+double get_fast_backtrace_success_rate() {
+  return 0;
+}
+#else
+
+#if TD_LINUX
+extern void *__libc_stack_end;
+#endif
+
+static void *get_bp() {
+  void *bp;
+#if defined(__i386__)
+  __asm__ volatile("movl %%ebp, %[r]" : [r] "=r"(bp));
+#elif defined(__x86_64__)
+  __asm__ volatile("movq %%rbp, %[r]" : [r] "=r"(bp));
+#endif
+  return bp;
+}
+
+static int fast_backtrace(void **buffer, int size) {
+  struct stack_frame {
+    stack_frame *bp;
+    void *ip;
+  };
+
+  stack_frame *bp = reinterpret_cast<stack_frame *>(get_bp());
+  int i = 0;
+  while (i < size &&
+#if TD_LINUX
+         static_cast<void *>(bp) <= __libc_stack_end &&
+#endif
+         !(reinterpret_cast<std::uintptr_t>(static_cast<void *>(bp)) & (sizeof(void *) - 1))) {
+    void *ip = bp->ip;
+    buffer[i++] = ip;
+    stack_frame *p = bp->bp;
+    if (p <= bp) {
+      break;
+    }
+    bp = p;
+  }
+  return i;
+}
+
+static std::atomic<std::size_t> fast_backtrace_failed_cnt;
+static std::atomic<std::size_t> backtrace_total_cnt;
+double get_fast_backtrace_success_rate() {
+  return 1 - static_cast<double>(fast_backtrace_failed_cnt.load(std::memory_order_relaxed)) /
+                 static_cast<double>(std::max(std::size_t(1), backtrace_total_cnt.load(std::memory_order_relaxed)));
+}
+
+#endif
+
+static Backtrace get_backtrace() {
+  static __thread bool in_backtrace;  // static zero-initialized
+  Backtrace res{{nullptr}};
+  if (in_backtrace) {
+    return res;
+  }
+  in_backtrace = true;
+  std::array<void *, res.size() + BACKTRACE_SHIFT + 10> tmp{{nullptr}};
+  std::size_t n;
+#if USE_MEMPROF_SAFE
+  n = backtrace(tmp.data(), static_cast<int>(tmp.size()));
+#else
+  n = fast_backtrace(tmp.data(), static_cast<int>(tmp.size()));
+  auto from_shared = [](void *ptr) {
+    return reinterpret_cast<std::uintptr_t>(ptr) > static_cast<std::uintptr_t>(0x700000000000ull);
+  };
+
+#if !USE_MEMPROF_FAST
+  auto end = tmp.begin() + std::min(res.size() + BACKTRACE_SHIFT, n);
+  if (std::find_if(tmp.begin(), end, from_shared) != end) {
+    fast_backtrace_failed_cnt.fetch_add(1, std::memory_order_relaxed);
+    n = backtrace(tmp.data(), static_cast<int>(tmp.size()));
+  }
+  backtrace_total_cnt.fetch_add(1, std::memory_order_relaxed);
+#endif
+  n = std::remove_if(tmp.begin(), tmp.begin() + n, from_shared) - tmp.begin();
+#endif
+  n = std::min(res.size() + BACKTRACE_SHIFT, n);
+
+  for (std::size_t i = BACKTRACE_SHIFT; i < n; i++) {
+    res[i - BACKTRACE_SHIFT] = tmp[i];
+  }
+  in_backtrace = false;
+  return res;
+}
+
+static constexpr std::size_t reserved = 16;
+static constexpr std::int32_t malloc_info_magic = 0x27138373;
+struct malloc_info {
+  std::int32_t magic;
+  std::uint32_t size;
+  std::int32_t offset;
+  std::int32_t ht_pos;
+};
+
+static std::uint64_t get_hash(const Backtrace &bt) {
+  std::uint64_t h = 7;
+  for (std::size_t i = 0; i < bt.size() && i < BACKTRACE_HASHED_LENGTH; i++) {
+    h = h * 0x4372897893428797lu + reinterpret_cast<std::uintptr_t>(bt[i]);
+  }
+  return h;
+}
+
+struct HashtableNode {
+  std::atomic<std::uint64_t> hash;
+  Backtrace backtrace;
+  std::atomic<std::size_t> size;
+};
+
+static constexpr std::size_t ht_max_size = 1000000;
+static std::atomic<std::size_t> ht_size{0};
+static std::array<HashtableNode, ht_max_size> ht;
+
+std::size_t get_ht_size() {
+  return ht_size.load();
+}
+
+std::int32_t get_ht_pos(const Backtrace &bt, bool force = false) {
+  auto hash = get_hash(bt);
+  std::int32_t pos = static_cast<std::int32_t>(hash % ht.size());
+  bool was_overflow = false;
+  while (true) {
+    auto pos_hash = ht[pos].hash.load();
+    if (pos_hash == 0) {
+      if (ht_size > ht_max_size / 2) {
+        if (force) {
+          assert(ht_size * 10 < ht_max_size * 7);
+        } else {
+          Backtrace unknown_bt{{nullptr}};
+          unknown_bt[0] = reinterpret_cast<void *>(1);
+          return get_ht_pos(unknown_bt, true);
+        }
+      }
+
+      std::uint64_t expected = 0;
+      if (ht[pos].hash.compare_exchange_strong(expected, hash)) {
+        ht[pos].backtrace = bt;
+        ++ht_size;
+        return pos;
+      }
+    } else if (pos_hash == hash) {
+      return pos;
+    } else {
+      pos++;
+      if (pos == static_cast<std::int32_t>(ht.size())) {
+        pos = 0;
+        if (was_overflow) {
+          // unreachable
+          std::abort();
+        }
+        was_overflow = true;
+      }
+    }
+  }
+}
+
+void dump_alloc(const std::function<void(const AllocInfo &)> &func) {
+  for (auto &node : ht) {
+    if (node.size == 0) {
+      continue;
+    }
+    func(AllocInfo{node.backtrace, node.size.load()});
+  }
+}
+
+void register_xalloc(malloc_info *info, std::int32_t diff) {
+  if (diff > 0) {
+    ht[info->ht_pos].size += info->size;
+  } else {
+    assert(ht[info->ht_pos].size >= info->size);
+    ht[info->ht_pos].size -= info->size;
+  }
+  assert(info->magic == malloc_info_magic);
+  assert(info->size < 1000000000000ull);
+  assert(ht[info->ht_pos].size < 1000000000000ull);
+}
+
+extern "C" {
+
+static void *malloc_with_frame(std::size_t size, const Backtrace &frame, std::size_t aligment = 0) {
+  static_assert(reserved % alignof(std::max_align_t) == 0, "fail");
+  static_assert(reserved >= sizeof(malloc_info), "fail");
+#if TD_DARWIN
+  static void *malloc_void = dlsym(RTLD_NEXT, "malloc");
+  static auto malloc_old = *reinterpret_cast<decltype(malloc) **>(&malloc_void);
+#else
+  extern decltype(malloc) __libc_malloc;
+  static auto malloc_old = __libc_malloc;
+#endif
+  if (aligment < alignof(std::max_align_t)) {
+    aligment = 0;
+  }
+  assert(aligment % alignof(std::max_align_t) == 0);
+  std::size_t extra = aligment == 0 ? 0 : aligment - alignof(std::max_align_t);
+  auto *ptr = malloc_old(size + reserved + extra);
+  std::int32_t offset = 0;
+  if (aligment != 0) {
+    // (ptr + reserved + offset) % aligment == 0
+    offset =
+        static_cast<std::int32_t>((aligment - (reinterpret_cast<std::size_t>(ptr) + reserved) % aligment) % aligment);
+    assert(offset % alignof(std::max_align_t) == 0);
+    assert(static_cast<std::size_t>(offset) <= extra);
+    ptr = static_cast<void *>(static_cast<char *>(ptr) + offset);
+  }
+  auto *info = static_cast<malloc_info *>(ptr);
+  auto *buf = reinterpret_cast<char *>(info);
+
+  info->magic = malloc_info_magic;
+  info->size = static_cast<std::uint32_t>(size);
+  assert(info->size == size);
+  info->offset = offset;
+  info->ht_pos = get_ht_pos(frame);
+
+  register_xalloc(info, +1);
+
+  void *data = buf + reserved;
+
+  if (aligment != 0) {
+    assert(reinterpret_cast<std::size_t>(data) % aligment == 0);
+  }
+
+  return data;
+}
+
+static malloc_info *get_info(void *data_void) {
+  char *data = static_cast<char *>(data_void);
+  auto *buf = data - reserved;
+
+  auto *info = reinterpret_cast<malloc_info *>(buf);
+  assert(info->magic == malloc_info_magic);
+  return info;
+}
+
+void *malloc(std::size_t size) {
+  return malloc_with_frame(size, get_backtrace());
+}
+
+void free(void *data_void) {
+  if (data_void == nullptr) {
+    return;
+  }
+  auto *info = get_info(data_void);
+  register_xalloc(info, -1);
+  auto ptr = static_cast<char *>(static_cast<void *>(info));
+  info->magic = 0;
+  ptr -= info->offset;
+
+#if TD_DARWIN
+  static void *free_void = dlsym(RTLD_NEXT, "free");
+  static auto free_old = *reinterpret_cast<decltype(free) **>(&free_void);
+#else
+  extern decltype(free) __libc_free;
+  static auto free_old = __libc_free;
+#endif
+  return free_old(ptr);
+}
+void *calloc(std::size_t size_a, std::size_t size_b) {
+  auto size = size_a * size_b;
+  void *res = malloc_with_frame(size, get_backtrace());
+  std::memset(res, 0, size);
+  return res;
+}
+void *realloc(void *ptr, std::size_t size) {
+  if (ptr == nullptr) {
+    return malloc_with_frame(size, get_backtrace());
+  }
+  auto *info = get_info(ptr);
+  auto *new_ptr = malloc_with_frame(size, get_backtrace());
+  auto to_copy = std::min(static_cast<std::uint32_t>(size), info->size);
+  std::memcpy(new_ptr, ptr, to_copy);
+  free(ptr);
+  return new_ptr;
+}
+int posix_memalign(void **res, std::size_t aligment, std::size_t size) {
+  *res = malloc_with_frame(size, get_backtrace(), aligment);
+  return 0;
+}
+void *memalign(std::size_t aligment, std::size_t size) {
+  return malloc_with_frame(size, get_backtrace(), aligment);
+}
+std::size_t malloc_usable_size(void *ptr) {
+  if (ptr == nullptr) {
+    return 0;
+  }
+  auto *info = get_info(ptr);
+  return info->size + info->offset + reserved;
+}
+}
+
+// c++14 guarantees that it is enough to override these two operators.
+void *operator new(std::size_t count) {
+  return malloc_with_frame(count, get_backtrace());
+}
+void operator delete(void *ptr) noexcept(true) {
+  free(ptr);
+}
+// because of gcc warning: the program should also define 'void operator delete(void*, std::size_t)'
+void operator delete(void *ptr, std::size_t) noexcept(true) {
+  free(ptr);
+}
+
+// c++17
+// void *operator new(std::size_t count, std::align_val_t al);
+// void operator delete(void *ptr, std::align_val_t al);
+
+#else
+bool is_memprof_on() {
+  return false;
+}
+void dump_alloc(const std::function<void(const AllocInfo &)> &func) {
+}
+double get_fast_backtrace_success_rate() {
+  return 0;
+}
+std::size_t get_ht_size() {
+  return 0;
+}
+#endif
+
+std::size_t get_used_memory_size() {
+  std::size_t res = 0;
+  dump_alloc([&](const auto info) { res += info.size; });
+  return res;
+}
diff --git a/submodules/ton/tonlib-src/memprof/memprof/memprof.h b/submodules/ton/tonlib-src/memprof/memprof/memprof.h
new file mode 100644
index 0000000000..3374dfed2b
--- /dev/null
+++ b/submodules/ton/tonlib-src/memprof/memprof/memprof.h
@@ -0,0 +1,39 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <array>
+#include <cstddef>
+#include <functional>
+
+constexpr std::size_t BACKTRACE_SHIFT = 2;
+constexpr std::size_t BACKTRACE_HASHED_LENGTH = 6;
+constexpr std::size_t BACKTRACE_LENGTH = 10;
+
+using Backtrace = std::array<void *, BACKTRACE_LENGTH>;
+struct AllocInfo {
+  Backtrace backtrace;
+  std::size_t size;
+};
+
+bool is_memprof_on();
+std::size_t get_ht_size();
+double get_fast_backtrace_success_rate();
+void dump_alloc(const std::function<void(const AllocInfo &)> &func);
+std::size_t get_used_memory_size();
diff --git a/submodules/ton/tonlib-src/tdactor/.gitrepo b/submodules/ton/tonlib-src/tdactor/.gitrepo
new file mode 100644
index 0000000000..c0249850a1
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/.gitrepo
@@ -0,0 +1,11 @@
+; DO NOT EDIT (unless you know what you are doing)
+;
+; This subdirectory is a git "subrepo", and this file is maintained by the
+; git-subrepo command. See https://github.com/git-commands/git-subrepo#readme
+;
+[subrepo]
+	remote = git@github.com:arseny30/tdactor.git
+	branch = master
+	commit = 023418469da909416b067660cc44bb4d9e9a4739
+	parent = da0d81f9227112f21b00dfcd060e19b44f12f1f8
+	cmdver = 0.3.1
diff --git a/submodules/ton/tonlib-src/tdactor/CMakeLists.txt b/submodules/ton/tonlib-src/tdactor/CMakeLists.txt
new file mode 100644
index 0000000000..3490eb1732
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/CMakeLists.txt
@@ -0,0 +1,62 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+#SOURCE SETS
+set(TDACTOR_SOURCE
+  td/actor/core/ActorExecutor.cpp
+  td/actor/core/CpuWorker.cpp
+  td/actor/core/IoWorker.cpp
+  td/actor/core/Scheduler.cpp
+
+  td/actor/MultiPromise.cpp
+
+  td/actor/actor.h
+  td/actor/ActorId.h
+  td/actor/ActorOwn.h
+  td/actor/ActorShared.h
+  td/actor/common.h
+  td/actor/PromiseFuture.h
+  td/actor/MultiPromise.h
+
+  td/actor/core/Actor.h
+  td/actor/core/ActorExecuteContext.h
+  td/actor/core/ActorExecutor.h
+  td/actor/core/ActorInfo.h
+  td/actor/core/ActorInfoCreator.h
+  td/actor/core/ActorLocker.h
+  td/actor/core/ActorMailbox.h
+  td/actor/core/ActorMessage.h
+  td/actor/core/ActorSignals.h
+  td/actor/core/ActorState.h
+  td/actor/core/CpuWorker.h
+  td/actor/core/Context.h
+  td/actor/core/IoWorker.h
+  td/actor/core/Scheduler.h
+  td/actor/core/SchedulerContext.h
+  td/actor/core/SchedulerId.h
+  td/actor/core/SchedulerMessage.h
+)
+
+set(TDACTOR_TEST_SOURCE
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/actors_promise.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/actors_core.cpp
+  PARENT_SCOPE
+)
+
+#RULES
+
+#LIBRARIES
+
+add_library(tdactor STATIC ${TDACTOR_SOURCE})
+target_include_directories(tdactor PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+target_link_libraries(tdactor PUBLIC tdutils)
+
+# BEGIN-INTERNAL
+add_subdirectory(benchmark)
+
+# END-INTERNAL
+install(TARGETS tdactor EXPORT TdTargets
+  LIBRARY DESTINATION lib
+  ARCHIVE DESTINATION lib
+  RUNTIME DESTINATION bin
+  INCLUDES DESTINATION include
+)
diff --git a/submodules/ton/tonlib-src/tdactor/benchmark/CMakeLists.txt b/submodules/ton/tonlib-src/tdactor/benchmark/CMakeLists.txt
new file mode 100644
index 0000000000..e01d33dc8b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/benchmark/CMakeLists.txt
@@ -0,0 +1,19 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+set(BENCHMARK_SOURCE
+  benchmark.cpp
+  third_party/mp-queue.c
+
+  third_party/FAAArrayQueue.h
+  third_party/LCRQueue.h
+  third_party/LazyIndexArrayQueue.h
+  third_party/MoodyCamelQueue.h
+)
+add_executable(benchmark ${BENCHMARK_SOURCE})
+target_include_directories(benchmark PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+target_link_libraries(benchmark PRIVATE tdactor)
+
+if (MSVC)
+  set_property(SOURCE benchmark.cpp APPEND_STRING PROPERTY COMPILE_FLAGS " /wd4457 /wd4316")
+endif()
+
diff --git a/submodules/ton/tonlib-src/tdactor/benchmark/benchmark.cpp b/submodules/ton/tonlib-src/tdactor/benchmark/benchmark.cpp
new file mode 100644
index 0000000000..09986294b5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/benchmark/benchmark.cpp
@@ -0,0 +1,1202 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "third_party/FAAArrayQueue.h"
+#include "third_party/HazardPointers.h"
+#include "third_party/LazyIndexArrayQueue.h"
+#include "third_party/MoodyCamelQueue.h"
+
+#if TG_LCR_QUEUE
+#include "third_party/LCRQueue.h"
+
+extern "C" {
+#include "third_party/mp-queue.h"
+}
+
+#include <linux/futex.h>
+#include <sys/syscall.h>
+#include <unistd.h>
+#endif
+
+#include "td/actor/core/ActorLocker.h"
+#include "td/actor/actor.h"
+
+#include "td/utils/benchmark.h"
+#include "td/utils/crypto.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/MpmcQueue.h"
+#include "td/utils/MpmcWaiter.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/queue.h"
+#include "td/utils/Random.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+#include "td/utils/UInt.h"
+
+#include <algorithm>
+#include <array>
+#include <atomic>
+#include <condition_variable>
+#include <functional>
+#include <mutex>
+#include <queue>
+#include <string>
+
+using td::int32;
+using td::uint32;
+
+// Concurrent SHA256 benchmark
+// Simplified ton Cell and Block structures
+struct CellRef {
+  int32 cell_id{0};
+  td::MutableSlice hash_slice;
+};
+struct Cell {
+  bool has_hash = false;
+  td::UInt256 hash;
+  td::MutableSlice data;
+  std::array<CellRef, 4> next{};
+};
+
+struct Block {
+  std::string data;
+  std::vector<Cell> cells;
+  Cell &get_cell(int32 id) {
+    return cells[id];
+  }
+  const Cell &get_cell(int32 id) const {
+    return cells[id];
+  }
+};
+
+class Generator {
+ public:
+  static std::string random_bytes(int length) {
+    std::string res(length, ' ');
+    for (auto &c : res) {
+      c = static_cast<char>(td::Random::fast_uint32() % 256);
+    }
+    return res;
+  }
+
+  static Block random_block(int cells_count) {
+    const size_t cell_size = 256;
+    Block block;
+    block.data = random_bytes(td::narrow_cast<int>(cell_size * cells_count));
+    block.cells.reserve(cells_count);
+    for (int i = 0; i < cells_count; i++) {
+      Cell cell;
+      cell.data = td::MutableSlice(block.data).substr(i * cell_size, cell_size);
+      for (int j = 0; j < 4; j++) {
+        cell.next[j] = [&] {
+          CellRef cell_ref;
+          if (i == 0) {
+            return cell_ref;
+          }
+          cell_ref.cell_id = td::Random::fast(0, i - 1);
+          cell_ref.hash_slice = cell.data.substr(cell_size - 128 + j * 32, 32);
+          return cell_ref;
+        }();
+      }
+      block.cells.push_back(std::move(cell));
+    }
+    return block;
+  }
+};
+
+class BlockSha256Baseline {
+ public:
+  static std::string get_description() {
+    return "Baseline";
+  }
+  static void calc_hash(Block &block) {
+    for (auto &cell : block.cells) {
+      td::sha256(cell.data, as_slice(cell.hash));
+    }
+  }
+  static td::Status check(Block &block) {
+    for (auto &cell : block.cells) {
+      for (auto &cell_ref : cell.next) {
+        if (cell_ref.hash_slice.empty()) {
+          continue;
+        }
+        if (cell_ref.hash_slice != as_slice(block.get_cell(cell_ref.cell_id).hash)) {
+          return td::Status::Error("Sha mismatch");
+        }
+      }
+    }
+    return td::Status::OK();
+  }
+  static void calc_refs(Block &block) {
+    for (auto &cell : block.cells) {
+      for (auto &cell_ref : cell.next) {
+        if (cell_ref.hash_slice.empty()) {
+          continue;
+        }
+        cell_ref.hash_slice.copy_from(as_slice(block.get_cell(cell_ref.cell_id).hash));
+      }
+      td::sha256(cell.data, as_slice(cell.hash));
+    }
+  }
+};
+
+class BlockSha256Threads {
+ public:
+  static std::string get_description() {
+    return "Threads";
+  }
+  template <class Iterator, class F>
+  static void parallel_map(Iterator begin, Iterator end, F &&f) {
+    size_t size = end - begin;
+    auto threads_count = std::max(td::thread::hardware_concurrency(), 1u) * 2;
+    auto thread_part_size = (size + threads_count - 1) / threads_count;
+    std::vector<td::thread> threads;
+    for (size_t i = 0; i < size; i += thread_part_size) {
+      auto part_begin = begin + i;
+      auto part_size = std::min(thread_part_size, size - i);
+      auto part_end = part_begin + part_size;
+      threads.push_back(td::thread([part_begin, part_end, &f] {
+        for (auto it = part_begin; it != part_end; it++) {
+          f(*it);
+        }
+      }));
+    }
+    for (auto &thread : threads) {
+      thread.join();
+    }
+  }
+  static void calc_hash(Block &block) {
+    parallel_map(block.cells.begin(), block.cells.end(),
+                 [](Cell &cell) { td::sha256(cell.data, as_slice(cell.hash)); });
+  }
+  static td::Status check_refs(Block &block) {
+    std::atomic<bool> mismatch{false};
+    parallel_map(block.cells.begin(), block.cells.end(), [&](Cell &cell) {
+      for (auto &cell_ref : cell.next) {
+        if (cell_ref.hash_slice.empty()) {
+          continue;
+        }
+        if (cell_ref.hash_slice != as_slice(block.get_cell(cell_ref.cell_id).hash)) {
+          mismatch = true;
+          break;
+        }
+      }
+    });
+    if (mismatch) {
+      return td::Status::Error("sha256 mismatch");
+    }
+    return td::Status::OK();
+  }
+};
+
+class InfBackoff {
+ private:
+  int cnt = 0;
+
+ public:
+  bool next() {
+    cnt++;
+    if (cnt < 50) {
+      return true;
+    } else {
+      td::this_thread::yield();
+      return true;
+    }
+  }
+};
+
+template <class Q>
+class BlockSha256MpmcQueue {
+ public:
+  static std::string get_description() {
+    return Q::get_description();
+  }
+  static void calc_hash(Block &block) {
+    std::vector<td::thread> threads;
+    auto threads_count = std::max(td::thread::hardware_concurrency(), 1u) * 2;
+    auto queue = std::make_unique<Q>(threads_count + 1);
+    for (size_t thread_id = 0; thread_id < threads_count; thread_id++) {
+      threads.push_back(td::thread([&, thread_id] {
+        while (true) {
+          auto f = queue->pop(thread_id);
+          if (!f) {
+            return;
+          }
+          f();
+        }
+      }));
+    }
+    for (auto &cell : block.cells) {
+      queue->push([&cell]() { td::sha256(cell.data, as_slice(cell.hash)); }, threads_count);
+    }
+    for (size_t thread_id = 0; thread_id < threads_count; thread_id++) {
+      queue->push(nullptr, threads_count);
+    }
+    for (auto &thread : threads) {
+      thread.join();
+    }
+  }
+};
+template <class Q>
+class BlockSha256MpmcQueueCellPtr {
+ public:
+  static std::string get_description() {
+    return "ptr " + Q::get_description();
+  }
+  static void calc_hash(Block &block) {
+    std::vector<td::thread> threads;
+    auto threads_count = std::max(td::thread::hardware_concurrency(), 1u) * 2;
+    auto queue = std::make_unique<Q>(threads_count + 1);
+    Cell poison;
+    for (size_t thread_id = 0; thread_id < threads_count; thread_id++) {
+      threads.push_back(td::thread([&, thread_id] {
+        while (true) {
+          auto cell = queue->pop(thread_id);
+          if (cell == &poison) {
+            return;
+          }
+          td::sha256(cell->data, as_slice(cell->hash));
+        }
+      }));
+    }
+    for (auto &cell : block.cells) {
+      queue->push(&cell, threads_count);
+    }
+    for (size_t thread_id = 0; thread_id < threads_count; thread_id++) {
+      queue->push(&poison, threads_count);
+    }
+    for (auto &thread : threads) {
+      thread.join();
+    }
+  }
+};
+std::atomic<int> flag;
+class ActorExecutorBenchmark : public td::Benchmark {
+  std::string get_description() const {
+    return "Executor Benchmark";
+  }
+
+  void run(int n) {
+    using namespace td::actor::core;
+    using namespace td::actor;
+    using td::actor::detail::ActorMessageCreator;
+    struct Dispatcher : public SchedulerDispatcher {
+      void add_to_queue(ActorInfoPtr ptr, SchedulerId scheduler_id, bool need_poll) override {
+        //queue.push_back(std::move(ptr));
+        q.push(ptr, 0);
+      }
+      void set_alarm_timestamp(const ActorInfoPtr &actor_info_ptr) override {
+        UNREACHABLE();
+      }
+      SchedulerId get_scheduler_id() const override {
+        return SchedulerId{0};
+      }
+      std::deque<ActorInfoPtr> queue;
+      td::MpmcQueue<ActorInfoPtr> q{1};
+    };
+    Dispatcher dispatcher;
+
+    class TestActor : public Actor {
+     public:
+      void close() {
+        stop();
+      }
+
+     private:
+      void start_up() override {
+        //LOG(ERROR) << "start up";
+      }
+      void tear_down() override {
+      }
+      void wake_up() override {
+        //LOG(ERROR) << "wake up";
+      }
+    };
+    ActorInfoCreator actor_info_creator;
+    auto actor = actor_info_creator.create(std::make_unique<TestActor>(),
+                                           ActorInfoCreator::Options().on_scheduler(SchedulerId{0}).with_name("A"));
+    auto actor2 = actor_info_creator.create(std::make_unique<TestActor>(),
+                                            ActorInfoCreator::Options().on_scheduler(SchedulerId{0}).with_name("B"));
+
+    {
+      ActorExecutor executor(*actor, dispatcher, ActorExecutor::Options().with_from_queue());
+      for (int i = 0; i < n; i++) {
+        //int old = i;
+        //flag.compare_exchange_strong(old, i + 1, std::memory_order_acquire, std::memory_order_relaxed);
+        ActorExecutor executor2(*actor2, dispatcher, ActorExecutor::Options());
+      }
+    }
+    for (int i = 0; i < 0; i++) {
+      {
+        ActorExecutor executor(*actor, dispatcher, ActorExecutor::Options().with_from_queue());
+        executor.send_immediate(
+            [&] {
+              ActorExecutor executor2(*actor2, dispatcher, ActorExecutor::Options());
+              executor2.send_immediate(
+                  [&] {
+                    ActorExecutor executor3(*actor, dispatcher, ActorExecutor::Options());
+                    executor3.send(td::actor::core::ActorSignals::one(td::actor::core::ActorSignals::Wakeup));
+                  },
+                  0);
+            },
+            0);
+      }
+      dispatcher.q.pop(0);
+    }
+
+    //{
+    //ActorExecutor executor(*actor, dispatcher, ActorExecutor::Options());
+    //executor.send(
+    //ActorMessageCreator::lambda([&] { static_cast<TestActor &>(ActorExecuteContext::get()->actor()).close(); }));
+    //}
+    dispatcher.queue.clear();
+  }
+};
+namespace actor_signal_query_test {
+using namespace td::actor;
+class Master;
+class Worker : public td::actor::Actor {
+ public:
+  Worker(std::shared_ptr<td::Destructor> watcher, ActorId<Master> master)
+      : watcher_(std::move(watcher)), master_(std::move(master)) {
+  }
+  void wake_up() override;
+
+ private:
+  std::shared_ptr<td::Destructor> watcher_;
+  ActorId<Master> master_;
+};
+class Master : public td::actor::Actor {
+ public:
+  Master(std::shared_ptr<td::Destructor> watcher, int n) : watcher_(std::move(watcher)), n_(n) {
+  }
+
+  void start_up() override {
+    worker_ = create_actor<Worker>(ActorOptions().with_name("Worker"), watcher_, actor_id(this));
+    send_signals(worker_, ActorSignals::wakeup());
+  }
+
+  void wake_up() override {
+    n_--;
+    if (n_ <= 0) {
+      return stop();
+    }
+    send_signals(worker_, ActorSignals::wakeup());
+  }
+
+ private:
+  std::shared_ptr<td::Destructor> watcher_;
+  ActorOwn<Worker> worker_;
+  int n_;
+};
+void Worker::wake_up() {
+  send_signals(master_, ActorSignals::wakeup());
+}
+}  // namespace actor_signal_query_test
+class ActorSignalQuery : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "ActorSignalQuery";
+  }
+  void run(int n) override {
+    using namespace actor_signal_query_test;
+    size_t threads_count = 1;
+    Scheduler scheduler{{threads_count}};
+
+    scheduler.run_in_context([&] {
+      auto watcher = td::create_shared_destructor([] { td::actor::SchedulerContext::get()->stop(); });
+
+      create_actor<Master>(ActorOptions().with_name(PSLICE() << "Master"), watcher, n).release();
+    });
+    scheduler.run();
+  }
+};
+
+namespace actor_query_test {
+using namespace td::actor;
+class Master;
+class Worker : public td::actor::Actor {
+ public:
+  Worker(std::shared_ptr<td::Destructor> watcher) : watcher_(std::move(watcher)) {
+  }
+  void query(int x, ActorId<Master> master);
+
+ private:
+  std::shared_ptr<td::Destructor> watcher_;
+};
+class Master : public td::actor::Actor {
+ public:
+  Master(std::shared_ptr<td::Destructor> watcher, int n) : watcher_(std::move(watcher)), n_(n) {
+  }
+
+  void start_up() override {
+    worker_ = create_actor<Worker>(ActorOptions().with_name("Worker"), watcher_);
+    send_closure(worker_, &Worker::query, n_, actor_id(this));
+  }
+
+  void answer(int x, int y) {
+    if (x == 0) {
+      return stop();
+    }
+    send_closure(worker_, &Worker::query, x - 1, actor_id(this));
+  }
+
+ private:
+  std::shared_ptr<td::Destructor> watcher_;
+  ActorOwn<Worker> worker_;
+  int n_;
+};
+void Worker::query(int x, ActorId<Master> master) {
+  send_closure(master, &Master::answer, x, x + x);
+}
+}  // namespace actor_query_test
+class ActorQuery : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "ActorQuery";
+  }
+  void run(int n) override {
+    using namespace actor_query_test;
+    size_t threads_count = 1;
+    Scheduler scheduler({threads_count});
+
+    scheduler.run_in_context([&] {
+      auto watcher = td::create_shared_destructor([] { td::actor::SchedulerContext::get()->stop(); });
+
+      create_actor<Master>(ActorOptions().with_name(PSLICE() << "Master"), watcher, n).release();
+    });
+    scheduler.run();
+  }
+};
+
+namespace actor_dummy_query_test {
+using namespace td::actor;
+class Master;
+class Worker : public td::actor::Actor {
+ public:
+  Worker(std::shared_ptr<td::Destructor> watcher) : watcher_(std::move(watcher)) {
+  }
+  void query(int x, int *y) {
+    *y = x + x;
+  }
+  void start_up() override {
+  }
+
+ private:
+  std::shared_ptr<td::Destructor> watcher_;
+};
+class Master : public td::actor::Actor {
+ public:
+  Master(std::shared_ptr<td::Destructor> watcher, int n) : watcher_(std::move(watcher)), n_(n) {
+  }
+
+  void start_up() override {
+    worker_ = create_actor<Worker>(ActorOptions().with_name("Worker"), watcher_);
+    int res;
+    for (int i = 0; i < n_; i++) {
+      send_closure(worker_, &Worker::query, i, &res);
+      CHECK(res == i + i);
+    }
+    stop();
+  }
+
+ private:
+  std::shared_ptr<td::Destructor> watcher_;
+  ActorOwn<Worker> worker_;
+  int n_;
+};
+}  // namespace actor_dummy_query_test
+class ActorDummyQuery : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "ActorDummyQuery";
+  }
+  void run(int n) override {
+    using namespace actor_dummy_query_test;
+    size_t threads_count = 1;
+    Scheduler scheduler({threads_count});
+
+    scheduler.run_in_context([&] {
+      auto watcher = td::create_shared_destructor([] { td::actor::SchedulerContext::get()->stop(); });
+
+      create_actor<Master>(ActorOptions().with_name(PSLICE() << "Master"), watcher, n).release();
+    });
+
+    scheduler.run();
+  }
+};
+
+namespace actor_task_query_test {
+using namespace td::actor;
+class Master;
+class Worker : public td::actor::Actor {
+ public:
+  Worker(int x, ActorId<Master> master) : x_(x), master_(std::move(master)) {
+  }
+  void start_up() override;
+
+ private:
+  int x_;
+  ActorId<Master> master_;
+};
+class Master : public td::actor::Actor {
+ public:
+  Master(std::shared_ptr<td::Destructor> watcher, int n) : watcher_(std::move(watcher)), n_(n) {
+  }
+
+  void start_up() override {
+    create_actor<Worker>(ActorOptions().with_name("Worker"), n_, actor_id(this)).release();
+  }
+
+  void answer(int x, int y) {
+    if (x == 0) {
+      return stop();
+    }
+    create_actor<Worker>(ActorOptions().with_name("Worker"), x - 1, actor_id(this)).release();
+  }
+
+ private:
+  std::shared_ptr<td::Destructor> watcher_;
+  ActorOwn<Worker> worker_;
+  int n_;
+};
+void Worker::start_up() {
+  send_closure(master_, &Master::answer, x_, x_ + x_);
+  stop();
+}
+}  // namespace actor_task_query_test
+class ActorTaskQuery : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "ActorTaskQuery";
+  }
+  void run(int n) override {
+    using namespace actor_task_query_test;
+    size_t threads_count = 1;
+    Scheduler scheduler({threads_count});
+
+    scheduler.run_in_context([&] {
+      auto watcher = td::create_shared_destructor([] { td::actor::SchedulerContext::get()->stop(); });
+
+      create_actor<Master>(ActorOptions().with_name(PSLICE() << "Master"), watcher, n).release();
+    });
+    scheduler.run();
+  }
+};
+class BlockSha256Actors {
+ public:
+  static std::string get_description() {
+    return "Actors";
+  }
+  template <class Iterator, class F>
+  static void parallel_map(Iterator begin, Iterator end, F &&f) {
+    auto threads_count = std::max(td::thread::hardware_concurrency(), 1u) * 2;
+    using namespace td::actor;
+    Scheduler scheduler({threads_count});
+
+    scheduler.run_in_context([&] {
+      auto watcher = td::create_shared_destructor([] { td::actor::SchedulerContext::get()->stop(); });
+      class Worker : public td::actor::Actor {
+       public:
+        Worker(std::shared_ptr<td::Destructor> watcher, td::Promise<> promise)
+            : watcher_(std::move(watcher)), promise_(std::move(promise)) {
+        }
+        void start_up() override {
+          promise_.set_value(td::Unit());
+          stop();
+        }
+
+       private:
+        std::shared_ptr<td::Destructor> watcher_;
+        td::Promise<> promise_;
+      };
+
+      for (auto it = begin; it != end; it++) {
+        create_actor<Worker>(ActorOptions().with_name(PSLICE() << "Worker#"), watcher,
+                             td::Promise<>([&, it](td::Unit) { f(*it); }))
+            .release();
+      }
+    });
+    scheduler.run();
+  }
+  static void calc_hash(Block &block) {
+    parallel_map(block.cells.begin(), block.cells.end(),
+                 [](Cell &cell) { td::sha256(cell.data, as_slice(cell.hash)); });
+  }
+};
+
+class ActorLockerBenchmark : public td::Benchmark {
+ public:
+  explicit ActorLockerBenchmark(int threads_n) : threads_n_(threads_n) {
+  }
+  std::string get_description() const override {
+    return PSTRING() << "ActorLockerBenchmark " << threads_n_;
+  }
+  void run(int n) override {
+    std::vector<td::thread> threads(threads_n_);
+    using namespace td::actor::core;
+    ActorState state;
+    std::atomic<int> ready{0};
+    for (auto &thread : threads) {
+      thread = td::thread([&] {
+        ActorLocker locker(&state);
+        ready++;
+        while (ready != threads_n_) {
+          td::this_thread::yield();
+        }
+        for (int i = 0; i < n / threads_n_; i++) {
+          if (locker.add_signals(ActorSignals::one(ActorSignals::Kill))) {
+            while (!locker.try_unlock(ActorState::Flags{})) {
+            }
+          }
+        }
+      });
+    }
+    for (auto &thread : threads) {
+      thread.join();
+    }
+  }
+
+ private:
+  int threads_n_;
+};
+
+template <class Impl>
+class CalcHashSha256Benchmark : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "CheckSha256: " + impl_.get_description();
+  }
+  void start_up_n(int n) override {
+    block_ = Generator::random_block(n);
+  }
+
+  void run(int n) override {
+    Impl::calc_hash(block_);
+  }
+
+ private:
+  Impl impl_;
+  Block block_;
+};
+
+/*
+template <class T>
+class MpmcQueueInterface {
+ public:
+  explicit MpmcQueueInterface(size_t thread_n);
+  static std::string get_description();
+  void push(T value, size_t thread_id);
+  T pop(size_t thread_id);
+  bool try_pop(T &value, size_t thread_id);
+};
+*/
+
+// Simple bounded mpmc queue
+template <class ValueT>
+class BoundedMpmcQueue {
+ public:
+  explicit BoundedMpmcQueue(size_t threads_n) : data_(1 << 20) {
+  }
+  static std::string get_description() {
+    return "BoundedMpmc queue";
+  }
+  void push(ValueT value, size_t = 0) {
+    auto pos = write_pos_.fetch_add(1, std::memory_order_relaxed);
+    auto generation = pos / data_.size() * 2 + 0;
+    auto &element = data_[pos % data_.size()];
+
+    InfBackoff backoff;
+    while (element.generation.load(std::memory_order_acquire) != generation) {
+      backoff.next();
+    }
+    element.value = std::move(value);
+    element.generation.fetch_add(1, std::memory_order_release);
+  }
+
+  ValueT pop(size_t = 0) {
+    auto pos = read_pos_.fetch_add(1, std::memory_order_relaxed);
+    auto generation = pos / data_.size() * 2 + 1;
+    auto &element = data_[pos % data_.size()];
+
+    InfBackoff backoff;
+    while (element.generation.load(std::memory_order_acquire) != generation) {
+      backoff.next();
+    }
+    auto result = std::move(element.value);
+    element.generation.fetch_add(1, std::memory_order_release);
+    return result;
+  }
+  bool try_pop(ValueT &value, size_t = 0) {
+    auto pos = read_pos_.load(std::memory_order_relaxed);
+    auto generation = pos / data_.size() * 2 + 1;
+    auto &element = data_[pos % data_.size()];
+
+    if (element.generation.load(std::memory_order_acquire) != generation) {
+      return false;
+    }
+    if (!read_pos_.compare_exchange_strong(pos, pos + 1, std::memory_order_acq_rel)) {
+      return false;
+    }
+    value = std::move(element.value);
+    element.generation.fetch_add(1, std::memory_order_release);
+    return true;
+  }
+
+ private:
+  std::atomic<td::uint64> write_pos_{0};
+  char pad[128];
+  std::atomic<td::uint64> read_pos_{0};
+  char pad2[128];
+  struct Element {
+    std::atomic<td::uint32> generation{0};
+    ValueT value;
+    //char pad2[128];
+  };
+  std::vector<Element> data_;
+  char pad3[128];
+};
+
+template <class Impl>
+class MpmcQueueBenchmark : public td::Benchmark {
+ public:
+  MpmcQueueBenchmark(int n, int m) : n_(n), m_(m) {
+  }
+  std::string get_description() const override {
+    return PSTRING() << "MpmcQueueBenchmark " << n_ << " " << m_ << " " << Impl::get_description();
+  }
+
+  void run(int n) override {
+    std::vector<td::thread> n_threads(n_);
+    std::vector<td::thread> m_threads(m_);
+    auto impl = std::make_unique<Impl>(n_ + m_ + 1);
+    size_t thread_id = 0;
+    for (auto &thread : m_threads) {
+      thread = td::thread([&, thread_id] {
+        while (true) {
+          size_t value = impl->pop(thread_id);
+          if (!value) {
+            break;
+          }
+        }
+      });
+      thread_id++;
+    }
+    for (auto &thread : n_threads) {
+      thread = td::thread([&, thread_id] {
+        for (int i = 0; i < n / n_; i++) {
+          impl->push(static_cast<size_t>(i + 1), thread_id);
+        }
+      });
+      thread_id++;
+    }
+    for (auto &thread : n_threads) {
+      thread.join();
+    }
+    for (int i = 0; i < m_; i++) {
+      impl->push(0, thread_id);
+    }
+    for (auto &thread : m_threads) {
+      thread.join();
+    }
+    impl.reset();
+  }
+
+ private:
+  int n_;
+  int m_;
+};
+
+class Cheat {
+ public:
+  explicit Cheat(size_t thread_n) : impl_(static_cast<int>(thread_n)) {
+  }
+  static std::string get_description() {
+    return "td::MpmcQueue (cheat)";
+  }
+  void push(size_t value, size_t thread_id) {
+    impl_.push(reinterpret_cast<size_t *>(value + 1), static_cast<int>(thread_id));
+  }
+  size_t pop(size_t thread_id) {
+    auto res = impl_.pop(thread_id);
+    return reinterpret_cast<size_t>(res) - 1;
+  }
+  bool try_pop(size_t &value, size_t thread_id) {
+    size_t *was;
+    if (impl_.try_pop(was, thread_id)) {
+      value = reinterpret_cast<size_t>(was) - 1;
+      return true;
+    }
+    return false;
+  }
+
+ private:
+  td::MpmcQueue<size_t *> impl_;
+};
+
+using ConcurrencyFreaks::FAAArrayQueue;
+using ConcurrencyFreaks::LazyIndexArrayQueue;
+#if TG_LCR_QUEUE
+using ConcurrencyFreaks::LCRQueue;
+#endif
+
+template <class Impl>
+class CfQueue {
+ public:
+  explicit CfQueue(size_t thread_n) : impl_(static_cast<int>(thread_n)) {
+  }
+  static std::string get_description() {
+    return "TODO";
+  }
+  void push(size_t value, size_t thread_id) {
+    impl_.enqueue(reinterpret_cast<size_t *>(value + 1), static_cast<int>(thread_id));
+  }
+  size_t pop(size_t thread_id) {
+    size_t res;
+    while (!try_pop(res, thread_id)) {
+      td::this_thread::yield();
+    }
+    return res;
+  }
+  bool try_pop(size_t &value, size_t thread_id) {
+    auto ptr = impl_.dequeue(static_cast<int>(thread_id));
+    if (!ptr) {
+      return false;
+    }
+    value = reinterpret_cast<size_t>(ptr) - 1;
+    return true;
+  }
+
+ private:
+  Impl impl_;
+};
+
+#if TG_LCR_QUEUE
+template <>
+std::string CfQueue<LCRQueue<size_t>>::get_description() {
+  return "LCRQueue (cf)";
+}
+#endif
+template <>
+std::string CfQueue<LazyIndexArrayQueue<size_t>>::get_description() {
+  return "LazyIndexArrayQueue (cf)";
+}
+template <>
+std::string CfQueue<FAAArrayQueue<size_t>>::get_description() {
+  return "FAAArrayQueue (cf)";
+}
+template <class Impl, class T>
+class CfQueueT {
+ public:
+  explicit CfQueueT(size_t thread_n) : impl_(static_cast<int>(thread_n)) {
+  }
+  static std::string get_description() {
+    return "TODO";
+  }
+  void push(T *value, size_t thread_id) {
+    impl_.enqueue(value, static_cast<int>(thread_id));
+  }
+  T *pop(size_t thread_id) {
+    td::detail::Backoff backoff;
+    while (true) {
+      auto ptr = impl_.dequeue(static_cast<int>(thread_id));
+      if (!ptr) {
+        backoff.next();
+      } else {
+        return ptr;
+      }
+    }
+  }
+  bool try_pop(T *&value, size_t thread_id) {
+    value = impl_.dequeue(static_cast<int>(thread_id));
+    return value != nullptr;
+  }
+
+ private:
+  Impl impl_;
+};
+
+#if TG_LCR_QUEUE
+template <>
+std::string CfQueueT<LCRQueue<Cell>, Cell>::get_description() {
+  return "LCRQueue (cf)";
+}
+#endif
+template <>
+std::string CfQueueT<LazyIndexArrayQueue<Cell>, Cell>::get_description() {
+  return "LazyIndexArrayQueue (cf)";
+}
+template <>
+std::string CfQueueT<FAAArrayQueue<Cell>, Cell>::get_description() {
+  return "FAAArrayQueue (cf)";
+}
+
+template <class Value>
+class MoodyQueue {
+ public:
+  explicit MoodyQueue(size_t) {
+  }
+  static std::string get_description() {
+    return "moodycamel queue";
+  }
+  void push(Value v, size_t) {
+    q.enqueue(v);
+  }
+  Value pop(size_t) {
+    Value res;
+    while (!q.try_dequeue(res)) {
+    }
+    return res;
+  }
+  bool try_pop(Value &value, size_t) {
+    return q.try_dequeue(value);
+  }
+
+ private:
+  moodycamel::ConcurrentQueue<Value> q;
+};
+
+#if TG_LCR_QUEUE
+class MpQueue {
+ public:
+  explicit MpQueue(size_t) {
+    q_ = alloc_mp_queue();
+  }
+  ~MpQueue() {
+    free_mp_queue(q_);
+    clear_thread_ids();
+  }
+  void push(size_t value, size_t) {
+    mpq_push(q_, reinterpret_cast<void *>(value + 1), 0);
+  }
+  size_t pop(size_t) {
+    td::detail::Backoff backoff;
+    while (true) {
+      auto ptr = mpq_pop(q_, 0);
+      if (!ptr) {
+        backoff.next();
+      } else {
+        return reinterpret_cast<size_t>(ptr) - 1;
+      }
+    }
+  }
+  bool try_pop(size_t &value, size_t) {
+    auto ptr = mpq_pop(q_, 0);
+    if (!ptr) {
+      return false;
+    }
+    value = reinterpret_cast<size_t>(ptr) - 1;
+    return true;
+  }
+
+  static std::string get_description() {
+    return "mp-queue";
+  }
+
+ public:
+  struct mp_queue *q_;
+};
+
+class Semaphore {
+ public:
+  Semaphore() {
+    impl->value = 0;
+    impl->waiting = 0;
+  }
+  void wait() {
+    mp_sem_wait(impl.get());
+  }
+  void post() {
+    mp_sem_post(impl.get());
+  }
+  std::unique_ptr<mp_sem_t> impl = std::make_unique<mp_semaphore>();
+};
+
+template <class Q, class T>
+class SemQueue {
+ public:
+  static std::string get_description() {
+    return "Sem + " + Q::get_description();
+  }
+  explicit SemQueue(size_t threads_n) : impl(threads_n) {
+  }
+  T pop(size_t thread_id) {
+    T res;
+    td::detail::Backoff backoff;
+    while (!impl.try_pop(res, thread_id)) {
+      if (!backoff.next()) {
+        sem.wait();
+      }
+    }
+    return res;
+  }
+  void push(T value, size_t thread_id) {
+    impl.push(std::move(value), thread_id);
+    sem.post();
+  }
+
+ private:
+  Semaphore sem;
+  Q impl;
+};
+#endif
+
+template <class T>
+class StupidQueue {
+ public:
+  explicit StupidQueue(size_t) {
+  }
+  static std::string get_description() {
+    return "Mutex queue";
+  }
+  T pop(size_t) {
+    std::unique_lock<std::mutex> guard(mutex_);
+    cv_.wait(guard, [&] { return !queue_.empty(); });
+    auto front = queue_.front();
+    queue_.pop();
+    return front;
+  }
+  void push(T value, size_t) {
+    {
+      std::unique_lock<std::mutex> guard(mutex_);
+      queue_.push(std::move(value));
+    }
+    cv_.notify_one();
+  }
+  bool try_pop(T &value, size_t) {
+    std::lock_guard<std::mutex> guard(mutex_);
+    if (!queue_.empty()) {
+      value = std::move(queue_.front());
+      queue_.pop();
+      return true;
+    }
+    return false;
+  }
+
+ private:
+  std::mutex mutex_;
+  std::queue<T> queue_;
+  std::condition_variable cv_;
+};
+
+template <class Q, class W, class T>
+class WaitQueue {
+ public:
+  static std::string get_description() {
+    return "Wait + " + Q::get_description();
+  }
+  explicit WaitQueue(size_t threads_n) : impl(threads_n) {
+  }
+  T pop(size_t thread_id) {
+    T res;
+    int yields = 0;
+    while (!impl.try_pop(res, thread_id)) {
+      yields = waiter.wait(yields, static_cast<uint32>(thread_id));
+    }
+    waiter.stop_wait(yields, static_cast<uint32>(thread_id));
+    return res;
+  }
+  void push(T value, size_t thread_id) {
+    impl.push(std::move(value), static_cast<uint32>(thread_id));
+    waiter.notify();
+  }
+
+ private:
+  W waiter;
+  Q impl;
+};
+
+void run_queue_bench(int n, int m) {
+  bench(MpmcQueueBenchmark<WaitQueue<td::MpmcQueue<size_t>, td::MpmcWaiter, size_t>>(n, m), 2);
+  bench(MpmcQueueBenchmark<td::MpmcQueue<size_t>>(n, m), 2);
+  bench(MpmcQueueBenchmark<td::MpmcQueueOld<size_t>>(n, m), 2);
+  bench(MpmcQueueBenchmark<Cheat>(n, m), 2);
+  bench(MpmcQueueBenchmark<CfQueue<FAAArrayQueue<size_t>>>(n, m), 2);
+  bench(MpmcQueueBenchmark<CfQueue<LazyIndexArrayQueue<size_t>>>(n, m), 2);
+  bench(MpmcQueueBenchmark<StupidQueue<size_t>>(n, m), 2);
+  //bench(MpmcQueueBenchmark<MpQueue>(n, m), 2);
+#if TG_LCR_QUEUE
+  bench(MpmcQueueBenchmark<CfQueue<LCRQueue<size_t>>>(n, m), 2);
+#endif
+}
+
+int main(int argc, char **argv) {
+  if (argc > 1) {
+    if (argv[1][0] == 'a') {
+      bench_n(MpmcQueueBenchmark<td::MpmcQueue<size_t>>(1, 1), 1 << 26);
+      //bench_n(MpmcQueueBenchmark<MpQueue>(1, 40), 1 << 20);
+      //bench_n(MpmcQueueBenchmark<CfQueue<LCRQueue<size_t>>>(1, 40), 1 << 20);
+    } else {
+      bench_n(MpmcQueueBenchmark<td::MpmcQueueOld<size_t>>(1, 1), 1 << 26);
+      //bench_n(MpmcQueueBenchmark<CfQueue<LCRQueue<size_t>>>(1, 40), 1 << 20);
+      //bench_n(MpmcQueueBenchmark<CfQueue<FAAArrayQueue<size_t>>>(1, 1), 1 << 26);
+    }
+    return 0;
+  }
+
+  bench(ActorDummyQuery());
+  bench(ActorExecutorBenchmark());
+  bench(ActorSignalQuery());
+  bench(ActorQuery());
+  bench(ActorTaskQuery());
+  bench(CalcHashSha256Benchmark<BlockSha256Actors>());
+  bench(CalcHashSha256Benchmark<BlockSha256Threads>());
+  bench(CalcHashSha256Benchmark<BlockSha256Baseline>());
+  bench(ActorLockerBenchmark(1));
+  bench(ActorLockerBenchmark(2));
+  bench(ActorLockerBenchmark(5));
+  bench(ActorLockerBenchmark(20));
+
+  bench(CalcHashSha256Benchmark<BlockSha256MpmcQueueCellPtr<td::MpmcQueue<Cell *>>>());
+  bench(CalcHashSha256Benchmark<BlockSha256MpmcQueueCellPtr<td::MpmcQueueOld<Cell *>>>());
+  bench(CalcHashSha256Benchmark<BlockSha256MpmcQueueCellPtr<CfQueueT<FAAArrayQueue<Cell>, Cell>>>());
+
+  bench(CalcHashSha256Benchmark<BlockSha256MpmcQueueCellPtr<StupidQueue<Cell *>>>());
+  bench(CalcHashSha256Benchmark<BlockSha256MpmcQueueCellPtr<CfQueueT<LazyIndexArrayQueue<Cell>, Cell>>>());
+#if TG_LCR_QUEUE
+  bench(CalcHashSha256Benchmark<BlockSha256MpmcQueueCellPtr<CfQueueT<LCRQueue<Cell>, Cell>>>());
+#endif
+  bench(CalcHashSha256Benchmark<BlockSha256MpmcQueueCellPtr<MoodyQueue<Cell *>>>());
+  bench(CalcHashSha256Benchmark<BlockSha256MpmcQueueCellPtr<BoundedMpmcQueue<Cell *>>>());
+
+  bench(CalcHashSha256Benchmark<BlockSha256MpmcQueue<BoundedMpmcQueue<std::function<void()>>>>());
+  bench(CalcHashSha256Benchmark<BlockSha256MpmcQueue<td::MpmcQueue<std::function<void()>>>>());
+
+  run_queue_bench(1, 10);
+  run_queue_bench(1, 1);
+  run_queue_bench(2, 10);
+  run_queue_bench(2, 2);
+  run_queue_bench(10, 10);
+
+  run_queue_bench(2, 2);
+  run_queue_bench(1, 10);
+  run_queue_bench(10, 1);
+  run_queue_bench(10, 10);
+
+  return 0;
+}
diff --git a/submodules/ton/tonlib-src/tdactor/benchmark/third_party/FAAArrayQueue.h b/submodules/ton/tonlib-src/tdactor/benchmark/third_party/FAAArrayQueue.h
new file mode 100644
index 0000000000..8423826520
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/benchmark/third_party/FAAArrayQueue.h
@@ -0,0 +1,371 @@
+/******************************************************************************
+ * Copyright (c) 2014-2016, Pedro Ramalhete, Andreia Correia
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *     * Redistributions of source code must retain the above copyright
+ *       notice, this list of conditions and the following disclaimer.
+ *     * Redistributions in binary form must reproduce the above copyright
+ *       notice, this list of conditions and the following disclaimer in the
+ *       documentation and/or other materials provided with the distribution.
+ *     * Neither the name of Concurrency Freaks nor the
+ *       names of its contributors may be used to endorse or promote products
+ *       derived from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ ******************************************************************************
+ */
+
+#ifndef _FAA_ARRAY_QUEUE_HP_H_
+#define _FAA_ARRAY_QUEUE_HP_H_
+
+#include "HazardPointers.h"
+
+#include <atomic>
+#include <stdexcept>
+
+namespace ConcurrencyFreaks {
+/**
+ * <h1> Fetch-And-Add Array Queue </h1>
+ *
+ * Each node has one array but we don't search for a vacant entry. Instead, we
+ * use FAA to obtain an index in the array, for enqueueing or dequeuing.
+ *
+ * There are some similarities between this queue and the basic queue in YMC:
+ * http://chaoran.me/assets/pdf/wfq-ppopp16.pdf
+ * but it's not the same because the queue in listing 1 is obstruction-free, while
+ * our algorithm is lock-free.
+ * In FAAArrayQueue eventually a new node will be inserted (using Michael-Scott's
+ * algorithm) and it will have an item pre-filled in the first position, which means
+ * that at most, after BUFFER_SIZE steps, one item will be enqueued (and it can then
+ * be dequeued). This kind of progress is lock-free.
+ *
+ * Each entry in the array may contain one of three possible values:
+ * - A valid item that has been enqueued;
+ * - nullptr, which means no item has yet been enqueued in that position;
+ * - taken, a special value that means there was an item but it has been dequeued;
+ *
+ * Enqueue algorithm: FAA + CAS(null,item)
+ * Dequeue algorithm: FAA + CAS(item,taken)
+ * Consistency: Linearizable
+ * enqueue() progress: lock-free
+ * dequeue() progress: lock-free
+ * Memory Reclamation: Hazard Pointers (lock-free)
+ * Uncontended enqueue: 1 FAA + 1 CAS + 1 HP
+ * Uncontended dequeue: 1 FAA + 1 CAS + 1 HP
+ *
+ *
+ * <p>
+ * Lock-Free Linked List as described in Maged Michael and Michael Scott's paper:
+ * {@link http://www.cs.rochester.edu/~scott/papers/1996_PODC_queues.pdf}
+ * <a href="http://www.cs.rochester.edu/~scott/papers/1996_PODC_queues.pdf">
+ * Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms</a>
+ * <p>
+ * The paper on Hazard Pointers is named "Hazard Pointers: Safe Memory
+ * Reclamation for Lock-Free objects" and it is available here:
+ * http://web.cecs.pdx.edu/~walpole/class/cs510/papers/11.pdf
+ *
+ * @author Pedro Ramalhete
+ * @author Andreia Correia
+ */
+template <typename T>
+class FAAArrayQueue {
+  static const long BUFFER_SIZE = 1024;  // 1024
+
+ private:
+  struct Node {
+    std::atomic<int> deqidx;
+    std::atomic<T*> items[BUFFER_SIZE];
+    std::atomic<int> enqidx;
+    std::atomic<Node*> next;
+
+    // Start with the first entry pre-filled and enqidx at 1
+    Node(T* item) : deqidx{0}, enqidx{1}, next{nullptr} {
+      items[0].store(item, std::memory_order_relaxed);
+      for (long i = 1; i < BUFFER_SIZE; i++) {
+        items[i].store(nullptr, std::memory_order_relaxed);
+      }
+    }
+
+    bool casNext(Node* cmp, Node* val) {
+      return next.compare_exchange_strong(cmp, val);
+    }
+  };
+
+  bool casTail(Node* cmp, Node* val) {
+    return tail.compare_exchange_strong(cmp, val);
+  }
+
+  bool casHead(Node* cmp, Node* val) {
+    return head.compare_exchange_strong(cmp, val);
+  }
+
+  // Pointers to head and tail of the list
+  alignas(128) std::atomic<Node*> head;
+  alignas(128) std::atomic<Node*> tail;
+
+  static const int MAX_THREADS = 128;
+  const int maxThreads;
+
+  T* taken = (T*)new int();  // Muuuahahah !
+
+  // We need just one hazard pointer
+  HazardPointers<Node> hp{1, maxThreads};
+  const int kHpTail = 0;
+  const int kHpHead = 0;
+
+ public:
+  FAAArrayQueue(int maxThreads = MAX_THREADS) : maxThreads{maxThreads} {
+    Node* sentinelNode = new Node(nullptr);
+    sentinelNode->enqidx.store(0, std::memory_order_relaxed);
+    head.store(sentinelNode, std::memory_order_relaxed);
+    tail.store(sentinelNode, std::memory_order_relaxed);
+  }
+
+  ~FAAArrayQueue() {
+    while (dequeue(0) != nullptr)
+      ;                  // Drain the queue
+    delete head.load();  // Delete the last node
+    delete (int*)taken;
+  }
+
+  std::string className() {
+    return "FAAArrayQueue";
+  }
+
+  void enqueue(T* item, const int tid) {
+    while (true) {
+      Node* ltail = hp.protect(kHpTail, tail, tid);
+      const int idx = ltail->enqidx.fetch_add(1);
+      if (idx > BUFFER_SIZE - 1) {  // This node is full
+        if (ltail != tail.load())
+          continue;
+        Node* lnext = ltail->next.load();
+        if (lnext == nullptr) {
+          Node* newNode = new Node(item);
+          if (ltail->casNext(nullptr, newNode)) {
+            casTail(ltail, newNode);
+            hp.clear(tid);
+            return;
+          }
+          delete newNode;
+        } else {
+          casTail(ltail, lnext);
+        }
+        continue;
+      }
+      T* itemnull = nullptr;
+      if (ltail->items[idx].compare_exchange_strong(itemnull, item)) {
+        hp.clear(tid);
+        return;
+      }
+    }
+  }
+
+  T* dequeue(const int tid) {
+    while (true) {
+      Node* lhead = hp.protect(kHpHead, head, tid);
+      if (lhead->deqidx.load() >= lhead->enqidx.load() && lhead->next.load() == nullptr)
+        break;
+      const int idx = lhead->deqidx.fetch_add(1);
+      if (idx > BUFFER_SIZE - 1) {  // This node has been drained, check if there is another one
+        Node* lnext = lhead->next.load();
+        if (lnext == nullptr)
+          break;  // No more nodes in the queue
+        if (casHead(lhead, lnext))
+          hp.retire(lhead, tid);
+        continue;
+      }
+      T* item = lhead->items[idx].exchange(taken);
+      if (item == nullptr)
+        continue;
+      hp.clear(tid);
+      return item;
+    }
+    hp.clear(tid);
+    return nullptr;
+  }
+};
+/**
+ * <h1> Lazy Index Array Queue </h1>
+ *
+ * Same as Linear Array Queue but with lazy indexes for both enqueuers and dequeuers.
+ *
+ * This is a lock-free queue where each node contains an array of items.
+ * Each entry in the array may contain on of three possible values:
+ * - A valid item that has been enqueued;
+ * - nullptr, which means no item has yet been enqueued in that position;
+ * - taken, a special value that means there was an item but it has been dequeued;
+ * The enqueue() searches for the first nullptr entry in the array and tries
+ * to CAS from nullptr to its item.
+ * The dequeue() searches for the first valid item in the array and tries to
+ * CAS from item to "taken".
+ *
+ * Enqueue algorithm: Linear array search starting at lazy index with CAS(nullptr,item)
+ * Dequeue algorithm: Linear array search starting at lazy index with CAS(item,taken)
+ * Consistency: Linearizable
+ * enqueue() progress: lock-free
+ * dequeue() progress: lock-free
+ * Memory Reclamation: Hazard Pointers (lock-free)
+ * Uncontended enqueue: 1 CAS + 1 HP
+ * Uncontended dequeue: 1 CAS + 1 HP
+ *
+ *
+ * <p>
+ * Lock-Free Linked List as described in Maged Michael and Michael Scott's paper:
+ * {@link http://www.cs.rochester.edu/~scott/papers/1996_PODC_queues.pdf}
+ * <a href="http://www.cs.rochester.edu/~scott/papers/1996_PODC_queues.pdf">
+ * Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms</a>
+ * <p>
+ * The paper on Hazard Pointers is named "Hazard Pointers: Safe Memory
+ * Reclamation for Lock-Free objects" and it is available here:
+ * http://web.cecs.pdx.edu/~walpole/class/cs510/papers/11.pdf
+ *
+ * @author Pedro Ramalhete
+ * @author Andreia Correia
+ */
+template <typename T>
+class LazyIndexArrayQueue {
+  static const long BUFFER_SIZE = 1024;
+
+ private:
+  struct Node {
+    std::atomic<int> deqidx;
+    std::atomic<T*> items[BUFFER_SIZE];
+    std::atomic<int> enqidx;
+    std::atomic<Node*> next;
+
+    Node(T* item) : deqidx{0}, enqidx{0}, next{nullptr} {
+      items[0].store(item, std::memory_order_relaxed);
+      for (int i = 1; i < BUFFER_SIZE; i++) {
+        items[i].store(nullptr, std::memory_order_relaxed);
+      }
+    }
+
+    bool casNext(Node* cmp, Node* val) {
+      return next.compare_exchange_strong(cmp, val);
+    }
+  };
+
+  bool casTail(Node* cmp, Node* val) {
+    return tail.compare_exchange_strong(cmp, val);
+  }
+
+  bool casHead(Node* cmp, Node* val) {
+    return head.compare_exchange_strong(cmp, val);
+  }
+
+  // Pointers to head and tail of the list
+  alignas(128) std::atomic<Node*> head;
+  alignas(128) std::atomic<Node*> tail;
+
+  static const int MAX_THREADS = 128;
+  const int maxThreads;
+
+  T* taken = (T*)new int();  // Muuuahahah !
+
+  // We need just one hazard pointer
+  HazardPointers<Node> hp{1, maxThreads};
+  const int kHpTail = 0;
+  const int kHpHead = 0;
+
+ public:
+  LazyIndexArrayQueue(int maxThreads = MAX_THREADS) : maxThreads{maxThreads} {
+    Node* sentinelNode = new Node(nullptr);
+    head.store(sentinelNode, std::memory_order_relaxed);
+    tail.store(sentinelNode, std::memory_order_relaxed);
+  }
+
+  ~LazyIndexArrayQueue() {
+    while (dequeue(0) != nullptr)
+      ;                  // Drain the queue
+    delete head.load();  // Delete the last node
+    delete (int*)taken;
+  }
+
+  std::string className() {
+    return "LazyIndexArrayQueue";
+  }
+
+  void enqueue(T* item, const int tid) {
+    while (true) {
+      Node* ltail = hp.protect(kHpTail, tail, tid);
+      if (ltail->items[BUFFER_SIZE - 1].load() != nullptr) {  // This node is full
+        if (ltail != tail.load())
+          continue;
+        Node* lnext = ltail->next.load();
+        if (lnext == nullptr) {
+          Node* newNode = new Node(item);
+          if (ltail->casNext(nullptr, newNode)) {
+            casTail(ltail, newNode);
+            hp.clear(tid);
+            return;
+          }
+          delete newNode;
+        } else {
+          casTail(ltail, lnext);
+        }
+        continue;
+      }
+      // Find the first null entry in items[] and try to CAS from null to item
+      for (int i = ltail->enqidx.load(); i < BUFFER_SIZE; i++) {
+        if (ltail->items[i].load() != nullptr)
+          continue;
+        T* itemnull = nullptr;
+        if (ltail->items[i].compare_exchange_strong(itemnull, item)) {
+          ltail->enqidx.store(i + 1, std::memory_order_release);
+          hp.clear(tid);
+          return;
+        }
+        if (ltail != tail.load())
+          break;
+      }
+    }
+  }
+
+  T* dequeue(const int tid) {
+    while (true) {
+      Node* lhead = hp.protect(kHpHead, head, tid);
+      if (lhead->items[BUFFER_SIZE - 1].load() == taken) {  // This node has been drained, check if there is another one
+        Node* lnext = lhead->next.load();
+        if (lnext == nullptr) {  // No more nodes in the queue
+          hp.clear(tid);
+          return nullptr;
+        }
+        if (casHead(lhead, lnext))
+          hp.retire(lhead, tid);
+        continue;
+      }
+      // Find the first non taken entry in items[] and try to CAS from item to taken
+      for (int i = lhead->deqidx.load(); i < BUFFER_SIZE; i++) {
+        T* item = lhead->items[i].load();
+        if (item == nullptr) {
+          hp.clear(tid);
+          return nullptr;  // This node is empty
+        }
+        if (item == taken)
+          continue;
+        if (lhead->items[i].compare_exchange_strong(item, taken)) {
+          lhead->deqidx.store(i + 1, std::memory_order_release);
+          hp.clear(tid);
+          return item;
+        }
+        if (lhead != head.load())
+          break;
+      }
+    }
+  }
+};
+}  // namespace ConcurrencyFreaks
+
+#endif /* _FAA_ARRAY_QUEUE_HP_H_ */
diff --git a/submodules/ton/tonlib-src/tdactor/benchmark/third_party/HazardPointers.h b/submodules/ton/tonlib-src/tdactor/benchmark/third_party/HazardPointers.h
new file mode 100644
index 0000000000..e562486a29
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/benchmark/third_party/HazardPointers.h
@@ -0,0 +1,152 @@
+/******************************************************************************
+ * Copyright (c) 2014-2016, Pedro Ramalhete, Andreia Correia
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *     * Redistributions of source code must retain the above copyright
+ *       notice, this list of conditions and the following disclaimer.
+ *     * Redistributions in binary form must reproduce the above copyright
+ *       notice, this list of conditions and the following disclaimer in the
+ *       documentation and/or other materials provided with the distribution.
+ *     * Neither the name of Concurrency Freaks nor the
+ *       names of its contributors may be used to endorse or promote products
+ *       derived from this software without specific prior written permission.
+
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ ******************************************************************************
+ */
+
+#ifndef _HAZARD_POINTERS_H_
+#define _HAZARD_POINTERS_H_
+
+#include <atomic>
+#include <vector>
+#include <iostream>
+
+namespace ConcurrencyFreaks {
+template <typename T>
+class HazardPointers {
+ private:
+  static const int HP_MAX_THREADS = 128;
+  static const int HP_MAX_HPS = 4;  // This is named 'K' in the HP paper
+  static const int CLPAD = 128 / sizeof(std::atomic<T*>);
+  static const int HP_THRESHOLD_R = 0;                         // This is named 'R' in the HP paper
+  static const int MAX_RETIRED = HP_MAX_THREADS * HP_MAX_HPS;  // Maximum number of retired objects per thread
+
+  const int maxHPs;
+  const int maxThreads;
+
+  std::atomic<T*>* hp[HP_MAX_THREADS];
+  // It's not nice that we have a lot of empty vectors, but we need padding to avoid false sharing
+  std::vector<T*> retiredList[HP_MAX_THREADS * CLPAD];
+
+ public:
+  HazardPointers(int maxHPs = HP_MAX_HPS, int maxThreads = HP_MAX_THREADS) : maxHPs{maxHPs}, maxThreads{maxThreads} {
+    for (int ithread = 0; ithread < HP_MAX_THREADS; ithread++) {
+      hp[ithread] =
+          new std::atomic<T*>[CLPAD *
+                              2];  // We allocate four cache lines to allow for many hps and without false sharing
+      for (int ihp = 0; ihp < HP_MAX_HPS; ihp++) {
+        hp[ithread][ihp].store(nullptr, std::memory_order_relaxed);
+      }
+    }
+  }
+
+  ~HazardPointers() {
+    for (int ithread = 0; ithread < HP_MAX_THREADS; ithread++) {
+      delete[] hp[ithread];
+      // Clear the current retired nodes
+      for (unsigned iret = 0; iret < retiredList[ithread * CLPAD].size(); iret++) {
+        delete retiredList[ithread * CLPAD][iret];
+      }
+    }
+  }
+
+  /**
+     * Progress Condition: wait-free bounded (by maxHPs)
+     */
+  void clear(const int tid) {
+    for (int ihp = 0; ihp < maxHPs; ihp++) {
+      hp[tid][ihp].store(nullptr, std::memory_order_release);
+    }
+  }
+
+  /**
+     * Progress Condition: wait-free population oblivious
+     */
+  void clearOne(int ihp, const int tid) {
+    hp[tid][ihp].store(nullptr, std::memory_order_release);
+  }
+
+  /**
+     * Progress Condition: lock-free
+     */
+  T* protect(int index, const std::atomic<T*>& atom, const int tid) {
+    T* n = nullptr;
+    T* ret;
+    while ((ret = atom.load()) != n) {
+      hp[tid][index].store(ret);
+      n = ret;
+    }
+    return ret;
+  }
+
+  /**
+     * This returns the same value that is passed as ptr, which is sometimes useful
+     * Progress Condition: wait-free population oblivious
+     */
+  T* protectPtr(int index, T* ptr, const int tid) {
+    hp[tid][index].store(ptr);
+    return ptr;
+  }
+
+  /**
+     * This returns the same value that is passed as ptr, which is sometimes useful
+     * Progress Condition: wait-free population oblivious
+     */
+  T* protectRelease(int index, T* ptr, const int tid) {
+    hp[tid][index].store(ptr, std::memory_order_release);
+    return ptr;
+  }
+
+  /**
+     * Progress Condition: wait-free bounded (by the number of threads squared)
+     */
+  void retire(T* ptr, const int tid) {
+    retiredList[tid * CLPAD].push_back(ptr);
+    if (retiredList[tid * CLPAD].size() < HP_THRESHOLD_R)
+      return;
+    for (unsigned iret = 0; iret < retiredList[tid * CLPAD].size();) {
+      auto obj = retiredList[tid * CLPAD][iret];
+      bool canDelete = true;
+      for (int tid = 0; tid < maxThreads && canDelete; tid++) {
+        for (int ihp = maxHPs - 1; ihp >= 0; ihp--) {
+          if (hp[tid][ihp].load() == obj) {
+            canDelete = false;
+            break;
+          }
+        }
+      }
+      if (canDelete) {
+        retiredList[tid * CLPAD].erase(retiredList[tid * CLPAD].begin() + iret);
+        delete obj;
+        continue;
+      }
+      iret++;
+    }
+  }
+};
+}  // namespace ConcurrencyFreaks
+
+#endif /* _HAZARD_POINTERS_H_ */
diff --git a/submodules/ton/tonlib-src/tdactor/benchmark/third_party/LCRQueue.h b/submodules/ton/tonlib-src/tdactor/benchmark/third_party/LCRQueue.h
new file mode 100644
index 0000000000..17e4b1681b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/benchmark/third_party/LCRQueue.h
@@ -0,0 +1,313 @@
+/******************************************************************************
+ * Copyright (c) 2014-2016, Pedro Ramalhete, Andreia Correia
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *     * Redistributions of source code must retain the above copyright
+ *       notice, this list of conditions and the following disclaimer.
+ *     * Redistributions in binary form must reproduce the above copyright
+ *       notice, this list of conditions and the following disclaimer in the
+ *       documentation and/or other materials provided with the distribution.
+ *     * Neither the name of Concurrency Freaks nor the
+ *       names of its contributors may be used to endorse or promote products
+ *       derived from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ ******************************************************************************
+ */
+
+#ifndef _LCRQ_QUEUE_HP_H_
+#define _LCRQ_QUEUE_HP_H_
+
+#include <atomic>
+
+// CAS2 macro
+
+#define __CAS2(ptr, o1, o2, n1, n2)                                     \
+  ({                                                                    \
+    char __ret;                                                         \
+    __typeof__(o2) __junk;                                              \
+    __typeof__(*(ptr)) __old1 = (o1);                                   \
+    __typeof__(o2) __old2 = (o2);                                       \
+    __typeof__(*(ptr)) __new1 = (n1);                                   \
+    __typeof__(o2) __new2 = (n2);                                       \
+    asm volatile("lock cmpxchg16b %2;setz %1"                           \
+                 : "=d"(__junk), "=a"(__ret), "+m"(*ptr)                \
+                 : "b"(__new1), "c"(__new2), "a"(__old1), "d"(__old2)); \
+    __ret;                                                              \
+  })
+
+#define CAS2(ptr, o1, o2, n1, n2) __CAS2(ptr, o1, o2, n1, n2)
+
+#define BIT_TEST_AND_SET(ptr, b)                                                    \
+  ({                                                                                \
+    char __ret;                                                                     \
+    asm volatile("lock btsq $63, %0; setnc %1" : "+m"(*ptr), "=a"(__ret) : : "cc"); \
+    __ret;                                                                          \
+  })
+
+/**
+ * <h1> LCRQ Queue </h1>
+ *
+ * This is LCRQ by Adam Morrison and Yehuda Afek
+ * http://www.cs.tau.ac.il/~mad/publications/ppopp2013-x86queues.pdf
+ *
+ * This implementation does NOT obey the C++ memory model rules AND it is x86 specific.
+ * No guarantees are given on the correctness or consistency of the results if you use this queue.
+ *
+ * Bugs fixed:
+ * tt was not initialized in dequeue();
+ *
+ * <p>
+ * enqueue algorithm: MS enqueue + LCRQ with re-usage
+ * dequeue algorithm: MS dequeue + LCRQ with re-usage
+ * Consistency: Linearizable
+ * enqueue() progress: lock-free
+ * dequeue() progress: lock-free
+ * Memory Reclamation: Hazard Pointers (lock-free)
+ *
+ * <p>
+ * The paper on Hazard Pointers is named "Hazard Pointers: Safe Memory
+ * Reclamation for Lock-Free objects" and it is available here:
+ * http://web.cecs.pdx.edu/~walpole/class/cs510/papers/11.pdf
+ *
+ * @author Pedro Ramalhete
+ * @author Andreia Correia
+ */
+namespace ConcurrencyFreaks {
+template <typename T>
+class LCRQueue {
+ private:
+  static const int RING_POW = 10;
+  static const uint64_t RING_SIZE = 1ull << RING_POW;
+
+  struct Cell {
+    std::atomic<T*> val;
+    std::atomic<uint64_t> idx;
+    uint64_t pad[14];
+  } __attribute__((aligned(128)));
+
+  struct Node {
+    std::atomic<int64_t> head __attribute__((aligned(128)));
+    std::atomic<int64_t> tail __attribute__((aligned(128)));
+    std::atomic<Node*> next __attribute__((aligned(128)));
+    Cell array[RING_SIZE];
+
+    Node() {
+      for (unsigned i = 0; i < RING_SIZE; i++) {
+        array[i].val.store(nullptr, std::memory_order_relaxed);
+        array[i].idx.store(i, std::memory_order_relaxed);
+      }
+      head.store(0, std::memory_order_relaxed);
+      tail.store(0, std::memory_order_relaxed);
+      next.store(nullptr, std::memory_order_relaxed);
+    }
+  };
+
+  alignas(128) std::atomic<Node*> head;
+  alignas(128) std::atomic<Node*> tail;
+
+  static const int MAX_THREADS = 128;
+  const int maxThreads;
+
+  HazardPointers<Node> hp{1, maxThreads};
+  const int kHpTail = 0;
+  const int kHpHead = 0;
+
+  /*
+     * Private methods
+     */
+  int is_empty(T* v) {
+    return (v == nullptr);
+  }
+
+  uint64_t node_index(uint64_t i) {
+    return (i & ~(1ull << 63));
+  }
+
+  uint64_t set_unsafe(uint64_t i) {
+    return (i | (1ull << 63));
+  }
+
+  uint64_t node_unsafe(uint64_t i) {
+    return (i & (1ull << 63));
+  }
+
+  inline uint64_t tail_index(uint64_t t) {
+    return (t & ~(1ull << 63));
+  }
+
+  int crq_is_closed(uint64_t t) {
+    return (t & (1ull << 63)) != 0;
+  }
+
+  void fixState(Node* lhead) {
+    while (1) {
+      uint64_t t = lhead->tail.fetch_add(0);
+      uint64_t h = lhead->head.fetch_add(0);
+      // TODO: is it ok or not to cast "t" to int64_t ?
+      if (lhead->tail.load() != (int64_t)t)
+        continue;
+      if (h > t) {
+        int64_t tmp = t;
+        if (lhead->tail.compare_exchange_strong(tmp, h))
+          break;
+        continue;
+      }
+      break;
+    }
+  }
+
+  int close_crq(Node* rq, const uint64_t tailticket, const int tries) {
+    if (tries < 10) {
+      int64_t tmp = tailticket + 1;
+      return rq->tail.compare_exchange_strong(tmp, (tailticket + 1) | (1ull << 63));
+    } else {
+      return BIT_TEST_AND_SET(&rq->tail, 63);
+    }
+  }
+
+ public:
+  LCRQueue(int maxThreads = MAX_THREADS) : maxThreads{maxThreads} {
+    // Shared object init
+    Node* sentinel = new Node;
+    head.store(sentinel, std::memory_order_relaxed);
+    tail.store(sentinel, std::memory_order_relaxed);
+  }
+
+  ~LCRQueue() {
+    while (dequeue(0) != nullptr)
+      ;                  // Drain the queue
+    delete head.load();  // Delete the last node
+  }
+
+  std::string className() {
+    return "LCRQueue";
+  }
+
+  void enqueue(T* item, const int tid) {
+    int try_close = 0;
+    while (true) {
+      Node* ltail = hp.protectPtr(kHpTail, tail.load(), tid);
+      if (ltail != tail.load())
+        continue;
+      Node* lnext = ltail->next.load();
+      if (lnext != nullptr) {  // Help advance the tail
+        tail.compare_exchange_strong(ltail, lnext);
+        continue;
+      }
+
+      uint64_t tailticket = ltail->tail.fetch_add(1);
+      if (crq_is_closed(tailticket)) {
+        Node* newNode = new Node();
+        // Solo enqueue (superfluous?)
+        newNode->tail.store(1, std::memory_order_relaxed);
+        newNode->array[0].val.store(item, std::memory_order_relaxed);
+        newNode->array[0].idx.store(0, std::memory_order_relaxed);
+        Node* nullnode = nullptr;
+        if (ltail->next.compare_exchange_strong(nullnode, newNode)) {  // Insert new ring
+          tail.compare_exchange_strong(ltail, newNode);                // Advance the tail
+          hp.clear(tid);
+          return;
+        }
+        delete newNode;
+        continue;
+      }
+      Cell* cell = &ltail->array[tailticket & (RING_SIZE - 1)];
+      uint64_t idx = cell->idx.load();
+      if (cell->val.load() == nullptr) {
+        if (node_index(idx) <= tailticket) {
+          // TODO: is the missing cast before "t" ok or not to add?
+          if ((!node_unsafe(idx) || ltail->head.load() < (int64_t)tailticket)) {
+            if (CAS2((void**)cell, nullptr, idx, item, tailticket)) {
+              hp.clear(tid);
+              return;
+            }
+          }
+        }
+      }
+      if (((int64_t)(tailticket - ltail->head.load()) >= (int64_t)RING_SIZE) &&
+          close_crq(ltail, tailticket, ++try_close))
+        continue;
+    }
+  }
+
+  T* dequeue(const int tid) {
+    while (true) {
+      Node* lhead = hp.protectPtr(kHpHead, head.load(), tid);
+      if (lhead != head.load())
+        continue;
+      uint64_t headticket = lhead->head.fetch_add(1);
+      Cell* cell = &lhead->array[headticket & (RING_SIZE - 1)];
+
+      int r = 0;
+      uint64_t tt = 0;
+
+      while (true) {
+        uint64_t cell_idx = cell->idx.load();
+        uint64_t unsafe = node_unsafe(cell_idx);
+        uint64_t idx = node_index(cell_idx);
+        T* val = cell->val.load();
+
+        if (idx > headticket)
+          break;
+
+        if (val != nullptr) {
+          if (idx == headticket) {
+            if (CAS2((void**)cell, val, cell_idx, nullptr, unsafe | (headticket + RING_SIZE))) {
+              hp.clear(tid);
+              return val;
+            }
+          } else {
+            if (CAS2((void**)cell, val, cell_idx, val, set_unsafe(idx)))
+              break;
+          }
+        } else {
+          if ((r & ((1ull << 10) - 1)) == 0)
+            tt = lhead->tail.load();
+          // Optimization: try to bail quickly if queue is closed.
+          int crq_closed = crq_is_closed(tt);
+          uint64_t t = tail_index(tt);
+          if (unsafe) {  // Nothing to do, move along
+            if (CAS2((void**)cell, val, cell_idx, val, unsafe | (headticket + RING_SIZE)))
+              break;
+          } else if (t < headticket + 1 || r > 200000 || crq_closed) {
+            if (CAS2((void**)cell, val, idx, val, headticket + RING_SIZE)) {
+              if (r > 200000 && tt > RING_SIZE)
+                BIT_TEST_AND_SET(&lhead->tail, 63);
+              break;
+            }
+          } else {
+            ++r;
+          }
+        }
+      }
+
+      if (tail_index(lhead->tail.load()) <= headticket + 1) {
+        fixState(lhead);
+        // try to return empty
+        Node* lnext = lhead->next.load();
+        if (lnext == nullptr) {
+          hp.clear(tid);
+          return nullptr;  // Queue is empty
+        }
+        if (tail_index(lhead->tail) <= headticket + 1) {
+          if (head.compare_exchange_strong(lhead, lnext))
+            hp.retire(lhead, tid);
+        }
+      }
+    }
+  }
+};
+}  // namespace ConcurrencyFreaks
+#endif /* _LCRQ_QUEUE_HP_H_ */
diff --git a/submodules/ton/tonlib-src/tdactor/benchmark/third_party/LazyIndexArrayQueue.h b/submodules/ton/tonlib-src/tdactor/benchmark/third_party/LazyIndexArrayQueue.h
new file mode 100644
index 0000000000..e69de29bb2
diff --git a/submodules/ton/tonlib-src/tdactor/benchmark/third_party/MoodyCamelQueue.h b/submodules/ton/tonlib-src/tdactor/benchmark/third_party/MoodyCamelQueue.h
new file mode 100644
index 0000000000..936a2f5fcd
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/benchmark/third_party/MoodyCamelQueue.h
@@ -0,0 +1,3716 @@
+// Provides a C++11 implementation of a multi-producer, multi-consumer lock-free queue.
+// An overview, including benchmark results, is provided here:
+//     http://moodycamel.com/blog/2014/a-fast-general-purpose-lock-free-queue-for-c++
+// The full design is also described in excruciating detail at:
+//    http://moodycamel.com/blog/2014/detailed-design-of-a-lock-free-queue
+
+// Simplified BSD license:
+// Copyright (c) 2013-2016, Cameron Desrochers.
+// All rights reserved.
+//
+// Redistribution and use in source and binary forms, with or without modification,
+// are permitted provided that the following conditions are met:
+//
+// - Redistributions of source code must retain the above copyright notice, this list of
+// conditions and the following disclaimer.
+// - Redistributions in binary form must reproduce the above copyright notice, this list of
+// conditions and the following disclaimer in the documentation and/or other materials
+// provided with the distribution.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
+// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
+// THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
+// OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+// HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+// TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+// EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#pragma once
+
+#if defined(__GNUC__)
+// Disable -Wconversion warnings (spuriously triggered when Traits::size_t and
+// Traits::index_t are set to < 32 bits, causing integer promotion, causing warnings
+// upon assigning any computed values)
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wconversion"
+
+#ifdef MCDBGQ_USE_RELACY
+#pragma GCC diagnostic ignored "-Wint-to-pointer-cast"
+#endif
+#endif
+
+#if defined(__APPLE__)
+#include "TargetConditionals.h"
+#endif
+
+#ifdef MCDBGQ_USE_RELACY
+#include "relacy/relacy_std.hpp"
+#include "relacy_shims.h"
+// We only use malloc/free anyway, and the delete macro messes up `= delete` method declarations.
+// We'll override the default trait malloc ourselves without a macro.
+#undef new
+#undef delete
+#undef malloc
+#undef free
+#else
+#include <atomic>  // Requires C++11. Sorry VS2010.
+#include <cassert>
+#endif
+#include <cstddef>  // for max_align_t
+#include <cstdint>
+#include <cstdlib>
+#include <type_traits>
+#include <algorithm>
+#include <utility>
+#include <limits>
+#include <climits>  // for CHAR_BIT
+#include <array>
+#include <thread>  // partly for __WINPTHREADS_VERSION if on MinGW-w64 w/ POSIX threading
+
+// Platform-specific definitions of a numeric thread ID type and an invalid value
+namespace moodycamel {
+namespace details {
+template <typename thread_id_t>
+struct thread_id_converter {
+  typedef thread_id_t thread_id_numeric_size_t;
+  typedef thread_id_t thread_id_hash_t;
+  static thread_id_hash_t prehash(thread_id_t const& x) {
+    return x;
+  }
+};
+}  // namespace details
+}  // namespace moodycamel
+#if defined(MCDBGQ_USE_RELACY)
+namespace moodycamel {
+namespace details {
+typedef std::uint32_t thread_id_t;
+static const thread_id_t invalid_thread_id = 0xFFFFFFFFU;
+static const thread_id_t invalid_thread_id2 = 0xFFFFFFFEU;
+static inline thread_id_t thread_id() {
+  return rl::thread_index();
+}
+}  // namespace details
+}  // namespace moodycamel
+#elif defined(_WIN32) || defined(__WINDOWS__) || defined(__WIN32__)
+// No sense pulling in windows.h in a header, we'll manually declare the function
+// we use and rely on backwards-compatibility for this not to break
+extern "C" __declspec(dllimport) unsigned long __stdcall GetCurrentThreadId(void);
+namespace moodycamel {
+namespace details {
+static_assert(sizeof(unsigned long) == sizeof(std::uint32_t),
+              "Expected size of unsigned long to be 32 bits on Windows");
+typedef std::uint32_t thread_id_t;
+static const thread_id_t invalid_thread_id =
+    0;  // See http://blogs.msdn.com/b/oldnewthing/archive/2004/02/23/78395.aspx
+static const thread_id_t invalid_thread_id2 =
+    0xFFFFFFFFU;  // Not technically guaranteed to be invalid, but is never used in practice. Note that all Win32 thread IDs are presently multiples of 4.
+static inline thread_id_t thread_id() {
+  return static_cast<thread_id_t>(::GetCurrentThreadId());
+}
+}  // namespace details
+}  // namespace moodycamel
+#elif defined(__arm__) || defined(_M_ARM) || defined(__aarch64__) || (defined(__APPLE__) && TARGET_OS_IPHONE)
+namespace moodycamel {
+namespace details {
+static_assert(sizeof(std::thread::id) == 4 || sizeof(std::thread::id) == 8,
+              "std::thread::id is expected to be either 4 or 8 bytes");
+
+typedef std::thread::id thread_id_t;
+static const thread_id_t invalid_thread_id;  // Default ctor creates invalid ID
+
+// Note we don't define a invalid_thread_id2 since std::thread::id doesn't have one; it's
+// only used if MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED is defined anyway, which it won't
+// be.
+static inline thread_id_t thread_id() {
+  return std::this_thread::get_id();
+}
+
+template <std::size_t>
+struct thread_id_size {};
+template <>
+struct thread_id_size<4> {
+  typedef std::uint32_t numeric_t;
+};
+template <>
+struct thread_id_size<8> {
+  typedef std::uint64_t numeric_t;
+};
+
+template <>
+struct thread_id_converter<thread_id_t> {
+  typedef thread_id_size<sizeof(thread_id_t)>::numeric_t thread_id_numeric_size_t;
+#ifndef __APPLE__
+  typedef std::size_t thread_id_hash_t;
+#else
+  typedef thread_id_numeric_size_t thread_id_hash_t;
+#endif
+
+  static thread_id_hash_t prehash(thread_id_t const& x) {
+#ifndef __APPLE__
+    return std::hash<std::thread::id>()(x);
+#else
+    return *reinterpret_cast<thread_id_hash_t const*>(&x);
+#endif
+  }
+};
+}  // namespace details
+}  // namespace moodycamel
+#else
+// Use a nice trick from this answer: http://stackoverflow.com/a/8438730/21475
+// In order to get a numeric thread ID in a platform-independent way, we use a thread-local
+// static variable's address as a thread identifier :-)
+#if defined(__GNUC__) || defined(__INTEL_COMPILER)
+#define MOODYCAMEL_THREADLOCAL __thread
+#elif defined(_MSC_VER)
+#define MOODYCAMEL_THREADLOCAL __declspec(thread)
+#else
+// Assume C++11 compliant compiler
+#define MOODYCAMEL_THREADLOCAL thread_local
+#endif
+namespace moodycamel {
+namespace details {
+typedef std::uintptr_t thread_id_t;
+static const thread_id_t invalid_thread_id = 0;  // Address can't be nullptr
+static const thread_id_t invalid_thread_id2 =
+    1;  // Member accesses off a null pointer are also generally invalid. Plus it's not aligned.
+static inline thread_id_t thread_id() {
+  static MOODYCAMEL_THREADLOCAL int x;
+  return reinterpret_cast<thread_id_t>(&x);
+}
+}  // namespace details
+}  // namespace moodycamel
+#endif
+
+// Exceptions
+#ifndef MOODYCAMEL_EXCEPTIONS_ENABLED
+#if (defined(_MSC_VER) && defined(_CPPUNWIND)) || (defined(__GNUC__) && defined(__EXCEPTIONS)) || \
+    (!defined(_MSC_VER) && !defined(__GNUC__))
+#define MOODYCAMEL_EXCEPTIONS_ENABLED
+#endif
+#endif
+#ifdef MOODYCAMEL_EXCEPTIONS_ENABLED
+#define MOODYCAMEL_TRY try
+#define MOODYCAMEL_CATCH(...) catch (__VA_ARGS__)
+#define MOODYCAMEL_RETHROW throw
+#define MOODYCAMEL_THROW(expr) throw(expr)
+#else
+#define MOODYCAMEL_TRY if (true)
+#define MOODYCAMEL_CATCH(...) else if (false)
+#define MOODYCAMEL_RETHROW
+#define MOODYCAMEL_THROW(expr)
+#endif
+
+#ifndef MOODYCAMEL_NOEXCEPT
+#if !defined(MOODYCAMEL_EXCEPTIONS_ENABLED)
+#define MOODYCAMEL_NOEXCEPT
+#define MOODYCAMEL_NOEXCEPT_CTOR(type, valueType, expr) true
+#define MOODYCAMEL_NOEXCEPT_ASSIGN(type, valueType, expr) true
+#elif defined(_MSC_VER) && defined(_NOEXCEPT) && _MSC_VER < 1800
+// VS2012's std::is_nothrow_[move_]constructible is broken and returns true when it shouldn't :-(
+// We have to assume *all* non-trivial constructors may throw on VS2012!
+#define MOODYCAMEL_NOEXCEPT _NOEXCEPT
+#define MOODYCAMEL_NOEXCEPT_CTOR(type, valueType, expr)                                  \
+  (std::is_rvalue_reference<valueType>::value && std::is_move_constructible<type>::value \
+       ? std::is_trivially_move_constructible<type>::value                               \
+       : std::is_trivially_copy_constructible<type>::value)
+#define MOODYCAMEL_NOEXCEPT_ASSIGN(type, valueType, expr)                                                    \
+  ((std::is_rvalue_reference<valueType>::value && std::is_move_assignable<type>::value                       \
+        ? std::is_trivially_move_assignable<type>::value || std::is_nothrow_move_assignable<type>::value     \
+        : std::is_trivially_copy_assignable<type>::value || std::is_nothrow_copy_assignable<type>::value) && \
+   MOODYCAMEL_NOEXCEPT_CTOR(type, valueType, expr))
+#elif defined(_MSC_VER) && defined(_NOEXCEPT) && _MSC_VER < 1900
+#define MOODYCAMEL_NOEXCEPT _NOEXCEPT
+#define MOODYCAMEL_NOEXCEPT_CTOR(type, valueType, expr)                                                       \
+  (std::is_rvalue_reference<valueType>::value && std::is_move_constructible<type>::value                      \
+       ? std::is_trivially_move_constructible<type>::value || std::is_nothrow_move_constructible<type>::value \
+       : std::is_trivially_copy_constructible<type>::value || std::is_nothrow_copy_constructible<type>::value)
+#define MOODYCAMEL_NOEXCEPT_ASSIGN(type, valueType, expr)                                                    \
+  ((std::is_rvalue_reference<valueType>::value && std::is_move_assignable<type>::value                       \
+        ? std::is_trivially_move_assignable<type>::value || std::is_nothrow_move_assignable<type>::value     \
+        : std::is_trivially_copy_assignable<type>::value || std::is_nothrow_copy_assignable<type>::value) && \
+   MOODYCAMEL_NOEXCEPT_CTOR(type, valueType, expr))
+#else
+#define MOODYCAMEL_NOEXCEPT noexcept
+#define MOODYCAMEL_NOEXCEPT_CTOR(type, valueType, expr) noexcept(expr)
+#define MOODYCAMEL_NOEXCEPT_ASSIGN(type, valueType, expr) noexcept(expr)
+#endif
+#endif
+
+#ifndef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED
+#ifdef MCDBGQ_USE_RELACY
+#define MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED
+#else
+// VS2013 doesn't support `thread_local`, and MinGW-w64 w/ POSIX threading has a crippling bug: http://sourceforge.net/p/mingw-w64/bugs/445
+// g++ <=4.7 doesn't support thread_local either.
+// Finally, iOS/ARM doesn't have support for it either, and g++/ARM allows it to compile but it's unconfirmed to actually work
+#if (!defined(_MSC_VER) || _MSC_VER >= 1900) &&                                            \
+    (!defined(__MINGW32__) && !defined(__MINGW64__) || !defined(__WINPTHREADS_VERSION)) && \
+    (!defined(__GNUC__) || __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 8)) &&      \
+    (!defined(__APPLE__) || !TARGET_OS_IPHONE) && !defined(__arm__) && !defined(_M_ARM) && !defined(__aarch64__)
+// Assume `thread_local` is fully supported in all other C++11 compilers/platforms
+//#define MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED    // always disabled for now since several users report having problems with it on
+#endif
+#endif
+#endif
+
+// VS2012 doesn't support deleted functions.
+// In this case, we declare the function normally but don't define it. A link error will be generated if the function is called.
+#ifndef MOODYCAMEL_DELETE_FUNCTION
+#if defined(_MSC_VER) && _MSC_VER < 1800
+#define MOODYCAMEL_DELETE_FUNCTION
+#else
+#define MOODYCAMEL_DELETE_FUNCTION = delete
+#endif
+#endif
+
+// Compiler-specific likely/unlikely hints
+namespace moodycamel {
+namespace details {
+#if defined(__GNUC__)
+inline bool likely(bool x) {
+  return __builtin_expect((x), true);
+}
+inline bool unlikely(bool x) {
+  return __builtin_expect((x), false);
+}
+#else
+inline bool likely(bool x) {
+  return x;
+}
+inline bool unlikely(bool x) {
+  return x;
+}
+#endif
+}  // namespace details
+}  // namespace moodycamel
+
+#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG
+#include "internal/concurrentqueue_internal_debug.h"
+#endif
+
+namespace moodycamel {
+namespace details {
+template <typename T>
+struct const_numeric_max {
+  static_assert(std::is_integral<T>::value, "const_numeric_max can only be used with integers");
+  static const T value = std::numeric_limits<T>::is_signed
+                             ? (static_cast<T>(1) << (sizeof(T) * CHAR_BIT - 1)) - static_cast<T>(1)
+                             : static_cast<T>(-1);
+};
+
+#if defined(__GNUC__) && !defined(__clang__)
+typedef ::max_align_t std_max_align_t;  // GCC forgot to add it to std:: for a while
+#else
+typedef std::max_align_t std_max_align_t;  // Others (e.g. MSVC) insist it can *only* be accessed via std::
+#endif
+
+// Some platforms have incorrectly set max_align_t to a type with <8 bytes alignment even while supporting
+// 8-byte aligned scalar values (*cough* 32-bit iOS). Work around this with our own union. See issue #64.
+typedef union {
+  std_max_align_t x;
+  long long y;
+  void* z;
+} max_align_t;
+}  // namespace details
+
+// Default traits for the ConcurrentQueue. To change some of the
+// traits without re-implementing all of them, inherit from this
+// struct and shadow the declarations you wish to be different;
+// since the traits are used as a template type parameter, the
+// shadowed declarations will be used where defined, and the defaults
+// otherwise.
+struct ConcurrentQueueDefaultTraits {
+  // General-purpose size type. std::size_t is strongly recommended.
+  typedef std::size_t size_t;
+
+  // The type used for the enqueue and dequeue indices. Must be at least as
+  // large as size_t. Should be significantly larger than the number of elements
+  // you expect to hold at once, especially if you have a high turnover rate;
+  // for example, on 32-bit x86, if you expect to have over a hundred million
+  // elements or pump several million elements through your queue in a very
+  // short space of time, using a 32-bit type *may* trigger a race condition.
+  // A 64-bit int type is recommended in that case, and in practice will
+  // prevent a race condition no matter the usage of the queue. Note that
+  // whether the queue is lock-free with a 64-int type depends on the whether
+  // std::atomic<std::uint64_t> is lock-free, which is platform-specific.
+  typedef std::size_t index_t;
+
+  // Internally, all elements are enqueued and dequeued from multi-element
+  // blocks; this is the smallest controllable unit. If you expect few elements
+  // but many producers, a smaller block size should be favoured. For few producers
+  // and/or many elements, a larger block size is preferred. A sane default
+  // is provided. Must be a power of 2.
+  static const size_t BLOCK_SIZE = 32;
+
+  // For explicit producers (i.e. when using a producer token), the block is
+  // checked for being empty by iterating through a list of flags, one per element.
+  // For large block sizes, this is too inefficient, and switching to an atomic
+  // counter-based approach is faster. The switch is made for block sizes strictly
+  // larger than this threshold.
+  static const size_t EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD = 32;
+
+  // How many full blocks can be expected for a single explicit producer? This should
+  // reflect that number's maximum for optimal performance. Must be a power of 2.
+  static const size_t EXPLICIT_INITIAL_INDEX_SIZE = 32;
+
+  // How many full blocks can be expected for a single implicit producer? This should
+  // reflect that number's maximum for optimal performance. Must be a power of 2.
+  static const size_t IMPLICIT_INITIAL_INDEX_SIZE = 32;
+
+  // The initial size of the hash table mapping thread IDs to implicit producers.
+  // Note that the hash is resized every time it becomes half full.
+  // Must be a power of two, and either 0 or at least 1. If 0, implicit production
+  // (using the enqueue methods without an explicit producer token) is disabled.
+  static const size_t INITIAL_IMPLICIT_PRODUCER_HASH_SIZE = 32;
+
+  // Controls the number of items that an explicit consumer (i.e. one with a token)
+  // must consume before it causes all consumers to rotate and move on to the next
+  // internal queue.
+  static const std::uint32_t EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE = 256;
+
+  // The maximum number of elements (inclusive) that can be enqueued to a sub-queue.
+  // Enqueue operations that would cause this limit to be surpassed will fail. Note
+  // that this limit is enforced at the block level (for performance reasons), i.e.
+  // it's rounded up to the nearest block size.
+  static const size_t MAX_SUBQUEUE_SIZE = details::const_numeric_max<size_t>::value;
+
+#ifndef MCDBGQ_USE_RELACY
+// Memory allocation can be customized if needed.
+// malloc should return nullptr on failure, and handle alignment like std::malloc.
+#if defined(malloc) || defined(free)
+  // Gah, this is 2015, stop defining macros that break standard code already!
+  // Work around malloc/free being special macros:
+  static inline void* WORKAROUND_malloc(size_t size) {
+    return malloc(size);
+  }
+  static inline void WORKAROUND_free(void* ptr) {
+    return free(ptr);
+  }
+  static inline void*(malloc)(size_t size) {
+    return WORKAROUND_malloc(size);
+  }
+  static inline void(free)(void* ptr) {
+    return WORKAROUND_free(ptr);
+  }
+#else
+  static inline void* malloc(size_t size) {
+    return std::malloc(size);
+  }
+  static inline void free(void* ptr) {
+    return std::free(ptr);
+  }
+#endif
+#else
+  // Debug versions when running under the Relacy race detector (ignore
+  // these in user code)
+  static inline void* malloc(size_t size) {
+    return rl::rl_malloc(size, $);
+  }
+  static inline void free(void* ptr) {
+    return rl::rl_free(ptr, $);
+  }
+#endif
+};
+
+// When producing or consuming many elements, the most efficient way is to:
+//    1) Use one of the bulk-operation methods of the queue with a token
+//    2) Failing that, use the bulk-operation methods without a token
+//    3) Failing that, create a token and use that with the single-item methods
+//    4) Failing that, use the single-parameter methods of the queue
+// Having said that, don't create tokens willy-nilly -- ideally there should be
+// a maximum of one token per thread (of each kind).
+struct ProducerToken;
+struct ConsumerToken;
+
+template <typename T, typename Traits>
+class ConcurrentQueue;
+template <typename T, typename Traits>
+class BlockingConcurrentQueue;
+class ConcurrentQueueTests;
+
+namespace details {
+struct ConcurrentQueueProducerTypelessBase {
+  ConcurrentQueueProducerTypelessBase* next;
+  std::atomic<bool> inactive;
+  ProducerToken* token;
+
+  ConcurrentQueueProducerTypelessBase() : next(nullptr), inactive(false), token(nullptr) {
+  }
+};
+
+template <bool use32>
+struct _hash_32_or_64 {
+  static inline std::uint32_t hash(std::uint32_t h) {
+    // MurmurHash3 finalizer -- see https://code.google.com/p/smhasher/source/browse/trunk/MurmurHash3.cpp
+    // Since the thread ID is already unique, all we really want to do is propagate that
+    // uniqueness evenly across all the bits, so that we can use a subset of the bits while
+    // reducing collisions significantly
+    h ^= h >> 16;
+    h *= 0x85ebca6b;
+    h ^= h >> 13;
+    h *= 0xc2b2ae35;
+    return h ^ (h >> 16);
+  }
+};
+template <>
+struct _hash_32_or_64<1> {
+  static inline std::uint64_t hash(std::uint64_t h) {
+    h ^= h >> 33;
+    h *= 0xff51afd7ed558ccd;
+    h ^= h >> 33;
+    h *= 0xc4ceb9fe1a85ec53;
+    return h ^ (h >> 33);
+  }
+};
+template <std::size_t size>
+struct hash_32_or_64 : public _hash_32_or_64<(size > 4)> {};
+
+static inline size_t hash_thread_id(thread_id_t id) {
+  static_assert(sizeof(thread_id_t) <= 8, "Expected a platform where thread IDs are at most 64-bit values");
+  return static_cast<size_t>(hash_32_or_64<sizeof(thread_id_converter<thread_id_t>::thread_id_hash_t)>::hash(
+      thread_id_converter<thread_id_t>::prehash(id)));
+}
+
+template <typename T>
+static inline bool circular_less_than(T a, T b) {
+#ifdef _MSC_VER
+#pragma warning(push)
+#pragma warning(disable : 4554)
+#endif
+  static_assert(std::is_integral<T>::value && !std::numeric_limits<T>::is_signed,
+                "circular_less_than is intended to be used only with unsigned integer types");
+  return static_cast<T>(a - b) > static_cast<T>(static_cast<T>(1) << static_cast<T>(sizeof(T) * CHAR_BIT - 1));
+#ifdef _MSC_VER
+#pragma warning(pop)
+#endif
+}
+
+template <typename U>
+static inline char* align_for(char* ptr) {
+  const std::size_t alignment = std::alignment_of<U>::value;
+  return ptr + (alignment - (reinterpret_cast<std::uintptr_t>(ptr) % alignment)) % alignment;
+}
+
+template <typename T>
+static inline T ceil_to_pow_2(T x) {
+  static_assert(std::is_integral<T>::value && !std::numeric_limits<T>::is_signed,
+                "ceil_to_pow_2 is intended to be used only with unsigned integer types");
+
+  // Adapted from http://graphics.stanford.edu/~seander/bithacks.html#RoundUpPowerOf2
+  --x;
+  x |= x >> 1;
+  x |= x >> 2;
+  x |= x >> 4;
+  for (std::size_t i = 1; i < sizeof(T); i <<= 1) {
+    x |= x >> (i << 3);
+  }
+  ++x;
+  return x;
+}
+
+template <typename T>
+static inline void swap_relaxed(std::atomic<T>& left, std::atomic<T>& right) {
+  T temp = std::move(left.load(std::memory_order_relaxed));
+  left.store(std::move(right.load(std::memory_order_relaxed)), std::memory_order_relaxed);
+  right.store(std::move(temp), std::memory_order_relaxed);
+}
+
+template <typename T>
+static inline T const& nomove(T const& x) {
+  return x;
+}
+
+template <bool Enable>
+struct nomove_if {
+  template <typename T>
+  static inline T const& eval(T const& x) {
+    return x;
+  }
+};
+
+template <>
+struct nomove_if<false> {
+  template <typename U>
+  static inline auto eval(U&& x) -> decltype(std::forward<U>(x)) {
+    return std::forward<U>(x);
+  }
+};
+
+template <typename It>
+static inline auto deref_noexcept(It& it) MOODYCAMEL_NOEXCEPT -> decltype(*it) {
+  return *it;
+}
+
+#if defined(__clang__) || !defined(__GNUC__) || __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 8)
+template <typename T>
+struct is_trivially_destructible : std::is_trivially_destructible<T> {};
+#else
+template <typename T>
+struct is_trivially_destructible : std::has_trivial_destructor<T> {};
+#endif
+
+#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED
+#ifdef MCDBGQ_USE_RELACY
+typedef RelacyThreadExitListener ThreadExitListener;
+typedef RelacyThreadExitNotifier ThreadExitNotifier;
+#else
+struct ThreadExitListener {
+  typedef void (*callback_t)(void*);
+  callback_t callback;
+  void* userData;
+
+  ThreadExitListener* next;  // reserved for use by the ThreadExitNotifier
+};
+
+class ThreadExitNotifier {
+ public:
+  static void subscribe(ThreadExitListener* listener) {
+    auto& tlsInst = instance();
+    listener->next = tlsInst.tail;
+    tlsInst.tail = listener;
+  }
+
+  static void unsubscribe(ThreadExitListener* listener) {
+    auto& tlsInst = instance();
+    ThreadExitListener** prev = &tlsInst.tail;
+    for (auto ptr = tlsInst.tail; ptr != nullptr; ptr = ptr->next) {
+      if (ptr == listener) {
+        *prev = ptr->next;
+        break;
+      }
+      prev = &ptr->next;
+    }
+  }
+
+ private:
+  ThreadExitNotifier() : tail(nullptr) {
+  }
+  ThreadExitNotifier(ThreadExitNotifier const&) MOODYCAMEL_DELETE_FUNCTION;
+  ThreadExitNotifier& operator=(ThreadExitNotifier const&) MOODYCAMEL_DELETE_FUNCTION;
+
+  ~ThreadExitNotifier() {
+    // This thread is about to exit, let everyone know!
+    assert(this == &instance() &&
+           "If this assert fails, you likely have a buggy compiler! Change the preprocessor conditions such that "
+           "MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED is no longer defined.");
+    for (auto ptr = tail; ptr != nullptr; ptr = ptr->next) {
+      ptr->callback(ptr->userData);
+    }
+  }
+
+  // Thread-local
+  static inline ThreadExitNotifier& instance() {
+    static thread_local ThreadExitNotifier notifier;
+    return notifier;
+  }
+
+ private:
+  ThreadExitListener* tail;
+};
+#endif
+#endif
+
+template <typename T>
+struct static_is_lock_free_num {
+  enum { value = 0 };
+};
+template <>
+struct static_is_lock_free_num<signed char> {
+  enum { value = ATOMIC_CHAR_LOCK_FREE };
+};
+template <>
+struct static_is_lock_free_num<short> {
+  enum { value = ATOMIC_SHORT_LOCK_FREE };
+};
+template <>
+struct static_is_lock_free_num<int> {
+  enum { value = ATOMIC_INT_LOCK_FREE };
+};
+template <>
+struct static_is_lock_free_num<long> {
+  enum { value = ATOMIC_LONG_LOCK_FREE };
+};
+template <>
+struct static_is_lock_free_num<long long> {
+  enum { value = ATOMIC_LLONG_LOCK_FREE };
+};
+template <typename T>
+struct static_is_lock_free : static_is_lock_free_num<typename std::make_signed<T>::type> {};
+template <>
+struct static_is_lock_free<bool> {
+  enum { value = ATOMIC_BOOL_LOCK_FREE };
+};
+template <typename U>
+struct static_is_lock_free<U*> {
+  enum { value = ATOMIC_POINTER_LOCK_FREE };
+};
+}  // namespace details
+
+struct ProducerToken {
+  template <typename T, typename Traits>
+  explicit ProducerToken(ConcurrentQueue<T, Traits>& queue);
+
+  template <typename T, typename Traits>
+  explicit ProducerToken(BlockingConcurrentQueue<T, Traits>& queue);
+
+  ProducerToken(ProducerToken&& other) MOODYCAMEL_NOEXCEPT : producer(other.producer) {
+    other.producer = nullptr;
+    if (producer != nullptr) {
+      producer->token = this;
+    }
+  }
+
+  inline ProducerToken& operator=(ProducerToken&& other) MOODYCAMEL_NOEXCEPT {
+    swap(other);
+    return *this;
+  }
+
+  void swap(ProducerToken& other) MOODYCAMEL_NOEXCEPT {
+    std::swap(producer, other.producer);
+    if (producer != nullptr) {
+      producer->token = this;
+    }
+    if (other.producer != nullptr) {
+      other.producer->token = &other;
+    }
+  }
+
+  // A token is always valid unless:
+  //     1) Memory allocation failed during construction
+  //     2) It was moved via the move constructor
+  //        (Note: assignment does a swap, leaving both potentially valid)
+  //     3) The associated queue was destroyed
+  // Note that if valid() returns true, that only indicates
+  // that the token is valid for use with a specific queue,
+  // but not which one; that's up to the user to track.
+  inline bool valid() const {
+    return producer != nullptr;
+  }
+
+  ~ProducerToken() {
+    if (producer != nullptr) {
+      producer->token = nullptr;
+      producer->inactive.store(true, std::memory_order_release);
+    }
+  }
+
+  // Disable copying and assignment
+  ProducerToken(ProducerToken const&) MOODYCAMEL_DELETE_FUNCTION;
+  ProducerToken& operator=(ProducerToken const&) MOODYCAMEL_DELETE_FUNCTION;
+
+ private:
+  template <typename T, typename Traits>
+  friend class ConcurrentQueue;
+  friend class ConcurrentQueueTests;
+
+ protected:
+  details::ConcurrentQueueProducerTypelessBase* producer;
+};
+
+struct ConsumerToken {
+  template <typename T, typename Traits>
+  explicit ConsumerToken(ConcurrentQueue<T, Traits>& q);
+
+  template <typename T, typename Traits>
+  explicit ConsumerToken(BlockingConcurrentQueue<T, Traits>& q);
+
+  ConsumerToken(ConsumerToken&& other) MOODYCAMEL_NOEXCEPT : initialOffset(other.initialOffset),
+                                                             lastKnownGlobalOffset(other.lastKnownGlobalOffset),
+                                                             itemsConsumedFromCurrent(other.itemsConsumedFromCurrent),
+                                                             currentProducer(other.currentProducer),
+                                                             desiredProducer(other.desiredProducer) {
+  }
+
+  inline ConsumerToken& operator=(ConsumerToken&& other) MOODYCAMEL_NOEXCEPT {
+    swap(other);
+    return *this;
+  }
+
+  void swap(ConsumerToken& other) MOODYCAMEL_NOEXCEPT {
+    std::swap(initialOffset, other.initialOffset);
+    std::swap(lastKnownGlobalOffset, other.lastKnownGlobalOffset);
+    std::swap(itemsConsumedFromCurrent, other.itemsConsumedFromCurrent);
+    std::swap(currentProducer, other.currentProducer);
+    std::swap(desiredProducer, other.desiredProducer);
+  }
+
+  // Disable copying and assignment
+  ConsumerToken(ConsumerToken const&) MOODYCAMEL_DELETE_FUNCTION;
+  ConsumerToken& operator=(ConsumerToken const&) MOODYCAMEL_DELETE_FUNCTION;
+
+ private:
+  template <typename T, typename Traits>
+  friend class ConcurrentQueue;
+  friend class ConcurrentQueueTests;
+
+ private:  // but shared with ConcurrentQueue
+  std::uint32_t initialOffset;
+  std::uint32_t lastKnownGlobalOffset;
+  std::uint32_t itemsConsumedFromCurrent;
+  details::ConcurrentQueueProducerTypelessBase* currentProducer;
+  details::ConcurrentQueueProducerTypelessBase* desiredProducer;
+};
+
+// Need to forward-declare this swap because it's in a namespace.
+// See http://stackoverflow.com/questions/4492062/why-does-a-c-friend-class-need-a-forward-declaration-only-in-other-namespaces
+template <typename T, typename Traits>
+inline void swap(typename ConcurrentQueue<T, Traits>::ImplicitProducerKVP& a,
+                 typename ConcurrentQueue<T, Traits>::ImplicitProducerKVP& b) MOODYCAMEL_NOEXCEPT;
+
+template <typename T, typename Traits = ConcurrentQueueDefaultTraits>
+class ConcurrentQueue {
+ public:
+  typedef ::moodycamel::ProducerToken producer_token_t;
+  typedef ::moodycamel::ConsumerToken consumer_token_t;
+
+  typedef typename Traits::index_t index_t;
+  typedef typename Traits::size_t size_t;
+
+  static const size_t BLOCK_SIZE = static_cast<size_t>(Traits::BLOCK_SIZE);
+  static const size_t EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD =
+      static_cast<size_t>(Traits::EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD);
+  static const size_t EXPLICIT_INITIAL_INDEX_SIZE = static_cast<size_t>(Traits::EXPLICIT_INITIAL_INDEX_SIZE);
+  static const size_t IMPLICIT_INITIAL_INDEX_SIZE = static_cast<size_t>(Traits::IMPLICIT_INITIAL_INDEX_SIZE);
+  static const size_t INITIAL_IMPLICIT_PRODUCER_HASH_SIZE =
+      static_cast<size_t>(Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE);
+  static const std::uint32_t EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE =
+      static_cast<std::uint32_t>(Traits::EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE);
+#ifdef _MSC_VER
+#pragma warning(push)
+#pragma warning(disable : 4307)  // + integral constant overflow (that's what the ternary expression is for!)
+#pragma warning(disable : 4309)  // static_cast: Truncation of constant value
+#endif
+  static const size_t MAX_SUBQUEUE_SIZE =
+      (details::const_numeric_max<size_t>::value - static_cast<size_t>(Traits::MAX_SUBQUEUE_SIZE) < BLOCK_SIZE)
+          ? details::const_numeric_max<size_t>::value
+          : ((static_cast<size_t>(Traits::MAX_SUBQUEUE_SIZE) + (BLOCK_SIZE - 1)) / BLOCK_SIZE * BLOCK_SIZE);
+#ifdef _MSC_VER
+#pragma warning(pop)
+#endif
+
+  static_assert(!std::numeric_limits<size_t>::is_signed && std::is_integral<size_t>::value,
+                "Traits::size_t must be an unsigned integral type");
+  static_assert(!std::numeric_limits<index_t>::is_signed && std::is_integral<index_t>::value,
+                "Traits::index_t must be an unsigned integral type");
+  static_assert(sizeof(index_t) >= sizeof(size_t), "Traits::index_t must be at least as wide as Traits::size_t");
+  static_assert((BLOCK_SIZE > 1) && !(BLOCK_SIZE & (BLOCK_SIZE - 1)),
+                "Traits::BLOCK_SIZE must be a power of 2 (and at least 2)");
+  static_assert((EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD > 1) &&
+                    !(EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD & (EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD - 1)),
+                "Traits::EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD must be a power of 2 (and greater than 1)");
+  static_assert((EXPLICIT_INITIAL_INDEX_SIZE > 1) && !(EXPLICIT_INITIAL_INDEX_SIZE & (EXPLICIT_INITIAL_INDEX_SIZE - 1)),
+                "Traits::EXPLICIT_INITIAL_INDEX_SIZE must be a power of 2 (and greater than 1)");
+  static_assert((IMPLICIT_INITIAL_INDEX_SIZE > 1) && !(IMPLICIT_INITIAL_INDEX_SIZE & (IMPLICIT_INITIAL_INDEX_SIZE - 1)),
+                "Traits::IMPLICIT_INITIAL_INDEX_SIZE must be a power of 2 (and greater than 1)");
+  static_assert((INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0) ||
+                    !(INITIAL_IMPLICIT_PRODUCER_HASH_SIZE & (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE - 1)),
+                "Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE must be a power of 2");
+  static_assert(INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0 || INITIAL_IMPLICIT_PRODUCER_HASH_SIZE >= 1,
+                "Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE must be at least 1 (or 0 to disable implicit enqueueing)");
+
+ public:
+  // Creates a queue with at least `capacity` element slots; note that the
+  // actual number of elements that can be inserted without additional memory
+  // allocation depends on the number of producers and the block size (e.g. if
+  // the block size is equal to `capacity`, only a single block will be allocated
+  // up-front, which means only a single producer will be able to enqueue elements
+  // without an extra allocation -- blocks aren't shared between producers).
+  // This method is not thread safe -- it is up to the user to ensure that the
+  // queue is fully constructed before it starts being used by other threads (this
+  // includes making the memory effects of construction visible, possibly with a
+  // memory barrier).
+  explicit ConcurrentQueue(size_t capacity = 6 * BLOCK_SIZE)
+      : producerListTail(nullptr)
+      , producerCount(0)
+      , initialBlockPoolIndex(0)
+      , nextExplicitConsumerId(0)
+      , globalExplicitConsumerOffset(0) {
+    implicitProducerHashResizeInProgress.clear(std::memory_order_relaxed);
+    populate_initial_implicit_producer_hash();
+    populate_initial_block_list(capacity / BLOCK_SIZE + ((capacity & (BLOCK_SIZE - 1)) == 0 ? 0 : 1));
+
+#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG
+    // Track all the producers using a fully-resolved typed list for
+    // each kind; this makes it possible to debug them starting from
+    // the root queue object (otherwise wacky casts are needed that
+    // don't compile in the debugger's expression evaluator).
+    explicitProducers.store(nullptr, std::memory_order_relaxed);
+    implicitProducers.store(nullptr, std::memory_order_relaxed);
+#endif
+  }
+
+  // Computes the correct amount of pre-allocated blocks for you based
+  // on the minimum number of elements you want available at any given
+  // time, and the maximum concurrent number of each type of producer.
+  ConcurrentQueue(size_t minCapacity, size_t maxExplicitProducers, size_t maxImplicitProducers)
+      : producerListTail(nullptr)
+      , producerCount(0)
+      , initialBlockPoolIndex(0)
+      , nextExplicitConsumerId(0)
+      , globalExplicitConsumerOffset(0) {
+    implicitProducerHashResizeInProgress.clear(std::memory_order_relaxed);
+    populate_initial_implicit_producer_hash();
+    size_t blocks = (((minCapacity + BLOCK_SIZE - 1) / BLOCK_SIZE) - 1) * (maxExplicitProducers + 1) +
+                    2 * (maxExplicitProducers + maxImplicitProducers);
+    populate_initial_block_list(blocks);
+
+#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG
+    explicitProducers.store(nullptr, std::memory_order_relaxed);
+    implicitProducers.store(nullptr, std::memory_order_relaxed);
+#endif
+  }
+
+  // Note: The queue should not be accessed concurrently while it's
+  // being deleted. It's up to the user to synchronize this.
+  // This method is not thread safe.
+  ~ConcurrentQueue() {
+    // Destroy producers
+    auto ptr = producerListTail.load(std::memory_order_relaxed);
+    while (ptr != nullptr) {
+      auto next = ptr->next_prod();
+      if (ptr->token != nullptr) {
+        ptr->token->producer = nullptr;
+      }
+      destroy(ptr);
+      ptr = next;
+    }
+
+    // Destroy implicit producer hash tables
+    if (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE != 0) {
+      auto hash = implicitProducerHash.load(std::memory_order_relaxed);
+      while (hash != nullptr) {
+        auto prev = hash->prev;
+        if (prev != nullptr) {  // The last hash is part of this object and was not allocated dynamically
+          for (size_t i = 0; i != hash->capacity; ++i) {
+            hash->entries[i].~ImplicitProducerKVP();
+          }
+          hash->~ImplicitProducerHash();
+          (Traits::free)(hash);
+        }
+        hash = prev;
+      }
+    }
+
+    // Destroy global free list
+    auto block = freeList.head_unsafe();
+    while (block != nullptr) {
+      auto next = block->freeListNext.load(std::memory_order_relaxed);
+      if (block->dynamicallyAllocated) {
+        destroy(block);
+      }
+      block = next;
+    }
+
+    // Destroy initial free list
+    destroy_array(initialBlockPool, initialBlockPoolSize);
+  }
+
+  // Disable copying and copy assignment
+  ConcurrentQueue(ConcurrentQueue const&) MOODYCAMEL_DELETE_FUNCTION;
+  ConcurrentQueue& operator=(ConcurrentQueue const&) MOODYCAMEL_DELETE_FUNCTION;
+
+  // Moving is supported, but note that it is *not* a thread-safe operation.
+  // Nobody can use the queue while it's being moved, and the memory effects
+  // of that move must be propagated to other threads before they can use it.
+  // Note: When a queue is moved, its tokens are still valid but can only be
+  // used with the destination queue (i.e. semantically they are moved along
+  // with the queue itself).
+  ConcurrentQueue(ConcurrentQueue&& other) MOODYCAMEL_NOEXCEPT
+      : producerListTail(other.producerListTail.load(std::memory_order_relaxed)),
+        producerCount(other.producerCount.load(std::memory_order_relaxed)),
+        initialBlockPoolIndex(other.initialBlockPoolIndex.load(std::memory_order_relaxed)),
+        initialBlockPool(other.initialBlockPool),
+        initialBlockPoolSize(other.initialBlockPoolSize),
+        freeList(std::move(other.freeList)),
+        nextExplicitConsumerId(other.nextExplicitConsumerId.load(std::memory_order_relaxed)),
+        globalExplicitConsumerOffset(other.globalExplicitConsumerOffset.load(std::memory_order_relaxed)) {
+    // Move the other one into this, and leave the other one as an empty queue
+    implicitProducerHashResizeInProgress.clear(std::memory_order_relaxed);
+    populate_initial_implicit_producer_hash();
+    swap_implicit_producer_hashes(other);
+
+    other.producerListTail.store(nullptr, std::memory_order_relaxed);
+    other.producerCount.store(0, std::memory_order_relaxed);
+    other.nextExplicitConsumerId.store(0, std::memory_order_relaxed);
+    other.globalExplicitConsumerOffset.store(0, std::memory_order_relaxed);
+
+#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG
+    explicitProducers.store(other.explicitProducers.load(std::memory_order_relaxed), std::memory_order_relaxed);
+    other.explicitProducers.store(nullptr, std::memory_order_relaxed);
+    implicitProducers.store(other.implicitProducers.load(std::memory_order_relaxed), std::memory_order_relaxed);
+    other.implicitProducers.store(nullptr, std::memory_order_relaxed);
+#endif
+
+    other.initialBlockPoolIndex.store(0, std::memory_order_relaxed);
+    other.initialBlockPoolSize = 0;
+    other.initialBlockPool = nullptr;
+
+    reown_producers();
+  }
+
+  inline ConcurrentQueue& operator=(ConcurrentQueue&& other) MOODYCAMEL_NOEXCEPT {
+    return swap_internal(other);
+  }
+
+  // Swaps this queue's state with the other's. Not thread-safe.
+  // Swapping two queues does not invalidate their tokens, however
+  // the tokens that were created for one queue must be used with
+  // only the swapped queue (i.e. the tokens are tied to the
+  // queue's movable state, not the object itself).
+  inline void swap(ConcurrentQueue& other) MOODYCAMEL_NOEXCEPT {
+    swap_internal(other);
+  }
+
+ private:
+  ConcurrentQueue& swap_internal(ConcurrentQueue& other) {
+    if (this == &other) {
+      return *this;
+    }
+
+    details::swap_relaxed(producerListTail, other.producerListTail);
+    details::swap_relaxed(producerCount, other.producerCount);
+    details::swap_relaxed(initialBlockPoolIndex, other.initialBlockPoolIndex);
+    std::swap(initialBlockPool, other.initialBlockPool);
+    std::swap(initialBlockPoolSize, other.initialBlockPoolSize);
+    freeList.swap(other.freeList);
+    details::swap_relaxed(nextExplicitConsumerId, other.nextExplicitConsumerId);
+    details::swap_relaxed(globalExplicitConsumerOffset, other.globalExplicitConsumerOffset);
+
+    swap_implicit_producer_hashes(other);
+
+    reown_producers();
+    other.reown_producers();
+
+#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG
+    details::swap_relaxed(explicitProducers, other.explicitProducers);
+    details::swap_relaxed(implicitProducers, other.implicitProducers);
+#endif
+
+    return *this;
+  }
+
+ public:
+  // Enqueues a single item (by copying it).
+  // Allocates memory if required. Only fails if memory allocation fails (or implicit
+  // production is disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE is 0,
+  // or Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).
+  // Thread-safe.
+  inline bool enqueue(T const& item) {
+    if (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0)
+      return false;
+    return inner_enqueue<CanAlloc>(item);
+  }
+
+  // Enqueues a single item (by moving it, if possible).
+  // Allocates memory if required. Only fails if memory allocation fails (or implicit
+  // production is disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE is 0,
+  // or Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).
+  // Thread-safe.
+  inline bool enqueue(T&& item) {
+    if (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0)
+      return false;
+    return inner_enqueue<CanAlloc>(std::move(item));
+  }
+
+  // Enqueues a single item (by copying it) using an explicit producer token.
+  // Allocates memory if required. Only fails if memory allocation fails (or
+  // Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).
+  // Thread-safe.
+  inline bool enqueue(producer_token_t const& token, T const& item) {
+    return inner_enqueue<CanAlloc>(token, item);
+  }
+
+  // Enqueues a single item (by moving it, if possible) using an explicit producer token.
+  // Allocates memory if required. Only fails if memory allocation fails (or
+  // Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).
+  // Thread-safe.
+  inline bool enqueue(producer_token_t const& token, T&& item) {
+    return inner_enqueue<CanAlloc>(token, std::move(item));
+  }
+
+  // Enqueues several items.
+  // Allocates memory if required. Only fails if memory allocation fails (or
+  // implicit production is disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE
+  // is 0, or Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).
+  // Note: Use std::make_move_iterator if the elements should be moved instead of copied.
+  // Thread-safe.
+  template <typename It>
+  bool enqueue_bulk(It itemFirst, size_t count) {
+    if (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0)
+      return false;
+    return inner_enqueue_bulk<CanAlloc>(itemFirst, count);
+  }
+
+  // Enqueues several items using an explicit producer token.
+  // Allocates memory if required. Only fails if memory allocation fails
+  // (or Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).
+  // Note: Use std::make_move_iterator if the elements should be moved
+  // instead of copied.
+  // Thread-safe.
+  template <typename It>
+  bool enqueue_bulk(producer_token_t const& token, It itemFirst, size_t count) {
+    return inner_enqueue_bulk<CanAlloc>(token, itemFirst, count);
+  }
+
+  // Enqueues a single item (by copying it).
+  // Does not allocate memory. Fails if not enough room to enqueue (or implicit
+  // production is disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE
+  // is 0).
+  // Thread-safe.
+  inline bool try_enqueue(T const& item) {
+    if (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0)
+      return false;
+    return inner_enqueue<CannotAlloc>(item);
+  }
+
+  // Enqueues a single item (by moving it, if possible).
+  // Does not allocate memory (except for one-time implicit producer).
+  // Fails if not enough room to enqueue (or implicit production is
+  // disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE is 0).
+  // Thread-safe.
+  inline bool try_enqueue(T&& item) {
+    if (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0)
+      return false;
+    return inner_enqueue<CannotAlloc>(std::move(item));
+  }
+
+  // Enqueues a single item (by copying it) using an explicit producer token.
+  // Does not allocate memory. Fails if not enough room to enqueue.
+  // Thread-safe.
+  inline bool try_enqueue(producer_token_t const& token, T const& item) {
+    return inner_enqueue<CannotAlloc>(token, item);
+  }
+
+  // Enqueues a single item (by moving it, if possible) using an explicit producer token.
+  // Does not allocate memory. Fails if not enough room to enqueue.
+  // Thread-safe.
+  inline bool try_enqueue(producer_token_t const& token, T&& item) {
+    return inner_enqueue<CannotAlloc>(token, std::move(item));
+  }
+
+  // Enqueues several items.
+  // Does not allocate memory (except for one-time implicit producer).
+  // Fails if not enough room to enqueue (or implicit production is
+  // disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE is 0).
+  // Note: Use std::make_move_iterator if the elements should be moved
+  // instead of copied.
+  // Thread-safe.
+  template <typename It>
+  bool try_enqueue_bulk(It itemFirst, size_t count) {
+    if (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0)
+      return false;
+    return inner_enqueue_bulk<CannotAlloc>(itemFirst, count);
+  }
+
+  // Enqueues several items using an explicit producer token.
+  // Does not allocate memory. Fails if not enough room to enqueue.
+  // Note: Use std::make_move_iterator if the elements should be moved
+  // instead of copied.
+  // Thread-safe.
+  template <typename It>
+  bool try_enqueue_bulk(producer_token_t const& token, It itemFirst, size_t count) {
+    return inner_enqueue_bulk<CannotAlloc>(token, itemFirst, count);
+  }
+
+  // Attempts to dequeue from the queue.
+  // Returns false if all producer streams appeared empty at the time they
+  // were checked (so, the queue is likely but not guaranteed to be empty).
+  // Never allocates. Thread-safe.
+  template <typename U>
+  bool try_dequeue(U& item) {
+    // Instead of simply trying each producer in turn (which could cause needless contention on the first
+    // producer), we score them heuristically.
+    size_t nonEmptyCount = 0;
+    ProducerBase* best = nullptr;
+    size_t bestSize = 0;
+    for (auto ptr = producerListTail.load(std::memory_order_acquire); nonEmptyCount < 3 && ptr != nullptr;
+         ptr = ptr->next_prod()) {
+      auto size = ptr->size_approx();
+      if (size > 0) {
+        if (size > bestSize) {
+          bestSize = size;
+          best = ptr;
+        }
+        ++nonEmptyCount;
+      }
+    }
+
+    // If there was at least one non-empty queue but it appears empty at the time
+    // we try to dequeue from it, we need to make sure every queue's been tried
+    if (nonEmptyCount > 0) {
+      if (details::likely(best->dequeue(item))) {
+        return true;
+      }
+      for (auto ptr = producerListTail.load(std::memory_order_acquire); ptr != nullptr; ptr = ptr->next_prod()) {
+        if (ptr != best && ptr->dequeue(item)) {
+          return true;
+        }
+      }
+    }
+    return false;
+  }
+
+  // Attempts to dequeue from the queue.
+  // Returns false if all producer streams appeared empty at the time they
+  // were checked (so, the queue is likely but not guaranteed to be empty).
+  // This differs from the try_dequeue(item) method in that this one does
+  // not attempt to reduce contention by interleaving the order that producer
+  // streams are dequeued from. So, using this method can reduce overall throughput
+  // under contention, but will give more predictable results in single-threaded
+  // consumer scenarios. This is mostly only useful for internal unit tests.
+  // Never allocates. Thread-safe.
+  template <typename U>
+  bool try_dequeue_non_interleaved(U& item) {
+    for (auto ptr = producerListTail.load(std::memory_order_acquire); ptr != nullptr; ptr = ptr->next_prod()) {
+      if (ptr->dequeue(item)) {
+        return true;
+      }
+    }
+    return false;
+  }
+
+  // Attempts to dequeue from the queue using an explicit consumer token.
+  // Returns false if all producer streams appeared empty at the time they
+  // were checked (so, the queue is likely but not guaranteed to be empty).
+  // Never allocates. Thread-safe.
+  template <typename U>
+  bool try_dequeue(consumer_token_t& token, U& item) {
+    // The idea is roughly as follows:
+    // Every 256 items from one producer, make everyone rotate (increase the global offset) -> this means the highest efficiency consumer dictates the rotation speed of everyone else, more or less
+    // If you see that the global offset has changed, you must reset your consumption counter and move to your designated place
+    // If there's no items where you're supposed to be, keep moving until you find a producer with some items
+    // If the global offset has not changed but you've run out of items to consume, move over from your current position until you find an producer with something in it
+
+    if (token.desiredProducer == nullptr ||
+        token.lastKnownGlobalOffset != globalExplicitConsumerOffset.load(std::memory_order_relaxed)) {
+      if (!update_current_producer_after_rotation(token)) {
+        return false;
+      }
+    }
+
+    // If there was at least one non-empty queue but it appears empty at the time
+    // we try to dequeue from it, we need to make sure every queue's been tried
+    if (static_cast<ProducerBase*>(token.currentProducer)->dequeue(item)) {
+      if (++token.itemsConsumedFromCurrent == EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE) {
+        globalExplicitConsumerOffset.fetch_add(1, std::memory_order_relaxed);
+      }
+      return true;
+    }
+
+    auto tail = producerListTail.load(std::memory_order_acquire);
+    auto ptr = static_cast<ProducerBase*>(token.currentProducer)->next_prod();
+    if (ptr == nullptr) {
+      ptr = tail;
+    }
+    while (ptr != static_cast<ProducerBase*>(token.currentProducer)) {
+      if (ptr->dequeue(item)) {
+        token.currentProducer = ptr;
+        token.itemsConsumedFromCurrent = 1;
+        return true;
+      }
+      ptr = ptr->next_prod();
+      if (ptr == nullptr) {
+        ptr = tail;
+      }
+    }
+    return false;
+  }
+
+  // Attempts to dequeue several elements from the queue.
+  // Returns the number of items actually dequeued.
+  // Returns 0 if all producer streams appeared empty at the time they
+  // were checked (so, the queue is likely but not guaranteed to be empty).
+  // Never allocates. Thread-safe.
+  template <typename It>
+  size_t try_dequeue_bulk(It itemFirst, size_t max) {
+    size_t count = 0;
+    for (auto ptr = producerListTail.load(std::memory_order_acquire); ptr != nullptr; ptr = ptr->next_prod()) {
+      count += ptr->dequeue_bulk(itemFirst, max - count);
+      if (count == max) {
+        break;
+      }
+    }
+    return count;
+  }
+
+  // Attempts to dequeue several elements from the queue using an explicit consumer token.
+  // Returns the number of items actually dequeued.
+  // Returns 0 if all producer streams appeared empty at the time they
+  // were checked (so, the queue is likely but not guaranteed to be empty).
+  // Never allocates. Thread-safe.
+  template <typename It>
+  size_t try_dequeue_bulk(consumer_token_t& token, It itemFirst, size_t max) {
+    if (token.desiredProducer == nullptr ||
+        token.lastKnownGlobalOffset != globalExplicitConsumerOffset.load(std::memory_order_relaxed)) {
+      if (!update_current_producer_after_rotation(token)) {
+        return 0;
+      }
+    }
+
+    size_t count = static_cast<ProducerBase*>(token.currentProducer)->dequeue_bulk(itemFirst, max);
+    if (count == max) {
+      if ((token.itemsConsumedFromCurrent += static_cast<std::uint32_t>(max)) >=
+          EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE) {
+        globalExplicitConsumerOffset.fetch_add(1, std::memory_order_relaxed);
+      }
+      return max;
+    }
+    token.itemsConsumedFromCurrent += static_cast<std::uint32_t>(count);
+    max -= count;
+
+    auto tail = producerListTail.load(std::memory_order_acquire);
+    auto ptr = static_cast<ProducerBase*>(token.currentProducer)->next_prod();
+    if (ptr == nullptr) {
+      ptr = tail;
+    }
+    while (ptr != static_cast<ProducerBase*>(token.currentProducer)) {
+      auto dequeued = ptr->dequeue_bulk(itemFirst, max);
+      count += dequeued;
+      if (dequeued != 0) {
+        token.currentProducer = ptr;
+        token.itemsConsumedFromCurrent = static_cast<std::uint32_t>(dequeued);
+      }
+      if (dequeued == max) {
+        break;
+      }
+      max -= dequeued;
+      ptr = ptr->next_prod();
+      if (ptr == nullptr) {
+        ptr = tail;
+      }
+    }
+    return count;
+  }
+
+  // Attempts to dequeue from a specific producer's inner queue.
+  // If you happen to know which producer you want to dequeue from, this
+  // is significantly faster than using the general-case try_dequeue methods.
+  // Returns false if the producer's queue appeared empty at the time it
+  // was checked (so, the queue is likely but not guaranteed to be empty).
+  // Never allocates. Thread-safe.
+  template <typename U>
+  inline bool try_dequeue_from_producer(producer_token_t const& producer, U& item) {
+    return static_cast<ExplicitProducer*>(producer.producer)->dequeue(item);
+  }
+
+  // Attempts to dequeue several elements from a specific producer's inner queue.
+  // Returns the number of items actually dequeued.
+  // If you happen to know which producer you want to dequeue from, this
+  // is significantly faster than using the general-case try_dequeue methods.
+  // Returns 0 if the producer's queue appeared empty at the time it
+  // was checked (so, the queue is likely but not guaranteed to be empty).
+  // Never allocates. Thread-safe.
+  template <typename It>
+  inline size_t try_dequeue_bulk_from_producer(producer_token_t const& producer, It itemFirst, size_t max) {
+    return static_cast<ExplicitProducer*>(producer.producer)->dequeue_bulk(itemFirst, max);
+  }
+
+  // Returns an estimate of the total number of elements currently in the queue. This
+  // estimate is only accurate if the queue has completely stabilized before it is called
+  // (i.e. all enqueue and dequeue operations have completed and their memory effects are
+  // visible on the calling thread, and no further operations start while this method is
+  // being called).
+  // Thread-safe.
+  size_t size_approx() const {
+    size_t size = 0;
+    for (auto ptr = producerListTail.load(std::memory_order_acquire); ptr != nullptr; ptr = ptr->next_prod()) {
+      size += ptr->size_approx();
+    }
+    return size;
+  }
+
+  // Returns true if the underlying atomic variables used by
+  // the queue are lock-free (they should be on most platforms).
+  // Thread-safe.
+  static bool is_lock_free() {
+    return details::static_is_lock_free<bool>::value == 2 && details::static_is_lock_free<size_t>::value == 2 &&
+           details::static_is_lock_free<std::uint32_t>::value == 2 &&
+           details::static_is_lock_free<index_t>::value == 2 && details::static_is_lock_free<void*>::value == 2 &&
+           details::static_is_lock_free<
+               typename details::thread_id_converter<details::thread_id_t>::thread_id_numeric_size_t>::value == 2;
+  }
+
+ private:
+  friend struct ProducerToken;
+  friend struct ConsumerToken;
+  friend struct ExplicitProducer;
+  friend class ConcurrentQueueTests;
+
+  enum AllocationMode { CanAlloc, CannotAlloc };
+
+  ///////////////////////////////
+  // Queue methods
+  ///////////////////////////////
+
+  template <AllocationMode canAlloc, typename U>
+  inline bool inner_enqueue(producer_token_t const& token, U&& element) {
+    return static_cast<ExplicitProducer*>(token.producer)
+        ->ConcurrentQueue::ExplicitProducer::template enqueue<canAlloc>(std::forward<U>(element));
+  }
+
+  template <AllocationMode canAlloc, typename U>
+  inline bool inner_enqueue(U&& element) {
+    auto producer = get_or_add_implicit_producer();
+    return producer == nullptr
+               ? false
+               : producer->ConcurrentQueue::ImplicitProducer::template enqueue<canAlloc>(std::forward<U>(element));
+  }
+
+  template <AllocationMode canAlloc, typename It>
+  inline bool inner_enqueue_bulk(producer_token_t const& token, It itemFirst, size_t count) {
+    return static_cast<ExplicitProducer*>(token.producer)
+        ->ConcurrentQueue::ExplicitProducer::template enqueue_bulk<canAlloc>(itemFirst, count);
+  }
+
+  template <AllocationMode canAlloc, typename It>
+  inline bool inner_enqueue_bulk(It itemFirst, size_t count) {
+    auto producer = get_or_add_implicit_producer();
+    return producer == nullptr
+               ? false
+               : producer->ConcurrentQueue::ImplicitProducer::template enqueue_bulk<canAlloc>(itemFirst, count);
+  }
+
+  inline bool update_current_producer_after_rotation(consumer_token_t& token) {
+    // Ah, there's been a rotation, figure out where we should be!
+    auto tail = producerListTail.load(std::memory_order_acquire);
+    if (token.desiredProducer == nullptr && tail == nullptr) {
+      return false;
+    }
+    auto prodCount = producerCount.load(std::memory_order_relaxed);
+    auto globalOffset = globalExplicitConsumerOffset.load(std::memory_order_relaxed);
+    if (details::unlikely(token.desiredProducer == nullptr)) {
+      // Aha, first time we're dequeueing anything.
+      // Figure out our local position
+      // Note: offset is from start, not end, but we're traversing from end -- subtract from count first
+      std::uint32_t offset = prodCount - 1 - (token.initialOffset % prodCount);
+      token.desiredProducer = tail;
+      for (std::uint32_t i = 0; i != offset; ++i) {
+        token.desiredProducer = static_cast<ProducerBase*>(token.desiredProducer)->next_prod();
+        if (token.desiredProducer == nullptr) {
+          token.desiredProducer = tail;
+        }
+      }
+    }
+
+    std::uint32_t delta = globalOffset - token.lastKnownGlobalOffset;
+    if (delta >= prodCount) {
+      delta = delta % prodCount;
+    }
+    for (std::uint32_t i = 0; i != delta; ++i) {
+      token.desiredProducer = static_cast<ProducerBase*>(token.desiredProducer)->next_prod();
+      if (token.desiredProducer == nullptr) {
+        token.desiredProducer = tail;
+      }
+    }
+
+    token.lastKnownGlobalOffset = globalOffset;
+    token.currentProducer = token.desiredProducer;
+    token.itemsConsumedFromCurrent = 0;
+    return true;
+  }
+
+  ///////////////////////////
+  // Free list
+  ///////////////////////////
+
+  template <typename N>
+  struct FreeListNode {
+    FreeListNode() : freeListRefs(0), freeListNext(nullptr) {
+    }
+
+    std::atomic<std::uint32_t> freeListRefs;
+    std::atomic<N*> freeListNext;
+  };
+
+  // A simple CAS-based lock-free free list. Not the fastest thing in the world under heavy contention, but
+  // simple and correct (assuming nodes are never freed until after the free list is destroyed), and fairly
+  // speedy under low contention.
+  template <typename N>  // N must inherit FreeListNode or have the same fields (and initialization of them)
+  struct FreeList {
+    FreeList() : freeListHead(nullptr) {
+    }
+    FreeList(FreeList&& other) : freeListHead(other.freeListHead.load(std::memory_order_relaxed)) {
+      other.freeListHead.store(nullptr, std::memory_order_relaxed);
+    }
+    void swap(FreeList& other) {
+      details::swap_relaxed(freeListHead, other.freeListHead);
+    }
+
+    FreeList(FreeList const&) MOODYCAMEL_DELETE_FUNCTION;
+    FreeList& operator=(FreeList const&) MOODYCAMEL_DELETE_FUNCTION;
+
+    inline void add(N* node) {
+#if MCDBGQ_NOLOCKFREE_FREELIST
+      debug::DebugLock lock(mutex);
+#endif
+      // We know that the should-be-on-freelist bit is 0 at this point, so it's safe to
+      // set it using a fetch_add
+      if (node->freeListRefs.fetch_add(SHOULD_BE_ON_FREELIST, std::memory_order_acq_rel) == 0) {
+        // Oh look! We were the last ones referencing this node, and we know
+        // we want to add it to the free list, so let's do it!
+        add_knowing_refcount_is_zero(node);
+      }
+    }
+
+    inline N* try_get() {
+#if MCDBGQ_NOLOCKFREE_FREELIST
+      debug::DebugLock lock(mutex);
+#endif
+      auto head = freeListHead.load(std::memory_order_acquire);
+      while (head != nullptr) {
+        auto prevHead = head;
+        auto refs = head->freeListRefs.load(std::memory_order_relaxed);
+        if ((refs & REFS_MASK) == 0 || !head->freeListRefs.compare_exchange_strong(
+                                           refs, refs + 1, std::memory_order_acquire, std::memory_order_relaxed)) {
+          head = freeListHead.load(std::memory_order_acquire);
+          continue;
+        }
+
+        // Good, reference count has been incremented (it wasn't at zero), which means we can read the
+        // next and not worry about it changing between now and the time we do the CAS
+        auto next = head->freeListNext.load(std::memory_order_relaxed);
+        if (freeListHead.compare_exchange_strong(head, next, std::memory_order_acquire, std::memory_order_relaxed)) {
+          // Yay, got the node. This means it was on the list, which means shouldBeOnFreeList must be false no
+          // matter the refcount (because nobody else knows it's been taken off yet, it can't have been put back on).
+          assert((head->freeListRefs.load(std::memory_order_relaxed) & SHOULD_BE_ON_FREELIST) == 0);
+
+          // Decrease refcount twice, once for our ref, and once for the list's ref
+          head->freeListRefs.fetch_sub(2, std::memory_order_release);
+          return head;
+        }
+
+        // OK, the head must have changed on us, but we still need to decrease the refcount we increased.
+        // Note that we don't need to release any memory effects, but we do need to ensure that the reference
+        // count decrement happens-after the CAS on the head.
+        refs = prevHead->freeListRefs.fetch_sub(1, std::memory_order_acq_rel);
+        if (refs == SHOULD_BE_ON_FREELIST + 1) {
+          add_knowing_refcount_is_zero(prevHead);
+        }
+      }
+
+      return nullptr;
+    }
+
+    // Useful for traversing the list when there's no contention (e.g. to destroy remaining nodes)
+    N* head_unsafe() const {
+      return freeListHead.load(std::memory_order_relaxed);
+    }
+
+   private:
+    inline void add_knowing_refcount_is_zero(N* node) {
+      // Since the refcount is zero, and nobody can increase it once it's zero (except us, and we run
+      // only one copy of this method per node at a time, i.e. the single thread case), then we know
+      // we can safely change the next pointer of the node; however, once the refcount is back above
+      // zero, then other threads could increase it (happens under heavy contention, when the refcount
+      // goes to zero in between a load and a refcount increment of a node in try_get, then back up to
+      // something non-zero, then the refcount increment is done by the other thread) -- so, if the CAS
+      // to add the node to the actual list fails, decrease the refcount and leave the add operation to
+      // the next thread who puts the refcount back at zero (which could be us, hence the loop).
+      auto head = freeListHead.load(std::memory_order_relaxed);
+      while (true) {
+        node->freeListNext.store(head, std::memory_order_relaxed);
+        node->freeListRefs.store(1, std::memory_order_release);
+        if (!freeListHead.compare_exchange_strong(head, node, std::memory_order_release, std::memory_order_relaxed)) {
+          // Hmm, the add failed, but we can only try again when the refcount goes back to zero
+          if (node->freeListRefs.fetch_add(SHOULD_BE_ON_FREELIST - 1, std::memory_order_release) == 1) {
+            continue;
+          }
+        }
+        return;
+      }
+    }
+
+   private:
+    // Implemented like a stack, but where node order doesn't matter (nodes are inserted out of order under contention)
+    std::atomic<N*> freeListHead;
+
+    static const std::uint32_t REFS_MASK = 0x7FFFFFFF;
+    static const std::uint32_t SHOULD_BE_ON_FREELIST = 0x80000000;
+
+#if MCDBGQ_NOLOCKFREE_FREELIST
+    debug::DebugMutex mutex;
+#endif
+  };
+
+  ///////////////////////////
+  // Block
+  ///////////////////////////
+
+  enum InnerQueueContext { implicit_context = 0, explicit_context = 1 };
+
+  struct Block {
+    Block()
+        : next(nullptr)
+        , elementsCompletelyDequeued(0)
+        , freeListRefs(0)
+        , freeListNext(nullptr)
+        , shouldBeOnFreeList(false)
+        , dynamicallyAllocated(true) {
+#if MCDBGQ_TRACKMEM
+      owner = nullptr;
+#endif
+    }
+
+    template <InnerQueueContext context>
+    inline bool is_empty() const {
+      if (context == explicit_context && BLOCK_SIZE <= EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD) {
+        // Check flags
+        for (size_t i = 0; i < BLOCK_SIZE; ++i) {
+          if (!emptyFlags[i].load(std::memory_order_relaxed)) {
+            return false;
+          }
+        }
+
+        // Aha, empty; make sure we have all other memory effects that happened before the empty flags were set
+        std::atomic_thread_fence(std::memory_order_acquire);
+        return true;
+      } else {
+        // Check counter
+        if (elementsCompletelyDequeued.load(std::memory_order_relaxed) == BLOCK_SIZE) {
+          std::atomic_thread_fence(std::memory_order_acquire);
+          return true;
+        }
+        assert(elementsCompletelyDequeued.load(std::memory_order_relaxed) <= BLOCK_SIZE);
+        return false;
+      }
+    }
+
+    // Returns true if the block is now empty (does not apply in explicit context)
+    template <InnerQueueContext context>
+    inline bool set_empty(index_t i) {
+      if (context == explicit_context && BLOCK_SIZE <= EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD) {
+        // Set flag
+        assert(!emptyFlags[BLOCK_SIZE - 1 - static_cast<size_t>(i & static_cast<index_t>(BLOCK_SIZE - 1))].load(
+            std::memory_order_relaxed));
+        emptyFlags[BLOCK_SIZE - 1 - static_cast<size_t>(i & static_cast<index_t>(BLOCK_SIZE - 1))].store(
+            true, std::memory_order_release);
+        return false;
+      } else {
+        // Increment counter
+        auto prevVal = elementsCompletelyDequeued.fetch_add(1, std::memory_order_release);
+        assert(prevVal < BLOCK_SIZE);
+        return prevVal == BLOCK_SIZE - 1;
+      }
+    }
+
+    // Sets multiple contiguous item statuses to 'empty' (assumes no wrapping and count > 0).
+    // Returns true if the block is now empty (does not apply in explicit context).
+    template <InnerQueueContext context>
+    inline bool set_many_empty(index_t i, size_t count) {
+      if (context == explicit_context && BLOCK_SIZE <= EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD) {
+        // Set flags
+        std::atomic_thread_fence(std::memory_order_release);
+        i = BLOCK_SIZE - 1 - static_cast<size_t>(i & static_cast<index_t>(BLOCK_SIZE - 1)) - count + 1;
+        for (size_t j = 0; j != count; ++j) {
+          assert(!emptyFlags[i + j].load(std::memory_order_relaxed));
+          emptyFlags[i + j].store(true, std::memory_order_relaxed);
+        }
+        return false;
+      } else {
+        // Increment counter
+        auto prevVal = elementsCompletelyDequeued.fetch_add(count, std::memory_order_release);
+        assert(prevVal + count <= BLOCK_SIZE);
+        return prevVal + count == BLOCK_SIZE;
+      }
+    }
+
+    template <InnerQueueContext context>
+    inline void set_all_empty() {
+      if (context == explicit_context && BLOCK_SIZE <= EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD) {
+        // Set all flags
+        for (size_t i = 0; i != BLOCK_SIZE; ++i) {
+          emptyFlags[i].store(true, std::memory_order_relaxed);
+        }
+      } else {
+        // Reset counter
+        elementsCompletelyDequeued.store(BLOCK_SIZE, std::memory_order_relaxed);
+      }
+    }
+
+    template <InnerQueueContext context>
+    inline void reset_empty() {
+      if (context == explicit_context && BLOCK_SIZE <= EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD) {
+        // Reset flags
+        for (size_t i = 0; i != BLOCK_SIZE; ++i) {
+          emptyFlags[i].store(false, std::memory_order_relaxed);
+        }
+      } else {
+        // Reset counter
+        elementsCompletelyDequeued.store(0, std::memory_order_relaxed);
+      }
+    }
+
+    inline T* operator[](index_t idx) MOODYCAMEL_NOEXCEPT {
+      return static_cast<T*>(static_cast<void*>(elements)) +
+             static_cast<size_t>(idx & static_cast<index_t>(BLOCK_SIZE - 1));
+    }
+    inline T const* operator[](index_t idx) const MOODYCAMEL_NOEXCEPT {
+      return static_cast<T const*>(static_cast<void const*>(elements)) +
+             static_cast<size_t>(idx & static_cast<index_t>(BLOCK_SIZE - 1));
+    }
+
+   private:
+    // IMPORTANT: This must be the first member in Block, so that if T depends on the alignment of
+    // addresses returned by malloc, that alignment will be preserved. Apparently clang actually
+    // generates code that uses this assumption for AVX instructions in some cases. Ideally, we
+    // should also align Block to the alignment of T in case it's higher than malloc's 16-byte
+    // alignment, but this is hard to do in a cross-platform way. Assert for this case:
+    static_assert(std::alignment_of<T>::value <= std::alignment_of<details::max_align_t>::value,
+                  "The queue does not support super-aligned types at this time");
+    // Additionally, we need the alignment of Block itself to be a multiple of max_align_t since
+    // otherwise the appropriate padding will not be added at the end of Block in order to make
+    // arrays of Blocks all be properly aligned (not just the first one). We use a union to force
+    // this.
+    union {
+      char elements[sizeof(T) * BLOCK_SIZE];
+      details::max_align_t dummy;
+    };
+
+   public:
+    Block* next;
+    std::atomic<size_t> elementsCompletelyDequeued;
+    std::atomic<bool> emptyFlags[BLOCK_SIZE <= EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD ? BLOCK_SIZE : 1];
+
+   public:
+    std::atomic<std::uint32_t> freeListRefs;
+    std::atomic<Block*> freeListNext;
+    std::atomic<bool> shouldBeOnFreeList;
+    bool dynamicallyAllocated;  // Perhaps a better name for this would be 'isNotPartOfInitialBlockPool'
+
+#if MCDBGQ_TRACKMEM
+    void* owner;
+#endif
+  };
+  static_assert(std::alignment_of<Block>::value >= std::alignment_of<details::max_align_t>::value,
+                "Internal error: Blocks must be at least as aligned as the type they are wrapping");
+
+#if MCDBGQ_TRACKMEM
+ public:
+  struct MemStats;
+
+ private:
+#endif
+
+  ///////////////////////////
+  // Producer base
+  ///////////////////////////
+
+  struct ProducerBase : public details::ConcurrentQueueProducerTypelessBase {
+    ProducerBase(ConcurrentQueue* parent_, bool isExplicit_)
+        : tailIndex(0)
+        , headIndex(0)
+        , dequeueOptimisticCount(0)
+        , dequeueOvercommit(0)
+        , tailBlock(nullptr)
+        , isExplicit(isExplicit_)
+        , parent(parent_) {
+    }
+
+    virtual ~ProducerBase(){};
+
+    template <typename U>
+    inline bool dequeue(U& element) {
+      if (isExplicit) {
+        return static_cast<ExplicitProducer*>(this)->dequeue(element);
+      } else {
+        return static_cast<ImplicitProducer*>(this)->dequeue(element);
+      }
+    }
+
+    template <typename It>
+    inline size_t dequeue_bulk(It& itemFirst, size_t max) {
+      if (isExplicit) {
+        return static_cast<ExplicitProducer*>(this)->dequeue_bulk(itemFirst, max);
+      } else {
+        return static_cast<ImplicitProducer*>(this)->dequeue_bulk(itemFirst, max);
+      }
+    }
+
+    inline ProducerBase* next_prod() const {
+      return static_cast<ProducerBase*>(next);
+    }
+
+    inline size_t size_approx() const {
+      auto tail = tailIndex.load(std::memory_order_relaxed);
+      auto head = headIndex.load(std::memory_order_relaxed);
+      return details::circular_less_than(head, tail) ? static_cast<size_t>(tail - head) : 0;
+    }
+
+    inline index_t getTail() const {
+      return tailIndex.load(std::memory_order_relaxed);
+    }
+
+   protected:
+    std::atomic<index_t> tailIndex;  // Where to enqueue to next
+    std::atomic<index_t> headIndex;  // Where to dequeue from next
+
+    std::atomic<index_t> dequeueOptimisticCount;
+    std::atomic<index_t> dequeueOvercommit;
+
+    Block* tailBlock;
+
+   public:
+    bool isExplicit;
+    ConcurrentQueue* parent;
+
+   protected:
+#if MCDBGQ_TRACKMEM
+    friend struct MemStats;
+#endif
+  };
+
+  ///////////////////////////
+  // Explicit queue
+  ///////////////////////////
+
+  struct ExplicitProducer : public ProducerBase {
+    explicit ExplicitProducer(ConcurrentQueue* parent)
+        : ProducerBase(parent, true)
+        , blockIndex(nullptr)
+        , pr_blockIndexSlotsUsed(0)
+        , pr_blockIndexSize(EXPLICIT_INITIAL_INDEX_SIZE >> 1)
+        , pr_blockIndexFront(0)
+        , pr_blockIndexEntries(nullptr)
+        , pr_blockIndexRaw(nullptr) {
+      size_t poolBasedIndexSize = details::ceil_to_pow_2(parent->initialBlockPoolSize) >> 1;
+      if (poolBasedIndexSize > pr_blockIndexSize) {
+        pr_blockIndexSize = poolBasedIndexSize;
+      }
+
+      new_block_index(
+          0);  // This creates an index with double the number of current entries, i.e. EXPLICIT_INITIAL_INDEX_SIZE
+    }
+
+    ~ExplicitProducer() {
+      // Destruct any elements not yet dequeued.
+      // Since we're in the destructor, we can assume all elements
+      // are either completely dequeued or completely not (no halfways).
+      if (this->tailBlock != nullptr) {  // Note this means there must be a block index too
+        // First find the block that's partially dequeued, if any
+        Block* halfDequeuedBlock = nullptr;
+        if ((this->headIndex.load(std::memory_order_relaxed) & static_cast<index_t>(BLOCK_SIZE - 1)) != 0) {
+          // The head's not on a block boundary, meaning a block somewhere is partially dequeued
+          // (or the head block is the tail block and was fully dequeued, but the head/tail are still not on a boundary)
+          size_t i = (pr_blockIndexFront - pr_blockIndexSlotsUsed) & (pr_blockIndexSize - 1);
+          while (details::circular_less_than<index_t>(pr_blockIndexEntries[i].base + BLOCK_SIZE,
+                                                      this->headIndex.load(std::memory_order_relaxed))) {
+            i = (i + 1) & (pr_blockIndexSize - 1);
+          }
+          assert(details::circular_less_than<index_t>(pr_blockIndexEntries[i].base,
+                                                      this->headIndex.load(std::memory_order_relaxed)));
+          halfDequeuedBlock = pr_blockIndexEntries[i].block;
+        }
+
+        // Start at the head block (note the first line in the loop gives us the head from the tail on the first iteration)
+        auto block = this->tailBlock;
+        do {
+          block = block->next;
+          if (block->ConcurrentQueue::Block::template is_empty<explicit_context>()) {
+            continue;
+          }
+
+          size_t i = 0;  // Offset into block
+          if (block == halfDequeuedBlock) {
+            i = static_cast<size_t>(this->headIndex.load(std::memory_order_relaxed) &
+                                    static_cast<index_t>(BLOCK_SIZE - 1));
+          }
+
+          // Walk through all the items in the block; if this is the tail block, we need to stop when we reach the tail index
+          auto lastValidIndex =
+              (this->tailIndex.load(std::memory_order_relaxed) & static_cast<index_t>(BLOCK_SIZE - 1)) == 0
+                  ? BLOCK_SIZE
+                  : static_cast<size_t>(this->tailIndex.load(std::memory_order_relaxed) &
+                                        static_cast<index_t>(BLOCK_SIZE - 1));
+          while (i != BLOCK_SIZE && (block != this->tailBlock || i != lastValidIndex)) {
+            (*block)[i++]->~T();
+          }
+        } while (block != this->tailBlock);
+      }
+
+      // Destroy all blocks that we own
+      if (this->tailBlock != nullptr) {
+        auto block = this->tailBlock;
+        do {
+          auto nextBlock = block->next;
+          if (block->dynamicallyAllocated) {
+            destroy(block);
+          } else {
+            this->parent->add_block_to_free_list(block);
+          }
+          block = nextBlock;
+        } while (block != this->tailBlock);
+      }
+
+      // Destroy the block indices
+      auto header = static_cast<BlockIndexHeader*>(pr_blockIndexRaw);
+      while (header != nullptr) {
+        auto prev = static_cast<BlockIndexHeader*>(header->prev);
+        header->~BlockIndexHeader();
+        (Traits::free)(header);
+        header = prev;
+      }
+    }
+
+    template <AllocationMode allocMode, typename U>
+    inline bool enqueue(U&& element) {
+      index_t currentTailIndex = this->tailIndex.load(std::memory_order_relaxed);
+      index_t newTailIndex = 1 + currentTailIndex;
+      if ((currentTailIndex & static_cast<index_t>(BLOCK_SIZE - 1)) == 0) {
+        // We reached the end of a block, start a new one
+        auto startBlock = this->tailBlock;
+        auto originalBlockIndexSlotsUsed = pr_blockIndexSlotsUsed;
+        if (this->tailBlock != nullptr &&
+            this->tailBlock->next->ConcurrentQueue::Block::template is_empty<explicit_context>()) {
+          // We can re-use the block ahead of us, it's empty!
+          this->tailBlock = this->tailBlock->next;
+          this->tailBlock->ConcurrentQueue::Block::template reset_empty<explicit_context>();
+
+          // We'll put the block on the block index (guaranteed to be room since we're conceptually removing the
+          // last block from it first -- except instead of removing then adding, we can just overwrite).
+          // Note that there must be a valid block index here, since even if allocation failed in the ctor,
+          // it would have been re-attempted when adding the first block to the queue; since there is such
+          // a block, a block index must have been successfully allocated.
+        } else {
+          // Whatever head value we see here is >= the last value we saw here (relatively),
+          // and <= its current value. Since we have the most recent tail, the head must be
+          // <= to it.
+          auto head = this->headIndex.load(std::memory_order_relaxed);
+          assert(!details::circular_less_than<index_t>(currentTailIndex, head));
+          if (!details::circular_less_than<index_t>(head, currentTailIndex + BLOCK_SIZE) ||
+              (MAX_SUBQUEUE_SIZE != details::const_numeric_max<size_t>::value &&
+               (MAX_SUBQUEUE_SIZE == 0 || MAX_SUBQUEUE_SIZE - BLOCK_SIZE < currentTailIndex - head))) {
+            // We can't enqueue in another block because there's not enough leeway -- the
+            // tail could surpass the head by the time the block fills up! (Or we'll exceed
+            // the size limit, if the second part of the condition was true.)
+            return false;
+          }
+          // We're going to need a new block; check that the block index has room
+          if (pr_blockIndexRaw == nullptr || pr_blockIndexSlotsUsed == pr_blockIndexSize) {
+            // Hmm, the circular block index is already full -- we'll need
+            // to allocate a new index. Note pr_blockIndexRaw can only be nullptr if
+            // the initial allocation failed in the constructor.
+
+            if (allocMode == CannotAlloc || !new_block_index(pr_blockIndexSlotsUsed)) {
+              return false;
+            }
+          }
+
+          // Insert a new block in the circular linked list
+          auto newBlock = this->parent->ConcurrentQueue::template requisition_block<allocMode>();
+          if (newBlock == nullptr) {
+            return false;
+          }
+#if MCDBGQ_TRACKMEM
+          newBlock->owner = this;
+#endif
+          newBlock->ConcurrentQueue::Block::template reset_empty<explicit_context>();
+          if (this->tailBlock == nullptr) {
+            newBlock->next = newBlock;
+          } else {
+            newBlock->next = this->tailBlock->next;
+            this->tailBlock->next = newBlock;
+          }
+          this->tailBlock = newBlock;
+          ++pr_blockIndexSlotsUsed;
+        }
+
+        if (!MOODYCAMEL_NOEXCEPT_CTOR(T, U, new (nullptr) T(std::forward<U>(element)))) {
+          // The constructor may throw. We want the element not to appear in the queue in
+          // that case (without corrupting the queue):
+          MOODYCAMEL_TRY {
+            new ((*this->tailBlock)[currentTailIndex]) T(std::forward<U>(element));
+          }
+          MOODYCAMEL_CATCH(...) {
+            // Revert change to the current block, but leave the new block available
+            // for next time
+            pr_blockIndexSlotsUsed = originalBlockIndexSlotsUsed;
+            this->tailBlock = startBlock == nullptr ? this->tailBlock : startBlock;
+            MOODYCAMEL_RETHROW;
+          }
+        } else {
+          (void)startBlock;
+          (void)originalBlockIndexSlotsUsed;
+        }
+
+        // Add block to block index
+        auto& entry = blockIndex.load(std::memory_order_relaxed)->entries[pr_blockIndexFront];
+        entry.base = currentTailIndex;
+        entry.block = this->tailBlock;
+        blockIndex.load(std::memory_order_relaxed)->front.store(pr_blockIndexFront, std::memory_order_release);
+        pr_blockIndexFront = (pr_blockIndexFront + 1) & (pr_blockIndexSize - 1);
+
+        if (!MOODYCAMEL_NOEXCEPT_CTOR(T, U, new (nullptr) T(std::forward<U>(element)))) {
+          this->tailIndex.store(newTailIndex, std::memory_order_release);
+          return true;
+        }
+      }
+
+      // Enqueue
+      new ((*this->tailBlock)[currentTailIndex]) T(std::forward<U>(element));
+
+      this->tailIndex.store(newTailIndex, std::memory_order_release);
+      return true;
+    }
+
+    template <typename U>
+    bool dequeue(U& element) {
+      auto tail = this->tailIndex.load(std::memory_order_relaxed);
+      auto overcommit = this->dequeueOvercommit.load(std::memory_order_relaxed);
+      if (details::circular_less_than<index_t>(
+              this->dequeueOptimisticCount.load(std::memory_order_relaxed) - overcommit, tail)) {
+        // Might be something to dequeue, let's give it a try
+
+        // Note that this if is purely for performance purposes in the common case when the queue is
+        // empty and the values are eventually consistent -- we may enter here spuriously.
+
+        // Note that whatever the values of overcommit and tail are, they are not going to change (unless we
+        // change them) and must be the same value at this point (inside the if) as when the if condition was
+        // evaluated.
+
+        // We insert an acquire fence here to synchronize-with the release upon incrementing dequeueOvercommit below.
+        // This ensures that whatever the value we got loaded into overcommit, the load of dequeueOptisticCount in
+        // the fetch_add below will result in a value at least as recent as that (and therefore at least as large).
+        // Note that I believe a compiler (signal) fence here would be sufficient due to the nature of fetch_add (all
+        // read-modify-write operations are guaranteed to work on the latest value in the modification order), but
+        // unfortunately that can't be shown to be correct using only the C++11 standard.
+        // See http://stackoverflow.com/questions/18223161/what-are-the-c11-memory-ordering-guarantees-in-this-corner-case
+        std::atomic_thread_fence(std::memory_order_acquire);
+
+        // Increment optimistic counter, then check if it went over the boundary
+        auto myDequeueCount = this->dequeueOptimisticCount.fetch_add(1, std::memory_order_relaxed);
+
+        // Note that since dequeueOvercommit must be <= dequeueOptimisticCount (because dequeueOvercommit is only ever
+        // incremented after dequeueOptimisticCount -- this is enforced in the `else` block below), and since we now
+        // have a version of dequeueOptimisticCount that is at least as recent as overcommit (due to the release upon
+        // incrementing dequeueOvercommit and the acquire above that synchronizes with it), overcommit <= myDequeueCount.
+        assert(overcommit <= myDequeueCount);
+
+        // Note that we reload tail here in case it changed; it will be the same value as before or greater, since
+        // this load is sequenced after (happens after) the earlier load above. This is supported by read-read
+        // coherency (as defined in the standard), explained here: http://en.cppreference.com/w/cpp/atomic/memory_order
+        tail = this->tailIndex.load(std::memory_order_acquire);
+        if (details::likely(details::circular_less_than<index_t>(myDequeueCount - overcommit, tail))) {
+          // Guaranteed to be at least one element to dequeue!
+
+          // Get the index. Note that since there's guaranteed to be at least one element, this
+          // will never exceed tail. We need to do an acquire-release fence here since it's possible
+          // that whatever condition got us to this point was for an earlier enqueued element (that
+          // we already see the memory effects for), but that by the time we increment somebody else
+          // has incremented it, and we need to see the memory effects for *that* element, which is
+          // in such a case is necessarily visible on the thread that incremented it in the first
+          // place with the more current condition (they must have acquired a tail that is at least
+          // as recent).
+          auto index = this->headIndex.fetch_add(1, std::memory_order_acq_rel);
+
+          // Determine which block the element is in
+
+          auto localBlockIndex = blockIndex.load(std::memory_order_acquire);
+          auto localBlockIndexHead = localBlockIndex->front.load(std::memory_order_acquire);
+
+          // We need to be careful here about subtracting and dividing because of index wrap-around.
+          // When an index wraps, we need to preserve the sign of the offset when dividing it by the
+          // block size (in order to get a correct signed block count offset in all cases):
+          auto headBase = localBlockIndex->entries[localBlockIndexHead].base;
+          auto blockBaseIndex = index & ~static_cast<index_t>(BLOCK_SIZE - 1);
+          auto offset = static_cast<size_t>(
+              static_cast<typename std::make_signed<index_t>::type>(blockBaseIndex - headBase) / BLOCK_SIZE);
+          auto block = localBlockIndex->entries[(localBlockIndexHead + offset) & (localBlockIndex->size - 1)].block;
+
+          // Dequeue
+          auto& el = *((*block)[index]);
+          if (!MOODYCAMEL_NOEXCEPT_ASSIGN(T, T&&, element = std::move(el))) {
+            // Make sure the element is still fully dequeued and destroyed even if the assignment
+            // throws
+            struct Guard {
+              Block* block;
+              index_t index;
+
+              ~Guard() {
+                (*block)[index]->~T();
+                block->ConcurrentQueue::Block::template set_empty<explicit_context>(index);
+              }
+            } guard = {block, index};
+
+            element = std::move(el);
+          } else {
+            element = std::move(el);
+            el.~T();
+            block->ConcurrentQueue::Block::template set_empty<explicit_context>(index);
+          }
+
+          return true;
+        } else {
+          // Wasn't anything to dequeue after all; make the effective dequeue count eventually consistent
+          this->dequeueOvercommit.fetch_add(
+              1,
+              std::
+                  memory_order_release);  // Release so that the fetch_add on dequeueOptimisticCount is guaranteed to happen before this write
+        }
+      }
+
+      return false;
+    }
+
+    template <AllocationMode allocMode, typename It>
+    bool enqueue_bulk(It itemFirst, size_t count) {
+      // First, we need to make sure we have enough room to enqueue all of the elements;
+      // this means pre-allocating blocks and putting them in the block index (but only if
+      // all the allocations succeeded).
+      index_t startTailIndex = this->tailIndex.load(std::memory_order_relaxed);
+      auto startBlock = this->tailBlock;
+      auto originalBlockIndexFront = pr_blockIndexFront;
+      auto originalBlockIndexSlotsUsed = pr_blockIndexSlotsUsed;
+
+      Block* firstAllocatedBlock = nullptr;
+
+      // Figure out how many blocks we'll need to allocate, and do so
+      size_t blockBaseDiff = ((startTailIndex + count - 1) & ~static_cast<index_t>(BLOCK_SIZE - 1)) -
+                             ((startTailIndex - 1) & ~static_cast<index_t>(BLOCK_SIZE - 1));
+      index_t currentTailIndex = (startTailIndex - 1) & ~static_cast<index_t>(BLOCK_SIZE - 1);
+      if (blockBaseDiff > 0) {
+        // Allocate as many blocks as possible from ahead
+        while (blockBaseDiff > 0 && this->tailBlock != nullptr && this->tailBlock->next != firstAllocatedBlock &&
+               this->tailBlock->next->ConcurrentQueue::Block::template is_empty<explicit_context>()) {
+          blockBaseDiff -= static_cast<index_t>(BLOCK_SIZE);
+          currentTailIndex += static_cast<index_t>(BLOCK_SIZE);
+
+          this->tailBlock = this->tailBlock->next;
+          firstAllocatedBlock = firstAllocatedBlock == nullptr ? this->tailBlock : firstAllocatedBlock;
+
+          auto& entry = blockIndex.load(std::memory_order_relaxed)->entries[pr_blockIndexFront];
+          entry.base = currentTailIndex;
+          entry.block = this->tailBlock;
+          pr_blockIndexFront = (pr_blockIndexFront + 1) & (pr_blockIndexSize - 1);
+        }
+
+        // Now allocate as many blocks as necessary from the block pool
+        while (blockBaseDiff > 0) {
+          blockBaseDiff -= static_cast<index_t>(BLOCK_SIZE);
+          currentTailIndex += static_cast<index_t>(BLOCK_SIZE);
+
+          auto head = this->headIndex.load(std::memory_order_relaxed);
+          assert(!details::circular_less_than<index_t>(currentTailIndex, head));
+          bool full = !details::circular_less_than<index_t>(head, currentTailIndex + BLOCK_SIZE) ||
+                      (MAX_SUBQUEUE_SIZE != details::const_numeric_max<size_t>::value &&
+                       (MAX_SUBQUEUE_SIZE == 0 || MAX_SUBQUEUE_SIZE - BLOCK_SIZE < currentTailIndex - head));
+          if (pr_blockIndexRaw == nullptr || pr_blockIndexSlotsUsed == pr_blockIndexSize || full) {
+            if (allocMode == CannotAlloc || full || !new_block_index(originalBlockIndexSlotsUsed)) {
+              // Failed to allocate, undo changes (but keep injected blocks)
+              pr_blockIndexFront = originalBlockIndexFront;
+              pr_blockIndexSlotsUsed = originalBlockIndexSlotsUsed;
+              this->tailBlock = startBlock == nullptr ? firstAllocatedBlock : startBlock;
+              return false;
+            }
+
+            // pr_blockIndexFront is updated inside new_block_index, so we need to
+            // update our fallback value too (since we keep the new index even if we
+            // later fail)
+            originalBlockIndexFront = originalBlockIndexSlotsUsed;
+          }
+
+          // Insert a new block in the circular linked list
+          auto newBlock = this->parent->ConcurrentQueue::template requisition_block<allocMode>();
+          if (newBlock == nullptr) {
+            pr_blockIndexFront = originalBlockIndexFront;
+            pr_blockIndexSlotsUsed = originalBlockIndexSlotsUsed;
+            this->tailBlock = startBlock == nullptr ? firstAllocatedBlock : startBlock;
+            return false;
+          }
+
+#if MCDBGQ_TRACKMEM
+          newBlock->owner = this;
+#endif
+          newBlock->ConcurrentQueue::Block::template set_all_empty<explicit_context>();
+          if (this->tailBlock == nullptr) {
+            newBlock->next = newBlock;
+          } else {
+            newBlock->next = this->tailBlock->next;
+            this->tailBlock->next = newBlock;
+          }
+          this->tailBlock = newBlock;
+          firstAllocatedBlock = firstAllocatedBlock == nullptr ? this->tailBlock : firstAllocatedBlock;
+
+          ++pr_blockIndexSlotsUsed;
+
+          auto& entry = blockIndex.load(std::memory_order_relaxed)->entries[pr_blockIndexFront];
+          entry.base = currentTailIndex;
+          entry.block = this->tailBlock;
+          pr_blockIndexFront = (pr_blockIndexFront + 1) & (pr_blockIndexSize - 1);
+        }
+
+        // Excellent, all allocations succeeded. Reset each block's emptiness before we fill them up, and
+        // publish the new block index front
+        auto block = firstAllocatedBlock;
+        while (true) {
+          block->ConcurrentQueue::Block::template reset_empty<explicit_context>();
+          if (block == this->tailBlock) {
+            break;
+          }
+          block = block->next;
+        }
+
+        if (MOODYCAMEL_NOEXCEPT_CTOR(T, decltype(*itemFirst), new (nullptr) T(details::deref_noexcept(itemFirst)))) {
+          blockIndex.load(std::memory_order_relaxed)
+              ->front.store((pr_blockIndexFront - 1) & (pr_blockIndexSize - 1), std::memory_order_release);
+        }
+      }
+
+      // Enqueue, one block at a time
+      index_t newTailIndex = startTailIndex + static_cast<index_t>(count);
+      currentTailIndex = startTailIndex;
+      auto endBlock = this->tailBlock;
+      this->tailBlock = startBlock;
+      assert((startTailIndex & static_cast<index_t>(BLOCK_SIZE - 1)) != 0 || firstAllocatedBlock != nullptr ||
+             count == 0);
+      if ((startTailIndex & static_cast<index_t>(BLOCK_SIZE - 1)) == 0 && firstAllocatedBlock != nullptr) {
+        this->tailBlock = firstAllocatedBlock;
+      }
+      while (true) {
+        auto stopIndex = (currentTailIndex & ~static_cast<index_t>(BLOCK_SIZE - 1)) + static_cast<index_t>(BLOCK_SIZE);
+        if (details::circular_less_than<index_t>(newTailIndex, stopIndex)) {
+          stopIndex = newTailIndex;
+        }
+        if (MOODYCAMEL_NOEXCEPT_CTOR(T, decltype(*itemFirst), new (nullptr) T(details::deref_noexcept(itemFirst)))) {
+          while (currentTailIndex != stopIndex) {
+            new ((*this->tailBlock)[currentTailIndex++]) T(*itemFirst++);
+          }
+        } else {
+          MOODYCAMEL_TRY {
+            while (currentTailIndex != stopIndex) {
+              // Must use copy constructor even if move constructor is available
+              // because we may have to revert if there's an exception.
+              // Sorry about the horrible templated next line, but it was the only way
+              // to disable moving *at compile time*, which is important because a type
+              // may only define a (noexcept) move constructor, and so calls to the
+              // cctor will not compile, even if they are in an if branch that will never
+              // be executed
+              new ((*this->tailBlock)[currentTailIndex]) T(
+                  details::nomove_if<(bool)!MOODYCAMEL_NOEXCEPT_CTOR(
+                      T, decltype(*itemFirst), new (nullptr) T(details::deref_noexcept(itemFirst)))>::eval(*itemFirst));
+              ++currentTailIndex;
+              ++itemFirst;
+            }
+          }
+          MOODYCAMEL_CATCH(...) {
+            // Oh dear, an exception's been thrown -- destroy the elements that
+            // were enqueued so far and revert the entire bulk operation (we'll keep
+            // any allocated blocks in our linked list for later, though).
+            auto constructedStopIndex = currentTailIndex;
+            auto lastBlockEnqueued = this->tailBlock;
+
+            pr_blockIndexFront = originalBlockIndexFront;
+            pr_blockIndexSlotsUsed = originalBlockIndexSlotsUsed;
+            this->tailBlock = startBlock == nullptr ? firstAllocatedBlock : startBlock;
+
+            if (!details::is_trivially_destructible<T>::value) {
+              auto block = startBlock;
+              if ((startTailIndex & static_cast<index_t>(BLOCK_SIZE - 1)) == 0) {
+                block = firstAllocatedBlock;
+              }
+              currentTailIndex = startTailIndex;
+              while (true) {
+                stopIndex =
+                    (currentTailIndex & ~static_cast<index_t>(BLOCK_SIZE - 1)) + static_cast<index_t>(BLOCK_SIZE);
+                if (details::circular_less_than<index_t>(constructedStopIndex, stopIndex)) {
+                  stopIndex = constructedStopIndex;
+                }
+                while (currentTailIndex != stopIndex) {
+                  (*block)[currentTailIndex++]->~T();
+                }
+                if (block == lastBlockEnqueued) {
+                  break;
+                }
+                block = block->next;
+              }
+            }
+            MOODYCAMEL_RETHROW;
+          }
+        }
+
+        if (this->tailBlock == endBlock) {
+          assert(currentTailIndex == newTailIndex);
+          break;
+        }
+        this->tailBlock = this->tailBlock->next;
+      }
+
+      if (!MOODYCAMEL_NOEXCEPT_CTOR(T, decltype(*itemFirst), new (nullptr) T(details::deref_noexcept(itemFirst))) &&
+          firstAllocatedBlock != nullptr) {
+        blockIndex.load(std::memory_order_relaxed)
+            ->front.store((pr_blockIndexFront - 1) & (pr_blockIndexSize - 1), std::memory_order_release);
+      }
+
+      this->tailIndex.store(newTailIndex, std::memory_order_release);
+      return true;
+    }
+
+    template <typename It>
+    size_t dequeue_bulk(It& itemFirst, size_t max) {
+      auto tail = this->tailIndex.load(std::memory_order_relaxed);
+      auto overcommit = this->dequeueOvercommit.load(std::memory_order_relaxed);
+      auto desiredCount =
+          static_cast<size_t>(tail - (this->dequeueOptimisticCount.load(std::memory_order_relaxed) - overcommit));
+      if (details::circular_less_than<size_t>(0, desiredCount)) {
+        desiredCount = desiredCount < max ? desiredCount : max;
+        std::atomic_thread_fence(std::memory_order_acquire);
+
+        auto myDequeueCount = this->dequeueOptimisticCount.fetch_add(desiredCount, std::memory_order_relaxed);
+        assert(overcommit <= myDequeueCount);
+
+        tail = this->tailIndex.load(std::memory_order_acquire);
+        auto actualCount = static_cast<size_t>(tail - (myDequeueCount - overcommit));
+        if (details::circular_less_than<size_t>(0, actualCount)) {
+          actualCount = desiredCount < actualCount ? desiredCount : actualCount;
+          if (actualCount < desiredCount) {
+            this->dequeueOvercommit.fetch_add(desiredCount - actualCount, std::memory_order_release);
+          }
+
+          // Get the first index. Note that since there's guaranteed to be at least actualCount elements, this
+          // will never exceed tail.
+          auto firstIndex = this->headIndex.fetch_add(actualCount, std::memory_order_acq_rel);
+
+          // Determine which block the first element is in
+          auto localBlockIndex = blockIndex.load(std::memory_order_acquire);
+          auto localBlockIndexHead = localBlockIndex->front.load(std::memory_order_acquire);
+
+          auto headBase = localBlockIndex->entries[localBlockIndexHead].base;
+          auto firstBlockBaseIndex = firstIndex & ~static_cast<index_t>(BLOCK_SIZE - 1);
+          auto offset = static_cast<size_t>(
+              static_cast<typename std::make_signed<index_t>::type>(firstBlockBaseIndex - headBase) / BLOCK_SIZE);
+          auto indexIndex = (localBlockIndexHead + offset) & (localBlockIndex->size - 1);
+
+          // Iterate the blocks and dequeue
+          auto index = firstIndex;
+          do {
+            auto firstIndexInBlock = index;
+            auto endIndex = (index & ~static_cast<index_t>(BLOCK_SIZE - 1)) + static_cast<index_t>(BLOCK_SIZE);
+            endIndex = details::circular_less_than<index_t>(firstIndex + static_cast<index_t>(actualCount), endIndex)
+                           ? firstIndex + static_cast<index_t>(actualCount)
+                           : endIndex;
+            auto block = localBlockIndex->entries[indexIndex].block;
+            if (MOODYCAMEL_NOEXCEPT_ASSIGN(T, T&&,
+                                           details::deref_noexcept(itemFirst) = std::move((*(*block)[index])))) {
+              while (index != endIndex) {
+                auto& el = *((*block)[index]);
+                *itemFirst++ = std::move(el);
+                el.~T();
+                ++index;
+              }
+            } else {
+              MOODYCAMEL_TRY {
+                while (index != endIndex) {
+                  auto& el = *((*block)[index]);
+                  *itemFirst = std::move(el);
+                  ++itemFirst;
+                  el.~T();
+                  ++index;
+                }
+              }
+              MOODYCAMEL_CATCH(...) {
+                // It's too late to revert the dequeue, but we can make sure that all
+                // the dequeued objects are properly destroyed and the block index
+                // (and empty count) are properly updated before we propagate the exception
+                do {
+                  block = localBlockIndex->entries[indexIndex].block;
+                  while (index != endIndex) {
+                    (*block)[index++]->~T();
+                  }
+                  block->ConcurrentQueue::Block::template set_many_empty<explicit_context>(
+                      firstIndexInBlock, static_cast<size_t>(endIndex - firstIndexInBlock));
+                  indexIndex = (indexIndex + 1) & (localBlockIndex->size - 1);
+
+                  firstIndexInBlock = index;
+                  endIndex = (index & ~static_cast<index_t>(BLOCK_SIZE - 1)) + static_cast<index_t>(BLOCK_SIZE);
+                  endIndex =
+                      details::circular_less_than<index_t>(firstIndex + static_cast<index_t>(actualCount), endIndex)
+                          ? firstIndex + static_cast<index_t>(actualCount)
+                          : endIndex;
+                } while (index != firstIndex + actualCount);
+
+                MOODYCAMEL_RETHROW;
+              }
+            }
+            block->ConcurrentQueue::Block::template set_many_empty<explicit_context>(
+                firstIndexInBlock, static_cast<size_t>(endIndex - firstIndexInBlock));
+            indexIndex = (indexIndex + 1) & (localBlockIndex->size - 1);
+          } while (index != firstIndex + actualCount);
+
+          return actualCount;
+        } else {
+          // Wasn't anything to dequeue after all; make the effective dequeue count eventually consistent
+          this->dequeueOvercommit.fetch_add(desiredCount, std::memory_order_release);
+        }
+      }
+
+      return 0;
+    }
+
+   private:
+    struct BlockIndexEntry {
+      index_t base;
+      Block* block;
+    };
+
+    struct BlockIndexHeader {
+      size_t size;
+      std::atomic<size_t> front;  // Current slot (not next, like pr_blockIndexFront)
+      BlockIndexEntry* entries;
+      void* prev;
+    };
+
+    bool new_block_index(size_t numberOfFilledSlotsToExpose) {
+      auto prevBlockSizeMask = pr_blockIndexSize - 1;
+
+      // Create the new block
+      pr_blockIndexSize <<= 1;
+      auto newRawPtr =
+          static_cast<char*>((Traits::malloc)(sizeof(BlockIndexHeader) + std::alignment_of<BlockIndexEntry>::value - 1 +
+                                              sizeof(BlockIndexEntry) * pr_blockIndexSize));
+      if (newRawPtr == nullptr) {
+        pr_blockIndexSize >>= 1;  // Reset to allow graceful retry
+        return false;
+      }
+
+      auto newBlockIndexEntries =
+          reinterpret_cast<BlockIndexEntry*>(details::align_for<BlockIndexEntry>(newRawPtr + sizeof(BlockIndexHeader)));
+
+      // Copy in all the old indices, if any
+      size_t j = 0;
+      if (pr_blockIndexSlotsUsed != 0) {
+        auto i = (pr_blockIndexFront - pr_blockIndexSlotsUsed) & prevBlockSizeMask;
+        do {
+          newBlockIndexEntries[j++] = pr_blockIndexEntries[i];
+          i = (i + 1) & prevBlockSizeMask;
+        } while (i != pr_blockIndexFront);
+      }
+
+      // Update everything
+      auto header = new (newRawPtr) BlockIndexHeader;
+      header->size = pr_blockIndexSize;
+      header->front.store(numberOfFilledSlotsToExpose - 1, std::memory_order_relaxed);
+      header->entries = newBlockIndexEntries;
+      header->prev = pr_blockIndexRaw;  // we link the new block to the old one so we can free it later
+
+      pr_blockIndexFront = j;
+      pr_blockIndexEntries = newBlockIndexEntries;
+      pr_blockIndexRaw = newRawPtr;
+      blockIndex.store(header, std::memory_order_release);
+
+      return true;
+    }
+
+   private:
+    std::atomic<BlockIndexHeader*> blockIndex;
+
+    // To be used by producer only -- consumer must use the ones in referenced by blockIndex
+    size_t pr_blockIndexSlotsUsed;
+    size_t pr_blockIndexSize;
+    size_t pr_blockIndexFront;  // Next slot (not current)
+    BlockIndexEntry* pr_blockIndexEntries;
+    void* pr_blockIndexRaw;
+
+#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG
+   public:
+    ExplicitProducer* nextExplicitProducer;
+
+   private:
+#endif
+
+#if MCDBGQ_TRACKMEM
+    friend struct MemStats;
+#endif
+  };
+
+  //////////////////////////////////
+  // Implicit queue
+  //////////////////////////////////
+
+  struct ImplicitProducer : public ProducerBase {
+    ImplicitProducer(ConcurrentQueue* parent)
+        : ProducerBase(parent, false), nextBlockIndexCapacity(IMPLICIT_INITIAL_INDEX_SIZE), blockIndex(nullptr) {
+      new_block_index();
+    }
+
+    ~ImplicitProducer() {
+      // Note that since we're in the destructor we can assume that all enqueue/dequeue operations
+      // completed already; this means that all undequeued elements are placed contiguously across
+      // contiguous blocks, and that only the first and last remaining blocks can be only partially
+      // empty (all other remaining blocks must be completely full).
+
+#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED
+      // Unregister ourselves for thread termination notification
+      if (!this->inactive.load(std::memory_order_relaxed)) {
+        details::ThreadExitNotifier::unsubscribe(&threadExitListener);
+      }
+#endif
+
+      // Destroy all remaining elements!
+      auto tail = this->tailIndex.load(std::memory_order_relaxed);
+      auto index = this->headIndex.load(std::memory_order_relaxed);
+      Block* block = nullptr;
+      assert(index == tail || details::circular_less_than(index, tail));
+      bool forceFreeLastBlock = index != tail;  // If we enter the loop, then the last (tail) block will not be freed
+      while (index != tail) {
+        if ((index & static_cast<index_t>(BLOCK_SIZE - 1)) == 0 || block == nullptr) {
+          if (block != nullptr) {
+            // Free the old block
+            this->parent->add_block_to_free_list(block);
+          }
+
+          block = get_block_index_entry_for_index(index)->value.load(std::memory_order_relaxed);
+        }
+
+        ((*block)[index])->~T();
+        ++index;
+      }
+      // Even if the queue is empty, there's still one block that's not on the free list
+      // (unless the head index reached the end of it, in which case the tail will be poised
+      // to create a new block).
+      if (this->tailBlock != nullptr && (forceFreeLastBlock || (tail & static_cast<index_t>(BLOCK_SIZE - 1)) != 0)) {
+        this->parent->add_block_to_free_list(this->tailBlock);
+      }
+
+      // Destroy block index
+      auto localBlockIndex = blockIndex.load(std::memory_order_relaxed);
+      if (localBlockIndex != nullptr) {
+        for (size_t i = 0; i != localBlockIndex->capacity; ++i) {
+          localBlockIndex->index[i]->~BlockIndexEntry();
+        }
+        do {
+          auto prev = localBlockIndex->prev;
+          localBlockIndex->~BlockIndexHeader();
+          (Traits::free)(localBlockIndex);
+          localBlockIndex = prev;
+        } while (localBlockIndex != nullptr);
+      }
+    }
+
+    template <AllocationMode allocMode, typename U>
+    inline bool enqueue(U&& element) {
+      index_t currentTailIndex = this->tailIndex.load(std::memory_order_relaxed);
+      index_t newTailIndex = 1 + currentTailIndex;
+      if ((currentTailIndex & static_cast<index_t>(BLOCK_SIZE - 1)) == 0) {
+        // We reached the end of a block, start a new one
+        auto head = this->headIndex.load(std::memory_order_relaxed);
+        assert(!details::circular_less_than<index_t>(currentTailIndex, head));
+        if (!details::circular_less_than<index_t>(head, currentTailIndex + BLOCK_SIZE) ||
+            (MAX_SUBQUEUE_SIZE != details::const_numeric_max<size_t>::value &&
+             (MAX_SUBQUEUE_SIZE == 0 || MAX_SUBQUEUE_SIZE - BLOCK_SIZE < currentTailIndex - head))) {
+          return false;
+        }
+#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX
+        debug::DebugLock lock(mutex);
+#endif
+        // Find out where we'll be inserting this block in the block index
+        BlockIndexEntry* idxEntry;
+        if (!insert_block_index_entry<allocMode>(idxEntry, currentTailIndex)) {
+          return false;
+        }
+
+        // Get ahold of a new block
+        auto newBlock = this->parent->ConcurrentQueue::template requisition_block<allocMode>();
+        if (newBlock == nullptr) {
+          rewind_block_index_tail();
+          idxEntry->value.store(nullptr, std::memory_order_relaxed);
+          return false;
+        }
+#if MCDBGQ_TRACKMEM
+        newBlock->owner = this;
+#endif
+        newBlock->ConcurrentQueue::Block::template reset_empty<implicit_context>();
+
+        if (!MOODYCAMEL_NOEXCEPT_CTOR(T, U, new (nullptr) T(std::forward<U>(element)))) {
+          // May throw, try to insert now before we publish the fact that we have this new block
+          MOODYCAMEL_TRY {
+            new ((*newBlock)[currentTailIndex]) T(std::forward<U>(element));
+          }
+          MOODYCAMEL_CATCH(...) {
+            rewind_block_index_tail();
+            idxEntry->value.store(nullptr, std::memory_order_relaxed);
+            this->parent->add_block_to_free_list(newBlock);
+            MOODYCAMEL_RETHROW;
+          }
+        }
+
+        // Insert the new block into the index
+        idxEntry->value.store(newBlock, std::memory_order_relaxed);
+
+        this->tailBlock = newBlock;
+
+        if (!MOODYCAMEL_NOEXCEPT_CTOR(T, U, new (nullptr) T(std::forward<U>(element)))) {
+          this->tailIndex.store(newTailIndex, std::memory_order_release);
+          return true;
+        }
+      }
+
+      // Enqueue
+      new ((*this->tailBlock)[currentTailIndex]) T(std::forward<U>(element));
+
+      this->tailIndex.store(newTailIndex, std::memory_order_release);
+      return true;
+    }
+
+    template <typename U>
+    bool dequeue(U& element) {
+      // See ExplicitProducer::dequeue for rationale and explanation
+      index_t tail = this->tailIndex.load(std::memory_order_relaxed);
+      index_t overcommit = this->dequeueOvercommit.load(std::memory_order_relaxed);
+      if (details::circular_less_than<index_t>(
+              this->dequeueOptimisticCount.load(std::memory_order_relaxed) - overcommit, tail)) {
+        std::atomic_thread_fence(std::memory_order_acquire);
+
+        index_t myDequeueCount = this->dequeueOptimisticCount.fetch_add(1, std::memory_order_relaxed);
+        assert(overcommit <= myDequeueCount);
+        tail = this->tailIndex.load(std::memory_order_acquire);
+        if (details::likely(details::circular_less_than<index_t>(myDequeueCount - overcommit, tail))) {
+          index_t index = this->headIndex.fetch_add(1, std::memory_order_acq_rel);
+
+          // Determine which block the element is in
+          auto entry = get_block_index_entry_for_index(index);
+
+          // Dequeue
+          auto block = entry->value.load(std::memory_order_relaxed);
+          auto& el = *((*block)[index]);
+
+          if (!MOODYCAMEL_NOEXCEPT_ASSIGN(T, T&&, element = std::move(el))) {
+#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX
+            // Note: Acquiring the mutex with every dequeue instead of only when a block
+            // is released is very sub-optimal, but it is, after all, purely debug code.
+            debug::DebugLock lock(producer->mutex);
+#endif
+            struct Guard {
+              Block* block;
+              index_t index;
+              BlockIndexEntry* entry;
+              ConcurrentQueue* parent;
+
+              ~Guard() {
+                (*block)[index]->~T();
+                if (block->ConcurrentQueue::Block::template set_empty<implicit_context>(index)) {
+                  entry->value.store(nullptr, std::memory_order_relaxed);
+                  parent->add_block_to_free_list(block);
+                }
+              }
+            } guard = {block, index, entry, this->parent};
+
+            element = std::move(el);
+          } else {
+            element = std::move(el);
+            el.~T();
+
+            if (block->ConcurrentQueue::Block::template set_empty<implicit_context>(index)) {
+              {
+#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX
+                debug::DebugLock lock(mutex);
+#endif
+                // Add the block back into the global free pool (and remove from block index)
+                entry->value.store(nullptr, std::memory_order_relaxed);
+              }
+              this->parent->add_block_to_free_list(block);  // releases the above store
+            }
+          }
+
+          return true;
+        } else {
+          this->dequeueOvercommit.fetch_add(1, std::memory_order_release);
+        }
+      }
+
+      return false;
+    }
+
+    template <AllocationMode allocMode, typename It>
+    bool enqueue_bulk(It itemFirst, size_t count) {
+      // First, we need to make sure we have enough room to enqueue all of the elements;
+      // this means pre-allocating blocks and putting them in the block index (but only if
+      // all the allocations succeeded).
+
+      // Note that the tailBlock we start off with may not be owned by us any more;
+      // this happens if it was filled up exactly to the top (setting tailIndex to
+      // the first index of the next block which is not yet allocated), then dequeued
+      // completely (putting it on the free list) before we enqueue again.
+
+      index_t startTailIndex = this->tailIndex.load(std::memory_order_relaxed);
+      auto startBlock = this->tailBlock;
+      Block* firstAllocatedBlock = nullptr;
+      auto endBlock = this->tailBlock;
+
+      // Figure out how many blocks we'll need to allocate, and do so
+      size_t blockBaseDiff = ((startTailIndex + count - 1) & ~static_cast<index_t>(BLOCK_SIZE - 1)) -
+                             ((startTailIndex - 1) & ~static_cast<index_t>(BLOCK_SIZE - 1));
+      index_t currentTailIndex = (startTailIndex - 1) & ~static_cast<index_t>(BLOCK_SIZE - 1);
+      if (blockBaseDiff > 0) {
+#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX
+        debug::DebugLock lock(mutex);
+#endif
+        do {
+          blockBaseDiff -= static_cast<index_t>(BLOCK_SIZE);
+          currentTailIndex += static_cast<index_t>(BLOCK_SIZE);
+
+          // Find out where we'll be inserting this block in the block index
+          BlockIndexEntry* idxEntry = nullptr;  // initialization here unnecessary but compiler can't always tell
+          Block* newBlock;
+          bool indexInserted = false;
+          auto head = this->headIndex.load(std::memory_order_relaxed);
+          assert(!details::circular_less_than<index_t>(currentTailIndex, head));
+          bool full = !details::circular_less_than<index_t>(head, currentTailIndex + BLOCK_SIZE) ||
+                      (MAX_SUBQUEUE_SIZE != details::const_numeric_max<size_t>::value &&
+                       (MAX_SUBQUEUE_SIZE == 0 || MAX_SUBQUEUE_SIZE - BLOCK_SIZE < currentTailIndex - head));
+          if (full || !(indexInserted = insert_block_index_entry<allocMode>(idxEntry, currentTailIndex)) ||
+              (newBlock = this->parent->ConcurrentQueue::template requisition_block<allocMode>()) == nullptr) {
+            // Index allocation or block allocation failed; revert any other allocations
+            // and index insertions done so far for this operation
+            if (indexInserted) {
+              rewind_block_index_tail();
+              idxEntry->value.store(nullptr, std::memory_order_relaxed);
+            }
+            currentTailIndex = (startTailIndex - 1) & ~static_cast<index_t>(BLOCK_SIZE - 1);
+            for (auto block = firstAllocatedBlock; block != nullptr; block = block->next) {
+              currentTailIndex += static_cast<index_t>(BLOCK_SIZE);
+              idxEntry = get_block_index_entry_for_index(currentTailIndex);
+              idxEntry->value.store(nullptr, std::memory_order_relaxed);
+              rewind_block_index_tail();
+            }
+            this->parent->add_blocks_to_free_list(firstAllocatedBlock);
+            this->tailBlock = startBlock;
+
+            return false;
+          }
+
+#if MCDBGQ_TRACKMEM
+          newBlock->owner = this;
+#endif
+          newBlock->ConcurrentQueue::Block::template reset_empty<implicit_context>();
+          newBlock->next = nullptr;
+
+          // Insert the new block into the index
+          idxEntry->value.store(newBlock, std::memory_order_relaxed);
+
+          // Store the chain of blocks so that we can undo if later allocations fail,
+          // and so that we can find the blocks when we do the actual enqueueing
+          if ((startTailIndex & static_cast<index_t>(BLOCK_SIZE - 1)) != 0 || firstAllocatedBlock != nullptr) {
+            assert(this->tailBlock != nullptr);
+            this->tailBlock->next = newBlock;
+          }
+          this->tailBlock = newBlock;
+          endBlock = newBlock;
+          firstAllocatedBlock = firstAllocatedBlock == nullptr ? newBlock : firstAllocatedBlock;
+        } while (blockBaseDiff > 0);
+      }
+
+      // Enqueue, one block at a time
+      index_t newTailIndex = startTailIndex + static_cast<index_t>(count);
+      currentTailIndex = startTailIndex;
+      this->tailBlock = startBlock;
+      assert((startTailIndex & static_cast<index_t>(BLOCK_SIZE - 1)) != 0 || firstAllocatedBlock != nullptr ||
+             count == 0);
+      if ((startTailIndex & static_cast<index_t>(BLOCK_SIZE - 1)) == 0 && firstAllocatedBlock != nullptr) {
+        this->tailBlock = firstAllocatedBlock;
+      }
+      while (true) {
+        auto stopIndex = (currentTailIndex & ~static_cast<index_t>(BLOCK_SIZE - 1)) + static_cast<index_t>(BLOCK_SIZE);
+        if (details::circular_less_than<index_t>(newTailIndex, stopIndex)) {
+          stopIndex = newTailIndex;
+        }
+        if (MOODYCAMEL_NOEXCEPT_CTOR(T, decltype(*itemFirst), new (nullptr) T(details::deref_noexcept(itemFirst)))) {
+          while (currentTailIndex != stopIndex) {
+            new ((*this->tailBlock)[currentTailIndex++]) T(*itemFirst++);
+          }
+        } else {
+          MOODYCAMEL_TRY {
+            while (currentTailIndex != stopIndex) {
+              new ((*this->tailBlock)[currentTailIndex]) T(
+                  details::nomove_if<(bool)!MOODYCAMEL_NOEXCEPT_CTOR(
+                      T, decltype(*itemFirst), new (nullptr) T(details::deref_noexcept(itemFirst)))>::eval(*itemFirst));
+              ++currentTailIndex;
+              ++itemFirst;
+            }
+          }
+          MOODYCAMEL_CATCH(...) {
+            auto constructedStopIndex = currentTailIndex;
+            auto lastBlockEnqueued = this->tailBlock;
+
+            if (!details::is_trivially_destructible<T>::value) {
+              auto block = startBlock;
+              if ((startTailIndex & static_cast<index_t>(BLOCK_SIZE - 1)) == 0) {
+                block = firstAllocatedBlock;
+              }
+              currentTailIndex = startTailIndex;
+              while (true) {
+                stopIndex =
+                    (currentTailIndex & ~static_cast<index_t>(BLOCK_SIZE - 1)) + static_cast<index_t>(BLOCK_SIZE);
+                if (details::circular_less_than<index_t>(constructedStopIndex, stopIndex)) {
+                  stopIndex = constructedStopIndex;
+                }
+                while (currentTailIndex != stopIndex) {
+                  (*block)[currentTailIndex++]->~T();
+                }
+                if (block == lastBlockEnqueued) {
+                  break;
+                }
+                block = block->next;
+              }
+            }
+
+            currentTailIndex = (startTailIndex - 1) & ~static_cast<index_t>(BLOCK_SIZE - 1);
+            for (auto block = firstAllocatedBlock; block != nullptr; block = block->next) {
+              currentTailIndex += static_cast<index_t>(BLOCK_SIZE);
+              auto idxEntry = get_block_index_entry_for_index(currentTailIndex);
+              idxEntry->value.store(nullptr, std::memory_order_relaxed);
+              rewind_block_index_tail();
+            }
+            this->parent->add_blocks_to_free_list(firstAllocatedBlock);
+            this->tailBlock = startBlock;
+            MOODYCAMEL_RETHROW;
+          }
+        }
+
+        if (this->tailBlock == endBlock) {
+          assert(currentTailIndex == newTailIndex);
+          break;
+        }
+        this->tailBlock = this->tailBlock->next;
+      }
+      this->tailIndex.store(newTailIndex, std::memory_order_release);
+      return true;
+    }
+
+    template <typename It>
+    size_t dequeue_bulk(It& itemFirst, size_t max) {
+      auto tail = this->tailIndex.load(std::memory_order_relaxed);
+      auto overcommit = this->dequeueOvercommit.load(std::memory_order_relaxed);
+      auto desiredCount =
+          static_cast<size_t>(tail - (this->dequeueOptimisticCount.load(std::memory_order_relaxed) - overcommit));
+      if (details::circular_less_than<size_t>(0, desiredCount)) {
+        desiredCount = desiredCount < max ? desiredCount : max;
+        std::atomic_thread_fence(std::memory_order_acquire);
+
+        auto myDequeueCount = this->dequeueOptimisticCount.fetch_add(desiredCount, std::memory_order_relaxed);
+        assert(overcommit <= myDequeueCount);
+
+        tail = this->tailIndex.load(std::memory_order_acquire);
+        auto actualCount = static_cast<size_t>(tail - (myDequeueCount - overcommit));
+        if (details::circular_less_than<size_t>(0, actualCount)) {
+          actualCount = desiredCount < actualCount ? desiredCount : actualCount;
+          if (actualCount < desiredCount) {
+            this->dequeueOvercommit.fetch_add(desiredCount - actualCount, std::memory_order_release);
+          }
+
+          // Get the first index. Note that since there's guaranteed to be at least actualCount elements, this
+          // will never exceed tail.
+          auto firstIndex = this->headIndex.fetch_add(actualCount, std::memory_order_acq_rel);
+
+          // Iterate the blocks and dequeue
+          auto index = firstIndex;
+          BlockIndexHeader* localBlockIndex;
+          auto indexIndex = get_block_index_index_for_index(index, localBlockIndex);
+          do {
+            auto blockStartIndex = index;
+            auto endIndex = (index & ~static_cast<index_t>(BLOCK_SIZE - 1)) + static_cast<index_t>(BLOCK_SIZE);
+            endIndex = details::circular_less_than<index_t>(firstIndex + static_cast<index_t>(actualCount), endIndex)
+                           ? firstIndex + static_cast<index_t>(actualCount)
+                           : endIndex;
+
+            auto entry = localBlockIndex->index[indexIndex];
+            auto block = entry->value.load(std::memory_order_relaxed);
+            if (MOODYCAMEL_NOEXCEPT_ASSIGN(T, T&&,
+                                           details::deref_noexcept(itemFirst) = std::move((*(*block)[index])))) {
+              while (index != endIndex) {
+                auto& el = *((*block)[index]);
+                *itemFirst++ = std::move(el);
+                el.~T();
+                ++index;
+              }
+            } else {
+              MOODYCAMEL_TRY {
+                while (index != endIndex) {
+                  auto& el = *((*block)[index]);
+                  *itemFirst = std::move(el);
+                  ++itemFirst;
+                  el.~T();
+                  ++index;
+                }
+              }
+              MOODYCAMEL_CATCH(...) {
+                do {
+                  entry = localBlockIndex->index[indexIndex];
+                  block = entry->value.load(std::memory_order_relaxed);
+                  while (index != endIndex) {
+                    (*block)[index++]->~T();
+                  }
+
+                  if (block->ConcurrentQueue::Block::template set_many_empty<implicit_context>(
+                          blockStartIndex, static_cast<size_t>(endIndex - blockStartIndex))) {
+#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX
+                    debug::DebugLock lock(mutex);
+#endif
+                    entry->value.store(nullptr, std::memory_order_relaxed);
+                    this->parent->add_block_to_free_list(block);
+                  }
+                  indexIndex = (indexIndex + 1) & (localBlockIndex->capacity - 1);
+
+                  blockStartIndex = index;
+                  endIndex = (index & ~static_cast<index_t>(BLOCK_SIZE - 1)) + static_cast<index_t>(BLOCK_SIZE);
+                  endIndex =
+                      details::circular_less_than<index_t>(firstIndex + static_cast<index_t>(actualCount), endIndex)
+                          ? firstIndex + static_cast<index_t>(actualCount)
+                          : endIndex;
+                } while (index != firstIndex + actualCount);
+
+                MOODYCAMEL_RETHROW;
+              }
+            }
+            if (block->ConcurrentQueue::Block::template set_many_empty<implicit_context>(
+                    blockStartIndex, static_cast<size_t>(endIndex - blockStartIndex))) {
+              {
+#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX
+                debug::DebugLock lock(mutex);
+#endif
+                // Note that the set_many_empty above did a release, meaning that anybody who acquires the block
+                // we're about to free can use it safely since our writes (and reads!) will have happened-before then.
+                entry->value.store(nullptr, std::memory_order_relaxed);
+              }
+              this->parent->add_block_to_free_list(block);  // releases the above store
+            }
+            indexIndex = (indexIndex + 1) & (localBlockIndex->capacity - 1);
+          } while (index != firstIndex + actualCount);
+
+          return actualCount;
+        } else {
+          this->dequeueOvercommit.fetch_add(desiredCount, std::memory_order_release);
+        }
+      }
+
+      return 0;
+    }
+
+   private:
+    // The block size must be > 1, so any number with the low bit set is an invalid block base index
+    static const index_t INVALID_BLOCK_BASE = 1;
+
+    struct BlockIndexEntry {
+      std::atomic<index_t> key;
+      std::atomic<Block*> value;
+    };
+
+    struct BlockIndexHeader {
+      size_t capacity;
+      std::atomic<size_t> tail;
+      BlockIndexEntry* entries;
+      BlockIndexEntry** index;
+      BlockIndexHeader* prev;
+    };
+
+    template <AllocationMode allocMode>
+    inline bool insert_block_index_entry(BlockIndexEntry*& idxEntry, index_t blockStartIndex) {
+      auto localBlockIndex = blockIndex.load(std::memory_order_relaxed);  // We're the only writer thread, relaxed is OK
+      if (localBlockIndex == nullptr) {
+        return false;  // this can happen if new_block_index failed in the constructor
+      }
+      auto newTail = (localBlockIndex->tail.load(std::memory_order_relaxed) + 1) & (localBlockIndex->capacity - 1);
+      idxEntry = localBlockIndex->index[newTail];
+      if (idxEntry->key.load(std::memory_order_relaxed) == INVALID_BLOCK_BASE ||
+          idxEntry->value.load(std::memory_order_relaxed) == nullptr) {
+        idxEntry->key.store(blockStartIndex, std::memory_order_relaxed);
+        localBlockIndex->tail.store(newTail, std::memory_order_release);
+        return true;
+      }
+
+      // No room in the old block index, try to allocate another one!
+      if (allocMode == CannotAlloc || !new_block_index()) {
+        return false;
+      }
+      localBlockIndex = blockIndex.load(std::memory_order_relaxed);
+      newTail = (localBlockIndex->tail.load(std::memory_order_relaxed) + 1) & (localBlockIndex->capacity - 1);
+      idxEntry = localBlockIndex->index[newTail];
+      assert(idxEntry->key.load(std::memory_order_relaxed) == INVALID_BLOCK_BASE);
+      idxEntry->key.store(blockStartIndex, std::memory_order_relaxed);
+      localBlockIndex->tail.store(newTail, std::memory_order_release);
+      return true;
+    }
+
+    inline void rewind_block_index_tail() {
+      auto localBlockIndex = blockIndex.load(std::memory_order_relaxed);
+      localBlockIndex->tail.store(
+          (localBlockIndex->tail.load(std::memory_order_relaxed) - 1) & (localBlockIndex->capacity - 1),
+          std::memory_order_relaxed);
+    }
+
+    inline BlockIndexEntry* get_block_index_entry_for_index(index_t index) const {
+      BlockIndexHeader* localBlockIndex;
+      auto idx = get_block_index_index_for_index(index, localBlockIndex);
+      return localBlockIndex->index[idx];
+    }
+
+    inline size_t get_block_index_index_for_index(index_t index, BlockIndexHeader*& localBlockIndex) const {
+#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX
+      debug::DebugLock lock(mutex);
+#endif
+      index &= ~static_cast<index_t>(BLOCK_SIZE - 1);
+      localBlockIndex = blockIndex.load(std::memory_order_acquire);
+      auto tail = localBlockIndex->tail.load(std::memory_order_acquire);
+      auto tailBase = localBlockIndex->index[tail]->key.load(std::memory_order_relaxed);
+      assert(tailBase != INVALID_BLOCK_BASE);
+      // Note: Must use division instead of shift because the index may wrap around, causing a negative
+      // offset, whose negativity we want to preserve
+      auto offset =
+          static_cast<size_t>(static_cast<typename std::make_signed<index_t>::type>(index - tailBase) / BLOCK_SIZE);
+      size_t idx = (tail + offset) & (localBlockIndex->capacity - 1);
+      assert(localBlockIndex->index[idx]->key.load(std::memory_order_relaxed) == index &&
+             localBlockIndex->index[idx]->value.load(std::memory_order_relaxed) != nullptr);
+      return idx;
+    }
+
+    bool new_block_index() {
+      auto prev = blockIndex.load(std::memory_order_relaxed);
+      size_t prevCapacity = prev == nullptr ? 0 : prev->capacity;
+      auto entryCount = prev == nullptr ? nextBlockIndexCapacity : prevCapacity;
+      auto raw = static_cast<char*>(
+          (Traits::malloc)(sizeof(BlockIndexHeader) + std::alignment_of<BlockIndexEntry>::value - 1 +
+                           sizeof(BlockIndexEntry) * entryCount + std::alignment_of<BlockIndexEntry*>::value - 1 +
+                           sizeof(BlockIndexEntry*) * nextBlockIndexCapacity));
+      if (raw == nullptr) {
+        return false;
+      }
+
+      auto header = new (raw) BlockIndexHeader;
+      auto entries =
+          reinterpret_cast<BlockIndexEntry*>(details::align_for<BlockIndexEntry>(raw + sizeof(BlockIndexHeader)));
+      auto index = reinterpret_cast<BlockIndexEntry**>(details::align_for<BlockIndexEntry*>(
+          reinterpret_cast<char*>(entries) + sizeof(BlockIndexEntry) * entryCount));
+      if (prev != nullptr) {
+        auto prevTail = prev->tail.load(std::memory_order_relaxed);
+        auto prevPos = prevTail;
+        size_t i = 0;
+        do {
+          prevPos = (prevPos + 1) & (prev->capacity - 1);
+          index[i++] = prev->index[prevPos];
+        } while (prevPos != prevTail);
+        assert(i == prevCapacity);
+      }
+      for (size_t i = 0; i != entryCount; ++i) {
+        new (entries + i) BlockIndexEntry;
+        entries[i].key.store(INVALID_BLOCK_BASE, std::memory_order_relaxed);
+        index[prevCapacity + i] = entries + i;
+      }
+      header->prev = prev;
+      header->entries = entries;
+      header->index = index;
+      header->capacity = nextBlockIndexCapacity;
+      header->tail.store((prevCapacity - 1) & (nextBlockIndexCapacity - 1), std::memory_order_relaxed);
+
+      blockIndex.store(header, std::memory_order_release);
+
+      nextBlockIndexCapacity <<= 1;
+
+      return true;
+    }
+
+   private:
+    size_t nextBlockIndexCapacity;
+    std::atomic<BlockIndexHeader*> blockIndex;
+
+#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED
+   public:
+    details::ThreadExitListener threadExitListener;
+
+   private:
+#endif
+
+#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG
+   public:
+    ImplicitProducer* nextImplicitProducer;
+
+   private:
+#endif
+
+#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX
+    mutable debug::DebugMutex mutex;
+#endif
+#if MCDBGQ_TRACKMEM
+    friend struct MemStats;
+#endif
+  };
+
+  //////////////////////////////////
+  // Block pool manipulation
+  //////////////////////////////////
+
+  void populate_initial_block_list(size_t blockCount) {
+    initialBlockPoolSize = blockCount;
+    if (initialBlockPoolSize == 0) {
+      initialBlockPool = nullptr;
+      return;
+    }
+
+    initialBlockPool = create_array<Block>(blockCount);
+    if (initialBlockPool == nullptr) {
+      initialBlockPoolSize = 0;
+    }
+    for (size_t i = 0; i < initialBlockPoolSize; ++i) {
+      initialBlockPool[i].dynamicallyAllocated = false;
+    }
+  }
+
+  inline Block* try_get_block_from_initial_pool() {
+    if (initialBlockPoolIndex.load(std::memory_order_relaxed) >= initialBlockPoolSize) {
+      return nullptr;
+    }
+
+    auto index = initialBlockPoolIndex.fetch_add(1, std::memory_order_relaxed);
+
+    return index < initialBlockPoolSize ? (initialBlockPool + index) : nullptr;
+  }
+
+  inline void add_block_to_free_list(Block* block) {
+#if MCDBGQ_TRACKMEM
+    block->owner = nullptr;
+#endif
+    freeList.add(block);
+  }
+
+  inline void add_blocks_to_free_list(Block* block) {
+    while (block != nullptr) {
+      auto next = block->next;
+      add_block_to_free_list(block);
+      block = next;
+    }
+  }
+
+  inline Block* try_get_block_from_free_list() {
+    return freeList.try_get();
+  }
+
+  // Gets a free block from one of the memory pools, or allocates a new one (if applicable)
+  template <AllocationMode canAlloc>
+  Block* requisition_block() {
+    auto block = try_get_block_from_initial_pool();
+    if (block != nullptr) {
+      return block;
+    }
+
+    block = try_get_block_from_free_list();
+    if (block != nullptr) {
+      return block;
+    }
+
+    if (canAlloc == CanAlloc) {
+      return create<Block>();
+    }
+
+    return nullptr;
+  }
+
+#if MCDBGQ_TRACKMEM
+ public:
+  struct MemStats {
+    size_t allocatedBlocks;
+    size_t usedBlocks;
+    size_t freeBlocks;
+    size_t ownedBlocksExplicit;
+    size_t ownedBlocksImplicit;
+    size_t implicitProducers;
+    size_t explicitProducers;
+    size_t elementsEnqueued;
+    size_t blockClassBytes;
+    size_t queueClassBytes;
+    size_t implicitBlockIndexBytes;
+    size_t explicitBlockIndexBytes;
+
+    friend class ConcurrentQueue;
+
+   private:
+    static MemStats getFor(ConcurrentQueue* q) {
+      MemStats stats = {0};
+
+      stats.elementsEnqueued = q->size_approx();
+
+      auto block = q->freeList.head_unsafe();
+      while (block != nullptr) {
+        ++stats.allocatedBlocks;
+        ++stats.freeBlocks;
+        block = block->freeListNext.load(std::memory_order_relaxed);
+      }
+
+      for (auto ptr = q->producerListTail.load(std::memory_order_acquire); ptr != nullptr; ptr = ptr->next_prod()) {
+        bool implicit = dynamic_cast<ImplicitProducer*>(ptr) != nullptr;
+        stats.implicitProducers += implicit ? 1 : 0;
+        stats.explicitProducers += implicit ? 0 : 1;
+
+        if (implicit) {
+          auto prod = static_cast<ImplicitProducer*>(ptr);
+          stats.queueClassBytes += sizeof(ImplicitProducer);
+          auto head = prod->headIndex.load(std::memory_order_relaxed);
+          auto tail = prod->tailIndex.load(std::memory_order_relaxed);
+          auto hash = prod->blockIndex.load(std::memory_order_relaxed);
+          if (hash != nullptr) {
+            for (size_t i = 0; i != hash->capacity; ++i) {
+              if (hash->index[i]->key.load(std::memory_order_relaxed) != ImplicitProducer::INVALID_BLOCK_BASE &&
+                  hash->index[i]->value.load(std::memory_order_relaxed) != nullptr) {
+                ++stats.allocatedBlocks;
+                ++stats.ownedBlocksImplicit;
+              }
+            }
+            stats.implicitBlockIndexBytes += hash->capacity * sizeof(typename ImplicitProducer::BlockIndexEntry);
+            for (; hash != nullptr; hash = hash->prev) {
+              stats.implicitBlockIndexBytes += sizeof(typename ImplicitProducer::BlockIndexHeader) +
+                                               hash->capacity * sizeof(typename ImplicitProducer::BlockIndexEntry*);
+            }
+          }
+          for (; details::circular_less_than<index_t>(head, tail); head += BLOCK_SIZE) {
+            //auto block = prod->get_block_index_entry_for_index(head);
+            ++stats.usedBlocks;
+          }
+        } else {
+          auto prod = static_cast<ExplicitProducer*>(ptr);
+          stats.queueClassBytes += sizeof(ExplicitProducer);
+          auto tailBlock = prod->tailBlock;
+          bool wasNonEmpty = false;
+          if (tailBlock != nullptr) {
+            auto block = tailBlock;
+            do {
+              ++stats.allocatedBlocks;
+              if (!block->ConcurrentQueue::Block::template is_empty<explicit_context>() || wasNonEmpty) {
+                ++stats.usedBlocks;
+                wasNonEmpty = wasNonEmpty || block != tailBlock;
+              }
+              ++stats.ownedBlocksExplicit;
+              block = block->next;
+            } while (block != tailBlock);
+          }
+          auto index = prod->blockIndex.load(std::memory_order_relaxed);
+          while (index != nullptr) {
+            stats.explicitBlockIndexBytes += sizeof(typename ExplicitProducer::BlockIndexHeader) +
+                                             index->size * sizeof(typename ExplicitProducer::BlockIndexEntry);
+            index = static_cast<typename ExplicitProducer::BlockIndexHeader*>(index->prev);
+          }
+        }
+      }
+
+      auto freeOnInitialPool = q->initialBlockPoolIndex.load(std::memory_order_relaxed) >= q->initialBlockPoolSize
+                                   ? 0
+                                   : q->initialBlockPoolSize - q->initialBlockPoolIndex.load(std::memory_order_relaxed);
+      stats.allocatedBlocks += freeOnInitialPool;
+      stats.freeBlocks += freeOnInitialPool;
+
+      stats.blockClassBytes = sizeof(Block) * stats.allocatedBlocks;
+      stats.queueClassBytes += sizeof(ConcurrentQueue);
+
+      return stats;
+    }
+  };
+
+  // For debugging only. Not thread-safe.
+  MemStats getMemStats() {
+    return MemStats::getFor(this);
+  }
+
+ private:
+  friend struct MemStats;
+#endif
+
+  //////////////////////////////////
+  // Producer list manipulation
+  //////////////////////////////////
+
+  ProducerBase* recycle_or_create_producer(bool isExplicit) {
+    bool recycled;
+    return recycle_or_create_producer(isExplicit, recycled);
+  }
+
+  ProducerBase* recycle_or_create_producer(bool isExplicit, bool& recycled) {
+#if MCDBGQ_NOLOCKFREE_IMPLICITPRODHASH
+    debug::DebugLock lock(implicitProdMutex);
+#endif
+    // Try to re-use one first
+    for (auto ptr = producerListTail.load(std::memory_order_acquire); ptr != nullptr; ptr = ptr->next_prod()) {
+      if (ptr->inactive.load(std::memory_order_relaxed) && ptr->isExplicit == isExplicit) {
+        bool expected = true;
+        if (ptr->inactive.compare_exchange_strong(expected, /* desired */ false, std::memory_order_acquire,
+                                                  std::memory_order_relaxed)) {
+          // We caught one! It's been marked as activated, the caller can have it
+          recycled = true;
+          return ptr;
+        }
+      }
+    }
+
+    recycled = false;
+    return add_producer(isExplicit ? static_cast<ProducerBase*>(create<ExplicitProducer>(this))
+                                   : create<ImplicitProducer>(this));
+  }
+
+  ProducerBase* add_producer(ProducerBase* producer) {
+    // Handle failed memory allocation
+    if (producer == nullptr) {
+      return nullptr;
+    }
+
+    producerCount.fetch_add(1, std::memory_order_relaxed);
+
+    // Add it to the lock-free list
+    auto prevTail = producerListTail.load(std::memory_order_relaxed);
+    do {
+      producer->next = prevTail;
+    } while (!producerListTail.compare_exchange_weak(prevTail, producer, std::memory_order_release,
+                                                     std::memory_order_relaxed));
+
+#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG
+    if (producer->isExplicit) {
+      auto prevTailExplicit = explicitProducers.load(std::memory_order_relaxed);
+      do {
+        static_cast<ExplicitProducer*>(producer)->nextExplicitProducer = prevTailExplicit;
+      } while (!explicitProducers.compare_exchange_weak(prevTailExplicit, static_cast<ExplicitProducer*>(producer),
+                                                        std::memory_order_release, std::memory_order_relaxed));
+    } else {
+      auto prevTailImplicit = implicitProducers.load(std::memory_order_relaxed);
+      do {
+        static_cast<ImplicitProducer*>(producer)->nextImplicitProducer = prevTailImplicit;
+      } while (!implicitProducers.compare_exchange_weak(prevTailImplicit, static_cast<ImplicitProducer*>(producer),
+                                                        std::memory_order_release, std::memory_order_relaxed));
+    }
+#endif
+
+    return producer;
+  }
+
+  void reown_producers() {
+    // After another instance is moved-into/swapped-with this one, all the
+    // producers we stole still think their parents are the other queue.
+    // So fix them up!
+    for (auto ptr = producerListTail.load(std::memory_order_relaxed); ptr != nullptr; ptr = ptr->next_prod()) {
+      ptr->parent = this;
+    }
+  }
+
+  //////////////////////////////////
+  // Implicit producer hash
+  //////////////////////////////////
+
+  struct ImplicitProducerKVP {
+    std::atomic<details::thread_id_t> key;
+    ImplicitProducer*
+        value;  // No need for atomicity since it's only read by the thread that sets it in the first place
+
+    ImplicitProducerKVP() : value(nullptr) {
+    }
+
+    ImplicitProducerKVP(ImplicitProducerKVP&& other) MOODYCAMEL_NOEXCEPT {
+      key.store(other.key.load(std::memory_order_relaxed), std::memory_order_relaxed);
+      value = other.value;
+    }
+
+    inline ImplicitProducerKVP& operator=(ImplicitProducerKVP&& other) MOODYCAMEL_NOEXCEPT {
+      swap(other);
+      return *this;
+    }
+
+    inline void swap(ImplicitProducerKVP& other) MOODYCAMEL_NOEXCEPT {
+      if (this != &other) {
+        details::swap_relaxed(key, other.key);
+        std::swap(value, other.value);
+      }
+    }
+  };
+
+  template <typename XT, typename XTraits>
+  friend void moodycamel::swap(typename ConcurrentQueue<XT, XTraits>::ImplicitProducerKVP&,
+                               typename ConcurrentQueue<XT, XTraits>::ImplicitProducerKVP&) MOODYCAMEL_NOEXCEPT;
+
+  struct ImplicitProducerHash {
+    size_t capacity;
+    ImplicitProducerKVP* entries;
+    ImplicitProducerHash* prev;
+  };
+
+  inline void populate_initial_implicit_producer_hash() {
+    if (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0)
+      return;
+
+    implicitProducerHashCount.store(0, std::memory_order_relaxed);
+    auto hash = &initialImplicitProducerHash;
+    hash->capacity = INITIAL_IMPLICIT_PRODUCER_HASH_SIZE;
+    hash->entries = &initialImplicitProducerHashEntries[0];
+    for (size_t i = 0; i != INITIAL_IMPLICIT_PRODUCER_HASH_SIZE; ++i) {
+      initialImplicitProducerHashEntries[i].key.store(details::invalid_thread_id, std::memory_order_relaxed);
+    }
+    hash->prev = nullptr;
+    implicitProducerHash.store(hash, std::memory_order_relaxed);
+  }
+
+  void swap_implicit_producer_hashes(ConcurrentQueue& other) {
+    if (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0)
+      return;
+
+    // Swap (assumes our implicit producer hash is initialized)
+    initialImplicitProducerHashEntries.swap(other.initialImplicitProducerHashEntries);
+    initialImplicitProducerHash.entries = &initialImplicitProducerHashEntries[0];
+    other.initialImplicitProducerHash.entries = &other.initialImplicitProducerHashEntries[0];
+
+    details::swap_relaxed(implicitProducerHashCount, other.implicitProducerHashCount);
+
+    details::swap_relaxed(implicitProducerHash, other.implicitProducerHash);
+    if (implicitProducerHash.load(std::memory_order_relaxed) == &other.initialImplicitProducerHash) {
+      implicitProducerHash.store(&initialImplicitProducerHash, std::memory_order_relaxed);
+    } else {
+      ImplicitProducerHash* hash;
+      for (hash = implicitProducerHash.load(std::memory_order_relaxed);
+           hash->prev != &other.initialImplicitProducerHash; hash = hash->prev) {
+        continue;
+      }
+      hash->prev = &initialImplicitProducerHash;
+    }
+    if (other.implicitProducerHash.load(std::memory_order_relaxed) == &initialImplicitProducerHash) {
+      other.implicitProducerHash.store(&other.initialImplicitProducerHash, std::memory_order_relaxed);
+    } else {
+      ImplicitProducerHash* hash;
+      for (hash = other.implicitProducerHash.load(std::memory_order_relaxed);
+           hash->prev != &initialImplicitProducerHash; hash = hash->prev) {
+        continue;
+      }
+      hash->prev = &other.initialImplicitProducerHash;
+    }
+  }
+
+  // Only fails (returns nullptr) if memory allocation fails
+  ImplicitProducer* get_or_add_implicit_producer() {
+    // Note that since the data is essentially thread-local (key is thread ID),
+    // there's a reduced need for fences (memory ordering is already consistent
+    // for any individual thread), except for the current table itself.
+
+    // Start by looking for the thread ID in the current and all previous hash tables.
+    // If it's not found, it must not be in there yet, since this same thread would
+    // have added it previously to one of the tables that we traversed.
+
+    // Code and algorithm adapted from http://preshing.com/20130605/the-worlds-simplest-lock-free-hash-table
+
+#if MCDBGQ_NOLOCKFREE_IMPLICITPRODHASH
+    debug::DebugLock lock(implicitProdMutex);
+#endif
+
+    auto id = details::thread_id();
+    auto hashedId = details::hash_thread_id(id);
+
+    auto mainHash = implicitProducerHash.load(std::memory_order_acquire);
+    for (auto hash = mainHash; hash != nullptr; hash = hash->prev) {
+      // Look for the id in this hash
+      auto index = hashedId;
+      while (true) {  // Not an infinite loop because at least one slot is free in the hash table
+        index &= hash->capacity - 1;
+
+        auto probedKey = hash->entries[index].key.load(std::memory_order_relaxed);
+        if (probedKey == id) {
+          // Found it! If we had to search several hashes deep, though, we should lazily add it
+          // to the current main hash table to avoid the extended search next time.
+          // Note there's guaranteed to be room in the current hash table since every subsequent
+          // table implicitly reserves space for all previous tables (there's only one
+          // implicitProducerHashCount).
+          auto value = hash->entries[index].value;
+          if (hash != mainHash) {
+            index = hashedId;
+            while (true) {
+              index &= mainHash->capacity - 1;
+              probedKey = mainHash->entries[index].key.load(std::memory_order_relaxed);
+              auto empty = details::invalid_thread_id;
+#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED
+              auto reusable = details::invalid_thread_id2;
+              if ((probedKey == empty && mainHash->entries[index].key.compare_exchange_strong(
+                                             empty, id, std::memory_order_relaxed, std::memory_order_relaxed)) ||
+                  (probedKey == reusable && mainHash->entries[index].key.compare_exchange_strong(
+                                                reusable, id, std::memory_order_acquire, std::memory_order_acquire))) {
+#else
+              if ((probedKey == empty && mainHash->entries[index].key.compare_exchange_strong(
+                                             empty, id, std::memory_order_relaxed, std::memory_order_relaxed))) {
+#endif
+                mainHash->entries[index].value = value;
+                break;
+              }
+              ++index;
+            }
+          }
+
+          return value;
+        }
+        if (probedKey == details::invalid_thread_id) {
+          break;  // Not in this hash table
+        }
+        ++index;
+      }
+    }
+
+    // Insert!
+    auto newCount = 1 + implicitProducerHashCount.fetch_add(1, std::memory_order_relaxed);
+    while (true) {
+      if (newCount >= (mainHash->capacity >> 1) &&
+          !implicitProducerHashResizeInProgress.test_and_set(std::memory_order_acquire)) {
+        // We've acquired the resize lock, try to allocate a bigger hash table.
+        // Note the acquire fence synchronizes with the release fence at the end of this block, and hence when
+        // we reload implicitProducerHash it must be the most recent version (it only gets changed within this
+        // locked block).
+        mainHash = implicitProducerHash.load(std::memory_order_acquire);
+        if (newCount >= (mainHash->capacity >> 1)) {
+          auto newCapacity = mainHash->capacity << 1;
+          while (newCount >= (newCapacity >> 1)) {
+            newCapacity <<= 1;
+          }
+          auto raw = static_cast<char*>((Traits::malloc)(sizeof(ImplicitProducerHash) +
+                                                         std::alignment_of<ImplicitProducerKVP>::value - 1 +
+                                                         sizeof(ImplicitProducerKVP) * newCapacity));
+          if (raw == nullptr) {
+            // Allocation failed
+            implicitProducerHashCount.fetch_sub(1, std::memory_order_relaxed);
+            implicitProducerHashResizeInProgress.clear(std::memory_order_relaxed);
+            return nullptr;
+          }
+
+          auto newHash = new (raw) ImplicitProducerHash;
+          newHash->capacity = newCapacity;
+          newHash->entries = reinterpret_cast<ImplicitProducerKVP*>(
+              details::align_for<ImplicitProducerKVP>(raw + sizeof(ImplicitProducerHash)));
+          for (size_t i = 0; i != newCapacity; ++i) {
+            new (newHash->entries + i) ImplicitProducerKVP;
+            newHash->entries[i].key.store(details::invalid_thread_id, std::memory_order_relaxed);
+          }
+          newHash->prev = mainHash;
+          implicitProducerHash.store(newHash, std::memory_order_release);
+          implicitProducerHashResizeInProgress.clear(std::memory_order_release);
+          mainHash = newHash;
+        } else {
+          implicitProducerHashResizeInProgress.clear(std::memory_order_release);
+        }
+      }
+
+      // If it's < three-quarters full, add to the old one anyway so that we don't have to wait for the next table
+      // to finish being allocated by another thread (and if we just finished allocating above, the condition will
+      // always be true)
+      if (newCount < (mainHash->capacity >> 1) + (mainHash->capacity >> 2)) {
+        bool recycled;
+        auto producer = static_cast<ImplicitProducer*>(recycle_or_create_producer(false, recycled));
+        if (producer == nullptr) {
+          implicitProducerHashCount.fetch_sub(1, std::memory_order_relaxed);
+          return nullptr;
+        }
+        if (recycled) {
+          implicitProducerHashCount.fetch_sub(1, std::memory_order_relaxed);
+        }
+
+#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED
+        producer->threadExitListener.callback = &ConcurrentQueue::implicit_producer_thread_exited_callback;
+        producer->threadExitListener.userData = producer;
+        details::ThreadExitNotifier::subscribe(&producer->threadExitListener);
+#endif
+
+        auto index = hashedId;
+        while (true) {
+          index &= mainHash->capacity - 1;
+          auto probedKey = mainHash->entries[index].key.load(std::memory_order_relaxed);
+
+          auto empty = details::invalid_thread_id;
+#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED
+          auto reusable = details::invalid_thread_id2;
+          if ((probedKey == empty && mainHash->entries[index].key.compare_exchange_strong(
+                                         empty, id, std::memory_order_relaxed, std::memory_order_relaxed)) ||
+              (probedKey == reusable && mainHash->entries[index].key.compare_exchange_strong(
+                                            reusable, id, std::memory_order_acquire, std::memory_order_acquire))) {
+#else
+          if ((probedKey == empty && mainHash->entries[index].key.compare_exchange_strong(
+                                         empty, id, std::memory_order_relaxed, std::memory_order_relaxed))) {
+#endif
+            mainHash->entries[index].value = producer;
+            break;
+          }
+          ++index;
+        }
+        return producer;
+      }
+
+      // Hmm, the old hash is quite full and somebody else is busy allocating a new one.
+      // We need to wait for the allocating thread to finish (if it succeeds, we add, if not,
+      // we try to allocate ourselves).
+      mainHash = implicitProducerHash.load(std::memory_order_acquire);
+    }
+  }  // namespace moodycamel
+
+#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED
+  void implicit_producer_thread_exited(ImplicitProducer* producer) {
+    // Remove from thread exit listeners
+    details::ThreadExitNotifier::unsubscribe(&producer->threadExitListener);
+
+// Remove from hash
+#if MCDBGQ_NOLOCKFREE_IMPLICITPRODHASH
+    debug::DebugLock lock(implicitProdMutex);
+#endif
+    auto hash = implicitProducerHash.load(std::memory_order_acquire);
+    assert(hash !=
+           nullptr);  // The thread exit listener is only registered if we were added to a hash in the first place
+    auto id = details::thread_id();
+    auto hashedId = details::hash_thread_id(id);
+    details::thread_id_t probedKey;
+
+    // We need to traverse all the hashes just in case other threads aren't on the current one yet and are
+    // trying to add an entry thinking there's a free slot (because they reused a producer)
+    for (; hash != nullptr; hash = hash->prev) {
+      auto index = hashedId;
+      do {
+        index &= hash->capacity - 1;
+        probedKey = hash->entries[index].key.load(std::memory_order_relaxed);
+        if (probedKey == id) {
+          hash->entries[index].key.store(details::invalid_thread_id2, std::memory_order_release);
+          break;
+        }
+        ++index;
+      } while (
+          probedKey !=
+          details::
+              invalid_thread_id);  // Can happen if the hash has changed but we weren't put back in it yet, or if we weren't added to this hash in the first place
+    }
+
+    // Mark the queue as being recyclable
+    producer->inactive.store(true, std::memory_order_release);
+  }
+
+  static void implicit_producer_thread_exited_callback(void* userData) {
+    auto producer = static_cast<ImplicitProducer*>(userData);
+    auto queue = producer->parent;
+    queue->implicit_producer_thread_exited(producer);
+  }
+#endif
+
+  //////////////////////////////////
+  // Utility functions
+  //////////////////////////////////
+
+  template <typename U>
+  static inline U* create_array(size_t count) {
+    assert(count > 0);
+    auto p = static_cast<U*>((Traits::malloc)(sizeof(U) * count));
+    if (p == nullptr) {
+      return nullptr;
+    }
+
+    for (size_t i = 0; i != count; ++i) {
+      new (p + i) U();
+    }
+    return p;
+  }
+
+  template <typename U>
+  static inline void destroy_array(U* p, size_t count) {
+    if (p != nullptr) {
+      assert(count > 0);
+      for (size_t i = count; i != 0;) {
+        (p + --i)->~U();
+      }
+      (Traits::free)(p);
+    }
+  }
+
+  template <typename U>
+  static inline U* create() {
+    auto p = (Traits::malloc)(sizeof(U));
+    return p != nullptr ? new (p) U : nullptr;
+  }
+
+  template <typename U, typename A1>
+  static inline U* create(A1&& a1) {
+    auto p = (Traits::malloc)(sizeof(U));
+    return p != nullptr ? new (p) U(std::forward<A1>(a1)) : nullptr;
+  }
+
+  template <typename U>
+  static inline void destroy(U* p) {
+    if (p != nullptr) {
+      p->~U();
+    }
+    (Traits::free)(p);
+  }
+
+ private:
+  std::atomic<ProducerBase*> producerListTail;
+  std::atomic<std::uint32_t> producerCount;
+
+  std::atomic<size_t> initialBlockPoolIndex;
+  Block* initialBlockPool;
+  size_t initialBlockPoolSize;
+
+#if !MCDBGQ_USEDEBUGFREELIST
+  FreeList<Block> freeList;
+#else
+  debug::DebugFreeList<Block> freeList;
+#endif
+
+  std::atomic<ImplicitProducerHash*> implicitProducerHash;
+  std::atomic<size_t> implicitProducerHashCount;  // Number of slots logically used
+  ImplicitProducerHash initialImplicitProducerHash;
+  std::array<ImplicitProducerKVP, INITIAL_IMPLICIT_PRODUCER_HASH_SIZE> initialImplicitProducerHashEntries;
+  std::atomic_flag implicitProducerHashResizeInProgress;
+
+  std::atomic<std::uint32_t> nextExplicitConsumerId;
+  std::atomic<std::uint32_t> globalExplicitConsumerOffset;
+
+#if MCDBGQ_NOLOCKFREE_IMPLICITPRODHASH
+  debug::DebugMutex implicitProdMutex;
+#endif
+
+#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG
+  std::atomic<ExplicitProducer*> explicitProducers;
+  std::atomic<ImplicitProducer*> implicitProducers;
+#endif
+};
+
+template <typename T, typename Traits>
+ProducerToken::ProducerToken(ConcurrentQueue<T, Traits>& queue) : producer(queue.recycle_or_create_producer(true)) {
+  if (producer != nullptr) {
+    producer->token = this;
+  }
+}
+
+template <typename T, typename Traits>
+ProducerToken::ProducerToken(BlockingConcurrentQueue<T, Traits>& queue)
+    : producer(reinterpret_cast<ConcurrentQueue<T, Traits>*>(&queue)->recycle_or_create_producer(true)) {
+  if (producer != nullptr) {
+    producer->token = this;
+  }
+}
+
+template <typename T, typename Traits>
+ConsumerToken::ConsumerToken(ConcurrentQueue<T, Traits>& queue)
+    : itemsConsumedFromCurrent(0), currentProducer(nullptr), desiredProducer(nullptr) {
+  initialOffset = queue.nextExplicitConsumerId.fetch_add(1, std::memory_order_release);
+  lastKnownGlobalOffset = -1;
+}
+
+template <typename T, typename Traits>
+ConsumerToken::ConsumerToken(BlockingConcurrentQueue<T, Traits>& queue)
+    : itemsConsumedFromCurrent(0), currentProducer(nullptr), desiredProducer(nullptr) {
+  initialOffset = reinterpret_cast<ConcurrentQueue<T, Traits>*>(&queue)->nextExplicitConsumerId.fetch_add(
+      1, std::memory_order_release);
+  lastKnownGlobalOffset = -1;
+}
+
+template <typename T, typename Traits>
+inline void swap(ConcurrentQueue<T, Traits>& a, ConcurrentQueue<T, Traits>& b) MOODYCAMEL_NOEXCEPT {
+  a.swap(b);
+}
+
+inline void swap(ProducerToken& a, ProducerToken& b) MOODYCAMEL_NOEXCEPT {
+  a.swap(b);
+}
+
+inline void swap(ConsumerToken& a, ConsumerToken& b) MOODYCAMEL_NOEXCEPT {
+  a.swap(b);
+}
+
+template <typename T, typename Traits>
+inline void swap(typename ConcurrentQueue<T, Traits>::ImplicitProducerKVP& a,
+                 typename ConcurrentQueue<T, Traits>::ImplicitProducerKVP& b) MOODYCAMEL_NOEXCEPT {
+  a.swap(b);
+}
+
+}  // namespace moodycamel
+
+#if defined(__GNUC__)
+#pragma GCC diagnostic pop
+#endif
diff --git a/submodules/ton/tonlib-src/tdactor/benchmark/third_party/mp-queue.c b/submodules/ton/tonlib-src/tdactor/benchmark/third_party/mp-queue.c
new file mode 100644
index 0000000000..8fcebbf1a0
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/benchmark/third_party/mp-queue.c
@@ -0,0 +1,684 @@
+/*
+    This file is part of KittenDB-Engine Library.
+
+    KittenDB-Engine Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    KittenDB-Engine Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with KittenDB-Engine Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2014-2016 Telegraph Inc
+              2014-2016 Nikolai Durov
+              2014      Andrey Lopatin
+*/
+
+char disable_linker_warning_about_empty_file_mp_queue_cpp;
+
+#ifdef TG_LCR_QUEUE
+#include <assert.h>
+#include <errno.h>
+#include <pthread.h>
+#include <signal.h>
+#include <stddef.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include <unistd.h>
+
+#include <linux/futex.h>
+#include <sys/syscall.h>
+
+#include "mp-queue.h"
+
+#undef assert
+#ifndef assert
+#define assert(x) x
+#endif
+
+volatile int mpq_blocks_allocated, mpq_blocks_allocated_max, mpq_blocks_allocations, mpq_blocks_true_allocations,
+    mpq_blocks_wasted, mpq_blocks_prepared;
+volatile int mpq_small_blocks_allocated, mpq_small_blocks_allocated_max;
+
+__thread int mpq_this_thread_id;
+__thread void **thread_hazard_pointers;
+volatile int mpq_threads;
+
+struct mp_queue MqGarbageBlocks, MqPreparedBlocks;
+struct mp_queue MqGarbageSmallBlocks, MqPreparedSmallBlocks;
+
+static inline void barrier(void) {
+  asm volatile("" : : : "memory");
+}
+static inline void mfence(void) {
+  asm volatile("mfence" : : : "memory");
+}
+
+/* hazard pointers, one per thread */
+
+void *mqb_hazard_ptr[MAX_MPQ_THREADS][THREAD_HPTRS] __attribute__((aligned(64)));
+
+int is_hazard_ptr(void *ptr, int a, int b) {
+  barrier();
+  int k = mpq_threads, q = mpq_this_thread_id;
+  barrier();
+  int i, j, r = 0;
+  for (j = a; j <= b; j++) {
+    if (mqb_hazard_ptr[q][j] == ptr) {
+      r = 1;
+      break;
+    }
+  }
+  for (i = 1; i <= k; i++) {
+    if (i == q) {
+      continue;
+    }
+    for (j = a; j <= b; j++) {
+      if (mqb_hazard_ptr[i][j] == ptr) {
+        barrier();
+        return r + 2;
+      }
+    }
+  }
+  barrier();
+  return r;
+}
+
+void clear_thread_ids() {
+  mpq_threads = 0;
+  mpq_this_thread_id = 0;
+}
+/* initialize this thread id and return it */
+int get_this_thread_id(void) {
+  int i = mpq_this_thread_id;
+  if (i) {
+    return i;
+  }
+  i = __sync_fetch_and_add(&mpq_threads, 1) + 1;
+  assert(i > 0 && i < MAX_MPQ_THREADS);
+  thread_hazard_pointers = mqb_hazard_ptr[i];
+  return mpq_this_thread_id = i;
+}
+
+/* custom semaphore implementation using futexes */
+
+int mp_sem_post(mp_sem_t *sem) {
+  __sync_fetch_and_add(&sem->value, 1);
+  if (sem->waiting > 0) {
+    syscall(__NR_futex, &sem->value, FUTEX_WAKE, 1, NULL, 0, 0);
+  }
+  return 0;
+}
+
+int mp_sem_wait(mp_sem_t *sem) {
+  int v = sem->value, q = 0;
+  while (1) {
+    if (v > 0) {
+      v = __sync_fetch_and_add(&sem->value, -1);
+      if (v > 0) {
+        return 0;
+      }
+      v = __sync_add_and_fetch(&sem->value, 1);
+    } else {
+      if (v < 0 && q++ < 10) {
+        barrier();
+        v = sem->value;
+        continue;
+      }
+      __sync_fetch_and_add(&sem->waiting, 1);
+      syscall(__NR_futex, &sem->value, FUTEX_WAIT, v, NULL, 0, 0);
+      __sync_fetch_and_add(&sem->waiting, -1);
+      v = sem->value;
+      q = 0;
+    }
+  }
+}
+
+int mp_sem_trywait(mp_sem_t *sem) {
+  int v = sem->value;
+  if (v > 0) {
+    v = __sync_fetch_and_add(&sem->value, -1);
+    if (v > 0) {
+      return 0;
+    }
+    __sync_fetch_and_add(&sem->value, 1);
+  }
+  return -1;
+}
+
+/* functions for one mp_queue_block */
+
+// may invoke mpq_pop()/mpq_push() if allow_recursion=1
+struct mp_queue_block *alloc_mpq_block(mqn_value_t first_val, int allow_recursion, int is_small) {
+  is_small = 0;
+  struct mp_queue_block *QB = 0;
+  int prepared = 0, align_bytes = 0;
+  long size = (is_small ? MPQ_SMALL_BLOCK_SIZE : MPQ_BLOCK_SIZE);
+  if (allow_recursion) {
+    QB = mpq_pop(is_small ? &MqGarbageSmallBlocks : &MqGarbageBlocks, MPQF_RECURSIVE);
+    if (QB) {
+      if (!is_hazard_ptr(QB, 0, 2)) {
+        // reclaiming garbage
+        assert(QB->mqb_magic == MQ_BLOCK_GARBAGE_MAGIC);
+        __sync_fetch_and_add(&mpq_blocks_wasted, -1);
+        align_bytes = QB->mqb_align_bytes;
+      } else {
+        mpq_push(is_small ? &MqGarbageSmallBlocks : &MqGarbageBlocks, QB, MPQF_RECURSIVE);
+        QB = 0;
+      }
+    }
+    if (!QB) {
+      QB = mpq_pop(is_small ? &MqPreparedSmallBlocks : &MqPreparedBlocks, MPQF_RECURSIVE);
+      if (QB) {
+        assert(QB->mqb_magic == MQ_BLOCK_PREPARED_MAGIC);
+        prepared = 1;
+        __sync_fetch_and_add(&mpq_blocks_prepared, -1);
+        align_bytes = QB->mqb_align_bytes;
+      }
+    }
+  }
+  if (!QB) {
+    char *new_block = malloc(offsetof(struct mp_queue_block, mqb_nodes) + size * (2 * sizeof(void *)) +
+                             MPQ_BLOCK_ALIGNMENT - sizeof(void *));
+    assert(new_block);
+    assert(!((long)new_block & (sizeof(void *) - 1)));
+    align_bytes = -(int)(long)new_block & (MPQ_BLOCK_ALIGNMENT - 1);
+    QB = (struct mp_queue_block *)(new_block + align_bytes);
+
+    __sync_fetch_and_add(&mpq_blocks_true_allocations, 1);
+    if (is_small) {
+      int t = __sync_fetch_and_add(&mpq_small_blocks_allocated, 1);
+      if (t >= mpq_small_blocks_allocated_max) {
+        __sync_bool_compare_and_swap(&mpq_small_blocks_allocated_max, mpq_small_blocks_allocated_max, t + 1);
+      }
+    } else {
+      int t = __sync_fetch_and_add(&mpq_blocks_allocated, 1);
+      if (t >= mpq_blocks_allocated_max) {
+        __sync_bool_compare_and_swap(&mpq_blocks_allocated_max, mpq_blocks_allocated_max, t + 1);
+      }
+    }
+  } else {
+    assert(QB->mqb_size == size);
+  }
+  __sync_fetch_and_add(&mpq_blocks_allocations, 1);
+
+  memset(QB, 0, offsetof(struct mp_queue_block, mqb_nodes));
+  QB->mqb_align_bytes = align_bytes;
+  QB->mqb_size = size;
+
+  QB->mqb_nodes[0].idx = MQN_SAFE;
+  QB->mqb_nodes[0].val = first_val;
+
+  if (!prepared) {
+    long i;
+    for (i = 1; i < size; i++) {
+      QB->mqb_nodes[i].idx = MQN_SAFE + i;
+      QB->mqb_nodes[i].val = 0;
+    }
+  }
+
+  if (first_val) {
+    QB->mqb_tail = 1;
+  }
+
+  QB->mqb_magic = MQ_BLOCK_USED_MAGIC;
+  return QB;
+}
+
+void free_mpq_block(struct mp_queue_block *QB) {
+  assert(QB->mqb_magic == MQ_BLOCK_USED_MAGIC);
+  assert((unsigned)QB->mqb_align_bytes < MPQ_BLOCK_ALIGNMENT && !(QB->mqb_align_bytes & (sizeof(void *) - 1)));
+  QB->mqb_magic = MQ_BLOCK_FREE_MAGIC;
+  if (QB->mqb_size == MPQ_SMALL_BLOCK_SIZE) {
+    __sync_fetch_and_add(&mpq_small_blocks_allocated, -1);
+  } else {
+    assert(QB->mqb_size == MPQ_BLOCK_SIZE);
+    __sync_fetch_and_add(&mpq_blocks_allocated, -1);
+  }
+  free((char *)QB - QB->mqb_align_bytes);
+}
+
+static inline void mpq_fix_state(struct mp_queue_block *QB) {
+  long h, t;
+  while (1) {
+    barrier();
+    t = QB->mqb_tail;
+    barrier();
+    h = QB->mqb_head;
+    barrier();
+    if ((unsigned long)h <= (unsigned long)t) {
+      break;
+    }
+    if (QB->mqb_tail != t) {
+      continue;
+    }
+    // here tail < head ; try to advance tail to head
+    // (or to some value h such that tail < h <= head)
+    if (__sync_bool_compare_and_swap(&QB->mqb_tail, t, h)) {
+      break;
+    }
+  }
+}
+
+mqn_value_t mpq_block_pop(struct mp_queue_block *QB) {
+  // fprintf (stderr, "%d:mpq_block_pop(%p)\n", mpq_this_thread_id, QB);
+  long size = QB->mqb_size;
+  while (1) {
+    long h = __sync_fetch_and_add(&QB->mqb_head, 1);
+    // fprintf (stderr, "%d:  mpq_block_pop(%ld)\n", mpq_this_thread_id, h);
+    mpq_node_t *node = &QB->mqb_nodes[h & (size - 1)];
+    while (1) {
+      mpq_node_t d, e;
+      barrier();
+      mqn_value_t val = node->val;
+      barrier();
+      long safe_idx = node->idx;
+      barrier();
+      long idx = safe_idx & MQN_IDX_MASK;
+      if (idx > h) {
+        break;
+      }
+      d.val = val;
+      d.idx = safe_idx;
+      if (val) {
+        if (idx == h) {
+          e.idx = safe_idx + size;
+          e.val = 0;
+          if (__sync_bool_compare_and_swap(&node->pair, d.pair, e.pair)) {
+            // fprintf (stderr, "%d:  mpq_block_pop(%ld) -> %lx\n", mpq_this_thread_id, h, (long) val);
+            return val;
+          }
+        } else {
+          e.val = val;
+          e.idx = idx;  // clear 'safe' flag
+          if (__sync_bool_compare_and_swap(&node->pair, d.pair, e.pair)) {
+            break;
+          }
+        }
+      } else {
+        e.idx = (safe_idx & MQN_SAFE) + h + size;
+        e.val = 0;
+        if (__sync_bool_compare_and_swap(&node->pair, d.pair, e.pair)) {
+          break;
+        }
+      }
+      /* somebody changed this element while we were inspecting it, make another loop iteration */
+    }
+    barrier();
+    long t = QB->mqb_tail & MQN_IDX_MASK;
+    barrier();
+    if (t <= h + 1) {
+      mpq_fix_state(QB);
+      return 0;
+    }
+    /* now try again with a new value of h */
+  }
+}
+
+long mpq_block_push(struct mp_queue_block *QB, mqn_value_t val) {
+  int iterations = 0;
+  long size = QB->mqb_size;
+  // fprintf (stderr, "%d:mpq_block_push(%p)\n", mpq_this_thread_id, QB);
+  while (1) {
+    long t = __sync_fetch_and_add(&QB->mqb_tail, 1);
+    // fprintf (stderr, "%d:  mpq_block_push(%ld)\n", mpq_this_thread_id, t);
+    if (t & MQN_SAFE) {
+      return -1L;  // bad luck
+    }
+    mpq_node_t *node = &QB->mqb_nodes[t & (size - 1)];
+    barrier();
+    mqn_value_t old_val = node->val;
+    barrier();
+    long safe_idx = node->idx;
+    barrier();
+    long idx = safe_idx & MQN_IDX_MASK;
+    if (!old_val && idx <= t && ((safe_idx & MQN_SAFE) || QB->mqb_head <= t)) {
+      mpq_node_t d, e;
+      d.idx = safe_idx;
+      d.val = 0;
+      e.idx = MQN_SAFE + t;
+      e.val = val;
+      if (__sync_bool_compare_and_swap(&node->pair, d.pair, e.pair)) {
+        // fprintf (stderr, "%d:  mpq_block_push(%ld) <- %lx\n", mpq_this_thread_id, t, (long) val);
+        return t;  // pushed OK
+      }
+    }
+    barrier();
+    long h = QB->mqb_head;
+    barrier();
+    if (t - h >= size || ++iterations > 10) {
+      __sync_fetch_and_or(&QB->mqb_tail, MQN_SAFE);  // closing queue
+      return -1L;                                    // bad luck
+    }
+  }
+}
+
+/* functions for mp_queue = list of mp_queue_block's */
+void init_mp_queue(struct mp_queue *MQ) {
+  assert(MQ->mq_magic != MQ_MAGIC && MQ->mq_magic != MQ_MAGIC_SEM);
+  memset(MQ, 0, sizeof(struct mp_queue));
+  MQ->mq_head = MQ->mq_tail = alloc_mpq_block(0, 0, 1);
+  MQ->mq_magic = MQ_MAGIC;
+
+  if (!MqGarbageBlocks.mq_magic) {
+    init_mp_queue(&MqGarbageBlocks);
+    init_mp_queue(&MqGarbageSmallBlocks);
+  } else if (!MqPreparedBlocks.mq_magic) {
+    init_mp_queue(&MqPreparedBlocks);
+    init_mp_queue(&MqPreparedSmallBlocks);
+  }
+}
+
+void init_mp_queue_w(struct mp_queue *MQ) {
+  init_mp_queue(MQ);
+#if MPQ_USE_POSIX_SEMAPHORES
+  sem_init(&MQ->mq_sem, 0, 0);
+#endif
+  MQ->mq_magic = MQ_MAGIC_SEM;
+}
+
+struct mp_queue *alloc_mp_queue(void) {
+  struct mp_queue *MQ = NULL;
+  assert(!posix_memalign((void **)&MQ, 64, sizeof(*MQ)));
+  memset(MQ, 0, sizeof(*MQ));
+  init_mp_queue(MQ);
+  return MQ;
+}
+
+struct mp_queue *alloc_mp_queue_w(void) {
+  struct mp_queue *MQ = NULL;
+  assert(!posix_memalign((void **)&MQ, 64, sizeof(*MQ)));
+  memset(MQ, 0, sizeof(*MQ));
+  init_mp_queue_w(MQ);
+  return MQ;
+}
+
+/* invoke only if sure that nobody else may be using this mp_queue in parallel */
+void clear_mp_queue(struct mp_queue *MQ) {
+  assert(MQ->mq_magic == MQ_MAGIC || MQ->mq_magic == MQ_MAGIC_SEM);
+  assert(MQ->mq_head && MQ->mq_tail);
+  struct mp_queue_block *QB = MQ->mq_head, *QBN;
+  for (QB = MQ->mq_head; QB; QB = QBN) {
+    QBN = QB->mqb_next;
+    assert(QB->mqb_next || QB == MQ->mq_tail);
+    QB->mqb_next = 0;
+    free_mpq_block(QB);
+  }
+  MQ->mq_head = MQ->mq_tail = 0;
+  MQ->mq_magic = 0;
+}
+
+void free_mp_queue(struct mp_queue *MQ) {
+  clear_mp_queue(MQ);
+  free(MQ);
+}
+
+// may invoke mpq_push() to discard new empty block
+mqn_value_t mpq_pop(struct mp_queue *MQ, int flags) {
+  void **hptr = &mqb_hazard_ptr[get_this_thread_id()][0];
+  long r = ((flags & MPQF_RECURSIVE) != 0);
+  struct mp_queue_block *QB;
+  mqn_value_t v;
+  while (1) {
+    QB = MQ->mq_head;
+    barrier();
+    hptr[r] = QB;
+    barrier();
+    __sync_synchronize();
+    if (MQ->mq_head != QB) {
+      continue;
+    }
+
+    v = mpq_block_pop(QB);
+    if (v) {
+      break;
+    }
+    barrier();
+    if (!QB->mqb_next) {
+      QB = 0;
+      break;
+    }
+    v = mpq_block_pop(QB);
+    if (v) {
+      break;
+    }
+    if (__sync_bool_compare_and_swap(&MQ->mq_head, QB, QB->mqb_next)) {
+      // want to free QB here, but this is complicated if somebody else holds a pointer
+      if (is_hazard_ptr(QB, 0, 2) <= 1) {
+        free_mpq_block(QB);
+      } else {
+        __sync_fetch_and_add(&mpq_blocks_wasted, 1);
+        // ... put QB into some GC queue? ...
+        QB->mqb_magic = MQ_BLOCK_GARBAGE_MAGIC;
+        mpq_push(QB->mqb_size == MPQ_SMALL_BLOCK_SIZE ? &MqGarbageSmallBlocks : &MqGarbageBlocks, QB,
+                 flags & MPQF_RECURSIVE);
+      }
+    }
+  }
+  if (flags & MPQF_STORE_PTR) {
+    hptr[2] = QB;
+  }
+  hptr[r] = 0;
+  return v;
+}
+
+/* 1 = definitely empty (for some serialization), 0 = possibly non-empty;
+   may invoke mpq_push() to discard empty block */
+int mpq_is_empty(struct mp_queue *MQ) {
+  void **hptr = &mqb_hazard_ptr[get_this_thread_id()][0];
+  struct mp_queue_block *QB;
+  while (1) {
+    QB = MQ->mq_head;
+    barrier();
+    *hptr = QB;
+    barrier();
+    __sync_synchronize();
+    if (MQ->mq_head != QB) {
+      continue;
+    }
+    barrier();
+    long h = QB->mqb_head;
+    barrier();
+    long t = QB->mqb_tail;
+    barrier();
+    if (!(t & MQN_SAFE)) {
+      *hptr = 0;
+      return t <= h;
+    }
+    t &= MQN_IDX_MASK;
+    if (t > h) {
+      *hptr = 0;
+      return 0;
+    }
+    barrier();
+    if (!QB->mqb_next) {
+      *hptr = 0;
+      return 1;
+    }
+    if (__sync_bool_compare_and_swap(&MQ->mq_head, QB, QB->mqb_next)) {
+      // want to free QB here, but this is complicated if somebody else holds a pointer
+      if (is_hazard_ptr(QB, 0, 2) <= 1) {
+        free_mpq_block(QB);
+      } else {
+        __sync_fetch_and_add(&mpq_blocks_wasted, 1);
+        // ... put QB into some GC queue? ...
+        QB->mqb_magic = MQ_BLOCK_GARBAGE_MAGIC;
+        mpq_push(QB->mqb_size == MPQ_SMALL_BLOCK_SIZE ? &MqGarbageSmallBlocks : &MqGarbageBlocks, QB, 0);
+      }
+    }
+  }
+  *hptr = 0;
+  return 0;
+}
+
+/* may invoke mpq_alloc_block (which recursively invokes mpq_pop)
+   or mpq_push() (without needing to hold hazard pointer) to deal with blocks */
+long mpq_push(struct mp_queue *MQ, mqn_value_t val, int flags) {
+  void **hptr = mqb_hazard_ptr[get_this_thread_id()];
+  long r = ((flags & MPQF_RECURSIVE) != 0);
+  while (1) {
+    struct mp_queue_block *QB = MQ->mq_tail;
+    barrier();
+    hptr[r] = QB;
+    barrier();
+    __sync_synchronize();
+    if (MQ->mq_tail != QB) {
+      continue;
+    }
+
+    if (QB->mqb_next) {
+      __sync_bool_compare_and_swap(&MQ->mq_tail, QB, QB->mqb_next);
+      continue;
+    }
+    long pos = mpq_block_push(QB, val);
+    if (pos >= 0) {
+      if (flags & MPQF_STORE_PTR) {
+        hptr[2] = QB;
+      }
+      hptr[r] = 0;
+      return pos;
+    }
+#define DBG(c)  // fprintf (stderr, "[%d] pushing %lx to %p,%p: %c\n", mpq_this_thread_id, (long) val, MQ, QB, c);
+    DBG('A');
+    /*
+    if (__sync_fetch_and_add (&QB->mqb_next_allocators, 1)) {
+      // somebody else will allocate next block; busy wait instead of spuruous alloc/free
+      DBG('B')
+      while (!QB->mqb_next) {
+        barrier ();
+      }
+      DBG('C')
+      continue;
+    }
+    */
+    int is_small = (QB == MQ->mq_head);
+    struct mp_queue_block *NQB;
+    if (!r) {
+      assert(!hptr[1]);
+      NQB = alloc_mpq_block(val, 1, is_small);
+      assert(!hptr[1]);
+    } else {
+      NQB = alloc_mpq_block(val, 0, is_small);
+    }
+    assert(hptr[r] == QB);
+    DBG('D')
+    if (__sync_bool_compare_and_swap(&QB->mqb_next, 0, NQB)) {
+      __sync_bool_compare_and_swap(&MQ->mq_tail, QB, NQB);
+      DBG('E')
+      if (flags & MPQF_STORE_PTR) {
+        hptr[2] = NQB;
+      }
+      hptr[r] = 0;
+      return 0;
+    } else {
+      DBG('F');
+      NQB->mqb_magic = MQ_BLOCK_PREPARED_MAGIC;
+      mpq_push(is_small ? &MqPreparedSmallBlocks : &MqPreparedBlocks, NQB, 0);
+      __sync_fetch_and_add(&mpq_blocks_prepared, 1);
+    }
+  }
+#undef DBG
+}
+
+mqn_value_t mpq_pop_w(struct mp_queue *MQ, int flags) {
+  assert(MQ->mq_magic == MQ_MAGIC_SEM);
+  int s = -1, iterations = flags & MPQF_MAX_ITERATIONS;
+  while (iterations-- > 0) {
+#if MPQ_USE_POSIX_SEMAPHORES
+    s = sem_trywait(&MQ->mq_sem);
+#else
+    s = mp_sem_trywait(&MQ->mq_sem);
+#endif
+    if (!s) {
+      break;
+    }
+#if MPQ_USE_POSIX_SEMAPHORES
+    assert(errno == EAGAIN || errno == EINTR);
+#endif
+  }
+  while (s < 0) {
+#if MPQ_USE_POSIX_SEMAPHORES
+    s = sem_wait(&MQ->mq_sem);
+#else
+    s = mp_sem_wait(&MQ->mq_sem);
+#endif
+    if (!s) {
+      break;
+    }
+#if MPQ_USE_POSIX_SEMAPHORES
+    assert(errno == EAGAIN);
+#endif
+  }
+  mqn_value_t *v = mpq_pop(MQ, flags);
+  assert(v);
+  return v;
+}
+
+mqn_value_t mpq_pop_nw(struct mp_queue *MQ, int flags) {
+  assert(MQ->mq_magic == MQ_MAGIC_SEM);
+  int s = -1, iterations = flags & MPQF_MAX_ITERATIONS;
+  while (iterations-- > 0) {
+#if MPQ_USE_POSIX_SEMAPHORES
+    s = sem_trywait(&MQ->mq_sem);
+#else
+    s = mp_sem_trywait(&MQ->mq_sem);
+#endif
+    if (s >= 0) {
+      break;
+    }
+#if MPQ_USE_POSIX_SEMAPHORES
+    assert(errno == EAGAIN || errno == EINTR);
+#endif
+  }
+  if (s < 0) {
+    return 0;
+  }
+  mqn_value_t *v = mpq_pop(MQ, flags);
+  assert(v);
+  return v;
+}
+
+long mpq_push_w(struct mp_queue *MQ, mqn_value_t v, int flags) {
+  assert(MQ->mq_magic == MQ_MAGIC_SEM);
+  long res = mpq_push(MQ, v, flags);
+#if MPQ_USE_POSIX_SEMAPHORES
+  assert(sem_post(&MQ->mq_sem) >= 0);
+#else
+  assert(mp_sem_post(&MQ->mq_sem) >= 0);
+#endif
+  return res;
+}
+
+void *get_ptr_multithread_copy(void **ptr, void (*incref)(void *ptr)) {
+  void **hptr = &mqb_hazard_ptr[get_this_thread_id()][COMMON_HAZARD_PTR_NUM];
+  assert(*hptr == NULL);
+
+  void *R;
+  while (1) {
+    R = *ptr;
+    barrier();
+    *hptr = R;
+    barrier();
+    mfence();
+
+    if (R != *ptr) {
+      continue;
+    }
+
+    incref(R);
+
+    barrier();
+    *hptr = NULL;
+
+    break;
+  }
+  return R;
+}
+#endif
diff --git a/submodules/ton/tonlib-src/tdactor/benchmark/third_party/mp-queue.h b/submodules/ton/tonlib-src/tdactor/benchmark/third_party/mp-queue.h
new file mode 100644
index 0000000000..52bd9f2c69
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/benchmark/third_party/mp-queue.h
@@ -0,0 +1,149 @@
+/*
+    This file is part of KittenDB-Engine Library.
+
+    KittenDB-Engine Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    KittenDB-Engine Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with KittenDB-Engine Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2014 Telegraph Inc
+              2014 Nikolai Durov
+              2014 Andrey Lopatin
+*/
+
+#ifndef __KDB_MP_QUEUE_H__
+#define __KDB_MP_QUEUE_H__
+
+#define MPQ_USE_POSIX_SEMAPHORES 0
+
+#if MPQ_USE_POSIX_SEMAPHORES
+#include <semaphore.h>
+#endif
+
+typedef struct mp_semaphore {
+  volatile int value;
+  volatile int waiting;
+} mp_sem_t;
+
+#define THREAD_HPTRS 21
+
+#define MPQ_SMALL_BLOCK_SIZE 64
+#define MPQ_BLOCK_SIZE 4096  // must be a power of 2
+#define MPQ_BLOCK_ALIGNMENT 64
+
+#ifdef _LP64
+typedef int int128_t __attribute__((__mode__(TI)));
+#define DLONG int128_t
+// # define DLONG __int128
+#define MQN_SAFE (-1LL << 63)
+#else
+#define DLONG long long
+#define MQN_SAFE (-1L << 31)
+#endif
+
+#define MQN_IDX_MASK (~MQN_SAFE)
+
+typedef void *mqn_value_t;
+
+typedef struct mp_queue_node {
+  union {
+    struct {
+      long idx;
+      union {
+        long mqn_value;
+        void *mqn_ptr;
+        mqn_value_t val;
+      };
+    };
+    DLONG pair;
+  };
+} mpq_node_t;
+
+#define MQ_BLOCK_USED_MAGIC 0x1ebacaef
+#define MQ_BLOCK_FREE_MAGIC 0x2e4afeda
+#define MQ_BLOCK_GARBAGE_MAGIC 0x3a04dc7d
+#define MQ_BLOCK_PREPARED_MAGIC 0x4b9b13cd
+
+#define MQ_MAGIC 0x1aed9b43
+#define MQ_MAGIC_SEM 0x1aedcd21
+
+struct mp_queue_block {
+  long mqb_head __attribute__((aligned(64)));
+  int mqb_magic;
+  int mqb_align_bytes;
+  int mqb_size;  // power of 2; one of MPQ_BLOCK_SIZE or MPQ_SMALL_BLOCK_SIZE
+  long mqb_tail __attribute__((aligned(64)));
+  struct mp_queue_block *mqb_next;
+  int mqb_next_allocators;
+  mpq_node_t mqb_nodes[MPQ_BLOCK_SIZE] __attribute__((aligned(64)));
+};
+
+struct mp_queue {
+  struct mp_queue_block *mq_head __attribute__((aligned(64)));
+  int mq_magic;
+  struct mp_queue_block *mq_tail __attribute__((aligned(64)));
+#if MPQ_USE_POSIX_SEMAPHORES
+  sem_t mq_sem __attribute__((aligned(64)));
+#else
+  mp_sem_t mq_sem __attribute__((aligned(64)));
+#endif
+};
+
+extern volatile int mpq_blocks_allocated, mpq_blocks_allocated_max, mpq_blocks_allocations, mpq_blocks_true_allocations,
+    mpq_blocks_wasted, mpq_blocks_prepared;
+extern volatile int mpq_small_blocks_allocated, mpq_small_blocks_allocated_max;
+
+#define MAX_MPQ_THREADS 22
+extern __thread int mpq_this_thread_id;
+extern __thread void **thread_hazard_pointers;
+extern volatile int mpq_threads;
+
+/* initialize this thread id and return it */
+void clear_thread_ids(void);
+int get_this_thread_id(void);
+
+/* functions for one mp_queue_block */
+struct mp_queue_block *alloc_mpq_block(mqn_value_t first_val, int allow_recursion, int is_small);
+void free_mpq_block(struct mp_queue_block *QB);
+
+mqn_value_t mpq_block_pop(struct mp_queue_block *QB);
+long mpq_block_push(struct mp_queue_block *QB, mqn_value_t val);
+
+/* functions for mp_queue = list of mp_queue_block's */
+void init_mp_queue(struct mp_queue *MQ);
+struct mp_queue *alloc_mp_queue(void);
+struct mp_queue *alloc_mp_queue_w(void);
+void init_mp_queue_w(struct mp_queue *MQ);
+void clear_mp_queue(struct mp_queue *MQ);  // frees all mpq block chain; invoke only if nobody else is using mp-queue
+void free_mp_queue(struct mp_queue *MQ);   // same + invoke free()
+
+// flags for mpq_push / mpq_pop functions
+#define MPQF_RECURSIVE 8192
+#define MPQF_STORE_PTR 4096
+#define MPQF_MAX_ITERATIONS (MPQF_STORE_PTR - 1)
+
+long mpq_push(struct mp_queue *MQ, mqn_value_t val, int flags);
+mqn_value_t mpq_pop(struct mp_queue *MQ, int flags);
+int mpq_is_empty(struct mp_queue *MQ);
+
+long mpq_push_w(struct mp_queue *MQ, mqn_value_t val, int flags);
+mqn_value_t mpq_pop_w(struct mp_queue *MQ, int flags);
+mqn_value_t mpq_pop_nw(struct mp_queue *MQ, int flags);
+
+int mp_sem_post(mp_sem_t *sem);
+int mp_sem_wait(mp_sem_t *sem);
+int mp_sem_trywait(mp_sem_t *sem);
+
+#define COMMON_HAZARD_PTR_NUM 3
+int is_hazard_ptr(void *ptr, int a, int b);
+extern void *mqb_hazard_ptr[MAX_MPQ_THREADS][THREAD_HPTRS];
+void *get_ptr_multithread_copy(void **ptr, void (*incref)(void *ptr));
+#endif
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/ActorId.h b/submodules/ton/tonlib-src/tdactor/td/actor/ActorId.h
new file mode 100644
index 0000000000..21c30dd347
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/ActorId.h
@@ -0,0 +1,129 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/actor/common.h"
+
+namespace td {
+namespace actor {
+template <class ActorType = core::Actor>
+class ActorId;
+template <class ActorType = core::Actor>
+class ActorOwn;
+template <class ActorType = core::Actor>
+class ActorShared;
+namespace core {
+template <class SelfT>
+ActorId<SelfT> actor_id(SelfT *self);
+}
+
+// Essentially ActorInfoWeakPtr with Type
+template <class ActorType>
+class ActorId {
+ public:
+  using ActorT = ActorType;
+  ActorId() = default;
+  ActorId(const ActorId &) = default;
+  ActorId &operator=(const ActorId &) = default;
+  ActorId(ActorId &&other) = default;
+  ActorId &operator=(ActorId &&other) = default;
+
+  // allow only conversion from child to parent
+  template <class ToActorType, class = std::enable_if_t<std::is_base_of<ToActorType, ActorType>::value>>
+  operator ActorId<ToActorType>() const {
+    return ActorId<ToActorType>(ptr_);
+  }
+
+  template <class ToActorType, class FromActorType>
+  friend ActorId<ToActorType> actor_dynamic_cast(ActorId<FromActorType> from);
+
+  ActorType &get_actor_unsafe() const {
+    return static_cast<ActorType &>(actor_info().actor());
+  }
+  bool empty() const {
+    return !ptr_;
+  }
+
+  bool is_alive() const {
+    return !empty() && actor_info().is_alive();
+  }
+
+  template <class... ArgsT>
+  static ActorId<ActorType> create(ActorOptions &options, ArgsT &&... args) {
+    return ActorId<ActorType>(detail::create_actor<ActorType>(options, std::forward<ArgsT>(args)...));
+  }
+
+  template <class OtherT>
+  bool operator==(const ActorId<OtherT> &other) const {
+    return ptr_ == other.ptr_;
+  }
+
+  detail::ActorRef as_actor_ref() const {
+    CHECK(!empty());
+    return detail::ActorRef(*actor_info_ptr());
+  }
+
+  const core::ActorInfoPtr &actor_info_ptr() const {
+    return ptr_;
+  }
+
+  core::ActorInfo &actor_info() const {
+    CHECK(ptr_);
+    return *ptr_;
+  }
+
+ private:
+  core::ActorInfoPtr ptr_;
+
+  template <class OtherActorType>
+  friend class ActorId;
+  template <class OtherActorType>
+  friend class ActorOwn;
+  template <class OtherActorType>
+  friend class ActorShared;
+
+  explicit ActorId(core::ActorInfoPtr ptr) : ptr_(std::move(ptr)) {
+  }
+
+  template <class SelfT>
+  friend ActorId<SelfT> core::actor_id(SelfT *self);
+};
+template <class ToActorType, class FromActorType>
+ActorId<ToActorType> actor_dynamic_cast(ActorId<FromActorType> from) {
+  static_assert(
+      std::is_base_of<FromActorType, ToActorType>::value || std::is_base_of<ToActorType, FromActorType>::value,
+      "Invalid actor dynamic conversion");
+  auto res = ActorId<ToActorType>(std::move(from.ptr_));
+  CHECK(dynamic_cast<ToActorType *>(&res.actor_info().actor()) == &res.get_actor_unsafe());
+  return res;
+}
+namespace core {  // for ADL
+template <class SelfT>
+ActorId<SelfT> actor_id(SelfT *self) {
+  CHECK(self);
+  CHECK(static_cast<core::Actor *>(self) == &core::ActorExecuteContext::get()->actor());
+  return ActorId<SelfT>(core::ActorExecuteContext::get()->actor().get_actor_info_ptr());
+}
+
+inline ActorId<> actor_id() {
+  return actor_id(&core::ActorExecuteContext::get()->actor());
+}
+}  // namespace core
+using core::actor_id;
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/ActorOwn.h b/submodules/ton/tonlib-src/tdactor/td/actor/ActorOwn.h
new file mode 100644
index 0000000000..eb343678a1
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/ActorOwn.h
@@ -0,0 +1,100 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/actor/common.h"
+#include "td/actor/ActorId.h"
+
+namespace td {
+namespace actor {
+template <class ActorType>
+class ActorOwn {
+ public:
+  using ActorT = ActorType;
+  ActorOwn() = default;
+  explicit ActorOwn(ActorId<ActorType> id) : id_(std::move(id)) {
+  }
+  template <class OtherActorType>
+  explicit ActorOwn(ActorId<OtherActorType> id) : id_(std::move(id)) {
+  }
+  template <class OtherActorType>
+  ActorOwn(ActorOwn<OtherActorType> &&other) : id_(other.release()) {
+  }
+  template <class OtherActorType>
+  ActorOwn &operator=(ActorOwn<OtherActorType> &&other) {
+    reset(other.release());
+    return *this;
+  }
+  ActorOwn(ActorOwn &&other) : id_(other.release()) {
+  }
+  ActorOwn &operator=(ActorOwn &&other) {
+    reset(other.release());
+    return *this;
+  }
+  ActorOwn(const ActorOwn &) = delete;
+  ActorOwn &operator=(const ActorOwn &) = delete;
+  ~ActorOwn() {
+    reset();
+  }
+
+  bool empty() const {
+    return id_.empty();
+  }
+  bool is_alive() const {
+    return id_.is_alive();
+  }
+  ActorId<ActorType> get() const {
+    return id_;
+  }
+  ActorType &get_actor_unsafe() const {
+    return (*this)->get_actor_unsafe();
+  }
+  ActorId<ActorType> release() {
+    return std::move(id_);
+  }
+  void reset(ActorId<ActorType> other = ActorId<ActorType>()) {
+    static_assert(sizeof(ActorType) > 0, "Can't use ActorOwn with incomplete type");
+    hangup();
+    id_ = std::move(other);
+  }
+  const ActorId<ActorType> *operator->() const {
+    return &id_;
+  }
+
+  detail::ActorRef as_actor_ref() const {
+    CHECK(!empty());
+    return detail::ActorRef(*id_.actor_info_ptr(), 0);
+  }
+
+ private:
+  ActorId<ActorType> id_;
+  void hangup() const {
+    if (empty()) {
+      return;
+    }
+    detail::send_message(as_actor_ref(), detail::ActorMessageCreator::hangup());
+  }
+};
+
+template <class ToActorType, class FromActorType>
+ActorOwn<ToActorType> actor_dynamic_cast(ActorOwn<FromActorType> from) {
+  return ActorOwn<ToActorType>(td::actor::actor_dynamic_cast<ToActorType>(from.release()));
+}
+
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/ActorShared.h b/submodules/ton/tonlib-src/tdactor/td/actor/ActorShared.h
new file mode 100644
index 0000000000..208840da1a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/ActorShared.h
@@ -0,0 +1,120 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/actor/common.h"
+#include "td/actor/ActorId.h"
+
+namespace td {
+namespace actor {
+
+template <class ActorType>
+class ActorShared {
+ public:
+  using ActorT = ActorType;
+  ActorShared() = default;
+  template <class OtherActorType>
+  ActorShared(ActorId<OtherActorType> id, uint64 token) : id_(std::move(id)), token_(token) {
+    CHECK(token_ != 0);
+  }
+  template <class OtherActorType>
+  ActorShared(ActorShared<OtherActorType> &&other) : id_(other.release()), token_(other.token()) {
+  }
+  template <class OtherActorType>
+  ActorShared(ActorOwn<OtherActorType> &&other) : id_(other.release()), token_(other.token()) {
+  }
+  template <class OtherActorType>
+  ActorShared &operator=(ActorShared<OtherActorType> &&other) {
+    reset(other.release(), other.token());
+  }
+  ActorShared(ActorShared &&other) : id_(other.release()), token_(other.token()) {
+  }
+  ActorShared &operator=(ActorShared &&other) {
+    reset(other.release(), other.token());
+    return *this;
+  }
+  ActorShared(const ActorShared &) = delete;
+  ActorShared &operator=(const ActorShared &) = delete;
+  ~ActorShared() {
+    reset();
+  }
+
+  uint64 token() const {
+    return token_;
+  }
+  bool empty() const {
+    return id_.empty();
+  }
+  bool is_alive() const {
+    return id_.is_alive();
+  }
+  ActorId<ActorType> get() const {
+    return id_;
+  }
+  ActorId<ActorType> release() {
+    return std::move(id_);
+  }
+  ActorType &get_actor_unsafe() const {
+    return (*this)->get_actor_unsafe();
+  }
+  void reset(ActorId<ActorType> other = ActorId<ActorType>(), uint64 link_token = core::EmptyLinkToken) {
+    static_assert(sizeof(ActorType) > 0, "Can't use ActorShared with incomplete type");
+    hangup();
+    id_ = other;
+    token_ = link_token;
+  }
+  const ActorId<ActorType> *operator->() const {
+    return &id_;
+  }
+
+  detail::ActorRef as_actor_ref() const {
+    CHECK(!empty());
+    return detail::ActorRef(*id_.actor_info_ptr(), token_);
+  }
+
+ private:
+  ActorId<ActorType> id_;
+  uint64 token_;
+
+  void hangup() const {
+    if (empty()) {
+      return;
+    }
+    detail::send_message(as_actor_ref(), detail::ActorMessageCreator::hangup_shared());
+  }
+};
+
+template <class ToActorType, class FromActorType>
+ActorShared<ToActorType> actor_dynamic_cast(ActorShared<FromActorType> from) {
+  return ActorShared<ToActorType>(td::actor::actor_dynamic_cast<ToActorType>(from.release()), from.token());
+}
+
+// common interface
+namespace core {  // for ADL
+template <class SelfT>
+ActorShared<SelfT> actor_shared(SelfT *self, uint64 id = static_cast<uint64>(-1)) {
+  return ActorShared<SelfT>(actor_id(self), id);
+}
+
+inline ActorShared<> actor_shared() {
+  return actor_shared(&core::ActorExecuteContext::get()->actor());
+}
+}  // namespace core
+using core::actor_shared;
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/MultiPromise.cpp b/submodules/ton/tonlib-src/tdactor/td/actor/MultiPromise.cpp
new file mode 100644
index 0000000000..781362ff84
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/MultiPromise.cpp
@@ -0,0 +1,112 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/actor/MultiPromise.h"
+
+#include <mutex>
+
+namespace td {
+namespace detail {
+class MultiPromiseImpl {
+ public:
+  explicit MultiPromiseImpl(MultiPromise::Options options) : options_(options) {
+  }
+  ~MultiPromiseImpl() {
+    for (auto &promise : pending_) {
+      promise.set_value(Unit());
+    }
+  }
+
+  void on_status(Status status) {
+    if (status.is_ok() || options_.ignore_errors) {
+      return;
+    }
+    std::vector<Promise<>> promises;
+    {
+      std::unique_lock<std::mutex> lock(mutex_);
+      if (pending_error_.is_ok()) {
+        pending_error_ = status.clone();
+        std::swap(promises, pending_);
+      } else {
+        CHECK(pending_.empty());
+      }
+    }
+    for (auto &promise : promises) {
+      promise.set_error(status.clone());
+    }
+  }
+  void add_promise(Promise<> promise) {
+    if (options_.ignore_errors) {
+      pending_.push_back(std::move(promise));
+    }
+    Status status;
+    {
+      std::unique_lock<std::mutex> lock(mutex_);
+      if (pending_error_.is_error()) {
+        status = pending_error_.clone();
+      } else {
+        pending_.push_back(std::move(promise));
+      }
+    }
+    if (status.is_error()) {
+      promise.set_error(std::move(status));
+    }
+  }
+
+ private:
+  std::mutex mutex_;
+  std::vector<Promise<>> pending_;
+  MultiPromise::Options options_;
+  Status pending_error_;
+};
+}  // namespace detail
+void MultiPromise::InitGuard::add_promise(Promise<> promise) {
+  impl_->add_promise(std::move(promise));
+}
+Promise<> MultiPromise::InitGuard::get_promise() {
+  return [impl = impl_](Result<Unit> result) {
+    if (result.is_ok()) {
+      impl->on_status(Status::OK());
+    } else {
+      impl->on_status(result.move_as_error());
+    }
+  };
+}
+bool MultiPromise::InitGuard::empty() const {
+  return !impl_;
+}
+MultiPromise::InitGuard::operator bool() const {
+  return !empty();
+}
+MultiPromise::InitGuard MultiPromise::init_guard() {
+  CHECK(!impl_.lock());
+  auto impl = std::make_shared<Impl>(options_);
+  impl_ = impl;
+  return InitGuard(std::move(impl));
+}
+MultiPromise::InitGuard MultiPromise::add_promise_or_init(Promise<> promise) {
+  auto impl = impl_.lock();
+  if (!impl) {
+    auto guard = init_guard();
+    guard.add_promise(std::move(promise));
+    return guard;
+  }
+  impl->add_promise(std::move(promise));
+  return {};
+}
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/MultiPromise.h b/submodules/ton/tonlib-src/tdactor/td/actor/MultiPromise.h
new file mode 100644
index 0000000000..e12e6ff2bd
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/MultiPromise.h
@@ -0,0 +1,65 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/actor/PromiseFuture.h"
+
+namespace td {
+namespace detail {
+class MultiPromiseImpl;
+}
+
+class MultiPromise {
+  using Impl = detail::MultiPromiseImpl;
+
+ public:
+  struct Options {
+    Options() {
+    }
+    bool ignore_errors{false};
+  };
+  explicit MultiPromise(Options options = Options{}) : options_(options) {
+  }
+
+  struct InitGuard {
+   public:
+    InitGuard() = default;
+    InitGuard(std::shared_ptr<Impl> impl) : impl_(std::move(impl)) {
+    }
+    InitGuard(InitGuard &&other) = default;
+    InitGuard &operator=(InitGuard &&other) = default;
+    InitGuard(const InitGuard &other) = delete;
+    InitGuard &operator=(const InitGuard &other) = delete;
+
+    void add_promise(Promise<> promise);
+    Promise<> get_promise();
+    bool empty() const;
+    explicit operator bool() const;
+
+   private:
+    std::shared_ptr<Impl> impl_;
+  };
+
+  TD_WARN_UNUSED_RESULT InitGuard init_guard();
+  TD_WARN_UNUSED_RESULT InitGuard add_promise_or_init(Promise<> promise);
+
+ private:
+  Options options_;
+  std::weak_ptr<Impl> impl_;
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/PromiseFuture.h b/submodules/ton/tonlib-src/tdactor/td/actor/PromiseFuture.h
new file mode 100644
index 0000000000..1070e482df
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/PromiseFuture.h
@@ -0,0 +1,336 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/utils/Closure.h"
+#include "td/utils/common.h"
+#include "td/utils/invoke.h"  // for tuple_for_each
+#include "td/utils/logging.h"
+#include "td/utils/ScopeGuard.h"
+#include "td/utils/Status.h"
+
+#include <tuple>
+#include <type_traits>
+#include <utility>
+
+namespace td {
+namespace detail {
+template <typename T>
+struct GetArg : public GetArg<decltype(&T::operator())> {};
+
+template <class C, class R, class Arg>
+class GetArg<R (C::*)(Arg)> {
+ public:
+  using type = Arg;
+};
+template <class C, class R, class Arg>
+class GetArg<R (C::*)(Arg) const> {
+ public:
+  using type = Arg;
+};
+
+template <class T>
+using get_arg_t = std::decay_t<typename GetArg<T>::type>;
+
+template <class T>
+struct DropResult {
+  using type = T;
+};
+
+template <class T>
+struct DropResult<Result<T>> {
+  using type = T;
+};
+
+template <class T>
+using drop_result_t = typename DropResult<T>::type;
+}  // namespace detail
+
+template <class T = Unit>
+class PromiseInterface {
+ public:
+  using ValueType = T;
+  PromiseInterface() = default;
+  PromiseInterface(const PromiseInterface &) = delete;
+  PromiseInterface &operator=(const PromiseInterface &) = delete;
+  PromiseInterface(PromiseInterface &&) = default;
+  PromiseInterface &operator=(PromiseInterface &&) = default;
+  virtual ~PromiseInterface() = default;
+
+  virtual void set_value(T &&value) {
+    set_result(std::move(value));
+  }
+  virtual void set_error(Status &&error) {
+    set_result(std::move(error));
+  }
+  virtual void set_result(Result<T> &&result) {
+    if (result.is_ok()) {
+      set_value(result.move_as_ok());
+    } else {
+      set_error(result.move_as_error());
+    }
+  }
+
+  void operator()(T &&value) {
+    set_value(std::move(value));
+  }
+  void operator()(Status &&error) {
+    set_error(std::move(error));
+  }
+  void operator()(Result<T> &&result) {
+    set_result(std::move(result));
+  }
+};
+template <class T = Unit>
+class Promise;
+
+constexpr std::false_type is_promise_interface(...) {
+  return {};
+}
+template <class T>
+constexpr std::true_type is_promise_interface(const PromiseInterface<T> &promise) {
+  return {};
+}
+template <class T>
+constexpr std::true_type is_promise_interface(const Promise<T> &promise) {
+  return {};
+}
+
+template <class F>
+constexpr bool is_promise_interface() {
+  return decltype(is_promise_interface(std::declval<F>()))::value;
+}
+
+constexpr std::false_type is_promise_interface_ptr(...) {
+  return {};
+}
+template <class T>
+constexpr std::true_type is_promise_interface_ptr(const unique_ptr<T> &promise) {
+  return {};
+}
+
+template <class F>
+constexpr bool is_promise_interface_ptr() {
+  return decltype(is_promise_interface_ptr(std::declval<F>()))::value;
+}
+template <class ValueT, class FunctionT>
+class LambdaPromise : public PromiseInterface<ValueT> {
+ public:
+  void set_value(ValueT &&value) override {
+    CHECK(has_lambda_.get());
+    do_ok(std::move(value));
+    has_lambda_ = false;
+  }
+  void set_error(Status &&error) override {
+    CHECK(has_lambda_.get());
+    do_error(std::move(error));
+    has_lambda_ = false;
+  }
+
+  LambdaPromise(const LambdaPromise &other) = delete;
+  LambdaPromise &operator=(const LambdaPromise &other) = delete;
+  LambdaPromise(LambdaPromise &&other) = default;
+  LambdaPromise &operator=(LambdaPromise &&other) = default;
+  ~LambdaPromise() override {
+    if (has_lambda_.get()) {
+      do_error(Status::Error("Lost promise"));
+    }
+  }
+
+  template <class FromOkT>
+  explicit LambdaPromise(FromOkT &&ok) : ok_(std::forward<FromOkT>(ok)), has_lambda_(true) {
+  }
+
+ private:
+  FunctionT ok_;
+  MovableValue<bool> has_lambda_{false};
+
+  template <class F = FunctionT>
+  std::enable_if_t<is_callable<F, Result<ValueT>>::value, void> do_error(Status &&status) {
+    ok_(Result<ValueT>(std::move(status)));
+  }
+  template <class Y, class F = FunctionT>
+  std::enable_if_t<!is_callable<F, Result<ValueT>>::value, void> do_error(Y &&status) {
+    ok_(Auto());
+  }
+  template <class F = FunctionT>
+  std::enable_if_t<is_callable<F, Result<ValueT>>::value, void> do_ok(ValueT &&result) {
+    ok_(Result<ValueT>(std::move(result)));
+  }
+  template <class F = FunctionT>
+  std::enable_if_t<!is_callable<F, Result<ValueT>>::value, void> do_ok(ValueT &&result) {
+    ok_(std::move(result));
+  }
+};
+
+template <class T = void, class F = void, std::enable_if_t<std::is_same<T, void>::value, bool> has_t = false>
+auto lambda_promise(F &&f) {
+  return LambdaPromise<detail::drop_result_t<detail::get_arg_t<std::decay_t<F>>>, std::decay_t<F>>(std::forward<F>(f));
+}
+template <class T = void, class F = void, std::enable_if_t<!std::is_same<T, void>::value, bool> has_t = true>
+auto lambda_promise(F &&f) {
+  return LambdaPromise<T, std::decay_t<F>>(std::forward<F>(f));
+}
+
+template <class T, class F, std::enable_if_t<is_promise_interface<F>(), bool> from_promise_inerface = true>
+auto &&promise_interface(F &&f) {
+  return std::forward<F>(f);
+}
+
+template <class T, class F, std::enable_if_t<!is_promise_interface<F>(), bool> from_promise_inerface = false>
+auto promise_interface(F &&f) {
+  return lambda_promise<T>(std::forward<F>(f));
+}
+
+template <class T, class F, std::enable_if_t<is_promise_interface_ptr<F>(), bool> from_promise_inerface = true>
+auto promise_interface_ptr(F &&f) {
+  return std::forward<F>(f);
+}
+template <class T, class F, std::enable_if_t<!is_promise_interface_ptr<F>(), bool> from_promise_inerface = false>
+auto promise_interface_ptr(F &&f) {
+  return std::make_unique<std::decay_t<decltype(promise_interface<T>(std::forward<F>(f)))>>(
+      promise_interface<T>(std::forward<F>(f)));
+}
+
+template <class T>
+class Promise {
+ public:
+  using ArgT = T;
+  void set_value(T &&value) {
+    if (!promise_) {
+      return;
+    }
+    promise_->set_value(std::move(value));
+    promise_.reset();
+  }
+  void set_error(Status &&error) {
+    if (!promise_) {
+      return;
+    }
+    promise_->set_error(std::move(error));
+    promise_.reset();
+  }
+  void set_result(Result<T> &&result) {
+    if (!promise_) {
+      return;
+    }
+    promise_->set_result(std::move(result));
+    promise_.reset();
+  }
+  template <class S>
+  void operator()(S &&result) {
+    if (!promise_) {
+      return;
+    }
+    promise_->operator()(std::forward<S>(result));
+    promise_.reset();
+  }
+  void reset() {
+    promise_.reset();
+  }
+  std::unique_ptr<PromiseInterface<T>> release() {
+    return std::move(promise_);
+  }
+
+  Promise() = default;
+  explicit Promise(std::unique_ptr<PromiseInterface<T>> promise) : promise_(std::move(promise)) {
+  }
+
+  Promise &operator=(Promise &&) = default;
+  Promise(Promise &&) = default;
+  template <class F>
+  Promise(F &&f) : promise_(promise_interface_ptr<T>(std::forward<F>(f))) {
+  }
+
+  explicit operator bool() {
+    return static_cast<bool>(promise_);
+  }
+
+ private:
+  std::unique_ptr<PromiseInterface<T>> promise_;
+};
+
+template <class F>
+auto make_promise(F &&f) {
+  using ValueT = detail::drop_result_t<detail::get_arg_t<F>>;
+  return Promise<ValueT>(promise_interface_ptr(std::forward<F>(f)));
+}
+
+namespace detail {
+template <class... ArgsT>
+class JoinPromise : public PromiseInterface<Unit> {
+ public:
+  explicit JoinPromise(ArgsT &&... arg) : promises_(std::forward<ArgsT>(arg)...) {
+  }
+  void set_value(Unit &&) override {
+    tuple_for_each(promises_, [](auto &promise) { promise.set_value(Unit()); });
+  }
+  void set_error(Status &&error) override {
+    tuple_for_each(promises_, [&error](auto &promise) { promise.set_error(error.clone()); });
+  }
+
+ private:
+  std::tuple<std::decay_t<ArgsT>...> promises_;
+};
+}  // namespace detail
+
+class PromiseCreator {
+ public:
+  struct Ignore {
+    void operator()(Status &&error) {
+      error.ignore();
+    }
+  };
+
+  template <class OkT>
+  static auto lambda(OkT &&ok) {
+    return lambda_promise(std::forward<OkT>(ok));
+  }
+
+  template <class... ArgsT>
+  static Promise<> join(ArgsT &&... args) {
+    return Promise<>(std::make_unique<detail::JoinPromise<ArgsT...>>(std::forward<ArgsT>(args)...));
+  }
+};
+
+template <class T = Unit>
+class SafePromise {
+ public:
+  SafePromise(Promise<T> promise, Result<T> result) : promise_(std::move(promise)), result_(std::move(result)) {
+  }
+  SafePromise(const SafePromise &other) = delete;
+  SafePromise &operator=(const SafePromise &other) = delete;
+  SafePromise(SafePromise &&other) = default;
+  SafePromise &operator=(SafePromise &&other) = default;
+  ~SafePromise() {
+    if (promise_) {
+      promise_.set_result(std::move(result_));
+    }
+  }
+  Promise<T> release() {
+    return std::move(promise_);
+  }
+  operator Promise<T>() && {
+    return release();
+  }
+
+ private:
+  Promise<T> promise_;
+  Result<T> result_;
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/actor.h b/submodules/ton/tonlib-src/tdactor/td/actor/actor.h
new file mode 100644
index 0000000000..85685de721
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/actor.h
@@ -0,0 +1,165 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/actor/common.h"
+#include "td/actor/ActorId.h"
+#include "td/actor/ActorOwn.h"
+#include "td/actor/ActorShared.h"
+
+namespace td {
+namespace actor {
+
+template <class T, class... ArgsT>
+TD_WARN_UNUSED_RESULT ActorOwn<T> create_actor(ActorOptions options, ArgsT &&... args) {
+  return ActorOwn<T>(ActorId<T>::create(options, std::forward<ArgsT>(args)...));
+}
+
+template <class T, class... ArgsT>
+TD_WARN_UNUSED_RESULT ActorOwn<T> create_actor(Slice name, ArgsT &&... args) {
+  return ActorOwn<T>(ActorId<T>::create(ActorOptions().with_name(name), std::forward<ArgsT>(args)...));
+}
+
+#define SEND_CLOSURE_LATER 1
+#ifndef SEND_CLOSURE_LATER
+
+template <class ActorIdT, class FunctionT, class... ArgsT, class FunctionClassT = member_function_class_t<FunctionT>,
+          size_t argument_count = member_function_argument_count<FunctionT>(),
+          std::enable_if_t<argument_count == sizeof...(ArgsT), bool> with_promise = false>
+void send_closure(ActorIdT &&actor_id, FunctionT function, ArgsT &&... args) {
+  using ActorT = typename std::decay_t<ActorIdT>::ActorT;
+  static_assert(std::is_base_of<FunctionClassT, ActorT>::value, "unsafe send_closure");
+
+  ActorIdT id = std::forward<ActorIdT>(actor_id);
+  detail::send_closure(id.as_actor_ref(), function, std::forward<ArgsT>(args)...);
+}
+
+template <class ActorIdT, class FunctionT, class... ArgsT, class FunctionClassT = member_function_class_t<FunctionT>,
+          size_t argument_count = member_function_argument_count<FunctionT>(),
+          std::enable_if_t<argument_count != sizeof...(ArgsT), bool> with_promise = true>
+void send_closure(ActorIdT &&actor_id, FunctionT function, ArgsT &&... args) {
+  using ActorT = typename std::decay_t<ActorIdT>::ActorT;
+  static_assert(std::is_base_of<FunctionClassT, ActorT>::value, "unsafe send_closure");
+
+  ActorIdT id = std::forward<ActorIdT>(actor_id);
+  detail::send_closure_with_promise(id.as_actor_ref(),
+                                    call_n_arguments<argument_count>(
+                                        [&function](auto &&... nargs) {
+                                          return create_immediate_closure(function,
+                                                                          std::forward<decltype(nargs)>(nargs)...);
+                                        },
+                                        std::forward<ArgsT>(args)...),
+                                    get_last_argument(std::forward<ArgsT>(args)...));
+}
+
+#else
+
+template <class ActorIdT, class FunctionT, class... ArgsT, class FunctionClassT = member_function_class_t<FunctionT>,
+          size_t argument_count = member_function_argument_count<FunctionT>(),
+          std::enable_if_t<argument_count == sizeof...(ArgsT), bool> with_promise = false>
+void send_closure(ActorIdT &&actor_id, FunctionT function, ArgsT &&... args) {
+  using ActorT = typename std::decay_t<ActorIdT>::ActorT;
+  static_assert(std::is_base_of<FunctionClassT, ActorT>::value, "unsafe send_closure");
+
+  ActorIdT id = std::forward<ActorIdT>(actor_id);
+  detail::send_closure_later(id.as_actor_ref(), function, std::forward<ArgsT>(args)...);
+}
+
+template <class ActorIdT, class FunctionT, class... ArgsT, class FunctionClassT = member_function_class_t<FunctionT>,
+          size_t argument_count = member_function_argument_count<FunctionT>(),
+          std::enable_if_t<argument_count != sizeof...(ArgsT), bool> with_promise = true>
+void send_closure(ActorIdT &&actor_id, FunctionT function, ArgsT &&... args) {
+  using ActorT = typename std::decay_t<ActorIdT>::ActorT;
+  static_assert(std::is_base_of<FunctionClassT, ActorT>::value, "unsafe send_closure");
+
+  ActorIdT id = std::forward<ActorIdT>(actor_id);
+  detail::send_closure_with_promise_later(id.as_actor_ref(),
+                                          call_n_arguments<argument_count>(
+                                              [&function](auto &&... nargs) {
+                                                return create_delayed_closure(function,
+                                                                              std::forward<decltype(nargs)>(nargs)...);
+                                              },
+                                              std::forward<ArgsT>(args)...),
+                                          get_last_argument(std::forward<ArgsT>(args)...));
+}
+
+#endif
+
+template <typename ActorIdT, typename FunctionT, typename... ArgsT>
+bool send_closure_bool(ActorIdT &&actor_id, FunctionT function, ArgsT &&... args) {
+  send_closure(std::forward<ActorIdT>(actor_id), function, std::forward<ArgsT>(args)...);
+  return true;
+}
+
+template <class ActorIdT, class FunctionT, class... ArgsT, class FunctionClassT = member_function_class_t<FunctionT>,
+          size_t argument_count = member_function_argument_count<FunctionT>(),
+          std::enable_if_t<argument_count == sizeof...(ArgsT), bool> with_promise = false>
+void send_closure_later(ActorIdT &&actor_id, FunctionT function, ArgsT &&... args) {
+  using ActorT = typename std::decay_t<ActorIdT>::ActorT;
+  static_assert(std::is_base_of<FunctionClassT, ActorT>::value, "unsafe send_closure");
+
+  ActorIdT id = std::forward<ActorIdT>(actor_id);
+  detail::send_closure_later(id.as_actor_ref(), function, std::forward<ArgsT>(args)...);
+}
+
+template <class ActorIdT, class FunctionT, class... ArgsT, class FunctionClassT = member_function_class_t<FunctionT>,
+          size_t argument_count = member_function_argument_count<FunctionT>(),
+          std::enable_if_t<argument_count != sizeof...(ArgsT), bool> with_promise = true>
+void send_closure_later(ActorIdT &&actor_id, FunctionT function, ArgsT &&... args) {
+  using ActorT = typename std::decay_t<ActorIdT>::ActorT;
+  static_assert(std::is_base_of<FunctionClassT, ActorT>::value, "unsafe send_closure");
+
+  ActorIdT id = std::forward<ActorIdT>(actor_id);
+  detail::send_closure_with_promise_later(id.as_actor_ref(),
+                                          call_n_arguments<argument_count>(
+                                              [&function](auto &&... nargs) {
+                                                return create_delayed_closure(function,
+                                                                              std::forward<decltype(nargs)>(nargs)...);
+                                              },
+                                              std::forward<ArgsT>(args)...),
+                                          get_last_argument(std::forward<ArgsT>(args)...));
+}
+
+template <typename ActorIdT, typename FunctionT, typename... ArgsT>
+bool send_closure_later_bool(ActorIdT &&actor_id, FunctionT function, ArgsT &&... args) {
+  send_closure_later(std::forward<ActorIdT>(actor_id), function, std::forward<ArgsT>(args)...);
+  return true;
+}
+
+template <class ActorIdT, class... ArgsT>
+void send_lambda(ActorIdT &&actor_id, ArgsT &&... args) {
+  ActorIdT id = std::forward<ActorIdT>(actor_id);
+  detail::send_lambda(id.as_actor_ref(), std::forward<ArgsT>(args)...);
+}
+template <class ActorIdT, class... ArgsT>
+void send_lambda_later(ActorIdT &&actor_id, ArgsT &&... args) {
+  ActorIdT id = std::forward<ActorIdT>(actor_id);
+  detail::send_lambda_later(id.as_actor_ref(), std::forward<ArgsT>(args)...);
+}
+template <class ActorIdT>
+void send_signals(ActorIdT &&actor_id, ActorSignals signals) {
+  ActorIdT id = std::forward<ActorIdT>(actor_id);
+  detail::send_signals(id.as_actor_ref(), signals);
+}
+template <class ActorIdT>
+void send_signals_later(ActorIdT &&actor_id, ActorSignals signals) {
+  ActorIdT id = std::forward<ActorIdT>(actor_id);
+  detail::send_signals_later(id.as_actor_ref(), signals);
+}
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/common.h b/submodules/ton/tonlib-src/tdactor/td/actor/common.h
new file mode 100644
index 0000000000..039f25b2c9
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/common.h
@@ -0,0 +1,379 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/actor/core/Actor.h"
+#include "td/actor/core/ActorSignals.h"
+#include "td/actor/core/SchedulerId.h"
+#include "td/actor/core/SchedulerContext.h"
+#include "td/actor/core/Scheduler.h"
+
+#include "td/actor/PromiseFuture.h"
+
+#include "td/utils/Timer.h"
+
+namespace td {
+namespace actor {
+using core::ActorOptions;
+
+// Replacement for core::ActorSignals. Easier to use and do not allow internal signals
+class ActorSignals {
+ public:
+  static ActorSignals pause() {
+    return ActorSignals(core::ActorSignals::one(core::ActorSignals::Pause));
+  }
+  static ActorSignals kill() {
+    return ActorSignals(core::ActorSignals::one(core::ActorSignals::Kill));
+  }
+  static ActorSignals wakeup() {
+    return ActorSignals(core::ActorSignals::one(core::ActorSignals::Wakeup));
+  }
+  friend ActorSignals operator|(ActorSignals a, ActorSignals b) {
+    a.raw_.add_signals(b.raw_);
+    return a;
+  }
+  ActorSignals() = default;
+
+  core::ActorSignals raw() const {
+    return raw_;
+  }
+
+ private:
+  ActorSignals(core::ActorSignals raw) : raw_(raw) {
+  }
+  core::ActorSignals raw_;
+};
+
+// TODO: proper interface
+using core::Actor;
+using core::SchedulerContext;
+using core::SchedulerId;
+
+class Scheduler {
+ public:
+  struct NodeInfo {
+    NodeInfo(size_t cpu_threads) : cpu_threads_(cpu_threads) {
+    }
+    NodeInfo(size_t cpu_threads, size_t io_threads) : cpu_threads_(cpu_threads), io_threads_(io_threads) {
+    }
+    size_t cpu_threads_;
+    size_t io_threads_{1};
+  };
+
+  enum Mode { Running, Paused };
+  Scheduler(std::vector<NodeInfo> infos, Mode mode = Paused) : infos_(std::move(infos)) {
+    init();
+    if (mode == Running) {
+      start();
+    }
+  }
+
+  ~Scheduler() {
+    stop();
+  }
+  Scheduler(const Scheduler &) = delete;
+  Scheduler(Scheduler &&) = delete;
+  Scheduler &operator=(const Scheduler &) = delete;
+  Scheduler &operator=(Scheduler &&) = delete;
+
+  void start() {
+    if (is_started_) {
+      return;
+    }
+    is_started_ = true;
+    for (size_t it = 0; it < schedulers_.size(); it++) {
+      auto &scheduler = schedulers_[it];
+      scheduler->start();
+      if (it != 0) {
+        auto thread = td::thread([&] {
+          while (scheduler->run(10)) {
+          }
+        });
+        thread.set_name(PSLICE() << "#" << it << ":io");
+        thread.detach();
+      }
+    }
+  }
+
+  bool run() {
+    start();
+    while (schedulers_[0]->run(10)) {
+    }
+    return false;
+  }
+
+  bool run(double timeout) {
+    start();
+    return schedulers_[0]->run(timeout);
+  }
+
+  template <class F>
+  void run_in_context(F &&f) {
+    schedulers_[0]->run_in_context(std::forward<F>(f));
+  }
+
+  template <class F>
+  void run_in_context_external(F &&f) {
+    schedulers_[0]->run_in_context_external(std::forward<F>(f));
+  }
+
+  void stop() {
+    if (!group_info_) {
+      return;
+    }
+    if (!is_started_) {
+      start();
+    }
+    schedulers_[0]->stop();
+    run();
+    core::Scheduler::close_scheduler_group(*group_info_);
+    group_info_.reset();
+  }
+
+ private:
+  std::vector<NodeInfo> infos_{td::thread::hardware_concurrency()};
+  std::shared_ptr<core::SchedulerGroupInfo> group_info_;
+  std::vector<td::unique_ptr<core::Scheduler>> schedulers_;
+  bool is_started_{false};
+
+  void init() {
+    CHECK(infos_.size() < 256);
+    CHECK(!group_info_);
+    group_info_ = std::make_shared<core::SchedulerGroupInfo>(infos_.size());
+    td::uint8 id = 0;
+    for (const auto &info : infos_) {
+      schedulers_.emplace_back(td::make_unique<core::Scheduler>(group_info_, core::SchedulerId{id}, info.cpu_threads_));
+      id++;
+    }
+  }
+};
+
+// Some helper functions. Not part of public interface and not part
+// of namespace core
+namespace detail {
+template <class LambdaT>
+class ActorMessageLambda : public core::ActorMessageImpl {
+ public:
+  template <class FromLambdaT>
+  explicit ActorMessageLambda(FromLambdaT &&lambda) : lambda_(std::forward<FromLambdaT>(lambda)) {
+  }
+  void run() override {
+    //delivery_warning_.reset();
+    lambda_();
+  }
+
+ private:
+  LambdaT lambda_;
+  //PerfWarningTimer delivery_warning_{"Long message delivery", 2};
+};
+
+class ActorMessageCreator {
+ public:
+  template <class F>
+  static auto lambda(F &&f) {
+    return core::ActorMessage(std::make_unique<ActorMessageLambda<std::decay_t<F>>>(std::forward<F>(f)));
+  }
+
+  static auto hangup() {
+    return core::ActorMessage(std::make_unique<core::ActorMessageHangup>());
+  }
+
+  static auto hangup_shared() {
+    return core::ActorMessage(std::make_unique<core::ActorMessageHangupShared>());
+  }
+
+  // Use faster allocation?
+};
+struct ActorRef {
+  ActorRef(core::ActorInfo &actor_info, uint64 link_token = core::EmptyLinkToken)
+      : actor_info(actor_info), link_token(link_token) {
+  }
+
+  core::ActorInfo &actor_info;
+  uint64 link_token;
+};
+
+template <class T>
+T &current_actor() {
+  return static_cast<T &>(core::ActorExecuteContext::get()->actor());
+}
+
+inline void send_message(core::ActorInfo &actor_info, core::ActorMessage message) {
+  auto scheduler_context_ptr = core::SchedulerContext::get();
+  if (scheduler_context_ptr == nullptr) {
+    LOG(ERROR) << "send to actor is silently ignored";
+    return;
+  }
+  auto &scheduler_context = *scheduler_context_ptr;
+  core::ActorExecutor executor(actor_info, scheduler_context,
+                               core::ActorExecutor::Options().with_has_poll(scheduler_context.has_poll()));
+  executor.send(std::move(message));
+}
+
+inline void send_message(ActorRef actor_ref, core::ActorMessage message) {
+  message.set_link_token(actor_ref.link_token);
+  send_message(actor_ref.actor_info, std::move(message));
+}
+inline void send_message_later(core::ActorInfo &actor_info, core::ActorMessage message) {
+  auto scheduler_context_ptr = core::SchedulerContext::get();
+  if (scheduler_context_ptr == nullptr) {
+    LOG(ERROR) << "send to actor is silently ignored";
+    return;
+  }
+  auto &scheduler_context = *scheduler_context_ptr;
+  core::ActorExecutor executor(actor_info, scheduler_context,
+                               core::ActorExecutor::Options().with_has_poll(scheduler_context.has_poll()));
+  message.set_big();
+  executor.send(std::move(message));
+}
+
+inline void send_message_later(ActorRef actor_ref, core::ActorMessage message) {
+  message.set_link_token(actor_ref.link_token);
+  send_message_later(actor_ref.actor_info, std::move(message));
+}
+
+template <class ExecuteF, class ToMessageF>
+void send_immediate(ActorRef actor_ref, ExecuteF &&execute, ToMessageF &&to_message) {
+  auto scheduler_context_ptr = core::SchedulerContext::get();
+  if (scheduler_context_ptr == nullptr) {
+    LOG(ERROR) << "send to actor is silently ignored";
+    return;
+  }
+  auto &scheduler_context = *scheduler_context_ptr;
+  core::ActorExecutor executor(actor_ref.actor_info, scheduler_context,
+                               core::ActorExecutor::Options().with_has_poll(scheduler_context.has_poll()));
+  if (executor.can_send_immediate()) {
+    return executor.send_immediate(execute, actor_ref.link_token);
+  }
+  auto message = to_message();
+  message.set_link_token(actor_ref.link_token);
+  executor.send(std::move(message));
+}
+
+template <class F>
+void send_lambda(ActorRef actor_ref, F &&lambda) {
+  send_immediate(actor_ref, lambda, [&lambda]() mutable { return ActorMessageCreator::lambda(std::move(lambda)); });
+}
+template <class F>
+void send_lambda_later(ActorRef actor_ref, F &&lambda) {
+  send_message_later(actor_ref, ActorMessageCreator::lambda(std::move(lambda)));
+}
+
+template <class ClosureT>
+void send_closure_impl(ActorRef actor_ref, ClosureT &&closure) {
+  using ActorType = typename ClosureT::ActorType;
+  send_immediate(
+      actor_ref, [&closure]() mutable { closure.run(&current_actor<ActorType>()); },
+      [&closure]() mutable {
+        return ActorMessageCreator::lambda(
+            [closure = to_delayed_closure(std::move(closure))]() mutable { closure.run(&current_actor<ActorType>()); });
+      });
+}
+
+template <class... ArgsT>
+void send_closure(ActorRef actor_ref, ArgsT &&... args) {
+  send_closure_impl(actor_ref, create_immediate_closure(std::forward<ArgsT>(args)...));
+}
+
+template <class ClosureT>
+void send_closure_later_impl(ActorRef actor_ref, ClosureT &&closure) {
+  using ActorType = typename ClosureT::ActorType;
+  send_message_later(actor_ref,
+                     ActorMessageCreator::lambda([closure = to_delayed_closure(std::move(closure))]() mutable {
+                       closure.run(&current_actor<ActorType>());
+                     }));
+}
+
+template <class ClosureT, class PromiseT>
+void send_closure_with_promise(ActorRef actor_ref, ClosureT &&closure, PromiseT &&promise) {
+  using ActorType = typename ClosureT::ActorType;
+  using ResultType = decltype(closure.run(&current_actor<ActorType>()));
+  auto &&promise_i = promise_interface<ResultType>(std::forward<PromiseT>(promise));
+  send_immediate(
+      actor_ref, [&closure, &promise = promise_i]() mutable { promise(closure.run(&current_actor<ActorType>())); },
+      [&closure, &promise = promise_i]() mutable {
+        return ActorMessageCreator::lambda(
+            [closure = to_delayed_closure(std::move(closure)), promise = std::move(promise)]() mutable {
+              promise(closure.run(&current_actor<ActorType>()));
+            });
+      });
+}
+
+template <class ClosureT, class PromiseT>
+void send_closure_with_promise_later(ActorRef actor_ref, ClosureT &&closure, PromiseT &&promise) {
+  using ActorType = typename ClosureT::ActorType;
+  using ResultType = decltype(closure.run(&current_actor<ActorType>()));
+  send_message_later(
+      actor_ref,
+      ActorMessageCreator::lambda([closure = to_delayed_closure(std::move(closure)),
+                                   promise = promise_interface<ResultType>(std::forward<PromiseT>(promise))]() mutable {
+        promise(closure.run(&current_actor<ActorType>()));
+      }));
+}
+
+template <class... ArgsT>
+void send_closure_later(ActorRef actor_ref, ArgsT &&... args) {
+  send_closure_later_impl(actor_ref, create_delayed_closure(std::forward<ArgsT>(args)...));
+}
+
+inline void send_signals(ActorRef actor_ref, ActorSignals signals) {
+  auto scheduler_context_ptr = core::SchedulerContext::get();
+  if (scheduler_context_ptr == nullptr) {
+    LOG(ERROR) << "send to actor is silently ignored";
+    return;
+  }
+  auto &scheduler_context = *scheduler_context_ptr;
+  core::ActorExecutor executor(actor_ref.actor_info, scheduler_context,
+                               core::ActorExecutor::Options().with_has_poll(scheduler_context.has_poll()));
+  if (executor.can_send_immediate()) {
+    return executor.send_immediate(signals.raw());
+  }
+  executor.send(signals.raw());
+}
+
+inline void send_signals_later(ActorRef actor_ref, ActorSignals signals) {
+  auto scheduler_context_ptr = core::SchedulerContext::get();
+  if (scheduler_context_ptr == nullptr) {
+    LOG(ERROR) << "send to actor is silently ignored";
+    return;
+  }
+  auto &scheduler_context = *scheduler_context_ptr;
+  core::ActorExecutor executor(actor_ref.actor_info, scheduler_context,
+                               core::ActorExecutor::Options().with_has_poll(scheduler_context.has_poll()));
+  executor.send((signals | ActorSignals::pause()).raw());
+}
+
+inline void register_actor_info_ptr(core::ActorInfoPtr actor_info_ptr) {
+  auto state = actor_info_ptr->state().get_flags_unsafe();
+  core::SchedulerContext::get()->add_to_queue(std::move(actor_info_ptr), state.get_scheduler_id(), !state.is_shared());
+}
+
+template <class T, class... ArgsT>
+core::ActorInfoPtr create_actor(core::ActorOptions &options, ArgsT &&... args) {
+  auto *scheduler_context = core::SchedulerContext::get();
+  if (!options.has_scheduler()) {
+    options.on_scheduler(scheduler_context->get_scheduler_id());
+  }
+  auto res =
+      scheduler_context->get_actor_info_creator().create(std::make_unique<T>(std::forward<ArgsT>(args)...), options);
+  register_actor_info_ptr(res);
+  return res;
+}
+}  // namespace detail
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/Actor.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/Actor.h
new file mode 100644
index 0000000000..704405ed1f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/Actor.h
@@ -0,0 +1,108 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/actor/core/ActorInfo.h"
+
+#include "td/utils/SharedObjectPool.h"
+
+namespace td {
+namespace actor {
+namespace core {
+class Actor {
+ public:
+  Actor() = default;
+  Actor(const Actor &) = delete;
+  Actor &operator=(const Actor &) = delete;
+  Actor(Actor &&other) = delete;
+  Actor &operator=(Actor &&other) = delete;
+  virtual ~Actor() = default;
+
+  void set_actor_info_ptr(ActorInfoPtr actor_info_ptr) {
+    actor_info_ptr_ = std::move(actor_info_ptr);
+  }
+  const ActorInfoPtr &get_actor_info_ptr() const {
+    return actor_info_ptr_;
+  }
+
+  td::Unit dummy() {
+    return td::Unit();
+  }
+
+ protected:
+  // Signal handlers
+  virtual void start_up() {  // StartUp signal handler
+    yield();
+  }
+  virtual void tear_down() {  // TearDown signal handler (or Kill)
+    //noop
+  }
+  virtual void hangup() {  // HangUp signal handler
+    stop();
+  }
+  virtual void hangup_shared() {  // HangUp signal handler
+    loop();
+  }
+  virtual void wake_up() {  // WakeUp signal handler
+    loop();
+  }
+  virtual void alarm() {  // Alarm signal handler
+    loop();
+  }
+
+  virtual void loop() {  // default handler
+    //noop
+  }
+
+  // Useful functions
+  void yield() {  // send wakeup signal to itself
+    ActorExecuteContext::get()->set_yield();
+  }
+  void stop() {  // send Kill signal to itself
+    ActorExecuteContext::get()->set_stop();
+  }
+  Timestamp &alarm_timestamp() {
+    return ActorExecuteContext::get()->alarm_timestamp();
+  }
+  Timestamp get_alarm_timestamp() {
+    return ActorExecuteContext::get()->get_alarm_timestamp();
+  }
+
+  CSlice get_name() {
+    return actor_info_ptr_->get_name();
+  }
+  uint64 get_link_token() {
+    return ActorExecuteContext::get()->get_link_token();
+  }
+
+  //set context that will be inherited by all childrens
+  //void set_context(std::shared_ptr<ActorContext> context);
+
+  //void do_stop();  // process Kill signal immediately
+
+ private:
+  friend class ActorExecutor;
+  friend class ActorMessageHangup;
+  friend class ActorMessageHangupShared;
+
+  ActorInfoPtr actor_info_ptr_;
+};
+
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorExecuteContext.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorExecuteContext.h
new file mode 100644
index 0000000000..17cda3caab
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorExecuteContext.h
@@ -0,0 +1,101 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/core/Context.h"
+
+#include "td/utils/logging.h"
+#include "td/utils/Time.h"
+
+#include <limits>
+
+namespace td {
+namespace actor {
+namespace core {
+class Actor;
+
+enum : uint64 { EmptyLinkToken = std::numeric_limits<uint64>::max() };
+
+class ActorExecuteContext : public Context<ActorExecuteContext> {
+ public:
+  explicit ActorExecuteContext(Actor *actor, Timestamp alarm_timestamp = Timestamp::never())
+      : actor_(actor), alarm_timestamp_(alarm_timestamp) {
+  }
+  void set_actor(Actor *actor) {
+    actor_ = actor;
+  }
+  Actor &actor() const {
+    CHECK(actor_);
+    return *actor_;
+  }
+  bool has_flags() const {
+    return flags_ != 0;
+  }
+  bool has_immediate_flags() const {
+    return (flags_ & ~(1 << Alarm)) != 0;
+  }
+  void set_stop() {
+    flags_ |= 1 << Stop;
+  }
+  bool get_stop() const {
+    return (flags_ & (1 << Stop)) != 0;
+  }
+  void set_pause() {
+    flags_ |= 1 << Pause;
+  }
+  bool get_pause() const {
+    return (flags_ & (1 << Pause)) != 0;
+  }
+  void clear_actor() {
+    actor_ = nullptr;
+  }
+  void set_link_token(uint64 link_token) {
+    link_token_ = link_token;
+  }
+  uint64 get_link_token() const {
+    return link_token_;
+  }
+  Timestamp &alarm_timestamp() {
+    flags_ |= 1 << Alarm;
+    return alarm_timestamp_;
+  }
+  bool get_alarm_flag() const {
+    return (flags_ & (1 << Alarm)) != 0;
+  }
+  Timestamp get_alarm_timestamp() const {
+    return alarm_timestamp_;
+  }
+  void set_yield() {
+    flags_ |= 1 << Yield;
+  }
+  bool get_yield() {
+    return (flags_ & (1 << Yield)) != 0;
+  }
+
+ private:
+  Actor *actor_;
+  uint32 flags_{0};
+  uint64 link_token_{EmptyLinkToken};
+  Timestamp alarm_timestamp_;
+  enum { Stop, Pause, Alarm, Yield };
+};
+
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorExecutor.cpp b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorExecutor.cpp
new file mode 100644
index 0000000000..fcca341fd7
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorExecutor.cpp
@@ -0,0 +1,281 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/actor/core/ActorExecutor.h"
+
+#include "td/utils/ScopeGuard.h"
+
+namespace td {
+namespace actor {
+namespace core {
+void ActorExecutor::send_immediate(ActorMessage message) {
+  CHECK(can_send_immediate());
+  if (is_closed()) {
+    return;
+  }
+  if (message.is_big()) {
+    actor_info_.mailbox().reader().delay(std::move(message));
+    pending_signals_.add_signal(ActorSignals::Message);
+    actor_execute_context_.set_pause();
+    return;
+  }
+  actor_execute_context_.set_link_token(message.get_link_token());
+  message.run();
+}
+
+void ActorExecutor::send_immediate(ActorSignals signals) {
+  CHECK(can_send_immediate());
+  if (is_closed()) {
+    return;
+  }
+  SCOPE_EXIT {
+    pending_signals_.add_signals(signals);
+  };
+  while (flush_one_signal(signals) && !actor_execute_context_.has_immediate_flags()) {
+  }
+}
+
+void ActorExecutor::send(ActorMessage message) {
+  if (is_closed()) {
+    return;
+  }
+  if (can_send_immediate()) {
+    //LOG(ERROR) << "AE::send immediate";
+    return send_immediate(std::move(message));
+  }
+  //LOG(ERROR) << "AE::send delayed";
+  actor_info_.mailbox().push(std::move(message));
+  pending_signals_.add_signal(ActorSignals::Message);
+}
+
+void ActorExecutor::send(ActorSignals signals) {
+  if (is_closed()) {
+    return;
+  }
+
+  if (can_send_immediate()) {
+    return send_immediate(signals);
+  }
+
+  pending_signals_.add_signals(signals);
+}
+
+void ActorExecutor::start() {
+  //LOG(ERROR) << "START " << actor_info_.get_name() << " " << tag("from_queue", options.from_queue);
+  if (is_closed()) {
+    return;
+  }
+
+  ActorSignals signals;
+  SCOPE_EXIT {
+    pending_signals_.add_signals(signals);
+  };
+
+  if (options_.from_queue) {
+    signals.add_signal(ActorSignals::Pop);
+  }
+
+  actor_locker_.try_lock();
+  flags_ = actor_locker_.flags();
+
+  if (!actor_locker_.own_lock()) {
+    return;
+  }
+
+  if (!actor_locker_.can_execute()) {
+    CHECK(!options_.from_queue);
+    return;
+  }
+
+  signals.add_signals(flags().get_signals());
+  if (options_.from_queue) {
+    signals.clear_signal(ActorSignals::Pause);
+  }
+  flags().clear_signals();
+
+  if (flags_.is_closed()) {
+    return;
+  }
+
+  actor_execute_context_.set_actor(&actor_info_.actor());
+
+  while (flush_one_signal(signals)) {
+    if (actor_execute_context_.has_immediate_flags()) {
+      return;
+    }
+  }
+  while (flush_one_message()) {
+    if (actor_execute_context_.has_immediate_flags()) {
+      return;
+    }
+  }
+}
+
+void ActorExecutor::finish() {
+  //LOG(ERROR) << "FINISH " << actor_info_.get_name() << " " << tag("own_lock", actor_locker_.own_lock());
+  if (!actor_locker_.own_lock()) {
+    if (!pending_signals_.empty() && actor_locker_.add_signals(pending_signals_)) {
+      flags_ = actor_locker_.flags();
+      //LOG(ERROR) << "Own after finish " << actor_info_.get_name() << " " << format::as_binary(flags().raw());
+    } else {
+      //LOG(ERROR) << "DO FINISH " << actor_info_.get_name() << " " << flags();
+      return;
+    }
+  } else {
+    flags_.add_signals(pending_signals_);
+  }
+
+  CHECK(actor_locker_.own_lock());
+
+  if (td::unlikely(actor_execute_context_.has_flags())) {
+    flush_context_flags();
+  }
+
+  bool add_to_queue = false;
+  while (true) {
+    // Drop InQueue flag if has pop signal
+    // Can't delay or ignore this signal
+    auto signals = flags().get_signals();
+    if (signals.has_signal(ActorSignals::Pop)) {
+      signals.clear_signal(ActorSignals::Pop);
+      flags().set_signals(signals);
+      flags().set_in_queue(false);
+      //LOG(ERROR) << "clear in_queue " << format::as_binary(flags().raw());
+    }
+
+    //LOG(ERROR) << tag("in_queue", flags().is_in_queue()) << tag("has_signals", flags().has_signals());
+    if (flags_.is_closed()) {
+      // Writing to mailbox and closing actor may happen concurrently
+      // We must ensure that all messages in mailbox will be deleted
+      // Note that an ActorExecute may have to delete messages that was added by itself.
+      actor_info_.mailbox().clear();
+    } else {
+      // No need to add closed actor into queue.
+      if (flags().has_signals() && !flags().is_in_queue()) {
+        add_to_queue = true;
+        flags().set_in_queue(true);
+      }
+    }
+    ActorInfoPtr actor_info_ptr;
+    if (add_to_queue) {
+      actor_info_ptr = actor_info_.actor().get_actor_info_ptr();
+    }
+    if (actor_locker_.try_unlock(flags())) {
+      if (add_to_queue) {
+        dispatcher_.add_to_queue(std::move(actor_info_ptr), flags().get_scheduler_id(), !flags().is_shared());
+      }
+      break;
+    }
+    flags_ = actor_locker_.flags();
+  }
+  //LOG(ERROR) << "DO FINISH " << actor_info_.get_name() << " " << flags();
+}
+
+bool ActorExecutor::flush_one_signal(ActorSignals &signals) {
+  auto signal = signals.first_signal();
+  if (!signal) {
+    return false;
+  }
+  switch (signal) {
+    //NB: Signals will be handled in order of their value.
+    // For clarity it conincides with order in this switch
+    case ActorSignals::Pause:
+      actor_execute_context_.set_pause();
+      break;
+    case ActorSignals::Kill:
+      actor_execute_context_.set_stop();
+      break;
+    case ActorSignals::StartUp:
+      actor_info_.actor().start_up();
+      break;
+    case ActorSignals::Wakeup:
+      actor_info_.actor().wake_up();
+      break;
+    case ActorSignals::Alarm:
+      if (actor_execute_context_.get_alarm_timestamp() && actor_execute_context_.get_alarm_timestamp().is_in_past()) {
+        actor_execute_context_.alarm_timestamp() = Timestamp::never();
+        actor_info_.actor().alarm();
+      }
+      break;
+    case ActorSignals::Io:
+    case ActorSignals::Cpu:
+      LOG(FATAL) << "TODO";
+      break;
+    case ActorSignals::Message:
+      pending_signals_.add_signal(ActorSignals::Message);
+      actor_info_.mailbox().pop_all();
+      break;
+    case ActorSignals::Pop:
+      flags().set_in_queue(false);
+      break;
+    default:
+      UNREACHABLE();
+  }
+  signals.clear_signal(signal);
+  return true;
+}
+
+bool ActorExecutor::flush_one_message() {
+  auto message = actor_info_.mailbox().reader().read();
+  //LOG(ERROR) << "flush one message " << !!message << " " << actor_info_.get_name();
+  if (!message) {
+    pending_signals_.clear_signal(ActorSignals::Message);
+    return false;
+  }
+  if (message.is_big() && !options_.from_queue) {
+    actor_info_.mailbox().reader().delay(std::move(message));
+    actor_execute_context_.set_pause();
+    return false;
+  }
+
+  actor_execute_context_.set_link_token(message.get_link_token());
+  message.run();
+  return true;
+}
+
+void ActorExecutor::flush_context_flags() {
+  if (actor_execute_context_.get_stop()) {
+    if (actor_info_.get_alarm_timestamp()) {
+      actor_info_.set_alarm_timestamp(Timestamp::never());
+      dispatcher_.set_alarm_timestamp(actor_info_.actor().get_actor_info_ptr());
+    }
+    flags_.set_closed(true);
+    if (!flags_.get_signals().has_signal(ActorSignals::Signal::StartUp)) {
+      actor_info_.actor().tear_down();
+    }
+    actor_info_.destroy_actor();
+  } else {
+    if (actor_execute_context_.get_pause()) {
+      flags_.add_signals(ActorSignals::one(ActorSignals::Pause));
+    }
+    if (actor_execute_context_.get_yield()) {
+      flags_.add_signals(ActorSignals::one(ActorSignals::Wakeup));
+    }
+    if (actor_execute_context_.get_alarm_flag()) {
+      auto old_timestamp = actor_info_.get_alarm_timestamp();
+      auto new_timestamp = actor_execute_context_.get_alarm_timestamp();
+      if (!(old_timestamp == new_timestamp)) {
+        actor_info_.set_alarm_timestamp(new_timestamp);
+        dispatcher_.set_alarm_timestamp(actor_info_.actor().get_actor_info_ptr());
+      }
+    }
+  }
+}
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorExecutor.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorExecutor.h
new file mode 100644
index 0000000000..d11c77b2c2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorExecutor.h
@@ -0,0 +1,119 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/core/ActorExecuteContext.h"
+#include "td/actor/core/ActorInfo.h"
+#include "td/actor/core/ActorLocker.h"
+#include "td/actor/core/ActorMessage.h"
+#include "td/actor/core/ActorSignals.h"
+#include "td/actor/core/ActorState.h"
+#include "td/actor/core/SchedulerContext.h"
+
+#include "td/utils/format.h"
+
+namespace td {
+namespace actor {
+namespace core {
+class ActorExecutor {
+ public:
+  struct Options {
+    Options &with_from_queue() {
+      from_queue = true;
+      return *this;
+    }
+    Options &with_has_poll(bool new_has_poll) {
+      this->has_poll = new_has_poll;
+      return *this;
+    }
+    bool from_queue{false};
+    bool has_poll{false};
+  };
+
+  ActorExecutor(ActorInfo &actor_info, SchedulerDispatcher &dispatcher, Options options)
+      : actor_info_(actor_info), dispatcher_(dispatcher), options_(options) {
+    old_log_tag_ = LOG_TAG2;
+    LOG_TAG2 = actor_info.get_name().c_str();
+    start();
+  }
+  ActorExecutor(const ActorExecutor &) = delete;
+  ActorExecutor &operator=(const ActorExecutor &) = delete;
+  ActorExecutor(ActorExecutor &&other) = delete;
+  ActorExecutor &operator=(ActorExecutor &&other) = delete;
+  ~ActorExecutor() {
+    finish();
+    LOG_TAG2 = old_log_tag_;
+  }
+
+  // our best guess if actor is closed or not
+  bool is_closed() {
+    return flags().is_closed();
+  }
+
+  bool can_send_immediate() {
+    return actor_locker_.own_lock() && !actor_execute_context_.has_immediate_flags() && actor_locker_.can_execute();
+  }
+
+  template <class F>
+  void send_immediate(F &&f, uint64 link_token) {
+    CHECK(can_send_immediate());
+    if (is_closed()) {
+      return;
+    }
+    actor_execute_context_.set_link_token(link_token);
+    f();
+  }
+
+  void send_immediate(ActorMessage message);
+  void send_immediate(ActorSignals signals);
+  void send(ActorMessage message);
+  void send(ActorSignals signals);
+
+ private:
+  ActorInfo &actor_info_;
+  SchedulerDispatcher &dispatcher_;
+  Options options_;
+  ActorLocker actor_locker_{&actor_info_.state(), ActorLocker::Options()
+                                                      .with_can_execute_paused(options_.from_queue)
+                                                      .with_is_shared(!options_.has_poll)
+                                                      .with_scheduler_id(dispatcher_.get_scheduler_id())};
+
+  ActorExecuteContext actor_execute_context_{nullptr, actor_info_.get_alarm_timestamp()};
+  ActorExecuteContext::Guard guard{&actor_execute_context_};
+
+  ActorState::Flags flags_;
+  ActorSignals pending_signals_;
+
+  const char *old_log_tag_;
+
+  ActorState::Flags &flags() {
+    return flags_;
+  }
+
+  void start();
+  void finish();
+
+  bool flush_one(ActorSignals &signals);
+  bool flush_one_signal(ActorSignals &signals);
+  bool flush_one_message();
+  void flush_context_flags();
+};
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorInfo.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorInfo.h
new file mode 100644
index 0000000000..e2574c0dbf
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorInfo.h
@@ -0,0 +1,109 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/core/ActorState.h"
+#include "td/actor/core/ActorMailbox.h"
+
+#include "td/utils/Heap.h"
+#include "td/utils/List.h"
+#include "td/utils/Time.h"
+#include "td/utils/SharedObjectPool.h"
+
+namespace td {
+namespace actor {
+namespace core {
+class Actor;
+class ActorInfo;
+using ActorInfoPtr = SharedObjectPool<ActorInfo>::Ptr;
+class ActorInfo : private HeapNode, private ListNode {
+ public:
+  ActorInfo(std::unique_ptr<Actor> actor, ActorState::Flags state_flags, Slice name)
+      : actor_(std::move(actor)), name_(name.begin(), name.size()) {
+    state_.set_flags_unsafe(state_flags);
+    VLOG(actor) << "Create actor [" << name_ << "]";
+  }
+  ~ActorInfo() {
+    VLOG(actor) << "Destroy actor [" << name_ << "]";
+  }
+
+  bool is_alive() const {
+    return !state_.get_flags_unsafe().is_closed();
+  }
+
+  bool has_actor() const {
+    return bool(actor_);
+  }
+  Actor &actor() {
+    CHECK(has_actor());
+    return *actor_;
+  }
+  Actor *actor_ptr() const {
+    return actor_.get();
+  }
+  void destroy_actor() {
+    actor_.reset();
+  }
+  ActorState &state() {
+    return state_;
+  }
+  ActorMailbox &mailbox() {
+    return mailbox_;
+  }
+  CSlice get_name() const {
+    return name_;
+  }
+
+  HeapNode *as_heap_node() {
+    return this;
+  }
+  static ActorInfo *from_heap_node(HeapNode *node) {
+    return static_cast<ActorInfo *>(node);
+  }
+
+  Timestamp get_alarm_timestamp() const {
+    return Timestamp::at(alarm_timestamp_at_.load(std::memory_order_relaxed));
+  }
+  void set_alarm_timestamp(Timestamp timestamp) {
+    alarm_timestamp_at_.store(timestamp.at(), std::memory_order_relaxed);
+  }
+
+  void pin(ActorInfoPtr ptr) {
+    CHECK(pin_.empty());
+    CHECK(&*ptr == this);
+    pin_ = std::move(ptr);
+  }
+  ActorInfoPtr unpin() {
+    CHECK(!pin_.empty());
+    return std::move(pin_);
+  }
+
+ private:
+  std::unique_ptr<Actor> actor_;
+  ActorState state_;
+  ActorMailbox mailbox_;
+  std::string name_;
+  std::atomic<double> alarm_timestamp_at_{0};
+
+  ActorInfoPtr pin_;
+};
+
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorInfoCreator.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorInfoCreator.h
new file mode 100644
index 0000000000..60ee8f0e9f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorInfoCreator.h
@@ -0,0 +1,98 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/actor/core/ActorInfo.h"
+#include "td/actor/core/Actor.h"
+
+namespace td {
+namespace actor {
+namespace core {
+class ActorInfoCreator {
+ public:
+  class Options {
+   public:
+    Options() = default;
+
+    Options &with_name(Slice new_name) {
+      name = new_name;
+      return *this;
+    }
+
+    Options &on_scheduler(SchedulerId new_scheduler_id) {
+      scheduler_id = new_scheduler_id;
+      return *this;
+    }
+    bool has_scheduler() const {
+      return scheduler_id.is_valid();
+    }
+    Options &with_poll(bool has_poll = true) {
+      is_shared = !has_poll;
+      return *this;
+    }
+
+   private:
+    friend class ActorInfoCreator;
+    Slice name;
+    SchedulerId scheduler_id;
+    bool is_shared{true};
+    bool in_queue{true};
+    //TODO: rename
+  };
+
+  //Create unlocked actor. One must send StartUp signal immediately.
+  ActorInfoPtr create(std::unique_ptr<Actor> actor, const Options &args) {
+    ActorState::Flags flags;
+    flags.set_scheduler_id(args.scheduler_id);
+    if (allow_shared_) {
+      flags.set_shared(args.is_shared);
+    }
+    flags.set_in_queue(args.in_queue);
+    flags.set_signals(ActorSignals::one(ActorSignals::StartUp));
+
+    auto actor_info_ptr = pool_.alloc(std::move(actor), flags, args.name);
+    actor_info_ptr->actor().set_actor_info_ptr(actor_info_ptr);
+    return actor_info_ptr;
+  }
+
+  ActorInfoCreator() = default;
+  explicit ActorInfoCreator(bool allow_shared) : allow_shared_(allow_shared) {
+  }
+  ActorInfoCreator(const ActorInfoCreator &) = delete;
+  ActorInfoCreator &operator=(const ActorInfoCreator &) = delete;
+  ActorInfoCreator(ActorInfoCreator &&other) = delete;
+  ActorInfoCreator &operator=(ActorInfoCreator &&other) = delete;
+  void clear() {
+    pool_.for_each([](auto &actor_info) { actor_info.destroy_actor(); });
+  }
+  ~ActorInfoCreator() {
+    clear();
+  }
+  void ensure_empty() {
+    pool_.for_each([](auto &actor_info) { LOG(ERROR) << actor_info.get_name(); });
+  }
+
+ private:
+  SharedObjectPool<ActorInfo> pool_;
+  bool allow_shared_{true};
+};
+
+using ActorOptions = ActorInfoCreator::Options;
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorLocker.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorLocker.h
new file mode 100644
index 0000000000..2374fdfc7b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorLocker.h
@@ -0,0 +1,152 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/core/ActorSignals.h"
+#include "td/actor/core/ActorState.h"
+
+#include "td/utils/logging.h"
+
+#include <atomic>
+
+namespace td {
+namespace actor {
+namespace core {
+class ActorLocker {
+ public:
+  struct Options {
+    Options() {
+    }
+    bool can_execute_paused = false;
+    bool is_shared = true;
+    SchedulerId scheduler_id;
+
+    Options &with_can_execute_paused(bool new_can_execute_paused) {
+      can_execute_paused = new_can_execute_paused;
+      return *this;
+    }
+    Options &with_is_shared(bool new_is_shared) {
+      is_shared = new_is_shared;
+      return *this;
+    }
+    Options &with_scheduler_id(SchedulerId id) {
+      scheduler_id = id;
+      return *this;
+    }
+  };
+  explicit ActorLocker(ActorState *state, Options options = {})
+      : state_(state), flags_(state->get_flags_unsafe()), new_flags_{}, options_{options} {
+  }
+  bool try_lock() {
+    CHECK(!own_lock());
+    while (!can_try_add_signals()) {
+      new_flags_ = flags_;
+      new_flags_.set_locked(true);
+      new_flags_.clear_signals();
+      if (state_->state_.compare_exchange_strong(flags_.raw_ref(), new_flags_.raw(), std::memory_order_acq_rel)) {
+        own_lock_ = true;
+        return true;
+      }
+    }
+    return false;
+  }
+  bool try_unlock(ActorState::Flags flags) {
+    CHECK(!flags.is_locked());
+    CHECK(own_lock());
+    // can't unlock with signals set
+    //CHECK(!flags.has_signals());
+
+    flags_ = flags;
+    // try to unlock
+    if (state_->state_.compare_exchange_strong(new_flags_.raw_ref(), flags.raw(), std::memory_order_acq_rel)) {
+      own_lock_ = false;
+      return true;
+    }
+
+    // read all signals
+    flags.set_locked(true);
+    flags.clear_signals();
+    do {
+      flags_.add_signals(new_flags_.get_signals());
+    } while (!state_->state_.compare_exchange_strong(new_flags_.raw_ref(), flags.raw(), std::memory_order_acq_rel));
+    new_flags_ = flags;
+    return false;
+  }
+
+  bool try_add_signals(ActorSignals signals) {
+    CHECK(!own_lock());
+    CHECK(can_try_add_signals());
+    new_flags_ = flags_;
+    new_flags_.add_signals(signals);
+
+    // This is not an optimization.
+    // Sometimes it helps sometimes it makes things worse
+    // It there are a lot of threads concurrently sending signals to an actor it helps
+    // Buf it threre is only one thread, CAS without conficts is much cheaper than full
+    // barrier.
+    if (false && flags_.raw() == new_flags_.raw()) {
+      std::atomic_thread_fence(std::memory_order_seq_cst);
+      auto actual_flags = state_->get_flags_unsafe();
+      if (actual_flags.raw() == new_flags_.raw()) {
+        return true;
+      }
+    }
+
+    return state_->state_.compare_exchange_strong(flags_.raw_ref(), new_flags_.raw(), std::memory_order_acq_rel);
+  }
+  bool add_signals(ActorSignals signals) {
+    CHECK(!own_lock());
+    while (true) {
+      if (can_try_add_signals()) {
+        if (try_add_signals(signals)) {
+          return false;
+        }
+      } else {
+        if (try_lock()) {
+          flags_.add_signals(signals);
+          return true;
+        }
+      }
+    }
+  }
+  bool own_lock() const {
+    return own_lock_;
+  }
+  ActorState::Flags flags() const {
+    return flags_;
+  }
+  bool can_execute() const {
+    return flags_.is_shared() == options_.is_shared && flags_.get_scheduler_id() == options_.scheduler_id &&
+           (options_.can_execute_paused || !flags_.get_signals().has_signal(ActorSignals::Pause));
+  }
+
+ private:
+  ActorState *state_{nullptr};
+  ActorState::Flags flags_;
+  ActorState::Flags new_flags_;
+  bool own_lock_{false};
+  Options options_;
+
+  bool can_try_add_signals() const {
+    return flags_.is_locked() || (flags_.is_in_queue() && !can_execute());
+  }
+};
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorMailbox.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorMailbox.h
new file mode 100644
index 0000000000..e66813a9a5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorMailbox.h
@@ -0,0 +1,68 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/core/ActorMessage.h"
+#include "td/utils/MpscLinkQueue.h"
+
+namespace td {
+namespace actor {
+namespace core {
+class ActorMailbox {
+ public:
+  ActorMailbox() = default;
+  ActorMailbox(const ActorMailbox &) = delete;
+  ActorMailbox &operator=(const ActorMailbox &) = delete;
+  ActorMailbox(ActorMailbox &&other) = delete;
+  ActorMailbox &operator=(ActorMailbox &&other) = delete;
+  ~ActorMailbox() {
+    clear();
+  }
+  void push(ActorMessage message) {
+    queue_.push(std::move(message));
+  }
+  void push_unsafe(ActorMessage message) {
+    queue_.push_unsafe(std::move(message));
+  }
+
+  td::MpscLinkQueue<ActorMessage>::Reader &reader() {
+    return reader_;
+  }
+
+  void pop_all() {
+    queue_.pop_all(reader_);
+  }
+  void pop_all_unsafe() {
+    queue_.pop_all_unsafe(reader_);
+  }
+
+  void clear() {
+    pop_all();
+    while (reader_.read()) {
+      // skip
+    }
+  }
+
+ private:
+  td::MpscLinkQueue<ActorMessage> queue_;
+  td::MpscLinkQueue<ActorMessage>::Reader reader_;
+};
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorMessage.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorMessage.h
new file mode 100644
index 0000000000..8368f00b37
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorMessage.h
@@ -0,0 +1,97 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/core/ActorExecuteContext.h"
+
+#include "td/utils/MpscLinkQueue.h"
+
+namespace td {
+namespace actor {
+namespace core {
+class ActorMessageImpl : private MpscLinkQueueImpl::Node {
+ public:
+  ActorMessageImpl() = default;
+  ActorMessageImpl(const ActorMessageImpl &) = delete;
+  ActorMessageImpl &operator=(const ActorMessageImpl &) = delete;
+  ActorMessageImpl(ActorMessageImpl &&other) = delete;
+  ActorMessageImpl &operator=(ActorMessageImpl &&other) = delete;
+
+  virtual ~ActorMessageImpl() = default;
+  virtual void run() = 0;
+
+ private:
+  friend class ActorMessage;
+
+  // ActorMessage <--> MpscLintQueue::Node
+  // Each actor's mailbox will be a queue
+  static ActorMessageImpl *from_mpsc_link_queue_node(MpscLinkQueueImpl::Node *node) {
+    return static_cast<ActorMessageImpl *>(node);
+  }
+  MpscLinkQueueImpl::Node *to_mpsc_link_queue_node() {
+    return static_cast<MpscLinkQueueImpl::Node *>(this);
+  }
+
+  uint64 link_token_{EmptyLinkToken};
+  bool is_big_{false};
+};
+
+class ActorMessage {
+ public:
+  ActorMessage() = default;
+  explicit ActorMessage(std::unique_ptr<ActorMessageImpl> impl) : impl_(std::move(impl)) {
+  }
+  void run() {
+    CHECK(impl_);
+    impl_->run();
+  }
+  explicit operator bool() {
+    return bool(impl_);
+  }
+  friend class ActorMailbox;
+
+  void set_link_token(uint64 link_token) {
+    impl_->link_token_ = link_token;
+  }
+  uint64 get_link_token() const {
+    return impl_->link_token_;
+  }
+  bool is_big() const {
+    return impl_->is_big_;
+  }
+  void set_big() {
+    impl_->is_big_ = true;
+  }
+
+ private:
+  std::unique_ptr<ActorMessageImpl> impl_;
+
+  template <class T>
+  friend class td::MpscLinkQueue;
+
+  static ActorMessage from_mpsc_link_queue_node(MpscLinkQueueImpl::Node *node) {
+    return ActorMessage(std::unique_ptr<ActorMessageImpl>(ActorMessageImpl::from_mpsc_link_queue_node(node)));
+  }
+  MpscLinkQueueImpl::Node *to_mpsc_link_queue_node() {
+    return impl_.release()->to_mpsc_link_queue_node();
+  }
+};
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorSignals.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorSignals.h
new file mode 100644
index 0000000000..6cab610cfe
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorSignals.h
@@ -0,0 +1,118 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/bits.h"
+#include "td/utils/format.h"
+
+namespace td {
+namespace actor {
+namespace core {
+class ActorSignals {
+ public:
+  ActorSignals() = default;
+  uint32 raw() const {
+    return raw_;
+  }
+  static ActorSignals create_raw(uint32 raw) {
+    return ActorSignals(raw);
+  }
+  bool empty() const {
+    return raw_ == 0;
+  }
+  bool has_signal(uint32 signal) const {
+    return (raw_ & (1u << signal)) != 0;
+  }
+  void add_signal(uint32 signal) {
+    raw_ |= (1u << signal);
+  }
+  void add_signals(ActorSignals signals) {
+    raw_ |= signals.raw();
+  }
+  void clear_signal(uint32 signal) {
+    raw_ &= ~(1u << signal);
+  }
+  uint32 first_signal() {
+    if (!raw_) {
+      return 0;
+    }
+    return td::count_trailing_zeroes_non_zero32(raw_);
+  }
+  friend StringBuilder &operator<<(StringBuilder &sb, ActorSignals signals) {
+    sb << "S{";
+    bool was = false;
+    auto add_signal = [&](int signal, auto name) {
+      if (signals.has_signal(signal)) {
+        if (was) {
+          sb << ",";
+        } else {
+          was = true;
+        }
+        sb << name;
+      }
+    };
+    add_signal(Wakeup, "Wakeup");
+    add_signal(Alarm, "Alarm");
+    add_signal(Kill, "Kill");
+    add_signal(Io, "Io");
+    add_signal(Cpu, "Cpu");
+    add_signal(StartUp, "StartUp");
+    add_signal(Pop, "Pop");
+    add_signal(Message, "Message");
+    add_signal(Pause, "Pause");
+    sb << "}";
+    return sb;
+  }
+  enum Signal : uint32 {
+    // Signals in order of priority
+    Pause = 1,
+    Kill = 2,  // immediate kill
+    StartUp = 3,
+    Wakeup = 4,
+    Alarm = 5,
+    Io = 6,   // move to io thread
+    Cpu = 7,  // move to cpu thread
+    // Two signals for mpmc queue logic
+    //
+    // PopSignal is set after actor is popped from queue
+    // When processed it should set InQueue and Pause flags to false.
+    //
+    // MessagesSignal is set after new messages was added to actor
+    // If owner of actor wish to delay message handling, she should set InQueue flag to true and
+    // add actor into mpmc queue.
+    Pop = 8,      // got popped from queue
+    Message = 9,  // got new message
+  };
+
+  static ActorSignals one(uint32 signal) {
+    ActorSignals res;
+    res.add_signal(signal);
+    return res;
+  }
+
+ private:
+  uint32 raw_{0};
+  friend class ActorState;
+  explicit ActorSignals(uint32 raw) : raw_(raw) {
+  }
+};
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorState.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorState.h
new file mode 100644
index 0000000000..079f0789fb
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/ActorState.h
@@ -0,0 +1,181 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/core/ActorSignals.h"
+#include "td/actor/core/SchedulerId.h"
+
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+
+#include <atomic>
+
+namespace td {
+namespace actor {
+namespace core {
+class ActorState {
+ public:
+  class Flags {
+   public:
+    Flags() = default;
+    uint32 raw() const {
+      return raw_;
+    }
+    uint32 &raw_ref() {
+      return raw_;
+    }
+    SchedulerId get_scheduler_id() const {
+      return SchedulerId{static_cast<uint8>(raw_ & SchedulerMask)};
+    }
+    void set_scheduler_id(SchedulerId id) {
+      raw_ = (raw_ & ~SchedulerMask) | id.value();
+    }
+
+    bool is_shared() const {
+      return check_flag(SharedFlag);
+    }
+    void set_shared(bool shared) {
+      set_flag(SharedFlag, shared);
+    }
+
+    bool is_locked() const {
+      return check_flag(LockFlag);
+    }
+    void set_locked(bool locked) {
+      set_flag(LockFlag, locked);
+    }
+
+    bool is_migrate() const {
+      return check_flag(MigrateFlag);
+    }
+    void set_migrate(bool migrate) {
+      set_flag(MigrateFlag, migrate);
+    }
+
+    bool is_closed() const {
+      return check_flag(ClosedFlag);
+    }
+    void set_closed(bool closed) {
+      set_flag(ClosedFlag, closed);
+    }
+
+    bool is_in_queue() const {
+      return check_flag(InQueueFlag);
+    }
+    void set_in_queue(bool in_queue) {
+      set_flag(InQueueFlag, in_queue);
+    }
+
+    bool has_signals() const {
+      return check_flag(SignalMask);
+    }
+    void clear_signals() {
+      set_flag(SignalMask, false);
+    }
+    void set_signals(ActorSignals signals) {
+      raw_ = (raw_ & ~SignalMask) | (signals.raw() << SignalOffset);
+    }
+    void add_signals(ActorSignals signals) {
+      raw_ = raw_ | (signals.raw() << SignalOffset);
+    }
+    ActorSignals get_signals() const {
+      return ActorSignals{(raw_ & SignalMask) >> SignalOffset};
+    }
+    friend StringBuilder &operator<<(StringBuilder &sb, Flags flags) {
+      sb << "ActorFlags{" << flags.get_scheduler_id().value() << ", " << (flags.is_shared() ? "cpu " : "io ")
+         << (flags.is_migrate() ? "migrate " : "") << (flags.is_closed() ? "closed " : "")
+         << (flags.is_in_queue() ? "in_queue " : "") << flags.get_signals() << "}";
+
+      return sb;
+    }
+
+   private:
+    uint32 raw_{0};
+
+    friend class ActorState;
+    Flags(uint32 raw) : raw_(raw) {
+    }
+
+    bool check_flag(uint32 mask) const {
+      return (raw_ & mask) != 0;
+    }
+    void set_flag(uint32 mask, bool flag) {
+      raw_ = (raw_ & ~mask) | (flag * mask);
+    }
+  };
+
+  Flags get_flags_unsafe() const {
+    return Flags(state_.load(std::memory_order_relaxed));
+  }
+  void set_flags_unsafe(Flags flags) {
+    state_.store(flags.raw(), std::memory_order_relaxed);
+  }
+
+ private:
+  friend class ActorLocker;
+  std::atomic<uint32> state_{0};
+  enum : uint32 {
+    SchedulerMask = 255,
+
+    // Actors can be shared or not.
+    // If actor is shared, than any thread may try to lock it
+    // If actor is not shared, than it is owned by its scheduler, and only
+    // its scheduler is allowed to access it
+    // This flag may NOT change during the lifetime of an actor
+    SharedFlag = 1 << 9,
+
+    // Only shared actors need lock
+    // Lock if somebody is going to unlock it eventually.
+    // For example actor is locked, when some scheduler is executing its mailbox
+    // Or it is locked when it is in Mpmc queue, so someone will pop it eventually.
+    LockFlag = 1 << 10,
+
+    // While actor is migrating from one scheduler to another no one is allowed to change it
+    // Could not be set for shared actors.
+    MigrateFlag = 1 << 11,
+
+    // While set all messages are delayed
+    // Dropped from flush_maibox
+    // PauseFlag => InQueueFlag
+    PauseFlag = 1 << 12,
+
+    ClosedFlag = 1 << 13,
+
+    InQueueFlag = 1 << 14,
+
+    // Signals
+    SignalOffset = 15,
+    Signal = 1 << SignalOffset,
+    WakeupSignalFlag = Signal << ActorSignals::Wakeup,
+    AlarmSignalFlag = Signal << ActorSignals::Alarm,
+    KillSignalFlag = Signal << ActorSignals::Kill,  // immediate kill
+    IoSignalFlag = Signal << ActorSignals::Io,      // move to io thread
+    CpuSignalFlag = Signal << ActorSignals::Cpu,    // move to cpu thread
+    StartUpSignalFlag = Signal << ActorSignals::StartUp,
+    MessageSignalFlag = Signal << ActorSignals::Message,
+    PopSignalFlag = Signal << ActorSignals::Pop,
+    PauseSignalFlag = Signal << ActorSignals::Pause,
+
+    SignalMask = WakeupSignalFlag | AlarmSignalFlag | KillSignalFlag | IoSignalFlag | CpuSignalFlag |
+                 StartUpSignalFlag | MessageSignalFlag | PopSignalFlag | PauseSignalFlag
+  };
+};
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/Context.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/Context.h
new file mode 100644
index 0000000000..c8c2a8882b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/Context.h
@@ -0,0 +1,59 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/thread_local.h"
+
+namespace td {
+namespace actor {
+namespace core {
+template <class Impl>
+class Context {
+ public:
+  static Impl *get() {
+    return context_;
+  }
+  class Guard {
+   public:
+    explicit Guard(Impl *new_context) {
+      old_context_ = context_;
+      context_ = new_context;
+    }
+    ~Guard() {
+      context_ = old_context_;
+    }
+    Guard(const Guard &) = delete;
+    Guard &operator=(const Guard &) = delete;
+    Guard(Guard &&) = delete;
+    Guard &operator=(Guard &&) = delete;
+
+   private:
+    Impl *old_context_;
+  };
+
+ private:
+  static TD_THREAD_LOCAL Impl *context_;
+};
+
+template <class Impl>
+TD_THREAD_LOCAL Impl *Context<Impl>::context_;
+
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/CpuWorker.cpp b/submodules/ton/tonlib-src/tdactor/td/actor/core/CpuWorker.cpp
new file mode 100644
index 0000000000..e047eab12a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/CpuWorker.cpp
@@ -0,0 +1,47 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/actor/core/CpuWorker.h"
+
+#include "td/actor/core/ActorExecutor.h"
+#include "td/actor/core/SchedulerContext.h"
+
+namespace td {
+namespace actor {
+namespace core {
+void CpuWorker::run() {
+  auto thread_id = get_thread_id();
+  auto &dispatcher = *SchedulerContext::get();
+
+  int yields = 0;
+  while (true) {
+    SchedulerMessage message;
+    if (queue_.try_pop(message, thread_id)) {
+      if (!message) {
+        return;
+      }
+      ActorExecutor executor(*message, dispatcher, ActorExecutor::Options().with_from_queue());
+      yields = waiter_.stop_wait(yields, thread_id);
+    } else {
+      yields = waiter_.wait(yields, thread_id);
+    }
+  }
+}
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/CpuWorker.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/CpuWorker.h
new file mode 100644
index 0000000000..63cb337b4d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/CpuWorker.h
@@ -0,0 +1,41 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/core/SchedulerMessage.h"
+
+#include "td/utils/MpmcQueue.h"
+#include "td/utils/MpmcWaiter.h"
+
+namespace td {
+namespace actor {
+namespace core {
+class CpuWorker {
+ public:
+  CpuWorker(MpmcQueue<SchedulerMessage> &queue, MpmcWaiter &waiter) : queue_(queue), waiter_(waiter) {
+  }
+  void run();
+
+ private:
+  MpmcQueue<SchedulerMessage> &queue_;
+  MpmcWaiter &waiter_;
+};
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/IoWorker.cpp b/submodules/ton/tonlib-src/tdactor/td/actor/core/IoWorker.cpp
new file mode 100644
index 0000000000..91c2815553
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/IoWorker.cpp
@@ -0,0 +1,100 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/actor/core/IoWorker.h"
+
+#include "td/actor/core/ActorExecutor.h"
+
+namespace td {
+namespace actor {
+namespace core {
+void IoWorker::start_up() {
+#if TD_PORT_POSIX
+  auto &poll = SchedulerContext::get()->get_poll();
+  poll.subscribe(queue_.reader_get_event_fd().get_poll_info().extract_pollable_fd(nullptr), PollFlags::Read());
+#endif
+}
+void IoWorker::tear_down() {
+#if TD_PORT_POSIX
+  auto &poll = SchedulerContext::get()->get_poll();
+  poll.unsubscribe(queue_.reader_get_event_fd().get_poll_info().get_pollable_fd_ref());
+#endif
+}
+
+bool IoWorker::run_once(double timeout) {
+  auto &dispatcher = *SchedulerContext::get();
+#if TD_PORT_POSIX
+  auto &poll = SchedulerContext::get()->get_poll();
+#endif
+  auto &heap = SchedulerContext::get()->get_heap();
+
+  auto now = Time::now();  // update Time::now_cached()
+  while (!heap.empty() && heap.top_key() <= now) {
+    auto *heap_node = heap.pop();
+    auto *actor_info = ActorInfo::from_heap_node(heap_node);
+
+    auto id = actor_info->unpin();
+    ActorExecutor executor(*actor_info, dispatcher, ActorExecutor::Options().with_has_poll(true));
+    if (executor.can_send_immediate()) {
+      executor.send_immediate(ActorSignals::one(ActorSignals::Alarm));
+    } else {
+      executor.send(ActorSignals::one(ActorSignals::Alarm));
+    }
+  }
+
+  const int size = queue_.reader_wait_nonblock();
+  for (int i = 0; i < size; i++) {
+    auto message = queue_.reader_get_unsafe();
+    if (!message) {
+      return false;
+    }
+    if (message->state().get_flags_unsafe().is_shared()) {
+      // should check actors timeout
+      dispatcher.set_alarm_timestamp(message);
+      continue;
+    }
+    ActorExecutor executor(*message, dispatcher, ActorExecutor::Options().with_from_queue().with_has_poll(true));
+  }
+  queue_.reader_flush();
+
+  bool can_sleep = size == 0 && timeout != 0;
+  int32 timeout_ms = 0;
+  if (can_sleep) {
+    auto wakeup_timestamp = Timestamp::in(timeout);
+    if (!heap.empty()) {
+      wakeup_timestamp.relax(Timestamp::at(heap.top_key()));
+    }
+    timeout_ms = static_cast<int>(wakeup_timestamp.in() * 1000) + 1;
+    if (timeout_ms < 0) {
+      timeout_ms = 0;
+    }
+    //const int thirty_seconds = 30 * 1000;
+    //if (timeout_ms > thirty_seconds) {
+    //timeout_ms = thirty_seconds;
+    //}
+  }
+#if TD_PORT_POSIX
+  poll.run(timeout_ms);
+#elif TD_PORT_WINDOWS
+  queue_.reader_get_event_fd().wait(timeout_ms);
+#endif
+  return true;
+}
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/IoWorker.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/IoWorker.h
new file mode 100644
index 0000000000..c4a30b983a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/IoWorker.h
@@ -0,0 +1,43 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/core/SchedulerContext.h"
+#include "td/actor/core/SchedulerMessage.h"
+#include "td/utils/MpscPollableQueue.h"
+
+namespace td {
+namespace actor {
+namespace core {
+class IoWorker {
+ public:
+  explicit IoWorker(MpscPollableQueue<SchedulerMessage> &queue) : queue_(queue) {
+  }
+
+  void start_up();
+  void tear_down();
+
+  bool run_once(double timeout);
+
+ private:
+  MpscPollableQueue<SchedulerMessage> &queue_;
+};
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/Scheduler.cpp b/submodules/ton/tonlib-src/tdactor/td/actor/core/Scheduler.cpp
new file mode 100644
index 0000000000..7e343c4dea
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/Scheduler.cpp
@@ -0,0 +1,294 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/actor/core/Scheduler.h"
+
+#include "td/actor/core/CpuWorker.h"
+#include "td/actor/core/IoWorker.h"
+
+namespace td {
+namespace actor {
+namespace core {
+Scheduler::Scheduler(std::shared_ptr<SchedulerGroupInfo> scheduler_group_info, SchedulerId id, size_t cpu_threads_count)
+    : scheduler_group_info_(std::move(scheduler_group_info)), cpu_threads_(cpu_threads_count) {
+  scheduler_group_info_->active_scheduler_count++;
+  info_ = &scheduler_group_info_->schedulers.at(id.value());
+  info_->id = id;
+  if (cpu_threads_count != 0) {
+    info_->cpu_threads_count = cpu_threads_count;
+    info_->cpu_queue = std::make_unique<MpmcQueue<SchedulerMessage>>(1024, max_thread_count());
+    info_->cpu_queue_waiter = std::make_unique<MpmcWaiter>();
+  }
+  info_->io_queue = std::make_unique<MpscPollableQueue<SchedulerMessage>>();
+  info_->io_queue->init();
+
+  info_->cpu_workers.resize(cpu_threads_count);
+  for (auto &worker : info_->cpu_workers) {
+    worker = std::make_unique<WorkerInfo>(WorkerInfo::Type::Cpu, true);
+  }
+  info_->io_worker = std::make_unique<WorkerInfo>(WorkerInfo::Type::Io, !info_->cpu_workers.empty());
+
+  poll_.init();
+  io_worker_ = std::make_unique<IoWorker>(*info_->io_queue);
+
+#if TD_PORT_WINDOWS
+  if (info_->id.value() == 0) {
+    scheduler_group_info_->iocp.init();
+  }
+#endif
+}
+
+Scheduler::~Scheduler() {
+  // should stop
+  stop();
+  do_stop();
+}
+
+void Scheduler::start() {
+  for (size_t i = 0; i < cpu_threads_.size(); i++) {
+    cpu_threads_[i] = td::thread([this, i] {
+      this->run_in_context_impl(*this->info_->cpu_workers[i],
+                                [this] { CpuWorker(*info_->cpu_queue, *info_->cpu_queue_waiter).run(); });
+    });
+    cpu_threads_[i].set_name(PSLICE() << "#" << info_->id.value() << ":cpu#" << i);
+  }
+#if TD_PORT_WINDOWS
+  // FIXME: use scheduler_id
+  if (info_->id.value() == 0) {
+    scheduler_group_info_->iocp_thread = td::thread([this] {
+      WorkerInfo info;
+      info.type = WorkerInfo::Type::Cpu;
+      this->run_in_context_impl(info, [this] { scheduler_group_info_->iocp.loop(); });
+    });
+  }
+#endif
+  this->run_in_context([this] { this->io_worker_->start_up(); });
+}
+
+bool Scheduler::run(double timeout) {
+  bool res;
+  run_in_context_impl(*info_->io_worker, [this, timeout, &res] {
+    if (SchedulerContext::get()->is_stop_requested()) {
+      res = false;
+    } else {
+      res = io_worker_->run_once(timeout);
+    }
+    if (!res) {
+      if (!is_stopped_) {
+        io_worker_->tear_down();
+      }
+    }
+  });
+  if (!res) {
+    do_stop();
+  }
+  return res;
+}
+
+void Scheduler::do_stop() {
+  if (is_stopped_) {
+    return;
+  }
+  // wait other threads to finish
+  for (auto &thread : cpu_threads_) {
+    thread.join();
+  }
+  // Can't do anything else, other schedulers may send queries to this one.
+  // Must wait till every scheduler is stopped first..
+  is_stopped_ = true;
+
+  io_worker_.reset();
+  poll_.clear();
+  heap_.for_each([](auto &key, auto &node) { ActorInfo::from_heap_node(node)->unpin(); });
+
+  std::unique_lock<std::mutex> lock(scheduler_group_info_->active_scheduler_count_mutex);
+  scheduler_group_info_->active_scheduler_count--;
+  scheduler_group_info_->active_scheduler_count_condition_variable.notify_all();
+}
+
+Scheduler::ContextImpl::ContextImpl(ActorInfoCreator *creator, SchedulerId scheduler_id,
+                                    SchedulerGroupInfo *scheduler_group, Poll *poll, KHeap<double> *heap)
+    : creator_(creator), scheduler_id_(scheduler_id), scheduler_group_(scheduler_group), poll_(poll), heap_(heap) {
+}
+
+SchedulerId Scheduler::ContextImpl::get_scheduler_id() const {
+  return scheduler_id_;
+}
+void Scheduler::ContextImpl::add_to_queue(ActorInfoPtr actor_info_ptr, SchedulerId scheduler_id, bool need_poll) {
+  if (!scheduler_id.is_valid()) {
+    scheduler_id = get_scheduler_id();
+  }
+  auto &info = scheduler_group()->schedulers.at(scheduler_id.value());
+  if (need_poll || !info.cpu_queue) {
+    info.io_queue->writer_put(std::move(actor_info_ptr));
+  } else {
+    info.cpu_queue->push(std::move(actor_info_ptr), get_thread_id());
+    info.cpu_queue_waiter->notify();
+  }
+}
+
+ActorInfoCreator &Scheduler::ContextImpl::get_actor_info_creator() {
+  return *creator_;
+}
+
+bool Scheduler::ContextImpl::has_poll() {
+  return poll_ != nullptr;
+}
+Poll &Scheduler::ContextImpl::get_poll() {
+  CHECK(has_poll());
+  return *poll_;
+}
+
+bool Scheduler::ContextImpl::has_heap() {
+  return heap_ != nullptr;
+}
+KHeap<double> &Scheduler::ContextImpl::get_heap() {
+  CHECK(has_heap());
+  return *heap_;
+}
+
+void Scheduler::ContextImpl::set_alarm_timestamp(const ActorInfoPtr &actor_info_ptr) {
+  // Ideas for optimization
+  // 1. Several cpu actors with separate heaps. They ask io worker to update timeout only when it has been changed
+  // 2. Update timeout only when it has increased
+  // 3. Use signal-like logic to combile multiple timeout updates into one
+  if (!has_heap()) {
+    add_to_queue(actor_info_ptr, {}, true);
+    return;
+  }
+  // we are in PollWorker
+  CHECK(has_heap());
+  auto &heap = get_heap();
+  auto *heap_node = actor_info_ptr->as_heap_node();
+  auto timestamp = actor_info_ptr->get_alarm_timestamp();
+  if (timestamp) {
+    if (heap_node->in_heap()) {
+      heap.fix(timestamp.at(), heap_node);
+    } else {
+      actor_info_ptr->pin(actor_info_ptr);
+      heap.insert(timestamp.at(), heap_node);
+    }
+  } else {
+    if (heap_node->in_heap()) {
+      actor_info_ptr->unpin();
+      heap.erase(heap_node);
+    }
+  }
+}
+
+bool Scheduler::ContextImpl::is_stop_requested() {
+  return scheduler_group()->is_stop_requested;
+}
+
+void Scheduler::ContextImpl::stop() {
+  bool expect_false = false;
+  // Trying to set close_flag_ to true with CAS
+  auto &group = *scheduler_group();
+  if (!group.is_stop_requested.compare_exchange_strong(expect_false, true)) {
+    return;
+  }
+
+  // Notify all workers of all schedulers
+  for (auto &scheduler_info : group.schedulers) {
+    scheduler_info.io_queue->writer_put({});
+    for (size_t i = 0; i < scheduler_info.cpu_threads_count; i++) {
+      scheduler_info.cpu_queue->push({}, get_thread_id());
+      scheduler_info.cpu_queue_waiter->notify();
+    }
+  }
+}
+void Scheduler::close_scheduler_group(SchedulerGroupInfo &group_info) {
+  //LOG(DEBUG) << "close scheduler group";
+  // Cannot close scheduler group before somebody asked to stop them
+  CHECK(group_info.is_stop_requested);
+  {
+    std::unique_lock<std::mutex> lock(group_info.active_scheduler_count_mutex);
+    group_info.active_scheduler_count_condition_variable.wait(lock,
+                                                              [&] { return group_info.active_scheduler_count == 0; });
+  }
+
+  //FIXME
+  //ContextImpl context(&group_info.schedulers[0].io_worker->actor_info_creator, SchedulerId{0}, &group_info, nullptr,
+  //                    nullptr);
+  //SchedulerContext::Guard guard(&context);
+
+#if TD_PORT_WINDOWS
+  detail::Iocp::Guard iocp_guard(&group_info.iocp);
+  group_info.iocp.interrupt_loop();
+  group_info.iocp_thread.join();
+#endif
+
+  // Drain all queues
+  int it = 0;
+  for (bool queues_are_empty = false; !queues_are_empty;) {
+    queues_are_empty = true;
+    for (auto &scheduler_info : group_info.schedulers) {
+      // Drain io queue
+      auto &io_queue = *scheduler_info.io_queue;
+      while (true) {
+        int n = io_queue.reader_wait_nonblock();
+        if (n == 0) {
+          break;
+        }
+        while (n-- > 0) {
+          auto message = io_queue.reader_get_unsafe();
+          // message's destructor is called
+          queues_are_empty = false;
+        }
+      }
+
+      // Drain cpu queue
+      if (scheduler_info.cpu_queue) {
+        auto &cpu_queue = *scheduler_info.cpu_queue;
+        while (true) {
+          SchedulerMessage message;
+          if (!cpu_queue.try_pop(message, get_thread_id())) {
+            break;
+          }
+          // message's destructor is called
+          queues_are_empty = false;
+        }
+      }
+    }
+    if (++it > 100) {
+      LOG(FATAL) << "Failed to drain all queues";
+    }
+  }
+  LOG_IF(ERROR, it > 2) << "It took more than one iteration to drain queues";
+
+  // Just to destroy all elements should be ok.
+  for (auto &scheduler_info : group_info.schedulers) {
+    scheduler_info.io_queue.reset();
+    scheduler_info.cpu_queue.reset();
+
+    // Do not destroy worker infos. run_in_context will crash if they are empty
+    scheduler_info.io_worker->actor_info_creator.clear();
+    for (auto &worker : scheduler_info.cpu_workers) {
+      worker->actor_info_creator.clear();
+    }
+  }
+  //for (auto &scheduler : group_info.schedulers) {
+  //scheduler.io_worker->actor_info_creator.ensure_empty();
+  //for (auto &worker : scheduler.cpu_workers) {
+  //worker->actor_info_creator.ensure_empty();
+  //}
+  //}
+}
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/Scheduler.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/Scheduler.h
new file mode 100644
index 0000000000..4ebfc91245
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/Scheduler.h
@@ -0,0 +1,223 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/core/ActorExecuteContext.h"
+#include "td/actor/core/ActorExecutor.h"
+#include "td/actor/core/Actor.h"
+#include "td/actor/core/ActorInfo.h"
+#include "td/actor/core/ActorInfoCreator.h"
+#include "td/actor/core/ActorLocker.h"
+#include "td/actor/core/ActorMailbox.h"
+#include "td/actor/core/ActorMessage.h"
+#include "td/actor/core/Context.h"
+#include "td/actor/core/SchedulerContext.h"
+#include "td/actor/core/SchedulerId.h"
+#include "td/actor/core/SchedulerMessage.h"
+
+#include "td/utils/Closure.h"
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+#include "td/utils/Heap.h"
+#include "td/utils/List.h"
+#include "td/utils/logging.h"
+#include "td/utils/MpmcQueue.h"
+#include "td/utils/MpmcWaiter.h"
+#include "td/utils/MpscLinkQueue.h"
+#include "td/utils/MpscPollableQueue.h"
+#include "td/utils/port/Poll.h"
+#include "td/utils/port/detail/Iocp.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/port/thread_local.h"
+#include "td/utils/ScopeGuard.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Time.h"
+#include "td/utils/type_traits.h"
+
+#include <atomic>
+#include <condition_variable>
+#include <limits>
+#include <memory>
+#include <mutex>
+#include <type_traits>
+#include <utility>
+
+namespace td {
+namespace actor {
+namespace core {
+class IoWorker;
+
+struct WorkerInfo {
+  enum class Type { Io, Cpu } type{Type::Io};
+  WorkerInfo() = default;
+  explicit WorkerInfo(Type type, bool allow_shared) : type(type), actor_info_creator(allow_shared) {
+  }
+  ActorInfoCreator actor_info_creator;
+};
+
+struct SchedulerInfo {
+  SchedulerId id;
+  // will be read by all workers is any thread
+  std::unique_ptr<MpmcQueue<SchedulerMessage>> cpu_queue;
+  std::unique_ptr<MpmcWaiter> cpu_queue_waiter;
+  // only scheduler itself may read from io_queue_
+  std::unique_ptr<MpscPollableQueue<SchedulerMessage>> io_queue;
+  size_t cpu_threads_count{0};
+
+  std::unique_ptr<WorkerInfo> io_worker;
+  std::vector<std::unique_ptr<WorkerInfo>> cpu_workers;
+};
+
+struct SchedulerGroupInfo {
+  explicit SchedulerGroupInfo(size_t n) : schedulers(n) {
+  }
+  std::atomic<bool> is_stop_requested{false};
+
+  int active_scheduler_count{0};
+  std::mutex active_scheduler_count_mutex;
+  std::condition_variable active_scheduler_count_condition_variable;
+
+#if TD_PORT_WINDOWS
+  td::detail::Iocp iocp;
+  td::thread iocp_thread;
+#endif
+  std::vector<SchedulerInfo> schedulers;
+};
+
+class Scheduler {
+ public:
+  static constexpr int32 max_thread_count() {
+    return 256;
+  }
+
+  static int32 get_thread_id() {
+    auto thread_id = ::td::get_thread_id();
+    CHECK(thread_id < max_thread_count());
+    return thread_id;
+  }
+
+  Scheduler(std::shared_ptr<SchedulerGroupInfo> scheduler_group_info, SchedulerId id, size_t cpu_threads_count);
+
+  Scheduler(const Scheduler &) = delete;
+  Scheduler &operator=(const Scheduler &) = delete;
+  Scheduler(Scheduler &&other) = delete;
+  Scheduler &operator=(Scheduler &&other) = delete;
+  ~Scheduler();
+
+  void start();
+
+  template <class F>
+  void run_in_context(F &&f) {
+    run_in_context_impl(*info_->io_worker, std::forward<F>(f));
+  }
+
+  template <class F>
+  void run_in_context_external(F &&f) {
+    WorkerInfo info;
+    info.type = WorkerInfo::Type::Cpu;
+    run_in_context_impl(*info_->io_worker, std::forward<F>(f));
+  }
+
+  bool run(double timeout);
+
+  // Just syntactic sugar
+  void stop() {
+    run_in_context([] { SchedulerContext::get()->stop(); });
+  }
+
+  SchedulerId get_scheduler_id() const {
+    return info_->id;
+  }
+
+ private:
+  std::shared_ptr<SchedulerGroupInfo> scheduler_group_info_;
+  SchedulerInfo *info_;
+  std::vector<td::thread> cpu_threads_;
+  bool is_stopped_{false};
+  Poll poll_;
+  KHeap<double> heap_;
+  std::unique_ptr<IoWorker> io_worker_;
+
+  class ContextImpl : public SchedulerContext {
+   public:
+    ContextImpl(ActorInfoCreator *creator, SchedulerId scheduler_id, SchedulerGroupInfo *scheduler_group, Poll *poll,
+                KHeap<double> *heap);
+
+    SchedulerId get_scheduler_id() const override;
+    void add_to_queue(ActorInfoPtr actor_info_ptr, SchedulerId scheduler_id, bool need_poll) override;
+    ActorInfoCreator &get_actor_info_creator() override;
+
+    bool has_poll() override;
+    Poll &get_poll() override;
+
+    bool has_heap() override;
+    KHeap<double> &get_heap() override;
+
+    void set_alarm_timestamp(const ActorInfoPtr &actor_info_ptr) override;
+
+    bool is_stop_requested() override;
+    void stop() override;
+
+   private:
+    SchedulerGroupInfo *scheduler_group() const {
+      return scheduler_group_;
+    }
+
+    ActorInfoCreator *creator_;
+    SchedulerId scheduler_id_;
+    SchedulerGroupInfo *scheduler_group_;
+    Poll *poll_;
+
+    KHeap<double> *heap_;
+  };
+
+  template <class F>
+  void run_in_context_impl(WorkerInfo &worker_info, F &&f) {
+#if TD_PORT_WINDOWS
+    td::detail::Iocp::Guard iocp_guard(&scheduler_group_info_->iocp);
+#endif
+    bool is_io_worker = worker_info.type == WorkerInfo::Type::Io;
+    ContextImpl context(&worker_info.actor_info_creator, info_->id, scheduler_group_info_.get(),
+                        is_io_worker ? &poll_ : nullptr, is_io_worker ? &heap_ : nullptr);
+    SchedulerContext::Guard guard(&context);
+    f();
+  }
+
+  void do_stop();
+
+ public:
+  static void close_scheduler_group(SchedulerGroupInfo &group_info);
+};
+
+// Actor messages
+class ActorMessageHangup : public core::ActorMessageImpl {
+ public:
+  void run() override {
+    ActorExecuteContext::get()->actor().hangup();
+  }
+};
+class ActorMessageHangupShared : public core::ActorMessageImpl {
+ public:
+  void run() override {
+    ActorExecuteContext::get()->actor().hangup_shared();
+  }
+};
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/SchedulerContext.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/SchedulerContext.h
new file mode 100644
index 0000000000..6f99e109d3
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/SchedulerContext.h
@@ -0,0 +1,61 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/actor/core/Context.h"
+#include "td/actor/core/SchedulerId.h"
+#include "td/actor/core/ActorInfo.h"
+#include "td/actor/core/ActorInfoCreator.h"
+
+#include "td/utils/port/Poll.h"
+#include "td/utils/Heap.h"
+
+namespace td {
+namespace actor {
+namespace core {
+class SchedulerDispatcher {
+ public:
+  virtual ~SchedulerDispatcher() = default;
+
+  virtual SchedulerId get_scheduler_id() const = 0;
+  virtual void add_to_queue(ActorInfoPtr actor_info_ptr, SchedulerId scheduler_id, bool need_poll) = 0;
+  virtual void set_alarm_timestamp(const ActorInfoPtr &actor_info_ptr) = 0;
+};
+
+class SchedulerContext : public Context<SchedulerContext>, public SchedulerDispatcher {
+ public:
+  virtual ~SchedulerContext() = default;
+
+  // ActorCreator Interface
+  virtual ActorInfoCreator &get_actor_info_creator() = 0;
+
+  // Poll interface
+  virtual bool has_poll() = 0;
+  virtual Poll &get_poll() = 0;
+
+  // Timeout interface
+  virtual bool has_heap() = 0;
+  virtual KHeap<double> &get_heap() = 0;
+
+  // Stop all schedulers
+  virtual bool is_stop_requested() = 0;
+  virtual void stop() = 0;
+};
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/SchedulerId.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/SchedulerId.h
new file mode 100644
index 0000000000..124e409276
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/SchedulerId.h
@@ -0,0 +1,49 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+
+namespace td {
+namespace actor {
+namespace core {
+class SchedulerId {
+ public:
+  SchedulerId() : id_(-1) {
+  }
+  explicit SchedulerId(uint8 id) : id_(id) {
+  }
+  bool is_valid() const {
+    return id_ >= 0;
+  }
+  uint8 value() const {
+    CHECK(is_valid());
+    return static_cast<uint8>(id_);
+  }
+  bool operator==(SchedulerId scheduler_id) const {
+    return id_ == scheduler_id.id_;
+  }
+
+ private:
+  int32 id_{0};
+};
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/td/actor/core/SchedulerMessage.h b/submodules/ton/tonlib-src/tdactor/td/actor/core/SchedulerMessage.h
new file mode 100644
index 0000000000..75c339aef2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/td/actor/core/SchedulerMessage.h
@@ -0,0 +1,29 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/core/ActorInfo.h"
+
+namespace td {
+namespace actor {
+namespace core {
+using SchedulerMessage = ActorInfoPtr;
+}  // namespace core
+}  // namespace actor
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdactor/test/actors_core.cpp b/submodules/ton/tonlib-src/tdactor/test/actors_core.cpp
new file mode 100644
index 0000000000..d426f344b5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/test/actors_core.cpp
@@ -0,0 +1,1099 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/actor/core/ActorLocker.h"
+#include "td/actor/actor.h"
+#include "td/actor/PromiseFuture.h"
+
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/Random.h"
+#include "td/utils/Slice.h"
+#include "td/utils/StringBuilder.h"
+#include "td/utils/tests.h"
+#include "td/utils/Time.h"
+
+#include <array>
+#include <atomic>
+#include <deque>
+#include <memory>
+
+TEST(Actor2, signals) {
+  using td::actor::core::ActorSignals;
+  ActorSignals signals;
+  signals.add_signal(ActorSignals::Wakeup);
+  signals.add_signal(ActorSignals::Cpu);
+  signals.add_signal(ActorSignals::Kill);
+  signals.clear_signal(ActorSignals::Cpu);
+
+  bool was_kill = false;
+  bool was_wakeup = false;
+  while (!signals.empty()) {
+    auto s = signals.first_signal();
+    if (s == ActorSignals::Kill) {
+      was_kill = true;
+    } else if (s == ActorSignals::Wakeup) {
+      was_wakeup = true;
+    } else {
+      UNREACHABLE();
+    }
+    signals.clear_signal(s);
+  }
+  CHECK(was_kill && was_wakeup);
+}
+
+TEST(Actors2, flags) {
+  using namespace td::actor::core;
+  ActorState::Flags flags;
+  CHECK(!flags.is_locked());
+  flags.set_locked(true);
+  CHECK(flags.is_locked());
+  flags.set_locked(false);
+  CHECK(!flags.is_locked());
+
+  flags.set_scheduler_id(SchedulerId{123});
+
+  auto signals = flags.get_signals();
+  CHECK(signals.empty());
+  signals.add_signal(ActorSignals::Cpu);
+  signals.add_signal(ActorSignals::Kill);
+  CHECK(signals.has_signal(ActorSignals::Cpu));
+  CHECK(signals.has_signal(ActorSignals::Kill));
+  flags.set_signals(signals);
+  LOG_CHECK(flags.get_signals().raw() == signals.raw()) << flags.get_signals().raw() << " " << signals.raw();
+
+  auto wakeup = ActorSignals{};
+  wakeup.add_signal(ActorSignals::Wakeup);
+
+  flags.add_signals(wakeup);
+  signals.add_signal(ActorSignals::Wakeup);
+  CHECK(flags.get_signals().raw() == signals.raw());
+
+  flags.clear_signals();
+  CHECK(flags.get_signals().empty());
+
+  flags.add_signals(ActorSignals::one(ActorSignals::Pause));
+  CHECK(flags.get_scheduler_id().value() == 123);
+  CHECK(flags.get_signals().has_signal(ActorSignals::Pause));
+}
+
+TEST(Actor2, locker) {
+  using namespace td::actor::core;
+  ActorState state;
+
+  ActorSignals kill_signal;
+  kill_signal.add_signal(ActorSignals::Kill);
+
+  ActorSignals wakeup_signal;
+  kill_signal.add_signal(ActorSignals::Wakeup);
+
+  ActorSignals cpu_signal;
+  kill_signal.add_signal(ActorSignals::Cpu);
+
+  {
+    ActorLocker lockerA(&state);
+    ActorLocker lockerB(&state);
+    ActorLocker lockerC(&state);
+
+    CHECK(lockerA.try_lock());
+    CHECK(lockerA.own_lock());
+    auto flagsA = lockerA.flags();
+    CHECK(lockerA.try_unlock(flagsA));
+    CHECK(!lockerA.own_lock());
+
+    CHECK(lockerA.try_lock());
+    CHECK(!lockerB.try_lock());
+    CHECK(!lockerC.try_lock());
+
+    CHECK(lockerB.try_add_signals(kill_signal));
+    CHECK(!lockerC.try_add_signals(wakeup_signal));
+    CHECK(lockerC.try_add_signals(wakeup_signal));
+    CHECK(!lockerC.add_signals(cpu_signal));
+    CHECK(!lockerA.flags().has_signals());
+    CHECK(!lockerA.try_unlock(lockerA.flags()));
+    {
+      auto flags = lockerA.flags();
+      auto signals = flags.get_signals();
+      bool was_kill = false;
+      bool was_wakeup = false;
+      bool was_cpu = false;
+      while (!signals.empty()) {
+        auto s = signals.first_signal();
+        if (s == ActorSignals::Kill) {
+          was_kill = true;
+        } else if (s == ActorSignals::Wakeup) {
+          was_wakeup = true;
+        } else if (s == ActorSignals::Cpu) {
+          was_cpu = true;
+        } else {
+          UNREACHABLE();
+        }
+        signals.clear_signal(s);
+      }
+      CHECK(was_kill && was_wakeup && was_cpu);
+      flags.clear_signals();
+      CHECK(lockerA.try_unlock(flags));
+    }
+  }
+
+  {
+    ActorLocker lockerB(&state);
+    CHECK(lockerB.try_lock());
+    CHECK(lockerB.try_unlock(lockerB.flags()));
+    CHECK(lockerB.add_signals(kill_signal));
+    CHECK(lockerB.flags().get_signals().has_signal(ActorSignals::Kill));
+    auto flags = lockerB.flags();
+    flags.clear_signals();
+    ActorLocker lockerA(&state);
+    CHECK(!lockerA.add_signals(kill_signal));
+    CHECK(!lockerB.try_unlock(flags));
+    CHECK(!lockerA.add_signals(kill_signal));  // do not loose this signal!
+    CHECK(!lockerB.try_unlock(flags));
+    CHECK(lockerB.flags().get_signals().has_signal(ActorSignals::Kill));
+    CHECK(lockerB.try_unlock(flags));
+  }
+
+  {
+    ActorLocker lockerA(&state);
+    CHECK(lockerA.try_lock());
+    auto flags = lockerA.flags();
+    flags.add_signals(ActorSignals::one(ActorSignals::Pause));
+    CHECK(lockerA.try_unlock(flags));
+    //We have to lock, though we can't execute.
+    CHECK(lockerA.add_signals(wakeup_signal));
+  }
+}
+
+#if !TD_THREAD_UNSUPPORTED
+TEST(Actor2, locker_stress) {
+  using namespace td::actor::core;
+  ActorState state;
+
+  constexpr size_t threads_n = 5;
+  auto stage = [&](std::atomic<int> &value, int need) {
+    value.fetch_add(1, std::memory_order_release);
+    while (value.load(std::memory_order_acquire) < need) {
+      td::this_thread::yield();
+    }
+  };
+
+  struct Node {
+    std::atomic<td::uint32> request{0};
+    td::uint32 response = 0;
+    char pad[64];
+  };
+  std::array<Node, threads_n> nodes;
+  auto do_work = [&]() {
+    for (auto &node : nodes) {
+      auto query = node.request.load(std::memory_order_acquire);
+      if (query) {
+        node.response = query * query;
+        node.request.store(0, std::memory_order_relaxed);
+      }
+    }
+  };
+
+  std::atomic<int> begin{0};
+  std::atomic<int> ready{0};
+  std::atomic<int> check{0};
+  std::vector<td::thread> threads;
+  for (size_t i = 0; i < threads_n; i++) {
+    threads.push_back(td::thread([&, id = i] {
+      for (size_t i = 1; i < 1000000; i++) {
+        ActorLocker locker(&state);
+        auto need = static_cast<int>(threads_n * i);
+        auto query = static_cast<td::uint32>(id + need);
+        stage(begin, need);
+        nodes[id].request = 0;
+        nodes[id].response = 0;
+        stage(ready, need);
+        if (locker.try_lock()) {
+          nodes[id].response = query * query;
+        } else {
+          auto cpu = ActorSignals::one(ActorSignals::Cpu);
+          nodes[id].request.store(query, std::memory_order_release);
+          locker.add_signals(cpu);
+        }
+        while (locker.own_lock()) {
+          auto flags = locker.flags();
+          auto signals = flags.get_signals();
+          if (!signals.empty()) {
+            do_work();
+          }
+          flags.clear_signals();
+          locker.try_unlock(flags);
+        }
+
+        stage(check, need);
+        if (id == 0) {
+          CHECK(locker.add_signals(ActorSignals{}));
+          CHECK(!locker.flags().has_signals());
+          CHECK(locker.try_unlock(locker.flags()));
+          for (size_t thread_id = 0; thread_id < threads_n; thread_id++) {
+            LOG_CHECK(nodes[thread_id].response ==
+                      static_cast<td::uint32>(thread_id + need) * static_cast<td::uint32>(thread_id + need))
+                << td::tag("thread", thread_id) << " " << nodes[thread_id].response << " "
+                << nodes[thread_id].request.load();
+          }
+        }
+      }
+    }));
+  }
+  for (auto &thread : threads) {
+    thread.join();
+  }
+}
+
+namespace {
+const size_t BUF_SIZE = 1024 * 1024;
+char buf[BUF_SIZE];
+td::StringBuilder sb(td::MutableSlice(buf, BUF_SIZE - 1));
+}  // namespace
+
+TEST(Actor2, executor_simple) {
+  using namespace td::actor::core;
+  using namespace td::actor;
+  using td::actor::detail::ActorMessageCreator;
+  struct Dispatcher : public SchedulerDispatcher {
+    void add_to_queue(ActorInfoPtr ptr, SchedulerId scheduler_id, bool need_poll) override {
+      queue.push_back(std::move(ptr));
+    }
+    void set_alarm_timestamp(const ActorInfoPtr &actor_info_ptr) override {
+      UNREACHABLE();
+    }
+    SchedulerId get_scheduler_id() const override {
+      return SchedulerId{0};
+    }
+    std::deque<ActorInfoPtr> queue;
+  };
+  Dispatcher dispatcher;
+
+  class TestActor : public Actor {
+   public:
+    void close() {
+      stop();
+    }
+
+   private:
+    void start_up() override {
+      sb << "StartUp";
+    }
+    void tear_down() override {
+      sb << "TearDown";
+    }
+  };
+  {
+    ActorInfoCreator actor_info_creator;
+    auto actor = actor_info_creator.create(
+        std::make_unique<TestActor>(), ActorInfoCreator::Options().on_scheduler(SchedulerId{0}).with_name("TestActor"));
+    dispatcher.add_to_queue(actor, SchedulerId{0}, false);
+
+    {
+      ActorExecutor executor(*actor, dispatcher, ActorExecutor::Options());
+      CHECK(!executor.is_closed());
+      CHECK(executor.can_send_immediate());
+      LOG_CHECK(sb.as_cslice() == "StartUp") << sb.as_cslice();
+      sb.clear();
+      executor.send(ActorMessageCreator::lambda([&] { sb << "A"; }));
+      LOG_CHECK(sb.as_cslice() == "A") << sb.as_cslice();
+      sb.clear();
+      auto big_message = ActorMessageCreator::lambda([&] { sb << "big"; });
+      big_message.set_big();
+      executor.send(std::move(big_message));
+      LOG_CHECK(sb.as_cslice() == "") << sb.as_cslice();
+      executor.send(ActorMessageCreator::lambda([&] { sb << "B"; }));
+      LOG_CHECK(sb.as_cslice() == "") << sb.as_cslice();
+    }
+    CHECK(dispatcher.queue.size() == 1);
+    { ActorExecutor executor(*actor, dispatcher, ActorExecutor::Options().with_from_queue()); }
+    CHECK(dispatcher.queue.size() == 1);
+    dispatcher.queue.clear();
+    LOG_CHECK(sb.as_cslice() == "bigB") << sb.as_cslice();
+    sb.clear();
+    {
+      ActorExecutor executor(*actor, dispatcher, ActorExecutor::Options());
+      executor.send(
+          ActorMessageCreator::lambda([&] { static_cast<TestActor &>(ActorExecuteContext::get()->actor()).close(); }));
+    }
+    LOG_CHECK(sb.as_cslice() == "TearDown") << sb.as_cslice();
+    sb.clear();
+    CHECK(!actor->has_actor());
+    {
+      ActorExecutor executor(*actor, dispatcher, ActorExecutor::Options());
+      executor.send(
+          ActorMessageCreator::lambda([&] { static_cast<TestActor &>(ActorExecuteContext::get()->actor()).close(); }));
+    }
+    CHECK(dispatcher.queue.empty());
+    CHECK(sb.as_cslice() == "");
+  }
+
+  {
+    ActorInfoCreator actor_info_creator;
+    auto actor = actor_info_creator.create(
+        std::make_unique<TestActor>(), ActorInfoCreator::Options().on_scheduler(SchedulerId{0}).with_name("TestActor"));
+    dispatcher.add_to_queue(actor, SchedulerId{0}, false);
+    {
+      ActorExecutor executor(*actor, dispatcher, ActorExecutor::Options());
+      CHECK(!executor.is_closed());
+      CHECK(executor.can_send_immediate());
+      LOG_CHECK(sb.as_cslice() == "StartUp") << sb.as_cslice();
+      sb.clear();
+      auto a_msg = ActorMessageCreator::lambda([&] {
+        sb << "big pause";
+        ActorExecuteContext::get()->set_pause();
+      });
+      a_msg.set_big();
+      executor.send(std::move(a_msg));
+      executor.send(ActorMessageCreator::lambda([&] { sb << "A"; }));
+      LOG_CHECK(sb.as_cslice() == "") << sb.as_cslice();
+    }
+    {
+      CHECK(dispatcher.queue.size() == 1);
+      dispatcher.queue.clear();
+      ActorExecutor executor(*actor, dispatcher, ActorExecutor::Options().with_from_queue());
+      CHECK(!executor.is_closed());
+      CHECK(!executor.can_send_immediate());
+      LOG_CHECK(sb.as_cslice() == "big pause") << sb.as_cslice();
+      sb.clear();
+    }
+    {
+      CHECK(dispatcher.queue.size() == 1);
+      dispatcher.queue.clear();
+      ActorExecutor executor(*actor, dispatcher, ActorExecutor::Options().with_from_queue());
+      CHECK(!executor.is_closed());
+      CHECK(executor.can_send_immediate());
+      LOG_CHECK(sb.as_cslice() == "A") << sb.as_cslice();
+      sb.clear();
+    }
+    {
+      ActorExecutor executor(*actor, dispatcher, ActorExecutor::Options());
+      executor.send(
+          ActorMessageCreator::lambda([&] { static_cast<TestActor &>(ActorExecuteContext::get()->actor()).close(); }));
+    }
+    LOG_CHECK(sb.as_cslice() == "TearDown") << sb.as_cslice();
+    sb.clear();
+    dispatcher.queue.clear();
+  }
+}
+
+using namespace td::actor;
+using td::uint32;
+static std::atomic<int> global_cnt;
+class Worker : public Actor {
+ public:
+  void query(uint32 x, core::ActorInfoPtr master);
+  void close() {
+    stop();
+  }
+};
+class Master : public Actor {
+ public:
+  void on_result(uint32 x, uint32 y) {
+    loop();
+  }
+
+ private:
+  uint32 l = 0;
+  uint32 r = 100000;
+  core::ActorInfoPtr worker;
+  void start_up() override {
+    worker = detail::create_actor<Worker>(ActorOptions().with_name("Master"));
+    loop();
+  }
+  void loop() override {
+    l++;
+    if (l == r) {
+      if (!--global_cnt) {
+        SchedulerContext::get()->stop();
+      }
+      detail::send_closure(*worker, &Worker::close);
+      stop();
+      return;
+    }
+    detail::send_lambda(*worker,
+                        [x = l, self = get_actor_info_ptr()] { detail::current_actor<Worker>().query(x, self); });
+  }
+};
+
+void Worker::query(uint32 x, core::ActorInfoPtr master) {
+  auto y = x;
+  for (int i = 0; i < 100; i++) {
+    y = y * y;
+  }
+  detail::send_lambda(*master, [result = y, x] { detail::current_actor<Master>().on_result(x, result); });
+}
+
+TEST(Actor2, scheduler_simple) {
+  auto group_info = std::make_shared<core::SchedulerGroupInfo>(1);
+  core::Scheduler scheduler{group_info, SchedulerId{0}, 2};
+  scheduler.start();
+  scheduler.run_in_context([] {
+    global_cnt = 10;
+    for (int i = 0; i < 10; i++) {
+      detail::create_actor<Master>(ActorOptions().with_name("Master"));
+    }
+  });
+  while (scheduler.run(1000)) {
+  }
+  core::Scheduler::close_scheduler_group(*group_info);
+}
+
+TEST(Actor2, actor_id_simple) {
+  auto group_info = std::make_shared<core::SchedulerGroupInfo>(1);
+  core::Scheduler scheduler{group_info, SchedulerId{0}, 2};
+  sb.clear();
+  scheduler.start();
+
+  scheduler.run_in_context([] {
+    class A : public Actor {
+     public:
+      A(int value) : value_(value) {
+        sb << "A" << value_;
+      }
+      void hello() {
+        sb << "hello";
+      }
+      ~A() {
+        sb << "~A";
+        if (--global_cnt <= 0) {
+          SchedulerContext::get()->stop();
+        }
+      }
+
+     private:
+      int value_;
+    };
+    global_cnt = 1;
+    auto id = create_actor<A>("A", 123);
+    CHECK(sb.as_cslice() == "A123");
+    sb.clear();
+    send_closure(id, &A::hello);
+  });
+  while (scheduler.run(1000)) {
+  }
+  CHECK(sb.as_cslice() == "hello~A");
+  core::Scheduler::close_scheduler_group(*group_info);
+  sb.clear();
+}
+
+TEST(Actor2, actor_creation) {
+  auto group_info = std::make_shared<core::SchedulerGroupInfo>(1);
+  core::Scheduler scheduler{group_info, SchedulerId{0}, 1};
+  scheduler.start();
+
+  scheduler.run_in_context([] {
+    class B;
+    class A : public Actor {
+     public:
+      void f() {
+        check();
+        stop();
+      }
+
+     private:
+      void start_up() override {
+        check();
+        create_actor<B>("Simple", actor_id(this)).release();
+      }
+
+      void check() {
+        auto &context = *SchedulerContext::get();
+        CHECK(context.has_poll());
+        context.get_poll();
+      }
+
+      void tear_down() override {
+        if (--global_cnt <= 0) {
+          SchedulerContext::get()->stop();
+        }
+      }
+    };
+
+    class B : public Actor {
+     public:
+      B(ActorId<A> a) : a_(a) {
+      }
+
+     private:
+      void start_up() override {
+        auto &context = *SchedulerContext::get();
+        CHECK(!context.has_poll());
+        send_closure(a_, &A::f);
+        stop();
+      }
+      void tear_down() override {
+        if (--global_cnt <= 0) {
+          SchedulerContext::get()->stop();
+        }
+      }
+      ActorId<A> a_;
+    };
+    global_cnt = 2;
+    create_actor<A>(ActorOptions().with_name("Poll").with_poll()).release();
+  });
+  while (scheduler.run(1000)) {
+  }
+  scheduler.stop();
+  core::Scheduler::close_scheduler_group(*group_info);
+}
+
+TEST(Actor2, actor_timeout_simple) {
+  auto group_info = std::make_shared<core::SchedulerGroupInfo>(1);
+  core::Scheduler scheduler{group_info, SchedulerId{0}, 2};
+  sb.clear();
+  scheduler.start();
+
+  auto watcher = td::create_shared_destructor([] { SchedulerContext::get()->stop(); });
+  scheduler.run_in_context([watcher = std::move(watcher)] {
+    class A : public Actor {
+     public:
+      A(std::shared_ptr<td::Destructor> watcher) : watcher_(std::move(watcher)) {
+      }
+      void start_up() override {
+        set_timeout();
+      }
+      void alarm() override {
+        double diff = td::Time::now() - expected_timeout_;
+        LOG_CHECK(-0.001 < diff && diff < 0.1) << diff;
+        if (cnt_-- > 0) {
+          set_timeout();
+        } else {
+          stop();
+        }
+      }
+
+     private:
+      std::shared_ptr<td::Destructor> watcher_;
+      double expected_timeout_;
+      int cnt_ = 5;
+      void set_timeout() {
+        auto wakeup_timestamp = td::Timestamp::in(0.1);
+        expected_timeout_ = wakeup_timestamp.at();
+        alarm_timestamp() = wakeup_timestamp;
+      }
+    };
+    create_actor<A>(core::ActorInfoCreator::Options().with_name("A").with_poll(), watcher).release();
+    create_actor<A>(core::ActorInfoCreator::Options().with_name("B"), watcher).release();
+  });
+  watcher.reset();
+  while (scheduler.run(1000)) {
+  }
+  core::Scheduler::close_scheduler_group(*group_info);
+  sb.clear();
+}
+
+TEST(Actor2, actor_timeout_simple2) {
+  auto group_info = std::make_shared<core::SchedulerGroupInfo>(1);
+  core::Scheduler scheduler{group_info, SchedulerId{0}, 2};
+  sb.clear();
+  scheduler.start();
+
+  auto watcher = td::create_shared_destructor([] { SchedulerContext::get()->stop(); });
+  scheduler.run_in_context([watcher = std::move(watcher)] {
+    class A : public Actor {
+     public:
+      A(std::shared_ptr<td::Destructor> watcher) : watcher_(std::move(watcher)) {
+      }
+      void start_up() override {
+        set_timeout();
+      }
+      void alarm() override {
+        set_timeout();
+      }
+
+     private:
+      std::shared_ptr<td::Destructor> watcher_;
+      void set_timeout() {
+        auto wakeup_timestamp = td::Timestamp::in(0.001);
+        alarm_timestamp() = wakeup_timestamp;
+      }
+    };
+    class B : public Actor {
+     public:
+      B(std::shared_ptr<td::Destructor> watcher, ActorOwn<> actor_own)
+          : watcher_(std::move(watcher)), actor_own_(std::move(actor_own)) {
+      }
+      void start_up() override {
+        set_timeout();
+      }
+      void alarm() override {
+        stop();
+      }
+
+     private:
+      std::shared_ptr<td::Destructor> watcher_;
+      ActorOwn<> actor_own_;
+      void set_timeout() {
+        auto wakeup_timestamp = td::Timestamp::in(0.005);
+        alarm_timestamp() = wakeup_timestamp;
+      }
+    };
+    auto actor_own = create_actor<A>(core::ActorInfoCreator::Options().with_name("A").with_poll(), watcher);
+    create_actor<B>(core::ActorInfoCreator::Options().with_name("B"), watcher, std::move(actor_own)).release();
+  });
+  watcher.reset();
+  while (scheduler.run(1000)) {
+  }
+  core::Scheduler::close_scheduler_group(*group_info);
+  sb.clear();
+}
+
+TEST(Actor2, actor_function_result) {
+  auto group_info = std::make_shared<core::SchedulerGroupInfo>(1);
+  core::Scheduler scheduler{group_info, SchedulerId{0}, 2};
+  sb.clear();
+  scheduler.start();
+
+  auto watcher = td::create_shared_destructor([] { SchedulerContext::get()->stop(); });
+  scheduler.run_in_context([watcher = std::move(watcher)] {
+    class B : public Actor {
+     public:
+      uint32 query(uint32 x) {
+        return x * x;
+      }
+      void query_async(uint32 x, td::Promise<uint32> promise) {
+        promise(x * x);
+      }
+    };
+    class A : public Actor {
+     public:
+      A(std::shared_ptr<td::Destructor> watcher) : watcher_(std::move(watcher)) {
+      }
+      void on_result(uint32 x, uint32 y) {
+        LOG_CHECK(x * x == y) << x << " " << y;
+        if (--cnt_ == 0) {
+          stop();
+        }
+      }
+      void start_up() {
+        b_ = create_actor<B>(ActorOptions().with_name("B"));
+        cnt_ = 3;
+        send_closure(b_, &B::query, 3, [a = std::make_unique<int>(), self = actor_id(this)](td::Result<uint32> y) {
+          LOG_IF(ERROR, y.is_error()) << y.error();
+          send_closure(self, &A::on_result, 3, y.ok());
+        });
+        send_closure(b_, &B::query_async, 2, [self = actor_id(this)](uint32 y) {
+          CHECK(!self.empty());
+          send_closure(self, &A::on_result, 2, y);
+        });
+        send_closure_later(b_, &B::query_async, 5, [self = actor_id(this)](uint32 y) {
+          CHECK(!self.empty());
+          send_closure(self, &A::on_result, 5, y);
+        });
+      }
+
+     private:
+      int cnt_{0};
+      std::shared_ptr<td::Destructor> watcher_;
+      td::actor::ActorOwn<B> b_;
+    };
+    create_actor<A>(core::ActorInfoCreator::Options().with_name("A").with_poll(), watcher).release();
+    create_actor<A>(core::ActorInfoCreator::Options().with_name("B"), watcher).release();
+  });
+  watcher.reset();
+  while (scheduler.run(1000)) {
+  }
+  core::Scheduler::close_scheduler_group(*group_info);
+  sb.clear();
+}
+
+TEST(Actor2, actor_ping_pong) {
+  auto group_info = std::make_shared<core::SchedulerGroupInfo>(1);
+  core::Scheduler scheduler{group_info, SchedulerId{0}, 3};
+  sb.clear();
+  scheduler.start();
+
+  auto watcher = td::create_shared_destructor([] { SchedulerContext::get()->stop(); });
+  for (int i = 0; i < 2000; i++) {
+    scheduler.run_in_context([watcher] {
+      class PingPong : public Actor {
+       public:
+        PingPong(std::shared_ptr<td::Destructor> watcher) : watcher_(std::move(watcher)) {
+        }
+        void query(td::int32 left, ActorOwn<> data) {
+          if (td::Random::fast(0, 4) == 0) {
+            alarm_timestamp() = td::Timestamp::in(0.01 * td::Random::fast(0, 10));
+          }
+          if (left <= 0) {
+            return;
+          }
+          auto dest = td::Random::fast(0, (int)next_.size() - 1);
+          if (td::Random::fast(0, 1) == 0 && 0) {
+            send_closure(next_[dest], &PingPong::query, left - 1, std::move(data));
+          } else {
+            send_closure_later(next_[dest], &PingPong::query, left - 1, std::move(data));
+          }
+        }
+        void add_next(ActorId<PingPong> p) {
+          next_.push_back(std::move(p));
+        }
+        void start_up() override {
+        }
+        void store_data(ActorOwn<> data) {
+          data_.push_back(std::move(data));
+        }
+
+       private:
+        std::vector<ActorId<PingPong>> next_;
+        std::vector<ActorOwn<>> data_;
+        std::shared_ptr<td::Destructor> watcher_;
+      };
+
+      int N = td::Random::fast(2, 10);
+      //N = 2;
+      std::vector<ActorOwn<PingPong>> actors;
+      for (int i = 0; i < N; i++) {
+        actors.push_back(
+            create_actor<PingPong>(core::ActorInfoCreator::Options().with_name(PSLICE() << "Worker#" << i), watcher));
+      }
+      for (int i = 0; i < N; i++) {
+        for (int j = 0; j < N; j++) {
+          send_closure(actors[i], &PingPong::add_next, actors[j].get());
+        }
+      }
+      int nn = td::Random::fast(1, N);
+      //nn = 2;
+      auto first = actors[0].get();
+      for (int i = 0; i < N; i++) {
+        auto to = actors[i].get();
+        if (i < nn) {
+          send_closure(to, &PingPong::query, td::Random::fast(10, 1000), std::move(actors[i]));
+        } else {
+          send_closure(first, &PingPong::store_data, std::move(actors[i]));
+        }
+      }
+    });
+  }
+  watcher.reset();
+  while (scheduler.run(1000)) {
+  }
+  core::Scheduler::close_scheduler_group(*group_info);
+  sb.clear();
+}
+
+TEST(Actor2, Schedulers) {
+  for (auto mode : {Scheduler::Running, Scheduler::Paused}) {
+    for (auto start_count : {0, 1, 2}) {
+      for (auto run_count : {0, 1, 2}) {
+        for (auto stop_count : {0, 1, 2}) {
+          for (size_t threads : {0, 1}) {
+            Scheduler scheduler({threads}, mode);
+            for (int i = 0; i < start_count; i++) {
+              scheduler.start();
+            }
+            for (int i = 0; i < run_count; i++) {
+              scheduler.run(0);
+            }
+            for (int i = 0; i < stop_count; i++) {
+              scheduler.stop();
+            }
+          }
+        }
+      }
+    }
+  }
+}
+TEST(Actor2, SchedulerZeroCpuThreads) {
+  Scheduler scheduler({0});
+  scheduler.run_in_context([] {
+    class A : public Actor {
+      void start_up() override {
+        SchedulerContext::get()->stop();
+      }
+    };
+    create_actor<A>(ActorOptions().with_name("A").with_poll(false)).release();
+  });
+  scheduler.run();
+}
+TEST(Actor2, SchedulerTwo) {
+  Scheduler scheduler({0, 0});
+  scheduler.run_in_context([] {
+    class B : public Actor {
+     public:
+      void start_up() override {
+        CHECK(SchedulerContext::get()->get_scheduler_id() == SchedulerId{1});
+      }
+      void close() {
+        CHECK(SchedulerContext::get()->get_scheduler_id() == SchedulerId{1});
+        SchedulerContext::get()->stop();
+      }
+    };
+    class A : public Actor {
+      void start_up() override {
+        CHECK(SchedulerContext::get()->get_scheduler_id() == SchedulerId{0});
+        auto id =
+            create_actor<B>(ActorOptions().with_name("B").with_poll(false).on_scheduler(SchedulerId{1})).release();
+        send_closure(id, &B::close);
+      }
+    };
+    create_actor<A>(ActorOptions().with_name("A").with_poll(false).on_scheduler(SchedulerId{0})).release();
+  });
+  scheduler.run();
+}
+TEST(Actor2, ActorIdDynamicCast) {
+  Scheduler scheduler({0});
+  scheduler.run_in_context([] {
+    class A : public Actor {
+     public:
+      void close() {
+        CHECK(actor_id().actor_info_ptr() == get_actor_info_ptr());
+        SchedulerContext::get()->stop();
+      }
+    };
+    auto actor_own_a = create_actor<A>(ActorOptions().with_name("A").with_poll(false));
+    auto actor = &actor_own_a.get_actor_unsafe();
+    ActorOwn<> actor_own = actor_dynamic_cast<Actor>(std::move(actor_own_a));
+    CHECK(actor_own_a.empty());
+    actor_own_a = actor_dynamic_cast<A>(std::move(actor_own));
+    CHECK(actor_own.empty());
+    CHECK(&actor_own_a.get_actor_unsafe() == actor);
+
+    auto actor_id_a = actor_own_a.release();
+    ActorId<> actor_id = actor_dynamic_cast<Actor>(actor_id_a);
+    actor_id_a = actor_dynamic_cast<A>(actor_id);
+    CHECK(&actor_id_a.get_actor_unsafe() == actor);
+
+    auto actor_shared_a = ActorShared<A>(actor_id_a, 123);
+    ActorShared<> actor_shared = actor_dynamic_cast<Actor>(std::move(actor_shared_a));
+    CHECK(actor_shared_a.empty());
+    CHECK(actor_shared.token() == 123);
+    actor_shared_a = actor_dynamic_cast<A>(std::move(actor_shared));
+    CHECK(actor_shared.empty());
+    CHECK(&actor_shared_a.get_actor_unsafe() == actor);
+    CHECK(actor_shared_a.token() == 123);
+
+    send_closure(actor_shared_a, &A::close);
+  });
+  scheduler.run();
+}
+
+TEST(Actor2, send_vs_close) {
+  for (int it = 0; it < 100; it++) {
+    Scheduler scheduler({8});
+
+    auto watcher = td::create_shared_destructor([] { SchedulerContext::get()->stop(); });
+    scheduler.run_in_context([watcher = std::move(watcher)] {
+      class To : public Actor {
+       public:
+        class Callback {
+         public:
+          virtual ~Callback() {
+          }
+          virtual void on_closed(ActorId<To> to) = 0;
+        };
+        To(int cnt, std::shared_ptr<td::Destructor> watcher) : cnt_(cnt), watcher_(std::move(watcher)) {
+        }
+        void on_event() {
+          if (--cnt_ <= 0) {
+            stop();
+          }
+        }
+        void add_callback(std::unique_ptr<Callback> callback) {
+          callbacks_.push_back(std::move(callback));
+        }
+        void start_up() override {
+          alarm_timestamp() = td::Timestamp::in(td::Random::fast(0, 4) * 0.001);
+        }
+        void tear_down() override {
+          if (td::Random::fast(0, 4) == 0) {
+            send_closure(actor_id(this), &To::self_ref, actor_id(this));
+          }
+          for (auto &callback : callbacks_) {
+            callback->on_closed(actor_id(this));
+          }
+        }
+        void self_ref(ActorId<To>) {
+        }
+        void alarm() override {
+          stop();
+        }
+
+       private:
+        int cnt_;
+        std::shared_ptr<td::Destructor> watcher_;
+        std::vector<std::unique_ptr<Callback>> callbacks_;
+      };
+      class From : public Actor {
+       public:
+        From(std::vector<ActorId<To>> to, std::shared_ptr<td::Destructor> watcher)
+            : to_(std::move(to)), watcher_(std::move(watcher)) {
+        }
+        void start_up() override {
+          yield();
+        }
+        void on_closed(ActorId<To>) {
+        }
+        void loop() override {
+          while (!to_.empty()) {
+            if (td::Random::fast(0, 3) == 0) {
+              break;
+            }
+            auto id = to_.back();
+            to_.pop_back();
+            if (td::Random::fast(0, 4) == 0) {
+              class Callback : public To::Callback {
+               public:
+                Callback(ActorId<From> from) : from_(std::move(from)) {
+                }
+                void on_closed(ActorId<To> id) override {
+                  send_closure(from_, &From::on_closed, std::move(id));
+                }
+
+               private:
+                ActorId<From> from_;
+              };
+              send_closure(id, &To::add_callback, std::make_unique<Callback>(actor_id(this)));
+            }
+            send_closure(id, &To::on_event);
+          }
+          if (to_.empty()) {
+            stop();
+          } else {
+            yield();
+          }
+        }
+
+       private:
+        std::vector<ActorId<To>> to_;
+        std::shared_ptr<td::Destructor> watcher_;
+      };
+
+      class Master : public Actor {
+       public:
+        Master(std::shared_ptr<td::Destructor> watcher) : watcher_(std::move(watcher)) {
+        }
+
+       private:
+        std::shared_ptr<td::Destructor> watcher_;
+        int cnt_ = 10;
+        void loop() override {
+          if (cnt_-- < 0) {
+            return stop();
+          }
+          int from_n = 5;
+          int to_n = 5;
+          std::vector<std::vector<ActorId<To>>> from(from_n);
+          for (int i = 0; i < to_n; i++) {
+            int cnt = td::Random::fast(1, 10);
+            int to_cnt = td::Random::fast(1, cnt);
+            auto to =
+                td::actor::create_actor<To>(
+                    td::actor::ActorOptions().with_name(PSLICE() << "To#" << i).with_poll(td::Random::fast(0, 4) == 0),
+                    to_cnt, watcher_)
+                    .release();
+            for (int j = 0; j < cnt; j++) {
+              auto from_i = td::Random::fast(0, from_n - 1);
+              from[from_i].push_back(to);
+            }
+          }
+          for (int i = 0; i < from_n; i++) {
+            td::actor::create_actor<From>(
+                td::actor::ActorOptions().with_name(PSLICE() << "From#" << i).with_poll(td::Random::fast(0, 4) == 0),
+                std::move(from[i]), watcher_)
+                .release();
+          }
+          alarm_timestamp() = td::Timestamp::in(td::Random::fast(0, 10) * 0.01 / 30);
+        }
+      };
+      td::actor::create_actor<Master>("Master", watcher).release();
+    });
+
+    scheduler.run();
+  }
+}
+TEST(Actor2, send_vs_close2) {
+  for (int it = 0; it < 100; it++) {
+    Scheduler scheduler({8});
+
+    auto watcher = td::create_shared_destructor([] { SchedulerContext::get()->stop(); });
+    //std::shared_ptr<td::Destructor> watcher;
+    scheduler.run_in_context([watcher = std::move(watcher)] {
+      class To : public Actor {
+       public:
+        To(int cnt, std::shared_ptr<td::Destructor> watcher) : cnt_(cnt), watcher_(std::move(watcher)) {
+        }
+        void start_up() override {
+          alarm_timestamp() = td::Timestamp::in(td::Random::fast(0, 4) * 0.001 / 30);
+        }
+        void alarm() override {
+          stop();
+        }
+
+       private:
+        int cnt_;
+        std::shared_ptr<td::Destructor> watcher_;
+      };
+      class From : public Actor {
+       public:
+        From(std::vector<ActorId<To>> to, std::shared_ptr<td::Destructor> watcher)
+            : to_(std::move(to)), watcher_(std::move(watcher)) {
+        }
+        void start_up() override {
+          stop();
+        }
+
+       private:
+        std::vector<ActorId<To>> to_;
+        std::shared_ptr<td::Destructor> watcher_;
+      };
+
+      class Master : public Actor {
+       public:
+        Master(std::shared_ptr<td::Destructor> watcher) : watcher_(std::move(watcher)) {
+        }
+
+       private:
+        std::shared_ptr<td::Destructor> watcher_;
+        int cnt_ = 5;
+        void loop() override {
+          if (cnt_-- < 0) {
+            return stop();
+          }
+          int from_n = 2;
+          int to_n = 2;
+          std::vector<std::vector<ActorId<To>>> from(from_n);
+          for (int i = 0; i < to_n; i++) {
+            int cnt = td::Random::fast(1, 2);
+            int to_cnt = td::Random::fast(1, cnt);
+            auto to =
+                td::actor::create_actor<To>(
+                    td::actor::ActorOptions().with_name(PSLICE() << "To#" << i).with_poll(td::Random::fast(0, 4) == 0),
+                    to_cnt, watcher_)
+                    .release();
+            for (int j = 0; j < cnt; j++) {
+              auto from_i = td::Random::fast(0, from_n - 1);
+              from[from_i].push_back(to);
+            }
+          }
+          for (int i = 0; i < from_n; i++) {
+            td::actor::create_actor<From>(
+                td::actor::ActorOptions().with_name(PSLICE() << "From#" << i).with_poll(td::Random::fast(0, 4) == 0),
+                std::move(from[i]), watcher_)
+                .release();
+          }
+          alarm_timestamp() = td::Timestamp::in(td::Random::fast(0, 10) * 0.01 / 30);
+        }
+      };
+      td::actor::create_actor<Master>("Master", watcher).release();
+    });
+
+    scheduler.run();
+  }
+}
+#endif  //!TD_THREAD_UNSUPPORTED
diff --git a/submodules/ton/tonlib-src/tdactor/test/actors_promise.cpp b/submodules/ton/tonlib-src/tdactor/test/actors_promise.cpp
new file mode 100644
index 0000000000..9fb4526c93
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdactor/test/actors_promise.cpp
@@ -0,0 +1,498 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/actor/actor.h"
+#include "td/actor/PromiseFuture.h"
+#include "td/actor/MultiPromise.h"
+#include "td/utils/MovableValue.h"
+#include "td/utils/tests.h"
+
+template <class T>
+class X {
+ public:
+  X() = default;
+  X(X &&) = default;
+  template <class S>
+  X(S s) : t(s) {
+  }
+  T t;
+};
+
+TEST(Actor, promise) {
+  using Int = td::MovableValue<int>;
+  using td::Promise;
+  using td::Result;
+
+  auto set_int = [](td::Result<Int> &destination) {
+    return [&destination](Int value) { destination = std::move(value); };
+  };
+  auto set_result_int = [](Result<Int> &destination) {
+    return [&destination](Result<Int> value) { destination = std::move(value); };
+  };
+
+  {
+    Result<Int> result{2};
+    {
+      Promise<Int> promise = set_int(result);
+      promise.set_value(Int{3});
+    }
+    ASSERT_TRUE(result.is_ok());
+    ASSERT_EQ(result.ok().get(), 3);
+  }
+
+  {
+    Result<Int> result{2};
+    {
+      Promise<Int> promise = set_int(result);
+      (void)promise;
+      // will set Int{} on destruction
+    }
+    ASSERT_TRUE(result.is_ok());
+    ASSERT_EQ(result.ok().get(), 0);
+  }
+
+  {
+    Result<Int> result{2};
+    {
+      Promise<Int> promise = set_result_int(result);
+      promise.set_value(Int{3});
+    }
+    ASSERT_TRUE(result.is_ok());
+    ASSERT_EQ(result.ok().get(), 3);
+  }
+
+  {
+    Result<Int> result{2};
+    {
+      Promise<Int> promise = set_result_int(result);
+      (void)promise;
+      // will set Status::Error() on destruction
+    }
+    ASSERT_TRUE(result.is_error());
+  }
+
+  {
+    std::unique_ptr<int> res;
+    Promise<td::Unit> x = [a = std::make_unique<int>(5), &res](td::Unit) mutable { res = std::move(a); };
+    x(td::Unit());
+    CHECK(*res == 5);
+  }
+
+  {//{
+   //Promise<Int> promise;
+   //std::tuple<Promise<Int> &&> f(std::move(promise));
+   //std::tuple<Promise<Int>> x = std::move(f);
+   //}
+
+   {
+       //using T = Result<int>;
+       //using T = std::unique_ptr<int>;
+       //using T = std::function<int()>;
+       //using T = std::vector<int>;
+       //using T = X<int>;
+       ////using T = Promise<Int>;
+       //T f;
+       //std::tuple<T &&> g(std::move(f));
+       //std::tuple<T> h = std::move(g);
+   }}
+
+  {
+    int result = 0;
+    auto promise = td::lambda_promise<int>([&](auto x) { result = x.move_as_ok(); });
+    promise.set_value(5);
+    ASSERT_EQ(5, result);
+
+    Promise<int> promise2 = [&](auto x) { result = x.move_as_ok(); };
+    promise2.set_value(6);
+    ASSERT_EQ(6, result);
+  }
+}
+
+TEST(Actor, safe_promise) {
+  int res = 0;
+  {
+    td::Promise<int> promise = td::PromiseCreator::lambda([&](int x) { res = x; });
+    auto safe_promise = td::SafePromise<int>(std::move(promise), 2);
+    promise = std::move(safe_promise);
+    ASSERT_EQ(res, 0);
+    auto safe_promise2 = td::SafePromise<int>(std::move(promise), 3);
+  }
+  ASSERT_EQ(res, 3);
+}
+
+TEST(Actor2, actor_lost_promise) {
+  using namespace td::actor;
+  using namespace td;
+  Scheduler scheduler({1}, Scheduler::Paused);
+
+  auto watcher = td::create_shared_destructor([] {
+    LOG(ERROR) << "STOP";
+    SchedulerContext::get()->stop();
+  });
+  scheduler.run_in_context([watcher = std::move(watcher)] {
+    class B : public Actor {
+     public:
+      void start_up() override {
+        stop();
+      }
+      uint32 query(uint32 x) {
+        return x * x;
+      }
+    };
+    class A : public Actor {
+     public:
+      A(std::shared_ptr<td::Destructor> watcher) : watcher_(std::move(watcher)) {
+      }
+      void start_up() {
+        b_ = create_actor<B>(ActorOptions().with_name("B"));
+        //send_closure(b_, &B::query, 2, [self = actor_id(this)](uint32 y) { send_closure(self, &A::on_result, 2, y); });
+        send_closure_later(b_, &B::query, 2,
+                           [self = actor_id(this), a = std::make_unique<int>()](Result<uint32> y) mutable {
+                             LOG(ERROR) << "!";
+                             CHECK(y.is_error());
+                             send_closure(self, &A::finish);
+                           });
+        send_closure(b_, &B::query, 2, [self = actor_id(this), a = std::make_unique<int>()](Result<uint32> y) mutable {
+          LOG(ERROR) << "!";
+          CHECK(y.is_error());
+          send_closure(self, &A::finish);
+        });
+      }
+      void finish() {
+        LOG(ERROR) << "FINISH";
+        stop();
+      }
+
+     private:
+      std::shared_ptr<td::Destructor> watcher_;
+      td::actor::ActorOwn<B> b_;
+    };
+    create_actor<A>(ActorOptions().with_name("A").with_poll(), watcher).release();
+  });
+  scheduler.run();
+}
+
+TEST(Actor2, MultiPromise) {
+  using namespace td;
+  MultiPromise::Options fail_on_error;
+  fail_on_error.ignore_errors = false;
+  MultiPromise::Options ignore_errors;
+  ignore_errors.ignore_errors = true;
+
+  std::string str;
+  auto log = [&](Result<Unit> res) {
+    if (res.is_ok()) {
+      str += "OK;";
+    } else {
+      str += PSTRING() << "E" << res.error().code() << ";";
+    }
+  };
+  auto clear = [&] { str = ""; };
+
+  {
+    clear();
+    MultiPromise mp(ignore_errors);
+    {
+      auto mp_init = mp.init_guard();
+      mp_init.add_promise(log);
+      ASSERT_EQ("", str);
+    }
+    ASSERT_EQ("OK;", str);
+  }
+
+  {
+    clear();
+    MultiPromise mp(ignore_errors);
+    {
+      auto mp_init = mp.init_guard();
+      mp_init.add_promise(log);
+      mp_init.get_promise().set_error(Status::Error(1));
+      ASSERT_EQ("", str);
+    }
+    ASSERT_EQ("OK;", str);
+  }
+
+  {
+    clear();
+    MultiPromise mp(ignore_errors);
+    Promise<> promise;
+    {
+      auto mp_init = mp.init_guard();
+      mp_init.add_promise(log);
+      promise = mp_init.get_promise();
+    }
+    ASSERT_EQ("", str);
+    {
+      auto mp_init = mp.add_promise_or_init(log);
+      ASSERT_TRUE(!mp_init);
+    }
+    promise.set_error(Status::Error(2));
+    ASSERT_EQ("OK;OK;", str);
+    clear();
+    {
+      auto mp_init = mp.add_promise_or_init(log);
+      ASSERT_TRUE(mp_init);
+      ASSERT_EQ("", str);
+    }
+    ASSERT_EQ("OK;", str);
+  }
+
+  {
+    clear();
+    MultiPromise mp(fail_on_error);
+    {
+      auto mp_init = mp.init_guard();
+      mp_init.get_promise().set_value(Unit());
+      mp_init.add_promise(log);
+      ASSERT_EQ("", str);
+    }
+    ASSERT_EQ("OK;", str);
+  }
+
+  {
+    clear();
+    MultiPromise mp(fail_on_error);
+    {
+      auto mp_init = mp.init_guard();
+      mp_init.get_promise().set_value(Unit());
+      mp_init.add_promise(log);
+      mp_init.get_promise().set_error(Status::Error(1));
+      ASSERT_EQ("E1;", str);
+      clear();
+      mp_init.get_promise().set_error(Status::Error(2));
+      ASSERT_EQ("", str);
+      mp_init.add_promise(log);
+      ASSERT_EQ("E1;", str);
+    }
+    ASSERT_EQ("E1;", str);
+  }
+
+  {
+    clear();
+    MultiPromise mp(fail_on_error);
+    Promise<> promise;
+    {
+      auto mp_init = mp.init_guard();
+      mp_init.get_promise().set_value(Unit());
+      mp_init.add_promise(log);
+      promise = mp_init.get_promise();
+    }
+    ASSERT_EQ("", str);
+    {
+      auto mp_init = mp.add_promise_or_init(log);
+      ASSERT_TRUE(mp_init.empty());
+    }
+    promise.set_error(Status::Error(2));
+    ASSERT_EQ("E2;E2;", str);
+    clear();
+
+    {
+      auto mp_init = mp.add_promise_or_init(log);
+      ASSERT_TRUE(!mp_init.empty());
+    }
+    ASSERT_EQ("OK;", str);
+  }
+}
+
+#if TD_HAVE_COROUTINES
+#include <experimental/coroutine>
+namespace td {
+template <class T = Unit>
+struct task {
+  struct final_awaiter {
+    bool await_ready() const noexcept {
+      return false;
+    }
+    template <class P>
+    std::experimental::coroutine_handle<> await_suspend(std::experimental::coroutine_handle<P> continuation) noexcept {
+      return continuation.promise().continuation_;
+    }
+    void await_resume() noexcept {
+    }
+  };
+  struct promise_type {
+    task get_return_object() {
+      return task{*this};
+    }
+    std::experimental::suspend_always initial_suspend() {
+      return {};
+    }
+    final_awaiter final_suspend() {
+      return final_awaiter{};
+    }
+    void return_value(T v) {
+      value_ = v;
+    }
+    T move_value() {
+      return std::move(value_.value());
+    }
+    void unhandled_exception() {
+    }
+
+    optional<T> value_;
+    std::experimental::coroutine_handle<> continuation_;
+  };
+
+  // awaiter
+  std::experimental::coroutine_handle<promise_type> coroutine_handle_;
+  task(task &&other) = default;
+  task(promise_type &promise)
+      : coroutine_handle_(std::experimental::coroutine_handle<promise_type>::from_promise(promise)) {
+  }
+
+  bool await_ready() const noexcept {
+    return !coroutine_handle_ || coroutine_handle_.done();
+  }
+  std::experimental::coroutine_handle<> await_suspend(std::experimental::coroutine_handle<> continuation) noexcept {
+    coroutine_handle_.promise().continuation_ = continuation;
+    return coroutine_handle_;
+  }
+  T await_resume() noexcept {
+    return coroutine_handle_.promise().move_value();
+  }
+};
+
+task<int> f() {
+  co_return 1;
+}
+task<int> g() {
+  co_return 2;
+}
+task<int> h() {
+  auto a = co_await f();
+  auto b = co_await g();
+  co_return a + b;
+}
+
+struct immediate_task {
+  struct promise_type {
+    immediate_task get_return_object() {
+      return {};
+    }
+    std::experimental::suspend_never initial_suspend() {
+      return {};
+    }
+    std::experimental::suspend_never final_suspend() {
+      return {};
+    }
+    void return_void() {
+    }
+    void unhandled_exception() {
+    }
+  };
+};
+
+struct OnActor {
+ public:
+  template <class T>
+  OnActor(T &&actor_id) : actor_id_(actor_id.as_actor_ref()) {
+  }
+  bool await_ready() const noexcept {
+    return false;
+  }
+  void await_suspend(std::experimental::coroutine_handle<> continuation) noexcept {
+    //TODO: destroy if lambda is lost
+    send_lambda(actor_id_, [continuation]() mutable { continuation.resume(); });
+  }
+  void await_resume() noexcept {
+  }
+
+ private:
+  actor::detail::ActorRef actor_id_;
+};
+
+immediate_task check_h() {
+  LOG(ERROR) << "check_h: call h";
+  auto c = co_await h();
+  LOG(ERROR) << "check_h: after call h";
+  ASSERT_EQ(3, c);
+}
+
+TEST(ActorCoro, Task) {
+  check_h();
+}
+namespace actor {
+class AsyncQuery {};
+
+class Printer : public Actor {
+ public:
+  void f();
+  void print_a() {
+    LOG(ERROR) << "a";
+  }
+  void print_b() {
+    LOG(ERROR) << "b";
+  }
+};
+
+class SampleActor : public Actor {
+ public:
+  SampleActor(std::shared_ptr<td::Destructor> watcher) : watcher_(std::move(watcher)) {
+  }
+
+ private:
+  std::shared_ptr<Destructor> watcher_;
+  ActorOwn<Printer> printer_;
+  void start_up() override {
+    printer_ = create_actor<Printer>("Printer");
+    run_coroutine();
+  }
+  task<Unit> print_a() {
+    auto self = actor_id(this);
+    LOG(ERROR) << "enter print_a";
+    co_await OnActor(printer_);
+    detail::current_actor<Printer>().print_a();
+    co_await OnActor(self);
+    LOG(ERROR) << "exit print_a";
+    co_return{};
+  }
+  task<Unit> print_b() {
+    auto self = actor_id(this);
+    LOG(ERROR) << "enter print_b";
+    co_await OnActor(printer_);
+    detail::current_actor<Printer>().print_b();
+    co_await OnActor(self);
+    LOG(ERROR) << "exit print_b";
+    co_return{};
+  }
+
+  immediate_task run_coroutine() {
+    co_await print_a();
+    co_await print_b();
+    stop();
+  }
+};
+}  // namespace actor
+
+TEST(ActorCoro, Simple) {
+  using namespace td::actor;
+  using namespace td;
+  Scheduler scheduler({1});
+
+  auto watcher = td::create_shared_destructor([] {
+    LOG(ERROR) << "STOP";
+    SchedulerContext::get()->stop();
+  });
+  scheduler.run_in_context([watcher = std::move(watcher)] {
+    create_actor<actor::SampleActor>(ActorOptions().with_name("SampleActor").with_poll(), watcher).release();
+  });
+  scheduler.run();
+}
+
+}  // namespace td
+#endif
diff --git a/submodules/ton/tonlib-src/tddb/CMakeLists.txt b/submodules/ton/tonlib-src/tddb/CMakeLists.txt
new file mode 100644
index 0000000000..960703b6f7
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/CMakeLists.txt
@@ -0,0 +1,71 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+#SOURCE SETS
+set(TDDB_SOURCE
+  td/db/MemoryKeyValue.cpp
+
+  td/db/KeyValue.h
+  td/db/KeyValueAsync.h
+  td/db/MemoryKeyValue.h
+
+  td/db/utils/ChainBuffer.cpp
+  td/db/utils/CyclicBuffer.cpp
+  td/db/utils/FileSyncState.cpp
+  td/db/utils/StreamInterface.cpp
+  td/db/utils/StreamToFileActor.cpp
+  td/db/utils/FileToStreamActor.cpp
+
+  td/db/utils/ChainBuffer.h
+  td/db/utils/CyclicBuffer.h
+  td/db/utils/FileSyncState.h
+  td/db/utils/StreamInterface.h
+  td/db/utils/StreamToFileActor.h
+  td/db/utils/FileToStreamActor.h
+
+  td/db/binlog/Binlog.cpp
+  td/db/binlog/BinlogReaderHelper.cpp
+
+  td/db/binlog/Binlog.h
+  td/db/binlog/BinlogReaderHelper.h
+  td/db/binlog/BinlogReaderInterface.h
+)
+
+set(TDDB_ROCKSDB_SOURCE
+  td/db/RocksDb.cpp
+  td/db/RocksDb.h
+)
+
+set(TDDB_TEST_SOURCE
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/key_value.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/binlog.cpp
+  PARENT_SCOPE
+)
+
+#RULES
+
+#LIBRARIES
+
+add_library(tddb STATIC ${TDDB_SOURCE})
+target_include_directories(tddb PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+target_link_libraries(tddb PUBLIC tdutils tdactor)
+
+if (TDDB_USE_ROCKSDB)
+  target_sources(tddb PRIVATE ${TDDB_ROCKSDB_SOURCE})
+  target_compile_definitions(tddb PUBLIC -DTDDB_USE_ROCKSDB)
+  target_link_libraries(tddb PRIVATE rocksdb)
+  target_include_directories(tddb PRIVATE $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/../third-party/rocksdb/include>)
+endif()
+
+add_executable(io-bench test/io-bench.cpp)
+target_link_libraries(io-bench tdutils tdactor tddb)
+
+# BEGIN-INTERNAL
+#add_subdirectory(benchmark)
+
+# END-INTERNAL
+install(TARGETS tddb EXPORT TdTargets
+  LIBRARY DESTINATION lib
+  ARCHIVE DESTINATION lib
+  RUNTIME DESTINATION bin
+  INCLUDES DESTINATION include
+)
diff --git a/submodules/ton/tonlib-src/tddb/td/db/KeyValue.h b/submodules/ton/tonlib-src/tddb/td/db/KeyValue.h
new file mode 100644
index 0000000000..494f076e41
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/KeyValue.h
@@ -0,0 +1,116 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/utils/Status.h"
+#include "td/utils/logging.h"
+namespace td {
+class KeyValueReader {
+ public:
+  virtual ~KeyValueReader() = default;
+  enum class GetStatus : int32 { Ok, NotFound };
+
+  virtual Result<GetStatus> get(Slice key, std::string &value) = 0;
+  virtual Result<size_t> count(Slice prefix) = 0;
+};
+
+class PrefixedKeyValueReader : public KeyValueReader {
+ public:
+  PrefixedKeyValueReader(std::shared_ptr<KeyValueReader> reader, Slice prefix)
+      : reader_(std::move(reader)), prefix_(prefix.str()) {
+  }
+  Result<GetStatus> get(Slice key, std::string &value) override {
+    return reader_->get(PSLICE() << prefix_ << key, value);
+  }
+  Result<size_t> count(Slice prefix) override {
+    return reader_->count(PSLICE() << prefix_ << prefix);
+  }
+
+ private:
+  std::shared_ptr<KeyValueReader> reader_;
+  std::string prefix_;
+};
+
+class KeyValueUtils {
+ public:
+};
+
+class KeyValue : public KeyValueReader {
+ public:
+  virtual Status set(Slice key, Slice value) = 0;
+  virtual Status erase(Slice key) = 0;
+
+  virtual Status begin_transaction() = 0;
+  virtual Status commit_transaction() = 0;
+  virtual Status abort_transaction() = 0;
+  // Desctructor will abort transaction
+
+  virtual std::unique_ptr<KeyValueReader> snapshot() = 0;
+
+  virtual std::string stats() const {
+    return "";
+  }
+  virtual Status flush() {
+    return Status::OK();
+  }
+};
+class PrefixedKeyValue : public KeyValue {
+ public:
+  PrefixedKeyValue(std::shared_ptr<KeyValue> kv, Slice prefix) : kv_(std::move(kv)), prefix_(prefix.str()) {
+  }
+  Result<GetStatus> get(Slice key, std::string &value) override {
+    return kv_->get(PSLICE() << prefix_ << key, value);
+  }
+  Result<size_t> count(Slice prefix) override {
+    return kv_->count(PSLICE() << prefix_ << prefix);
+  }
+  Status set(Slice key, Slice value) override {
+    return kv_->set(PSLICE() << prefix_ << key, value);
+  }
+  Status erase(Slice key) override {
+    return kv_->erase(PSLICE() << prefix_ << key);
+  }
+
+  Status begin_transaction() override {
+    return kv_->begin_transaction();
+  }
+  Status commit_transaction() override {
+    return kv_->commit_transaction();
+  }
+  Status abort_transaction() override {
+    return kv_->abort_transaction();
+  }
+  // Desctructor will abort transaction
+
+  std::unique_ptr<KeyValueReader> snapshot() override {
+    return kv_->snapshot();
+  }
+
+  std::string stats() const override {
+    return kv_->stats();
+  }
+  Status flush() override {
+    return kv_->flush();
+  }
+
+ private:
+  std::shared_ptr<KeyValue> kv_;
+  std::string prefix_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/KeyValueAsync.h b/submodules/ton/tonlib-src/tddb/td/db/KeyValueAsync.h
new file mode 100644
index 0000000000..e2e0c39638
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/KeyValueAsync.h
@@ -0,0 +1,158 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/actor.h"
+#include "td/actor/PromiseFuture.h"
+
+#include "td/db/KeyValue.h"
+
+namespace td {
+
+template <class KeyT, class ValueT>
+class KeyValueActor;
+
+template <class KeyT, class ValueT>
+class KeyValueAsync {
+ public:
+  using ActorType = KeyValueActor<KeyT, ValueT>;
+  struct GetResult {
+    KeyValue::GetStatus status;
+    ValueT value;
+  };
+  KeyValueAsync(std::shared_ptr<KeyValue> key_value);
+  void get(KeyT key, Promise<GetResult> promise = {});
+  void set(KeyT key, ValueT value, Promise<Unit> promise = {}, double sync_delay = 0);
+  void erase(KeyT key, Promise<Unit> promise = {}, double sync_delay = 0);
+
+  KeyValueAsync();
+  KeyValueAsync(KeyValueAsync &&);
+  KeyValueAsync &operator=(KeyValueAsync &&);
+  ~KeyValueAsync();
+
+ private:
+  actor::ActorOwn<ActorType> actor_;
+};
+
+template <class KeyT, class ValueT>
+class KeyValueActor : public actor::Actor {
+ public:
+  KeyValueActor(std::shared_ptr<KeyValue> key_value) : key_value_(std::move(key_value)) {
+  }
+
+  void get(KeyT key, Promise<typename KeyValueAsync<KeyT, ValueT>::GetResult> promise) {
+    std::string value;
+    auto r_status = key_value_->get(as_slice(key), value);
+    if (r_status.is_error()) {
+      promise.set_error(r_status.move_as_error());
+      return;
+    }
+    typename KeyValueAsync<KeyT, ValueT>::GetResult result;
+    result.status = r_status.move_as_ok();
+    if (result.status == KeyValue::GetStatus::Ok) {
+      result.value = ValueT(std::move(value));
+    }
+    promise.set_value(std::move(result));
+  }
+  void set(KeyT key, ValueT value, Promise<Unit> promise, double sync_delay) {
+    schedule_sync(std::move(promise), sync_delay);
+    key_value_->set(as_slice(key), as_slice(value));
+  }
+  void erase(KeyT key, Promise<Unit> promise, double sync_delay) {
+    schedule_sync(std::move(promise), sync_delay);
+    key_value_->erase(as_slice(key));
+  }
+
+ private:
+  std::shared_ptr<KeyValue> key_value_;
+  std::vector<Promise<Unit>> pending_promises_;
+  bool need_sync_ = false;
+  bool sync_active_ = false;
+
+  void tear_down() override {
+    sync();
+  }
+  void sync() {
+    if (!need_sync_) {
+      return;
+    }
+    need_sync_ = false;
+    sync_active_ = false;
+    key_value_->commit_transaction();
+    for (auto &promise : pending_promises_) {
+      promise.set_value(Unit());
+    }
+    pending_promises_.clear();
+  }
+  void schedule_sync(Promise<Unit> promise, double sync_delay) {
+    if (!need_sync_) {
+      key_value_->begin_transaction();
+      need_sync_ = true;
+    }
+
+    if (!sync_active_) {
+      if (sync_delay == 0) {
+        send_sync();
+      } else {
+        alarm_timestamp().relax(Timestamp::in(sync_delay));
+      }
+    }
+    if (promise) {
+      pending_promises_.push_back(std::move(promise));
+    }
+  }
+  void alarm() override {
+    if (need_sync_ && !sync_active_) {
+      send_sync();
+    }
+  }
+  void send_sync() {
+    sync_active_ = true;
+    alarm_timestamp() = Timestamp::never();
+    send_closure(actor_id(this), &KeyValueActor<KeyT, ValueT>::sync);
+  }
+};
+
+template <class KeyT, class ValueT>
+KeyValueAsync<KeyT, ValueT>::KeyValueAsync() = default;
+template <class KeyT, class ValueT>
+KeyValueAsync<KeyT, ValueT>::KeyValueAsync(KeyValueAsync &&) = default;
+template <class KeyT, class ValueT>
+KeyValueAsync<KeyT, ValueT> &KeyValueAsync<KeyT, ValueT>::operator=(KeyValueAsync &&) = default;
+template <class KeyT, class ValueT>
+KeyValueAsync<KeyT, ValueT>::~KeyValueAsync() = default;
+
+template <class KeyT, class ValueT>
+KeyValueAsync<KeyT, ValueT>::KeyValueAsync(std::shared_ptr<KeyValue> key_value) {
+  actor_ = actor::create_actor<ActorType>("KeyValueActor", std::move(key_value));
+}
+template <class KeyT, class ValueT>
+void KeyValueAsync<KeyT, ValueT>::get(KeyT key, Promise<GetResult> promise) {
+  send_closure_later(actor_, &ActorType::get, std::move(key), std::move(promise));
+}
+template <class KeyT, class ValueT>
+void KeyValueAsync<KeyT, ValueT>::set(KeyT key, ValueT value, Promise<Unit> promise, double sync_delay) {
+  send_closure_later(actor_, &ActorType::set, std::move(key), std::move(value), std::move(promise), sync_delay);
+}
+template <class KeyT, class ValueT>
+void KeyValueAsync<KeyT, ValueT>::erase(KeyT key, Promise<Unit> promise, double sync_delay) {
+  send_closure_later(actor_, &ActorType::erase, std::move(key), std::move(promise), sync_delay);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/MemoryKeyValue.cpp b/submodules/ton/tonlib-src/tddb/td/db/MemoryKeyValue.cpp
new file mode 100644
index 0000000000..dd98578d36
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/MemoryKeyValue.cpp
@@ -0,0 +1,74 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/db/MemoryKeyValue.h"
+
+#include "td/utils/format.h"
+
+namespace td {
+Result<MemoryKeyValue::GetStatus> MemoryKeyValue::get(Slice key, std::string &value) {
+  auto it = map_.find(key);
+  if (it == map_.end()) {
+    return GetStatus::NotFound;
+  }
+  value = it->second;
+  return GetStatus::Ok;
+}
+Status MemoryKeyValue::set(Slice key, Slice value) {
+  map_[key.str()] = value.str();
+  return Status::OK();
+}
+Status MemoryKeyValue::erase(Slice key) {
+  auto it = map_.find(key);
+  if (it != map_.end()) {
+    map_.erase(it);
+  }
+  return Status::OK();
+}
+
+Result<size_t> MemoryKeyValue::count(Slice prefix) {
+  size_t res = 0;
+  for (auto it = map_.lower_bound(prefix); it != map_.end(); it++) {
+    if (Slice(it->first).truncate(prefix.size()) != prefix) {
+      break;
+    }
+    res++;
+  }
+  return res;
+}
+
+std::unique_ptr<KeyValueReader> MemoryKeyValue::snapshot() {
+  auto res = std::make_unique<MemoryKeyValue>();
+  res->map_ = map_;
+  return std::move(res);
+}
+
+std::string MemoryKeyValue::stats() const {
+  return PSTRING() << "MemoryKeyValueStats{" << tag("get_count", get_count_) << "}";
+}
+
+Status MemoryKeyValue::begin_transaction() {
+  UNREACHABLE();
+}
+Status MemoryKeyValue::commit_transaction() {
+  UNREACHABLE();
+}
+Status MemoryKeyValue::abort_transaction() {
+  UNREACHABLE();
+}
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/MemoryKeyValue.h b/submodules/ton/tonlib-src/tddb/td/db/MemoryKeyValue.h
new file mode 100644
index 0000000000..f2c261fe67
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/MemoryKeyValue.h
@@ -0,0 +1,48 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/db/KeyValue.h"
+
+#include <map>
+
+namespace td {
+class MemoryKeyValue : public KeyValue {
+ public:
+  Result<GetStatus> get(Slice key, std::string &value) override;
+  Status set(Slice key, Slice value) override;
+  Status erase(Slice key) override;
+  Result<size_t> count(Slice prefix) override;
+
+  Status begin_transaction() override;
+  Status commit_transaction() override;
+  Status abort_transaction() override;
+
+  std::unique_ptr<KeyValueReader> snapshot() override;
+
+  std::string stats() const override;
+
+ private:
+  class Cmp : public std::less<> {
+   public:
+    using is_transparent = void;
+  };
+  std::map<std::string, std::string, Cmp> map_;
+  int64 get_count_{0};
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/RocksDb.cpp b/submodules/ton/tonlib-src/tddb/td/db/RocksDb.cpp
new file mode 100644
index 0000000000..16f4b4eb80
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/RocksDb.cpp
@@ -0,0 +1,199 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/db/RocksDb.h"
+
+#include "rocksdb/db.h"
+#include "rocksdb/statistics.h"
+#include "rocksdb/write_batch.h"
+#include "rocksdb/utilities/optimistic_transaction_db.h"
+#include "rocksdb/utilities/transaction.h"
+
+namespace td {
+namespace {
+static Status from_rocksdb(rocksdb::Status status) {
+  if (status.ok()) {
+    return Status::OK();
+  }
+  return Status::Error(status.ToString());
+}
+static Slice from_rocksdb(rocksdb::Slice slice) {
+  return Slice(slice.data(), slice.size());
+}
+static rocksdb::Slice to_rocksdb(Slice slice) {
+  return rocksdb::Slice(slice.data(), slice.size());
+}
+}  // namespace
+
+Status RocksDb::destroy(Slice path) {
+  return from_rocksdb(rocksdb::DestroyDB(path.str(), {}));
+}
+
+RocksDb::RocksDb(RocksDb &&) = default;
+RocksDb &RocksDb::operator=(RocksDb &&) = default;
+
+RocksDb::~RocksDb() {
+  if (!db_) {
+    return;
+  }
+  end_snapshot().ensure();
+}
+
+RocksDb RocksDb::clone() const {
+  return RocksDb{db_, statistics_};
+}
+
+Result<RocksDb> RocksDb::open(std::string path) {
+  rocksdb::OptimisticTransactionDB *db;
+  auto statistics = rocksdb::CreateDBStatistics();
+  {
+    rocksdb::Options options;
+    options.manual_wal_flush = true;
+    options.create_if_missing = true;
+    options.max_background_compactions = 4;
+    options.max_background_flushes = 2;
+    options.bytes_per_sync = 1 << 20;
+    options.writable_file_max_buffer_size = 2 << 14;
+    options.statistics = statistics;
+    TRY_STATUS(from_rocksdb(rocksdb::OptimisticTransactionDB::Open(options, std::move(path), &db)));
+  }
+  return RocksDb(std::shared_ptr<rocksdb::OptimisticTransactionDB>(db), std::move(statistics));
+}
+
+std::unique_ptr<KeyValueReader> RocksDb::snapshot() {
+  auto res = std::make_unique<RocksDb>(clone());
+  res->begin_snapshot().ensure();
+  return std::move(res);
+}
+
+std::string RocksDb::stats() const {
+  return statistics_->ToString();
+}
+
+Result<RocksDb::GetStatus> RocksDb::get(Slice key, std::string &value) {
+  //LOG(ERROR) << "GET";
+  rocksdb::Status status;
+  if (snapshot_) {
+    rocksdb::ReadOptions options;
+    options.snapshot = snapshot_.get();
+    status = db_->Get(options, to_rocksdb(key), &value);
+  } else if (transaction_) {
+    status = transaction_->Get({}, to_rocksdb(key), &value);
+  } else {
+    status = db_->Get({}, to_rocksdb(key), &value);
+  }
+  if (status.ok()) {
+    return GetStatus::Ok;
+  }
+  if (status.code() == rocksdb::Status::kNotFound) {
+    return GetStatus::NotFound;
+  }
+  return from_rocksdb(status);
+}
+
+Status RocksDb::set(Slice key, Slice value) {
+  if (write_batch_) {
+    return from_rocksdb(write_batch_->Put(to_rocksdb(key), to_rocksdb(value)));
+  }
+  if (transaction_) {
+    return from_rocksdb(transaction_->Put(to_rocksdb(key), to_rocksdb(value)));
+  }
+  return from_rocksdb(db_->Put({}, to_rocksdb(key), to_rocksdb(value)));
+}
+
+Status RocksDb::erase(Slice key) {
+  if (write_batch_) {
+    return from_rocksdb(write_batch_->Delete(to_rocksdb(key)));
+  }
+  if (transaction_) {
+    return from_rocksdb(transaction_->Delete(to_rocksdb(key)));
+  }
+  return from_rocksdb(db_->Delete({}, to_rocksdb(key)));
+}
+
+Result<size_t> RocksDb::count(Slice prefix) {
+  rocksdb::ReadOptions options;
+  options.snapshot = snapshot_.get();
+  std::unique_ptr<rocksdb::Iterator> iterator;
+  if (snapshot_ || !transaction_) {
+    iterator.reset(db_->NewIterator(options));
+  } else {
+    iterator.reset(transaction_->GetIterator(options));
+  }
+
+  size_t res = 0;
+  for (iterator->Seek(to_rocksdb(prefix)); iterator->Valid(); iterator->Next()) {
+    if (from_rocksdb(iterator->key()).truncate(prefix.size()) != prefix) {
+      break;
+    }
+    res++;
+  }
+  if (!iterator->status().ok()) {
+    return from_rocksdb(iterator->status());
+  }
+  return res;
+}
+
+Status RocksDb::begin_transaction() {
+  write_batch_ = std::make_unique<rocksdb::WriteBatch>();
+  //transaction_.reset(db_->BeginTransaction({}, {}));
+  return Status::OK();
+}
+
+Status RocksDb::commit_transaction() {
+  CHECK(write_batch_);
+  auto write_batch = std::move(write_batch_);
+  rocksdb::WriteOptions options;
+  options.sync = true;
+  TRY_STATUS(from_rocksdb(db_->Write(options, write_batch.get())));
+  return Status::OK();
+
+  //CHECK(transaction_);
+  //auto res = from_rocksdb(transaction_->Commit());
+  //transaction_.reset();
+  //return res;
+}
+
+Status RocksDb::abort_transaction() {
+  CHECK(write_batch_);
+  write_batch_.reset();
+  //CHECK(transaction_);
+  //transaction_.reset();
+  return Status::OK();
+}
+
+Status RocksDb::flush() {
+  return from_rocksdb(db_->Flush({}));
+}
+
+Status RocksDb::begin_snapshot() {
+  snapshot_.reset(db_->GetSnapshot());
+  return td::Status::OK();
+}
+
+Status RocksDb::end_snapshot() {
+  if (snapshot_) {
+    db_->ReleaseSnapshot(snapshot_.release());
+  }
+  return td::Status::OK();
+}
+
+RocksDb::RocksDb(std::shared_ptr<rocksdb::OptimisticTransactionDB> db, std::shared_ptr<rocksdb::Statistics> statistics)
+    : db_(std::move(db)), statistics_(std::move(statistics)) {
+}
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/RocksDb.h b/submodules/ton/tonlib-src/tddb/td/db/RocksDb.h
new file mode 100644
index 0000000000..04abba778d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/RocksDb.h
@@ -0,0 +1,81 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#if !TDDB_USE_ROCKSDB
+#error "RocksDb is not supported"
+#endif
+
+#include "td/db/KeyValue.h"
+#include "td/utils/Status.h"
+
+namespace rocksdb {
+class OptimisticTransactionDB;
+class Transaction;
+class WriteBatch;
+class Snapshot;
+class Statistics;
+}  // namespace rocksdb
+
+namespace td {
+class RocksDb : public KeyValue {
+ public:
+  static Status destroy(Slice path);
+  RocksDb clone() const;
+  static Result<RocksDb> open(std::string path);
+
+  Result<GetStatus> get(Slice key, std::string &value) override;
+  Status set(Slice key, Slice value) override;
+  Status erase(Slice key) override;
+  Result<size_t> count(Slice prefix) override;
+
+  Status begin_transaction() override;
+  Status commit_transaction() override;
+  Status abort_transaction() override;
+  Status flush() override;
+
+  Status begin_snapshot();
+  Status end_snapshot();
+
+  std::unique_ptr<KeyValueReader> snapshot() override;
+  std::string stats() const override;
+
+  RocksDb(RocksDb &&);
+  RocksDb &operator=(RocksDb &&);
+  ~RocksDb();
+
+ private:
+  std::shared_ptr<rocksdb::OptimisticTransactionDB> db_;
+  std::shared_ptr<rocksdb::Statistics> statistics_;
+
+  std::unique_ptr<rocksdb::Transaction> transaction_;
+  std::unique_ptr<rocksdb::WriteBatch> write_batch_;
+  class UnreachableDeleter {
+   public:
+    template <class T>
+    void operator()(T *) {
+      UNREACHABLE();
+    }
+  };
+  std::unique_ptr<const rocksdb::Snapshot, UnreachableDeleter> snapshot_;
+
+  explicit RocksDb(std::shared_ptr<rocksdb::OptimisticTransactionDB> db,
+                   std::shared_ptr<rocksdb::Statistics> statistics);
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/binlog/Binlog.cpp b/submodules/ton/tonlib-src/tddb/td/db/binlog/Binlog.cpp
new file mode 100644
index 0000000000..be59b4e71a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/binlog/Binlog.cpp
@@ -0,0 +1,349 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "Binlog.h"
+
+#include "BinlogReaderHelper.h"
+
+#include "td/db/utils/StreamInterface.h"
+#include "td/db/utils/ChainBuffer.h"
+#include "td/db/utils/CyclicBuffer.h"
+#include "td/db/utils/FileSyncState.h"
+#include "td/db/utils/StreamToFileActor.h"
+#include "td/db/utils/FileToStreamActor.h"
+
+#include "td/actor/actor.h"
+
+#include "td/utils/misc.h"
+#include "td/utils/port/path.h"
+#include "td/utils/VectorQueue.h"
+
+namespace td {
+namespace {
+class BinlogReplayActor : public actor::Actor {
+ public:
+  BinlogReplayActor(StreamReader stream_reader, actor::ActorOwn<FileToStreamActor> file_to_stream,
+                    std::shared_ptr<BinlogReaderInterface> binlog_reader, Promise<Unit> promise)
+      : stream_reader_(std::move(stream_reader))
+      , file_to_stream_(std::move(file_to_stream))
+      , binlog_reader_(std::move(binlog_reader))
+      , promise_(std::move(promise)) {
+  }
+
+ private:
+  StreamReader stream_reader_;
+  actor::ActorOwn<FileToStreamActor> file_to_stream_;
+  std::shared_ptr<BinlogReaderInterface> binlog_reader_;
+  Promise<Unit> promise_;
+
+  bool is_writer_closed_{false};
+  BinlogReaderHelper binlog_reader_helper_;
+
+  unique_ptr<FileToStreamActor::Callback> create_callback() {
+    class Callback : public FileToStreamActor::Callback {
+     public:
+      Callback(actor::ActorShared<> actor) : actor_(std::move(actor)) {
+      }
+      void got_more() override {
+        send_signals_later(actor_, actor::ActorSignals::wakeup());
+      }
+
+     private:
+      actor::ActorShared<> actor_;
+    };
+    return make_unique<Callback>(actor_shared(this));
+  }
+
+  void start_up() override {
+    send_closure_later(file_to_stream_, &FileToStreamActor::set_callback, create_callback());
+  }
+  void notify_writer() {
+    send_signals_later(file_to_stream_, actor::ActorSignals::wakeup());
+  }
+
+  void loop() override {
+    auto status = do_loop();
+    if (status.is_error()) {
+      stream_reader_.close_reader(status.clone());
+      promise_.set_error(std::move(status));
+      return stop();
+    }
+    if (is_writer_closed_) {
+      stream_reader_.close_reader(Status::OK());
+      promise_.set_value(Unit());
+      return stop();
+    }
+  }
+  Status do_loop() {
+    is_writer_closed_ = stream_reader_.is_writer_closed();
+    if (is_writer_closed_) {
+      TRY_STATUS(std::move(stream_reader_.writer_status()));
+    }
+
+    // TODO: watermark want_more/got_more logic
+    int64 got_size = stream_reader_.reader_size();
+    while (got_size > 0) {
+      auto slice = stream_reader_.prepare_read();
+      TRY_STATUS(binlog_reader_helper_.parse(*binlog_reader_, slice));
+      stream_reader_.confirm_read(slice.size());
+      got_size -= slice.size();
+    }
+    notify_writer();
+
+    if (is_writer_closed_) {
+      if (binlog_reader_helper_.unparsed_size() != 0) {
+        return Status::Error(PSLICE() << "Got " << binlog_reader_helper_.unparsed_size()
+                                      << " unparsed bytes in binlog");
+      }
+    }
+
+    return Status::OK();
+  }
+};
+}  // namespace
+Binlog::Binlog(string path) : path_(std::move(path)) {
+}
+
+Status Binlog::replay_sync(BinlogReaderInterface& binlog_reader) {
+  TRY_RESULT(fd, FileFd::open(path_, FileFd::Flags::Read));
+  // No need to use Cyclic buffer, but CyclicBuffer is important for async version
+  CyclicBuffer::Options options;
+  options.chunk_size = 256;
+  options.count = 1;
+  auto reader_writer = CyclicBuffer::create(options);
+
+  auto buf_reader = std::move(reader_writer.first);
+  auto buf_writer = std::move(reader_writer.second);
+
+  TRY_RESULT(fd_size, fd.get_size());
+
+  BinlogReaderHelper helper;
+  while (fd_size != 0) {
+    auto read_to = buf_writer.prepare_write();
+    if (static_cast<int64>(read_to.size()) > fd_size) {
+      read_to.truncate(narrow_cast<size_t>(fd_size));
+    }
+    TRY_RESULT(read, fd.read(read_to));
+    if (read == 0) {
+      return Status::Error("Unexpected end of file");
+    }
+    fd_size -= read;
+    buf_writer.confirm_write(read);
+
+    auto data = buf_reader.prepare_read();
+    CHECK(data.size() == read);
+    TRY_STATUS(helper.parse(binlog_reader, data));
+    buf_reader.confirm_read(data.size());
+  }
+
+  if (helper.unparsed_size() != 0) {
+    return Status::Error(PSLICE() << "Got " << helper.unparsed_size() << " unparsed bytes in binlog");
+  }
+
+  //TODO: check crc32
+  //TODO: allow binlog truncate
+  return Status::OK();
+}
+
+void Binlog::replay_async(std::shared_ptr<BinlogReaderInterface> binlog_reader, Promise<Unit> promise) {
+  auto r_fd = FileFd::open(path_, FileFd::Flags::Read);
+  if (r_fd.is_error()) {
+    promise.set_error(r_fd.move_as_error());
+    return;
+  }
+  auto fd = r_fd.move_as_ok();
+  CyclicBuffer::Options buf_options;
+  buf_options.chunk_size = 256;
+  auto reader_writer = CyclicBuffer::create(buf_options);
+
+  auto buf_reader = std::move(reader_writer.first);
+  auto buf_writer = std::move(reader_writer.second);
+
+  auto r_fd_size = fd.get_size();
+  if (r_fd_size.is_error()) {
+    promise.set_error(r_fd_size.move_as_error());
+  }
+  auto options = FileToStreamActor::Options{};
+  options.limit = r_fd_size.move_as_ok();
+  auto file_to_stream =
+      actor::create_actor<FileToStreamActor>("FileToStream", std::move(fd), std::move(buf_writer), options);
+  auto stream_to_binlog = actor::create_actor<BinlogReplayActor>(
+      "BinlogReplay", std::move(buf_reader), std::move(file_to_stream), std::move(binlog_reader), std::move(promise));
+  stream_to_binlog.release();
+}
+
+void Binlog::destroy(CSlice path) {
+  td::unlink(path).ignore();
+}
+
+void Binlog::destroy() {
+  destroy(path_);
+}
+
+BinlogWriter::BinlogWriter(std::string path) : path_(std::move(path)) {
+}
+
+Status BinlogWriter::open() {
+  TRY_RESULT(fd, FileFd::open(path_, FileFd::Flags::Write | FileFd::Flags::Append | FileFd::Create));
+  fd_ = std::move(fd);
+  ChainBuffer::Options buf_options;
+  buf_options.max_io_slices = 128;
+  buf_options.chunk_size = 256;
+  auto reader_writer = ChainBuffer::create(buf_options);
+  buf_reader_ = std::move(reader_writer.first);
+  buf_writer_ = std::move(reader_writer.second);
+  return Status::OK();
+}
+
+Status BinlogWriter::lazy_flush() {
+  if (buf_reader_.reader_size() < 512) {
+    return Status::OK();
+  }
+  return flush();
+}
+
+Status BinlogWriter::flush() {
+  while (buf_reader_.reader_size() != 0) {
+    TRY_RESULT(written, fd_.writev(buf_reader_.prepare_readv()));
+    buf_reader_.confirm_read(written);
+  }
+  return Status::OK();
+}
+Status BinlogWriter::sync() {
+  flush();
+  return fd_.sync();
+}
+
+Status BinlogWriter::close() {
+  sync();
+  fd_.close();
+  return Status::OK();
+}
+
+namespace detail {
+class FlushHelperActor : public actor::Actor {
+ public:
+  FlushHelperActor(FileSyncState::Reader sync_state_reader, actor::ActorOwn<StreamToFileActor> actor)
+      : sync_state_reader_(std::move(sync_state_reader)), actor_(std::move(actor)) {
+  }
+  void flush() {
+    //TODO;
+  }
+  void sync(size_t position, Promise<Unit> promise) {
+    sync_state_reader_.set_requested_sync_size(position);
+    if (promise) {
+      queries_.emplace(position, std::move(promise));
+    }
+    send_signals_later(actor_, actor::ActorSignals::wakeup());
+  }
+
+  void close(Promise<> promise) {
+    close_promise_ = std::move(promise);
+    actor_.reset();
+  }
+
+ private:
+  FileSyncState::Reader sync_state_reader_;
+  actor::ActorOwn<StreamToFileActor> actor_;
+  Promise<> close_promise_;
+
+  struct Query {
+    Query(size_t position, Promise<Unit> promise) : position(position), promise(std::move(promise)) {
+    }
+    size_t position;
+    Promise<Unit> promise;
+  };
+  VectorQueue<Query> queries_;
+
+  unique_ptr<StreamToFileActor::Callback> create_callback() {
+    class Callback : public StreamToFileActor::Callback {
+     public:
+      Callback(actor::ActorShared<> actor) : actor_(std::move(actor)) {
+      }
+      void on_sync_state_changed() override {
+        send_signals_later(actor_, actor::ActorSignals::wakeup());
+      }
+
+     private:
+      actor::ActorShared<> actor_;
+    };
+    return make_unique<Callback>(actor_shared(this));
+  }
+
+  void start_up() override {
+    send_closure_later(actor_, &StreamToFileActor::set_callback, create_callback());
+  }
+
+  void loop() override {
+    auto synced_position = sync_state_reader_.synced_size();
+    while (!queries_.empty() && queries_.front().position <= synced_position) {
+      queries_.front().promise.set_value(Unit());
+      queries_.pop();
+    }
+  }
+
+  void hangup_shared() override {
+    stop();
+  }
+  void tear_down() override {
+    if (close_promise_) {
+      close_promise_.set_value(Unit());
+    }
+  }
+};
+}  // namespace detail
+BinlogWriterAsync::BinlogWriterAsync(std::string path) : path_(std::move(path)) {
+}
+BinlogWriterAsync::~BinlogWriterAsync() = default;
+
+Status BinlogWriterAsync::open() {
+  TRY_RESULT(fd, FileFd::open(path_, FileFd::Flags::Write | FileFd::Flags::Append | FileFd::Create));
+  ChainBuffer::Options buf_options;
+  buf_options.max_io_slices = 128;
+  buf_options.chunk_size = 256;
+  auto reader_writer = ChainBuffer::create(buf_options);
+  buf_writer_ = std::move(reader_writer.second);
+
+  auto sync_state_reader_writer = td::FileSyncState::create();
+  auto writer_actor = actor::create_actor<StreamToFileActor>("StreamToFile", std::move(reader_writer.first),
+                                                             std::move(fd), std::move(sync_state_reader_writer.second));
+  writer_actor_ = writer_actor.get();
+  sync_state_reader_ = std::move(sync_state_reader_writer.first);
+
+  flush_helper_actor_ =
+      actor::create_actor<detail::FlushHelperActor>("FlushHelperActor", sync_state_reader_, std::move(writer_actor));
+
+  return Status::OK();
+}
+
+void BinlogWriterAsync::close(Promise<> promise) {
+  send_closure(std::move(flush_helper_actor_), &detail::FlushHelperActor::close, std::move(promise));
+  writer_actor_ = {};
+}
+void BinlogWriterAsync::lazy_flush() {
+  send_signals_later(writer_actor_, actor::ActorSignals::wakeup());
+}
+
+void BinlogWriterAsync::flush() {
+  send_closure(flush_helper_actor_, &detail::FlushHelperActor::flush);
+}
+void BinlogWriterAsync::sync(Promise<Unit> promise) {
+  send_closure(flush_helper_actor_, &detail::FlushHelperActor::sync, buf_writer_.writer_size(), std::move(promise));
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/binlog/Binlog.h b/submodules/ton/tonlib-src/tddb/td/db/binlog/Binlog.h
new file mode 100644
index 0000000000..cde44450ad
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/binlog/Binlog.h
@@ -0,0 +1,135 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "BinlogReaderInterface.h"
+
+#include "td/db/utils/FileSyncState.h"
+#include "td/db/utils/StreamInterface.h"
+
+#include "td/actor/actor.h"
+
+#include "td/utils/misc.h"
+#include "td/utils/port/FileFd.h"
+
+namespace td {
+class BinlogReaderInterface;
+class StreamToFileActor;
+namespace detail {
+class FlushHelperActor;
+}  // namespace detail
+class Binlog {
+ public:
+  explicit Binlog(string path);
+
+  Status replay_sync(BinlogReaderInterface& binlog_reader);
+  void replay_async(std::shared_ptr<BinlogReaderInterface> binlog_reader, Promise<Unit> promise);
+
+  static void destroy(CSlice path);
+  void destroy();
+
+ private:
+  string path_;
+};
+
+class BinlogWriter {
+ public:
+  BinlogWriter(std::string path);
+
+  Status open();
+
+  template <class EventT>
+  Status write_event(EventT&& event, BinlogReaderInterface* binlog_reader);
+  Status lazy_flush();
+  Status flush();
+  Status sync();
+
+  Status close();
+
+ private:
+  string path_;
+  FileFd fd_;
+
+  StreamReader buf_reader_;
+  StreamWriter buf_writer_;
+};
+
+class BinlogWriterAsync {
+ public:
+  BinlogWriterAsync(std::string path);
+  ~BinlogWriterAsync();
+
+  Status open();
+
+  template <class EventT>
+  Status write_event(EventT&& event, BinlogReaderInterface* binlog_reader);
+
+  void close(Promise<> promise);
+
+  void lazy_flush();
+
+  void flush();
+  void sync(Promise<Unit> promise = {});
+
+ private:
+  std::string path_;
+  StreamWriter buf_writer_;
+  actor::ActorId<StreamToFileActor> writer_actor_;
+  actor::ActorOwn<detail::FlushHelperActor> flush_helper_actor_;
+
+  FileSyncState::Reader sync_state_reader_;
+};
+
+template <class EventT>
+Status BinlogWriter::write_event(EventT&& event, BinlogReaderInterface* binlog_reader) {
+  int64 need_size = -event.serialize({});
+  auto dest =
+      buf_writer_.prepare_write_at_least(narrow_cast<size_t>(need_size)).truncate(narrow_cast<size_t>(need_size));
+  auto written = event.serialize(dest);
+  CHECK(written == need_size);
+
+  if (binlog_reader != nullptr) {
+    TRY_RESULT(parsed, binlog_reader->parse(dest));
+    binlog_reader->flush();
+    CHECK(parsed == written);
+  }
+
+  buf_writer_.confirm_write(narrow_cast<size_t>(written));
+  return lazy_flush();
+}
+
+template <class EventT>
+Status BinlogWriterAsync::write_event(EventT&& event, BinlogReaderInterface* binlog_reader) {
+  int64 need_size = -event.serialize({});
+  auto dest =
+      buf_writer_.prepare_write_at_least(narrow_cast<size_t>(need_size)).truncate(narrow_cast<size_t>(need_size));
+  auto written = event.serialize(dest);
+  CHECK(written == need_size);
+
+  if (binlog_reader != nullptr) {
+    TRY_RESULT(parsed, binlog_reader->parse(dest));
+    CHECK(parsed == written);
+  }
+
+  buf_writer_.confirm_write(narrow_cast<size_t>(written));
+  lazy_flush();
+  return Status::OK();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/binlog/BinlogReaderHelper.cpp b/submodules/ton/tonlib-src/tddb/td/db/binlog/BinlogReaderHelper.cpp
new file mode 100644
index 0000000000..2ea0e613fd
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/binlog/BinlogReaderHelper.cpp
@@ -0,0 +1,96 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "BinlogReaderHelper.h"
+#include "BinlogReaderInterface.h"
+
+#include "td/utils/misc.h"
+
+namespace td {
+td::Status BinlogReaderHelper::parse(BinlogReaderInterface& reader, td::Slice data) {
+  SCOPE_EXIT {
+    reader.flush();
+  };
+  while (true) {
+    if (expected_prefix_size_ > 0 && expected_prefix_size_ == prefix_size_) {
+      TRY_RESULT(size, reader.parse(MutableSlice(buf_.data(), prefix_size_)));
+      if (size < 0) {
+        if (expected_prefix_size_ > td::narrow_cast<size_t>(-size)) {
+          return td::Status::Error("BinlogReader decreased logevent size estimation (1)");
+        }
+        expected_prefix_size_ = static_cast<size_t>(-size);
+      } else {
+        if (expected_prefix_size_ != td::narrow_cast<size_t>(size)) {
+          return td::Status::Error("BinlogReader changed logevent");
+        }
+        prefix_size_ = 0;
+        expected_prefix_size_ = 0;
+      }
+    }
+
+    if (data.empty()) {
+      break;
+    }
+
+    if (expected_prefix_size_ > 0) {
+      CHECK(expected_prefix_size_ < buf_.size());
+      CHECK(prefix_size_ < expected_prefix_size_);
+      auto got = data.copy().truncate(expected_prefix_size_ - prefix_size_);
+      reader.flush();
+      auto dest = td::MutableSlice(buf_.data(), buf_.size()).substr(prefix_size_);
+      if (dest.size() < got.size()) {
+        return td::Status::Error("Too big logevent");
+      }
+      dest.copy_from(got);
+      prefix_size_ += got.size();
+      data = data.substr(got.size());
+      continue;
+    }
+
+    CHECK(!data.empty());
+
+    TRY_RESULT(size, reader.parse(data));
+    if (size < 0) {
+      expected_prefix_size_ = td::narrow_cast<size_t>(-size);
+      prefix_size_ = data.size();
+      if (expected_prefix_size_ < prefix_size_) {
+        return td::Status::Error("BinlogReader waits for less data than it already has");
+      }
+      if (expected_prefix_size_ > buf_.size()) {
+        return td::Status::Error("BinlogReader waits for too big logevent");
+      }
+      reader.flush();
+      td::MutableSlice(buf_.data(), prefix_size_).copy_from(data);
+      break;
+    }
+    if (size == 0) {
+      return td::Status::Error("BinlogReader parseed nothing and asked for nothing");
+    }
+    if (td::narrow_cast<size_t>(size) > data.size()) {
+      return td::Status::Error("BinlogReader parseed more than was given");
+    }
+    data = data.substr(static_cast<size_t>(size));
+  }
+  return td::Status::OK();
+}
+
+size_t BinlogReaderHelper::unparsed_size() const {
+  return prefix_size_;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/binlog/BinlogReaderHelper.h b/submodules/ton/tonlib-src/tddb/td/db/binlog/BinlogReaderHelper.h
new file mode 100644
index 0000000000..3086f3a40f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/binlog/BinlogReaderHelper.h
@@ -0,0 +1,46 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/Status.h"
+#include "td/utils/Slice.h"
+
+namespace td {
+
+class BinlogReaderInterface;
+
+// Usually we have data available in chunks and we can't control chunk's sizes
+// And some events will be in multiple chunks.
+// We suggest that all events are small, chunks are big and only small
+// portion of events will lie on chunk's border.
+// This helper will store this rare events locally and will feed them
+// to BinlogReaderInterface as single memory chunk each.
+class BinlogReaderHelper {
+ public:
+  td::Status parse(BinlogReaderInterface& reader, td::Slice data);
+
+  size_t unparsed_size() const;
+
+ private:
+  alignas(16) std::array<char, 1024> buf_;
+  size_t prefix_size_{0};
+  size_t expected_prefix_size_{0};
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/binlog/BinlogReaderInterface.h b/submodules/ton/tonlib-src/tddb/td/db/binlog/BinlogReaderInterface.h
new file mode 100644
index 0000000000..41701a5a6d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/binlog/BinlogReaderInterface.h
@@ -0,0 +1,42 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+namespace td {
+
+class BinlogReaderInterface {
+ public:
+  virtual ~BinlogReaderInterface() {
+  }
+  // returns error or size
+  // negative size means reader expects data.size() to be at least -size
+  // positive size means first size bytes of data are processed and could be skipped
+  virtual td::Result<td::int64> parse(td::Slice data) = 0;
+
+  // called when all passed slices are invalidated
+  // Till it is called reader may resue all slices given to it.
+  // It makes possible to calculate crc32c in larger chunks
+  // TODO: maybe we should just process all data that we can at once
+  virtual void flush() {
+  }
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/utils/ChainBuffer.cpp b/submodules/ton/tonlib-src/tddb/td/db/utils/ChainBuffer.cpp
new file mode 100644
index 0000000000..73e34068a2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/utils/ChainBuffer.cpp
@@ -0,0 +1,139 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "ChainBuffer.h"
+
+#include "td/utils/buffer.h"
+#include "td/db/utils/StreamInterface.h"
+
+namespace td {
+namespace detail {
+class ChainBuffer : public StreamWriterInterface, public StreamReaderInterface {
+ public:
+  using Options = ::td::ChainBuffer::Options;
+
+  ChainBuffer(Options options) {
+    shared_.options_ = options;
+    reader_.io_slices_.reserve(options.max_io_slices);
+    reader_.buf_ = writer_.buf_.extract_reader();
+  }
+
+  // StreamReaderInterface
+  size_t reader_size() override {
+    reader_.buf_.sync_with_writer();
+    return reader_.buf_.size();
+  }
+
+  Slice prepare_read() override {
+    return reader_.buf_.prepare_read();
+  }
+  Span<IoSlice> prepare_readv() override {
+    reader_.io_slices_.clear();
+    auto it = reader_.buf_.clone();
+    while (!it.empty() && reader_.io_slices_.size() < reader_.io_slices_.capacity()) {
+      auto slice = it.prepare_read();
+      reader_.io_slices_.push_back(as_io_slice(slice));
+      it.confirm_read(slice.size());
+    }
+    return reader_.io_slices_;
+  }
+  void confirm_read(size_t size) override {
+    reader_.buf_.advance(size);
+  }
+
+  void close_reader(Status error) override {
+    CHECK(!reader_.is_closed_);
+    reader_.status_ = std::move(error);
+    reader_.is_closed_.store(true, std::memory_order_release);
+  }
+  bool is_writer_closed() const override {
+    return writer_.is_closed_.load(std::memory_order_acquire);
+  }
+  Status &writer_status() override {
+    CHECK(is_writer_closed());
+    return writer_.status_;
+  }
+
+  // StreamWriterInterface
+  size_t writer_size() override {
+    return writer_.size_;
+  }
+  MutableSlice prepare_write() override {
+    return writer_.buf_.prepare_append(shared_.options_.chunk_size);
+  }
+  MutableSlice prepare_write_at_least(size_t size) override {
+    return writer_.buf_.prepare_append_at_least(size);
+  }
+  void confirm_write(size_t size) override {
+    writer_.buf_.confirm_append(size);
+    writer_.size_ += size;
+  }
+  void append(Slice data) override {
+    writer_.buf_.append(data, shared_.options_.chunk_size);
+    writer_.size_ += data.size();
+  }
+  void append(BufferSlice data) override {
+    writer_.size_ += data.size();
+    writer_.buf_.append(std::move(data));
+  }
+  void append(std::string data) override {
+    append(Slice(data));
+  }
+  void close_writer(Status error) override {
+    CHECK(!writer_.is_closed_);
+    writer_.status_ = std::move(error);
+    writer_.is_closed_.store(true, std::memory_order_release);
+  }
+  bool is_reader_closed() const override {
+    return reader_.is_closed_.load(std::memory_order_acquire);
+  }
+  Status &reader_status() override {
+    CHECK(is_reader_closed());
+    return reader_.status_;
+  }
+
+ private:
+  struct SharedData {
+    Options options_;
+  } shared_;
+
+  char pad1[128];
+
+  struct ReaderData {
+    ChainBufferReader buf_;
+    std::atomic<bool> is_closed_{false};
+    Status status_;
+    std::vector<IoSlice> io_slices_;
+  } reader_;
+
+  char pad2[128];
+
+  struct WriterData {
+    ChainBufferWriter buf_;
+    std::atomic<bool> is_closed_{false};
+    Status status_;
+    size_t size_{0};
+  } writer_;
+};
+}  // namespace detail
+
+std::pair<ChainBuffer::Reader, ChainBuffer::Writer> ChainBuffer::create(Options options) {
+  auto impl = std::make_shared<detail::ChainBuffer>(options);
+  return {Reader(impl), Writer(impl)};
+}
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/utils/ChainBuffer.h b/submodules/ton/tonlib-src/tddb/td/db/utils/ChainBuffer.h
new file mode 100644
index 0000000000..b80c2a430b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/utils/ChainBuffer.h
@@ -0,0 +1,37 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/utils/common.h"
+
+#include "StreamInterface.h"
+
+namespace td {
+class ChainBuffer {
+ public:
+  struct Options {
+    Options() {
+    }
+    size_t chunk_size{1024 * 1024 / 8};  // default size of one chunk in chain buffer
+    size_t max_io_slices{128};           // size of buffer for writev
+  };
+  using Reader = StreamReader;
+  using Writer = StreamWriter;
+  static std::pair<Reader, Writer> create(Options options = {});
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/utils/CyclicBuffer.cpp b/submodules/ton/tonlib-src/tddb/td/db/utils/CyclicBuffer.cpp
new file mode 100644
index 0000000000..36a083ccad
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/utils/CyclicBuffer.cpp
@@ -0,0 +1,155 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "CyclicBuffer.h"
+
+#include "td/utils/misc.h"
+#include "td/utils/Slice.h"
+
+#include <atomic>
+#include <limits>
+#include <memory>
+
+namespace td {
+namespace detail {
+class CyclicBuffer : public StreamWriterInterface, public StreamReaderInterface {
+ public:
+  using Options = ::td::CyclicBuffer::Options;
+
+  CyclicBuffer(Options options) {
+    CHECK(options.chunk_size != 0);
+    CHECK(options.count != 0);
+    CHECK(options.alignment != 0);
+    CHECK(options.chunk_size < (std::numeric_limits<size_t>::max() - options.alignment) / options.count);
+    shared_.options_ = options;
+    shared_.raw_data_ = std::make_unique<char[]>(options.size() + options.alignment - 1);
+    auto pos = reinterpret_cast<uint64>(shared_.raw_data_.get());
+    auto offset = (options.alignment - static_cast<size_t>(pos % options.alignment)) % options.alignment;
+    CHECK(offset < options.alignment);
+    shared_.data_ = MutableSlice(shared_.raw_data_.get() + offset, options.size());
+  }
+
+  // StreamReaderInterface
+  size_t reader_size() override {
+    auto offset = reader_.pos_.load(std::memory_order_relaxed);
+    auto size = writer_.pos_.load(std::memory_order_acquire) - offset;
+    return narrow_cast<size_t>(size);
+  }
+  Slice prepare_read() override {
+    auto offset = reader_.pos_.load(std::memory_order_relaxed);
+    auto size = narrow_cast<size_t>(writer_.pos_.load(std::memory_order_acquire) - offset);
+    if (size == 0) {
+      return {};
+    }
+    offset %= (shared_.options_.chunk_size * shared_.options_.count);
+    return shared_.data_.substr(narrow_cast<size_t>(offset)).truncate(size).truncate(shared_.options_.chunk_size);
+  }
+  Span<IoSlice> prepare_readv() override {
+    reader_.io_slice_ = as_io_slice(prepare_read());
+    return Span<IoSlice>(&reader_.io_slice_, 1);
+  }
+  void confirm_read(size_t size) override {
+    reader_.pos_.store(reader_.pos_.load(std::memory_order_relaxed) + size);
+  }
+
+  void close_reader(Status error) override {
+    CHECK(!reader_.is_closed_);
+    reader_.status_ = std::move(error);
+    reader_.is_closed_.store(true, std::memory_order_release);
+  }
+  bool is_writer_closed() const override {
+    return writer_.is_closed_.load(std::memory_order_acquire);
+  }
+  Status &writer_status() override {
+    CHECK(is_writer_closed());
+    return writer_.status_;
+  }
+
+  // StreamWriterInterface
+  size_t writer_size() override {
+    auto offset = reader_.pos_.load(std::memory_order_acquire);
+    auto size = writer_.pos_.load(std::memory_order_relaxed) - offset;
+    return narrow_cast<size_t>(size);
+  }
+  MutableSlice prepare_write() override {
+    auto max_offset =
+        reader_.pos_.load(std::memory_order_acquire) + shared_.options_.chunk_size * (shared_.options_.count - 1);
+    auto offset = writer_.pos_.load(std::memory_order_relaxed);
+    if (offset > max_offset) {
+      return {};
+    }
+    offset %= (shared_.options_.chunk_size * shared_.options_.count);
+    return shared_.data_.substr(narrow_cast<size_t>(offset), shared_.options_.chunk_size);
+  }
+  MutableSlice prepare_write_at_least(size_t size) override {
+    UNREACHABLE();
+  }
+  void confirm_write(size_t size) override {
+    writer_.pos_.store(writer_.pos_.load(std::memory_order_relaxed) + size);
+  }
+  void append(Slice data) override {
+    UNREACHABLE();
+  }
+  void append(BufferSlice data) override {
+    UNREACHABLE();
+  }
+  void append(std::string data) override {
+    UNREACHABLE();
+  }
+  void close_writer(Status error) override {
+    CHECK(!writer_.is_closed_);
+    writer_.status_ = std::move(error);
+    writer_.is_closed_.store(true, std::memory_order_release);
+  }
+  bool is_reader_closed() const override {
+    return reader_.is_closed_.load(std::memory_order_acquire);
+  }
+  Status &reader_status() override {
+    CHECK(is_reader_closed());
+    return reader_.status_;
+  }
+
+ private:
+  struct SharedData {
+    std::unique_ptr<char[]> raw_data_;
+    MutableSlice data_;
+    Options options_;
+  } shared_;
+
+  struct ReaderData {
+    std::atomic<uint64> pos_{0};
+    std::atomic<bool> is_closed_{false};
+    Status status_;
+    IoSlice io_slice_;
+  } reader_;
+
+  char pad[128];
+
+  struct WriterData {
+    std::atomic<uint64> pos_{0};
+    std::atomic<bool> is_closed_{false};
+    Status status_;
+  } writer_;
+};
+}  // namespace detail
+
+std::pair<CyclicBuffer::Reader, CyclicBuffer::Writer> CyclicBuffer::create(Options options) {
+  auto impl = std::make_shared<detail::CyclicBuffer>(options);
+  return {Reader(impl), Writer(impl)};
+}
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/utils/CyclicBuffer.h b/submodules/ton/tonlib-src/tddb/td/db/utils/CyclicBuffer.h
new file mode 100644
index 0000000000..5439205b7b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/utils/CyclicBuffer.h
@@ -0,0 +1,48 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "StreamInterface.h"
+
+#include <utility>
+
+namespace td {
+
+class CyclicBuffer {
+ public:
+  struct Options {
+    Options() {
+    }
+    size_t chunk_size{1024 * 1024 / 8};
+    size_t count{16};
+    size_t alignment{1024};
+
+    size_t size() const {
+      return chunk_size * count;
+    }
+    size_t max_writable_size() {
+      return size() - chunk_size;
+    }
+  };
+  using Reader = StreamReader;
+  using Writer = StreamWriter;
+  static std::pair<Reader, Writer> create(Options options = {});
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/utils/FileSyncState.cpp b/submodules/ton/tonlib-src/tddb/td/db/utils/FileSyncState.cpp
new file mode 100644
index 0000000000..1ab07d703b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/utils/FileSyncState.cpp
@@ -0,0 +1,67 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+
+#include "FileSyncState.h"
+namespace td {
+std::pair<FileSyncState::Reader, FileSyncState::Writer> FileSyncState::create() {
+  auto self = std::make_shared<Self>();
+  return {Reader(self), Writer(self)};
+}
+
+FileSyncState::Reader::Reader(std::shared_ptr<Self> self) : self(std::move(self)) {
+}
+bool FileSyncState::Reader::set_requested_sync_size(size_t size) const {
+  if (self->requested_synced_size.load(std::memory_order_relaxed) == size) {
+    return false;
+  }
+  self->requested_synced_size.store(size, std::memory_order_release);
+  return true;
+}
+
+size_t FileSyncState::Reader::synced_size() const {
+  return self->synced_size;
+}
+size_t FileSyncState::Reader::flushed_size() const {
+  return self->flushed_size;
+}
+
+FileSyncState::Writer::Writer(std::shared_ptr<Self> self) : self(std::move(self)) {
+}
+
+size_t FileSyncState::Writer::get_requested_synced_size() {
+  return self->requested_synced_size.load(std::memory_order_acquire);
+}
+
+bool FileSyncState::Writer::set_synced_size(size_t size) {
+  if (self->synced_size.load(std::memory_order_relaxed) == size) {
+    return false;
+  }
+  self->synced_size.store(size, std::memory_order_release);
+  return true;
+}
+
+bool FileSyncState::Writer::set_flushed_size(size_t size) {
+  if (self->flushed_size.load(std::memory_order_relaxed) == size) {
+    return false;
+  }
+  self->flushed_size.store(size, std::memory_order_release);
+  return true;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/utils/FileSyncState.h b/submodules/ton/tonlib-src/tddb/td/db/utils/FileSyncState.h
new file mode 100644
index 0000000000..a110f26b5a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/utils/FileSyncState.h
@@ -0,0 +1,65 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <utility>
+#include <memory>
+#include <atomic>
+
+#include "td/utils/common.h"
+
+namespace td {
+class FileSyncState {
+  struct Self;
+
+ public:
+  class Reader {
+   public:
+    Reader() = default;
+    Reader(std::shared_ptr<Self> self);
+    bool set_requested_sync_size(size_t size) const;
+    size_t synced_size() const;
+    size_t flushed_size() const;
+
+   private:
+    std::shared_ptr<Self> self;
+  };
+
+  class Writer {
+   public:
+    Writer() = default;
+    Writer(std::shared_ptr<Self> self);
+    size_t get_requested_synced_size();
+    bool set_synced_size(size_t size);
+    bool set_flushed_size(size_t size);
+
+   private:
+    std::shared_ptr<Self> self;
+  };
+
+  static std::pair<Reader, Writer> create();
+
+ private:
+  struct Self {
+    std::atomic<size_t> requested_synced_size{0};
+
+    std::atomic<size_t> synced_size{0};
+    std::atomic<size_t> flushed_size{0};
+  };
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/utils/FileToStreamActor.cpp b/submodules/ton/tonlib-src/tddb/td/db/utils/FileToStreamActor.cpp
new file mode 100644
index 0000000000..209c43280a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/utils/FileToStreamActor.cpp
@@ -0,0 +1,78 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "FileToStreamActor.h"
+
+namespace td {
+FileToStreamActor::FileToStreamActor(FileFd fd, StreamWriter writer, Options options)
+    : fd_(std::move(fd)), writer_(std::move(writer)), options_(options) {
+}
+
+void FileToStreamActor::set_callback(td::unique_ptr<Callback> callback) {
+  callback_ = std::move(callback);
+  got_more();
+}
+
+void FileToStreamActor::got_more() {
+  if (!callback_) {
+    return;
+  }
+  callback_->got_more();
+}
+void FileToStreamActor::loop() {
+  auto dest = writer_.prepare_write();
+  if (options_.limit != -1) {
+    if (static_cast<int64>(dest.size()) > options_.limit) {
+      dest.truncate(narrow_cast<size_t>(options_.limit));
+    }
+  }
+  if (dest.empty()) {
+    //NB: Owner of CyclicBufer::Reader should notify this actor after each chunk is readed
+    return;
+  }
+
+  auto r_size = fd_.read(dest);
+  if (r_size.is_error()) {
+    writer_.close_writer(r_size.move_as_error());
+    got_more();
+    return stop();
+  }
+  auto size = r_size.move_as_ok();
+  writer_.confirm_write(size);
+  got_more();
+  if (options_.limit != -1) {
+    options_.limit -= narrow_cast<int64>(size);
+  }
+  if (options_.limit == 0) {
+    writer_.close_writer(td::Status::OK());
+    got_more();
+    return stop();
+  }
+  if (size == 0) {
+    if (options_.read_tail_each < 0) {
+      writer_.close_writer(td::Status::OK());
+      got_more();
+      return stop();
+    }
+    alarm_timestamp() = Timestamp::in(options_.read_tail_each);
+    return;
+  }
+  yield();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/utils/FileToStreamActor.h b/submodules/ton/tonlib-src/tddb/td/db/utils/FileToStreamActor.h
new file mode 100644
index 0000000000..4762114d28
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/utils/FileToStreamActor.h
@@ -0,0 +1,53 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "StreamInterface.h"
+
+#include "td/actor/actor.h"
+#include "td/utils/port/FileFd.h"
+
+namespace td {
+class FileToStreamActor : public td::actor::Actor {
+ public:
+  struct Options {
+    Options() {
+    }
+    int64 limit{-1};
+    double read_tail_each{-1};
+  };
+  class Callback {
+   public:
+    virtual ~Callback() {
+    }
+    virtual void got_more() = 0;
+  };
+  FileToStreamActor(FileFd fd, StreamWriter writer, Options options = {});
+
+  void set_callback(td::unique_ptr<Callback> callback);
+
+ private:
+  void got_more();
+  void loop() override;
+  FileFd fd_;
+  StreamWriter writer_;
+  td::unique_ptr<Callback> callback_;
+  Options options_;
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/utils/StreamInterface.cpp b/submodules/ton/tonlib-src/tddb/td/db/utils/StreamInterface.cpp
new file mode 100644
index 0000000000..fd9cacc555
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/utils/StreamInterface.cpp
@@ -0,0 +1,79 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "StreamInterface.h"
+namespace td {
+StreamReader::StreamReader(std::shared_ptr<StreamReaderInterface> self) : self(std::move(self)) {
+}
+size_t StreamReader::reader_size() {
+  return self->reader_size();
+}
+Slice StreamReader::prepare_read() {
+  return self->prepare_read();
+}
+Span<IoSlice> StreamReader::prepare_readv() {
+  return self->prepare_readv();
+}
+void StreamReader::confirm_read(size_t size) {
+  return self->confirm_read(size);
+}
+
+void StreamReader::close_reader(Status error) {
+  return self->close_reader(std::move(error));
+}
+bool StreamReader::is_writer_closed() const {
+  return self->is_writer_closed();
+}
+Status &StreamReader::writer_status() {
+  return self->writer_status();
+}
+
+StreamWriter::StreamWriter(std::shared_ptr<StreamWriterInterface> self) : self(std::move(self)) {
+}
+size_t StreamWriter::writer_size() {
+  return self->writer_size();
+}
+MutableSlice StreamWriter::prepare_write() {
+  return self->prepare_write();
+}
+MutableSlice StreamWriter::prepare_write_at_least(size_t size) {
+  return self->prepare_write_at_least(size);
+}
+void StreamWriter::confirm_write(size_t size) {
+  return self->confirm_write(size);
+}
+void StreamWriter::append(Slice data) {
+  return self->append(data);
+}
+void StreamWriter::append(BufferSlice data) {
+  return self->append(std::move(data));
+}
+void StreamWriter::append(std::string data) {
+  return self->append(std::move(data));
+}
+
+void StreamWriter::close_writer(Status error) {
+  return self->close_writer(std::move(error));
+}
+bool StreamWriter::is_reader_closed() const {
+  return self->is_reader_closed();
+}
+Status &StreamWriter::reader_status() {
+  return self->reader_status();
+}
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/utils/StreamInterface.h b/submodules/ton/tonlib-src/tddb/td/db/utils/StreamInterface.h
new file mode 100644
index 0000000000..17cb11b4e0
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/utils/StreamInterface.h
@@ -0,0 +1,102 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/utils/buffer.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Span.h"
+#include "td/utils/port/IoSlice.h"
+
+namespace td {
+// Generic stream interface
+// Will to hide implementations details.
+// CyclicBuffer, ChainBuffer, Bounded ChainBuffer, some clever writers. They all should be interchangable
+// Most implementaions will assume that reading and writing may happen concurrently
+
+class StreamReaderInterface {
+ public:
+  virtual ~StreamReaderInterface() {
+  }
+  virtual size_t reader_size() = 0;
+  virtual Slice prepare_read() = 0;
+  virtual Span<IoSlice> prepare_readv() = 0;
+  virtual void confirm_read(size_t size) = 0;
+
+  virtual void close_reader(Status error) = 0;
+  virtual bool is_writer_closed() const = 0;
+  virtual Status &writer_status() = 0;
+};
+
+class StreamWriterInterface {
+ public:
+  virtual ~StreamWriterInterface() {
+  }
+  virtual size_t writer_size() = 0;
+  virtual MutableSlice prepare_write() = 0;
+  virtual MutableSlice prepare_write_at_least(size_t size) = 0;
+  virtual void confirm_write(size_t size) = 0;
+  virtual void append(Slice data) = 0;
+  virtual void append(BufferSlice data) {
+    append(data.as_slice());
+  }
+  virtual void append(std::string data) {
+    append(Slice(data));
+  }
+
+  virtual void close_writer(Status error) = 0;
+  virtual bool is_reader_closed() const = 0;
+  virtual Status &reader_status() = 0;
+};
+
+// Hide shared_ptr
+class StreamReader : public StreamReaderInterface {
+ public:
+  StreamReader() = default;
+  StreamReader(std::shared_ptr<StreamReaderInterface> self);
+  size_t reader_size() override;
+  Slice prepare_read() override;
+  Span<IoSlice> prepare_readv() override;
+  void confirm_read(size_t size) override;
+  void close_reader(Status error) override;
+  bool is_writer_closed() const override;
+  Status &writer_status() override;
+
+ private:
+  std::shared_ptr<StreamReaderInterface> self;
+};
+
+class StreamWriter : public StreamWriterInterface {
+ public:
+  StreamWriter() = default;
+  StreamWriter(std::shared_ptr<StreamWriterInterface> self);
+  size_t writer_size() override;
+  MutableSlice prepare_write() override;
+  MutableSlice prepare_write_at_least(size_t size) override;
+  void confirm_write(size_t size) override;
+  void append(Slice data) override;
+  void append(BufferSlice data) override;
+  void append(std::string data) override;
+  void close_writer(Status error) override;
+  bool is_reader_closed() const override;
+  Status &reader_status() override;
+
+ private:
+  std::shared_ptr<StreamWriterInterface> self;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/utils/StreamToFileActor.cpp b/submodules/ton/tonlib-src/tddb/td/db/utils/StreamToFileActor.cpp
new file mode 100644
index 0000000000..d3ab7f6651
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/utils/StreamToFileActor.cpp
@@ -0,0 +1,112 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "StreamToFileActor.h"
+
+namespace td {
+StreamToFileActor::StreamToFileActor(StreamReader reader, FileFd fd, FileSyncState::Writer sync_state, Options options)
+    : reader_(std::move(reader)), fd_(std::move(fd)), sync_state_(std::move(sync_state)) {
+}
+void StreamToFileActor::set_callback(td::unique_ptr<Callback> callback) {
+  callback_ = std::move(callback);
+  callback_->on_sync_state_changed();
+}
+
+Result<bool> StreamToFileActor::is_closed() {
+  if (!reader_.is_writer_closed()) {
+    return false;
+  }
+  return reader_.writer_status().clone();
+}
+
+Status StreamToFileActor::do_flush_once() {
+  auto size = reader_.reader_size();
+  size_t total_written = 0;
+  while (total_written < size) {
+    auto io_slices = reader_.prepare_readv();
+    TRY_RESULT(written, fd_.writev(io_slices));
+    reader_.confirm_read(written);
+    flushed_size_ += written;
+    total_written += written;
+  }
+  return Status::OK();
+}
+
+Status StreamToFileActor::do_sync() {
+  if (flushed_size_ == synced_size_) {
+    return Status::OK();
+  }
+  TRY_STATUS(fd_.sync());
+  synced_size_ = flushed_size_;
+  return Status::OK();
+}
+
+void StreamToFileActor::schedule_sync() {
+  if (synced_size_ == flushed_size_) {
+    return;
+  }
+  if (sync_state_.get_requested_synced_size() > synced_size_) {
+    sync_at_.relax(Timestamp::in(options_.immediate_sync_delay));
+  } else {
+    sync_at_.relax(Timestamp::in(options_.lazy_sync_delay));
+  }
+}
+
+Result<bool> StreamToFileActor::do_loop() {
+  // We must first check if writer is closed and then drain all data from reader
+  // Otherwise there will be a race and some of data could be lost.
+  // Also it could be useful to check error and stop immediately.
+  TRY_RESULT(is_closed, is_closed());
+
+  // Flush all data that is awailable on the at the beginning of loop
+  TRY_STATUS(do_flush_once());
+
+  if ((sync_at_ && sync_at_.is_in_past()) || is_closed) {
+    TRY_STATUS(do_sync());
+    sync_at_ = {};
+  }
+
+  bool need_update = sync_state_.set_synced_size(synced_size_) | sync_state_.set_flushed_size(flushed_size_);
+  if (need_update && callback_) {
+    callback_->on_sync_state_changed();
+  }
+
+  if (reader_.reader_size() == 0 && is_closed) {
+    return true;
+  }
+
+  schedule_sync();
+  return false;
+}
+
+void StreamToFileActor::start_up() {
+  schedule_sync();
+}
+
+void StreamToFileActor::loop() {
+  auto r_is_closed = do_loop();
+  if (r_is_closed.is_error()) {
+    reader_.close_reader(r_is_closed.move_as_error());
+    return stop();
+  } else if (r_is_closed.ok()) {
+    reader_.close_reader(Status::OK());
+    return stop();
+  }
+  alarm_timestamp() = sync_at_;
+}
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/td/db/utils/StreamToFileActor.h b/submodules/ton/tonlib-src/tddb/td/db/utils/StreamToFileActor.h
new file mode 100644
index 0000000000..aaa58d2c91
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/td/db/utils/StreamToFileActor.h
@@ -0,0 +1,73 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "StreamInterface.h"
+#include "FileSyncState.h"
+
+#include "td/utils/Time.h"
+#include "td/utils/port/FileFd.h"
+
+#include "td/actor/actor.h"
+
+namespace td {
+class StreamToFileActor : public actor::Actor {
+ public:
+  struct Options {
+    Options() {
+    }
+    double lazy_sync_delay = 10;
+    double immediate_sync_delay = 0.001;
+  };
+
+  class Callback {
+   public:
+    virtual ~Callback() {
+    }
+    virtual void on_sync_state_changed() = 0;
+  };
+
+  StreamToFileActor(StreamReader reader, FileFd fd, FileSyncState::Writer sync_state, Options options = {});
+  void set_callback(td::unique_ptr<Callback> callback);
+
+ private:
+  StreamReader reader_;
+  FileFd fd_;
+  Timestamp sync_at_;
+  Options options_;
+  FileSyncState::Writer sync_state_;
+  unique_ptr<Callback> callback_;
+
+  size_t flushed_size_{0};
+  size_t synced_size_{0};
+
+  TD_WARN_UNUSED_RESULT Result<bool> is_closed();
+
+  Status do_flush_once();
+
+  Status do_sync();
+
+  void schedule_sync();
+
+  TD_WARN_UNUSED_RESULT Result<bool> do_loop();
+
+  void start_up() override;
+
+  void loop() override;
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tddb/test/binlog.cpp b/submodules/ton/tonlib-src/tddb/test/binlog.cpp
new file mode 100644
index 0000000000..fc46157ca6
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/test/binlog.cpp
@@ -0,0 +1,810 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/tests.h"
+
+#include "td/utils/as.h"
+#include "td/utils/base64.h"
+#include "td/utils/benchmark.h"
+#include "td/utils/buffer.h"
+#include "td/utils/crypto.h"
+#include "td/utils/filesystem.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Span.h"
+#include "td/utils/misc.h"
+#include "td/utils/overloaded.h"
+#include "td/utils/optional.h"
+#include "td/utils/port/FileFd.h"
+#include "td/utils/port/path.h"
+#include "td/utils/port/IoSlice.h"
+#include "td/utils/UInt.h"
+#include "td/utils/Variant.h"
+#include "td/utils/VectorQueue.h"
+
+#include "td/actor/actor.h"
+
+#include "td/db/utils/StreamInterface.h"
+#include "td/db/utils/ChainBuffer.h"
+#include "td/db/utils/CyclicBuffer.h"
+#include "td/db/binlog/BinlogReaderHelper.h"
+
+#include "td/db/binlog/Binlog.h"
+
+#include <ctime>
+
+// Toy Binlog Implementation
+using td::int64;
+using td::MutableSlice;
+using td::Result;
+using td::Slice;
+using td::Status;
+
+using RootHash = td::UInt256;
+using FileHash = td::UInt256;
+struct BlockId {
+  int workchain;
+  unsigned seqno;
+  unsigned long long shard;
+};
+
+template <class T>
+Result<int64> memcpy_parse(Slice data, T* res) {
+  if (data.size() < sizeof(T)) {
+    return -static_cast<int64>(sizeof(T));
+  }
+  std::memcpy(res, data.data(), sizeof(T));
+  if (res->tag_field != res->tag) {
+    return Status::Error("Tag mismatch");
+  }
+  return sizeof(T);
+}
+template <class T>
+int64 memcpy_serialize(MutableSlice data, const T& res) {
+  if (data.size() < sizeof(T)) {
+    return -static_cast<int64>(sizeof(T));
+  }
+  std::memcpy(data.data(), &res, sizeof(T));
+  return sizeof(T);
+}
+
+#pragma pack(push, 4)
+struct LogEventCrc32C {
+  static constexpr unsigned tag = 0x473a830a;
+
+  unsigned tag_field;
+  td::uint32 crc32c;
+  LogEventCrc32C() = default;
+  LogEventCrc32C(td::uint32 crc32c) : tag_field(tag), crc32c(crc32c) {
+  }
+  static Result<int64> parse(Slice data, LogEventCrc32C* res) {
+    return memcpy_parse(data, res);
+  }
+  int64 serialize(MutableSlice data) const {
+    return memcpy_serialize(data, *this);
+  }
+  auto key() const {
+    return crc32c;
+  }
+  bool operator==(const LogEventCrc32C& other) const {
+    return key() == other.key();
+  }
+  bool operator!=(const LogEventCrc32C& other) const {
+    return !(*this == other);
+  }
+};
+
+struct LogEventStart {
+  static constexpr unsigned tag = 0x0442446b;
+  static constexpr unsigned log_type = 0x290100;
+  unsigned tag_field;
+  unsigned type_field;
+  unsigned created_at;
+  unsigned char zerostate_root_hash[32];
+  LogEventStart() = default;
+  LogEventStart(const RootHash& hash, unsigned _now = 0)
+      : tag_field(tag), type_field(log_type), created_at(_now ? _now : (unsigned)std::time(nullptr)) {
+    td::as<RootHash>(zerostate_root_hash) = hash;
+  }
+  static Result<int64> parse(Slice data, LogEventStart* res) {
+    return memcpy_parse(data, res);
+  }
+  int64 serialize(MutableSlice data) const {
+    return memcpy_serialize(data, *this);
+  }
+  auto key() const {
+    return std::make_tuple(tag_field, type_field, created_at, Slice(zerostate_root_hash, 32));
+  }
+  bool operator==(const LogEventStart& other) const {
+    return key() == other.key();
+  }
+  bool operator!=(const LogEventStart& other) const {
+    return !(*this == other);
+  }
+};
+
+struct LogEventSetZeroState {
+  static constexpr unsigned tag = 0x63ab3cd9;
+  unsigned tag_field;
+  unsigned flags;
+  long long file_size;
+  unsigned char file_hash[32];
+  unsigned char root_hash[32];
+  LogEventSetZeroState() = default;
+  LogEventSetZeroState(const RootHash& rhash, const FileHash& fhash, unsigned long long _fsize, unsigned _flags = 0)
+      : tag_field(tag), flags(_flags), file_size(_fsize) {
+    td::as<FileHash>(file_hash) = fhash;
+    td::as<RootHash>(root_hash) = rhash;
+  }
+  static Result<int64> parse(Slice data, LogEventSetZeroState* res) {
+    return memcpy_parse(data, res);
+  }
+  int64 serialize(MutableSlice data) const {
+    return memcpy_serialize(data, *this);
+  }
+  auto key() const {
+    return std::make_tuple(tag_field, flags, file_size, Slice(file_hash, 32), Slice(root_hash, 32));
+  }
+  bool operator==(const LogEventSetZeroState& other) const {
+    return key() == other.key();
+  }
+  bool operator!=(const LogEventSetZeroState& other) const {
+    return !(*this == other);
+  }
+};
+
+struct LogEventNewBlock {
+  static constexpr unsigned tag = 0x19f4bc63;
+  unsigned tag_field;
+  unsigned flags;  // lower 8 bits = authority
+  int workchain;
+  unsigned seqno;
+  unsigned long long shard;
+  long long file_size;
+  unsigned char file_hash[32];
+  unsigned char root_hash[32];
+  unsigned char last_bytes[8];
+  LogEventNewBlock() = default;
+  LogEventNewBlock(const BlockId& block, const RootHash& rhash, const FileHash& fhash, unsigned long long _fsize,
+                   unsigned _flags)
+      : tag_field(tag)
+      , flags(_flags)
+      , workchain(block.workchain)
+      , seqno(block.seqno)
+      , shard(block.shard)
+      , file_size(_fsize) {
+    td::as<FileHash>(file_hash) = fhash;
+    td::as<RootHash>(root_hash) = rhash;
+    td::as<unsigned long long>(last_bytes) = 0;
+  }
+  static Result<int64> parse(Slice data, LogEventNewBlock* res) {
+    return memcpy_parse(data, res);
+  }
+  int64 serialize(MutableSlice data) const {
+    return memcpy_serialize(data, *this);
+  }
+  auto key() const {
+    return std::make_tuple(tag_field, flags, workchain, seqno, shard, file_size, Slice(file_hash, 32),
+                           Slice(root_hash, 32), Slice(last_bytes, 8));
+  }
+  bool operator==(const LogEventNewBlock& other) const {
+    return key() == other.key();
+  }
+  bool operator!=(const LogEventNewBlock& other) const {
+    return !(*this == other);
+  }
+};
+
+struct LogEventNewState {
+  static constexpr unsigned tag = 0x4190a21f;
+  unsigned tag_field;
+  unsigned flags;  // lower 8 bits = authority
+  int workchain;
+  unsigned seqno;
+  unsigned long long shard;
+  long long file_size;
+  unsigned char file_hash[32];
+  unsigned char root_hash[32];
+  unsigned char last_bytes[8];
+  LogEventNewState() = default;
+  LogEventNewState(const BlockId& state, const RootHash& rhash, const FileHash& fhash, unsigned long long _fsize,
+                   unsigned _flags)
+      : tag_field(tag)
+      , flags(_flags)
+      , workchain(state.workchain)
+      , seqno(state.seqno)
+      , shard(state.shard)
+      , file_size(_fsize) {
+    td::as<FileHash>(file_hash) = fhash;
+    td::as<RootHash>(root_hash) = rhash;
+    td::as<unsigned long long>(last_bytes) = 0;
+  }
+  static Result<int64> parse(Slice data, LogEventNewState* res) {
+    return memcpy_parse(data, res);
+  }
+  int64 serialize(MutableSlice data) const {
+    return memcpy_serialize(data, *this);
+  }
+  auto key() const {
+    return std::make_tuple(tag_field, flags, workchain, seqno, shard, file_size, Slice(file_hash, 32),
+                           Slice(root_hash, 32), Slice(last_bytes, 8));
+  }
+  bool operator==(const LogEventNewState& other) const {
+    return key() == other.key();
+  }
+  bool operator!=(const LogEventNewState& other) const {
+    return !(*this == other);
+  }
+};
+#pragma pack(pop)
+
+struct LogEventString {
+  static constexpr unsigned tag = 0xabcdabcd;
+
+  std::string data;
+
+  bool operator==(const LogEventString& other) const {
+    return data == other.data;
+  }
+  bool operator!=(const LogEventString& other) const {
+    return !(*this == other);
+  }
+
+  int64 serialize(MutableSlice dest) const {
+    size_t need_size = 8 + data.size();
+    if (dest.size() < need_size) {
+      return -static_cast<int64>(need_size);
+    }
+    dest.truncate(need_size);
+    td::as<unsigned>(dest.data()) = tag;
+    td::as<int>(dest.data() + 4) = td::narrow_cast<int>(data.size());
+    dest.substr(8).copy_from(data);
+    return dest.size();
+  }
+
+  static Result<int64> parse(Slice data, LogEventString* res) {
+    if (data.size() < 4) {
+      return -4;
+    }
+    unsigned got_tag = td::as<unsigned>(data.data());
+    if (got_tag != tag) {
+      return Status::Error(PSLICE() << "tag mismatch " << td::format::as_hex(got_tag));
+    }
+    data = data.substr(4);
+    if (data.size() < 4) {
+      return -8;
+    }
+    td::int64 length = td::as<td::uint32>(data.data());
+    data = data.substr(4);
+    if (static_cast<int64>(data.size()) < length) {
+      return -length - 8;
+    }
+    res->data = data.substr(0, td::narrow_cast<std::size_t>(length)).str();
+    return length + 8;
+  }
+};
+
+struct LogEvent {
+  td::Variant<LogEventCrc32C, LogEventStart, LogEventString, LogEventNewBlock, LogEventNewState, LogEventSetZeroState>
+      event_{LogEventStart{}};
+
+  bool operator==(const LogEvent& other) const {
+    return event_ == other.event_;
+  }
+  bool operator!=(const LogEvent& other) const {
+    return !(*this == other);
+  }
+
+  LogEvent() = default;
+  LogEvent(LogEvent&& other) = default;
+  template <class T>
+  LogEvent(T&& e) : event_(std::forward<T>(e)) {
+  }
+
+  int64 serialize(MutableSlice data) const {
+    int64 res;
+    event_.visit([&](auto& e) { res = e.serialize(data); });
+    return res;
+  }
+
+  static Result<int64> parse(Slice data, LogEvent* res) {
+    if (data.size() < 4) {
+      return -4;
+    }
+    //LOG(ERROR) << td::format::as_hex_dump<4>(data);
+    unsigned got_tag = td::as<unsigned>(data.data());
+    switch (got_tag) {
+      case LogEventCrc32C::tag: {
+        LogEventCrc32C e;
+        TRY_RESULT(x, e.parse(data, &e));
+        if (x >= 0) {
+          res->event_ = e;
+        }
+        return x;
+      }
+      case LogEventStart::tag: {
+        LogEventStart e;
+        TRY_RESULT(x, e.parse(data, &e));
+        if (x >= 0) {
+          res->event_ = e;
+        }
+        return x;
+      }
+      case LogEventSetZeroState::tag: {
+        LogEventSetZeroState e;
+        TRY_RESULT(x, e.parse(data, &e));
+        if (x >= 0) {
+          res->event_ = e;
+        }
+        return x;
+      }
+      case LogEventNewBlock::tag: {
+        LogEventNewBlock e;
+        TRY_RESULT(x, e.parse(data, &e));
+        if (x >= 0) {
+          res->event_ = e;
+        }
+        return x;
+      }
+      case LogEventNewState::tag: {
+        LogEventNewState e;
+        TRY_RESULT(x, e.parse(data, &e));
+        if (x >= 0) {
+          res->event_ = e;
+        }
+        return x;
+      }
+      case LogEventString::tag: {
+        LogEventString e;
+        TRY_RESULT(x, e.parse(data, &e));
+        if (x >= 0) {
+          res->event_ = e;
+        }
+        return x;
+      }
+      default:
+        return Status::Error(PSLICE() << "Unknown tag: " << td::format::as_hex(got_tag));
+    }
+  }
+};
+
+static td::CSlice test_binlog_path("test.binlog");
+
+class BinlogReader : public td::BinlogReaderInterface {
+ public:
+  td::Span<LogEvent> logevents() const {
+    return logevents_;
+  }
+
+  td::Result<td::int64> parse(td::Slice data) override {
+    if (data.size() < 4) {
+      return -4;
+    }
+    LogEvent res;
+    TRY_RESULT(size, res.parse(data, &res));
+    if (size > 0) {
+      if (res.event_.get_offset() == res.event_.offset<LogEventCrc32C>()) {
+        auto crc = res.event_.get<LogEventCrc32C>().crc32c;
+        flush_crc();
+        if (crc != crc_) {
+          return Status::Error("Crc mismatch");
+        }
+      } else {
+        logevents_.emplace_back(std::move(res));
+      }
+      lazy_crc_extend(data.substr(0, td::narrow_cast<std::size_t>(size)));
+    }
+    return size;
+  }
+
+  td::uint32 crc32c() {
+    flush_crc();
+    return crc_;
+  }
+
+  void flush() override {
+    flush_crc();
+  }
+
+ private:
+  std::vector<LogEvent> logevents_;
+  td::uint32 crc_{0};
+  td::Slice suffix_;
+
+  void flush_crc() {
+    crc_ = td::crc32c_extend(crc_, suffix_);
+    suffix_ = Slice();
+  }
+  void lazy_crc_extend(Slice slice) {
+    if (suffix_.empty()) {
+      suffix_ = slice;
+      return;
+    }
+    if (suffix_.end() == slice.begin()) {
+      suffix_ = Slice(suffix_.begin(), slice.end());
+      return;
+    }
+    flush_crc();
+    suffix_ = slice;
+  }
+};
+
+class RandomBinlog {
+ public:
+  RandomBinlog() {
+    size_t logevent_count = 1000;
+    for (size_t i = 0; i < logevent_count; i++) {
+      add_logevent(create_random_logevent());
+    }
+  }
+
+  Slice data() const {
+    return data_;
+  }
+  td::Span<LogEvent> logevents() const {
+    return logevents_;
+  }
+
+ private:
+  std::vector<LogEvent> logevents_;
+  std::string data_;
+
+  template <class T>
+  void add_logevent(T event) {
+    int64 size = -event.serialize({});
+    std::string data(td::narrow_cast<std::size_t>(size), '\0');
+    int64 new_size = event.serialize(data);
+    CHECK(new_size == size);
+    data_ += data;
+    logevents_.emplace_back(std::move(event));
+  }
+
+  LogEvent create_random_logevent() {
+    auto rand_uint256 = [] {
+      td::UInt256 res;
+      td::Random::secure_bytes(as_slice(res));
+      return res;
+    };
+    auto rand_block_id = [] {
+      BlockId res;
+      res.workchain = td::Random::fast(0, 100);
+      res.shard = td::Random::fast(0, 100);
+      res.seqno = td::Random::fast(0, 100);
+      return res;
+    };
+
+    auto type = td::Random::fast(0, 4);
+    switch (type) {
+      case 0: {
+        auto size = td::Random::fast(0, 10);
+        LogEventString event;
+        event.data = td::rand_string('a', 'z', size);
+        return event;
+      }
+      case 1: {
+        return LogEventStart(rand_uint256(), 12);
+      }
+      case 2: {
+        return LogEventSetZeroState(rand_uint256(), rand_uint256(), td::Random::fast(0, 1000),
+                                    td::Random::fast(0, 1000));
+      }
+      case 3: {
+        return LogEventNewBlock(rand_block_id(), rand_uint256(), rand_uint256(), 12, 17);
+      }
+      case 4: {
+        return LogEventNewState(rand_block_id(), rand_uint256(), rand_uint256(), 12, 17);
+      }
+    }
+    UNREACHABLE();
+  }
+};
+
+void test_binlog(td::Slice data, td::optional<td::Span<LogEvent>> events = {}) {
+  auto splitted_binlog = td::rand_split(data);
+
+  std::string new_binlog_data;
+
+  BinlogReader reader;
+  td::BinlogReaderHelper reader_impl;
+  for (auto& chunk : splitted_binlog) {
+    reader_impl.parse(reader, chunk).ensure();
+  }
+
+  //Binlog write sync
+  {
+    td::Binlog::destroy(test_binlog_path);
+    td::BinlogWriter binlog_writer(test_binlog_path.str());
+    binlog_writer.open().ensure();
+
+    BinlogReader new_reader;
+    size_t i = 0;
+    for (auto& logevent : reader.logevents()) {
+      binlog_writer.write_event(logevent, &new_reader).ensure();
+      i++;
+      if (i % 10 == 0) {
+        binlog_writer.write_event(LogEvent(LogEventCrc32C(new_reader.crc32c())), &new_reader).ensure();
+      }
+    }
+    binlog_writer.sync();
+    binlog_writer.close().ensure();
+
+    auto file_data = read_file(test_binlog_path).move_as_ok();
+    ASSERT_TRUE(reader.logevents() == new_reader.logevents());
+    new_binlog_data = file_data.as_slice().str();
+    data = new_binlog_data;
+    //ASSERT_EQ(data, file_data);
+  }
+
+  //Binlog write async
+  {
+    td::Binlog::destroy(test_binlog_path);
+    td::BinlogWriterAsync binlog_writer(test_binlog_path.str());
+
+    td::actor::Scheduler scheduler({2});
+
+    BinlogReader new_reader;
+    scheduler.run_in_context([&]() mutable {
+      binlog_writer.open().ensure();
+      for (auto& logevent : reader.logevents()) {
+        binlog_writer.write_event(logevent, &new_reader).ensure();
+      }
+      binlog_writer.sync([&](Result<td::Unit> res) {
+        res.ensure();
+        binlog_writer.close([&](Result<td::Unit> res) {
+          res.ensure();
+          td::actor::SchedulerContext::get()->stop();
+        });
+      });
+    });
+
+    scheduler.run();
+    scheduler.stop();
+
+    auto file_data = read_file(test_binlog_path).move_as_ok();
+    ASSERT_TRUE(reader.logevents() == new_reader.logevents());
+    //ASSERT_EQ(data, file_data);
+  }
+
+  ASSERT_TRUE(!events || events.value() == reader.logevents());
+
+  std::string new_data;
+  for (auto& event : reader.logevents()) {
+    int64 size = -event.serialize({});
+    std::string event_data(td::narrow_cast<std::size_t>(size), '\0');
+    int64 new_size = event.serialize(event_data);
+    CHECK(new_size == size);
+    new_data += event_data;
+  }
+  //ASSERT_EQ(data, new_data);
+
+  // Binlog::read_sync
+  {
+    td::CSlice path("test.binlog");
+    td::Binlog::destroy(path);
+    td::write_file(path, data).ensure();
+
+    td::Binlog binlog(path.str());
+    BinlogReader binlog_reader;
+    binlog.replay_sync(binlog_reader).ensure();
+
+    ASSERT_EQ(reader.logevents().size(), binlog_reader.logevents().size());
+    ASSERT_TRUE(reader.logevents() == binlog_reader.logevents());
+  }
+
+  // Binlog::read_async
+  {
+    td::Binlog::destroy(test_binlog_path);
+    td::write_file(test_binlog_path, data).ensure();
+
+    td::Binlog binlog(test_binlog_path.str());
+    auto binlog_reader = std::make_shared<BinlogReader>();
+
+    td::actor::Scheduler scheduler({2});
+    scheduler.run_in_context([&]() mutable {
+      binlog.replay_async(binlog_reader, [](Result<td::Unit> res) {
+        res.ensure();
+        td::actor::SchedulerContext::get()->stop();
+      });
+    });
+
+    scheduler.run();
+    scheduler.stop();
+
+    ASSERT_EQ(reader.logevents().size(), binlog_reader->logevents().size());
+    ASSERT_TRUE(reader.logevents() == binlog_reader->logevents());
+  }
+}
+
+TEST(Binlog, Reader) {
+  RandomBinlog binlog;
+  test_binlog(binlog.data(), binlog.logevents());
+}
+
+TEST(Binlog, Hands) {
+  std::string binlog = td::base64_decode(
+                           "a0RCBAABKQCRMn1c2DaJhwrptxburpRtrWI2sjGhVbG29bFO0r8DDtAAExjZPKtjAAAAALwGAAAA"
+                           "AAAAFvJq3qfzFCDWap+LUrgBI8sWFayIOQSxkBjV3CWgizHYNomHCum3Fu6ulG2tYjayMaFVsbb1"
+                           "sU7SvwMO0AATGGO89BmAAAAA/////wEAAAAAAAAAAAAAgN4RAAAAAAAAa53L4ziGleZ7K+StAsBd"
+                           "txMxbHHfuB9SJRFp+BMzXfnGnt8TsgFnig7j/xVRjtIsYUVw0rQZJUC0sWQROj0SHvplIkBV9vMp")
+                           .move_as_ok();
+  test_binlog(binlog);
+}
+
+TEST(Buffers, CyclicBufferSimple) {
+  {
+    auto reader_writer = td::CyclicBuffer::create();
+    auto reader = std::move(reader_writer.first);
+    auto writer = std::move(reader_writer.second);
+
+    ASSERT_TRUE(!writer.is_reader_closed());
+    reader.close_reader(td::Status::Error(2));
+    ASSERT_TRUE(!reader.is_writer_closed());
+    ASSERT_TRUE(writer.is_reader_closed());
+    ASSERT_EQ(2, writer.reader_status().code());
+  }
+  {
+    auto reader_writer = td::CyclicBuffer::create();
+    auto reader = std::move(reader_writer.first);
+    auto writer = std::move(reader_writer.second);
+
+    ASSERT_TRUE(!reader.is_writer_closed());
+    writer.close_writer(td::Status::Error(2));
+    ASSERT_TRUE(!writer.is_reader_closed());
+    ASSERT_TRUE(reader.is_writer_closed());
+    ASSERT_EQ(2, reader.writer_status().code());
+  }
+  {
+    td::CyclicBuffer::Options options;
+    options.chunk_size = 14;
+    options.count = 10;
+    options.alignment = 7;
+    auto reader_writer = td::CyclicBuffer::create(options);
+    auto reader = std::move(reader_writer.first);
+    auto writer = std::move(reader_writer.second);
+
+    auto data = td::rand_string('a', 'z', 100001);
+    td::Slice write_slice = data;
+    td::Slice read_slice = data;
+    for (size_t i = 1; (int)i < options.count; i++) {
+      ASSERT_EQ((i - 1) * options.chunk_size, reader.reader_size());
+      ASSERT_EQ((i - 1) * options.chunk_size, writer.writer_size());
+      auto slice = writer.prepare_write();
+      ASSERT_EQ(0u, reinterpret_cast<td::uint64>(slice.data()) % options.alignment);
+      auto to_copy = write_slice;
+      to_copy.truncate(options.chunk_size);
+      slice.copy_from(to_copy);
+      write_slice = write_slice.substr(to_copy.size());
+      writer.confirm_write(to_copy.size());
+      ASSERT_EQ(i * options.chunk_size, reader.reader_size());
+      ASSERT_EQ(i * options.chunk_size, writer.writer_size());
+    }
+    bool is_writer_closed = false;
+    while (true) {
+      {
+        bool is_closed = reader.is_writer_closed();
+        auto slice = reader.prepare_read();
+        ASSERT_EQ(read_slice.substr(0, slice.size()), slice);
+        read_slice = read_slice.substr(slice.size());
+        reader.confirm_read(slice.size());
+        if (is_closed && slice.empty()) {
+          break;
+        }
+      }
+
+      if (!is_writer_closed) {
+        auto slice = writer.prepare_write();
+        auto to_copy = write_slice;
+        to_copy.truncate(options.chunk_size);
+        if (to_copy.empty()) {
+          writer.close_writer(td::Status::OK());
+          is_writer_closed = true;
+        } else {
+          slice.copy_from(to_copy);
+          write_slice = write_slice.substr(to_copy.size());
+          writer.confirm_write(to_copy.size());
+        }
+      }
+    }
+    ASSERT_EQ(0u, write_slice.size());
+    ASSERT_EQ(0u, read_slice.size());
+  }
+}
+
+TEST(Buffers, CyclicBuffer) {
+  for (int t = 0; t < 20; t++) {
+    td::CyclicBuffer::Options options;
+    options.chunk_size = 14;
+    options.count = 10;
+    options.alignment = 7;
+    auto reader_writer = td::CyclicBuffer::create(options);
+    auto reader = std::move(reader_writer.first);
+    auto writer = std::move(reader_writer.second);
+    auto data = td::rand_string('a', 'z', 100001);
+    auto chunks = td::rand_split(data);
+
+    size_t chunk_i = 0;
+    std::string res;
+    while (true) {
+      if (td::Random::fast(0, 1) == 0) {
+        bool is_closed = reader.is_writer_closed();
+        auto slice = reader.prepare_read();
+        res += slice.str();
+        reader.confirm_read(slice.size());
+        if (slice.empty() && is_closed) {
+          reader.writer_status().ensure();
+          break;
+        }
+      }
+      if (chunk_i < chunks.size() && td::Random::fast(0, 1) == 0) {
+        auto slice = writer.prepare_write();
+        auto from = Slice(chunks[chunk_i]);
+        auto copy = from.substr(0, slice.size());
+        slice.copy_from(copy);
+        writer.confirm_write(copy.size());
+        auto left = from.substr(copy.size());
+        if (!left.empty()) {
+          chunks[chunk_i] = left.str();
+        } else {
+          chunk_i++;
+          if (chunk_i == chunks.size()) {
+            writer.close_writer(td::Status::OK());
+          }
+        }
+      }
+    }
+    ASSERT_EQ(data, res);
+  }
+}
+
+TEST(Buffers, ChainBuffer) {
+  for (int t = 0; t < 20; t++) {
+    td::ChainBuffer::Options options;
+    options.chunk_size = 14;
+    auto reader_writer = td::ChainBuffer::create(options);
+    auto reader = std::move(reader_writer.first);
+    auto writer = std::move(reader_writer.second);
+    auto data = td::rand_string('a', 'z', 100001);
+    auto chunks = td::rand_split(data);
+
+    size_t chunk_i = 0;
+    std::string res;
+    while (true) {
+      if (td::Random::fast(0, 1) == 0) {
+        bool is_closed = reader.is_writer_closed();
+        Slice slice;
+        if (reader.reader_size() != 0) {
+          slice = reader.prepare_read();
+          res += slice.str();
+          reader.confirm_read(slice.size());
+        }
+        if (slice.empty() && is_closed) {
+          reader.writer_status().ensure();
+          break;
+        }
+      }
+      if (chunk_i < chunks.size() && td::Random::fast(0, 1) == 0) {
+        writer.append(chunks[chunk_i]);
+        chunk_i++;
+        if (chunk_i == chunks.size()) {
+          writer.close_writer(td::Status::OK());
+        }
+      }
+    }
+    ASSERT_EQ(data.size(), res.size());
+    ASSERT_EQ(data, res);
+  }
+}
diff --git a/submodules/ton/tonlib-src/tddb/test/io-bench.cpp b/submodules/ton/tonlib-src/tddb/test/io-bench.cpp
new file mode 100644
index 0000000000..7ce3e48703
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/test/io-bench.cpp
@@ -0,0 +1,685 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/OptionsParser.h"
+#include "td/utils/filesystem.h"
+#include "td/utils/port/FileFd.h"
+#include "td/utils/Timer.h"
+#include "td/utils/crypto.h"
+#include "td/utils/BufferedReader.h"
+#include "td/utils/optional.h"
+#include "td/actor/actor.h"
+
+#include "td/db/utils/StreamInterface.h"
+#include "td/db/utils/ChainBuffer.h"
+#include "td/db/utils/CyclicBuffer.h"
+#include "td/db/utils/FileSyncState.h"
+#include "td/db/utils/StreamToFileActor.h"
+#include "td/db/utils/FileToStreamActor.h"
+
+#include <cmath>
+
+namespace td {
+class AsyncCyclicBufferReader : public td::actor::Actor {
+ public:
+  class Callback {
+   public:
+    virtual ~Callback() {
+    }
+    virtual void want_more() = 0;
+    virtual Status process(Slice data) = 0;
+    virtual void on_closed(Status status) = 0;
+  };
+  AsyncCyclicBufferReader(CyclicBuffer::Reader reader, td::unique_ptr<Callback> callback)
+      : reader_(std::move(reader)), callback_(std::move(callback)) {
+  }
+
+ private:
+  CyclicBuffer::Reader reader_;
+  td::unique_ptr<Callback> callback_;
+
+  void loop() override {
+    while (true) {
+      auto data = reader_.prepare_read();
+      if (data.empty()) {
+        if (reader_.is_writer_closed()) {
+          callback_->on_closed(std::move(reader_.writer_status()));
+          return stop();
+        }
+        callback_->want_more();
+        return;
+      }
+      auto status = callback_->process(data);
+      if (status.is_error()) {
+        callback_->on_closed(std::move(status));
+      }
+      reader_.confirm_read(data.size());
+      //TODO: better condition for want_more. May be reader should decide if it is ready for more writes
+      callback_->want_more();
+    }
+  }
+};
+
+}  // namespace td
+
+class Processor {
+ public:
+  void process(td::Slice slice) {
+    res = crc32c_extend(res, slice);
+    res2 = crc32c_extend(res2, slice);
+  }
+  auto result() {
+    return res * res2;
+  }
+
+ private:
+  td::uint32 res{0};
+  td::uint32 res2{0};
+};
+
+void read_baseline(td::CSlice path) {
+  LOG(ERROR) << "BASELINE";
+  td::PerfWarningTimer timer("read file");
+  auto data = td::read_file(path).move_as_ok();
+  timer.reset();
+
+  td::PerfWarningTimer process_timer("process file", 0);
+  Processor processor;
+  processor.process(data.as_slice());
+  process_timer.reset();
+  LOG(ERROR) << processor.result();
+}
+
+void read_buffered(td::CSlice path, size_t buffer_size) {
+  LOG(ERROR) << "BufferedReader";
+  auto fd = td::FileFd::open(path, td::FileFd::Read).move_as_ok();
+  td::BufferedReader reader(fd, buffer_size);
+  std::vector<char> buf(buffer_size);
+  Processor processor;
+  while (true) {
+    auto slice = td::MutableSlice(&buf[0], buf.size());
+    auto size = reader.read(slice).move_as_ok();
+    if (size == 0) {
+      break;
+    }
+    processor.process(slice.truncate(size));
+  }
+  LOG(ERROR) << processor.result();
+}
+
+void read_async(td::CSlice path, size_t buffer_size) {
+  LOG(ERROR) << "Async";
+  auto fd = td::FileFd::open(path, td::FileFd::Read).move_as_ok();
+  td::actor::Scheduler scheduler({2});
+  scheduler.run_in_context([&] {
+    auto reader_writer = td::CyclicBuffer::create();
+    //TODO: hide actor
+    auto reader =
+        td::actor::create_actor<td::FileToStreamActor>("Reader", std::move(fd), std::move(reader_writer.second));
+    class Callback : public td::AsyncCyclicBufferReader::Callback {
+     public:
+      Callback(td::actor::ActorOwn<> reader) : reader_(std::move(reader)) {
+      }
+      void want_more() override {
+        td::actor::send_signals_later(reader_, td::actor::ActorSignals::wakeup());
+      }
+      td::Status process(td::Slice data) override {
+        processor.process(data);
+        return td::Status::OK();
+      }
+      void on_closed(td::Status status) override {
+        LOG(ERROR) << processor.result();
+        td::actor::SchedulerContext::get()->stop();
+      }
+
+     private:
+      td::actor::ActorOwn<> reader_;
+      Processor processor;
+    };
+    auto reader_copy = reader.get();
+    auto callback = td::make_unique<Callback>(std::move(reader));
+    auto processor = td::actor::create_actor<td::AsyncCyclicBufferReader>(
+        "BufferReader", std::move(reader_writer.first), std::move(callback));
+    class ReaderCallback : public td::FileToStreamActor::Callback {
+     public:
+      ReaderCallback(td::actor::ActorId<> actor) : actor_(std::move(actor)) {
+      }
+      void got_more() override {
+        td::actor::send_signals_later(actor_, td::actor::ActorSignals::wakeup());
+      }
+
+     private:
+      td::actor::ActorId<> actor_;
+    };
+    send_closure(reader_copy, &td::FileToStreamActor::set_callback,
+                 td::make_unique<ReaderCallback>(processor.release()));
+  });
+  scheduler.run();
+}
+
+static char o_direct_buf[100000000];
+void read_o_direct(td::CSlice path, size_t buffer_size) {
+  LOG(ERROR) << "Direct";
+  auto fd = td::FileFd::open(path, td::FileFd::Read | td::FileFd::Direct).move_as_ok();
+  size_t align = 4096;
+  auto *ptr =
+      reinterpret_cast<char *>((reinterpret_cast<std::uintptr_t>(o_direct_buf) + align - 1) & td::bits_negate64(align));
+
+  td::BufferedReader reader(fd, buffer_size);
+  Processor processor;
+  while (true) {
+    auto slice = td::MutableSlice(ptr, buffer_size);
+    auto size = reader.read(slice).move_as_ok();
+    if (size == 0) {
+      break;
+    }
+    processor.process(slice.truncate(size));
+  }
+  LOG(ERROR) << processor.result();
+}
+
+class DataGenerator {
+ public:
+  operator bool() const {
+    return generated_size < total_size;
+  }
+
+  td::string next() {
+    auto res = words_[2];
+    generated_size += res.size();
+    return res;
+  }
+
+ private:
+  std::vector<std::string> words_{"a", "fjdksalfdfs", std::string(20, 'b'), std::string(1000, 'a')};
+  size_t total_size = (1 << 20) * 600;
+  size_t generated_size = 0;
+};
+
+void write_baseline(td::CSlice path, size_t buffer_size) {
+  LOG(ERROR) << "Baseline";
+  auto fd = td::FileFd::open(path, td::FileFd::Flags::Create | td::FileFd::Flags::Truncate | td::FileFd::Flags::Write)
+                .move_as_ok();
+  std::vector<char> buf(buffer_size);
+
+  DataGenerator generator;
+  while (generator) {
+    auto slice = generator.next();
+    fd.write(slice).ensure();
+  }
+  fd.sync().ensure();
+}
+void write_buffered(td::CSlice path, size_t buffer_size) {
+  LOG(ERROR) << "Buffered";
+  auto fd = td::FileFd::open(path, td::FileFd::Flags::Create | td::FileFd::Flags::Truncate | td::FileFd::Flags::Write)
+                .move_as_ok();
+  std::vector<char> buf(buffer_size);
+  size_t data_size{0};
+
+  auto flush = [&]() {
+    auto slice = td::Slice(buf.data(), data_size);
+    fd.write(slice).ensure();
+    //auto io_slice = as_io_slice(slice);
+    //fd.writev({&io_slice, 1}).ensure();
+    data_size = 0;
+  };
+  auto append = [&](td::Slice slice) {
+    if (data_size + slice.size() > buffer_size) {
+      flush();
+    }
+
+    td::MutableSlice(buf.data(), buffer_size).substr(data_size).copy_from(slice);
+    data_size += slice.size();
+  };
+
+  DataGenerator generator;
+  while (generator) {
+    auto slice = generator.next();
+    append(slice);
+  }
+  flush();
+  fd.sync().ensure();
+}
+
+namespace td {
+
+class FileWriter {
+ public:
+  FileWriter(FileFd fd, size_t buffer_size) : fd_(std::move(fd)), raw_buffer_(buffer_size) {
+    reset();
+    buffer_slices_.reserve(1024);
+    strings_.reserve(1024);
+    ios_slices_.reserve(1024);
+  }
+
+  void append(std::string data) {
+    cached_size_ += data.size();
+    if (data.size() <= max_copy_size) {
+      append_copy(data);
+    } else {
+      CHECK(strings_.size() < strings_.capacity());
+      strings_.push_back(std::move(data));
+      ios_slices_.push_back(as_io_slice(strings_.back()));
+      should_merge_ = false;
+    }
+    try_flush();
+  }
+
+  void append(BufferSlice data) {
+    cached_size_ += data.size();
+    if (data.size() <= max_copy_size) {
+      append_copy(data);
+    } else {
+      buffer_slices_.push_back(std::move(data));
+      ios_slices_.push_back(as_io_slice(strings_.back()));
+      should_merge_ = false;
+    }
+    try_flush();
+  }
+
+  void append(Slice data) {
+    if (data.size() <= max_copy_size) {
+      append_copy(data);
+      try_flush();
+    } else if (data.size() > min_immediate_write_size) {
+      ios_slices_.push_back(as_io_slice(data));
+      flush();
+    } else {
+      append(BufferSlice(data));
+    }
+  }
+
+  void flush() {
+    if (ios_slices_.empty()) {
+      return;
+    }
+    flushed_size_ += cached_size_;
+    fd_.writev(ios_slices_).ensure();
+    reset();
+  }
+
+  void sync() {
+    flush();
+    synced_size_ = flushed_size_;
+    fd_.sync().ensure();
+  }
+
+  bool may_flush() const {
+    return cached_size_ != 0;
+  }
+  size_t total_size() const {
+    return flushed_size() + cached_size_;
+  }
+  size_t flushed_size() const {
+    return flushed_size_;
+  }
+  size_t synced_size() const {
+    return synced_size_;
+  }
+
+ private:
+  static constexpr size_t max_cached_size = 256 * (1 << 10);
+  static constexpr size_t min_immediate_write_size = 32 * (1 << 10);
+
+  FileFd fd_;
+
+  std::vector<char> raw_buffer_;
+  size_t max_copy_size = min(raw_buffer_.size() / 8, size_t(4096u));
+  MutableSlice buffer_;
+  bool should_merge_ = false;
+
+  std::vector<BufferSlice> buffer_slices_;
+  std::vector<std::string> strings_;
+  std::vector<IoSlice> ios_slices_;
+  size_t cached_size_{0};
+  size_t flushed_size_{0};
+  size_t synced_size_{0};
+
+  void append_copy(Slice data) {
+    buffer_.copy_from(data);
+    if (should_merge_) {
+      auto back = as_slice(ios_slices_.back());
+      back = Slice(back.data(), back.size() + data.size());
+      ios_slices_.back() = as_io_slice(back);
+    } else {
+      ios_slices_.push_back(as_io_slice(buffer_.substr(0, data.size())));
+      should_merge_ = true;
+    }
+    buffer_ = buffer_.substr(data.size());
+  }
+
+  void reset() {
+    buffer_ = MutableSlice(raw_buffer_.data(), raw_buffer_.size());
+    buffer_slices_.clear();
+    strings_.clear();
+    ios_slices_.clear();
+    should_merge_ = false;
+    cached_size_ = 0;
+  }
+
+  bool must_flush() const {
+    return buffer_.size() < max_copy_size || ios_slices_.size() == ios_slices_.capacity() ||
+           cached_size_ >= max_cached_size;
+  }
+  void try_flush() {
+    if (!must_flush()) {
+      return;
+    }
+    flush();
+  }
+};
+
+class AsyncFileWriterActor : public actor::Actor {
+ public:
+  AsyncFileWriterActor(FileSyncState::Reader state) : state_(std::move(state)) {
+    io_slices_.reserve(100);
+  }
+
+ private:
+  FileFd fd_;
+  ChainBufferReader reader_;
+  FileSyncState::Reader state_;
+  std::vector<IoSlice> io_slices_;
+
+  size_t flushed_size_{0};
+  size_t synced_size_{0};
+
+  void flush() {
+    reader_.sync_with_writer();
+    while (!reader_.empty()) {
+      auto it = reader_.clone();
+      size_t io_slices_size = 0;
+      while (!it.empty() && io_slices_.size() < io_slices_.capacity()) {
+        auto slice = it.prepare_read();
+        io_slices_.push_back(as_io_slice(slice));
+        io_slices_size += slice.size();
+        it.confirm_read(slice.size());
+      }
+      if (!io_slices_.empty()) {
+        auto r_written = fd_.writev(io_slices_);
+        LOG_IF(FATAL, r_written.is_error()) << r_written.error();
+        auto written = r_written.move_as_ok();
+        CHECK(written == io_slices_size);
+        flushed_size_ += written;
+        io_slices_.clear();
+      }
+      reader_ = std::move(it);
+    }
+  }
+
+  void loop() override {
+    reader_.sync_with_writer();
+    flush();
+  }
+};
+
+}  // namespace td
+
+void write_vector(td::CSlice path, size_t buffer_size) {
+  LOG(ERROR) << "io vector";
+  auto fd = td::FileFd::open(path, td::FileFd::Flags::Create | td::FileFd::Flags::Truncate | td::FileFd::Flags::Write)
+                .move_as_ok();
+  td::FileWriter writer(std::move(fd), buffer_size);
+
+  DataGenerator generator;
+  while (generator) {
+    auto slice = generator.next();
+    writer.append(std::move(slice));
+  }
+  writer.sync();
+}
+
+void write_async(td::CSlice path, size_t buffer_size) {
+  LOG(ERROR) << "Async";
+  auto fd = td::FileFd::open(path, td::FileFd::Flags::Create | td::FileFd::Flags::Truncate | td::FileFd::Flags::Write)
+                .move_as_ok();
+  td::actor::Scheduler scheduler({1});
+  scheduler.run_in_context([&] {
+    class Writer : public td::actor::Actor {
+     public:
+      Writer(td::FileFd fd, size_t buffer_size) : fd_(std::move(fd)), buffer_size_(buffer_size) {
+      }
+      class Callback : public td::StreamToFileActor::Callback {
+       public:
+        Callback(td::actor::ActorShared<> parent) : parent_(std::move(parent)) {
+        }
+        void on_sync_state_changed() override {
+          td::actor::send_signals_later(parent_, td::actor::ActorSignals::wakeup());
+        }
+
+       private:
+        td::actor::ActorShared<> parent_;
+      };
+
+      void start_up() override {
+        auto buffer_reader_writer = td::ChainBuffer::create();
+        buffer_writer_ = std::move(buffer_reader_writer.second);
+        auto buffer_reader = std::move(buffer_reader_writer.first);
+
+        auto sync_state_reader_writer = td::FileSyncState::create();
+        fd_sync_state_ = std::move(sync_state_reader_writer.first);
+        auto sync_state_writer = std::move(sync_state_reader_writer.second);
+        auto options = td::StreamToFileActor::Options{};
+        writer_ = td::actor::create_actor<td::StreamToFileActor>(td::actor::ActorOptions().with_name("FileWriterActor"),
+                                                                 std::move(buffer_reader), std::move(fd_),
+                                                                 std::move(sync_state_writer), options);
+        send_closure(writer_, &td::StreamToFileActor::set_callback, td::make_unique<Callback>(actor_shared(this)));
+        loop();
+      }
+
+     private:
+      td::FileFd fd_;
+      td::optional<td::ChainBuffer::Writer> buffer_writer_;
+      td::optional<td::FileSyncState::Reader> fd_sync_state_;
+      td::actor::ActorOwn<td::StreamToFileActor> writer_;
+      size_t buffer_size_;
+      DataGenerator generator_;
+      size_t total_size_{0};
+      bool was_sync_{false};
+
+      void loop() override {
+        auto flushed_size = fd_sync_state_.value().flushed_size();
+        while (generator_ && total_size_ < flushed_size + buffer_size_ * 10) {
+          auto str = generator_.next();
+          total_size_ += str.size();
+          buffer_writer_.value().append(str);
+        }
+        td::actor::send_signals_later(writer_, td::actor::ActorSignals::wakeup());
+        if (generator_) {
+          return;
+        } else if (!was_sync_) {
+          was_sync_ = true;
+          fd_sync_state_.value().set_requested_sync_size(total_size_);
+          td::actor::send_signals_later(writer_, td::actor::ActorSignals::wakeup());
+        }
+        if (fd_sync_state_.value().synced_size() == total_size_) {
+          writer_.reset();
+        }
+      }
+      void hangup_shared() override {
+        td::actor::SchedulerContext::get()->stop();
+        stop();
+      }
+    };
+    td::actor::create_actor<Writer>("Writer", std::move(fd), buffer_size).release();
+  });
+  scheduler.run();
+}
+
+void write_async2(td::CSlice path, size_t buffer_size) {
+  LOG(ERROR) << "Async2";
+  auto fd = td::FileFd::open(path, td::FileFd::Flags::Create | td::FileFd::Flags::Truncate | td::FileFd::Flags::Write)
+                .move_as_ok();
+  td::actor::Scheduler scheduler({1});
+  scheduler.run_in_context([&] {
+    class Worker : public td::actor::Actor {
+     public:
+      Worker(td::FileFd fd, td::ChainBufferReader reader, td::actor::ActorShared<> parent)
+          : fd_(std::move(fd)), reader_(std::move(reader)), parent_(std::move(parent)) {
+      }
+
+     private:
+      td::FileFd fd_;
+      td::ChainBufferReader reader_;
+      td::actor::ActorShared<> parent_;
+      void loop() override {
+        reader_.sync_with_writer();
+        while (!reader_.empty()) {
+          auto slice = reader_.prepare_read();
+          fd_.write(slice).ensure();
+          reader_.confirm_read(slice.size());
+        }
+      }
+      void hangup() override {
+        loop();
+        fd_.sync().ensure();
+        stop();
+      }
+    };
+    class Writer : public td::actor::Actor {
+     public:
+      Writer(td::FileFd fd) : fd_(std::move(fd)) {
+      }
+
+     private:
+      td::FileFd fd_;
+      td::actor::ActorOwn<> worker_;
+      td::ChainBufferWriter writer_;
+      DataGenerator generator_;
+
+      void start_up() override {
+        worker_ =
+            td::actor::create_actor<Worker>("Worker", std::move(fd_), writer_.extract_reader(), actor_shared(this));
+        while (generator_) {
+          writer_.append(generator_.next(), 65536);
+          send_signals_later(worker_, td::actor::ActorSignals::wakeup());
+        }
+        worker_.reset();
+      }
+      void hangup_shared() override {
+        td::actor::SchedulerContext::get()->stop();
+        stop();
+      }
+    };
+    td::actor::create_actor<Writer>(td::actor::ActorOptions().with_name("Writer").with_poll(), std::move(fd)).release();
+  });
+  scheduler.run();
+}
+
+int main(int argc, char **argv) {
+  std::string from;
+  enum Type { Read, Write };
+  Type type{Write};
+  enum Mode { Baseline, Buffered, Direct, Async, WriteV, Async2 };
+  Mode mode = Baseline;
+  size_t buffer_size = 1024;
+
+  td::OptionsParser options_parser;
+  options_parser.add_option('f', td::Slice("from"), td::Slice("read from file"), [&](td::Slice arg) -> td::Status {
+    from = arg.str();
+    return td::Status::OK();
+  });
+  options_parser.add_option('m', td::Slice("mode"), td::Slice("mode"), [&](td::Slice arg) -> td::Status {
+    TRY_RESULT(x, td::to_integer_safe<int>(arg));
+    switch (x) {
+      case 0:
+        mode = Baseline;
+        return td::Status::OK();
+      case 1:
+        mode = Buffered;
+        return td::Status::OK();
+      case 2:
+        mode = Direct;
+        return td::Status::OK();
+      case 3:
+        mode = Async;
+        return td::Status::OK();
+      case 4:
+        mode = WriteV;
+        return td::Status::OK();
+      case 5:
+        mode = Async2;
+        return td::Status::OK();
+    }
+    return td::Status::Error("unknown mode");
+  });
+  options_parser.add_option('b', td::Slice("buffer"), td::Slice("buffer size"), [&](td::Slice arg) -> td::Status {
+    TRY_RESULT(x, td::to_integer_safe<size_t>(arg));
+    buffer_size = x;
+    return td::Status::OK();
+  });
+
+  auto status = options_parser.run(argc, argv);
+  if (status.is_error()) {
+    LOG(ERROR) << status.error() << "\n" << options_parser;
+    return 0;
+  }
+
+  switch (type) {
+    case Read:
+      switch (mode) {
+        case Baseline:
+          read_baseline(from);
+          break;
+        case Buffered:
+          read_buffered(from, buffer_size);
+          break;
+        case Direct:
+          read_o_direct(from, buffer_size);
+          break;
+        case Async:
+          read_async(from, buffer_size);
+          break;
+        case Async2:
+        case WriteV:
+          LOG(FATAL) << "Not supported mode for Read test";
+      }
+      break;
+    case Write:
+      switch (mode) {
+        case Baseline:
+          write_baseline(from, buffer_size);
+          break;
+        case Buffered:
+          write_buffered(from, buffer_size);
+          break;
+        case WriteV:
+          write_vector(from, buffer_size);
+          break;
+        case Async:
+          write_async(from, buffer_size);
+          break;
+        case Async2:
+          write_async2(from, buffer_size);
+          break;
+        case Direct:
+          LOG(FATAL) << "Unimplemented";
+      }
+  }
+
+  return 0;
+}
diff --git a/submodules/ton/tonlib-src/tddb/test/key_value.cpp b/submodules/ton/tonlib-src/tddb/test/key_value.cpp
new file mode 100644
index 0000000000..550ccd2fad
--- /dev/null
+++ b/submodules/ton/tonlib-src/tddb/test/key_value.cpp
@@ -0,0 +1,245 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/tests.h"
+
+#include "td/db/KeyValueAsync.h"
+#include "td/db/KeyValue.h"
+#include "td/db/RocksDb.h"
+
+#include "td/utils/benchmark.h"
+#include "td/utils/buffer.h"
+#include "td/utils/optional.h"
+#include "td/utils/UInt.h"
+
+TEST(KeyValue, simple) {
+  td::Slice db_name = "testdb";
+  td::RocksDb::destroy(db_name).ignore();
+
+  std::unique_ptr<td::KeyValue> kv = std::make_unique<td::RocksDb>(td::RocksDb::open(db_name.str()).move_as_ok());
+  auto set_value = [&](td::Slice key, td::Slice value) { kv->set(key, value); };
+  auto ensure_value = [&](td::Slice key, td::Slice value) {
+    std::string kv_value;
+    auto status = kv->get(key, kv_value).move_as_ok();
+    ASSERT_EQ(td::int32(status), td::int32(td::KeyValue::GetStatus::Ok));
+    ASSERT_EQ(kv_value, value);
+  };
+  auto ensure_no_value = [&](td::Slice key) {
+    std::string kv_value;
+    auto status = kv->get(key, kv_value).move_as_ok();
+    ASSERT_EQ(td::int32(status), td::int32(td::KeyValue::GetStatus::NotFound));
+  };
+
+  ensure_no_value("A");
+  set_value("A", "HELLO");
+  ensure_value("A", "HELLO");
+
+  td::UInt128 x;
+  std::fill(as_slice(x).begin(), as_slice(x).end(), '1');
+  x.raw[5] = 0;
+  set_value(as_slice(x), as_slice(x));
+  ensure_value(as_slice(x), as_slice(x));
+
+  kv.reset();
+  kv = std::make_unique<td::RocksDb>(td::RocksDb::open(db_name.str()).move_as_ok());
+  ensure_value("A", "HELLO");
+  ensure_value(as_slice(x), as_slice(x));
+};
+
+TEST(KeyValue, async_simple) {
+  td::Slice db_name = "testdb";
+  td::RocksDb::destroy(db_name).ignore();
+
+  td::actor::Scheduler scheduler({6});
+  auto watcher = td::create_shared_destructor([] { td::actor::SchedulerContext::get()->stop(); });
+
+  class Worker : public td::actor::Actor {
+   public:
+    Worker(std::shared_ptr<td::Destructor> watcher, std::string db_name)
+        : watcher_(std::move(watcher)), db_name_(std::move(db_name)) {
+    }
+    void start_up() override {
+      loop();
+    }
+    void tear_down() override {
+    }
+    void loop() override {
+      if (!kv_) {
+        kv_ = td::KeyValueAsync<td::UInt128, td::BufferSlice>(
+            std::make_unique<td::RocksDb>(td::RocksDb::open(db_name_).move_as_ok()));
+        set_start_at_ = td::Timestamp::now();
+      }
+      if (next_set_ && next_set_.is_in_past()) {
+        for (size_t i = 0; i < 10 && left_cnt_ > 0; i++, left_cnt_--) {
+          do_set();
+        }
+        if (left_cnt_ > 0) {
+          next_set_ = td::Timestamp::in(0.001);
+          alarm_timestamp() = next_set_;
+        } else {
+          next_set_ = td::Timestamp::never();
+          set_finish_at_ = td::Timestamp::now();
+        }
+      }
+    }
+
+   private:
+    std::shared_ptr<td::Destructor> watcher_;
+    td::optional<td::KeyValueAsync<td::UInt128, td::BufferSlice>> kv_;
+    std::string db_name_;
+    int left_cnt_ = 10000;
+    int pending_cnt_ = left_cnt_;
+    td::Timestamp next_set_ = td::Timestamp::now();
+    td::Timestamp set_start_at_;
+    td::Timestamp set_finish_at_;
+
+    void do_set() {
+      td::UInt128 key;
+      td::Random::secure_bytes(as_slice(key));
+      td::BufferSlice data(1024);
+      td::Random::secure_bytes(as_slice(data));
+      kv_.value().set(key, std::move(data), [actor_id = actor_id(this)](td::Result<td::Unit> res) {
+        res.ensure();
+        send_closure(actor_id, &Worker::on_stored);
+      });
+    }
+
+    void on_stored() {
+      pending_cnt_--;
+      if (pending_cnt_ == 0) {
+        auto now = td::Timestamp::now();
+        LOG(ERROR) << (now.at() - set_finish_at_.at());
+        LOG(ERROR) << (set_finish_at_.at() - set_start_at_.at());
+        stop();
+      }
+    }
+  };
+
+  scheduler.run_in_context([watcher = std::move(watcher), &db_name]() mutable {
+    td::actor::create_actor<Worker>("Worker", watcher, db_name.str()).release();
+    watcher.reset();
+  });
+
+  scheduler.run();
+};
+
+class KeyValueBenchmark : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "kv transation benchmark";
+  }
+
+  void start_up() override {
+    td::RocksDb::destroy("ttt");
+    db_ = td::RocksDb::open("ttt").move_as_ok();
+  }
+  void tear_down() override {
+    db_ = {};
+  }
+  void run(int n) override {
+    for (int i = 0; i < n; i++) {
+      db_.value().begin_transaction();
+      db_.value().set(PSLICE() << i, PSLICE() << i);
+      db_.value().commit_transaction();
+    }
+  }
+
+ private:
+  td::optional<td::RocksDb> db_;
+};
+
+TEST(KeyValue, Bench) {
+  td::bench(KeyValueBenchmark());
+}
+
+TEST(KeyValue, Stress) {
+  return;
+  td::Slice db_name = "testdb";
+  td::RocksDb::destroy(db_name).ignore();
+
+  td::actor::Scheduler scheduler({6});
+  auto watcher = td::create_shared_destructor([] { td::actor::SchedulerContext::get()->stop(); });
+
+  class Worker : public td::actor::Actor {
+   public:
+    Worker(std::shared_ptr<td::Destructor> watcher, std::string db_name)
+        : watcher_(std::move(watcher)), db_name_(std::move(db_name)) {
+    }
+    void start_up() override {
+      loop();
+    }
+    void tear_down() override {
+    }
+    void loop() override {
+      if (!kv_) {
+        kv_ = td::KeyValueAsync<td::UInt128, td::BufferSlice>(
+            std::make_unique<td::RocksDb>(td::RocksDb::open(db_name_).move_as_ok()));
+        set_start_at_ = td::Timestamp::now();
+      }
+      if (next_set_ && next_set_.is_in_past()) {
+        for (size_t i = 0; i < 10 && left_cnt_ > 0; i++, left_cnt_--) {
+          do_set();
+        }
+        if (left_cnt_ > 0) {
+          next_set_ = td::Timestamp::in(0.01);
+          alarm_timestamp() = next_set_;
+        } else {
+          next_set_ = td::Timestamp::never();
+          set_finish_at_ = td::Timestamp::now();
+        }
+      }
+    }
+
+   private:
+    std::shared_ptr<td::Destructor> watcher_;
+    td::optional<td::KeyValueAsync<td::UInt128, td::BufferSlice>> kv_;
+    std::string db_name_;
+    int left_cnt_ = 1000000000;
+    int pending_cnt_ = left_cnt_;
+    td::Timestamp next_set_ = td::Timestamp::now();
+    td::Timestamp set_start_at_;
+    td::Timestamp set_finish_at_;
+
+    void do_set() {
+      td::UInt128 key = td::UInt128::zero();
+      td::Random::secure_bytes(as_slice(key).substr(0, 1));
+      td::BufferSlice data(1024);
+      td::Random::secure_bytes(as_slice(data));
+      kv_.value().set(key, std::move(data), [actor_id = actor_id(this)](td::Result<td::Unit> res) {
+        res.ensure();
+        send_closure(actor_id, &Worker::on_stored);
+      });
+    }
+
+    void on_stored() {
+      pending_cnt_--;
+      if (pending_cnt_ == 0) {
+        auto now = td::Timestamp::now();
+        LOG(ERROR) << (now.at() - set_finish_at_.at());
+        LOG(ERROR) << (set_finish_at_.at() - set_start_at_.at());
+        stop();
+      }
+    }
+  };
+  scheduler.run_in_context([watcher = std::move(watcher), &db_name]() mutable {
+    td::actor::create_actor<Worker>("Worker", watcher, db_name.str()).release();
+    watcher.reset();
+  });
+
+  scheduler.run();
+}
diff --git a/submodules/ton/tonlib-src/tdnet/CMakeLists.txt b/submodules/ton/tonlib-src/tdnet/CMakeLists.txt
new file mode 100644
index 0000000000..d5ae7086b6
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdnet/CMakeLists.txt
@@ -0,0 +1,26 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+set(TDNET_SOURCE
+  td/net/FdListener.cpp
+  td/net/TcpListener.cpp
+  td/net/UdpServer.cpp
+
+  td/net/FdListener.h
+  td/net/TcpListener.h
+  td/net/UdpServer.h
+)
+
+add_library(tdnet STATIC ${TDNET_SOURCE})
+target_include_directories(tdnet PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+target_link_libraries(tdnet PUBLIC tdactor)
+
+add_executable(tcp_ping_pong example/tcp_ping_pong.cpp)
+target_link_libraries(tcp_ping_pong PRIVATE tdactor tdnet)
+
+add_executable(udp_ping_pong example/udp_ping_pong.cpp)
+target_link_libraries(udp_ping_pong PRIVATE tdactor tdnet)
+
+set(NET_TEST_SOURCE
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/net-test.cpp
+  PARENT_SCOPE
+)
diff --git a/submodules/ton/tonlib-src/tdnet/example/tcp_ping_pong.cpp b/submodules/ton/tonlib-src/tdnet/example/tcp_ping_pong.cpp
new file mode 100644
index 0000000000..7cbfe25393
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdnet/example/tcp_ping_pong.cpp
@@ -0,0 +1,153 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/actor/actor.h"
+
+#include "td/utils/BufferedFd.h"
+#include "td/utils/OptionsParser.h"
+#include "td/utils/port/SocketFd.h"
+#include "td/utils/port/ServerSocketFd.h"
+#include "td/utils/Observer.h"
+
+#include "td/net/TcpListener.h"
+
+class PingClient : public td::actor::Actor, td::ObserverBase {
+ public:
+  PingClient(td::SocketFd fd) : buffered_fd_(std::move(fd)) {
+  }
+
+ private:
+  td::BufferedFd<td::SocketFd> buffered_fd_;
+  td::actor::ActorId<PingClient> self_;
+  void notify() override {
+    // NB: Interface will be changed
+    send_closure_later(self_, &PingClient::on_net);
+  }
+  void on_net() {
+    loop();
+  }
+
+  void start_up() override {
+    self_ = actor_id(this);
+    LOG(INFO) << "Start";
+    // Subscribe for socket updates
+    // NB: Interface will be changed
+    td::actor::SchedulerContext::get()->get_poll().subscribe(buffered_fd_.get_poll_info().extract_pollable_fd(this),
+                                                             td::PollFlags::ReadWrite());
+
+    alarm_timestamp() = td::Timestamp::now();
+  }
+
+  void tear_down() override {
+    LOG(INFO) << "Close";
+    // unsubscribe from socket updates
+    // nb: interface will be changed
+    td::actor::SchedulerContext::get()->get_poll().unsubscribe(buffered_fd_.get_poll_info().get_pollable_fd_ref());
+  }
+
+  void loop() override {
+    auto status = [&] {
+      TRY_STATUS(buffered_fd_.flush_read());
+      auto &input = buffered_fd_.input_buffer();
+      while (input.size() >= 12) {
+        auto query = input.cut_head(12).move_as_buffer_slice();
+        LOG(INFO) << "Got query " << td::format::escaped(query.as_slice());
+        if (query[5] == 'i') {
+          LOG(INFO) << "Send ping";
+          buffered_fd_.output_buffer().append("magkpongpong");
+        } else {
+          LOG(INFO) << "Got pong";
+        }
+      }
+
+      TRY_STATUS(buffered_fd_.flush_write());
+      if (td::can_close(buffered_fd_)) {
+        stop();
+      }
+      return td::Status::OK();
+    }();
+    if (status.is_error()) {
+      LOG(ERROR) << "Client got error " << status;
+      stop();
+    }
+  }
+
+  void alarm() override {
+    alarm_timestamp() = td::Timestamp::in(5);
+    LOG(INFO) << "Send ping";
+    buffered_fd_.output_buffer().append("magkpingping");
+    loop();
+  }
+};
+
+int main(int argc, char *argv[]) {
+  td::OptionsParser options_parser;
+  options_parser.set_description("Tcp ping server/client (based on td::actors2)");
+
+  int port = 8081;
+  bool is_client = false;
+  options_parser.add_option('p', "port", "listen/connect to tcp port (8081 by default)", [&](td::Slice arg) {
+    port = td::to_integer<int>(arg);
+    return td::Status::OK();
+  });
+  options_parser.add_option('c', "client", "Work as client (server by default)", [&]() {
+    is_client = true;
+    return td::Status::OK();
+  });
+  auto status = options_parser.run(argc, argv);
+  if (status.is_error()) {
+    LOG(ERROR) << status.error();
+    LOG(INFO) << options_parser;
+    return 1;
+  }
+
+  // NB: Interface will be changed
+  td::actor::Scheduler scheduler({2});
+  scheduler.run_in_context([&] {
+    if (is_client) {
+      td::IPAddress ip_address;
+      ip_address.init_ipv4_port("127.0.0.1", port).ensure();
+      td::actor::create_actor<PingClient>(td::actor::ActorOptions().with_name("TcpClient").with_poll(),
+                                          td::SocketFd::open(ip_address).move_as_ok())
+          .release();
+    } else {
+      class Callback : public td::TcpListener::Callback {
+       public:
+        void accept(td::SocketFd fd) override {
+          td::actor::create_actor<PingClient>(td::actor::ActorOptions().with_name("TcpClient").with_poll(),
+                                              std::move(fd))
+              .release();
+        }
+      };
+      td::actor::create_actor<td::TcpListener>(td::actor::ActorOptions().with_name("TcpServer").with_poll(), port,
+                                               std::make_unique<Callback>())
+          .release();
+    }
+  });
+  scheduler.run();
+  return 0;
+}
diff --git a/submodules/ton/tonlib-src/tdnet/example/udp_ping_pong.cpp b/submodules/ton/tonlib-src/tdnet/example/udp_ping_pong.cpp
new file mode 100644
index 0000000000..c3c23972e7
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdnet/example/udp_ping_pong.cpp
@@ -0,0 +1,153 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/actor/actor.h"
+
+#include "td/utils/OptionsParser.h"
+#include "td/utils/Observer.h"
+#include "td/utils/port/UdpSocketFd.h"
+
+#include "td/net/UdpServer.h"
+
+// PingPong
+class PingPong : public td::actor::Actor {
+ public:
+  PingPong(int port, td::IPAddress dest, bool use_tcp) : port_(port), dest_(std::move(dest)), use_tcp_(use_tcp) {
+  }
+
+ private:
+  int port_;
+  td::actor::ActorOwn<td::UdpServer> udp_server_;
+  td::IPAddress dest_;
+  bool is_closing_{false};
+  bool use_tcp_{false};
+
+  void start_up() override {
+    class Callback : public td::UdpServer::Callback {
+     public:
+      Callback(td::actor::ActorShared<PingPong> ping_pong) : ping_pong_(std::move(ping_pong)) {
+      }
+
+     private:
+      td::actor::ActorShared<PingPong> ping_pong_;
+      void on_udp_message(td::UdpMessage udp_message) override {
+        send_closure(ping_pong_, &PingPong::on_udp_message, std::move(udp_message));
+      }
+    };
+
+    if (use_tcp_) {
+      udp_server_ = td::UdpServer::create_via_tcp(PSLICE() << "UdpServer(via tcp) " << td::tag("port", port_), port_,
+                                                  std::make_unique<Callback>(actor_shared(this)))
+                        .move_as_ok();
+    } else {
+      udp_server_ = td::UdpServer::create(PSLICE() << "UdpServer " << td::tag("port", port_), port_,
+                                          std::make_unique<Callback>(actor_shared(this)))
+                        .move_as_ok();
+    }
+
+    alarm_timestamp() = td::Timestamp::now();
+  }
+
+  void on_udp_message(td::UdpMessage message) {
+    if (is_closing_) {
+      return;
+    }
+    if (message.error.is_error()) {
+      LOG(ERROR) << "Got error " << message.error << " from " << message.address;
+      return;
+    }
+
+    auto data_slice = message.data.as_slice();
+    LOG(INFO) << "Got query " << td::format::escaped(data_slice) << " from " << message.address;
+    if (data_slice[5] == 'i') {
+      send_closure(udp_server_, &td::UdpServer::send,
+                   td::UdpMessage{message.address, td::BufferSlice("magkpongpong"), {}});
+    }
+  }
+
+  int cnt_{0};
+  void alarm() override {
+    if (++cnt_ > 10) {
+      return close();
+    }
+    alarm_timestamp() = td::Timestamp::in(1);
+    LOG(INFO) << "Send ping";
+    send_closure(udp_server_, &td::UdpServer::send, td::UdpMessage{dest_, td::BufferSlice("magkpingping"), {}});
+  }
+
+  void close() {
+    is_closing_ = true;
+    udp_server_.reset();
+  }
+  void hangup_shared() override {
+    // udp_server_ was_closed
+    stop();
+  }
+  void tear_down() override {
+    td::actor::SchedulerContext::get()->stop();
+  }
+};
+
+int main(int argc, char *argv[]) {
+  td::OptionsParser options_parser;
+  options_parser.set_description("Udp ping server/client (8083 <-> 8084) (based on td::actors2)");
+
+  int from_port = 8083;
+  int to_port = 8084;
+  bool is_client = false;
+  bool use_tcp = false;
+  options_parser.add_option('c', "client", "Work as client (server by default)", [&]() {
+    is_client = true;
+    return td::Status::OK();
+  });
+  options_parser.add_option('t', "tcp", "Use tcp (udp by default)", [&]() {
+    use_tcp = true;
+    return td::Status::OK();
+  });
+  auto status = options_parser.run(argc, argv);
+  if (status.is_error()) {
+    LOG(ERROR) << status.error();
+    LOG(INFO) << options_parser;
+    return 1;
+  }
+  if (is_client) {
+    std::swap(from_port, to_port);
+  }
+  td::IPAddress to_ip;
+  to_ip.init_ipv4_port("127.0.0.1", to_port).ensure();
+
+  // NB: Interface will be changed
+  td::actor::Scheduler scheduler({2});
+  LOG(INFO) << "Listen to " << from_port;
+  scheduler.run_in_context([&] {
+    td::actor::create_actor<PingPong>(td::actor::ActorOptions().with_name("TcpClient").with_poll(), from_port, to_ip,
+                                      use_tcp)
+        .release();
+  });
+  scheduler.run();
+  return 0;
+}
diff --git a/submodules/ton/tonlib-src/tdnet/td/net/FdListener.cpp b/submodules/ton/tonlib-src/tdnet/td/net/FdListener.cpp
new file mode 100644
index 0000000000..24057d1d14
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdnet/td/net/FdListener.cpp
@@ -0,0 +1,30 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/net/FdListener.h"
+
+namespace td {
+void FdListener::start_up() {
+  fd_.add_flags(PollFlags::ReadWrite());
+  td::actor::SchedulerContext::get()->get_poll().subscribe(std::move(fd_), PollFlags::ReadWrite());
+}
+
+void FdListener::tear_down() {
+  td::actor::SchedulerContext::get()->get_poll().unsubscribe(fd_ref_);
+}
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdnet/td/net/FdListener.h b/submodules/ton/tonlib-src/tdnet/td/net/FdListener.h
new file mode 100644
index 0000000000..9b2b0d9d49
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdnet/td/net/FdListener.h
@@ -0,0 +1,42 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/actor.h"
+
+#include "td/utils/Observer.h"
+#include "td/utils/port/detail/PollableFd.h"
+
+namespace td {
+class FdListener : public td::actor::Actor {
+ public:
+  FdListener(td::PollableFd fd, std::unique_ptr<td::Destructor> guard)
+      : fd_(std::move(fd)), fd_ref_(fd_.ref()), guard_(std::move(guard)) {
+  }
+
+ private:
+  PollableFd fd_;
+  PollableFdRef fd_ref_;
+  std::unique_ptr<Destructor> guard_;
+
+  void start_up() override;
+
+  void tear_down() override;
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdnet/td/net/TcpListener.cpp b/submodules/ton/tonlib-src/tdnet/td/net/TcpListener.cpp
new file mode 100644
index 0000000000..dfc97e608d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdnet/td/net/TcpListener.cpp
@@ -0,0 +1,77 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/net/TcpListener.h"
+
+namespace td {
+TcpListener::TcpListener(int port, std::unique_ptr<Callback> callback) : port_(port), callback_(std::move(callback)) {
+}
+void TcpListener::notify() {
+  td::actor::send_closure_later(self_, &TcpListener::on_net);
+}
+void TcpListener::on_net() {
+  loop();
+}
+
+void TcpListener::start_up() {
+  self_ = actor_id(this);
+
+  auto r_socket = td::ServerSocketFd::open(port_);
+  if (r_socket.is_error()) {
+    LOG(ERROR) << r_socket.error();
+    return stop();
+  }
+
+  server_socket_fd_ = r_socket.move_as_ok();
+
+  // Subscribe for socket updates
+  // NB: Interface will be changed
+  td::actor::SchedulerContext::get()->get_poll().subscribe(server_socket_fd_.get_poll_info().extract_pollable_fd(this),
+                                                           PollFlags::Read());
+}
+
+void TcpListener::tear_down() {
+  // unsubscribe from socket updates
+  // nb: interface will be changed
+  td::actor::SchedulerContext::get()->get_poll().unsubscribe(server_socket_fd_.get_poll_info().get_pollable_fd_ref());
+}
+
+void TcpListener::loop() {
+  auto status = [&] {
+    while (td::can_read(server_socket_fd_)) {
+      auto r_socket = server_socket_fd_.accept();
+      if (r_socket.is_error() && r_socket.error().code() == -1) {
+        break;
+      }
+      TRY_RESULT(client_socket, std::move(r_socket));
+      LOG(ERROR) << "Accept";
+      callback_->accept(std::move(client_socket));
+    }
+    if (td::can_close(server_socket_fd_)) {
+      stop();
+    }
+    return td::Status::OK();
+  }();
+
+  if (status.is_error()) {
+    LOG(ERROR) << "Server error " << status;
+    return stop();
+  }
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdnet/td/net/TcpListener.h b/submodules/ton/tonlib-src/tdnet/td/net/TcpListener.h
new file mode 100644
index 0000000000..bccf9e52f7
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdnet/td/net/TcpListener.h
@@ -0,0 +1,52 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/actor.h"
+
+#include "td/utils/port/ServerSocketFd.h"
+#include "td/utils/Observer.h"
+
+namespace td {
+class TcpListener : public td::actor::Actor, private td::ObserverBase {
+ public:
+  class Callback {
+   public:
+    virtual ~Callback() = default;
+    virtual void accept(SocketFd fd) = 0;
+  };
+
+  TcpListener(int port, std::unique_ptr<Callback> callback);
+
+ private:
+  int port_;
+  std::unique_ptr<Callback> callback_;
+  td::ServerSocketFd server_socket_fd_;
+  td::actor::ActorId<TcpListener> self_;
+
+  void notify() override;
+  void on_net();
+
+  void start_up() override;
+
+  void tear_down() override;
+
+  void loop() override;
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdnet/td/net/UdpServer.cpp b/submodules/ton/tonlib-src/tdnet/td/net/UdpServer.cpp
new file mode 100644
index 0000000000..1a88d17f14
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdnet/td/net/UdpServer.cpp
@@ -0,0 +1,466 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/net/UdpServer.h"
+#include "td/net/FdListener.h"
+#include "td/net/TcpListener.h"
+
+#include "td/utils/BufferedFd.h"
+
+#include <map>
+
+namespace td {
+namespace {
+int VERBOSITY_NAME(udp_server) = VERBOSITY_NAME(DEBUG) + 10;
+}
+namespace detail {
+class UdpServerImpl : public UdpServer {
+ public:
+  void send(td::UdpMessage &&message) override;
+  static td::actor::ActorOwn<UdpServerImpl> create(td::Slice name, td::UdpSocketFd fd,
+                                                   std::unique_ptr<Callback> callback);
+
+  UdpServerImpl(td::UdpSocketFd fd, std::unique_ptr<Callback> callback);
+
+ private:
+  td::actor::ActorOwn<> fd_listener_;
+  std::unique_ptr<Callback> callback_;
+  td::BufferedUdp fd_;
+  bool is_closing_{false};
+
+  void start_up() override;
+  void on_fd_updated();
+
+  void loop() override;
+
+  void hangup() override;
+  void hangup_shared() override;
+};
+
+void UdpServerImpl::send(td::UdpMessage &&message) {
+  fd_.send(std::move(message));
+  loop();  // TODO: some yield logic
+}
+
+td::actor::ActorOwn<UdpServerImpl> UdpServerImpl::create(td::Slice name, td::UdpSocketFd fd,
+                                                         std::unique_ptr<Callback> callback) {
+  return td::actor::create_actor<UdpServerImpl>(
+      actor::ActorOptions().with_name(name).with_poll(!td::Poll::is_edge_triggered()), std::move(fd),
+      std::move(callback));
+}
+
+UdpServerImpl::UdpServerImpl(td::UdpSocketFd fd, std::unique_ptr<Callback> callback)
+    : callback_(std::move(callback)), fd_(std::move(fd)) {
+}
+
+void UdpServerImpl::start_up() {
+  //CHECK(td::actor::SchedulerContext::get()->has_poll() == false);
+  class Observer : public td::ObserverBase, public Destructor {
+   public:
+    Observer(td::actor::ActorShared<UdpServerImpl> udp_server) : udp_server_(std::move(udp_server)) {
+    }
+    void notify() override {
+      VLOG(udp_server) << "on_fd_updated";
+      td::actor::send_signals_later(udp_server_, td::actor::ActorSignals::wakeup());
+    }
+
+   private:
+    td::actor::ActorShared<UdpServerImpl> udp_server_;
+  };
+
+  auto observer = std::make_unique<Observer>(actor_shared(this));
+  auto pollable_fd = fd_.get_poll_info().extract_pollable_fd(observer.get());
+  fd_listener_ = td::actor::create_actor<FdListener>(actor::ActorOptions().with_name("FdListener").with_poll(),
+                                                     std::move(pollable_fd), std::move(observer));
+}
+
+void UdpServerImpl::on_fd_updated() {
+  loop();
+}
+
+void UdpServerImpl::loop() {
+  if (is_closing_) {
+    return;
+  }
+  //CHECK(td::actor::SchedulerContext::get()->has_poll() == false);
+  fd_.get_poll_info().get_flags();
+  VLOG(udp_server) << "loop " << td::tag("can read", can_read(fd_)) << " " << td::tag("can write", can_write(fd_));
+  Status status;
+  status = [&] {
+    while (true) {
+      TRY_RESULT(o_message, fd_.receive());
+      if (!o_message) {
+        return Status::OK();
+      }
+      callback_->on_udp_message(std::move(*o_message));
+    }
+    return Status::OK();
+  }();
+  if (status.is_ok()) {
+    status = fd_.flush_send();
+  }
+
+  if (status.is_error()) {
+    VLOG(udp_server) << "Got " << status << " sleep for 1 second";
+    alarm_timestamp() = Timestamp::in(1);
+  }
+}
+
+void UdpServerImpl::hangup() {
+  is_closing_ = true;
+  // wait till fd_listener_ is closed and fd is unsubscribed
+  fd_listener_.reset();
+}
+void UdpServerImpl::hangup_shared() {
+  stop();
+}
+
+class TcpInfiniteListener : public actor::Actor {
+ public:
+  TcpInfiniteListener(int32 port, std::unique_ptr<TcpListener::Callback> callback)
+      : port_(port), callback_(std::move(callback)) {
+  }
+
+ private:
+  int32 port_;
+  std::unique_ptr<TcpListener::Callback> callback_;
+  actor::ActorOwn<TcpListener> tcp_listener_;
+  int32 refcnt_{0};
+  bool close_flag_{false};
+
+  void start_up() override {
+    loop();
+  }
+
+  void hangup() override {
+    close_flag_ = true;
+    tcp_listener_.reset();
+    if (refcnt_ == 0) {
+      stop();
+    }
+  }
+
+  void loop() override {
+    if (!tcp_listener_.empty()) {
+      return;
+    }
+    class Callback : public TcpListener::Callback {
+     public:
+      Callback(actor::ActorShared<TcpInfiniteListener> parent) : parent_(std::move(parent)) {
+      }
+      void accept(SocketFd fd) override {
+        actor::send_closure(parent_, &TcpInfiniteListener::accept, std::move(fd));
+      }
+
+     private:
+      actor::ActorShared<TcpInfiniteListener> parent_;
+    };
+    VLOG(udp_server) << "Create listener";
+    refcnt_++;
+    tcp_listener_ = actor::create_actor<TcpListener>(
+        actor::ActorOptions().with_name(PSLICE() << "TcpListener" << tag("port", port_)).with_poll(), port_,
+        std::make_unique<Callback>(actor_shared(this)));
+  }
+
+  void accept(SocketFd fd) {
+    callback_->accept(std::move(fd));
+  }
+
+  void hangup_shared() override {
+    refcnt_--;
+    tcp_listener_.reset();
+    if (close_flag_) {
+      if (refcnt_ == 0) {
+        stop();
+      }
+    } else {
+      alarm_timestamp() = Timestamp::in(5 /*5 seconds*/);
+    }
+  }
+};
+
+class TcpClient : public td::actor::Actor, td::ObserverBase {
+ public:
+  class Callback {
+   public:
+    virtual ~Callback() = default;
+    virtual void on_message(BufferSlice data) = 0;
+    virtual void on_closed(actor::ActorId<>) = 0;
+  };
+  TcpClient(td::SocketFd fd, std::unique_ptr<Callback> callback)
+      : buffered_fd_(std::move(fd)), callback_(std::move(callback)) {
+  }
+
+  void send(BufferSlice data) {
+    uint32 data_size = narrow_cast<uint32>(data.size());
+
+    buffered_fd_.output_buffer().append(Slice(reinterpret_cast<char *>(&data_size), sizeof(data_size)));
+    buffered_fd_.output_buffer().append(std::move(data));
+    loop();
+  }
+
+ private:
+  td::BufferedFd<td::SocketFd> buffered_fd_;
+  std::unique_ptr<Callback> callback_;
+  td::actor::ActorId<TcpClient> self_;
+
+  void notify() override {
+    // NB: Interface will be changed
+    td::actor::send_closure_later(self_, &TcpClient::on_net);
+  }
+  void on_net() {
+    loop();
+  }
+
+  void start_up() override {
+    self_ = actor_id(this);
+    LOG(INFO) << "Start";
+    // Subscribe for socket updates
+    // NB: Interface will be changed
+    td::actor::SchedulerContext::get()->get_poll().subscribe(buffered_fd_.get_poll_info().extract_pollable_fd(this),
+                                                             PollFlags::ReadWrite());
+    alarm_timestamp() = Timestamp::in(10);
+    notify();
+  }
+
+  void tear_down() override {
+    LOG(INFO) << "Close";
+    // unsubscribe from socket updates
+    // nb: interface will be changed
+    td::actor::SchedulerContext::get()->get_poll().unsubscribe(buffered_fd_.get_poll_info().get_pollable_fd_ref());
+    callback_->on_closed(actor_id(this));
+  }
+
+  void loop() override {
+    auto status = [&] {
+      TRY_STATUS(buffered_fd_.flush_read());
+      auto &input = buffered_fd_.input_buffer();
+      while (true) {
+        constexpr size_t header_size = 4;
+        if (input.size() < header_size) {
+          break;
+        }
+        auto it = input.clone();
+        uint32 data_size;
+        it.advance(header_size, MutableSlice(reinterpret_cast<uint8 *>(&data_size), sizeof(data_size)));
+        if (data_size > (1 << 26)) {
+          return Status::Error("Too big packet");
+        }
+        if (it.size() < data_size) {
+          break;
+        }
+        auto data = it.cut_head(data_size).move_as_buffer_slice();
+        alarm_timestamp() = Timestamp::in(10);
+        callback_->on_message(std::move(data));
+        input = std::move(it);
+      }
+
+      TRY_STATUS(buffered_fd_.flush_write());
+      if (td::can_close(buffered_fd_)) {
+        stop();
+      }
+      return td::Status::OK();
+    }();
+    if (status.is_error()) {
+      LOG(INFO) << "Client got error " << status;
+      stop();
+    }
+  }
+  void alarm() override {
+    LOG(INFO) << "Close because of timeout";
+    stop();
+  }
+};
+
+struct Target {
+  IPAddress ip_address;
+  actor::ActorOwn<TcpClient> inbound;
+  actor::ActorOwn<TcpClient> outbound;
+};
+
+class TargetSet {
+ public:
+  using Id = size_t;
+  Id register_target(IPAddress address) {
+    auto it_ok = ip_to_id_.insert(std::make_pair(address, 0));
+    if (it_ok.second) {
+      id_to_target_.push_back({});
+      id_to_target_.back().ip_address = address;
+      it_ok.first->second = id_to_target_.size();
+    }
+    return it_ok.first->second;
+  }
+
+  Target &get_target(Id id) {
+    return id_to_target_.at(id - 1);
+  }
+
+ private:
+  std::map<IPAddress, size_t> ip_to_id_;
+  std::vector<Target> id_to_target_;
+};
+class UdpServerViaTcp : public UdpServer {
+ public:
+  UdpServerViaTcp(int32 port, std::unique_ptr<Callback> callback) : port_(port), callback_(std::move(callback)) {
+  }
+
+ private:
+  int32 port_;
+  std::unique_ptr<Callback> callback_;
+  actor::ActorOwn<TcpInfiniteListener> tcp_listener_;
+  TargetSet target_set_;
+  int refcnt_{0};
+  bool close_flag_{false};
+
+  void start_up() override {
+    //TcpInfiniteListener
+    class TcpListenerCallback : public TcpListener::Callback {
+     public:
+      TcpListenerCallback(actor::ActorShared<UdpServerViaTcp> parent) : parent_(std::move(parent)) {
+      }
+      void accept(SocketFd fd) override {
+        actor::send_closure(parent_, &UdpServerViaTcp::accept, std::move(fd));
+      }
+
+     private:
+      actor::ActorShared<UdpServerViaTcp> parent_;
+    };
+    refcnt_++;
+    tcp_listener_ = actor::create_actor<TcpInfiniteListener>(PSLICE() << "TcpInfiniteListener" << port_, port_,
+                                                             std::make_unique<TcpListenerCallback>(actor_shared(this)));
+  }
+
+  void send(UdpMessage &&message) override {
+    if (close_flag_) {
+      return;
+    }
+    auto target_id = target_set_.register_target(message.address);
+    auto &target = target_set_.get_target(target_id);
+    if (target.inbound.empty() && target.outbound.empty()) {
+      auto r_fd = SocketFd::open(target.ip_address);
+      if (r_fd.is_error()) {
+        LOG(INFO) << r_fd.error();
+        return;
+      }
+      auto fd = r_fd.move_as_ok();
+      do_accept(std::move(fd), message.address, false);
+    }
+    if (!target.inbound.empty()) {
+      send_closure_later(target.inbound, &TcpClient::send, std::move(message.data));
+    } else if (!target.outbound.empty()) {
+      send_closure_later(target.outbound, &TcpClient::send, std::move(message.data));
+    }
+  }
+
+  void on_message(BufferSlice data) {
+    if (close_flag_) {
+      return;
+    }
+    auto token = get_link_token();
+    auto &target = target_set_.get_target(narrow_cast<TargetSet::Id>(token));
+    UdpMessage message;
+    message.address = target.ip_address;
+    message.data = std::move(data);
+    callback_->on_udp_message(std::move(message));
+  }
+  void on_closed(actor::ActorId<> id) {
+    if (close_flag_) {
+      return;
+    }
+    auto token = get_link_token();
+    auto &target = target_set_.get_target(narrow_cast<TargetSet::Id>(token));
+    if (target.inbound.get() == id) {
+      target.inbound.reset();
+    }
+    if (target.outbound.get() == id) {
+      target.outbound.reset();
+    }
+  }
+
+  void accept(SocketFd fd) {
+    if (close_flag_) {
+      return;
+    }
+    IPAddress ip_address;
+    auto status = ip_address.init_peer_address(fd);
+    if (status.is_error()) {
+      LOG(INFO) << status;
+      return;
+    }
+    do_accept(std::move(fd), ip_address, true);
+  }
+  void do_accept(SocketFd fd, IPAddress ip_address, bool is_inbound) {
+    class TcpClientCallback : public TcpClient::Callback {
+     public:
+      TcpClientCallback(actor::ActorShared<UdpServerViaTcp> parent) : parent_(std::move(parent)) {
+      }
+      void on_message(BufferSlice data) override {
+        send_closure(parent_, &UdpServerViaTcp::on_message, std::move(data));
+      }
+      void on_closed(actor::ActorId<> id) override {
+        send_closure(parent_, &UdpServerViaTcp::on_closed, std::move(id));
+      }
+
+     private:
+      actor::ActorShared<UdpServerViaTcp> parent_;
+    };
+
+    auto target_id = target_set_.register_target(ip_address);
+    auto &target = target_set_.get_target(target_id);
+    refcnt_++;
+    auto actor = actor::create_actor<TcpClient>(actor::ActorOptions().with_name("TcpClient").with_poll(), std::move(fd),
+                                                std::make_unique<TcpClientCallback>(actor_shared(this, target_id)));
+    if (is_inbound) {
+      target.inbound = std::move(actor);
+    } else {
+      target.outbound = std::move(actor);
+    }
+  }
+
+  void hangup() override {
+    close_flag_ = true;
+    target_set_ = {};
+    tcp_listener_ = {};
+  }
+
+  void hangup_shared() override {
+    refcnt_--;
+    if (refcnt_ == 0) {
+      stop();
+    }
+  }
+
+  void loop() override {
+  }
+};
+
+}  // namespace detail
+
+Result<actor::ActorOwn<UdpServer>> UdpServer::create(td::Slice name, int32 port, std::unique_ptr<Callback> callback) {
+  td::IPAddress from_ip;
+  TRY_STATUS(from_ip.init_ipv4_port("0.0.0.0", port));
+  TRY_RESULT(fd, UdpSocketFd::open(from_ip));
+  fd.maximize_rcv_buffer().ensure();
+  return detail::UdpServerImpl::create(name, std::move(fd), std::move(callback));
+}
+Result<actor::ActorOwn<UdpServer>> UdpServer::create_via_tcp(td::Slice name, int32 port,
+                                                             std::unique_ptr<Callback> callback) {
+  return actor::create_actor<detail::UdpServerViaTcp>(name, port, std::move(callback));
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdnet/td/net/UdpServer.h b/submodules/ton/tonlib-src/tdnet/td/net/UdpServer.h
new file mode 100644
index 0000000000..ed73c8eb21
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdnet/td/net/UdpServer.h
@@ -0,0 +1,42 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/actor.h"
+#include "td/utils/BufferedUdp.h"
+
+#include "td/utils/port/UdpSocketFd.h"
+
+namespace td {
+
+class UdpServer : public td::actor::Actor {
+ public:
+  class Callback {
+   public:
+    virtual ~Callback() = default;
+    virtual void on_udp_message(td::UdpMessage udp_message) = 0;
+  };
+  virtual void send(td::UdpMessage &&message) = 0;
+
+  static Result<actor::ActorOwn<UdpServer>> create(td::Slice name, int32 port, std::unique_ptr<Callback> callback);
+  static Result<actor::ActorOwn<UdpServer>> create_via_tcp(td::Slice name, int32 port,
+                                                           std::unique_ptr<Callback> callback);
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdnet/test/net-test.cpp b/submodules/ton/tonlib-src/tdnet/test/net-test.cpp
new file mode 100644
index 0000000000..fb3d0595c6
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdnet/test/net-test.cpp
@@ -0,0 +1,167 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/actor/actor.h"
+#include "td/net/UdpServer.h"
+#include "td/utils/tests.h"
+
+class PingPong : public td::actor::Actor {
+ public:
+  PingPong(int port, td::IPAddress dest, bool use_tcp, bool is_first)
+      : port_(port), dest_(std::move(dest)), use_tcp_(use_tcp) {
+    if (is_first) {
+      state_ = Send;
+      to_send_cnt_ = 5;
+      to_send_cnt_ = 1;
+    }
+  }
+
+ private:
+  int port_;
+  td::actor::ActorOwn<td::UdpServer> udp_server_;
+  td::IPAddress dest_;
+  bool is_closing_{false};
+  bool is_closing_delayed_{false};
+  bool use_tcp_{false};
+  enum State { Send, Receive } state_{State::Receive};
+  int cnt_{0};
+  int to_send_cnt_{0};
+
+  void start_up() override {
+    class Callback : public td::UdpServer::Callback {
+     public:
+      Callback(td::actor::ActorShared<PingPong> ping_pong) : ping_pong_(std::move(ping_pong)) {
+      }
+
+     private:
+      td::actor::ActorShared<PingPong> ping_pong_;
+      void on_udp_message(td::UdpMessage udp_message) override {
+        send_closure(ping_pong_, &PingPong::on_udp_message, std::move(udp_message));
+      }
+    };
+
+    if (use_tcp_) {
+      udp_server_ = td::UdpServer::create_via_tcp(PSLICE() << "UdpServer(via tcp) " << td::tag("port", port_), port_,
+                                                  std::make_unique<Callback>(actor_shared(this)))
+                        .move_as_ok();
+    } else {
+      udp_server_ = td::UdpServer::create(PSLICE() << "UdpServer " << td::tag("port", port_), port_,
+                                          std::make_unique<Callback>(actor_shared(this)))
+                        .move_as_ok();
+    }
+
+    alarm_timestamp() = td::Timestamp::in(0.1);
+  }
+
+  void on_udp_message(td::UdpMessage message) {
+    if (is_closing_) {
+      return;
+    }
+    if (message.error.is_error()) {
+      LOG(ERROR) << "Got error " << message.error << " from " << message.address;
+      return;
+    }
+
+    auto data_slice = message.data.as_slice();
+    LOG(INFO) << "Got query " << td::format::escaped(data_slice) << " from " << message.address;
+    CHECK(state_ == State::Receive);
+    if (data_slice.size() < 5) {
+      CHECK(data_slice == "stop");
+      close();
+    }
+    if (data_slice[5] == 'i') {
+      state_ = State::Send;
+      to_send_cnt_ = td::Random::fast(1, 4);
+      to_send_cnt_ = 1;
+      send_closure_later(actor_id(this), &PingPong::loop);
+    }
+  }
+  void loop() override {
+    if (state_ != State::Send || is_closing_) {
+      return;
+    }
+    to_send_cnt_--;
+    td::Slice msg;
+    if (to_send_cnt_ <= 0) {
+      state_ = State::Receive;
+      cnt_++;
+      if (cnt_ >= 1000) {
+        msg = "stop";
+      } else {
+        msg = "makgpingping";
+      }
+    } else {
+      msg = "magkpongpong";
+    }
+    LOG(INFO) << "Send query: " << msg;
+    send_closure_later(actor_id(this), &PingPong::loop);
+    send_closure(udp_server_, &td::UdpServer::send, td::UdpMessage{dest_, td::BufferSlice(msg), {}});
+
+    if (msg.size() == 4) {
+      close_delayed();
+    }
+  }
+
+  void alarm() override {
+    if (is_closing_delayed_) {
+      close();
+      return;
+    }
+    send_closure_later(actor_id(this), &PingPong::loop);
+  }
+  void close_delayed() {
+    // Temporary hack to avoid ECONNRESET error
+    is_closing_ = true;
+    is_closing_delayed_ = true;
+    alarm_timestamp() = td::Timestamp::in(0.1);
+  }
+  void close() {
+    is_closing_ = true;
+    udp_server_.reset();
+  }
+  void hangup_shared() override {
+    // udp_server_ was_closed
+    stop();
+  }
+  void tear_down() override {
+    td::actor::SchedulerContext::get()->stop();
+  }
+};
+
+void run_server(int from_port, int to_port, bool is_first, bool use_tcp) {
+  td::IPAddress to_ip;
+  to_ip.init_host_port("localhost", to_port).ensure();
+
+  td::actor::Scheduler scheduler({1});
+  scheduler.run_in_context([&] {
+    td::actor::create_actor<PingPong>(td::actor::ActorOptions().with_name("PingPong"), from_port, to_ip, use_tcp,
+                                      is_first)
+        .release();
+  });
+  scheduler.run();
+}
+
+TEST(Net, PingPong) {
+  SET_VERBOSITY_LEVEL(VERBOSITY_NAME(ERROR));
+  for (auto use_tcp : {false, true}) {
+    auto a = td::thread([use_tcp] { run_server(8091, 8092, true, use_tcp); });
+    auto b = td::thread([use_tcp] { run_server(8092, 8091, false, use_tcp); });
+    a.join();
+    b.join();
+  }
+}
diff --git a/submodules/ton/tonlib-src/tdtl/.gitrepo b/submodules/ton/tonlib-src/tdtl/.gitrepo
new file mode 100644
index 0000000000..7346b4bff5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/.gitrepo
@@ -0,0 +1,11 @@
+; DO NOT EDIT (unless you know what you are doing)
+;
+; This subdirectory is a git "subrepo", and this file is maintained by the
+; git-subrepo command. See https://github.com/git-commands/git-subrepo#readme
+;
+[subrepo]
+	remote = https://github.com/arseny30/tdtl
+	branch = master
+	commit = c6c23a5a9e3f13b576116a0e7bf5a032faa33ff2
+	parent = 004e7575cf77d514c77bbab3b764568621f7d140
+	cmdver = 0.3.1
diff --git a/submodules/ton/tonlib-src/tdtl/CMakeLists.txt b/submodules/ton/tonlib-src/tdtl/CMakeLists.txt
new file mode 100644
index 0000000000..b0f83cd98d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/CMakeLists.txt
@@ -0,0 +1,29 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+#SOURCE SETS
+set(TDTL_SOURCE
+  td/tl/tl_config.cpp
+  td/tl/tl_core.cpp
+  td/tl/tl_file_outputer.cpp
+  td/tl/tl_file_utils.cpp
+  td/tl/tl_generate.cpp
+  td/tl/tl_outputer.cpp
+  td/tl/tl_string_outputer.cpp
+  td/tl/tl_writer.cpp
+
+  td/tl/tl_config.h
+  td/tl/tl_core.h
+  td/tl/tl_file_outputer.h
+  td/tl/tl_file_utils.h
+  td/tl/tl_generate.h
+  td/tl/tl_outputer.h
+  td/tl/tl_simple.h
+  td/tl/tl_simple_parser.h
+  td/tl/tl_string_outputer.h
+  td/tl/tl_writer.h
+)
+
+add_library(tdtl STATIC ${TDTL_SOURCE})
+target_include_directories(tdtl PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+#TODO
+#target_compile_options(tdtl PRIVATE "-std=c++03")
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_config.cpp b/submodules/ton/tonlib-src/tdtl/td/tl/tl_config.cpp
new file mode 100644
index 0000000000..78b02e9bb2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_config.cpp
@@ -0,0 +1,384 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_config.h"
+
+#include <cassert>
+#include <cstdio>
+#include <cstdlib>
+#include <memory>
+
+namespace td {
+namespace tl {
+
+const std::int32_t TLS_SCHEMA_V2 = 0x3a2f9be2;
+const std::int32_t TLS_SCHEMA_V3 = 0xe4a8604b;
+const std::int32_t TLS_SCHEMA_V4 = 0x90ac88d7;
+const std::int32_t TLS_TYPE = 0x12eb4386;
+const std::int32_t TLS_COMBINATOR = 0x5c0a1ed5;
+const std::int32_t TLS_COMBINATOR_LEFT_BUILTIN = 0xcd211f63;
+const std::int32_t TLS_COMBINATOR_LEFT = 0x4c12c6d9;
+const std::int32_t TLS_COMBINATOR_RIGHT_V2 = 0x2c064372;
+const std::int32_t TLS_ARG_V2 = 0x29dfe61b;
+
+const std::int32_t TLS_EXPR_NAT = 0xdcb49bd8;
+const std::int32_t TLS_EXPR_TYPE = 0xecc9da78;
+
+const std::int32_t TLS_NAT_CONST_OLD = 0xdcb49bd8;
+const std::int32_t TLS_NAT_CONST = 0x8ce940b1;
+const std::int32_t TLS_NAT_VAR = 0x4e8a14f0;
+const std::int32_t TLS_TYPE_VAR = 0x0142ceae;
+const std::int32_t TLS_ARRAY = 0xd9fb20de;
+const std::int32_t TLS_TYPE_EXPR = 0xc1863d08;
+
+void tl_config::add_type(tl_type *type) {
+  types.push_back(type);
+  id_to_type[type->id] = type;
+  name_to_type[type->name] = type;
+}
+
+tl_type *tl_config::get_type(std::int32_t type_id) const {
+  auto it = id_to_type.find(type_id);
+  assert(it != id_to_type.end());
+  return it->second;
+}
+
+tl_type *tl_config::get_type(const std::string &type_name) {
+  return name_to_type[type_name];
+}
+
+void tl_config::add_function(tl_combinator *function) {
+  functions.push_back(function);
+  id_to_function[function->id] = function;
+  name_to_function[function->name] = function;
+}
+
+tl_combinator *tl_config::get_function(std::int32_t function_id) {
+  return id_to_function[function_id];
+}
+
+tl_combinator *tl_config::get_function(const std::string &function_name) {
+  return name_to_function[function_name];
+}
+
+std::size_t tl_config::get_type_count() const {
+  return types.size();
+}
+
+tl_type *tl_config::get_type_by_num(std::size_t num) const {
+  return types[num];
+}
+
+std::size_t tl_config::get_function_count() const {
+  return functions.size();
+}
+
+tl_combinator *tl_config::get_function_by_num(std::size_t num) const {
+  return functions[num];
+}
+
+std::int32_t tl_config_parser::try_parse_int() {
+  return try_parse(p.fetch_int());
+}
+
+std::int64_t tl_config_parser::try_parse_long() {
+  return try_parse(p.fetch_long());
+}
+
+std::string tl_config_parser::try_parse_string() {
+  return try_parse(p.fetch_string());
+}
+
+template <class T>
+T tl_config_parser::try_parse(const T &res) const {
+  if (p.get_error() != NULL) {
+    std::fprintf(stderr, "Wrong TL-scheme specified: %s at %d\n", p.get_error(), static_cast<int>(p.get_error_pos()));
+    std::abort();
+  }
+
+  return res;
+}
+
+int tl_config_parser::get_schema_version(std::int32_t version_id) {
+  if (version_id == TLS_SCHEMA_V4) {
+    return 4;
+  }
+  if (version_id == TLS_SCHEMA_V3) {
+    return 3;
+  }
+  if (version_id == TLS_SCHEMA_V2) {
+    return 2;
+  }
+  return -1;
+}
+
+template <class T>
+T *store(std::unique_ptr<T> ptr) {
+  static std::vector<std::unique_ptr<T>> storage;
+  auto res = ptr.get();
+  storage.push_back(std::move(ptr));
+  return res;
+}
+
+tl_tree *tl_config_parser::read_num_const() {
+  int num = static_cast<int>(try_parse_int());
+
+  return store(std::make_unique<tl_tree_nat_const>(FLAG_NOVAR, num));
+}
+
+tl_tree *tl_config_parser::read_num_var(int *var_count) {
+  std::int32_t diff = try_parse_int();
+  int var_num = static_cast<int>(try_parse_int());
+
+  if (var_num >= *var_count) {
+    *var_count = var_num + 1;
+  }
+
+  return store(std::make_unique<tl_tree_var_num>(0, var_num, diff));
+}
+
+tl_tree *tl_config_parser::read_type_var(int *var_count) {
+  int var_num = static_cast<int>(try_parse_int());
+  std::int32_t flags = try_parse_int();
+
+  if (var_num >= *var_count) {
+    *var_count = var_num + 1;
+  }
+  assert(!(flags & (FLAG_NOVAR | FLAG_BARE)));
+
+  return store(std::make_unique<tl_tree_var_type>(flags, var_num));
+}
+
+tl_tree *tl_config_parser::read_array(int *var_count) {
+  std::int32_t flags = FLAG_NOVAR;
+  tl_tree *multiplicity = read_nat_expr(var_count);
+
+  tl_tree_array *T = store(std::make_unique<tl_tree_array>(flags, multiplicity, read_args_list(var_count)));
+
+  for (std::size_t i = 0; i < T->args.size(); i++) {
+    if (!(T->args[i].flags & FLAG_NOVAR)) {
+      T->flags &= ~FLAG_NOVAR;
+    }
+  }
+  return T;
+}
+
+tl_tree *tl_config_parser::read_type(int *var_count) {
+  tl_type *type = config.get_type(try_parse_int());
+  assert(type != NULL);
+  std::int32_t flags = try_parse_int() | FLAG_NOVAR;
+  int arity = static_cast<int>(try_parse_int());
+  assert(type->arity == arity);
+
+  tl_tree_type *T = store(std::make_unique<tl_tree_type>(flags, type, arity));
+  for (std::int32_t i = 0; i < arity; i++) {
+    tl_tree *child = read_expr(var_count);
+
+    T->children[i] = child;
+    if (!(child->flags & FLAG_NOVAR)) {
+      T->flags &= ~FLAG_NOVAR;
+    }
+  }
+  return T;
+}
+
+tl_tree *tl_config_parser::read_type_expr(int *var_count) {
+  std::int32_t tree_type = try_parse_int();
+  switch (tree_type) {
+    case TLS_TYPE_VAR:
+      return read_type_var(var_count);
+    case TLS_TYPE_EXPR:
+      return read_type(var_count);
+    case TLS_ARRAY:
+      return read_array(var_count);
+    default:
+      std::fprintf(stderr, "tree_type = %d\n", static_cast<int>(tree_type));
+      std::abort();
+  }
+}
+
+tl_tree *tl_config_parser::read_nat_expr(int *var_count) {
+  std::int32_t tree_type = try_parse_int();
+  switch (tree_type) {
+    case TLS_NAT_CONST_OLD:
+    case TLS_NAT_CONST:
+      return read_num_const();
+    case TLS_NAT_VAR:
+      return read_num_var(var_count);
+    default:
+      std::fprintf(stderr, "tree_type = %d\n", static_cast<int>(tree_type));
+      std::abort();
+  }
+}
+
+tl_tree *tl_config_parser::read_expr(int *var_count) {
+  std::int32_t tree_type = try_parse_int();
+  switch (tree_type) {
+    case TLS_EXPR_NAT:
+      return read_nat_expr(var_count);
+    case TLS_EXPR_TYPE:
+      return read_type_expr(var_count);
+    default:
+      std::fprintf(stderr, "tree_type = %d\n", static_cast<int>(tree_type));
+      std::abort();
+  }
+}
+
+std::vector<arg> tl_config_parser::read_args_list(int *var_count) {
+  const int schema_flag_opt_field = 2 << static_cast<int>(schema_version >= 3);
+  const int schema_flag_has_vars = schema_flag_opt_field ^ 6;
+
+  std::size_t args_num = static_cast<size_t>(try_parse_int());
+  std::vector<arg> args(args_num);
+  for (std::size_t i = 0; i < args_num; i++) {
+    arg cur_arg;
+
+    std::int32_t arg_v = try_parse_int();
+    if (arg_v != TLS_ARG_V2) {
+      std::fprintf(stderr, "Wrong tls_arg magic %d\n", static_cast<int>(arg_v));
+      std::abort();
+    }
+
+    cur_arg.name = try_parse_string();
+    cur_arg.flags = try_parse_int();
+
+    bool is_optional = false;
+    if (cur_arg.flags & schema_flag_opt_field) {
+      cur_arg.flags &= ~schema_flag_opt_field;
+      is_optional = true;
+    }
+    if (cur_arg.flags & schema_flag_has_vars) {
+      cur_arg.flags &= ~schema_flag_has_vars;
+      cur_arg.var_num = static_cast<int>(try_parse_int());
+    } else {
+      cur_arg.var_num = -1;
+    }
+
+    if (cur_arg.var_num >= *var_count) {
+      *var_count = cur_arg.var_num + 1;
+    }
+    if (is_optional) {
+      cur_arg.exist_var_num = static_cast<int>(try_parse_int());
+      cur_arg.exist_var_bit = static_cast<int>(try_parse_int());
+    } else {
+      cur_arg.exist_var_num = -1;
+      cur_arg.exist_var_bit = 0;
+    }
+    cur_arg.type = read_type_expr(var_count);
+    if (/*cur_arg.var_num < 0 && cur_arg.exist_var_num < 0 && */ (cur_arg.type->flags & FLAG_NOVAR)) {
+      cur_arg.flags |= FLAG_NOVAR;
+    }
+
+    args[i] = cur_arg;
+  }
+  return args;
+}
+
+tl_combinator *tl_config_parser::read_combinator() {
+  std::int32_t t = try_parse_int();
+  if (t != TLS_COMBINATOR) {
+    std::fprintf(stderr, "Wrong tls_combinator magic %d\n", static_cast<int>(t));
+    std::abort();
+  }
+
+  tl_combinator *combinator = store(std::make_unique<tl_combinator>());
+  combinator->id = try_parse_int();
+  combinator->name = try_parse_string();
+  combinator->type_id = try_parse_int();
+  combinator->var_count = 0;
+
+  std::int32_t left_type = try_parse_int();
+  if (left_type == TLS_COMBINATOR_LEFT) {
+    combinator->args = read_args_list(&combinator->var_count);
+  } else {
+    if (left_type != TLS_COMBINATOR_LEFT_BUILTIN) {
+      std::fprintf(stderr, "Wrong tls_combinator_left magic %d\n", static_cast<int>(left_type));
+      std::abort();
+    }
+  }
+
+  std::int32_t right_ver = try_parse_int();
+  if (right_ver != TLS_COMBINATOR_RIGHT_V2) {
+    std::fprintf(stderr, "Wrong tls_combinator_right magic %d\n", static_cast<int>(right_ver));
+    std::abort();
+  }
+  combinator->result = read_type_expr(&combinator->var_count);
+
+  return combinator;
+}
+
+tl_type *tl_config_parser::read_type() {
+  std::int32_t t = try_parse_int();
+  if (t != TLS_TYPE) {
+    std::fprintf(stderr, "Wrong tls_type magic %d\n", t);
+    std::abort();
+  }
+
+  tl_type *type = store(std::make_unique<tl_type>());
+  type->id = try_parse_int();
+  type->name = try_parse_string();
+  type->constructors_num = static_cast<std::size_t>(try_parse_int());
+  type->constructors.reserve(type->constructors_num);
+  type->flags = try_parse_int();
+  type->flags &= ~(1 | 8 | 16 | 1024);
+  if (type->flags != 0) {
+    std::fprintf(stderr, "Type %s has non-zero flags: %d\n", type->name.c_str(), static_cast<int>(type->flags));
+  }
+  type->arity = static_cast<int>(try_parse_int());
+
+  try_parse_long();  // unused
+  return type;
+}
+
+tl_config tl_config_parser::parse_config() {
+  schema_version = get_schema_version(try_parse_int());
+  if (schema_version < 2) {
+    std::fprintf(stderr, "Unsupported tl-schema version %d\n", static_cast<int>(schema_version));
+    std::abort();
+  }
+
+  try_parse_int();  // date
+  try_parse_int();  // version
+
+  std::int32_t types_n = try_parse_int();
+  std::size_t constructors_total = 0;
+  for (std::int32_t i = 0; i < types_n; i++) {
+    tl_type *type = read_type();
+    config.add_type(type);
+    constructors_total += type->constructors_num;
+  }
+
+  std::int32_t constructors_n = try_parse_int();
+  assert(static_cast<std::size_t>(constructors_n) == constructors_total);
+  for (std::int32_t i = 0; i < constructors_n; i++) {
+    tl_combinator *constructor = read_combinator();
+    config.get_type(constructor->type_id)->add_constructor(constructor);
+  }
+
+  std::int32_t functions_n = try_parse_int();
+  for (std::int32_t i = 0; i < functions_n; i++) {
+    config.add_function(read_combinator());
+  }
+  p.fetch_end();
+  try_parse(0);
+
+  return config;
+}
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_config.h b/submodules/ton/tonlib-src/tdtl/td/tl/tl_config.h
new file mode 100644
index 0000000000..2e56712070
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_config.h
@@ -0,0 +1,99 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "tl_core.h"
+#include "tl_simple_parser.h"
+
+#include <cstddef>
+#include <cstdint>
+#include <map>
+#include <string>
+#include <vector>
+
+namespace td {
+namespace tl {
+
+class tl_config {
+  std::vector<tl_type *> types;
+  std::map<std::int32_t, tl_type *> id_to_type;
+  std::map<std::string, tl_type *> name_to_type;
+
+  std::vector<tl_combinator *> functions;
+  std::map<std::int32_t, tl_combinator *> id_to_function;
+  std::map<std::string, tl_combinator *> name_to_function;
+
+ public:
+  void add_type(tl_type *type);
+
+  tl_type *get_type(std::int32_t type_id) const;
+
+  tl_type *get_type(const std::string &type_name);
+
+  void add_function(tl_combinator *function);
+
+  tl_combinator *get_function(std::int32_t function_id);
+
+  tl_combinator *get_function(const std::string &function_name);
+
+  std::size_t get_type_count() const;
+
+  tl_type *get_type_by_num(std::size_t num) const;
+
+  std::size_t get_function_count() const;
+
+  tl_combinator *get_function_by_num(std::size_t num) const;
+};
+
+class tl_config_parser {
+  tl_simple_parser p;
+  int schema_version;
+  tl_config config;
+
+  static int get_schema_version(std::int32_t version_id);
+
+  tl_tree *read_num_const();
+  tl_tree *read_num_var(int *var_count);
+  tl_tree *read_type_var(int *var_count);
+  tl_tree *read_array(int *var_count);
+  tl_tree *read_type(int *var_count);
+  tl_tree *read_type_expr(int *var_count);
+  tl_tree *read_nat_expr(int *var_count);
+  tl_tree *read_expr(int *var_count);
+  std::vector<arg> read_args_list(int *var_count);
+
+  tl_combinator *read_combinator();
+  tl_type *read_type();
+
+  template <class T>
+  T try_parse(const T &res) const;
+
+  std::int32_t try_parse_int();
+  std::int64_t try_parse_long();
+  std::string try_parse_string();
+
+ public:
+  tl_config_parser(const char *s, std::size_t len) : p(s, len), schema_version(-1) {
+  }
+
+  tl_config parse_config();
+};
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_core.cpp b/submodules/ton/tonlib-src/tdtl/td/tl/tl_core.cpp
new file mode 100644
index 0000000000..d38b0385e3
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_core.cpp
@@ -0,0 +1,33 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_core.h"
+
+#include <cassert>
+
+namespace td {
+namespace tl {
+
+void tl_type::add_constructor(tl_combinator *new_constructor) {
+  constructors.push_back(new_constructor);
+
+  assert(constructors.size() <= constructors_num);
+}
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_core.h b/submodules/ton/tonlib-src/tdtl/td/tl/tl_core.h
new file mode 100644
index 0000000000..8554ad02ae
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_core.h
@@ -0,0 +1,171 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <cstddef>
+#include <cstdint>
+#include <string>
+#include <vector>
+
+namespace td {
+namespace tl {
+
+const int NODE_TYPE_TYPE = 1;
+const int NODE_TYPE_NAT_CONST = 2;
+const int NODE_TYPE_VAR_TYPE = 3;
+const int NODE_TYPE_VAR_NUM = 4;
+const int NODE_TYPE_ARRAY = 5;
+
+const std::int32_t ID_VAR_NUM = 0x70659eff;
+const std::int32_t ID_VAR_TYPE = 0x2cecf817;
+const std::int32_t ID_INT = 0xa8509bda;
+const std::int32_t ID_LONG = 0x22076cba;
+const std::int32_t ID_DOUBLE = 0x2210c154;
+const std::int32_t ID_STRING = 0xb5286e24;
+const std::int32_t ID_VECTOR = 0x1cb5c415;
+const std::int32_t ID_DICTIONARY = 0x1f4c618f;
+const std::int32_t ID_MAYBE_TRUE = 0x3f9c8ef8;
+const std::int32_t ID_MAYBE_FALSE = 0x27930a7b;
+const std::int32_t ID_BOOL_FALSE = 0xbc799737;
+const std::int32_t ID_BOOL_TRUE = 0x997275b5;
+
+const std::int32_t FLAG_OPT_VAR = (1 << 17);
+const std::int32_t FLAG_EXCL = (1 << 18);
+const std::int32_t FLAG_NOVAR = (1 << 21);
+const std::int32_t FLAG_DEFAULT_CONSTRUCTOR = (1 << 25);
+const std::int32_t FLAG_BARE = (1 << 0);
+const std::int32_t FLAG_COMPLEX = (1 << 1);
+const std::int32_t FLAGS_MASK = ((1 << 16) - 1);
+
+class tl_combinator;
+
+class tl_tree;
+
+class tl_type {
+ public:
+  std::int32_t id;
+  std::string name;
+  int arity;
+  std::int32_t flags;
+  int simple_constructors;
+  std::size_t constructors_num;
+  std::vector<tl_combinator *> constructors;
+
+  void add_constructor(tl_combinator *new_constructor);
+};
+
+class arg {
+ public:
+  std::string name;
+  std::int32_t flags;
+  int var_num;
+  int exist_var_num;
+  int exist_var_bit;
+  tl_tree *type;
+};
+
+class tl_combinator {
+ public:
+  std::int32_t id;
+  std::string name;
+  int var_count;
+  std::int32_t type_id;
+  std::vector<arg> args;
+  tl_tree *result;
+};
+
+class tl_tree {
+ public:
+  std::int32_t flags;
+
+  explicit tl_tree(std::int32_t flags) : flags(flags) {
+  }
+
+  virtual int get_type() const = 0;
+
+  virtual ~tl_tree() {
+  }
+};
+
+class tl_tree_type : public tl_tree {
+ public:
+  tl_type *type;
+  std::vector<tl_tree *> children;
+
+  tl_tree_type(std::int32_t flags, tl_type *type, int child_count) : tl_tree(flags), type(type), children(child_count) {
+  }
+
+  virtual int get_type() const {
+    return NODE_TYPE_TYPE;
+  }
+};
+
+class tl_tree_nat_const : public tl_tree {
+ public:
+  int num;
+
+  tl_tree_nat_const(std::int32_t flags, int num) : tl_tree(flags), num(num) {
+  }
+
+  virtual int get_type() const {
+    return NODE_TYPE_NAT_CONST;
+  }
+};
+
+class tl_tree_var_type : public tl_tree {
+ public:
+  int var_num;
+
+  tl_tree_var_type(std::int32_t flags, int var_num) : tl_tree(flags), var_num(var_num) {
+  }
+
+  virtual int get_type() const {
+    return NODE_TYPE_VAR_TYPE;
+  }
+};
+
+class tl_tree_var_num : public tl_tree {
+ public:
+  int var_num;
+  int diff;
+
+  tl_tree_var_num(std::int32_t flags, int var_num, int diff) : tl_tree(flags), var_num(var_num), diff(diff) {
+  }
+
+  virtual int get_type() const {
+    return NODE_TYPE_VAR_NUM;
+  }
+};
+
+class tl_tree_array : public tl_tree {
+ public:
+  tl_tree *multiplicity;
+  std::vector<arg> args;
+
+  tl_tree_array(std::int32_t flags, tl_tree *multiplicity, const std::vector<arg> &a)
+      : tl_tree(flags), multiplicity(multiplicity), args(a) {
+  }
+
+  virtual int get_type() const {
+    return NODE_TYPE_ARRAY;
+  }
+};
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_file_outputer.cpp b/submodules/ton/tonlib-src/tdtl/td/tl/tl_file_outputer.cpp
new file mode 100644
index 0000000000..9fb347a50f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_file_outputer.cpp
@@ -0,0 +1,53 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_file_outputer.h"
+
+#include <cassert>
+
+namespace td {
+namespace tl {
+
+void tl_file_outputer::append(const std::string &str) {
+  assert(f != NULL);
+  std::fprintf(f, "%s", str.c_str());
+}
+
+tl_file_outputer::tl_file_outputer() : f(NULL) {
+}
+
+void tl_file_outputer::close() {
+  if (f) {
+    std::fclose(f);
+  }
+}
+
+bool tl_file_outputer::open(const std::string &file_name) {
+  close();
+
+  f = std::fopen(file_name.c_str(), "w");
+
+  return (f != NULL);
+}
+
+tl_file_outputer::~tl_file_outputer() {
+  close();
+}
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_file_outputer.h b/submodules/ton/tonlib-src/tdtl/td/tl/tl_file_outputer.h
new file mode 100644
index 0000000000..c8aeb919a0
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_file_outputer.h
@@ -0,0 +1,45 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "tl_outputer.h"
+
+#include <cstdio>
+#include <string>
+
+namespace td {
+namespace tl {
+
+class tl_file_outputer : public tl_outputer {
+  FILE *f;
+
+  void close();
+
+ public:
+  tl_file_outputer();
+
+  bool open(const std::string &file_name);
+
+  virtual void append(const std::string &str);
+
+  virtual ~tl_file_outputer();
+};
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_file_utils.cpp b/submodules/ton/tonlib-src/tdtl/td/tl/tl_file_utils.cpp
new file mode 100644
index 0000000000..86d982c2a9
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_file_utils.cpp
@@ -0,0 +1,105 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_file_utils.h"
+
+#include <cstdio>
+#include <cstdlib>
+
+namespace td {
+namespace tl {
+
+std::string get_file_contents(const std::string &file_name, const std::string &mode) {
+  FILE *f = std::fopen(file_name.c_str(), mode.c_str());
+  if (f == NULL) {
+    return std::string();
+  }
+
+  int fseek_res = std::fseek(f, 0, SEEK_END);
+  if (fseek_res != 0) {
+    std::fprintf(stderr, "Can't seek to the end of the file \"%s\"", file_name.c_str());
+    std::abort();
+  }
+  long size_long = std::ftell(f);
+  if (size_long < 0 || size_long >= (1 << 25)) {
+    std::fprintf(stderr, "Wrong file \"%s\" has wrong size = %ld", file_name.c_str(), size_long);
+    std::abort();
+  }
+  std::size_t size = static_cast<std::size_t>(size_long);
+
+  std::string result(size, ' ');
+  if (size != 0) {
+    std::rewind(f);
+    std::size_t fread_res = std::fread(&result[0], size, 1, f);
+    if (fread_res != 1) {
+      std::fprintf(stderr, "Can't read file \"%s\"", file_name.c_str());
+      std::abort();
+    }
+  }
+  std::fclose(f);
+
+  return result;
+}
+
+bool put_file_contents(const std::string &file_name, const std::string &mode, const std::string &contents) {
+  FILE *f = std::fopen(file_name.c_str(), mode.c_str());
+  if (f == NULL) {
+    std::fprintf(stderr, "Can't open file \"%s\"\n", file_name.c_str());
+    return false;
+  }
+
+  std::size_t fwrite_res = std::fwrite(contents.c_str(), contents.size(), 1, f);
+  if (fwrite_res != 1) {
+    std::fclose(f);
+    return false;
+  }
+  if (std::fclose(f) != 0) {
+    return false;
+  }
+  return true;
+}
+
+std::string remove_documentation(const std::string &str) {
+  std::size_t line_begin = 0;
+  std::string result;
+  bool inside_documentation = false;
+  while (line_begin < str.size()) {
+    std::size_t line_end = str.find('\n', line_begin);
+    if (line_end == std::string::npos) {
+      line_end = str.size() - 1;
+    }
+    std::string line = str.substr(line_begin, line_end - line_begin + 1);
+    line_begin = line_end + 1;
+
+    std::size_t pos = line.find_first_not_of(' ');
+    if (pos != std::string::npos && ((line[pos] == '/' && line[pos + 1] == '/' && line[pos + 2] == '/') ||
+                                     (line[pos] == '/' && line[pos + 1] == '*' && line[pos + 2] == '*') ||
+                                     (inside_documentation && line[pos] == '*'))) {
+      inside_documentation = !(line[pos] == '/' && line[pos + 1] == '/' && line[pos + 2] == '/') &&
+                             !(line[pos] == '*' && line[pos + 1] == '/');
+      continue;
+    }
+
+    inside_documentation = false;
+    result += line;
+  }
+  return result;
+}
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_file_utils.h b/submodules/ton/tonlib-src/tdtl/td/tl/tl_file_utils.h
new file mode 100644
index 0000000000..9dcd93a9cc
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_file_utils.h
@@ -0,0 +1,33 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <string>
+
+namespace td {
+namespace tl {
+
+std::string get_file_contents(const std::string &file_name, const std::string &mode);
+
+bool put_file_contents(const std::string &file_name, const std::string &mode, const std::string &contents);
+
+std::string remove_documentation(const std::string &str);
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_generate.cpp b/submodules/ton/tonlib-src/tdtl/td/tl/tl_generate.cpp
new file mode 100644
index 0000000000..a4886e8f1d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_generate.cpp
@@ -0,0 +1,856 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_generate.h"
+
+#include "tl_config.h"
+#include "tl_core.h"
+#include "tl_file_utils.h"
+#include "tl_outputer.h"
+#include "tl_string_outputer.h"
+#include "tl_writer.h"
+
+#include <cassert>
+#include <cstdint>
+#include <cstdio>
+#include <cstdlib>
+#include <set>
+#include <string>
+#include <vector>
+
+namespace td {
+namespace tl {
+
+static bool is_reachable_for_parser(int parser_type, const std::string &name,
+                                    const std::set<std::string> &request_types,
+                                    const std::set<std::string> &result_types, const TL_writer &w) {
+  TL_writer::Mode mode = w.get_parser_mode(parser_type);
+  if (mode == TL_writer::Client) {
+    return result_types.count(name) > 0;
+  }
+  if (mode == TL_writer::Server) {
+    return request_types.count(name) > 0;
+  }
+  return true;
+}
+
+static bool is_reachable_for_storer(int storer_type, const std::string &name,
+                                    const std::set<std::string> &request_types,
+                                    const std::set<std::string> &result_types, const TL_writer &w) {
+  TL_writer::Mode mode = w.get_storer_mode(storer_type);
+  if (mode == TL_writer::Client) {
+    return request_types.count(name) > 0;
+  }
+  if (mode == TL_writer::Server) {
+    return result_types.count(name) > 0;
+  }
+  return true;
+}
+
+static void write_class_constructor(tl_outputer &out, const tl_combinator *t, const std::string &class_name,
+                                    bool is_default, const TL_writer &w) {
+  //  std::fprintf(stderr, "Gen constructor %s\n", class_name.c_str());
+  int fields_num = 0;
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    fields_num += !w.gen_constructor_parameter(0, class_name, t->args[i], is_default).empty();
+  }
+
+  out.append(w.gen_constructor_begin(fields_num, class_name, is_default));
+  int field_num = 0;
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    std::string parameter_init = w.gen_constructor_parameter(field_num, class_name, t->args[i], is_default);
+    if (parameter_init.size()) {
+      out.append(parameter_init);
+      field_num++;
+    }
+  }
+  assert(field_num == fields_num);
+
+  field_num = 0;
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    std::string field_init = w.gen_constructor_field_init(field_num, class_name, t->args[i], is_default);
+    if (field_init.size()) {
+      out.append(field_init);
+      field_num++;
+    }
+  }
+
+  out.append(w.gen_constructor_end(t, field_num, is_default));
+}
+
+static void write_function_fetch(tl_outputer &out, const std::string &parser_name, const tl_combinator *t,
+                                 const std::string &class_name, const std::set<std::string> &request_types,
+                                 const std::set<std::string> &result_types, const TL_writer &w) {
+  //  std::fprintf(stderr, "Write function fetch %s\n", class_name.c_str());
+  std::vector<var_description> vars(t->var_count);
+  int parser_type = w.get_parser_type(t, parser_name);
+
+  if (!is_reachable_for_parser(parser_type, t->name, request_types, result_types, w)) {
+    return;
+  }
+
+  out.append(w.gen_fetch_function_begin(parser_name, class_name, class_name, 0, vars, parser_type));
+  out.append(w.gen_vars(t, NULL, vars));
+  int field_num = 0;
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    std::string field_fetch = w.gen_field_fetch(field_num, t->args[i], vars, false, parser_type);
+    if (field_fetch.size()) {
+      out.append(field_fetch);
+      field_num++;
+    }
+  }
+
+  out.append(w.gen_fetch_function_end(false, field_num, vars, parser_type));
+}
+
+static void write_function_store(tl_outputer &out, const std::string &storer_name, const tl_combinator *t,
+                                 const std::string &class_name, std::vector<var_description> &vars,
+                                 const std::set<std::string> &request_types, const std::set<std::string> &result_types,
+                                 const TL_writer &w) {
+  //  std::fprintf(stderr, "Write function store %s\n", class_name.c_str());
+  int storer_type = w.get_storer_type(t, storer_name);
+
+  if (!is_reachable_for_storer(storer_type, t->name, request_types, result_types, w)) {
+    return;
+  }
+
+  out.append(w.gen_store_function_begin(storer_name, class_name, 0, vars, storer_type));
+  out.append(w.gen_constructor_id_store(t->id, storer_type));
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    out.append(w.gen_field_store(t->args[i], vars, false, storer_type));
+  }
+
+  out.append(w.gen_store_function_end(vars, storer_type));
+}
+
+static void write_function_result_fetch(tl_outputer &out, const std::string &parser_name, const tl_combinator *t,
+                                        const std::string &class_name, const tl_tree *result,
+                                        const std::vector<var_description> &vars, const TL_writer &w) {
+  //  std::fprintf(stderr, "Write function result fetch %s\n", class_name.c_str());
+  int parser_type = w.get_parser_type(t, parser_name);
+
+  out.append(w.gen_fetch_function_result_begin(parser_name, class_name, result));
+
+  if (result->get_type() == NODE_TYPE_VAR_TYPE) {
+    const tl_tree_var_type *result_var_type = static_cast<const tl_tree_var_type *>(result);
+
+    for (std::size_t i = 0; i < t->args.size(); i++) {
+      const arg &a = t->args[i];
+
+      int arg_type = a.type->get_type();
+      if (arg_type == NODE_TYPE_VAR_TYPE) {
+        const tl_tree_var_type *tree_var_type = static_cast<const tl_tree_var_type *>(a.type);
+        assert(a.flags & FLAG_EXCL);
+        assert(tree_var_type->var_num >= 0);
+        if (tree_var_type->var_num == result_var_type->var_num) {
+          out.append(w.gen_var_type_fetch(a));
+        }
+      }
+    }
+  } else {
+    assert(result->get_type() == NODE_TYPE_TYPE);
+    const tl_tree_type *result_type = static_cast<const tl_tree_type *>(result);
+    out.append(w.gen_type_fetch("", result_type, vars, parser_type));
+  }
+
+  out.append(w.gen_fetch_function_result_end());
+
+  out.append(w.gen_fetch_function_result_any_begin(parser_name, class_name, false));
+  out.append(w.gen_fetch_function_result_any_end(false));
+}
+
+static void write_constructor_fetch(tl_outputer &out, const std::string &parser_name, const tl_combinator *t,
+                                    const std::string &class_name, const std::string &parent_class_name,
+                                    const tl_tree_type *result_type, bool is_flat,
+                                    const std::set<std::string> &request_types,
+                                    const std::set<std::string> &result_types, const TL_writer &w) {
+  std::vector<var_description> vars(t->var_count);
+
+  int parser_type = w.get_parser_type(t, parser_name);
+
+  if (!is_reachable_for_parser(parser_type, t->name, request_types, result_types, w)) {
+    return;
+  }
+
+  out.append(w.gen_fetch_function_begin(parser_name, class_name, parent_class_name,
+                                        static_cast<int>(result_type->children.size()), vars, parser_type));
+  out.append(w.gen_vars(t, result_type, vars));
+  out.append(w.gen_uni(result_type, vars, true));
+  int field_num = 0;
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    std::string field_fetch = w.gen_field_fetch(field_num, t->args[i], vars, is_flat, parser_type);
+    if (field_fetch.size()) {
+      out.append(field_fetch);
+      field_num++;
+    }
+  }
+
+  out.append(w.gen_fetch_function_end(class_name != parent_class_name, field_num, vars, parser_type));
+}
+
+static void write_constructor_store(tl_outputer &out, const std::string &storer_name, const tl_combinator *t,
+                                    const std::string &class_name, const tl_tree_type *result_type, bool is_flat,
+                                    const std::set<std::string> &request_types,
+                                    const std::set<std::string> &result_types, const TL_writer &w) {
+  std::vector<var_description> vars(t->var_count);
+  int storer_type = w.get_storer_type(t, storer_name);
+
+  if (!is_reachable_for_storer(storer_type, t->name, request_types, result_types, w)) {
+    return;
+  }
+
+  out.append(w.gen_store_function_begin(storer_name, class_name, static_cast<int>(result_type->children.size()), vars,
+                                        storer_type));
+  out.append(w.gen_vars(t, result_type, vars));
+  out.append(w.gen_uni(result_type, vars, false));
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    //  std::fprintf(stderr, "%s: %s\n", result_type->type->name.c_str(), t->name.c_str());
+    out.append(w.gen_field_store(t->args[i], vars, is_flat, storer_type));
+  }
+
+  out.append(w.gen_store_function_end(vars, storer_type));
+}
+
+static int gen_field_definitions(tl_outputer &out, const tl_combinator *t, const std::string &class_name,
+                                 const TL_writer &w) {
+  int required_args = 0;
+
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    const arg &a = t->args[i];
+
+    assert(-1 <= a.var_num && a.var_num < t->var_count);
+
+    required_args += !(a.flags & FLAG_OPT_VAR);
+
+    if (a.flags & FLAG_OPT_VAR) {
+      //    continue;
+    }
+
+    std::string type_name = w.gen_field_type(a);
+    if (type_name.size()) {
+      out.append(w.gen_field_definition(class_name, type_name, w.gen_field_name(a.name)));
+    }
+  }
+
+  return required_args;
+}
+
+static void write_function(tl_outputer &out, const tl_combinator *t, const std::set<std::string> &request_types,
+                           const std::set<std::string> &result_types, const TL_writer &w) {
+  assert(w.is_combinator_supported(t));
+
+  std::string class_name = w.gen_class_name(t->name);
+
+  out.append(w.gen_class_begin(class_name, w.gen_base_function_class_name(), false));
+
+  int required_args = gen_field_definitions(out, t, class_name, w);
+  out.append(w.gen_flags_definitions(t));
+
+  std::vector<var_description> vars(t->var_count);
+  out.append(w.gen_function_vars(t, vars));
+
+  write_class_constructor(out, t, class_name, true, w);
+  if (required_args) {
+    write_class_constructor(out, t, class_name, false, w);
+  }
+
+  out.append(w.gen_get_id(class_name, t->id, false));
+
+  out.append(w.gen_function_result_type(t->result));
+
+  //  PARSER
+  std::vector<std::string> parsers = w.get_parsers();
+  for (std::size_t i = 0; i < parsers.size(); i++) {
+    write_function_fetch(out, parsers[i], t, class_name, request_types, result_types, w);
+  }
+
+  //  STORER
+  std::vector<std::string> storers = w.get_storers();
+  for (std::size_t i = 0; i < storers.size(); i++) {
+    write_function_store(out, storers[i], t, class_name, vars, request_types, result_types, w);
+  }
+
+  //  PARSE RESULT
+  for (std::size_t i = 0; i < parsers.size(); i++) {
+    if (w.get_parser_mode(-1) == TL_writer::Server) {
+      continue;
+    }
+
+    write_function_result_fetch(out, parsers[i], t, class_name, t->result, vars, w);
+  }
+
+  //  ADDITIONAL FUNCTIONS
+  std::vector<std::string> additional_functions = w.get_additional_functions();
+  for (std::size_t i = 0; i < additional_functions.size(); i++) {
+    out.append(w.gen_additional_function(additional_functions[i], t, true));
+  }
+
+  out.append(w.gen_class_end());
+}
+
+static void write_constructor(tl_outputer &out, const tl_combinator *t, const std::string &base_class,
+                              const std::string &parent_class, bool is_proxy,
+                              const std::set<std::string> &request_types, const std::set<std::string> &result_types,
+                              const TL_writer &w) {
+  assert(w.is_combinator_supported(t));
+
+  std::string class_name = w.gen_class_name(t->name);
+
+  out.append(w.gen_class_begin(class_name, base_class, is_proxy));
+  int required_args = gen_field_definitions(out, t, class_name, w);
+  out.append(w.gen_flags_definitions(t));
+
+  write_class_constructor(out, t, class_name, true, w);
+  if (required_args) {
+    write_class_constructor(out, t, class_name, false, w);
+  }
+
+  out.append(w.gen_get_id(class_name, t->id, false));
+
+  //  PARSER
+  assert(t->result->get_type() == NODE_TYPE_TYPE);
+  const tl_tree_type *result_type = static_cast<const tl_tree_type *>(t->result);
+
+  std::vector<std::string> parsers = w.get_parsers();
+  for (std::size_t i = 0; i < parsers.size(); i++) {
+    write_constructor_fetch(out, parsers[i], t, class_name, parent_class, result_type,
+                            required_args == 1 && result_type->type->simple_constructors == 1, request_types,
+                            result_types, w);
+  }
+
+  //  STORER
+  std::vector<std::string> storers = w.get_storers();
+  for (std::size_t i = 0; i < storers.size(); i++) {
+    write_constructor_store(out, storers[i], t, class_name, result_type,
+                            required_args == 1 && result_type->type->simple_constructors == 1, request_types,
+                            result_types, w);
+  }
+
+  //  ADDITIONAL FUNCTIONS
+  std::vector<std::string> additional_functions = w.get_additional_functions();
+  for (std::size_t i = 0; i < additional_functions.size(); i++) {
+    out.append(w.gen_additional_function(additional_functions[i], t, false));
+  }
+
+  out.append(w.gen_class_end());
+}
+
+void write_class(tl_outputer &out, const tl_type *t, const std::set<std::string> &request_types,
+                 const std::set<std::string> &result_types, const TL_writer &w) {
+  assert(t->constructors_num > 0);
+  assert(!w.is_built_in_simple_type(t->name));
+  assert(!w.is_built_in_complex_type(t->name));
+  assert(!(t->flags & FLAG_COMPLEX));
+
+  assert(t->arity >= 0);
+  assert(t->simple_constructors > 0);
+  assert(t->flags == 0);
+
+  const std::string base_class = w.gen_base_type_class_name(t->arity);
+  const std::string class_name = w.gen_class_name(t->name);
+
+  std::vector<var_description> empty_vars;
+  bool optimize_one_constructor = (t->simple_constructors == 1);
+  if (!optimize_one_constructor) {
+    out.append(w.gen_class_begin(class_name, base_class, true));
+
+    out.append(w.gen_get_id(class_name, 0, true));
+
+    std::vector<std::string> parsers = w.get_parsers();
+    for (std::size_t i = 0; i < parsers.size(); i++) {
+      if (!is_reachable_for_parser(-1, t->name, request_types, result_types, w)) {
+        continue;
+      }
+
+      out.append(w.gen_fetch_function_begin(parsers[i], class_name, class_name, t->arity, empty_vars, -1));
+      out.append(w.gen_fetch_switch_begin());
+      for (std::size_t j = 0; j < t->constructors_num; j++) {
+        if (w.is_combinator_supported(t->constructors[j])) {
+          out.append(w.gen_fetch_switch_case(t->constructors[j], t->arity));
+        }
+      }
+
+      out.append(w.gen_fetch_switch_end());
+      out.append(w.gen_fetch_function_end(false, -1, empty_vars, -1));
+    }
+
+    std::vector<std::string> storers = w.get_storers();
+    for (std::size_t i = 0; i < storers.size(); i++) {
+      if (!is_reachable_for_storer(-1, t->name, request_types, result_types, w)) {
+        continue;
+      }
+
+      out.append(w.gen_store_function_begin(storers[i], class_name, t->arity, empty_vars, -1));
+      out.append(w.gen_store_function_end(empty_vars, -1));
+    }
+
+    std::vector<std::string> additional_functions = w.get_additional_functions();
+    for (std::size_t i = 0; i < additional_functions.size(); i++) {
+      out.append(w.gen_additional_proxy_function_begin(additional_functions[i], t, class_name, t->arity, false));
+      for (std::size_t j = 0; j < t->constructors_num; j++) {
+        if (w.is_combinator_supported(t->constructors[j])) {
+          out.append(
+              w.gen_additional_proxy_function_case(additional_functions[i], t, t->constructors[j], t->arity, false));
+        }
+      }
+
+      out.append(w.gen_additional_proxy_function_end(additional_functions[i], t, false));
+    }
+
+    out.append(w.gen_class_end());
+  }
+
+  int written_constructors = 0;
+  for (std::size_t i = 0; i < t->constructors_num; i++) {
+    if (w.is_combinator_supported(t->constructors[i])) {
+      if (optimize_one_constructor) {
+        write_constructor(out, t->constructors[i], base_class, w.gen_class_name(t->constructors[i]->name), false,
+                          request_types, result_types, w);
+        out.append(w.gen_class_alias(w.gen_class_name(t->constructors[i]->name), class_name));
+      } else {
+        write_constructor(out, t->constructors[i], class_name, class_name, false, request_types, result_types, w);
+      }
+      written_constructors++;
+    } else {
+      std::fprintf(stderr, "Skip complex constructor %s of %s\n", t->constructors[i]->name.c_str(), t->name.c_str());
+    }
+  }
+  assert(written_constructors == t->simple_constructors);
+}
+
+static void dfs_type(const tl_type *t, std::set<std::string> &found, const TL_writer &w);
+
+static void dfs_tree(const tl_tree *t, std::set<std::string> &found, const TL_writer &w) {
+  int type = t->get_type();
+
+  if (type == NODE_TYPE_ARRAY) {
+    const tl_tree_array *arr = static_cast<const tl_tree_array *>(t);
+    for (std::size_t i = 0; i < arr->args.size(); i++) {
+      dfs_tree(arr->args[i].type, found, w);
+    }
+  } else if (type == NODE_TYPE_TYPE) {
+    const tl_tree_type *tree_type = static_cast<const tl_tree_type *>(t);
+    dfs_type(tree_type->type, found, w);
+    for (std::size_t i = 0; i < tree_type->children.size(); i++) {
+      dfs_tree(tree_type->children[i], found, w);
+    }
+  } else {
+    assert(type == NODE_TYPE_VAR_TYPE);
+  }
+}
+
+static void dfs_combinator(const tl_combinator *constructor, std::set<std::string> &found, const TL_writer &w) {
+  if (!w.is_combinator_supported(constructor)) {
+    return;
+  }
+
+  if (!found.insert(constructor->name).second) {
+    return;
+  }
+
+  for (std::size_t i = 0; i < constructor->args.size(); i++) {
+    dfs_tree(constructor->args[i].type, found, w);
+  }
+}
+
+static void dfs_type(const tl_type *t, std::set<std::string> &found, const TL_writer &w) {
+  if (!found.insert(t->name).second) {
+    return;
+  }
+
+  if (t->constructors_num == 0 || w.is_built_in_simple_type(t->name) || w.is_built_in_complex_type(t->name)) {
+    return;
+  }
+
+  assert(!(t->flags & FLAG_COMPLEX));
+
+  for (std::size_t i = 0; i < t->constructors_num; i++) {
+    dfs_combinator(t->constructors[i], found, w);
+  }
+}
+
+void write_tl(const tl_config &config, tl_outputer &out, const TL_writer &w) {
+  out.append(w.gen_output_begin());
+
+  std::size_t types_n = config.get_type_count();
+  std::size_t functions_n = config.get_function_count();
+
+  bool found_complex = false;
+  for (std::size_t type = 0; type < types_n; type++) {
+    tl_type *t = config.get_type_by_num(type);
+    assert(t->constructors_num == t->constructors.size());
+    if (t->constructors_num == 0) {  // built-in dummy types
+      if (t->name == "Type") {
+        assert(t->id == ID_VAR_TYPE);
+        t->flags |= FLAG_COMPLEX;
+        found_complex = true;
+      }
+      continue;
+    }
+
+    for (std::size_t j = 0; j < t->constructors_num; j++) {
+      tl_combinator *constructor = t->constructors[j];
+      assert(constructor->type_id == t->id);
+      assert(constructor->result->get_type() == NODE_TYPE_TYPE);
+      assert(static_cast<const tl_tree_type *>(constructor->result)->type == t);
+      assert(static_cast<const tl_tree_type *>(constructor->result)->children.size() ==
+             static_cast<std::size_t>(t->arity));
+      assert(static_cast<const tl_tree_type *>(constructor->result)->flags == (t->arity > 0 ? 0 : FLAG_NOVAR));
+
+      for (std::size_t k = 0; k < constructor->args.size(); k++) {
+        const arg &a = constructor->args[k];
+
+        assert(-1 <= a.var_num && a.var_num <= constructor->var_count);
+
+        int arg_type = a.type->get_type();
+        assert(arg_type == NODE_TYPE_TYPE || arg_type == NODE_TYPE_VAR_TYPE || arg_type == NODE_TYPE_ARRAY);
+        if (a.var_num >= 0) {
+          assert(arg_type == NODE_TYPE_TYPE);
+          assert(static_cast<const tl_tree_type *>(a.type)->type->id == ID_VAR_NUM ||
+                 static_cast<const tl_tree_type *>(a.type)->type->id == ID_VAR_TYPE);
+        }
+
+        if (arg_type == NODE_TYPE_ARRAY) {
+          const tl_tree_array *arr = static_cast<const tl_tree_array *>(a.type);
+          assert(arr->multiplicity->get_type() == NODE_TYPE_NAT_CONST ||
+                 arr->multiplicity->get_type() == NODE_TYPE_VAR_NUM);
+          for (std::size_t l = 0; l < arr->args.size(); l++) {
+            const arg &b = arr->args[l];
+            int b_arg_type = b.type->get_type();
+            if (b_arg_type == NODE_TYPE_VAR_TYPE || b_arg_type == NODE_TYPE_ARRAY || b.var_num != -1 ||
+                b.exist_var_num != -1) {
+              if (!w.is_built_in_complex_type(t->name)) {
+                t->flags |= FLAG_COMPLEX;
+                found_complex = true;
+              }
+            } else {
+              assert(b_arg_type == NODE_TYPE_TYPE);
+            }
+            assert(b.flags == FLAG_NOVAR || b.flags == 0);
+          }
+        }
+      }
+    }
+
+    for (int i = 0; i < t->arity; i++) {
+      int main_type = static_cast<const tl_tree_type *>(t->constructors[0]->result)->children[i]->get_type();
+      for (std::size_t j = 1; j < t->constructors_num; j++) {
+        assert(static_cast<const tl_tree_type *>(t->constructors[j]->result)->children[i]->get_type() == main_type);
+      }
+      assert(main_type == NODE_TYPE_VAR_TYPE || main_type == NODE_TYPE_VAR_NUM);
+      if (main_type == NODE_TYPE_VAR_TYPE) {
+        if (!w.is_built_in_complex_type(t->name)) {
+          t->flags |= FLAG_COMPLEX;
+          found_complex = true;
+        }
+      }
+    }
+  }
+
+  while (found_complex) {
+    found_complex = false;
+    for (std::size_t type = 0; type < types_n; type++) {
+      tl_type *t = config.get_type_by_num(type);
+      if (t->constructors_num == 0 || w.is_built_in_complex_type(t->name)) {  // built-in dummy or complex types
+        continue;
+      }
+      if (t->flags & FLAG_COMPLEX) {  // already complex
+        continue;
+      }
+
+      t->simple_constructors = 0;
+      for (std::size_t i = 0; i < t->constructors_num; i++) {
+        t->simple_constructors += w.is_combinator_supported(t->constructors[i]);
+      }
+      if (t->simple_constructors == 0) {
+        t->flags |= FLAG_COMPLEX;
+        found_complex = true;
+        //  std::fprintf(stderr, "Found complex %s\n", t->name.c_str());
+      }
+    }
+  }
+
+  std::set<std::string> request_types;
+  std::set<std::string> result_types;
+  for (std::size_t function = 0; function < functions_n; function++) {
+    const tl_combinator *t = config.get_function_by_num(function);
+    dfs_combinator(t, request_types, w);
+    dfs_tree(t->result, result_types, w);
+  }
+
+  // write forward declarations
+  for (std::size_t type = 0; type < types_n; type++) {
+    tl_type *t = config.get_type_by_num(type);
+    if (t->constructors_num == 0 || w.is_built_in_simple_type(t->name) || w.is_built_in_complex_type(t->name) ||
+        (t->flags & FLAG_COMPLEX)) {  // built-in or complex types
+      continue;
+    }
+
+    assert(t->flags == 0);
+
+    if (t->simple_constructors != 1) {
+      out.append(w.gen_forward_class_declaration(w.gen_class_name(t->name), true));
+    } else {
+      for (std::size_t i = 0; i < t->constructors_num; i++) {
+        if (w.is_combinator_supported(t->constructors[i])) {
+          out.append(w.gen_forward_class_declaration(w.gen_class_name(t->constructors[i]->name), false));
+        }
+      }
+    }
+  }
+  for (int i = 0; i <= w.get_max_arity(); i++) {
+    out.append(w.gen_forward_class_declaration(w.gen_base_type_class_name(i), true));
+  }
+
+  for (std::size_t function = 0; function < functions_n; function++) {
+    tl_combinator *t = config.get_function_by_num(function);
+    if (!w.is_combinator_supported(t)) {
+      continue;
+    }
+
+    // out.append(w.gen_forward_class_declaration(w.gen_class_name(t->name), false));
+  }
+  // out.append(w.gen_forward_class_declaration(w.gen_base_function_class_name(), true));
+
+  // write base classes
+  std::vector<var_description> empty_vars;
+  for (int i = 0; i <= w.get_max_arity(); i++) {
+    out.append(w.gen_class_begin(w.gen_base_type_class_name(i), w.gen_base_tl_class_name(), true));
+
+    out.append(w.gen_get_id(w.gen_base_type_class_name(i), 0, true));
+
+    std::vector<std::string> parsers = w.get_parsers();
+    for (std::size_t j = 0; j < parsers.size(); j++) {
+      int case_count = 0;
+      for (std::size_t type = 0; type < types_n; type++) {
+        tl_type *t = config.get_type_by_num(type);
+        if (t->constructors_num == 0 || w.is_built_in_simple_type(t->name) || w.is_built_in_complex_type(t->name) ||
+            (t->flags & FLAG_COMPLEX)) {  // built-in or complex types
+          continue;
+        }
+        if (t->arity != i) {  // additional condition
+          continue;
+        }
+
+        for (std::size_t k = 0; k < t->constructors_num; k++) {
+          if (w.is_combinator_supported(t->constructors[k]) &&
+              is_reachable_for_parser(-1, t->constructors[k]->name, request_types, result_types, w)) {
+            case_count++;
+          }
+        }
+      }
+
+      if (case_count == 0) {
+        continue;
+      }
+
+      out.append(w.gen_fetch_function_begin(parsers[j], w.gen_base_type_class_name(i), w.gen_base_type_class_name(i), i,
+                                            empty_vars, -1));
+      out.append(w.gen_fetch_switch_begin());
+      for (std::size_t type = 0; type < types_n; type++) {
+        tl_type *t = config.get_type_by_num(type);
+        if (t->constructors_num == 0 || w.is_built_in_simple_type(t->name) || w.is_built_in_complex_type(t->name) ||
+            (t->flags & FLAG_COMPLEX)) {  // built-in or complex types
+          continue;
+        }
+        if (t->arity != i) {  // additional condition
+          continue;
+        }
+
+        for (std::size_t k = 0; k < t->constructors_num; k++) {
+          if (w.is_combinator_supported(t->constructors[k]) &&
+              is_reachable_for_parser(-1, t->constructors[k]->name, request_types, result_types, w)) {
+            out.append(w.gen_fetch_switch_case(t->constructors[k], i));
+          }
+        }
+      }
+      out.append(w.gen_fetch_switch_end());
+      out.append(w.gen_fetch_function_end(false, -1, empty_vars, -1));
+    }
+
+    std::vector<std::string> additional_functions = w.get_additional_functions();
+    for (std::size_t j = 0; j < additional_functions.size(); j++) {
+      out.append(w.gen_additional_proxy_function_begin(additional_functions[j], NULL, w.gen_base_type_class_name(i), i,
+                                                       false));
+      for (std::size_t type = 0; type < types_n; type++) {
+        tl_type *t = config.get_type_by_num(type);
+        if (t->constructors_num == 0 || w.is_built_in_simple_type(t->name) || w.is_built_in_complex_type(t->name) ||
+            (t->flags & FLAG_COMPLEX)) {  // built-in or complex types
+          continue;
+        }
+        if (t->arity != i) {  // additional condition
+          continue;
+        }
+
+        int function_type = w.get_additional_function_type(additional_functions[j]);
+        if ((function_type & 1) && t->simple_constructors != 1) {
+          out.append(w.gen_additional_proxy_function_case(additional_functions[j], NULL, w.gen_class_name(t->name), i));
+        }
+        if ((function_type & 2) || ((function_type & 1) && t->simple_constructors == 1)) {
+          for (std::size_t k = 0; k < t->constructors_num; k++) {
+            if (w.is_combinator_supported(t->constructors[k])) {
+              out.append(
+                  w.gen_additional_proxy_function_case(additional_functions[j], NULL, t->constructors[k], i, false));
+            }
+          }
+        }
+      }
+
+      out.append(w.gen_additional_proxy_function_end(additional_functions[j], NULL, false));
+    }
+
+    std::vector<std::string> storers = w.get_storers();
+    for (std::size_t j = 0; j < storers.size(); j++) {
+      out.append(w.gen_store_function_begin(storers[j], w.gen_base_type_class_name(i), i, empty_vars, -1));
+      out.append(w.gen_store_function_end(empty_vars, -1));
+    }
+
+    out.append(w.gen_class_end());
+  }
+
+  {
+    out.append(w.gen_class_begin(w.gen_base_function_class_name(), w.gen_base_tl_class_name(), true));
+
+    out.append(w.gen_get_id(w.gen_base_function_class_name(), 0, true));
+
+    std::vector<std::string> parsers = w.get_parsers();
+    for (std::size_t j = 0; j < parsers.size(); j++) {
+      if (w.get_parser_mode(-1) == TL_writer::Client) {
+        continue;
+      }
+
+      out.append(w.gen_fetch_function_begin(parsers[j], w.gen_base_function_class_name(),
+                                            w.gen_base_function_class_name(), 0, empty_vars, -1));
+      out.append(w.gen_fetch_switch_begin());
+      for (std::size_t function = 0; function < functions_n; function++) {
+        tl_combinator *t = config.get_function_by_num(function);
+
+        if (w.is_combinator_supported(t)) {
+          out.append(w.gen_fetch_switch_case(t, 0));
+        }
+      }
+      out.append(w.gen_fetch_switch_end());
+      out.append(w.gen_fetch_function_end(false, -1, empty_vars, -1));
+    }
+
+    std::vector<std::string> storers = w.get_storers();
+    for (std::size_t j = 0; j < storers.size(); j++) {
+      if (w.get_storer_mode(-1) == TL_writer::Server) {
+        continue;
+      }
+
+      out.append(w.gen_store_function_begin(storers[j], w.gen_base_function_class_name(), 0, empty_vars, -1));
+      out.append(w.gen_store_function_end(empty_vars, -1));
+    }
+
+    for (std::size_t j = 0; j < parsers.size(); j++) {
+      if (w.get_parser_mode(-1) == TL_writer::Server) {
+        continue;
+      }
+
+      out.append(w.gen_fetch_function_result_any_begin(parsers[j], w.gen_base_function_class_name(), true));
+      out.append(w.gen_fetch_function_result_any_end(true));
+    }
+
+    std::vector<std::string> additional_functions = w.get_additional_functions();
+    for (std::size_t j = 0; j < additional_functions.size(); j++) {
+      out.append(w.gen_additional_proxy_function_begin(additional_functions[j], NULL, w.gen_base_function_class_name(),
+                                                       0, true));
+      for (std::size_t function = 0; function < functions_n; function++) {
+        tl_combinator *t = config.get_function_by_num(function);
+
+        if (w.is_combinator_supported(t)) {
+          out.append(w.gen_additional_proxy_function_case(additional_functions[j], NULL, t, 0, true));
+        }
+      }
+
+      out.append(w.gen_additional_proxy_function_end(additional_functions[j], NULL, true));
+    }
+
+    out.append(w.gen_class_end());
+  }
+
+  for (std::size_t type = 0; type < types_n; type++) {
+    tl_type *t = config.get_type_by_num(type);
+    if (t->constructors_num == 0 || w.is_built_in_simple_type(t->name) ||
+        w.is_built_in_complex_type(t->name)) {  // built-in dummy or complex types
+      continue;
+    }
+
+    if (t->flags & FLAG_COMPLEX) {
+      std::fprintf(stderr, "Can't generate class %s\n", t->name.c_str());
+      continue;
+    }
+
+    write_class(out, t, request_types, result_types, w);
+  }
+
+  for (std::size_t function = 0; function < functions_n; function++) {
+    tl_combinator *t = config.get_function_by_num(function);
+    if (!w.is_combinator_supported(t)) {
+      // std::fprintf(stderr, "Function %s is too hard to store\n", t->name.c_str());
+      continue;
+    }
+
+    write_function(out, t, request_types, result_types, w);
+  }
+  out.append(w.gen_output_end());
+
+  for (std::size_t type = 0; type < types_n; type++) {
+    tl_type *t = config.get_type_by_num(type);
+    if (t->flags & FLAG_COMPLEX) {
+      t->flags &= ~FLAG_COMPLEX;  // remove temporary flag
+    }
+  }
+}
+
+tl_config read_tl_config_from_file(const std::string &file_name) {
+  std::string config = get_file_contents(file_name, "rb");
+  if (config.empty()) {
+    std::fprintf(stderr, "Config file %s is empty\n", file_name.c_str());
+    std::abort();
+  }
+  if (config.size() % sizeof(std::int32_t) != 0) {
+    std::fprintf(stderr, "Config size = %d is not multiple of %d\n", static_cast<int>(config.size()),
+                 static_cast<int>(sizeof(std::int32_t)));
+    std::abort();
+  }
+
+  tl_config_parser parser(config.c_str(), config.size());
+  return parser.parse_config();
+}
+
+bool write_tl_to_file(const tl_config &config, const std::string &file_name, const TL_writer &w) {
+  tl_string_outputer out;
+  write_tl(config, out, w);
+
+  auto old_file_contents = get_file_contents(file_name, "rb");
+  if (!w.is_documentation_generated()) {
+    old_file_contents = remove_documentation(old_file_contents);
+  }
+
+  if (old_file_contents != out.get_result()) {
+    std::fprintf(stderr, "Write tl to file %s\n", file_name.c_str());
+    return put_file_contents(file_name, "wb", out.get_result());
+  }
+
+  return true;
+}
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_generate.h b/submodules/ton/tonlib-src/tdtl/td/tl/tl_generate.h
new file mode 100644
index 0000000000..0561f1efdb
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_generate.h
@@ -0,0 +1,36 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "tl_config.h"
+#include "tl_outputer.h"
+#include "tl_writer.h"
+
+#include <string>
+
+namespace td {
+namespace tl {
+
+void write_tl(const tl_config &config, tl_outputer &out, const TL_writer &w);
+
+tl_config read_tl_config_from_file(const std::string &file_name);
+bool write_tl_to_file(const tl_config &config, const std::string &file_name, const TL_writer &w);
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_outputer.cpp b/submodules/ton/tonlib-src/tdtl/td/tl/tl_outputer.cpp
new file mode 100644
index 0000000000..8f6613c911
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_outputer.cpp
@@ -0,0 +1,28 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_outputer.h"
+
+namespace td {
+namespace tl {
+
+tl_outputer::~tl_outputer() {
+}
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_outputer.h b/submodules/ton/tonlib-src/tdtl/td/tl/tl_outputer.h
new file mode 100644
index 0000000000..3f07e0071e
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_outputer.h
@@ -0,0 +1,34 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <string>
+
+namespace td {
+namespace tl {
+
+class tl_outputer {
+ public:
+  virtual void append(const std::string &str) = 0;
+
+  virtual ~tl_outputer() = 0;
+};
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_simple.h b/submodules/ton/tonlib-src/tdtl/td/tl/tl_simple.h
new file mode 100644
index 0000000000..8cd06b4eec
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_simple.h
@@ -0,0 +1,247 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/tl/tl_config.h"
+
+#include <cassert>
+#include <cstddef>
+#include <cstdint>
+#include <map>
+#include <memory>
+#include <string>
+#include <vector>
+
+namespace td {
+namespace tl {
+namespace simple {
+// TL type is
+
+std::string gen_cpp_name(std::string name) {
+  for (std::size_t i = 0; i < name.size(); i++) {
+    if ((name[i] < '0' || '9' < name[i]) && (name[i] < 'a' || 'z' < name[i]) && (name[i] < 'A' || 'Z' < name[i])) {
+      name[i] = '_';
+    }
+  }
+  assert(name.size() > 0);
+  assert(name[name.size() - 1] != '_');
+  return name;
+}
+
+std::string gen_cpp_field_name(std::string name) {
+  return gen_cpp_name(name) + "_";
+}
+
+struct CustomType;
+struct Type {
+  enum {
+    Int32,
+    Int53,
+    Int64,
+    Double,
+    String,
+    Bytes,
+    SecureString,
+    SecureBytes,
+    Vector,
+    Bool,
+    Int128,
+    Int256,
+    True,
+    Object,
+    Function,
+    Custom
+  } type;
+
+  // type == Custom
+  bool is_bare{false};
+  const CustomType *custom{nullptr};
+
+  // type == Vector
+  const Type *vector_value_type{nullptr};
+};
+
+struct Arg {
+  const Type *type;
+  std::string name;
+};
+
+struct Constructor {
+  std::string name;
+  std::int32_t id;
+  std::vector<Arg> args;
+  const CustomType *type;
+};
+
+struct CustomType {
+  std::string name;
+  std::vector<const Constructor *> constructors;
+};
+
+struct Function {
+  std::string name;
+  std::int32_t id;
+  std::vector<Arg> args;
+  const Type *type;
+};
+
+class Schema {
+ public:
+  explicit Schema(const tl_config &config) {
+    config_ = &config;
+    for (std::size_t type_num = 0, type_count = config.get_type_count(); type_num < type_count; type_num++) {
+      auto *from_type = config.get_type_by_num(type_num);
+      if (from_type->name == "Vector") {
+        continue;
+      }
+      auto *type = get_type(from_type);
+      if (type->type == Type::Custom) {
+        custom_types.push_back(type->custom);
+      }
+    }
+    for (std::size_t function_num = 0, function_count = config.get_function_count(); function_num < function_count;
+         function_num++) {
+      auto *from_function = config.get_function_by_num(function_num);
+      functions.push_back(get_function(from_function));
+    }
+  }
+
+  std::vector<const CustomType *> custom_types;
+  std::vector<const Function *> functions;
+
+ private:
+  std::vector<std::unique_ptr<Function>> functions_;
+  std::vector<std::unique_ptr<Constructor>> constructors_;
+  std::vector<std::unique_ptr<CustomType>> custom_types_;
+  std::vector<std::unique_ptr<Type>> types_;
+
+  const tl_config *config_{nullptr};
+  std::map<std::int32_t, Type *> type_by_id;
+  std::map<std::int32_t, Constructor *> constructor_by_id;
+  std::map<std::int32_t, Function *> function_by_id;
+
+  const Type *get_type(const tl_type *from_type) {
+    auto &type = type_by_id[from_type->id];
+    if (!type) {
+      types_.push_back(std::make_unique<Type>());
+      type = types_.back().get();
+
+      if (from_type->name == "Int32" || from_type->name == "Int") {
+        type->type = Type::Int32;
+      } else if (from_type->name == "Int53") {
+        type->type = Type::Int53;
+      } else if (from_type->name == "Int64" || from_type->name == "Long") {
+        type->type = Type::Int64;
+      } else if (from_type->name == "Double") {
+        type->type = Type::Double;
+      } else if (from_type->name == "String") {
+        type->type = Type::String;
+      } else if (from_type->name == "Bytes") {
+        type->type = Type::Bytes;
+      } else if (from_type->name == "SecureString") {
+        type->type = Type::SecureString;
+      } else if (from_type->name == "SecureBytes") {
+        type->type = Type::SecureBytes;
+      } else if (from_type->name == "Bool") {
+        type->type = Type::Bool;
+      } else if (from_type->name == "Int128") {
+        type->type = Type::Int128;
+      } else if (from_type->name == "Int256") {
+        type->type = Type::Int256;
+      } else if (from_type->name == "True") {
+        type->type = Type::True;
+      } else if (from_type->name == "Object") {
+        type->type = Type::Object;
+      } else if (from_type->name == "Function") {
+        type->type = Type::Function;
+      } else if (from_type->name == "Vector") {
+        assert(false);  // unreachable
+      } else {
+        type->type = Type::Custom;
+        custom_types_.push_back(std::make_unique<CustomType>());
+        auto *custom_type = custom_types_.back().get();
+        type->custom = custom_type;
+        custom_type->name = from_type->name;
+        for (auto *constructor : from_type->constructors) {
+          custom_type->constructors.push_back(get_constructor(constructor));
+        }
+      }
+    }
+    return type;
+  }
+  const CustomType *get_custom_type(const tl_type *from_type) {
+    auto *type = get_type(from_type);
+    assert(type->type == Type::Custom);
+    return type->custom;
+  }
+
+  const Constructor *get_constructor(const tl_combinator *from) {
+    auto &constructor = constructor_by_id[from->id];
+    if (!constructor) {
+      constructors_.push_back(std::make_unique<Constructor>());
+      constructor = constructors_.back().get();
+      constructor->id = from->id;
+      constructor->name = from->name;
+      constructor->type = get_custom_type(config_->get_type(from->type_id));
+      for (auto &from_arg : from->args) {
+        Arg arg;
+        arg.name = from_arg.name;
+        arg.type = get_type(from_arg.type);
+        constructor->args.push_back(std::move(arg));
+      }
+    }
+    return constructor;
+  }
+  const Function *get_function(const tl_combinator *from) {
+    auto &function = function_by_id[from->id];
+    if (!function) {
+      functions_.push_back(std::make_unique<Function>());
+      function = functions_.back().get();
+      function->id = from->id;
+      function->name = from->name;
+      function->type = get_type(config_->get_type(from->type_id));
+      for (auto &from_arg : from->args) {
+        Arg arg;
+        arg.name = from_arg.name;
+        arg.type = get_type(from_arg.type);
+        function->args.push_back(std::move(arg));
+      }
+    }
+    return function;
+  }
+  const Type *get_type(const tl_tree *tree) {
+    assert(tree->get_type() == NODE_TYPE_TYPE);
+    auto *type_tree = static_cast<const tl_tree_type *>(tree);
+    if (type_tree->type->name == "Vector") {
+      assert(type_tree->children.size() == 1);
+      types_.push_back(std::make_unique<Type>());
+      auto *type = types_.back().get();
+      type->type = Type::Vector;
+      type->vector_value_type = get_type(type_tree->children[0]);
+      return type;
+    } else {
+      assert(type_tree->children.empty());
+      return get_type(type_tree->type);
+    }
+  }
+};
+
+}  // namespace simple
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_simple_parser.h b/submodules/ton/tonlib-src/tdtl/td/tl/tl_simple_parser.h
new file mode 100644
index 0000000000..fa705ab5a2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_simple_parser.h
@@ -0,0 +1,119 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <cassert>
+#include <cstdint>
+#include <cstring>
+#include <string>
+
+namespace td {
+namespace tl {
+
+class tl_simple_parser {
+  const char *data;
+  const char *data_begin;
+  std::size_t data_len;
+  const char *error;
+  std::size_t error_pos;
+
+  void set_error(const char *error_message) {
+    if (error == NULL) {
+      assert(error_message != NULL);
+      error = error_message;
+      error_pos = static_cast<std::size_t>(data - data_begin);
+      data = "\x00\x00\x00\x00\x00\x00\x00\x00";
+      data_len = 0;
+    } else {
+      data = "\x00\x00\x00\x00\x00\x00\x00\x00";
+      assert(data_len == 0);
+    }
+  }
+
+  void check_len(const std::size_t len) {
+    if (data_len < len) {
+      set_error("Not enough data to read");
+    } else {
+      data_len -= len;
+    }
+  }
+
+  tl_simple_parser(const tl_simple_parser &other);
+  tl_simple_parser &operator=(const tl_simple_parser &other);
+
+ public:
+  tl_simple_parser(const char *data, std::size_t data_len)
+      : data(data), data_begin(data), data_len(data_len), error(), error_pos() {
+  }
+
+  const char *get_error() const {
+    return error;
+  }
+
+  std::size_t get_error_pos() const {
+    return error_pos;
+  }
+
+  std::int32_t fetch_int() {
+    check_len(sizeof(std::int32_t));
+    std::int32_t result = *reinterpret_cast<const std::int32_t *>(data);
+    data += sizeof(std::int32_t);
+    return result;
+  }
+
+  std::int64_t fetch_long() {
+    check_len(sizeof(std::int64_t));
+    std::int64_t result;
+    std::memcpy(&result, data, sizeof(std::int64_t));
+    data += sizeof(std::int64_t);
+    return result;
+  }
+
+  std::string fetch_string() {
+    check_len(4);
+    int result_len = static_cast<unsigned char>(data[0]);
+    if (result_len < 254) {
+      check_len((result_len >> 2) * 4);
+      std::string result(data + 1, result_len);
+      data += ((result_len >> 2) + 1) * 4;
+      return result;
+    }
+
+    if (result_len == 254) {
+      result_len = static_cast<unsigned char>(data[1]) + (static_cast<unsigned char>(data[2]) << 8) +
+                   (static_cast<unsigned char>(data[3]) << 16);
+      check_len(((result_len + 3) >> 2) * 4);
+      std::string result(data + 4, result_len);
+      data += ((result_len + 7) >> 2) * 4;
+      return result;
+    }
+
+    set_error("Can't fetch string, 255 found");
+    return std::string();
+  }
+
+  void fetch_end() {
+    if (data_len) {
+      set_error("Too much data to fetch");
+    }
+  }
+};
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_string_outputer.cpp b/submodules/ton/tonlib-src/tdtl/td/tl/tl_string_outputer.cpp
new file mode 100644
index 0000000000..f2fbc4082a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_string_outputer.cpp
@@ -0,0 +1,44 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_string_outputer.h"
+
+namespace td {
+namespace tl {
+
+void tl_string_outputer::append(const std::string &str) {
+  result += str;
+}
+
+std::string tl_string_outputer::get_result() const {
+#if defined(_WIN32)
+  std::string fixed_result;
+  for (std::size_t i = 0; i < result.size(); i++) {
+    if (result[i] == '\n') {
+      fixed_result += '\r';
+    }
+    fixed_result += result[i];
+  }
+  return fixed_result;
+#else
+  return result;
+#endif
+}
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_string_outputer.h b/submodules/ton/tonlib-src/tdtl/td/tl/tl_string_outputer.h
new file mode 100644
index 0000000000..ceffe3690e
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_string_outputer.h
@@ -0,0 +1,38 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "tl_outputer.h"
+
+#include <string>
+
+namespace td {
+namespace tl {
+
+class tl_string_outputer : public tl_outputer {
+  std::string result;
+
+ public:
+  virtual void append(const std::string &str);
+
+  std::string get_result() const;
+};
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_writer.cpp b/submodules/ton/tonlib-src/tdtl/td/tl/tl_writer.cpp
new file mode 100644
index 0000000000..3f18c362ef
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_writer.cpp
@@ -0,0 +1,243 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_writer.h"
+
+#include "tl_core.h"
+
+#include <cassert>
+#include <cstdio>
+
+namespace td {
+namespace tl {
+
+std::string TL_writer::int_to_string(int x) {
+  char buf[15];
+  std::sprintf(buf, "%d", x);
+  return buf;
+}
+
+bool TL_writer::is_alnum(char c) {
+  return ('0' <= c && c <= '9') || ('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z');
+}
+
+char TL_writer::to_lower(char c) {
+  return 'A' <= c && c <= 'Z' ? static_cast<char>(c - 'A' + 'a') : c;
+}
+
+char TL_writer::to_upper(char c) {
+  return 'a' <= c && c <= 'z' ? static_cast<char>(c - 'a' + 'A') : c;
+}
+
+std::vector<std::string> TL_writer::get_additional_functions() const {
+  return std::vector<std::string>();
+}
+
+bool TL_writer::is_type_supported(const tl_tree_type *tree_type) const {
+  if (tree_type->type->flags & FLAG_COMPLEX) {
+    return false;
+  }
+
+  for (std::size_t i = 0; i < tree_type->children.size(); i++) {
+    const tl_tree *child = tree_type->children[i];
+    assert(child->get_type() == NODE_TYPE_TYPE || child->get_type() == NODE_TYPE_VAR_TYPE ||
+           child->get_type() == NODE_TYPE_NAT_CONST || child->get_type() == NODE_TYPE_VAR_NUM);
+
+    if (child->get_type() == NODE_TYPE_TYPE) {
+      if (!is_type_supported(static_cast<const tl_tree_type *>(child))) {
+        return false;
+      }
+    }
+    if (child->get_type() == NODE_TYPE_VAR_TYPE) {
+      return false;  // TODO
+    }
+  }
+
+  return true;
+}
+
+bool TL_writer::is_combinator_supported(const tl_combinator *constructor) const {
+  std::vector<bool> is_function_result(constructor->var_count);
+  for (std::size_t i = 0; i < constructor->args.size(); i++) {
+    const arg &a = constructor->args[i];
+
+    int arg_type = a.type->get_type();
+    if (arg_type == NODE_TYPE_VAR_TYPE) {
+      const tl_tree_var_type *t = static_cast<const tl_tree_var_type *>(a.type);
+      if (a.flags & FLAG_EXCL) {
+        assert(t->var_num >= 0);
+        if (is_function_result[t->var_num]) {
+          return false;  // lazy to check that result of two function calls is the same
+        }
+        is_function_result[t->var_num] = true;
+      } else {
+        return false;  // do not support generic types
+      }
+    }
+  }
+
+  for (std::size_t i = 0; i < constructor->args.size(); i++) {
+    const arg &a = constructor->args[i];
+
+    int arg_type = a.type->get_type();
+    if (a.var_num >= 0) {
+      assert(arg_type == NODE_TYPE_TYPE);
+      const tl_tree_type *a_type = static_cast<const tl_tree_type *>(a.type);
+      if (a_type->type->id == ID_VAR_TYPE) {
+        assert(!(a_type->flags & FLAG_EXCL));
+        if (!is_function_result[a.var_num]) {
+          assert(false);  // not possible, otherwise type is an argument of a type, but all types with type arguments
+                          // are already marked complex
+          return false;
+        } else {
+          continue;
+        }
+      }
+    }
+
+    if (arg_type == NODE_TYPE_VAR_TYPE) {
+      continue;
+    } else if (arg_type == NODE_TYPE_TYPE) {
+      if (!is_type_supported(static_cast<const tl_tree_type *>(a.type))) {
+        return false;
+      }
+    } else {
+      assert(arg_type == NODE_TYPE_ARRAY);
+      const tl_tree_array *arr = static_cast<const tl_tree_array *>(a.type);
+      for (std::size_t j = 0; j < arr->args.size(); j++) {
+        const arg &b = arr->args[j];
+        assert(b.type->get_type() == NODE_TYPE_TYPE && b.var_num == -1);
+        if (!is_type_supported(static_cast<const tl_tree_type *>(b.type))) {
+          return false;
+        }
+      }
+    }
+  }
+
+  tl_tree *result = constructor->result;
+  if (result->get_type() == NODE_TYPE_TYPE) {
+    if (!is_type_supported(static_cast<const tl_tree_type *>(result))) {
+      return false;
+    }
+  } else {
+    assert(result->get_type() == NODE_TYPE_VAR_TYPE);
+    const tl_tree_var_type *t = static_cast<const tl_tree_var_type *>(result);
+    return is_function_result[t->var_num];
+  }
+
+  return true;
+}
+
+bool TL_writer::is_documentation_generated() const {
+  return false;
+}
+
+std::string TL_writer::gen_main_class_name(const tl_type *t) const {
+  if (t->simple_constructors == 1) {
+    for (std::size_t i = 0; i < t->constructors_num; i++) {
+      if (is_combinator_supported(t->constructors[i])) {
+        return gen_class_name(t->constructors[i]->name);
+      }
+    }
+  }
+
+  return gen_class_name(t->name);
+}
+
+int TL_writer::get_parser_type(const tl_combinator *t, const std::string &parser_name) const {
+  return t->var_count > 0;
+}
+
+int TL_writer::get_storer_type(const tl_combinator *t, const std::string &storer_name) const {
+  return 0;
+}
+
+int TL_writer::get_additional_function_type(const std::string &additional_function_name) const {
+  return 0;
+}
+
+TL_writer::Mode TL_writer::get_parser_mode(int type) const {
+  return All;
+}
+
+TL_writer::Mode TL_writer::get_storer_mode(int type) const {
+  return All;
+}
+
+std::string TL_writer::gen_field_type(const arg &a) const {
+  if (a.flags & FLAG_EXCL) {
+    assert(a.flags == FLAG_EXCL);
+    assert(a.type->get_type() == NODE_TYPE_VAR_TYPE);
+
+    return gen_var_type_name();
+  }
+
+  assert(a.flags == FLAG_NOVAR || a.flags == 0 || a.flags == (FLAG_OPT_VAR | FLAG_NOVAR | FLAG_BARE));
+
+  if (a.type->get_type() == NODE_TYPE_TYPE) {
+    const tl_tree_type *arg_type = static_cast<const tl_tree_type *>(a.type);
+    assert(arg_type->children.size() == static_cast<std::size_t>(arg_type->type->arity));
+
+    if (arg_type->type->id == ID_VAR_TYPE) {
+      return std::string();
+    }
+
+    return gen_type_name(arg_type);
+  } else {
+    assert(a.flags == FLAG_NOVAR || a.flags == 0);
+
+    assert(a.type->get_type() == NODE_TYPE_ARRAY);
+    const tl_tree_array *arg_array = static_cast<const tl_tree_array *>(a.type);
+    assert((arg_array->flags & ~FLAG_NOVAR) == 0);
+    return gen_array_type_name(arg_array, a.name);
+  }
+}
+
+std::string TL_writer::gen_additional_function(const std::string &function_name, const tl_combinator *t,
+                                               bool is_function) const {
+  assert(false);
+  return "";
+}
+
+std::string TL_writer::gen_additional_proxy_function_begin(const std::string &function_name, const tl_type *type,
+                                                           const std::string &class_name, int arity,
+                                                           bool is_function) const {
+  assert(false);
+  return "";
+}
+
+std::string TL_writer::gen_additional_proxy_function_case(const std::string &function_name, const tl_type *type,
+                                                          const std::string &class_name, int arity) const {
+  assert(false);
+  return "";
+}
+
+std::string TL_writer::gen_additional_proxy_function_case(const std::string &function_name, const tl_type *type,
+                                                          const tl_combinator *t, int arity, bool is_function) const {
+  assert(false);
+  return "";
+}
+
+std::string TL_writer::gen_additional_proxy_function_end(const std::string &function_name, const tl_type *type,
+                                                         bool is_function) const {
+  assert(false);
+  return "";
+}
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdtl/td/tl/tl_writer.h b/submodules/ton/tonlib-src/tdtl/td/tl/tl_writer.h
new file mode 100644
index 0000000000..402dd5e616
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdtl/td/tl/tl_writer.h
@@ -0,0 +1,175 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "tl_core.h"
+
+#include <cstdint>
+#include <string>
+#include <vector>
+
+namespace td {
+namespace tl {
+
+class var_description {
+ public:
+  int index;
+  bool is_stored;
+  bool is_type;
+  int parameter_num;
+  int function_arg_num;
+
+  var_description() : index(-1), is_stored(false), is_type(false), parameter_num(-1), function_arg_num(-1) {
+  }
+};
+
+class TL_writer {
+  TL_writer(const TL_writer &other);
+  TL_writer &operator=(const TL_writer &other);
+
+ protected:
+  const std::string tl_name;
+
+ public:
+  enum Mode { All, Client, Server };
+
+  explicit TL_writer(const std::string &tl_name) : tl_name(tl_name) {
+  }
+
+  virtual ~TL_writer() {
+  }
+
+  virtual int get_max_arity() const = 0;
+
+  static std::string int_to_string(int x);
+  static bool is_alnum(char c);
+  static char to_lower(char c);
+  static char to_upper(char c);
+
+  virtual bool is_built_in_simple_type(const std::string &name) const = 0;
+  virtual bool is_built_in_complex_type(const std::string &name) const = 0;
+  virtual bool is_type_supported(const tl_tree_type *tree_type) const;
+  virtual bool is_type_bare(const tl_type *t) const = 0;
+  virtual bool is_combinator_supported(const tl_combinator *constructor) const;
+  virtual bool is_documentation_generated() const;
+
+  virtual int get_parser_type(const tl_combinator *t, const std::string &parser_name) const;
+  virtual int get_storer_type(const tl_combinator *t, const std::string &storer_name) const;
+  virtual int get_additional_function_type(const std::string &additional_function_name) const;
+  virtual Mode get_parser_mode(int type) const;
+  virtual Mode get_storer_mode(int type) const;
+  virtual std::vector<std::string> get_parsers() const = 0;
+  virtual std::vector<std::string> get_storers() const = 0;
+  virtual std::vector<std::string> get_additional_functions() const;
+
+  virtual std::string gen_base_tl_class_name() const = 0;
+  virtual std::string gen_base_type_class_name(int arity) const = 0;
+  virtual std::string gen_base_function_class_name() const = 0;
+  virtual std::string gen_class_name(std::string name) const = 0;
+  virtual std::string gen_field_name(std::string name) const = 0;
+  virtual std::string gen_var_name(const var_description &desc) const = 0;
+  virtual std::string gen_parameter_name(int index) const = 0;
+  virtual std::string gen_main_class_name(const tl_type *t) const;
+  virtual std::string gen_field_type(const arg &a) const;
+  virtual std::string gen_type_name(const tl_tree_type *tree_type) const = 0;
+  virtual std::string gen_array_type_name(const tl_tree_array *arr, const std::string &field_name) const = 0;
+  virtual std::string gen_var_type_name() const = 0;
+
+  virtual std::string gen_int_const(const tl_tree *tree_c, const std::vector<var_description> &vars) const = 0;
+
+  virtual std::string gen_output_begin() const = 0;
+  virtual std::string gen_output_end() const = 0;
+
+  virtual std::string gen_forward_class_declaration(const std::string &class_name, bool is_proxy) const = 0;
+
+  virtual std::string gen_class_begin(const std::string &class_name, const std::string &base_class_name,
+                                      bool is_proxy) const = 0;
+  virtual std::string gen_class_end() const = 0;
+
+  virtual std::string gen_class_alias(const std::string &class_name, const std::string &alias_name) const = 0;
+
+  virtual std::string gen_field_definition(const std::string &class_name, const std::string &type_name,
+                                           const std::string &field_name) const = 0;
+  virtual std::string gen_flags_definitions(const tl_combinator *t) const {
+    return "";
+  }
+
+  virtual std::string gen_vars(const tl_combinator *t, const tl_tree_type *result_type,
+                               std::vector<var_description> &vars) const = 0;
+  virtual std::string gen_function_vars(const tl_combinator *t, std::vector<var_description> &vars) const = 0;
+  virtual std::string gen_uni(const tl_tree_type *result_type, std::vector<var_description> &vars,
+                              bool check_negative) const = 0;
+  virtual std::string gen_constructor_id_store(std::int32_t id, int storer_type) const = 0;
+  virtual std::string gen_field_fetch(int field_num, const arg &a, std::vector<var_description> &vars, bool flat,
+                                      int parser_type) const = 0;
+  virtual std::string gen_field_store(const arg &a, std::vector<var_description> &vars, bool flat,
+                                      int storer_type) const = 0;
+  virtual std::string gen_type_fetch(const std::string &field_name, const tl_tree_type *tree_type,
+                                     const std::vector<var_description> &vars, int parser_type) const = 0;
+  virtual std::string gen_type_store(const std::string &field_name, const tl_tree_type *tree_type,
+                                     const std::vector<var_description> &vars, int storer_type) const = 0;
+  virtual std::string gen_var_type_fetch(const arg &a) const = 0;
+
+  virtual std::string gen_get_id(const std::string &class_name, std::int32_t id, bool is_proxy) const = 0;
+
+  virtual std::string gen_function_result_type(const tl_tree *result) const = 0;
+
+  virtual std::string gen_fetch_function_begin(const std::string &parser_name, const std::string &class_name,
+                                               const std::string &parent_class_name, int arity,
+                                               std::vector<var_description> &vars, int parser_type) const = 0;
+  virtual std::string gen_fetch_function_end(bool has_parent, int field_num, const std::vector<var_description> &vars,
+                                             int parser_type) const = 0;
+
+  virtual std::string gen_fetch_function_result_begin(const std::string &parser_name, const std::string &class_name,
+                                                      const tl_tree *result) const = 0;
+  virtual std::string gen_fetch_function_result_end() const = 0;
+  virtual std::string gen_fetch_function_result_any_begin(const std::string &parser_name, const std::string &class_name,
+                                                          bool is_proxy) const = 0;
+  virtual std::string gen_fetch_function_result_any_end(bool is_proxy) const = 0;
+
+  virtual std::string gen_store_function_begin(const std::string &storer_name, const std::string &class_name, int arity,
+                                               std::vector<var_description> &vars, int storer_type) const = 0;
+  virtual std::string gen_store_function_end(const std::vector<var_description> &vars, int storer_type) const = 0;
+
+  virtual std::string gen_fetch_switch_begin() const = 0;
+  virtual std::string gen_fetch_switch_case(const tl_combinator *t, int arity) const = 0;
+  virtual std::string gen_fetch_switch_end() const = 0;
+
+  virtual std::string gen_constructor_begin(int fields_num, const std::string &class_name, bool is_default) const = 0;
+  virtual std::string gen_constructor_parameter(int field_num, const std::string &class_name, const arg &a,
+                                                bool is_default) const = 0;
+  virtual std::string gen_constructor_field_init(int field_num, const std::string &class_name, const arg &a,
+                                                 bool is_default) const = 0;
+  virtual std::string gen_constructor_end(const tl_combinator *t, int fields_num, bool is_default) const = 0;
+
+  virtual std::string gen_additional_function(const std::string &function_name, const tl_combinator *t,
+                                              bool is_function) const;
+  virtual std::string gen_additional_proxy_function_begin(const std::string &function_name, const tl_type *type,
+                                                          const std::string &class_name, int arity,
+                                                          bool is_function) const;
+  virtual std::string gen_additional_proxy_function_case(const std::string &function_name, const tl_type *type,
+                                                         const std::string &class_name, int arity) const;
+  virtual std::string gen_additional_proxy_function_case(const std::string &function_name, const tl_type *type,
+                                                         const tl_combinator *t, int arity, bool is_function) const;
+  virtual std::string gen_additional_proxy_function_end(const std::string &function_name, const tl_type *type,
+                                                        bool is_function) const;
+};
+
+}  // namespace tl
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/.gitrepo b/submodules/ton/tonlib-src/tdutils/.gitrepo
new file mode 100644
index 0000000000..dd9b347e28
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/.gitrepo
@@ -0,0 +1,12 @@
+; DO NOT EDIT (unless you know what you are doing)
+;
+; This subdirectory is a git "subrepo", and this file is maintained by the
+; git-subrepo command. See https://github.com/git-commands/git-subrepo#readme
+;
+[subrepo]
+	remote = git@github.com:arseny30/tdutils.git
+	branch = master
+	commit = cebe6b0ee08089006ff9ed7d3c4ec38be23b22fa
+	parent = ce4bbf3c37dcc2fdce25ba07d3d8432ce2d77d85
+	cmdver = 0.4.0
+	method = merge
diff --git a/submodules/ton/tonlib-src/tdutils/CMakeLists.txt b/submodules/ton/tonlib-src/tdutils/CMakeLists.txt
new file mode 100644
index 0000000000..b8081aa67e
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/CMakeLists.txt
@@ -0,0 +1,330 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+if (WIN32)
+  if (WINGETOPT_FOUND)
+    set(TD_HAVE_GETOPT 1)
+  endif()
+else()
+  set(TD_HAVE_GETOPT 1)
+endif()
+
+if (NOT ZLIB_FOUND)
+  find_package(ZLIB)
+endif()
+if (ZLIB_FOUND)
+  set(TD_HAVE_ZLIB 1)
+  message(STATUS "Found ZLIB: ${ZLIB_INCLUDE_DIR} ${ZLIB_LIBRARIES}")
+
+  # OpenSSL internally depends on zlib
+  if (NOT OPENSSL_FOUND)
+    find_package(OpenSSL)
+  endif()
+  if (OPENSSL_FOUND)
+    set(TD_HAVE_OPENSSL 1)
+  endif()
+endif()
+
+if (CRC32C_FOUND)
+  set(TD_HAVE_CRC32C 1)
+endif()
+
+if (ABSL_FOUND)
+  set(TD_HAVE_ABSL 1)
+endif()
+
+configure_file(td/utils/config.h.in td/utils/config.h @ONLY)
+
+add_subdirectory(generate)
+
+# TDUTILS
+set_source_files_properties(${TDMIME_AUTO} PROPERTIES GENERATED TRUE)
+if (CLANG OR GCC)
+  set_property(SOURCE ${TDMIME_AUTO} APPEND_STRING PROPERTY COMPILE_FLAGS " -Wno-conversion")
+elseif (MSVC)
+  set_property(SOURCE ${TDMIME_AUTO} APPEND_STRING PROPERTY COMPILE_FLAGS " /wd4267")
+endif()
+if (CLANG)
+  set_property(SOURCE ${TDMIME_AUTO} APPEND_STRING PROPERTY COMPILE_FLAGS " -Wno-deprecated-register")
+endif()
+
+set(TDUTILS_SOURCE
+  td/utils/port/Clocks.cpp
+  td/utils/port/FileFd.cpp
+  td/utils/port/IPAddress.cpp
+  td/utils/port/MemoryMapping.cpp
+  td/utils/port/path.cpp
+  td/utils/port/PollFlags.cpp
+  td/utils/port/ServerSocketFd.cpp
+  td/utils/port/signals.cpp
+  td/utils/port/sleep.cpp
+  td/utils/port/SocketFd.cpp
+  td/utils/port/stacktrace.cpp
+  td/utils/port/Stat.cpp
+  td/utils/port/StdStreams.cpp
+  td/utils/port/thread_local.cpp
+  td/utils/port/user.cpp
+  td/utils/port/UdpSocketFd.cpp
+  td/utils/port/wstring_convert.cpp
+
+  td/utils/port/detail/Epoll.cpp
+  td/utils/port/detail/EventFdBsd.cpp
+  td/utils/port/detail/EventFdLinux.cpp
+  td/utils/port/detail/EventFdWindows.cpp
+  td/utils/port/detail/Iocp.cpp
+  td/utils/port/detail/KQueue.cpp
+  td/utils/port/detail/NativeFd.cpp
+  td/utils/port/detail/Poll.cpp
+  td/utils/port/detail/Select.cpp
+  td/utils/port/detail/ThreadIdGuard.cpp
+  td/utils/port/detail/WineventPoll.cpp
+
+  ${TDMIME_AUTO}
+
+  td/utils/base64.cpp
+  td/utils/BigNum.cpp
+  td/utils/buffer.cpp
+  td/utils/BufferedUdp.cpp
+  td/utils/check.cpp
+  td/utils/crypto.cpp
+  td/utils/FileLog.cpp
+  td/utils/filesystem.cpp
+  td/utils/find_boundary.cpp
+  td/utils/Gzip.cpp
+  td/utils/GzipByteFlow.cpp
+  td/utils/Hints.cpp
+  td/utils/HttpUrl.cpp
+  td/utils/JsonBuilder.cpp
+  td/utils/logging.cpp
+  td/utils/misc.cpp
+  td/utils/MimeType.cpp
+  td/utils/MpmcQueue.cpp
+  td/utils/OptionsParser.cpp
+  td/utils/Random.cpp
+  td/utils/Slice.cpp
+  td/utils/SharedSlice.cpp
+  td/utils/StackAllocator.cpp
+  td/utils/Status.cpp
+  td/utils/StringBuilder.cpp
+  td/utils/Time.cpp
+  td/utils/Timer.cpp
+  td/utils/TsFileLog.cpp
+  td/utils/tests.cpp
+  td/utils/tl_parsers.cpp
+  td/utils/translit.cpp
+  td/utils/unicode.cpp
+  td/utils/utf8.cpp
+
+  td/utils/port/Clocks.h
+  td/utils/port/config.h
+  td/utils/port/CxCli.h
+  td/utils/port/EventFd.h
+  td/utils/port/EventFdBase.h
+  td/utils/port/FileFd.h
+  td/utils/port/IPAddress.h
+  td/utils/port/IoSlice.h
+  td/utils/port/MemoryMapping.h
+  td/utils/port/path.h
+  td/utils/port/platform.h
+  td/utils/port/Poll.h
+  td/utils/port/PollBase.h
+  td/utils/port/PollFlags.h
+  td/utils/port/RwMutex.h
+  td/utils/port/ServerSocketFd.h
+  td/utils/port/signals.h
+  td/utils/port/sleep.h
+  td/utils/port/SocketFd.h
+  td/utils/port/stacktrace.h
+  td/utils/port/Stat.h
+  td/utils/port/StdStreams.h
+  td/utils/port/thread.h
+  td/utils/port/thread_local.h
+  td/utils/port/user.h
+  td/utils/port/UdpSocketFd.h
+  td/utils/port/wstring_convert.h
+
+  td/utils/port/detail/Epoll.h
+  td/utils/port/detail/EventFdBsd.h
+  td/utils/port/detail/EventFdLinux.h
+  td/utils/port/detail/EventFdWindows.h
+  td/utils/port/detail/Iocp.h
+  td/utils/port/detail/KQueue.h
+  td/utils/port/detail/NativeFd.h
+  td/utils/port/detail/Poll.h
+  td/utils/port/detail/PollableFd.h
+  td/utils/port/detail/Select.h
+  td/utils/port/detail/ThreadIdGuard.h
+  td/utils/port/detail/ThreadPthread.h
+  td/utils/port/detail/ThreadStl.h
+  td/utils/port/detail/WineventPoll.h
+
+  td/utils/AesCtrByteFlow.h
+  td/utils/as.h
+  td/utils/base64.h
+  td/utils/benchmark.h
+  td/utils/BigNum.h
+  td/utils/bits.h
+  td/utils/buffer.h
+  td/utils/BufferedFd.h
+  td/utils/BufferedReader.h
+  td/utils/BufferedUdp.h
+  td/utils/ByteFlow.h
+  td/utils/CancellationToken.h
+  td/utils/ChangesProcessor.h
+  td/utils/check.h
+  td/utils/Closure.h
+  td/utils/common.h
+  td/utils/ConcurrentHashTable.h
+  td/utils/Container.h
+  td/utils/Context.h
+  td/utils/crypto.h
+  td/utils/DecTree.h
+  td/utils/Destructor.h
+  td/utils/Enumerator.h
+  td/utils/EpochBasedMemoryReclamation.h
+  td/utils/FileLog.h
+  td/utils/filesystem.h
+  td/utils/find_boundary.h
+  td/utils/FloodControlFast.h
+  td/utils/FloodControlStrict.h
+  td/utils/format.h
+  td/utils/Gzip.h
+  td/utils/GzipByteFlow.h
+  td/utils/Hash.h
+  td/utils/HashMap.h
+  td/utils/HashSet.h
+  td/utils/HazardPointers.h
+  td/utils/Heap.h
+  td/utils/Hints.h
+  td/utils/HttpUrl.h
+  td/utils/int_types.h
+  td/utils/invoke.h
+  td/utils/JsonBuilder.h
+  td/utils/List.h
+  td/utils/logging.h
+  td/utils/MemoryLog.h
+  td/utils/MimeType.h
+  td/utils/misc.h
+  td/utils/MovableValue.h
+  td/utils/MpmcQueue.h
+  td/utils/MpmcWaiter.h
+  td/utils/MpscPollableQueue.h
+  td/utils/MpscLinkQueue.h
+  td/utils/Named.h
+  td/utils/ObjectPool.h
+  td/utils/Observer.h
+  td/utils/optional.h
+  td/utils/OptionsParser.h
+  td/utils/OrderedEventsProcessor.h
+  td/utils/overloaded.h
+  td/utils/Parser.h
+  td/utils/PathView.h
+  td/utils/queue.h
+  td/utils/Random.h
+  td/utils/ScopeGuard.h
+  td/utils/SharedObjectPool.h
+  td/utils/Slice-decl.h
+  td/utils/Slice.h
+  td/utils/Span.h
+  td/utils/SpinLock.h
+  td/utils/StackAllocator.h
+  td/utils/Status.h
+  td/utils/Storer.h
+  td/utils/StorerBase.h
+  td/utils/StringBuilder.h
+  td/utils/tests.h
+  td/utils/ThreadSafeCounter.h
+  td/utils/Time.h
+  td/utils/TimedStat.h
+  td/utils/Timer.h
+  td/utils/TsFileLog.h
+  td/utils/tl_helpers.h
+  td/utils/tl_parsers.h
+  td/utils/tl_storers.h
+  td/utils/translit.h
+  td/utils/type_traits.h
+  td/utils/UInt.h
+  td/utils/uint128.h
+  td/utils/unicode.h
+  td/utils/unique_ptr.h
+  td/utils/utf8.h
+  td/utils/Variant.h
+  td/utils/VectorQueue.h
+)
+
+set(TDUTILS_TEST_SOURCE
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/buffer.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/ConcurrentHashMap.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/crypto.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/Enumerator.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/filesystem.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/gzip.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/HazardPointers.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/heap.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/json.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/log.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/misc.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/MpmcQueue.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/MpmcWaiter.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/MpscLinkQueue.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/OrderedEventsProcessor.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/port.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/pq.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/SharedObjectPool.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/SharedSlice.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/test/variant.cpp
+  PARENT_SCOPE
+)
+
+#RULES
+#LIBRARIES
+add_library(tdutils STATIC ${TDUTILS_SOURCE})
+if (WIN32)
+  # find_library(WS2_32_LIBRARY ws2_32)
+  # find_library(MSWSOCK_LIBRARY Mswsock)
+  # target_link_libraries(tdutils PRIVATE ${WS2_32_LIBRARY} ${MSWSOCK_LIBRARY})
+  target_link_libraries(tdutils PRIVATE ws2_32 Mswsock Normaliz)
+endif()
+if (NOT CMAKE_CROSSCOMPILING)
+  add_dependencies(tdutils tdmime_auto)
+endif()
+
+if (DEFINED CMAKE_THREAD_LIBS_INIT)
+  target_link_libraries(tdutils PUBLIC ${CMAKE_THREAD_LIBS_INIT})
+endif()
+target_include_directories(tdutils PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}> $<BUILD_INTERFACE:${CMAKE_CURRENT_BINARY_DIR}>)
+
+if (OPENSSL_FOUND)
+  target_link_libraries(tdutils PRIVATE ${OPENSSL_CRYPTO_LIBRARY} ${CMAKE_DL_LIBS} ${ZLIB_LIBRARIES})
+  target_include_directories(tdutils SYSTEM PRIVATE ${OPENSSL_INCLUDE_DIR})
+endif()
+
+if (ZLIB_FOUND)
+  target_link_libraries(tdutils PRIVATE ${ZLIB_LIBRARIES})
+  target_include_directories(tdutils SYSTEM PRIVATE ${ZLIB_INCLUDE_DIR})
+endif()
+
+if (CRC32C_FOUND)
+  target_link_libraries(tdutils PRIVATE crc32c)
+endif()
+if (ABSL_FOUND)
+  target_link_libraries_system(tdutils absl::flat_hash_map absl::flat_hash_set absl::hash)
+endif()
+
+if (WIN32 AND WINGETOPT_FOUND)
+  target_link_libraries(tdutils PRIVATE wingetopt)
+endif()
+
+if (ANDROID)
+  target_link_libraries(tdutils PRIVATE log)
+endif()
+
+if (CMAKE_HOST_SYSTEM_NAME MATCHES "NetBSD")
+  target_link_libraries(tdutils PUBLIC /usr/pkg/gcc5/i486--netbsdelf/lib/libatomic.so)
+endif()
+
+install(TARGETS tdutils EXPORT TdTargets
+  LIBRARY DESTINATION lib
+  ARCHIVE DESTINATION lib
+  RUNTIME DESTINATION bin
+  INCLUDES DESTINATION include
+)
diff --git a/submodules/ton/tonlib-src/tdutils/generate/CMakeLists.txt b/submodules/ton/tonlib-src/tdutils/generate/CMakeLists.txt
new file mode 100644
index 0000000000..9eca574ad0
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/generate/CMakeLists.txt
@@ -0,0 +1,64 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+# Generates files for MIME type <-> extension conversions
+# DEPENDS ON: gperf grep bash/powershell
+
+file(MAKE_DIRECTORY auto)
+
+set(TDMIME_SOURCE
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/mime_type_to_extension.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/extension_to_mime_type.cpp
+)
+set(TDMIME_AUTO
+  ${TDMIME_SOURCE}
+  PARENT_SCOPE
+)
+
+add_custom_target(tdmime_auto DEPENDS ${TDMIME_SOURCE})
+
+if (NOT CMAKE_CROSSCOMPILING)
+  find_program(GPERF_EXECUTABLE gperf)
+  if (NOT GPERF_EXECUTABLE)
+    message(FATAL_ERROR "Could NOT find gperf. Add path to gperf executable to PATH environment variable or specify it manually using GPERF_EXECUTABLE option, i. e. 'cmake -DGPERF_EXECUTABLE:FILEPATH=\"<path to gperf executable>\"'.")
+  endif()
+
+  set(GPERF_FILES
+    ${CMAKE_CURRENT_SOURCE_DIR}/auto/mime_type_to_extension.gperf
+    ${CMAKE_CURRENT_SOURCE_DIR}/auto/extension_to_mime_type.gperf
+  )
+
+  set(GPERF_GEN_SOURCE generate_mime_types_gperf.cpp)
+
+  add_executable(generate_mime_types_gperf ${GPERF_GEN_SOURCE})
+
+  add_custom_command(
+    OUTPUT ${GPERF_FILES}
+    WORKING_DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR}
+    COMMAND generate_mime_types_gperf mime_types.txt ${GPERF_FILES}
+    DEPENDS generate_mime_types_gperf mime_types.txt
+  )
+
+  if (WIN32)
+    set(MIME_TYPE_TO_EXTENSION_CMD ${GPERF_EXECUTABLE} -m100 --output-file=auto/mime_type_to_extension.cpp auto/mime_type_to_extension.gperf)
+  else()
+    set(MIME_TYPE_TO_EXTENSION_CMD ${GPERF_EXECUTABLE} -m100 auto/mime_type_to_extension.gperf | grep -v __gnu_inline__ > auto/mime_type_to_extension.cpp)
+  endif()
+  add_custom_command(
+    OUTPUT ${CMAKE_CURRENT_SOURCE_DIR}/auto/mime_type_to_extension.cpp
+    WORKING_DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR}
+    COMMAND ${MIME_TYPE_TO_EXTENSION_CMD}
+    DEPENDS auto/mime_type_to_extension.gperf
+  )
+
+  if (WIN32)
+    set(EXTENSION_TO_MIME_TYPE_CMD ${GPERF_EXECUTABLE} -m100 --output-file=auto/extension_to_mime_type.cpp auto/extension_to_mime_type.gperf)
+  else()
+    set(EXTENSION_TO_MIME_TYPE_CMD ${GPERF_EXECUTABLE} -m100 auto/extension_to_mime_type.gperf | grep -v __gnu_inline__ > auto/extension_to_mime_type.cpp)
+  endif()
+  add_custom_command(
+    OUTPUT ${CMAKE_CURRENT_SOURCE_DIR}/auto/extension_to_mime_type.cpp
+    WORKING_DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR}
+    COMMAND ${EXTENSION_TO_MIME_TYPE_CMD}
+    DEPENDS auto/extension_to_mime_type.gperf
+  )
+endif()
diff --git a/submodules/ton/tonlib-src/tdutils/generate/auto/extension_to_mime_type.cpp b/submodules/ton/tonlib-src/tdutils/generate/auto/extension_to_mime_type.cpp
new file mode 100644
index 0000000000..3cac14bd0c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/generate/auto/extension_to_mime_type.cpp
@@ -0,0 +1,3158 @@
+/* ANSI-C code produced by gperf version 3.0.3 */
+/* Command-line: /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/gperf -m100 auto/extension_to_mime_type.gperf  */
+/* Computed positions: -k'1-4,6,$' */
+
+#if !((' ' == 32) && ('!' == 33) && ('"' == 34) && ('#' == 35) \
+      && ('%' == 37) && ('&' == 38) && ('\'' == 39) && ('(' == 40) \
+      && (')' == 41) && ('*' == 42) && ('+' == 43) && (',' == 44) \
+      && ('-' == 45) && ('.' == 46) && ('/' == 47) && ('0' == 48) \
+      && ('1' == 49) && ('2' == 50) && ('3' == 51) && ('4' == 52) \
+      && ('5' == 53) && ('6' == 54) && ('7' == 55) && ('8' == 56) \
+      && ('9' == 57) && (':' == 58) && (';' == 59) && ('<' == 60) \
+      && ('=' == 61) && ('>' == 62) && ('?' == 63) && ('A' == 65) \
+      && ('B' == 66) && ('C' == 67) && ('D' == 68) && ('E' == 69) \
+      && ('F' == 70) && ('G' == 71) && ('H' == 72) && ('I' == 73) \
+      && ('J' == 74) && ('K' == 75) && ('L' == 76) && ('M' == 77) \
+      && ('N' == 78) && ('O' == 79) && ('P' == 80) && ('Q' == 81) \
+      && ('R' == 82) && ('S' == 83) && ('T' == 84) && ('U' == 85) \
+      && ('V' == 86) && ('W' == 87) && ('X' == 88) && ('Y' == 89) \
+      && ('Z' == 90) && ('[' == 91) && ('\\' == 92) && (']' == 93) \
+      && ('^' == 94) && ('_' == 95) && ('a' == 97) && ('b' == 98) \
+      && ('c' == 99) && ('d' == 100) && ('e' == 101) && ('f' == 102) \
+      && ('g' == 103) && ('h' == 104) && ('i' == 105) && ('j' == 106) \
+      && ('k' == 107) && ('l' == 108) && ('m' == 109) && ('n' == 110) \
+      && ('o' == 111) && ('p' == 112) && ('q' == 113) && ('r' == 114) \
+      && ('s' == 115) && ('t' == 116) && ('u' == 117) && ('v' == 118) \
+      && ('w' == 119) && ('x' == 120) && ('y' == 121) && ('z' == 122) \
+      && ('{' == 123) && ('|' == 124) && ('}' == 125) && ('~' == 126))
+/* The character set is not based on ISO-646.  */
+#error "gperf generated tables don't work with this execution character set. Please report a bug to <bug-gnu-gperf@gnu.org>."
+#endif
+
+#line 12 "auto/extension_to_mime_type.gperf"
+struct extension_and_mime_type {
+  const char *extension;
+  const char *mime_type;
+};
+#include <string.h>
+/* maximum key range = 3720, duplicates = 0 */
+
+#ifndef GPERF_DOWNCASE
+#define GPERF_DOWNCASE 1
+static unsigned char gperf_downcase[256] =
+  {
+      0,   1,   2,   3,   4,   5,   6,   7,   8,   9,  10,  11,  12,  13,  14,
+     15,  16,  17,  18,  19,  20,  21,  22,  23,  24,  25,  26,  27,  28,  29,
+     30,  31,  32,  33,  34,  35,  36,  37,  38,  39,  40,  41,  42,  43,  44,
+     45,  46,  47,  48,  49,  50,  51,  52,  53,  54,  55,  56,  57,  58,  59,
+     60,  61,  62,  63,  64,  97,  98,  99, 100, 101, 102, 103, 104, 105, 106,
+    107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121,
+    122,  91,  92,  93,  94,  95,  96,  97,  98,  99, 100, 101, 102, 103, 104,
+    105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119,
+    120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134,
+    135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149,
+    150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164,
+    165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179,
+    180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194,
+    195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209,
+    210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224,
+    225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239,
+    240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254,
+    255
+  };
+#endif
+
+#ifndef GPERF_CASE_STRCMP
+#define GPERF_CASE_STRCMP 1
+static int
+gperf_case_strcmp (register const char *s1, register const char *s2)
+{
+  for (;;)
+    {
+      unsigned char c1 = gperf_downcase[(unsigned char)*s1++];
+      unsigned char c2 = gperf_downcase[(unsigned char)*s2++];
+      if (c1 != 0 && c1 == c2)
+        continue;
+      return (int)c1 - (int)c2;
+    }
+}
+#endif
+
+#ifdef __GNUC__
+__inline
+#else
+#ifdef __cplusplus
+inline
+#endif
+#endif
+static unsigned int
+extension_hash (register const char *str, register unsigned int len)
+{
+  static const unsigned short asso_values[] =
+    {
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729,    9, 3729, 3729,   11,   44,
+        74,   50,   65,   16,   10,   12,   12,    6, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729,  350,  763,   23,   52,  597,
+        22,  438, 1029,  519, 1008,  494,  136,    5,  764,  592,
+        25,  472,  182,    4,    8,  537,   46,  108,   15, 1263,
+       658, 3729, 3729, 3729, 3729,    5,    4,  350,  763,   23,
+        52,  597,   22,  438, 1029,  519, 1008,  494,  136,    5,
+       764,  592,   25,  472,  182,    4,    8,  537,   46,  108,
+        15, 1263,  658, 1428,  428,   16,   26,  800,  348,  922,
+      1371,  178,   24, 1218,  242,  852,  485,  482, 1234, 1631,
+         7,   65, 3729, 3729, 3729, 3729, 3729, 3729,    8,  537,
+        46,  108,   15, 1263,  658, 1428,  428,   16,   26,  800,
+       348,  922, 1371,  178,   24, 1218,  242,  852,  485,  482,
+      1234, 1631,    7,   65, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729, 3729,
+      3729, 3729, 3729, 3729, 3729, 3729, 3729
+    };
+  register unsigned int hval = len;
+
+  switch (hval)
+    {
+      default:
+        hval += asso_values[(unsigned char)str[5]];
+      /*FALLTHROUGH*/
+      case 5:
+      case 4:
+        hval += asso_values[(unsigned char)str[3]];
+      /*FALLTHROUGH*/
+      case 3:
+        hval += asso_values[(unsigned char)str[2]];
+      /*FALLTHROUGH*/
+      case 2:
+        hval += asso_values[(unsigned char)str[1]+51];
+      /*FALLTHROUGH*/
+      case 1:
+        hval += asso_values[(unsigned char)str[0]];
+        break;
+    }
+  return hval + asso_values[(unsigned char)str[len - 1]];
+}
+
+const struct extension_and_mime_type *
+search_extension (register const char *str, register unsigned int len)
+{
+  enum
+    {
+      TOTAL_KEYWORDS = 990,
+      MIN_WORD_LENGTH = 1,
+      MAX_WORD_LENGTH = 11,
+      MIN_HASH_VALUE = 9,
+      MAX_HASH_VALUE = 3728
+    };
+
+  static const struct extension_and_mime_type wordlist[] =
+    {
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 692 "auto/extension_to_mime_type.gperf"
+      {"s", "text/x-asm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 794 "auto/extension_to_mime_type.gperf"
+      {"t", "text/troff"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 693 "auto/extension_to_mime_type.gperf"
+      {"s3m", "audio/s3m"},
+#line 450 "auto/extension_to_mime_type.gperf"
+      {"mets", "application/mets+xml"},
+      {"",nullptr},
+#line 464 "auto/extension_to_mime_type.gperf"
+      {"mks", "video/x-matroska"},
+#line 736 "auto/extension_to_mime_type.gperf"
+      {"skm", "application/vnd.koan"},
+#line 587 "auto/extension_to_mime_type.gperf"
+      {"pas", "text/x-pascal"},
+#line 240 "auto/extension_to_mime_type.gperf"
+      {"f", "text/x-fortran"},
+      {"",nullptr},
+#line 84 "auto/extension_to_mime_type.gperf"
+      {"c", "text/x-c"},
+      {"",nullptr},
+#line 738 "auto/extension_to_mime_type.gperf"
+      {"skt", "application/vnd.koan"},
+#line 96 "auto/extension_to_mime_type.gperf"
+      {"cat", "application/vnd.ms-pki.seccat"},
+#line 578 "auto/extension_to_mime_type.gperf"
+      {"p", "text/x-pascal"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 804 "auto/extension_to_mime_type.gperf"
+      {"tex", "application/x-tex"},
+      {"",nullptr},
+#line 807 "auto/extension_to_mime_type.gperf"
+      {"text", "text/plain"},
+#line 694 "auto/extension_to_mime_type.gperf"
+      {"saf", "application/vnd.yamaha.smaf-audio"},
+      {"",nullptr},
+#line 700 "auto/extension_to_mime_type.gperf"
+      {"scs", "application/scvp-cv-response"},
+      {"",nullptr},
+#line 698 "auto/extension_to_mime_type.gperf"
+      {"scm", "application/vnd.lotus-screencam"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 713 "auto/extension_to_mime_type.gperf"
+      {"semf", "application/vnd.semf"},
+      {"",nullptr}, {"",nullptr},
+#line 696 "auto/extension_to_mime_type.gperf"
+      {"sc", "application/vnd.ibm.secure-container"},
+#line 940 "auto/extension_to_mime_type.gperf"
+      {"xap", "application/x-silverlight-app"},
+#line 432 "auto/extension_to_mime_type.gperf"
+      {"mads", "application/mads+xml"},
+#line 93 "auto/extension_to_mime_type.gperf"
+      {"caf", "audio/x-caf"},
+#line 246 "auto/extension_to_mime_type.gperf"
+      {"fcs", "application/vnd.isac.fcs"},
+      {"",nullptr}, {"",nullptr},
+#line 795 "auto/extension_to_mime_type.gperf"
+      {"t3", "application/x-t3vm-image"},
+#line 737 "auto/extension_to_mime_type.gperf"
+      {"skp", "application/vnd.koan"},
+#line 94 "auto/extension_to_mime_type.gperf"
+      {"cap", "application/vnd.tcpdump.pcap"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 103 "auto/extension_to_mime_type.gperf"
+      {"cct", "application/x-director"},
+      {"",nullptr},
+#line 595 "auto/extension_to_mime_type.gperf"
+      {"pct", "image/x-pict"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 102 "auto/extension_to_mime_type.gperf"
+      {"cc", "text/x-c"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 276 "auto/extension_to_mime_type.gperf"
+      {"fzs", "application/vnd.fuzzysheet"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 579 "auto/extension_to_mime_type.gperf"
+      {"p10", "application/pkcs10"},
+#line 878 "auto/extension_to_mime_type.gperf"
+      {"vcs", "text/x-vcalendar"},
+#line 597 "auto/extension_to_mime_type.gperf"
+      {"pcx", "image/x-pcx"},
+      {"",nullptr}, {"",nullptr},
+#line 160 "auto/extension_to_mime_type.gperf"
+      {"daf", "application/vnd.mobius.daf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 170 "auto/extension_to_mime_type.gperf"
+      {"def", "text/plain"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 592 "auto/extension_to_mime_type.gperf"
+      {"pcf", "application/x-font-pcf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 879 "auto/extension_to_mime_type.gperf"
+      {"vcx", "application/vnd.vcx"},
+#line 465 "auto/extension_to_mime_type.gperf"
+      {"mkv", "video/x-matroska"},
+#line 647 "auto/extension_to_mime_type.gperf"
+      {"pyv", "video/vnd.ms-playready.media.pyv"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 712 "auto/extension_to_mime_type.gperf"
+      {"semd", "application/vnd.semd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 946 "auto/extension_to_mime_type.gperf"
+      {"xdm", "application/vnd.syncml.dm+xml"},
+#line 735 "auto/extension_to_mime_type.gperf"
+      {"skd", "application/vnd.koan"},
+      {"",nullptr},
+#line 876 "auto/extension_to_mime_type.gperf"
+      {"vcf", "text/x-vcard"},
+#line 245 "auto/extension_to_mime_type.gperf"
+      {"fcdt", "application/vnd.adobe.formscentral.fcdt"},
+      {"",nullptr},
+#line 441 "auto/extension_to_mime_type.gperf"
+      {"mc1", "application/vnd.medcalcdata"},
+      {"",nullptr},
+#line 933 "auto/extension_to_mime_type.gperf"
+      {"x3d", "model/x3d+xml"},
+#line 908 "auto/extension_to_mime_type.gperf"
+      {"wks", "application/vnd.ms-works"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 896 "auto/extension_to_mime_type.gperf"
+      {"wax", "audio/x-ms-wax"},
+      {"",nullptr}, {"",nullptr},
+#line 421 "auto/extension_to_mime_type.gperf"
+      {"m1v", "video/mpeg"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 697 "auto/extension_to_mime_type.gperf"
+      {"scd", "application/x-msschedule"},
+#line 442 "auto/extension_to_mime_type.gperf"
+      {"mcd", "application/vnd.mcd"},
+#line 948 "auto/extension_to_mime_type.gperf"
+      {"xdssc", "application/dssc+xml"},
+#line 419 "auto/extension_to_mime_type.gperf"
+      {"m13", "application/x-msmediaview"},
+#line 703 "auto/extension_to_mime_type.gperf"
+      {"sdc", "application/vnd.stardivision.calc"},
+#line 404 "auto/extension_to_mime_type.gperf"
+      {"les", "application/vnd.hhe.lesson-player"},
+#line 180 "auto/extension_to_mime_type.gperf"
+      {"djv", "image/vnd.djvu"},
+#line 113 "auto/extension_to_mime_type.gperf"
+      {"cdx", "chemical/x-cdx"},
+#line 707 "auto/extension_to_mime_type.gperf"
+      {"sdp", "application/sdp"},
+      {"",nullptr},
+#line 900 "auto/extension_to_mime_type.gperf"
+      {"wcm", "application/vnd.ms-works"},
+      {"",nullptr},
+#line 19 "auto/extension_to_mime_type.gperf"
+      {"3ds", "image/x-3ds"},
+#line 945 "auto/extension_to_mime_type.gperf"
+      {"xdf", "application/xcap-diff+xml"},
+      {"",nullptr},
+#line 460 "auto/extension_to_mime_type.gperf"
+      {"mj2", "video/mj2"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 947 "auto/extension_to_mime_type.gperf"
+      {"xdp", "application/vnd.adobe.xdp+xml"},
+#line 247 "auto/extension_to_mime_type.gperf"
+      {"fdf", "application/vnd.fdf"},
+#line 106 "auto/extension_to_mime_type.gperf"
+      {"cdf", "application/x-netcdf"},
+      {"",nullptr},
+#line 599 "auto/extension_to_mime_type.gperf"
+      {"pdf", "application/pdf"},
+      {"",nullptr}, {"",nullptr},
+#line 243 "auto/extension_to_mime_type.gperf"
+      {"f90", "text/x-fortran"},
+      {"",nullptr},
+#line 936 "auto/extension_to_mime_type.gperf"
+      {"x3dv", "model/x3d+vrml"},
+      {"",nullptr}, {"",nullptr},
+#line 932 "auto/extension_to_mime_type.gperf"
+      {"x32", "application/x-authorware-bin"},
+#line 462 "auto/extension_to_mime_type.gperf"
+      {"mk3d", "video/x-matroska"},
+#line 420 "auto/extension_to_mime_type.gperf"
+      {"m14", "application/x-msmediaview"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 491 "auto/extension_to_mime_type.gperf"
+      {"mpm", "application/vnd.blueice.multipass"},
+      {"",nullptr},
+#line 461 "auto/extension_to_mime_type.gperf"
+      {"mjp2", "video/mj2"},
+#line 875 "auto/extension_to_mime_type.gperf"
+      {"vcd", "application/x-cdlink"},
+      {"",nullptr},
+#line 662 "auto/extension_to_mime_type.gperf"
+      {"ras", "image/x-cmu-raster"},
+#line 494 "auto/extension_to_mime_type.gperf"
+      {"mpt", "application/vnd.ms-project"},
+#line 660 "auto/extension_to_mime_type.gperf"
+      {"ram", "audio/x-pn-realaudio"},
+#line 979 "auto/extension_to_mime_type.gperf"
+      {"xps", "application/vnd.ms-xpsdocument"},
+#line 818 "auto/extension_to_mime_type.gperf"
+      {"tpt", "application/vnd.trid.tpt"},
+#line 977 "auto/extension_to_mime_type.gperf"
+      {"xpm", "image/x-xpixmap"},
+      {"",nullptr},
+#line 667 "auto/extension_to_mime_type.gperf"
+      {"res", "application/x-dtbresource+xml"},
+      {"",nullptr}, {"",nullptr},
+#line 895 "auto/extension_to_mime_type.gperf"
+      {"wav", "audio/x-wav"},
+      {"",nullptr}, {"",nullptr},
+#line 627 "auto/extension_to_mime_type.gperf"
+      {"pps", "application/vnd.ms-powerpoint"},
+#line 757 "auto/extension_to_mime_type.gperf"
+      {"spx", "audio/ogg"},
+#line 626 "auto/extension_to_mime_type.gperf"
+      {"ppm", "image/x-portable-pixmap"},
+      {"",nullptr}, {"",nullptr},
+#line 704 "auto/extension_to_mime_type.gperf"
+      {"sdd", "application/vnd.stardivision.impress"},
+#line 143 "auto/extension_to_mime_type.gperf"
+      {"cpt", "application/mac-compactpro"},
+#line 628 "auto/extension_to_mime_type.gperf"
+      {"ppsm", "application/vnd.ms-powerpoint.slideshow.macroenabled.12"},
+#line 630 "auto/extension_to_mime_type.gperf"
+      {"ppt", "application/vnd.ms-powerpoint"},
+#line 894 "auto/extension_to_mime_type.gperf"
+      {"wad", "application/x-doom"},
+      {"",nullptr},
+#line 631 "auto/extension_to_mime_type.gperf"
+      {"pptm", "application/vnd.ms-powerpoint.presentation.macroenabled.12"},
+#line 981 "auto/extension_to_mime_type.gperf"
+      {"xpx", "application/vnd.intercon.formnet"},
+      {"",nullptr},
+#line 580 "auto/extension_to_mime_type.gperf"
+      {"p12", "application/x-pkcs12"},
+#line 752 "auto/extension_to_mime_type.gperf"
+      {"spf", "application/vnd.yamaha.smaf-phrase"},
+#line 104 "auto/extension_to_mime_type.gperf"
+      {"ccxml", "application/ccxml+xml"},
+#line 751 "auto/extension_to_mime_type.gperf"
+      {"spc", "application/x-pkcs7-certificates"},
+#line 484 "auto/extension_to_mime_type.gperf"
+      {"mpc", "application/vnd.mophun.certificate"},
+#line 267 "auto/extension_to_mime_type.gperf"
+      {"fpx", "image/vnd.fpx"},
+      {"",nullptr},
+#line 755 "auto/extension_to_mime_type.gperf"
+      {"spp", "application/scvp-vp-response"},
+#line 493 "auto/extension_to_mime_type.gperf"
+      {"mpp", "application/vnd.ms-project"},
+#line 893 "auto/extension_to_mime_type.gperf"
+      {"w3d", "application/x-director"},
+      {"",nullptr},
+#line 925 "auto/extension_to_mime_type.gperf"
+      {"wqd", "application/vnd.wqd"},
+      {"",nullptr},
+#line 629 "auto/extension_to_mime_type.gperf"
+      {"ppsx", "application/vnd.openxmlformats-officedocument.presentationml.slideshow"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 632 "auto/extension_to_mime_type.gperf"
+      {"pptx", "application/vnd.openxmlformats-officedocument.presentationml.presentation"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 666 "auto/extension_to_mime_type.gperf"
+      {"rep", "application/vnd.businessobjects"},
+      {"",nullptr},
+#line 588 "auto/extension_to_mime_type.gperf"
+      {"paw", "application/vnd.pawaafile"},
+#line 499 "auto/extension_to_mime_type.gperf"
+      {"ms", "text/troff"},
+#line 142 "auto/extension_to_mime_type.gperf"
+      {"cpp", "text/x-c"},
+      {"",nullptr}, {"",nullptr},
+#line 193 "auto/extension_to_mime_type.gperf"
+      {"dp", "application/vnd.osgi.dp"},
+      {"",nullptr}, {"",nullptr},
+#line 482 "auto/extension_to_mime_type.gperf"
+      {"mp4s", "application/mp4"},
+      {"",nullptr},
+#line 161 "auto/extension_to_mime_type.gperf"
+      {"dart", "application/vnd.dart"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 168 "auto/extension_to_mime_type.gperf"
+      {"ddd", "application/vnd.fujixerox.ddd"},
+      {"",nullptr},
+#line 902 "auto/extension_to_mime_type.gperf"
+      {"wdp", "image/vnd.ms-photo"},
+#line 984 "auto/extension_to_mime_type.gperf"
+      {"xsm", "application/vnd.syncml+xml"},
+      {"",nullptr}, {"",nullptr},
+#line 637 "auto/extension_to_mime_type.gperf"
+      {"ps", "application/postscript"},
+      {"",nullptr}, {"",nullptr},
+#line 151 "auto/extension_to_mime_type.gperf"
+      {"css", "text/css"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 270 "auto/extension_to_mime_type.gperf"
+      {"fst", "image/vnd.fst"},
+#line 152 "auto/extension_to_mime_type.gperf"
+      {"cst", "application/x-director"},
+      {"",nullptr},
+#line 479 "auto/extension_to_mime_type.gperf"
+      {"mp3", "audio/mpeg"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 114 "auto/extension_to_mime_type.gperf"
+      {"cdxml", "application/vnd.chemdraw+xml"},
+#line 765 "auto/extension_to_mime_type.gperf"
+      {"ssf", "application/vnd.epson.ssf"},
+#line 503 "auto/extension_to_mime_type.gperf"
+      {"msf", "application/vnd.epson.msf"},
+      {"",nullptr}, {"",nullptr},
+#line 924 "auto/extension_to_mime_type.gperf"
+      {"wps", "application/vnd.ms-works"},
+      {"",nullptr},
+#line 888 "auto/extension_to_mime_type.gperf"
+      {"vss", "application/vnd.visio"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 758 "auto/extension_to_mime_type.gperf"
+      {"sql", "application/x-sql"},
+#line 939 "auto/extension_to_mime_type.gperf"
+      {"xaml", "application/xaml+xml"},
+      {"",nullptr}, {"",nullptr},
+#line 889 "auto/extension_to_mime_type.gperf"
+      {"vst", "application/vnd.visio"},
+      {"",nullptr}, {"",nullptr},
+#line 625 "auto/extension_to_mime_type.gperf"
+      {"ppd", "application/vnd.cups-ppd"},
+#line 167 "auto/extension_to_mime_type.gperf"
+      {"dd2", "application/vnd.oma.dd2+xml"},
+      {"",nullptr},
+#line 269 "auto/extension_to_mime_type.gperf"
+      {"fsc", "application/vnd.fsc.weblaunch"},
+#line 640 "auto/extension_to_mime_type.gperf"
+      {"psf", "application/x-font-linux-psf"},
+      {"",nullptr},
+#line 480 "auto/extension_to_mime_type.gperf"
+      {"mp4", "video/mp4"},
+      {"",nullptr},
+#line 150 "auto/extension_to_mime_type.gperf"
+      {"csp", "application/vnd.commonspace"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 800 "auto/extension_to_mime_type.gperf"
+      {"tcl", "application/x-tcl"},
+#line 985 "auto/extension_to_mime_type.gperf"
+      {"xspf", "application/xspf+xml"},
+#line 708 "auto/extension_to_mime_type.gperf"
+      {"sdw", "application/vnd.stardivision.writer"},
+      {"",nullptr}, {"",nullptr},
+#line 476 "auto/extension_to_mime_type.gperf"
+      {"mp2", "audio/mpeg"},
+#line 887 "auto/extension_to_mime_type.gperf"
+      {"vsf", "application/vnd.vsf"},
+      {"",nullptr},
+#line 664 "auto/extension_to_mime_type.gperf"
+      {"rdf", "application/rdf+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 949 "auto/extension_to_mime_type.gperf"
+      {"xdw", "application/vnd.fujixerox.docuworks"},
+#line 196 "auto/extension_to_mime_type.gperf"
+      {"dsc", "text/prs.lines.tag"},
+#line 483 "auto/extension_to_mime_type.gperf"
+      {"mp4v", "video/mp4"},
+#line 823 "auto/extension_to_mime_type.gperf"
+      {"tsv", "text/tab-separated-values"},
+#line 593 "auto/extension_to_mime_type.gperf"
+      {"pcl", "application/vnd.hp-pcl"},
+      {"",nullptr},
+#line 197 "auto/extension_to_mime_type.gperf"
+      {"dssc", "application/dssc+der"},
+#line 477 "auto/extension_to_mime_type.gperf"
+      {"mp21", "application/mp21"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 822 "auto/extension_to_mime_type.gperf"
+      {"tsd", "application/timestamped-data"},
+      {"",nullptr},
+#line 742 "auto/extension_to_mime_type.gperf"
+      {"sm", "application/vnd.stepmania.stepchart"},
+#line 153 "auto/extension_to_mime_type.gperf"
+      {"csv", "text/csv"},
+      {"",nullptr}, {"",nullptr},
+#line 594 "auto/extension_to_mime_type.gperf"
+      {"pclxl", "application/vnd.hp-pclxl"},
+      {"",nullptr},
+#line 431 "auto/extension_to_mime_type.gperf"
+      {"ma", "application/mathematica"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 26 "auto/extension_to_mime_type.gperf"
+      {"aas", "application/x-authorware-seg"},
+#line 971 "auto/extension_to_mime_type.gperf"
+      {"xm", "audio/xm"},
+#line 25 "auto/extension_to_mime_type.gperf"
+      {"aam", "application/x-authorware-map"},
+      {"",nullptr}, {"",nullptr},
+#line 639 "auto/extension_to_mime_type.gperf"
+      {"psd", "image/vnd.adobe.photoshop"},
+#line 683 "auto/extension_to_mime_type.gperf"
+      {"rp9", "application/vnd.cloanto.rp9"},
+#line 684 "auto/extension_to_mime_type.gperf"
+      {"rpss", "application/vnd.nokia.radio-presets"},
+#line 264 "auto/extension_to_mime_type.gperf"
+      {"fm", "application/vnd.framemaker"},
+      {"",nullptr}, {"",nullptr},
+#line 436 "auto/extension_to_mime_type.gperf"
+      {"mar", "application/octet-stream"},
+      {"",nullptr}, {"",nullptr},
+#line 798 "auto/extension_to_mime_type.gperf"
+      {"tar", "application/x-tar"},
+#line 685 "auto/extension_to_mime_type.gperf"
+      {"rpst", "application/vnd.nokia.radio-preset"},
+      {"",nullptr},
+#line 714 "auto/extension_to_mime_type.gperf"
+      {"ser", "application/java-serialized-object"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 941 "auto/extension_to_mime_type.gperf"
+      {"xar", "application/vnd.xara"},
+      {"",nullptr}, {"",nullptr},
+#line 922 "auto/extension_to_mime_type.gperf"
+      {"wpd", "application/vnd.wordperfect"},
+      {"",nullptr},
+#line 886 "auto/extension_to_mime_type.gperf"
+      {"vsd", "application/vnd.visio"},
+      {"",nullptr},
+#line 951 "auto/extension_to_mime_type.gperf"
+      {"xer", "application/patch-ops-error+xml"},
+#line 95 "auto/extension_to_mime_type.gperf"
+      {"car", "application/vnd.curl.car"},
+#line 743 "auto/extension_to_mime_type.gperf"
+      {"smf", "application/vnd.stardivision.math"},
+#line 468 "auto/extension_to_mime_type.gperf"
+      {"mmf", "application/vnd.smaf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 137 "auto/extension_to_mime_type.gperf"
+      {"cmx", "image/x-cmx"},
+#line 116 "auto/extension_to_mime_type.gperf"
+      {"cer", "application/pkix-cert"},
+      {"",nullptr},
+#line 24 "auto/extension_to_mime_type.gperf"
+      {"aac", "audio/x-aac"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 185 "auto/extension_to_mime_type.gperf"
+      {"dms", "application/octet-stream"},
+#line 980 "auto/extension_to_mime_type.gperf"
+      {"xpw", "application/vnd.intercon.formnet"},
+#line 983 "auto/extension_to_mime_type.gperf"
+      {"xslt", "application/xslt+xml"},
+      {"",nullptr}, {"",nullptr},
+#line 500 "auto/extension_to_mime_type.gperf"
+      {"mscml", "application/mediaservercontrol+xml"},
+      {"",nullptr},
+#line 34 "auto/extension_to_mime_type.gperf"
+      {"aep", "application/vnd.audiograph"},
+      {"",nullptr},
+#line 133 "auto/extension_to_mime_type.gperf"
+      {"cmc", "application/vnd.cosmocaller"},
+#line 28 "auto/extension_to_mime_type.gperf"
+      {"ac", "application/pkix-attr-cert"},
+      {"",nullptr}, {"",nullptr},
+#line 136 "auto/extension_to_mime_type.gperf"
+      {"cmp", "application/vnd.yellowriver-custom-menu"},
+      {"",nullptr},
+#line 64 "auto/extension_to_mime_type.gperf"
+      {"azs", "application/vnd.airzip.filesecure.azs"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 687 "auto/extension_to_mime_type.gperf"
+      {"rs", "application/rls-services+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 172 "auto/extension_to_mime_type.gperf"
+      {"der", "application/x-x509-ca-cert"},
+#line 689 "auto/extension_to_mime_type.gperf"
+      {"rss", "application/rss+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 18 "auto/extension_to_mime_type.gperf"
+      {"3dml", "text/vnd.in3d.3dml"},
+      {"",nullptr},
+#line 400 "auto/extension_to_mime_type.gperf"
+      {"lasxml", "application/vnd.las.las+xml"},
+      {"",nullptr},
+#line 731 "auto/extension_to_mime_type.gperf"
+      {"sis", "application/vnd.symbian.install"},
+      {"",nullptr},
+#line 29 "auto/extension_to_mime_type.gperf"
+      {"acc", "application/vnd.americandynamics.acc"},
+      {"",nullptr},
+#line 746 "auto/extension_to_mime_type.gperf"
+      {"smv", "video/x-smv"},
+#line 448 "auto/extension_to_mime_type.gperf"
+      {"meta4", "application/metalink4+xml"},
+      {"",nullptr}, {"",nullptr},
+#line 733 "auto/extension_to_mime_type.gperf"
+      {"sit", "application/x-stuffit"},
+      {"",nullptr},
+#line 184 "auto/extension_to_mime_type.gperf"
+      {"dmp", "application/vnd.tcpdump.pcap"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 753 "auto/extension_to_mime_type.gperf"
+      {"spl", "application/x-futuresplash"},
+#line 799 "auto/extension_to_mime_type.gperf"
+      {"tcap", "application/vnd.3gpp2.tcap"},
+#line 281 "auto/extension_to_mime_type.gperf"
+      {"gam", "application/x-tads"},
+#line 467 "auto/extension_to_mime_type.gperf"
+      {"mmd", "application/vnd.chipnuts.karaoke-mmd"},
+#line 817 "auto/extension_to_mime_type.gperf"
+      {"tpl", "application/vnd.groove-tool-template"},
+#line 63 "auto/extension_to_mime_type.gperf"
+      {"azf", "application/vnd.airzip.filesecure.azf"},
+#line 909 "auto/extension_to_mime_type.gperf"
+      {"wm", "video/x-ms-wm"},
+      {"",nullptr},
+#line 165 "auto/extension_to_mime_type.gperf"
+      {"dcr", "application/x-director"},
+      {"",nullptr}, {"",nullptr},
+#line 976 "auto/extension_to_mime_type.gperf"
+      {"xpl", "application/xproc+xml"},
+      {"",nullptr},
+#line 732 "auto/extension_to_mime_type.gperf"
+      {"sisx", "application/vnd.symbian.install"},
+#line 134 "auto/extension_to_mime_type.gperf"
+      {"cmdf", "chemical/x-cmdf"},
+      {"",nullptr},
+#line 298 "auto/extension_to_mime_type.gperf"
+      {"gqs", "application/vnd.grafeq"},
+#line 734 "auto/extension_to_mime_type.gperf"
+      {"sitx", "application/x-stuffitx"},
+#line 591 "auto/extension_to_mime_type.gperf"
+      {"pcap", "application/vnd.tcpdump.pcap"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 458 "auto/extension_to_mime_type.gperf"
+      {"mif", "application/vnd.mif"},
+      {"",nullptr}, {"",nullptr},
+#line 813 "auto/extension_to_mime_type.gperf"
+      {"tif", "image/tiff"},
+      {"",nullptr},
+#line 880 "auto/extension_to_mime_type.gperf"
+      {"vis", "application/vnd.visionary"},
+#line 286 "auto/extension_to_mime_type.gperf"
+      {"gex", "application/vnd.geometry-explorer"},
+      {"",nullptr}, {"",nullptr},
+#line 918 "auto/extension_to_mime_type.gperf"
+      {"wmx", "video/x-ms-wmx"},
+#line 957 "auto/extension_to_mime_type.gperf"
+      {"xif", "image/vnd.xiff"},
+#line 177 "auto/extension_to_mime_type.gperf"
+      {"dis", "application/vnd.mobius.dis"},
+      {"",nullptr},
+#line 648 "auto/extension_to_mime_type.gperf"
+      {"qam", "application/vnd.epson.quickanime"},
+      {"",nullptr},
+#line 280 "auto/extension_to_mime_type.gperf"
+      {"gac", "application/vnd.groove-account"},
+      {"",nullptr}, {"",nullptr},
+#line 122 "auto/extension_to_mime_type.gperf"
+      {"cif", "chemical/x-cif"},
+      {"",nullptr},
+#line 777 "auto/extension_to_mime_type.gperf"
+      {"sus", "application/vnd.sus-calendar"},
+#line 509 "auto/extension_to_mime_type.gperf"
+      {"mus", "application/vnd.musician"},
+#line 609 "auto/extension_to_mime_type.gperf"
+      {"pic", "image/x-pict"},
+#line 912 "auto/extension_to_mime_type.gperf"
+      {"wmf", "application/x-msmetafile"},
+#line 178 "auto/extension_to_mime_type.gperf"
+      {"dist", "application/octet-stream"},
+      {"",nullptr},
+#line 814 "auto/extension_to_mime_type.gperf"
+      {"tiff", "image/tiff"},
+#line 890 "auto/extension_to_mime_type.gperf"
+      {"vsw", "application/vnd.visio"},
+#line 88 "auto/extension_to_mime_type.gperf"
+      {"c4f", "application/vnd.clonk.c4group"},
+#line 297 "auto/extension_to_mime_type.gperf"
+      {"gqf", "application/vnd.grafeq"},
+#line 987 "auto/extension_to_mime_type.gperf"
+      {"xvm", "application/xv+xml"},
+#line 33 "auto/extension_to_mime_type.gperf"
+      {"adp", "audio/adpcm"},
+#line 278 "auto/extension_to_mime_type.gperf"
+      {"g3", "image/g3fax"},
+      {"",nullptr},
+#line 90 "auto/extension_to_mime_type.gperf"
+      {"c4p", "application/vnd.clonk.c4group"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 85 "auto/extension_to_mime_type.gperf"
+      {"c11amc", "application/vnd.cluetrust.cartomobile-config"},
+#line 506 "auto/extension_to_mime_type.gperf"
+      {"msl", "application/vnd.mobius.msl"},
+#line 273 "auto/extension_to_mime_type.gperf"
+      {"fvt", "video/vnd.fvt"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 766 "auto/extension_to_mime_type.gperf"
+      {"ssml", "application/ssml+xml"},
+      {"",nullptr},
+#line 175 "auto/extension_to_mime_type.gperf"
+      {"dic", "text/x-c"},
+      {"",nullptr},
+#line 688 "auto/extension_to_mime_type.gperf"
+      {"rsd", "application/rsd+xml"},
+#line 982 "auto/extension_to_mime_type.gperf"
+      {"xsl", "application/xml"},
+#line 586 "auto/extension_to_mime_type.gperf"
+      {"p8", "application/pkcs8"},
+      {"",nullptr},
+#line 781 "auto/extension_to_mime_type.gperf"
+      {"svc", "application/vnd.dvb.service"},
+      {"",nullptr},
+#line 675 "auto/extension_to_mime_type.gperf"
+      {"rm", "application/vnd.rn-realmedia"},
+#line 430 "auto/extension_to_mime_type.gperf"
+      {"m4v", "video/x-m4v"},
+#line 727 "auto/extension_to_mime_type.gperf"
+      {"sid", "image/x-mrsid-image"},
+#line 455 "auto/extension_to_mime_type.gperf"
+      {"mid", "audio/midi"},
+#line 678 "auto/extension_to_mime_type.gperf"
+      {"rms", "application/vnd.jcp.javame.midlet-rms"},
+#line 659 "auto/extension_to_mime_type.gperf"
+      {"ra", "audio/x-pn-realaudio"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 149 "auto/extension_to_mime_type.gperf"
+      {"csml", "chemical/x-csml"},
+#line 778 "auto/extension_to_mime_type.gperf"
+      {"susp", "application/vnd.sus-calendar"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 917 "auto/extension_to_mime_type.gperf"
+      {"wmv", "video/x-ms-wmv"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 241 "auto/extension_to_mime_type.gperf"
+      {"f4v", "video/x-f4v"},
+      {"",nullptr},
+#line 661 "auto/extension_to_mime_type.gperf"
+      {"rar", "application/x-rar-compressed"},
+      {"",nullptr}, {"",nullptr},
+#line 978 "auto/extension_to_mime_type.gperf"
+      {"xpr", "application/vnd.is-xpr"},
+#line 923 "auto/extension_to_mime_type.gperf"
+      {"wpl", "application/vnd.ms-wpl"},
+      {"",nullptr},
+#line 911 "auto/extension_to_mime_type.gperf"
+      {"wmd", "application/x-ms-wmd"},
+      {"",nullptr},
+#line 944 "auto/extension_to_mime_type.gperf"
+      {"xbm", "image/x-xbitmap"},
+      {"",nullptr},
+#line 624 "auto/extension_to_mime_type.gperf"
+      {"ppam", "application/vnd.ms-powerpoint.addin.macroenabled.12"},
+#line 87 "auto/extension_to_mime_type.gperf"
+      {"c4d", "application/vnd.clonk.c4group"},
+#line 881 "auto/extension_to_mime_type.gperf"
+      {"viv", "video/vnd.vivo"},
+#line 244 "auto/extension_to_mime_type.gperf"
+      {"fbs", "image/vnd.fastbidsheet"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 763 "auto/extension_to_mime_type.gperf"
+      {"ssdl", "application/ssdl+xml"},
+#line 590 "auto/extension_to_mime_type.gperf"
+      {"pbm", "image/x-portable-bitmap"},
+#line 340 "auto/extension_to_mime_type.gperf"
+      {"ics", "text/calendar"},
+      {"",nullptr},
+#line 338 "auto/extension_to_mime_type.gperf"
+      {"icm", "application/vnd.iccprofile"},
+#line 100 "auto/extension_to_mime_type.gperf"
+      {"cbt", "application/x-cbr"},
+      {"",nullptr},
+#line 341 "auto/extension_to_mime_type.gperf"
+      {"ief", "image/ief"},
+      {"",nullptr},
+#line 677 "auto/extension_to_mime_type.gperf"
+      {"rmp", "audio/x-pn-realaudio-plugin"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 97 "auto/extension_to_mime_type.gperf"
+      {"cb7", "application/x-cbr"},
+#line 407 "auto/extension_to_mime_type.gperf"
+      {"list", "text/plain"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 427 "auto/extension_to_mime_type.gperf"
+      {"m3u8", "application/vnd.apple.mpegurl"},
+#line 782 "auto/extension_to_mime_type.gperf"
+      {"svd", "application/vnd.svd"},
+      {"",nullptr}, {"",nullptr},
+#line 202 "auto/extension_to_mime_type.gperf"
+      {"dump", "application/octet-stream"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 915 "auto/extension_to_mime_type.gperf"
+      {"wmls", "text/vnd.wap.wmlscript"},
+#line 52 "auto/extension_to_mime_type.gperf"
+      {"asm", "text/x-asm"},
+      {"",nullptr},
+#line 408 "auto/extension_to_mime_type.gperf"
+      {"list3820", "application/vnd.ibm.modcap"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 539 "auto/extension_to_mime_type.gperf"
+      {"oas", "application/vnd.fujitsu.oasys"},
+#line 796 "auto/extension_to_mime_type.gperf"
+      {"taglet", "application/vnd.mynfc"},
+      {"",nullptr},
+#line 336 "auto/extension_to_mime_type.gperf"
+      {"icc", "application/vnd.iccprofile"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 446 "auto/extension_to_mime_type.gperf"
+      {"me", "text/troff"},
+#line 706 "auto/extension_to_mime_type.gperf"
+      {"sdkm", "application/vnd.solent.sdkm+xml"},
+#line 671 "auto/extension_to_mime_type.gperf"
+      {"ris", "application/x-research-info-systems"},
+      {"",nullptr},
+#line 931 "auto/extension_to_mime_type.gperf"
+      {"wvx", "video/x-ms-wvx"},
+#line 916 "auto/extension_to_mime_type.gperf"
+      {"wmlsc", "application/vnd.wap.wmlscriptc"},
+#line 54 "auto/extension_to_mime_type.gperf"
+      {"asx", "video/x-ms-asf"},
+#line 780 "auto/extension_to_mime_type.gperf"
+      {"sv4crc", "application/x-sv4crc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 409 "auto/extension_to_mime_type.gperf"
+      {"listafp", "application/vnd.ibm.modcap"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 65 "auto/extension_to_mime_type.gperf"
+      {"azw", "application/vnd.amazon.ebook"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 972 "auto/extension_to_mime_type.gperf"
+      {"xml", "application/xml"},
+#line 51 "auto/extension_to_mime_type.gperf"
+      {"asf", "video/x-ms-asf"},
+      {"",nullptr},
+#line 50 "auto/extension_to_mime_type.gperf"
+      {"asc", "application/pgp-signature"},
+#line 914 "auto/extension_to_mime_type.gperf"
+      {"wmlc", "application/vnd.wap.wmlc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 135 "auto/extension_to_mime_type.gperf"
+      {"cml", "chemical/x-cml"},
+      {"",nullptr},
+#line 617 "auto/extension_to_mime_type.gperf"
+      {"pml", "application/vnd.ctc-posml"},
+#line 296 "auto/extension_to_mime_type.gperf"
+      {"gpx", "application/gpx+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 898 "auto/extension_to_mime_type.gperf"
+      {"wbs", "application/vnd.criticaltools.wbs+xml"},
+#line 669 "auto/extension_to_mime_type.gperf"
+      {"rif", "application/reginfo+xml"},
+      {"",nullptr},
+#line 943 "auto/extension_to_mime_type.gperf"
+      {"xbd", "application/vnd.fujixerox.docuworks.binder"},
+      {"",nullptr},
+#line 651 "auto/extension_to_mime_type.gperf"
+      {"qps", "application/vnd.publishare-delta-tree"},
+      {"",nullptr},
+#line 670 "auto/extension_to_mime_type.gperf"
+      {"rip", "audio/vnd.rip"},
+#line 163 "auto/extension_to_mime_type.gperf"
+      {"davmount", "application/davmount+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 589 "auto/extension_to_mime_type.gperf"
+      {"pbd", "application/vnd.powerbuilder6"},
+      {"",nullptr},
+#line 416 "auto/extension_to_mime_type.gperf"
+      {"lvp", "audio/vnd.lucent.voice"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 722 "auto/extension_to_mime_type.gperf"
+      {"sgm", "text/sgml"},
+      {"",nullptr},
+#line 811 "auto/extension_to_mime_type.gperf"
+      {"tgs", "application/x-tgsticker"},
+#line 928 "auto/extension_to_mime_type.gperf"
+      {"wsdl", "application/wsdl+xml"},
+#line 279 "auto/extension_to_mime_type.gperf"
+      {"g3w", "application/vnd.geospace"},
+#line 686 "auto/extension_to_mime_type.gperf"
+      {"rq", "application/sparql-query"},
+#line 874 "auto/extension_to_mime_type.gperf"
+      {"vcard", "text/vcard"},
+      {"",nullptr},
+#line 109 "auto/extension_to_mime_type.gperf"
+      {"cdmic", "application/cdmi-container"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 392 "auto/extension_to_mime_type.gperf"
+      {"kpt", "application/vnd.kde.kpresenter"},
+      {"",nullptr},
+#line 422 "auto/extension_to_mime_type.gperf"
+      {"m21", "application/mp21"},
+#line 118 "auto/extension_to_mime_type.gperf"
+      {"cgm", "image/cgm"},
+      {"",nullptr},
+#line 605 "auto/extension_to_mime_type.gperf"
+      {"pgm", "image/x-portable-graymap"},
+#line 424 "auto/extension_to_mime_type.gperf"
+      {"m2v", "video/mpeg"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 538 "auto/extension_to_mime_type.gperf"
+      {"oa3", "application/vnd.fujitsu.oasys3"},
+#line 897 "auto/extension_to_mime_type.gperf"
+      {"wbmp", "image/vnd.wap.wbmp"},
+      {"",nullptr}, {"",nullptr},
+#line 729 "auto/extension_to_mime_type.gperf"
+      {"sil", "audio/silk"},
+      {"",nullptr}, {"",nullptr},
+#line 832 "auto/extension_to_mime_type.gperf"
+      {"u32", "application/x-authorware-bin"},
+#line 551 "auto/extension_to_mime_type.gperf"
+      {"ods", "application/vnd.oasis.opendocument.spreadsheet"},
+#line 110 "auto/extension_to_mime_type.gperf"
+      {"cdmid", "application/cdmi-domain"},
+#line 549 "auto/extension_to_mime_type.gperf"
+      {"odm", "application/vnd.oasis.opendocument.text-master"},
+#line 705 "auto/extension_to_mime_type.gperf"
+      {"sdkd", "application/vnd.solent.sdkm+xml"},
+#line 249 "auto/extension_to_mime_type.gperf"
+      {"fg5", "application/vnd.fujitsu.oasysgp"},
+#line 453 "auto/extension_to_mime_type.gperf"
+      {"mgp", "application/vnd.osgeo.mapguide.package"},
+      {"",nullptr},
+#line 213 "auto/extension_to_mime_type.gperf"
+      {"edm", "application/vnd.novadigm.edm"},
+#line 552 "auto/extension_to_mime_type.gperf"
+      {"odt", "application/vnd.oasis.opendocument.text"},
+#line 469 "auto/extension_to_mime_type.gperf"
+      {"mmr", "image/vnd.fujixerox.edmics-mmr"},
+#line 393 "auto/extension_to_mime_type.gperf"
+      {"kpxx", "application/vnd.ds-keypoint"},
+      {"",nullptr}, {"",nullptr},
+#line 710 "auto/extension_to_mime_type.gperf"
+      {"seed", "application/vnd.fdsn.seed"},
+      {"",nullptr},
+#line 124 "auto/extension_to_mime_type.gperf"
+      {"cil", "application/vnd.ms-artgalry"},
+#line 304 "auto/extension_to_mime_type.gperf"
+      {"gsf", "application/x-font-ghostscript"},
+#line 711 "auto/extension_to_mime_type.gperf"
+      {"sema", "application/vnd.sema"},
+      {"",nullptr},
+#line 425 "auto/extension_to_mime_type.gperf"
+      {"m3a", "audio/mpeg"},
+#line 913 "auto/extension_to_mime_type.gperf"
+      {"wml", "text/vnd.wap.wml"},
+#line 996 "auto/extension_to_mime_type.gperf"
+      {"z3", "application/x-zmachine"},
+      {"",nullptr},
+#line 463 "auto/extension_to_mime_type.gperf"
+      {"mka", "audio/x-matroska"},
+#line 646 "auto/extension_to_mime_type.gperf"
+      {"pya", "audio/vnd.ms-playready.media.pya"},
+#line 607 "auto/extension_to_mime_type.gperf"
+      {"pgp", "application/pgp-encrypted"},
+#line 22 "auto/extension_to_mime_type.gperf"
+      {"7z", "application/x-7z-compressed"},
+#line 214 "auto/extension_to_mime_type.gperf"
+      {"edx", "application/vnd.novadigm.edx"},
+      {"",nullptr},
+#line 991 "auto/extension_to_mime_type.gperf"
+      {"xz", "application/x-xz"},
+      {"",nullptr},
+#line 546 "auto/extension_to_mime_type.gperf"
+      {"odft", "application/vnd.oasis.opendocument.formula-template"},
+      {"",nullptr},
+#line 17 "auto/extension_to_mime_type.gperf"
+      {"123", "application/vnd.lotus-1-2-3"},
+      {"",nullptr}, {"",nullptr},
+#line 545 "auto/extension_to_mime_type.gperf"
+      {"odf", "application/vnd.oasis.opendocument.formula"},
+      {"",nullptr},
+#line 544 "auto/extension_to_mime_type.gperf"
+      {"odc", "application/vnd.oasis.opendocument.chart"},
+      {"",nullptr},
+#line 537 "auto/extension_to_mime_type.gperf"
+      {"oa2", "application/vnd.fujitsu.oasys2"},
+#line 633 "auto/extension_to_mime_type.gperf"
+      {"pqa", "application/vnd.palm"},
+#line 550 "auto/extension_to_mime_type.gperf"
+      {"odp", "application/vnd.oasis.opendocument.presentation"},
+      {"",nullptr},
+#line 488 "auto/extension_to_mime_type.gperf"
+      {"mpg4", "video/mp4"},
+#line 994 "auto/extension_to_mime_type.gperf"
+      {"z1", "application/x-zmachine"},
+      {"",nullptr}, {"",nullptr},
+#line 174 "auto/extension_to_mime_type.gperf"
+      {"dgc", "application/x-dgc-compressed"},
+#line 803 "auto/extension_to_mime_type.gperf"
+      {"teicorpus", "application/tei+xml"},
+#line 21 "auto/extension_to_mime_type.gperf"
+      {"3gp", "video/3gpp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 239 "auto/extension_to_mime_type.gperf"
+      {"ez3", "application/vnd.ezpix-package"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 401 "auto/extension_to_mime_type.gperf"
+      {"latex", "application/x-latex"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 986 "auto/extension_to_mime_type.gperf"
+      {"xul", "application/vnd.mozilla.xul+xml"},
+      {"",nullptr}, {"",nullptr},
+#line 988 "auto/extension_to_mime_type.gperf"
+      {"xvml", "application/xv+xml"},
+      {"",nullptr},
+#line 402 "auto/extension_to_mime_type.gperf"
+      {"lbd", "application/vnd.llamagraphics.life-balance.desktop"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 907 "auto/extension_to_mime_type.gperf"
+      {"wgt", "application/widget"},
+#line 224 "auto/extension_to_mime_type.gperf"
+      {"eps", "application/postscript"},
+#line 250 "auto/extension_to_mime_type.gperf"
+      {"fgd", "application/x-director"},
+      {"",nullptr},
+#line 394 "auto/extension_to_mime_type.gperf"
+      {"ksp", "application/vnd.kde.kspread"},
+#line 66 "auto/extension_to_mime_type.gperf"
+      {"bat", "application/x-msdownload"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 754 "auto/extension_to_mime_type.gperf"
+      {"spot", "text/vnd.in3d.spot"},
+      {"",nullptr}, {"",nullptr},
+#line 43 "auto/extension_to_mime_type.gperf"
+      {"ait", "application/vnd.dvb.ait"},
+#line 937 "auto/extension_to_mime_type.gperf"
+      {"x3dvz", "model/x3d+vrml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 899 "auto/extension_to_mime_type.gperf"
+      {"wbxml", "application/vnd.wap.wbxml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 238 "auto/extension_to_mime_type.gperf"
+      {"ez2", "application/vnd.ezpix-album"},
+      {"",nullptr},
+#line 702 "auto/extension_to_mime_type.gperf"
+      {"sda", "application/vnd.stardivision.draw"},
+      {"",nullptr},
+#line 562 "auto/extension_to_mime_type.gperf"
+      {"opf", "application/oebps-package+xml"},
+      {"",nullptr},
+#line 293 "auto/extension_to_mime_type.gperf"
+      {"gmx", "application/vnd.gmx"},
+      {"",nullptr},
+#line 284 "auto/extension_to_mime_type.gperf"
+      {"gdl", "model/vnd.gdl"},
+#line 695 "auto/extension_to_mime_type.gperf"
+      {"sbml", "application/sbml+xml"},
+#line 741 "auto/extension_to_mime_type.gperf"
+      {"slt", "application/vnd.epson.salt"},
+      {"",nullptr},
+#line 39 "auto/extension_to_mime_type.gperf"
+      {"aif", "audio/x-aiff"},
+#line 963 "auto/extension_to_mime_type.gperf"
+      {"xls", "application/vnd.ms-excel"},
+      {"",nullptr},
+#line 962 "auto/extension_to_mime_type.gperf"
+      {"xlm", "application/vnd.ms-excel"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 965 "auto/extension_to_mime_type.gperf"
+      {"xlsm", "application/vnd.ms-excel.sheet.macroenabled.12"},
+#line 967 "auto/extension_to_mime_type.gperf"
+      {"xlt", "application/vnd.ms-excel"},
+#line 522 "auto/extension_to_mime_type.gperf"
+      {"nc", "application/x-netcdf"},
+#line 616 "auto/extension_to_mime_type.gperf"
+      {"pls", "application/pls+xml"},
+#line 968 "auto/extension_to_mime_type.gperf"
+      {"xltm", "application/vnd.ms-excel.template.macroenabled.12"},
+#line 519 "auto/extension_to_mime_type.gperf"
+      {"n3", "text/n3"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 523 "auto/extension_to_mime_type.gperf"
+      {"ncx", "application/x-dtbncx+xml"},
+#line 950 "auto/extension_to_mime_type.gperf"
+      {"xenc", "application/xenc+xml"},
+#line 226 "auto/extension_to_mime_type.gperf"
+      {"es", "application/ecmascript"},
+      {"",nullptr},
+#line 176 "auto/extension_to_mime_type.gperf"
+      {"dir", "application/x-director"},
+#line 41 "auto/extension_to_mime_type.gperf"
+      {"aiff", "audio/x-aiff"},
+      {"",nullptr},
+#line 40 "auto/extension_to_mime_type.gperf"
+      {"aifc", "audio/x-aiff"},
+      {"",nullptr}, {"",nullptr},
+#line 966 "auto/extension_to_mime_type.gperf"
+      {"xlsx", "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet"},
+      {"",nullptr},
+#line 262 "auto/extension_to_mime_type.gperf"
+      {"flx", "text/vnd.fmi.flexstor"},
+      {"",nullptr},
+#line 969 "auto/extension_to_mime_type.gperf"
+      {"xltx", "application/vnd.openxmlformats-officedocument.spreadsheetml.template"},
+#line 466 "auto/extension_to_mime_type.gperf"
+      {"mlp", "application/vnd.dolby.mlp"},
+#line 20 "auto/extension_to_mime_type.gperf"
+      {"3g2", "video/3gpp2"},
+      {"",nullptr}, {"",nullptr},
+#line 961 "auto/extension_to_mime_type.gperf"
+      {"xlf", "application/x-xliff+xml"},
+      {"",nullptr},
+#line 960 "auto/extension_to_mime_type.gperf"
+      {"xlc", "application/vnd.ms-excel"},
+      {"",nullptr},
+#line 767 "auto/extension_to_mime_type.gperf"
+      {"st", "application/vnd.sailingtracker.track"},
+      {"",nullptr},
+#line 508 "auto/extension_to_mime_type.gperf"
+      {"mts", "model/vnd.mts"},
+#line 382 "auto/extension_to_mime_type.gperf"
+      {"kar", "audio/midi"},
+#line 739 "auto/extension_to_mime_type.gperf"
+      {"sldm", "application/vnd.ms-powerpoint.slide.macroenabled.12"},
+      {"",nullptr},
+#line 615 "auto/extension_to_mime_type.gperf"
+      {"plf", "application/vnd.pocketlearn"},
+      {"",nullptr},
+#line 614 "auto/extension_to_mime_type.gperf"
+      {"plc", "application/vnd.mobius.plc"},
+      {"",nullptr},
+#line 132 "auto/extension_to_mime_type.gperf"
+      {"clp", "application/x-msclip"},
+      {"",nullptr},
+#line 351 "auto/extension_to_mime_type.gperf"
+      {"ims", "application/vnd.ms-ims"},
+#line 291 "auto/extension_to_mime_type.gperf"
+      {"gim", "application/vnd.groove-identity-message"},
+      {"",nullptr},
+#line 566 "auto/extension_to_mime_type.gperf"
+      {"osf", "application/vnd.yamaha.openscoreformat"},
+      {"",nullptr}, {"",nullptr},
+#line 69 "auto/extension_to_mime_type.gperf"
+      {"bdm", "application/vnd.syncml.dm+wbxml"},
+#line 70 "auto/extension_to_mime_type.gperf"
+      {"bed", "application/vnd.realvnc.bed"},
+#line 229 "auto/extension_to_mime_type.gperf"
+      {"esf", "application/vnd.epson.esf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 740 "auto/extension_to_mime_type.gperf"
+      {"sldx", "application/vnd.openxmlformats-officedocument.presentationml.slide"},
+      {"",nullptr},
+#line 433 "auto/extension_to_mime_type.gperf"
+      {"mag", "application/vnd.ecowin.chart"},
+      {"",nullptr}, {"",nullptr},
+#line 48 "auto/extension_to_mime_type.gperf"
+      {"apr", "application/vnd.lotus-approach"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 904 "auto/extension_to_mime_type.gperf"
+      {"webm", "video/webm"},
+      {"",nullptr}, {"",nullptr},
+#line 770 "auto/extension_to_mime_type.gperf"
+      {"stf", "application/vnd.wt.stf"},
+      {"",nullptr},
+#line 768 "auto/extension_to_mime_type.gperf"
+      {"stc", "application/vnd.sun.xml.calc.template"},
+      {"",nullptr},
+#line 825 "auto/extension_to_mime_type.gperf"
+      {"ttf", "font/ttf"},
+      {"",nullptr},
+#line 824 "auto/extension_to_mime_type.gperf"
+      {"ttc", "font/collection"},
+#line 701 "auto/extension_to_mime_type.gperf"
+      {"scurl", "text/vnd.curl.scurl"},
+#line 443 "auto/extension_to_mime_type.gperf"
+      {"mcurl", "text/vnd.curl.mcurl"},
+      {"",nullptr},
+#line 290 "auto/extension_to_mime_type.gperf"
+      {"gif", "image/gif"},
+      {"",nullptr},
+#line 200 "auto/extension_to_mime_type.gperf"
+      {"dts", "audio/vnd.dts"},
+      {"",nullptr},
+#line 260 "auto/extension_to_mime_type.gperf"
+      {"flv", "video/x-flv"},
+#line 68 "auto/extension_to_mime_type.gperf"
+      {"bdf", "application/x-font-bdf"},
+      {"",nullptr},
+#line 350 "auto/extension_to_mime_type.gperf"
+      {"imp", "application/vnd.accpac.simply.imp"},
+      {"",nullptr}, {"",nullptr},
+#line 271 "auto/extension_to_mime_type.gperf"
+      {"ftc", "application/vnd.fluxtime.clip"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 99 "auto/extension_to_mime_type.gperf"
+      {"cbr", "application/x-cbr"},
+      {"",nullptr}, {"",nullptr},
+#line 610 "auto/extension_to_mime_type.gperf"
+      {"pkg", "application/octet-stream"},
+#line 596 "auto/extension_to_mime_type.gperf"
+      {"pcurl", "application/vnd.curl.pcurl"},
+#line 641 "auto/extension_to_mime_type.gperf"
+      {"pskcxml", "application/pskc+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 721 "auto/extension_to_mime_type.gperf"
+      {"sgl", "application/vnd.stardivision.writer-global"},
+      {"",nullptr}, {"",nullptr},
+#line 905 "auto/extension_to_mime_type.gperf"
+      {"webp", "image/webp"},
+      {"",nullptr},
+#line 227 "auto/extension_to_mime_type.gperf"
+      {"es3", "application/vnd.eszigno3+xml"},
+#line 723 "auto/extension_to_mime_type.gperf"
+      {"sgml", "text/sgml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 481 "auto/extension_to_mime_type.gperf"
+      {"mp4a", "audio/mp4"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 942 "auto/extension_to_mime_type.gperf"
+      {"xbap", "application/x-ms-xbap"},
+      {"",nullptr},
+#line 166 "auto/extension_to_mime_type.gperf"
+      {"dcurl", "text/vnd.curl.dcurl"},
+      {"",nullptr},
+#line 619 "auto/extension_to_mime_type.gperf"
+      {"pnm", "image/x-portable-anymap"},
+#line 478 "auto/extension_to_mime_type.gperf"
+      {"mp2a", "audio/mpeg"},
+      {"",nullptr},
+#line 769 "auto/extension_to_mime_type.gperf"
+      {"std", "application/vnd.sun.xml.draw.template"},
+      {"",nullptr}, {"",nullptr},
+#line 155 "auto/extension_to_mime_type.gperf"
+      {"curl", "text/vnd.curl"},
+      {"",nullptr},
+#line 308 "auto/extension_to_mime_type.gperf"
+      {"gv", "text/vnd.graphviz"},
+#line 32 "auto/extension_to_mime_type.gperf"
+      {"acutc", "application/vnd.acucorp"},
+      {"",nullptr},
+#line 877 "auto/extension_to_mime_type.gperf"
+      {"vcg", "application/vnd.groove-vcard"},
+      {"",nullptr},
+#line 749 "auto/extension_to_mime_type.gperf"
+      {"snf", "application/x-font-snf"},
+      {"",nullptr},
+#line 532 "auto/extension_to_mime_type.gperf"
+      {"npx", "image/vnd.net-fpx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 83 "auto/extension_to_mime_type.gperf"
+      {"bz2", "application/x-bzip2"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 218 "auto/extension_to_mime_type.gperf"
+      {"emf", "application/x-msmetafile"},
+#line 265 "auto/extension_to_mime_type.gperf"
+      {"fnc", "application/vnd.frogans.fnc"},
+#line 349 "auto/extension_to_mime_type.gperf"
+      {"iif", "application/vnd.shana.informed.interchange"},
+      {"",nullptr}, {"",nullptr},
+#line 699 "auto/extension_to_mime_type.gperf"
+      {"scq", "application/scvp-cv-request"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 564 "auto/extension_to_mime_type.gperf"
+      {"oprc", "application/vnd.palm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 108 "auto/extension_to_mime_type.gperf"
+      {"cdmia", "application/cdmi-capability"},
+#line 199 "auto/extension_to_mime_type.gperf"
+      {"dtd", "application/xml-dtd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 1006 "auto/extension_to_mime_type.gperf"
+      {"zmm", "application/vnd.handheld-entertainment+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 162 "auto/extension_to_mime_type.gperf"
+      {"dataless", "application/vnd.fdsn.seed"},
+      {"",nullptr},
+#line 366 "auto/extension_to_mime_type.gperf"
+      {"jam", "application/vnd.jam"},
+#line 854 "auto/extension_to_mime_type.gperf"
+      {"uvs", "video/vnd.dece.sd"},
+#line 673 "auto/extension_to_mime_type.gperf"
+      {"rlc", "image/vnd.fujixerox.edmics-rlc"},
+#line 852 "auto/extension_to_mime_type.gperf"
+      {"uvm", "video/vnd.dece.mobile"},
+#line 748 "auto/extension_to_mime_type.gperf"
+      {"snd", "audio/basic"},
+#line 970 "auto/extension_to_mime_type.gperf"
+      {"xlw", "application/vnd.ms-excel"},
+#line 415 "auto/extension_to_mime_type.gperf"
+      {"ltf", "application/vnd.frogans.ltf"},
+      {"",nullptr}, {"",nullptr},
+#line 855 "auto/extension_to_mime_type.gperf"
+      {"uvt", "application/vnd.dece.ttml+xml"},
+#line 391 "auto/extension_to_mime_type.gperf"
+      {"kpr", "application/vnd.kde.kpresenter"},
+      {"",nullptr},
+#line 261 "auto/extension_to_mime_type.gperf"
+      {"flw", "application/vnd.kde.kivio"},
+      {"",nullptr}, {"",nullptr},
+#line 585 "auto/extension_to_mime_type.gperf"
+      {"p7s", "application/pkcs7-signature"},
+      {"",nullptr},
+#line 583 "auto/extension_to_mime_type.gperf"
+      {"p7m", "application/pkcs7-mime"},
+#line 154 "auto/extension_to_mime_type.gperf"
+      {"cu", "application/cu-seeme"},
+#line 216 "auto/extension_to_mime_type.gperf"
+      {"ei6", "application/vnd.pg.osasli"},
+      {"",nullptr}, {"",nullptr},
+#line 563 "auto/extension_to_mime_type.gperf"
+      {"opml", "text/x-opml"},
+#line 872 "auto/extension_to_mime_type.gperf"
+      {"uvx", "application/vnd.dece.unspecified"},
+#line 534 "auto/extension_to_mime_type.gperf"
+      {"nsf", "application/vnd.lotus-notes"},
+#line 363 "auto/extension_to_mime_type.gperf"
+      {"ivp", "application/vnd.immervision-ivp"},
+#line 533 "auto/extension_to_mime_type.gperf"
+      {"nsc", "application/x-conference"},
+      {"",nullptr},
+#line 242 "auto/extension_to_mime_type.gperf"
+      {"f77", "text/x-fortran"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 292 "auto/extension_to_mime_type.gperf"
+      {"gml", "application/gml+xml"},
+#line 487 "auto/extension_to_mime_type.gperf"
+      {"mpg", "video/mpeg"},
+#line 663 "auto/extension_to_mime_type.gperf"
+      {"rcprofile", "application/vnd.ipunplugged.rcprofile"},
+#line 802 "auto/extension_to_mime_type.gperf"
+      {"tei", "application/tei+xml"},
+      {"",nullptr},
+#line 848 "auto/extension_to_mime_type.gperf"
+      {"uvf", "application/vnd.dece.data"},
+#line 691 "auto/extension_to_mime_type.gperf"
+      {"rtx", "text/richtext"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 853 "auto/extension_to_mime_type.gperf"
+      {"uvp", "video/vnd.dece.pd"},
+      {"",nullptr}, {"",nullptr},
+#line 775 "auto/extension_to_mime_type.gperf"
+      {"stw", "application/vnd.sun.xml.writer.template"},
+      {"",nullptr},
+#line 866 "auto/extension_to_mime_type.gperf"
+      {"uvvs", "video/vnd.dece.sd"},
+      {"",nullptr},
+#line 864 "auto/extension_to_mime_type.gperf"
+      {"uvvm", "video/vnd.dece.mobile"},
+#line 805 "auto/extension_to_mime_type.gperf"
+      {"texi", "application/x-texinfo"},
+#line 690 "auto/extension_to_mime_type.gperf"
+      {"rtf", "application/rtf"},
+#line 582 "auto/extension_to_mime_type.gperf"
+      {"p7c", "application/pkcs7-mime"},
+      {"",nullptr}, {"",nullptr},
+#line 867 "auto/extension_to_mime_type.gperf"
+      {"uvvt", "application/vnd.dece.ttml+xml"},
+#line 328 "auto/extension_to_mime_type.gperf"
+      {"hqx", "application/mac-binhex40"},
+      {"",nullptr}, {"",nullptr},
+#line 674 "auto/extension_to_mime_type.gperf"
+      {"rld", "application/resource-lists-diff+xml"},
+      {"",nullptr},
+#line 716 "auto/extension_to_mime_type.gperf"
+      {"setreg", "application/set-registration-initiation"},
+#line 611 "auto/extension_to_mime_type.gperf"
+      {"pki", "application/pkixcmp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 870 "auto/extension_to_mime_type.gperf"
+      {"uvvx", "application/vnd.dece.unspecified"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 426 "auto/extension_to_mime_type.gperf"
+      {"m3u", "audio/x-mpegurl"},
+      {"",nullptr},
+#line 27 "auto/extension_to_mime_type.gperf"
+      {"abw", "application/x-abiword"},
+      {"",nullptr}, {"",nullptr},
+#line 194 "auto/extension_to_mime_type.gperf"
+      {"dpg", "application/vnd.dpgraph"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 860 "auto/extension_to_mime_type.gperf"
+      {"uvvf", "application/vnd.dece.data"},
+#line 857 "auto/extension_to_mime_type.gperf"
+      {"uvv", "video/vnd.dece.video"},
+#line 288 "auto/extension_to_mime_type.gperf"
+      {"ggt", "application/vnd.geogebra.tool"},
+      {"",nullptr},
+#line 386 "auto/extension_to_mime_type.gperf"
+      {"kml", "application/vnd.google-earth.kml+xml"},
+      {"",nullptr},
+#line 865 "auto/extension_to_mime_type.gperf"
+      {"uvvp", "video/vnd.dece.pd"},
+#line 672 "auto/extension_to_mime_type.gperf"
+      {"rl", "application/resource-lists+xml"},
+      {"",nullptr}, {"",nullptr},
+#line 365 "auto/extension_to_mime_type.gperf"
+      {"jad", "text/vnd.sun.j2me.app-descriptor"},
+      {"",nullptr}, {"",nullptr},
+#line 847 "auto/extension_to_mime_type.gperf"
+      {"uvd", "application/vnd.dece.data"},
+#line 182 "auto/extension_to_mime_type.gperf"
+      {"dll", "application/x-msdownload"},
+      {"",nullptr},
+#line 756 "auto/extension_to_mime_type.gperf"
+      {"spq", "application/scvp-vp-request"},
+      {"",nullptr},
+#line 773 "auto/extension_to_mime_type.gperf"
+      {"stl", "application/vnd.ms-pki.stl"},
+#line 112 "auto/extension_to_mime_type.gperf"
+      {"cdmiq", "application/cdmi-queue"},
+      {"",nullptr}, {"",nullptr},
+#line 826 "auto/extension_to_mime_type.gperf"
+      {"ttl", "text/turtle"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 1003 "auto/extension_to_mime_type.gperf"
+      {"zip", "application/zip"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 42 "auto/extension_to_mime_type.gperf"
+      {"air", "application/vnd.adobe.air-application-installer-package+zip"},
+#line 428 "auto/extension_to_mime_type.gperf"
+      {"m4a", "audio/mp4"},
+#line 745 "auto/extension_to_mime_type.gperf"
+      {"smil", "application/smil+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 680 "auto/extension_to_mime_type.gperf"
+      {"rnc", "application/relax-ng-compact-syntax"},
+#line 445 "auto/extension_to_mime_type.gperf"
+      {"mdi", "image/vnd.ms-modi"},
+#line 179 "auto/extension_to_mime_type.gperf"
+      {"distz", "application/octet-stream"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 910 "auto/extension_to_mime_type.gperf"
+      {"wma", "audio/x-ms-wma"},
+      {"",nullptr},
+#line 869 "auto/extension_to_mime_type.gperf"
+      {"uvvv", "video/vnd.dece.video"},
+      {"",nullptr},
+#line 997 "auto/extension_to_mime_type.gperf"
+      {"z4", "application/x-zmachine"},
+#line 76 "auto/extension_to_mime_type.gperf"
+      {"bmp", "image/bmp"},
+      {"",nullptr},
+#line 1001 "auto/extension_to_mime_type.gperf"
+      {"z8", "application/x-zmachine"},
+      {"",nullptr},
+#line 440 "auto/extension_to_mime_type.gperf"
+      {"mbox", "application/mbox"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 510 "auto/extension_to_mime_type.gperf"
+      {"musicxml", "application/vnd.recordare.musicxml+xml"},
+#line 859 "auto/extension_to_mime_type.gperf"
+      {"uvvd", "application/vnd.dece.data"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 806 "auto/extension_to_mime_type.gperf"
+      {"texinfo", "application/x-texinfo"},
+#line 959 "auto/extension_to_mime_type.gperf"
+      {"xlam", "application/vnd.ms-excel.addin.macroenabled.12"},
+      {"",nullptr}, {"",nullptr},
+#line 801 "auto/extension_to_mime_type.gperf"
+      {"teacher", "application/vnd.smart.teacher"},
+      {"",nullptr},
+#line 318 "auto/extension_to_mime_type.gperf"
+      {"hdf", "application/x-hdf"},
+      {"",nullptr},
+#line 126 "auto/extension_to_mime_type.gperf"
+      {"class", "application/java-vm"},
+#line 283 "auto/extension_to_mime_type.gperf"
+      {"gca", "application/x-gca-compressed"},
+#line 347 "auto/extension_to_mime_type.gperf"
+      {"igs", "model/iges"},
+#line 999 "auto/extension_to_mime_type.gperf"
+      {"z6", "application/x-zmachine"},
+#line 346 "auto/extension_to_mime_type.gperf"
+      {"igm", "application/vnd.insors.igm"},
+      {"",nullptr},
+#line 181 "auto/extension_to_mime_type.gperf"
+      {"djvu", "image/vnd.djvu"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 378 "auto/extension_to_mime_type.gperf"
+      {"jpm", "video/jpm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 797 "auto/extension_to_mime_type.gperf"
+      {"tao", "application/vnd.tao.intent-module-archive"},
+#line 46 "auto/extension_to_mime_type.gperf"
+      {"appcache", "text/cache-manifest"},
+      {"",nullptr},
+#line 906 "auto/extension_to_mime_type.gperf"
+      {"wg", "application/vnd.pmi.widget"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 348 "auto/extension_to_mime_type.gperf"
+      {"igx", "application/vnd.micrografx.igx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 709 "auto/extension_to_mime_type.gperf"
+      {"see", "application/vnd.seemail"},
+      {"",nullptr},
+#line 327 "auto/extension_to_mime_type.gperf"
+      {"hps", "application/vnd.hp-hps"},
+      {"",nullptr},
+#line 219 "auto/extension_to_mime_type.gperf"
+      {"eml", "message/rfc822"},
+      {"",nullptr},
+#line 257 "auto/extension_to_mime_type.gperf"
+      {"flac", "audio/x-flac"},
+#line 774 "auto/extension_to_mime_type.gperf"
+      {"str", "application/vnd.pg.format"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 975 "auto/extension_to_mime_type.gperf"
+      {"xpi", "application/x-xpinstall"},
+#line 59 "auto/extension_to_mime_type.gperf"
+      {"atx", "application/vnd.antix.game-component"},
+#line 540 "auto/extension_to_mime_type.gperf"
+      {"obd", "application/x-msbinder"},
+      {"",nullptr}, {"",nullptr},
+#line 821 "auto/extension_to_mime_type.gperf"
+      {"trm", "application/x-msterminal"},
+      {"",nullptr},
+#line 760 "auto/extension_to_mime_type.gperf"
+      {"srt", "application/x-subrip"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 526 "auto/extension_to_mime_type.gperf"
+      {"nitf", "application/vnd.nitf"},
+      {"",nullptr}, {"",nullptr},
+#line 55 "auto/extension_to_mime_type.gperf"
+      {"atc", "application/vnd.acucorp"},
+#line 111 "auto/extension_to_mime_type.gperf"
+      {"cdmio", "application/cdmi-object"},
+      {"",nullptr},
+#line 277 "auto/extension_to_mime_type.gperf"
+      {"g2w", "application/vnd.geoplan"},
+#line 762 "auto/extension_to_mime_type.gperf"
+      {"srx", "application/sparql-results+xml"},
+#line 379 "auto/extension_to_mime_type.gperf"
+      {"js", "application/javascript"},
+#line 159 "auto/extension_to_mime_type.gperf"
+      {"dae", "model/vnd.collada+xml"},
+#line 357 "auto/extension_to_mime_type.gperf"
+      {"ipfix", "application/ipfix"},
+      {"",nullptr},
+#line 146 "auto/extension_to_mime_type.gperf"
+      {"crt", "application/x-x509-ca-cert"},
+      {"",nullptr}, {"",nullptr},
+#line 98 "auto/extension_to_mime_type.gperf"
+      {"cba", "application/x-cbr"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 759 "auto/extension_to_mime_type.gperf"
+      {"src", "application/x-wais-source"},
+#line 497 "auto/extension_to_mime_type.gperf"
+      {"mrc", "application/marc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 718 "auto/extension_to_mime_type.gperf"
+      {"sfs", "application/vnd.spotfire.sfs"},
+#line 183 "auto/extension_to_mime_type.gperf"
+      {"dmg", "application/x-apple-diskimage"},
+#line 498 "auto/extension_to_mime_type.gperf"
+      {"mrcx", "application/marcxml+xml"},
+#line 451 "auto/extension_to_mime_type.gperf"
+      {"mfm", "application/vnd.mfmp"},
+      {"",nullptr},
+#line 556 "auto/extension_to_mime_type.gperf"
+      {"ogx", "application/ogg"},
+#line 809 "auto/extension_to_mime_type.gperf"
+      {"tfm", "application/x-tex-tfm"},
+#line 786 "auto/extension_to_mime_type.gperf"
+      {"swf", "application/x-shockwave-flash"},
+#line 512 "auto/extension_to_mime_type.gperf"
+      {"mwf", "application/vnd.mfer"},
+#line 452 "auto/extension_to_mime_type.gperf"
+      {"mft", "application/rpki-manifest"},
+#line 505 "auto/extension_to_mime_type.gperf"
+      {"msi", "application/x-msdownload"},
+      {"",nullptr},
+#line 636 "auto/extension_to_mime_type.gperf"
+      {"prf", "application/pics-rules"},
+#line 434 "auto/extension_to_mime_type.gperf"
+      {"maker", "application/vnd.framemaker"},
+#line 634 "auto/extension_to_mime_type.gperf"
+      {"prc", "application/x-mobipocket-ebook"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 117 "auto/extension_to_mime_type.gperf"
+      {"cfs", "application/x-cfs-compressed"},
+      {"",nullptr},
+#line 38 "auto/extension_to_mime_type.gperf"
+      {"ai", "application/postscript"},
+      {"",nullptr},
+#line 602 "auto/extension_to_mime_type.gperf"
+      {"pfm", "application/x-font-type1"},
+      {"",nullptr},
+#line 306 "auto/extension_to_mime_type.gperf"
+      {"gtm", "application/vnd.groove-tool-message"},
+      {"",nullptr},
+#line 423 "auto/extension_to_mime_type.gperf"
+      {"m2a", "audio/mpeg"},
+#line 828 "auto/extension_to_mime_type.gperf"
+      {"twds", "application/vnd.simtech-mindmapper"},
+#line 438 "auto/extension_to_mime_type.gperf"
+      {"mb", "application/mathematica"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 728 "auto/extension_to_mime_type.gperf"
+      {"sig", "application/pgp-signature"},
+#line 316 "auto/extension_to_mime_type.gperf"
+      {"hal", "application/vnd.hal+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 604 "auto/extension_to_mime_type.gperf"
+      {"pfx", "application/x-pkcs12"},
+#line 237 "auto/extension_to_mime_type.gperf"
+      {"ez", "application/andrew-inset"},
+      {"",nullptr},
+#line 843 "auto/extension_to_mime_type.gperf"
+      {"ustar", "application/x-ustar"},
+#line 489 "auto/extension_to_mime_type.gperf"
+      {"mpga", "audio/mpeg"},
+      {"",nullptr}, {"",nullptr},
+#line 437 "auto/extension_to_mime_type.gperf"
+      {"mathml", "application/mathml+xml"},
+#line 256 "auto/extension_to_mime_type.gperf"
+      {"fig", "application/x-xfig"},
+      {"",nullptr},
+#line 995 "auto/extension_to_mime_type.gperf"
+      {"z2", "application/x-zmachine"},
+      {"",nullptr},
+#line 205 "auto/extension_to_mime_type.gperf"
+      {"dwf", "model/vnd.dwf"},
+#line 652 "auto/extension_to_mime_type.gperf"
+      {"qt", "video/quicktime"},
+      {"",nullptr}, {"",nullptr},
+#line 129 "auto/extension_to_mime_type.gperf"
+      {"clkt", "application/vnd.crick.clicker.template"},
+      {"",nullptr}, {"",nullptr},
+#line 89 "auto/extension_to_mime_type.gperf"
+      {"c4g", "application/vnd.clonk.c4group"},
+#line 990 "auto/extension_to_mime_type.gperf"
+      {"xyz", "chemical/x-xyz"},
+#line 282 "auto/extension_to_mime_type.gperf"
+      {"gbr", "application/rpki-ghostbusters"},
+      {"",nullptr}, {"",nullptr},
+#line 555 "auto/extension_to_mime_type.gperf"
+      {"ogv", "video/ogg"},
+      {"",nullptr}, {"",nullptr},
+#line 144 "auto/extension_to_mime_type.gperf"
+      {"crd", "application/x-mscardfile"},
+#line 827 "auto/extension_to_mime_type.gperf"
+      {"twd", "application/vnd.simtech-mindmapper"},
+      {"",nullptr},
+#line 131 "auto/extension_to_mime_type.gperf"
+      {"clkx", "application/vnd.crick.clicker"},
+      {"",nullptr}, {"",nullptr},
+#line 521 "auto/extension_to_mime_type.gperf"
+      {"nbp", "application/vnd.wolfram.player"},
+      {"",nullptr},
+#line 989 "auto/extension_to_mime_type.gperf"
+      {"xwd", "image/x-xwindowdump"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 719 "auto/extension_to_mime_type.gperf"
+      {"sfv", "text/x-sfv"},
+      {"",nullptr}, {"",nullptr},
+#line 783 "auto/extension_to_mime_type.gperf"
+      {"svg", "image/svg+xml"},
+#line 105 "auto/extension_to_mime_type.gperf"
+      {"cdbcmsg", "application/vnd.contact.cmsg"},
+#line 414 "auto/extension_to_mime_type.gperf"
+      {"lrm", "application/vnd.ms-lrm"},
+      {"",nullptr},
+#line 810 "auto/extension_to_mime_type.gperf"
+      {"tga", "image/x-tga"},
+#line 836 "auto/extension_to_mime_type.gperf"
+      {"ulx", "application/x-glulx"},
+#line 128 "auto/extension_to_mime_type.gperf"
+      {"clkp", "application/vnd.crick.clicker.palette"},
+      {"",nullptr}, {"",nullptr},
+#line 60 "auto/extension_to_mime_type.gperf"
+      {"au", "audio/basic"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 952 "auto/extension_to_mime_type.gperf"
+      {"xfdf", "application/vnd.adobe.xfdf"},
+#line 396 "auto/extension_to_mime_type.gperf"
+      {"ktx", "image/ktx"},
+#line 485 "auto/extension_to_mime_type.gperf"
+      {"mpe", "video/mpeg"},
+      {"",nullptr}, {"",nullptr},
+#line 367 "auto/extension_to_mime_type.gperf"
+      {"jar", "application/java-archive"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 528 "auto/extension_to_mime_type.gperf"
+      {"nml", "application/vnd.enliven"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 744 "auto/extension_to_mime_type.gperf"
+      {"smi", "application/smil+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 449 "auto/extension_to_mime_type.gperf"
+      {"metalink", "application/metalink+xml"},
+#line 584 "auto/extension_to_mime_type.gperf"
+      {"p7r", "application/x-pkcs7-certreqresp"},
+#line 413 "auto/extension_to_mime_type.gperf"
+      {"lrf", "application/octet-stream"},
+#line 212 "auto/extension_to_mime_type.gperf"
+      {"ecelp9600", "audio/vnd.nuera.ecelp9600"},
+#line 542 "auto/extension_to_mime_type.gperf"
+      {"oda", "application/oda"},
+#line 717 "auto/extension_to_mime_type.gperf"
+      {"sfd-hdstx", "application/vnd.hydrostatix.sof-data"},
+      {"",nullptr}, {"",nullptr},
+#line 139 "auto/extension_to_mime_type.gperf"
+      {"com", "application/x-msdownload"},
+#line 211 "auto/extension_to_mime_type.gperf"
+      {"ecelp7470", "audio/vnd.nuera.ecelp7470"},
+#line 938 "auto/extension_to_mime_type.gperf"
+      {"x3dz", "model/x3d+xml"},
+#line 819 "auto/extension_to_mime_type.gperf"
+      {"tr", "text/troff"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 621 "auto/extension_to_mime_type.gperf"
+      {"pot", "application/vnd.ms-powerpoint"},
+      {"",nullptr}, {"",nullptr},
+#line 622 "auto/extension_to_mime_type.gperf"
+      {"potm", "application/vnd.ms-powerpoint.template.macroenabled.12"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 417 "auto/extension_to_mime_type.gperf"
+      {"lwp", "application/vnd.lotus-wordpro"},
+#line 362 "auto/extension_to_mime_type.gperf"
+      {"itp", "application/vnd.shana.informed.formtemplate"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 623 "auto/extension_to_mime_type.gperf"
+      {"potx", "application/vnd.openxmlformats-officedocument.presentationml.template"},
+#line 974 "auto/extension_to_mime_type.gperf"
+      {"xop", "application/xop+xml"},
+#line 473 "auto/extension_to_mime_type.gperf"
+      {"mods", "application/mods+xml"},
+      {"",nullptr},
+#line 190 "auto/extension_to_mime_type.gperf"
+      {"dot", "application/msword"},
+#line 764 "auto/extension_to_mime_type.gperf"
+      {"sse", "application/vnd.kodak-descriptor"},
+      {"",nullptr},
+#line 191 "auto/extension_to_mime_type.gperf"
+      {"dotm", "application/vnd.ms-word.template.macroenabled.12"},
+#line 217 "auto/extension_to_mime_type.gperf"
+      {"elc", "application/octet-stream"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 884 "auto/extension_to_mime_type.gperf"
+      {"vox", "application/x-authorware-bin"},
+      {"",nullptr},
+#line 345 "auto/extension_to_mime_type.gperf"
+      {"igl", "application/vnd.igloader"},
+#line 1004 "auto/extension_to_mime_type.gperf"
+      {"zir", "application/vnd.zul"},
+      {"",nullptr},
+#line 574 "auto/extension_to_mime_type.gperf"
+      {"ots", "application/vnd.oasis.opendocument.spreadsheet-template"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 188 "auto/extension_to_mime_type.gperf"
+      {"docm", "application/vnd.ms-word.document.macroenabled.12"},
+#line 210 "auto/extension_to_mime_type.gperf"
+      {"ecelp4800", "audio/vnd.nuera.ecelp4800"},
+#line 954 "auto/extension_to_mime_type.gperf"
+      {"xht", "application/xhtml+xml"},
+#line 575 "auto/extension_to_mime_type.gperf"
+      {"ott", "application/vnd.oasis.opendocument.text-template"},
+#line 120 "auto/extension_to_mime_type.gperf"
+      {"chm", "application/vnd.ms-htmlhelp"},
+#line 192 "auto/extension_to_mime_type.gperf"
+      {"dotx", "application/vnd.openxmlformats-officedocument.wordprocessingml.template"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 389 "auto/extension_to_mime_type.gperf"
+      {"knp", "application/vnd.kinar"},
+      {"",nullptr},
+#line 474 "auto/extension_to_mime_type.gperf"
+      {"mov", "video/quicktime"},
+#line 187 "auto/extension_to_mime_type.gperf"
+      {"doc", "application/msword"},
+#line 31 "auto/extension_to_mime_type.gperf"
+      {"acu", "application/vnd.acucobol"},
+      {"",nullptr},
+#line 812 "auto/extension_to_mime_type.gperf"
+      {"thmx", "application/vnd.ms-officetheme"},
+#line 156 "auto/extension_to_mime_type.gperf"
+      {"cww", "application/prs.cww"},
+#line 254 "auto/extension_to_mime_type.gperf"
+      {"fh7", "image/x-freehand"},
+      {"",nullptr},
+#line 726 "auto/extension_to_mime_type.gperf"
+      {"shf", "application/shf+xml"},
+#line 189 "auto/extension_to_mime_type.gperf"
+      {"docx", "application/vnd.openxmlformats-officedocument.wordprocessingml.document"},
+      {"",nullptr},
+#line 231 "auto/extension_to_mime_type.gperf"
+      {"etx", "text/x-setext"},
+      {"",nullptr}, {"",nullptr},
+#line 253 "auto/extension_to_mime_type.gperf"
+      {"fh5", "image/x-freehand"},
+      {"",nullptr},
+#line 47 "auto/extension_to_mime_type.gperf"
+      {"application", "application/x-ms-application"},
+#line 82 "auto/extension_to_mime_type.gperf"
+      {"bz", "application/x-bzip"},
+      {"",nullptr}, {"",nullptr},
+#line 569 "auto/extension_to_mime_type.gperf"
+      {"otf", "font/otf"},
+#line 123 "auto/extension_to_mime_type.gperf"
+      {"cii", "application/vnd.anser-web-certificate-issue-initiation"},
+#line 568 "auto/extension_to_mime_type.gperf"
+      {"otc", "application/vnd.oasis.opendocument.chart-template"},
+#line 369 "auto/extension_to_mime_type.gperf"
+      {"jisp", "application/vnd.jisp"},
+      {"",nullptr}, {"",nullptr},
+#line 573 "auto/extension_to_mime_type.gperf"
+      {"otp", "application/vnd.oasis.opendocument.presentation-template"},
+#line 501 "auto/extension_to_mime_type.gperf"
+      {"mseed", "application/vnd.fdsn.mseed"},
+#line 255 "auto/extension_to_mime_type.gperf"
+      {"fhc", "image/x-freehand"},
+      {"",nullptr},
+#line 138 "auto/extension_to_mime_type.gperf"
+      {"cod", "application/vnd.rim.cod"},
+      {"",nullptr}, {"",nullptr},
+#line 642 "auto/extension_to_mime_type.gperf"
+      {"ptid", "application/vnd.pvi.ptid1"},
+      {"",nullptr},
+#line 608 "auto/extension_to_mime_type.gperf"
+      {"php", "text/x-php"},
+      {"",nullptr}, {"",nullptr},
+#line 307 "auto/extension_to_mime_type.gperf"
+      {"gtw", "model/vnd.gtw"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 935 "auto/extension_to_mime_type.gperf"
+      {"x3dbz", "model/x3d+binary"},
+#line 145 "auto/extension_to_mime_type.gperf"
+      {"crl", "application/pkix-crl"},
+      {"",nullptr},
+#line 958 "auto/extension_to_mime_type.gperf"
+      {"xla", "application/vnd.ms-excel"},
+#line 45 "auto/extension_to_mime_type.gperf"
+      {"apk", "application/vnd.android.package-archive"},
+#line 429 "auto/extension_to_mime_type.gperf"
+      {"m4u", "video/vnd.mpegurl"},
+      {"",nullptr},
+#line 334 "auto/extension_to_mime_type.gperf"
+      {"hvs", "application/vnd.yamaha.hv-script"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 125 "auto/extension_to_mime_type.gperf"
+      {"cla", "application/vnd.claymore"},
+#line 456 "auto/extension_to_mime_type.gperf"
+      {"midi", "audio/midi"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 439 "auto/extension_to_mime_type.gperf"
+      {"mbk", "application/vnd.mobius.mbk"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 130 "auto/extension_to_mime_type.gperf"
+      {"clkw", "application/vnd.crick.clicker.wordbank"},
+#line 91 "auto/extension_to_mime_type.gperf"
+      {"c4u", "application/vnd.clonk.c4group"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 228 "auto/extension_to_mime_type.gperf"
+      {"esa", "application/vnd.osgi.subsystem"},
+#line 815 "auto/extension_to_mime_type.gperf"
+      {"tmo", "application/vnd.tmobile-livetv"},
+#line 435 "auto/extension_to_mime_type.gperf"
+      {"man", "text/troff"},
+#line 885 "auto/extension_to_mime_type.gperf"
+      {"vrml", "model/vrml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 920 "auto/extension_to_mime_type.gperf"
+      {"woff", "font/woff"},
+      {"",nullptr}, {"",nullptr},
+#line 230 "auto/extension_to_mime_type.gperf"
+      {"et3", "application/vnd.eszigno3+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 490 "auto/extension_to_mime_type.gperf"
+      {"mpkg", "application/vnd.apple.installer+xml"},
+      {"",nullptr},
+#line 747 "auto/extension_to_mime_type.gperf"
+      {"smzip", "application/vnd.stepmania.package"},
+#line 92 "auto/extension_to_mime_type.gperf"
+      {"cab", "application/vnd.ms-cab-compressed"},
+#line 845 "auto/extension_to_mime_type.gperf"
+      {"uu", "text/x-uuencode"},
+      {"",nullptr}, {"",nullptr},
+#line 333 "auto/extension_to_mime_type.gperf"
+      {"hvp", "application/vnd.yamaha.hv-voice"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 676 "auto/extension_to_mime_type.gperf"
+      {"rmi", "audio/midi"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 204 "auto/extension_to_mime_type.gperf"
+      {"dvi", "application/x-dvi"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 547 "auto/extension_to_mime_type.gperf"
+      {"odg", "application/vnd.oasis.opendocument.graphics"},
+#line 164 "auto/extension_to_mime_type.gperf"
+      {"dbk", "application/docbook+xml"},
+      {"",nullptr}, {"",nullptr},
+#line 252 "auto/extension_to_mime_type.gperf"
+      {"fh4", "image/x-freehand"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 903 "auto/extension_to_mime_type.gperf"
+      {"weba", "audio/webm"},
+      {"",nullptr}, {"",nullptr},
+#line 30 "auto/extension_to_mime_type.gperf"
+      {"ace", "application/x-ace-compressed"},
+#line 322 "auto/extension_to_mime_type.gperf"
+      {"heifs", "image/heif-sequence"},
+#line 320 "auto/extension_to_mime_type.gperf"
+      {"heics", "image/heic-sequence"},
+#line 169 "auto/extension_to_mime_type.gperf"
+      {"deb", "application/x-debian-package"},
+#line 955 "auto/extension_to_mime_type.gperf"
+      {"xhtml", "application/xhtml+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 927 "auto/extension_to_mime_type.gperf"
+      {"wrl", "model/vrml"},
+#line 921 "auto/extension_to_mime_type.gperf"
+      {"woff2", "font/woff2"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 953 "auto/extension_to_mime_type.gperf"
+      {"xfdl", "application/vnd.xfdl"},
+      {"",nullptr}, {"",nullptr},
+#line 665 "auto/extension_to_mime_type.gperf"
+      {"rdz", "application/vnd.data-vision.rdz"},
+      {"",nullptr},
+#line 321 "auto/extension_to_mime_type.gperf"
+      {"heif", "image/heif"},
+#line 557 "auto/extension_to_mime_type.gperf"
+      {"omdoc", "application/omdoc+xml"},
+#line 319 "auto/extension_to_mime_type.gperf"
+      {"heic", "image/heic"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 49 "auto/extension_to_mime_type.gperf"
+      {"arc", "application/x-freearc"},
+#line 332 "auto/extension_to_mime_type.gperf"
+      {"hvd", "application/vnd.yamaha.hv-dic"},
+#line 934 "auto/extension_to_mime_type.gperf"
+      {"x3db", "model/x3d+binary"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 682 "auto/extension_to_mime_type.gperf"
+      {"roff", "text/troff"},
+      {"",nullptr},
+#line 385 "auto/extension_to_mime_type.gperf"
+      {"kia", "application/vnd.kidspiration"},
+#line 35 "auto/extension_to_mime_type.gperf"
+      {"afm", "application/x-font-type1"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 457 "auto/extension_to_mime_type.gperf"
+      {"mie", "application/x-mie"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 956 "auto/extension_to_mime_type.gperf"
+      {"xhvml", "application/xv+xml"},
+#line 459 "auto/extension_to_mime_type.gperf"
+      {"mime", "message/rfc822"},
+      {"",nullptr},
+#line 376 "auto/extension_to_mime_type.gperf"
+      {"jpgm", "video/jpm"},
+#line 612 "auto/extension_to_mime_type.gperf"
+      {"pkipath", "application/pkix-pkipath"},
+#line 285 "auto/extension_to_mime_type.gperf"
+      {"geo", "application/vnd.dynageo"},
+      {"",nullptr},
+#line 444 "auto/extension_to_mime_type.gperf"
+      {"mdb", "application/x-msaccess"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 516 "auto/extension_to_mime_type.gperf"
+      {"mxs", "application/vnd.triscape.mxs"},
+#line 792 "auto/extension_to_mime_type.gperf"
+      {"sxm", "application/vnd.sun.xml.math"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 121 "auto/extension_to_mime_type.gperf"
+      {"chrt", "application/vnd.kde.kchart"},
+#line 220 "auto/extension_to_mime_type.gperf"
+      {"emma", "application/emma+xml"},
+#line 603 "auto/extension_to_mime_type.gperf"
+      {"pfr", "application/font-tdpfr"},
+      {"",nullptr}, {"",nullptr},
+#line 831 "auto/extension_to_mime_type.gperf"
+      {"txt", "text/plain"},
+      {"",nullptr},
+#line 486 "auto/extension_to_mime_type.gperf"
+      {"mpeg", "video/mpeg"},
+      {"",nullptr},
+#line 598 "auto/extension_to_mime_type.gperf"
+      {"pdb", "application/vnd.palm"},
+#line 535 "auto/extension_to_mime_type.gperf"
+      {"ntf", "application/vnd.nitf"},
+      {"",nullptr}, {"",nullptr},
+#line 36 "auto/extension_to_mime_type.gperf"
+      {"afp", "application/vnd.ibm.modcap"},
+#line 412 "auto/extension_to_mime_type.gperf"
+      {"lostxml", "application/lost+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 315 "auto/extension_to_mime_type.gperf"
+      {"h265", "video/h265"},
+#line 157 "auto/extension_to_mime_type.gperf"
+      {"cxt", "application/x-director"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 186 "auto/extension_to_mime_type.gperf"
+      {"dna", "application/vnd.dna"},
+      {"",nullptr}, {"",nullptr},
+#line 1000 "auto/extension_to_mime_type.gperf"
+      {"z7", "application/x-zmachine"},
+      {"",nullptr}, {"",nullptr},
+#line 513 "auto/extension_to_mime_type.gperf"
+      {"mxf", "application/mxf"},
+#line 788 "auto/extension_to_mime_type.gperf"
+      {"sxc", "application/vnd.sun.xml.calc"},
+      {"",nullptr},
+#line 830 "auto/extension_to_mime_type.gperf"
+      {"txf", "application/vnd.mobius.txf"},
+#line 158 "auto/extension_to_mime_type.gperf"
+      {"cxx", "text/x-c"},
+#line 358 "auto/extension_to_mime_type.gperf"
+      {"ipk", "application/vnd.shana.informed.package"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 779 "auto/extension_to_mime_type.gperf"
+      {"sv4cpio", "application/x-sv4cpio"},
+      {"",nullptr},
+#line 62 "auto/extension_to_mime_type.gperf"
+      {"aw", "application/applixware"},
+      {"",nullptr}, {"",nullptr},
+#line 530 "auto/extension_to_mime_type.gperf"
+      {"nns", "application/vnd.noblenet-sealer"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 720 "auto/extension_to_mime_type.gperf"
+      {"sgi", "image/sgi"},
+      {"",nullptr},
+#line 998 "auto/extension_to_mime_type.gperf"
+      {"z5", "application/x-zmachine"},
+#line 274 "auto/extension_to_mime_type.gperf"
+      {"fxp", "application/vnd.adobe.fxp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 395 "auto/extension_to_mime_type.gperf"
+      {"ktr", "application/vnd.kahootz"},
+#line 492 "auto/extension_to_mime_type.gperf"
+      {"mpn", "application/vnd.mophun.application"},
+#line 173 "auto/extension_to_mime_type.gperf"
+      {"dfac", "application/vnd.dreamfactory"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 377 "auto/extension_to_mime_type.gperf"
+      {"jpgv", "video/jpeg"},
+      {"",nullptr},
+#line 846 "auto/extension_to_mime_type.gperf"
+      {"uva", "audio/vnd.dece.audio"},
+      {"",nullptr}, {"",nullptr},
+#line 654 "auto/extension_to_mime_type.gperf"
+      {"qwt", "application/vnd.quark.quarkxpress"},
+      {"",nullptr}, {"",nullptr},
+#line 312 "auto/extension_to_mime_type.gperf"
+      {"h261", "video/h261"},
+      {"",nullptr},
+#line 207 "auto/extension_to_mime_type.gperf"
+      {"dxf", "image/vnd.dxf"},
+      {"",nullptr},
+#line 355 "auto/extension_to_mime_type.gperf"
+      {"install", "application/x-install-instructions"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 208 "auto/extension_to_mime_type.gperf"
+      {"dxp", "application/vnd.spotfire.dxp"},
+      {"",nullptr}, {"",nullptr},
+#line 44 "auto/extension_to_mime_type.gperf"
+      {"ami", "application/vnd.amiga.ami"},
+#line 313 "auto/extension_to_mime_type.gperf"
+      {"h263", "video/h263"},
+#line 548 "auto/extension_to_mime_type.gperf"
+      {"odi", "application/vnd.oasis.opendocument.image"},
+#line 789 "auto/extension_to_mime_type.gperf"
+      {"sxd", "application/vnd.sun.xml.draw"},
+      {"",nullptr}, {"",nullptr},
+#line 901 "auto/extension_to_mime_type.gperf"
+      {"wdb", "application/vnd.ms-works"},
+#line 829 "auto/extension_to_mime_type.gperf"
+      {"txd", "application/vnd.genomatix.tuxedo"},
+#line 399 "auto/extension_to_mime_type.gperf"
+      {"kwt", "application/vnd.kde.kword"},
+      {"",nullptr}, {"",nullptr},
+#line 359 "auto/extension_to_mime_type.gperf"
+      {"irm", "application/vnd.ibm.rights-management"},
+#line 302 "auto/extension_to_mime_type.gperf"
+      {"grv", "application/vnd.groove-injector"},
+#line 339 "auto/extension_to_mime_type.gperf"
+      {"ico", "image/x-icon"},
+#line 248 "auto/extension_to_mime_type.gperf"
+      {"fe_launch", "application/vnd.denovo.fcselayout-link"},
+      {"",nullptr}, {"",nullptr},
+#line 730 "auto/extension_to_mime_type.gperf"
+      {"silo", "model/mesh"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 266 "auto/extension_to_mime_type.gperf"
+      {"for", "text/x-fortran"},
+      {"",nullptr},
+#line 337 "auto/extension_to_mime_type.gperf"
+      {"ice", "x-conference/x-cooltalk"},
+#line 567 "auto/extension_to_mime_type.gperf"
+      {"osfpvg", "application/vnd.yamaha.openscoreformat.osfpvg+xml"},
+      {"",nullptr}, {"",nullptr},
+#line 368 "auto/extension_to_mime_type.gperf"
+      {"java", "text/x-java-source"},
+      {"",nullptr},
+#line 650 "auto/extension_to_mime_type.gperf"
+      {"qfx", "application/vnd.intu.qfx"},
+#line 858 "auto/extension_to_mime_type.gperf"
+      {"uvva", "audio/vnd.dece.audio"},
+#line 314 "auto/extension_to_mime_type.gperf"
+      {"h264", "video/h264"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 919 "auto/extension_to_mime_type.gperf"
+      {"wmz", "application/x-ms-wmz"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 53 "auto/extension_to_mime_type.gperf"
+      {"aso", "application/vnd.accpac.simply.aso"},
+      {"",nullptr}, {"",nullptr},
+#line 232 "auto/extension_to_mime_type.gperf"
+      {"eva", "application/x-eva"},
+      {"",nullptr},
+#line 883 "auto/extension_to_mime_type.gperf"
+      {"vor", "application/vnd.stardivision.writer"},
+      {"",nullptr},
+#line 344 "auto/extension_to_mime_type.gperf"
+      {"iges", "model/iges"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 360 "auto/extension_to_mime_type.gperf"
+      {"irp", "application/vnd.irepository.package+xml"},
+#line 86 "auto/extension_to_mime_type.gperf"
+      {"c11amz", "application/vnd.cluetrust.cartomobile-config-pkg"},
+#line 502 "auto/extension_to_mime_type.gperf"
+      {"mseq", "application/vnd.mseq"},
+#line 529 "auto/extension_to_mime_type.gperf"
+      {"nnd", "application/vnd.noblenet-directory"},
+      {"",nullptr},
+#line 343 "auto/extension_to_mime_type.gperf"
+      {"ifm", "application/vnd.shana.informed.formdata"},
+#line 638 "auto/extension_to_mime_type.gperf"
+      {"psb", "application/vnd.3gpp.pic-bw-small"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 470 "auto/extension_to_mime_type.gperf"
+      {"mng", "video/x-mng"},
+      {"",nullptr},
+#line 56 "auto/extension_to_mime_type.gperf"
+      {"atom", "application/atom+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 653 "auto/extension_to_mime_type.gperf"
+      {"qwd", "application/vnd.quark.quarkxpress"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 303 "auto/extension_to_mime_type.gperf"
+      {"grxml", "application/srgs+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 119 "auto/extension_to_mime_type.gperf"
+      {"chat", "application/x-chat"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 618 "auto/extension_to_mime_type.gperf"
+      {"png", "image/png"},
+#line 370 "auto/extension_to_mime_type.gperf"
+      {"jlt", "application/vnd.hp-jlyt"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 326 "auto/extension_to_mime_type.gperf"
+      {"hpid", "application/vnd.hp-hpid"},
+#line 398 "auto/extension_to_mime_type.gperf"
+      {"kwd", "application/vnd.kde.kword"},
+      {"",nullptr},
+#line 525 "auto/extension_to_mime_type.gperf"
+      {"ngdat", "application/vnd.nokia.n-gage.data"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 772 "auto/extension_to_mime_type.gperf"
+      {"stk", "application/hyperstudio"},
+#line 406 "auto/extension_to_mime_type.gperf"
+      {"link66", "application/vnd.route66.link66+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 793 "auto/extension_to_mime_type.gperf"
+      {"sxw", "application/vnd.sun.xml.writer"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 258 "auto/extension_to_mime_type.gperf"
+      {"fli", "video/x-fli"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 403 "auto/extension_to_mime_type.gperf"
+      {"lbe", "application/vnd.llamagraphics.life-balance.exchange+xml"},
+      {"",nullptr}, {"",nullptr},
+#line 61 "auto/extension_to_mime_type.gperf"
+      {"avi", "video/x-msvideo"},
+      {"",nullptr},
+#line 58 "auto/extension_to_mime_type.gperf"
+      {"atomsvc", "application/atomsvc+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 101 "auto/extension_to_mime_type.gperf"
+      {"cbz", "application/x-cbr"},
+      {"",nullptr}, {"",nullptr},
+#line 324 "auto/extension_to_mime_type.gperf"
+      {"hlp", "application/winhlp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 23 "auto/extension_to_mime_type.gperf"
+      {"aab", "application/x-authorware-bin"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 330 "auto/extension_to_mime_type.gperf"
+      {"htm", "text/html"},
+      {"",nullptr}, {"",nullptr},
+#line 771 "auto/extension_to_mime_type.gperf"
+      {"sti", "application/vnd.sun.xml.impress.template"},
+#line 849 "auto/extension_to_mime_type.gperf"
+      {"uvg", "image/vnd.dece.graphic"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 842 "auto/extension_to_mime_type.gperf"
+      {"urls", "text/uri-list"},
+      {"",nullptr},
+#line 531 "auto/extension_to_mime_type.gperf"
+      {"nnw", "application/vnd.noblenet-web"},
+      {"",nullptr},
+#line 834 "auto/extension_to_mime_type.gperf"
+      {"ufd", "application/vnd.ufdl"},
+#line 141 "auto/extension_to_mime_type.gperf"
+      {"cpio", "application/x-cpio"},
+      {"",nullptr}, {"",nullptr},
+#line 514 "auto/extension_to_mime_type.gperf"
+      {"mxl", "application/vnd.recordare.musicxml"},
+      {"",nullptr},
+#line 289 "auto/extension_to_mime_type.gperf"
+      {"ghf", "application/vnd.groove-help"},
+      {"",nullptr},
+#line 272 "auto/extension_to_mime_type.gperf"
+      {"fti", "application/vnd.anser-web-funds-transfer-initiation"},
+      {"",nullptr},
+#line 515 "auto/extension_to_mime_type.gperf"
+      {"mxml", "application/xv+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 325 "auto/extension_to_mime_type.gperf"
+      {"hpgl", "application/vnd.hp-hpgl"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 820 "auto/extension_to_mime_type.gperf"
+      {"tra", "application/vnd.trueapp"},
+      {"",nullptr}, {"",nullptr},
+#line 80 "auto/extension_to_mime_type.gperf"
+      {"bpk", "application/octet-stream"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 785 "auto/extension_to_mime_type.gperf"
+      {"swa", "application/x-director"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 861 "auto/extension_to_mime_type.gperf"
+      {"uvvg", "image/vnd.dece.graphic"},
+      {"",nullptr}, {"",nullptr},
+#line 361 "auto/extension_to_mime_type.gperf"
+      {"iso", "application/x-iso9660-image"},
+      {"",nullptr},
+#line 67 "auto/extension_to_mime_type.gperf"
+      {"bcpio", "application/x-bcpio"},
+      {"",nullptr}, {"",nullptr},
+#line 553 "auto/extension_to_mime_type.gperf"
+      {"oga", "audio/ogg"},
+#line 275 "auto/extension_to_mime_type.gperf"
+      {"fxpl", "application/vnd.adobe.fxp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 892 "auto/extension_to_mime_type.gperf"
+      {"vxml", "application/voicexml+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 750 "auto/extension_to_mime_type.gperf"
+      {"so", "application/octet-stream"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 195 "auto/extension_to_mime_type.gperf"
+      {"dra", "audio/vnd.dra"},
+      {"",nullptr},
+#line 891 "auto/extension_to_mime_type.gperf"
+      {"vtu", "model/vnd.vtu"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 973 "auto/extension_to_mime_type.gperf"
+      {"xo", "application/vnd.olpc-sugar"},
+      {"",nullptr},
+#line 454 "auto/extension_to_mime_type.gperf"
+      {"mgz", "application/vnd.proteus.magazine"},
+      {"",nullptr}, {"",nullptr},
+#line 1002 "auto/extension_to_mime_type.gperf"
+      {"zaz", "application/vnd.zzazz.deck+xml"},
+      {"",nullptr},
+#line 223 "auto/extension_to_mime_type.gperf"
+      {"eot", "application/vnd.ms-fontobject"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 600 "auto/extension_to_mime_type.gperf"
+      {"pfa", "application/x-font-type1"},
+      {"",nullptr}, {"",nullptr},
+#line 201 "auto/extension_to_mime_type.gperf"
+      {"dtshd", "audio/vnd.dts.hd"},
+#line 335 "auto/extension_to_mime_type.gperf"
+      {"i2g", "application/vnd.intergeo"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 305 "auto/extension_to_mime_type.gperf"
+      {"gtar", "application/x-gtar"},
+#line 259 "auto/extension_to_mime_type.gperf"
+      {"flo", "application/vnd.micrografx.flo"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 511 "auto/extension_to_mime_type.gperf"
+      {"mvb", "application/x-msmediaview"},
+      {"",nullptr},
+#line 776 "auto/extension_to_mime_type.gperf"
+      {"sub", "image/vnd.dvb.subtitle"},
+      {"",nullptr},
+#line 299 "auto/extension_to_mime_type.gperf"
+      {"gram", "application/srgs"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 300 "auto/extension_to_mime_type.gperf"
+      {"gramps", "application/x-gramps-xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 644 "auto/extension_to_mime_type.gperf"
+      {"pvb", "application/vnd.3gpp.pic-bw-var"},
+      {"",nullptr}, {"",nullptr},
+#line 643 "auto/extension_to_mime_type.gperf"
+      {"pub", "application/x-mspublisher"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 410 "auto/extension_to_mime_type.gperf"
+      {"lnk", "application/x-ms-shortcut"},
+#line 209 "auto/extension_to_mime_type.gperf"
+      {"dxr", "application/x-director"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 311 "auto/extension_to_mime_type.gperf"
+      {"h", "text/x-c"},
+#line 851 "auto/extension_to_mime_type.gperf"
+      {"uvi", "image/vnd.dece.graphic"},
+      {"",nullptr}, {"",nullptr},
+#line 203 "auto/extension_to_mime_type.gperf"
+      {"dvb", "video/vnd.dvb.file"},
+      {"",nullptr},
+#line 375 "auto/extension_to_mime_type.gperf"
+      {"jpg", "image/jpeg"},
+#line 520 "auto/extension_to_mime_type.gperf"
+      {"nb", "application/mathematica"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 364 "auto/extension_to_mime_type.gperf"
+      {"ivu", "application/vnd.immervision-ivu"},
+      {"",nullptr}, {"",nullptr},
+#line 354 "auto/extension_to_mime_type.gperf"
+      {"inkml", "application/inkml+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 447 "auto/extension_to_mime_type.gperf"
+      {"mesh", "model/mesh"},
+      {"",nullptr},
+#line 310 "auto/extension_to_mime_type.gperf"
+      {"gxt", "application/vnd.geonext"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 856 "auto/extension_to_mime_type.gperf"
+      {"uvu", "video/vnd.uvvu.mp4"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 679 "auto/extension_to_mime_type.gperf"
+      {"rmvb", "application/vnd.rn-realmedia-vbr"},
+#line 863 "auto/extension_to_mime_type.gperf"
+      {"uvvi", "image/vnd.dece.graphic"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 294 "auto/extension_to_mime_type.gperf"
+      {"gnumeric", "application/x-gnumeric"},
+#line 309 "auto/extension_to_mime_type.gperf"
+      {"gxf", "application/gxf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 371 "auto/extension_to_mime_type.gperf"
+      {"jnlp", "application/x-java-jnlp-file"},
+      {"",nullptr},
+#line 658 "auto/extension_to_mime_type.gperf"
+      {"qxt", "application/vnd.quark.quarkxpress"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 835 "auto/extension_to_mime_type.gperf"
+      {"ufdl", "application/vnd.ufdl"},
+#line 554 "auto/extension_to_mime_type.gperf"
+      {"ogg", "audio/ogg"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 868 "auto/extension_to_mime_type.gperf"
+      {"uvvu", "video/vnd.uvvu.mp4"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 725 "auto/extension_to_mime_type.gperf"
+      {"shar", "application/x-shar"},
+      {"",nullptr},
+#line 75 "auto/extension_to_mime_type.gperf"
+      {"bmi", "application/vnd.bmi"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 387 "auto/extension_to_mime_type.gperf"
+      {"kmz", "application/vnd.google-earth.kmz"},
+#line 331 "auto/extension_to_mime_type.gperf"
+      {"html", "text/html"},
+      {"",nullptr},
+#line 57 "auto/extension_to_mime_type.gperf"
+      {"atomcat", "application/atomcat+xml"},
+#line 206 "auto/extension_to_mime_type.gperf"
+      {"dwg", "image/vnd.dwg"},
+      {"",nullptr},
+#line 78 "auto/extension_to_mime_type.gperf"
+      {"box", "application/vnd.previewsystems.box"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 560 "auto/extension_to_mime_type.gperf"
+      {"onetoc", "application/onenote"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 559 "auto/extension_to_mime_type.gperf"
+      {"onetmp", "application/onenote"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 81 "auto/extension_to_mime_type.gperf"
+      {"btif", "image/prs.btif"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 839 "auto/extension_to_mime_type.gperf"
+      {"uoml", "application/vnd.uoml+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 649 "auto/extension_to_mime_type.gperf"
+      {"qbo", "application/vnd.intu.qbo"},
+#line 268 "auto/extension_to_mime_type.gperf"
+      {"frame", "application/vnd.framemaker"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 140 "auto/extension_to_mime_type.gperf"
+      {"conf", "text/plain"},
+#line 352 "auto/extension_to_mime_type.gperf"
+      {"in", "text/plain"},
+      {"",nullptr}, {"",nullptr},
+#line 656 "auto/extension_to_mime_type.gperf"
+      {"qxd", "application/vnd.quark.quarkxpress"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 606 "auto/extension_to_mime_type.gperf"
+      {"pgn", "application/x-chess-pgn"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 561 "auto/extension_to_mime_type.gperf"
+      {"onetoc2", "application/onenote"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 543 "auto/extension_to_mime_type.gperf"
+      {"odb", "application/vnd.oasis.opendocument.database"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 577 "auto/extension_to_mime_type.gperf"
+      {"oxt", "application/vnd.openofficeorg.extension"},
+#line 222 "auto/extension_to_mime_type.gperf"
+      {"eol", "audio/vnd.digital-winds"},
+#line 784 "auto/extension_to_mime_type.gperf"
+      {"svgz", "image/svg+xml"},
+      {"",nullptr}, {"",nullptr},
+#line 236 "auto/extension_to_mime_type.gperf"
+      {"ext", "application/vnd.novadigm.ext"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 681 "auto/extension_to_mime_type.gperf"
+      {"roa", "application/rpki-roa"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 576 "auto/extension_to_mime_type.gperf"
+      {"oxps", "application/oxps"},
+      {"",nullptr},
+#line 418 "auto/extension_to_mime_type.gperf"
+      {"lzh", "application/x-lzh-compressed"},
+      {"",nullptr},
+#line 221 "auto/extension_to_mime_type.gperf"
+      {"emz", "application/x-msmetafile"},
+      {"",nullptr}, {"",nullptr},
+#line 405 "auto/extension_to_mime_type.gperf"
+      {"lha", "application/x-lzh-compressed"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 787 "auto/extension_to_mime_type.gperf"
+      {"swi", "application/vnd.aristanetworks.swi"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 841 "auto/extension_to_mime_type.gperf"
+      {"uris", "text/uri-list"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 761 "auto/extension_to_mime_type.gperf"
+      {"sru", "application/sru+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 504 "auto/extension_to_mime_type.gperf"
+      {"msh", "model/mesh"},
+#line 127 "auto/extension_to_mime_type.gperf"
+      {"clkk", "application/vnd.crick.clicker.keyboard"},
+      {"",nullptr}, {"",nullptr},
+#line 808 "auto/extension_to_mime_type.gperf"
+      {"tfi", "application/thraud+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 570 "auto/extension_to_mime_type.gperf"
+      {"otg", "application/vnd.oasis.opendocument.graphics-template"},
+      {"",nullptr}, {"",nullptr},
+#line 148 "auto/extension_to_mime_type.gperf"
+      {"csh", "application/x-csh"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 873 "auto/extension_to_mime_type.gperf"
+      {"uvz", "application/vnd.dece.zip"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 71 "auto/extension_to_mime_type.gperf"
+      {"bh2", "application/vnd.fujitsu.oasysprs"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 964 "auto/extension_to_mime_type.gperf"
+      {"xlsb", "application/vnd.ms-excel.sheet.binary.macroenabled.12"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 613 "auto/extension_to_mime_type.gperf"
+      {"plb", "application/vnd.3gpp.pic-bw-large"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 536 "auto/extension_to_mime_type.gperf"
+      {"nzb", "application/x-nzb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 926 "auto/extension_to_mime_type.gperf"
+      {"wri", "application/x-mswrite"},
+      {"",nullptr},
+#line 668 "auto/extension_to_mime_type.gperf"
+      {"rgb", "image/x-rgb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 657 "auto/extension_to_mime_type.gperf"
+      {"qxl", "application/vnd.quark.quarkxpress"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 373 "auto/extension_to_mime_type.gperf"
+      {"jpe", "image/jpeg"},
+      {"",nullptr},
+#line 871 "auto/extension_to_mime_type.gperf"
+      {"uvvz", "application/vnd.dece.zip"},
+#line 411 "auto/extension_to_mime_type.gperf"
+      {"log", "text/plain"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 215 "auto/extension_to_mime_type.gperf"
+      {"efif", "application/vnd.picsel"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 353 "auto/extension_to_mime_type.gperf"
+      {"ink", "application/inkml+xml"},
+#line 198 "auto/extension_to_mime_type.gperf"
+      {"dtb", "application/x-dtbook+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 635 "auto/extension_to_mime_type.gperf"
+      {"pre", "application/vnd.lotus-freelance"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 724 "auto/extension_to_mime_type.gperf"
+      {"sh", "application/x-sh"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 251 "auto/extension_to_mime_type.gperf"
+      {"fh", "image/x-freehand"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 572 "auto/extension_to_mime_type.gperf"
+      {"oti", "application/vnd.oasis.opendocument.image-template"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 930 "auto/extension_to_mime_type.gperf"
+      {"wtb", "application/vnd.webturbo"},
+#line 107 "auto/extension_to_mime_type.gperf"
+      {"cdkey", "application/vnd.mediastation.cdkey"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 790 "auto/extension_to_mime_type.gperf"
+      {"sxg", "application/vnd.sun.xml.writer.global"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 816 "auto/extension_to_mime_type.gperf"
+      {"torrent", "application/x-bittorrent"},
+      {"",nullptr}, {"",nullptr},
+#line 620 "auto/extension_to_mime_type.gperf"
+      {"portpkg", "application/vnd.macports.portpkg"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 475 "auto/extension_to_mime_type.gperf"
+      {"movie", "video/x-sgi-movie"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 496 "auto/extension_to_mime_type.gperf"
+      {"mqy", "application/vnd.mobius.mqy"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 581 "auto/extension_to_mime_type.gperf"
+      {"p7b", "application/x-pkcs7-certificates"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 715 "auto/extension_to_mime_type.gperf"
+      {"setpay", "application/set-payment-initiation"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 1005 "auto/extension_to_mime_type.gperf"
+      {"zirz", "application/vnd.zul"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 356 "auto/extension_to_mime_type.gperf"
+      {"iota", "application/vnd.astraea-software.iota"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 388 "auto/extension_to_mime_type.gperf"
+      {"kne", "application/vnd.kinar"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 287 "auto/extension_to_mime_type.gperf"
+      {"ggb", "application/vnd.geogebra.file"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 317 "auto/extension_to_mime_type.gperf"
+      {"hbci", "application/vnd.hbci"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 527 "auto/extension_to_mime_type.gperf"
+      {"nlu", "application/vnd.neurolanguage.nlu"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 115 "auto/extension_to_mime_type.gperf"
+      {"cdy", "application/vnd.cinderella"},
+      {"",nullptr}, {"",nullptr},
+#line 374 "auto/extension_to_mime_type.gperf"
+      {"jpeg", "image/jpeg"},
+      {"",nullptr},
+#line 397 "auto/extension_to_mime_type.gperf"
+      {"ktz", "application/vnd.kahootz"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 791 "auto/extension_to_mime_type.gperf"
+      {"sxi", "application/vnd.sun.xml.impress"},
+#line 295 "auto/extension_to_mime_type.gperf"
+      {"gph", "application/vnd.flographit"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 565 "auto/extension_to_mime_type.gperf"
+      {"org", "application/vnd.lotus-organizer"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 844 "auto/extension_to_mime_type.gperf"
+      {"utz", "application/vnd.uiq.theme"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 495 "auto/extension_to_mime_type.gperf"
+      {"mpy", "application/vnd.ibm.minipay"},
+#line 517 "auto/extension_to_mime_type.gperf"
+      {"mxu", "video/vnd.mpegurl"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 72 "auto/extension_to_mime_type.gperf"
+      {"bin", "application/octet-stream"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 518 "auto/extension_to_mime_type.gperf"
+      {"n-gage", "application/vnd.nokia.n-gage.symbian.install"},
+#line 929 "auto/extension_to_mime_type.gperf"
+      {"wspolicy", "application/wspolicy+xml"},
+      {"",nullptr}, {"",nullptr},
+#line 171 "auto/extension_to_mime_type.gperf"
+      {"deploy", "application/octet-stream"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 833 "auto/extension_to_mime_type.gperf"
+      {"udeb", "application/x-debian-package"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 37 "auto/extension_to_mime_type.gperf"
+      {"ahead", "application/vnd.ahead.space"},
+      {"",nullptr}, {"",nullptr},
+#line 507 "auto/extension_to_mime_type.gperf"
+      {"msty", "application/vnd.muvee.style"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 645 "auto/extension_to_mime_type.gperf"
+      {"pwn", "application/vnd.3m.post-it-notes"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 840 "auto/extension_to_mime_type.gperf"
+      {"uri", "text/uri-list"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 601 "auto/extension_to_mime_type.gperf"
+      {"pfb", "application/x-font-type1"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 225 "auto/extension_to_mime_type.gperf"
+      {"epub", "application/epub+zip"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 301 "auto/extension_to_mime_type.gperf"
+      {"gre", "application/vnd.geometry-explorer"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 838 "auto/extension_to_mime_type.gperf"
+      {"unityweb", "application/vnd.unity"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 381 "auto/extension_to_mime_type.gperf"
+      {"jsonml", "application/jsonml+json"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 837 "auto/extension_to_mime_type.gperf"
+      {"umj", "application/vnd.umajin"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 992 "auto/extension_to_mime_type.gperf"
+      {"yang", "application/yang"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 384 "auto/extension_to_mime_type.gperf"
+      {"kfo", "application/vnd.kde.kformula"},
+      {"",nullptr},
+#line 882 "auto/extension_to_mime_type.gperf"
+      {"vob", "video/x-ms-vob"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 383 "auto/extension_to_mime_type.gperf"
+      {"karbon", "application/vnd.kde.karbon"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 558 "auto/extension_to_mime_type.gperf"
+      {"onepkg", "application/onenote"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 850 "auto/extension_to_mime_type.gperf"
+      {"uvh", "video/vnd.dece.hd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 73 "auto/extension_to_mime_type.gperf"
+      {"blb", "application/x-blorb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 74 "auto/extension_to_mime_type.gperf"
+      {"blorb", "application/x-blorb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 862 "auto/extension_to_mime_type.gperf"
+      {"uvvh", "video/vnd.dece.hd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 372 "auto/extension_to_mime_type.gperf"
+      {"joda", "application/vnd.joost.joda-archive"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 541 "auto/extension_to_mime_type.gperf"
+      {"obj", "application/x-tgif"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 472 "auto/extension_to_mime_type.gperf"
+      {"mobi", "application/x-mobipocket-ebook"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 524 "auto/extension_to_mime_type.gperf"
+      {"nfo", "text/x-nfo"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 993 "auto/extension_to_mime_type.gperf"
+      {"yin", "application/yin+xml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 235 "auto/extension_to_mime_type.gperf"
+      {"exi", "application/exi"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 342 "auto/extension_to_mime_type.gperf"
+      {"ifb", "text/calendar"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 263 "auto/extension_to_mime_type.gperf"
+      {"fly", "text/vnd.fly"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 380 "auto/extension_to_mime_type.gperf"
+      {"json", "application/json"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 390 "auto/extension_to_mime_type.gperf"
+      {"kon", "application/vnd.kde.kontour"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 234 "auto/extension_to_mime_type.gperf"
+      {"exe", "application/x-msdownload"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 79 "auto/extension_to_mime_type.gperf"
+      {"boz", "application/x-bzip2"},
+      {"",nullptr}, {"",nullptr},
+#line 471 "auto/extension_to_mime_type.gperf"
+      {"mny", "application/x-msmoney"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 323 "auto/extension_to_mime_type.gperf"
+      {"hh", "text/x-c"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 571 "auto/extension_to_mime_type.gperf"
+      {"oth", "application/vnd.oasis.opendocument.text-web"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 329 "auto/extension_to_mime_type.gperf"
+      {"htke", "application/vnd.kenameaapp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 233 "auto/extension_to_mime_type.gperf"
+      {"evy", "application/x-envoy"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 655 "auto/extension_to_mime_type.gperf"
+      {"qxb", "application/vnd.quark.quarkxpress"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 77 "auto/extension_to_mime_type.gperf"
+      {"book", "application/vnd.framemaker"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 147 "auto/extension_to_mime_type.gperf"
+      {"cryptonote", "application/vnd.rig.cryptonote"}
+    };
+
+  if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH)
+    {
+      unsigned int key = extension_hash (str, len);
+
+      if (key <= MAX_HASH_VALUE)
+        {
+          register const char *s = wordlist[key].extension;
+
+          if ((((unsigned char)*str ^ (unsigned char)*s) & ~32) == 0 && !gperf_case_strcmp (str, s))
+            return &wordlist[key];
+        }
+    }
+  return 0;
+}
+#line 1007 "auto/extension_to_mime_type.gperf"
+
+const char *extension_to_mime_type(const char *extension, size_t extension_len) {
+  const auto &result = search_extension(extension, extension_len);
+  if (result == nullptr) {
+    return nullptr;
+  }
+
+  return result->mime_type;
+}
diff --git a/submodules/ton/tonlib-src/tdutils/generate/auto/extension_to_mime_type.gperf b/submodules/ton/tonlib-src/tdutils/generate/auto/extension_to_mime_type.gperf
new file mode 100644
index 0000000000..5f9b5581c8
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/generate/auto/extension_to_mime_type.gperf
@@ -0,0 +1,1015 @@
+%struct-type
+%ignore-case
+%language=ANSI-C
+%readonly-tables
+%includes
+%enum
+%define slot-name extension
+%define initializer-suffix ,nullptr
+%define slot-name extension
+%define hash-function-name extension_hash
+%define lookup-function-name search_extension
+struct extension_and_mime_type {
+  const char *extension;
+  const char *mime_type;
+}
+%%
+"123", "application/vnd.lotus-1-2-3"
+"3dml", "text/vnd.in3d.3dml"
+"3ds", "image/x-3ds"
+"3g2", "video/3gpp2"
+"3gp", "video/3gpp"
+"7z", "application/x-7z-compressed"
+"aab", "application/x-authorware-bin"
+"aac", "audio/x-aac"
+"aam", "application/x-authorware-map"
+"aas", "application/x-authorware-seg"
+"abw", "application/x-abiword"
+"ac", "application/pkix-attr-cert"
+"acc", "application/vnd.americandynamics.acc"
+"ace", "application/x-ace-compressed"
+"acu", "application/vnd.acucobol"
+"acutc", "application/vnd.acucorp"
+"adp", "audio/adpcm"
+"aep", "application/vnd.audiograph"
+"afm", "application/x-font-type1"
+"afp", "application/vnd.ibm.modcap"
+"ahead", "application/vnd.ahead.space"
+"ai", "application/postscript"
+"aif", "audio/x-aiff"
+"aifc", "audio/x-aiff"
+"aiff", "audio/x-aiff"
+"air", "application/vnd.adobe.air-application-installer-package+zip"
+"ait", "application/vnd.dvb.ait"
+"ami", "application/vnd.amiga.ami"
+"apk", "application/vnd.android.package-archive"
+"appcache", "text/cache-manifest"
+"application", "application/x-ms-application"
+"apr", "application/vnd.lotus-approach"
+"arc", "application/x-freearc"
+"asc", "application/pgp-signature"
+"asf", "video/x-ms-asf"
+"asm", "text/x-asm"
+"aso", "application/vnd.accpac.simply.aso"
+"asx", "video/x-ms-asf"
+"atc", "application/vnd.acucorp"
+"atom", "application/atom+xml"
+"atomcat", "application/atomcat+xml"
+"atomsvc", "application/atomsvc+xml"
+"atx", "application/vnd.antix.game-component"
+"au", "audio/basic"
+"avi", "video/x-msvideo"
+"aw", "application/applixware"
+"azf", "application/vnd.airzip.filesecure.azf"
+"azs", "application/vnd.airzip.filesecure.azs"
+"azw", "application/vnd.amazon.ebook"
+"bat", "application/x-msdownload"
+"bcpio", "application/x-bcpio"
+"bdf", "application/x-font-bdf"
+"bdm", "application/vnd.syncml.dm+wbxml"
+"bed", "application/vnd.realvnc.bed"
+"bh2", "application/vnd.fujitsu.oasysprs"
+"bin", "application/octet-stream"
+"blb", "application/x-blorb"
+"blorb", "application/x-blorb"
+"bmi", "application/vnd.bmi"
+"bmp", "image/bmp"
+"book", "application/vnd.framemaker"
+"box", "application/vnd.previewsystems.box"
+"boz", "application/x-bzip2"
+"bpk", "application/octet-stream"
+"btif", "image/prs.btif"
+"bz", "application/x-bzip"
+"bz2", "application/x-bzip2"
+"c", "text/x-c"
+"c11amc", "application/vnd.cluetrust.cartomobile-config"
+"c11amz", "application/vnd.cluetrust.cartomobile-config-pkg"
+"c4d", "application/vnd.clonk.c4group"
+"c4f", "application/vnd.clonk.c4group"
+"c4g", "application/vnd.clonk.c4group"
+"c4p", "application/vnd.clonk.c4group"
+"c4u", "application/vnd.clonk.c4group"
+"cab", "application/vnd.ms-cab-compressed"
+"caf", "audio/x-caf"
+"cap", "application/vnd.tcpdump.pcap"
+"car", "application/vnd.curl.car"
+"cat", "application/vnd.ms-pki.seccat"
+"cb7", "application/x-cbr"
+"cba", "application/x-cbr"
+"cbr", "application/x-cbr"
+"cbt", "application/x-cbr"
+"cbz", "application/x-cbr"
+"cc", "text/x-c"
+"cct", "application/x-director"
+"ccxml", "application/ccxml+xml"
+"cdbcmsg", "application/vnd.contact.cmsg"
+"cdf", "application/x-netcdf"
+"cdkey", "application/vnd.mediastation.cdkey"
+"cdmia", "application/cdmi-capability"
+"cdmic", "application/cdmi-container"
+"cdmid", "application/cdmi-domain"
+"cdmio", "application/cdmi-object"
+"cdmiq", "application/cdmi-queue"
+"cdx", "chemical/x-cdx"
+"cdxml", "application/vnd.chemdraw+xml"
+"cdy", "application/vnd.cinderella"
+"cer", "application/pkix-cert"
+"cfs", "application/x-cfs-compressed"
+"cgm", "image/cgm"
+"chat", "application/x-chat"
+"chm", "application/vnd.ms-htmlhelp"
+"chrt", "application/vnd.kde.kchart"
+"cif", "chemical/x-cif"
+"cii", "application/vnd.anser-web-certificate-issue-initiation"
+"cil", "application/vnd.ms-artgalry"
+"cla", "application/vnd.claymore"
+"class", "application/java-vm"
+"clkk", "application/vnd.crick.clicker.keyboard"
+"clkp", "application/vnd.crick.clicker.palette"
+"clkt", "application/vnd.crick.clicker.template"
+"clkw", "application/vnd.crick.clicker.wordbank"
+"clkx", "application/vnd.crick.clicker"
+"clp", "application/x-msclip"
+"cmc", "application/vnd.cosmocaller"
+"cmdf", "chemical/x-cmdf"
+"cml", "chemical/x-cml"
+"cmp", "application/vnd.yellowriver-custom-menu"
+"cmx", "image/x-cmx"
+"cod", "application/vnd.rim.cod"
+"com", "application/x-msdownload"
+"conf", "text/plain"
+"cpio", "application/x-cpio"
+"cpp", "text/x-c"
+"cpt", "application/mac-compactpro"
+"crd", "application/x-mscardfile"
+"crl", "application/pkix-crl"
+"crt", "application/x-x509-ca-cert"
+"cryptonote", "application/vnd.rig.cryptonote"
+"csh", "application/x-csh"
+"csml", "chemical/x-csml"
+"csp", "application/vnd.commonspace"
+"css", "text/css"
+"cst", "application/x-director"
+"csv", "text/csv"
+"cu", "application/cu-seeme"
+"curl", "text/vnd.curl"
+"cww", "application/prs.cww"
+"cxt", "application/x-director"
+"cxx", "text/x-c"
+"dae", "model/vnd.collada+xml"
+"daf", "application/vnd.mobius.daf"
+"dart", "application/vnd.dart"
+"dataless", "application/vnd.fdsn.seed"
+"davmount", "application/davmount+xml"
+"dbk", "application/docbook+xml"
+"dcr", "application/x-director"
+"dcurl", "text/vnd.curl.dcurl"
+"dd2", "application/vnd.oma.dd2+xml"
+"ddd", "application/vnd.fujixerox.ddd"
+"deb", "application/x-debian-package"
+"def", "text/plain"
+"deploy", "application/octet-stream"
+"der", "application/x-x509-ca-cert"
+"dfac", "application/vnd.dreamfactory"
+"dgc", "application/x-dgc-compressed"
+"dic", "text/x-c"
+"dir", "application/x-director"
+"dis", "application/vnd.mobius.dis"
+"dist", "application/octet-stream"
+"distz", "application/octet-stream"
+"djv", "image/vnd.djvu"
+"djvu", "image/vnd.djvu"
+"dll", "application/x-msdownload"
+"dmg", "application/x-apple-diskimage"
+"dmp", "application/vnd.tcpdump.pcap"
+"dms", "application/octet-stream"
+"dna", "application/vnd.dna"
+"doc", "application/msword"
+"docm", "application/vnd.ms-word.document.macroenabled.12"
+"docx", "application/vnd.openxmlformats-officedocument.wordprocessingml.document"
+"dot", "application/msword"
+"dotm", "application/vnd.ms-word.template.macroenabled.12"
+"dotx", "application/vnd.openxmlformats-officedocument.wordprocessingml.template"
+"dp", "application/vnd.osgi.dp"
+"dpg", "application/vnd.dpgraph"
+"dra", "audio/vnd.dra"
+"dsc", "text/prs.lines.tag"
+"dssc", "application/dssc+der"
+"dtb", "application/x-dtbook+xml"
+"dtd", "application/xml-dtd"
+"dts", "audio/vnd.dts"
+"dtshd", "audio/vnd.dts.hd"
+"dump", "application/octet-stream"
+"dvb", "video/vnd.dvb.file"
+"dvi", "application/x-dvi"
+"dwf", "model/vnd.dwf"
+"dwg", "image/vnd.dwg"
+"dxf", "image/vnd.dxf"
+"dxp", "application/vnd.spotfire.dxp"
+"dxr", "application/x-director"
+"ecelp4800", "audio/vnd.nuera.ecelp4800"
+"ecelp7470", "audio/vnd.nuera.ecelp7470"
+"ecelp9600", "audio/vnd.nuera.ecelp9600"
+"edm", "application/vnd.novadigm.edm"
+"edx", "application/vnd.novadigm.edx"
+"efif", "application/vnd.picsel"
+"ei6", "application/vnd.pg.osasli"
+"elc", "application/octet-stream"
+"emf", "application/x-msmetafile"
+"eml", "message/rfc822"
+"emma", "application/emma+xml"
+"emz", "application/x-msmetafile"
+"eol", "audio/vnd.digital-winds"
+"eot", "application/vnd.ms-fontobject"
+"eps", "application/postscript"
+"epub", "application/epub+zip"
+"es", "application/ecmascript"
+"es3", "application/vnd.eszigno3+xml"
+"esa", "application/vnd.osgi.subsystem"
+"esf", "application/vnd.epson.esf"
+"et3", "application/vnd.eszigno3+xml"
+"etx", "text/x-setext"
+"eva", "application/x-eva"
+"evy", "application/x-envoy"
+"exe", "application/x-msdownload"
+"exi", "application/exi"
+"ext", "application/vnd.novadigm.ext"
+"ez", "application/andrew-inset"
+"ez2", "application/vnd.ezpix-album"
+"ez3", "application/vnd.ezpix-package"
+"f", "text/x-fortran"
+"f4v", "video/x-f4v"
+"f77", "text/x-fortran"
+"f90", "text/x-fortran"
+"fbs", "image/vnd.fastbidsheet"
+"fcdt", "application/vnd.adobe.formscentral.fcdt"
+"fcs", "application/vnd.isac.fcs"
+"fdf", "application/vnd.fdf"
+"fe_launch", "application/vnd.denovo.fcselayout-link"
+"fg5", "application/vnd.fujitsu.oasysgp"
+"fgd", "application/x-director"
+"fh", "image/x-freehand"
+"fh4", "image/x-freehand"
+"fh5", "image/x-freehand"
+"fh7", "image/x-freehand"
+"fhc", "image/x-freehand"
+"fig", "application/x-xfig"
+"flac", "audio/x-flac"
+"fli", "video/x-fli"
+"flo", "application/vnd.micrografx.flo"
+"flv", "video/x-flv"
+"flw", "application/vnd.kde.kivio"
+"flx", "text/vnd.fmi.flexstor"
+"fly", "text/vnd.fly"
+"fm", "application/vnd.framemaker"
+"fnc", "application/vnd.frogans.fnc"
+"for", "text/x-fortran"
+"fpx", "image/vnd.fpx"
+"frame", "application/vnd.framemaker"
+"fsc", "application/vnd.fsc.weblaunch"
+"fst", "image/vnd.fst"
+"ftc", "application/vnd.fluxtime.clip"
+"fti", "application/vnd.anser-web-funds-transfer-initiation"
+"fvt", "video/vnd.fvt"
+"fxp", "application/vnd.adobe.fxp"
+"fxpl", "application/vnd.adobe.fxp"
+"fzs", "application/vnd.fuzzysheet"
+"g2w", "application/vnd.geoplan"
+"g3", "image/g3fax"
+"g3w", "application/vnd.geospace"
+"gac", "application/vnd.groove-account"
+"gam", "application/x-tads"
+"gbr", "application/rpki-ghostbusters"
+"gca", "application/x-gca-compressed"
+"gdl", "model/vnd.gdl"
+"geo", "application/vnd.dynageo"
+"gex", "application/vnd.geometry-explorer"
+"ggb", "application/vnd.geogebra.file"
+"ggt", "application/vnd.geogebra.tool"
+"ghf", "application/vnd.groove-help"
+"gif", "image/gif"
+"gim", "application/vnd.groove-identity-message"
+"gml", "application/gml+xml"
+"gmx", "application/vnd.gmx"
+"gnumeric", "application/x-gnumeric"
+"gph", "application/vnd.flographit"
+"gpx", "application/gpx+xml"
+"gqf", "application/vnd.grafeq"
+"gqs", "application/vnd.grafeq"
+"gram", "application/srgs"
+"gramps", "application/x-gramps-xml"
+"gre", "application/vnd.geometry-explorer"
+"grv", "application/vnd.groove-injector"
+"grxml", "application/srgs+xml"
+"gsf", "application/x-font-ghostscript"
+"gtar", "application/x-gtar"
+"gtm", "application/vnd.groove-tool-message"
+"gtw", "model/vnd.gtw"
+"gv", "text/vnd.graphviz"
+"gxf", "application/gxf"
+"gxt", "application/vnd.geonext"
+"h", "text/x-c"
+"h261", "video/h261"
+"h263", "video/h263"
+"h264", "video/h264"
+"h265", "video/h265"
+"hal", "application/vnd.hal+xml"
+"hbci", "application/vnd.hbci"
+"hdf", "application/x-hdf"
+"heic", "image/heic"
+"heics", "image/heic-sequence"
+"heif", "image/heif"
+"heifs", "image/heif-sequence"
+"hh", "text/x-c"
+"hlp", "application/winhlp"
+"hpgl", "application/vnd.hp-hpgl"
+"hpid", "application/vnd.hp-hpid"
+"hps", "application/vnd.hp-hps"
+"hqx", "application/mac-binhex40"
+"htke", "application/vnd.kenameaapp"
+"htm", "text/html"
+"html", "text/html"
+"hvd", "application/vnd.yamaha.hv-dic"
+"hvp", "application/vnd.yamaha.hv-voice"
+"hvs", "application/vnd.yamaha.hv-script"
+"i2g", "application/vnd.intergeo"
+"icc", "application/vnd.iccprofile"
+"ice", "x-conference/x-cooltalk"
+"icm", "application/vnd.iccprofile"
+"ico", "image/x-icon"
+"ics", "text/calendar"
+"ief", "image/ief"
+"ifb", "text/calendar"
+"ifm", "application/vnd.shana.informed.formdata"
+"iges", "model/iges"
+"igl", "application/vnd.igloader"
+"igm", "application/vnd.insors.igm"
+"igs", "model/iges"
+"igx", "application/vnd.micrografx.igx"
+"iif", "application/vnd.shana.informed.interchange"
+"imp", "application/vnd.accpac.simply.imp"
+"ims", "application/vnd.ms-ims"
+"in", "text/plain"
+"ink", "application/inkml+xml"
+"inkml", "application/inkml+xml"
+"install", "application/x-install-instructions"
+"iota", "application/vnd.astraea-software.iota"
+"ipfix", "application/ipfix"
+"ipk", "application/vnd.shana.informed.package"
+"irm", "application/vnd.ibm.rights-management"
+"irp", "application/vnd.irepository.package+xml"
+"iso", "application/x-iso9660-image"
+"itp", "application/vnd.shana.informed.formtemplate"
+"ivp", "application/vnd.immervision-ivp"
+"ivu", "application/vnd.immervision-ivu"
+"jad", "text/vnd.sun.j2me.app-descriptor"
+"jam", "application/vnd.jam"
+"jar", "application/java-archive"
+"java", "text/x-java-source"
+"jisp", "application/vnd.jisp"
+"jlt", "application/vnd.hp-jlyt"
+"jnlp", "application/x-java-jnlp-file"
+"joda", "application/vnd.joost.joda-archive"
+"jpe", "image/jpeg"
+"jpeg", "image/jpeg"
+"jpg", "image/jpeg"
+"jpgm", "video/jpm"
+"jpgv", "video/jpeg"
+"jpm", "video/jpm"
+"js", "application/javascript"
+"json", "application/json"
+"jsonml", "application/jsonml+json"
+"kar", "audio/midi"
+"karbon", "application/vnd.kde.karbon"
+"kfo", "application/vnd.kde.kformula"
+"kia", "application/vnd.kidspiration"
+"kml", "application/vnd.google-earth.kml+xml"
+"kmz", "application/vnd.google-earth.kmz"
+"kne", "application/vnd.kinar"
+"knp", "application/vnd.kinar"
+"kon", "application/vnd.kde.kontour"
+"kpr", "application/vnd.kde.kpresenter"
+"kpt", "application/vnd.kde.kpresenter"
+"kpxx", "application/vnd.ds-keypoint"
+"ksp", "application/vnd.kde.kspread"
+"ktr", "application/vnd.kahootz"
+"ktx", "image/ktx"
+"ktz", "application/vnd.kahootz"
+"kwd", "application/vnd.kde.kword"
+"kwt", "application/vnd.kde.kword"
+"lasxml", "application/vnd.las.las+xml"
+"latex", "application/x-latex"
+"lbd", "application/vnd.llamagraphics.life-balance.desktop"
+"lbe", "application/vnd.llamagraphics.life-balance.exchange+xml"
+"les", "application/vnd.hhe.lesson-player"
+"lha", "application/x-lzh-compressed"
+"link66", "application/vnd.route66.link66+xml"
+"list", "text/plain"
+"list3820", "application/vnd.ibm.modcap"
+"listafp", "application/vnd.ibm.modcap"
+"lnk", "application/x-ms-shortcut"
+"log", "text/plain"
+"lostxml", "application/lost+xml"
+"lrf", "application/octet-stream"
+"lrm", "application/vnd.ms-lrm"
+"ltf", "application/vnd.frogans.ltf"
+"lvp", "audio/vnd.lucent.voice"
+"lwp", "application/vnd.lotus-wordpro"
+"lzh", "application/x-lzh-compressed"
+"m13", "application/x-msmediaview"
+"m14", "application/x-msmediaview"
+"m1v", "video/mpeg"
+"m21", "application/mp21"
+"m2a", "audio/mpeg"
+"m2v", "video/mpeg"
+"m3a", "audio/mpeg"
+"m3u", "audio/x-mpegurl"
+"m3u8", "application/vnd.apple.mpegurl"
+"m4a", "audio/mp4"
+"m4u", "video/vnd.mpegurl"
+"m4v", "video/x-m4v"
+"ma", "application/mathematica"
+"mads", "application/mads+xml"
+"mag", "application/vnd.ecowin.chart"
+"maker", "application/vnd.framemaker"
+"man", "text/troff"
+"mar", "application/octet-stream"
+"mathml", "application/mathml+xml"
+"mb", "application/mathematica"
+"mbk", "application/vnd.mobius.mbk"
+"mbox", "application/mbox"
+"mc1", "application/vnd.medcalcdata"
+"mcd", "application/vnd.mcd"
+"mcurl", "text/vnd.curl.mcurl"
+"mdb", "application/x-msaccess"
+"mdi", "image/vnd.ms-modi"
+"me", "text/troff"
+"mesh", "model/mesh"
+"meta4", "application/metalink4+xml"
+"metalink", "application/metalink+xml"
+"mets", "application/mets+xml"
+"mfm", "application/vnd.mfmp"
+"mft", "application/rpki-manifest"
+"mgp", "application/vnd.osgeo.mapguide.package"
+"mgz", "application/vnd.proteus.magazine"
+"mid", "audio/midi"
+"midi", "audio/midi"
+"mie", "application/x-mie"
+"mif", "application/vnd.mif"
+"mime", "message/rfc822"
+"mj2", "video/mj2"
+"mjp2", "video/mj2"
+"mk3d", "video/x-matroska"
+"mka", "audio/x-matroska"
+"mks", "video/x-matroska"
+"mkv", "video/x-matroska"
+"mlp", "application/vnd.dolby.mlp"
+"mmd", "application/vnd.chipnuts.karaoke-mmd"
+"mmf", "application/vnd.smaf"
+"mmr", "image/vnd.fujixerox.edmics-mmr"
+"mng", "video/x-mng"
+"mny", "application/x-msmoney"
+"mobi", "application/x-mobipocket-ebook"
+"mods", "application/mods+xml"
+"mov", "video/quicktime"
+"movie", "video/x-sgi-movie"
+"mp2", "audio/mpeg"
+"mp21", "application/mp21"
+"mp2a", "audio/mpeg"
+"mp3", "audio/mpeg"
+"mp4", "video/mp4"
+"mp4a", "audio/mp4"
+"mp4s", "application/mp4"
+"mp4v", "video/mp4"
+"mpc", "application/vnd.mophun.certificate"
+"mpe", "video/mpeg"
+"mpeg", "video/mpeg"
+"mpg", "video/mpeg"
+"mpg4", "video/mp4"
+"mpga", "audio/mpeg"
+"mpkg", "application/vnd.apple.installer+xml"
+"mpm", "application/vnd.blueice.multipass"
+"mpn", "application/vnd.mophun.application"
+"mpp", "application/vnd.ms-project"
+"mpt", "application/vnd.ms-project"
+"mpy", "application/vnd.ibm.minipay"
+"mqy", "application/vnd.mobius.mqy"
+"mrc", "application/marc"
+"mrcx", "application/marcxml+xml"
+"ms", "text/troff"
+"mscml", "application/mediaservercontrol+xml"
+"mseed", "application/vnd.fdsn.mseed"
+"mseq", "application/vnd.mseq"
+"msf", "application/vnd.epson.msf"
+"msh", "model/mesh"
+"msi", "application/x-msdownload"
+"msl", "application/vnd.mobius.msl"
+"msty", "application/vnd.muvee.style"
+"mts", "model/vnd.mts"
+"mus", "application/vnd.musician"
+"musicxml", "application/vnd.recordare.musicxml+xml"
+"mvb", "application/x-msmediaview"
+"mwf", "application/vnd.mfer"
+"mxf", "application/mxf"
+"mxl", "application/vnd.recordare.musicxml"
+"mxml", "application/xv+xml"
+"mxs", "application/vnd.triscape.mxs"
+"mxu", "video/vnd.mpegurl"
+"n-gage", "application/vnd.nokia.n-gage.symbian.install"
+"n3", "text/n3"
+"nb", "application/mathematica"
+"nbp", "application/vnd.wolfram.player"
+"nc", "application/x-netcdf"
+"ncx", "application/x-dtbncx+xml"
+"nfo", "text/x-nfo"
+"ngdat", "application/vnd.nokia.n-gage.data"
+"nitf", "application/vnd.nitf"
+"nlu", "application/vnd.neurolanguage.nlu"
+"nml", "application/vnd.enliven"
+"nnd", "application/vnd.noblenet-directory"
+"nns", "application/vnd.noblenet-sealer"
+"nnw", "application/vnd.noblenet-web"
+"npx", "image/vnd.net-fpx"
+"nsc", "application/x-conference"
+"nsf", "application/vnd.lotus-notes"
+"ntf", "application/vnd.nitf"
+"nzb", "application/x-nzb"
+"oa2", "application/vnd.fujitsu.oasys2"
+"oa3", "application/vnd.fujitsu.oasys3"
+"oas", "application/vnd.fujitsu.oasys"
+"obd", "application/x-msbinder"
+"obj", "application/x-tgif"
+"oda", "application/oda"
+"odb", "application/vnd.oasis.opendocument.database"
+"odc", "application/vnd.oasis.opendocument.chart"
+"odf", "application/vnd.oasis.opendocument.formula"
+"odft", "application/vnd.oasis.opendocument.formula-template"
+"odg", "application/vnd.oasis.opendocument.graphics"
+"odi", "application/vnd.oasis.opendocument.image"
+"odm", "application/vnd.oasis.opendocument.text-master"
+"odp", "application/vnd.oasis.opendocument.presentation"
+"ods", "application/vnd.oasis.opendocument.spreadsheet"
+"odt", "application/vnd.oasis.opendocument.text"
+"oga", "audio/ogg"
+"ogg", "audio/ogg"
+"ogv", "video/ogg"
+"ogx", "application/ogg"
+"omdoc", "application/omdoc+xml"
+"onepkg", "application/onenote"
+"onetmp", "application/onenote"
+"onetoc", "application/onenote"
+"onetoc2", "application/onenote"
+"opf", "application/oebps-package+xml"
+"opml", "text/x-opml"
+"oprc", "application/vnd.palm"
+"org", "application/vnd.lotus-organizer"
+"osf", "application/vnd.yamaha.openscoreformat"
+"osfpvg", "application/vnd.yamaha.openscoreformat.osfpvg+xml"
+"otc", "application/vnd.oasis.opendocument.chart-template"
+"otf", "font/otf"
+"otg", "application/vnd.oasis.opendocument.graphics-template"
+"oth", "application/vnd.oasis.opendocument.text-web"
+"oti", "application/vnd.oasis.opendocument.image-template"
+"otp", "application/vnd.oasis.opendocument.presentation-template"
+"ots", "application/vnd.oasis.opendocument.spreadsheet-template"
+"ott", "application/vnd.oasis.opendocument.text-template"
+"oxps", "application/oxps"
+"oxt", "application/vnd.openofficeorg.extension"
+"p", "text/x-pascal"
+"p10", "application/pkcs10"
+"p12", "application/x-pkcs12"
+"p7b", "application/x-pkcs7-certificates"
+"p7c", "application/pkcs7-mime"
+"p7m", "application/pkcs7-mime"
+"p7r", "application/x-pkcs7-certreqresp"
+"p7s", "application/pkcs7-signature"
+"p8", "application/pkcs8"
+"pas", "text/x-pascal"
+"paw", "application/vnd.pawaafile"
+"pbd", "application/vnd.powerbuilder6"
+"pbm", "image/x-portable-bitmap"
+"pcap", "application/vnd.tcpdump.pcap"
+"pcf", "application/x-font-pcf"
+"pcl", "application/vnd.hp-pcl"
+"pclxl", "application/vnd.hp-pclxl"
+"pct", "image/x-pict"
+"pcurl", "application/vnd.curl.pcurl"
+"pcx", "image/x-pcx"
+"pdb", "application/vnd.palm"
+"pdf", "application/pdf"
+"pfa", "application/x-font-type1"
+"pfb", "application/x-font-type1"
+"pfm", "application/x-font-type1"
+"pfr", "application/font-tdpfr"
+"pfx", "application/x-pkcs12"
+"pgm", "image/x-portable-graymap"
+"pgn", "application/x-chess-pgn"
+"pgp", "application/pgp-encrypted"
+"php", "text/x-php"
+"pic", "image/x-pict"
+"pkg", "application/octet-stream"
+"pki", "application/pkixcmp"
+"pkipath", "application/pkix-pkipath"
+"plb", "application/vnd.3gpp.pic-bw-large"
+"plc", "application/vnd.mobius.plc"
+"plf", "application/vnd.pocketlearn"
+"pls", "application/pls+xml"
+"pml", "application/vnd.ctc-posml"
+"png", "image/png"
+"pnm", "image/x-portable-anymap"
+"portpkg", "application/vnd.macports.portpkg"
+"pot", "application/vnd.ms-powerpoint"
+"potm", "application/vnd.ms-powerpoint.template.macroenabled.12"
+"potx", "application/vnd.openxmlformats-officedocument.presentationml.template"
+"ppam", "application/vnd.ms-powerpoint.addin.macroenabled.12"
+"ppd", "application/vnd.cups-ppd"
+"ppm", "image/x-portable-pixmap"
+"pps", "application/vnd.ms-powerpoint"
+"ppsm", "application/vnd.ms-powerpoint.slideshow.macroenabled.12"
+"ppsx", "application/vnd.openxmlformats-officedocument.presentationml.slideshow"
+"ppt", "application/vnd.ms-powerpoint"
+"pptm", "application/vnd.ms-powerpoint.presentation.macroenabled.12"
+"pptx", "application/vnd.openxmlformats-officedocument.presentationml.presentation"
+"pqa", "application/vnd.palm"
+"prc", "application/x-mobipocket-ebook"
+"pre", "application/vnd.lotus-freelance"
+"prf", "application/pics-rules"
+"ps", "application/postscript"
+"psb", "application/vnd.3gpp.pic-bw-small"
+"psd", "image/vnd.adobe.photoshop"
+"psf", "application/x-font-linux-psf"
+"pskcxml", "application/pskc+xml"
+"ptid", "application/vnd.pvi.ptid1"
+"pub", "application/x-mspublisher"
+"pvb", "application/vnd.3gpp.pic-bw-var"
+"pwn", "application/vnd.3m.post-it-notes"
+"pya", "audio/vnd.ms-playready.media.pya"
+"pyv", "video/vnd.ms-playready.media.pyv"
+"qam", "application/vnd.epson.quickanime"
+"qbo", "application/vnd.intu.qbo"
+"qfx", "application/vnd.intu.qfx"
+"qps", "application/vnd.publishare-delta-tree"
+"qt", "video/quicktime"
+"qwd", "application/vnd.quark.quarkxpress"
+"qwt", "application/vnd.quark.quarkxpress"
+"qxb", "application/vnd.quark.quarkxpress"
+"qxd", "application/vnd.quark.quarkxpress"
+"qxl", "application/vnd.quark.quarkxpress"
+"qxt", "application/vnd.quark.quarkxpress"
+"ra", "audio/x-pn-realaudio"
+"ram", "audio/x-pn-realaudio"
+"rar", "application/x-rar-compressed"
+"ras", "image/x-cmu-raster"
+"rcprofile", "application/vnd.ipunplugged.rcprofile"
+"rdf", "application/rdf+xml"
+"rdz", "application/vnd.data-vision.rdz"
+"rep", "application/vnd.businessobjects"
+"res", "application/x-dtbresource+xml"
+"rgb", "image/x-rgb"
+"rif", "application/reginfo+xml"
+"rip", "audio/vnd.rip"
+"ris", "application/x-research-info-systems"
+"rl", "application/resource-lists+xml"
+"rlc", "image/vnd.fujixerox.edmics-rlc"
+"rld", "application/resource-lists-diff+xml"
+"rm", "application/vnd.rn-realmedia"
+"rmi", "audio/midi"
+"rmp", "audio/x-pn-realaudio-plugin"
+"rms", "application/vnd.jcp.javame.midlet-rms"
+"rmvb", "application/vnd.rn-realmedia-vbr"
+"rnc", "application/relax-ng-compact-syntax"
+"roa", "application/rpki-roa"
+"roff", "text/troff"
+"rp9", "application/vnd.cloanto.rp9"
+"rpss", "application/vnd.nokia.radio-presets"
+"rpst", "application/vnd.nokia.radio-preset"
+"rq", "application/sparql-query"
+"rs", "application/rls-services+xml"
+"rsd", "application/rsd+xml"
+"rss", "application/rss+xml"
+"rtf", "application/rtf"
+"rtx", "text/richtext"
+"s", "text/x-asm"
+"s3m", "audio/s3m"
+"saf", "application/vnd.yamaha.smaf-audio"
+"sbml", "application/sbml+xml"
+"sc", "application/vnd.ibm.secure-container"
+"scd", "application/x-msschedule"
+"scm", "application/vnd.lotus-screencam"
+"scq", "application/scvp-cv-request"
+"scs", "application/scvp-cv-response"
+"scurl", "text/vnd.curl.scurl"
+"sda", "application/vnd.stardivision.draw"
+"sdc", "application/vnd.stardivision.calc"
+"sdd", "application/vnd.stardivision.impress"
+"sdkd", "application/vnd.solent.sdkm+xml"
+"sdkm", "application/vnd.solent.sdkm+xml"
+"sdp", "application/sdp"
+"sdw", "application/vnd.stardivision.writer"
+"see", "application/vnd.seemail"
+"seed", "application/vnd.fdsn.seed"
+"sema", "application/vnd.sema"
+"semd", "application/vnd.semd"
+"semf", "application/vnd.semf"
+"ser", "application/java-serialized-object"
+"setpay", "application/set-payment-initiation"
+"setreg", "application/set-registration-initiation"
+"sfd-hdstx", "application/vnd.hydrostatix.sof-data"
+"sfs", "application/vnd.spotfire.sfs"
+"sfv", "text/x-sfv"
+"sgi", "image/sgi"
+"sgl", "application/vnd.stardivision.writer-global"
+"sgm", "text/sgml"
+"sgml", "text/sgml"
+"sh", "application/x-sh"
+"shar", "application/x-shar"
+"shf", "application/shf+xml"
+"sid", "image/x-mrsid-image"
+"sig", "application/pgp-signature"
+"sil", "audio/silk"
+"silo", "model/mesh"
+"sis", "application/vnd.symbian.install"
+"sisx", "application/vnd.symbian.install"
+"sit", "application/x-stuffit"
+"sitx", "application/x-stuffitx"
+"skd", "application/vnd.koan"
+"skm", "application/vnd.koan"
+"skp", "application/vnd.koan"
+"skt", "application/vnd.koan"
+"sldm", "application/vnd.ms-powerpoint.slide.macroenabled.12"
+"sldx", "application/vnd.openxmlformats-officedocument.presentationml.slide"
+"slt", "application/vnd.epson.salt"
+"sm", "application/vnd.stepmania.stepchart"
+"smf", "application/vnd.stardivision.math"
+"smi", "application/smil+xml"
+"smil", "application/smil+xml"
+"smv", "video/x-smv"
+"smzip", "application/vnd.stepmania.package"
+"snd", "audio/basic"
+"snf", "application/x-font-snf"
+"so", "application/octet-stream"
+"spc", "application/x-pkcs7-certificates"
+"spf", "application/vnd.yamaha.smaf-phrase"
+"spl", "application/x-futuresplash"
+"spot", "text/vnd.in3d.spot"
+"spp", "application/scvp-vp-response"
+"spq", "application/scvp-vp-request"
+"spx", "audio/ogg"
+"sql", "application/x-sql"
+"src", "application/x-wais-source"
+"srt", "application/x-subrip"
+"sru", "application/sru+xml"
+"srx", "application/sparql-results+xml"
+"ssdl", "application/ssdl+xml"
+"sse", "application/vnd.kodak-descriptor"
+"ssf", "application/vnd.epson.ssf"
+"ssml", "application/ssml+xml"
+"st", "application/vnd.sailingtracker.track"
+"stc", "application/vnd.sun.xml.calc.template"
+"std", "application/vnd.sun.xml.draw.template"
+"stf", "application/vnd.wt.stf"
+"sti", "application/vnd.sun.xml.impress.template"
+"stk", "application/hyperstudio"
+"stl", "application/vnd.ms-pki.stl"
+"str", "application/vnd.pg.format"
+"stw", "application/vnd.sun.xml.writer.template"
+"sub", "image/vnd.dvb.subtitle"
+"sus", "application/vnd.sus-calendar"
+"susp", "application/vnd.sus-calendar"
+"sv4cpio", "application/x-sv4cpio"
+"sv4crc", "application/x-sv4crc"
+"svc", "application/vnd.dvb.service"
+"svd", "application/vnd.svd"
+"svg", "image/svg+xml"
+"svgz", "image/svg+xml"
+"swa", "application/x-director"
+"swf", "application/x-shockwave-flash"
+"swi", "application/vnd.aristanetworks.swi"
+"sxc", "application/vnd.sun.xml.calc"
+"sxd", "application/vnd.sun.xml.draw"
+"sxg", "application/vnd.sun.xml.writer.global"
+"sxi", "application/vnd.sun.xml.impress"
+"sxm", "application/vnd.sun.xml.math"
+"sxw", "application/vnd.sun.xml.writer"
+"t", "text/troff"
+"t3", "application/x-t3vm-image"
+"taglet", "application/vnd.mynfc"
+"tao", "application/vnd.tao.intent-module-archive"
+"tar", "application/x-tar"
+"tcap", "application/vnd.3gpp2.tcap"
+"tcl", "application/x-tcl"
+"teacher", "application/vnd.smart.teacher"
+"tei", "application/tei+xml"
+"teicorpus", "application/tei+xml"
+"tex", "application/x-tex"
+"texi", "application/x-texinfo"
+"texinfo", "application/x-texinfo"
+"text", "text/plain"
+"tfi", "application/thraud+xml"
+"tfm", "application/x-tex-tfm"
+"tga", "image/x-tga"
+"tgs", "application/x-tgsticker"
+"thmx", "application/vnd.ms-officetheme"
+"tif", "image/tiff"
+"tiff", "image/tiff"
+"tmo", "application/vnd.tmobile-livetv"
+"torrent", "application/x-bittorrent"
+"tpl", "application/vnd.groove-tool-template"
+"tpt", "application/vnd.trid.tpt"
+"tr", "text/troff"
+"tra", "application/vnd.trueapp"
+"trm", "application/x-msterminal"
+"tsd", "application/timestamped-data"
+"tsv", "text/tab-separated-values"
+"ttc", "font/collection"
+"ttf", "font/ttf"
+"ttl", "text/turtle"
+"twd", "application/vnd.simtech-mindmapper"
+"twds", "application/vnd.simtech-mindmapper"
+"txd", "application/vnd.genomatix.tuxedo"
+"txf", "application/vnd.mobius.txf"
+"txt", "text/plain"
+"u32", "application/x-authorware-bin"
+"udeb", "application/x-debian-package"
+"ufd", "application/vnd.ufdl"
+"ufdl", "application/vnd.ufdl"
+"ulx", "application/x-glulx"
+"umj", "application/vnd.umajin"
+"unityweb", "application/vnd.unity"
+"uoml", "application/vnd.uoml+xml"
+"uri", "text/uri-list"
+"uris", "text/uri-list"
+"urls", "text/uri-list"
+"ustar", "application/x-ustar"
+"utz", "application/vnd.uiq.theme"
+"uu", "text/x-uuencode"
+"uva", "audio/vnd.dece.audio"
+"uvd", "application/vnd.dece.data"
+"uvf", "application/vnd.dece.data"
+"uvg", "image/vnd.dece.graphic"
+"uvh", "video/vnd.dece.hd"
+"uvi", "image/vnd.dece.graphic"
+"uvm", "video/vnd.dece.mobile"
+"uvp", "video/vnd.dece.pd"
+"uvs", "video/vnd.dece.sd"
+"uvt", "application/vnd.dece.ttml+xml"
+"uvu", "video/vnd.uvvu.mp4"
+"uvv", "video/vnd.dece.video"
+"uvva", "audio/vnd.dece.audio"
+"uvvd", "application/vnd.dece.data"
+"uvvf", "application/vnd.dece.data"
+"uvvg", "image/vnd.dece.graphic"
+"uvvh", "video/vnd.dece.hd"
+"uvvi", "image/vnd.dece.graphic"
+"uvvm", "video/vnd.dece.mobile"
+"uvvp", "video/vnd.dece.pd"
+"uvvs", "video/vnd.dece.sd"
+"uvvt", "application/vnd.dece.ttml+xml"
+"uvvu", "video/vnd.uvvu.mp4"
+"uvvv", "video/vnd.dece.video"
+"uvvx", "application/vnd.dece.unspecified"
+"uvvz", "application/vnd.dece.zip"
+"uvx", "application/vnd.dece.unspecified"
+"uvz", "application/vnd.dece.zip"
+"vcard", "text/vcard"
+"vcd", "application/x-cdlink"
+"vcf", "text/x-vcard"
+"vcg", "application/vnd.groove-vcard"
+"vcs", "text/x-vcalendar"
+"vcx", "application/vnd.vcx"
+"vis", "application/vnd.visionary"
+"viv", "video/vnd.vivo"
+"vob", "video/x-ms-vob"
+"vor", "application/vnd.stardivision.writer"
+"vox", "application/x-authorware-bin"
+"vrml", "model/vrml"
+"vsd", "application/vnd.visio"
+"vsf", "application/vnd.vsf"
+"vss", "application/vnd.visio"
+"vst", "application/vnd.visio"
+"vsw", "application/vnd.visio"
+"vtu", "model/vnd.vtu"
+"vxml", "application/voicexml+xml"
+"w3d", "application/x-director"
+"wad", "application/x-doom"
+"wav", "audio/x-wav"
+"wax", "audio/x-ms-wax"
+"wbmp", "image/vnd.wap.wbmp"
+"wbs", "application/vnd.criticaltools.wbs+xml"
+"wbxml", "application/vnd.wap.wbxml"
+"wcm", "application/vnd.ms-works"
+"wdb", "application/vnd.ms-works"
+"wdp", "image/vnd.ms-photo"
+"weba", "audio/webm"
+"webm", "video/webm"
+"webp", "image/webp"
+"wg", "application/vnd.pmi.widget"
+"wgt", "application/widget"
+"wks", "application/vnd.ms-works"
+"wm", "video/x-ms-wm"
+"wma", "audio/x-ms-wma"
+"wmd", "application/x-ms-wmd"
+"wmf", "application/x-msmetafile"
+"wml", "text/vnd.wap.wml"
+"wmlc", "application/vnd.wap.wmlc"
+"wmls", "text/vnd.wap.wmlscript"
+"wmlsc", "application/vnd.wap.wmlscriptc"
+"wmv", "video/x-ms-wmv"
+"wmx", "video/x-ms-wmx"
+"wmz", "application/x-ms-wmz"
+"woff", "font/woff"
+"woff2", "font/woff2"
+"wpd", "application/vnd.wordperfect"
+"wpl", "application/vnd.ms-wpl"
+"wps", "application/vnd.ms-works"
+"wqd", "application/vnd.wqd"
+"wri", "application/x-mswrite"
+"wrl", "model/vrml"
+"wsdl", "application/wsdl+xml"
+"wspolicy", "application/wspolicy+xml"
+"wtb", "application/vnd.webturbo"
+"wvx", "video/x-ms-wvx"
+"x32", "application/x-authorware-bin"
+"x3d", "model/x3d+xml"
+"x3db", "model/x3d+binary"
+"x3dbz", "model/x3d+binary"
+"x3dv", "model/x3d+vrml"
+"x3dvz", "model/x3d+vrml"
+"x3dz", "model/x3d+xml"
+"xaml", "application/xaml+xml"
+"xap", "application/x-silverlight-app"
+"xar", "application/vnd.xara"
+"xbap", "application/x-ms-xbap"
+"xbd", "application/vnd.fujixerox.docuworks.binder"
+"xbm", "image/x-xbitmap"
+"xdf", "application/xcap-diff+xml"
+"xdm", "application/vnd.syncml.dm+xml"
+"xdp", "application/vnd.adobe.xdp+xml"
+"xdssc", "application/dssc+xml"
+"xdw", "application/vnd.fujixerox.docuworks"
+"xenc", "application/xenc+xml"
+"xer", "application/patch-ops-error+xml"
+"xfdf", "application/vnd.adobe.xfdf"
+"xfdl", "application/vnd.xfdl"
+"xht", "application/xhtml+xml"
+"xhtml", "application/xhtml+xml"
+"xhvml", "application/xv+xml"
+"xif", "image/vnd.xiff"
+"xla", "application/vnd.ms-excel"
+"xlam", "application/vnd.ms-excel.addin.macroenabled.12"
+"xlc", "application/vnd.ms-excel"
+"xlf", "application/x-xliff+xml"
+"xlm", "application/vnd.ms-excel"
+"xls", "application/vnd.ms-excel"
+"xlsb", "application/vnd.ms-excel.sheet.binary.macroenabled.12"
+"xlsm", "application/vnd.ms-excel.sheet.macroenabled.12"
+"xlsx", "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet"
+"xlt", "application/vnd.ms-excel"
+"xltm", "application/vnd.ms-excel.template.macroenabled.12"
+"xltx", "application/vnd.openxmlformats-officedocument.spreadsheetml.template"
+"xlw", "application/vnd.ms-excel"
+"xm", "audio/xm"
+"xml", "application/xml"
+"xo", "application/vnd.olpc-sugar"
+"xop", "application/xop+xml"
+"xpi", "application/x-xpinstall"
+"xpl", "application/xproc+xml"
+"xpm", "image/x-xpixmap"
+"xpr", "application/vnd.is-xpr"
+"xps", "application/vnd.ms-xpsdocument"
+"xpw", "application/vnd.intercon.formnet"
+"xpx", "application/vnd.intercon.formnet"
+"xsl", "application/xml"
+"xslt", "application/xslt+xml"
+"xsm", "application/vnd.syncml+xml"
+"xspf", "application/xspf+xml"
+"xul", "application/vnd.mozilla.xul+xml"
+"xvm", "application/xv+xml"
+"xvml", "application/xv+xml"
+"xwd", "image/x-xwindowdump"
+"xyz", "chemical/x-xyz"
+"xz", "application/x-xz"
+"yang", "application/yang"
+"yin", "application/yin+xml"
+"z1", "application/x-zmachine"
+"z2", "application/x-zmachine"
+"z3", "application/x-zmachine"
+"z4", "application/x-zmachine"
+"z5", "application/x-zmachine"
+"z6", "application/x-zmachine"
+"z7", "application/x-zmachine"
+"z8", "application/x-zmachine"
+"zaz", "application/vnd.zzazz.deck+xml"
+"zip", "application/zip"
+"zir", "application/vnd.zul"
+"zirz", "application/vnd.zul"
+"zmm", "application/vnd.handheld-entertainment+xml"
+%%
+const char *extension_to_mime_type(const char *extension, size_t extension_len) {
+  const auto &result = search_extension(extension, extension_len);
+  if (result == nullptr) {
+    return nullptr;
+  }
+
+  return result->mime_type;
+}
diff --git a/submodules/ton/tonlib-src/tdutils/generate/auto/mime_type_to_extension.cpp b/submodules/ton/tonlib-src/tdutils/generate/auto/mime_type_to_extension.cpp
new file mode 100644
index 0000000000..4e2d772133
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/generate/auto/mime_type_to_extension.cpp
@@ -0,0 +1,3027 @@
+/* ANSI-C code produced by gperf version 3.0.3 */
+/* Command-line: /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/gperf -m100 auto/mime_type_to_extension.gperf  */
+/* Computed positions: -k'1,6-7,9-10,13-18,20,23,25-26,31,36,$' */
+
+#if !((' ' == 32) && ('!' == 33) && ('"' == 34) && ('#' == 35) \
+      && ('%' == 37) && ('&' == 38) && ('\'' == 39) && ('(' == 40) \
+      && (')' == 41) && ('*' == 42) && ('+' == 43) && (',' == 44) \
+      && ('-' == 45) && ('.' == 46) && ('/' == 47) && ('0' == 48) \
+      && ('1' == 49) && ('2' == 50) && ('3' == 51) && ('4' == 52) \
+      && ('5' == 53) && ('6' == 54) && ('7' == 55) && ('8' == 56) \
+      && ('9' == 57) && (':' == 58) && (';' == 59) && ('<' == 60) \
+      && ('=' == 61) && ('>' == 62) && ('?' == 63) && ('A' == 65) \
+      && ('B' == 66) && ('C' == 67) && ('D' == 68) && ('E' == 69) \
+      && ('F' == 70) && ('G' == 71) && ('H' == 72) && ('I' == 73) \
+      && ('J' == 74) && ('K' == 75) && ('L' == 76) && ('M' == 77) \
+      && ('N' == 78) && ('O' == 79) && ('P' == 80) && ('Q' == 81) \
+      && ('R' == 82) && ('S' == 83) && ('T' == 84) && ('U' == 85) \
+      && ('V' == 86) && ('W' == 87) && ('X' == 88) && ('Y' == 89) \
+      && ('Z' == 90) && ('[' == 91) && ('\\' == 92) && (']' == 93) \
+      && ('^' == 94) && ('_' == 95) && ('a' == 97) && ('b' == 98) \
+      && ('c' == 99) && ('d' == 100) && ('e' == 101) && ('f' == 102) \
+      && ('g' == 103) && ('h' == 104) && ('i' == 105) && ('j' == 106) \
+      && ('k' == 107) && ('l' == 108) && ('m' == 109) && ('n' == 110) \
+      && ('o' == 111) && ('p' == 112) && ('q' == 113) && ('r' == 114) \
+      && ('s' == 115) && ('t' == 116) && ('u' == 117) && ('v' == 118) \
+      && ('w' == 119) && ('x' == 120) && ('y' == 121) && ('z' == 122) \
+      && ('{' == 123) && ('|' == 124) && ('}' == 125) && ('~' == 126))
+/* The character set is not based on ISO-646.  */
+#error "gperf generated tables don't work with this execution character set. Please report a bug to <bug-gnu-gperf@gnu.org>."
+#endif
+
+#line 12 "auto/mime_type_to_extension.gperf"
+struct mime_type_and_extension {
+  const char *mime_type;
+  const char *extension;
+};
+#include <string.h>
+/* maximum key range = 4605, duplicates = 0 */
+
+#ifndef GPERF_DOWNCASE
+#define GPERF_DOWNCASE 1
+static unsigned char gperf_downcase[256] =
+  {
+      0,   1,   2,   3,   4,   5,   6,   7,   8,   9,  10,  11,  12,  13,  14,
+     15,  16,  17,  18,  19,  20,  21,  22,  23,  24,  25,  26,  27,  28,  29,
+     30,  31,  32,  33,  34,  35,  36,  37,  38,  39,  40,  41,  42,  43,  44,
+     45,  46,  47,  48,  49,  50,  51,  52,  53,  54,  55,  56,  57,  58,  59,
+     60,  61,  62,  63,  64,  97,  98,  99, 100, 101, 102, 103, 104, 105, 106,
+    107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121,
+    122,  91,  92,  93,  94,  95,  96,  97,  98,  99, 100, 101, 102, 103, 104,
+    105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119,
+    120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134,
+    135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149,
+    150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164,
+    165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179,
+    180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194,
+    195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209,
+    210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224,
+    225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239,
+    240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254,
+    255
+  };
+#endif
+
+#ifndef GPERF_CASE_STRCMP
+#define GPERF_CASE_STRCMP 1
+static int
+gperf_case_strcmp (register const char *s1, register const char *s2)
+{
+  for (;;)
+    {
+      unsigned char c1 = gperf_downcase[(unsigned char)*s1++];
+      unsigned char c2 = gperf_downcase[(unsigned char)*s2++];
+      if (c1 != 0 && c1 == c2)
+        continue;
+      return (int)c1 - (int)c2;
+    }
+}
+#endif
+
+#ifdef __GNUC__
+__inline
+#else
+#ifdef __cplusplus
+inline
+#endif
+#endif
+static unsigned int
+mime_type_hash (register const char *str, register unsigned int len)
+{
+  static const unsigned short asso_values[] =
+    {
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686,  885, 4686,  246,   74,  610,   13,   13,
+       208,   32,   14,   17,   23,   15,   12,   12, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686,   15,  927,   27,   48,   15,
+       336,  654,  914,   13,  766, 1405,  205,   14,   12,   14,
+        13,   30,   37,   12,   22,  755,   34, 1200,  156, 1446,
+       392, 4686, 4686, 4686, 4686, 4686, 4686,   15,  927,   27,
+        48,   15,  336,  654,  914,   13,  766, 1405,  205,   14,
+        12,   14,   13,   30,   37,   12,   22,  755,   34, 1200,
+       156, 1446,  392, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686, 4686,
+      4686, 4686, 4686, 4686, 4686, 4686
+    };
+  register unsigned int hval = len;
+
+  switch (hval)
+    {
+      default:
+        hval += asso_values[(unsigned char)str[35]];
+      /*FALLTHROUGH*/
+      case 35:
+      case 34:
+      case 33:
+      case 32:
+      case 31:
+        hval += asso_values[(unsigned char)str[30]];
+      /*FALLTHROUGH*/
+      case 30:
+      case 29:
+      case 28:
+      case 27:
+      case 26:
+        hval += asso_values[(unsigned char)str[25]];
+      /*FALLTHROUGH*/
+      case 25:
+        hval += asso_values[(unsigned char)str[24]];
+      /*FALLTHROUGH*/
+      case 24:
+      case 23:
+        hval += asso_values[(unsigned char)str[22]];
+      /*FALLTHROUGH*/
+      case 22:
+      case 21:
+      case 20:
+        hval += asso_values[(unsigned char)str[19]];
+      /*FALLTHROUGH*/
+      case 19:
+      case 18:
+        hval += asso_values[(unsigned char)str[17]];
+      /*FALLTHROUGH*/
+      case 17:
+        hval += asso_values[(unsigned char)str[16]];
+      /*FALLTHROUGH*/
+      case 16:
+        hval += asso_values[(unsigned char)str[15]];
+      /*FALLTHROUGH*/
+      case 15:
+        hval += asso_values[(unsigned char)str[14]];
+      /*FALLTHROUGH*/
+      case 14:
+        hval += asso_values[(unsigned char)str[13]];
+      /*FALLTHROUGH*/
+      case 13:
+        hval += asso_values[(unsigned char)str[12]];
+      /*FALLTHROUGH*/
+      case 12:
+      case 11:
+      case 10:
+        hval += asso_values[(unsigned char)str[9]];
+      /*FALLTHROUGH*/
+      case 9:
+        hval += asso_values[(unsigned char)str[8]];
+      /*FALLTHROUGH*/
+      case 8:
+      case 7:
+        hval += asso_values[(unsigned char)str[6]];
+      /*FALLTHROUGH*/
+      case 6:
+        hval += asso_values[(unsigned char)str[5]];
+      /*FALLTHROUGH*/
+      case 5:
+      case 4:
+      case 3:
+      case 2:
+      case 1:
+        hval += asso_values[(unsigned char)str[0]];
+        break;
+    }
+  return hval + asso_values[(unsigned char)str[len - 1]];
+}
+
+const struct mime_type_and_extension *
+search_mime_type (register const char *str, register unsigned int len)
+{
+  enum
+    {
+      TOTAL_KEYWORDS = 777,
+      MIN_WORD_LENGTH = 7,
+      MAX_WORD_LENGTH = 73,
+      MIN_HASH_VALUE = 81,
+      MAX_HASH_VALUE = 4685
+    };
+
+  static const struct mime_type_and_extension wordlist[] =
+    {
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 714 "auto/mime_type_to_extension.gperf"
+      {"text/css", "css"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 715 "auto/mime_type_to_extension.gperf"
+      {"text/csv", "csv"},
+      {"",nullptr},
+#line 717 "auto/mime_type_to_extension.gperf"
+      {"text/n3", "n3"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 65 "auto/mime_type_to_extension.gperf"
+      {"application/mp4", "mp4s"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 713 "auto/mime_type_to_extension.gperf"
+      {"text/calendar", "ics"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 110 "auto/mime_type_to_extension.gperf"
+      {"application/sdp", "sdp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 69 "auto/mime_type_to_extension.gperf"
+      {"application/oda", "oda"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 73 "auto/mime_type_to_extension.gperf"
+      {"application/onenote", "onetoc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 54 "auto/mime_type_to_extension.gperf"
+      {"application/marc", "mrc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 726 "auto/mime_type_to_extension.gperf"
+      {"text/vcard", "vcard"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 90 "auto/mime_type_to_extension.gperf"
+      {"application/postscript", "ai"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 33 "auto/mime_type_to_extension.gperf"
+      {"application/ecmascript", "es"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 718 "auto/mime_type_to_extension.gperf"
+      {"text/plain", "txt"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 36 "auto/mime_type_to_extension.gperf"
+      {"application/exi", "exi"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 74 "auto/mime_type_to_extension.gperf"
+      {"application/oxps", "oxps"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 323 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-ims", "ims"},
+      {"",nullptr}, {"",nullptr},
+#line 387 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.palm", "pdb"},
+#line 410 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.sema", "sema"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 194 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.enliven", "nml"},
+#line 385 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.osgi.dp", "dp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 260 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.intergeo", "i2g"},
+#line 185 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.dna", "dna"},
+#line 459 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.visio", "vsd"},
+      {"",nullptr}, {"",nullptr},
+#line 124 "auto/mime_type_to_extension.gperf"
+      {"application/timestamped-data", "tsd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 340 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mseq", "mseq"},
+      {"",nullptr},
+#line 296 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mcd", "mcd"},
+#line 64 "auto/mime_type_to_extension.gperf"
+      {"application/mp21", "m21"},
+      {"",nullptr},
+#line 388 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.pawaafile", "paw"},
+      {"",nullptr},
+#line 442 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.svd", "svd"},
+      {"",nullptr},
+#line 266 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.isac.fcs", "fcs"},
+      {"",nullptr}, {"",nullptr},
+#line 133 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.acucorp", "atc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 452 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.trueapp", "tra"},
+      {"",nullptr}, {"",nullptr},
+#line 736 "auto/mime_type_to_extension.gperf"
+      {"text/vnd.in3d.spot", "spot"},
+#line 178 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.dart", "dart"},
+#line 183 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.dece.zip", "uvz"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 328 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-powerpoint", "ppt"},
+      {"",nullptr}, {"",nullptr},
+#line 325 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-officetheme", "thmx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 256 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.immervision-ivp", "ivp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 411 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.semd", "semd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 180 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.dece.data", "uvf"},
+      {"",nullptr}, {"",nullptr},
+#line 165 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.commonspace", "csp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 297 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.medcalcdata", "mc1"},
+      {"",nullptr}, {"",nullptr},
+#line 363 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.image", "odi"},
+#line 450 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.trid.tpt", "tpt"},
+      {"",nullptr}, {"",nullptr},
+#line 365 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.presentation", "odp"},
+      {"",nullptr}, {"",nullptr},
+#line 396 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.proteus.magazine", "mgz"},
+#line 197 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.epson.quickanime", "qam"},
+#line 364 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.image-template", "oti"},
+#line 129 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.3m.post-it-notes", "pwn"},
+      {"",nullptr},
+#line 367 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.spreadsheet", "ods"},
+#line 305 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mobius.dis", "dis"},
+#line 368 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.spreadsheet-template", "ots"},
+#line 369 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.text", "odt"},
+#line 366 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.presentation-template", "otp"},
+#line 371 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.text-template", "ott"},
+      {"",nullptr}, {"",nullptr},
+#line 398 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.pvi.ptid1", "ptid"},
+#line 356 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.chart", "odc"},
+      {"",nullptr},
+#line 357 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.chart-template", "otc"},
+      {"",nullptr}, {"",nullptr},
+#line 448 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.tcpdump.pcap", "pcap"},
+      {"",nullptr},
+#line 419 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.smart.teacher", "teacher"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 352 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.nokia.radio-presets", "rpss"},
+      {"",nullptr}, {"",nullptr},
+#line 370 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.text-master", "odm"},
+#line 358 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.database", "odb"},
+#line 425 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.stardivision.impress", "sdd"},
+#line 423 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.stardivision.calc", "sdc"},
+#line 326 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-pki.seccat", "cat"},
+#line 741 "auto/mime_type_to_extension.gperf"
+      {"text/x-c", "c"},
+#line 351 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.nokia.radio-preset", "rpst"},
+      {"",nullptr},
+#line 422 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.spotfire.sfs", "sfs"},
+#line 429 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.stepmania.package", "smzip"},
+#line 451 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.triscape.mxs", "mxs"},
+#line 182 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.dece.unspecified", "uvx"},
+      {"",nullptr},
+#line 131 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.accpac.simply.imp", "imp"},
+#line 152 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.astraea-software.iota", "iota"},
+      {"",nullptr},
+#line 130 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.accpac.simply.aso", "aso"},
+      {"",nullptr}, {"",nullptr},
+#line 470 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.xara", "xar"},
+#line 740 "auto/mime_type_to_extension.gperf"
+      {"text/x-asm", "asm"},
+#line 190 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.dvb.ait", "ait"},
+#line 168 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.crick.clicker", "clkx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 430 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.stepmania.stepchart", "sm"},
+      {"",nullptr},
+#line 392 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.pmi.widget", "wg"},
+      {"",nullptr},
+#line 458 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.vcx", "vcx"},
+      {"",nullptr}, {"",nullptr},
+#line 427 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.stardivision.writer", "sdw"},
+#line 265 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.is-xpr", "xpr"},
+      {"",nullptr}, {"",nullptr},
+#line 404 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.rim.cod", "cod"},
+      {"",nullptr},
+#line 170 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.crick.clicker.palette", "clkp"},
+      {"",nullptr},
+#line 421 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.spotfire.dxp", "dxp"},
+#line 171 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.crick.clicker.template", "clkt"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 68 "auto/mime_type_to_extension.gperf"
+      {"application/octet-stream", "bin"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 27 "auto/mime_type_to_extension.gperf"
+      {"application/cdmi-queue", "cdmiq"},
+      {"",nullptr}, {"",nullptr},
+#line 391 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.picsel", "efif"},
+#line 748 "auto/mime_type_to_extension.gperf"
+      {"text/x-setext", "etx"},
+#line 324 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-lrm", "lrm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 752 "auto/mime_type_to_extension.gperf"
+      {"text/x-vcard", "vcf"},
+#line 191 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.dvb.service", "svc"},
+#line 742 "auto/mime_type_to_extension.gperf"
+      {"text/x-fortran", "f"},
+      {"",nullptr},
+#line 605 "auto/mime_type_to_extension.gperf"
+      {"application/zip", "zip"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 111 "auto/mime_type_to_extension.gperf"
+      {"application/set-payment-initiation", "setpay"},
+#line 316 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-excel", "xls"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 25 "auto/mime_type_to_extension.gperf"
+      {"application/cdmi-domain", "cdmid"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 18 "auto/mime_type_to_extension.gperf"
+      {"application/applixware", "aw"},
+      {"",nullptr},
+#line 52 "auto/mime_type_to_extension.gperf"
+      {"application/mac-compactpro", "cpt"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 539 "auto/mime_type_to_extension.gperf"
+      {"application/x-mie", "mie"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 132 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.acucobol", "acu"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 198 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.epson.salt", "slt"},
+#line 516 "auto/mime_type_to_extension.gperf"
+      {"application/x-eva", "eva"},
+      {"",nullptr}, {"",nullptr},
+#line 505 "auto/mime_type_to_extension.gperf"
+      {"application/x-cpio", "cpio"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 727 "auto/mime_type_to_extension.gperf"
+      {"text/vnd.curl", "curl"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 24 "auto/mime_type_to_extension.gperf"
+      {"application/cdmi-container", "cdmic"},
+      {"",nullptr},
+#line 112 "auto/mime_type_to_extension.gperf"
+      {"application/set-registration-initiation", "setreg"},
+#line 161 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.cloanto.rp9", "rp9"},
+#line 546 "auto/mime_type_to_extension.gperf"
+      {"application/x-msaccess", "mdb"},
+      {"",nullptr}, {"",nullptr},
+#line 167 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.cosmocaller", "cmc"},
+      {"",nullptr},
+#line 510 "auto/mime_type_to_extension.gperf"
+      {"application/x-doom", "wad"},
+      {"",nullptr}, {"",nullptr},
+#line 514 "auto/mime_type_to_extension.gperf"
+      {"application/x-dvi", "dvi"},
+      {"",nullptr},
+#line 576 "auto/mime_type_to_extension.gperf"
+      {"application/x-tads", "gam"},
+#line 577 "auto/mime_type_to_extension.gperf"
+      {"application/x-tar", "tar"},
+      {"",nullptr},
+#line 159 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.cinderella", "cdy"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 332 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-powerpoint.slideshow.macroenabled.12", "ppsm"},
+#line 573 "auto/mime_type_to_extension.gperf"
+      {"application/x-sv4cpio", "sv4cpio"},
+      {"",nullptr}, {"",nullptr},
+#line 330 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-powerpoint.presentation.macroenabled.12", "pptm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 751 "auto/mime_type_to_extension.gperf"
+      {"text/x-vcalendar", "vcs"},
+#line 333 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-powerpoint.template.macroenabled.12", "potm"},
+      {"",nullptr},
+#line 303 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mif", "mif"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 574 "auto/mime_type_to_extension.gperf"
+      {"application/x-sv4crc", "sv4crc"},
+#line 300 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mfmp", "mfm"},
+#line 405 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.rn-realmedia", "rm"},
+      {"",nullptr}, {"",nullptr},
+#line 309 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mobius.plc", "plc"},
+#line 461 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.vsf", "vsf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 644 "auto/mime_type_to_extension.gperf"
+      {"font/collection", "ttc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 745 "auto/mime_type_to_extension.gperf"
+      {"text/x-opml", "opml"},
+      {"",nullptr}, {"",nullptr},
+#line 662 "auto/mime_type_to_extension.gperf"
+      {"image/sgi", "sgi"},
+#line 79 "auto/mime_type_to_extension.gperf"
+      {"application/pics-rules", "prf"},
+#line 315 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-cab-compressed", "cab"},
+#line 550 "auto/mime_type_to_extension.gperf"
+      {"application/x-msdownload", "exe"},
+#line 612 "auto/mime_type_to_extension.gperf"
+      {"audio/s3m", "s3m"},
+      {"",nullptr},
+#line 609 "auto/mime_type_to_extension.gperf"
+      {"audio/mp4", "m4a"},
+      {"",nullptr},
+#line 331 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-powerpoint.slide.macroenabled.12", "sldm"},
+#line 596 "auto/mime_type_to_extension.gperf"
+      {"application/xml", "xml"},
+#line 509 "auto/mime_type_to_extension.gperf"
+      {"application/x-director", "dir"},
+#line 329 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-powerpoint.addin.macroenabled.12", "ppam"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 700 "auto/mime_type_to_extension.gperf"
+      {"model/iges", "igs"},
+#line 650 "auto/mime_type_to_extension.gperf"
+      {"image/cgm", "cgm"},
+#line 401 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.recordare.musicxml", "mxl"},
+      {"",nullptr}, {"",nullptr},
+#line 320 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-excel.template.macroenabled.12", "xltm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 762 "auto/mime_type_to_extension.gperf"
+      {"video/mp4", "mp4"},
+#line 299 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mfer", "mwf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 606 "auto/mime_type_to_extension.gperf"
+      {"audio/adpcm", "adp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 645 "auto/mime_type_to_extension.gperf"
+      {"font/otf", "otf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 608 "auto/mime_type_to_extension.gperf"
+      {"audio/midi", "midi"},
+#line 646 "auto/mime_type_to_extension.gperf"
+      {"font/ttf", "ttf"},
+#line 753 "auto/mime_type_to_extension.gperf"
+      {"video/3gpp", "3gp"},
+#line 409 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.seemail", "see"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 319 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-excel.sheet.macroenabled.12", "xlsm"},
+      {"",nullptr}, {"",nullptr},
+#line 317 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-excel.addin.macroenabled.12", "xlam"},
+      {"",nullptr}, {"",nullptr},
+#line 359 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.formula", "odf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 375 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.openofficeorg.extension", "oxt"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 360 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.formula-template", "odft"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 318 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-excel.sheet.binary.macroenabled.12", "xlsb"},
+      {"",nullptr}, {"",nullptr},
+#line 208 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.framemaker", "fm"},
+#line 107 "auto/mime_type_to_extension.gperf"
+      {"application/scvp-cv-response", "scs"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 109 "auto/mime_type_to_extension.gperf"
+      {"application/scvp-vp-response", "spp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 205 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fdsn.seed", "seed"},
+#line 259 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.intercon.formnet", "xpw"},
+#line 765 "auto/mime_type_to_extension.gperf"
+      {"video/quicktime", "mov"},
+      {"",nullptr},
+#line 43 "auto/mime_type_to_extension.gperf"
+      {"application/ipfix", "ipfix"},
+      {"",nullptr},
+#line 549 "auto/mime_type_to_extension.gperf"
+      {"application/x-msclip", "clp"},
+#line 482 "auto/mime_type_to_extension.gperf"
+      {"application/voicexml+xml", "vxml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 106 "auto/mime_type_to_extension.gperf"
+      {"application/scvp-cv-request", "scq"},
+      {"",nullptr},
+#line 204 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fdsn.mseed", "mseed"},
+#line 744 "auto/mime_type_to_extension.gperf"
+      {"text/x-nfo", "nfo"},
+#line 735 "auto/mime_type_to_extension.gperf"
+      {"text/vnd.in3d.3dml", "3dml"},
+#line 552 "auto/mime_type_to_extension.gperf"
+      {"application/x-msmetafile", "wmf"},
+      {"",nullptr},
+#line 108 "auto/mime_type_to_extension.gperf"
+      {"application/scvp-vp-request", "spq"},
+#line 637 "auto/mime_type_to_extension.gperf"
+      {"audio/xm", "xm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 556 "auto/mime_type_to_extension.gperf"
+      {"application/x-msterminal", "trm"},
+#line 37 "auto/mime_type_to_extension.gperf"
+      {"application/font-tdpfr", "pfr"},
+#line 149 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.apple.installer+xml", "mpkg"},
+#line 555 "auto/mime_type_to_extension.gperf"
+      {"application/x-msschedule", "scd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 308 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mobius.msl", "msl"},
+      {"",nullptr},
+#line 706 "auto/mime_type_to_extension.gperf"
+      {"model/vnd.mts", "mts"},
+#line 617 "auto/mime_type_to_extension.gperf"
+      {"audio/vnd.dts", "dts"},
+      {"",nullptr},
+#line 624 "auto/mime_type_to_extension.gperf"
+      {"audio/vnd.rip", "rip"},
+      {"",nullptr}, {"",nullptr},
+#line 327 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-pki.stl", "stl"},
+#line 616 "auto/mime_type_to_extension.gperf"
+      {"audio/vnd.dra", "dra"},
+      {"",nullptr}, {"",nullptr},
+#line 117 "auto/mime_type_to_extension.gperf"
+      {"application/srgs", "gram"},
+      {"",nullptr}, {"",nullptr},
+#line 104 "auto/mime_type_to_extension.gperf"
+      {"application/rtf", "rtf"},
+      {"",nullptr},
+#line 76 "auto/mime_type_to_extension.gperf"
+      {"application/pdf", "pdf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 673 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.fst", "fst"},
+      {"",nullptr},
+#line 749 "auto/mime_type_to_extension.gperf"
+      {"text/x-sfv", "sfv"},
+#line 689 "auto/mime_type_to_extension.gperf"
+      {"image/x-pict", "pic"},
+      {"",nullptr}, {"",nullptr},
+#line 597 "auto/mime_type_to_extension.gperf"
+      {"application/xml-dtd", "dtd"},
+#line 686 "auto/mime_type_to_extension.gperf"
+      {"image/x-icon", "ico"},
+      {"",nullptr},
+#line 586 "auto/mime_type_to_extension.gperf"
+      {"application/x-x509-ca-cert", "der"},
+#line 548 "auto/mime_type_to_extension.gperf"
+      {"application/x-mscardfile", "crd"},
+      {"",nullptr},
+#line 402 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.recordare.musicxml+xml", "musicxml"},
+#line 626 "auto/mime_type_to_extension.gperf"
+      {"audio/x-aac", "aac"},
+      {"",nullptr}, {"",nullptr},
+#line 579 "auto/mime_type_to_extension.gperf"
+      {"application/x-tex", "tex"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 534 "auto/mime_type_to_extension.gperf"
+      {"application/x-install-instructions", "install"},
+#line 772 "auto/mime_type_to_extension.gperf"
+      {"video/vnd.fvt", "fvt"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 347 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.noblenet-sealer", "nns"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 633 "auto/mime_type_to_extension.gperf"
+      {"audio/x-ms-wma", "wma"},
+      {"",nullptr},
+#line 786 "auto/mime_type_to_extension.gperf"
+      {"video/x-ms-wm", "wm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 792 "auto/mime_type_to_extension.gperf"
+      {"video/x-smv", "smv"},
+      {"",nullptr},
+#line 781 "auto/mime_type_to_extension.gperf"
+      {"video/x-m4v", "m4v"},
+#line 746 "auto/mime_type_to_extension.gperf"
+      {"text/x-pascal", "pas"},
+      {"",nullptr},
+#line 776 "auto/mime_type_to_extension.gperf"
+      {"video/vnd.vivo", "viv"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 542 "auto/mime_type_to_extension.gperf"
+      {"application/x-ms-shortcut", "lnk"},
+      {"",nullptr},
+#line 682 "auto/mime_type_to_extension.gperf"
+      {"image/x-3ds", "3ds"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 541 "auto/mime_type_to_extension.gperf"
+      {"application/x-ms-application", "application"},
+#line 301 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.micrografx.flo", "flo"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 377 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.openxmlformats-officedocument.presentationml.slide", "sldx"},
+#line 254 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.iccprofile", "icc"},
+#line 381 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.openxmlformats-officedocument.spreadsheetml.template", "xltx"},
+#line 379 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.openxmlformats-officedocument.presentationml.template", "potx"},
+#line 376 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.openxmlformats-officedocument.presentationml.presentation", "pptx"},
+#line 383 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.openxmlformats-officedocument.wordprocessingml.template", "dotx"},
+#line 380 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet", "xlsx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 428 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.stardivision.writer-global", "sgl"},
+#line 382 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.openxmlformats-officedocument.wordprocessingml.document", "docx"},
+      {"",nullptr}, {"",nullptr},
+#line 48 "auto/mime_type_to_extension.gperf"
+      {"application/json", "json"},
+      {"",nullptr},
+#line 537 "auto/mime_type_to_extension.gperf"
+      {"application/x-latex", "latex"},
+      {"",nullptr}, {"",nullptr},
+#line 754 "auto/mime_type_to_extension.gperf"
+      {"video/3gpp2", "3g2"},
+#line 787 "auto/mime_type_to_extension.gperf"
+      {"video/x-ms-wmv", "wmv"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 790 "auto/mime_type_to_extension.gperf"
+      {"video/x-msvideo", "avi"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 489 "auto/mime_type_to_extension.gperf"
+      {"application/x-ace-compressed", "ace"},
+#line 67 "auto/mime_type_to_extension.gperf"
+      {"application/mxf", "mxf"},
+      {"",nullptr}, {"",nullptr},
+#line 524 "auto/mime_type_to_extension.gperf"
+      {"application/x-font-type1", "pfa"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 569 "auto/mime_type_to_extension.gperf"
+      {"application/x-sql", "sql"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 285 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.las.las+xml", "lasxml"},
+      {"",nullptr},
+#line 578 "auto/mime_type_to_extension.gperf"
+      {"application/x-tcl", "tcl"},
+#line 545 "auto/mime_type_to_extension.gperf"
+      {"application/x-ms-xbap", "xbap"},
+#line 374 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oma.dd2+xml", "dd2"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 345 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.nitf", "ntf"},
+#line 418 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.smaf", "mmf"},
+#line 412 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.semf", "semf"},
+#line 563 "auto/mime_type_to_extension.gperf"
+      {"application/x-rar-compressed", "rar"},
+      {"",nullptr},
+#line 526 "auto/mime_type_to_extension.gperf"
+      {"application/x-freearc", "arc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 504 "auto/mime_type_to_extension.gperf"
+      {"application/x-conference", "nsc"},
+      {"",nullptr}, {"",nullptr},
+#line 226 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.geoplan", "g2w"},
+      {"",nullptr}, {"",nullptr},
+#line 591 "auto/mime_type_to_extension.gperf"
+      {"application/x-zmachine", "z1"},
+      {"",nullptr},
+#line 688 "auto/mime_type_to_extension.gperf"
+      {"image/x-pcx", "pcx"},
+#line 684 "auto/mime_type_to_extension.gperf"
+      {"image/x-cmx", "cmx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 203 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fdf", "fdf"},
+      {"",nullptr}, {"",nullptr},
+#line 174 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ctc-posml", "pml"},
+      {"",nullptr},
+#line 390 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.pg.osasli", "ei6"},
+      {"",nullptr}, {"",nullptr},
+#line 227 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.geospace", "g3w"},
+#line 225 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.geonext", "gxt"},
+#line 144 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.amiga.ami", "ami"},
+      {"",nullptr},
+#line 199 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.epson.ssf", "ssf"},
+      {"",nullptr},
+#line 196 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.epson.msf", "msf"},
+#line 195 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.epson.esf", "esf"},
+      {"",nullptr}, {"",nullptr},
+#line 255 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.igloader", "igl"},
+#line 47 "auto/mime_type_to_extension.gperf"
+      {"application/javascript", "js"},
+      {"",nullptr}, {"",nullptr},
+#line 683 "auto/mime_type_to_extension.gperf"
+      {"image/x-cmu-raster", "ras"},
+      {"",nullptr},
+#line 619 "auto/mime_type_to_extension.gperf"
+      {"audio/vnd.lucent.voice", "lvp"},
+      {"",nullptr}, {"",nullptr},
+#line 697 "auto/mime_type_to_extension.gperf"
+      {"image/x-xpixmap", "xpm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 302 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.micrografx.igx", "igx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 349 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.nokia.n-gage.data", "ngdat"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 128 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.3gpp2.tcap", "tcap"},
+#line 769 "auto/mime_type_to_extension.gperf"
+      {"video/vnd.dece.sd", "uvs"},
+#line 768 "auto/mime_type_to_extension.gperf"
+      {"video/vnd.dece.pd", "uvp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 724 "auto/mime_type_to_extension.gperf"
+      {"text/turtle", "ttl"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 361 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.graphics", "odg"},
+#line 770 "auto/mime_type_to_extension.gperf"
+      {"video/vnd.dece.video", "uvv"},
+#line 166 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.contact.cmsg", "cdbcmsg"},
+#line 490 "auto/mime_type_to_extension.gperf"
+      {"application/x-apple-diskimage", "dmg"},
+      {"",nullptr},
+#line 581 "auto/mime_type_to_extension.gperf"
+      {"application/x-texinfo", "texinfo"},
+      {"",nullptr},
+#line 720 "auto/mime_type_to_extension.gperf"
+      {"text/richtext", "rtx"},
+#line 267 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.jam", "jam"},
+      {"",nullptr},
+#line 148 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.antix.game-component", "atx"},
+      {"",nullptr},
+#line 362 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.graphics-template", "otg"},
+      {"",nullptr}, {"",nullptr},
+#line 258 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.insors.igm", "igm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 269 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.jisp", "jisp"},
+#line 353 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.novadigm.edm", "edm"},
+      {"",nullptr},
+#line 304 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mobius.daf", "daf"},
+      {"",nullptr}, {"",nullptr},
+#line 761 "auto/mime_type_to_extension.gperf"
+      {"video/mj2", "mj2"},
+      {"",nullptr},
+#line 341 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.musician", "mus"},
+#line 355 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.novadigm.ext", "ext"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 708 "auto/mime_type_to_extension.gperf"
+      {"model/vrml", "wrl"},
+      {"",nullptr}, {"",nullptr},
+#line 228 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.gmx", "gmx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 723 "auto/mime_type_to_extension.gperf"
+      {"text/troff", "t"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 672 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.fpx", "fpx"},
+      {"",nullptr},
+#line 207 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fluxtime.clip", "ftc"},
+#line 721 "auto/mime_type_to_extension.gperf"
+      {"text/sgml", "sgml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 384 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.osgeo.mapguide.package", "mgp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 175 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.cups-ppd", "ppd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 589 "auto/mime_type_to_extension.gperf"
+      {"application/x-xpinstall", "xpi"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 676 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.ms-modi", "mdi"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 632 "auto/mime_type_to_extension.gperf"
+      {"audio/x-ms-wax", "wax"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 56 "auto/mime_type_to_extension.gperf"
+      {"application/mathematica", "ma"},
+#line 334 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-project", "mpp"},
+      {"",nullptr}, {"",nullptr},
+#line 627 "auto/mime_type_to_extension.gperf"
+      {"audio/x-aiff", "aif"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 454 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.uiq.theme", "utz"},
+      {"",nullptr},
+#line 788 "auto/mime_type_to_extension.gperf"
+      {"video/x-ms-wmx", "wmx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 628 "auto/mime_type_to_extension.gperf"
+      {"audio/x-caf", "caf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 471 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.xfdl", "xfdl"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 179 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.data-vision.rdz", "rdz"},
+#line 789 "auto/mime_type_to_extension.gperf"
+      {"video/x-ms-wvx", "wvx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 778 "auto/mime_type_to_extension.gperf"
+      {"video/x-f4v", "f4v"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 704 "auto/mime_type_to_extension.gperf"
+      {"model/vnd.gdl", "gdl"},
+#line 28 "auto/mime_type_to_extension.gperf"
+      {"application/cu-seeme", "cu"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 638 "auto/mime_type_to_extension.gperf"
+      {"chemical/x-cdx", "cdx"},
+#line 31 "auto/mime_type_to_extension.gperf"
+      {"application/dssc+der", "dssc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 399 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.quark.quarkxpress", "qxd"},
+#line 77 "auto/mime_type_to_extension.gperf"
+      {"application/pgp-encrypted", "pgp"},
+      {"",nullptr}, {"",nullptr},
+#line 354 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.novadigm.edx", "edx"},
+#line 310 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mobius.txf", "txf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 155 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.bmi", "bmi"},
+      {"",nullptr},
+#line 46 "auto/mime_type_to_extension.gperf"
+      {"application/java-vm", "class"},
+      {"",nullptr},
+#line 29 "auto/mime_type_to_extension.gperf"
+      {"application/davmount+xml", "davmount"},
+      {"",nullptr}, {"",nullptr},
+#line 621 "auto/mime_type_to_extension.gperf"
+      {"audio/vnd.nuera.ecelp4800", "ecelp4800"},
+      {"",nullptr},
+#line 622 "auto/mime_type_to_extension.gperf"
+      {"audio/vnd.nuera.ecelp7470", "ecelp7470"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 522 "auto/mime_type_to_extension.gperf"
+      {"application/x-font-snf", "snf"},
+#line 521 "auto/mime_type_to_extension.gperf"
+      {"application/x-font-pcf", "pcf"},
+#line 520 "auto/mime_type_to_extension.gperf"
+      {"application/x-font-otf", "otf"},
+#line 623 "auto/mime_type_to_extension.gperf"
+      {"audio/vnd.nuera.ecelp9600", "ecelp9600"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 523 "auto/mime_type_to_extension.gperf"
+      {"application/x-font-ttf", "ttf"},
+#line 96 "auto/mime_type_to_extension.gperf"
+      {"application/resource-lists+xml", "rl"},
+      {"",nullptr}, {"",nullptr},
+#line 558 "auto/mime_type_to_extension.gperf"
+      {"application/x-netcdf", "nc"},
+#line 564 "auto/mime_type_to_extension.gperf"
+      {"application/x-research-info-systems", "ris"},
+#line 162 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.clonk.c4group", "c4g"},
+      {"",nullptr},
+#line 501 "auto/mime_type_to_extension.gperf"
+      {"application/x-cfs-compressed", "cfs"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 447 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.tao.intent-module-archive", "tao"},
+      {"",nullptr},
+#line 532 "auto/mime_type_to_extension.gperf"
+      {"application/x-gtar", "gtar"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 641 "auto/mime_type_to_extension.gperf"
+      {"chemical/x-cml", "cml"},
+      {"",nullptr},
+#line 44 "auto/mime_type_to_extension.gperf"
+      {"application/java-archive", "jar"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 26 "auto/mime_type_to_extension.gperf"
+      {"application/cdmi-object", "cdmio"},
+      {"",nullptr},
+#line 221 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.genomatix.tuxedo", "txd"},
+      {"",nullptr}, {"",nullptr},
+#line 535 "auto/mime_type_to_extension.gperf"
+      {"application/x-iso9660-image", "iso"},
+      {"",nullptr},
+#line 642 "auto/mime_type_to_extension.gperf"
+      {"chemical/x-csml", "csml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 139 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ahead.space", "ahead"},
+#line 236 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.groove-tool-message", "gtm"},
+#line 575 "auto/mime_type_to_extension.gperf"
+      {"application/x-t3vm-image", "t3"},
+      {"",nullptr},
+#line 580 "auto/mime_type_to_extension.gperf"
+      {"application/x-tex-tfm", "tfm"},
+#line 487 "auto/mime_type_to_extension.gperf"
+      {"application/x-7z-compressed", "7z"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 750 "auto/mime_type_to_extension.gperf"
+      {"text/x-uuencode", "uu"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 186 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.dolby.mlp", "mlp"},
+#line 722 "auto/mime_type_to_extension.gperf"
+      {"text/tab-separated-values", "tsv"},
+      {"",nullptr},
+#line 232 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.groove-account", "gac"},
+      {"",nullptr},
+#line 237 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.groove-tool-template", "tpl"},
+      {"",nullptr}, {"",nullptr},
+#line 291 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.lotus-notes", "nsf"},
+#line 176 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.curl.car", "car"},
+#line 339 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-xpsdocument", "xps"},
+#line 657 "auto/mime_type_to_extension.gperf"
+      {"image/ief", "ief"},
+      {"",nullptr}, {"",nullptr},
+#line 583 "auto/mime_type_to_extension.gperf"
+      {"application/x-tgsticker", "tgs"},
+#line 238 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.groove-vcard", "vcg"},
+#line 725 "auto/mime_type_to_extension.gperf"
+      {"text/uri-list", "uri"},
+      {"",nullptr},
+#line 417 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.simtech-mindmapper", "twd"},
+      {"",nullptr},
+#line 72 "auto/mime_type_to_extension.gperf"
+      {"application/omdoc+xml", "omdoc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 231 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.grafeq", "gqf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 389 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.pg.format", "str"},
+      {"",nullptr},
+#line 224 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.geometry-explorer", "gex"},
+#line 372 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.oasis.opendocument.text-web", "oth"},
+      {"",nullptr}, {"",nullptr},
+#line 426 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.stardivision.math", "smf"},
+      {"",nullptr},
+#line 584 "auto/mime_type_to_extension.gperf"
+      {"application/x-ustar", "ustar"},
+      {"",nullptr},
+#line 733 "auto/mime_type_to_extension.gperf"
+      {"text/vnd.fmi.flexstor", "flx"},
+#line 293 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.lotus-screencam", "scm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 394 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.powerbuilder6", "pbd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 629 "auto/mime_type_to_extension.gperf"
+      {"audio/x-flac", "flac"},
+#line 311 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mophun.application", "mpn"},
+      {"",nullptr}, {"",nullptr},
+#line 779 "auto/mime_type_to_extension.gperf"
+      {"video/x-fli", "fli"},
+#line 743 "auto/mime_type_to_extension.gperf"
+      {"text/x-java-source", "java"},
+#line 58 "auto/mime_type_to_extension.gperf"
+      {"application/mbox", "mbox"},
+#line 373 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.olpc-sugar", "xo"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 747 "auto/mime_type_to_extension.gperf"
+      {"text/x-php", "php"},
+#line 145 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.android.package-archive", "apk"},
+      {"",nullptr},
+#line 716 "auto/mime_type_to_extension.gperf"
+      {"text/html", "html"},
+      {"",nullptr}, {"",nullptr},
+#line 435 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.sun.xml.impress", "sxi"},
+#line 251 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ibm.modcap", "afp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 780 "auto/mime_type_to_extension.gperf"
+      {"video/x-flv", "flv"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 431 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.sun.xml.calc", "sxc"},
+#line 312 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mophun.certificate", "mpc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 150 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.apple.mpegurl", "m3u8"},
+      {"",nullptr}, {"",nullptr},
+#line 436 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.sun.xml.impress.template", "sti"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 122 "auto/mime_type_to_extension.gperf"
+      {"application/tei+xml", "tei"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 247 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.hp-pcl", "pcl"},
+      {"",nullptr},
+#line 661 "auto/mime_type_to_extension.gperf"
+      {"image/prs.btif", "btif"},
+      {"",nullptr}, {"",nullptr},
+#line 103 "auto/mime_type_to_extension.gperf"
+      {"application/rss+xml", "rss"},
+#line 59 "auto/mime_type_to_extension.gperf"
+      {"application/mediaservercontrol+xml", "mscml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 432 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.sun.xml.calc.template", "stc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 712 "auto/mime_type_to_extension.gperf"
+      {"text/cache-manifest", "appcache"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 590 "auto/mime_type_to_extension.gperf"
+      {"application/x-xz", "xz"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 760 "auto/mime_type_to_extension.gperf"
+      {"video/jpm", "jpm"},
+      {"",nullptr}, {"",nullptr},
+#line 268 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.jcp.javame.midlet-rms", "rms"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 599 "auto/mime_type_to_extension.gperf"
+      {"application/xproc+xml", "xpl"},
+#line 116 "auto/mime_type_to_extension.gperf"
+      {"application/sparql-results+xml", "srx"},
+      {"",nullptr}, {"",nullptr},
+#line 102 "auto/mime_type_to_extension.gperf"
+      {"application/rsd+xml", "rsd"},
+#line 531 "auto/mime_type_to_extension.gperf"
+      {"application/x-gramps-xml", "gramps"},
+      {"",nullptr},
+#line 233 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.groove-help", "ghf"},
+#line 670 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.dxf", "dxf"},
+#line 703 "auto/mime_type_to_extension.gperf"
+      {"model/vnd.dwf", "dwf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 457 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.uoml+xml", "uoml"},
+      {"",nullptr}, {"",nullptr},
+#line 434 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.sun.xml.draw.template", "std"},
+      {"",nullptr}, {"",nullptr},
+#line 66 "auto/mime_type_to_extension.gperf"
+      {"application/msword", "doc"},
+      {"",nullptr},
+#line 253 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ibm.secure-container", "sc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 695 "auto/mime_type_to_extension.gperf"
+      {"image/x-tga", "tga"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 17 "auto/mime_type_to_extension.gperf"
+      {"application/andrew-inset", "ez"},
+      {"",nullptr}, {"",nullptr},
+#line 737 "auto/mime_type_to_extension.gperf"
+      {"text/vnd.sun.j2me.app-descriptor", "jad"},
+      {"",nullptr}, {"",nullptr},
+#line 783 "auto/mime_type_to_extension.gperf"
+      {"video/x-mng", "mng"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 494 "auto/mime_type_to_extension.gperf"
+      {"application/x-bcpio", "bcpio"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 730 "auto/mime_type_to_extension.gperf"
+      {"text/vnd.curl.scurl", "scurl"},
+#line 502 "auto/mime_type_to_extension.gperf"
+      {"application/x-chat", "chat"},
+#line 729 "auto/mime_type_to_extension.gperf"
+      {"text/vnd.curl.mcurl", "mcurl"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 20 "auto/mime_type_to_extension.gperf"
+      {"application/atomcat+xml", "atomcat"},
+      {"",nullptr}, {"",nullptr},
+#line 449 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.tmobile-livetv", "tmo"},
+#line 21 "auto/mime_type_to_extension.gperf"
+      {"application/atomsvc+xml", "atomsvc"},
+      {"",nullptr}, {"",nullptr},
+#line 593 "auto/mime_type_to_extension.gperf"
+      {"application/xcap-diff+xml", "xdf"},
+      {"",nullptr}, {"",nullptr},
+#line 566 "auto/mime_type_to_extension.gperf"
+      {"application/x-shar", "shar"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 784 "auto/mime_type_to_extension.gperf"
+      {"video/x-ms-asf", "asf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 499 "auto/mime_type_to_extension.gperf"
+      {"application/x-cbr", "cbr"},
+      {"",nullptr}, {"",nullptr},
+#line 639 "auto/mime_type_to_extension.gperf"
+      {"chemical/x-cif", "cif"},
+#line 264 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.irepository.package+xml", "irp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 728 "auto/mime_type_to_extension.gperf"
+      {"text/vnd.curl.dcurl", "dcurl"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 206 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.flographit", "gph"},
+      {"",nullptr}, {"",nullptr},
+#line 598 "auto/mime_type_to_extension.gperf"
+      {"application/xop+xml", "xop"},
+      {"",nullptr},
+#line 262 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.intu.qfx", "qfx"},
+#line 468 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.wqd", "wqd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 400 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.realvnc.bed", "bed"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 547 "auto/mime_type_to_extension.gperf"
+      {"application/x-msbinder", "obd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 495 "auto/mime_type_to_extension.gperf"
+      {"application/x-bittorrent", "torrent"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 248 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.hp-pclxl", "pclxl"},
+      {"",nullptr},
+#line 528 "auto/mime_type_to_extension.gperf"
+      {"application/x-gca-compressed", "gca"},
+#line 200 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.eszigno3+xml", "es3"},
+#line 40 "auto/mime_type_to_extension.gperf"
+      {"application/gxf", "gxf"},
+#line 83 "auto/mime_type_to_extension.gperf"
+      {"application/pkcs8", "p8"},
+      {"",nullptr},
+#line 640 "auto/mime_type_to_extension.gperf"
+      {"chemical/x-cmdf", "cmdf"},
+#line 649 "auto/mime_type_to_extension.gperf"
+      {"image/bmp", "bmp"},
+      {"",nullptr}, {"",nullptr},
+#line 791 "auto/mime_type_to_extension.gperf"
+      {"video/x-sgi-movie", "movie"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 97 "auto/mime_type_to_extension.gperf"
+      {"application/resource-lists-diff+xml", "rld"},
+#line 89 "auto/mime_type_to_extension.gperf"
+      {"application/pls+xml", "pls"},
+      {"",nullptr},
+#line 441 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.sus-calendar", "sus"},
+      {"",nullptr}, {"",nullptr},
+#line 80 "auto/mime_type_to_extension.gperf"
+      {"application/pkcs10", "p10"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 406 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.rn-realmedia-vbr", "rmvb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 508 "auto/mime_type_to_extension.gperf"
+      {"application/x-dgc-compressed", "dgc"},
+#line 34 "auto/mime_type_to_extension.gperf"
+      {"application/emma+xml", "emma"},
+#line 653 "auto/mime_type_to_extension.gperf"
+      {"image/heic", "heic"},
+#line 607 "auto/mime_type_to_extension.gperf"
+      {"audio/basic", "au"},
+      {"",nullptr},
+#line 755 "auto/mime_type_to_extension.gperf"
+      {"video/h261", "h261"},
+#line 62 "auto/mime_type_to_extension.gperf"
+      {"application/mets+xml", "mets"},
+#line 757 "auto/mime_type_to_extension.gperf"
+      {"video/h264", "h264"},
+#line 19 "auto/mime_type_to_extension.gperf"
+      {"application/atom+xml", "atom"},
+      {"",nullptr}, {"",nullptr},
+#line 480 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.zul", "zir"},
+      {"",nullptr},
+#line 758 "auto/mime_type_to_extension.gperf"
+      {"video/h265", "h265"},
+      {"",nullptr},
+#line 518 "auto/mime_type_to_extension.gperf"
+      {"application/x-font-ghostscript", "gsf"},
+      {"",nullptr},
+#line 136 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.adobe.fxp", "fxp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 22 "auto/mime_type_to_extension.gperf"
+      {"application/ccxml+xml", "ccxml"},
+#line 134 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.adobe.air-application-installer-package+zip", "air"},
+      {"",nullptr}, {"",nullptr},
+#line 467 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.wordperfect", "wpd"},
+#line 63 "auto/mime_type_to_extension.gperf"
+      {"application/mods+xml", "mods"},
+#line 53 "auto/mime_type_to_extension.gperf"
+      {"application/mads+xml", "mads"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 57 "auto/mime_type_to_extension.gperf"
+      {"application/mathml+xml", "mathml"},
+#line 424 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.stardivision.draw", "sda"},
+#line 290 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.lotus-freelance", "pre"},
+#line 32 "auto/mime_type_to_extension.gperf"
+      {"application/dssc+xml", "xdssc"},
+#line 756 "auto/mime_type_to_extension.gperf"
+      {"video/h263", "h263"},
+      {"",nullptr},
+#line 322 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-htmlhelp", "chm"},
+      {"",nullptr}, {"",nullptr},
+#line 313 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mozilla.xul+xml", "xul"},
+      {"",nullptr}, {"",nullptr},
+#line 664 "auto/mime_type_to_extension.gperf"
+      {"image/tiff", "tiff"},
+      {"",nullptr},
+#line 55 "auto/mime_type_to_extension.gperf"
+      {"application/marcxml+xml", "mrcx"},
+      {"",nullptr},
+#line 570 "auto/mime_type_to_extension.gperf"
+      {"application/x-stuffit", "sit"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 151 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.aristanetworks.swi", "swi"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 181 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.dece.ttml+xml", "uvt"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 407 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.route66.link66+xml", "link66"},
+      {"",nullptr}, {"",nullptr},
+#line 209 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.frogans.fnc", "fnc"},
+#line 699 "auto/mime_type_to_extension.gperf"
+      {"message/rfc822", "eml"},
+#line 416 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.shana.informed.package", "ipk"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 217 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fujixerox.ddd", "ddd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 338 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-wpl", "wpl"},
+      {"",nullptr},
+#line 414 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.shana.informed.formtemplate", "itp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 283 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.koan", "skp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 415 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.shana.informed.interchange", "iif"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 678 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.net-fpx", "npx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 413 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.shana.informed.formdata", "ifm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 775 "auto/mime_type_to_extension.gperf"
+      {"video/vnd.uvvu.mp4", "uvu"},
+      {"",nullptr}, {"",nullptr},
+#line 177 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.curl.pcurl", "pcurl"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 282 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.kinar", "kne"},
+#line 88 "auto/mime_type_to_extension.gperf"
+      {"application/pkixcmp", "pki"},
+      {"",nullptr}, {"",nullptr},
+#line 503 "auto/mime_type_to_extension.gperf"
+      {"application/x-chess-pgn", "pgn"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 568 "auto/mime_type_to_extension.gperf"
+      {"application/x-silverlight-app", "xap"},
+#line 288 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.lotus-1-2-3", "123"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 602 "auto/mime_type_to_extension.gperf"
+      {"application/xv+xml", "mxml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 614 "auto/mime_type_to_extension.gperf"
+      {"audio/vnd.dece.audio", "uva"},
+      {"",nullptr},
+#line 594 "auto/mime_type_to_extension.gperf"
+      {"application/xenc+xml", "xenc"},
+      {"",nullptr},
+#line 280 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.kenameaapp", "htke"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 453 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ufdl", "ufd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 93 "auto/mime_type_to_extension.gperf"
+      {"application/rdf+xml", "rdf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 281 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.kidspiration", "kia"},
+#line 651 "auto/mime_type_to_extension.gperf"
+      {"image/g3fax", "g3"},
+      {"",nullptr},
+#line 463 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.wap.wmlc", "wmlc"},
+#line 121 "auto/mime_type_to_extension.gperf"
+      {"application/ssml+xml", "ssml"},
+#line 114 "auto/mime_type_to_extension.gperf"
+      {"application/smil+xml", "smi"},
+      {"",nullptr},
+#line 680 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.xiff", "xif"},
+#line 571 "auto/mime_type_to_extension.gperf"
+      {"application/x-stuffitx", "sitx"},
+      {"",nullptr},
+#line 189 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ds-keypoint", "kpxx"},
+      {"",nullptr}, {"",nullptr},
+#line 557 "auto/mime_type_to_extension.gperf"
+      {"application/x-mswrite", "wri"},
+#line 50 "auto/mime_type_to_extension.gperf"
+      {"application/lost+xml", "lostxml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 192 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.dynageo", "geo"},
+      {"",nullptr}, {"",nullptr},
+#line 719 "auto/mime_type_to_extension.gperf"
+      {"text/prs.lines.tag", "dsc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 455 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.umajin", "umj"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 585 "auto/mime_type_to_extension.gperf"
+      {"application/x-wais-source", "src"},
+      {"",nullptr},
+#line 120 "auto/mime_type_to_extension.gperf"
+      {"application/ssdl+xml", "ssdl"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 75 "auto/mime_type_to_extension.gperf"
+      {"application/patch-ops-error+xml", "xer"},
+      {"",nullptr}, {"",nullptr},
+#line 469 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.wt.stf", "stf"},
+#line 173 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.criticaltools.wbs+xml", "wbs"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 81 "auto/mime_type_to_extension.gperf"
+      {"application/pkcs7-mime", "p7m"},
+      {"",nullptr},
+#line 687 "auto/mime_type_to_extension.gperf"
+      {"image/x-mrsid-image", "sid"},
+      {"",nullptr},
+#line 284 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.kodak-descriptor", "sse"},
+#line 78 "auto/mime_type_to_extension.gperf"
+      {"application/pgp-signature", "asc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 497 "auto/mime_type_to_extension.gperf"
+      {"application/x-bzip", "bz"},
+      {"",nullptr}, {"",nullptr},
+#line 582 "auto/mime_type_to_extension.gperf"
+      {"application/x-tgif", "obj"},
+#line 275 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.kde.kivio", "flw"},
+#line 464 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.wap.wmlscriptc", "wmlsc"},
+#line 336 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-word.template.macroenabled.12", "dotm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 671 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.fastbidsheet", "fbs"},
+      {"",nullptr}, {"",nullptr},
+#line 257 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.immervision-ivu", "ivu"},
+      {"",nullptr},
+#line 188 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.dreamfactory", "dfac"},
+      {"",nullptr},
+#line 298 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mediastation.cdkey", "cdkey"},
+#line 272 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.kde.karbon", "karbon"},
+#line 210 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.frogans.ltf", "ltf"},
+      {"",nullptr},
+#line 335 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-word.document.macroenabled.12", "docm"},
+      {"",nullptr},
+#line 101 "auto/mime_type_to_extension.gperf"
+      {"application/rpki-roa", "roa"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 618 "auto/mime_type_to_extension.gperf"
+      {"audio/vnd.dts.hd", "dtshd"},
+#line 511 "auto/mime_type_to_extension.gperf"
+      {"application/x-dtbncx+xml", "ncx"},
+      {"",nullptr}, {"",nullptr},
+#line 278 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.kde.kspread", "ksp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 403 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.rig.cryptonote", "cryptonote"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 634 "auto/mime_type_to_extension.gperf"
+      {"audio/x-pn-realaudio", "ram"},
+#line 100 "auto/mime_type_to_extension.gperf"
+      {"application/rpki-manifest", "mft"},
+      {"",nullptr},
+#line 277 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.kde.kpresenter", "kpr"},
+      {"",nullptr},
+#line 184 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.denovo.fcselayout-link", "fe_launch"},
+      {"",nullptr},
+#line 279 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.kde.kword", "kwd"},
+      {"",nullptr},
+#line 169 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.crick.clicker.keyboard", "clkk"},
+#line 478 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.yamaha.smaf-phrase", "spf"},
+      {"",nullptr}, {"",nullptr},
+#line 49 "auto/mime_type_to_extension.gperf"
+      {"application/jsonml+json", "jsonml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 477 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.yamaha.smaf-audio", "saf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 696 "auto/mime_type_to_extension.gperf"
+      {"image/x-xbitmap", "xbm"},
+#line 115 "auto/mime_type_to_extension.gperf"
+      {"application/sparql-query", "rq"},
+#line 98 "auto/mime_type_to_extension.gperf"
+      {"application/rls-services+xml", "rs"},
+      {"",nullptr},
+#line 732 "auto/mime_type_to_extension.gperf"
+      {"text/vnd.fly", "fly"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 475 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.yamaha.openscoreformat", "osf"},
+#line 223 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.geogebra.tool", "ggt"},
+#line 766 "auto/mime_type_to_extension.gperf"
+      {"video/vnd.dece.hd", "uvh"},
+#line 143 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.americandynamics.acc", "acc"},
+#line 592 "auto/mime_type_to_extension.gperf"
+      {"application/xaml+xml", "xaml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 600 "auto/mime_type_to_extension.gperf"
+      {"application/xslt+xml", "xslt"},
+      {"",nullptr}, {"",nullptr},
+#line 660 "auto/mime_type_to_extension.gperf"
+      {"image/png", "png"},
+      {"",nullptr}, {"",nullptr},
+#line 611 "auto/mime_type_to_extension.gperf"
+      {"audio/ogg", "oga"},
+      {"",nullptr},
+#line 652 "auto/mime_type_to_extension.gperf"
+      {"image/gif", "gif"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 675 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.fujixerox.edmics-rlc", "rlc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 610 "auto/mime_type_to_extension.gperf"
+      {"audio/mpeg", "mp3"},
+      {"",nullptr},
+#line 674 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.fujixerox.edmics-mmr", "mmr"},
+#line 764 "auto/mime_type_to_extension.gperf"
+      {"video/ogg", "ogv"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 240 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.handheld-entertainment+xml", "zmm"},
+#line 393 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.pocketlearn", "plf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 263 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ipunplugged.rcprofile", "rcprofile"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 763 "auto/mime_type_to_extension.gperf"
+      {"video/mpeg", "mpeg"},
+      {"",nullptr},
+#line 23 "auto/mime_type_to_extension.gperf"
+      {"application/cdmi-capability", "cdmia"},
+      {"",nullptr}, {"",nullptr},
+#line 615 "auto/mime_type_to_extension.gperf"
+      {"audio/vnd.digital-winds", "eol"},
+#line 261 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.intu.qbo", "qbo"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 160 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.claymore", "cla"},
+#line 530 "auto/mime_type_to_extension.gperf"
+      {"application/x-gnumeric", "gnumeric"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 246 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.hp-jlyt", "jlt"},
+      {"",nullptr},
+#line 292 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.lotus-organizer", "org"},
+      {"",nullptr},
+#line 60 "auto/mime_type_to_extension.gperf"
+      {"application/metalink+xml", "metalink"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 553 "auto/mime_type_to_extension.gperf"
+      {"application/x-msmoney", "mny"},
+      {"",nullptr},
+#line 85 "auto/mime_type_to_extension.gperf"
+      {"application/pkix-cert", "cer"},
+#line 631 "auto/mime_type_to_extension.gperf"
+      {"audio/x-mpegurl", "m3u"},
+#line 515 "auto/mime_type_to_extension.gperf"
+      {"application/x-envoy", "evy"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 677 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.ms-photo", "wdp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 252 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ibm.rights-management", "irm"},
+#line 636 "auto/mime_type_to_extension.gperf"
+      {"audio/x-wav", "wav"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 135 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.adobe.formscentral.fcdt", "fcdt"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 498 "auto/mime_type_to_extension.gperf"
+      {"application/x-bzip2", "bz2"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 222 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.geogebra.file", "ggb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 601 "auto/mime_type_to_extension.gperf"
+      {"application/xspf+xml", "xspf"},
+      {"",nullptr},
+#line 543 "auto/mime_type_to_extension.gperf"
+      {"application/x-ms-wmd", "wmd"},
+#line 71 "auto/mime_type_to_extension.gperf"
+      {"application/ogg", "ogx"},
+#line 483 "auto/mime_type_to_extension.gperf"
+      {"application/widget", "wgt"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 235 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.groove-injector", "grv"},
+      {"",nullptr},
+#line 84 "auto/mime_type_to_extension.gperf"
+      {"application/pkix-attr-cert", "ac"},
+      {"",nullptr},
+#line 378 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.openxmlformats-officedocument.presentationml.slideshow", "ppsx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 343 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mynfc", "taglet"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 669 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.dwg", "dwg"},
+#line 466 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.wolfram.player", "nbp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 767 "auto/mime_type_to_extension.gperf"
+      {"video/vnd.dece.mobile", "uvm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 245 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.hp-hps", "hps"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 462 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.wap.wbxml", "wbxml"},
+      {"",nullptr}, {"",nullptr},
+#line 476 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.yamaha.openscoreformat.osfpvg+xml", "osfpvg"},
+#line 711 "auto/mime_type_to_extension.gperf"
+      {"model/x3d+xml", "x3d"},
+#line 533 "auto/mime_type_to_extension.gperf"
+      {"application/x-hdf", "hdf"},
+#line 472 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.yamaha.hv-dic", "hvd"},
+#line 241 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.hbci", "hbci"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 474 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.yamaha.hv-voice", "hvp"},
+#line 138 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.adobe.xfdf", "xfdf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 473 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.yamaha.hv-script", "hvs"},
+      {"",nullptr},
+#line 710 "auto/mime_type_to_extension.gperf"
+      {"model/x3d+vrml", "x3dv"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 517 "auto/mime_type_to_extension.gperf"
+      {"application/x-font-bdf", "bdf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 141 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.airzip.filesecure.azs", "azs"},
+#line 202 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ezpix-package", "ez3"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 119 "auto/mime_type_to_extension.gperf"
+      {"application/sru+xml", "sru"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 212 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fujitsu.oasys", "oas"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 39 "auto/mime_type_to_extension.gperf"
+      {"application/gpx+xml", "gpx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 215 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fujitsu.oasysgp", "fg5"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 187 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.dpgraph", "dpg"},
+#line 214 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fujitsu.oasys3", "oa3"},
+      {"",nullptr}, {"",nullptr},
+#line 685 "auto/mime_type_to_extension.gperf"
+      {"image/x-freehand", "fh"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 244 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.hp-hpid", "hpid"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 216 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fujitsu.oasysprs", "bh2"},
+#line 125 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.3gpp.pic-bw-large", "plb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 647 "auto/mime_type_to_extension.gperf"
+      {"font/woff", "woff"},
+#line 655 "auto/mime_type_to_extension.gperf"
+      {"image/heif", "heif"},
+      {"",nullptr},
+#line 731 "auto/mime_type_to_extension.gperf"
+      {"text/vnd.dvb.subtitle", "sub"},
+#line 289 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.lotus-approach", "apr"},
+#line 38 "auto/mime_type_to_extension.gperf"
+      {"application/gml+xml", "gml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 127 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.3gpp.pic-bw-var", "pvb"},
+#line 154 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.blueice.multipass", "mpm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 123 "auto/mime_type_to_extension.gperf"
+      {"application/thraud+xml", "tfi"},
+      {"",nullptr}, {"",nullptr},
+#line 420 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.solent.sdkm+xml", "sdkm"},
+      {"",nullptr},
+#line 572 "auto/mime_type_to_extension.gperf"
+      {"application/x-subrip", "srt"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 163 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.cluetrust.cartomobile-config", "c11amc"},
+      {"",nullptr},
+#line 437 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.sun.xml.math", "sxm"},
+#line 118 "auto/mime_type_to_extension.gperf"
+      {"application/srgs+xml", "grxml"},
+#line 164 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.cluetrust.cartomobile-config-pkg", "c11amz"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 397 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.publishare-delta-tree", "qps"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 630 "auto/mime_type_to_extension.gperf"
+      {"audio/x-matroska", "mka"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 51 "auto/mime_type_to_extension.gperf"
+      {"application/mac-binhex40", "hqx"},
+      {"",nullptr}, {"",nullptr},
+#line 346 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.noblenet-directory", "nnd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 707 "auto/mime_type_to_extension.gperf"
+      {"model/vnd.vtu", "vtu"},
+      {"",nullptr}, {"",nullptr},
+#line 782 "auto/mime_type_to_extension.gperf"
+      {"video/x-matroska", "mkv"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 230 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.google-earth.kmz", "kmz"},
+      {"",nullptr},
+#line 648 "auto/mime_type_to_extension.gperf"
+      {"font/woff2", "woff2"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 587 "auto/mime_type_to_extension.gperf"
+      {"application/x-xfig", "fig"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 229 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.google-earth.kml+xml", "kml"},
+      {"",nullptr}, {"",nullptr},
+#line 562 "auto/mime_type_to_extension.gperf"
+      {"application/x-pkcs7-certreqresp", "p7r"},
+      {"",nullptr},
+#line 667 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.djvu", "djvu"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 565 "auto/mime_type_to_extension.gperf"
+      {"application/x-sh", "sh"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 659 "auto/mime_type_to_extension.gperf"
+      {"image/ktx", "ktx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 61 "auto/mime_type_to_extension.gperf"
+      {"application/metalink4+xml", "meta4"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 506 "auto/mime_type_to_extension.gperf"
+      {"application/x-csh", "csh"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 86 "auto/mime_type_to_extension.gperf"
+      {"application/pkix-crl", "crl"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 213 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fujitsu.oasys2", "oa2"},
+#line 560 "auto/mime_type_to_extension.gperf"
+      {"application/x-pkcs12", "p12"},
+#line 321 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-fontobject", "eot"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 126 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.3gpp.pic-bw-small", "psb"},
+      {"",nullptr}, {"",nullptr},
+#line 702 "auto/mime_type_to_extension.gperf"
+      {"model/vnd.collada+xml", "dae"},
+#line 538 "auto/mime_type_to_extension.gperf"
+      {"application/x-lzh-compressed", "lzh"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 771 "auto/mime_type_to_extension.gperf"
+      {"video/vnd.dvb.file", "dvb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 694 "auto/mime_type_to_extension.gperf"
+      {"image/x-rgb", "rgb"},
+      {"",nullptr},
+#line 201 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ezpix-album", "ez2"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 693 "auto/mime_type_to_extension.gperf"
+      {"image/x-portable-pixmap", "ppm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 30 "auto/mime_type_to_extension.gperf"
+      {"application/docbook+xml", "dbk"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 519 "auto/mime_type_to_extension.gperf"
+      {"application/x-font-linux-psf", "psf"},
+#line 465 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.webturbo", "wtb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 654 "auto/mime_type_to_extension.gperf"
+      {"image/heic-sequence", "heics"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 94 "auto/mime_type_to_extension.gperf"
+      {"application/reginfo+xml", "rif"},
+      {"",nullptr}, {"",nullptr},
+#line 484 "auto/mime_type_to_extension.gperf"
+      {"application/winhlp", "hlp"},
+      {"",nullptr}, {"",nullptr},
+#line 70 "auto/mime_type_to_extension.gperf"
+      {"application/oebps-package+xml", "opf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 529 "auto/mime_type_to_extension.gperf"
+      {"application/x-glulx", "ulx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 140 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.airzip.filesecure.azf", "azf"},
+      {"",nullptr}, {"",nullptr},
+#line 536 "auto/mime_type_to_extension.gperf"
+      {"application/x-java-jnlp-file", "jnlp"},
+#line 701 "auto/mime_type_to_extension.gperf"
+      {"model/mesh", "msh"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 271 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.kahootz", "ktz"},
+#line 295 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.macports.portpkg", "portpkg"},
+      {"",nullptr},
+#line 157 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.chemdraw+xml", "cdxml"},
+      {"",nullptr},
+#line 554 "auto/mime_type_to_extension.gperf"
+      {"application/x-mspublisher", "pub"},
+#line 239 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.hal+xml", "hal"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 456 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.unity", "unityweb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 588 "auto/mime_type_to_extension.gperf"
+      {"application/x-xliff+xml", "xlf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 595 "auto/mime_type_to_extension.gperf"
+      {"application/xhtml+xml", "xhtml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 243 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.hp-hpgl", "hpgl"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 137 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.adobe.xdp+xml", "xdp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 344 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.neurolanguage.nlu", "nlu"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 193 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ecowin.chart", "mag"},
+#line 386 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.osgi.subsystem", "esa"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 294 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.lotus-wordpro", "lwp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 666 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.dece.graphic", "uvi"},
+      {"",nullptr}, {"",nullptr},
+#line 492 "auto/mime_type_to_extension.gperf"
+      {"application/x-authorware-map", "aam"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 734 "auto/mime_type_to_extension.gperf"
+      {"text/vnd.graphviz", "gv"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 663 "auto/mime_type_to_extension.gperf"
+      {"image/svg+xml", "svg"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 438 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.sun.xml.writer", "sxw"},
+      {"",nullptr}, {"",nullptr},
+#line 274 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.kde.kformula", "kfo"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 433 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.sun.xml.draw", "sxd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 496 "auto/mime_type_to_extension.gperf"
+      {"application/x-blorb", "blb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 276 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.kde.kontour", "kon"},
+#line 113 "auto/mime_type_to_extension.gperf"
+      {"application/shf+xml", "shf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 561 "auto/mime_type_to_extension.gperf"
+      {"application/x-pkcs7-certificates", "p7b"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 45 "auto/mime_type_to_extension.gperf"
+      {"application/java-serialized-object", "ser"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 314 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-artgalry", "cil"},
+      {"",nullptr},
+#line 82 "auto/mime_type_to_extension.gperf"
+      {"application/pkcs7-signature", "p7s"},
+      {"",nullptr},
+#line 91 "auto/mime_type_to_extension.gperf"
+      {"application/prs.cww", "cww"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 350 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.nokia.n-gage.symbian.install", "n-gage"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 773 "auto/mime_type_to_extension.gperf"
+      {"video/vnd.mpegurl", "mxu"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 513 "auto/mime_type_to_extension.gperf"
+      {"application/x-dtbresource+xml", "res"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 785 "auto/mime_type_to_extension.gperf"
+      {"video/x-ms-vob", "vob"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 105 "auto/mime_type_to_extension.gperf"
+      {"application/sbml+xml", "sbml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 658 "auto/mime_type_to_extension.gperf"
+      {"image/jpeg", "jpg"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 220 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fuzzysheet", "fzs"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 342 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.muvee.style", "msty"},
+      {"",nullptr},
+#line 759 "auto/mime_type_to_extension.gperf"
+      {"video/jpeg", "jpgv"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 488 "auto/mime_type_to_extension.gperf"
+      {"application/x-abiword", "abw"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 147 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.anser-web-funds-transfer-initiation", "fti"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 559 "auto/mime_type_to_extension.gperf"
+      {"application/x-nzb", "nzb"},
+#line 544 "auto/mime_type_to_extension.gperf"
+      {"application/x-ms-wmz", "wmz"},
+      {"",nullptr}, {"",nullptr},
+#line 525 "auto/mime_type_to_extension.gperf"
+      {"application/x-font-woff", "woff"},
+      {"",nullptr}, {"",nullptr},
+#line 146 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.anser-web-certificate-issue-initiation", "cii"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 656 "auto/mime_type_to_extension.gperf"
+      {"image/heif-sequence", "heifs"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 234 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.groove-identity-message", "gim"},
+#line 250 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ibm.minipay", "mpy"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 635 "auto/mime_type_to_extension.gperf"
+      {"audio/x-pn-realaudio-plugin", "rmp"},
+      {"",nullptr},
+#line 681 "auto/mime_type_to_extension.gperf"
+      {"image/webp", "webp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 625 "auto/mime_type_to_extension.gperf"
+      {"audio/webm", "weba"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 273 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.kde.kchart", "chrt"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 777 "auto/mime_type_to_extension.gperf"
+      {"video/webm", "webm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 479 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.yellowriver-custom-menu", "cmp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 604 "auto/mime_type_to_extension.gperf"
+      {"application/yin+xml", "yin"},
+#line 286 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.llamagraphics.life-balance.desktop", "lbd"},
+#line 270 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.joost.joda-archive", "joda"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 42 "auto/mime_type_to_extension.gperf"
+      {"application/inkml+xml", "ink"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 439 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.sun.xml.writer.global", "sxg"},
+      {"",nullptr},
+#line 440 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.sun.xml.writer.template", "stw"},
+      {"",nullptr},
+#line 218 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fujixerox.docuworks", "xdw"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 603 "auto/mime_type_to_extension.gperf"
+      {"application/yang", "yang"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 348 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.noblenet-web", "nnw"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 87 "auto/mime_type_to_extension.gperf"
+      {"application/pkix-pkipath", "pkipath"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 337 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.ms-works", "wps"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 739 "auto/mime_type_to_extension.gperf"
+      {"text/vnd.wap.wmlscript", "wmls"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 692 "auto/mime_type_to_extension.gperf"
+      {"image/x-portable-graymap", "pgm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 153 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.audiograph", "aep"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 446 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.syncml.dm+xml", "xdm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 156 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.businessobjects", "rep"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 219 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fujixerox.docuworks.binder", "xbd"},
+      {"",nullptr}, {"",nullptr},
+#line 507 "auto/mime_type_to_extension.gperf"
+      {"application/x-debian-package", "deb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 551 "auto/mime_type_to_extension.gperf"
+      {"application/x-msmediaview", "mvb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 92 "auto/mime_type_to_extension.gperf"
+      {"application/pskc+xml", "pskcxml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 485 "auto/mime_type_to_extension.gperf"
+      {"application/wsdl+xml", "wsdl"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 287 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.llamagraphics.life-balance.exchange+xml", "lbe"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 679 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.wap.wbmp", "wbmp"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 738 "auto/mime_type_to_extension.gperf"
+      {"text/vnd.wap.wml", "wml"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 172 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.crick.clicker.wordbank", "clkw"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 444 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.syncml+xml", "xsm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 643 "auto/mime_type_to_extension.gperf"
+      {"chemical/x-xyz", "xyz"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 95 "auto/mime_type_to_extension.gperf"
+      {"application/relax-ng-compact-syntax", "rnc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 249 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.hydrostatix.sof-data", "sfd-hdstx"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 443 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.symbian.install", "sis"},
+      {"",nullptr},
+#line 35 "auto/mime_type_to_extension.gperf"
+      {"application/epub+zip", "epub"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 142 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.amazon.ebook", "azw"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 481 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.zzazz.deck+xml", "zaz"},
+      {"",nullptr},
+#line 512 "auto/mime_type_to_extension.gperf"
+      {"application/x-dtbook+xml", "dtb"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 445 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.syncml.dm+wbxml", "bdm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 540 "auto/mime_type_to_extension.gperf"
+      {"application/x-mobipocket-ebook", "prc"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 705 "auto/mime_type_to_extension.gperf"
+      {"model/vnd.gtw", "gtw"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 493 "auto/mime_type_to_extension.gperf"
+      {"application/x-authorware-seg", "aas"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 691 "auto/mime_type_to_extension.gperf"
+      {"image/x-portable-bitmap", "pbm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 486 "auto/mime_type_to_extension.gperf"
+      {"application/wspolicy+xml", "wspolicy"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 460 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.visionary", "vis"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 395 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.previewsystems.box", "box"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 211 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.fsc.weblaunch", "fsc"},
+#line 307 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mobius.mqy", "mqy"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 41 "auto/mime_type_to_extension.gperf"
+      {"application/hyperstudio", "stk"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 99 "auto/mime_type_to_extension.gperf"
+      {"application/rpki-ghostbusters", "gbr"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 491 "auto/mime_type_to_extension.gperf"
+      {"application/x-authorware-bin", "aab"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 668 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.dvb.subtitle", "sub"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 500 "auto/mime_type_to_extension.gperf"
+      {"application/x-cdlink", "vcd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 613 "auto/mime_type_to_extension.gperf"
+      {"audio/silk", "sil"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 242 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.hhe.lesson-player", "les"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr},
+#line 665 "auto/mime_type_to_extension.gperf"
+      {"image/vnd.adobe.photoshop", "psd"},
+#line 690 "auto/mime_type_to_extension.gperf"
+      {"image/x-portable-anymap", "pnm"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 408 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.sailingtracker.track", "st"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 306 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.mobius.mbk", "mbk"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 567 "auto/mime_type_to_extension.gperf"
+      {"application/x-shockwave-flash", "swf"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 158 "auto/mime_type_to_extension.gperf"
+      {"application/vnd.chipnuts.karaoke-mmd", "mmd"},
+      {"",nullptr},
+#line 698 "auto/mime_type_to_extension.gperf"
+      {"image/x-xwindowdump", "xwd"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 620 "auto/mime_type_to_extension.gperf"
+      {"audio/vnd.ms-playready.media.pya", "pya"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 774 "auto/mime_type_to_extension.gperf"
+      {"video/vnd.ms-playready.media.pyv", "pyv"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr},
+#line 527 "auto/mime_type_to_extension.gperf"
+      {"application/x-futuresplash", "spl"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 793 "auto/mime_type_to_extension.gperf"
+      {"x-conference/x-cooltalk", "ice"},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+      {"",nullptr}, {"",nullptr}, {"",nullptr}, {"",nullptr},
+#line 709 "auto/mime_type_to_extension.gperf"
+      {"model/x3d+binary", "x3db"}
+    };
+
+  if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH)
+    {
+      unsigned int key = mime_type_hash (str, len);
+
+      if (key <= MAX_HASH_VALUE)
+        {
+          register const char *s = wordlist[key].mime_type;
+
+          if ((((unsigned char)*str ^ (unsigned char)*s) & ~32) == 0 && !gperf_case_strcmp (str, s))
+            return &wordlist[key];
+        }
+    }
+  return 0;
+}
+#line 794 "auto/mime_type_to_extension.gperf"
+
+const char *mime_type_to_extension(const char *mime_type, size_t mime_type_len) {
+  const auto &result = search_mime_type(mime_type, mime_type_len);
+  if (result == nullptr) {
+    return nullptr;
+  }
+
+  return result->extension;
+}
diff --git a/submodules/ton/tonlib-src/tdutils/generate/auto/mime_type_to_extension.gperf b/submodules/ton/tonlib-src/tdutils/generate/auto/mime_type_to_extension.gperf
new file mode 100644
index 0000000000..22b1bc4327
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/generate/auto/mime_type_to_extension.gperf
@@ -0,0 +1,802 @@
+%struct-type
+%ignore-case
+%language=ANSI-C
+%readonly-tables
+%includes
+%enum
+%define slot-name mime_type
+%define initializer-suffix ,nullptr
+%define slot-name mime_type
+%define hash-function-name mime_type_hash
+%define lookup-function-name search_mime_type
+struct mime_type_and_extension {
+  const char *mime_type;
+  const char *extension;
+}
+%%
+"application/andrew-inset", "ez"
+"application/applixware", "aw"
+"application/atom+xml", "atom"
+"application/atomcat+xml", "atomcat"
+"application/atomsvc+xml", "atomsvc"
+"application/ccxml+xml", "ccxml"
+"application/cdmi-capability", "cdmia"
+"application/cdmi-container", "cdmic"
+"application/cdmi-domain", "cdmid"
+"application/cdmi-object", "cdmio"
+"application/cdmi-queue", "cdmiq"
+"application/cu-seeme", "cu"
+"application/davmount+xml", "davmount"
+"application/docbook+xml", "dbk"
+"application/dssc+der", "dssc"
+"application/dssc+xml", "xdssc"
+"application/ecmascript", "es"
+"application/emma+xml", "emma"
+"application/epub+zip", "epub"
+"application/exi", "exi"
+"application/font-tdpfr", "pfr"
+"application/gml+xml", "gml"
+"application/gpx+xml", "gpx"
+"application/gxf", "gxf"
+"application/hyperstudio", "stk"
+"application/inkml+xml", "ink"
+"application/ipfix", "ipfix"
+"application/java-archive", "jar"
+"application/java-serialized-object", "ser"
+"application/java-vm", "class"
+"application/javascript", "js"
+"application/json", "json"
+"application/jsonml+json", "jsonml"
+"application/lost+xml", "lostxml"
+"application/mac-binhex40", "hqx"
+"application/mac-compactpro", "cpt"
+"application/mads+xml", "mads"
+"application/marc", "mrc"
+"application/marcxml+xml", "mrcx"
+"application/mathematica", "ma"
+"application/mathml+xml", "mathml"
+"application/mbox", "mbox"
+"application/mediaservercontrol+xml", "mscml"
+"application/metalink+xml", "metalink"
+"application/metalink4+xml", "meta4"
+"application/mets+xml", "mets"
+"application/mods+xml", "mods"
+"application/mp21", "m21"
+"application/mp4", "mp4s"
+"application/msword", "doc"
+"application/mxf", "mxf"
+"application/octet-stream", "bin"
+"application/oda", "oda"
+"application/oebps-package+xml", "opf"
+"application/ogg", "ogx"
+"application/omdoc+xml", "omdoc"
+"application/onenote", "onetoc"
+"application/oxps", "oxps"
+"application/patch-ops-error+xml", "xer"
+"application/pdf", "pdf"
+"application/pgp-encrypted", "pgp"
+"application/pgp-signature", "asc"
+"application/pics-rules", "prf"
+"application/pkcs10", "p10"
+"application/pkcs7-mime", "p7m"
+"application/pkcs7-signature", "p7s"
+"application/pkcs8", "p8"
+"application/pkix-attr-cert", "ac"
+"application/pkix-cert", "cer"
+"application/pkix-crl", "crl"
+"application/pkix-pkipath", "pkipath"
+"application/pkixcmp", "pki"
+"application/pls+xml", "pls"
+"application/postscript", "ai"
+"application/prs.cww", "cww"
+"application/pskc+xml", "pskcxml"
+"application/rdf+xml", "rdf"
+"application/reginfo+xml", "rif"
+"application/relax-ng-compact-syntax", "rnc"
+"application/resource-lists+xml", "rl"
+"application/resource-lists-diff+xml", "rld"
+"application/rls-services+xml", "rs"
+"application/rpki-ghostbusters", "gbr"
+"application/rpki-manifest", "mft"
+"application/rpki-roa", "roa"
+"application/rsd+xml", "rsd"
+"application/rss+xml", "rss"
+"application/rtf", "rtf"
+"application/sbml+xml", "sbml"
+"application/scvp-cv-request", "scq"
+"application/scvp-cv-response", "scs"
+"application/scvp-vp-request", "spq"
+"application/scvp-vp-response", "spp"
+"application/sdp", "sdp"
+"application/set-payment-initiation", "setpay"
+"application/set-registration-initiation", "setreg"
+"application/shf+xml", "shf"
+"application/smil+xml", "smi"
+"application/sparql-query", "rq"
+"application/sparql-results+xml", "srx"
+"application/srgs", "gram"
+"application/srgs+xml", "grxml"
+"application/sru+xml", "sru"
+"application/ssdl+xml", "ssdl"
+"application/ssml+xml", "ssml"
+"application/tei+xml", "tei"
+"application/thraud+xml", "tfi"
+"application/timestamped-data", "tsd"
+"application/vnd.3gpp.pic-bw-large", "plb"
+"application/vnd.3gpp.pic-bw-small", "psb"
+"application/vnd.3gpp.pic-bw-var", "pvb"
+"application/vnd.3gpp2.tcap", "tcap"
+"application/vnd.3m.post-it-notes", "pwn"
+"application/vnd.accpac.simply.aso", "aso"
+"application/vnd.accpac.simply.imp", "imp"
+"application/vnd.acucobol", "acu"
+"application/vnd.acucorp", "atc"
+"application/vnd.adobe.air-application-installer-package+zip", "air"
+"application/vnd.adobe.formscentral.fcdt", "fcdt"
+"application/vnd.adobe.fxp", "fxp"
+"application/vnd.adobe.xdp+xml", "xdp"
+"application/vnd.adobe.xfdf", "xfdf"
+"application/vnd.ahead.space", "ahead"
+"application/vnd.airzip.filesecure.azf", "azf"
+"application/vnd.airzip.filesecure.azs", "azs"
+"application/vnd.amazon.ebook", "azw"
+"application/vnd.americandynamics.acc", "acc"
+"application/vnd.amiga.ami", "ami"
+"application/vnd.android.package-archive", "apk"
+"application/vnd.anser-web-certificate-issue-initiation", "cii"
+"application/vnd.anser-web-funds-transfer-initiation", "fti"
+"application/vnd.antix.game-component", "atx"
+"application/vnd.apple.installer+xml", "mpkg"
+"application/vnd.apple.mpegurl", "m3u8"
+"application/vnd.aristanetworks.swi", "swi"
+"application/vnd.astraea-software.iota", "iota"
+"application/vnd.audiograph", "aep"
+"application/vnd.blueice.multipass", "mpm"
+"application/vnd.bmi", "bmi"
+"application/vnd.businessobjects", "rep"
+"application/vnd.chemdraw+xml", "cdxml"
+"application/vnd.chipnuts.karaoke-mmd", "mmd"
+"application/vnd.cinderella", "cdy"
+"application/vnd.claymore", "cla"
+"application/vnd.cloanto.rp9", "rp9"
+"application/vnd.clonk.c4group", "c4g"
+"application/vnd.cluetrust.cartomobile-config", "c11amc"
+"application/vnd.cluetrust.cartomobile-config-pkg", "c11amz"
+"application/vnd.commonspace", "csp"
+"application/vnd.contact.cmsg", "cdbcmsg"
+"application/vnd.cosmocaller", "cmc"
+"application/vnd.crick.clicker", "clkx"
+"application/vnd.crick.clicker.keyboard", "clkk"
+"application/vnd.crick.clicker.palette", "clkp"
+"application/vnd.crick.clicker.template", "clkt"
+"application/vnd.crick.clicker.wordbank", "clkw"
+"application/vnd.criticaltools.wbs+xml", "wbs"
+"application/vnd.ctc-posml", "pml"
+"application/vnd.cups-ppd", "ppd"
+"application/vnd.curl.car", "car"
+"application/vnd.curl.pcurl", "pcurl"
+"application/vnd.dart", "dart"
+"application/vnd.data-vision.rdz", "rdz"
+"application/vnd.dece.data", "uvf"
+"application/vnd.dece.ttml+xml", "uvt"
+"application/vnd.dece.unspecified", "uvx"
+"application/vnd.dece.zip", "uvz"
+"application/vnd.denovo.fcselayout-link", "fe_launch"
+"application/vnd.dna", "dna"
+"application/vnd.dolby.mlp", "mlp"
+"application/vnd.dpgraph", "dpg"
+"application/vnd.dreamfactory", "dfac"
+"application/vnd.ds-keypoint", "kpxx"
+"application/vnd.dvb.ait", "ait"
+"application/vnd.dvb.service", "svc"
+"application/vnd.dynageo", "geo"
+"application/vnd.ecowin.chart", "mag"
+"application/vnd.enliven", "nml"
+"application/vnd.epson.esf", "esf"
+"application/vnd.epson.msf", "msf"
+"application/vnd.epson.quickanime", "qam"
+"application/vnd.epson.salt", "slt"
+"application/vnd.epson.ssf", "ssf"
+"application/vnd.eszigno3+xml", "es3"
+"application/vnd.ezpix-album", "ez2"
+"application/vnd.ezpix-package", "ez3"
+"application/vnd.fdf", "fdf"
+"application/vnd.fdsn.mseed", "mseed"
+"application/vnd.fdsn.seed", "seed"
+"application/vnd.flographit", "gph"
+"application/vnd.fluxtime.clip", "ftc"
+"application/vnd.framemaker", "fm"
+"application/vnd.frogans.fnc", "fnc"
+"application/vnd.frogans.ltf", "ltf"
+"application/vnd.fsc.weblaunch", "fsc"
+"application/vnd.fujitsu.oasys", "oas"
+"application/vnd.fujitsu.oasys2", "oa2"
+"application/vnd.fujitsu.oasys3", "oa3"
+"application/vnd.fujitsu.oasysgp", "fg5"
+"application/vnd.fujitsu.oasysprs", "bh2"
+"application/vnd.fujixerox.ddd", "ddd"
+"application/vnd.fujixerox.docuworks", "xdw"
+"application/vnd.fujixerox.docuworks.binder", "xbd"
+"application/vnd.fuzzysheet", "fzs"
+"application/vnd.genomatix.tuxedo", "txd"
+"application/vnd.geogebra.file", "ggb"
+"application/vnd.geogebra.tool", "ggt"
+"application/vnd.geometry-explorer", "gex"
+"application/vnd.geonext", "gxt"
+"application/vnd.geoplan", "g2w"
+"application/vnd.geospace", "g3w"
+"application/vnd.gmx", "gmx"
+"application/vnd.google-earth.kml+xml", "kml"
+"application/vnd.google-earth.kmz", "kmz"
+"application/vnd.grafeq", "gqf"
+"application/vnd.groove-account", "gac"
+"application/vnd.groove-help", "ghf"
+"application/vnd.groove-identity-message", "gim"
+"application/vnd.groove-injector", "grv"
+"application/vnd.groove-tool-message", "gtm"
+"application/vnd.groove-tool-template", "tpl"
+"application/vnd.groove-vcard", "vcg"
+"application/vnd.hal+xml", "hal"
+"application/vnd.handheld-entertainment+xml", "zmm"
+"application/vnd.hbci", "hbci"
+"application/vnd.hhe.lesson-player", "les"
+"application/vnd.hp-hpgl", "hpgl"
+"application/vnd.hp-hpid", "hpid"
+"application/vnd.hp-hps", "hps"
+"application/vnd.hp-jlyt", "jlt"
+"application/vnd.hp-pcl", "pcl"
+"application/vnd.hp-pclxl", "pclxl"
+"application/vnd.hydrostatix.sof-data", "sfd-hdstx"
+"application/vnd.ibm.minipay", "mpy"
+"application/vnd.ibm.modcap", "afp"
+"application/vnd.ibm.rights-management", "irm"
+"application/vnd.ibm.secure-container", "sc"
+"application/vnd.iccprofile", "icc"
+"application/vnd.igloader", "igl"
+"application/vnd.immervision-ivp", "ivp"
+"application/vnd.immervision-ivu", "ivu"
+"application/vnd.insors.igm", "igm"
+"application/vnd.intercon.formnet", "xpw"
+"application/vnd.intergeo", "i2g"
+"application/vnd.intu.qbo", "qbo"
+"application/vnd.intu.qfx", "qfx"
+"application/vnd.ipunplugged.rcprofile", "rcprofile"
+"application/vnd.irepository.package+xml", "irp"
+"application/vnd.is-xpr", "xpr"
+"application/vnd.isac.fcs", "fcs"
+"application/vnd.jam", "jam"
+"application/vnd.jcp.javame.midlet-rms", "rms"
+"application/vnd.jisp", "jisp"
+"application/vnd.joost.joda-archive", "joda"
+"application/vnd.kahootz", "ktz"
+"application/vnd.kde.karbon", "karbon"
+"application/vnd.kde.kchart", "chrt"
+"application/vnd.kde.kformula", "kfo"
+"application/vnd.kde.kivio", "flw"
+"application/vnd.kde.kontour", "kon"
+"application/vnd.kde.kpresenter", "kpr"
+"application/vnd.kde.kspread", "ksp"
+"application/vnd.kde.kword", "kwd"
+"application/vnd.kenameaapp", "htke"
+"application/vnd.kidspiration", "kia"
+"application/vnd.kinar", "kne"
+"application/vnd.koan", "skp"
+"application/vnd.kodak-descriptor", "sse"
+"application/vnd.las.las+xml", "lasxml"
+"application/vnd.llamagraphics.life-balance.desktop", "lbd"
+"application/vnd.llamagraphics.life-balance.exchange+xml", "lbe"
+"application/vnd.lotus-1-2-3", "123"
+"application/vnd.lotus-approach", "apr"
+"application/vnd.lotus-freelance", "pre"
+"application/vnd.lotus-notes", "nsf"
+"application/vnd.lotus-organizer", "org"
+"application/vnd.lotus-screencam", "scm"
+"application/vnd.lotus-wordpro", "lwp"
+"application/vnd.macports.portpkg", "portpkg"
+"application/vnd.mcd", "mcd"
+"application/vnd.medcalcdata", "mc1"
+"application/vnd.mediastation.cdkey", "cdkey"
+"application/vnd.mfer", "mwf"
+"application/vnd.mfmp", "mfm"
+"application/vnd.micrografx.flo", "flo"
+"application/vnd.micrografx.igx", "igx"
+"application/vnd.mif", "mif"
+"application/vnd.mobius.daf", "daf"
+"application/vnd.mobius.dis", "dis"
+"application/vnd.mobius.mbk", "mbk"
+"application/vnd.mobius.mqy", "mqy"
+"application/vnd.mobius.msl", "msl"
+"application/vnd.mobius.plc", "plc"
+"application/vnd.mobius.txf", "txf"
+"application/vnd.mophun.application", "mpn"
+"application/vnd.mophun.certificate", "mpc"
+"application/vnd.mozilla.xul+xml", "xul"
+"application/vnd.ms-artgalry", "cil"
+"application/vnd.ms-cab-compressed", "cab"
+"application/vnd.ms-excel", "xls"
+"application/vnd.ms-excel.addin.macroenabled.12", "xlam"
+"application/vnd.ms-excel.sheet.binary.macroenabled.12", "xlsb"
+"application/vnd.ms-excel.sheet.macroenabled.12", "xlsm"
+"application/vnd.ms-excel.template.macroenabled.12", "xltm"
+"application/vnd.ms-fontobject", "eot"
+"application/vnd.ms-htmlhelp", "chm"
+"application/vnd.ms-ims", "ims"
+"application/vnd.ms-lrm", "lrm"
+"application/vnd.ms-officetheme", "thmx"
+"application/vnd.ms-pki.seccat", "cat"
+"application/vnd.ms-pki.stl", "stl"
+"application/vnd.ms-powerpoint", "ppt"
+"application/vnd.ms-powerpoint.addin.macroenabled.12", "ppam"
+"application/vnd.ms-powerpoint.presentation.macroenabled.12", "pptm"
+"application/vnd.ms-powerpoint.slide.macroenabled.12", "sldm"
+"application/vnd.ms-powerpoint.slideshow.macroenabled.12", "ppsm"
+"application/vnd.ms-powerpoint.template.macroenabled.12", "potm"
+"application/vnd.ms-project", "mpp"
+"application/vnd.ms-word.document.macroenabled.12", "docm"
+"application/vnd.ms-word.template.macroenabled.12", "dotm"
+"application/vnd.ms-works", "wps"
+"application/vnd.ms-wpl", "wpl"
+"application/vnd.ms-xpsdocument", "xps"
+"application/vnd.mseq", "mseq"
+"application/vnd.musician", "mus"
+"application/vnd.muvee.style", "msty"
+"application/vnd.mynfc", "taglet"
+"application/vnd.neurolanguage.nlu", "nlu"
+"application/vnd.nitf", "ntf"
+"application/vnd.noblenet-directory", "nnd"
+"application/vnd.noblenet-sealer", "nns"
+"application/vnd.noblenet-web", "nnw"
+"application/vnd.nokia.n-gage.data", "ngdat"
+"application/vnd.nokia.n-gage.symbian.install", "n-gage"
+"application/vnd.nokia.radio-preset", "rpst"
+"application/vnd.nokia.radio-presets", "rpss"
+"application/vnd.novadigm.edm", "edm"
+"application/vnd.novadigm.edx", "edx"
+"application/vnd.novadigm.ext", "ext"
+"application/vnd.oasis.opendocument.chart", "odc"
+"application/vnd.oasis.opendocument.chart-template", "otc"
+"application/vnd.oasis.opendocument.database", "odb"
+"application/vnd.oasis.opendocument.formula", "odf"
+"application/vnd.oasis.opendocument.formula-template", "odft"
+"application/vnd.oasis.opendocument.graphics", "odg"
+"application/vnd.oasis.opendocument.graphics-template", "otg"
+"application/vnd.oasis.opendocument.image", "odi"
+"application/vnd.oasis.opendocument.image-template", "oti"
+"application/vnd.oasis.opendocument.presentation", "odp"
+"application/vnd.oasis.opendocument.presentation-template", "otp"
+"application/vnd.oasis.opendocument.spreadsheet", "ods"
+"application/vnd.oasis.opendocument.spreadsheet-template", "ots"
+"application/vnd.oasis.opendocument.text", "odt"
+"application/vnd.oasis.opendocument.text-master", "odm"
+"application/vnd.oasis.opendocument.text-template", "ott"
+"application/vnd.oasis.opendocument.text-web", "oth"
+"application/vnd.olpc-sugar", "xo"
+"application/vnd.oma.dd2+xml", "dd2"
+"application/vnd.openofficeorg.extension", "oxt"
+"application/vnd.openxmlformats-officedocument.presentationml.presentation", "pptx"
+"application/vnd.openxmlformats-officedocument.presentationml.slide", "sldx"
+"application/vnd.openxmlformats-officedocument.presentationml.slideshow", "ppsx"
+"application/vnd.openxmlformats-officedocument.presentationml.template", "potx"
+"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet", "xlsx"
+"application/vnd.openxmlformats-officedocument.spreadsheetml.template", "xltx"
+"application/vnd.openxmlformats-officedocument.wordprocessingml.document", "docx"
+"application/vnd.openxmlformats-officedocument.wordprocessingml.template", "dotx"
+"application/vnd.osgeo.mapguide.package", "mgp"
+"application/vnd.osgi.dp", "dp"
+"application/vnd.osgi.subsystem", "esa"
+"application/vnd.palm", "pdb"
+"application/vnd.pawaafile", "paw"
+"application/vnd.pg.format", "str"
+"application/vnd.pg.osasli", "ei6"
+"application/vnd.picsel", "efif"
+"application/vnd.pmi.widget", "wg"
+"application/vnd.pocketlearn", "plf"
+"application/vnd.powerbuilder6", "pbd"
+"application/vnd.previewsystems.box", "box"
+"application/vnd.proteus.magazine", "mgz"
+"application/vnd.publishare-delta-tree", "qps"
+"application/vnd.pvi.ptid1", "ptid"
+"application/vnd.quark.quarkxpress", "qxd"
+"application/vnd.realvnc.bed", "bed"
+"application/vnd.recordare.musicxml", "mxl"
+"application/vnd.recordare.musicxml+xml", "musicxml"
+"application/vnd.rig.cryptonote", "cryptonote"
+"application/vnd.rim.cod", "cod"
+"application/vnd.rn-realmedia", "rm"
+"application/vnd.rn-realmedia-vbr", "rmvb"
+"application/vnd.route66.link66+xml", "link66"
+"application/vnd.sailingtracker.track", "st"
+"application/vnd.seemail", "see"
+"application/vnd.sema", "sema"
+"application/vnd.semd", "semd"
+"application/vnd.semf", "semf"
+"application/vnd.shana.informed.formdata", "ifm"
+"application/vnd.shana.informed.formtemplate", "itp"
+"application/vnd.shana.informed.interchange", "iif"
+"application/vnd.shana.informed.package", "ipk"
+"application/vnd.simtech-mindmapper", "twd"
+"application/vnd.smaf", "mmf"
+"application/vnd.smart.teacher", "teacher"
+"application/vnd.solent.sdkm+xml", "sdkm"
+"application/vnd.spotfire.dxp", "dxp"
+"application/vnd.spotfire.sfs", "sfs"
+"application/vnd.stardivision.calc", "sdc"
+"application/vnd.stardivision.draw", "sda"
+"application/vnd.stardivision.impress", "sdd"
+"application/vnd.stardivision.math", "smf"
+"application/vnd.stardivision.writer", "sdw"
+"application/vnd.stardivision.writer-global", "sgl"
+"application/vnd.stepmania.package", "smzip"
+"application/vnd.stepmania.stepchart", "sm"
+"application/vnd.sun.xml.calc", "sxc"
+"application/vnd.sun.xml.calc.template", "stc"
+"application/vnd.sun.xml.draw", "sxd"
+"application/vnd.sun.xml.draw.template", "std"
+"application/vnd.sun.xml.impress", "sxi"
+"application/vnd.sun.xml.impress.template", "sti"
+"application/vnd.sun.xml.math", "sxm"
+"application/vnd.sun.xml.writer", "sxw"
+"application/vnd.sun.xml.writer.global", "sxg"
+"application/vnd.sun.xml.writer.template", "stw"
+"application/vnd.sus-calendar", "sus"
+"application/vnd.svd", "svd"
+"application/vnd.symbian.install", "sis"
+"application/vnd.syncml+xml", "xsm"
+"application/vnd.syncml.dm+wbxml", "bdm"
+"application/vnd.syncml.dm+xml", "xdm"
+"application/vnd.tao.intent-module-archive", "tao"
+"application/vnd.tcpdump.pcap", "pcap"
+"application/vnd.tmobile-livetv", "tmo"
+"application/vnd.trid.tpt", "tpt"
+"application/vnd.triscape.mxs", "mxs"
+"application/vnd.trueapp", "tra"
+"application/vnd.ufdl", "ufd"
+"application/vnd.uiq.theme", "utz"
+"application/vnd.umajin", "umj"
+"application/vnd.unity", "unityweb"
+"application/vnd.uoml+xml", "uoml"
+"application/vnd.vcx", "vcx"
+"application/vnd.visio", "vsd"
+"application/vnd.visionary", "vis"
+"application/vnd.vsf", "vsf"
+"application/vnd.wap.wbxml", "wbxml"
+"application/vnd.wap.wmlc", "wmlc"
+"application/vnd.wap.wmlscriptc", "wmlsc"
+"application/vnd.webturbo", "wtb"
+"application/vnd.wolfram.player", "nbp"
+"application/vnd.wordperfect", "wpd"
+"application/vnd.wqd", "wqd"
+"application/vnd.wt.stf", "stf"
+"application/vnd.xara", "xar"
+"application/vnd.xfdl", "xfdl"
+"application/vnd.yamaha.hv-dic", "hvd"
+"application/vnd.yamaha.hv-script", "hvs"
+"application/vnd.yamaha.hv-voice", "hvp"
+"application/vnd.yamaha.openscoreformat", "osf"
+"application/vnd.yamaha.openscoreformat.osfpvg+xml", "osfpvg"
+"application/vnd.yamaha.smaf-audio", "saf"
+"application/vnd.yamaha.smaf-phrase", "spf"
+"application/vnd.yellowriver-custom-menu", "cmp"
+"application/vnd.zul", "zir"
+"application/vnd.zzazz.deck+xml", "zaz"
+"application/voicexml+xml", "vxml"
+"application/widget", "wgt"
+"application/winhlp", "hlp"
+"application/wsdl+xml", "wsdl"
+"application/wspolicy+xml", "wspolicy"
+"application/x-7z-compressed", "7z"
+"application/x-abiword", "abw"
+"application/x-ace-compressed", "ace"
+"application/x-apple-diskimage", "dmg"
+"application/x-authorware-bin", "aab"
+"application/x-authorware-map", "aam"
+"application/x-authorware-seg", "aas"
+"application/x-bcpio", "bcpio"
+"application/x-bittorrent", "torrent"
+"application/x-blorb", "blb"
+"application/x-bzip", "bz"
+"application/x-bzip2", "bz2"
+"application/x-cbr", "cbr"
+"application/x-cdlink", "vcd"
+"application/x-cfs-compressed", "cfs"
+"application/x-chat", "chat"
+"application/x-chess-pgn", "pgn"
+"application/x-conference", "nsc"
+"application/x-cpio", "cpio"
+"application/x-csh", "csh"
+"application/x-debian-package", "deb"
+"application/x-dgc-compressed", "dgc"
+"application/x-director", "dir"
+"application/x-doom", "wad"
+"application/x-dtbncx+xml", "ncx"
+"application/x-dtbook+xml", "dtb"
+"application/x-dtbresource+xml", "res"
+"application/x-dvi", "dvi"
+"application/x-envoy", "evy"
+"application/x-eva", "eva"
+"application/x-font-bdf", "bdf"
+"application/x-font-ghostscript", "gsf"
+"application/x-font-linux-psf", "psf"
+"application/x-font-otf", "otf"
+"application/x-font-pcf", "pcf"
+"application/x-font-snf", "snf"
+"application/x-font-ttf", "ttf"
+"application/x-font-type1", "pfa"
+"application/x-font-woff", "woff"
+"application/x-freearc", "arc"
+"application/x-futuresplash", "spl"
+"application/x-gca-compressed", "gca"
+"application/x-glulx", "ulx"
+"application/x-gnumeric", "gnumeric"
+"application/x-gramps-xml", "gramps"
+"application/x-gtar", "gtar"
+"application/x-hdf", "hdf"
+"application/x-install-instructions", "install"
+"application/x-iso9660-image", "iso"
+"application/x-java-jnlp-file", "jnlp"
+"application/x-latex", "latex"
+"application/x-lzh-compressed", "lzh"
+"application/x-mie", "mie"
+"application/x-mobipocket-ebook", "prc"
+"application/x-ms-application", "application"
+"application/x-ms-shortcut", "lnk"
+"application/x-ms-wmd", "wmd"
+"application/x-ms-wmz", "wmz"
+"application/x-ms-xbap", "xbap"
+"application/x-msaccess", "mdb"
+"application/x-msbinder", "obd"
+"application/x-mscardfile", "crd"
+"application/x-msclip", "clp"
+"application/x-msdownload", "exe"
+"application/x-msmediaview", "mvb"
+"application/x-msmetafile", "wmf"
+"application/x-msmoney", "mny"
+"application/x-mspublisher", "pub"
+"application/x-msschedule", "scd"
+"application/x-msterminal", "trm"
+"application/x-mswrite", "wri"
+"application/x-netcdf", "nc"
+"application/x-nzb", "nzb"
+"application/x-pkcs12", "p12"
+"application/x-pkcs7-certificates", "p7b"
+"application/x-pkcs7-certreqresp", "p7r"
+"application/x-rar-compressed", "rar"
+"application/x-research-info-systems", "ris"
+"application/x-sh", "sh"
+"application/x-shar", "shar"
+"application/x-shockwave-flash", "swf"
+"application/x-silverlight-app", "xap"
+"application/x-sql", "sql"
+"application/x-stuffit", "sit"
+"application/x-stuffitx", "sitx"
+"application/x-subrip", "srt"
+"application/x-sv4cpio", "sv4cpio"
+"application/x-sv4crc", "sv4crc"
+"application/x-t3vm-image", "t3"
+"application/x-tads", "gam"
+"application/x-tar", "tar"
+"application/x-tcl", "tcl"
+"application/x-tex", "tex"
+"application/x-tex-tfm", "tfm"
+"application/x-texinfo", "texinfo"
+"application/x-tgif", "obj"
+"application/x-tgsticker", "tgs"
+"application/x-ustar", "ustar"
+"application/x-wais-source", "src"
+"application/x-x509-ca-cert", "der"
+"application/x-xfig", "fig"
+"application/x-xliff+xml", "xlf"
+"application/x-xpinstall", "xpi"
+"application/x-xz", "xz"
+"application/x-zmachine", "z1"
+"application/xaml+xml", "xaml"
+"application/xcap-diff+xml", "xdf"
+"application/xenc+xml", "xenc"
+"application/xhtml+xml", "xhtml"
+"application/xml", "xml"
+"application/xml-dtd", "dtd"
+"application/xop+xml", "xop"
+"application/xproc+xml", "xpl"
+"application/xslt+xml", "xslt"
+"application/xspf+xml", "xspf"
+"application/xv+xml", "mxml"
+"application/yang", "yang"
+"application/yin+xml", "yin"
+"application/zip", "zip"
+"audio/adpcm", "adp"
+"audio/basic", "au"
+"audio/midi", "midi"
+"audio/mp4", "m4a"
+"audio/mpeg", "mp3"
+"audio/ogg", "oga"
+"audio/s3m", "s3m"
+"audio/silk", "sil"
+"audio/vnd.dece.audio", "uva"
+"audio/vnd.digital-winds", "eol"
+"audio/vnd.dra", "dra"
+"audio/vnd.dts", "dts"
+"audio/vnd.dts.hd", "dtshd"
+"audio/vnd.lucent.voice", "lvp"
+"audio/vnd.ms-playready.media.pya", "pya"
+"audio/vnd.nuera.ecelp4800", "ecelp4800"
+"audio/vnd.nuera.ecelp7470", "ecelp7470"
+"audio/vnd.nuera.ecelp9600", "ecelp9600"
+"audio/vnd.rip", "rip"
+"audio/webm", "weba"
+"audio/x-aac", "aac"
+"audio/x-aiff", "aif"
+"audio/x-caf", "caf"
+"audio/x-flac", "flac"
+"audio/x-matroska", "mka"
+"audio/x-mpegurl", "m3u"
+"audio/x-ms-wax", "wax"
+"audio/x-ms-wma", "wma"
+"audio/x-pn-realaudio", "ram"
+"audio/x-pn-realaudio-plugin", "rmp"
+"audio/x-wav", "wav"
+"audio/xm", "xm"
+"chemical/x-cdx", "cdx"
+"chemical/x-cif", "cif"
+"chemical/x-cmdf", "cmdf"
+"chemical/x-cml", "cml"
+"chemical/x-csml", "csml"
+"chemical/x-xyz", "xyz"
+"font/collection", "ttc"
+"font/otf", "otf"
+"font/ttf", "ttf"
+"font/woff", "woff"
+"font/woff2", "woff2"
+"image/bmp", "bmp"
+"image/cgm", "cgm"
+"image/g3fax", "g3"
+"image/gif", "gif"
+"image/heic", "heic"
+"image/heic-sequence", "heics"
+"image/heif", "heif"
+"image/heif-sequence", "heifs"
+"image/ief", "ief"
+"image/jpeg", "jpg"
+"image/ktx", "ktx"
+"image/png", "png"
+"image/prs.btif", "btif"
+"image/sgi", "sgi"
+"image/svg+xml", "svg"
+"image/tiff", "tiff"
+"image/vnd.adobe.photoshop", "psd"
+"image/vnd.dece.graphic", "uvi"
+"image/vnd.djvu", "djvu"
+"image/vnd.dvb.subtitle", "sub"
+"image/vnd.dwg", "dwg"
+"image/vnd.dxf", "dxf"
+"image/vnd.fastbidsheet", "fbs"
+"image/vnd.fpx", "fpx"
+"image/vnd.fst", "fst"
+"image/vnd.fujixerox.edmics-mmr", "mmr"
+"image/vnd.fujixerox.edmics-rlc", "rlc"
+"image/vnd.ms-modi", "mdi"
+"image/vnd.ms-photo", "wdp"
+"image/vnd.net-fpx", "npx"
+"image/vnd.wap.wbmp", "wbmp"
+"image/vnd.xiff", "xif"
+"image/webp", "webp"
+"image/x-3ds", "3ds"
+"image/x-cmu-raster", "ras"
+"image/x-cmx", "cmx"
+"image/x-freehand", "fh"
+"image/x-icon", "ico"
+"image/x-mrsid-image", "sid"
+"image/x-pcx", "pcx"
+"image/x-pict", "pic"
+"image/x-portable-anymap", "pnm"
+"image/x-portable-bitmap", "pbm"
+"image/x-portable-graymap", "pgm"
+"image/x-portable-pixmap", "ppm"
+"image/x-rgb", "rgb"
+"image/x-tga", "tga"
+"image/x-xbitmap", "xbm"
+"image/x-xpixmap", "xpm"
+"image/x-xwindowdump", "xwd"
+"message/rfc822", "eml"
+"model/iges", "igs"
+"model/mesh", "msh"
+"model/vnd.collada+xml", "dae"
+"model/vnd.dwf", "dwf"
+"model/vnd.gdl", "gdl"
+"model/vnd.gtw", "gtw"
+"model/vnd.mts", "mts"
+"model/vnd.vtu", "vtu"
+"model/vrml", "wrl"
+"model/x3d+binary", "x3db"
+"model/x3d+vrml", "x3dv"
+"model/x3d+xml", "x3d"
+"text/cache-manifest", "appcache"
+"text/calendar", "ics"
+"text/css", "css"
+"text/csv", "csv"
+"text/html", "html"
+"text/n3", "n3"
+"text/plain", "txt"
+"text/prs.lines.tag", "dsc"
+"text/richtext", "rtx"
+"text/sgml", "sgml"
+"text/tab-separated-values", "tsv"
+"text/troff", "t"
+"text/turtle", "ttl"
+"text/uri-list", "uri"
+"text/vcard", "vcard"
+"text/vnd.curl", "curl"
+"text/vnd.curl.dcurl", "dcurl"
+"text/vnd.curl.mcurl", "mcurl"
+"text/vnd.curl.scurl", "scurl"
+"text/vnd.dvb.subtitle", "sub"
+"text/vnd.fly", "fly"
+"text/vnd.fmi.flexstor", "flx"
+"text/vnd.graphviz", "gv"
+"text/vnd.in3d.3dml", "3dml"
+"text/vnd.in3d.spot", "spot"
+"text/vnd.sun.j2me.app-descriptor", "jad"
+"text/vnd.wap.wml", "wml"
+"text/vnd.wap.wmlscript", "wmls"
+"text/x-asm", "asm"
+"text/x-c", "c"
+"text/x-fortran", "f"
+"text/x-java-source", "java"
+"text/x-nfo", "nfo"
+"text/x-opml", "opml"
+"text/x-pascal", "pas"
+"text/x-php", "php"
+"text/x-setext", "etx"
+"text/x-sfv", "sfv"
+"text/x-uuencode", "uu"
+"text/x-vcalendar", "vcs"
+"text/x-vcard", "vcf"
+"video/3gpp", "3gp"
+"video/3gpp2", "3g2"
+"video/h261", "h261"
+"video/h263", "h263"
+"video/h264", "h264"
+"video/h265", "h265"
+"video/jpeg", "jpgv"
+"video/jpm", "jpm"
+"video/mj2", "mj2"
+"video/mp4", "mp4"
+"video/mpeg", "mpeg"
+"video/ogg", "ogv"
+"video/quicktime", "mov"
+"video/vnd.dece.hd", "uvh"
+"video/vnd.dece.mobile", "uvm"
+"video/vnd.dece.pd", "uvp"
+"video/vnd.dece.sd", "uvs"
+"video/vnd.dece.video", "uvv"
+"video/vnd.dvb.file", "dvb"
+"video/vnd.fvt", "fvt"
+"video/vnd.mpegurl", "mxu"
+"video/vnd.ms-playready.media.pyv", "pyv"
+"video/vnd.uvvu.mp4", "uvu"
+"video/vnd.vivo", "viv"
+"video/webm", "webm"
+"video/x-f4v", "f4v"
+"video/x-fli", "fli"
+"video/x-flv", "flv"
+"video/x-m4v", "m4v"
+"video/x-matroska", "mkv"
+"video/x-mng", "mng"
+"video/x-ms-asf", "asf"
+"video/x-ms-vob", "vob"
+"video/x-ms-wm", "wm"
+"video/x-ms-wmv", "wmv"
+"video/x-ms-wmx", "wmx"
+"video/x-ms-wvx", "wvx"
+"video/x-msvideo", "avi"
+"video/x-sgi-movie", "movie"
+"video/x-smv", "smv"
+"x-conference/x-cooltalk", "ice"
+%%
+const char *mime_type_to_extension(const char *mime_type, size_t mime_type_len) {
+  const auto &result = search_mime_type(mime_type, mime_type_len);
+  if (result == nullptr) {
+    return nullptr;
+  }
+
+  return result->extension;
+}
diff --git a/submodules/ton/tonlib-src/tdutils/generate/generate_mime_types_gperf.cpp b/submodules/ton/tonlib-src/tdutils/generate/generate_mime_types_gperf.cpp
new file mode 100644
index 0000000000..9048e024a5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/generate/generate_mime_types_gperf.cpp
@@ -0,0 +1,177 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <algorithm>
+#include <cassert>
+#include <cstddef>
+#include <fstream>
+#include <iostream>
+#include <map>
+#include <string>
+#include <tuple>
+#include <utility>
+#include <vector>
+
+static std::pair<std::string, std::string> split(std::string s, char delimiter = ' ') {
+  auto delimiter_pos = s.find(delimiter);
+  if (delimiter_pos == std::string::npos) {
+    return {std::move(s), ""};
+  } else {
+    auto head = s.substr(0, delimiter_pos);
+    auto tail = s.substr(delimiter_pos + 1);
+    return {head, tail};
+  }
+}
+
+static bool generate(const char *file_name, const char *from_name, const char *to_name,
+                     const std::map<std::string, std::string> &map) {
+  // binary mode is needed for MSYS2 gperf
+  std::ofstream out(file_name, std::ios_base::trunc | std::ios_base::binary);
+  if (!out) {
+    std::cerr << "Can't open output file \"" << file_name << std::endl;
+    return false;
+  }
+
+  out << "%struct-type\n";
+  out << "%ignore-case\n";
+  out << "%language=ANSI-C\n";
+  out << "%readonly-tables\n";
+  out << "%includes\n";
+  out << "%enum\n";
+  out << "%define slot-name " << from_name << "\n";
+  out << "%define initializer-suffix ,nullptr\n";
+  out << "%define slot-name " << from_name << "\n";
+  out << "%define hash-function-name " << from_name << "_hash\n";
+  out << "%define lookup-function-name search_" << from_name << "\n";
+  //  out << "%define class-name " << from_name << "_to_" << to_name << "\n";
+  out << "struct " << from_name << "_and_" << to_name << " {\n";
+  out << "  const char *" << from_name << ";\n";
+  out << "  const char *" << to_name << ";\n";
+  out << "}\n";
+  out << "%%\n";
+
+  for (auto &value : map) {
+    out << '"' << value.first << "\", \"" << value.second << '"' << "\n";
+  }
+
+  out << "%%\n";
+  out << "const char *" << from_name << "_to_" << to_name << "(const char *" << from_name << ", size_t " << from_name
+      << "_len) {\n";
+  out << "  const auto &result = search_" << from_name << "(" << from_name << ", " << from_name << "_len);\n";
+  out << "  if (result == nullptr) {\n";
+  out << "    return nullptr;\n";
+  out << "  }\n";
+  out << "\n";
+  out << "  return result->" << to_name << ";\n";
+  out << "}\n";
+
+  return true;
+}
+
+static bool is_private_mime_type(const std::string &mime_type) {
+  return mime_type.find("/x-") != std::string::npos;
+}
+
+int main(int argc, char *argv[]) {
+  if (argc != 4) {
+    std::cerr << "Wrong number of arguments supplied. Expected 'generate_mime_types_gperf <mime_types.txt> "
+                 "<mime_type_to_extension.cpp> <extension_to_mime_type.cpp>'"
+              << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::ifstream mime_types_file(argv[1]);
+  if (!mime_types_file) {
+    std::cerr << "Can't open input file \"" << argv[1] << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::map<std::string, std::string> mime_type_to_extension;
+  std::map<std::string, std::string> extension_to_mime_type;
+
+  std::string line;
+  while (std::getline(mime_types_file, line)) {
+    while (!line.empty() && (line.back() == '\r' || line.back() == '\n')) {
+      line.pop_back();
+    }
+
+    std::string mime_type;
+    std::string extensions_string;
+    std::tie(mime_type, extensions_string) = split(line, '\t');
+
+    if (mime_type.empty()) {
+      std::cerr << "Wrong MIME type description \"" << line << "\"" << std::endl;
+      continue;
+    }
+
+    auto extensions_start_position = extensions_string.find_first_not_of(" \t");
+    if (extensions_start_position == std::string::npos) {
+      std::cerr << "Wrong MIME type description \"" << line << "\"" << std::endl;
+      continue;
+    }
+    extensions_string = extensions_string.substr(extensions_start_position);
+
+    std::vector<std::string> extensions;
+    while (!extensions_string.empty()) {
+      extensions.push_back("");
+      std::tie(extensions.back(), extensions_string) = split(extensions_string);
+    }
+    assert(!extensions.empty());
+
+    std::map<std::string, std::string> preffered_extensions{{"image/jpeg", "jpg"},  {"audio/mpeg", "mp3"},
+                                                            {"audio/midi", "midi"}, {"text/x-pascal", "pas"},
+                                                            {"text/x-asm", "asm"},  {"video/quicktime", "mov"}};
+    std::size_t index = 0;
+    if (preffered_extensions.count(mime_type) != 0) {
+      index = std::find(extensions.begin(), extensions.end(), preffered_extensions[mime_type]) - extensions.begin();
+      assert(index < extensions.size());
+    }
+    if (mime_type_to_extension.emplace_hint(mime_type_to_extension.end(), mime_type, extensions[index])->second !=
+        extensions[index]) {
+      std::cerr << "MIME type \"" << mime_type << "\" has more than one extensions list" << std::endl;
+    }
+
+    for (auto &extension : extensions) {
+      if (!extension_to_mime_type.emplace(extension, mime_type).second) {
+        if (is_private_mime_type(extension_to_mime_type[extension]) == is_private_mime_type(mime_type)) {
+          std::cerr << "Extension \"" << extension << "\" matches more than one type" << std::endl;
+        } else {
+          if (!is_private_mime_type(mime_type)) {
+            extension_to_mime_type[extension] = mime_type;
+          }
+        }
+      }
+    }
+  }
+
+  if (!generate(argv[2], "mime_type", "extension", mime_type_to_extension)) {
+    return EXIT_FAILURE;
+  }
+  if (!generate(argv[3], "extension", "mime_type", extension_to_mime_type)) {
+    return EXIT_FAILURE;
+  }
+}
diff --git a/submodules/ton/tonlib-src/tdutils/generate/mime_types.txt b/submodules/ton/tonlib-src/tdutils/generate/mime_types.txt
new file mode 100644
index 0000000000..cc1fb5e344
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/generate/mime_types.txt
@@ -0,0 +1,777 @@
+application/andrew-inset			ez
+application/applixware				aw
+application/atom+xml				atom
+application/atomcat+xml				atomcat
+application/atomsvc+xml				atomsvc
+application/ccxml+xml				ccxml
+application/cdmi-capability			cdmia
+application/cdmi-container			cdmic
+application/cdmi-domain				cdmid
+application/cdmi-object				cdmio
+application/cdmi-queue				cdmiq
+application/cu-seeme				cu
+application/davmount+xml			davmount
+application/docbook+xml				dbk
+application/dssc+der				dssc
+application/dssc+xml				xdssc
+application/ecmascript				es
+application/emma+xml				emma
+application/epub+zip				epub
+application/exi					exi
+application/font-tdpfr				pfr
+application/gml+xml				gml
+application/gpx+xml				gpx
+application/gxf					gxf
+application/hyperstudio				stk
+application/inkml+xml				ink inkml
+application/ipfix				ipfix
+application/java-archive			jar
+application/java-serialized-object		ser
+application/java-vm				class
+application/javascript				js
+application/json				json
+application/jsonml+json				jsonml
+application/lost+xml				lostxml
+application/mac-binhex40			hqx
+application/mac-compactpro			cpt
+application/mads+xml				mads
+application/marc				mrc
+application/marcxml+xml				mrcx
+application/mathematica				ma nb mb
+application/mathml+xml				mathml
+application/mbox				mbox
+application/mediaservercontrol+xml		mscml
+application/metalink+xml			metalink
+application/metalink4+xml			meta4
+application/mets+xml				mets
+application/mods+xml				mods
+application/mp21				m21 mp21
+application/mp4					mp4s
+application/msword				doc dot
+application/mxf					mxf
+application/octet-stream	bin dms lrf mar so dist distz pkg bpk dump elc deploy
+application/oda					oda
+application/oebps-package+xml			opf
+application/ogg					ogx
+application/omdoc+xml				omdoc
+application/onenote				onetoc onetoc2 onetmp onepkg
+application/oxps				oxps
+application/patch-ops-error+xml			xer
+application/pdf					pdf
+application/pgp-encrypted			pgp
+application/pgp-signature			asc sig
+application/pics-rules				prf
+application/pkcs10				p10
+application/pkcs7-mime				p7m p7c
+application/pkcs7-signature			p7s
+application/pkcs8				p8
+application/pkix-attr-cert			ac
+application/pkix-cert				cer
+application/pkix-crl				crl
+application/pkix-pkipath			pkipath
+application/pkixcmp				pki
+application/pls+xml				pls
+application/postscript				ai eps ps
+application/prs.cww				cww
+application/pskc+xml				pskcxml
+application/rdf+xml				rdf
+application/reginfo+xml				rif
+application/relax-ng-compact-syntax		rnc
+application/resource-lists+xml			rl
+application/resource-lists-diff+xml		rld
+application/rls-services+xml			rs
+application/rpki-ghostbusters			gbr
+application/rpki-manifest			mft
+application/rpki-roa				roa
+application/rsd+xml				rsd
+application/rss+xml				rss
+application/rtf					rtf
+application/sbml+xml				sbml
+application/scvp-cv-request			scq
+application/scvp-cv-response			scs
+application/scvp-vp-request			spq
+application/scvp-vp-response			spp
+application/sdp					sdp
+application/set-payment-initiation		setpay
+application/set-registration-initiation		setreg
+application/shf+xml				shf
+application/smil+xml				smi smil
+application/sparql-query			rq
+application/sparql-results+xml			srx
+application/srgs				gram
+application/srgs+xml				grxml
+application/sru+xml				sru
+application/ssdl+xml				ssdl
+application/ssml+xml				ssml
+application/tei+xml				tei teicorpus
+application/thraud+xml				tfi
+application/timestamped-data			tsd
+application/vnd.3gpp.pic-bw-large		plb
+application/vnd.3gpp.pic-bw-small		psb
+application/vnd.3gpp.pic-bw-var			pvb
+application/vnd.3gpp2.tcap			tcap
+application/vnd.3m.post-it-notes		pwn
+application/vnd.accpac.simply.aso		aso
+application/vnd.accpac.simply.imp		imp
+application/vnd.acucobol			acu
+application/vnd.acucorp				atc acutc
+application/vnd.adobe.air-application-installer-package+zip	air
+application/vnd.adobe.formscentral.fcdt		fcdt
+application/vnd.adobe.fxp			fxp fxpl
+application/vnd.adobe.xdp+xml			xdp
+application/vnd.adobe.xfdf			xfdf
+application/vnd.ahead.space			ahead
+application/vnd.airzip.filesecure.azf		azf
+application/vnd.airzip.filesecure.azs		azs
+application/vnd.amazon.ebook			azw
+application/vnd.americandynamics.acc		acc
+application/vnd.amiga.ami			ami
+application/vnd.android.package-archive		apk
+application/vnd.anser-web-certificate-issue-initiation	cii
+application/vnd.anser-web-funds-transfer-initiation	fti
+application/vnd.antix.game-component		atx
+application/vnd.apple.installer+xml		mpkg
+application/vnd.apple.mpegurl			m3u8
+application/vnd.aristanetworks.swi		swi
+application/vnd.astraea-software.iota		iota
+application/vnd.audiograph			aep
+application/vnd.blueice.multipass		mpm
+application/vnd.bmi				bmi
+application/vnd.businessobjects			rep
+application/vnd.chemdraw+xml			cdxml
+application/vnd.chipnuts.karaoke-mmd		mmd
+application/vnd.cinderella			cdy
+application/vnd.claymore			cla
+application/vnd.cloanto.rp9			rp9
+application/vnd.clonk.c4group			c4g c4d c4f c4p c4u
+application/vnd.cluetrust.cartomobile-config		c11amc
+application/vnd.cluetrust.cartomobile-config-pkg	c11amz
+application/vnd.commonspace			csp
+application/vnd.contact.cmsg			cdbcmsg
+application/vnd.cosmocaller			cmc
+application/vnd.crick.clicker			clkx
+application/vnd.crick.clicker.keyboard		clkk
+application/vnd.crick.clicker.palette		clkp
+application/vnd.crick.clicker.template		clkt
+application/vnd.crick.clicker.wordbank		clkw
+application/vnd.criticaltools.wbs+xml		wbs
+application/vnd.ctc-posml			pml
+application/vnd.cups-ppd			ppd
+application/vnd.curl.car			car
+application/vnd.curl.pcurl			pcurl
+application/vnd.dart				dart
+application/vnd.data-vision.rdz			rdz
+application/vnd.dece.data			uvf uvvf uvd uvvd
+application/vnd.dece.ttml+xml			uvt uvvt
+application/vnd.dece.unspecified		uvx uvvx
+application/vnd.dece.zip			uvz uvvz
+application/vnd.denovo.fcselayout-link		fe_launch
+application/vnd.dna				dna
+application/vnd.dolby.mlp			mlp
+application/vnd.dpgraph				dpg
+application/vnd.dreamfactory			dfac
+application/vnd.ds-keypoint			kpxx
+application/vnd.dvb.ait				ait
+application/vnd.dvb.service			svc
+application/vnd.dynageo				geo
+application/vnd.ecowin.chart			mag
+application/vnd.enliven				nml
+application/vnd.epson.esf			esf
+application/vnd.epson.msf			msf
+application/vnd.epson.quickanime		qam
+application/vnd.epson.salt			slt
+application/vnd.epson.ssf			ssf
+application/vnd.eszigno3+xml			es3 et3
+application/vnd.ezpix-album			ez2
+application/vnd.ezpix-package			ez3
+application/vnd.fdf				fdf
+application/vnd.fdsn.mseed			mseed
+application/vnd.fdsn.seed			seed dataless
+application/vnd.flographit			gph
+application/vnd.fluxtime.clip			ftc
+application/vnd.framemaker			fm frame maker book
+application/vnd.frogans.fnc			fnc
+application/vnd.frogans.ltf			ltf
+application/vnd.fsc.weblaunch			fsc
+application/vnd.fujitsu.oasys			oas
+application/vnd.fujitsu.oasys2			oa2
+application/vnd.fujitsu.oasys3			oa3
+application/vnd.fujitsu.oasysgp			fg5
+application/vnd.fujitsu.oasysprs		bh2
+application/vnd.fujixerox.ddd			ddd
+application/vnd.fujixerox.docuworks		xdw
+application/vnd.fujixerox.docuworks.binder	xbd
+application/vnd.fuzzysheet			fzs
+application/vnd.genomatix.tuxedo		txd
+application/vnd.geogebra.file			ggb
+application/vnd.geogebra.tool			ggt
+application/vnd.geometry-explorer		gex gre
+application/vnd.geonext				gxt
+application/vnd.geoplan				g2w
+application/vnd.geospace			g3w
+application/vnd.gmx				gmx
+application/vnd.google-earth.kml+xml		kml
+application/vnd.google-earth.kmz		kmz
+application/vnd.grafeq				gqf gqs
+application/vnd.groove-account			gac
+application/vnd.groove-help			ghf
+application/vnd.groove-identity-message		gim
+application/vnd.groove-injector			grv
+application/vnd.groove-tool-message		gtm
+application/vnd.groove-tool-template		tpl
+application/vnd.groove-vcard			vcg
+application/vnd.hal+xml				hal
+application/vnd.handheld-entertainment+xml	zmm
+application/vnd.hbci				hbci
+application/vnd.hhe.lesson-player		les
+application/vnd.hp-hpgl				hpgl
+application/vnd.hp-hpid				hpid
+application/vnd.hp-hps				hps
+application/vnd.hp-jlyt				jlt
+application/vnd.hp-pcl				pcl
+application/vnd.hp-pclxl			pclxl
+application/vnd.hydrostatix.sof-data		sfd-hdstx
+application/vnd.ibm.minipay			mpy
+application/vnd.ibm.modcap			afp listafp list3820
+application/vnd.ibm.rights-management		irm
+application/vnd.ibm.secure-container		sc
+application/vnd.iccprofile			icc icm
+application/vnd.igloader			igl
+application/vnd.immervision-ivp			ivp
+application/vnd.immervision-ivu			ivu
+application/vnd.insors.igm			igm
+application/vnd.intercon.formnet		xpw xpx
+application/vnd.intergeo			i2g
+application/vnd.intu.qbo			qbo
+application/vnd.intu.qfx			qfx
+application/vnd.ipunplugged.rcprofile		rcprofile
+application/vnd.irepository.package+xml		irp
+application/vnd.is-xpr				xpr
+application/vnd.isac.fcs			fcs
+application/vnd.jam				jam
+application/vnd.jcp.javame.midlet-rms		rms
+application/vnd.jisp				jisp
+application/vnd.joost.joda-archive		joda
+application/vnd.kahootz				ktz ktr
+application/vnd.kde.karbon			karbon
+application/vnd.kde.kchart			chrt
+application/vnd.kde.kformula			kfo
+application/vnd.kde.kivio			flw
+application/vnd.kde.kontour			kon
+application/vnd.kde.kpresenter			kpr kpt
+application/vnd.kde.kspread			ksp
+application/vnd.kde.kword			kwd kwt
+application/vnd.kenameaapp			htke
+application/vnd.kidspiration			kia
+application/vnd.kinar				kne knp
+application/vnd.koan				skp skd skt skm
+application/vnd.kodak-descriptor		sse
+application/vnd.las.las+xml			lasxml
+application/vnd.llamagraphics.life-balance.desktop	lbd
+application/vnd.llamagraphics.life-balance.exchange+xml	lbe
+application/vnd.lotus-1-2-3			123
+application/vnd.lotus-approach			apr
+application/vnd.lotus-freelance			pre
+application/vnd.lotus-notes			nsf
+application/vnd.lotus-organizer			org
+application/vnd.lotus-screencam			scm
+application/vnd.lotus-wordpro			lwp
+application/vnd.macports.portpkg		portpkg
+application/vnd.mcd				mcd
+application/vnd.medcalcdata			mc1
+application/vnd.mediastation.cdkey		cdkey
+application/vnd.mfer				mwf
+application/vnd.mfmp				mfm
+application/vnd.micrografx.flo			flo
+application/vnd.micrografx.igx			igx
+application/vnd.mif				mif
+application/vnd.mobius.daf			daf
+application/vnd.mobius.dis			dis
+application/vnd.mobius.mbk			mbk
+application/vnd.mobius.mqy			mqy
+application/vnd.mobius.msl			msl
+application/vnd.mobius.plc			plc
+application/vnd.mobius.txf			txf
+application/vnd.mophun.application		mpn
+application/vnd.mophun.certificate		mpc
+application/vnd.mozilla.xul+xml			xul
+application/vnd.ms-artgalry			cil
+application/vnd.ms-cab-compressed		cab
+application/vnd.ms-excel			xls xlm xla xlc xlt xlw
+application/vnd.ms-excel.addin.macroenabled.12		xlam
+application/vnd.ms-excel.sheet.binary.macroenabled.12	xlsb
+application/vnd.ms-excel.sheet.macroenabled.12		xlsm
+application/vnd.ms-excel.template.macroenabled.12	xltm
+application/vnd.ms-fontobject			eot
+application/vnd.ms-htmlhelp			chm
+application/vnd.ms-ims				ims
+application/vnd.ms-lrm				lrm
+application/vnd.ms-officetheme			thmx
+application/vnd.ms-pki.seccat			cat
+application/vnd.ms-pki.stl			stl
+application/vnd.ms-powerpoint			ppt pps pot
+application/vnd.ms-powerpoint.addin.macroenabled.12		ppam
+application/vnd.ms-powerpoint.presentation.macroenabled.12	pptm
+application/vnd.ms-powerpoint.slide.macroenabled.12		sldm
+application/vnd.ms-powerpoint.slideshow.macroenabled.12		ppsm
+application/vnd.ms-powerpoint.template.macroenabled.12		potm
+application/vnd.ms-project			mpp mpt
+application/vnd.ms-word.document.macroenabled.12	docm
+application/vnd.ms-word.template.macroenabled.12	dotm
+application/vnd.ms-works			wps wks wcm wdb
+application/vnd.ms-wpl				wpl
+application/vnd.ms-xpsdocument			xps
+application/vnd.mseq				mseq
+application/vnd.musician			mus
+application/vnd.muvee.style			msty
+application/vnd.mynfc				taglet
+application/vnd.neurolanguage.nlu		nlu
+application/vnd.nitf				ntf nitf
+application/vnd.noblenet-directory		nnd
+application/vnd.noblenet-sealer			nns
+application/vnd.noblenet-web			nnw
+application/vnd.nokia.n-gage.data		ngdat
+application/vnd.nokia.n-gage.symbian.install	n-gage
+application/vnd.nokia.radio-preset		rpst
+application/vnd.nokia.radio-presets		rpss
+application/vnd.novadigm.edm			edm
+application/vnd.novadigm.edx			edx
+application/vnd.novadigm.ext			ext
+application/vnd.oasis.opendocument.chart		odc
+application/vnd.oasis.opendocument.chart-template	otc
+application/vnd.oasis.opendocument.database		odb
+application/vnd.oasis.opendocument.formula		odf
+application/vnd.oasis.opendocument.formula-template	odft
+application/vnd.oasis.opendocument.graphics		odg
+application/vnd.oasis.opendocument.graphics-template	otg
+application/vnd.oasis.opendocument.image		odi
+application/vnd.oasis.opendocument.image-template	oti
+application/vnd.oasis.opendocument.presentation		odp
+application/vnd.oasis.opendocument.presentation-template	otp
+application/vnd.oasis.opendocument.spreadsheet		ods
+application/vnd.oasis.opendocument.spreadsheet-template	ots
+application/vnd.oasis.opendocument.text			odt
+application/vnd.oasis.opendocument.text-master		odm
+application/vnd.oasis.opendocument.text-template	ott
+application/vnd.oasis.opendocument.text-web		oth
+application/vnd.olpc-sugar			xo
+application/vnd.oma.dd2+xml			dd2
+application/vnd.openofficeorg.extension		oxt
+application/vnd.openxmlformats-officedocument.presentationml.presentation	pptx
+application/vnd.openxmlformats-officedocument.presentationml.slide	sldx
+application/vnd.openxmlformats-officedocument.presentationml.slideshow	ppsx
+application/vnd.openxmlformats-officedocument.presentationml.template	potx
+application/vnd.openxmlformats-officedocument.spreadsheetml.sheet	xlsx
+application/vnd.openxmlformats-officedocument.spreadsheetml.template	xltx
+application/vnd.openxmlformats-officedocument.wordprocessingml.document	docx
+application/vnd.openxmlformats-officedocument.wordprocessingml.template	dotx
+application/vnd.osgeo.mapguide.package		mgp
+application/vnd.osgi.dp				dp
+application/vnd.osgi.subsystem			esa
+application/vnd.palm				pdb pqa oprc
+application/vnd.pawaafile			paw
+application/vnd.pg.format			str
+application/vnd.pg.osasli			ei6
+application/vnd.picsel				efif
+application/vnd.pmi.widget			wg
+application/vnd.pocketlearn			plf
+application/vnd.powerbuilder6			pbd
+application/vnd.previewsystems.box		box
+application/vnd.proteus.magazine		mgz
+application/vnd.publishare-delta-tree		qps
+application/vnd.pvi.ptid1			ptid
+application/vnd.quark.quarkxpress		qxd qxt qwd qwt qxl qxb
+application/vnd.realvnc.bed			bed
+application/vnd.recordare.musicxml		mxl
+application/vnd.recordare.musicxml+xml		musicxml
+application/vnd.rig.cryptonote			cryptonote
+application/vnd.rim.cod				cod
+application/vnd.rn-realmedia			rm
+application/vnd.rn-realmedia-vbr		rmvb
+application/vnd.route66.link66+xml		link66
+application/vnd.sailingtracker.track		st
+application/vnd.seemail				see
+application/vnd.sema				sema
+application/vnd.semd				semd
+application/vnd.semf				semf
+application/vnd.shana.informed.formdata		ifm
+application/vnd.shana.informed.formtemplate	itp
+application/vnd.shana.informed.interchange	iif
+application/vnd.shana.informed.package		ipk
+application/vnd.simtech-mindmapper		twd twds
+application/vnd.smaf				mmf
+application/vnd.smart.teacher			teacher
+application/vnd.solent.sdkm+xml			sdkm sdkd
+application/vnd.spotfire.dxp			dxp
+application/vnd.spotfire.sfs			sfs
+application/vnd.stardivision.calc		sdc
+application/vnd.stardivision.draw		sda
+application/vnd.stardivision.impress		sdd
+application/vnd.stardivision.math		smf
+application/vnd.stardivision.writer		sdw vor
+application/vnd.stardivision.writer-global	sgl
+application/vnd.stepmania.package		smzip
+application/vnd.stepmania.stepchart		sm
+application/vnd.sun.xml.calc			sxc
+application/vnd.sun.xml.calc.template		stc
+application/vnd.sun.xml.draw			sxd
+application/vnd.sun.xml.draw.template		std
+application/vnd.sun.xml.impress			sxi
+application/vnd.sun.xml.impress.template	sti
+application/vnd.sun.xml.math			sxm
+application/vnd.sun.xml.writer			sxw
+application/vnd.sun.xml.writer.global		sxg
+application/vnd.sun.xml.writer.template		stw
+application/vnd.sus-calendar			sus susp
+application/vnd.svd				svd
+application/vnd.symbian.install			sis sisx
+application/vnd.syncml+xml			xsm
+application/vnd.syncml.dm+wbxml			bdm
+application/vnd.syncml.dm+xml			xdm
+application/vnd.tao.intent-module-archive	tao
+application/vnd.tcpdump.pcap			pcap cap dmp
+application/vnd.tmobile-livetv			tmo
+application/vnd.trid.tpt			tpt
+application/vnd.triscape.mxs			mxs
+application/vnd.trueapp				tra
+application/vnd.ufdl				ufd ufdl
+application/vnd.uiq.theme			utz
+application/vnd.umajin				umj
+application/vnd.unity				unityweb
+application/vnd.uoml+xml			uoml
+application/vnd.vcx				vcx
+application/vnd.visio				vsd vst vss vsw
+application/vnd.visionary			vis
+application/vnd.vsf				vsf
+application/vnd.wap.wbxml			wbxml
+application/vnd.wap.wmlc			wmlc
+application/vnd.wap.wmlscriptc			wmlsc
+application/vnd.webturbo			wtb
+application/vnd.wolfram.player			nbp
+application/vnd.wordperfect			wpd
+application/vnd.wqd				wqd
+application/vnd.wt.stf				stf
+application/vnd.xara				xar
+application/vnd.xfdl				xfdl
+application/vnd.yamaha.hv-dic			hvd
+application/vnd.yamaha.hv-script		hvs
+application/vnd.yamaha.hv-voice			hvp
+application/vnd.yamaha.openscoreformat			osf
+application/vnd.yamaha.openscoreformat.osfpvg+xml	osfpvg
+application/vnd.yamaha.smaf-audio		saf
+application/vnd.yamaha.smaf-phrase		spf
+application/vnd.yellowriver-custom-menu		cmp
+application/vnd.zul				zir zirz
+application/vnd.zzazz.deck+xml			zaz
+application/voicexml+xml			vxml
+application/widget				wgt
+application/winhlp				hlp
+application/wsdl+xml				wsdl
+application/wspolicy+xml			wspolicy
+application/x-7z-compressed			7z
+application/x-abiword				abw
+application/x-ace-compressed			ace
+application/x-apple-diskimage			dmg
+application/x-authorware-bin			aab x32 u32 vox
+application/x-authorware-map			aam
+application/x-authorware-seg			aas
+application/x-bcpio				bcpio
+application/x-bittorrent			torrent
+application/x-blorb				blb blorb
+application/x-bzip				bz
+application/x-bzip2				bz2 boz
+application/x-cbr				cbr cba cbt cbz cb7
+application/x-cdlink				vcd
+application/x-cfs-compressed			cfs
+application/x-chat				chat
+application/x-chess-pgn				pgn
+application/x-conference			nsc
+application/x-cpio				cpio
+application/x-csh				csh
+application/x-debian-package			deb udeb
+application/x-dgc-compressed			dgc
+application/x-director			dir dcr dxr cst cct cxt w3d fgd swa
+application/x-doom				wad
+application/x-dtbncx+xml			ncx
+application/x-dtbook+xml			dtb
+application/x-dtbresource+xml			res
+application/x-dvi				dvi
+application/x-envoy				evy
+application/x-eva				eva
+application/x-font-bdf				bdf
+application/x-font-ghostscript			gsf
+application/x-font-linux-psf			psf
+application/x-font-otf				otf
+application/x-font-pcf				pcf
+application/x-font-snf				snf
+application/x-font-ttf				ttf ttc
+application/x-font-type1			pfa pfb pfm afm
+application/x-font-woff				woff
+application/x-freearc				arc
+application/x-futuresplash			spl
+application/x-gca-compressed			gca
+application/x-glulx				ulx
+application/x-gnumeric				gnumeric
+application/x-gramps-xml			gramps
+application/x-gtar				gtar
+application/x-hdf				hdf
+application/x-install-instructions		install
+application/x-iso9660-image			iso
+application/x-java-jnlp-file			jnlp
+application/x-latex				latex
+application/x-lzh-compressed			lzh lha
+application/x-mie				mie
+application/x-mobipocket-ebook			prc mobi
+application/x-ms-application			application
+application/x-ms-shortcut			lnk
+application/x-ms-wmd				wmd
+application/x-ms-wmz				wmz
+application/x-ms-xbap				xbap
+application/x-msaccess				mdb
+application/x-msbinder				obd
+application/x-mscardfile			crd
+application/x-msclip				clp
+application/x-msdownload			exe dll com bat msi
+application/x-msmediaview			mvb m13 m14
+application/x-msmetafile			wmf wmz emf emz
+application/x-msmoney				mny
+application/x-mspublisher			pub
+application/x-msschedule			scd
+application/x-msterminal			trm
+application/x-mswrite				wri
+application/x-netcdf				nc cdf
+application/x-nzb				nzb
+application/x-pkcs12				p12 pfx
+application/x-pkcs7-certificates		p7b spc
+application/x-pkcs7-certreqresp			p7r
+application/x-rar-compressed			rar
+application/x-research-info-systems		ris
+application/x-sh				sh
+application/x-shar				shar
+application/x-shockwave-flash			swf
+application/x-silverlight-app			xap
+application/x-sql				sql
+application/x-stuffit				sit
+application/x-stuffitx				sitx
+application/x-subrip				srt
+application/x-sv4cpio				sv4cpio
+application/x-sv4crc				sv4crc
+application/x-t3vm-image			t3
+application/x-tads				gam
+application/x-tar				tar
+application/x-tcl				tcl
+application/x-tex				tex
+application/x-tex-tfm				tfm
+application/x-texinfo				texinfo texi
+application/x-tgif				obj
+application/x-tgsticker				tgs
+application/x-ustar				ustar
+application/x-wais-source			src
+application/x-x509-ca-cert			der crt
+application/x-xfig				fig
+application/x-xliff+xml				xlf
+application/x-xpinstall				xpi
+application/x-xz				xz
+application/x-zmachine				z1 z2 z3 z4 z5 z6 z7 z8
+application/xaml+xml				xaml
+application/xcap-diff+xml			xdf
+application/xenc+xml				xenc
+application/xhtml+xml				xhtml xht
+application/xml					xml xsl
+application/xml-dtd				dtd
+application/xop+xml				xop
+application/xproc+xml				xpl
+application/xslt+xml				xslt
+application/xspf+xml				xspf
+application/xv+xml				mxml xhvml xvml xvm
+application/yang				yang
+application/yin+xml				yin
+application/zip					zip
+audio/adpcm					adp
+audio/basic					au snd
+audio/midi					mid midi kar rmi
+audio/mp4					m4a mp4a
+audio/mpeg					mpga mp2 mp2a mp3 m2a m3a
+audio/ogg					oga ogg spx
+audio/s3m					s3m
+audio/silk					sil
+audio/vnd.dece.audio				uva uvva
+audio/vnd.digital-winds				eol
+audio/vnd.dra					dra
+audio/vnd.dts					dts
+audio/vnd.dts.hd				dtshd
+audio/vnd.lucent.voice				lvp
+audio/vnd.ms-playready.media.pya		pya
+audio/vnd.nuera.ecelp4800			ecelp4800
+audio/vnd.nuera.ecelp7470			ecelp7470
+audio/vnd.nuera.ecelp9600			ecelp9600
+audio/vnd.rip					rip
+audio/webm					weba
+audio/x-aac					aac
+audio/x-aiff					aif aiff aifc
+audio/x-caf					caf
+audio/x-flac					flac
+audio/x-matroska				mka
+audio/x-mpegurl					m3u
+audio/x-ms-wax					wax
+audio/x-ms-wma					wma
+audio/x-pn-realaudio				ram ra
+audio/x-pn-realaudio-plugin			rmp
+audio/x-wav					wav
+audio/xm					xm
+chemical/x-cdx					cdx
+chemical/x-cif					cif
+chemical/x-cmdf					cmdf
+chemical/x-cml					cml
+chemical/x-csml					csml
+chemical/x-xyz					xyz
+font/collection					ttc
+font/otf					otf
+font/ttf					ttf
+font/woff					woff
+font/woff2					woff2
+image/bmp					bmp
+image/cgm					cgm
+image/g3fax					g3
+image/gif					gif
+image/heic					heic
+image/heic-sequence				heics
+image/heif					heif
+image/heif-sequence				heifs
+image/ief					ief
+image/jpeg					jpeg jpg jpe
+image/ktx					ktx
+image/png					png
+image/prs.btif					btif
+image/sgi					sgi
+image/svg+xml					svg svgz
+image/tiff					tiff tif
+image/vnd.adobe.photoshop			psd
+image/vnd.dece.graphic				uvi uvvi uvg uvvg
+image/vnd.djvu					djvu djv
+image/vnd.dvb.subtitle				sub
+image/vnd.dwg					dwg
+image/vnd.dxf					dxf
+image/vnd.fastbidsheet				fbs
+image/vnd.fpx					fpx
+image/vnd.fst					fst
+image/vnd.fujixerox.edmics-mmr			mmr
+image/vnd.fujixerox.edmics-rlc			rlc
+image/vnd.ms-modi				mdi
+image/vnd.ms-photo				wdp
+image/vnd.net-fpx				npx
+image/vnd.wap.wbmp				wbmp
+image/vnd.xiff					xif
+image/webp					webp
+image/x-3ds					3ds
+image/x-cmu-raster				ras
+image/x-cmx					cmx
+image/x-freehand				fh fhc fh4 fh5 fh7
+image/x-icon					ico
+image/x-mrsid-image				sid
+image/x-pcx					pcx
+image/x-pict					pic pct
+image/x-portable-anymap				pnm
+image/x-portable-bitmap				pbm
+image/x-portable-graymap			pgm
+image/x-portable-pixmap				ppm
+image/x-rgb					rgb
+image/x-tga					tga
+image/x-xbitmap					xbm
+image/x-xpixmap					xpm
+image/x-xwindowdump				xwd
+message/rfc822					eml mime
+model/iges					igs iges
+model/mesh					msh mesh silo
+model/vnd.collada+xml				dae
+model/vnd.dwf					dwf
+model/vnd.gdl					gdl
+model/vnd.gtw					gtw
+model/vnd.mts					mts
+model/vnd.vtu					vtu
+model/vrml					wrl vrml
+model/x3d+binary				x3db x3dbz
+model/x3d+vrml					x3dv x3dvz
+model/x3d+xml					x3d x3dz
+text/cache-manifest				appcache
+text/calendar					ics ifb
+text/css					css
+text/csv					csv
+text/html					html htm
+text/n3						n3
+text/plain					txt text conf def list log in
+text/prs.lines.tag				dsc
+text/richtext					rtx
+text/sgml					sgml sgm
+text/tab-separated-values			tsv
+text/troff					t tr roff man me ms
+text/turtle					ttl
+text/uri-list					uri uris urls
+text/vcard					vcard
+text/vnd.curl					curl
+text/vnd.curl.dcurl				dcurl
+text/vnd.curl.mcurl				mcurl
+text/vnd.curl.scurl				scurl
+text/vnd.dvb.subtitle				sub
+text/vnd.fly					fly
+text/vnd.fmi.flexstor				flx
+text/vnd.graphviz				gv
+text/vnd.in3d.3dml				3dml
+text/vnd.in3d.spot				spot
+text/vnd.sun.j2me.app-descriptor		jad
+text/vnd.wap.wml				wml
+text/vnd.wap.wmlscript				wmls
+text/x-asm					s asm
+text/x-c					c cc cxx cpp h hh dic
+text/x-fortran					f for f77 f90
+text/x-java-source				java
+text/x-nfo					nfo
+text/x-opml					opml
+text/x-pascal					p pas
+text/x-php					php
+text/x-setext					etx
+text/x-sfv					sfv
+text/x-uuencode					uu
+text/x-vcalendar				vcs
+text/x-vcard					vcf
+video/3gpp					3gp
+video/3gpp2					3g2
+video/h261					h261
+video/h263					h263
+video/h264					h264
+video/h265					h265
+video/jpeg					jpgv
+video/jpm					jpm jpgm
+video/mj2					mj2 mjp2
+video/mp4					mp4 mp4v mpg4
+video/mpeg					mpeg mpg mpe m1v m2v
+video/ogg					ogv
+video/quicktime					qt mov
+video/vnd.dece.hd				uvh uvvh
+video/vnd.dece.mobile				uvm uvvm
+video/vnd.dece.pd				uvp uvvp
+video/vnd.dece.sd				uvs uvvs
+video/vnd.dece.video				uvv uvvv
+video/vnd.dvb.file				dvb
+video/vnd.fvt					fvt
+video/vnd.mpegurl				mxu m4u
+video/vnd.ms-playready.media.pyv		pyv
+video/vnd.uvvu.mp4				uvu uvvu
+video/vnd.vivo					viv
+video/webm					webm
+video/x-f4v					f4v
+video/x-fli					fli
+video/x-flv					flv
+video/x-m4v					m4v
+video/x-matroska				mkv mk3d mks
+video/x-mng					mng
+video/x-ms-asf					asf asx
+video/x-ms-vob					vob
+video/x-ms-wm					wm
+video/x-ms-wmv					wmv
+video/x-ms-wmx					wmx
+video/x-ms-wvx					wvx
+video/x-msvideo					avi
+video/x-sgi-movie				movie
+video/x-smv					smv
+x-conference/x-cooltalk				ice
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/.ConcurrentHashTable.h.swp b/submodules/ton/tonlib-src/tdutils/td/utils/.ConcurrentHashTable.h.swp
new file mode 100644
index 0000000000..b559cfc661
Binary files /dev/null and b/submodules/ton/tonlib-src/tdutils/td/utils/.ConcurrentHashTable.h.swp differ
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/AesCtrByteFlow.h b/submodules/ton/tonlib-src/tdutils/td/utils/AesCtrByteFlow.h
new file mode 100644
index 0000000000..510ee5611d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/AesCtrByteFlow.h
@@ -0,0 +1,68 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/ByteFlow.h"
+#include "td/utils/common.h"
+#include "td/utils/crypto.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+#include "td/utils/UInt.h"
+
+namespace td {
+
+#if TD_HAVE_OPENSSL
+class AesCtrByteFlow : public ByteFlowInplaceBase {
+ public:
+  void init(const UInt256 &key, const UInt128 &iv) {
+    state_.init(key, iv);
+  }
+  void init(AesCtrState &&state) {
+    state_ = std::move(state);
+  }
+  AesCtrState move_aes_ctr_state() {
+    return std::move(state_);
+  }
+  void loop() override {
+    bool was_updated = false;
+    while (true) {
+      auto ready = input_->prepare_read();
+      if (ready.empty()) {
+        break;
+      }
+      state_.encrypt(ready, MutableSlice(const_cast<char *>(ready.data()), ready.size()));
+      input_->confirm_read(ready.size());
+      output_.advance_end(ready.size());
+      was_updated = true;
+    }
+    if (was_updated) {
+      on_output_updated();
+    }
+    if (!is_input_active_) {
+      finish(Status::OK());  // End of input stream.
+    }
+    set_need_size(1);
+  }
+
+ private:
+  AesCtrState state_;
+};
+#endif
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/BigNum.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/BigNum.cpp
new file mode 100644
index 0000000000..66a511876c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/BigNum.cpp
@@ -0,0 +1,321 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/BigNum.h"
+
+char disable_linker_warning_about_empty_file_bignum_cpp TD_UNUSED;
+
+#if TD_HAVE_OPENSSL
+
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+
+#include <openssl/bn.h>
+#include <openssl/crypto.h>
+
+namespace td {
+
+class BigNumContext::Impl {
+ public:
+  BN_CTX *big_num_context;
+
+  Impl() : big_num_context(BN_CTX_new()) {
+    LOG_IF(FATAL, big_num_context == nullptr);
+  }
+  Impl(const Impl &other) = delete;
+  Impl &operator=(const Impl &other) = delete;
+  Impl(Impl &&other) = delete;
+  Impl &operator=(Impl &&other) = delete;
+  ~Impl() {
+    BN_CTX_free(big_num_context);
+  }
+};
+
+BigNumContext::BigNumContext() : impl_(make_unique<Impl>()) {
+}
+
+BigNumContext::BigNumContext(BigNumContext &&other) = default;
+BigNumContext &BigNumContext::operator=(BigNumContext &&other) = default;
+
+BigNumContext::~BigNumContext() = default;
+
+class BigNum::Impl {
+ public:
+  BIGNUM *big_num;
+
+  Impl() : Impl(BN_new()) {
+  }
+  explicit Impl(BIGNUM *big_num) : big_num(big_num) {
+    LOG_IF(FATAL, big_num == nullptr);
+  }
+  Impl(const Impl &other) = delete;
+  Impl &operator=(const Impl &other) = delete;
+  Impl(Impl &&other) = delete;
+  Impl &operator=(Impl &&other) = delete;
+  ~Impl() {
+    BN_clear_free(big_num);
+  }
+};
+
+BigNum::BigNum() : impl_(make_unique<Impl>()) {
+}
+
+BigNum::BigNum(const BigNum &other) : BigNum() {
+  *this = other;
+}
+
+BigNum &BigNum::operator=(const BigNum &other) {
+  CHECK(impl_ != nullptr);
+  CHECK(other.impl_ != nullptr);
+  BIGNUM *result = BN_copy(impl_->big_num, other.impl_->big_num);
+  LOG_IF(FATAL, result == nullptr);
+  return *this;
+}
+
+BigNum::BigNum(BigNum &&other) = default;
+
+BigNum &BigNum::operator=(BigNum &&other) = default;
+
+BigNum::~BigNum() = default;
+
+BigNum BigNum::from_binary(Slice str) {
+  return BigNum(make_unique<Impl>(BN_bin2bn(str.ubegin(), narrow_cast<int>(str.size()), nullptr)));
+}
+
+BigNum BigNum::from_le_binary(Slice str) {
+#if OPENSSL_VERSION_NUMBER >= 0x10100000L && !defined(LIBRESSL_VERSION_NUMBER)
+  return BigNum(make_unique<Impl>(BN_lebin2bn(str.ubegin(), narrow_cast<int>(str.size()), nullptr)));
+#else
+  LOG(FATAL) << "Unsupported from_le_binary";
+  return BigNum();
+#endif
+}
+
+Result<BigNum> BigNum::from_decimal(CSlice str) {
+  BigNum result;
+  int res = BN_dec2bn(&result.impl_->big_num, str.c_str());
+  if (res == 0 || static_cast<size_t>(res) != str.size()) {
+    return Status::Error(PSLICE() << "Failed to parse \"" << str << "\" as BigNum");
+  }
+  return result;
+}
+
+Result<BigNum> BigNum::from_hex(CSlice str) {
+  BigNum result;
+  int res = BN_hex2bn(&result.impl_->big_num, str.c_str());
+  if (res == 0 || static_cast<size_t>(res) != str.size()) {
+    return Status::Error(PSLICE() << "Failed to parse \"" << str << "\" as hexadecimal BigNum");
+  }
+  return result;
+}
+
+BigNum BigNum::from_raw(void *openssl_big_num) {
+  return BigNum(make_unique<Impl>(static_cast<BIGNUM *>(openssl_big_num)));
+}
+
+BigNum::BigNum(unique_ptr<Impl> &&impl) : impl_(std::move(impl)) {
+}
+
+void BigNum::ensure_const_time() {
+  BN_set_flags(impl_->big_num, BN_FLG_CONSTTIME);
+}
+
+int BigNum::get_num_bits() const {
+  return BN_num_bits(impl_->big_num);
+}
+
+int BigNum::get_num_bytes() const {
+  return BN_num_bytes(impl_->big_num);
+}
+
+void BigNum::set_bit(int num) {
+  int result = BN_set_bit(impl_->big_num, num);
+  LOG_IF(FATAL, result != 1);
+}
+
+void BigNum::clear_bit(int num) {
+  int result = BN_clear_bit(impl_->big_num, num);
+  LOG_IF(FATAL, result != 1);
+}
+
+bool BigNum::is_bit_set(int num) const {
+  return BN_is_bit_set(impl_->big_num, num) != 0;
+}
+
+bool BigNum::is_prime(BigNumContext &context) const {
+  int result = BN_is_prime_ex(impl_->big_num, BN_prime_checks, context.impl_->big_num_context, nullptr);
+  LOG_IF(FATAL, result == -1);
+  return result == 1;
+}
+
+void BigNum::operator+=(uint32 value) {
+  int result = BN_add_word(impl_->big_num, value);
+  LOG_IF(FATAL, result != 1);
+}
+
+void BigNum::operator-=(uint32 value) {
+  int result = BN_sub_word(impl_->big_num, value);
+  LOG_IF(FATAL, result != 1);
+}
+
+void BigNum::operator*=(uint32 value) {
+  int result = BN_mul_word(impl_->big_num, value);
+  LOG_IF(FATAL, result != 1);
+}
+
+void BigNum::operator/=(uint32 value) {
+  BN_ULONG result = BN_div_word(impl_->big_num, value);
+  LOG_IF(FATAL, result == static_cast<BN_ULONG>(-1));
+}
+
+uint32 BigNum::operator%(uint32 value) const {
+  BN_ULONG result = BN_mod_word(impl_->big_num, value);
+  LOG_IF(FATAL, result == static_cast<BN_ULONG>(-1));
+  return narrow_cast<uint32>(result);
+}
+
+void BigNum::set_value(uint32 new_value) {
+  if (new_value == 0) {
+    BN_zero(impl_->big_num);
+  } else {
+    int result = BN_set_word(impl_->big_num, new_value);
+    LOG_IF(FATAL, result != 1);
+  }
+}
+
+BigNum BigNum::clone() const {
+  BIGNUM *result = BN_dup(impl_->big_num);
+  LOG_IF(FATAL, result == nullptr);
+  return BigNum(make_unique<Impl>(result));
+}
+
+string BigNum::to_binary(int exact_size) const {
+  int num_size = get_num_bytes();
+  if (exact_size == -1) {
+    exact_size = num_size;
+  } else {
+    CHECK(exact_size >= num_size);
+  }
+  string res(exact_size, '\0');
+  BN_bn2bin(impl_->big_num, MutableSlice(res).ubegin() + (exact_size - num_size));
+  return res;
+}
+
+string BigNum::to_le_binary(int exact_size) const {
+#if OPENSSL_VERSION_NUMBER >= 0x10100000L && !defined(LIBRESSL_VERSION_NUMBER)
+  int num_size = get_num_bytes();
+  if (exact_size == -1) {
+    exact_size = num_size;
+  } else {
+    CHECK(exact_size >= num_size);
+  }
+  string res(exact_size, '\0');
+  BN_bn2lebinpad(impl_->big_num, MutableSlice(res).ubegin(), exact_size);
+  return res;
+#else
+  LOG(FATAL) << "Unsupported to_le_binary";
+  return "";
+#endif
+}
+
+string BigNum::to_decimal() const {
+  char *result = BN_bn2dec(impl_->big_num);
+  CHECK(result != nullptr);
+  string res(result);
+  OPENSSL_free(result);
+  return res;
+}
+
+void BigNum::random(BigNum &r, int bits, int top, int bottom) {
+  int result = BN_rand(r.impl_->big_num, bits, top, bottom);
+  LOG_IF(FATAL, result != 1);
+}
+
+void BigNum::add(BigNum &r, const BigNum &a, const BigNum &b) {
+  int result = BN_add(r.impl_->big_num, a.impl_->big_num, b.impl_->big_num);
+  LOG_IF(FATAL, result != 1);
+}
+
+void BigNum::sub(BigNum &r, const BigNum &a, const BigNum &b) {
+  CHECK(r.impl_->big_num != a.impl_->big_num);
+  CHECK(r.impl_->big_num != b.impl_->big_num);
+  int result = BN_sub(r.impl_->big_num, a.impl_->big_num, b.impl_->big_num);
+  LOG_IF(FATAL, result != 1);
+}
+
+void BigNum::mul(BigNum &r, BigNum &a, BigNum &b, BigNumContext &context) {
+  int result = BN_mul(r.impl_->big_num, a.impl_->big_num, b.impl_->big_num, context.impl_->big_num_context);
+  LOG_IF(FATAL, result != 1);
+}
+
+void BigNum::mod_add(BigNum &r, BigNum &a, BigNum &b, const BigNum &m, BigNumContext &context) {
+  int result = BN_mod_add(r.impl_->big_num, a.impl_->big_num, b.impl_->big_num, m.impl_->big_num,
+                          context.impl_->big_num_context);
+  LOG_IF(FATAL, result != 1);
+}
+
+void BigNum::mod_sub(BigNum &r, BigNum &a, BigNum &b, const BigNum &m, BigNumContext &context) {
+  int result = BN_mod_sub(r.impl_->big_num, a.impl_->big_num, b.impl_->big_num, m.impl_->big_num,
+                          context.impl_->big_num_context);
+  LOG_IF(FATAL, result != 1);
+}
+
+void BigNum::mod_mul(BigNum &r, BigNum &a, BigNum &b, const BigNum &m, BigNumContext &context) {
+  int result = BN_mod_mul(r.impl_->big_num, a.impl_->big_num, b.impl_->big_num, m.impl_->big_num,
+                          context.impl_->big_num_context);
+  LOG_IF(FATAL, result != 1);
+}
+
+void BigNum::mod_inverse(BigNum &r, BigNum &a, const BigNum &m, BigNumContext &context) {
+  auto result = BN_mod_inverse(r.impl_->big_num, a.impl_->big_num, m.impl_->big_num, context.impl_->big_num_context);
+  LOG_IF(FATAL, result != r.impl_->big_num);
+}
+
+void BigNum::div(BigNum *quotient, BigNum *remainder, const BigNum &dividend, const BigNum &divisor,
+                 BigNumContext &context) {
+  auto q = quotient == nullptr ? nullptr : quotient->impl_->big_num;
+  auto r = remainder == nullptr ? nullptr : remainder->impl_->big_num;
+  if (q == nullptr && r == nullptr) {
+    return;
+  }
+
+  auto result = BN_div(q, r, dividend.impl_->big_num, divisor.impl_->big_num, context.impl_->big_num_context);
+  LOG_IF(FATAL, result != 1);
+}
+
+void BigNum::mod_exp(BigNum &r, const BigNum &a, const BigNum &p, const BigNum &m, BigNumContext &context) {
+  int result = BN_mod_exp(r.impl_->big_num, a.impl_->big_num, p.impl_->big_num, m.impl_->big_num,
+                          context.impl_->big_num_context);
+  LOG_IF(FATAL, result != 1);
+}
+
+void BigNum::gcd(BigNum &r, BigNum &a, BigNum &b, BigNumContext &context) {
+  int result = BN_gcd(r.impl_->big_num, a.impl_->big_num, b.impl_->big_num, context.impl_->big_num_context);
+  LOG_IF(FATAL, result != 1);
+}
+
+int BigNum::compare(const BigNum &a, const BigNum &b) {
+  return BN_cmp(a.impl_->big_num, b.impl_->big_num);
+}
+
+StringBuilder &operator<<(StringBuilder &sb, const BigNum &bn) {
+  return sb << bn.to_decimal();
+}
+
+}  // namespace td
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/BigNum.h b/submodules/ton/tonlib-src/tdutils/td/utils/BigNum.h
new file mode 100644
index 0000000000..a521bc7793
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/BigNum.h
@@ -0,0 +1,138 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#if TD_HAVE_OPENSSL
+
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+#include "td/utils/StringBuilder.h"
+
+namespace td {
+
+class BigNumContext {
+ public:
+  BigNumContext();
+  BigNumContext(const BigNumContext &other) = delete;
+  BigNumContext &operator=(const BigNumContext &other) = delete;
+  BigNumContext(BigNumContext &&other);
+  BigNumContext &operator=(BigNumContext &&other);
+  ~BigNumContext();
+
+ private:
+  class Impl;
+  unique_ptr<Impl> impl_;
+
+  friend class BigNum;
+};
+
+class BigNum {
+ public:
+  BigNum();
+  BigNum(const BigNum &other);
+  BigNum &operator=(const BigNum &other);
+  BigNum(BigNum &&other);
+  BigNum &operator=(BigNum &&other);
+  ~BigNum();
+
+  static BigNum from_binary(Slice str);
+
+  // Available only if OpenSSL >= 1.1.0
+  static BigNum from_le_binary(Slice str);
+
+  static Result<BigNum> from_decimal(CSlice str);
+
+  static Result<BigNum> from_hex(CSlice str);
+
+  static BigNum from_raw(void *openssl_big_num);
+
+  void set_value(uint32 new_value);
+
+  void ensure_const_time();
+
+  int get_num_bits() const;
+
+  int get_num_bytes() const;
+
+  void set_bit(int num);
+
+  void clear_bit(int num);
+
+  bool is_bit_set(int num) const;
+
+  bool is_prime(BigNumContext &context) const;
+
+  BigNum clone() const;
+
+  string to_binary(int exact_size = -1) const;
+
+  // Available only if OpenSSL >= 1.1.0
+  string to_le_binary(int exact_size = -1) const;
+
+  string to_decimal() const;
+
+  void operator+=(uint32 value);
+
+  void operator-=(uint32 value);
+
+  void operator*=(uint32 value);
+
+  void operator/=(uint32 value);
+
+  uint32 operator%(uint32 value) const;
+
+  static void random(BigNum &r, int bits, int top, int bottom);
+
+  static void add(BigNum &r, const BigNum &a, const BigNum &b);
+
+  static void sub(BigNum &r, const BigNum &a, const BigNum &b);
+
+  static void mul(BigNum &r, BigNum &a, BigNum &b, BigNumContext &context);
+
+  static void mod_add(BigNum &r, BigNum &a, BigNum &b, const BigNum &m, BigNumContext &context);
+
+  static void mod_sub(BigNum &r, BigNum &a, BigNum &b, const BigNum &m, BigNumContext &context);
+
+  static void mod_mul(BigNum &r, BigNum &a, BigNum &b, const BigNum &m, BigNumContext &context);
+
+  static void mod_inverse(BigNum &r, BigNum &a, const BigNum &m, BigNumContext &context);
+
+  static void div(BigNum *quotient, BigNum *remainder, const BigNum &dividend, const BigNum &divisor,
+                  BigNumContext &context);
+
+  static void mod_exp(BigNum &r, const BigNum &a, const BigNum &p, const BigNum &m, BigNumContext &context);
+
+  static void gcd(BigNum &r, BigNum &a, BigNum &b, BigNumContext &context);
+
+  static int compare(const BigNum &a, const BigNum &b);
+
+ private:
+  class Impl;
+  unique_ptr<Impl> impl_;
+
+  explicit BigNum(unique_ptr<Impl> &&impl);
+};
+
+StringBuilder &operator<<(StringBuilder &sb, const BigNum &bn);
+
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/BufferedFd.h b/submodules/ton/tonlib-src/tdutils/td/utils/BufferedFd.h
new file mode 100644
index 0000000000..8dff309144
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/BufferedFd.h
@@ -0,0 +1,226 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/buffer.h"
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/IoSlice.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Span.h"
+#include "td/utils/Status.h"
+
+#include <limits>
+
+namespace td {
+// just reads from given reader and writes to given writer
+template <class FdT>
+class BufferedFdBase : public FdT {
+ public:
+  BufferedFdBase() = default;
+  explicit BufferedFdBase(FdT &&fd_);
+  // TODO: make move constructor and move assignment safer
+
+  Result<size_t> flush_read(size_t max_read = std::numeric_limits<size_t>::max()) TD_WARN_UNUSED_RESULT;
+  Result<size_t> flush_write() TD_WARN_UNUSED_RESULT;
+
+  bool need_flush_write(size_t at_least = 0) {
+    CHECK(write_);
+    write_->sync_with_writer();
+    return write_->size() > at_least;
+  }
+  size_t ready_for_flush_write() {
+    CHECK(write_);
+    write_->sync_with_writer();
+    return write_->size();
+  }
+  void set_input_writer(ChainBufferWriter *read) {
+    read_ = read;
+  }
+  void set_output_reader(ChainBufferReader *write) {
+    write_ = write;
+  }
+
+ private:
+  ChainBufferWriter *read_ = nullptr;
+  ChainBufferReader *write_ = nullptr;
+};
+
+template <class FdT>
+class BufferedFd : public BufferedFdBase<FdT> {
+  using Parent = BufferedFdBase<FdT>;
+  ChainBufferWriter input_writer_;
+  ChainBufferReader input_reader_;
+  ChainBufferWriter output_writer_;
+  ChainBufferReader output_reader_;
+  void init();
+  void init_ptr();
+
+ public:
+  BufferedFd();
+  explicit BufferedFd(FdT &&fd_);
+  BufferedFd(BufferedFd &&);
+  BufferedFd &operator=(BufferedFd &&);
+  BufferedFd(const BufferedFd &) = delete;
+  BufferedFd &operator=(const BufferedFd &) = delete;
+  ~BufferedFd();
+
+  void close();
+
+  Result<size_t> flush_read(size_t max_read = std::numeric_limits<size_t>::max()) TD_WARN_UNUSED_RESULT;
+  Result<size_t> flush_write() TD_WARN_UNUSED_RESULT;
+
+  // Yep, direct access to buffers. It is IO interface too.
+  ChainBufferReader &input_buffer();
+  ChainBufferWriter &output_buffer();
+};
+
+// IMPLEMENTATION
+
+/*** BufferedFd ***/
+template <class FdT>
+BufferedFdBase<FdT>::BufferedFdBase(FdT &&fd_) : FdT(std::move(fd_)) {
+}
+
+template <class FdT>
+Result<size_t> BufferedFdBase<FdT>::flush_read(size_t max_read) {
+  CHECK(read_);
+  size_t result = 0;
+  while (::td::can_read(*this) && max_read) {
+    MutableSlice slice = read_->prepare_append().truncate(max_read);
+    TRY_RESULT(x, FdT::read(slice));
+    slice.truncate(x);
+    read_->confirm_append(x);
+    result += x;
+    max_read -= x;
+  }
+  return result;
+}
+
+template <class FdT>
+Result<size_t> BufferedFdBase<FdT>::flush_write() {
+  // TODO: sync on demand
+  write_->sync_with_writer();
+  size_t result = 0;
+  while (!write_->empty() && ::td::can_write(*this)) {
+    constexpr size_t buf_size = 20;
+    IoSlice buf[buf_size];
+
+    auto it = write_->clone();
+    size_t buf_i;
+    for (buf_i = 0; buf_i < buf_size; buf_i++) {
+      Slice slice = it.prepare_read();
+      if (slice.empty()) {
+        break;
+      }
+      buf[buf_i] = as_io_slice(slice);
+      it.confirm_read(slice.size());
+    }
+    TRY_RESULT(x, FdT::writev(Span<IoSlice>(buf, buf_i)));
+    write_->advance(x);
+    result += x;
+  }
+  return result;
+}
+
+/*** BufferedFd ***/
+template <class FdT>
+void BufferedFd<FdT>::init() {
+  input_reader_ = input_writer_.extract_reader();
+  output_reader_ = output_writer_.extract_reader();
+  init_ptr();
+}
+
+template <class FdT>
+void BufferedFd<FdT>::init_ptr() {
+  this->set_input_writer(&input_writer_);
+  this->set_output_reader(&output_reader_);
+}
+
+template <class FdT>
+BufferedFd<FdT>::BufferedFd() {
+  init();
+}
+
+template <class FdT>
+BufferedFd<FdT>::BufferedFd(FdT &&fd_) : Parent(std::move(fd_)) {
+  init();
+}
+
+template <class FdT>
+BufferedFd<FdT>::BufferedFd(BufferedFd &&from) {
+  *this = std::move(from);
+}
+
+template <class FdT>
+BufferedFd<FdT> &BufferedFd<FdT>::operator=(BufferedFd &&from) {
+  FdT::operator=(std::move(static_cast<FdT &>(from)));
+  input_reader_ = std::move(from.input_reader_);
+  input_writer_ = std::move(from.input_writer_);
+  output_reader_ = std::move(from.output_reader_);
+  output_writer_ = std::move(from.output_writer_);
+  init_ptr();
+  return *this;
+}
+
+template <class FdT>
+BufferedFd<FdT>::~BufferedFd() {
+  close();
+}
+
+template <class FdT>
+void BufferedFd<FdT>::close() {
+  FdT::close();
+  // TODO: clear buffers
+}
+
+template <class FdT>
+Result<size_t> BufferedFd<FdT>::flush_read(size_t max_read) {
+  TRY_RESULT(result, Parent::flush_read(max_read));
+  if (result) {
+    // TODO: faster sync is possible if you owns writer.
+    input_reader_.sync_with_writer();
+    LOG(DEBUG) << "Flush read: +" << format::as_size(result) << tag("total", format::as_size(input_reader_.size()));
+  }
+  return result;
+}
+
+template <class FdT>
+Result<size_t> BufferedFd<FdT>::flush_write() {
+  TRY_RESULT(result, Parent::flush_write());
+  if (result) {
+    LOG(DEBUG) << "Flush write: +" << format::as_size(result) << tag("left", format::as_size(output_reader_.size()));
+  }
+  return result;
+}
+
+// Yep, direct access to buffers. It is IO interface too.
+template <class FdT>
+ChainBufferReader &BufferedFd<FdT>::input_buffer() {
+  return input_reader_;
+}
+
+template <class FdT>
+ChainBufferWriter &BufferedFd<FdT>::output_buffer() {
+  return output_writer_;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/BufferedReader.h b/submodules/ton/tonlib-src/tdutils/td/utils/BufferedReader.h
new file mode 100644
index 0000000000..43d5ea1c17
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/BufferedReader.h
@@ -0,0 +1,73 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/port/FileFd.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+namespace td {
+
+class BufferedReader {
+ public:
+  explicit BufferedReader(FileFd &file, size_t buff_size = 8152)
+      : file_(file), buff_(buff_size), begin_pos_(0), end_pos_(0) {
+  }
+
+  Result<size_t> read(MutableSlice slice) TD_WARN_UNUSED_RESULT;
+
+ private:
+  FileFd &file_;
+  vector<char> buff_;
+  size_t begin_pos_;
+  size_t end_pos_;
+};
+
+inline Result<size_t> BufferedReader::read(MutableSlice slice) {
+  size_t available = end_pos_ - begin_pos_;
+  if (available >= slice.size()) {
+    // have enough data in buffer
+    slice.copy_from({&buff_[begin_pos_], slice.size()});
+    begin_pos_ += slice.size();
+    return slice.size();
+  }
+
+  if (available) {
+    slice.copy_from({&buff_[begin_pos_], available});
+    begin_pos_ += available;
+    slice.remove_prefix(available);
+  }
+
+  if (slice.size() > buff_.size() / 2) {
+    TRY_RESULT(result, file_.read(slice));
+    return result + available;
+  }
+
+  TRY_RESULT(result, file_.read({&buff_[0], buff_.size()}));
+  begin_pos_ = 0;
+  end_pos_ = result;
+
+  size_t left = min(end_pos_, slice.size());
+  slice.copy_from({&buff_[0], left});
+  begin_pos_ = left;
+  return left + available;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/BufferedUdp.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/BufferedUdp.cpp
new file mode 100644
index 0000000000..56dc9d7b6e
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/BufferedUdp.cpp
@@ -0,0 +1,29 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/BufferedUdp.h"
+
+char disable_linker_warning_about_empty_file_buffered_udp_cpp TD_UNUSED;
+
+namespace td {
+
+#if TD_PORT_POSIX
+TD_THREAD_LOCAL detail::UdpReader *BufferedUdp::udp_reader_;
+#endif
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/BufferedUdp.h b/submodules/ton/tonlib-src/tdutils/td/utils/BufferedUdp.h
new file mode 100644
index 0000000000..b723b365a5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/BufferedUdp.h
@@ -0,0 +1,184 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/buffer.h"
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/optional.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/thread_local.h"
+#include "td/utils/port/UdpSocketFd.h"
+#include "td/utils/Span.h"
+#include "td/utils/Status.h"
+#include "td/utils/VectorQueue.h"
+
+#include <array>
+
+namespace td {
+
+#if TD_PORT_POSIX
+namespace detail {
+class UdpWriter {
+ public:
+  static Status write_once(UdpSocketFd &fd, VectorQueue<UdpMessage> &queue) TD_WARN_UNUSED_RESULT {
+    std::array<UdpSocketFd::OutboundMessage, 16> messages;
+    auto to_send = queue.as_span();
+    size_t to_send_n = td::min(messages.size(), to_send.size());
+    to_send.truncate(to_send_n);
+    for (size_t i = 0; i < to_send_n; i++) {
+      messages[i].to = &to_send[i].address;
+      messages[i].data = to_send[i].data.as_slice();
+    }
+
+    size_t cnt;
+    auto status = fd.send_messages(::td::Span<UdpSocketFd::OutboundMessage>(messages).truncate(to_send_n), cnt);
+    queue.pop_n(cnt);
+    return status;
+  }
+};
+
+class UdpReaderHelper {
+ public:
+  void init_inbound_message(UdpSocketFd::InboundMessage &message) {
+    message.from = &message_.address;
+    message.error = &message_.error;
+    if (buffer_.size() < MAX_PACKET_SIZE) {
+      buffer_ = BufferSlice(RESERVED_SIZE);
+    }
+    CHECK(buffer_.size() >= MAX_PACKET_SIZE);
+    message.data = buffer_.as_slice().truncate(MAX_PACKET_SIZE);
+  }
+
+  UdpMessage extract_udp_message(UdpSocketFd::InboundMessage &message) {
+    message_.data = buffer_.from_slice(message.data);
+    auto size = message_.data.size();
+    size = (size + 7) & ~7;
+    CHECK(size <= MAX_PACKET_SIZE);
+    buffer_.confirm_read(size);
+    return std::move(message_);
+  }
+
+ private:
+  enum : size_t { MAX_PACKET_SIZE = 2048, RESERVED_SIZE = MAX_PACKET_SIZE * 8 };
+  UdpMessage message_;
+  BufferSlice buffer_;
+};
+
+// One for thread is enough
+class UdpReader {
+ public:
+  UdpReader() {
+    for (size_t i = 0; i < messages_.size(); i++) {
+      helpers_[i].init_inbound_message(messages_[i]);
+    }
+  }
+  Status read_once(UdpSocketFd &fd, VectorQueue<UdpMessage> &queue) TD_WARN_UNUSED_RESULT {
+    for (size_t i = 0; i < messages_.size(); i++) {
+      CHECK(messages_[i].data.size() == 2048);
+    }
+    size_t cnt = 0;
+    auto status = fd.receive_messages(messages_, cnt);
+    for (size_t i = 0; i < cnt; i++) {
+      queue.push(helpers_[i].extract_udp_message(messages_[i]));
+      helpers_[i].init_inbound_message(messages_[i]);
+    }
+    for (size_t i = cnt; i < messages_.size(); i++) {
+      LOG_CHECK(messages_[i].data.size() == 2048)
+          << " cnt = " << cnt << " i = " << i << " size = " << messages_[i].data.size() << " status = " << status;
+    }
+    if (status.is_error() && !UdpSocketFd::is_critical_read_error(status)) {
+      queue.push(UdpMessage{{}, {}, std::move(status)});
+    }
+    return status;
+  }
+
+ private:
+  enum : size_t { BUFFER_SIZE = 16 };
+  std::array<UdpSocketFd::InboundMessage, BUFFER_SIZE> messages_;
+  std::array<UdpReaderHelper, BUFFER_SIZE> helpers_;
+};
+
+}  // namespace detail
+
+#endif
+
+class BufferedUdp : public UdpSocketFd {
+ public:
+  explicit BufferedUdp(UdpSocketFd fd) : UdpSocketFd(std::move(fd)) {
+  }
+
+#if TD_PORT_POSIX
+  Result<optional<UdpMessage>> receive() {
+    if (input_.empty() && can_read(*this)) {
+      TRY_STATUS(flush_read_once());
+    }
+    if (input_.empty()) {
+      return optional<UdpMessage>();
+    }
+    return input_.pop();
+  }
+
+  void send(UdpMessage message) {
+    output_.push(std::move(message));
+  }
+
+  Status flush_send() {
+    Status status;
+    while (status.is_ok() && can_write(*this) && !output_.empty()) {
+      status = flush_send_once();
+    }
+    return status;
+  }
+#endif
+
+  UdpSocketFd move_as_udp_socket_fd() {
+    return std::move(as_fd());
+  }
+
+  UdpSocketFd &as_fd() {
+    return *static_cast<UdpSocketFd *>(this);
+  }
+
+ private:
+#if TD_PORT_POSIX
+  VectorQueue<UdpMessage> input_;
+  VectorQueue<UdpMessage> output_;
+
+  VectorQueue<UdpMessage> &input() {
+    return input_;
+  }
+  VectorQueue<UdpMessage> &output() {
+    return output_;
+  }
+
+  Status flush_send_once() TD_WARN_UNUSED_RESULT {
+    return detail::UdpWriter::write_once(as_fd(), output_);
+  }
+
+  Status flush_read_once() TD_WARN_UNUSED_RESULT {
+    init_thread_local<detail::UdpReader>(udp_reader_);
+    return udp_reader_->read_once(as_fd(), input_);
+  }
+
+  static TD_THREAD_LOCAL detail::UdpReader *udp_reader_;
+#endif
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/ByteFlow.h b/submodules/ton/tonlib-src/tdutils/td/utils/ByteFlow.h
new file mode 100644
index 0000000000..1edfe4bdc9
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/ByteFlow.h
@@ -0,0 +1,303 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/buffer.h"
+#include "td/utils/common.h"
+#include "td/utils/Status.h"
+
+namespace td {
+
+class ByteFlowInterface {
+ public:
+  virtual void close_input(Status status) = 0;
+  virtual void wakeup() = 0;
+  virtual void set_parent(ByteFlowInterface &other) = 0;
+  virtual void set_input(ChainBufferReader *input) = 0;
+  virtual size_t get_need_size() = 0;
+  ByteFlowInterface() = default;
+  ByteFlowInterface(const ByteFlowInterface &) = delete;
+  ByteFlowInterface &operator=(const ByteFlowInterface &) = delete;
+  ByteFlowInterface(ByteFlowInterface &&) = default;
+  ByteFlowInterface &operator=(ByteFlowInterface &&) = default;
+  virtual ~ByteFlowInterface() = default;
+};
+
+class ByteFlowBaseCommon : public ByteFlowInterface {
+ public:
+  ByteFlowBaseCommon() = default;
+
+  void close_input(Status status) final {
+    if (status.is_error()) {
+      finish(std::move(status));
+    } else {
+      is_input_active_ = false;
+      wakeup();
+    }
+  }
+
+  void wakeup() final {
+    if (stop_flag_) {
+      return;
+    }
+    input_->sync_with_writer();
+    if (waiting_flag_) {
+      if (!is_input_active_) {
+        finish(Status::OK());
+      }
+      return;
+    }
+    if (is_input_active_) {
+      if (need_size_ != 0 && input_->size() < need_size_) {
+        return;
+      }
+    }
+    need_size_ = 0;
+    loop();
+  }
+
+  size_t get_need_size() final {
+    return need_size_;
+  }
+
+  virtual void loop() = 0;
+
+ protected:
+  bool waiting_flag_ = false;
+  ChainBufferReader *input_ = nullptr;
+  bool is_input_active_ = true;
+  size_t need_size_ = 0;
+  void finish(Status status) {
+    stop_flag_ = true;
+    need_size_ = 0;
+    if (parent_) {
+      parent_->close_input(std::move(status));
+      parent_ = nullptr;
+    }
+  }
+
+  void set_need_size(size_t need_size) {
+    need_size_ = need_size;
+  }
+
+  void on_output_updated() {
+    if (parent_) {
+      parent_->wakeup();
+    }
+  }
+  void consume_input() {
+    waiting_flag_ = true;
+    if (!is_input_active_) {
+      finish(Status::OK());
+    }
+  }
+
+ private:
+  ByteFlowInterface *parent_ = nullptr;
+  bool stop_flag_ = false;
+  friend class ByteFlowBase;
+  friend class ByteFlowInplaceBase;
+};
+
+class ByteFlowBase : public ByteFlowBaseCommon {
+ public:
+  ByteFlowBase() = default;
+
+  void set_input(ChainBufferReader *input) final {
+    input_ = input;
+  }
+  void set_parent(ByteFlowInterface &other) final {
+    parent_ = &other;
+    parent_->set_input(&output_reader_);
+  }
+  void loop() override = 0;
+
+  // ChainBufferWriter &get_output() {
+  // return output_;
+  //}
+
+ protected:
+  ChainBufferWriter output_;
+  ChainBufferReader output_reader_ = output_.extract_reader();
+};
+
+class ByteFlowInplaceBase : public ByteFlowBaseCommon {
+ public:
+  ByteFlowInplaceBase() = default;
+
+  void set_input(ChainBufferReader *input) final {
+    input_ = input;
+    output_ = ChainBufferReader(input_->begin().clone(), input_->begin().clone(), false);
+  }
+  void set_parent(ByteFlowInterface &other) final {
+    parent_ = &other;
+    parent_->set_input(&output_);
+  }
+  void loop() override = 0;
+
+  ChainBufferReader &get_output() {
+    return output_;
+  }
+
+ protected:
+  ChainBufferReader output_;
+};
+
+inline ByteFlowInterface &operator>>(ByteFlowInterface &from, ByteFlowInterface &to) {
+  from.set_parent(to);
+  return to;
+}
+
+class ByteFlowSource : public ByteFlowInterface {
+ public:
+  ByteFlowSource() = default;
+  explicit ByteFlowSource(ChainBufferReader *buffer) : buffer_(buffer) {
+  }
+  ByteFlowSource(ByteFlowSource &&other) : buffer_(other.buffer_), parent_(other.parent_) {
+    other.buffer_ = nullptr;
+    other.parent_ = nullptr;
+  }
+  ByteFlowSource &operator=(ByteFlowSource &&other) {
+    buffer_ = other.buffer_;
+    parent_ = other.parent_;
+    other.buffer_ = nullptr;
+    other.parent_ = nullptr;
+    return *this;
+  }
+  ByteFlowSource(const ByteFlowSource &) = delete;
+  ByteFlowSource &operator=(const ByteFlowSource &) = delete;
+  ~ByteFlowSource() override = default;
+
+  void set_input(ChainBufferReader *) final {
+    UNREACHABLE();
+  }
+  void set_parent(ByteFlowInterface &parent) final {
+    CHECK(parent_ == nullptr);
+    parent_ = &parent;
+    parent_->set_input(buffer_);
+  }
+  void close_input(Status status) final {
+    CHECK(parent_);
+    parent_->close_input(std::move(status));
+    parent_ = nullptr;
+  }
+  void wakeup() final {
+    CHECK(parent_);
+    parent_->wakeup();
+  }
+  size_t get_need_size() final {
+    if (parent_ == nullptr) {
+      return 0;
+    }
+    return parent_->get_need_size();
+  }
+
+ private:
+  ChainBufferReader *buffer_ = nullptr;
+  ByteFlowInterface *parent_ = nullptr;
+};
+
+class ByteFlowSink : public ByteFlowInterface {
+ public:
+  void set_input(ChainBufferReader *input) final {
+    CHECK(buffer_ == nullptr);
+    buffer_ = input;
+  }
+  void set_parent(ByteFlowInterface & /*parent*/) final {
+    UNREACHABLE();
+  }
+  void close_input(Status status) final {
+    CHECK(active_);
+    active_ = false;
+    status_ = std::move(status);
+    buffer_->sync_with_writer();
+  }
+  void wakeup() final {
+    buffer_->sync_with_writer();
+  }
+  size_t get_need_size() final {
+    UNREACHABLE();
+    return 0;
+  }
+  bool is_ready() {
+    return !active_;
+  }
+  Status &status() {
+    return status_;
+  }
+  ChainBufferReader *result() {
+    CHECK(is_ready() && status().is_ok());
+    return buffer_;
+  }
+  ChainBufferReader *get_output() {
+    return buffer_;
+  }
+
+ private:
+  bool active_ = true;
+  Status status_;
+  ChainBufferReader *buffer_ = nullptr;
+};
+
+class ByteFlowMoveSink : public ByteFlowInterface {
+ public:
+  ByteFlowMoveSink() = default;
+  explicit ByteFlowMoveSink(ChainBufferWriter *output) {
+    set_output(output);
+  }
+  void set_input(ChainBufferReader *input) final {
+    CHECK(!input_);
+    input_ = input;
+  }
+  void set_parent(ByteFlowInterface & /*parent*/) final {
+    UNREACHABLE();
+  }
+  void close_input(Status status) final {
+    CHECK(active_);
+    active_ = false;
+    status_ = std::move(status);
+    wakeup();
+  }
+  void wakeup() final {
+    input_->sync_with_writer();
+    output_->append(*input_);
+  }
+  size_t get_need_size() final {
+    UNREACHABLE();
+    return 0;
+  }
+  void set_output(ChainBufferWriter *output) {
+    CHECK(!output_);
+    output_ = output;
+  }
+
+  bool is_ready() {
+    return !active_;
+  }
+  Status &status() {
+    return status_;
+  }
+
+ private:
+  bool active_ = true;
+  Status status_;
+  ChainBufferReader *input_ = nullptr;
+  ChainBufferWriter *output_ = nullptr;
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/CancellationToken.h b/submodules/ton/tonlib-src/tdutils/td/utils/CancellationToken.h
new file mode 100644
index 0000000000..f3bca2fcde
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/CancellationToken.h
@@ -0,0 +1,78 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <atomic>
+#include <memory>
+
+namespace td {
+
+namespace detail {
+struct RawCancellationToken {
+  std::atomic<bool> is_cancelled_{false};
+};
+}  // namespace detail
+
+class CancellationToken {
+ public:
+  explicit operator bool() const {
+    return token_->is_cancelled_.load(std::memory_order_acquire);
+  }
+  explicit CancellationToken(std::shared_ptr<detail::RawCancellationToken> token) : token_(std::move(token)) {
+  }
+
+ private:
+  std::shared_ptr<detail::RawCancellationToken> token_;
+};
+
+class CancellationTokenSource {
+ public:
+  CancellationTokenSource() = default;
+  CancellationTokenSource(CancellationTokenSource &&other) : token_(std::move(other.token_)) {
+  }
+  CancellationTokenSource &operator=(CancellationTokenSource &&other) {
+    cancel();
+    token_ = std::move(other.token_);
+    return *this;
+  }
+  CancellationTokenSource(const CancellationTokenSource &other) = delete;
+  CancellationTokenSource &operator=(const CancellationTokenSource &other) = delete;
+  ~CancellationTokenSource() {
+    cancel();
+  }
+
+  CancellationToken get_cancellation_token() {
+    if (!token_) {
+      token_ = std::make_shared<detail::RawCancellationToken>();
+    }
+    return CancellationToken(token_);
+  }
+  void cancel() {
+    if (!token_) {
+      return;
+    }
+    token_->is_cancelled_.store(true, std::memory_order_release);
+    token_.reset();
+  }
+
+ private:
+  std::shared_ptr<detail::RawCancellationToken> token_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/ChangesProcessor.h b/submodules/ton/tonlib-src/tdutils/td/utils/ChangesProcessor.h
new file mode 100644
index 0000000000..e7f1d67a46
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/ChangesProcessor.h
@@ -0,0 +1,73 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#include <utility>
+
+namespace td {
+
+// Process changes after they are finished in order of addition
+template <class DataT>
+class ChangesProcessor {
+ public:
+  using Id = uint64;
+
+  void clear() {
+    offset_ += data_array_.size();
+    ready_i_ = 0;
+    data_array_.clear();
+  }
+
+  template <class FromDataT>
+  Id add(FromDataT &&data) {
+    auto res = offset_ + data_array_.size();
+    data_array_.emplace_back(std::forward<DataT>(data), false);
+    return static_cast<Id>(res);
+  }
+
+  template <class F>
+  void finish(Id token, F &&func) {
+    size_t pos = static_cast<size_t>(token) - offset_;
+    if (pos >= data_array_.size()) {
+      return;
+    }
+    data_array_[pos].second = true;
+    while (ready_i_ < data_array_.size() && data_array_[ready_i_].second == true) {
+      func(std::move(data_array_[ready_i_].first));
+      ready_i_++;
+    }
+    try_compactify();
+  }
+
+ private:
+  size_t offset_ = 1;
+  size_t ready_i_ = 0;
+  std::vector<std::pair<DataT, bool>> data_array_;
+  void try_compactify() {
+    if (ready_i_ > 5 && ready_i_ * 2 > data_array_.size()) {
+      data_array_.erase(data_array_.begin(), data_array_.begin() + ready_i_);
+      offset_ += ready_i_;
+      ready_i_ = 0;
+    }
+  }
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Closure.h b/submodules/ton/tonlib-src/tdutils/td/utils/Closure.h
new file mode 100644
index 0000000000..d08ce03bb9
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Closure.h
@@ -0,0 +1,180 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/invoke.h"
+#include "td/utils/logging.h"
+
+#include <cstdlib>
+#include <tuple>
+#include <type_traits>
+#include <utility>
+
+//
+// Essentially we have:
+// (ActorT::func, arg1, arg2, ..., argn)
+// We want to call:
+// actor->func(arg1, arg2, ..., argn)
+// And in some cases we would like to delay this call.
+//
+// First attempt would be
+// [a1=arg1, a2=arg2, ..., an=argn](ActorT *actor) {
+//   actor->func(a1, a2, ..., an)
+// }
+//
+// But there are some difficulties with elimitation on unnecessary copies.
+// We want to use move constructor when it is possible
+//
+// We may pass
+// Tmp. Temporary / rvalue reference
+// Var. Variable / reference
+// CnstRef. const reference
+//
+//
+// Function may expect
+// Val. Value
+// CnstRef. const reference
+// Ref. rvalue reverence / reference
+//
+// TODO:
+//    Immediate call / Delayed call
+// Tmp->Val       move / move->move
+// Tmp->CnstRef      + / move->+
+// Tmp->Ref          + / move->+
+// Var->Val       copy / copy->move
+// Var->CnstRef      + / copy->
+// Var->Ref          + / copy->+   // khm. It will complile, but won't work
+//
+// So I will use common idiom: forward references
+// If delay is needed, just std::forward data to temporary storage, and std::move them when call is executed.
+//
+//
+// create_immediate_closure(&ActorT::func, arg1, arg2, ..., argn).run(actor)
+// to_delayed_closure(std::move(immediate)).run(actor)
+
+namespace td {
+template <class ActorT, class FunctionT, class... ArgsT>
+class DelayedClosure;
+
+template <class ActorT, class FunctionT, class... ArgsT>
+class ImmediateClosure {
+ public:
+  using Delayed = DelayedClosure<ActorT, FunctionT, ArgsT...>;
+  friend Delayed;
+  using ActorType = ActorT;
+
+  // no &&. just save references as references.
+  explicit ImmediateClosure(FunctionT func, ArgsT... args) : args(func, std::forward<ArgsT>(args)...) {
+  }
+
+ private:
+  std::tuple<FunctionT, ArgsT...> args;
+
+ public:
+  auto run(ActorT *actor) -> decltype(mem_call_tuple(actor, std::move(args))) {
+    return mem_call_tuple(actor, std::move(args));
+  }
+};
+
+template <class ActorT, class ResultT, class... DestArgsT, class... SrcArgsT>
+ImmediateClosure<ActorT, ResultT (ActorT::*)(DestArgsT...), SrcArgsT &&...> create_immediate_closure(
+    ResultT (ActorT::*func)(DestArgsT...), SrcArgsT &&... args) {
+  return ImmediateClosure<ActorT, ResultT (ActorT::*)(DestArgsT...), SrcArgsT &&...>(func,
+                                                                                     std::forward<SrcArgsT>(args)...);
+}
+
+template <class ActorT, class FunctionT, class... ArgsT>
+class DelayedClosure {
+ public:
+  using ActorType = ActorT;
+  using Delayed = DelayedClosure<ActorT, FunctionT, ArgsT...>;
+
+  DelayedClosure clone() const {
+    return do_clone(*this);
+  }
+
+  explicit DelayedClosure(ImmediateClosure<ActorT, FunctionT, ArgsT...> &&other) : args(std::move(other.args)) {
+  }
+
+  explicit DelayedClosure(FunctionT func, ArgsT... args) : args(func, std::forward<ArgsT>(args)...) {
+  }
+
+  template <class F>
+  void for_each(const F &f) {
+    tuple_for_each(args, f);
+  }
+
+ private:
+  using ArgsStorageT = std::tuple<FunctionT, typename std::decay<ArgsT>::type...>;
+
+  ArgsStorageT args;
+
+  template <class FromActorT, class FromFunctionT, class... FromArgsT>
+  explicit DelayedClosure(const DelayedClosure<FromActorT, FromFunctionT, FromArgsT...> &other,
+                          std::enable_if_t<LogicAnd<std::is_copy_constructible<FromArgsT>::value...>::value, int> = 0)
+      : args(other.args) {
+  }
+
+  template <class FromActorT, class FromFunctionT, class... FromArgsT>
+  explicit DelayedClosure(
+      const DelayedClosure<FromActorT, FromFunctionT, FromArgsT...> &other,
+      std::enable_if_t<!LogicAnd<std::is_copy_constructible<FromArgsT>::value...>::value, int> = 0) {
+    LOG(FATAL) << "Deleted constructor";
+    std::abort();
+  }
+
+  template <class FromActorT, class FromFunctionT, class... FromArgsT>
+  std::enable_if_t<!LogicAnd<std::is_copy_constructible<FromArgsT>::value...>::value,
+                   DelayedClosure<FromActorT, FromFunctionT, FromArgsT...>>
+  do_clone(const DelayedClosure<FromActorT, FromFunctionT, FromArgsT...> &value) const {
+    LOG(FATAL) << "Trying to clone DelayedClosure that contains noncopyable elements";
+    std::abort();
+  }
+
+  template <class FromActorT, class FromFunctionT, class... FromArgsT>
+  std::enable_if_t<LogicAnd<std::is_copy_constructible<FromArgsT>::value...>::value,
+                   DelayedClosure<FromActorT, FromFunctionT, FromArgsT...>>
+  do_clone(const DelayedClosure<FromActorT, FromFunctionT, FromArgsT...> &value) const {
+    return DelayedClosure<FromActorT, FromFunctionT, FromArgsT...>(value);
+  }
+
+ public:
+  auto run(ActorT *actor) -> decltype(mem_call_tuple(actor, std::move(args))) {
+    return mem_call_tuple(actor, std::move(args));
+  }
+};
+
+template <class... ArgsT>
+typename ImmediateClosure<ArgsT...>::Delayed to_delayed_closure(ImmediateClosure<ArgsT...> &&other) {
+  return typename ImmediateClosure<ArgsT...>::Delayed(std::move(other));
+}
+
+template <class... ArgsT>
+DelayedClosure<ArgsT...> to_delayed_closure(DelayedClosure<ArgsT...> &&other) {
+  return std::move(other);
+}
+
+template <class ActorT, class ResultT, class... DestArgsT, class... SrcArgsT>
+auto create_delayed_closure(ResultT (ActorT::*func)(DestArgsT...), SrcArgsT &&... args) {
+  return DelayedClosure<ActorT, ResultT (ActorT::*)(DestArgsT...), SrcArgsT &&...>(func,
+                                                                                   std::forward<SrcArgsT>(args)...);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/ConcurrentHashTable.h b/submodules/ton/tonlib-src/tdutils/td/utils/ConcurrentHashTable.h
new file mode 100644
index 0000000000..389c3c7453
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/ConcurrentHashTable.h
@@ -0,0 +1,334 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/HazardPointers.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/thread_local.h"
+
+#include <atomic>
+#include <condition_variable>
+#include <mutex>
+
+namespace td {
+
+// AtomicHashArray<KeyT, ValueT>
+// Building block for other concurrent hash maps
+//
+// Support one operation:
+//  template <class F>
+//  bool with_value(KeyT key, bool should_create, F &&func);
+//
+//  Finds slot for key, and call func(value)
+//  Creates slot if should_create is true.
+//  Returns true if func was called.
+//
+//  Concurrent calls with the same key may result in concurrent calls to func(value)
+//  It is responsibility of the caller to handle such races.
+//
+//  Key should already be random
+//  It is responsibility of the caller to provide unique random key.
+//  One may use injective hash function, or handle collisions in some other way.
+
+template <class KeyT, class ValueT>
+class AtomicHashArray {
+ public:
+  explicit AtomicHashArray(size_t n) : nodes_(n) {
+  }
+  struct Node {
+    std::atomic<KeyT> key{KeyT{}};
+    ValueT value{};
+  };
+  size_t size() const {
+    return nodes_.size();
+  }
+  Node &node_at(size_t i) {
+    return nodes_[i];
+  }
+  static KeyT empty_key() {
+    return KeyT{};
+  }
+
+  template <class F>
+  bool with_value(KeyT key, bool should_create, F &&f) {
+    DCHECK(key != empty_key());
+    size_t pos = static_cast<size_t>(key) % nodes_.size();
+    size_t n = td::min(td::max(static_cast<size_t>(300), nodes_.size() / 16 + 2), nodes_.size());
+
+    for (size_t i = 0; i < n; i++) {
+      pos++;
+      if (pos >= nodes_.size()) {
+        pos = 0;
+      }
+      auto &node = nodes_[pos];
+      while (true) {
+        auto node_key = node.key.load(std::memory_order_acquire);
+        if (node_key == empty_key()) {
+          if (!should_create) {
+            return false;
+          }
+          KeyT expected_key = empty_key();
+          if (node.key.compare_exchange_strong(expected_key, key, std::memory_order_relaxed,
+                                               std::memory_order_relaxed)) {
+            f(node.value);
+            return true;
+          }
+        } else if (node_key == key) {
+          f(node.value);
+          return true;
+        } else {
+          break;
+        }
+      }
+    }
+    return false;
+  }
+
+ private:
+  std::vector<Node> nodes_;
+};
+
+// Simple concurrent hash map with multiple limitations
+template <class KeyT, class ValueT>
+class ConcurrentHashMap {
+  using HashMap = AtomicHashArray<KeyT, std::atomic<ValueT>>;
+  static HazardPointers<HashMap> hp_;
+
+ public:
+  explicit ConcurrentHashMap(size_t n = 32) {
+    n = 1;
+    hash_map_.store(make_unique<HashMap>(n).release());
+  }
+  ConcurrentHashMap(const ConcurrentHashMap &) = delete;
+  ConcurrentHashMap &operator=(const ConcurrentHashMap &) = delete;
+  ConcurrentHashMap(ConcurrentHashMap &&) = delete;
+  ConcurrentHashMap &operator=(ConcurrentHashMap &&) = delete;
+  ~ConcurrentHashMap() {
+    unique_ptr<HashMap>(hash_map_.load());
+  }
+
+  static std::string get_name() {
+    return "ConcurrrentHashMap";
+  }
+
+  static KeyT empty_key() {
+    return KeyT{};
+  }
+  static ValueT empty_value() {
+    return ValueT{};
+  }
+  static ValueT migrate_value() {
+    return (ValueT)(1);  // c-style conversion because reinterpret_cast<int>(1) is CE in MSVC
+  }
+
+  ValueT insert(KeyT key, ValueT value) {
+    CHECK(key != empty_key());
+    CHECK(value != migrate_value());
+    typename HazardPointers<HashMap>::Holder holder(hp_, get_thread_id(), 0);
+    while (true) {
+      auto hash_map = holder.protect(hash_map_);
+      if (!hash_map) {
+        do_migrate(nullptr);
+        continue;
+      }
+
+      bool ok = false;
+      ValueT inserted_value;
+      hash_map->with_value(key, true, [&](auto &node_value) {
+        ValueT expected_value = this->empty_value();
+        if (node_value.compare_exchange_strong(expected_value, value, std::memory_order_release,
+                                               std::memory_order_acquire)) {
+          ok = true;
+          inserted_value = value;
+        } else {
+          if (expected_value == this->migrate_value()) {
+            ok = false;
+          } else {
+            ok = true;
+            inserted_value = expected_value;
+          }
+        }
+      });
+      if (ok) {
+        return inserted_value;
+      }
+      do_migrate(hash_map);
+    }
+  }
+
+  ValueT find(KeyT key, ValueT value) {
+    typename HazardPointers<HashMap>::Holder holder(hp_, get_thread_id(), 0);
+    while (true) {
+      auto hash_map = holder.protect(hash_map_);
+      if (!hash_map) {
+        do_migrate(nullptr);
+        continue;
+      }
+
+      bool has_value = hash_map->with_value(
+          key, false, [&](auto &node_value) { value = node_value.load(std::memory_order_acquire); });
+      if (!has_value || value != migrate_value()) {
+        return value;
+      }
+      do_migrate(hash_map);
+    }
+  }
+
+  template <class F>
+  void for_each(F &&f) {
+    auto hash_map = hash_map_.load();
+    CHECK(hash_map);
+    auto size = hash_map->size();
+    for (size_t i = 0; i < size; i++) {
+      auto &node = hash_map->node_at(i);
+      auto key = node.key.load(std::memory_order_relaxed);
+      auto value = node.value.load(std::memory_order_relaxed);
+
+      if (key != empty_key()) {
+        CHECK(value != migrate_value());
+        if (value != empty_value()) {
+          f(key, value);
+        }
+      }
+    }
+  }
+
+ private:
+  // use no padding intentionally
+  std::atomic<HashMap *> hash_map_{nullptr};
+
+  std::mutex migrate_mutex_;
+  std::condition_variable migrate_cv_;
+
+  int migrate_cnt_{0};
+  int migrate_generation_{0};
+  HashMap *migrate_from_hash_map_{nullptr};
+  HashMap *migrate_to_hash_map_{nullptr};
+  struct Task {
+    size_t begin;
+    size_t end;
+    bool empty() const {
+      return begin >= end;
+    }
+    size_t size() const {
+      if (empty()) {
+        return 0;
+      }
+      return end - begin;
+    }
+  };
+
+  struct TaskCreator {
+    size_t chunk_size;
+    size_t size;
+    std::atomic<size_t> pos{0};
+    Task create() {
+      auto i = pos++;
+      auto begin = i * chunk_size;
+      auto end = begin + chunk_size;
+      if (end > size) {
+        end = size;
+      }
+      return {begin, end};
+    }
+  };
+  TaskCreator task_creator;
+
+  void do_migrate(HashMap *ptr) {
+    //LOG(ERROR) << "In do_migrate: " << ptr;
+    std::unique_lock<std::mutex> lock(migrate_mutex_);
+    if (hash_map_.load() != ptr) {
+      return;
+    }
+    init_migrate();
+    CHECK(!ptr || migrate_from_hash_map_ == ptr);
+    migrate_cnt_++;
+    auto migrate_generation = migrate_generation_;
+    lock.unlock();
+
+    run_migrate();
+
+    lock.lock();
+    migrate_cnt_--;
+    if (migrate_cnt_ == 0) {
+      finish_migrate();
+    }
+    migrate_cv_.wait(lock, [&] { return migrate_generation_ != migrate_generation; });
+  }
+
+  void finish_migrate() {
+    //LOG(ERROR) << "In finish_migrate";
+    hash_map_.store(migrate_to_hash_map_);
+    hp_.retire(get_thread_id(), migrate_from_hash_map_);
+    migrate_from_hash_map_ = nullptr;
+    migrate_to_hash_map_ = nullptr;
+    migrate_generation_++;
+    migrate_cv_.notify_all();
+  }
+
+  void init_migrate() {
+    if (migrate_from_hash_map_ != nullptr) {
+      return;
+    }
+    //LOG(ERROR) << "In init_migrate";
+    CHECK(migrate_cnt_ == 0);
+    migrate_generation_++;
+    migrate_from_hash_map_ = hash_map_.exchange(nullptr);
+    auto new_size = migrate_from_hash_map_->size() * 2;
+    migrate_to_hash_map_ = make_unique<HashMap>(new_size).release();
+    task_creator.chunk_size = 100;
+    task_creator.size = migrate_from_hash_map_->size();
+    task_creator.pos = 0;
+  }
+
+  void run_migrate() {
+    //LOG(ERROR) << "In run_migrate";
+    size_t cnt = 0;
+    while (true) {
+      auto task = task_creator.create();
+      cnt += task.size();
+      if (task.empty()) {
+        break;
+      }
+      run_task(task);
+    }
+    //LOG(ERROR) << "In run_migrate " << cnt;
+  }
+
+  void run_task(Task task) {
+    for (auto i = task.begin; i < task.end; i++) {
+      auto &node = migrate_from_hash_map_->node_at(i);
+      auto old_value = node.value.exchange(migrate_value(), std::memory_order_acq_rel);
+      if (old_value == 0) {
+        continue;
+      }
+      auto node_key = node.key.load(std::memory_order_relaxed);
+      //LOG(ERROR) << node_key << " " << node_key;
+      auto ok = migrate_to_hash_map_->with_value(
+          node_key, true, [&](auto &node_value) { node_value.store(old_value, std::memory_order_relaxed); });
+      LOG_CHECK(ok) << "Migration overflow";
+    }
+  }
+};
+
+template <class KeyT, class ValueT>
+td::HazardPointers<typename ConcurrentHashMap<KeyT, ValueT>::HashMap> ConcurrentHashMap<KeyT, ValueT>::hp_(64);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Container.h b/submodules/ton/tonlib-src/tdutils/td/utils/Container.h
new file mode 100644
index 0000000000..fc329abc39
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Container.h
@@ -0,0 +1,160 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#include <limits>
+
+namespace td {
+
+// 1. Allocates all objects in vector. (but vector never shrinks)
+// 2. Id is safe way to reach this object.
+// 3. All ids are unique.
+// 4. All ids are non-zero.
+template <class DataT>
+class Container {
+ public:
+  using Id = uint64;
+  DataT *get(Id id) {
+    int32 slot_id = decode_id(id);
+    if (slot_id == -1) {
+      return nullptr;
+    }
+    return &slots_[slot_id].data;
+  }
+
+  void erase(Id id) {
+    int32 slot_id = decode_id(id);
+    if (slot_id == -1) {
+      return;
+    }
+    release(slot_id);
+  }
+
+  DataT extract(Id id) {
+    int32 slot_id = decode_id(id);
+    CHECK(slot_id != -1);
+    auto res = std::move(slots_[slot_id].data);
+    release(slot_id);
+    return res;
+  }
+
+  Id create(DataT &&data = DataT(), uint8 type = 0) {
+    int32 id = store(std::move(data), type);
+    return encode_id(id);
+  }
+
+  Id reset_id(Id id) {
+    int32 slot_id = decode_id(id);
+    CHECK(slot_id != -1);
+    inc_generation(slot_id);
+    return encode_id(slot_id);
+  }
+
+  static uint8 type_from_id(Id id) {
+    return static_cast<uint8>(id);
+  }
+
+  vector<Id> ids() {
+    vector<bool> is_bad(slots_.size(), false);
+    for (auto id : empty_slots_) {
+      is_bad[id] = true;
+    }
+    vector<Id> res;
+    for (size_t i = 0, n = slots_.size(); i < n; i++) {
+      if (!is_bad[i]) {
+        res.push_back(encode_id(static_cast<int32>(i)));
+      }
+    }
+    return res;
+  }
+  template <class F>
+  void for_each(const F &f) {
+    auto ids = this->ids();
+    for (auto id : ids) {
+      f(id, *get(id));
+    }
+  }
+  size_t size() const {
+    CHECK(empty_slots_.size() <= slots_.size());
+    return slots_.size() - empty_slots_.size();
+  }
+  bool empty() const {
+    return size() == 0;
+  }
+  void clear() {
+    *this = Container<DataT>();
+  }
+
+ private:
+  static constexpr uint32 GENERATION_STEP = 1 << 8;
+  static constexpr uint32 TYPE_MASK = (1 << 8) - 1;
+  struct Slot {
+    uint32 generation;
+    DataT data;
+  };
+  vector<Slot> slots_;
+  vector<int32> empty_slots_;
+
+  Id encode_id(int32 id) const {
+    return (static_cast<uint64>(id) << 32) | slots_[id].generation;
+  }
+
+  int32 decode_id(Id id) const {
+    int32 slot_id = static_cast<int32>(id >> 32);
+    uint32 generation = static_cast<uint32>(id);
+    if (slot_id < 0 || slot_id >= static_cast<int32>(slots_.size())) {
+      return -1;
+    }
+    if (generation != slots_[slot_id].generation) {
+      return -1;
+    }
+    return slot_id;
+  }
+
+  int32 store(DataT &&data, uint8 type) {
+    int32 pos;
+    if (!empty_slots_.empty()) {
+      pos = empty_slots_.back();
+      empty_slots_.pop_back();
+      slots_[pos].data = std::move(data);
+      slots_[pos].generation ^= (slots_[pos].generation & TYPE_MASK) ^ type;
+    } else {
+      CHECK(slots_.size() <= static_cast<size_t>(std::numeric_limits<int32>::max()));
+      pos = static_cast<int32>(slots_.size());
+      slots_.push_back(Slot{GENERATION_STEP + type, std::move(data)});
+    }
+    return pos;
+  }
+
+  void release(int32 id) {
+    inc_generation(id);
+    slots_[id].data = DataT();
+    if (slots_[id].generation & ~TYPE_MASK) {  // generation overflow. Can't use this id anymore
+      empty_slots_.push_back(id);
+    }
+  }
+
+  void inc_generation(int32 id) {
+    slots_[id].generation += GENERATION_STEP;
+  }
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Context.h b/submodules/ton/tonlib-src/tdutils/td/utils/Context.h
new file mode 100644
index 0000000000..5c8c9ad3e5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Context.h
@@ -0,0 +1,56 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/thread_local.h"
+
+namespace td {
+
+template <class Impl>
+class Context {
+ public:
+  static Impl *get() {
+    return context_;
+  }
+  class Guard {
+   public:
+    explicit Guard(Impl *new_context) {
+      old_context_ = context_;
+      context_ = new_context;
+    }
+    ~Guard() {
+      context_ = old_context_;
+    }
+    Guard(const Guard &) = delete;
+    Guard &operator=(const Guard &) = delete;
+    Guard(Guard &&) = delete;
+    Guard &operator=(Guard &&) = delete;
+
+   private:
+    Impl *old_context_;
+  };
+
+ private:
+  static TD_THREAD_LOCAL Impl *context_;
+};
+
+template <class Impl>
+TD_THREAD_LOCAL Impl *Context<Impl>::context_;
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/DecTree.h b/submodules/ton/tonlib-src/tdutils/td/utils/DecTree.h
new file mode 100644
index 0000000000..0baf1b3304
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/DecTree.h
@@ -0,0 +1,228 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Random.h"
+
+#include <functional>
+#include <utility>
+
+namespace td {
+
+template <typename KeyType, typename ValueType, typename Compare = std::less<KeyType>>
+class DecTree {
+  struct Node {
+    unique_ptr<Node> left_;
+    unique_ptr<Node> right_;
+    size_t size_;
+    KeyType key_;
+    ValueType value_;
+    uint32 y_;
+
+    void relax() {
+      size_ = 1;
+      if (left_ != nullptr) {
+        size_ += left_->size_;
+      }
+      if (right_ != nullptr) {
+        size_ += right_->size_;
+      }
+    }
+
+    Node(KeyType key, ValueType value, uint32 y) : size_(1), key_(std::move(key)), value_(std::move(value)), y_(y) {
+    }
+  };
+  unique_ptr<Node> root_;
+
+  static unique_ptr<Node> create_node(KeyType key, ValueType value, uint32 y) {
+    return make_unique<Node>(std::move(key), std::move(value), y);
+  }
+
+  static unique_ptr<Node> insert_node(unique_ptr<Node> Tree, KeyType key, ValueType value, uint32 y) {
+    if (Tree == nullptr) {
+      return create_node(std::move(key), std::move(value), y);
+    }
+    if (Tree->y_ < y) {
+      auto P = split_node(std::move(Tree), key);
+      auto T = create_node(std::move(key), std::move(value), y);
+      T->left_ = std::move(P.first);
+      T->right_ = std::move(P.second);
+      T->relax();
+      return T;
+    }
+    if (Compare()(key, Tree->key_)) {
+      Tree->left_ = insert_node(std::move(Tree->left_), std::move(key), std::move(value), y);
+    } else if (Compare()(Tree->key_, key)) {
+      Tree->right_ = insert_node(std::move(Tree->right_), std::move(key), std::move(value), y);
+    } else {
+      // ?? assert
+    }
+    Tree->relax();
+    return Tree;
+  }
+
+  static unique_ptr<Node> remove_node(unique_ptr<Node> Tree, const KeyType &key) {
+    if (Tree == nullptr) {
+      // ?? assert
+      return nullptr;
+    }
+    if (Compare()(key, Tree->key_)) {
+      Tree->left_ = remove_node(std::move(Tree->left_), key);
+    } else if (Compare()(Tree->key_, key)) {
+      Tree->right_ = remove_node(std::move(Tree->right_), key);
+    } else {
+      Tree = merge_node(std::move(Tree->left_), std::move(Tree->right_));
+    }
+    if (Tree != nullptr) {
+      Tree->relax();
+    }
+    return Tree;
+  }
+
+  static ValueType *get_node(unique_ptr<Node> &Tree, const KeyType &key) {
+    if (Tree == nullptr) {
+      return nullptr;
+    }
+    if (Compare()(key, Tree->key_)) {
+      return get_node(Tree->left_, key);
+    } else if (Compare()(Tree->key_, key)) {
+      return get_node(Tree->right_, key);
+    } else {
+      return &Tree->value_;
+    }
+  }
+
+  static ValueType *get_node_by_idx(unique_ptr<Node> &Tree, size_t idx) {
+    CHECK(Tree != nullptr);
+    auto s = (Tree->left_ != nullptr) ? Tree->left_->size_ : 0;
+    if (idx < s) {
+      return get_node_by_idx(Tree->left_, idx);
+    } else if (idx == s) {
+      return &Tree->value_;
+    } else {
+      return get_node_by_idx(Tree->right_, idx - s - 1);
+    }
+  }
+
+  static const ValueType *get_node(const unique_ptr<Node> &Tree, const KeyType &key) {
+    if (Tree == nullptr) {
+      return nullptr;
+    }
+    if (Compare()(key, Tree->key_)) {
+      return get_node(Tree->left_, key);
+    } else if (Compare()(Tree->key_, key)) {
+      return get_node(Tree->right_, key);
+    } else {
+      return &Tree->value_;
+    }
+  }
+
+  static const ValueType *get_node_by_idx(const unique_ptr<Node> &Tree, size_t idx) {
+    CHECK(Tree != nullptr);
+    auto s = (Tree->left_ != nullptr) ? Tree->left_->size_ : 0;
+    if (idx < s) {
+      return get_node_by_idx(Tree->left_, idx);
+    } else if (idx == s) {
+      return &Tree->value_;
+    } else {
+      return get_node_by_idx(Tree->right_, idx - s - 1);
+    }
+  }
+
+  static std::pair<unique_ptr<Node>, unique_ptr<Node>> split_node(unique_ptr<Node> Tree, const KeyType &key) {
+    if (Tree == nullptr) {
+      return {nullptr, nullptr};
+    }
+    if (Compare()(key, Tree->key_)) {
+      auto P = split_node(std::move(Tree->left_), key);
+      Tree->left_ = std::move(P.second);
+      Tree->relax();
+      P.second = std::move(Tree);
+      return P;
+    } else {
+      auto P = split_node(std::move(Tree->right_), key);
+      Tree->right_ = std::move(P.first);
+      Tree->relax();
+      P.first = std::move(Tree);
+      return P;
+    }
+  }
+
+  static unique_ptr<Node> merge_node(unique_ptr<Node> left, unique_ptr<Node> right) {
+    if (left == nullptr) {
+      return right;
+    }
+    if (right == nullptr) {
+      return left;
+    }
+    if (left->y_ < right->y_) {
+      right->left_ = merge_node(std::move(left), std::move(right->left_));
+      right->relax();
+      return right;
+    } else {
+      left->right_ = merge_node(std::move(left->right_), std::move(right));
+      left->relax();
+      return left;
+    }
+  }
+
+ public:
+  size_t size() const {
+    if (root_ == nullptr) {
+      return 0;
+    } else {
+      return root_->size_;
+    }
+  }
+  void insert(KeyType key, ValueType value) {
+    root_ = insert_node(std::move(root_), std::move(key), std::move(value), td::Random::fast_uint32());
+  }
+  void remove(const KeyType &key) {
+    root_ = remove_node(std::move(root_), key);
+  }
+  void reset() {
+    root_ = nullptr;
+  }
+  ValueType *get(const KeyType &key) {
+    return get_node(root_, key);
+  }
+  ValueType *get_random() {
+    if (size() == 0) {
+      return nullptr;
+    } else {
+      return get_node_by_idx(root_, td::Random::fast_uint32() % size());
+    }
+  }
+  const ValueType *get(const KeyType &key) const {
+    return get_node(root_, key);
+  }
+  const ValueType *get_random() const {
+    if (size() == 0) {
+      return nullptr;
+    } else {
+      return get_node_by_idx(root_, td::Random::fast_uint32() % size());
+    }
+  }
+  bool exists(const KeyType &key) const {
+    return get_node(root_, key) != nullptr;
+  }
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Destructor.h b/submodules/ton/tonlib-src/tdutils/td/utils/Destructor.h
new file mode 100644
index 0000000000..872b385bbd
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Destructor.h
@@ -0,0 +1,64 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#include <memory>
+#include <utility>
+
+namespace td {
+
+class Destructor {
+ public:
+  Destructor() = default;
+  Destructor(const Destructor &other) = delete;
+  Destructor &operator=(const Destructor &other) = delete;
+  Destructor(Destructor &&other) = default;
+  Destructor &operator=(Destructor &&other) = default;
+  virtual ~Destructor() = default;
+};
+
+template <class F>
+class LambdaDestructor : public Destructor {
+ public:
+  explicit LambdaDestructor(F &&f) : f_(std::move(f)) {
+  }
+  LambdaDestructor(const LambdaDestructor &other) = delete;
+  LambdaDestructor &operator=(const LambdaDestructor &other) = delete;
+  LambdaDestructor(LambdaDestructor &&other) = default;
+  LambdaDestructor &operator=(LambdaDestructor &&other) = default;
+  ~LambdaDestructor() override {
+    f_();
+  }
+
+ private:
+  F f_;
+};
+
+template <class F>
+auto create_destructor(F &&f) {
+  return make_unique<LambdaDestructor<F>>(std::forward<F>(f));
+}
+template <class F>
+auto create_shared_destructor(F &&f) {
+  return std::make_shared<LambdaDestructor<F>>(std::forward<F>(f));
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Enumerator.h b/submodules/ton/tonlib-src/tdutils/td/utils/Enumerator.h
new file mode 100644
index 0000000000..ccd01d475b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Enumerator.h
@@ -0,0 +1,56 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/misc.h"
+
+#include <map>
+#include <tuple>
+
+namespace td {
+
+template <class ValueT>
+class Enumerator {
+ public:
+  using Key = int32;
+
+  Key add(ValueT v) {
+    int32 next_id = narrow_cast<int32>(arr_.size() + 1);
+    bool was_inserted;
+    decltype(map_.begin()) it;
+    std::tie(it, was_inserted) = map_.emplace(std::move(v), next_id);
+    if (was_inserted) {
+      arr_.push_back(&it->first);
+    }
+    return it->second;
+  }
+
+  const ValueT &get(Key key) const {
+    auto pos = static_cast<size_t>(key - 1);
+    CHECK(pos < arr_.size());
+    return *arr_[pos];
+  }
+
+ private:
+  std::map<ValueT, int32> map_;
+  std::vector<const ValueT *> arr_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/EpochBasedMemoryReclamation.h b/submodules/ton/tonlib-src/tdutils/td/utils/EpochBasedMemoryReclamation.h
new file mode 100644
index 0000000000..2f14c65d16
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/EpochBasedMemoryReclamation.h
@@ -0,0 +1,213 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/sleep.h"
+
+#include <atomic>
+#include <memory>
+
+namespace td {
+
+template <class T>
+class EpochBasedMemoryReclamation {
+ public:
+  EpochBasedMemoryReclamation(const EpochBasedMemoryReclamation &other) = delete;
+  EpochBasedMemoryReclamation &operator=(const EpochBasedMemoryReclamation &other) = delete;
+  EpochBasedMemoryReclamation(EpochBasedMemoryReclamation &&other) = delete;
+  EpochBasedMemoryReclamation &operator=(EpochBasedMemoryReclamation &&other) = delete;
+  ~EpochBasedMemoryReclamation() = default;
+
+  class Locker {
+   public:
+    Locker(size_t thread_id, EpochBasedMemoryReclamation *ebmr) : thread_id_(thread_id), ebmr_(ebmr) {
+    }
+    Locker(const Locker &other) = delete;
+    Locker &operator=(const Locker &other) = delete;
+    Locker(Locker &&other) = default;
+    Locker &operator=(Locker &&other) = delete;
+
+    ~Locker() {
+      if (ebmr_) {
+        retire_sync();
+        unlock();
+        ebmr_.release();
+      }
+    }
+    void lock() {
+      DCHECK(ebmr_);
+      ebmr_->lock(thread_id_);
+    }
+    void unlock() {
+      DCHECK(ebmr_);
+      ebmr_->unlock(thread_id_);
+    }
+
+    void retire_sync() {
+      ebmr_->retire_sync(thread_id_);
+    }
+
+    void retire() {
+      ebmr_->retire(thread_id_);
+    }
+
+    void retire(T *ptr) {
+      ebmr_->retire(thread_id_, ptr);
+    }
+
+   private:
+    size_t thread_id_;
+    struct Never {
+      template <class S>
+      void operator()(S *) const {
+        UNREACHABLE();
+      }
+    };
+    std::unique_ptr<EpochBasedMemoryReclamation, Never> ebmr_;
+  };
+
+  explicit EpochBasedMemoryReclamation(size_t threads_n) : threads_(threads_n) {
+  }
+
+  Locker get_locker(size_t thread_id) {
+    return Locker{thread_id, this};
+  }
+
+  size_t to_delete_size_unsafe() const {
+    size_t res = 0;
+    for (auto &thread_data : threads_) {
+      // LOG(ERROR) << "---" << thread_data.epoch.load() / 2;
+      for (size_t i = 0; i < MAX_BAGS; i++) {
+        res += thread_data.to_delete[i].size();
+        // LOG(ERROR) << thread_data.to_delete[i].size();
+      }
+    }
+    return res;
+  }
+
+ private:
+  static constexpr size_t MAX_BAGS = 3;
+  struct ThreadData {
+    std::atomic<int64> epoch{1};
+    char pad[TD_CONCURRENCY_PAD - sizeof(epoch)];
+
+    size_t to_skip{0};
+    size_t checked_thread_i{0};
+    size_t bag_i{0};
+    std::vector<unique_ptr<T>> to_delete[MAX_BAGS];
+    char pad2[TD_CONCURRENCY_PAD - sizeof(to_delete)];
+
+    void rotate_bags() {
+      bag_i = (bag_i + 1) % MAX_BAGS;
+      to_delete[bag_i].clear();
+    }
+
+    void set_epoch(int64 new_epoch) {
+      //LOG(ERROR) << new_epoch;
+      if (epoch.load(std::memory_order_relaxed) / 2 != new_epoch) {
+        checked_thread_i = 0;
+        to_skip = 0;
+        rotate_bags();
+      }
+      epoch = new_epoch * 2;
+    }
+
+    void idle() {
+      epoch.store(epoch.load(std::memory_order_relaxed) | 1);
+    }
+
+    size_t undeleted() const {
+      size_t res = 0;
+      for (size_t i = 0; i < MAX_BAGS; i++) {
+        res += to_delete[i].size();
+      }
+      return res;
+    }
+  };
+  std::vector<ThreadData> threads_;
+  char pad[TD_CONCURRENCY_PAD - sizeof(threads_)];
+
+  std::atomic<int64> epoch_{1};
+  char pad2[TD_CONCURRENCY_PAD - sizeof(epoch_)];
+
+  void lock(size_t thread_id) {
+    auto &data = threads_[thread_id];
+    auto epoch = epoch_.load();
+    data.set_epoch(epoch);
+
+    if (data.to_skip == 0) {
+      data.to_skip = 30;
+      step_check(data);
+    } else {
+      data.to_skip--;
+    }
+  }
+
+  void unlock(size_t thread_id) {
+    //LOG(ERROR) << "UNLOCK";
+    auto &data = threads_[thread_id];
+    data.idle();
+  }
+
+  bool step_check(ThreadData &data) {
+    auto epoch = data.epoch.load(std::memory_order_relaxed) / 2;
+    auto checked_thread_epoch = threads_[data.checked_thread_i].epoch.load();
+    if (checked_thread_epoch % 2 == 1 || checked_thread_epoch / 2 == epoch) {
+      data.checked_thread_i++;
+      if (data.checked_thread_i == threads_.size()) {
+        if (epoch_.compare_exchange_strong(epoch, epoch + 1)) {
+          data.set_epoch(epoch + 1);
+        } else {
+          data.set_epoch(epoch);
+        }
+      }
+      return true;
+    }
+    return false;
+  }
+
+  void retire_sync(size_t thread_id) {
+    auto &data = threads_[thread_id];
+
+    while (true) {
+      retire(thread_id);
+      data.idle();
+      if (data.undeleted() == 0) {
+        break;
+      }
+      usleep_for(1000);
+    }
+  }
+
+  void retire(size_t thread_id) {
+    auto &data = threads_[thread_id];
+    data.set_epoch(epoch_.load());
+    while (step_check(data) && data.undeleted() != 0) {
+    }
+  }
+
+  void retire(size_t thread_id, T *ptr) {
+    auto &data = threads_[thread_id];
+    data.to_delete[data.bag_i].push_back(unique_ptr<T>{ptr});
+  }
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/FileLog.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/FileLog.cpp
new file mode 100644
index 0000000000..49a0a6276d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/FileLog.cpp
@@ -0,0 +1,131 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/FileLog.h"
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/FileFd.h"
+#include "td/utils/port/path.h"
+#include "td/utils/port/StdStreams.h"
+#include "td/utils/Slice.h"
+
+#include <limits>
+
+namespace td {
+
+Status FileLog::init(string path, int64 rotate_threshold, bool redirect_stderr) {
+  if (path == path_) {
+    set_rotate_threshold(rotate_threshold);
+    return Status::OK();
+  }
+  if (path.empty()) {
+    return Status::Error("Log file path can't be empty");
+  }
+
+  TRY_RESULT(fd, FileFd::open(path, FileFd::Create | FileFd::Write | FileFd::Append));
+
+  fd_.close();
+  fd_ = std::move(fd);
+  if (!Stderr().empty() && redirect_stderr) {
+    fd_.get_native_fd().duplicate(Stderr().get_native_fd()).ignore();
+  }
+
+  auto r_path = realpath(path, true);
+  if (r_path.is_error()) {
+    path_ = std::move(path);
+  } else {
+    path_ = r_path.move_as_ok();
+  }
+  TRY_RESULT(size, fd_.get_size());
+  size_ = size;
+  rotate_threshold_ = rotate_threshold;
+  redirect_stderr_ = redirect_stderr;
+  return Status::OK();
+}
+
+Slice FileLog::get_path() const {
+  return path_;
+}
+
+vector<string> FileLog::get_file_paths() {
+  vector<string> result;
+  if (!path_.empty()) {
+    result.push_back(path_);
+    result.push_back(PSTRING() << path_ << ".old");
+  }
+  return result;
+}
+
+void FileLog::set_rotate_threshold(int64 rotate_threshold) {
+  rotate_threshold_ = rotate_threshold;
+}
+
+int64 FileLog::get_rotate_threshold() const {
+  return rotate_threshold_;
+}
+
+void FileLog::append(CSlice cslice, int log_level) {
+  Slice slice = cslice;
+  while (!slice.empty()) {
+    auto r_size = fd_.write(slice);
+    if (r_size.is_error()) {
+      process_fatal_error(PSLICE() << r_size.error() << " in " << __FILE__ << " at " << __LINE__);
+    }
+    auto written = r_size.ok();
+    size_ += static_cast<int64>(written);
+    slice.remove_prefix(written);
+  }
+  if (log_level == VERBOSITY_NAME(FATAL)) {
+    process_fatal_error(cslice);
+  }
+
+  if (size_ > rotate_threshold_) {
+    auto status = rename(path_, PSLICE() << path_ << ".old");
+    if (status.is_error()) {
+      process_fatal_error(PSLICE() << status.error() << " in " << __FILE__ << " at " << __LINE__);
+    }
+    do_rotate();
+  }
+}
+
+void FileLog::rotate() {
+  if (path_.empty()) {
+    return;
+  }
+  do_rotate();
+}
+
+void FileLog::do_rotate() {
+  auto current_verbosity_level = GET_VERBOSITY_LEVEL();
+  SET_VERBOSITY_LEVEL(std::numeric_limits<int>::min());  // to ensure that nothing will be printed to the closed log
+  CHECK(!path_.empty());
+  fd_.close();
+  auto r_fd = FileFd::open(path_, FileFd::Create | FileFd::Truncate | FileFd::Write);
+  if (r_fd.is_error()) {
+    process_fatal_error(PSLICE() << r_fd.error() << " in " << __FILE__ << " at " << __LINE__);
+  }
+  fd_ = r_fd.move_as_ok();
+  if (!Stderr().empty() && redirect_stderr_) {
+    fd_.get_native_fd().duplicate(Stderr().get_native_fd()).ignore();
+  }
+  size_ = 0;
+  SET_VERBOSITY_LEVEL(current_verbosity_level);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/FileLog.h b/submodules/ton/tonlib-src/tdutils/td/utils/FileLog.h
new file mode 100644
index 0000000000..63708c16aa
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/FileLog.h
@@ -0,0 +1,57 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/FileFd.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+namespace td {
+
+class FileLog : public LogInterface {
+  static constexpr int64 DEFAULT_ROTATE_THRESHOLD = 10 * (1 << 20);
+
+ public:
+  Status init(string path, int64 rotate_threshold = DEFAULT_ROTATE_THRESHOLD, bool redirect_stderr = true);
+
+  Slice get_path() const;
+
+  vector<string> get_file_paths() override;
+
+  void set_rotate_threshold(int64 rotate_threshold);
+
+  int64 get_rotate_threshold() const;
+
+  void append(CSlice cslice, int log_level) override;
+
+  void rotate() override;
+
+ private:
+  FileFd fd_;
+  string path_;
+  int64 size_ = 0;
+  int64 rotate_threshold_ = 0;
+  bool redirect_stderr_;
+
+  void do_rotate();
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/FloodControlFast.h b/submodules/ton/tonlib-src/tdutils/td/utils/FloodControlFast.h
new file mode 100644
index 0000000000..ff05edb662
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/FloodControlFast.h
@@ -0,0 +1,74 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/TimedStat.h"
+
+namespace td {
+
+class FloodControlFast {
+ public:
+  uint32 add_event(int32 now) {
+    for (auto &limit : limits_) {
+      limit.stat_.add_event(CounterStat::Event(), now);
+      if (limit.stat_.get_stat(now).count_ > limit.count_) {
+        wakeup_at_ = max(wakeup_at_, now + limit.duration_ * 2);
+      }
+    }
+    return wakeup_at_;
+  }
+  uint32 get_wakeup_at() {
+    return wakeup_at_;
+  }
+
+  void add_limit(uint32 duration, int32 count) {
+    limits_.push_back({TimedStat<CounterStat>(duration, 0), duration, count});
+  }
+
+  void clear_events() {
+    for (auto &limit : limits_) {
+      limit.stat_.clear_events();
+    }
+    wakeup_at_ = 0;
+  }
+
+ private:
+  class CounterStat {
+   public:
+    struct Event {};
+    int32 count_ = 0;
+    void on_event(Event e) {
+      count_++;
+    }
+    void clear() {
+      count_ = 0;
+    }
+  };
+
+  uint32 wakeup_at_ = 0;
+  struct Limit {
+    TimedStat<CounterStat> stat_;
+    uint32 duration_;
+    int32 count_;
+  };
+  std::vector<Limit> limits_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/FloodControlStrict.h b/submodules/ton/tonlib-src/tdutils/td/utils/FloodControlStrict.h
new file mode 100644
index 0000000000..714acb8571
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/FloodControlStrict.h
@@ -0,0 +1,108 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#include <limits>
+
+namespace td {
+
+// More strict implementaions of flood control than FloodControlFast.
+// Should be just fine for small counters.
+class FloodControlStrict {
+ public:
+  int32 add_event(int32 now) {
+    events_.push_back(Event{now});
+    if (without_update_ > 0) {
+      without_update_--;
+    } else {
+      update(now);
+    }
+    return wakeup_at_;
+  }
+
+  // no more than count in each duration.
+  void add_limit(int32 duration, int32 count) {
+    limits_.push_back(Limit{duration, count, 0});
+  }
+
+  int32 get_wakeup_at() {
+    return wakeup_at_;
+  }
+
+  void clear_events() {
+    events_.clear();
+    for (auto &limit : limits_) {
+      limit.pos_ = 0;
+    }
+    without_update_ = 0;
+    wakeup_at_ = 0;
+  }
+
+  int32 update(int32 now) {
+    size_t min_pos = events_.size();
+
+    without_update_ = std::numeric_limits<size_t>::max();
+    for (auto &limit : limits_) {
+      if (limit.pos_ + limit.count_ < events_.size()) {
+        limit.pos_ = events_.size() - limit.count_;
+      }
+
+      // binary-search? :D
+      while (limit.pos_ < events_.size() && events_[limit.pos_].timestamp_ + limit.duration_ < now) {
+        limit.pos_++;
+      }
+
+      if (limit.count_ + limit.pos_ <= events_.size()) {
+        CHECK(limit.count_ + limit.pos_ == events_.size());
+        wakeup_at_ = max(wakeup_at_, events_[limit.pos_].timestamp_ + limit.duration_);
+        without_update_ = 0;
+      } else {
+        without_update_ = min(without_update_, limit.count_ + limit.pos_ - events_.size());
+      }
+
+      min_pos = min(min_pos, limit.pos_);
+    }
+
+    if (min_pos * 2 > events_.size()) {
+      for (auto &limit : limits_) {
+        limit.pos_ -= min_pos;
+      }
+      events_.erase(events_.begin(), events_.begin() + min_pos);
+    }
+    return wakeup_at_;
+  }
+
+ private:
+  int32 wakeup_at_ = 0;
+  struct Event {
+    int32 timestamp_;
+  };
+  struct Limit {
+    int32 duration_;
+    int32 count_;
+    size_t pos_;
+  };
+  size_t without_update_ = 0;
+  std::vector<Event> events_;
+  std::vector<Limit> limits_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/GitInfo.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/GitInfo.cpp
new file mode 100644
index 0000000000..419b6c72f5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/GitInfo.cpp
@@ -0,0 +1,32 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/GitInfo.h"
+
+#include "auto/git_info.h"
+
+namespace td {
+
+CSlice GitInfo::commit() {
+  return GIT_COMMIT;
+}
+bool GitInfo::is_dirty() {
+  return GIT_DIRTY;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/GitInfo.h b/submodules/ton/tonlib-src/tdutils/td/utils/GitInfo.h
new file mode 100644
index 0000000000..a3ace64c10
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/GitInfo.h
@@ -0,0 +1,31 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/Slice.h"
+
+namespace td {
+
+class GitInfo {
+ public:
+  static CSlice commit();
+  static bool is_dirty();
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Gzip.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/Gzip.cpp
new file mode 100644
index 0000000000..4cb615d95e
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Gzip.cpp
@@ -0,0 +1,220 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/Gzip.h"
+
+char disable_linker_warning_about_empty_file_gzip_cpp TD_UNUSED;
+
+#if TD_HAVE_ZLIB
+#include "td/utils/logging.h"
+
+#include <cstring>
+#include <limits>
+#include <utility>
+
+#include <zlib.h>
+
+namespace td {
+
+class Gzip::Impl {
+ public:
+  z_stream stream_;
+
+  // z_stream is not copyable nor movable
+  Impl() = default;
+  Impl(const Impl &other) = delete;
+  Impl &operator=(const Impl &other) = delete;
+  Impl(Impl &&other) = delete;
+  Impl &operator=(Impl &&other) = delete;
+  ~Impl() = default;
+};
+
+Status Gzip::init_encode() {
+  CHECK(mode_ == Empty);
+  init_common();
+  mode_ = Encode;
+  int ret = deflateInit2(&impl_->stream_, 6, Z_DEFLATED, 15, MAX_MEM_LEVEL, Z_DEFAULT_STRATEGY);
+  if (ret != Z_OK) {
+    return Status::Error(PSLICE() << "zlib deflate init failed: " << ret);
+  }
+  return Status::OK();
+}
+
+Status Gzip::init_decode() {
+  CHECK(mode_ == Empty);
+  init_common();
+  mode_ = Decode;
+  int ret = inflateInit2(&impl_->stream_, MAX_WBITS + 32);
+  if (ret != Z_OK) {
+    return Status::Error(PSLICE() << "zlib inflate init failed: " << ret);
+  }
+  return Status::OK();
+}
+
+void Gzip::set_input(Slice input) {
+  CHECK(input_size_ == 0);
+  CHECK(!close_input_flag_);
+  CHECK(input.size() <= std::numeric_limits<uInt>::max());
+  CHECK(impl_->stream_.avail_in == 0);
+  input_size_ = input.size();
+  impl_->stream_.avail_in = static_cast<uInt>(input.size());
+  impl_->stream_.next_in = reinterpret_cast<Bytef *>(const_cast<char *>(input.data()));
+}
+
+void Gzip::set_output(MutableSlice output) {
+  CHECK(output_size_ == 0);
+  CHECK(output.size() <= std::numeric_limits<uInt>::max());
+  CHECK(impl_->stream_.avail_out == 0);
+  output_size_ = output.size();
+  impl_->stream_.avail_out = static_cast<uInt>(output.size());
+  impl_->stream_.next_out = reinterpret_cast<Bytef *>(output.data());
+}
+
+Result<Gzip::State> Gzip::run() {
+  while (true) {
+    int ret;
+    if (mode_ == Decode) {
+      ret = inflate(&impl_->stream_, Z_NO_FLUSH);
+    } else {
+      ret = deflate(&impl_->stream_, close_input_flag_ ? Z_FINISH : Z_NO_FLUSH);
+    }
+
+    if (ret == Z_OK) {
+      return Running;
+    }
+    if (ret == Z_STREAM_END) {
+      // TODO(now): fail if input is not empty;
+      clear();
+      return Done;
+    }
+    clear();
+    return Status::Error(PSLICE() << "zlib error " << ret);
+  }
+}
+
+size_t Gzip::left_input() const {
+  return impl_->stream_.avail_in;
+}
+size_t Gzip::left_output() const {
+  return impl_->stream_.avail_out;
+}
+
+void Gzip::init_common() {
+  std::memset(&impl_->stream_, 0, sizeof(impl_->stream_));
+  impl_->stream_.zalloc = Z_NULL;
+  impl_->stream_.zfree = Z_NULL;
+  impl_->stream_.opaque = Z_NULL;
+  impl_->stream_.avail_in = 0;
+  impl_->stream_.next_in = nullptr;
+  impl_->stream_.avail_out = 0;
+  impl_->stream_.next_out = nullptr;
+
+  input_size_ = 0;
+  output_size_ = 0;
+
+  close_input_flag_ = false;
+}
+
+void Gzip::clear() {
+  if (mode_ == Decode) {
+    inflateEnd(&impl_->stream_);
+  } else if (mode_ == Encode) {
+    deflateEnd(&impl_->stream_);
+  }
+  mode_ = Empty;
+}
+
+Gzip::Gzip() : impl_(make_unique<Impl>()) {
+}
+
+Gzip::Gzip(Gzip &&other) : Gzip() {
+  swap(other);
+}
+
+Gzip &Gzip::operator=(Gzip &&other) {
+  CHECK(this != &other);
+  clear();
+  swap(other);
+  return *this;
+}
+
+void Gzip::swap(Gzip &other) {
+  using std::swap;
+  swap(impl_, other.impl_);
+  swap(input_size_, other.input_size_);
+  swap(output_size_, other.output_size_);
+  swap(close_input_flag_, other.close_input_flag_);
+  swap(mode_, other.mode_);
+}
+
+Gzip::~Gzip() {
+  clear();
+}
+
+BufferSlice gzdecode(Slice s) {
+  Gzip gzip;
+  gzip.init_decode().ensure();
+  ChainBufferWriter message;
+  gzip.set_input(s);
+  gzip.close_input();
+  double k = 2;
+  gzip.set_output(message.prepare_append(static_cast<size_t>(static_cast<double>(s.size()) * k)));
+  while (true) {
+    auto r_state = gzip.run();
+    if (r_state.is_error()) {
+      return BufferSlice();
+    }
+    auto state = r_state.ok();
+    if (state == Gzip::Done) {
+      message.confirm_append(gzip.flush_output());
+      break;
+    }
+    if (gzip.need_input()) {
+      return BufferSlice();
+    }
+    if (gzip.need_output()) {
+      message.confirm_append(gzip.flush_output());
+      k *= 1.5;
+      gzip.set_output(message.prepare_append(static_cast<size_t>(static_cast<double>(gzip.left_input()) * k)));
+    }
+  }
+  return message.extract_reader().move_as_buffer_slice();
+}
+
+BufferSlice gzencode(Slice s, double k) {
+  Gzip gzip;
+  gzip.init_encode().ensure();
+  gzip.set_input(s);
+  gzip.close_input();
+  size_t max_size = static_cast<size_t>(static_cast<double>(s.size()) * k);
+  BufferWriter message{max_size};
+  gzip.set_output(message.prepare_append());
+  auto r_state = gzip.run();
+  if (r_state.is_error()) {
+    return BufferSlice();
+  }
+  auto state = r_state.ok();
+  if (state != Gzip::Done) {
+    return BufferSlice();
+  }
+  message.confirm_append(gzip.flush_output());
+  return message.as_buffer_slice();
+}
+
+}  // namespace td
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Gzip.h b/submodules/ton/tonlib-src/tdutils/td/utils/Gzip.h
new file mode 100644
index 0000000000..3dcfdf1c58
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Gzip.h
@@ -0,0 +1,118 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#if TD_HAVE_ZLIB
+#include "td/utils/buffer.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+namespace td {
+
+class Gzip {
+ public:
+  Gzip();
+  Gzip(const Gzip &) = delete;
+  Gzip &operator=(const Gzip &) = delete;
+  Gzip(Gzip &&other);
+  Gzip &operator=(Gzip &&other);
+  ~Gzip();
+
+  enum Mode { Empty, Encode, Decode };
+  Status init(Mode mode) TD_WARN_UNUSED_RESULT {
+    if (mode == Encode) {
+      return init_encode();
+    } else if (mode == Decode) {
+      return init_decode();
+    }
+    clear();
+    return Status::OK();
+  }
+
+  Status init_encode() TD_WARN_UNUSED_RESULT;
+
+  Status init_decode() TD_WARN_UNUSED_RESULT;
+
+  void set_input(Slice input);
+
+  void set_output(MutableSlice output);
+
+  void close_input() {
+    close_input_flag_ = true;
+  }
+
+  bool need_input() const {
+    return left_input() == 0;
+  }
+
+  bool need_output() const {
+    return left_output() == 0;
+  }
+
+  size_t left_input() const;
+
+  size_t left_output() const;
+
+  size_t used_input() const {
+    return input_size_ - left_input();
+  }
+
+  size_t used_output() const {
+    return output_size_ - left_output();
+  }
+
+  size_t flush_input() {
+    auto res = used_input();
+    input_size_ = left_input();
+    return res;
+  }
+
+  size_t flush_output() {
+    auto res = used_output();
+    output_size_ = left_output();
+    return res;
+  }
+
+  enum State { Running, Done };
+  Result<State> run() TD_WARN_UNUSED_RESULT;
+
+ private:
+  class Impl;
+  unique_ptr<Impl> impl_;
+
+  size_t input_size_ = 0;
+  size_t output_size_ = 0;
+  bool close_input_flag_ = false;
+  Mode mode_ = Empty;
+
+  void init_common();
+  void clear();
+
+  void swap(Gzip &other);
+};
+
+BufferSlice gzdecode(Slice s);
+
+BufferSlice gzencode(Slice s, double k = 0.9);
+
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/GzipByteFlow.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/GzipByteFlow.cpp
new file mode 100644
index 0000000000..2b56fb42f3
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/GzipByteFlow.cpp
@@ -0,0 +1,82 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/GzipByteFlow.h"
+
+char disable_linker_warning_about_empty_file_gzipbyteflow_cpp TD_UNUSED;
+
+#if TD_HAVE_ZLIB
+#include "td/utils/common.h"
+#include "td/utils/Status.h"
+
+namespace td {
+
+void GzipByteFlow::loop() {
+  while (true) {
+    if (gzip_.need_input()) {
+      auto slice = input_->prepare_read();
+      if (slice.empty()) {
+        if (!is_input_active_) {
+          gzip_.close_input();
+        } else {
+          break;
+        }
+      } else {
+        gzip_.set_input(input_->prepare_read());
+      }
+    }
+    if (gzip_.need_output()) {
+      auto slice = output_.prepare_append();
+      CHECK(!slice.empty());
+      gzip_.set_output(slice);
+    }
+    auto r_state = gzip_.run();
+    auto output_size = gzip_.flush_output();
+    if (output_size) {
+      uncommited_size_ += output_size;
+      total_output_size_ += output_size;
+      if (total_output_size_ > max_output_size_) {
+        return finish(Status::Error("Max output size limit exceeded"));
+      }
+      output_.confirm_append(output_size);
+    }
+
+    auto input_size = gzip_.flush_input();
+    if (input_size) {
+      input_->confirm_read(input_size);
+    }
+    if (r_state.is_error()) {
+      return finish(r_state.move_as_error());
+    }
+    auto state = r_state.ok();
+    if (state == Gzip::Done) {
+      on_output_updated();
+      return consume_input();
+    }
+  }
+  if (uncommited_size_ >= MIN_UPDATE_SIZE) {
+    uncommited_size_ = 0;
+    on_output_updated();
+  }
+}
+
+constexpr size_t GzipByteFlow::MIN_UPDATE_SIZE;
+
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/GzipByteFlow.h b/submodules/ton/tonlib-src/tdutils/td/utils/GzipByteFlow.h
new file mode 100644
index 0000000000..5dba470c62
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/GzipByteFlow.h
@@ -0,0 +1,60 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/ByteFlow.h"
+#include "td/utils/Gzip.h"
+
+#include <limits>
+
+namespace td {
+
+#if TD_HAVE_ZLIB
+class GzipByteFlow final : public ByteFlowBase {
+ public:
+  GzipByteFlow() = default;
+
+  explicit GzipByteFlow(Gzip::Mode mode) {
+    gzip_.init(mode).ensure();
+  }
+
+  void init_decode() {
+    gzip_.init_decode().ensure();
+  }
+
+  void init_encode() {
+    gzip_.init_encode().ensure();
+  }
+
+  void set_max_output_size(size_t max_output_size) {
+    max_output_size_ = max_output_size;
+  }
+
+  void loop() override;
+
+ private:
+  Gzip gzip_;
+  size_t uncommited_size_ = 0;
+  size_t total_output_size_ = 0;
+  size_t max_output_size_ = std::numeric_limits<size_t>::max();
+  static constexpr size_t MIN_UPDATE_SIZE = 1 << 14;
+};
+#endif
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Hash.h b/submodules/ton/tonlib-src/tdutils/td/utils/Hash.h
new file mode 100644
index 0000000000..0478176f8c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Hash.h
@@ -0,0 +1,87 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#if TD_HAVE_ABSL
+#include <absl/hash/hash.h>
+#endif
+
+#include <utility>
+
+namespace td {
+// A simple wrapper for absl::flat_hash_map, std::unordered_map and probably some our implementaion of hash map in
+// the future
+
+// We will introduce out own Hashing utility like an absl one.
+class Hasher {
+ public:
+  Hasher() = default;
+  explicit Hasher(size_t init_value) : hash_(init_value) {
+  }
+  std::size_t finalize() const {
+    return hash_;
+  }
+
+  static Hasher combine(Hasher hasher, size_t value) {
+    hasher.hash_ ^= value;
+    return hasher;
+  }
+
+  template <class A, class B>
+  static Hasher combine(Hasher hasher, const std::pair<A, B> &value) {
+    hasher = AbslHashValue(std::move(hasher), value.first);
+    hasher = AbslHashValue(std::move(hasher), value.second);
+    return hasher;
+  }
+
+ private:
+  std::size_t hash_{0};
+};
+
+template <class IgnoreT>
+class TdHash {
+ public:
+  template <class T>
+  std::size_t operator()(const T &value) const noexcept {
+    return AbslHashValue(Hasher(), value).finalize();
+  }
+};
+
+#if TD_HAVE_ABSL
+template <class T>
+using AbslHash = absl::Hash<T>;
+#endif
+
+// default hash implementations
+template <class H, class T>
+decltype(H::combine(std::declval<H>(), std::declval<T>())) AbslHashValue(H hasher, const T &value) {
+  return H::combine(std::move(hasher), value);
+}
+
+#if TD_HAVE_ABSL
+template <class T>
+using Hash = AbslHash<T>;
+#else
+template <class T>
+using Hash = TdHash<T>;
+#endif
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/HashMap.h b/submodules/ton/tonlib-src/tdutils/td/utils/HashMap.h
new file mode 100644
index 0000000000..b3c30aab20
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/HashMap.h
@@ -0,0 +1,39 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/Hash.h"
+
+#if TD_HAVE_ABSL
+#include <absl/container/flat_hash_map.h>
+#else
+#include <unordered_map>
+#endif
+
+namespace td {
+
+#if TD_HAVE_ABSL
+template <class Key, class Value, class H = Hash<Key>>
+using HashMap = absl::flat_hash_map<Key, Value, H>;
+#else
+template <class Key, class Value, class H = Hash<Key>>
+using HashMap = std::unordered_map<Key, Value, H>;
+#endif
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/HashSet.h b/submodules/ton/tonlib-src/tdutils/td/utils/HashSet.h
new file mode 100644
index 0000000000..486e2a154a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/HashSet.h
@@ -0,0 +1,39 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/Hash.h"
+
+#if TD_HAVE_ABSL
+#include <absl/container/flat_hash_set.h>
+#else
+#include <unordered_set>
+#endif
+
+namespace td {
+
+#if TD_HAVE_ABSL
+template <class Key, class H = Hash<Key>>
+using HashSet = absl::flat_hash_set<Key, H>;
+#else
+template <class Key, class H = Hash<Key>>
+using HashSet = std::unordered_set<Key, H>;
+#endif
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/HazardPointers.h b/submodules/ton/tonlib-src/tdutils/td/utils/HazardPointers.h
new file mode 100644
index 0000000000..95f42b5e18
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/HazardPointers.h
@@ -0,0 +1,153 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#include <array>
+#include <atomic>
+#include <memory>
+
+namespace td {
+
+template <class T, int MaxPointersN = 1, class Deleter = std::default_delete<T>>
+class HazardPointers {
+ public:
+  explicit HazardPointers(size_t threads_n) : threads_(threads_n) {
+    for (auto &data : threads_) {
+      for (auto &ptr : data.hazard_) {
+// workaround for https://gcc.gnu.org/bugzilla/show_bug.cgi?id=64658
+#if TD_GCC && GCC_VERSION <= 40902
+        ptr = nullptr;
+#else
+        std::atomic_init(&ptr, static_cast<T *>(nullptr));
+#endif
+      }
+    }
+  }
+  HazardPointers(const HazardPointers &other) = delete;
+  HazardPointers &operator=(const HazardPointers &other) = delete;
+  HazardPointers(HazardPointers &&other) = delete;
+  HazardPointers &operator=(HazardPointers &&other) = delete;
+
+  class Holder {
+   public:
+    template <class S>
+    S *protect(std::atomic<S *> &to_protect) {
+      return do_protect(hazard_ptr_, to_protect);
+    }
+    Holder(HazardPointers &hp, size_t thread_id, size_t pos) : Holder(hp.get_hazard_ptr(thread_id, pos)) {
+      CHECK(hazard_ptr_.load() == 0);
+      hazard_ptr_.store(reinterpret_cast<T *>(1));
+    }
+    Holder(const Holder &other) = delete;
+    Holder &operator=(const Holder &other) = delete;
+    Holder(Holder &&other) = delete;
+    Holder &operator=(Holder &&other) = delete;
+    ~Holder() {
+      clear();
+    }
+    void clear() {
+      hazard_ptr_.store(nullptr, std::memory_order_release);
+    }
+
+   private:
+    friend class HazardPointers;
+    explicit Holder(std::atomic<T *> &ptr) : hazard_ptr_(ptr) {
+    }
+    std::atomic<T *> &hazard_ptr_;
+  };
+
+  void retire(size_t thread_id, T *ptr = nullptr) {
+    CHECK(thread_id < threads_.size());
+    auto &data = threads_[thread_id];
+    if (ptr) {
+      data.to_delete_.push_back(std::unique_ptr<T, Deleter>(ptr));
+    }
+    for (auto it = data.to_delete_.begin(); it != data.to_delete_.end();) {
+      if (!is_protected(it->get())) {
+        it->reset();
+        it = data.to_delete_.erase(it);
+      } else {
+        ++it;
+      }
+    }
+  }
+
+  // old inteface
+  T *protect(size_t thread_id, size_t pos, std::atomic<T *> &ptr) {
+    return do_protect(get_hazard_ptr(thread_id, pos), ptr);
+  }
+  void clear(size_t thread_id, size_t pos) {
+    do_clear(get_hazard_ptr(thread_id, pos));
+  }
+
+  size_t to_delete_size_unsafe() const {
+    size_t res = 0;
+    for (auto &thread : threads_) {
+      res += thread.to_delete_.size();
+    }
+    return res;
+  }
+
+ private:
+  struct ThreadData {
+    std::array<std::atomic<T *>, MaxPointersN> hazard_;
+    char pad[TD_CONCURRENCY_PAD - sizeof(hazard_)];
+
+    // stupid gc
+    std::vector<std::unique_ptr<T, Deleter>> to_delete_;
+    char pad2[TD_CONCURRENCY_PAD - sizeof(to_delete_)];
+  };
+  std::vector<ThreadData> threads_;
+  char pad2[TD_CONCURRENCY_PAD - sizeof(threads_)];
+
+  template <class S>
+  static S *do_protect(std::atomic<T *> &hazard_ptr, std::atomic<S *> &to_protect) {
+    T *saved = nullptr;
+    T *to_save;
+    while ((to_save = to_protect.load()) != saved) {
+      hazard_ptr.store(to_save);
+      saved = to_save;
+    }
+    return static_cast<S *>(saved);
+  }
+
+  static void do_clear(std::atomic<T *> &hazard_ptr) {
+    hazard_ptr.store(nullptr, std::memory_order_release);
+  }
+
+  bool is_protected(T *ptr) {
+    for (auto &thread : threads_) {
+      for (auto &hazard_ptr : thread.hazard_) {
+        if (hazard_ptr.load() == ptr) {
+          return true;
+        }
+      }
+    }
+    return false;
+  }
+
+  std::atomic<T *> &get_hazard_ptr(size_t thread_id, size_t pos) {
+    CHECK(thread_id < threads_.size());
+    return threads_[thread_id].hazard_[pos];
+  }
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Heap.h b/submodules/ton/tonlib-src/tdutils/td/utils/Heap.h
new file mode 100644
index 0000000000..6349ff65ff
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Heap.h
@@ -0,0 +1,170 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+namespace td {
+
+struct HeapNode {
+  bool in_heap() const {
+    return pos_ != -1;
+  }
+  bool is_top() const {
+    return pos_ == 0;
+  }
+  void remove() {
+    pos_ = -1;
+  }
+  int pos_ = -1;
+};
+
+template <class KeyT, int K = 4>
+class KHeap {
+ public:
+  bool empty() const {
+    return array_.empty();
+  }
+  size_t size() const {
+    return array_.size();
+  }
+
+  KeyT top_key() const {
+    return array_[0].key_;
+  }
+
+  HeapNode *pop() {
+    CHECK(!empty());
+    HeapNode *result = array_[0].node_;
+    result->remove();
+    erase(0);
+    return result;
+  }
+
+  void insert(KeyT key, HeapNode *node) {
+    CHECK(!node->in_heap());
+    array_.push_back({key, node});
+    fix_up(static_cast<int>(array_.size()) - 1);
+  }
+
+  void fix(KeyT key, HeapNode *node) {
+    CHECK(node->in_heap());
+    int pos = node->pos_;
+    KeyT old_key = array_[pos].key_;
+    array_[pos].key_ = key;
+    if (key < old_key) {
+      fix_up(pos);
+    } else {
+      fix_down(pos);
+    }
+  }
+
+  void erase(HeapNode *node) {
+    CHECK(node->in_heap());
+    int pos = node->pos_;
+    node->remove();
+    erase(pos);
+  }
+
+  template <class F>
+  void for_each(F &&f) const {
+    for (auto &it : array_) {
+      f(it.key_, it.node_);
+    }
+  }
+
+  template <class F>
+  void for_each(F &&f) {
+    for (auto &it : array_) {
+      f(it.key_, it.node_);
+    }
+  }
+
+  void check() const {
+    for (size_t i = 0; i < array_.size(); i++) {
+      for (size_t j = i * K + 1; j < i * K + 1 + K && j < array_.size(); j++) {
+        CHECK(array_[i].key_ <= array_[j].key_);
+      }
+    }
+  }
+
+ private:
+  struct Item {
+    KeyT key_;
+    HeapNode *node_;
+  };
+  vector<Item> array_;
+
+  void fix_up(int pos) {
+    auto item = array_[pos];
+
+    while (pos) {
+      int parent_pos = (pos - 1) / K;
+      auto parent_item = array_[parent_pos];
+
+      if (parent_item.key_ < item.key_) {
+        break;
+      }
+
+      parent_item.node_->pos_ = pos;
+      array_[pos] = parent_item;
+      pos = parent_pos;
+    }
+
+    item.node_->pos_ = pos;
+    array_[pos] = item;
+  }
+
+  void fix_down(int pos) {
+    auto item = array_[pos];
+    while (true) {
+      int left_pos = pos * K + 1;
+      int right_pos = min(left_pos + K, static_cast<int>(array_.size()));
+      int next_pos = pos;
+      KeyT next_key = item.key_;
+      for (int i = left_pos; i < right_pos; i++) {
+        KeyT i_key = array_[i].key_;
+        if (i_key < next_key) {
+          next_key = i_key;
+          next_pos = i;
+        }
+      }
+      if (next_pos == pos) {
+        break;
+      }
+      array_[pos] = array_[next_pos];
+      array_[pos].node_->pos_ = pos;
+      pos = next_pos;
+    }
+
+    item.node_->pos_ = pos;
+    array_[pos] = item;
+  }
+
+  void erase(int pos) {
+    array_[pos] = array_.back();
+    array_.pop_back();
+    if (pos < static_cast<int>(array_.size())) {
+      fix_down(pos);
+      fix_up(pos);
+    }
+  }
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Hints.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/Hints.cpp
new file mode 100644
index 0000000000..e3b2b11e4d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Hints.cpp
@@ -0,0 +1,245 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/Hints.h"
+
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/Slice.h"
+#include "td/utils/translit.h"
+#include "td/utils/unicode.h"
+#include "td/utils/utf8.h"
+
+#include <algorithm>
+
+namespace td {
+
+vector<string> Hints::fix_words(vector<string> words) {
+  std::sort(words.begin(), words.end());
+
+  size_t new_words_size = 0;
+  for (size_t i = 0; i != words.size(); i++) {
+    if (i == words.size() - 1 || !begins_with(words[i + 1], words[i])) {
+      if (i != new_words_size) {
+        words[new_words_size] = std::move(words[i]);
+      }
+      new_words_size++;
+    }
+  }
+  words.resize(new_words_size);
+  return words;
+}
+
+vector<string> Hints::get_words(Slice name, bool is_search) {
+  bool in_word = false;
+  string word;
+  vector<string> words;
+  auto pos = name.ubegin();
+  auto end = name.uend();
+  while (pos != end) {
+    uint32 code;
+    pos = next_utf8_unsafe(pos, &code, is_search ? "get_words_search" : "get_words_add");
+
+    code = prepare_search_character(code);
+    if (code == 0) {
+      continue;
+    }
+    if (code == ' ') {
+      if (in_word) {
+        words.push_back(std::move(word));
+        word.clear();
+        in_word = false;
+      }
+    } else {
+      in_word = true;
+      code = remove_diacritics(code);
+      append_utf8_character(word, code);
+    }
+  }
+  if (in_word) {
+    words.push_back(std::move(word));
+  }
+
+  return fix_words(std::move(words));
+}
+
+void Hints::add_word(const string &word, KeyT key, std::map<string, vector<KeyT>> &word_to_keys) {
+  vector<KeyT> &keys = word_to_keys[word];
+  CHECK(std::find(keys.begin(), keys.end(), key) == keys.end());
+  keys.push_back(key);
+}
+
+void Hints::delete_word(const string &word, KeyT key, std::map<string, vector<KeyT>> &word_to_keys) {
+  vector<KeyT> &keys = word_to_keys[word];
+  auto key_it = std::find(keys.begin(), keys.end(), key);
+  CHECK(key_it != keys.end());
+  if (keys.size() == 1) {
+    word_to_keys.erase(word);
+  } else {
+    CHECK(keys.size() > 1);
+    *key_it = keys.back();
+    keys.pop_back();
+  }
+}
+
+void Hints::add(KeyT key, Slice name) {
+  // LOG(ERROR) << "Add " << key << ": " << name;
+  auto it = key_to_name_.find(key);
+  if (it != key_to_name_.end()) {
+    if (it->second == name) {
+      return;
+    }
+    vector<string> old_transliterations;
+    for (auto &old_word : get_words(it->second, false)) {
+      delete_word(old_word, key, word_to_keys_);
+
+      for (auto &w : get_word_transliterations(old_word, false)) {
+        if (w != old_word) {
+          old_transliterations.push_back(std::move(w));
+        }
+      }
+    }
+    for (auto &word : fix_words(old_transliterations)) {
+      delete_word(word, key, translit_word_to_keys_);
+    }
+  }
+  if (name.empty()) {
+    if (it != key_to_name_.end()) {
+      key_to_name_.erase(it);
+    }
+    key_to_rating_.erase(key);
+    return;
+  }
+
+  vector<string> transliterations;
+  for (auto &word : get_words(name, false)) {
+    add_word(word, key, word_to_keys_);
+
+    for (auto &w : get_word_transliterations(word, false)) {
+      if (w != word) {
+        transliterations.push_back(std::move(w));
+      }
+    }
+  }
+  for (auto &word : fix_words(transliterations)) {
+    add_word(word, key, translit_word_to_keys_);
+  }
+
+  key_to_name_[key] = name.str();
+}
+
+void Hints::set_rating(KeyT key, RatingT rating) {
+  // LOG(ERROR) << "Set rating " << key << ": " << rating;
+  key_to_rating_[key] = rating;
+}
+
+void Hints::add_search_results(vector<KeyT> &results, const string &word,
+                               const std::map<string, vector<KeyT>> &word_to_keys) {
+  LOG(DEBUG) << "Search for word " << word;
+  auto it = word_to_keys.lower_bound(word);
+  while (it != word_to_keys.end() && begins_with(it->first, word)) {
+    results.insert(results.end(), it->second.begin(), it->second.end());
+    ++it;
+  }
+}
+
+vector<Hints::KeyT> Hints::search_word(const string &word) const {
+  vector<KeyT> results;
+  add_search_results(results, word, translit_word_to_keys_);
+  for (auto w : get_word_transliterations(word, true)) {
+    add_search_results(results, w, word_to_keys_);
+  }
+
+  std::sort(results.begin(), results.end());
+  results.erase(std::unique(results.begin(), results.end()), results.end());
+  return results;
+}
+
+std::pair<size_t, vector<Hints::KeyT>> Hints::search(Slice query, int32 limit, bool return_all_for_empty_query) const {
+  // LOG(ERROR) << "Search " << query;
+  vector<KeyT> results;
+
+  if (limit < 0) {
+    return {key_to_name_.size(), std::move(results)};
+  }
+
+  auto words = get_words(query, true);
+  if (return_all_for_empty_query && words.empty()) {
+    results.reserve(key_to_name_.size());
+    for (auto &it : key_to_name_) {
+      results.push_back(it.first);
+    }
+  }
+
+  for (size_t i = 0; i < words.size(); i++) {
+    vector<KeyT> keys = search_word(words[i]);
+    if (i == 0) {
+      results = std::move(keys);
+      continue;
+    }
+
+    // now need to intersect two lists
+    size_t results_pos = 0;
+    size_t keys_pos = 0;
+    size_t new_results_size = 0;
+    while (results_pos != results.size() && keys_pos != keys.size()) {
+      if (results[results_pos] < keys[keys_pos]) {
+        results_pos++;
+      } else if (results[results_pos] > keys[keys_pos]) {
+        keys_pos++;
+      } else {
+        results[new_results_size++] = results[results_pos];
+        results_pos++;
+        keys_pos++;
+      }
+    }
+    results.resize(new_results_size);
+  }
+
+  auto total_size = results.size();
+  if (total_size < static_cast<size_t>(limit)) {
+    std::sort(results.begin(), results.end(), CompareByRating(key_to_rating_));
+  } else {
+    std::partial_sort(results.begin(), results.begin() + limit, results.end(), CompareByRating(key_to_rating_));
+    results.resize(limit);
+  }
+
+  return {total_size, std::move(results)};
+}
+
+bool Hints::has_key(KeyT key) const {
+  return key_to_name_.find(key) != key_to_name_.end();
+}
+
+string Hints::key_to_string(KeyT key) const {
+  auto it = key_to_name_.find(key);
+  if (it == key_to_name_.end()) {
+    return string();
+  }
+  return it->second;
+}
+
+std::pair<size_t, vector<Hints::KeyT>> Hints::search_empty(int32 limit) const {
+  return search(Slice(), limit, true);
+}
+
+size_t Hints::size() const {
+  return key_to_name_.size();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Hints.h b/submodules/ton/tonlib-src/tdutils/td/utils/Hints.h
new file mode 100644
index 0000000000..59049541b5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Hints.h
@@ -0,0 +1,97 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+
+#include <map>
+#include <unordered_map>
+#include <utility>
+
+namespace td {
+
+// TODO template KeyT
+class Hints {
+  using KeyT = int64;
+  using RatingT = int64;
+
+ public:
+  void add(KeyT key, Slice name);
+
+  void remove(KeyT key) {
+    add(key, "");
+  }
+
+  void set_rating(KeyT key, RatingT rating);
+
+  std::pair<size_t, vector<KeyT>> search(
+      Slice query, int32 limit,
+      bool return_all_for_empty_query = false) const;  // TODO sort by name instead of sort by rating
+
+  bool has_key(KeyT key) const;
+
+  string key_to_string(KeyT key) const;
+
+  std::pair<size_t, vector<KeyT>> search_empty(int32 limit) const;  // == search("", limit, true)
+
+  size_t size() const;
+
+ private:
+  std::map<string, vector<KeyT>> word_to_keys_;
+  std::map<string, vector<KeyT>> translit_word_to_keys_;
+  std::unordered_map<KeyT, string> key_to_name_;
+  std::unordered_map<KeyT, RatingT> key_to_rating_;
+
+  static void add_word(const string &word, KeyT key, std::map<string, vector<KeyT>> &word_to_keys);
+  static void delete_word(const string &word, KeyT key, std::map<string, vector<KeyT>> &word_to_keys);
+
+  static vector<string> fix_words(vector<string> words);
+
+  static vector<string> get_words(Slice name, bool is_search);
+
+  static void add_search_results(vector<KeyT> &results, const string &word,
+                                 const std::map<string, vector<KeyT>> &word_to_keys);
+
+  vector<KeyT> search_word(const string &word) const;
+
+  class CompareByRating {
+    const std::unordered_map<KeyT, RatingT> &key_to_rating_;
+
+    RatingT get_rating(const KeyT &key) const {
+      auto it = key_to_rating_.find(key);
+      if (it == key_to_rating_.end()) {
+        return RatingT();
+      }
+      return it->second;
+    }
+
+   public:
+    explicit CompareByRating(const std::unordered_map<KeyT, RatingT> &key_to_rating) : key_to_rating_(key_to_rating) {
+    }
+
+    bool operator()(const KeyT &lhs, const KeyT &rhs) const {
+      auto lhs_rating = get_rating(lhs);
+      auto rhs_rating = get_rating(rhs);
+      return lhs_rating < rhs_rating || (lhs_rating == rhs_rating && lhs < rhs);
+    }
+  };
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/HttpUrl.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/HttpUrl.cpp
new file mode 100644
index 0000000000..7b15f2cb84
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/HttpUrl.cpp
@@ -0,0 +1,211 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/HttpUrl.h"
+
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/Parser.h"
+
+namespace td {
+
+string HttpUrl::get_url() const {
+  string result;
+  switch (protocol_) {
+    case Protocol::HTTP:
+      result += "http://";
+      break;
+    case Protocol::HTTPS:
+      result += "https://";
+      break;
+    default:
+      UNREACHABLE();
+  }
+  if (!userinfo_.empty()) {
+    result += userinfo_;
+    result += '@';
+  }
+  if (is_ipv6_) {
+    result += '[';
+  }
+  result += host_;
+  if (is_ipv6_) {
+    result += ']';
+  }
+  if (specified_port_ > 0) {
+    result += ':';
+    result += to_string(specified_port_);
+  }
+  LOG_CHECK(!query_.empty() && query_[0] == '/') << query_;
+  result += query_;
+  return result;
+}
+
+Result<HttpUrl> parse_url(Slice url, HttpUrl::Protocol default_protocol) {
+  // url == [https?://][userinfo@]host[:port]
+  ConstParser parser(url);
+  string protocol_str = to_lower(parser.read_till_nofail(':'));
+
+  HttpUrl::Protocol protocol;
+  if (parser.start_with("://")) {
+    parser.advance(3);
+    if (protocol_str == "http") {
+      protocol = HttpUrl::Protocol::HTTP;
+    } else if (protocol_str == "https") {
+      protocol = HttpUrl::Protocol::HTTPS;
+    } else {
+      return Status::Error("Unsupported URL protocol");
+    }
+  } else {
+    parser = ConstParser(url);
+    protocol = default_protocol;
+  }
+  Slice userinfo_host_port = parser.read_till_nofail("/?#");
+
+  int port = 0;
+  const char *colon = userinfo_host_port.end() - 1;
+  while (colon > userinfo_host_port.begin() && *colon != ':' && *colon != ']' && *colon != '@') {
+    colon--;
+  }
+  Slice userinfo_host;
+  if (colon > userinfo_host_port.begin() && *colon == ':') {
+    port = to_integer<int>(Slice(colon + 1, userinfo_host_port.end()));
+    userinfo_host = Slice(userinfo_host_port.begin(), colon);
+  } else {
+    userinfo_host = userinfo_host_port;
+  }
+  if (port < 0 || port > 65535) {
+    return Status::Error("Wrong port number specified in the URL");
+  }
+
+  auto at_pos = userinfo_host.rfind('@');
+  Slice userinfo = at_pos == static_cast<size_t>(-1) ? "" : userinfo_host.substr(0, at_pos);
+  Slice host = userinfo_host.substr(at_pos + 1);
+
+  bool is_ipv6 = false;
+  if (!host.empty() && host[0] == '[' && host.back() == ']') {
+    host.remove_prefix(1);
+    host.remove_suffix(1);
+    is_ipv6 = true;
+  }
+  if (host.empty()) {
+    return Status::Error("URL host is empty");
+  }
+  if (host == ".") {
+    return Status::Error("Host is invalid");
+  }
+
+  int specified_port = port;
+  if (port == 0) {
+    if (protocol == HttpUrl::Protocol::HTTP) {
+      port = 80;
+    } else {
+      CHECK(protocol == HttpUrl::Protocol::HTTPS);
+      port = 443;
+    }
+  }
+
+  Slice query = parser.read_all();
+  while (!query.empty() && is_space(query.back())) {
+    query.remove_suffix(1);
+  }
+  if (query.empty()) {
+    query = Slice("/");
+  }
+  string query_str;
+  if (query[0] != '/') {
+    query_str = '/';
+  }
+  for (auto c : query) {
+    if (static_cast<unsigned char>(c) <= 0x20) {
+      query_str += '%';
+      query_str += "0123456789ABCDEF"[c / 16];
+      query_str += "0123456789ABCDEF"[c % 16];
+    } else {
+      query_str += c;
+    }
+  }
+
+  string host_str = to_lower(host);
+  for (size_t i = 0; i < host_str.size(); i++) {
+    char c = host_str[i];
+    if (is_ipv6) {
+      if (c == ':' || ('0' <= c && c <= '9') || ('a' <= c && c <= 'f') || c == '.') {
+        continue;
+      }
+      return Status::Error("Wrong IPv6 URL host");
+    }
+
+    if (('a' <= c && c <= 'z') || c == '.' || ('0' <= c && c <= '9') || c == '-' || c == '_' || c == '!' || c == '$' ||
+        c == ',' || c == '~' || c == '*' || c == '\'' || c == '(' || c == ')' || c == ';' || c == '&' || c == '+' ||
+        c == '=') {
+      // symbols allowed by RFC 7230 and RFC 3986
+      continue;
+    }
+    if (c == '%') {
+      c = host_str[++i];
+      if (('a' <= c && c <= 'f') || ('0' <= c && c <= '9')) {
+        c = host_str[++i];
+        if (('a' <= c && c <= 'f') || ('0' <= c && c <= '9')) {
+          // percent encoded symbol as allowed by RFC 7230 and RFC 3986
+          continue;
+        }
+      }
+      return Status::Error("Wrong percent-encoded symbol in URL host");
+    }
+
+    // all other symbols aren't allowed
+    unsigned char uc = static_cast<unsigned char>(c);
+    if (uc >= 128) {
+      // but we allow plain UTF-8 symbols
+      continue;
+    }
+    return Status::Error("Wrong URL host");
+  }
+
+  return HttpUrl{protocol, userinfo.str(), std::move(host_str), is_ipv6, specified_port, port, std::move(query_str)};
+}
+
+StringBuilder &operator<<(StringBuilder &sb, const HttpUrl &url) {
+  sb << tag("protocol", url.protocol_ == HttpUrl::Protocol::HTTP ? "HTTP" : "HTTPS") << tag("userinfo", url.userinfo_)
+     << tag("host", url.host_) << tag("port", url.port_) << tag("query", url.query_);
+  return sb;
+}
+
+string get_url_query_file_name(const string &query) {
+  Slice query_slice = query;
+  query_slice.truncate(query.find_first_of("?#"));
+
+  auto slash_pos = query_slice.rfind('/');
+  if (slash_pos < query_slice.size()) {
+    return query_slice.substr(slash_pos + 1).str();
+  }
+  return query_slice.str();
+}
+
+string get_url_file_name(Slice url) {
+  auto r_http_url = parse_url(url);
+  if (r_http_url.is_error()) {
+    LOG(WARNING) << "Receive wrong URL \"" << url << '"';
+    return string();
+  }
+  return get_url_query_file_name(r_http_url.ok().query_);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/HttpUrl.h b/submodules/ton/tonlib-src/tdutils/td/utils/HttpUrl.h
new file mode 100644
index 0000000000..dbe23c4f6e
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/HttpUrl.h
@@ -0,0 +1,60 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+#include "td/utils/StringBuilder.h"
+
+namespace td {
+
+class HttpUrl {
+ public:
+  enum class Protocol { HTTP, HTTPS } protocol_ = Protocol::HTTP;
+  string userinfo_;
+  string host_;
+  bool is_ipv6_ = false;
+  int specified_port_ = 0;
+  int port_ = 0;
+  string query_;
+
+  string get_url() const;
+
+  HttpUrl(Protocol protocol, string userinfo, string host, bool is_ipv6, int specified_port, int port, string query)
+      : protocol_(protocol)
+      , userinfo_(std::move(userinfo))
+      , host_(std::move(host))
+      , is_ipv6_(is_ipv6)
+      , specified_port_(specified_port)
+      , port_(port)
+      , query_(std::move(query)) {
+  }
+};
+
+Result<HttpUrl> parse_url(Slice url,
+                          HttpUrl::Protocol default_protocol = HttpUrl::Protocol::HTTP) TD_WARN_UNUSED_RESULT;
+
+StringBuilder &operator<<(StringBuilder &sb, const HttpUrl &url);
+
+string get_url_query_file_name(const string &query);
+
+string get_url_file_name(Slice url);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/JsonBuilder.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/JsonBuilder.cpp
new file mode 100644
index 0000000000..82aead4736
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/JsonBuilder.cpp
@@ -0,0 +1,698 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/JsonBuilder.h"
+
+#include "td/utils/misc.h"
+#include "td/utils/ScopeGuard.h"
+
+#include <cstring>
+
+namespace td {
+
+StringBuilder &operator<<(StringBuilder &sb, const JsonRawString &val) {
+  sb << '"';
+  SCOPE_EXIT {
+    sb << '"';
+  };
+  auto *s = val.value_.begin();
+  auto len = val.value_.size();
+
+  for (size_t pos = 0; pos < len; pos++) {
+    auto ch = static_cast<unsigned char>(s[pos]);
+    switch (ch) {
+      case '"':
+        sb << '\\' << '"';
+        break;
+      case '\\':
+        sb << '\\' << '\\';
+        break;
+      case '\b':
+        sb << '\\' << 'b';
+        break;
+      case '\f':
+        sb << '\\' << 'f';
+        break;
+      case '\n':
+        sb << '\\' << 'n';
+        break;
+      case '\r':
+        sb << '\\' << 'r';
+        break;
+      case '\t':
+        sb << '\\' << 't';
+        break;
+      default:
+        if (ch <= 31) {
+          sb << JsonOneChar(s[pos]);
+          break;
+        }
+        sb << s[pos];
+        break;
+    }
+  }
+  return sb;
+}
+
+StringBuilder &operator<<(StringBuilder &sb, const JsonString &val) {
+  sb << '"';
+  SCOPE_EXIT {
+    sb << '"';
+  };
+  auto *s = val.str_.begin();
+  auto len = val.str_.size();
+
+  for (size_t pos = 0; pos < len; pos++) {
+    auto ch = static_cast<unsigned char>(s[pos]);
+    switch (ch) {
+      case '"':
+        sb << '\\' << '"';
+        break;
+      case '\\':
+        sb << '\\' << '\\';
+        break;
+      case '\b':
+        sb << '\\' << 'b';
+        break;
+      case '\f':
+        sb << '\\' << 'f';
+        break;
+      case '\n':
+        sb << '\\' << 'n';
+        break;
+      case '\r':
+        sb << '\\' << 'r';
+        break;
+      case '\t':
+        sb << '\\' << 't';
+        break;
+      default:
+        if (ch <= 31) {
+          sb << JsonOneChar(s[pos]);
+          break;
+        }
+        if (128 <= ch) {
+          int a = s[pos];
+          CHECK((a & 0x40) != 0);
+
+          CHECK(pos + 1 < len);
+          int b = s[++pos];
+          CHECK((b & 0xc0) == 0x80);
+          if ((a & 0x20) == 0) {
+            CHECK((a & 0x1e) > 0);
+            sb << JsonChar(((a & 0x1f) << 6) | (b & 0x3f));
+            break;
+          }
+
+          CHECK(pos + 1 < len);
+          int c = s[++pos];
+          CHECK((c & 0xc0) == 0x80);
+          if ((a & 0x10) == 0) {
+            CHECK(((a & 0x0f) | (b & 0x20)) > 0);
+            sb << JsonChar(((a & 0x0f) << 12) | ((b & 0x3f) << 6) | (c & 0x3f));
+            break;
+          }
+
+          CHECK(pos + 1 < len);
+          int d = s[++pos];
+          CHECK((d & 0xc0) == 0x80);
+          if ((a & 0x08) == 0) {
+            CHECK(((a & 0x07) | (b & 0x30)) > 0);
+            sb << JsonChar(((a & 0x07) << 18) | ((b & 0x3f) << 12) | ((c & 0x3f) << 6) | (d & 0x3f));
+            break;
+          }
+
+          UNREACHABLE();
+          break;
+        }
+        sb << s[pos];
+        break;
+    }
+  }
+  return sb;
+}
+
+Result<MutableSlice> json_string_decode(Parser &parser) {
+  if (!parser.try_skip('"')) {
+    return Status::Error("Opening '\"' expected");
+  }
+  auto *cur_src = parser.data().data();
+  auto *end_src = parser.data().end();
+  auto *end = cur_src;
+  while (end < end_src && end[0] != '"') {
+    if (end[0] == '\\') {
+      end++;
+    }
+    end++;
+  }
+  if (end >= end_src) {
+    return Status::Error("Closing '\"' not found");
+  }
+  parser.advance(end + 1 - cur_src);
+  end_src = end;
+
+  auto *cur_dest = cur_src;
+  auto *begin_dest = cur_src;
+
+  while (cur_src != end_src) {
+    auto *slash = static_cast<char *>(std::memchr(cur_src, '\\', end_src - cur_src));
+    if (slash == nullptr) {
+      slash = end_src;
+    }
+    std::memmove(cur_dest, cur_src, slash - cur_src);
+    cur_dest += slash - cur_src;
+    cur_src = slash;
+    if (cur_src != end_src) {
+      cur_src++;
+      if (cur_src == end_src) {
+        // TODO UNREACHABLE();
+        return Status::Error("Unexpected end of string");
+      }
+      switch (*cur_src) {
+        case '"':
+        case '\\':
+        case '/':
+          *cur_dest++ = *cur_src++;
+          break;
+        case 'b':
+          *cur_dest++ = '\b';
+          cur_src++;
+          break;
+        case 'f':
+          *cur_dest++ = '\f';
+          cur_src++;
+          break;
+        case 'n':
+          *cur_dest++ = '\n';
+          cur_src++;
+          break;
+        case 'r':
+          *cur_dest++ = '\r';
+          cur_src++;
+          break;
+        case 't':
+          *cur_dest++ = '\t';
+          cur_src++;
+          break;
+        case 'u': {
+          cur_src++;
+          if (cur_src + 4 > end_src) {
+            return Status::Error("\\u has less than 4 symbols");
+          }
+          int num = 0;
+          for (int i = 0; i < 4; i++, cur_src++) {
+            int d = hex_to_int(*cur_src);
+            if (d == 16) {
+              return Status::Error("Invalid \\u -- not hex digit");
+            }
+            num = num * 16 + d;
+          }
+          if (0xD7FF < num && num < 0xE000) {
+            if (cur_src + 6 <= end_src && cur_src[0] == '\\' && cur_src[1] == 'u') {
+              cur_src += 2;
+              int new_num = 0;
+              for (int i = 0; i < 4; i++, cur_src++) {
+                int d = hex_to_int(*cur_src);
+                if (d == 16) {
+                  return Status::Error("Invalid \\u -- not hex digit");
+                }
+                new_num = new_num * 16 + d;
+              }
+              if (0xD7FF < new_num && new_num < 0xE000) {
+                num = (((num & 0x3FF) << 10) | (new_num & 0x3FF)) + 0x10000;
+              } else {
+                cur_src -= 6;
+              }
+            }
+          }
+
+          if (num < 128) {
+            *cur_dest++ = static_cast<char>(num);
+          } else if (num < 0x800) {
+            *cur_dest++ = static_cast<char>(0xc0 + (num >> 6));
+            *cur_dest++ = static_cast<char>(0x80 + (num & 63));
+          } else if (num <= 0xffff) {
+            *cur_dest++ = static_cast<char>(0xe0 + (num >> 12));
+            *cur_dest++ = static_cast<char>(0x80 + ((num >> 6) & 63));
+            *cur_dest++ = static_cast<char>(0x80 + (num & 63));
+          } else {
+            *cur_dest++ = static_cast<char>(0xf0 + (num >> 18));
+            *cur_dest++ = static_cast<char>(0x80 + ((num >> 12) & 63));
+            *cur_dest++ = static_cast<char>(0x80 + ((num >> 6) & 63));
+            *cur_dest++ = static_cast<char>(0x80 + (num & 63));
+          }
+          break;
+        }
+      }
+    }
+  }
+  CHECK(cur_dest <= end_src);
+  return MutableSlice(begin_dest, cur_dest);
+}
+
+Status json_string_skip(Parser &parser) {
+  if (!parser.try_skip('"')) {
+    return Status::Error("Opening '\"' expected");
+  }
+  auto *begin_src = parser.data().data();
+  auto *cur_src = begin_src;
+  auto *end_src = parser.data().end();
+  auto *end = cur_src;
+  while (end < end_src && *end != '"') {
+    if (*end == '\\') {
+      end++;
+    }
+    end++;
+  }
+  if (end >= end_src) {
+    return Status::Error("Closing '\"' not found");
+  }
+  parser.advance(end + 1 - cur_src);
+  end_src = end;
+
+  while (cur_src != end_src) {
+    auto *slash = static_cast<char *>(std::memchr(cur_src, '\\', end_src - cur_src));
+    if (slash == nullptr) {
+      slash = end_src;
+    }
+    cur_src = slash;
+    if (cur_src != end_src) {
+      cur_src++;
+      if (cur_src == end_src) {
+        // TODO UNREACHABLE();
+        return Status::Error("Unexpected end of string");
+      }
+      switch (*cur_src) {
+        case '"':
+        case '\\':
+        case '/':
+        case 'b':
+        case 'f':
+        case 'n':
+        case 'r':
+        case 't':
+          cur_src++;
+          break;
+        case 'u': {
+          cur_src++;
+          if (cur_src + 4 > end_src) {
+            return Status::Error("\\u has less than 4 symbols");
+          }
+          int num = 0;
+          for (int i = 0; i < 4; i++, cur_src++) {
+            int d = hex_to_int(*cur_src);
+            if (d == 16) {
+              return Status::Error("Invalid \\u -- not hex digit");
+            }
+            num = num * 16 + d;
+          }
+          if (0xD7FF < num && num < 0xE000) {
+            if (cur_src + 6 <= end_src && cur_src[0] == '\\' && cur_src[1] == 'u') {
+              cur_src += 2;
+              int new_num = 0;
+              for (int i = 0; i < 4; i++, cur_src++) {
+                int d = hex_to_int(*cur_src);
+                if (d == 16) {
+                  return Status::Error("Invalid \\u -- not hex digit");
+                }
+                new_num = new_num * 16 + d;
+              }
+              if (0xD7FF < new_num && new_num < 0xE000) {
+                // num = (((num & 0x3FF) << 10) | (new_num & 0x3FF)) + 0x10000;
+              } else {
+                cur_src -= 6;
+              }
+            }
+          }
+          break;
+        }
+      }
+    }
+  }
+  return Status::OK();
+}
+
+Result<JsonValue> do_json_decode(Parser &parser, int32 max_depth) {
+  if (max_depth < 0) {
+    return Status::Error("Too big object depth");
+  }
+
+  parser.skip_whitespaces();
+  switch (parser.peek_char()) {
+    case 'f':
+      if (parser.skip_start_with("false")) {
+        return JsonValue::create_boolean(false);
+      }
+      return Status::Error("Token starts with 'f' -- false expected");
+    case 't':
+      if (parser.skip_start_with("true")) {
+        return JsonValue::create_boolean(true);
+      }
+      return Status::Error("Token starts with 't' -- true expected");
+    case 'n':
+      if (parser.skip_start_with("null")) {
+        return JsonValue();
+      }
+      return Status::Error("Token starts with 'n' -- null expected");
+    case '"': {
+      TRY_RESULT(slice, json_string_decode(parser));
+      return JsonValue::create_string(slice);
+    }
+    case '[': {
+      parser.skip('[');
+      parser.skip_whitespaces();
+      std::vector<JsonValue> res;
+      if (parser.try_skip(']')) {
+        return JsonValue::create_array(std::move(res));
+      }
+      while (true) {
+        if (parser.empty()) {
+          return Status::Error("Unexpected string end");
+        }
+        TRY_RESULT(value, do_json_decode(parser, max_depth - 1));
+        res.emplace_back(std::move(value));
+
+        parser.skip_whitespaces();
+        if (parser.try_skip(']')) {
+          break;
+        }
+        if (parser.try_skip(',')) {
+          parser.skip_whitespaces();
+          continue;
+        }
+        if (parser.empty()) {
+          return Status::Error("Unexpected string end");
+        }
+        return Status::Error("Unexpected symbol while parsing JSON Array");
+      }
+      return JsonValue::create_array(std::move(res));
+    }
+    case '{': {
+      parser.skip('{');
+      parser.skip_whitespaces();
+      std::vector<std::pair<MutableSlice, JsonValue> > res;
+      if (parser.try_skip('}')) {
+        return JsonValue::make_object(std::move(res));
+      }
+      while (true) {
+        if (parser.empty()) {
+          return Status::Error("Unexpected string end");
+        }
+        TRY_RESULT(key, json_string_decode(parser));
+        parser.skip_whitespaces();
+        if (!parser.try_skip(':')) {
+          return Status::Error("':' expected");
+        }
+        TRY_RESULT(value, do_json_decode(parser, max_depth - 1));
+        res.emplace_back(std::move(key), std::move(value));
+
+        parser.skip_whitespaces();
+        if (parser.try_skip('}')) {
+          break;
+        }
+        if (parser.try_skip(',')) {
+          parser.skip_whitespaces();
+          continue;
+        }
+        if (parser.empty()) {
+          return Status::Error("Unexpected string end");
+        }
+        return Status::Error("Unexpected symbol while parsing JSON Object");
+      }
+      return JsonValue::make_object(std::move(res));
+    }
+    case '-':
+    case '+':
+    case '.':
+    case '0':
+    case '1':
+    case '2':
+    case '3':
+    case '4':
+    case '5':
+    case '6':
+    case '7':
+    case '8':
+    case '9': {
+      auto num = parser.read_while(
+          [](char c) { return c == '-' || ('0' <= c && c <= '9') || c == 'e' || c == 'E' || c == '+' || c == '.'; });
+      return JsonValue::create_number(num);
+    }
+    case 0:
+      return Status::Error("Unexpected string end");
+    default: {
+      char next = parser.peek_char();
+      if (0 < next && next < 127) {
+        return Status::Error(PSLICE() << "Unexpected symbol '" << parser.peek_char() << "'");
+      } else {
+        return Status::Error("Unexpected symbol");
+      }
+    }
+  }
+  UNREACHABLE();
+}
+
+Status do_json_skip(Parser &parser, int32 max_depth) {
+  if (max_depth < 0) {
+    return Status::Error("Too big object depth");
+  }
+
+  parser.skip_whitespaces();
+  switch (parser.peek_char()) {
+    case 'f':
+      if (parser.skip_start_with("false")) {
+        return Status::OK();
+      }
+      return Status::Error("Starts with 'f' -- false expected");
+    case 't':
+      if (parser.skip_start_with("true")) {
+        return Status::OK();
+      }
+      return Status::Error("Starts with 't' -- true expected");
+    case 'n':
+      if (parser.skip_start_with("null")) {
+        return Status::OK();
+      }
+      return Status::Error("Starts with 'n' -- null expected");
+    case '"': {
+      return json_string_skip(parser);
+    }
+    case '[': {
+      parser.skip('[');
+      parser.skip_whitespaces();
+      if (parser.try_skip(']')) {
+        return Status::OK();
+      }
+      while (true) {
+        if (parser.empty()) {
+          return Status::Error("Unexpected end");
+        }
+        TRY_STATUS(do_json_skip(parser, max_depth - 1));
+
+        parser.skip_whitespaces();
+        if (parser.try_skip(']')) {
+          break;
+        }
+        if (parser.try_skip(',')) {
+          parser.skip_whitespaces();
+          continue;
+        }
+        return Status::Error("Unexpected symbol");
+      }
+      return Status::OK();
+    }
+    case '{': {
+      parser.skip('{');
+      parser.skip_whitespaces();
+      if (parser.try_skip('}')) {
+        return Status::OK();
+      }
+      while (true) {
+        if (parser.empty()) {
+          return Status::Error("Unexpected end");
+        }
+        TRY_STATUS(json_string_skip(parser));
+        parser.skip_whitespaces();
+        if (!parser.try_skip(':')) {
+          return Status::Error("':' expected");
+        }
+        TRY_STATUS(do_json_skip(parser, max_depth - 1));
+
+        parser.skip_whitespaces();
+        if (parser.try_skip('}')) {
+          break;
+        }
+        if (parser.try_skip(',')) {
+          parser.skip_whitespaces();
+          continue;
+        }
+        return Status::Error("Unexpected symbol");
+      }
+      return Status::OK();
+    }
+    case '-':
+    case '+':
+    case '.':
+    case '0':
+    case '1':
+    case '2':
+    case '3':
+    case '4':
+    case '5':
+    case '6':
+    case '7':
+    case '8':
+    case '9': {
+      parser.read_while(
+          [](char c) { return c == '-' || ('0' <= c && c <= '9') || c == 'e' || c == 'E' || c == '+' || c == '.'; });
+      return Status::OK();
+    }
+    case 0:
+      return Status::Error("Unexpected end");
+    default: {
+      char next = parser.peek_char();
+      if (0 < next && next < 127) {
+        return Status::Error(PSLICE() << "Unexpected symbol '" << parser.peek_char() << "'");
+      } else {
+        return Status::Error("Unexpected symbol");
+      }
+    }
+  }
+  return Status::Error("Can't parse");
+}
+
+Slice JsonValue::get_type_name(Type type) {
+  switch (type) {
+    case Type::Null:
+      return Slice("Null");
+    case Type::Number:
+      return Slice("Number");
+    case Type::Boolean:
+      return Slice("Boolean");
+    case Type::String:
+      return Slice("String");
+    case Type::Array:
+      return Slice("Array");
+    case Type::Object:
+      return Slice("Object");
+    default:
+      UNREACHABLE();
+      return Slice("Unknown");
+  }
+}
+
+bool has_json_object_field(const JsonObject &object, Slice name) {
+  for (auto &field_value : object) {
+    if (field_value.first == name) {
+      return true;
+    }
+  }
+  return false;
+}
+
+Result<JsonValue> get_json_object_field(JsonObject &object, Slice name, JsonValue::Type type, bool is_optional) {
+  for (auto &field_value : object) {
+    if (field_value.first == name) {
+      if (type != JsonValue::Type::Null && field_value.second.type() != type) {
+        return Status::Error(400, PSLICE()
+                                      << "Field \"" << name << "\" must be of type " << JsonValue::get_type_name(type));
+      }
+
+      return std::move(field_value.second);
+    }
+  }
+  if (!is_optional) {
+    return Status::Error(400, PSLICE() << "Can't find field \"" << name << "\"");
+  }
+  return JsonValue();
+}
+
+Result<bool> get_json_object_bool_field(JsonObject &object, Slice name, bool is_optional, bool default_value) {
+  TRY_RESULT(value, get_json_object_field(object, name, JsonValue::Type::Boolean, is_optional));
+  if (value.type() == JsonValue::Type::Null) {
+    return default_value;
+  }
+  return value.get_boolean();
+}
+
+Result<int32> get_json_object_int_field(JsonObject &object, Slice name, bool is_optional, int32 default_value) {
+  for (auto &field_value : object) {
+    if (field_value.first == name) {
+      if (field_value.second.type() == JsonValue::Type::String) {
+        return to_integer_safe<int32>(field_value.second.get_string());
+      }
+      if (field_value.second.type() == JsonValue::Type::Number) {
+        return to_integer_safe<int32>(field_value.second.get_number());
+      }
+
+      return Status::Error(400, PSLICE() << "Field \"" << name << "\" must be of type Number");
+    }
+  }
+  if (is_optional) {
+    return default_value;
+  }
+  return Status::Error(400, PSLICE() << "Can't find field \"" << name << "\"");
+}
+
+Result<int64> get_json_object_long_field(JsonObject &object, Slice name, bool is_optional, int64 default_value) {
+  for (auto &field_value : object) {
+    if (field_value.first == name) {
+      if (field_value.second.type() == JsonValue::Type::String) {
+        return to_integer_safe<int64>(field_value.second.get_string());
+      }
+      if (field_value.second.type() == JsonValue::Type::Number) {
+        return to_integer_safe<int64>(field_value.second.get_number());
+      }
+
+      return Status::Error(400, PSLICE() << "Field \"" << name << "\" must be a Number");
+    }
+  }
+  if (is_optional) {
+    return default_value;
+  }
+  return Status::Error(400, PSLICE() << "Can't find field \"" << name << "\"");
+}
+
+Result<double> get_json_object_double_field(JsonObject &object, Slice name, bool is_optional, double default_value) {
+  TRY_RESULT(value, get_json_object_field(object, name, JsonValue::Type::Number, is_optional));
+  if (value.type() == JsonValue::Type::Null) {
+    return default_value;
+  }
+  return to_double(value.get_number());
+}
+
+Result<string> get_json_object_string_field(JsonObject &object, Slice name, bool is_optional, string default_value) {
+  for (auto &field_value : object) {
+    if (field_value.first == name) {
+      if (field_value.second.type() == JsonValue::Type::String) {
+        return field_value.second.get_string().str();
+      }
+      if (field_value.second.type() == JsonValue::Type::Number) {
+        return field_value.second.get_number().str();
+      }
+
+      return Status::Error(400, PSLICE() << "Field \"" << name << "\" must be of type String");
+    }
+  }
+  if (is_optional) {
+    return default_value;
+  }
+  return Status::Error(400, PSLICE() << "Can't find field \"" << name << "\"");
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/JsonBuilder.h b/submodules/ton/tonlib-src/tdutils/td/utils/JsonBuilder.h
new file mode 100644
index 0000000000..f2df4e6022
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/JsonBuilder.h
@@ -0,0 +1,902 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/Parser.h"
+#include "td/utils/Slice.h"
+#include "td/utils/StackAllocator.h"
+#include "td/utils/Status.h"
+#include "td/utils/StringBuilder.h"
+
+#include <new>
+#include <tuple>
+#include <type_traits>
+#include <utility>
+
+namespace td {
+
+template <class... Args>
+std::tuple<const Args &...> ctie(const Args &... args) TD_WARN_UNUSED_RESULT;
+
+template <class... Args>
+std::tuple<const Args &...> ctie(const Args &... args) {
+  return std::tie(args...);
+}
+
+class JsonTrue {
+ public:
+  friend StringBuilder &operator<<(StringBuilder &sb, const JsonTrue &val) {
+    return sb << "true";
+  }
+};
+
+class JsonFalse {
+ public:
+  friend StringBuilder &operator<<(StringBuilder &sb, const JsonFalse &val) {
+    return sb << "false";
+  }
+};
+
+class JsonNull {
+ public:
+  friend StringBuilder &operator<<(StringBuilder &sb, JsonNull val) {
+    return sb << "null";
+  }
+};
+
+class JsonBool {
+ public:
+  explicit JsonBool(bool value) : value_(value) {
+  }
+  friend StringBuilder &operator<<(StringBuilder &sb, const JsonBool &val) {
+    if (val.value_) {
+      return sb << JsonTrue();
+    } else {
+      return sb << JsonFalse();
+    }
+  }
+
+ private:
+  bool value_;
+};
+
+class JsonInt {
+ public:
+  explicit JsonInt(int32 value) : value_(value) {
+  }
+  friend StringBuilder &operator<<(StringBuilder &sb, const JsonInt &val) {
+    return sb << val.value_;
+  }
+
+ private:
+  int32 value_;
+};
+
+class JsonLong {
+ public:
+  explicit JsonLong(int64 value) : value_(value) {
+  }
+  friend StringBuilder &operator<<(StringBuilder &sb, const JsonLong &val) {
+    return sb << val.value_;
+  }
+
+ private:
+  int64 value_;
+};
+
+class JsonFloat {
+ public:
+  explicit JsonFloat(double value) : value_(value) {
+  }
+  friend StringBuilder &operator<<(StringBuilder &sb, const JsonFloat &val) {
+    return sb << val.value_;
+  }
+
+ private:
+  double value_;
+};
+
+class JsonOneChar {
+ public:
+  explicit JsonOneChar(unsigned int c) : c_(c) {
+  }
+
+  friend StringBuilder &operator<<(StringBuilder &sb, const JsonOneChar &val) {
+    auto c = val.c_;
+    return sb << '\\' << 'u' << "0123456789abcdef"[c >> 12] << "0123456789abcdef"[(c >> 8) & 15]
+              << "0123456789abcdef"[(c >> 4) & 15] << "0123456789abcdef"[c & 15];
+  }
+
+ private:
+  unsigned int c_;
+};
+
+class JsonChar {
+ public:
+  explicit JsonChar(unsigned int c) : c_(c) {
+  }
+  friend StringBuilder &operator<<(StringBuilder &sb, const JsonChar &val) {
+    auto c = val.c_;
+    if (c < 0x10000) {
+      if (0xD7FF < c && c < 0xE000) {
+        // UTF-8 correctness has already been checked
+        UNREACHABLE();
+      }
+      return sb << JsonOneChar(c);
+    } else if (c <= 0x10ffff) {
+      return sb << JsonOneChar(0xD7C0 + (c >> 10)) << JsonOneChar(0xDC00 + (c & 0x3FF));
+    } else {
+      // UTF-8 correctness has already been checked
+      UNREACHABLE();
+    }
+  }
+
+ private:
+  unsigned int c_;
+};
+
+class JsonRaw {
+ public:
+  explicit JsonRaw(Slice value) : value_(value) {
+  }
+  friend StringBuilder &operator<<(StringBuilder &sb, const JsonRaw &val) {
+    return sb << val.value_;
+  }
+
+ private:
+  Slice value_;
+};
+
+class JsonRawString {
+ public:
+  explicit JsonRawString(Slice value) : value_(value) {
+  }
+  friend StringBuilder &operator<<(StringBuilder &sb, const JsonRawString &val);
+
+ private:
+  Slice value_;
+};
+
+class JsonString {
+ public:
+  explicit JsonString(Slice str) : str_(str) {
+  }
+
+  friend StringBuilder &operator<<(StringBuilder &sb, const JsonString &val);
+
+ private:
+  Slice str_;
+};
+
+class JsonScope;
+class JsonValueScope;
+class JsonArrayScope;
+class JsonObjectScope;
+
+class JsonBuilder {
+ public:
+  explicit JsonBuilder(StringBuilder &&sb, int32 offset = -1) : sb_(std::move(sb)), offset_(offset) {
+  }
+  StringBuilder &string_builder() {
+    return sb_;
+  }
+  friend class JsonScope;
+  JsonValueScope enter_value() TD_WARN_UNUSED_RESULT;
+  JsonArrayScope enter_array() TD_WARN_UNUSED_RESULT;
+  JsonObjectScope enter_object() TD_WARN_UNUSED_RESULT;
+
+  int32 offset() const {
+    return offset_;
+  }
+  bool is_pretty() const {
+    return offset_ >= 0;
+  }
+  void print_offset() {
+    for (int x = 0; x < offset_; x++) {
+      sb_ << "   ";
+    }
+  }
+  void dec_offset() {
+    if (offset_ >= 0) {
+      CHECK(offset_ > 0);
+      offset_--;
+    }
+  }
+  void inc_offset() {
+    if (offset_ >= 0) {
+      offset_++;
+    }
+  }
+
+ private:
+  StringBuilder sb_;
+  JsonScope *scope_ = nullptr;
+  int32 offset_;
+};
+
+class Jsonable {};
+
+class JsonScope {
+ public:
+  explicit JsonScope(JsonBuilder *jb) : sb_(&jb->sb_), jb_(jb), save_scope_(jb->scope_) {
+    jb_->scope_ = this;
+    CHECK(is_active());
+  }
+  JsonScope(const JsonScope &other) = delete;
+  JsonScope(JsonScope &&other) : sb_(other.sb_), jb_(other.jb_), save_scope_(other.save_scope_) {
+    other.jb_ = nullptr;
+  }
+  JsonScope &operator=(const JsonScope &) = delete;
+  JsonScope &operator=(JsonScope &&) = delete;
+  ~JsonScope() {
+    if (jb_) {
+      leave();
+    }
+  }
+  void leave() {
+    CHECK(is_active());
+    jb_->scope_ = save_scope_;
+  }
+
+ protected:
+  StringBuilder *sb_;
+
+  // For CHECK
+  JsonBuilder *jb_;
+  JsonScope *save_scope_;
+
+  bool is_active() const {
+    return jb_ && jb_->scope_ == this;
+  }
+
+  JsonScope &operator<<(JsonTrue x) {
+    *sb_ << x;
+    return *this;
+  }
+  JsonScope &operator<<(JsonFalse x) {
+    *sb_ << x;
+    return *this;
+  }
+  JsonScope &operator<<(JsonNull x) {
+    *sb_ << x;
+    return *this;
+  }
+  JsonScope &operator<<(const JsonBool &x) {
+    *sb_ << x;
+    return *this;
+  }
+  JsonScope &operator<<(const JsonInt &x) {
+    *sb_ << x;
+    return *this;
+  }
+  JsonScope &operator<<(const JsonLong &x) {
+    *sb_ << x;
+    return *this;
+  }
+  JsonScope &operator<<(const JsonFloat &x) {
+    *sb_ << x;
+    return *this;
+  }
+  JsonScope &operator<<(const JsonString &x) {
+    *sb_ << x;
+    return *this;
+  }
+  JsonScope &operator<<(const JsonRawString &x) {
+    *sb_ << x;
+    return *this;
+  }
+  JsonScope &operator<<(const JsonRaw &x) {
+    *sb_ << x;
+    return *this;
+  }
+  JsonScope &operator<<(bool x) {
+    return *this << JsonBool(x);
+  }
+  JsonScope &operator<<(int32 x) {
+    return *this << JsonInt(x);
+  }
+  JsonScope &operator<<(int64 x) {
+    return *this << JsonLong(x);
+  }
+  JsonScope &operator<<(double x) {
+    return *this << JsonFloat(x);
+  }
+  template <class T>
+  JsonScope &operator<<(const T *x);  // not implemented
+  template <size_t N>
+  JsonScope &operator<<(const char (&x)[N]) {
+    return *this << JsonString(Slice(x));
+  }
+  JsonScope &operator<<(const char *x) {
+    return *this << JsonString(Slice(x));
+  }
+  JsonScope &operator<<(const string &x) {
+    return *this << JsonString(Slice(x));
+  }
+  JsonScope &operator<<(Slice x) {
+    return *this << JsonString(x);
+  }
+};
+
+class JsonValueScope : public JsonScope {
+ public:
+  using JsonScope::JsonScope;
+  template <class T>
+  std::enable_if_t<std::is_base_of<Jsonable, typename std::decay<T>::type>::value, JsonValueScope &> operator<<(
+      const T &x) {
+    x.store(this);
+    return *this;
+  }
+  template <class T>
+  std::enable_if_t<!std::is_base_of<Jsonable, typename std::decay<T>::type>::value, JsonValueScope &> operator<<(
+      const T &x) {
+    CHECK(!was_);
+    was_ = true;
+    JsonScope::operator<<(x);
+    return *this;
+  }
+
+  JsonArrayScope enter_array() TD_WARN_UNUSED_RESULT;
+  JsonObjectScope enter_object() TD_WARN_UNUSED_RESULT;
+
+ private:
+  bool was_ = false;
+};
+
+class JsonArrayScope : public JsonScope {
+ public:
+  explicit JsonArrayScope(JsonBuilder *jb) : JsonScope(jb) {
+    jb->inc_offset();
+    *sb_ << "[";
+  }
+  JsonArrayScope(JsonArrayScope &&other) = default;
+  ~JsonArrayScope() {
+    if (jb_) {
+      leave();
+    }
+  }
+  void leave() {
+    jb_->dec_offset();
+    if (jb_->is_pretty()) {
+      *sb_ << "\n";
+      jb_->print_offset();
+    }
+    *sb_ << "]";
+  }
+  template <class T>
+  JsonArrayScope &operator<<(const T &x) {
+    return (*this)(x);
+  }
+  template <class T>
+  JsonArrayScope &operator()(const T &x) {
+    enter_value() << x;
+    return *this;
+  }
+  JsonValueScope enter_value() {
+    CHECK(is_active());
+    if (is_first_) {
+      *sb_ << ",";
+    } else {
+      is_first_ = true;
+    }
+    if (jb_->is_pretty()) {
+      *sb_ << "\n";
+      jb_->print_offset();
+    }
+    return jb_->enter_value();
+  }
+
+ private:
+  bool is_first_ = false;
+};
+
+class JsonObjectScope : public JsonScope {
+ public:
+  explicit JsonObjectScope(JsonBuilder *jb) : JsonScope(jb) {
+    jb->inc_offset();
+    *sb_ << "{";
+  }
+  JsonObjectScope(JsonObjectScope &&other) = default;
+  ~JsonObjectScope() {
+    if (jb_) {
+      leave();
+    }
+  }
+  void leave() {
+    jb_->dec_offset();
+    if (jb_->is_pretty()) {
+      *sb_ << "\n";
+      jb_->print_offset();
+    }
+    *sb_ << "}";
+  }
+  template <class S, class T>
+  JsonObjectScope &operator<<(std::tuple<S, T> key_value) {
+    return (*this)(std::get<0>(key_value), std::get<1>(key_value));
+  }
+  template <class S, class T>
+  JsonObjectScope &operator<<(std::pair<S, T> key_value) {
+    return (*this)(key_value.first, key_value.second);
+  }
+  template <class S, class T>
+  JsonObjectScope &operator()(S &&key, T &&value) {
+    CHECK(is_active());
+    if (is_first_) {
+      *sb_ << ",";
+    } else {
+      is_first_ = true;
+    }
+    if (jb_->is_pretty()) {
+      *sb_ << "\n";
+      jb_->print_offset();
+    }
+    jb_->enter_value() << key;
+    if (jb_->is_pretty()) {
+      *sb_ << " : ";
+    } else {
+      *sb_ << ":";
+    }
+    jb_->enter_value() << value;
+    return *this;
+  }
+  JsonObjectScope &operator<<(const JsonRaw &key_value) {
+    CHECK(is_active());
+    is_first_ = true;
+    jb_->enter_value() << key_value;
+    return *this;
+  }
+
+ private:
+  bool is_first_ = false;
+};
+
+inline JsonArrayScope JsonValueScope::enter_array() {
+  CHECK(!was_);
+  was_ = true;
+  return JsonArrayScope(jb_);
+}
+inline JsonObjectScope JsonValueScope::enter_object() {
+  CHECK(!was_);
+  was_ = true;
+  return JsonObjectScope(jb_);
+}
+inline JsonValueScope JsonBuilder::enter_value() {
+  return JsonValueScope(this);
+}
+inline JsonObjectScope JsonBuilder::enter_object() {
+  return JsonObjectScope(this);
+}
+inline JsonArrayScope JsonBuilder::enter_array() {
+  return JsonArrayScope(this);
+}
+
+class JsonValue;
+
+using JsonObject = vector<std::pair<MutableSlice, JsonValue>>;
+using JsonArray = vector<JsonValue>;
+
+class JsonValue : public Jsonable {
+ public:
+  enum class Type { Null, Number, Boolean, String, Array, Object };
+
+  static Slice get_type_name(Type type);
+
+  JsonValue() {
+  }
+  ~JsonValue() {
+    destroy();
+  }
+  JsonValue(JsonValue &&other) : JsonValue() {
+    init(std::move(other));
+  }
+  JsonValue &operator=(JsonValue &&other) {
+    if (&other == this) {
+      return *this;
+    }
+    destroy();
+    init(std::move(other));
+    return *this;
+  }
+  JsonValue(const JsonValue &other) = delete;
+  JsonValue &operator=(const JsonValue &other) = delete;
+
+  Type type() const {
+    return type_;
+  }
+
+  MutableSlice &get_string() {
+    CHECK(type_ == Type::String);
+    return string_;
+  }
+  const MutableSlice &get_string() const {
+    CHECK(type_ == Type::String);
+    return string_;
+  }
+  bool &get_boolean() {
+    CHECK(type_ == Type::Boolean);
+    return boolean_;
+  }
+  const bool &get_boolean() const {
+    CHECK(type_ == Type::Boolean);
+    return boolean_;
+  }
+
+  MutableSlice &get_number() {
+    CHECK(type_ == Type::Number);
+    return number_;
+  }
+  const MutableSlice &get_number() const {
+    CHECK(type_ == Type::Number);
+    return number_;
+  }
+
+  JsonArray &get_array() {
+    CHECK(type_ == Type::Array);
+    return array_;
+  }
+  const JsonArray &get_array() const {
+    CHECK(type_ == Type::Array);
+    return array_;
+  }
+
+  JsonObject &get_object() {
+    CHECK(type_ == Type::Object);
+    return object_;
+  }
+  const JsonObject &get_object() const {
+    CHECK(type_ == Type::Object);
+    return object_;
+  }
+
+  static JsonValue create_boolean(bool val) {
+    JsonValue res;
+    res.init_boolean(val);
+    return res;
+  }
+
+  static JsonValue create_number(MutableSlice number) {
+    JsonValue res;
+    res.init_number(number);
+    return res;
+  }
+
+  static JsonValue create_string(MutableSlice str) {
+    JsonValue res;
+    res.init_string(str);
+    return res;
+  }
+
+  static JsonValue create_array(JsonArray v) {
+    JsonValue res;
+    res.init_array(std::move(v));
+    return res;
+  }
+
+  static JsonValue make_object(JsonObject c) {
+    JsonValue res;
+    res.init_object(std::move(c));
+    return res;
+  }
+
+  void store(JsonValueScope *scope) const {
+    switch (type_) {
+      case Type::Null:
+        *scope << JsonRaw("null");
+        break;
+      case Type::Boolean:
+        if (get_boolean()) {
+          *scope << JsonRaw("true");
+        } else {
+          *scope << JsonRaw("false");
+        }
+        break;
+      case Type::Number:
+        *scope << JsonRaw(get_number());
+        break;
+      case Type::String:
+        *scope << JsonString(get_string());
+        break;
+      case Type::Array: {
+        auto arr = scope->enter_array();
+        for (auto &val : get_array()) {
+          arr << val;
+        }
+        break;
+      }
+      case Type::Object: {
+        auto object = scope->enter_object();
+        for (auto &key_value : get_object()) {
+          object << ctie(JsonString(key_value.first), key_value.second);
+        }
+        break;
+      }
+    }
+  };
+
+ private:
+  Type type_{Type::Null};
+  union {
+    MutableSlice number_;
+    bool boolean_;
+    MutableSlice string_;
+    JsonArray array_;
+    JsonObject object_;
+  };
+
+  void init_null() {
+    type_ = Type::Null;
+  }
+  void init_number(MutableSlice number) {
+    type_ = Type::Number;
+    new (&number_) MutableSlice(number);
+  }
+  void init_boolean(bool boolean) {
+    type_ = Type::Boolean;
+    boolean_ = boolean;
+  }
+  void init_string(MutableSlice slice) {
+    type_ = Type::String;
+    new (&string_) MutableSlice(slice);
+  }
+  void init_array(JsonArray array) {
+    type_ = Type::Array;
+    new (&array_) JsonArray(std::move(array));
+  }
+  void init_object(JsonObject object) {
+    type_ = Type::Object;
+    new (&object_) JsonObject(std::move(object));
+  }
+
+  void init(JsonValue &&other) {
+    switch (other.type_) {
+      case Type::Null:
+        break;
+      case Type::Number:
+        init_number(other.number_);
+        break;
+      case Type::Boolean:
+        init_boolean(other.boolean_);
+        break;
+      case Type::String:
+        init_string(other.string_);
+        break;
+      case Type::Array:
+        init_array(std::move(other.array_));
+        break;
+      case Type::Object:
+        init_object(std::move(other.object_));
+        break;
+    }
+    other.destroy();
+  }
+
+  void destroy() {
+    switch (type_) {
+      case Type::Null:
+      case Type::Boolean:
+        break;
+      case Type::Number:
+        number_.~MutableSlice();
+        break;
+      case Type::String:
+        string_.~MutableSlice();
+        break;
+      case Type::Array:
+        array_.~vector<JsonValue>();
+        break;
+      case Type::Object:
+        object_.~vector<std::pair<MutableSlice, JsonValue>>();
+        break;
+    }
+    type_ = Type::Null;
+  }
+};
+
+inline StringBuilder &operator<<(StringBuilder &sb, JsonValue::Type type) {
+  switch (type) {
+    case JsonValue::Type::Null:
+      return sb << "Null";
+    case JsonValue::Type::Number:
+      return sb << "Number";
+    case JsonValue::Type::Boolean:
+      return sb << "Boolean";
+    case JsonValue::Type::String:
+      return sb << "String";
+    case JsonValue::Type::Array:
+      return sb << "Array";
+    case JsonValue::Type::Object:
+      return sb << "Object";
+    default:
+      UNREACHABLE();
+      return sb;
+  }
+}
+
+class VirtuallyJsonable : public Jsonable {
+ public:
+  virtual void store(JsonValueScope *scope) const = 0;
+  VirtuallyJsonable() = default;
+  VirtuallyJsonable(const VirtuallyJsonable &) = delete;
+  VirtuallyJsonable &operator=(const VirtuallyJsonable &) = delete;
+  VirtuallyJsonable(VirtuallyJsonable &&) = default;
+  VirtuallyJsonable &operator=(VirtuallyJsonable &&) = default;
+  virtual ~VirtuallyJsonable() = default;
+};
+
+class VirtuallyJsonableInt : public VirtuallyJsonable {
+ public:
+  explicit VirtuallyJsonableInt(int32 value) : value_(value) {
+  }
+  void store(JsonValueScope *scope) const override {
+    *scope << JsonInt(value_);
+  }
+
+ private:
+  int32 value_;
+};
+
+class VirtuallyJsonableLong : public VirtuallyJsonable {
+ public:
+  explicit VirtuallyJsonableLong(int64 value) : value_(value) {
+  }
+  void store(JsonValueScope *scope) const override {
+    *scope << JsonLong(value_);
+  }
+
+ private:
+  int64 value_;
+};
+
+class VirtuallyJsonableString : public VirtuallyJsonable {
+ public:
+  explicit VirtuallyJsonableString(Slice value) : value_(value) {
+  }
+  void store(JsonValueScope *scope) const override {
+    *scope << JsonString(value_);
+  }
+
+ private:
+  Slice value_;
+};
+
+Result<MutableSlice> json_string_decode(Parser &parser) TD_WARN_UNUSED_RESULT;
+Status json_string_skip(Parser &parser) TD_WARN_UNUSED_RESULT;
+
+Result<JsonValue> do_json_decode(Parser &parser, int32 max_depth) TD_WARN_UNUSED_RESULT;
+Status do_json_skip(Parser &parser, int32 max_depth) TD_WARN_UNUSED_RESULT;
+
+inline Result<JsonValue> json_decode(MutableSlice json) {
+  Parser parser(json);
+  const int32 DEFAULT_MAX_DEPTH = 100;
+  auto result = do_json_decode(parser, DEFAULT_MAX_DEPTH);
+  if (result.is_ok()) {
+    parser.skip_whitespaces();
+    if (!parser.empty()) {
+      return Status::Error("Expected string end");
+    }
+  }
+  return result;
+}
+
+template <class StrT, class ValT>
+StrT json_encode(const ValT &val, bool pretty = false) {
+  auto buf_len = 1 << 18;
+  auto buf = StackAllocator::alloc(buf_len);
+  JsonBuilder jb(StringBuilder(buf.as_slice(), true), pretty ? 0 : -1);
+  jb.enter_value() << val;
+  if (pretty) {
+    jb.string_builder() << "\n";
+  }
+  LOG_IF(ERROR, jb.string_builder().is_error()) << "JSON buffer overflow";
+  auto slice = jb.string_builder().as_cslice();
+  return StrT(slice.begin(), slice.size());
+}
+
+template <class T>
+class ToJsonImpl : public Jsonable {
+ public:
+  explicit ToJsonImpl(const T &value) : value_(value) {
+  }
+  void store(JsonValueScope *scope) const {
+    to_json(*scope, value_);
+  }
+
+ private:
+  const T &value_;
+};
+
+template <class T>
+auto ToJson(const T &value) {
+  return ToJsonImpl<T>(value);
+}
+
+template <class T>
+void to_json(JsonValueScope &jv, const T &value) {
+  jv << value;
+}
+
+template <class F>
+class JsonObjectImpl : Jsonable {
+ public:
+  explicit JsonObjectImpl(F &&f) : f_(std::forward<F>(f)) {
+  }
+  void store(JsonValueScope *scope) const {
+    auto object = scope->enter_object();
+    f_(object);
+  }
+
+ private:
+  F f_;
+};
+template <class F>
+auto json_object(F &&f) {
+  return JsonObjectImpl<F>(std::forward<F>(f));
+}
+
+template <class F>
+class JsonArrayImpl : Jsonable {
+ public:
+  explicit JsonArrayImpl(F &&f) : f_(std::forward<F>(f)) {
+  }
+  void store(JsonValueScope *scope) const {
+    auto array = scope->enter_array();
+    f_(array);
+  }
+
+ private:
+  F f_;
+};
+
+template <class F>
+auto json_array(F &&f) {
+  return JsonArrayImpl<F>(std::forward<F>(f));
+}
+
+template <class A, class F>
+auto json_array(const A &a, F &&f) {
+  return json_array([&a, &f](auto &arr) {
+    for (auto &x : a) {
+      arr(f(x));
+    }
+  });
+}
+
+bool has_json_object_field(const JsonObject &object, Slice name);
+
+Result<JsonValue> get_json_object_field(JsonObject &object, Slice name, JsonValue::Type type,
+                                        bool is_optional = true) TD_WARN_UNUSED_RESULT;
+
+Result<bool> get_json_object_bool_field(JsonObject &object, Slice name, bool is_optional = true,
+                                        bool default_value = false) TD_WARN_UNUSED_RESULT;
+
+Result<int32> get_json_object_int_field(JsonObject &object, Slice name, bool is_optional = true,
+                                        int32 default_value = 0) TD_WARN_UNUSED_RESULT;
+
+Result<int64> get_json_object_long_field(JsonObject &object, Slice name, bool is_optional = true,
+                                         int64 default_value = 0) TD_WARN_UNUSED_RESULT;
+
+Result<double> get_json_object_double_field(JsonObject &object, Slice name, bool is_optional = true,
+                                            double default_value = 0.0) TD_WARN_UNUSED_RESULT;
+
+Result<string> get_json_object_string_field(JsonObject &object, Slice name, bool is_optional = true,
+                                            string default_value = "") TD_WARN_UNUSED_RESULT;
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/List.h b/submodules/ton/tonlib-src/tdutils/td/utils/List.h
new file mode 100644
index 0000000000..63c26438db
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/List.h
@@ -0,0 +1,104 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+namespace td {
+
+struct ListNode {
+  ListNode *next;
+  ListNode *prev;
+  ListNode() {
+    clear();
+  }
+
+  ~ListNode() {
+    remove();
+  }
+
+  ListNode(const ListNode &) = delete;
+  ListNode &operator=(const ListNode &) = delete;
+
+  ListNode(ListNode &&other) {
+    if (other.empty()) {
+      clear();
+    } else {
+      ListNode *head = other.prev;
+      other.remove();
+      head->put(this);
+    }
+  }
+
+  ListNode &operator=(ListNode &&other) {
+    this->remove();
+
+    if (!other.empty()) {
+      ListNode *head = other.prev;
+      other.remove();
+      head->put(this);
+    }
+
+    return *this;
+  }
+
+  void connect(ListNode *to) {
+    CHECK(to != nullptr);
+    next = to;
+    to->prev = this;
+  }
+
+  void remove() {
+    prev->connect(next);
+    clear();
+  }
+
+  void put(ListNode *other) {
+    other->connect(next);
+    this->connect(other);
+  }
+
+  void put_back(ListNode *other) {
+    prev->connect(other);
+    other->connect(this);
+  }
+
+  ListNode *get() {
+    ListNode *result = prev;
+    if (result == this) {
+      return nullptr;
+    }
+    result->prev->connect(this);
+    result->clear();
+    // this->connect(result->next);
+    return result;
+  }
+
+  bool empty() const {
+    return next == this;
+  }
+
+ private:
+  void clear() {
+    next = this;
+    prev = this;
+  }
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/MemoryLog.h b/submodules/ton/tonlib-src/tdutils/td/utils/MemoryLog.h
new file mode 100644
index 0000000000..b9a01db924
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/MemoryLog.h
@@ -0,0 +1,95 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/Slice.h"
+
+#include <atomic>
+#include <cstdio>
+#include <cstring>
+
+namespace td {
+
+template <int buffer_size = 32 * (1 << 10)>
+class MemoryLog : public LogInterface {
+  static constexpr size_t MAX_OUTPUT_SIZE = buffer_size / 16 < (8 << 10) ? buffer_size / 16 : (8 << 10);
+
+ public:
+  MemoryLog() {
+    std::memset(buffer_, ' ', sizeof(buffer_));
+  }
+
+  void append(CSlice new_slice, int log_level) override {
+    Slice slice = new_slice;
+    slice.truncate(MAX_OUTPUT_SIZE);
+    while (!slice.empty() && slice.back() == '\n') {
+      slice.remove_suffix(1);
+    }
+    size_t slice_size = slice.size();
+    CHECK(slice_size * 3 < buffer_size);
+    size_t pad_size = ((slice_size + 15) & ~15) - slice_size;
+    constexpr size_t magic_size = 16;
+    uint32 total_size = static_cast<uint32>(slice_size + pad_size + magic_size);
+    uint32 real_pos = pos_.fetch_add(total_size, std::memory_order_relaxed);
+    CHECK((total_size & 15) == 0);
+
+    uint32 start_pos = real_pos & (buffer_size - 1);
+    uint32 end_pos = start_pos + total_size;
+    if (likely(end_pos <= buffer_size)) {
+      std::memcpy(&buffer_[start_pos + magic_size], slice.data(), slice_size);
+      std::memcpy(&buffer_[start_pos + magic_size + slice_size], "                     ", pad_size);
+    } else {
+      size_t first = buffer_size - start_pos - magic_size;
+      size_t second = slice_size - first;
+      std::memcpy(&buffer_[start_pos + magic_size], slice.data(), first);
+      std::memcpy(&buffer_[0], slice.data() + first, second);
+      std::memcpy(&buffer_[second], "                            ", pad_size);
+    }
+
+    CHECK((start_pos & 15) == 0);
+    CHECK(start_pos <= buffer_size - magic_size);
+    buffer_[start_pos] = '\n';
+    size_t printed = std::snprintf(&buffer_[start_pos + 1], magic_size - 1, "LOG:%08x: ", real_pos);
+    CHECK(printed == magic_size - 2);
+    buffer_[start_pos + magic_size - 1] = ' ';
+
+    if (log_level == VERBOSITY_NAME(FATAL)) {
+      process_fatal_error(new_slice);
+    }
+  }
+
+  void rotate() override {
+  }
+
+  Slice get_buffer() const {
+    return Slice(buffer_, sizeof(buffer_));
+  }
+
+  size_t get_pos() const {
+    return pos_ & (buffer_size - 1);
+  }
+
+ private:
+  char buffer_[buffer_size];
+  std::atomic<uint32> pos_{0};
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/MimeType.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/MimeType.cpp
new file mode 100644
index 0000000000..405cd50133
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/MimeType.cpp
@@ -0,0 +1,56 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/MimeType.h"
+
+#include "td/utils/logging.h"
+
+const char *extension_to_mime_type(const char *extension, size_t extension_len);  // auto-generated
+const char *mime_type_to_extension(const char *mime_type, size_t mime_type_len);  // auto-generated
+
+namespace td {
+
+string MimeType::to_extension(Slice mime_type, Slice default_value) {
+  if (mime_type.empty()) {
+    return default_value.str();
+  }
+
+  const char *result = ::mime_type_to_extension(mime_type.data(), mime_type.size());
+  if (result != nullptr) {
+    return result;
+  }
+
+  LOG(INFO) << "Unknown file MIME type " << mime_type;
+  return default_value.str();
+}
+
+string MimeType::from_extension(Slice extension, Slice default_value) {
+  if (extension.empty()) {
+    return default_value.str();
+  }
+
+  const char *result = ::extension_to_mime_type(extension.data(), extension.size());
+  if (result != nullptr) {
+    return result;
+  }
+
+  LOG(INFO) << "Unknown file extension " << extension;
+  return default_value.str();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/MimeType.h b/submodules/ton/tonlib-src/tdutils/td/utils/MimeType.h
new file mode 100644
index 0000000000..7f0cf9c0f2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/MimeType.h
@@ -0,0 +1,32 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+
+namespace td {
+
+class MimeType {
+ public:
+  static string to_extension(Slice mime_type, Slice default_value = Slice());
+  static string from_extension(Slice extension, Slice default_value = Slice());
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/MovableValue.h b/submodules/ton/tonlib-src/tdutils/td/utils/MovableValue.h
new file mode 100644
index 0000000000..5d658531cc
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/MovableValue.h
@@ -0,0 +1,52 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace td {
+
+template <class T, T empty_val = T()>
+class MovableValue {
+ public:
+  MovableValue() = default;
+  MovableValue(T val) : val_(val) {
+  }
+  MovableValue(MovableValue &&other) : val_(other.val_) {
+    other.clear();
+  }
+  MovableValue &operator=(MovableValue &&other) {
+    val_ = other.val_;
+    other.clear();
+    return *this;
+  }
+  MovableValue(const MovableValue &) = delete;
+  MovableValue &operator=(const MovableValue &) = delete;
+  ~MovableValue() = default;
+
+  void clear() {
+    val_ = empty_val;
+  }
+  const T &get() const {
+    return val_;
+  }
+
+ private:
+  T val_ = empty_val;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/MpmcQueue.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/MpmcQueue.cpp
new file mode 100644
index 0000000000..3d51bb10ae
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/MpmcQueue.cpp
@@ -0,0 +1,27 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/MpmcQueue.h"
+
+namespace td {
+namespace detail {
+
+MpmcStat stat_;
+
+}  // namespace detail
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/MpmcQueue.h b/submodules/ton/tonlib-src/tdutils/td/utils/MpmcQueue.h
new file mode 100644
index 0000000000..2daf61472b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/MpmcQueue.h
@@ -0,0 +1,469 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+// MPMC queue
+// Simple semaphore protected implementation
+// To close queue, one should send as much sentinel elements as there are readers.
+// Once there are no readers and writers, one may easily destroy queue
+
+#include "td/utils/format.h"
+#include "td/utils/HazardPointers.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/ScopeGuard.h"
+
+#include <array>
+#include <atomic>
+
+namespace td {
+
+namespace detail {
+
+struct MpmcStat {
+  void alloc_ok(size_t thread_id) {
+    s(thread_id).alloc_ok_cnt++;
+  }
+  void alloc_error(size_t thread_id) {
+    s(thread_id).alloc_error_cnt++;
+  }
+  void push_loop_error(size_t thread_id) {
+    s(thread_id).push_loop_error_cnt++;
+  }
+  void push_loop_ok(size_t thread_id) {
+    s(thread_id).push_loop_ok_cnt++;
+  }
+  void dump() {
+    int alloc_ok_cnt = 0;
+    int alloc_error_cnt = 0;
+    int push_loop_error_cnt = 0;
+    int push_loop_ok_cnt = 0;
+    for (auto &d : arr) {
+      alloc_ok_cnt += d.alloc_ok_cnt;
+      alloc_error_cnt += d.alloc_error_cnt;
+      push_loop_error_cnt += d.push_loop_error_cnt;
+      push_loop_ok_cnt += d.push_loop_ok_cnt;
+    }
+    LOG(ERROR) << tag("alloc_ok_cnt", alloc_ok_cnt) << tag("alloc_error_cnt", alloc_error_cnt)
+               << tag("push_loop_error_cnt", push_loop_error_cnt) << tag("push_loop_ok_cnt", push_loop_ok_cnt);
+  }
+
+ private:
+  struct ThreadStat {
+    int alloc_ok_cnt{0};
+    int alloc_error_cnt{0};
+    int push_loop_ok_cnt{0};
+    int push_loop_error_cnt{0};
+    char pad[TD_CONCURRENCY_PAD - sizeof(int) * 4];
+  };
+  std::array<ThreadStat, 1024> arr;
+  ThreadStat &s(size_t thread_id) {
+    return arr[thread_id];
+  }
+};
+
+extern MpmcStat stat_;
+
+}  // namespace detail
+
+template <class T>
+class OneValue {
+ public:
+  bool set_value(T &value) {
+    value_ = std::move(value);
+    int state = Empty;
+    if (state_.compare_exchange_strong(state, Value, std::memory_order_acq_rel)) {
+      return true;
+    }
+    value = std::move(value_);
+    return false;
+  }
+  bool get_value(T &value) {
+    auto old_state = state_.exchange(Taken, std::memory_order_acq_rel);
+    if (old_state == Value) {
+      value = std::move(value_);
+      return true;
+    }
+    return false;
+  }
+  void reset() {
+    state_ = Empty;
+    value_ = T();
+  }
+
+ private:
+  enum Type : int { Empty = 0, Taken, Value };
+  std::atomic<int> state_{Empty};
+  T value_{};
+};
+
+template <class T>
+class OneValue<T *> {
+ public:
+  bool set_value(T *value) {
+    T *was = nullptr;
+    return state_.compare_exchange_strong(was, value, std::memory_order_acq_rel);
+  }
+  bool get_value(T *&value) {
+    value = state_.exchange(Taken(), std::memory_order_acq_rel);
+    return value != nullptr;
+  }
+  void reset() {
+    state_ = nullptr;
+  }
+  OneValue() {
+  }
+
+ private:
+  std::atomic<T *> state_{nullptr};
+  T *Taken() {
+    static T xxx;
+    return &xxx;
+  }
+};
+
+template <class T>
+class MpmcQueueBlock {
+ public:
+  explicit MpmcQueueBlock(size_t size) : nodes_(size) {
+  }
+  enum class PopStatus { Ok, Empty, Closed };
+
+  //blocking pop
+  //returns Ok or Closed
+  PopStatus pop(T &value) {
+    while (true) {
+      auto read_pos = read_pos_.fetch_add(1, std::memory_order_relaxed);
+      if (read_pos >= nodes_.size()) {
+        return PopStatus::Closed;
+      }
+      //TODO blocking get_value
+      if (nodes_[static_cast<size_t>(read_pos)].one_value.get_value(value)) {
+        return PopStatus::Ok;
+      }
+    }
+  }
+
+  //nonblocking pop
+  //returns Ok, Empty or Closed
+  PopStatus try_pop(T &value) {
+    while (true) {
+      // this check slows 1:1 case but prevents writer starvation in 1:N case
+      if (write_pos_.load(std::memory_order_relaxed) <= read_pos_.load(std::memory_order_relaxed) &&
+          read_pos_.load(std::memory_order_relaxed) < nodes_.size()) {
+        return PopStatus::Empty;
+      }
+      auto read_pos = read_pos_.fetch_add(1, std::memory_order_relaxed);
+      if (read_pos >= nodes_.size()) {
+        return PopStatus::Closed;
+      }
+      if (nodes_[static_cast<size_t>(read_pos)].one_value.get_value(value)) {
+        return PopStatus::Ok;
+      }
+      auto write_pos = write_pos_.load(std::memory_order_relaxed);
+      if (write_pos <= read_pos + 1) {
+        return PopStatus::Empty;
+      }
+    }
+  }
+
+  enum class PushStatus { Ok, Closed };
+  PushStatus push(T &value) {
+    while (true) {
+      auto write_pos = write_pos_.fetch_add(1, std::memory_order_relaxed);
+      if (write_pos >= nodes_.size()) {
+        return PushStatus::Closed;
+      }
+      if (nodes_[static_cast<size_t>(write_pos)].one_value.set_value(value)) {
+        //stat_.push_loop_ok(0);
+        return PushStatus::Ok;
+      }
+      //stat_.push_loop_error(0);
+    }
+  }
+
+ private:
+  struct Node {
+    OneValue<T> one_value;
+  };
+  std::atomic<uint64> write_pos_{0};
+  char pad[TD_CONCURRENCY_PAD - sizeof(std::atomic<uint64>)];
+  std::atomic<uint64> read_pos_{0};
+  char pad2[TD_CONCURRENCY_PAD - sizeof(std::atomic<uint64>)];
+  std::vector<Node> nodes_;
+  char pad3[TD_CONCURRENCY_PAD - sizeof(std::vector<Node>)];
+};
+
+template <class T>
+class MpmcQueueOld {
+ public:
+  explicit MpmcQueueOld(size_t threads_n) : MpmcQueueOld(1024, threads_n) {
+  }
+  static std::string get_description() {
+    return "Mpmc queue (fetch and add array queue)";
+  }
+  MpmcQueueOld(size_t block_size, size_t threads_n) : block_size_{block_size}, hazard_pointers_{threads_n} {
+    auto node = make_unique<Node>(block_size_);
+    write_pos_ = node.get();
+    read_pos_ = node.get();
+    node.release();
+  }
+
+  MpmcQueueOld(const MpmcQueueOld &other) = delete;
+  MpmcQueueOld &operator=(const MpmcQueueOld &other) = delete;
+  MpmcQueueOld(MpmcQueueOld &&other) = delete;
+  MpmcQueueOld &operator=(MpmcQueueOld &&other) = delete;
+  ~MpmcQueueOld() {
+    auto *ptr = read_pos_.load(std::memory_order_relaxed);
+    while (ptr) {
+      auto *to_delete = ptr;
+      ptr = ptr->next_.load(std::memory_order_relaxed);
+      delete to_delete;
+    }
+    //stat_.dump();
+    //stat_ = detail::MpmcStat();
+  }
+
+  size_t hazard_pointers_to_delele_size_unsafe() const {
+    return hazard_pointers_.to_delete_size_unsafe();
+  }
+  void gc(size_t thread_id) {
+    hazard_pointers_.retire(thread_id);
+  }
+
+  using PushStatus = typename MpmcQueueBlock<T>::PushStatus;
+  using PopStatus = typename MpmcQueueBlock<T>::PopStatus;
+
+  void push(T value, size_t thread_id) {
+    typename decltype(hazard_pointers_)::Holder hazard_ptr_holder(hazard_pointers_, thread_id, 0);
+    while (true) {
+      auto node = hazard_ptr_holder.protect(write_pos_);
+      auto status = node->block.push(value);
+      switch (status) {
+        case PushStatus::Ok:
+          return;
+        case PushStatus::Closed: {
+          auto next = node->next_.load(std::memory_order_acquire);
+          if (next == nullptr) {
+            auto new_node = new Node(block_size_);
+            new_node->block.push(value);
+            if (node->next_.compare_exchange_strong(next, new_node, std::memory_order_acq_rel)) {
+              //stat_.alloc_ok(thread_id);
+              write_pos_.compare_exchange_strong(node, new_node, std::memory_order_acq_rel);
+              return;
+            } else {
+              //stat_.alloc_error(thread_id);
+              new_node->block.pop(value);
+              //CHECK(status == PopStatus::Ok);
+              delete new_node;
+            }
+          }
+          //CHECK(next != nullptr);
+          write_pos_.compare_exchange_strong(node, next, std::memory_order_acq_rel);
+          break;
+        }
+      }
+    }
+  }
+
+  bool try_pop(T &value, size_t thread_id) {
+    typename decltype(hazard_pointers_)::Holder hazard_ptr_holder(hazard_pointers_, thread_id, 0);
+    while (true) {
+      auto node = hazard_ptr_holder.protect(read_pos_);
+      auto status = node->block.try_pop(value);
+      switch (status) {
+        case PopStatus::Ok:
+          return true;
+        case PopStatus::Empty:
+          return false;
+        case PopStatus::Closed: {
+          auto next = node->next_.load(std::memory_order_acquire);
+          if (!next) {
+            return false;
+          }
+          if (read_pos_.compare_exchange_strong(node, next, std::memory_order_acq_rel)) {
+            hazard_ptr_holder.clear();
+            hazard_pointers_.retire(thread_id, node);
+          }
+          break;
+        }
+      }
+    }
+  }
+
+  T pop(size_t thread_id) {
+    T value;
+    while (true) {
+      if (try_pop(value, thread_id)) {
+        return value;
+      }
+      td::this_thread::yield();
+    }
+  }
+
+ private:
+  struct Node {
+    explicit Node(size_t block_size) : block{block_size} {
+    }
+    std::atomic<Node *> next_{nullptr};
+    char pad[TD_CONCURRENCY_PAD - sizeof(std::atomic<Node *>)];
+    MpmcQueueBlock<T> block;
+    //Got pad in MpmcQueueBlock
+  };
+  std::atomic<Node *> write_pos_{nullptr};
+  char pad[TD_CONCURRENCY_PAD - sizeof(std::atomic<Node *>)];
+  std::atomic<Node *> read_pos_{nullptr};
+  char pad2[TD_CONCURRENCY_PAD - sizeof(std::atomic<Node *>)];
+  size_t block_size_;
+  HazardPointers<Node, 1> hazard_pointers_;
+  //Got pad in HazardPointers
+};
+
+template <class T>
+class MpmcQueue {
+ public:
+  explicit MpmcQueue(size_t threads_n) : MpmcQueue(1024, threads_n) {
+  }
+  static std::string get_description() {
+    return "NEW Mpmc queue (fetch and add array queue)";
+  }
+  MpmcQueue(size_t block_size, size_t threads_n) : hazard_pointers_{threads_n} {
+    auto node = make_unique<Node>();
+    write_pos_ = node.get();
+    read_pos_ = node.get();
+    node.release();
+  }
+
+  MpmcQueue(const MpmcQueue &other) = delete;
+  MpmcQueue &operator=(const MpmcQueue &other) = delete;
+  MpmcQueue(MpmcQueue &&other) = delete;
+  MpmcQueue &operator=(MpmcQueue &&other) = delete;
+  ~MpmcQueue() {
+    auto *ptr = read_pos_.load(std::memory_order_relaxed);
+    while (ptr) {
+      auto *to_delete = ptr;
+      ptr = ptr->next.load(std::memory_order_relaxed);
+      delete to_delete;
+    }
+  }
+
+  size_t hazard_pointers_to_delele_size_unsafe() const {
+    return hazard_pointers_.to_delete_size_unsafe();
+  }
+  void gc(size_t thread_id) {
+    hazard_pointers_.retire(thread_id);
+  }
+
+  void push(T value, size_t thread_id) {
+    SCOPE_EXIT {
+      hazard_pointers_.clear(thread_id, 0);
+    };
+    while (true) {
+      auto node = hazard_pointers_.protect(thread_id, 0, write_pos_);
+      auto &block = node->block;
+      auto pos = block.write_pos++;
+      if (pos >= block.data.size()) {
+        auto next = node->next.load();
+        if (next == nullptr) {
+          auto new_node = new Node{};
+          new_node->block.write_pos++;
+          new_node->block.data[0].set_value(value);
+          Node *null = nullptr;
+          if (node->next.compare_exchange_strong(null, new_node)) {
+            write_pos_.compare_exchange_strong(node, new_node);
+            return;
+          } else {
+            new_node->block.data[0].get_value(value);
+            delete new_node;
+          }
+        } else {
+          write_pos_.compare_exchange_strong(node, next);
+        }
+      } else {
+        if (block.data[static_cast<size_t>(pos)].set_value(value)) {
+          return;
+        }
+      }
+    }
+  }
+
+  bool try_pop(T &value, size_t thread_id) {
+    SCOPE_EXIT {
+      hazard_pointers_.clear(thread_id, 0);
+    };
+    while (true) {
+      auto node = hazard_pointers_.protect(thread_id, 0, read_pos_);
+      auto &block = node->block;
+      if (block.write_pos <= block.read_pos && node->next.load(std::memory_order_relaxed) == nullptr) {
+        return false;
+      }
+      auto pos = block.read_pos++;
+      if (pos >= block.data.size()) {
+        auto next = node->next.load();
+        if (!next) {
+          return false;
+        }
+        if (read_pos_.compare_exchange_strong(node, next)) {
+          hazard_pointers_.clear(thread_id, 0);
+          hazard_pointers_.retire(thread_id, node);
+        }
+      } else {
+        if (block.data[static_cast<size_t>(pos)].get_value(value)) {
+          return true;
+        }
+      }
+    }
+  }
+
+  T pop(size_t thread_id) {
+    T value;
+    while (true) {
+      if (try_pop(value, thread_id)) {
+        return value;
+      }
+      td::this_thread::yield();
+    }
+  }
+
+ private:
+  struct Block {
+    std::atomic<uint64> write_pos{0};
+    char pad[TD_CONCURRENCY_PAD - sizeof(std::atomic<uint64>)];
+    std::atomic<uint64> read_pos{0};
+    char pad2[TD_CONCURRENCY_PAD - sizeof(std::atomic<uint64>)];
+    std::array<OneValue<T>, 1024> data;
+    char pad3[TD_CONCURRENCY_PAD];
+  };
+  struct Node {
+    Node() = default;
+
+    Block block;
+    std::atomic<Node *> next{nullptr};
+    char pad[TD_CONCURRENCY_PAD - sizeof(std::atomic<Node *>)];
+    //Got pad in MpmcQueueBlock
+  };
+  std::atomic<Node *> write_pos_{nullptr};
+  char pad[TD_CONCURRENCY_PAD - sizeof(std::atomic<Node *>)];
+  std::atomic<Node *> read_pos_{nullptr};
+  char pad2[TD_CONCURRENCY_PAD - sizeof(std::atomic<Node *>)];
+  HazardPointers<Node, 1> hazard_pointers_;
+  //Got pad in HazardPointers
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/MpmcWaiter.h b/submodules/ton/tonlib-src/tdutils/td/utils/MpmcWaiter.h
new file mode 100644
index 0000000000..42864cae56
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/MpmcWaiter.h
@@ -0,0 +1,120 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/port/thread.h"
+
+#include <atomic>
+#include <condition_variable>
+#include <mutex>
+
+namespace td {
+
+class MpmcWaiter {
+ public:
+  int wait(int yields, uint32 worker_id) {
+    if (yields < RoundsTillSleepy) {
+      td::this_thread::yield();
+      return yields + 1;
+    } else if (yields == RoundsTillSleepy) {
+      auto state = state_.load(std::memory_order_relaxed);
+      if (!State::has_worker(state)) {
+        auto new_state = State::with_worker(state, worker_id);
+        if (state_.compare_exchange_strong(state, new_state, std::memory_order_acq_rel)) {
+          td::this_thread::yield();
+          return yields + 1;
+        }
+        if (state == State::awake()) {
+          return 0;
+        }
+      }
+      td::this_thread::yield();
+      return 0;
+    } else if (yields < RoundsTillAsleep) {
+      auto state = state_.load(std::memory_order_acquire);
+      if (State::still_sleepy(state, worker_id)) {
+        td::this_thread::yield();
+        return yields + 1;
+      }
+      return 0;
+    } else {
+      auto state = state_.load(std::memory_order_acquire);
+      if (State::still_sleepy(state, worker_id)) {
+        std::unique_lock<std::mutex> lock(mutex_);
+        if (state_.compare_exchange_strong(state, State::asleep(), std::memory_order_acq_rel)) {
+          condition_variable_.wait(lock);
+        }
+      }
+      return 0;
+    }
+  }
+
+  int stop_wait(int yields, uint32 worker_id) {
+    if (yields > RoundsTillSleepy) {
+      notify_cold();
+    }
+    return 0;
+  }
+
+  void notify() {
+    std::atomic_thread_fence(std::memory_order_seq_cst);
+    if (state_.load(std::memory_order_acquire) == State::awake()) {
+      return;
+    }
+    notify_cold();
+  }
+
+ private:
+  struct State {
+    static constexpr uint32 awake() {
+      return 0;
+    }
+    static constexpr uint32 asleep() {
+      return 1;
+    }
+    static bool is_asleep(uint32 state) {
+      return (state & 1) != 0;
+    }
+    static bool has_worker(uint32 state) {
+      return (state >> 1) != 0;
+    }
+    static int32 with_worker(uint32 state, uint32 worker) {
+      return state | ((worker + 1) << 1);
+    }
+    static bool still_sleepy(uint32 state, uint32 worker) {
+      return (state >> 1) == (worker + 1);
+    }
+  };
+  //enum { RoundsTillSleepy = 32, RoundsTillAsleep = 64 };
+  enum { RoundsTillSleepy = 1, RoundsTillAsleep = 2 };
+  std::atomic<uint32> state_{State::awake()};
+  std::mutex mutex_;
+  std::condition_variable condition_variable_;
+
+  void notify_cold() {
+    auto old_state = state_.exchange(State::awake(), std::memory_order_release);
+    if (State::is_asleep(old_state)) {
+      std::lock_guard<std::mutex> guard(mutex_);
+      condition_variable_.notify_all();
+    }
+  }
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/MpscLinkQueue.h b/submodules/ton/tonlib-src/tdutils/td/utils/MpscLinkQueue.h
new file mode 100644
index 0000000000..6f88ddf2e5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/MpscLinkQueue.h
@@ -0,0 +1,185 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#include <atomic>
+
+namespace td {
+//NB: holder of the queue holds all responsibility of freeing its nodes
+class MpscLinkQueueImpl {
+ public:
+  class Node;
+  class Reader;
+
+  void push(Node *node) {
+    node->next_ = head_.load(std::memory_order_relaxed);
+    while (!head_.compare_exchange_strong(node->next_, node, std::memory_order_release, std::memory_order_relaxed)) {
+    }
+  }
+
+  void push_unsafe(Node *node) {
+    node->next_ = head_.load(std::memory_order_relaxed);
+    head_.store(node, std::memory_order_relaxed);
+  }
+
+  void pop_all(Reader &reader) {
+    return reader.add(head_.exchange(nullptr, std::memory_order_acquire));
+  }
+
+  void pop_all_unsafe(Reader &reader) {
+    return reader.add(head_.exchange(nullptr, std::memory_order_relaxed));
+  }
+
+  class Node {
+    friend class MpscLinkQueueImpl;
+    Node *next_{nullptr};
+  };
+
+  class Reader {
+   public:
+    Node *read() {
+      auto old_head = head_;
+      if (head_) {
+        head_ = head_->next_;
+      }
+      return old_head;
+    }
+    void delay(Node *node) {
+      node->next_ = head_;
+      if (!head_) {
+        tail_ = node;
+      }
+      head_ = node;
+    }
+    size_t calc_size() const {
+      size_t res = 0;
+      for (auto it = head_; it != nullptr; it = it->next_, res++) {
+      }
+      return res;
+    }
+
+   private:
+    friend class MpscLinkQueueImpl;
+    void add(Node *node) {
+      if (node == nullptr) {
+        return;
+      }
+      // Reverse list
+      Node *tail = node;
+      Node *head = nullptr;
+      while (node) {
+        auto next = node->next_;
+        node->next_ = head;
+        head = node;
+        node = next;
+      }
+      if (head_ == nullptr) {
+        head_ = head;
+      } else {
+        tail_->next_ = head;
+      }
+      tail_ = tail;
+    }
+    Node *head_{nullptr};
+    Node *tail_{nullptr};
+  };
+
+ private:
+  std::atomic<Node *> head_{nullptr};
+};
+
+// Uses MpscLinkQueueImpl.
+// Node should have to_mpsc_link_queue_node and from_mpsc_link_queue_node functions
+template <class Node>
+class MpscLinkQueue {
+ public:
+  void push(Node node) {
+    impl_.push(node.to_mpsc_link_queue_node());
+  }
+  void push_unsafe(Node node) {
+    impl_.push_unsafe(node.to_mpsc_link_queue_node());
+  }
+  class Reader {
+   public:
+    ~Reader() {
+      CHECK(!read());
+    }
+    Node read() {
+      auto node = impl_.read();
+      if (!node) {
+        return {};
+      }
+      return Node::from_mpsc_link_queue_node(node);
+    }
+    void delay(Node node) {
+      impl_.delay(node.to_mpsc_link_queue_node());
+    }
+    size_t calc_size() const {
+      return impl_.calc_size();
+    }
+
+   private:
+    friend class MpscLinkQueue;
+
+    MpscLinkQueueImpl::Reader impl_;
+    MpscLinkQueueImpl::Reader &impl() {
+      return impl_;
+    }
+  };
+
+  void pop_all(Reader &reader) {
+    return impl_.pop_all(reader.impl());
+  }
+  void pop_all_unsafe(Reader &reader) {
+    return impl_.pop_all_unsafe(reader.impl());
+  }
+
+ private:
+  MpscLinkQueueImpl impl_;
+};
+
+template <class Value>
+class MpscLinkQueueUniquePtrNode {
+ public:
+  MpscLinkQueueUniquePtrNode() = default;
+  explicit MpscLinkQueueUniquePtrNode(unique_ptr<Value> ptr) : ptr_(std::move(ptr)) {
+  }
+
+  MpscLinkQueueImpl::Node *to_mpsc_link_queue_node() {
+    return ptr_.release()->to_mpsc_link_queue_node();
+  }
+  static MpscLinkQueueUniquePtrNode<Value> from_mpsc_link_queue_node(td::MpscLinkQueueImpl::Node *node) {
+    return MpscLinkQueueUniquePtrNode<Value>(unique_ptr<Value>(Value::from_mpsc_link_queue_node(node)));
+  }
+
+  explicit operator bool() {
+    return ptr_ != nullptr;
+  }
+
+  Value &value() {
+    return *ptr_;
+  }
+
+ private:
+  unique_ptr<Value> ptr_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/MpscPollableQueue.h b/submodules/ton/tonlib-src/tdutils/td/utils/MpscPollableQueue.h
new file mode 100644
index 0000000000..8a05877942
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/MpscPollableQueue.h
@@ -0,0 +1,164 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/EventFd.h"
+
+#if !TD_EVENTFD_UNSUPPORTED
+
+#include "td/utils/SpinLock.h"
+
+#include <utility>
+
+namespace td {
+// interface like in PollableQueue
+template <class T>
+class MpscPollableQueue {
+ public:
+  using ValueType = T;
+
+  int reader_wait_nonblock() {
+    auto ready = reader_vector_.size() - reader_pos_;
+    if (ready != 0) {
+      return narrow_cast<int>(ready);
+    }
+
+    for (int i = 0; i < 2; i++) {
+      auto guard = lock_.lock();
+      if (writer_vector_.empty()) {
+        if (i == 1) {
+          wait_event_fd_ = true;
+          return 0;
+        }
+      } else {
+        reader_vector_.clear();
+        reader_pos_ = 0;
+        std::swap(writer_vector_, reader_vector_);
+        return narrow_cast<int>(reader_vector_.size());
+      }
+      event_fd_.acquire();
+    }
+    UNREACHABLE();
+  }
+  ValueType reader_get_unsafe() {
+    return std::move(reader_vector_[reader_pos_++]);
+  }
+  void reader_flush() {
+    //nop
+  }
+  void writer_put(ValueType value) {
+    auto guard = lock_.lock();
+    writer_vector_.push_back(std::move(value));
+    if (wait_event_fd_) {
+      wait_event_fd_ = false;
+      guard.reset();
+      event_fd_.release();
+    }
+  }
+  EventFd &reader_get_event_fd() {
+    return event_fd_;
+  }
+  void writer_flush() {
+    //nop
+  }
+
+  void init() {
+    event_fd_.init();
+  }
+  void destroy() {
+    if (!event_fd_.empty()) {
+      event_fd_.close();
+      wait_event_fd_ = false;
+      writer_vector_.clear();
+      reader_vector_.clear();
+      reader_pos_ = 0;
+    }
+  }
+
+  // Just an example of usage
+  int reader_wait() {
+    int res;
+    while ((res = reader_wait_nonblock()) == 0) {
+      reader_get_event_fd().wait(1000);
+    }
+    return res;
+  }
+
+ private:
+  SpinLock lock_;
+  bool wait_event_fd_{false};
+  EventFd event_fd_;
+  std::vector<ValueType> writer_vector_;
+  std::vector<ValueType> reader_vector_;
+  size_t reader_pos_{0};
+};
+
+}  // namespace td
+
+#else
+
+namespace td {
+
+// dummy implementation which shouldn't be used
+
+template <class T>
+class MpscPollableQueue {
+ public:
+  using ValueType = T;
+
+  void init() {
+    UNREACHABLE();
+  }
+
+  template <class PutValueType>
+  void writer_put(PutValueType &&value) {
+    UNREACHABLE();
+  }
+
+  void writer_flush() {
+    UNREACHABLE();
+  }
+
+  int reader_wait_nonblock() {
+    UNREACHABLE();
+    return 0;
+  }
+
+  ValueType reader_get_unsafe() {
+    UNREACHABLE();
+    return ValueType();
+  }
+
+  void reader_flush() {
+    UNREACHABLE();
+  }
+
+  MpscPollableQueue() = default;
+  MpscPollableQueue(const MpscPollableQueue &) = delete;
+  MpscPollableQueue &operator=(const MpscPollableQueue &) = delete;
+  MpscPollableQueue(MpscPollableQueue &&) = delete;
+  MpscPollableQueue &operator=(MpscPollableQueue &&) = delete;
+  ~MpscPollableQueue() = default;
+};
+
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Named.h b/submodules/ton/tonlib-src/tdutils/td/utils/Named.h
new file mode 100644
index 0000000000..49b3324c21
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Named.h
@@ -0,0 +1,39 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+
+namespace td {
+
+class Named {
+ public:
+  Slice get_name() const {
+    return name_;
+  }
+  void set_name(Slice name) {
+    name_ = name.str();
+  }
+
+ private:
+  string name_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/ObjectPool.h b/submodules/ton/tonlib-src/tdutils/td/utils/ObjectPool.h
new file mode 100644
index 0000000000..44cd67b59f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/ObjectPool.h
@@ -0,0 +1,261 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+
+#include <atomic>
+#include <memory>
+#include <utility>
+
+namespace td {
+// It is draft object pool implementaion
+//
+// Compared with std::shared_ptr:
+// + WeakPtr are much faster. Just pointer copy. No barriers, no atomics.
+// - We can't destroy object, because we don't know if it is pointed to by some weak pointer
+//
+template <class DataT>
+class ObjectPool {
+  struct Storage;
+
+ public:
+  class WeakPtr {
+   public:
+    WeakPtr() : generation_(-1), storage_(nullptr) {
+    }
+    WeakPtr(int32 generation, Storage *storage) : generation_(generation), storage_(storage) {
+    }
+
+    DataT &operator*() const {
+      return storage_->data;
+    }
+
+    DataT *operator->() const {
+      return &**this;
+    }
+
+    // Pattern of usage: 1. Read an object 2. Check if read was valid via is_alive
+    //
+    // It is not very usual case of acquire/release use.
+    // Instead of publishing an object via some flag we do the opposite.
+    // We publish new generation via destruction of the data.
+    // In usual case if we see a flag then we are able to use an object.
+    // In our case if we have used an object and it is already invalid, then generation will mismatch
+    bool is_alive() const {
+      if (!storage_) {
+        return false;
+      }
+      std::atomic_thread_fence(std::memory_order_acquire);
+      return generation_ == storage_->generation.load(std::memory_order_relaxed);
+    }
+
+    // Used for ActorId
+    bool is_alive_unsafe() const {
+      if (!storage_) {
+        return false;
+      }
+      return generation_ == storage_->generation.load(std::memory_order_relaxed);
+    }
+
+    bool empty() const {
+      return storage_ == nullptr;
+    }
+    void clear() {
+      generation_ = -1;
+      storage_ = nullptr;
+    }
+    int32 generation() {
+      return generation_;
+    }
+
+   private:
+    int32 generation_;
+    Storage *storage_;
+  };
+
+  class OwnerPtr {
+   public:
+    OwnerPtr() = default;
+    OwnerPtr(const OwnerPtr &) = delete;
+    OwnerPtr &operator=(const OwnerPtr &) = delete;
+    OwnerPtr(OwnerPtr &&other) : storage_(other.storage_), parent_(other.parent_) {
+      other.storage_ = nullptr;
+      other.parent_ = nullptr;
+    }
+    OwnerPtr &operator=(OwnerPtr &&other) {
+      if (this != &other) {
+        storage_ = other.storage_;
+        parent_ = other.parent_;
+        other.storage_ = nullptr;
+        other.parent_ = nullptr;
+      }
+      return *this;
+    }
+    ~OwnerPtr() {
+      reset();
+    }
+
+    DataT *get() {
+      return &storage_->data;
+    }
+    DataT &operator*() {
+      return *get();
+    }
+    DataT *operator->() {
+      return get();
+    }
+
+    const DataT *get() const {
+      return &storage_->data;
+    }
+    const DataT &operator*() const {
+      return *get();
+    }
+    const DataT *operator->() const {
+      return get();
+    }
+
+    WeakPtr get_weak() {
+      return WeakPtr(storage_->generation.load(std::memory_order_relaxed), storage_);
+    }
+    int32 generation() {
+      return storage_->generation.load(std::memory_order_relaxed);
+    }
+
+    Storage *release() {
+      auto result = storage_;
+      storage_ = nullptr;
+      return result;
+    }
+
+    bool empty() const {
+      return storage_ == nullptr;
+    }
+
+    void reset() {
+      if (storage_ != nullptr) {
+        // for crazy cases when data owns owner pointer to itself.
+        auto tmp = storage_;
+        storage_ = nullptr;
+        parent_->release(OwnerPtr(tmp, parent_));
+      }
+    }
+
+   private:
+    friend class ObjectPool;
+    OwnerPtr(Storage *storage, ObjectPool<DataT> *parent) : storage_(storage), parent_(parent) {
+    }
+    Storage *storage_ = nullptr;
+    ObjectPool<DataT> *parent_ = nullptr;
+  };
+
+  template <class... ArgsT>
+  OwnerPtr create(ArgsT &&... args) {
+    Storage *storage = get_storage();
+    storage->init_data(std::forward<ArgsT>(args)...);
+    return OwnerPtr(storage, this);
+  }
+
+  OwnerPtr create_empty() {
+    Storage *storage = get_storage();
+    return OwnerPtr(storage, this);
+  }
+
+  void set_check_empty(bool flag) {
+    check_empty_flag_ = flag;
+  }
+
+  void release(OwnerPtr &&owner_ptr) {
+    Storage *storage = owner_ptr.release();
+    storage->destroy_data();
+    release_storage(storage);
+  }
+
+  ObjectPool() = default;
+  ObjectPool(const ObjectPool &) = delete;
+  ObjectPool &operator=(const ObjectPool &) = delete;
+  ObjectPool(ObjectPool &&other) = delete;
+  ObjectPool &operator=(ObjectPool &&other) = delete;
+  ~ObjectPool() {
+    while (head_.load()) {
+      auto to_delete = head_.load();
+      head_ = to_delete->next;
+      delete to_delete;
+      storage_count_--;
+    }
+    LOG_CHECK(storage_count_.load() == 0) << storage_count_.load();
+  }
+
+ private:
+  struct Storage {
+    // union {
+    DataT data;
+    //};
+    Storage *next = nullptr;
+    std::atomic<int32> generation{1};
+
+    template <class... ArgsT>
+    void init_data(ArgsT &&... args) {
+      // new  (&data) DataT(std::forward<ArgsT>(args)...);
+      data = DataT(std::forward<ArgsT>(args)...);
+    }
+    void destroy_data() {
+      generation.fetch_add(1, std::memory_order_relaxed);
+      std::atomic_thread_fence(std::memory_order_release);
+      data.clear();
+    }
+  };
+
+  std::atomic<int32> storage_count_{0};
+  std::atomic<Storage *> head_{static_cast<Storage *>(nullptr)};
+  bool check_empty_flag_ = false;
+
+  // TODO(perf): allocation Storages in chunks? Anyway we won't be able to release them.
+  // TODO(perf): memory order
+  // TODO(perf): use another non lockfree list for release on the same thread
+  // only one thread, so no aba problem
+  Storage *get_storage() {
+    if (head_.load() == nullptr) {
+      storage_count_++;
+      return new Storage();
+    }
+    Storage *res;
+    while (true) {
+      res = head_.load();
+      auto *next = res->next;
+      if (head_.compare_exchange_weak(res, next)) {
+        break;
+      }
+    }
+    return res;
+  }
+  // release can be called from other thread
+  void release_storage(Storage *storage) {
+    while (true) {
+      auto *save_head = head_.load();
+      storage->next = save_head;
+      if (head_.compare_exchange_weak(save_head, storage)) {
+        break;
+      }
+    }
+  }
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Observer.h b/submodules/ton/tonlib-src/tdutils/td/utils/Observer.h
new file mode 100644
index 0000000000..a246d4e81b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Observer.h
@@ -0,0 +1,53 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+namespace td {
+
+class ObserverBase {
+ public:
+  ObserverBase() = default;
+  ObserverBase(const ObserverBase &) = delete;
+  ObserverBase &operator=(const ObserverBase &) = delete;
+  ObserverBase(ObserverBase &&) = delete;
+  ObserverBase &operator=(ObserverBase &&) = delete;
+  virtual ~ObserverBase() = default;
+
+  virtual void notify() = 0;
+};
+
+class Observer : ObserverBase {
+ public:
+  Observer() = default;
+  explicit Observer(unique_ptr<ObserverBase> &&ptr) : observer_ptr_(std::move(ptr)) {
+  }
+
+  void notify() override {
+    if (observer_ptr_) {
+      observer_ptr_->notify();
+    }
+  }
+
+ private:
+  unique_ptr<ObserverBase> observer_ptr_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/OptionsParser.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/OptionsParser.cpp
new file mode 100644
index 0000000000..fc5e474a6d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/OptionsParser.cpp
@@ -0,0 +1,147 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/OptionsParser.h"
+
+#if TD_HAVE_GETOPT
+#include "getopt.h"
+#endif
+
+#if !TD_WINDOWS
+#include <getopt.h>
+#include <unistd.h>
+#endif
+
+namespace td {
+
+void OptionsParser::set_description(std::string description) {
+  description_ = std::move(description);
+}
+
+void OptionsParser::add_option(Option::Type type, char short_key, Slice long_key, Slice description,
+                               std::function<Status(Slice)> callback) {
+  for (auto &option : options_) {
+    if (option.short_key == short_key || (!long_key.empty() && long_key == option.long_key)) {
+      LOG(ERROR) << "Ignore duplicated option '" << short_key << "' '" << long_key << "'";
+    }
+  }
+  options_.push_back(Option{type, short_key, long_key.str(), description.str(), std::move(callback)});
+}
+
+void OptionsParser::add_option(char short_key, Slice long_key, Slice description,
+                               std::function<Status(Slice)> callback) {
+  add_option(Option::Type::Arg, short_key, long_key, description, std::move(callback));
+}
+
+void OptionsParser::add_option(char short_key, Slice long_key, Slice description,
+                               std::function<Status(void)> callback) {
+  // Ouch. There must be some better way
+  add_option(Option::Type::NoArg, short_key, long_key, description,
+             std::bind([](std::function<Status(void)> &func, Slice) { return func(); }, std::move(callback),
+                       std::placeholders::_1));
+}
+
+Result<int> OptionsParser::run(int argc, char *argv[]) {
+#if TD_HAVE_GETOPT
+  char buff[1024];
+  StringBuilder sb(MutableSlice{buff, sizeof(buff)});
+  for (auto &opt : options_) {
+    CHECK(opt.type != Option::OptionalArg);
+    sb << opt.short_key;
+    if (opt.type == Option::Arg) {
+      sb << ":";
+    }
+  }
+  if (sb.is_error()) {
+    return Status::Error("Can't parse options");
+  }
+  CSlice short_options = sb.as_cslice();
+
+  vector<option> long_options;
+  for (auto &opt : options_) {
+    if (opt.long_key.empty()) {
+      continue;
+    }
+    option o;
+    o.flag = nullptr;
+    o.val = opt.short_key;
+    o.has_arg = opt.type == Option::Arg ? required_argument : no_argument;
+    o.name = opt.long_key.c_str();
+    long_options.push_back(o);
+  }
+  long_options.push_back({nullptr, 0, nullptr, 0});
+
+  while (true) {
+    int opt_i = getopt_long(argc, argv, short_options.c_str(), &long_options[0], nullptr);
+    if (opt_i == ':') {
+      return Status::Error("Missing argument");
+    }
+    if (opt_i == '?') {
+      return Status::Error("Unrecognized option");
+    }
+    if (opt_i == -1) {
+      break;
+    }
+    bool found = false;
+    for (auto &opt : options_) {
+      if (opt.short_key == opt_i) {
+        Slice arg;
+        if (opt.type == Option::Arg) {
+          arg = Slice(optarg);
+        }
+        auto status = opt.arg_callback(arg);
+        if (status.is_error()) {
+          return std::move(status);
+        }
+        found = true;
+        break;
+      }
+    }
+    if (!found) {
+      return Status::Error("Unknown argument");
+    }
+  }
+  return optind;
+#else
+  return -1;
+#endif
+}
+
+StringBuilder &operator<<(StringBuilder &sb, const OptionsParser &o) {
+  sb << o.description_ << "\n";
+  for (auto &opt : o.options_) {
+    sb << "-" << opt.short_key;
+    if (!opt.long_key.empty()) {
+      sb << "|--" << opt.long_key;
+    }
+    if (opt.type == OptionsParser::Option::OptionalArg) {
+      sb << "[";
+    }
+    if (opt.type != OptionsParser::Option::NoArg) {
+      sb << "<arg>";
+    }
+    if (opt.type == OptionsParser::Option::OptionalArg) {
+      sb << "]";
+    }
+    sb << "\t" << opt.description;
+    sb << "\n";
+  }
+  return sb;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/OptionsParser.h b/submodules/ton/tonlib-src/tdutils/td/utils/OptionsParser.h
new file mode 100644
index 0000000000..2a9e568c03
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/OptionsParser.h
@@ -0,0 +1,60 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+#include "td/utils/StringBuilder.h"
+
+#include <functional>
+
+namespace td {
+
+class OptionsParser {
+  class Option {
+   public:
+    enum Type { NoArg, Arg, OptionalArg };
+    Type type;
+    char short_key;
+    std::string long_key;
+    std::string description;
+    std::function<Status(Slice)> arg_callback;
+  };
+
+ public:
+  void set_description(std::string description);
+
+  void add_option(Option::Type type, char short_key, Slice long_key, Slice description,
+                  std::function<Status(Slice)> callback);
+
+  void add_option(char short_key, Slice long_key, Slice description, std::function<Status(Slice)> callback);
+
+  void add_option(char short_key, Slice long_key, Slice description, std::function<Status(void)> callback);
+
+  Result<int> run(int argc, char *argv[]) TD_WARN_UNUSED_RESULT;
+
+  friend StringBuilder &operator<<(StringBuilder &sb, const OptionsParser &o);
+
+ private:
+  std::vector<Option> options_;
+  std::string description_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/OrderedEventsProcessor.h b/submodules/ton/tonlib-src/tdutils/td/utils/OrderedEventsProcessor.h
new file mode 100644
index 0000000000..b167c804a5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/OrderedEventsProcessor.h
@@ -0,0 +1,111 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+
+#include <utility>
+
+namespace td {
+
+// Process states in order defined by their Id
+template <class DataT>
+class OrderedEventsProcessor {
+ public:
+  using SeqNo = uint64;
+
+  OrderedEventsProcessor() = default;
+  explicit OrderedEventsProcessor(SeqNo offset) : offset_(offset), begin_(offset_), end_(offset_) {
+  }
+
+  template <class FunctionT>
+  void clear(FunctionT &&function) {
+    for (auto &it : data_array_) {
+      if (it.second) {
+        function(std::move(it.first));
+      }
+    }
+    *this = OrderedEventsProcessor();
+  }
+  void clear() {
+    *this = OrderedEventsProcessor();
+  }
+  template <class FromDataT, class FunctionT>
+  void add(SeqNo seq_no, FromDataT &&data, FunctionT &&function) {
+    LOG_CHECK(seq_no >= begin_) << seq_no << ">=" << begin_;  // or ignore?
+
+    if (seq_no == begin_) {  // run now
+      begin_++;
+      function(seq_no, std::forward<FromDataT>(data));
+
+      while (begin_ < end_) {
+        auto &data_flag = data_array_[static_cast<size_t>(begin_ - offset_)];
+        if (!data_flag.second) {
+          break;
+        }
+        function(begin_, std::move(data_flag.first));
+        data_flag.second = false;
+        begin_++;
+      }
+      if (begin_ > end_) {
+        end_ = begin_;
+      }
+      if (begin_ == end_) {
+        offset_ = begin_;
+      }
+
+      // try_compactify
+      auto begin_pos = static_cast<size_t>(begin_ - offset_);
+      if (begin_pos > 5 && begin_pos * 2 > data_array_.size()) {
+        data_array_.erase(data_array_.begin(), data_array_.begin() + begin_pos);
+        offset_ = begin_;
+      }
+    } else {
+      auto pos = static_cast<size_t>(seq_no - offset_);
+      auto need_size = pos + 1;
+      if (data_array_.size() < need_size) {
+        data_array_.resize(need_size);
+      }
+      data_array_[pos].first = std::forward<FromDataT>(data);
+      data_array_[pos].second = true;
+      if (end_ < seq_no + 1) {
+        end_ = seq_no + 1;
+      }
+    }
+  }
+
+  bool has_events() const {
+    return begin_ != end_;
+  }
+  SeqNo max_unfinished_seq_no() {
+    return end_ - 1;
+  }
+  SeqNo max_finished_seq_no() {
+    return begin_ - 1;
+  }
+
+ private:
+  SeqNo offset_ = 1;
+  SeqNo begin_ = 1;
+  SeqNo end_ = 1;
+  std::vector<std::pair<DataT, bool>> data_array_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Parser.h b/submodules/ton/tonlib-src/tdutils/td/utils/Parser.h
new file mode 100644
index 0000000000..ed26c44277
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Parser.h
@@ -0,0 +1,209 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+#include <cstring>
+#include <utility>
+
+namespace td {
+
+namespace detail {
+
+template <class SliceT>
+class ParserImpl {
+ public:
+  explicit ParserImpl(SliceT data) : ptr_(data.begin()), end_(data.end()), status_() {
+  }
+  ParserImpl(ParserImpl &&other) : ptr_(other.ptr_), end_(other.end_), status_(std::move(other.status_)) {
+    other.clear();
+  }
+  ParserImpl &operator=(ParserImpl &&other) {
+    if (&other == this) {
+      return *this;
+    }
+    ptr_ = other.ptr_;
+    end_ = other.end_;
+    status_ = std::move(other.status_);
+    other.clear();
+    return *this;
+  }
+  ParserImpl(const ParserImpl &) = delete;
+  ParserImpl &operator=(const ParserImpl &) = delete;
+  ~ParserImpl() = default;
+
+  bool empty() const {
+    return ptr_ == end_;
+  }
+  void clear() {
+    ptr_ = nullptr;
+    end_ = ptr_;
+    status_ = Status::OK();
+  }
+
+  SliceT read_till_nofail(char c) {
+    if (status_.is_error()) {
+      return SliceT();
+    }
+    auto till = static_cast<decltype(ptr_)>(std::memchr(ptr_, c, end_ - ptr_));
+    if (till == nullptr) {
+      till = end_;
+    }
+    SliceT result(ptr_, till);
+    ptr_ = till;
+    return result;
+  }
+
+  SliceT read_till_nofail(Slice str) {
+    if (status_.is_error()) {
+      return SliceT();
+    }
+    auto best_till = end_;
+    for (auto c : str) {
+      auto till = static_cast<decltype(ptr_)>(std::memchr(ptr_, c, end_ - ptr_));
+      if (till != nullptr && till < best_till) {
+        best_till = till;
+      }
+    }
+    SliceT result(ptr_, best_till);
+    ptr_ = best_till;
+    return result;
+  }
+
+  template <class F>
+  SliceT read_while(const F &f) {
+    auto save_ptr = ptr_;
+    while (ptr_ != end_ && f(*ptr_)) {
+      ptr_++;
+    }
+    return SliceT(save_ptr, ptr_);
+  }
+  SliceT read_all() {
+    auto save_ptr = ptr_;
+    ptr_ = end_;
+    return SliceT(save_ptr, ptr_);
+  }
+
+  SliceT read_till(char c) {
+    if (status_.is_error()) {
+      return SliceT();
+    }
+    SliceT res = read_till_nofail(c);
+    if (ptr_ == end_ || ptr_[0] != c) {
+      status_ = Status::Error(PSLICE() << "Read till " << tag("char", c) << " failed");
+      return SliceT();
+    }
+    return res;
+  }
+
+  char peek_char() {
+    if (ptr_ == end_) {
+      return 0;
+    }
+    return *ptr_;
+  }
+
+  char *ptr() {
+    return ptr_;
+  }
+
+  void skip_nofail(char c) {
+    if (ptr_ != end_ && ptr_[0] == c) {
+      ptr_++;
+    }
+  }
+  void skip(char c) {
+    if (status_.is_error()) {
+      return;
+    }
+    if (ptr_ == end_ || ptr_[0] != c) {
+      status_ = Status::Error(PSLICE() << "Skip " << tag("char", c) << " failed");
+      return;
+    }
+    ptr_++;
+  }
+  bool try_skip(char c) {
+    if (ptr_ != end_ && ptr_[0] == c) {
+      ptr_++;
+      return true;
+    }
+    return false;
+  }
+
+  void skip_till_not(Slice str) {
+    while (ptr_ != end_) {
+      if (std::memchr(str.data(), *ptr_, str.size()) == nullptr) {
+        break;
+      }
+      ptr_++;
+    }
+  }
+  void skip_whitespaces() {
+    skip_till_not(" \t\r\n");
+  }
+  SliceT read_word() {
+    skip_whitespaces();
+    return read_till_nofail(" \t\r\n");
+  }
+
+  SliceT data() const {
+    return SliceT(ptr_, end_);
+  }
+
+  Status &status() {
+    return status_;
+  }
+
+  bool start_with(Slice prefix) const {
+    if (prefix.size() > static_cast<size_t>(end_ - ptr_)) {
+      return false;
+    }
+    return prefix == Slice(ptr_, prefix.size());
+  }
+
+  bool skip_start_with(Slice prefix) {
+    if (start_with(prefix)) {
+      advance(prefix.size());
+      return true;
+    }
+    return false;
+  }
+
+  void advance(size_t diff) {
+    ptr_ += diff;
+    CHECK(ptr_ <= end_);
+  }
+
+ private:
+  decltype(std::declval<SliceT>().begin()) ptr_;
+  decltype(std::declval<SliceT>().end()) end_;
+  Status status_;
+};
+
+}  // namespace detail
+
+using Parser = detail::ParserImpl<MutableSlice>;
+using ConstParser = detail::ParserImpl<Slice>;
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/PathView.h b/submodules/ton/tonlib-src/tdutils/td/utils/PathView.h
new file mode 100644
index 0000000000..a313ea2d2a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/PathView.h
@@ -0,0 +1,128 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/misc.h"
+#include "td/utils/Slice.h"
+
+namespace td {
+
+class PathView {
+ public:
+  explicit PathView(Slice path) : path_(path) {
+    last_slash_ = narrow_cast<int32>(path_.size()) - 1;
+    while (last_slash_ >= 0 && !is_slash(path_[last_slash_])) {
+      last_slash_--;
+    }
+
+    last_dot_ = static_cast<int32>(path_.size());
+    for (auto i = last_dot_ - 1; i > last_slash_ + 1; i--) {
+      if (path_[i] == '.') {
+        last_dot_ = i;
+        break;
+      }
+    }
+  }
+
+  bool empty() const {
+    return path_.empty();
+  }
+
+  bool is_dir() const {
+    if (empty()) {
+      return false;
+    }
+    return is_slash(path_.back());
+  }
+
+  Slice parent_dir() const {
+    return path_.substr(0, last_slash_ + 1);
+  }
+
+  Slice extension() const {
+    if (last_dot_ == static_cast<int32>(path_.size())) {
+      return Slice();
+    }
+    return path_.substr(last_dot_ + 1);
+  }
+
+  Slice without_extension() const {
+    return path_.substr(0, last_dot_);
+  }
+
+  Slice file_stem() const {
+    return path_.substr(last_slash_ + 1, last_dot_ - last_slash_ - 1);
+  }
+
+  Slice file_name() const {
+    return path_.substr(last_slash_ + 1);
+  }
+
+  Slice path() const {
+    return path_;
+  }
+
+  bool is_absolute() const {
+    return !empty() && (is_slash(path_[0]) || (path_.size() >= 3 && path_[1] == ':' && is_slash(path_[2])));
+  }
+
+  bool is_relative() const {
+    return !is_absolute();
+  }
+
+  static Slice relative(Slice path, Slice dir, bool force = false) {
+    if (begins_with(path, dir)) {
+      path.remove_prefix(dir.size());
+      return path;
+    }
+    if (force) {
+      return Slice();
+    }
+    return path;
+  }
+
+  static Slice dir_and_file(Slice path) {
+    auto last_slash = static_cast<int32>(path.size()) - 1;
+    while (last_slash >= 0 && !is_slash(path[last_slash])) {
+      last_slash--;
+    }
+    if (last_slash < 0) {
+      return Slice();
+    }
+    last_slash--;
+    while (last_slash >= 0 && !is_slash(path[last_slash])) {
+      last_slash--;
+    }
+    if (last_slash < 0) {
+      return Slice();
+    }
+    return path.substr(last_slash + 1);
+  }
+
+ private:
+  static bool is_slash(char c) {
+    return c == '/' || c == '\\';
+  }
+
+  Slice path_;
+  int32 last_slash_;
+  int32 last_dot_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Random.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/Random.cpp
new file mode 100644
index 0000000000..d5be75a020
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Random.cpp
@@ -0,0 +1,196 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/Random.h"
+
+#include "td/utils/logging.h"
+#include "td/utils/port/thread_local.h"
+
+#if TD_HAVE_OPENSSL
+#include <openssl/rand.h>
+#endif
+
+#include <atomic>
+#include <cstring>
+#include <limits>
+#include <random>
+
+namespace td {
+
+#if TD_HAVE_OPENSSL
+
+namespace {
+std::atomic<int64> random_seed_generation{0};
+}  // namespace
+
+void Random::secure_bytes(MutableSlice dest) {
+  Random::secure_bytes(dest.ubegin(), dest.size());
+}
+
+void Random::secure_bytes(unsigned char *ptr, size_t size) {
+  constexpr size_t buf_size = 512;
+  static TD_THREAD_LOCAL unsigned char *buf;  // static zero-initialized
+  static TD_THREAD_LOCAL size_t buf_pos;
+  static TD_THREAD_LOCAL int64 generation;
+  if (init_thread_local<unsigned char[]>(buf, buf_size)) {
+    buf_pos = buf_size;
+    generation = 0;
+  }
+  if (ptr == nullptr) {
+    td::MutableSlice(buf, buf_size).fill_zero_secure();
+    buf_pos = buf_size;
+    return;
+  }
+  if (generation != random_seed_generation.load(std::memory_order_relaxed)) {
+    generation = random_seed_generation.load(std::memory_order_acquire);
+    buf_pos = buf_size;
+  }
+
+  auto ready = min(size, buf_size - buf_pos);
+  if (ready != 0) {
+    std::memcpy(ptr, buf + buf_pos, ready);
+    buf_pos += ready;
+    ptr += ready;
+    size -= ready;
+    if (size == 0) {
+      return;
+    }
+  }
+  if (size < buf_size) {
+    int err = RAND_bytes(buf, static_cast<int>(buf_size));
+    // TODO: it CAN fail
+    LOG_IF(FATAL, err != 1);
+    buf_pos = size;
+    std::memcpy(ptr, buf, size);
+    return;
+  }
+
+  CHECK(size <= static_cast<size_t>(std::numeric_limits<int>::max()));
+  int err = RAND_bytes(ptr, static_cast<int>(size));
+  // TODO: it CAN fail
+  LOG_IF(FATAL, err != 1);
+}
+
+int32 Random::secure_int32() {
+  int32 res = 0;
+  secure_bytes(reinterpret_cast<unsigned char *>(&res), sizeof(int32));
+  return res;
+}
+
+int64 Random::secure_int64() {
+  int64 res = 0;
+  secure_bytes(reinterpret_cast<unsigned char *>(&res), sizeof(int64));
+  return res;
+}
+
+uint32 Random::secure_uint32() {
+  uint32 res = 0;
+  secure_bytes(reinterpret_cast<unsigned char *>(&res), sizeof(uint32));
+  return res;
+}
+
+uint64 Random::secure_uint64() {
+  uint64 res = 0;
+  secure_bytes(reinterpret_cast<unsigned char *>(&res), sizeof(uint64));
+  return res;
+}
+
+void Random::add_seed(Slice bytes, double entropy) {
+  RAND_add(bytes.data(), static_cast<int>(bytes.size()), entropy);
+  random_seed_generation++;
+}
+
+void Random::secure_cleanup() {
+  Random::secure_bytes(nullptr, 0);
+}
+#endif
+
+static unsigned int rand_device_helper() {
+  static TD_THREAD_LOCAL std::random_device *rd;
+  init_thread_local<std::random_device>(rd);
+  return (*rd)();
+}
+
+uint32 Random::fast_uint32() {
+  static TD_THREAD_LOCAL std::mt19937 *gen;
+  if (!gen) {
+    auto &rg = rand_device_helper;
+    std::seed_seq seq{rg(), rg(), rg(), rg(), rg(), rg(), rg(), rg(), rg(), rg(), rg(), rg()};
+    init_thread_local<std::mt19937>(gen, seq);
+  }
+  return static_cast<uint32>((*gen)());
+}
+
+uint64 Random::fast_uint64() {
+  static TD_THREAD_LOCAL std::mt19937_64 *gen;
+  if (!gen) {
+    auto &rg = rand_device_helper;
+    std::seed_seq seq{rg(), rg(), rg(), rg(), rg(), rg(), rg(), rg(), rg(), rg(), rg(), rg()};
+    init_thread_local<std::mt19937_64>(gen, seq);
+  }
+  return static_cast<uint64>((*gen)());
+}
+
+int Random::fast(int min, int max) {
+  if (min == std::numeric_limits<int>::min() && max == std::numeric_limits<int>::max()) {
+    // to prevent integer overflow and division by zero
+    min++;
+  }
+  DCHECK(min <= max);
+  return static_cast<int>(min + fast_uint32() % (max - min + 1));  // TODO signed_cast
+}
+
+double Random::fast(double min, double max) {
+  DCHECK(min <= max);
+  return min +
+         fast_uint32() * 1.0 /
+             (static_cast<double>(std::numeric_limits<td::uint32>::max()) - std::numeric_limits<td::uint32>::min()) *
+             (max - min);
+}
+
+Random::Xorshift128plus::Xorshift128plus(uint64 seed) {
+  auto next = [&]() {
+    // splitmix64
+    seed += static_cast<uint64>(0x9E3779B97F4A7C15);
+    uint64 z = seed;
+    z = (z ^ (z >> 30)) * static_cast<uint64>(0xBF58476D1CE4E5B9);
+    z = (z ^ (z >> 27)) * static_cast<uint64>(0x94D049BB133111EB);
+    return z ^ (z >> 31);
+  };
+  seed_[0] = next();
+  seed_[1] = next();
+}
+
+Random::Xorshift128plus::Xorshift128plus(uint64 seed_a, uint64 seed_b) {
+  seed_[0] = seed_a;
+  seed_[1] = seed_b;
+}
+
+uint64 Random::Xorshift128plus::operator()() {
+  uint64 x = seed_[0];
+  const uint64 y = seed_[1];
+  seed_[0] = y;
+  x ^= x << 23;
+  seed_[1] = x ^ y ^ (x >> 17) ^ (y >> 26);
+  return seed_[1] + y;
+}
+int Random::Xorshift128plus::fast(int min, int max) {
+  return static_cast<int>((*this)() % (max - min + 1) + min);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Random.h b/submodules/ton/tonlib-src/tdutils/td/utils/Random.h
new file mode 100644
index 0000000000..5ca74d62cb
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Random.h
@@ -0,0 +1,60 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+
+namespace td {
+
+class Random {
+ public:
+#if TD_HAVE_OPENSSL
+  static void secure_bytes(MutableSlice dest);
+  static void secure_bytes(unsigned char *ptr, size_t size);
+  static int32 secure_int32();
+  static int64 secure_int64();
+  static uint32 secure_uint32();
+  static uint64 secure_uint64();
+
+  // works only for current thread
+  static void add_seed(Slice bytes, double entropy = 0);
+  static void secure_cleanup();
+#endif
+
+  static uint32 fast_uint32();
+  static uint64 fast_uint64();
+
+  // distribution is not uniform, min and max are included
+  static int fast(int min, int max);
+  static double fast(double min, double max);
+
+  class Xorshift128plus {
+   public:
+    explicit Xorshift128plus(uint64 seed);
+    Xorshift128plus(uint64 seed_a, uint64 seed_b);
+    uint64 operator()();
+    int fast(int min, int max);
+
+   private:
+    uint64 seed_[2];
+  };
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/ScopeGuard.h b/submodules/ton/tonlib-src/tdutils/td/utils/ScopeGuard.h
new file mode 100644
index 0000000000..6ed0c68497
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/ScopeGuard.h
@@ -0,0 +1,89 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#include <cstdlib>
+#include <memory>
+#include <type_traits>
+#include <utility>
+
+namespace td {
+
+class Guard {
+ public:
+  Guard() = default;
+  Guard(const Guard &other) = delete;
+  Guard &operator=(const Guard &other) = delete;
+  Guard(Guard &&other) = default;
+  Guard &operator=(Guard &&other) = default;
+  virtual ~Guard() = default;
+  virtual void dismiss() {
+    std::abort();
+  }
+};
+
+template <class FunctionT>
+class LambdaGuard : public Guard {
+ public:
+  explicit LambdaGuard(const FunctionT &func) : func_(func) {
+  }
+  explicit LambdaGuard(FunctionT &&func) : func_(std::move(func)) {
+  }
+  LambdaGuard(const LambdaGuard &other) = delete;
+  LambdaGuard &operator=(const LambdaGuard &other) = delete;
+  LambdaGuard(LambdaGuard &&other) : func_(std::move(other.func_)), dismissed_(other.dismissed_) {
+    other.dismissed_ = true;
+  }
+  LambdaGuard &operator=(LambdaGuard &&other) = delete;
+
+  void dismiss() {
+    dismissed_ = true;
+  }
+
+  ~LambdaGuard() {
+    if (!dismissed_) {
+      func_();
+    }
+  }
+
+ private:
+  FunctionT func_;
+  bool dismissed_ = false;
+};
+
+template <class F>
+unique_ptr<Guard> create_lambda_guard(F &&f) {
+  return make_unique<LambdaGuard<F>>(std::forward<F>(f));
+}
+template <class F>
+std::shared_ptr<Guard> create_shared_lambda_guard(F &&f) {
+  return std::make_shared<LambdaGuard<F>>(std::forward<F>(f));
+}
+
+enum class ScopeExit {};
+template <class FunctionT>
+auto operator+(ScopeExit, FunctionT &&func) {
+  return LambdaGuard<std::decay_t<FunctionT>>(std::forward<FunctionT>(func));
+}
+
+}  // namespace td
+
+#define SCOPE_EXIT auto TD_CONCAT(SCOPE_EXIT_VAR_, __LINE__) = ::td::ScopeExit() + [&]()
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/SharedObjectPool.h b/submodules/ton/tonlib-src/tdutils/td/utils/SharedObjectPool.h
new file mode 100644
index 0000000000..5f60614246
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/SharedObjectPool.h
@@ -0,0 +1,294 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/MpscLinkQueue.h"
+
+#include <atomic>
+#include <memory>
+#include <new>
+#include <utility>
+
+namespace td {
+
+namespace detail {
+class AtomicRefCnt {
+ public:
+  explicit AtomicRefCnt(uint64 cnt) : cnt_(cnt) {
+  }
+  void inc() {
+    cnt_.fetch_add(1, std::memory_order_relaxed);
+  }
+  bool dec() {
+    return cnt_.fetch_sub(1, std::memory_order_acq_rel) == 1;
+  }
+  uint64 value() const {
+    return cnt_.load(std::memory_order_relaxed);
+  }
+
+ private:
+  std::atomic<uint64> cnt_{0};
+};
+
+template <class DataT, class DeleterT>
+class SharedPtrRaw
+    : public DeleterT
+    , private MpscLinkQueueImpl::Node {
+ public:
+  explicit SharedPtrRaw(DeleterT deleter) : DeleterT(std::move(deleter)), ref_cnt_{0}, option_magic_(Magic) {
+  }
+
+  ~SharedPtrRaw() {
+    CHECK(use_cnt() == 0);
+    CHECK(option_magic_ == Magic);
+  }
+  template <class... ArgsT>
+  void init_data(ArgsT &&... args) {
+    new (&option_data_) DataT(std::forward<ArgsT>(args)...);
+  }
+  void destroy_data() {
+    option_data_.~DataT();
+    option_magic_ = Magic;
+  }
+  uint64 use_cnt() const {
+    return ref_cnt_.value();
+  }
+  void inc() {
+    ref_cnt_.inc();
+  }
+  bool dec() {
+    return ref_cnt_.dec();
+  }
+  DataT &data() {
+    return option_data_;
+  }
+  static SharedPtrRaw *from_mpsc_link_queue_node(MpscLinkQueueImpl::Node *node) {
+    return static_cast<SharedPtrRaw<DataT, DeleterT> *>(node);
+  }
+  MpscLinkQueueImpl::Node *to_mpsc_link_queue_node() {
+    return static_cast<MpscLinkQueueImpl::Node *>(this);
+  }
+
+ private:
+  AtomicRefCnt ref_cnt_;
+  enum { Magic = 0x732817a2 };
+  union {
+    DataT option_data_;
+    uint32 option_magic_;
+  };
+};
+
+template <class T, class DeleterT = std::default_delete<T>>
+class SharedPtr {
+ public:
+  using Raw = detail::SharedPtrRaw<T, DeleterT>;
+  SharedPtr() = default;
+  ~SharedPtr() {
+    if (!raw_) {
+      return;
+    }
+    reset();
+  }
+  explicit SharedPtr(Raw *raw) : raw_(raw) {
+    if (raw_) {
+      raw_->inc();
+    }
+  }
+  SharedPtr(const SharedPtr &other) : SharedPtr(other.raw_) {
+  }
+  SharedPtr &operator=(const SharedPtr &other) {
+    if (other.raw_) {
+      other.raw_->inc();
+    }
+    reset(other.raw_);
+    return *this;
+  }
+  SharedPtr(SharedPtr &&other) : raw_(other.raw_) {
+    other.raw_ = nullptr;
+  }
+  SharedPtr &operator=(SharedPtr &&other) {
+    reset(other.raw_);
+    other.raw_ = nullptr;
+    return *this;
+  }
+  bool empty() const {
+    return raw_ == nullptr;
+  }
+  explicit operator bool() const {
+    return !empty();
+  }
+  uint64 use_cnt() const {
+    if (!raw_) {
+      return 0;
+    }
+    return raw_->use_cnt();
+  }
+  T &operator*() const {
+    return raw_->data();
+  }
+  T *operator->() const {
+    return &raw_->data();
+  }
+
+  Raw *release() {
+    auto res = raw_;
+    raw_ = nullptr;
+    return res;
+  }
+
+  void reset(Raw *new_raw = nullptr) {
+    if (raw_ && raw_->dec()) {
+      raw_->destroy_data();
+      auto deleter = std::move(static_cast<DeleterT &>(*raw_));
+      deleter(raw_);
+    }
+    raw_ = new_raw;
+  }
+
+  template <class... ArgsT>
+  static SharedPtr<T, DeleterT> create(ArgsT &&... args) {
+    auto raw = make_unique<Raw>(DeleterT());
+    raw->init_data(std::forward<ArgsT>(args)...);
+    return SharedPtr<T, DeleterT>(raw.release());
+  }
+  template <class D, class... ArgsT>
+  static SharedPtr<T, DeleterT> create_with_deleter(D &&d, ArgsT &&... args) {
+    auto raw = make_unique<Raw>(std::forward<D>(d));
+    raw->init_data(std::forward<ArgsT>(args)...);
+    return SharedPtr<T, DeleterT>(raw.release());
+  }
+  bool operator==(const SharedPtr<T, DeleterT> &other) const {
+    return raw_ == other.raw_;
+  }
+
+ private:
+  Raw *raw_{nullptr};
+};
+
+}  // namespace detail
+
+template <class DataT>
+class SharedObjectPool {
+  class Deleter;
+
+ public:
+  using Ptr = detail::SharedPtr<DataT, Deleter>;
+
+  SharedObjectPool() = default;
+  SharedObjectPool(const SharedObjectPool &other) = delete;
+  SharedObjectPool &operator=(const SharedObjectPool &other) = delete;
+  SharedObjectPool(SharedObjectPool &&other) = delete;
+  SharedObjectPool &operator=(SharedObjectPool &&other) = delete;
+  ~SharedObjectPool() {
+    free_queue_.pop_all(free_queue_reader_);
+    size_t free_cnt = 0;
+    while (free_queue_reader_.read()) {
+      free_cnt++;
+    }
+    LOG_CHECK(free_cnt == allocated_.size()) << free_cnt << " " << allocated_.size();
+  }
+
+  template <class... ArgsT>
+  Ptr alloc(ArgsT &&... args) {
+    auto *raw = alloc_raw();
+    raw->init_data(std::forward<ArgsT>(args)...);
+    return Ptr(raw);
+  }
+  size_t total_size() const {
+    return allocated_.size();
+  }
+  uint64 calc_free_size() {
+    free_queue_.pop_all(free_queue_reader_);
+    return free_queue_reader_.calc_size();
+  }
+
+  //non thread safe
+  template <class F>
+  void for_each(F &&f) {
+    for (auto &raw : allocated_) {
+      if (raw->use_cnt() > 0) {
+        f(raw->data());
+      }
+    }
+  }
+
+ private:
+  using Raw = typename Ptr::Raw;
+  Raw *alloc_raw() {
+    free_queue_.pop_all(free_queue_reader_);
+    auto *raw = free_queue_reader_.read().get();
+    if (raw) {
+      return raw;
+    }
+    allocated_.push_back(make_unique<Raw>(deleter()));
+    return allocated_.back().get();
+  }
+
+  void free_raw(Raw *raw) {
+    free_queue_.push(Node{raw});
+  }
+
+  class Node {
+   public:
+    Node() = default;
+    explicit Node(Raw *raw) : raw_(raw) {
+    }
+
+    MpscLinkQueueImpl::Node *to_mpsc_link_queue_node() {
+      return raw_->to_mpsc_link_queue_node();
+    }
+    static Node from_mpsc_link_queue_node(MpscLinkQueueImpl::Node *node) {
+      return Node{Raw::from_mpsc_link_queue_node(node)};
+    }
+    Raw *get() const {
+      return raw_;
+    }
+    explicit operator bool() const {
+      return raw_ != nullptr;
+    }
+
+   private:
+    Raw *raw_{nullptr};
+  };
+
+  class Deleter {
+   public:
+    explicit Deleter(SharedObjectPool<DataT> *pool) : pool_(pool) {
+    }
+    void operator()(Raw *raw) {
+      pool_->free_raw(raw);
+    };
+
+   private:
+    SharedObjectPool<DataT> *pool_;
+  };
+  friend class Deleter;
+
+  Deleter deleter() {
+    return Deleter(this);
+  }
+
+  std::vector<unique_ptr<Raw>> allocated_;
+  MpscLinkQueue<Node> free_queue_;
+  typename MpscLinkQueue<Node>::Reader free_queue_reader_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/SharedSlice.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/SharedSlice.cpp
new file mode 100644
index 0000000000..30f034b617
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/SharedSlice.cpp
@@ -0,0 +1,29 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/SharedSlice.h"
+
+#include "td/utils/buffer.h"
+
+namespace td {
+
+BufferSlice SharedSlice::clone_as_buffer_slice() const {
+  return BufferSlice{as_slice().str()};
+}
+
+}  // namespace td
diff --git a/submodules/MtProtoKit/TON/iOS/include/td/utils/SharedSlice.h b/submodules/ton/tonlib-src/tdutils/td/utils/SharedSlice.h
similarity index 100%
rename from submodules/MtProtoKit/TON/iOS/include/td/utils/SharedSlice.h
rename to submodules/ton/tonlib-src/tdutils/td/utils/SharedSlice.h
diff --git a/submodules/MtProtoKit/TON/iOS/include/td/utils/Slice-decl.h b/submodules/ton/tonlib-src/tdutils/td/utils/Slice-decl.h
similarity index 100%
rename from submodules/MtProtoKit/TON/iOS/include/td/utils/Slice-decl.h
rename to submodules/ton/tonlib-src/tdutils/td/utils/Slice-decl.h
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Slice.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/Slice.cpp
new file mode 100644
index 0000000000..734b1246f9
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Slice.cpp
@@ -0,0 +1,43 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/Slice.h"
+#if TD_HAVE_OPENSSL
+#include <openssl/crypto.h>
+#endif
+
+namespace td {
+
+void MutableSlice::fill(char c) {
+  std::memset(data(), c, size());
+}
+void MutableSlice::fill_zero() {
+  fill(0);
+}
+void MutableSlice::fill_zero_secure() {
+#if TD_HAVE_OPENSSL
+  OPENSSL_cleanse(begin(), size());
+#else
+  volatile char *ptr = begin();
+  for (size_t i = 0; i < size(); i++) {
+    ptr[i] = 0;
+  }
+#endif
+}
+
+}  // namespace td
diff --git a/submodules/MtProtoKit/TON/iOS/include/td/utils/Slice.h b/submodules/ton/tonlib-src/tdutils/td/utils/Slice.h
similarity index 100%
rename from submodules/MtProtoKit/TON/iOS/include/td/utils/Slice.h
rename to submodules/ton/tonlib-src/tdutils/td/utils/Slice.h
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Span.h b/submodules/ton/tonlib-src/tdutils/td/utils/Span.h
new file mode 100644
index 0000000000..8c8ee110b5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Span.h
@@ -0,0 +1,138 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#include <array>
+
+namespace td {
+
+namespace detail {
+template <class T, class InnerT>
+class SpanImpl {
+  InnerT *data_{nullptr};
+  size_t size_{0};
+
+ public:
+  SpanImpl() = default;
+  SpanImpl(InnerT *data, size_t size) : data_(data), size_(size) {
+  }
+  SpanImpl(InnerT &data) : SpanImpl(&data, 1) {
+  }
+
+  template <class OtherInnerT>
+  SpanImpl(const SpanImpl<T, OtherInnerT> &other) : SpanImpl(other.data(), other.size()) {
+  }
+
+  template <size_t N>
+  SpanImpl(const std::array<T, N> &arr) : SpanImpl(arr.data(), arr.size()) {
+  }
+  template <size_t N>
+  SpanImpl(std::array<T, N> &arr) : SpanImpl(arr.data(), arr.size()) {
+  }
+  template <size_t N>
+  SpanImpl(const T (&arr)[N]) : SpanImpl(arr, N) {
+  }
+  template <size_t N>
+  SpanImpl(T (&arr)[N]) : SpanImpl(arr, N) {
+  }
+  SpanImpl(const vector<T> &v) : SpanImpl(v.data(), v.size()) {
+  }
+  SpanImpl(vector<T> &v) : SpanImpl(v.data(), v.size()) {
+  }
+
+  template <class OtherInnerT>
+  SpanImpl &operator=(const SpanImpl<T, OtherInnerT> &other) {
+    SpanImpl copy{other};
+    *this = copy;
+  }
+  template <class OtherInnerT>
+  bool operator==(const SpanImpl<T, OtherInnerT> &other) const {
+    if (size() != other.size()) {
+      return false;
+    }
+    for (size_t i = 0; i < size(); i++) {
+      if (!((*this)[i] == other[i])) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  InnerT &operator[](size_t i) {
+    DCHECK(i < size());
+    return data_[i];
+  }
+
+  const InnerT &operator[](size_t i) const {
+    DCHECK(i < size());
+    return data_[i];
+  }
+
+  InnerT *data() const {
+    return data_;
+  }
+  InnerT *begin() const {
+    return data_;
+  }
+  InnerT *end() const {
+    return data_ + size_;
+  }
+  size_t size() const {
+    return size_;
+  }
+  bool empty() const {
+    return size() == 0;
+  }
+
+  SpanImpl &truncate(size_t size) {
+    CHECK(size <= size_);
+    size_ = size;
+    return *this;
+  }
+
+  SpanImpl substr(size_t offset) const {
+    CHECK(offset <= size_);
+    return SpanImpl(begin() + offset, size_ - offset);
+  }
+  SpanImpl substr(size_t offset, size_t size) const {
+    CHECK(offset <= size_);
+    CHECK(size_ - offset >= size);
+    return SpanImpl(begin() + offset, size);
+  }
+};
+}  // namespace detail
+
+template <class T>
+using Span = detail::SpanImpl<T, const T>;
+
+template <class T>
+using MutableSpan = detail::SpanImpl<T, T>;
+
+template <class T>
+Span<T> span(const T *ptr, size_t size) {
+  return Span<T>(ptr, size);
+}
+template <class T>
+MutableSpan<T> mutable_span(T *ptr, size_t size) {
+  return MutableSpan<T>(ptr, size);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/SpinLock.h b/submodules/ton/tonlib-src/tdutils/td/utils/SpinLock.h
new file mode 100644
index 0000000000..cec2185d5a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/SpinLock.h
@@ -0,0 +1,72 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/thread.h"
+
+#include <atomic>
+#include <memory>
+
+namespace td {
+
+class SpinLock {
+  struct Unlock {
+    void operator()(SpinLock *ptr) {
+      ptr->unlock();
+    }
+  };
+
+  class InfBackoff {
+    int cnt = 0;
+
+   public:
+    bool next() {
+      cnt++;
+      if (cnt < 50) {
+        //TODO pause
+        return true;
+      } else {
+        td::this_thread::yield();
+        return true;
+      }
+    }
+  };
+
+ public:
+  using Lock = std::unique_ptr<SpinLock, Unlock>;
+
+  Lock lock() {
+    InfBackoff backoff;
+    while (!try_lock()) {
+      backoff.next();
+    }
+    return Lock(this);
+  }
+  bool try_lock() {
+    return !flag_.test_and_set(std::memory_order_acquire);
+  }
+
+ private:
+  std::atomic_flag flag_ = ATOMIC_FLAG_INIT;
+  void unlock() {
+    flag_.clear(std::memory_order_release);
+  }
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/StackAllocator.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/StackAllocator.cpp
new file mode 100644
index 0000000000..2d4e499dcd
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/StackAllocator.cpp
@@ -0,0 +1,31 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/StackAllocator.h"
+
+#include "td/utils/port/thread_local.h"
+
+namespace td {
+
+StackAllocator::Impl &StackAllocator::impl() {
+  static TD_THREAD_LOCAL StackAllocator::Impl *impl;  // static zero-initialized
+  init_thread_local<Impl>(impl);
+  return *impl;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/StackAllocator.h b/submodules/ton/tonlib-src/tdutils/td/utils/StackAllocator.h
new file mode 100644
index 0000000000..18e2a35cfa
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/StackAllocator.h
@@ -0,0 +1,95 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/MovableValue.h"
+#include "td/utils/Slice.h"
+
+#include <array>
+#include <cstdlib>
+#include <memory>
+
+namespace td {
+
+class StackAllocator {
+  class Deleter {
+   public:
+    void operator()(char *ptr) {
+      free_ptr(ptr);
+    }
+  };
+
+  // TODO: alloc memory with mmap and unload unused pages
+  // memory still can be corrupted, but it is better than explicit free function
+  // TODO: use pointer that can't be even copied
+  using PtrImpl = std::unique_ptr<char, Deleter>;
+  class Ptr {
+   public:
+    Ptr(char *ptr, size_t size) : ptr_(ptr), size_(size) {
+    }
+
+    MutableSlice as_slice() const {
+      return MutableSlice(ptr_.get(), size_.get());
+    }
+
+   private:
+    PtrImpl ptr_;
+    MovableValue<size_t> size_;
+  };
+
+  static void free_ptr(char *ptr) {
+    impl().free_ptr(ptr);
+  }
+
+  struct Impl {
+    static const size_t MEM_SIZE = 1024 * 1024;
+    std::array<char, MEM_SIZE> mem;
+
+    size_t pos{0};
+    char *alloc(size_t size) {
+      if (size == 0) {
+        size = 1;
+      }
+      char *res = mem.data() + pos;
+      size = (size + 7) & -8;
+      pos += size;
+      if (pos > MEM_SIZE) {
+        std::abort();  // memory is over
+      }
+      return res;
+    }
+    void free_ptr(char *ptr) {
+      size_t new_pos = ptr - mem.data();
+      if (new_pos >= pos) {
+        std::abort();  // shouldn't happen
+      }
+      pos = new_pos;
+    }
+  };
+
+  static Impl &impl();
+
+ public:
+  static Ptr alloc(size_t size) {
+    return Ptr(impl().alloc(size), size);
+  }
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Status.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/Status.cpp
new file mode 100644
index 0000000000..a6871d73fe
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Status.cpp
@@ -0,0 +1,66 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/Status.h"
+
+#if TD_PORT_WINDOWS
+#include "td/utils/port/wstring_convert.h"
+#endif
+
+#if TD_PORT_POSIX
+#include "td/utils/port/thread_local.h"
+
+#include <string.h>
+
+#include <cstring>
+#endif
+
+namespace td {
+
+#if TD_PORT_POSIX
+CSlice strerror_safe(int code) {
+  const size_t size = 1000;
+
+  static TD_THREAD_LOCAL char *buf;
+  init_thread_local<char[]>(buf, size);
+
+#if !defined(__GLIBC__) || ((_POSIX_C_SOURCE >= 200112L || _XOPEN_SOURCE >= 600) && !_GNU_SOURCE)
+  strerror_r(code, buf, size);
+  return CSlice(buf, buf + std::strlen(buf));
+#else
+  return CSlice(strerror_r(code, buf, size));
+#endif
+}
+#endif
+
+#if TD_PORT_WINDOWS
+string winerror_to_string(int code) {
+  const size_t size = 1000;
+  wchar_t wbuf[size];
+  auto res_size = FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM, nullptr, code, 0, wbuf, size - 1, nullptr);
+  if (res_size == 0) {
+    return "Unknown windows error";
+  }
+  while (res_size != 0 && (wbuf[res_size - 1] == '\n' || wbuf[res_size - 1] == '\r')) {
+    res_size--;
+  }
+  return from_wstring(wbuf, res_size).ok();
+}
+#endif
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Status.h b/submodules/ton/tonlib-src/tdutils/td/utils/Status.h
new file mode 100644
index 0000000000..f96ca82776
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Status.h
@@ -0,0 +1,557 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/ScopeGuard.h"
+#include "td/utils/Slice.h"
+#include "td/utils/StackAllocator.h"
+#include "td/utils/StringBuilder.h"
+
+#include <cerrno>
+#include <cstring>
+#include <memory>
+#include <new>
+#include <type_traits>
+#include <utility>
+
+#define TRY_STATUS(status)               \
+  {                                      \
+    auto try_status = (status);          \
+    if (try_status.is_error()) {         \
+      return try_status.move_as_error(); \
+    }                                    \
+  }
+
+#define TRY_STATUS_PREFIX(status, prefix)             \
+  {                                                   \
+    auto try_status = (status);                       \
+    if (try_status.is_error()) {                      \
+      return try_status.move_as_error_prefix(prefix); \
+    }                                                 \
+  }
+
+#define TRY_RESULT(name, result) TRY_RESULT_IMPL(TD_CONCAT(TD_CONCAT(r_, name), __LINE__), auto name, result)
+
+#define TRY_RESULT_ASSIGN(name, result) TRY_RESULT_IMPL(TD_CONCAT(TD_CONCAT(r_, name), __LINE__), name, result)
+
+#define TRY_RESULT_PREFIX(name, result, prefix) \
+  TRY_RESULT_PREFIX_IMPL(TD_CONCAT(TD_CONCAT(r_, name), __LINE__), auto name, result, prefix)
+
+#define TRY_RESULT_PREFIX_ASSIGN(name, result, prefix) \
+  TRY_RESULT_PREFIX_IMPL(TD_CONCAT(TD_CONCAT(r_, name), __LINE__), name, result, prefix)
+
+#define TRY_RESULT_PROMISE_PREFIX(promise_name, name, result, prefix) \
+  TRY_RESULT_PROMISE_PREFIX_IMPL(promise_name, TD_CONCAT(TD_CONCAT(r_, name), __LINE__), auto name, result, prefix)
+
+#define TRY_RESULT_PROMISE_PREFIX_ASSIGN(promise_name, name, result, prefix) \
+  TRY_RESULT_PROMISE_PREFIX_IMPL(promise_name, TD_CONCAT(TD_CONCAT(r_, name), __LINE__), name, result, prefix)
+
+#define TRY_RESULT_IMPL(r_name, name, result) \
+  auto r_name = (result);                     \
+  if (r_name.is_error()) {                    \
+    return r_name.move_as_error();            \
+  }                                           \
+  name = r_name.move_as_ok();
+
+#define TRY_RESULT_PREFIX_IMPL(r_name, name, result, prefix) \
+  auto r_name = (result);                                    \
+  if (r_name.is_error()) {                                   \
+    return r_name.move_as_error_prefix(prefix);              \
+  }                                                          \
+  name = r_name.move_as_ok();
+
+#define TRY_RESULT_PROMISE_PREFIX_IMPL(promise_name, r_name, name, result, prefix) \
+  auto r_name = (result);                                                          \
+  if (r_name.is_error()) {                                                         \
+    promise.set_error(r_name.move_as_error());                                     \
+    return;                                                                        \
+  }                                                                                \
+  name = r_name.move_as_ok();
+
+#define LOG_STATUS(status)                      \
+  {                                             \
+    auto log_status = (status);                 \
+    if (log_status.is_error()) {                \
+      LOG(ERROR) << log_status.move_as_error(); \
+    }                                           \
+  }
+
+#ifndef TD_STATUS_NO_ENSURE
+#define ensure() ensure_impl(__FILE__, __LINE__)
+#define ensure_error() ensure_error_impl(__FILE__, __LINE__)
+#endif
+
+#if TD_PORT_POSIX
+#define OS_ERROR(message)                                    \
+  [&]() {                                                    \
+    auto saved_errno = errno;                                \
+    return ::td::Status::PosixError(saved_errno, (message)); \
+  }()
+#define OS_SOCKET_ERROR(message) OS_ERROR(message)
+#elif TD_PORT_WINDOWS
+#define OS_ERROR(message)                                      \
+  [&]() {                                                      \
+    auto saved_error = ::GetLastError();                       \
+    return ::td::Status::WindowsError(saved_error, (message)); \
+  }()
+#define OS_SOCKET_ERROR(message)                               \
+  [&]() {                                                      \
+    auto saved_error = ::WSAGetLastError();                    \
+    return ::td::Status::WindowsError(saved_error, (message)); \
+  }()
+#endif
+
+namespace td {
+
+#if TD_PORT_POSIX
+CSlice strerror_safe(int code);
+#endif
+
+#if TD_PORT_WINDOWS
+string winerror_to_string(int code);
+#endif
+
+class Status {
+  enum class ErrorType : int8 { general, os };
+
+ public:
+  Status() = default;
+
+  bool operator==(const Status &other) const {
+    return ptr_ == other.ptr_;
+  }
+
+  Status clone() const TD_WARN_UNUSED_RESULT {
+    if (is_ok()) {
+      return Status();
+    }
+    auto info = get_info();
+    if (info.static_flag) {
+      return clone_static();
+    }
+    return Status(false, info.error_type, info.error_code, message());
+  }
+
+  static Status OK() TD_WARN_UNUSED_RESULT {
+    return Status();
+  }
+
+  static Status Error(int err, Slice message = Slice()) TD_WARN_UNUSED_RESULT {
+    return Status(false, ErrorType::general, err, message);
+  }
+
+  static Status Error(Slice message) TD_WARN_UNUSED_RESULT {
+    return Error(0, message);
+  }
+
+#if TD_PORT_WINDOWS
+  static Status WindowsError(int saved_error, Slice message) TD_WARN_UNUSED_RESULT {
+    return Status(false, ErrorType::os, saved_error, message);
+  }
+#endif
+
+#if TD_PORT_POSIX
+  static Status PosixError(int32 saved_errno, Slice message) TD_WARN_UNUSED_RESULT {
+    return Status(false, ErrorType::os, saved_errno, message);
+  }
+#endif
+
+  static Status Error() TD_WARN_UNUSED_RESULT {
+    return Error<0>();
+  }
+
+  template <int Code>
+  static Status Error() {
+    static Status status(true, ErrorType::general, Code, "");
+    return status.clone_static();
+  }
+
+  StringBuilder &print(StringBuilder &sb) const {
+    if (is_ok()) {
+      return sb << "OK";
+    }
+    Info info = get_info();
+    switch (info.error_type) {
+      case ErrorType::general:
+        sb << "[Error";
+        break;
+      case ErrorType::os:
+#if TD_PORT_POSIX
+        sb << "[PosixError : " << strerror_safe(info.error_code);
+#elif TD_PORT_WINDOWS
+        sb << "[WindowsError : " << winerror_to_string(info.error_code);
+#endif
+        break;
+      default:
+        UNREACHABLE();
+        break;
+    }
+    sb << " : " << code() << " : " << message() << "]";
+    return sb;
+  }
+
+  string to_string() const {
+    auto buf = StackAllocator::alloc(4096);
+    StringBuilder sb(buf.as_slice());
+    print(sb);
+    return sb.as_cslice().str();
+  }
+
+  // Default interface
+  bool is_ok() const TD_WARN_UNUSED_RESULT {
+    return !is_error();
+  }
+
+  bool is_error() const TD_WARN_UNUSED_RESULT {
+    return ptr_ != nullptr;
+  }
+
+#ifdef TD_STATUS_NO_ENSURE
+  void ensure() const {
+    if (!is_ok()) {
+      LOG(FATAL) << "Unexpected Status " << to_string();
+    }
+  }
+  void ensure_error() const {
+    if (is_ok()) {
+      LOG(FATAL) << "Unexpected Status::OK";
+    }
+  }
+#else
+  void ensure_impl(CSlice file_name, int line) const {
+    if (!is_ok()) {
+      LOG(FATAL) << "Unexpected Status " << to_string() << " in file " << file_name << " at line " << line;
+    }
+  }
+  void ensure_error_impl(CSlice file_name, int line) const {
+    if (is_ok()) {
+      LOG(FATAL) << "Unexpected Status::OK in file " << file_name << " at line " << line;
+    }
+  }
+#endif
+
+  void ignore() const {
+    // nop
+  }
+
+  int32 code() const {
+    if (is_ok()) {
+      return 0;
+    }
+    return get_info().error_code;
+  }
+
+  CSlice message() const {
+    if (is_ok()) {
+      return CSlice("OK");
+    }
+    return CSlice(ptr_.get() + sizeof(Info));
+  }
+
+  string public_message() const {
+    if (is_ok()) {
+      return "OK";
+    }
+    Info info = get_info();
+    switch (info.error_type) {
+      case ErrorType::general:
+        return message().str();
+      case ErrorType::os:
+#if TD_PORT_POSIX
+        return strerror_safe(info.error_code).str();
+#elif TD_PORT_WINDOWS
+        return winerror_to_string(info.error_code);
+#endif
+      default:
+        UNREACHABLE();
+        return "";
+    }
+  }
+
+  const Status &error() const {
+    return *this;
+  }
+
+  Status move() TD_WARN_UNUSED_RESULT {
+    return std::move(*this);
+  }
+
+  Status move_as_error() TD_WARN_UNUSED_RESULT {
+    return std::move(*this);
+  }
+
+  Status move_as_error_prefix(Slice prefix) TD_WARN_UNUSED_RESULT {
+    CHECK(is_error());
+    Info info = get_info();
+    switch (info.error_type) {
+      case ErrorType::general:
+        return Error(code(), PSLICE() << prefix << message());
+      case ErrorType::os:
+        return Status(false, ErrorType::os, code(), PSLICE() << prefix << message());
+      default:
+        UNREACHABLE();
+        return {};
+    }
+  }
+
+ private:
+  struct Info {
+    bool static_flag : 1;
+    signed int error_code : 23;
+    ErrorType error_type;
+  };
+
+  struct Deleter {
+    void operator()(char *ptr) {
+      if (!get_info(ptr).static_flag) {
+        delete[] ptr;
+      }
+    }
+  };
+  std::unique_ptr<char[], Deleter> ptr_;
+
+  Status(Info info, Slice message) {
+    size_t size = sizeof(Info) + message.size() + 1;
+    ptr_ = std::unique_ptr<char[], Deleter>(new char[size]);
+    char *ptr = ptr_.get();
+    reinterpret_cast<Info *>(ptr)[0] = info;
+    ptr += sizeof(Info);
+    std::memcpy(ptr, message.begin(), message.size());
+    ptr += message.size();
+    *ptr = 0;
+  }
+
+  Status(bool static_flag, ErrorType error_type, int error_code, Slice message)
+      : Status(to_info(static_flag, error_type, error_code), message) {
+    if (static_flag) {
+      TD_LSAN_IGNORE(ptr_.get());
+    }
+  }
+
+  Status clone_static() const TD_WARN_UNUSED_RESULT {
+    CHECK(is_ok() || get_info().static_flag);
+    Status result;
+    result.ptr_ = std::unique_ptr<char[], Deleter>(ptr_.get());
+    return result;
+  }
+
+  static Info to_info(bool static_flag, ErrorType error_type, int error_code) {
+    const int MIN_ERROR_CODE = -(1 << 22) + 1;
+    const int MAX_ERROR_CODE = (1 << 22) - 1;
+    Info tmp;
+    tmp.static_flag = static_flag;
+    tmp.error_type = error_type;
+
+    if (error_code < MIN_ERROR_CODE) {
+      LOG(ERROR) << "Error code value is altered from " << error_code;
+      error_code = MIN_ERROR_CODE;
+    }
+    if (error_code > MAX_ERROR_CODE) {
+      LOG(ERROR) << "Error code value is altered from " << error_code;
+      error_code = MAX_ERROR_CODE;
+    }
+
+#if TD_GCC
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wconversion"
+#endif
+    tmp.error_code = error_code;
+#if TD_GCC
+#pragma GCC diagnostic pop
+#endif
+    CHECK(error_code == tmp.error_code);
+    return tmp;
+  }
+
+  Info get_info() const {
+    return get_info(ptr_.get());
+  }
+  static Info get_info(char *ptr) {
+    return reinterpret_cast<Info *>(ptr)[0];
+  }
+};
+
+template <class T = Unit>
+class Result {
+ public:
+  Result() : status_(Status::Error<-1>()) {
+  }
+  template <class S, std::enable_if_t<!std::is_same<std::decay_t<S>, Result>::value, int> = 0>
+  Result(S &&x) : status_(), value_(std::forward<S>(x)) {
+  }
+  struct emplace_t {};
+  template <class... ArgsT>
+  Result(emplace_t, ArgsT &&... args) : status_(), value_(std::forward<ArgsT>(args)...) {
+  }
+  Result(Status &&status) : status_(std::move(status)) {
+    CHECK(status_.is_error());
+  }
+  Result(const Result &) = delete;
+  Result &operator=(const Result &) = delete;
+  Result(Result &&other) : status_(std::move(other.status_)) {
+    if (status_.is_ok()) {
+      new (&value_) T(std::move(other.value_));
+      other.value_.~T();
+    }
+    other.status_ = Status::Error<-2>();
+  }
+  Result &operator=(Result &&other) {
+    CHECK(this != &other);
+    if (status_.is_ok()) {
+      value_.~T();
+    }
+    if (other.status_.is_ok()) {
+#if TD_GCC
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
+#endif
+      new (&value_) T(std::move(other.value_));
+#if TD_GCC
+#pragma GCC diagnostic pop
+#endif
+      other.value_.~T();
+    }
+    status_ = std::move(other.status_);
+    other.status_ = Status::Error<-3>();
+    return *this;
+  }
+  template <class... ArgsT>
+  void emplace(ArgsT &&... args) {
+    if (status_.is_ok()) {
+      value_.~T();
+    }
+    new (&value_) T(std::forward<ArgsT>(args)...);
+    status_ = Status::OK();
+  }
+  ~Result() {
+    if (status_.is_ok()) {
+      value_.~T();
+    }
+  }
+
+#ifdef TD_STATUS_NO_ENSURE
+  void ensure() const {
+    status_.ensure();
+  }
+  void ensure_error() const {
+    status_.ensure_error();
+  }
+#else
+  void ensure_impl(CSlice file_name, int line) const {
+    status_.ensure_impl(file_name, line);
+  }
+  void ensure_error_impl(CSlice file_name, int line) const {
+    status_.ensure_error_impl(file_name, line);
+  }
+#endif
+  void ignore() const {
+    status_.ignore();
+  }
+  bool is_ok() const {
+    return status_.is_ok();
+  }
+  bool is_error() const {
+    return status_.is_error();
+  }
+  const Status &error() const {
+    CHECK(status_.is_error());
+    return status_;
+  }
+  Status move_as_error() TD_WARN_UNUSED_RESULT {
+    CHECK(status_.is_error());
+    SCOPE_EXIT {
+      status_ = Status::Error<-4>();
+    };
+    return std::move(status_);
+  }
+  Status move_as_error_prefix(Slice prefix) TD_WARN_UNUSED_RESULT {
+    SCOPE_EXIT {
+      status_ = Status::Error<-5>();
+    };
+    return status_.move_as_error_prefix(prefix);
+  }
+  const T &ok() const {
+    LOG_CHECK(status_.is_ok()) << status_;
+    return value_;
+  }
+  T &ok_ref() {
+    LOG_CHECK(status_.is_ok()) << status_;
+    return value_;
+  }
+  const T &ok_ref() const {
+    LOG_CHECK(status_.is_ok()) << status_;
+    return value_;
+  }
+  T move_as_ok() {
+    LOG_CHECK(status_.is_ok()) << status_;
+    return std::move(value_);
+  }
+
+  Result<T> clone() const TD_WARN_UNUSED_RESULT {
+    if (is_ok()) {
+      return Result<T>(ok());  // TODO: return clone(ok());
+    }
+    return error().clone();
+  }
+  void clear() {
+    *this = Result<T>();
+  }
+
+ private:
+  Status status_;
+  union {
+    T value_;
+  };
+};
+
+template <>
+inline Result<Unit>::Result(Status &&status) : status_(std::move(status)) {
+  // no assert
+}
+
+inline StringBuilder &operator<<(StringBuilder &string_builder, const Status &status) {
+  return status.print(string_builder);
+}
+
+namespace detail {
+
+class SlicifySafe {
+ public:
+  Result<CSlice> operator&(Logger &logger) {
+    if (logger.is_error()) {
+      return Status::Error("Buffer overflow");
+    }
+    return logger.as_cslice();
+  }
+};
+
+class StringifySafe {
+ public:
+  Result<string> operator&(Logger &logger) {
+    if (logger.is_error()) {
+      return Status::Error("Buffer overflow");
+    }
+    return logger.as_cslice().str();
+  }
+};
+
+}  // namespace detail
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Storer.h b/submodules/ton/tonlib-src/tdutils/td/utils/Storer.h
new file mode 100644
index 0000000000..31178f4359
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Storer.h
@@ -0,0 +1,100 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/StorerBase.h"
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+#include "td/utils/tl_storers.h"
+
+#include <cstring>
+#include <limits>
+
+namespace td {
+
+class SliceStorer : public Storer {
+  Slice slice;
+
+ public:
+  explicit SliceStorer(Slice slice) : slice(slice) {
+  }
+  size_t size() const override {
+    return slice.size();
+  }
+  size_t store(uint8 *ptr) const override {
+    std::memcpy(ptr, slice.ubegin(), slice.size());
+    return slice.size();
+  }
+};
+
+inline SliceStorer create_storer(Slice slice) {
+  return SliceStorer(slice);
+}
+
+class ConcatStorer : public Storer {
+  const Storer &a_;
+  const Storer &b_;
+
+ public:
+  ConcatStorer(const Storer &a, const Storer &b) : a_(a), b_(b) {
+  }
+
+  size_t size() const override {
+    return a_.size() + b_.size();
+  }
+
+  size_t store(uint8 *ptr) const override {
+    uint8 *ptr_save = ptr;
+    ptr += a_.store(ptr);
+    ptr += b_.store(ptr);
+    return ptr - ptr_save;
+  }
+};
+
+inline ConcatStorer create_storer(const Storer &a, const Storer &b) {
+  return ConcatStorer(a, b);
+}
+
+template <class T>
+class DefaultStorer : public Storer {
+ public:
+  explicit DefaultStorer(const T &object) : object_(object) {
+  }
+  size_t size() const override {
+    if (size_ == std::numeric_limits<size_t>::max()) {
+      size_ = tl_calc_length(object_);
+    }
+    return size_;
+  }
+  size_t store(uint8 *ptr) const override {
+    return tl_store_unsafe(object_, ptr);
+  }
+
+ private:
+  mutable size_t size_ = std::numeric_limits<size_t>::max();
+  const T &object_;
+};
+
+template <class T>
+DefaultStorer<T> create_default_storer(const T &from) {
+  return DefaultStorer<T>(from);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/StorerBase.h b/submodules/ton/tonlib-src/tdutils/td/utils/StorerBase.h
new file mode 100644
index 0000000000..f952f02454
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/StorerBase.h
@@ -0,0 +1,37 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/int_types.h"
+
+namespace td {
+
+class Storer {
+ public:
+  Storer() = default;
+  Storer(const Storer &) = delete;
+  Storer &operator=(const Storer &) = delete;
+  Storer(Storer &&) = default;
+  Storer &operator=(Storer &&) = default;
+  virtual ~Storer() = default;
+  virtual size_t size() const = 0;
+  virtual size_t store(uint8 *ptr) const TD_WARN_UNUSED_RESULT = 0;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/StringBuilder.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/StringBuilder.cpp
new file mode 100644
index 0000000000..3481bbe7ec
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/StringBuilder.cpp
@@ -0,0 +1,226 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/StringBuilder.h"
+
+#include "td/utils/misc.h"
+#include "td/utils/port/thread_local.h"
+#include "td/utils/Slice.h"
+
+#include <cstdio>
+#include <cstring>
+#include <limits>
+#include <locale>
+#include <memory>
+#include <sstream>
+#include <utility>
+
+namespace td {
+
+StringBuilder::StringBuilder(MutableSlice slice, bool use_buffer)
+    : begin_ptr_(slice.begin()), current_ptr_(begin_ptr_), use_buffer_(use_buffer) {
+  if (slice.size() <= reserved_size) {
+    auto buffer_size = reserved_size + 100;
+    buffer_ = std::make_unique<char[]>(buffer_size);
+    begin_ptr_ = buffer_.get();
+    current_ptr_ = begin_ptr_;
+    end_ptr_ = begin_ptr_ + buffer_size - reserved_size;
+  } else {
+    end_ptr_ = slice.end() - reserved_size;
+  }
+}
+
+StringBuilder &StringBuilder::operator<<(Slice slice) {
+  size_t size = slice.size();
+  if (unlikely(!reserve(size))) {
+    if (end_ptr_ < current_ptr_) {
+      return on_error();
+    }
+    auto available_size = static_cast<size_t>(end_ptr_ + reserved_size - 1 - current_ptr_);
+    if (size > available_size) {
+      error_flag_ = true;
+      size = available_size;
+    }
+  }
+
+  std::memcpy(current_ptr_, slice.begin(), size);
+  current_ptr_ += size;
+  return *this;
+}
+
+template <class T>
+static char *print_uint(char *current_ptr, T x) {
+  if (x < 100) {
+    if (x < 10) {
+      *current_ptr++ = static_cast<char>('0' + x);
+    } else {
+      *current_ptr++ = static_cast<char>('0' + x / 10);
+      *current_ptr++ = static_cast<char>('0' + x % 10);
+    }
+    return current_ptr;
+  }
+
+  auto begin_ptr = current_ptr;
+  do {
+    *current_ptr++ = static_cast<char>('0' + x % 10);
+    x /= 10;
+  } while (x > 0);
+
+  auto end_ptr = current_ptr - 1;
+  while (begin_ptr < end_ptr) {
+    std::swap(*begin_ptr++, *end_ptr--);
+  }
+
+  return current_ptr;
+}
+
+template <class T>
+static char *print_int(char *current_ptr, T x) {
+  if (x < 0) {
+    if (x == std::numeric_limits<T>::min()) {
+      std::stringstream ss;
+      ss << x;
+      auto len = narrow_cast<int>(static_cast<std::streamoff>(ss.tellp()));
+      ss.read(current_ptr, len);
+      return current_ptr + len;
+    }
+
+    *current_ptr++ = '-';
+    x = -x;
+  }
+
+  return print_uint(current_ptr, x);
+}
+
+bool StringBuilder::reserve_inner(size_t size) {
+  if (!use_buffer_) {
+    return false;
+  }
+
+  size_t old_data_size = current_ptr_ - begin_ptr_;
+  if (size >= std::numeric_limits<size_t>::max() - reserved_size - old_data_size - 1) {
+    return false;
+  }
+  size_t need_data_size = old_data_size + size;
+  size_t old_buffer_size = end_ptr_ - begin_ptr_;
+  if (old_buffer_size >= (std::numeric_limits<size_t>::max() - reserved_size) / 2 - 2) {
+    return false;
+  }
+  size_t new_buffer_size = (old_buffer_size + 1) * 2;
+  if (new_buffer_size < need_data_size) {
+    new_buffer_size = need_data_size;
+  }
+  if (new_buffer_size < 100) {
+    new_buffer_size = 100;
+  }
+  new_buffer_size += reserved_size;
+  auto new_buffer = std::make_unique<char[]>(new_buffer_size);
+  std::memcpy(new_buffer.get(), begin_ptr_, old_data_size);
+  buffer_ = std::move(new_buffer);
+  begin_ptr_ = buffer_.get();
+  current_ptr_ = begin_ptr_ + old_data_size;
+  end_ptr_ = begin_ptr_ + new_buffer_size - reserved_size;
+  CHECK(end_ptr_ > current_ptr_);
+  CHECK(static_cast<size_t>(end_ptr_ - current_ptr_) >= size);
+  return true;
+}
+
+StringBuilder &StringBuilder::operator<<(int x) {
+  if (unlikely(!reserve())) {
+    return on_error();
+  }
+  current_ptr_ = print_int(current_ptr_, x);
+  return *this;
+}
+
+StringBuilder &StringBuilder::operator<<(unsigned int x) {
+  if (unlikely(!reserve())) {
+    return on_error();
+  }
+  current_ptr_ = print_uint(current_ptr_, x);
+  return *this;
+}
+
+StringBuilder &StringBuilder::operator<<(long int x) {
+  if (unlikely(!reserve())) {
+    return on_error();
+  }
+  current_ptr_ = print_int(current_ptr_, x);
+  return *this;
+}
+
+StringBuilder &StringBuilder::operator<<(long unsigned int x) {
+  if (unlikely(!reserve())) {
+    return on_error();
+  }
+  current_ptr_ = print_uint(current_ptr_, x);
+  return *this;
+}
+
+StringBuilder &StringBuilder::operator<<(long long int x) {
+  if (unlikely(!reserve())) {
+    return on_error();
+  }
+  current_ptr_ = print_int(current_ptr_, x);
+  return *this;
+}
+
+StringBuilder &StringBuilder::operator<<(long long unsigned int x) {
+  if (unlikely(!reserve())) {
+    return on_error();
+  }
+  current_ptr_ = print_uint(current_ptr_, x);
+  return *this;
+}
+
+StringBuilder &StringBuilder::operator<<(FixedDouble x) {
+  if (unlikely(!reserve(std::numeric_limits<double>::max_exponent10 + x.precision + 4))) {
+    return on_error();
+  }
+
+  static TD_THREAD_LOCAL std::stringstream *ss;
+  if (init_thread_local<std::stringstream>(ss)) {
+    auto previous_locale = ss->imbue(std::locale::classic());
+    ss->setf(std::ios_base::fixed, std::ios_base::floatfield);
+  } else {
+    ss->str(std::string());
+    ss->clear();
+  }
+  ss->precision(x.precision);
+  *ss << x.d;
+
+  int len = narrow_cast<int>(static_cast<std::streamoff>(ss->tellp()));
+  auto left = end_ptr_ + reserved_size - current_ptr_;
+  if (unlikely(len >= left)) {
+    error_flag_ = true;
+    len = left ? narrow_cast<int>(left - 1) : 0;
+  }
+  ss->read(current_ptr_, len);
+  current_ptr_ += len;
+  return *this;
+}
+
+StringBuilder &StringBuilder::operator<<(const void *ptr) {
+  if (unlikely(!reserve())) {
+    return on_error();
+  }
+  current_ptr_ += std::snprintf(current_ptr_, reserved_size, "%p", ptr);
+  return *this;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/StringBuilder.h b/submodules/ton/tonlib-src/tdutils/td/utils/StringBuilder.h
new file mode 100644
index 0000000000..7415aa2a19
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/StringBuilder.h
@@ -0,0 +1,150 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+#include "td/utils/StackAllocator.h"
+
+#include <cstdlib>
+#include <memory>
+#include <type_traits>
+
+namespace td {
+
+class StringBuilder {
+ public:
+  explicit StringBuilder(MutableSlice slice, bool use_buffer = false);
+
+  void clear() {
+    current_ptr_ = begin_ptr_;
+    error_flag_ = false;
+  }
+
+  MutableCSlice as_cslice() {
+    if (current_ptr_ >= end_ptr_ + reserved_size) {
+      std::abort();  // shouldn't happen
+    }
+    *current_ptr_ = 0;
+    return MutableCSlice(begin_ptr_, current_ptr_);
+  }
+
+  bool is_error() const {
+    return error_flag_;
+  }
+
+  StringBuilder &operator<<(const char *str) {
+    return *this << Slice(str);
+  }
+
+  StringBuilder &operator<<(const wchar_t *str) = delete;
+
+  StringBuilder &operator<<(Slice slice);
+
+  StringBuilder &operator<<(bool b) {
+    return *this << (b ? Slice("true") : Slice("false"));
+  }
+
+  StringBuilder &operator<<(char c) {
+    if (unlikely(!reserve())) {
+      return on_error();
+    }
+    *current_ptr_++ = c;
+    return *this;
+  }
+
+  StringBuilder &operator<<(unsigned char c) {
+    return *this << static_cast<unsigned int>(c);
+  }
+
+  StringBuilder &operator<<(signed char c) {
+    return *this << static_cast<int>(c);
+  }
+
+  StringBuilder &operator<<(int x);
+
+  StringBuilder &operator<<(unsigned int x);
+
+  StringBuilder &operator<<(long int x);
+
+  StringBuilder &operator<<(long unsigned int x);
+
+  StringBuilder &operator<<(long long int x);
+
+  StringBuilder &operator<<(long long unsigned int x);
+
+  struct FixedDouble {
+    double d;
+    int precision;
+
+    FixedDouble(double d, int precision) : d(d), precision(precision) {
+    }
+  };
+  StringBuilder &operator<<(FixedDouble x);
+
+  StringBuilder &operator<<(double x) {
+    return *this << FixedDouble(x, 6);
+  }
+
+  StringBuilder &operator<<(const void *ptr);
+
+  template <class T>
+  StringBuilder &operator<<(const T *ptr) {
+    return *this << static_cast<const void *>(ptr);
+  }
+
+ private:
+  char *begin_ptr_;
+  char *current_ptr_;
+  char *end_ptr_;
+  bool error_flag_ = false;
+  bool use_buffer_ = false;
+  std::unique_ptr<char[]> buffer_;
+  static constexpr size_t reserved_size = 30;
+
+  StringBuilder &on_error() {
+    error_flag_ = true;
+    return *this;
+  }
+
+  bool reserve() {
+    if (end_ptr_ > current_ptr_) {
+      return true;
+    }
+    return reserve_inner(reserved_size);
+  }
+  bool reserve(size_t size) {
+    if (end_ptr_ > current_ptr_ && static_cast<size_t>(end_ptr_ - current_ptr_) >= size) {
+      return true;
+    }
+    return reserve_inner(size);
+  }
+  bool reserve_inner(size_t size);
+};
+
+template <class T>
+std::enable_if_t<std::is_arithmetic<T>::value, string> to_string(const T &x) {
+  const size_t buf_size = 1000;
+  auto buf = StackAllocator::alloc(buf_size);
+  StringBuilder sb(buf.as_slice());
+  sb << x;
+  return sb.as_cslice().str();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/ThreadLocalStorage.h b/submodules/ton/tonlib-src/tdutils/td/utils/ThreadLocalStorage.h
new file mode 100644
index 0000000000..c3509824f2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/ThreadLocalStorage.h
@@ -0,0 +1,66 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/thread.h"
+#include "td/utils/port/thread_local.h"
+#include "td/utils/int_types.h"
+
+#include <atomic>
+#include <array>
+
+namespace td {
+template <class T>
+class ThreadLocalStorage {
+ public:
+  T& get() {
+    return thread_local_node().value;
+  }
+
+  template <class F>
+  void for_each(F&& f) {
+    int n = max_thread_id_.load();
+    for (int i = 0; i < n; i++) {
+      f(nodes_[i].value);
+    }
+  }
+  template <class F>
+  void for_each(F&& f) const {
+    int n = max_thread_id_.load();
+    for (int i = 0; i < n; i++) {
+      f(nodes_[i].value);
+    }
+  }
+
+ private:
+  struct Node {
+    T value{};
+    char padding[128];
+  };
+  static constexpr int MAX_THREAD_ID = 128;
+  std::atomic<int> max_thread_id_{MAX_THREAD_ID};
+  std::array<Node, MAX_THREAD_ID> nodes_;
+
+  Node& thread_local_node() {
+    auto thread_id = get_thread_id();
+    CHECK(0 <= thread_id && static_cast<size_t>(thread_id) < nodes_.size());
+    return nodes_[thread_id];
+  }
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/ThreadSafeCounter.h b/submodules/ton/tonlib-src/tdutils/td/utils/ThreadSafeCounter.h
new file mode 100644
index 0000000000..52102b3d47
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/ThreadSafeCounter.h
@@ -0,0 +1,123 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/utils/ThreadLocalStorage.h"
+#include "td/utils/StringBuilder.h"
+
+#include <array>
+#include <mutex>
+
+namespace td {
+template <size_t N>
+class ThreadSafeMultiCounter {
+ public:
+  void add(size_t index, int64 diff) {
+    CHECK(index < N);
+    tls_.get()[index].fetch_add(diff, std::memory_order_relaxed);
+  }
+
+  int64 sum(size_t index) const {
+    CHECK(index < N);
+    int64 res = 0;
+    tls_.for_each([&](auto &value) { res += value[index].load(); });
+    return res;
+  }
+
+ private:
+  ThreadLocalStorage<std::array<std::atomic<int64>, N>> tls_;
+};
+
+class ThreadSafeCounter {
+ public:
+  void add(int64 diff) {
+    counter_.add(0, diff);
+  }
+
+  int64 sum() const {
+    return counter_.sum(0);
+  }
+
+ private:
+  ThreadSafeMultiCounter<1> counter_;
+};
+
+class NamedThreadSafeCounter {
+  static constexpr int N = 128;
+  using Counter = ThreadSafeMultiCounter<N>;
+
+ public:
+  class CounterRef {
+   public:
+    CounterRef() = default;
+    CounterRef(size_t index, Counter *counter) : index_(index), counter_(counter) {
+    }
+    void add(int64 diff) {
+      counter_->add(index_, diff);
+    }
+    int64 sum() const {
+      return counter_->sum(index_);
+    }
+
+   private:
+    size_t index_{0};
+    Counter *counter_{nullptr};
+  };
+
+  CounterRef get_counter(Slice name) {
+    std::unique_lock<std::mutex> guard(mutex_);
+    for (size_t i = 0; i < names_.size(); i++) {
+      if (names_[i] == name) {
+        return get_counter_ref(i);
+      }
+    }
+    CHECK(names_.size() < N);
+    names_.push_back(name.str());
+    return get_counter_ref(names_.size() - 1);
+  }
+
+  CounterRef get_counter_ref(size_t index) {
+    return CounterRef(index, &counter_);
+  }
+
+  static NamedThreadSafeCounter &get_default() {
+    static NamedThreadSafeCounter res;
+    return res;
+  }
+
+  template <class F>
+  void for_each(F &&f) const {
+    std::unique_lock<std::mutex> guard(mutex_);
+    for (size_t i = 0; i < names_.size(); i++) {
+      f(names_[i], counter_.sum(i));
+    }
+  }
+
+  friend StringBuilder &operator<<(StringBuilder &sb, const NamedThreadSafeCounter &counter) {
+    counter.for_each([&sb](Slice name, int64 cnt) { sb << name << ": " << cnt << "\n"; });
+    return sb;
+  }
+
+ private:
+  mutable std::mutex mutex_;
+  std::vector<std::string> names_;
+
+  Counter counter_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Time.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/Time.cpp
new file mode 100644
index 0000000000..21fa414499
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Time.cpp
@@ -0,0 +1,32 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/Time.h"
+
+#include <cmath>
+
+namespace td {
+
+bool operator==(Timestamp a, Timestamp b) {
+  return std::abs(a.at() - b.at()) < 1e-6;
+}
+double Time::now() {
+  return Clocks::monotonic();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Time.h b/submodules/ton/tonlib-src/tdutils/td/utils/Time.h
new file mode 100644
index 0000000000..b3d4773296
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Time.h
@@ -0,0 +1,124 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/port/Clocks.h"
+
+namespace td {
+
+class Time {
+ public:
+  static double now();
+  static double now_cached() {
+    // Temporary(?) use now in now_cached
+    // Problem:
+    //   thread A: check that now() > timestamp and notifies thread B
+    //   thread B: must see that now() > timestamp()
+    //
+    //   now() and now_cached() must be monotonic
+    //
+    //   if a=now[_cached]() happens before b=now[_cached] than
+    //     a <= b
+    //
+    // As an alternative we may say that now_cached is a thread local copy of now
+    return now();
+  }
+};
+
+inline void relax_timeout_at(double *timeout, double new_timeout) {
+  if (new_timeout == 0) {
+    return;
+  }
+  if (*timeout == 0 || new_timeout < *timeout) {
+    *timeout = new_timeout;
+  }
+}
+
+class Timestamp {
+ public:
+  Timestamp() = default;
+  static Timestamp never() {
+    return Timestamp{};
+  }
+  static Timestamp now() {
+    return Timestamp{Time::now()};
+  }
+  static Timestamp now_cached() {
+    return Timestamp{Time::now_cached()};
+  }
+  static Timestamp at(double timeout) {
+    return Timestamp{timeout};
+  }
+  static Timestamp at_unix(double timeout) {
+    return Timestamp{timeout - td::Clocks::system() + Time::now()};
+  }
+
+  static Timestamp in(double timeout) {
+    return Timestamp{Time::now_cached() + timeout};
+  }
+
+  bool is_in_past() const {
+    return at_ <= Time::now_cached();
+  }
+
+  explicit operator bool() const {
+    return at_ > 0;
+  }
+
+  double at() const {
+    return at_;
+  }
+  double at_unix() const {
+    return at_ + Clocks::system() - Time::now();
+  }
+
+  double in() const {
+    return at_ - Time::now_cached();
+  }
+
+  void relax(const Timestamp &timeout) {
+    if (!timeout) {
+      return;
+    }
+    if (!*this || at_ > timeout.at_) {
+      at_ = timeout.at_;
+    }
+  }
+
+  friend bool operator==(Timestamp a, Timestamp b);
+
+ private:
+  double at_{0};
+
+  explicit Timestamp(double timeout) : at_(timeout) {
+  }
+};
+
+template <class StorerT>
+void store(const Timestamp &timestamp, StorerT &storer) {
+  storer.store_binary(timestamp.at() - Time::now() + Clocks::system());
+}
+
+template <class ParserT>
+void parse(Timestamp &timestamp, ParserT &parser) {
+  timestamp = Timestamp::in(parser.fetch_double() - Clocks::system());
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/TimedStat.h b/submodules/ton/tonlib-src/tdutils/td/utils/TimedStat.h
new file mode 100644
index 0000000000..1d56bc0cb0
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/TimedStat.h
@@ -0,0 +1,83 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#include <utility>
+
+namespace td {
+
+template <class StatT>
+class TimedStat {
+ public:
+  TimedStat(double duration, double now)
+      : duration_(duration), current_(), current_timestamp_(now), next_(), next_timestamp_(now) {
+  }
+  TimedStat() : TimedStat(0, 0) {
+  }
+  template <class EventT>
+  void add_event(const EventT &e, double now) {
+    update(now);
+    current_.on_event(e);
+    next_.on_event(e);
+  }
+  const StatT &get_stat(double now) {
+    update(now);
+    return current_;
+  }
+  std::pair<StatT, double> stat_duration(double now) {
+    update(now);
+    return std::make_pair(current_, now - current_timestamp_);
+  }
+  void clear_events() {
+    current_.clear();
+    next_.clear();
+  }
+
+ private:
+  double duration_;
+  StatT current_;
+  double current_timestamp_;
+  StatT next_;
+  double next_timestamp_;
+
+  void update(double &now) {
+    if (now < next_timestamp_) {
+      // LOG_CHECK(now >= next_timestamp_ * (1 - 1e-14)) << now << " " << next_timestamp_;
+      now = next_timestamp_;
+    }
+    if (duration_ == 0) {
+      return;
+    }
+    if (next_timestamp_ + 2 * duration_ < now) {
+      current_ = StatT();
+      current_timestamp_ = now;
+      next_ = StatT();
+      next_timestamp_ = now;
+    } else if (next_timestamp_ + duration_ < now) {
+      current_ = next_;
+      current_timestamp_ = next_timestamp_;
+      next_ = StatT();
+      next_timestamp_ = now;
+    }
+  }
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Timer.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/Timer.cpp
new file mode 100644
index 0000000000..27e5d985ce
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Timer.cpp
@@ -0,0 +1,62 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/Timer.h"
+
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+//#include  "td/utils/Slice.h"  // TODO move StringBuilder implementation to cpp, remove header
+#include "td/utils/Time.h"
+
+namespace td {
+
+Timer::Timer() : start_time_(Time::now()) {
+}
+
+double Timer::elapsed() const {
+  return Time::now() - start_time_;
+}
+
+StringBuilder &operator<<(StringBuilder &string_builder, const Timer &timer) {
+  return string_builder << "in " << Time::now() - timer.start_time_;
+}
+
+PerfWarningTimer::PerfWarningTimer(string name, double max_duration)
+    : name_(std::move(name)), start_at_(Time::now()), max_duration_(max_duration) {
+}
+
+PerfWarningTimer::PerfWarningTimer(PerfWarningTimer &&other)
+    : name_(std::move(other.name_)), start_at_(other.start_at_), max_duration_(other.max_duration_) {
+  other.start_at_ = 0;
+}
+
+PerfWarningTimer::~PerfWarningTimer() {
+  reset();
+}
+
+void PerfWarningTimer::reset() {
+  if (start_at_ == 0) {
+    return;
+  }
+  double duration = Time::now() - start_at_;
+  LOG_IF(WARNING, duration > max_duration_)
+      << "SLOW: " << tag("name", name_) << tag("duration", format::as_time(duration));
+  start_at_ = 0;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Timer.h b/submodules/ton/tonlib-src/tdutils/td/utils/Timer.h
new file mode 100644
index 0000000000..1b84b7daba
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Timer.h
@@ -0,0 +1,53 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/StringBuilder.h"
+
+namespace td {
+
+class Timer {
+ public:
+  Timer();
+
+  double elapsed() const;
+
+ private:
+  friend StringBuilder &operator<<(StringBuilder &string_builder, const Timer &timer);
+
+  double start_time_;
+};
+
+class PerfWarningTimer {
+ public:
+  explicit PerfWarningTimer(string name, double max_duration = 0.1);
+  PerfWarningTimer(const PerfWarningTimer &) = delete;
+  PerfWarningTimer &operator=(const PerfWarningTimer &) = delete;
+  PerfWarningTimer(PerfWarningTimer &&other);
+  PerfWarningTimer &operator=(PerfWarningTimer &&) = delete;
+  ~PerfWarningTimer();
+  void reset();
+
+ private:
+  string name_;
+  double start_at_{0};
+  double max_duration_{0};
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/TsFileLog.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/TsFileLog.cpp
new file mode 100644
index 0000000000..e36b4fc50d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/TsFileLog.cpp
@@ -0,0 +1,100 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "TsFileLog.h"
+
+#include <limits>
+
+namespace td {
+namespace detail {
+class TsFileLog : public LogInterface {
+ public:
+  Status init(string path) {
+    path_ = std::move(path);
+    for (int i = 0; i < (int)logs_.size(); i++) {
+      logs_[i].id = i;
+    }
+    return init_info(&logs_[0]);
+  }
+
+  vector<string> get_file_paths() override {
+    vector<string> res;
+    for (auto &log : logs_) {
+      res.push_back(get_path(&log));
+    }
+    return res;
+  }
+
+  void append(CSlice cslice) override {
+    return append(cslice, -1);
+  }
+  void append(CSlice cslice, int log_level) override {
+    get_current_logger()->append(cslice, log_level);
+  }
+
+ private:
+  struct Info {
+    FileLog log;
+    std::atomic<bool> is_inited{false};
+    int id;
+  };
+  static constexpr int MAX_THREAD_ID = 128;
+  std::string path_;
+  std::array<Info, MAX_THREAD_ID> logs_;
+
+  LogInterface *get_current_logger() {
+    auto *info = get_current_info();
+    if (!info->is_inited.load(std::memory_order_relaxed)) {
+      CHECK(init_info(info).is_ok());
+    }
+    return &info->log;
+  }
+
+  Info *get_current_info() {
+    return &logs_[get_thread_id()];
+  }
+
+  Status init_info(Info *info) {
+    TRY_STATUS(info->log.init(get_path(info), std::numeric_limits<int64>::max(), info->id == 0));
+    info->is_inited = true;
+    return Status::OK();
+  }
+
+  string get_path(Info *info) {
+    if (info->id == 0) {
+      return path_;
+    }
+    return PSTRING() << path_ << ".thread" << info->id << ".log";
+  }
+
+  void rotate() override {
+    for (auto &info : logs_) {
+      if (info.is_inited.load(std::memory_order_consume)) {
+        info.log.rotate();
+      }
+    }
+  }
+};
+}  // namespace detail
+
+Result<td::unique_ptr<LogInterface>> TsFileLog::create(string path) {
+  auto res = td::make_unique<detail::TsFileLog>();
+  TRY_STATUS(res->init(path));
+  return std::move(res);
+}
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/TsFileLog.h b/submodules/ton/tonlib-src/tdutils/td/utils/TsFileLog.h
new file mode 100644
index 0000000000..a34572af51
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/TsFileLog.h
@@ -0,0 +1,28 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/FileLog.h"
+
+namespace td {
+class TsFileLog {
+ public:
+  static Result<td::unique_ptr<LogInterface>> create(string path);
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/UInt.h b/submodules/ton/tonlib-src/tdutils/td/utils/UInt.h
new file mode 100644
index 0000000000..f42a40e8db
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/UInt.h
@@ -0,0 +1,105 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+
+#include <cstring>
+
+namespace td {
+
+template <size_t size>
+struct UInt {
+  static_assert(size % 8 == 0, "size should be divisible by 8");
+  uint8 raw[size / 8];
+
+  Slice as_slice() const {
+    return Slice(raw, size / 8);
+  }
+
+  MutableSlice as_slice() {
+    return MutableSlice(raw, size / 8);
+  }
+
+  bool is_zero() const {
+    for (size_t i = 0; i < size / 8; i++) {
+      if (raw[i] != 0) {
+        return false;
+      }
+    }
+    return true;
+  }
+  void set_zero() {
+    for (size_t i = 0; i < size / 8; i++) {
+      raw[i] = 0;
+    }
+  }
+  static UInt zero() {
+    UInt v;
+    v.set_zero();
+    return v;
+  }
+};
+
+template <size_t size>
+bool operator==(const UInt<size> &a, const UInt<size> &b) {
+  return a.as_slice() == b.as_slice();
+}
+
+template <size_t size>
+bool operator!=(const UInt<size> &a, const UInt<size> &b) {
+  return !(a == b);
+}
+
+template <size_t size>
+td::UInt<size> operator^(const UInt<size> &a, const UInt<size> &b) {
+  td::UInt<size> res;
+  for (size_t i = 0; i < size / 8; i++) {
+    res.raw[i] = static_cast<uint8>(a.raw[i] ^ b.raw[i]);
+  }
+  return res;
+}
+
+template <size_t size>
+int get_kth_bit(const UInt<size> &a, uint32 bit) {
+  uint8 b = a.raw[bit / 8];
+  bit &= 7;
+  return (b >> (7 - bit)) & 1;
+}
+
+template <size_t size>
+Slice as_slice(const UInt<size> &value) {
+  return value.as_slice();
+}
+
+template <size_t size>
+MutableSlice as_slice(UInt<size> &value) {
+  return value.as_slice();
+}
+
+template <size_t size>
+bool operator<(const UInt<size> &a, const UInt<size> &b) {
+  return a.as_slice() < b.as_slice();
+}
+
+using UInt128 = UInt<128>;
+using UInt256 = UInt<256>;
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/Variant.h b/submodules/ton/tonlib-src/tdutils/td/utils/Variant.h
new file mode 100644
index 0000000000..30777a164a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/Variant.h
@@ -0,0 +1,303 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+
+#include <new>
+#include <type_traits>
+#include <utility>
+
+namespace td {
+namespace detail {
+
+template <size_t... Args>
+class MaxSizeImpl {};
+
+template <class T>
+constexpr const T &constexpr_max(const T &a, const T &b) {
+  return a < b ? b : a;
+}
+
+template <size_t Res, size_t X, size_t... Args>
+class MaxSizeImpl<Res, X, Args...> {
+ public:
+  static constexpr size_t value = MaxSizeImpl<constexpr_max(Res, X), Args...>::value;
+};
+
+template <size_t Res>
+class MaxSizeImpl<Res> {
+ public:
+  static constexpr size_t value = Res;
+};
+
+template <class... Args>
+class MaxSize {
+ public:
+  static constexpr size_t value = MaxSizeImpl<0, sizeof(Args)...>::value;
+};
+
+template <size_t to_skip, class... Args>
+class IthTypeImpl {};
+template <class Res, class... Args>
+class IthTypeImpl<0, Res, Args...> {
+ public:
+  using type = Res;
+};
+template <size_t pos, class Skip, class... Args>
+class IthTypeImpl<pos, Skip, Args...> : public IthTypeImpl<pos - 1, Args...> {};
+
+class Dummy {};
+
+template <size_t pos, class... Args>
+class IthType : public IthTypeImpl<pos, Args..., Dummy> {};
+
+template <bool ok, int offset, class... Types>
+class FindTypeOffsetImpl {};
+
+template <int offset, class... Types>
+class FindTypeOffsetImpl<true, offset, Types...> {
+ public:
+  static constexpr int value = offset;
+};
+template <int offset, class T, class S, class... Types>
+class FindTypeOffsetImpl<false, offset, T, S, Types...>
+    : public FindTypeOffsetImpl<std::is_same<T, S>::value, offset + 1, T, Types...> {};
+template <class T, class... Types>
+class FindTypeOffset : public FindTypeOffsetImpl<false, -1, T, Types...> {};
+
+template <int offset, class... Types>
+class ForEachTypeImpl {};
+
+template <int offset>
+class ForEachTypeImpl<offset, Dummy> {
+ public:
+  template <class F>
+  static void visit(F &&f) {
+  }
+};
+
+template <int offset, class T, class... Types>
+class ForEachTypeImpl<offset, T, Types...> {
+ public:
+  template <class F>
+  static void visit(F &&f) {
+    f(offset, static_cast<T *>(nullptr));
+    ForEachTypeImpl<offset + 1, Types...>::visit(f);
+  }
+};
+
+template <class... Types>
+class ForEachType {
+ public:
+  template <class F>
+  static void visit(F &&f) {
+    ForEachTypeImpl<0, Types..., Dummy>::visit(f);
+  }
+};
+
+}  // namespace detail
+
+template <class... Types>
+class Variant {
+ public:
+  static constexpr int npos = -1;
+  Variant() {
+  }
+  Variant(Variant &&other) noexcept {
+    other.visit([&](auto &&value) { this->init_empty(std::forward<decltype(value)>(value)); });
+  }
+  Variant(const Variant &other) {
+    other.visit([&](auto &&value) { this->init_empty(std::forward<decltype(value)>(value)); });
+  }
+  Variant &operator=(Variant &&other) {
+    clear();
+    other.visit([&](auto &&value) { this->init_empty(std::forward<decltype(value)>(value)); });
+    return *this;
+  }
+  Variant &operator=(const Variant &other) {
+    clear();
+    other.visit([&](auto &&value) { this->init_empty(std::forward<decltype(value)>(value)); });
+    return *this;
+  }
+
+  bool operator==(const Variant &other) const {
+    if (offset_ != other.offset_) {
+      return false;
+    }
+    bool res = false;
+    for_each([&](int offset, auto *ptr) {
+      using T = std::decay_t<decltype(*ptr)>;
+      if (offset == offset_) {
+        res = this->get<T>() == other.template get<T>();
+      }
+    });
+    return res;
+  }
+  bool operator<(const Variant &other) const {
+    if (offset_ != other.offset_) {
+      return offset_ < other.offset_;
+    }
+    bool res = false;
+    for_each([&](int offset, auto *ptr) {
+      using T = std::decay_t<decltype(*ptr)>;
+      if (offset == offset_) {
+        res = this->get<T>() < other.template get<T>();
+      }
+    });
+    return res;
+  }
+
+  template <class T, std::enable_if_t<!std::is_same<std::decay_t<T>, Variant>::value, int> = 0>
+  Variant(T &&t) {
+    init_empty(std::forward<T>(t));
+  }
+  template <class T, std::enable_if_t<!std::is_same<std::decay_t<T>, Variant>::value, int> = 0>
+  Variant &operator=(T &&t) {
+    clear();
+    init_empty(std::forward<T>(t));
+    return *this;
+  }
+  template <class T>
+  static constexpr int offset() {
+    return detail::FindTypeOffset<std::decay_t<T>, Types...>::value;
+  }
+
+  template <class T>
+  void init_empty(T &&t) {
+    LOG_CHECK(offset_ == npos) << offset_
+#if TD_CLANG || TD_GCC
+                               << ' ' << __PRETTY_FUNCTION__
+#endif
+        ;
+    offset_ = offset<T>();
+    new (&get<T>()) std::decay_t<T>(std::forward<T>(t));
+  }
+  ~Variant() {
+    clear();
+  }
+
+  template <class F>
+  void visit(F &&f) {
+    for_each([&](int offset, auto *ptr) {
+      using T = std::decay_t<decltype(*ptr)>;
+      if (offset == offset_) {
+        f(std::move(*this->get_unsafe<T>()));
+      }
+    });
+  }
+  template <class F>
+  void for_each(F &&f) {
+    detail::ForEachType<Types...>::visit(f);
+  }
+  template <class F>
+  void visit(F &&f) const {
+    for_each([&](int offset, auto *ptr) {
+      using T = std::decay_t<decltype(*ptr)>;
+      if (offset == offset_) {
+        f(std::move(*this->get_unsafe<T>()));
+      }
+    });
+  }
+  template <class F>
+  void for_each(F &&f) const {
+    detail::ForEachType<Types...>::visit(f);
+  }
+
+  void clear() {
+    visit([](auto &&value) {
+      using T = std::decay_t<decltype(value)>;
+      value.~T();
+    });
+    offset_ = npos;
+  }
+
+  template <int offset>
+  auto &get() {
+    CHECK(offset == offset_);
+    return *get_unsafe<offset>();
+  }
+  template <class T>
+  auto &get() {
+    return get<offset<T>()>();
+  }
+
+  template <int offset>
+  const auto &get() const {
+    CHECK(offset == offset_);
+    return *get_unsafe<offset>();
+  }
+  template <class T>
+  const auto &get() const {
+    return get<offset<T>()>();
+  }
+
+  int32 get_offset() const {
+    return offset_;
+  }
+
+ private:
+  union {
+    int64 align_;
+    char data_[detail::MaxSize<Types...>::value];
+  };
+  int offset_{npos};
+
+  template <class T>
+  auto *get_unsafe() {
+    return reinterpret_cast<T *>(data_);
+  }
+
+  template <int offset>
+  auto *get_unsafe() {
+    using T = typename detail::IthType<offset, Types...>::type;
+    return get_unsafe<T>();
+  }
+
+  template <class T>
+  const auto *get_unsafe() const {
+    return reinterpret_cast<const T *>(data_);
+  }
+
+  template <int offset>
+  const auto *get_unsafe() const {
+    using T = typename detail::IthType<offset, Types...>::type;
+    return get_unsafe<T>();
+  }
+};
+
+template <class T, class... Types>
+auto &get(Variant<Types...> &v) {
+  return v.template get<T>();
+}
+template <class T, class... Types>
+auto &get(const Variant<Types...> &v) {
+  return v.template get<T>();
+}
+template <int T, class... Types>
+auto &get(Variant<Types...> &v) {
+  return v.template get<T>();
+}
+template <int T, class... Types>
+auto &get(const Variant<Types...> &v) {
+  return v.template get<T>();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/VectorQueue.h b/submodules/ton/tonlib-src/tdutils/td/utils/VectorQueue.h
new file mode 100644
index 0000000000..e3850c4fbb
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/VectorQueue.h
@@ -0,0 +1,84 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/Span.h"
+
+#include <utility>
+#include <vector>
+
+namespace td {
+
+template <class T>
+class VectorQueue {
+ public:
+  template <class S>
+  void push(S &&s) {
+    vector_.push_back(std::forward<S>(s));
+  }
+  template <class... Args>
+  void emplace(Args &&... args) {
+    vector_.emplace_back(std::forward<Args>(args)...);
+  }
+  T pop() {
+    try_shrink();
+    return std::move(vector_[read_pos_++]);
+  }
+  void pop_n(size_t n) {
+    read_pos_ += n;
+    try_shrink();
+  }
+  T &front() {
+    return vector_[read_pos_];
+  }
+  T &back() {
+    return vector_.back();
+  }
+  bool empty() const {
+    return size() == 0;
+  }
+  size_t size() const {
+    return vector_.size() - read_pos_;
+  }
+  T *data() {
+    return vector_.data() + read_pos_;
+  }
+  const T *data() const {
+    return vector_.data() + read_pos_;
+  }
+  Span<T> as_span() const {
+    return {data(), size()};
+  }
+  MutableSpan<T> as_mutable_span() {
+    return {data(), size()};
+  }
+
+ private:
+  std::vector<T> vector_;
+  size_t read_pos_{0};
+
+  void try_shrink() {
+    if (read_pos_ * 2 > vector_.size() && read_pos_ > 4) {
+      vector_.erase(vector_.begin(), vector_.begin() + read_pos_);
+      read_pos_ = 0;
+    }
+  }
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/as.h b/submodules/ton/tonlib-src/tdutils/td/utils/as.h
new file mode 100644
index 0000000000..0c2b86b1f6
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/as.h
@@ -0,0 +1,98 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <cstring>
+#include <type_traits>
+
+namespace td {
+
+namespace detail {
+
+template <class T>
+class As {
+ public:
+  explicit As(void *ptr) : ptr_(ptr) {
+  }
+
+  As(const As &new_value) = delete;
+  As &operator=(const As &) = delete;
+  As(As &&) = default;
+  As &operator=(As &&new_value) && {
+    std::memcpy(ptr_, new_value.ptr_, sizeof(T));
+    return *this;
+  }
+  ~As() = default;
+
+  As &operator=(T new_value) && {
+    std::memcpy(ptr_, &new_value, sizeof(T));
+    return *this;
+  }
+
+  operator T() const {
+    T res;
+    std::memcpy(&res, ptr_, sizeof(T));
+    return res;
+  }
+  bool operator==(const As &other) const {
+    return this->operator T() == other.operator T();
+  }
+
+ private:
+  void *ptr_;
+};
+
+template <class T>
+class ConstAs {
+ public:
+  explicit ConstAs(const void *ptr) : ptr_(ptr) {
+  }
+
+  operator T() const {
+    T res;
+    std::memcpy(&res, ptr_, sizeof(T));
+    return res;
+  }
+
+ private:
+  const void *ptr_;
+};
+
+}  // namespace detail
+
+// no std::is_trivially_copyable in libstdc++ before 5.0
+#if __GLIBCXX__
+#define TD_IS_TRIVIALLY_COPYABLE(T) __has_trivial_copy(T)
+#else
+#define TD_IS_TRIVIALLY_COPYABLE(T) std::is_trivially_copyable<T>::value
+#endif
+
+template <class ToT, class FromT,
+          std::enable_if_t<TD_IS_TRIVIALLY_COPYABLE(ToT) && TD_IS_TRIVIALLY_COPYABLE(FromT), int> = 0>
+detail::As<ToT> as(FromT *from) {
+  return detail::As<ToT>(from);
+}
+
+template <class ToT, class FromT,
+          std::enable_if_t<TD_IS_TRIVIALLY_COPYABLE(ToT) && TD_IS_TRIVIALLY_COPYABLE(FromT), int> = 0>
+const detail::ConstAs<ToT> as(const FromT *from) {
+  return detail::ConstAs<ToT>(from);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/base64.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/base64.cpp
new file mode 100644
index 0000000000..67874d2141
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/base64.cpp
@@ -0,0 +1,302 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/base64.h"
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+#include "td/utils/format.h"
+
+#include <algorithm>
+#include <iterator>
+
+namespace td {
+//TODO: fix copypaste
+
+static const char *const symbols64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+string base64_encode(Slice input) {
+  string base64;
+  base64.reserve((input.size() + 2) / 3 * 4);
+  for (size_t i = 0; i < input.size();) {
+    size_t left = min(input.size() - i, static_cast<size_t>(3));
+    int c = input.ubegin()[i++] << 16;
+    base64 += symbols64[c >> 18];
+    if (left != 1) {
+      c |= input.ubegin()[i++] << 8;
+    }
+    base64 += symbols64[(c >> 12) & 63];
+    if (left == 3) {
+      c |= input.ubegin()[i++];
+    }
+    if (left != 1) {
+      base64 += symbols64[(c >> 6) & 63];
+    } else {
+      base64 += '=';
+    }
+    if (left == 3) {
+      base64 += symbols64[c & 63];
+    } else {
+      base64 += '=';
+    }
+  }
+  return base64;
+}
+
+static unsigned char char_to_value[256];
+static void init_base64_table() {
+  static bool is_inited = [] {
+    std::fill(std::begin(char_to_value), std::end(char_to_value), static_cast<unsigned char>(64));
+    for (unsigned char i = 0; i < 64; i++) {
+      char_to_value[static_cast<size_t>(symbols64[i])] = i;
+    }
+    return true;
+  }();
+  CHECK(is_inited);
+}
+
+Result<Slice> base64_drop_padding(Slice base64) {
+  if ((base64.size() & 3) != 0) {
+    return Status::Error("Wrong string length");
+  }
+
+  size_t padding_length = 0;
+  while (!base64.empty() && base64.back() == '=') {
+    base64.remove_suffix(1);
+    padding_length++;
+  }
+  if (padding_length >= 3) {
+    return Status::Error("Wrong string padding");
+  }
+  return base64;
+}
+
+template <class F>
+Status base64_do_decode(Slice base64, F &&append) {
+  for (size_t i = 0; i < base64.size();) {
+    size_t left = min(base64.size() - i, static_cast<size_t>(4));
+    int c = 0;
+    for (size_t t = 0; t < left; t++) {
+      auto value = char_to_value[base64.ubegin()[i++]];
+      if (value == 64) {
+        return Status::Error("Wrong character in the string");
+      }
+      c |= value << ((3 - t) * 6);
+    }
+    append(static_cast<char>(static_cast<unsigned char>(c >> 16)));  // implementation-defined
+    if (left == 2) {
+      if ((c & ((1 << 16) - 1)) != 0) {
+        return Status::Error("Wrong padding in the string");
+      }
+    } else {
+      append(static_cast<char>(static_cast<unsigned char>(c >> 8)));  // implementation-defined
+      if (left == 3) {
+        if ((c & ((1 << 8) - 1)) != 0) {
+          return Status::Error("Wrong padding in the string");
+        }
+      } else {
+        append(static_cast<char>(static_cast<unsigned char>(c)));  // implementation-defined
+      }
+    }
+  }
+  return Status::OK();
+}
+
+Result<string> base64_decode(Slice base64) {
+  init_base64_table();
+
+  TRY_RESULT(tmp, base64_drop_padding(base64));
+  base64 = tmp;
+
+  string output;
+  output.reserve(((base64.size() + 3) >> 2) * 3);
+  TRY_STATUS(base64_do_decode(base64, [&output](char c) { output += c; }));
+  return output;
+}
+
+Result<SecureString> base64_decode_secure(Slice base64) {
+  init_base64_table();
+
+  TRY_RESULT(tmp, base64_drop_padding(base64));
+  base64 = tmp;
+
+  SecureString output(((base64.size() + 3) >> 2) * 3);
+  char *ptr = output.as_mutable_slice().begin();
+  TRY_STATUS(base64_do_decode(base64, [&ptr](char c) { *ptr++ = c; }));
+  size_t size = ptr - output.as_mutable_slice().begin();
+  if (size == output.size()) {
+    return std::move(output);
+  }
+  return SecureString(output.as_slice().substr(0, size));
+}
+
+static const char *const url_symbols64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_";
+
+string base64url_encode(Slice input) {
+  string base64;
+  base64.reserve((input.size() + 2) / 3 * 4);
+  for (size_t i = 0; i < input.size();) {
+    size_t left = min(input.size() - i, static_cast<size_t>(3));
+    int c = input.ubegin()[i++] << 16;
+    base64 += url_symbols64[c >> 18];
+    if (left != 1) {
+      c |= input.ubegin()[i++] << 8;
+    }
+    base64 += url_symbols64[(c >> 12) & 63];
+    if (left == 3) {
+      c |= input.ubegin()[i++];
+    }
+    if (left != 1) {
+      base64 += url_symbols64[(c >> 6) & 63];
+    }
+    if (left == 3) {
+      base64 += url_symbols64[c & 63];
+    }
+  }
+  return base64;
+}
+
+static unsigned char url_char_to_value[256];
+static void init_base64url_table() {
+  static bool is_inited = [] {
+    std::fill(std::begin(url_char_to_value), std::end(url_char_to_value), static_cast<unsigned char>(64));
+    for (unsigned char i = 0; i < 64; i++) {
+      url_char_to_value[static_cast<size_t>(url_symbols64[i])] = i;
+    }
+    return true;
+  }();
+  CHECK(is_inited);
+}
+
+Result<string> base64url_decode(Slice base64) {
+  init_base64url_table();
+
+  size_t padding_length = 0;
+  while (!base64.empty() && base64.back() == '=') {
+    base64.remove_suffix(1);
+    padding_length++;
+  }
+  if (padding_length >= 3 || (padding_length > 0 && ((base64.size() + padding_length) & 3) != 0)) {
+    return Status::Error("Wrong string padding");
+  }
+
+  if ((base64.size() & 3) == 1) {
+    return Status::Error("Wrong string length");
+  }
+
+  string output;
+  output.reserve(((base64.size() + 3) >> 2) * 3);
+  for (size_t i = 0; i < base64.size();) {
+    size_t left = min(base64.size() - i, static_cast<size_t>(4));
+    int c = 0;
+    for (size_t t = 0; t < left; t++) {
+      auto value = url_char_to_value[base64.ubegin()[i++]];
+      if (value == 64) {
+        return Status::Error("Wrong character in the string");
+      }
+      c |= value << ((3 - t) * 6);
+    }
+    output += static_cast<char>(static_cast<unsigned char>(c >> 16));  // implementation-defined
+    if (left == 2) {
+      if ((c & ((1 << 16) - 1)) != 0) {
+        return Status::Error("Wrong padding in the string");
+      }
+    } else {
+      output += static_cast<char>(static_cast<unsigned char>(c >> 8));  // implementation-defined
+      if (left == 3) {
+        if ((c & ((1 << 8) - 1)) != 0) {
+          return Status::Error("Wrong padding in the string");
+        }
+      } else {
+        output += static_cast<char>(static_cast<unsigned char>(c));  // implementation-defined
+      }
+    }
+  }
+  return output;
+}
+
+template <bool is_url>
+static bool is_base64_impl(Slice input) {
+  size_t padding_length = 0;
+  while (!input.empty() && input.back() == '=') {
+    input.remove_suffix(1);
+    padding_length++;
+  }
+  if (padding_length >= 3) {
+    return false;
+  }
+  if ((!is_url || padding_length > 0) && ((input.size() + padding_length) & 3) != 0) {
+    return false;
+  }
+  if (is_url && (input.size() & 3) == 1) {
+    return false;
+  }
+
+  unsigned char *table;
+  if (is_url) {
+    init_base64url_table();
+    table = url_char_to_value;
+  } else {
+    init_base64_table();
+    table = char_to_value;
+  }
+  for (auto c : input) {
+    if (table[static_cast<unsigned char>(c)] == 64) {
+      return false;
+    }
+  }
+
+  if ((input.size() & 3) == 2) {
+    auto value = table[static_cast<int>(input.back())];
+    if ((value & 15) != 0) {
+      return false;
+    }
+  }
+  if ((input.size() & 3) == 3) {
+    auto value = table[static_cast<int>(input.back())];
+    if ((value & 3) != 0) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+bool is_base64(Slice input) {
+  return is_base64_impl<false>(input);
+}
+
+bool is_base64url(Slice input) {
+  return is_base64_impl<true>(input);
+}
+
+string base64_filter(Slice input) {
+  string res;
+  res.reserve(input.size());
+  init_base64_table();
+  for (auto c : input) {
+    if (char_to_value[static_cast<unsigned char>(c)] != 64 || c == '=') {
+      res += c;
+    }
+  }
+  return res;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/base64.h b/submodules/ton/tonlib-src/tdutils/td/utils/base64.h
new file mode 100644
index 0000000000..f17cf3eb7c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/base64.h
@@ -0,0 +1,40 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+#include "td/utils/SharedSlice.h"
+#include "td/utils/Status.h"
+
+namespace td {
+
+string base64_encode(Slice input);
+Result<string> base64_decode(Slice base64);
+Result<SecureString> base64_decode_secure(Slice base64);
+
+string base64url_encode(Slice input);
+Result<string> base64url_decode(Slice base64);
+
+bool is_base64(Slice input);
+bool is_base64url(Slice input);
+
+string base64_filter(Slice input);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/benchmark.h b/submodules/ton/tonlib-src/tdutils/td/utils/benchmark.h
new file mode 100644
index 0000000000..8bb198ddf0
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/benchmark.h
@@ -0,0 +1,144 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/Clocks.h"
+#include "td/utils/StringBuilder.h"
+
+#include <cmath>
+#include <tuple>
+#include <utility>
+
+#define BENCH(name, desc)                          \
+  class name##Bench : public ::td::Benchmark {     \
+   public:                                         \
+    std::string get_description() const override { \
+      return (desc);                               \
+    }                                              \
+    void run(int n) override;                      \
+  };                                               \
+  void name##Bench::run(int n)
+
+namespace td {
+
+#if TD_MSVC
+
+#pragma optimize("", off)
+template <class T>
+void do_not_optimize_away(T &&datum) {
+  datum = datum;
+}
+#pragma optimize("", on)
+
+#else
+
+template <class T>
+void do_not_optimize_away(T &&datum) {
+  asm volatile("" : "+r"(datum));
+}
+
+#endif
+
+class Benchmark {
+ public:
+  Benchmark() = default;
+  Benchmark(const Benchmark &) = delete;
+  Benchmark &operator=(const Benchmark &) = delete;
+  Benchmark(Benchmark &&) = delete;
+  Benchmark &operator=(Benchmark &&) = delete;
+  virtual ~Benchmark() = default;
+
+  virtual std::string get_description() const = 0;
+
+  virtual void start_up() {
+  }
+  virtual void start_up_n(int n) {
+    start_up();
+  }
+
+  virtual void tear_down() {
+  }
+
+  virtual void run(int n) = 0;
+};
+
+inline std::pair<double, double> bench_n(Benchmark &b, int n) {
+  double total = -Clocks::monotonic();
+  b.start_up_n(n);
+  double t = -Clocks::monotonic();
+  b.run(n);
+  t += Clocks::monotonic();
+  b.tear_down();
+  total += Clocks::monotonic();
+
+  return std::make_pair(t, total);
+}
+
+inline std::pair<double, double> bench_n(Benchmark &&b, int n) {
+  return bench_n(b, n);
+}
+
+inline void bench(Benchmark &b, double max_time = 1.0) {
+  int n = 1;
+  double pass_time = 0;
+  double total_pass_time = 0;
+  while (pass_time < max_time && total_pass_time < max_time * 3 && n < (1 << 30)) {
+    n *= 2;
+    std::tie(pass_time, total_pass_time) = bench_n(b, n);
+  }
+  pass_time = n / pass_time;
+
+  int pass_cnt = 2;
+  double sum = pass_time;
+  double square_sum = pass_time * pass_time;
+  double min_pass_time = pass_time;
+  double max_pass_time = pass_time;
+
+  for (int i = 1; i < pass_cnt; i++) {
+    pass_time = n / bench_n(b, n).first;
+    sum += pass_time;
+    square_sum += pass_time * pass_time;
+    if (pass_time < min_pass_time) {
+      min_pass_time = pass_time;
+    }
+    if (pass_time > max_pass_time) {
+      max_pass_time = pass_time;
+    }
+  }
+  double average = sum / pass_cnt;
+  double d = sqrt(square_sum / pass_cnt - average * average);
+
+  auto description = b.get_description();
+  std::string pad;
+  if (description.size() < 40) {
+    pad = std::string(40 - description.size(), ' ');
+  }
+
+  LOG(ERROR) << "Bench [" << pad << description << "]: " << StringBuilder::FixedDouble(average, 3) << '['
+             << StringBuilder::FixedDouble(min_pass_time, 3) << '-' << StringBuilder::FixedDouble(max_pass_time, 3)
+             << "] ops/sec,\t" << format::as_time(1 / average) << " [d = " << StringBuilder::FixedDouble(d, 6) << ']';
+}
+
+inline void bench(Benchmark &&b, double max_time = 1.0) {
+  bench(b, max_time);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/bits.h b/submodules/ton/tonlib-src/tdutils/td/utils/bits.h
new file mode 100644
index 0000000000..d4ab932e31
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/bits.h
@@ -0,0 +1,267 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#if TD_MSVC
+#include <intrin.h>
+#endif
+
+#ifdef bswap32
+#undef bswap32
+#endif
+
+#ifdef bswap64
+#undef bswap64
+#endif
+
+namespace td {
+
+int32 count_leading_zeroes32(uint32 x);
+int32 count_leading_zeroes64(uint64 x);
+int32 count_trailing_zeroes32(uint32 x);
+int32 count_trailing_zeroes64(uint64 x);
+uint32 bswap32(uint32 x);
+uint64 bswap64(uint64 x);
+int32 count_bits32(uint32 x);
+int32 count_bits64(uint64 x);
+
+inline uint32 bits_negate32(uint32 x) {
+  return ~x + 1;
+}
+
+inline uint64 bits_negate64(uint64 x) {
+  return ~x + 1;
+}
+
+inline uint32 lower_bit32(uint32 x) {
+  return x & bits_negate32(x);
+}
+
+inline uint64 lower_bit64(uint64 x) {
+  return x & bits_negate64(x);
+}
+
+//TODO: optimize
+inline int32 count_leading_zeroes_non_zero32(uint32 x) {
+  DCHECK(x != 0);
+  return count_leading_zeroes32(x);
+}
+inline int32 count_leading_zeroes_non_zero64(uint64 x) {
+  DCHECK(x != 0);
+  return count_leading_zeroes64(x);
+}
+inline int32 count_trailing_zeroes_non_zero32(uint32 x) {
+  DCHECK(x != 0);
+  return count_trailing_zeroes32(x);
+}
+inline int32 count_trailing_zeroes_non_zero64(uint64 x) {
+  DCHECK(x != 0);
+  return count_trailing_zeroes64(x);
+}
+
+//
+// Platform specific implementation
+//
+#if TD_MSVC
+
+inline int32 count_leading_zeroes32(uint32 x) {
+  unsigned long res = 0;
+  if (_BitScanReverse(&res, x)) {
+    return 31 - res;
+  }
+  return 32;
+}
+
+inline int32 count_leading_zeroes64(uint64 x) {
+#if defined(_M_X64)
+  unsigned long res = 0;
+  if (_BitScanReverse64(&res, x)) {
+    return 63 - res;
+  }
+  return 64;
+#else
+  if ((x >> 32) == 0) {
+    return count_leading_zeroes32(static_cast<uint32>(x)) + 32;
+  } else {
+    return count_leading_zeroes32(static_cast<uint32>(x >> 32));
+  }
+#endif
+}
+
+inline int32 count_trailing_zeroes32(uint32 x) {
+  unsigned long res = 0;
+  if (_BitScanForward(&res, x)) {
+    return res;
+  }
+  return 32;
+}
+
+inline int32 count_trailing_zeroes64(uint64 x) {
+#if defined(_M_X64)
+  unsigned long res = 0;
+  if (_BitScanForward64(&res, x)) {
+    return res;
+  }
+  return 64;
+#else
+  if (static_cast<uint32>(x) == 0) {
+    return count_trailing_zeroes32(static_cast<uint32>(x >> 32)) + 32;
+  } else {
+    return count_trailing_zeroes32(static_cast<uint32>(x));
+  }
+#endif
+}
+
+inline uint32 bswap32(uint32 x) {
+  return _byteswap_ulong(x);
+}
+
+inline uint64 bswap64(uint64 x) {
+  return _byteswap_uint64(x);
+}
+
+inline int32 count_bits32(uint32 x) {
+  return __popcnt(x);
+}
+
+inline int32 count_bits64(uint64 x) {
+#if defined(_M_X64)
+  return static_cast<int32>(__popcnt64(x));
+#else
+  return count_bits32(static_cast<uint32>(x >> 32)) + count_bits32(static_cast<uint32>(x));
+#endif
+}
+
+#elif TD_INTEL
+
+inline int32 count_leading_zeroes32(uint32 x) {
+  unsigned __int32 res = 0;
+  if (_BitScanReverse(&res, x)) {
+    return 31 - res;
+  }
+  return 32;
+}
+
+inline int32 count_leading_zeroes64(uint64 x) {
+#if defined(_M_X64) || defined(__x86_64__)
+  unsigned __int32 res = 0;
+  if (_BitScanReverse64(&res, x)) {
+    return 63 - res;
+  }
+  return 64;
+#else
+  if ((x >> 32) == 0) {
+    return count_leading_zeroes32(static_cast<uint32>(x)) + 32;
+  } else {
+    return count_leading_zeroes32(static_cast<uint32>(x >> 32));
+  }
+#endif
+}
+
+inline int32 count_trailing_zeroes32(uint32 x) {
+  unsigned __int32 res = 0;
+  if (_BitScanForward(&res, x)) {
+    return res;
+  }
+  return 32;
+}
+
+inline int32 count_trailing_zeroes64(uint64 x) {
+#if defined(_M_X64) || defined(__x86_64__)
+  unsigned __int32 res = 0;
+  if (_BitScanForward64(&res, x)) {
+    return res;
+  }
+  return 64;
+#else
+  if (static_cast<uint32>(x) == 0) {
+    return count_trailing_zeroes32(static_cast<uint32>(x >> 32)) + 32;
+  } else {
+    return count_trailing_zeroes32(static_cast<uint32>(x));
+  }
+#endif
+}
+
+inline uint32 bswap32(uint32 x) {
+  return _bswap(static_cast<int>(x));
+}
+
+inline uint64 bswap64(uint64 x) {
+  return _bswap64(static_cast<__int64>(x));
+}
+
+inline int32 count_bits32(uint32 x) {
+  return _popcnt32(static_cast<int>(x));
+}
+
+inline int32 count_bits64(uint64 x) {
+  return _popcnt64(static_cast<__int64>(x));
+}
+
+#else
+
+inline int32 count_leading_zeroes32(uint32 x) {
+  if (x == 0) {
+    return 32;
+  }
+  return __builtin_clz(x);
+}
+
+inline int32 count_leading_zeroes64(uint64 x) {
+  if (x == 0) {
+    return 64;
+  }
+  return __builtin_clzll(x);
+}
+
+inline int32 count_trailing_zeroes32(uint32 x) {
+  if (x == 0) {
+    return 32;
+  }
+  return __builtin_ctz(x);
+}
+
+inline int32 count_trailing_zeroes64(uint64 x) {
+  if (x == 0) {
+    return 64;
+  }
+  return __builtin_ctzll(x);
+}
+
+inline uint32 bswap32(uint32 x) {
+  return __builtin_bswap32(x);
+}
+
+inline uint64 bswap64(uint64 x) {
+  return __builtin_bswap64(x);
+}
+
+inline int32 count_bits32(uint32 x) {
+  return __builtin_popcount(x);
+}
+
+inline int32 count_bits64(uint64 x) {
+  return __builtin_popcountll(x);
+}
+
+#endif
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/buffer.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/buffer.cpp
new file mode 100644
index 0000000000..32caacc6b7
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/buffer.cpp
@@ -0,0 +1,196 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/buffer.h"
+
+#include "td/utils/port/thread_local.h"
+
+#include <cstddef>
+#include <new>
+
+// fixes https://bugs.llvm.org/show_bug.cgi?id=33723 for clang >= 3.6 + c++11 + libc++
+#if TD_CLANG && _LIBCPP_VERSION
+#define TD_OFFSETOF __builtin_offsetof
+#else
+#define TD_OFFSETOF offsetof
+#endif
+
+namespace td {
+
+TD_THREAD_LOCAL BufferAllocator::BufferRawTls *BufferAllocator::buffer_raw_tls;  // static zero-initialized
+
+std::atomic<size_t> BufferAllocator::buffer_mem;
+
+size_t BufferAllocator::get_buffer_mem() {
+  return buffer_mem;
+}
+
+BufferAllocator::WriterPtr BufferAllocator::create_writer(size_t size) {
+  if (size < 512) {
+    size = 512;
+  }
+  return create_writer_exact(size);
+}
+
+BufferAllocator::WriterPtr BufferAllocator::create_writer_exact(size_t size) {
+  return WriterPtr(create_buffer_raw(size));
+}
+
+BufferAllocator::WriterPtr BufferAllocator::create_writer(size_t size, size_t prepend, size_t append) {
+  auto ptr = create_writer(size + prepend + append);
+  ptr->begin_ += prepend;
+  ptr->end_ += prepend + size;
+  return ptr;
+}
+
+BufferAllocator::ReaderPtr BufferAllocator::create_reader(size_t size) {
+  if (size < 512) {
+    return create_reader_fast(size);
+  }
+  auto ptr = create_writer_exact(size);
+  ptr->end_ += (size + 7) & -8;
+  return create_reader(ptr);
+}
+
+BufferAllocator::ReaderPtr BufferAllocator::create_reader_fast(size_t size) {
+  size = (size + 7) & -8;
+
+  init_thread_local<BufferRawTls>(buffer_raw_tls);
+
+  auto buffer_raw = buffer_raw_tls->buffer_raw.get();
+  if (buffer_raw == nullptr || buffer_raw->data_size_ - buffer_raw->end_.load(std::memory_order_relaxed) < size) {
+    buffer_raw = create_buffer_raw(4096 * 4);
+    buffer_raw_tls->buffer_raw = std::unique_ptr<BufferRaw, BufferAllocator::BufferRawDeleter>(buffer_raw);
+  }
+  buffer_raw->end_.fetch_add(size, std::memory_order_relaxed);
+  buffer_raw->ref_cnt_.fetch_add(1, std::memory_order_acq_rel);
+  return ReaderPtr(buffer_raw);
+}
+
+BufferAllocator::ReaderPtr BufferAllocator::create_reader(const WriterPtr &raw) {
+  raw->was_reader_ = true;
+  raw->ref_cnt_.fetch_add(1, std::memory_order_acq_rel);
+  return ReaderPtr(raw.get());
+}
+
+BufferAllocator::ReaderPtr BufferAllocator::create_reader(const ReaderPtr &raw) {
+  raw->ref_cnt_.fetch_add(1, std::memory_order_acq_rel);
+  return ReaderPtr(raw.get());
+}
+
+void BufferAllocator::dec_ref_cnt(BufferRaw *ptr) {
+  int left = ptr->ref_cnt_.fetch_sub(1, std::memory_order_acq_rel);
+  if (left == 1) {
+    auto buf_size = max(sizeof(BufferRaw), TD_OFFSETOF(BufferRaw, data_) + ptr->data_size_);
+    buffer_mem -= buf_size;
+    ptr->~BufferRaw();
+    delete[] ptr;
+  }
+}
+
+BufferRaw *BufferAllocator::create_buffer_raw(size_t size) {
+  size = (size + 7) & -8;
+
+  auto buf_size = TD_OFFSETOF(BufferRaw, data_) + size;
+  if (buf_size < sizeof(BufferRaw)) {
+    buf_size = sizeof(BufferRaw);
+  }
+  buffer_mem += buf_size;
+  auto *buffer_raw = reinterpret_cast<BufferRaw *>(new char[buf_size]);
+  return new (buffer_raw) BufferRaw(size);
+}
+
+void BufferBuilder::append(BufferSlice slice) {
+  if (append_inplace(slice.as_slice())) {
+    return;
+  }
+  append_slow(std::move(slice));
+}
+void BufferBuilder::append(Slice slice) {
+  if (append_inplace(slice)) {
+    return;
+  }
+  append_slow(BufferSlice(slice));
+}
+
+void BufferBuilder::prepend(BufferSlice slice) {
+  if (prepend_inplace(slice.as_slice())) {
+    return;
+  }
+  prepend_slow(std::move(slice));
+}
+void BufferBuilder::prepend(Slice slice) {
+  if (prepend_inplace(slice)) {
+    return;
+  }
+  prepend_slow(BufferSlice(slice));
+}
+
+BufferSlice BufferBuilder::extract() {
+  if (to_append_.empty() && to_prepend_.empty()) {
+    return buffer_writer_.as_buffer_slice();
+  }
+  size_t total_size = size();
+  BufferWriter writer(0, 0, total_size);
+  std::move(*this).for_each([&](auto &&slice) {
+    writer.prepare_append().truncate(slice.size()).copy_from(slice.as_slice());
+    writer.confirm_append(slice.size());
+  });
+  *this = {};
+  return writer.as_buffer_slice();
+}
+
+size_t BufferBuilder::size() const {
+  size_t total_size = 0;
+  for_each([&](auto &&slice) { total_size += slice.size(); });
+  return total_size;
+}
+
+bool BufferBuilder::append_inplace(Slice slice) {
+  if (!to_append_.empty()) {
+    return false;
+  }
+  auto dest = buffer_writer_.prepare_append();
+  if (dest.size() < slice.size()) {
+    return false;
+  }
+  dest.remove_suffix(dest.size() - slice.size());
+  dest.copy_from(slice);
+  buffer_writer_.confirm_append(slice.size());
+  return true;
+}
+void BufferBuilder::append_slow(BufferSlice slice) {
+  to_append_.push_back(std::move(slice));
+}
+bool BufferBuilder::prepend_inplace(Slice slice) {
+  if (!to_prepend_.empty()) {
+    return false;
+  }
+  auto dest = buffer_writer_.prepare_prepend();
+  if (dest.size() < slice.size()) {
+    return false;
+  }
+  dest.remove_prefix(dest.size() - slice.size());
+  dest.copy_from(slice);
+  buffer_writer_.confirm_prepend(slice.size());
+  return true;
+}
+void BufferBuilder::prepend_slow(BufferSlice slice) {
+  to_prepend_.push_back(std::move(slice));
+}
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/buffer.h b/submodules/ton/tonlib-src/tdutils/td/utils/buffer.h
new file mode 100644
index 0000000000..51f266187d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/buffer.h
@@ -0,0 +1,815 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/thread_local.h"
+#include "td/utils/Slice.h"
+
+#include <atomic>
+#include <limits>
+#include <memory>
+
+namespace td {
+
+struct BufferRaw {
+  explicit BufferRaw(size_t size) : data_size_(size) {
+  }
+  size_t data_size_;
+
+  // Constant after first reader is created.
+  // May be change by writer before it.
+  // So writer may do prepends till there is no reader created.
+  size_t begin_ = 0;
+
+  // Write by writer.
+  // Read by reader.
+  std::atomic<size_t> end_{0};
+
+  mutable std::atomic<int32> ref_cnt_{1};
+  std::atomic<bool> has_writer_{true};
+  bool was_reader_{false};
+
+  alignas(4) unsigned char data_[1];
+};
+
+class BufferAllocator {
+ public:
+  class DeleteWriterPtr {
+   public:
+    void operator()(BufferRaw *ptr) {
+      ptr->has_writer_.store(false, std::memory_order_release);
+      dec_ref_cnt(ptr);
+    }
+  };
+  class DeleteReaderPtr {
+   public:
+    void operator()(BufferRaw *ptr) {
+      dec_ref_cnt(ptr);
+    }
+  };
+
+  using WriterPtr = std::unique_ptr<BufferRaw, DeleteWriterPtr>;
+  using ReaderPtr = std::unique_ptr<BufferRaw, DeleteReaderPtr>;
+
+  static WriterPtr create_writer(size_t size);
+
+  static WriterPtr create_writer(size_t size, size_t prepend, size_t append);
+
+  static ReaderPtr create_reader(size_t size);
+
+  static ReaderPtr create_reader(const WriterPtr &raw);
+
+  static ReaderPtr create_reader(const ReaderPtr &raw);
+
+  static size_t get_buffer_mem();
+
+  static void clear_thread_local();
+
+ private:
+  static ReaderPtr create_reader_fast(size_t size);
+
+  static WriterPtr create_writer_exact(size_t size);
+
+  struct BufferRawDeleter {
+    void operator()(BufferRaw *ptr) {
+      dec_ref_cnt(ptr);
+    }
+  };
+  struct BufferRawTls {
+    std::unique_ptr<BufferRaw, BufferRawDeleter> buffer_raw;
+  };
+
+  static TD_THREAD_LOCAL BufferRawTls *buffer_raw_tls;
+
+  static void dec_ref_cnt(BufferRaw *ptr);
+
+  static BufferRaw *create_buffer_raw(size_t size);
+
+  static std::atomic<size_t> buffer_mem;
+};
+
+using BufferWriterPtr = BufferAllocator::WriterPtr;
+using BufferReaderPtr = BufferAllocator::ReaderPtr;
+
+class BufferSlice {
+ public:
+  BufferSlice() = default;
+  explicit BufferSlice(BufferReaderPtr buffer_ptr) : buffer_(std::move(buffer_ptr)) {
+    if (is_null()) {
+      return;
+    }
+    begin_ = buffer_->begin_;
+    sync_with_writer();
+  }
+  BufferSlice(BufferReaderPtr buffer_ptr, size_t begin, size_t end)
+      : buffer_(std::move(buffer_ptr)), begin_(begin), end_(end) {
+  }
+
+  explicit BufferSlice(size_t size) : buffer_(BufferAllocator::create_reader(size)) {
+    end_ = buffer_->end_.load(std::memory_order_relaxed);
+    begin_ = end_ - ((size + 7) & -8);
+    end_ = begin_ + size;
+  }
+
+  explicit BufferSlice(Slice slice) : BufferSlice(slice.size()) {
+    as_slice().copy_from(slice);
+  }
+
+  BufferSlice(const char *ptr, size_t size) : BufferSlice(Slice(ptr, size)) {
+  }
+
+  BufferSlice clone() const {
+    if (is_null()) {
+      return BufferSlice(BufferReaderPtr(), begin_, end_);
+    }
+    return BufferSlice(BufferAllocator::create_reader(buffer_), begin_, end_);
+  }
+
+  BufferSlice copy() const {
+    if (is_null()) {
+      return BufferSlice(BufferReaderPtr(), begin_, end_);
+    }
+    return BufferSlice(as_slice());
+  }
+
+  Slice as_slice() const {
+    if (is_null()) {
+      return Slice();
+    }
+    return Slice(buffer_->data_ + begin_, size());
+  }
+
+  operator Slice() const {
+    return as_slice();
+  }
+
+  MutableSlice as_slice() {
+    if (is_null()) {
+      return MutableSlice();
+    }
+    return MutableSlice(buffer_->data_ + begin_, size());
+  }
+
+  Slice prepare_read() const {
+    return as_slice();
+  }
+
+  Slice after(size_t offset) const {
+    auto full = as_slice();
+    full.remove_prefix(offset);
+    return full;
+  }
+
+  bool confirm_read(size_t size) {
+    begin_ += size;
+    CHECK(begin_ <= end_);
+    return begin_ == end_;
+  }
+
+  void truncate(size_t limit) {
+    if (size() > limit) {
+      end_ = begin_ + limit;
+    }
+  }
+
+  BufferSlice from_slice(Slice slice) const {
+    auto res = BufferSlice(BufferAllocator::create_reader(buffer_));
+    res.begin_ = static_cast<size_t>(slice.ubegin() - buffer_->data_);
+    res.end_ = static_cast<size_t>(slice.uend() - buffer_->data_);
+    CHECK(buffer_->begin_ <= res.begin_);
+    CHECK(res.begin_ <= res.end_);
+    CHECK(res.end_ <= buffer_->end_.load(std::memory_order_relaxed));
+    return res;
+  }
+
+  // like in std::string
+  char *data() {
+    return as_slice().data();
+  }
+  const char *data() const {
+    return as_slice().data();
+  }
+  char operator[](size_t at) const {
+    return as_slice()[at];
+  }
+
+  bool empty() const {
+    return size() == 0;
+  }
+
+  bool is_null() const {
+    return !buffer_;
+  }
+
+  size_t size() const {
+    if (is_null()) {
+      return 0;
+    }
+    return end_ - begin_;
+  }
+
+  // like in std::string
+  size_t length() const {
+    return size();
+  }
+
+  // set end_ into writer's end_
+  size_t sync_with_writer() {
+    CHECK(!is_null());
+    auto old_end = end_;
+    end_ = buffer_->end_.load(std::memory_order_acquire);
+    return end_ - old_end;
+  }
+  bool is_writer_alive() const {
+    CHECK(!is_null());
+    return buffer_->has_writer_.load(std::memory_order_acquire);
+  }
+  void clear() {
+    begin_ = 0;
+    end_ = 0;
+    buffer_ = nullptr;
+  }
+
+ private:
+  BufferReaderPtr buffer_;
+  size_t begin_ = 0;
+  size_t end_ = 0;
+};
+
+template <class StorerT>
+void store(const BufferSlice &buffer_slice, StorerT &storer) {
+  storer.store_string(buffer_slice);
+}
+
+template <class ParserT>
+void parse(BufferSlice &buffer_slice, ParserT &parser) {
+  buffer_slice = parser.template fetch_string<BufferSlice>();
+}
+
+class BufferWriter {
+ public:
+  BufferWriter() = default;
+  explicit BufferWriter(size_t size) : BufferWriter(BufferAllocator::create_writer(size)) {
+  }
+  BufferWriter(size_t size, size_t prepend, size_t append)
+      : BufferWriter(BufferAllocator::create_writer(size, prepend, append)) {
+  }
+  BufferWriter(Slice slice, size_t prepend, size_t append)
+      : BufferWriter(BufferAllocator::create_writer(slice.size(), prepend, append)) {
+    as_slice().copy_from(slice);
+  }
+  explicit BufferWriter(BufferWriterPtr buffer_ptr) : buffer_(std::move(buffer_ptr)) {
+  }
+
+  BufferSlice as_buffer_slice() const {
+    return BufferSlice(BufferAllocator::create_reader(buffer_));
+  }
+  bool is_null() const {
+    return !buffer_;
+  }
+  bool empty() const {
+    return size() == 0;
+  }
+  size_t size() const {
+    if (is_null()) {
+      return 0;
+    }
+    return buffer_->end_.load(std::memory_order_relaxed) - buffer_->begin_;
+  }
+  MutableSlice as_slice() {
+    auto end = buffer_->end_.load(std::memory_order_relaxed);
+    return MutableSlice(buffer_->data_ + buffer_->begin_, buffer_->data_ + end);
+  }
+  Slice as_slice() const {
+    auto end = buffer_->end_.load(std::memory_order_relaxed);
+    return Slice(buffer_->data_ + buffer_->begin_, buffer_->data_ + end);
+  }
+
+  MutableSlice prepare_prepend() {
+    if (is_null()) {
+      return MutableSlice();
+    }
+    CHECK(!buffer_->was_reader_);
+    return MutableSlice(buffer_->data_, buffer_->begin_);
+  }
+  MutableSlice prepare_append() {
+    if (is_null()) {
+      return MutableSlice();
+    }
+    auto end = buffer_->end_.load(std::memory_order_relaxed);
+    return MutableSlice(buffer_->data_ + end, buffer_->data_size_ - end);
+  }
+  void confirm_append(size_t size) {
+    if (is_null()) {
+      CHECK(size == 0);
+      return;
+    }
+    auto new_end = buffer_->end_.load(std::memory_order_relaxed) + size;
+    CHECK(new_end <= buffer_->data_size_);
+    buffer_->end_.store(new_end, std::memory_order_release);
+  }
+  void confirm_prepend(size_t size) {
+    if (is_null()) {
+      CHECK(size == 0);
+      return;
+    }
+    CHECK(buffer_->begin_ >= size);
+    buffer_->begin_ -= size;
+  }
+
+ private:
+  BufferWriterPtr buffer_;
+};
+
+struct ChainBufferNode {
+  friend struct DeleteWriterPtr;
+  struct DeleteWriterPtr {
+    void operator()(ChainBufferNode *ptr) {
+      ptr->has_writer_.store(false, std::memory_order_release);
+      dec_ref_cnt(ptr);
+    }
+  };
+  friend struct DeleteReaderPtr;
+  struct DeleteReaderPtr {
+    void operator()(ChainBufferNode *ptr) {
+      dec_ref_cnt(ptr);
+    }
+  };
+  using WriterPtr = std::unique_ptr<ChainBufferNode, DeleteWriterPtr>;
+  using ReaderPtr = std::unique_ptr<ChainBufferNode, DeleteReaderPtr>;
+
+  static WriterPtr make_writer_ptr(ChainBufferNode *ptr) {
+    ptr->ref_cnt_.store(1, std::memory_order_relaxed);
+    ptr->has_writer_.store(true, std::memory_order_relaxed);
+    return WriterPtr(ptr);
+  }
+  static ReaderPtr make_reader_ptr(ChainBufferNode *ptr) {
+    ptr->ref_cnt_.fetch_add(1, std::memory_order_acq_rel);
+    return ReaderPtr(ptr);
+  }
+
+  bool has_writer() {
+    return has_writer_.load(std::memory_order_acquire);
+  }
+
+  bool unique() {
+    return ref_cnt_.load(std::memory_order_acquire) == 1;
+  }
+
+  ChainBufferNode(BufferSlice slice, bool sync_flag) : slice_(std::move(slice)), sync_flag_(sync_flag) {
+  }
+
+  // reader
+  // There are two options
+  // 1. Fixed slice of Buffer
+  // 2. Slice with non-fixed right end
+  // In each case slice_ is const. Reader should read it and use sync_with_writer on its own copy.
+  const BufferSlice slice_;
+  const bool sync_flag_{false};  // should we call slice_.sync_with_writer or not.
+
+  // writer
+  ReaderPtr next_{nullptr};
+
+ private:
+  std::atomic<int> ref_cnt_{0};
+  std::atomic<bool> has_writer_{false};
+
+  static void clear_nonrecursive(ReaderPtr ptr) {
+    while (ptr && ptr->unique()) {
+      ptr = std::move(ptr->next_);
+    }
+  }
+  static void dec_ref_cnt(ChainBufferNode *ptr) {
+    int left = --ptr->ref_cnt_;
+    if (left == 0) {
+      clear_nonrecursive(std::move(ptr->next_));
+      // TODO(refact): move memory management into allocator (?)
+      delete ptr;
+    }
+  }
+};
+
+using ChainBufferNodeWriterPtr = ChainBufferNode::WriterPtr;
+using ChainBufferNodeReaderPtr = ChainBufferNode::ReaderPtr;
+
+class ChainBufferNodeAllocator {
+ public:
+  static ChainBufferNodeWriterPtr create(BufferSlice slice, bool sync_flag) {
+    auto *ptr = new ChainBufferNode(std::move(slice), sync_flag);
+    return ChainBufferNode::make_writer_ptr(ptr);
+  }
+  static ChainBufferNodeReaderPtr clone(const ChainBufferNodeReaderPtr &ptr) {
+    if (!ptr) {
+      return ChainBufferNodeReaderPtr();
+    }
+    return ChainBufferNode::make_reader_ptr(ptr.get());
+  }
+  static ChainBufferNodeReaderPtr clone(ChainBufferNodeWriterPtr &ptr) {
+    if (!ptr) {
+      return ChainBufferNodeReaderPtr();
+    }
+    return ChainBufferNode::make_reader_ptr(ptr.get());
+  }
+};
+
+class ChainBufferIterator {
+ public:
+  ChainBufferIterator() = default;
+  explicit ChainBufferIterator(ChainBufferNodeReaderPtr head) : head_(std::move(head)) {
+    load_head();
+  }
+  ChainBufferIterator clone() const {
+    return ChainBufferIterator(ChainBufferNodeAllocator::clone(head_), reader_.clone(), need_sync_, offset_);
+  }
+
+  size_t offset() const {
+    return offset_;
+  }
+
+  void clear() {
+    *this = ChainBufferIterator();
+  }
+
+  Slice prepare_read() {
+    if (!head_) {
+      return Slice();
+    }
+    while (true) {
+      auto res = reader_.prepare_read();
+      if (!res.empty()) {
+        return res;
+      }
+      auto has_writer = head_->has_writer();
+      if (need_sync_) {
+        reader_.sync_with_writer();
+        res = reader_.prepare_read();
+        if (!res.empty()) {
+          return res;
+        }
+      }
+      if (has_writer) {
+        return Slice();
+      }
+      head_ = ChainBufferNodeAllocator::clone(head_->next_);
+      if (!head_) {
+        return Slice();
+      }
+      load_head();
+    }
+  }
+
+  // returns only head
+  BufferSlice read_as_buffer_slice(size_t limit) {
+    prepare_read();
+    auto res = reader_.clone();
+    res.truncate(limit);
+    confirm_read(res.size());
+    return res;
+  }
+
+  const BufferSlice &head() const {
+    return reader_;
+  }
+
+  void confirm_read(size_t size) {
+    offset_ += size;
+    reader_.confirm_read(size);
+  }
+
+  void advance_till_end() {
+    while (true) {
+      auto ready = prepare_read();
+      if (ready.empty()) {
+        break;
+      }
+      confirm_read(ready.size());
+    }
+  }
+
+  size_t advance(size_t offset, MutableSlice dest = MutableSlice()) {
+    size_t skipped = 0;
+    while (offset != 0) {
+      auto ready = prepare_read();
+      if (ready.empty()) {
+        break;
+      }
+
+      // read no more than offset
+      ready.truncate(offset);
+      offset -= ready.size();
+      skipped += ready.size();
+
+      // copy to dest if possible
+      auto to_dest_size = min(ready.size(), dest.size());
+      if (to_dest_size != 0) {
+        dest.copy_from(ready.substr(0, to_dest_size));
+        dest.remove_prefix(to_dest_size);
+      }
+
+      confirm_read(ready.size());
+    }
+    return skipped;
+  }
+
+ private:
+  ChainBufferNodeReaderPtr head_;
+  BufferSlice reader_;      // copy of head_->slice_
+  bool need_sync_ = false;  // copy of head_->sync_flag_
+  size_t offset_ = 0;       // position in the union of all nodes
+
+  ChainBufferIterator(ChainBufferNodeReaderPtr head, BufferSlice reader, bool need_sync, size_t offset)
+      : head_(std::move(head)), reader_(std::move(reader)), need_sync_(need_sync), offset_(offset) {
+  }
+  void load_head() {
+    reader_ = head_->slice_.clone();
+    need_sync_ = head_->sync_flag_;
+  }
+};
+
+class ChainBufferReader {
+ public:
+  ChainBufferReader() = default;
+  explicit ChainBufferReader(ChainBufferNodeReaderPtr head)
+      : begin_(ChainBufferNodeAllocator::clone(head)), end_(std::move(head)) {
+    end_.advance_till_end();
+  }
+  ChainBufferReader(ChainBufferIterator begin, ChainBufferIterator end, bool sync_flag)
+      : begin_(std::move(begin)), end_(std::move(end)), sync_flag_(sync_flag) {
+  }
+  ChainBufferReader(ChainBufferNodeReaderPtr head, size_t size)
+      : begin_(ChainBufferNodeAllocator::clone(head)), end_(std::move(head)) {
+    auto advanced = end_.advance(size);
+    CHECK(advanced == size);
+  }
+  ChainBufferReader(ChainBufferReader &&) = default;
+  ChainBufferReader &operator=(ChainBufferReader &&) = default;
+  ChainBufferReader(const ChainBufferReader &) = delete;
+  ChainBufferReader &operator=(const ChainBufferReader &) = delete;
+  ~ChainBufferReader() = default;
+
+  ChainBufferReader clone() {
+    return ChainBufferReader(begin_.clone(), end_.clone(), sync_flag_);
+  }
+
+  Slice prepare_read() {
+    auto res = begin_.prepare_read();
+    res.truncate(size());
+    return res;
+  }
+
+  void confirm_read(size_t size) {
+    CHECK(size <= this->size());
+    begin_.confirm_read(size);
+  }
+
+  size_t advance(size_t offset, MutableSlice dest = MutableSlice()) {
+    CHECK(offset <= size());
+    return begin_.advance(offset, dest);
+  }
+
+  size_t size() const {
+    return end_.offset() - begin_.offset();
+  }
+  bool empty() const {
+    return size() == 0;
+  }
+
+  void sync_with_writer() {
+    if (sync_flag_) {
+      end_.advance_till_end();
+    }
+  }
+  void advance_end(size_t size) {
+    end_.advance(size);
+  }
+  const ChainBufferIterator &begin() {
+    return begin_;
+  }
+  const ChainBufferIterator &end() {
+    return end_;
+  }
+
+  // Return [begin_, tail.begin_)
+  // *this = tail
+  ChainBufferReader cut_head(ChainBufferIterator pos) TD_WARN_UNUSED_RESULT {
+    auto tmp = begin_.clone();
+    begin_ = pos.clone();
+    return ChainBufferReader(std::move(tmp), std::move(pos), false);
+  }
+
+  ChainBufferReader cut_head(size_t offset) TD_WARN_UNUSED_RESULT {
+    LOG_CHECK(offset <= size()) << offset << " " << size();
+    auto it = begin_.clone();
+    it.advance(offset);
+    return cut_head(std::move(it));
+  }
+
+  BufferSlice move_as_buffer_slice() {
+    BufferSlice res;
+    if (begin_.head().size() >= size()) {
+      res = begin_.read_as_buffer_slice(size());
+    } else {
+      auto save_size = size();
+      res = BufferSlice{save_size};
+      advance(save_size, res.as_slice());
+    }
+    *this = ChainBufferReader();
+    return res;
+  }
+
+  BufferSlice read_as_buffer_slice(size_t limit = std::numeric_limits<size_t>::max()) {
+    return begin_.read_as_buffer_slice(min(limit, size()));
+  }
+
+ private:
+  ChainBufferIterator begin_;  // use it for prepare_read. Fix result with size()
+  ChainBufferIterator end_;    // keep end as far as we can. use it for size()
+  bool sync_flag_ = true;      // auto sync of end_
+
+  // 1. We have fixed size. Than end_ is useless.
+  // 2. No fixed size. One has to sync end_ with end_.advance_till_end() in order to calculate size.
+};
+
+class ChainBufferWriter {
+ public:
+  ChainBufferWriter() {
+    init();
+  }
+
+  void init(size_t size = 0) {
+    writer_ = BufferWriter(size);
+    tail_ = ChainBufferNodeAllocator::create(writer_.as_buffer_slice(), true);
+    head_ = ChainBufferNodeAllocator::clone(tail_);
+  }
+
+  MutableSlice prepare_append(size_t hint = 0) {
+    CHECK(!empty());
+    auto res = prepare_append_inplace();
+    if (res.empty()) {
+      return prepare_append_alloc(hint);
+    }
+    return res;
+  }
+  MutableSlice prepare_append_at_least(size_t size) {
+    CHECK(!empty());
+    auto res = prepare_append_inplace();
+    if (res.size() < size) {
+      return prepare_append_alloc(size);
+    }
+    return res;
+  }
+  MutableSlice prepare_append_inplace() {
+    CHECK(!empty());
+    return writer_.prepare_append();
+  }
+  MutableSlice prepare_append_alloc(size_t hint = 0) {
+    CHECK(!empty());
+    if (hint < (1 << 10)) {
+      hint = 1 << 12;
+    }
+    BufferWriter new_writer(hint);
+    auto new_tail = ChainBufferNodeAllocator::create(new_writer.as_buffer_slice(), true);
+    tail_->next_ = ChainBufferNodeAllocator::clone(new_tail);
+    writer_ = std::move(new_writer);
+    tail_ = std::move(new_tail);  // release tail_
+    return writer_.prepare_append();
+  }
+  void confirm_append(size_t size) {
+    CHECK(!empty());
+    writer_.confirm_append(size);
+  }
+
+  void append(Slice slice, size_t hint = 0) {
+    while (!slice.empty()) {
+      auto ready = prepare_append(td::max(slice.size(), hint));
+      auto shift = min(ready.size(), slice.size());
+      ready.copy_from(slice.substr(0, shift));
+      confirm_append(shift);
+      slice.remove_prefix(shift);
+    }
+  }
+
+  void append(BufferSlice slice) {
+    auto ready = prepare_append_inplace();
+    // TODO(perf): we have to store some stats in ChainBufferWriter
+    // for better append logic
+    if (slice.size() < (1 << 8) || ready.size() >= slice.size()) {
+      return append(slice.as_slice());
+    }
+
+    auto new_tail = ChainBufferNodeAllocator::create(std::move(slice), false);
+    tail_->next_ = ChainBufferNodeAllocator::clone(new_tail);
+    writer_ = BufferWriter();
+    tail_ = std::move(new_tail);  // release tail_
+  }
+
+  void append(ChainBufferReader &&reader) {
+    while (!reader.empty()) {
+      append(reader.read_as_buffer_slice());
+    }
+  }
+  void append(ChainBufferReader &reader) {
+    while (!reader.empty()) {
+      append(reader.read_as_buffer_slice());
+    }
+  }
+
+  ChainBufferReader extract_reader() {
+    CHECK(head_);
+    return ChainBufferReader(std::move(head_));
+  }
+
+ private:
+  bool empty() const {
+    return !tail_;
+  }
+
+  ChainBufferNodeReaderPtr head_;
+  ChainBufferNodeWriterPtr tail_;
+  BufferWriter writer_;
+};
+
+class BufferBuilder {
+ public:
+  BufferBuilder() = default;
+  BufferBuilder(Slice slice, size_t prepend_size, size_t append_size)
+      : buffer_writer_(slice, prepend_size, append_size) {
+  }
+  explicit BufferBuilder(BufferWriter &&buffer_writer) : buffer_writer_(std::move(buffer_writer)) {
+  }
+
+  void append(BufferSlice slice);
+  void append(Slice slice);
+
+  void prepend(BufferSlice slice);
+  void prepend(Slice slice);
+
+  template <class F>
+  void for_each(F &&f) const & {
+    for (auto &slice : reversed(to_prepend_)) {
+      f(slice.as_slice());
+    }
+    if (!buffer_writer_.empty()) {
+      f(buffer_writer_.as_slice());
+    }
+    for (auto &slice : to_append_) {
+      f(slice.as_slice());
+    }
+  }
+  template <class F>
+  void for_each(F &&f) && {
+    for (auto &slice : reversed(to_prepend_)) {
+      f(std::move(slice));
+    }
+    if (!buffer_writer_.empty()) {
+      f(buffer_writer_.as_buffer_slice());
+    }
+    for (auto &slice : to_append_) {
+      f(std::move(slice));
+    }
+  }
+  size_t size() const;
+
+  BufferSlice extract();
+
+ private:
+  BufferWriter buffer_writer_;
+  std::vector<BufferSlice> to_append_;
+  std::vector<BufferSlice> to_prepend_;
+
+  bool append_inplace(Slice slice);
+  void append_slow(BufferSlice slice);
+  bool prepend_inplace(Slice slice);
+  void prepend_slow(BufferSlice slice);
+};
+
+inline Slice as_slice(const BufferSlice &value) {
+  return value.as_slice();
+}
+inline MutableSlice as_slice(BufferSlice &value) {
+  return value.as_slice();
+}
+inline MutableSlice as_mutable_slice(BufferSlice &value) {
+  return value.as_slice();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/check.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/check.cpp
new file mode 100644
index 0000000000..3935a1484f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/check.cpp
@@ -0,0 +1,34 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/check.h"
+
+#include "td/utils/logging.h"
+#include "td/utils/Slice.h"
+
+namespace td {
+namespace detail {
+
+void process_check_error(const char *message, const char *file, int line) {
+  ::td::Logger(*log_interface, log_options, VERBOSITY_NAME(FATAL), Slice(file), line, Slice())
+      << "Check `" << message << "` failed";
+  ::td::process_fatal_error(PSLICE() << "Check `" << message << "` failed in " << file << " at " << line);
+}
+
+}  // namespace detail
+}  // namespace td
diff --git a/submodules/MtProtoKit/TON/iOS/include/td/utils/check.h b/submodules/ton/tonlib-src/tdutils/td/utils/check.h
similarity index 100%
rename from submodules/MtProtoKit/TON/iOS/include/td/utils/check.h
rename to submodules/ton/tonlib-src/tdutils/td/utils/check.h
diff --git a/submodules/MtProtoKit/TON/iOS/include/td/utils/common.h b/submodules/ton/tonlib-src/tdutils/td/utils/common.h
similarity index 100%
rename from submodules/MtProtoKit/TON/iOS/include/td/utils/common.h
rename to submodules/ton/tonlib-src/tdutils/td/utils/common.h
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/config.h.in b/submodules/ton/tonlib-src/tdutils/td/utils/config.h.in
new file mode 100644
index 0000000000..85f7bba75e
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/config.h.in
@@ -0,0 +1,9 @@
+#pragma once
+
+#cmakedefine01 TD_HAVE_OPENSSL
+#cmakedefine01 TD_HAVE_ZLIB
+#cmakedefine01 TD_HAVE_CRC32C
+#cmakedefine01 TD_HAVE_COROUTINES
+#cmakedefine01 TD_HAVE_ABSL
+#cmakedefine01 TD_HAVE_GETOPT
+#cmakedefine01 TD_FD_DEBUG
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/crypto.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/crypto.cpp
new file mode 100644
index 0000000000..3898345f6d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/crypto.cpp
@@ -0,0 +1,851 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/crypto.h"
+
+#include "td/utils/as.h"
+#include "td/utils/BigNum.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/RwMutex.h"
+#include "td/utils/port/thread_local.h"
+#include "td/utils/Random.h"
+#include "td/utils/ScopeGuard.h"
+
+#if TD_HAVE_OPENSSL
+#include <openssl/aes.h>
+#include <openssl/bio.h>
+#include <openssl/crypto.h>
+#include <openssl/evp.h>
+#include <openssl/hmac.h>
+#include <openssl/md5.h>
+#include <openssl/pem.h>
+#include <openssl/rsa.h>
+#include <openssl/sha.h>
+#endif
+
+#if TD_HAVE_ZLIB
+#include <zlib.h>
+#endif
+
+#if TD_HAVE_CRC32C
+#include "crc32c/crc32c.h"
+#endif
+
+#include <algorithm>
+#include <mutex>
+#include <utility>
+
+namespace td {
+
+static uint64 gcd(uint64 a, uint64 b) {
+  if (a == 0) {
+    return b;
+  }
+  if (b == 0) {
+    return a;
+  }
+
+  int shift = 0;
+  while ((a & 1) == 0 && (b & 1) == 0) {
+    a >>= 1;
+    b >>= 1;
+    shift++;
+  }
+
+  while (true) {
+    while ((a & 1) == 0) {
+      a >>= 1;
+    }
+    while ((b & 1) == 0) {
+      b >>= 1;
+    }
+    if (a > b) {
+      a -= b;
+    } else if (b > a) {
+      b -= a;
+    } else {
+      return a << shift;
+    }
+  }
+}
+
+uint64 pq_factorize(uint64 pq) {
+  if (pq < 2 || pq > (static_cast<uint64>(1) << 63)) {
+    return 1;
+  }
+  uint64 g = 0;
+  for (int i = 0, iter = 0; i < 3 || iter < 1000; i++) {
+    uint64 q = Random::fast(17, 32) % (pq - 1);
+    uint64 x = Random::fast_uint64() % (pq - 1) + 1;
+    uint64 y = x;
+    int lim = 1 << (min(5, i) + 18);
+    for (int j = 1; j < lim; j++) {
+      iter++;
+      uint64 a = x;
+      uint64 b = x;
+      uint64 c = q;
+
+      // c += a * b
+      while (b) {
+        if (b & 1) {
+          c += a;
+          if (c >= pq) {
+            c -= pq;
+          }
+        }
+        a += a;
+        if (a >= pq) {
+          a -= pq;
+        }
+        b >>= 1;
+      }
+
+      x = c;
+      uint64 z = x < y ? pq + x - y : x - y;
+      g = gcd(z, pq);
+      if (g != 1) {
+        break;
+      }
+
+      if (!(j & (j - 1))) {
+        y = x;
+      }
+    }
+    if (g > 1 && g < pq) {
+      break;
+    }
+  }
+  if (g != 0) {
+    uint64 other = pq / g;
+    if (other < g) {
+      g = other;
+    }
+  }
+  return g;
+}
+
+#if TD_HAVE_OPENSSL
+void init_crypto() {
+  static bool is_inited = [] {
+#if OPENSSL_VERSION_NUMBER >= 0x10100000L
+    return OPENSSL_init_crypto(0, nullptr) != 0;
+#else
+    OpenSSL_add_all_algorithms();
+    return true;
+#endif
+  }();
+  CHECK(is_inited);
+}
+
+template <class FromT>
+static string as_big_endian_string(const FromT &from) {
+  char res[sizeof(FromT)];
+  as<FromT>(res) = from;
+
+  size_t i = sizeof(FromT);
+  while (i && res[i - 1] == 0) {
+    i--;
+  }
+
+  std::reverse(res, res + i);
+  return string(res, res + i);
+}
+
+static int pq_factorize_big(Slice pq_str, string *p_str, string *q_str) {
+  // TODO: qsieve?
+  // do not work for pq == 1
+  BigNumContext context;
+  BigNum a;
+  BigNum b;
+  BigNum p;
+  BigNum q;
+  BigNum one;
+  one.set_value(1);
+
+  BigNum pq = BigNum::from_binary(pq_str);
+
+  bool found = false;
+  for (int i = 0, iter = 0; !found && (i < 3 || iter < 1000); i++) {
+    int32 t = Random::fast(17, 32);
+    a.set_value(Random::fast_uint32());
+    b = a;
+
+    int32 lim = 1 << (i + 23);
+    for (int j = 1; j < lim; j++) {
+      iter++;
+      BigNum::mod_mul(a, a, a, pq, context);
+      a += t;
+      if (BigNum::compare(a, pq) >= 0) {
+        BigNum tmp;
+        BigNum::sub(tmp, a, pq);
+        a = std::move(tmp);
+      }
+      if (BigNum::compare(a, b) > 0) {
+        BigNum::sub(q, a, b);
+      } else {
+        BigNum::sub(q, b, a);
+      }
+      BigNum::gcd(p, q, pq, context);
+      if (BigNum::compare(p, one) != 0) {
+        found = true;
+        break;
+      }
+      if ((j & (j - 1)) == 0) {
+        b = a;
+      }
+    }
+  }
+
+  if (found) {
+    BigNum::div(&q, nullptr, pq, p, context);
+    if (BigNum::compare(p, q) > 0) {
+      std::swap(p, q);
+    }
+
+    *p_str = p.to_binary();
+    *q_str = q.to_binary();
+
+    return 0;
+  }
+
+  return -1;
+}
+
+int pq_factorize(Slice pq_str, string *p_str, string *q_str) {
+  size_t size = pq_str.size();
+  if (static_cast<int>(size) > 8 || (static_cast<int>(size) == 8 && (pq_str.begin()[0] & 128) != 0)) {
+    return pq_factorize_big(pq_str, p_str, q_str);
+  }
+
+  auto ptr = pq_str.ubegin();
+  uint64 pq = 0;
+  for (int i = 0; i < static_cast<int>(size); i++) {
+    pq = (pq << 8) | ptr[i];
+  }
+
+  uint64 p = pq_factorize(pq);
+  if (p == 0 || pq % p != 0) {
+    return -1;
+  }
+  *p_str = as_big_endian_string(p);
+  *q_str = as_big_endian_string(pq / p);
+
+  // std::string p2, q2;
+  // pq_factorize_big(pq_str, &p2, &q2);
+  // CHECK(*p_str == p2);
+  // CHECK(*q_str == q2);
+  return 0;
+}
+
+static void aes_ige_xcrypt(Slice aes_key, MutableSlice aes_iv, Slice from, MutableSlice to, bool encrypt_flag) {
+  CHECK(aes_key.size() == 32);
+  CHECK(aes_iv.size() == 16);
+  AES_KEY key;
+  int err;
+  if (encrypt_flag) {
+    err = AES_set_encrypt_key(aes_key.ubegin(), 256, &key);
+  } else {
+    err = AES_set_decrypt_key(aes_key.ubegin(), 256, &key);
+  }
+  LOG_IF(FATAL, err != 0);
+  CHECK(from.size() <= to.size());
+  AES_ige_encrypt(from.ubegin(), to.ubegin(), from.size(), &key, aes_iv.ubegin(), encrypt_flag);
+}
+
+void aes_ige_encrypt(Slice aes_key, MutableSlice aes_iv, Slice from, MutableSlice to) {
+  aes_ige_xcrypt(aes_key, aes_iv, from, to, true);
+}
+
+void aes_ige_decrypt(Slice aes_key, MutableSlice aes_iv, Slice from, MutableSlice to) {
+  aes_ige_xcrypt(aes_key, aes_iv, from, to, false);
+}
+
+static void aes_cbc_xcrypt(Slice aes_key, MutableSlice aes_iv, Slice from, MutableSlice to, bool encrypt_flag) {
+  CHECK(aes_key.size() == 32);
+  CHECK(aes_iv.size() == 16);
+  AES_KEY key;
+  int err;
+  if (encrypt_flag) {
+    err = AES_set_encrypt_key(aes_key.ubegin(), 256, &key);
+  } else {
+    err = AES_set_decrypt_key(aes_key.ubegin(), 256, &key);
+  }
+  LOG_IF(FATAL, err != 0);
+  CHECK(from.size() <= to.size());
+  AES_cbc_encrypt(from.ubegin(), to.ubegin(), from.size(), &key, aes_iv.ubegin(), encrypt_flag);
+}
+
+void aes_cbc_encrypt(Slice aes_key, MutableSlice aes_iv, Slice from, MutableSlice to) {
+  aes_cbc_xcrypt(aes_key, aes_iv, from, to, true);
+}
+
+void aes_cbc_decrypt(Slice aes_key, MutableSlice aes_iv, Slice from, MutableSlice to) {
+  aes_cbc_xcrypt(aes_key, aes_iv, from, to, false);
+}
+
+AesCbcState::AesCbcState(Slice key256, Slice iv128) : key_(key256), iv_(iv128) {
+  CHECK(key_.size() == 32);
+  CHECK(iv_.size() == 16);
+}
+
+void AesCbcState::encrypt(Slice from, MutableSlice to) {
+  ::td::aes_cbc_encrypt(key_.as_slice(), iv_.as_mutable_slice(), from, to);
+}
+void AesCbcState::decrypt(Slice from, MutableSlice to) {
+  ::td::aes_cbc_decrypt(key_.as_slice(), iv_.as_mutable_slice(), from, to);
+}
+
+class AesCtrState::Impl {
+ public:
+  Impl(Slice key, Slice iv) {
+    CHECK(key.size() == 32);
+    CHECK(iv.size() == 16);
+    static_assert(AES_BLOCK_SIZE == 16, "");
+    if (AES_set_encrypt_key(key.ubegin(), 256, &aes_key) < 0) {
+      LOG(FATAL) << "Failed to set encrypt key";
+    }
+    counter.as_mutable_slice().copy_from(as_slice(iv));
+    current_pos = 0;
+  }
+
+  void encrypt(Slice from, MutableSlice to) {
+    CHECK(to.size() >= from.size());
+    for (size_t i = 0; i < from.size(); i++) {
+      if (current_pos == 0) {
+        AES_encrypt(counter.as_slice().ubegin(), encrypted_counter.as_mutable_slice().ubegin(), &aes_key);
+        uint8 *ptr = counter.as_mutable_slice().ubegin();
+        for (int j = 15; j >= 0; j--) {
+          if (++ptr[j] != 0) {
+            break;
+          }
+        }
+      }
+      to[i] = static_cast<char>(from[i] ^ encrypted_counter[current_pos]);
+      current_pos = (current_pos + 1) & 15;
+    }
+  }
+
+ private:
+  AES_KEY aes_key;
+  SecureString counter{AES_BLOCK_SIZE};
+  SecureString encrypted_counter{AES_BLOCK_SIZE};
+  uint8 current_pos;
+};
+
+AesCtrState::AesCtrState() = default;
+AesCtrState::AesCtrState(AesCtrState &&from) = default;
+AesCtrState &AesCtrState::operator=(AesCtrState &&from) = default;
+AesCtrState::~AesCtrState() = default;
+
+void AesCtrState::init(Slice key, Slice iv) {
+  ctx_ = make_unique<AesCtrState::Impl>(key, iv);
+}
+
+void AesCtrState::encrypt(Slice from, MutableSlice to) {
+  ctx_->encrypt(from, to);
+}
+
+void AesCtrState::decrypt(Slice from, MutableSlice to) {
+  encrypt(from, to);  // it is the same as decrypt
+}
+
+void sha1(Slice data, unsigned char output[20]) {
+  auto result = SHA1(data.ubegin(), data.size(), output);
+  CHECK(result == output);
+}
+
+void sha256(Slice data, MutableSlice output) {
+  CHECK(output.size() >= 32);
+  auto result = SHA256(data.ubegin(), data.size(), output.ubegin());
+  CHECK(result == output.ubegin());
+}
+
+void sha512(Slice data, MutableSlice output) {
+  CHECK(output.size() >= 64);
+  auto result = SHA512(data.ubegin(), data.size(), output.ubegin());
+  CHECK(result == output.ubegin());
+}
+
+string sha256(Slice data) {
+  string result(32, '\0');
+  sha256(data, result);
+  return result;
+}
+
+string sha512(Slice data) {
+  string result(64, '\0');
+  sha512(data, result);
+  return result;
+}
+
+class Sha256State::Impl {
+ public:
+  SHA256_CTX ctx_;
+};
+
+Sha256State::Sha256State() = default;
+
+Sha256State::Sha256State(Sha256State &&other) {
+  impl_ = std::move(other.impl_);
+  is_inited_ = other.is_inited_;
+  other.is_inited_ = false;
+}
+
+Sha256State &Sha256State::operator=(Sha256State &&other) {
+  Sha256State copy(std::move(other));
+  using std::swap;
+  swap(impl_, copy.impl_);
+  swap(is_inited_, copy.is_inited_);
+  return *this;
+}
+
+Sha256State::~Sha256State() {
+  if (is_inited_) {
+    char result[32];
+    extract(MutableSlice{result, 32});
+    CHECK(!is_inited_);
+  }
+}
+
+void Sha256State::init() {
+  if (!impl_) {
+    impl_ = make_unique<Sha256State::Impl>();
+  }
+  CHECK(!is_inited_);
+  int err = SHA256_Init(&impl_->ctx_);
+  LOG_IF(FATAL, err != 1);
+  is_inited_ = true;
+}
+
+void Sha256State::feed(Slice data) {
+  CHECK(impl_);
+  CHECK(is_inited_);
+  int err = SHA256_Update(&impl_->ctx_, data.ubegin(), data.size());
+  LOG_IF(FATAL, err != 1);
+}
+
+void Sha256State::extract(MutableSlice output, bool destroy) {
+  CHECK(output.size() >= 32);
+  CHECK(impl_);
+  CHECK(is_inited_);
+  int err = SHA256_Final(output.ubegin(), &impl_->ctx_);
+  LOG_IF(FATAL, err != 1);
+  is_inited_ = false;
+  if (destroy) {
+    impl_.reset();
+  }
+}
+
+void md5(Slice input, MutableSlice output) {
+  CHECK(output.size() >= MD5_DIGEST_LENGTH);
+  auto result = MD5(input.ubegin(), input.size(), output.ubegin());
+  CHECK(result == output.ubegin());
+}
+
+static void pbkdf2_impl(Slice password, Slice salt, int iteration_count, MutableSlice dest, const EVP_MD *evp_md) {
+  CHECK(evp_md != nullptr);
+  int hash_size = EVP_MD_size(evp_md);
+  CHECK(dest.size() == static_cast<size_t>(hash_size));
+  CHECK(iteration_count > 0);
+#if OPENSSL_VERSION_NUMBER < 0x10000000L
+  HMAC_CTX ctx;
+  HMAC_CTX_init(&ctx);
+  unsigned char counter[4] = {0, 0, 0, 1};
+  int password_len = narrow_cast<int>(password.size());
+  HMAC_Init_ex(&ctx, password.data(), password_len, evp_md, nullptr);
+  HMAC_Update(&ctx, salt.ubegin(), narrow_cast<int>(salt.size()));
+  HMAC_Update(&ctx, counter, 4);
+  HMAC_Final(&ctx, dest.ubegin(), nullptr);
+  HMAC_CTX_cleanup(&ctx);
+
+  if (iteration_count > 1) {
+    CHECK(hash_size <= 64);
+    unsigned char buf[64];
+    std::copy(dest.ubegin(), dest.uend(), buf);
+    for (int iter = 1; iter < iteration_count; iter++) {
+      if (HMAC(evp_md, password.data(), password_len, buf, hash_size, buf, nullptr) == nullptr) {
+        LOG(FATAL) << "Failed to HMAC";
+      }
+      for (int i = 0; i < hash_size; i++) {
+        dest[i] ^= buf[i];
+      }
+    }
+  }
+#else
+  int err = PKCS5_PBKDF2_HMAC(password.data(), narrow_cast<int>(password.size()), salt.ubegin(),
+                              narrow_cast<int>(salt.size()), iteration_count, evp_md, narrow_cast<int>(dest.size()),
+                              dest.ubegin());
+  LOG_IF(FATAL, err != 1);
+#endif
+}
+
+void pbkdf2_sha256(Slice password, Slice salt, int iteration_count, MutableSlice dest) {
+  pbkdf2_impl(password, salt, iteration_count, dest, EVP_sha256());
+}
+
+void pbkdf2_sha512(Slice password, Slice salt, int iteration_count, MutableSlice dest) {
+  pbkdf2_impl(password, salt, iteration_count, dest, EVP_sha512());
+}
+
+void hmac_sha256(Slice key, Slice message, MutableSlice dest) {
+  CHECK(dest.size() == 256 / 8);
+  unsigned int len = 0;
+  auto result = HMAC(EVP_sha256(), key.ubegin(), narrow_cast<int>(key.size()), message.ubegin(),
+                     narrow_cast<int>(message.size()), dest.ubegin(), &len);
+  CHECK(result == dest.ubegin());
+  CHECK(len == dest.size());
+}
+
+void hmac_sha512(Slice key, Slice message, MutableSlice dest) {
+  CHECK(dest.size() == 512 / 8);
+  unsigned int len = 0;
+  auto result = HMAC(EVP_sha512(), key.ubegin(), narrow_cast<int>(key.size()), message.ubegin(),
+                     narrow_cast<int>(message.size()), dest.ubegin(), &len);
+  CHECK(result == dest.ubegin());
+  CHECK(len == dest.size());
+}
+
+static int get_evp_pkey_type(EVP_PKEY *pkey) {
+#if OPENSSL_VERSION_NUMBER < 0x10100000L
+  return EVP_PKEY_type(pkey->type);
+#else
+  return EVP_PKEY_base_id(pkey);
+#endif
+}
+
+Result<BufferSlice> rsa_encrypt_pkcs1_oaep(Slice public_key, Slice data) {
+  BIO *mem_bio = BIO_new_mem_buf(const_cast<void *>(static_cast<const void *>(public_key.data())),
+                                 narrow_cast<int>(public_key.size()));
+  SCOPE_EXIT {
+    BIO_vfree(mem_bio);
+  };
+
+  EVP_PKEY *pkey = PEM_read_bio_PUBKEY(mem_bio, nullptr, nullptr, nullptr);
+  if (!pkey) {
+    return Status::Error("Cannot read public key");
+  }
+  SCOPE_EXIT {
+    EVP_PKEY_free(pkey);
+  };
+  if (get_evp_pkey_type(pkey) != EVP_PKEY_RSA) {
+    return Status::Error("Wrong key type, expected RSA");
+  }
+
+#if OPENSSL_VERSION_NUMBER < 0x10000000L
+  RSA *rsa = pkey->pkey.rsa;
+  int outlen = RSA_size(rsa);
+  BufferSlice res(outlen);
+  if (RSA_public_encrypt(narrow_cast<int>(data.size()), const_cast<unsigned char *>(data.ubegin()),
+                         res.as_slice().ubegin(), rsa, RSA_PKCS1_OAEP_PADDING) != outlen) {
+#else
+  EVP_PKEY_CTX *ctx = EVP_PKEY_CTX_new(pkey, nullptr);
+  if (!ctx) {
+    return Status::Error("Cannot create EVP_PKEY_CTX");
+  }
+  SCOPE_EXIT {
+    EVP_PKEY_CTX_free(ctx);
+  };
+
+  if (EVP_PKEY_encrypt_init(ctx) <= 0) {
+    return Status::Error("Cannot init EVP_PKEY_CTX");
+  }
+  if (EVP_PKEY_CTX_set_rsa_padding(ctx, RSA_PKCS1_OAEP_PADDING) <= 0) {
+    return Status::Error("Cannot set RSA_PKCS1_OAEP padding in EVP_PKEY_CTX");
+  }
+
+  size_t outlen;
+  if (EVP_PKEY_encrypt(ctx, nullptr, &outlen, data.ubegin(), data.size()) <= 0) {
+    return Status::Error("Cannot calculate encrypted length");
+  }
+  BufferSlice res(outlen);
+  if (EVP_PKEY_encrypt(ctx, res.as_slice().ubegin(), &outlen, data.ubegin(), data.size()) <= 0) {
+#endif
+    return Status::Error("Cannot encrypt");
+  }
+  return std::move(res);
+}
+
+Result<BufferSlice> rsa_decrypt_pkcs1_oaep(Slice private_key, Slice data) {
+  BIO *mem_bio = BIO_new_mem_buf(const_cast<void *>(static_cast<const void *>(private_key.data())),
+                                 narrow_cast<int>(private_key.size()));
+  SCOPE_EXIT {
+    BIO_vfree(mem_bio);
+  };
+
+  EVP_PKEY *pkey = PEM_read_bio_PrivateKey(mem_bio, nullptr, nullptr, nullptr);
+  if (!pkey) {
+    return Status::Error("Cannot read private key");
+  }
+  SCOPE_EXIT {
+    EVP_PKEY_free(pkey);
+  };
+  if (get_evp_pkey_type(pkey) != EVP_PKEY_RSA) {
+    return Status::Error("Wrong key type, expected RSA");
+  }
+
+#if OPENSSL_VERSION_NUMBER < 0x10000000L
+  RSA *rsa = pkey->pkey.rsa;
+  size_t outlen = RSA_size(rsa);
+  BufferSlice res(outlen);
+  auto inlen = RSA_private_decrypt(narrow_cast<int>(data.size()), const_cast<unsigned char *>(data.ubegin()),
+                                   res.as_slice().ubegin(), rsa, RSA_PKCS1_OAEP_PADDING);
+  if (inlen == -1) {
+    return Status::Error("Cannot decrypt");
+  }
+  res.truncate(inlen);
+#else
+  EVP_PKEY_CTX *ctx = EVP_PKEY_CTX_new(pkey, nullptr);
+  if (!ctx) {
+    return Status::Error("Cannot create EVP_PKEY_CTX");
+  }
+  SCOPE_EXIT {
+    EVP_PKEY_CTX_free(ctx);
+  };
+
+  if (EVP_PKEY_decrypt_init(ctx) <= 0) {
+    return Status::Error("Cannot init EVP_PKEY_CTX");
+  }
+  if (EVP_PKEY_CTX_set_rsa_padding(ctx, RSA_PKCS1_OAEP_PADDING) <= 0) {
+    return Status::Error("Cannot set RSA_PKCS1_OAEP padding in EVP_PKEY_CTX");
+  }
+
+  size_t outlen;
+  if (EVP_PKEY_decrypt(ctx, nullptr, &outlen, data.ubegin(), data.size()) <= 0) {
+    return Status::Error("Cannot calculate decrypted length");
+  }
+  BufferSlice res(outlen);
+  if (EVP_PKEY_decrypt(ctx, res.as_slice().ubegin(), &outlen, data.ubegin(), data.size()) <= 0) {
+    return Status::Error("Cannot decrypt");
+  }
+#endif
+  return std::move(res);
+}
+
+#if OPENSSL_VERSION_NUMBER < 0x10100000L
+namespace {
+std::vector<RwMutex> &openssl_mutexes() {
+  static std::vector<RwMutex> mutexes(CRYPTO_num_locks());
+  return mutexes;
+}
+
+#if OPENSSL_VERSION_NUMBER >= 0x10000000L
+void openssl_threadid_callback(CRYPTO_THREADID *thread_id) {
+  static TD_THREAD_LOCAL int id;
+  CRYPTO_THREADID_set_pointer(thread_id, &id);
+}
+#endif
+
+void openssl_locking_function(int mode, int n, const char *file, int line) {
+  auto &mutexes = openssl_mutexes();
+  if (mode & CRYPTO_LOCK) {
+    if (mode & CRYPTO_READ) {
+      mutexes[n].lock_read_unsafe();
+    } else {
+      mutexes[n].lock_write_unsafe();
+    }
+  } else {
+    if (mode & CRYPTO_READ) {
+      mutexes[n].unlock_read_unsafe();
+    } else {
+      mutexes[n].unlock_write_unsafe();
+    }
+  }
+}
+}  // namespace
+#endif
+
+void init_openssl_threads() {
+#if OPENSSL_VERSION_NUMBER < 0x10100000L
+  static std::mutex init_mutex;
+  std::lock_guard<std::mutex> lock(init_mutex);
+  if (CRYPTO_get_locking_callback() == nullptr) {
+#if OPENSSL_VERSION_NUMBER >= 0x10000000L
+    CRYPTO_THREADID_set_callback(openssl_threadid_callback);
+#endif
+    CRYPTO_set_locking_callback(openssl_locking_function);
+  }
+#endif
+}
+#endif
+
+#if TD_HAVE_ZLIB
+uint32 crc32(Slice data) {
+  return static_cast<uint32>(::crc32(0, data.ubegin(), static_cast<uint32>(data.size())));
+}
+#endif
+
+#if TD_HAVE_CRC32C
+uint32 crc32c(Slice data) {
+  return crc32c::Crc32c(data.data(), data.size());
+}
+
+uint32 crc32c_extend(uint32 old_crc, Slice data) {
+  return crc32c::Extend(old_crc, data.ubegin(), data.size());
+}
+
+namespace {
+
+uint32 gf32_matrix_times(const uint32 *matrix, uint32 vector) {
+  uint32 sum = 0;
+  while (vector) {
+    if (vector & 1) {
+      sum ^= *matrix;
+    }
+    vector >>= 1;
+    matrix++;
+  }
+  return sum;
+}
+
+void gf32_matrix_square(uint32 *square, const uint32 *matrix) {
+  for (int n = 0; n < 32; n++) {
+    square[n] = gf32_matrix_times(matrix, matrix[n]);
+  }
+}
+
+}  // namespace
+
+uint32 crc32c_extend(uint32 old_crc, uint32 data_crc, size_t data_size) {
+  static uint32 power_buf_raw[1024];
+  static const uint32 *power_buf = [&] {
+    auto *buf = power_buf_raw;
+    buf[0] = 0x82F63B78u;
+    for (int n = 0; n < 31; n++) {
+      buf[n + 1] = 1u << n;
+    }
+    for (int n = 1; n < 32; n++) {
+      gf32_matrix_square(buf + (n << 5), buf + ((n - 1) << 5));
+    }
+    return buf;
+  }();
+
+  if (data_size == 0) {
+    return old_crc;
+  }
+
+  const uint32 *p = power_buf + 64;
+  do {
+    p += 32;
+    if (data_size & 1) {
+      old_crc = gf32_matrix_times(p, old_crc);
+    }
+    data_size >>= 1;
+  } while (data_size != 0);
+  return old_crc ^ data_crc;
+}
+
+#endif
+
+static const uint64 crc64_table[256] = {
+    0x0000000000000000, 0xb32e4cbe03a75f6f, 0xf4843657a840a05b, 0x47aa7ae9abe7ff34, 0x7bd0c384ff8f5e33,
+    0xc8fe8f3afc28015c, 0x8f54f5d357cffe68, 0x3c7ab96d5468a107, 0xf7a18709ff1ebc66, 0x448fcbb7fcb9e309,
+    0x0325b15e575e1c3d, 0xb00bfde054f94352, 0x8c71448d0091e255, 0x3f5f08330336bd3a, 0x78f572daa8d1420e,
+    0xcbdb3e64ab761d61, 0x7d9ba13851336649, 0xceb5ed8652943926, 0x891f976ff973c612, 0x3a31dbd1fad4997d,
+    0x064b62bcaebc387a, 0xb5652e02ad1b6715, 0xf2cf54eb06fc9821, 0x41e11855055bc74e, 0x8a3a2631ae2dda2f,
+    0x39146a8fad8a8540, 0x7ebe1066066d7a74, 0xcd905cd805ca251b, 0xf1eae5b551a2841c, 0x42c4a90b5205db73,
+    0x056ed3e2f9e22447, 0xb6409f5cfa457b28, 0xfb374270a266cc92, 0x48190ecea1c193fd, 0x0fb374270a266cc9,
+    0xbc9d3899098133a6, 0x80e781f45de992a1, 0x33c9cd4a5e4ecdce, 0x7463b7a3f5a932fa, 0xc74dfb1df60e6d95,
+    0x0c96c5795d7870f4, 0xbfb889c75edf2f9b, 0xf812f32ef538d0af, 0x4b3cbf90f69f8fc0, 0x774606fda2f72ec7,
+    0xc4684a43a15071a8, 0x83c230aa0ab78e9c, 0x30ec7c140910d1f3, 0x86ace348f355aadb, 0x3582aff6f0f2f5b4,
+    0x7228d51f5b150a80, 0xc10699a158b255ef, 0xfd7c20cc0cdaf4e8, 0x4e526c720f7dab87, 0x09f8169ba49a54b3,
+    0xbad65a25a73d0bdc, 0x710d64410c4b16bd, 0xc22328ff0fec49d2, 0x85895216a40bb6e6, 0x36a71ea8a7ace989,
+    0x0adda7c5f3c4488e, 0xb9f3eb7bf06317e1, 0xfe5991925b84e8d5, 0x4d77dd2c5823b7ba, 0x64b62bcaebc387a1,
+    0xd7986774e864d8ce, 0x90321d9d438327fa, 0x231c512340247895, 0x1f66e84e144cd992, 0xac48a4f017eb86fd,
+    0xebe2de19bc0c79c9, 0x58cc92a7bfab26a6, 0x9317acc314dd3bc7, 0x2039e07d177a64a8, 0x67939a94bc9d9b9c,
+    0xd4bdd62abf3ac4f3, 0xe8c76f47eb5265f4, 0x5be923f9e8f53a9b, 0x1c4359104312c5af, 0xaf6d15ae40b59ac0,
+    0x192d8af2baf0e1e8, 0xaa03c64cb957be87, 0xeda9bca512b041b3, 0x5e87f01b11171edc, 0x62fd4976457fbfdb,
+    0xd1d305c846d8e0b4, 0x96797f21ed3f1f80, 0x2557339fee9840ef, 0xee8c0dfb45ee5d8e, 0x5da24145464902e1,
+    0x1a083bacedaefdd5, 0xa9267712ee09a2ba, 0x955cce7fba6103bd, 0x267282c1b9c65cd2, 0x61d8f8281221a3e6,
+    0xd2f6b4961186fc89, 0x9f8169ba49a54b33, 0x2caf25044a02145c, 0x6b055fede1e5eb68, 0xd82b1353e242b407,
+    0xe451aa3eb62a1500, 0x577fe680b58d4a6f, 0x10d59c691e6ab55b, 0xa3fbd0d71dcdea34, 0x6820eeb3b6bbf755,
+    0xdb0ea20db51ca83a, 0x9ca4d8e41efb570e, 0x2f8a945a1d5c0861, 0x13f02d374934a966, 0xa0de61894a93f609,
+    0xe7741b60e174093d, 0x545a57dee2d35652, 0xe21ac88218962d7a, 0x5134843c1b317215, 0x169efed5b0d68d21,
+    0xa5b0b26bb371d24e, 0x99ca0b06e7197349, 0x2ae447b8e4be2c26, 0x6d4e3d514f59d312, 0xde6071ef4cfe8c7d,
+    0x15bb4f8be788911c, 0xa6950335e42fce73, 0xe13f79dc4fc83147, 0x521135624c6f6e28, 0x6e6b8c0f1807cf2f,
+    0xdd45c0b11ba09040, 0x9aefba58b0476f74, 0x29c1f6e6b3e0301b, 0xc96c5795d7870f42, 0x7a421b2bd420502d,
+    0x3de861c27fc7af19, 0x8ec62d7c7c60f076, 0xb2bc941128085171, 0x0192d8af2baf0e1e, 0x4638a2468048f12a,
+    0xf516eef883efae45, 0x3ecdd09c2899b324, 0x8de39c222b3eec4b, 0xca49e6cb80d9137f, 0x7967aa75837e4c10,
+    0x451d1318d716ed17, 0xf6335fa6d4b1b278, 0xb199254f7f564d4c, 0x02b769f17cf11223, 0xb4f7f6ad86b4690b,
+    0x07d9ba1385133664, 0x4073c0fa2ef4c950, 0xf35d8c442d53963f, 0xcf273529793b3738, 0x7c0979977a9c6857,
+    0x3ba3037ed17b9763, 0x888d4fc0d2dcc80c, 0x435671a479aad56d, 0xf0783d1a7a0d8a02, 0xb7d247f3d1ea7536,
+    0x04fc0b4dd24d2a59, 0x3886b22086258b5e, 0x8ba8fe9e8582d431, 0xcc0284772e652b05, 0x7f2cc8c92dc2746a,
+    0x325b15e575e1c3d0, 0x8175595b76469cbf, 0xc6df23b2dda1638b, 0x75f16f0cde063ce4, 0x498bd6618a6e9de3,
+    0xfaa59adf89c9c28c, 0xbd0fe036222e3db8, 0x0e21ac88218962d7, 0xc5fa92ec8aff7fb6, 0x76d4de52895820d9,
+    0x317ea4bb22bfdfed, 0x8250e80521188082, 0xbe2a516875702185, 0x0d041dd676d77eea, 0x4aae673fdd3081de,
+    0xf9802b81de97deb1, 0x4fc0b4dd24d2a599, 0xfceef8632775faf6, 0xbb44828a8c9205c2, 0x086ace348f355aad,
+    0x34107759db5dfbaa, 0x873e3be7d8faa4c5, 0xc094410e731d5bf1, 0x73ba0db070ba049e, 0xb86133d4dbcc19ff,
+    0x0b4f7f6ad86b4690, 0x4ce50583738cb9a4, 0xffcb493d702be6cb, 0xc3b1f050244347cc, 0x709fbcee27e418a3,
+    0x3735c6078c03e797, 0x841b8ab98fa4b8f8, 0xadda7c5f3c4488e3, 0x1ef430e13fe3d78c, 0x595e4a08940428b8,
+    0xea7006b697a377d7, 0xd60abfdbc3cbd6d0, 0x6524f365c06c89bf, 0x228e898c6b8b768b, 0x91a0c532682c29e4,
+    0x5a7bfb56c35a3485, 0xe955b7e8c0fd6bea, 0xaeffcd016b1a94de, 0x1dd181bf68bdcbb1, 0x21ab38d23cd56ab6,
+    0x9285746c3f7235d9, 0xd52f0e859495caed, 0x6601423b97329582, 0xd041dd676d77eeaa, 0x636f91d96ed0b1c5,
+    0x24c5eb30c5374ef1, 0x97eba78ec690119e, 0xab911ee392f8b099, 0x18bf525d915feff6, 0x5f1528b43ab810c2,
+    0xec3b640a391f4fad, 0x27e05a6e926952cc, 0x94ce16d091ce0da3, 0xd3646c393a29f297, 0x604a2087398eadf8,
+    0x5c3099ea6de60cff, 0xef1ed5546e415390, 0xa8b4afbdc5a6aca4, 0x1b9ae303c601f3cb, 0x56ed3e2f9e224471,
+    0xe5c372919d851b1e, 0xa26908783662e42a, 0x114744c635c5bb45, 0x2d3dfdab61ad1a42, 0x9e13b115620a452d,
+    0xd9b9cbfcc9edba19, 0x6a978742ca4ae576, 0xa14cb926613cf817, 0x1262f598629ba778, 0x55c88f71c97c584c,
+    0xe6e6c3cfcadb0723, 0xda9c7aa29eb3a624, 0x69b2361c9d14f94b, 0x2e184cf536f3067f, 0x9d36004b35545910,
+    0x2b769f17cf112238, 0x9858d3a9ccb67d57, 0xdff2a94067518263, 0x6cdce5fe64f6dd0c, 0x50a65c93309e7c0b,
+    0xe388102d33392364, 0xa4226ac498dedc50, 0x170c267a9b79833f, 0xdcd7181e300f9e5e, 0x6ff954a033a8c131,
+    0x28532e49984f3e05, 0x9b7d62f79be8616a, 0xa707db9acf80c06d, 0x14299724cc279f02, 0x5383edcd67c06036,
+    0xe0ada17364673f59};
+
+static uint64 crc64_partial(Slice data, uint64 crc) {
+  const char *p = data.begin();
+  for (auto len = data.size(); len > 0; len--) {
+    crc = crc64_table[(crc ^ *p++) & 0xff] ^ (crc >> 8);
+  }
+  return crc;
+}
+
+uint64 crc64(Slice data) {
+  return crc64_partial(data, static_cast<uint64>(-1)) ^ static_cast<uint64>(-1);
+}
+
+static const uint16 crc16_table[256] = {
+    0x0000, 0x1021, 0x2042, 0x3063, 0x4084, 0x50a5, 0x60c6, 0x70e7, 0x8108, 0x9129, 0xa14a, 0xb16b, 0xc18c, 0xd1ad,
+    0xe1ce, 0xf1ef, 0x1231, 0x0210, 0x3273, 0x2252, 0x52b5, 0x4294, 0x72f7, 0x62d6, 0x9339, 0x8318, 0xb37b, 0xa35a,
+    0xd3bd, 0xc39c, 0xf3ff, 0xe3de, 0x2462, 0x3443, 0x0420, 0x1401, 0x64e6, 0x74c7, 0x44a4, 0x5485, 0xa56a, 0xb54b,
+    0x8528, 0x9509, 0xe5ee, 0xf5cf, 0xc5ac, 0xd58d, 0x3653, 0x2672, 0x1611, 0x0630, 0x76d7, 0x66f6, 0x5695, 0x46b4,
+    0xb75b, 0xa77a, 0x9719, 0x8738, 0xf7df, 0xe7fe, 0xd79d, 0xc7bc, 0x48c4, 0x58e5, 0x6886, 0x78a7, 0x0840, 0x1861,
+    0x2802, 0x3823, 0xc9cc, 0xd9ed, 0xe98e, 0xf9af, 0x8948, 0x9969, 0xa90a, 0xb92b, 0x5af5, 0x4ad4, 0x7ab7, 0x6a96,
+    0x1a71, 0x0a50, 0x3a33, 0x2a12, 0xdbfd, 0xcbdc, 0xfbbf, 0xeb9e, 0x9b79, 0x8b58, 0xbb3b, 0xab1a, 0x6ca6, 0x7c87,
+    0x4ce4, 0x5cc5, 0x2c22, 0x3c03, 0x0c60, 0x1c41, 0xedae, 0xfd8f, 0xcdec, 0xddcd, 0xad2a, 0xbd0b, 0x8d68, 0x9d49,
+    0x7e97, 0x6eb6, 0x5ed5, 0x4ef4, 0x3e13, 0x2e32, 0x1e51, 0x0e70, 0xff9f, 0xefbe, 0xdfdd, 0xcffc, 0xbf1b, 0xaf3a,
+    0x9f59, 0x8f78, 0x9188, 0x81a9, 0xb1ca, 0xa1eb, 0xd10c, 0xc12d, 0xf14e, 0xe16f, 0x1080, 0x00a1, 0x30c2, 0x20e3,
+    0x5004, 0x4025, 0x7046, 0x6067, 0x83b9, 0x9398, 0xa3fb, 0xb3da, 0xc33d, 0xd31c, 0xe37f, 0xf35e, 0x02b1, 0x1290,
+    0x22f3, 0x32d2, 0x4235, 0x5214, 0x6277, 0x7256, 0xb5ea, 0xa5cb, 0x95a8, 0x8589, 0xf56e, 0xe54f, 0xd52c, 0xc50d,
+    0x34e2, 0x24c3, 0x14a0, 0x0481, 0x7466, 0x6447, 0x5424, 0x4405, 0xa7db, 0xb7fa, 0x8799, 0x97b8, 0xe75f, 0xf77e,
+    0xc71d, 0xd73c, 0x26d3, 0x36f2, 0x0691, 0x16b0, 0x6657, 0x7676, 0x4615, 0x5634, 0xd94c, 0xc96d, 0xf90e, 0xe92f,
+    0x99c8, 0x89e9, 0xb98a, 0xa9ab, 0x5844, 0x4865, 0x7806, 0x6827, 0x18c0, 0x08e1, 0x3882, 0x28a3, 0xcb7d, 0xdb5c,
+    0xeb3f, 0xfb1e, 0x8bf9, 0x9bd8, 0xabbb, 0xbb9a, 0x4a75, 0x5a54, 0x6a37, 0x7a16, 0x0af1, 0x1ad0, 0x2ab3, 0x3a92,
+    0xfd2e, 0xed0f, 0xdd6c, 0xcd4d, 0xbdaa, 0xad8b, 0x9de8, 0x8dc9, 0x7c26, 0x6c07, 0x5c64, 0x4c45, 0x3ca2, 0x2c83,
+    0x1ce0, 0x0cc1, 0xef1f, 0xff3e, 0xcf5d, 0xdf7c, 0xaf9b, 0xbfba, 0x8fd9, 0x9ff8, 0x6e17, 0x7e36, 0x4e55, 0x5e74,
+    0x2e93, 0x3eb2, 0x0ed1, 0x1ef0};
+
+uint16 crc16(Slice data) {
+  uint32 crc = 0;
+  for (auto c : data) {
+    auto t = (static_cast<unsigned char>(c) ^ (crc >> 8)) & 0xff;
+    crc = crc16_table[t] ^ (crc << 8);
+  }
+  return static_cast<uint16>(crc);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/crypto.h b/submodules/ton/tonlib-src/tdutils/td/utils/crypto.h
new file mode 100644
index 0000000000..3cc0e9ab2d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/crypto.h
@@ -0,0 +1,133 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/buffer.h"
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+#include "td/utils/SharedSlice.h"
+#include "td/utils/Status.h"
+
+namespace td {
+
+uint64 pq_factorize(uint64 pq);
+
+#if TD_HAVE_OPENSSL
+void init_crypto();
+
+int pq_factorize(Slice pq_str, string *p_str, string *q_str);
+
+void aes_ige_encrypt(Slice aes_key, MutableSlice aes_iv, Slice from, MutableSlice to);
+void aes_ige_decrypt(Slice aes_key, MutableSlice aes_iv, Slice from, MutableSlice to);
+
+void aes_cbc_encrypt(Slice aes_key, MutableSlice aes_iv, Slice from, MutableSlice to);
+void aes_cbc_decrypt(Slice aes_key, MutableSlice aes_iv, Slice from, MutableSlice to);
+
+class AesCtrState {
+ public:
+  AesCtrState();
+  AesCtrState(const AesCtrState &from) = delete;
+  AesCtrState &operator=(const AesCtrState &from) = delete;
+  AesCtrState(AesCtrState &&from);
+  AesCtrState &operator=(AesCtrState &&from);
+  ~AesCtrState();
+
+  void init(Slice key, Slice iv);
+
+  void encrypt(Slice from, MutableSlice to);
+
+  void decrypt(Slice from, MutableSlice to);
+
+ private:
+  class Impl;
+  unique_ptr<Impl> ctx_;
+};
+
+class AesCbcState {
+ public:
+  AesCbcState(Slice key256, Slice iv128);
+
+  void encrypt(Slice from, MutableSlice to);
+  void decrypt(Slice from, MutableSlice to);
+
+ private:
+  SecureString key_;
+  SecureString iv_;
+};
+
+void sha1(Slice data, unsigned char output[20]);
+
+void sha256(Slice data, MutableSlice output);
+
+void sha512(Slice data, MutableSlice output);
+
+string sha256(Slice data) TD_WARN_UNUSED_RESULT;
+
+string sha512(Slice data) TD_WARN_UNUSED_RESULT;
+
+class Sha256State {
+ public:
+  Sha256State();
+  Sha256State(const Sha256State &other) = delete;
+  Sha256State &operator=(const Sha256State &other) = delete;
+  Sha256State(Sha256State &&other);
+  Sha256State &operator=(Sha256State &&other);
+  ~Sha256State();
+
+  void init();
+
+  void feed(Slice data);
+
+  void extract(MutableSlice dest, bool destroy = false);
+
+ private:
+  class Impl;
+  unique_ptr<Impl> impl_;
+  bool is_inited_ = false;
+};
+
+void md5(Slice input, MutableSlice output);
+
+void pbkdf2_sha256(Slice password, Slice salt, int iteration_count, MutableSlice dest);
+void pbkdf2_sha512(Slice password, Slice salt, int iteration_count, MutableSlice dest);
+
+void hmac_sha256(Slice key, Slice message, MutableSlice dest);
+void hmac_sha512(Slice key, Slice message, MutableSlice dest);
+
+// Interface may be improved
+Result<BufferSlice> rsa_encrypt_pkcs1_oaep(Slice public_key, Slice data);
+Result<BufferSlice> rsa_decrypt_pkcs1_oaep(Slice private_key, Slice data);
+
+void init_openssl_threads();
+#endif
+
+#if TD_HAVE_ZLIB
+uint32 crc32(Slice data);
+#endif
+
+#if TD_HAVE_CRC32C
+uint32 crc32c(Slice data);
+uint32 crc32c_extend(uint32 old_crc, Slice data);
+uint32 crc32c_extend(uint32 old_crc, uint32 new_crc, size_t data_size);
+#endif
+
+uint64 crc64(Slice data);
+uint16 crc16(Slice data);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/filesystem.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/filesystem.cpp
new file mode 100644
index 0000000000..9ee0cf615f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/filesystem.cpp
@@ -0,0 +1,205 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/filesystem.h"
+
+#include "td/utils/buffer.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/PathView.h"
+#include "td/utils/port/FileFd.h"
+#include "td/utils/port/path.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+#include "td/utils/unicode.h"
+#include "td/utils/utf8.h"
+
+namespace td {
+
+namespace {
+
+template <class T>
+T create_empty(size_t size);
+
+template <>
+string create_empty<string>(size_t size) {
+  return string(size, '\0');
+}
+
+template <>
+BufferSlice create_empty<BufferSlice>(size_t size) {
+  return BufferSlice{size};
+}
+template <>
+SecureString create_empty<SecureString>(size_t size) {
+  return SecureString{size};
+}
+
+template <class T>
+Result<T> read_file_impl(CSlice path, int64 size, int64 offset) {
+  TRY_RESULT(from_file, FileFd::open(path, FileFd::Read));
+  if (size == -1) {
+    TRY_RESULT(file_size, from_file.get_size());
+    size = file_size;
+  }
+  if (size < 0) {
+    return Status::Error("Failed to read file: invalid size");
+  }
+  if (offset < 0 || offset > size) {
+    return Status::Error("Failed to read file: invalid offset");
+  }
+  size -= offset;
+  auto content = create_empty<T>(narrow_cast<size_t>(size));
+  TRY_RESULT(got_size, from_file.pread(as_mutable_slice(content), offset));
+  if (got_size != static_cast<size_t>(size)) {
+    return Status::Error("Failed to read file");
+  }
+  from_file.close();
+  return std::move(content);
+}
+
+}  // namespace
+
+Result<BufferSlice> read_file(CSlice path, int64 size, int64 offset) {
+  return read_file_impl<BufferSlice>(path, size, offset);
+}
+
+Result<string> read_file_str(CSlice path, int64 size, int64 offset) {
+  return read_file_impl<string>(path, size, offset);
+}
+
+Result<SecureString> read_file_secure(CSlice path, int64 size, int64 offset) {
+  return read_file_impl<SecureString>(path, size, offset);
+}
+
+// Very straightforward function. Don't expect much of it.
+Status copy_file(CSlice from, CSlice to, int64 size) {
+  TRY_RESULT(content, read_file(from, size));
+  return write_file(to, content.as_slice());
+}
+
+Status write_file(CSlice to, Slice data, WriteFileOptions options) {
+  auto size = data.size();
+  TRY_RESULT(to_file, FileFd::open(to, FileFd::Truncate | FileFd::Create | FileFd::Write));
+  if (options.need_lock) {
+    TRY_STATUS(to_file.lock(FileFd::LockFlags::Write, to.str(), 10));
+    TRY_STATUS(to_file.truncate_to_current_position(0));
+  }
+  TRY_RESULT(written, to_file.write(data));
+  if (written != size) {
+    return Status::Error(PSLICE() << "Failed to write file: written " << written << " bytes instead of " << size);
+  }
+  if (options.need_sync) {
+    TRY_STATUS(to_file.sync());
+  }
+  if (options.need_lock) {
+    to_file.lock(FileFd::LockFlags::Unlock, to.str(), 10).ignore();
+  }
+  to_file.close();
+  return Status::OK();
+}
+
+static string clean_filename_part(Slice name, int max_length) {
+  auto is_ok = [](uint32 code) {
+    if (code < 32) {
+      return false;
+    }
+    if (code < 127) {
+      switch (code) {
+        case '<':
+        case '>':
+        case ':':
+        case '"':
+        case '/':
+        case '\\':
+        case '|':
+        case '?':
+        case '*':
+        case '&':
+        case '`':
+        case '\'':
+          return false;
+        default:
+          return true;
+      }
+    }
+    auto category = get_unicode_simple_category(code);
+
+    return category == UnicodeSimpleCategory::Letter || category == UnicodeSimpleCategory::DecimalNumber ||
+           category == UnicodeSimpleCategory::Number;
+  };
+
+  std::string new_name;
+  int size = 0;
+  for (auto *it = name.ubegin(); it != name.uend() && size < max_length;) {
+    uint32 code;
+    it = next_utf8_unsafe(it, &code, "clean_filename_part");
+    if (!is_ok(code)) {
+      if (prepare_search_character(code) == 0) {
+        continue;
+      }
+      code = ' ';
+    }
+    if (new_name.empty() && (code == ' ' || code == '.')) {
+      continue;
+    }
+    append_utf8_character(new_name, code);
+    size++;
+  }
+
+  while (!new_name.empty() && (new_name.back() == ' ' || new_name.back() == '.')) {
+    new_name.pop_back();
+  }
+  return new_name;
+}
+
+string clean_filename(CSlice name) {
+  if (!check_utf8(name)) {
+    return {};
+  }
+
+  PathView path_view(name);
+  auto filename = clean_filename_part(path_view.file_stem(), 60);
+  auto extension = clean_filename_part(path_view.extension(), 20);
+  if (!extension.empty()) {
+    if (filename.empty()) {
+      filename = std::move(extension);
+    } else {
+      filename.reserve(filename.size() + 1 + extension.size());
+      filename += '.';
+      filename += extension;
+    }
+  }
+
+  return filename;
+}
+
+Status atomic_write_file(CSlice path, Slice data, CSlice path_tmp) {
+  string path_tmp_buf;
+  if (path_tmp.empty()) {
+    path_tmp_buf = path.str() + ".tmp";
+    path_tmp = path_tmp_buf;
+  }
+
+  WriteFileOptions options;
+  options.need_sync = true;
+  options.need_lock = true;
+  TRY_STATUS(write_file(path_tmp, data, options));
+  return rename(path_tmp, path);
+}
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/filesystem.h b/submodules/ton/tonlib-src/tdutils/td/utils/filesystem.h
new file mode 100644
index 0000000000..a0b36e53bc
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/filesystem.h
@@ -0,0 +1,46 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/buffer.h"
+#include "td/utils/Slice.h"
+#include "td/utils/SharedSlice.h"
+#include "td/utils/Status.h"
+
+namespace td {
+
+Result<BufferSlice> read_file(CSlice path, int64 size = -1, int64 offset = 0);
+Result<string> read_file_str(CSlice path, int64 size = -1, int64 offset = 0);
+Result<SecureString> read_file_secure(CSlice path, int64 size = -1, int64 offset = 0);
+
+Status copy_file(CSlice from, CSlice to, int64 size = -1) TD_WARN_UNUSED_RESULT;
+
+struct WriteFileOptions {
+  bool need_sync = true;
+  bool need_lock = true;
+};
+Status write_file(CSlice to, Slice data, WriteFileOptions options = {}) TD_WARN_UNUSED_RESULT;
+
+string clean_filename(CSlice name);
+
+// write file and ensure that it either fully overriden with new data, or left intact.
+// Uses path_tmp to temporary storat data, than calls rename
+Status atomic_write_file(CSlice path, Slice data, CSlice path_tmp = {});
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/find_boundary.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/find_boundary.cpp
new file mode 100644
index 0000000000..632af14eb6
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/find_boundary.cpp
@@ -0,0 +1,63 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/find_boundary.h"
+
+#include <cstring>
+
+namespace td {
+
+bool find_boundary(ChainBufferReader range, Slice boundary, size_t &already_read) {
+  range.advance(already_read);
+
+  const int MAX_BOUNDARY_LENGTH = 70;
+  CHECK(boundary.size() <= MAX_BOUNDARY_LENGTH + 4);
+  while (!range.empty()) {
+    Slice ready = range.prepare_read();
+    if (ready[0] == boundary[0]) {
+      if (range.size() < boundary.size()) {
+        return false;
+      }
+      auto save_range = range.clone();
+      char x[MAX_BOUNDARY_LENGTH + 4];
+      range.advance(boundary.size(), {x, sizeof(x)});
+      if (Slice(x, boundary.size()) == boundary) {
+        return true;
+      }
+
+      // not a boundary, restoring previous state and skip one symbol
+      range = std::move(save_range);
+      range.advance(1);
+      already_read++;
+    } else {
+      const char *ptr = static_cast<const char *>(std::memchr(ready.data(), boundary[0], ready.size()));
+      size_t shift;
+      if (ptr == nullptr) {
+        shift = ready.size();
+      } else {
+        shift = ptr - ready.data();
+      }
+      already_read += shift;
+      range.advance(shift);
+    }
+  }
+
+  return false;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/find_boundary.h b/submodules/ton/tonlib-src/tdutils/td/utils/find_boundary.h
new file mode 100644
index 0000000000..e7a978f86d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/find_boundary.h
@@ -0,0 +1,29 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/buffer.h"
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+
+namespace td {
+
+bool find_boundary(ChainBufferReader range, Slice boundary, size_t &already_read);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/format.h b/submodules/ton/tonlib-src/tdutils/td/utils/format.h
new file mode 100644
index 0000000000..3d9cdda563
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/format.h
@@ -0,0 +1,337 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/invoke.h"  // for tuple_for_each
+#include "td/utils/Slice.h"
+#include "td/utils/StringBuilder.h"
+
+#include <tuple>
+#include <utility>
+
+namespace td {
+namespace format {
+/*** HexDump ***/
+template <std::size_t size, bool is_reversed = true>
+struct HexDumpSize {
+  const unsigned char *data;
+};
+
+inline char hex_digit(int x) {
+  return "0123456789abcdef"[x];
+}
+
+template <std::size_t size, bool is_reversed>
+StringBuilder &operator<<(StringBuilder &builder, const HexDumpSize<size, is_reversed> &dump) {
+  const unsigned char *ptr = dump.data;
+  // TODO: append unsafe
+  for (std::size_t i = 0; i < size; i++) {
+    int xy = ptr[is_reversed ? size - 1 - i : i];
+    int x = xy >> 4;
+    int y = xy & 15;
+    builder << hex_digit(x) << hex_digit(y);
+  }
+  return builder;
+}
+
+template <std::size_t align>
+struct HexDumpSlice {
+  Slice slice;
+};
+
+template <std::size_t align>
+StringBuilder &operator<<(StringBuilder &builder, const HexDumpSlice<align> &dump) {
+  const auto str = dump.slice;
+  const auto size = str.size();
+
+  builder << '\n';
+
+  const std::size_t first_part_size = size % align;
+  if (first_part_size) {
+    builder << HexDumpSlice<1>{str.substr(0, first_part_size)} << '\n';
+  }
+
+  for (std::size_t i = first_part_size; i < size; i += align) {
+    builder << HexDumpSize<align>{str.ubegin() + i};
+
+    if (((i / align) & 15) == 15 || i + align >= size) {
+      builder << '\n';
+    } else {
+      builder << ' ';
+    }
+  }
+
+  return builder;
+}
+
+inline StringBuilder &operator<<(StringBuilder &builder, const HexDumpSlice<0> &dump) {
+  auto size = dump.slice.size();
+  const uint8 *ptr = dump.slice.ubegin();
+  for (size_t i = 0; i < size; i++) {
+    builder << HexDumpSize<1>{ptr + i};
+  }
+  return builder;
+}
+
+template <std::size_t align>
+HexDumpSlice<align> as_hex_dump(Slice slice) {
+  return HexDumpSlice<align>{slice};
+}
+
+template <std::size_t align>
+HexDumpSlice<align> as_hex_dump(MutableSlice slice) {
+  return HexDumpSlice<align>{slice};
+}
+
+template <std::size_t align, class T>
+HexDumpSlice<align> as_hex_dump(const T &value) {
+  return HexDumpSlice<align>{Slice(&value, sizeof(value))};
+}
+template <class T>
+HexDumpSize<sizeof(T), true> as_hex_dump(const T &value) {
+  return HexDumpSize<sizeof(T), true>{reinterpret_cast<const unsigned char *>(&value)};
+}
+
+/*** Hex ***/
+template <class T>
+struct Hex {
+  const T &value;
+};
+
+template <class T>
+Hex<T> as_hex(const T &value) {
+  return Hex<T>{value};
+}
+
+template <class T>
+StringBuilder &operator<<(StringBuilder &builder, const Hex<T> &hex) {
+  builder << "0x" << as_hex_dump(hex.value);
+  return builder;
+}
+
+/*** Binary ***/
+template <class T>
+struct Binary {
+  const T &value;
+};
+
+template <class T>
+Binary<T> as_binary(const T &value) {
+  return Binary<T>{value};
+}
+
+template <class T>
+StringBuilder &operator<<(StringBuilder &builder, const Binary<T> &hex) {
+  for (size_t i = 0; i < sizeof(T) * 8; i++) {
+    builder << ((hex.value >> i) & 1 ? '1' : '0');
+  }
+  return builder;
+}
+
+/*** Escaped ***/
+struct Escaped {
+  Slice str;
+};
+
+inline StringBuilder &operator<<(StringBuilder &builder, const Escaped &escaped) {
+  Slice str = escaped.str;
+  for (unsigned char c : str) {
+    if (c > 31 && c < 127 && c != '"' && c != '\\') {
+      builder << static_cast<char>(c);
+    } else {
+      const char *oct = "01234567";
+      builder << '\\' << oct[c >> 6] << oct[(c >> 3) & 7] << oct[c & 7];
+    }
+  }
+  return builder;
+}
+
+inline Escaped escaped(Slice slice) {
+  return Escaped{slice};
+}
+
+/*** Time to string ***/
+struct Time {
+  double seconds_;
+};
+
+inline StringBuilder &operator<<(StringBuilder &logger, Time t) {
+  struct NamedValue {
+    const char *name;
+    double value;
+  };
+
+  static constexpr NamedValue durations[] = {{"ns", 1e-9}, {"us", 1e-6}, {"ms", 1e-3}, {"s", 1}};
+  static constexpr size_t durations_n = sizeof(durations) / sizeof(NamedValue);
+
+  size_t i = 0;
+  while (i + 1 < durations_n && t.seconds_ > 10 * durations[i + 1].value) {
+    i++;
+  }
+  logger << StringBuilder::FixedDouble(t.seconds_ / durations[i].value, 1) << durations[i].name;
+  return logger;
+}
+
+inline Time as_time(double seconds) {
+  return Time{seconds};
+}
+
+/*** Size to string ***/
+struct Size {
+  uint64 size_;
+};
+
+inline StringBuilder &operator<<(StringBuilder &logger, Size t) {
+  struct NamedValue {
+    const char *name;
+    uint64 value;
+  };
+
+  static constexpr NamedValue sizes[] = {{"B", 1}, {"kB", 1 << 10}, {"MB", 1 << 20}, {"GB", 1 << 30}};
+  static constexpr size_t sizes_n = sizeof(sizes) / sizeof(NamedValue);
+
+  size_t i = 0;
+  while (i + 1 < sizes_n && t.size_ > 10 * sizes[i + 1].value) {
+    i++;
+  }
+  logger << t.size_ / sizes[i].value << sizes[i].name;
+  return logger;
+}
+
+inline Size as_size(uint64 size) {
+  return Size{size};
+}
+
+/*** Array to string ***/
+template <class ArrayT>
+struct Array {
+  const ArrayT &ref;
+};
+
+template <class ArrayT>
+StringBuilder &operator<<(StringBuilder &stream, const Array<ArrayT> &array) {
+  bool first = true;
+  stream << Slice("{");
+  for (auto &x : array.ref) {
+    if (!first) {
+      stream << Slice(", ");
+    }
+    stream << x;
+    first = false;
+  }
+  return stream << Slice("}");
+}
+
+template <class ArrayT>
+Array<ArrayT> as_array(const ArrayT &array) {
+  return Array<ArrayT>{array};
+}
+
+/*** Tagged ***/
+template <class ValueT>
+struct Tagged {
+  Slice tag;
+  const ValueT &ref;
+};
+
+template <class ValueT>
+StringBuilder &operator<<(StringBuilder &stream, const Tagged<ValueT> &tagged) {
+  return stream << "[" << tagged.tag << ":" << tagged.ref << "]";
+}
+
+template <class ValueT>
+Tagged<ValueT> tag(Slice tag, const ValueT &ref) {
+  return Tagged<ValueT>{tag, ref};
+}
+
+/*** Cond ***/
+inline StringBuilder &operator<<(StringBuilder &sb, Unit) {
+  return sb;
+}
+
+template <class TrueT, class FalseT>
+struct Cond {
+  bool flag;
+  const TrueT &on_true;
+  const FalseT &on_false;
+};
+
+template <class TrueT, class FalseT>
+StringBuilder &operator<<(StringBuilder &sb, const Cond<TrueT, FalseT> &cond) {
+  if (cond.flag) {
+    return sb << cond.on_true;
+  } else {
+    return sb << cond.on_false;
+  }
+}
+
+template <class TrueT, class FalseT = Unit>
+Cond<TrueT, FalseT> cond(bool flag, const TrueT &on_true, const FalseT &on_false = FalseT()) {
+  return Cond<TrueT, FalseT>{flag, on_true, on_false};
+}
+
+/*** Concat ***/
+template <class T>
+struct Concat {
+  T args;
+};
+
+template <class T>
+StringBuilder &operator<<(StringBuilder &sb, const Concat<T> &concat) {
+  tuple_for_each(concat.args, [&sb](auto &x) { sb << x; });
+  return sb;
+}
+
+template <class... ArgsT>
+auto concat(const ArgsT &... args) {
+  return Concat<decltype(std::tie(args...))>{std::tie(args...)};
+}
+
+template <class F>
+struct Lambda {
+  const F &f;
+};
+
+template <class F>
+StringBuilder &operator<<(StringBuilder &sb, const Lambda<F> &f) {
+  f.f(sb);
+  return sb;
+}
+
+template <class LambdaT>
+Lambda<LambdaT> lambda(const LambdaT &lambda) {
+  return Lambda<LambdaT>{lambda};
+}
+
+}  // namespace format
+
+using format::tag;
+
+template <class A, class B>
+StringBuilder &operator<<(StringBuilder &sb, const std::pair<A, B> &p) {
+  return sb << "[" << p.first << ";" << p.second << "]";
+}
+
+template <class T>
+StringBuilder &operator<<(StringBuilder &stream, const vector<T> &vec) {
+  return stream << format::as_array(vec);
+}
+
+}  // namespace td
diff --git a/submodules/MtProtoKit/TON/iOS/include/td/utils/int_types.h b/submodules/ton/tonlib-src/tdutils/td/utils/int_types.h
similarity index 100%
rename from submodules/MtProtoKit/TON/iOS/include/td/utils/int_types.h
rename to submodules/ton/tonlib-src/tdutils/td/utils/int_types.h
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/invoke.h b/submodules/ton/tonlib-src/tdutils/td/utils/invoke.h
new file mode 100644
index 0000000000..dad0c238d8
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/invoke.h
@@ -0,0 +1,222 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+#include <functional>
+#include <tuple>
+#include <type_traits>
+#include <utility>
+
+namespace td {
+
+namespace detail {
+
+template <std::size_t... S>
+struct IntSeq {};
+
+template <std::size_t L, std::size_t N, std::size_t... S>
+struct IntSeqGen : IntSeqGen<L, N - 1, L + N - 1, S...> {};
+
+template <std::size_t L, std::size_t... S>
+struct IntSeqGen<L, 0, S...> {
+  using type = IntSeq<S...>;
+};
+
+template <bool... Args>
+class LogicAndImpl {};
+
+template <bool Res, bool X, bool... Args>
+class LogicAndImpl<Res, X, Args...> {
+ public:
+  static constexpr bool value = LogicAndImpl<(Res && X), Args...>::value;
+};
+
+template <bool Res>
+class LogicAndImpl<Res> {
+ public:
+  static constexpr bool value = Res;
+};
+
+template <std::size_t N>
+using IntRange = typename IntSeqGen<0, N>::type;
+
+template <class T>
+struct is_reference_wrapper : std::false_type {};
+
+template <class U>
+struct is_reference_wrapper<std::reference_wrapper<U>> : std::true_type {};
+
+template <class Base, class T, class Derived, class... Args>
+auto invoke_impl(T Base::*pmf, Derived &&ref,
+                 Args &&... args) noexcept(noexcept((std::forward<Derived>(ref).*pmf)(std::forward<Args>(args)...)))
+    -> std::enable_if_t<std::is_function<T>::value && std::is_base_of<Base, std::decay<Derived>>::value,
+                        decltype((std::forward<Derived>(ref).*pmf)(std::forward<Args>(args)...))> {
+  return (std::forward<Derived>(ref).*pmf)(std::forward<Args>(args)...);
+}
+
+template <class Base, class T, class RefWrap, class... Args>
+auto invoke_impl(T Base::*pmf, RefWrap &&ref,
+                 Args &&... args) noexcept(noexcept((ref.get().*pmf)(std::forward<Args>(args)...)))
+    -> std::enable_if_t<std::is_function<T>::value && is_reference_wrapper<std::decay_t<RefWrap>>::value,
+                        decltype((ref.get().*pmf)(std::forward<Args>(args)...))>
+
+{
+  return (ref.get().*pmf)(std::forward<Args>(args)...);
+}
+
+template <class Base, class T, class Pointer, class... Args>
+auto invoke_impl(T Base::*pmf, Pointer &&ptr,
+                 Args &&... args) noexcept(noexcept(((*std::forward<Pointer>(ptr)).*pmf)(std::forward<Args>(args)...)))
+    -> std::enable_if_t<std::is_function<T>::value && !is_reference_wrapper<std::decay_t<Pointer>>::value &&
+                            !std::is_base_of<Base, std::decay_t<Pointer>>::value,
+                        decltype(((*std::forward<Pointer>(ptr)).*pmf)(std::forward<Args>(args)...))> {
+  return ((*std::forward<Pointer>(ptr)).*pmf)(std::forward<Args>(args)...);
+}
+
+template <class Base, class T, class Derived>
+auto invoke_impl(T Base::*pmd, Derived &&ref) noexcept(noexcept(std::forward<Derived>(ref).*pmd))
+    -> std::enable_if_t<!std::is_function<T>::value && std::is_base_of<Base, std::decay_t<Derived>>::value,
+                        decltype(std::forward<Derived>(ref).*pmd)> {
+  return std::forward<Derived>(ref).*pmd;
+}
+
+template <class Base, class T, class RefWrap>
+auto invoke_impl(T Base::*pmd, RefWrap &&ref) noexcept(noexcept(ref.get().*pmd))
+    -> std::enable_if_t<!std::is_function<T>::value && is_reference_wrapper<std::decay_t<RefWrap>>::value,
+                        decltype(ref.get().*pmd)> {
+  return ref.get().*pmd;
+}
+
+template <class Base, class T, class Pointer>
+auto invoke_impl(T Base::*pmd, Pointer &&ptr) noexcept(noexcept((*std::forward<Pointer>(ptr)).*pmd))
+    -> std::enable_if_t<!std::is_function<T>::value && !is_reference_wrapper<std::decay_t<Pointer>>::value &&
+                            !std::is_base_of<Base, std::decay_t<Pointer>>::value,
+                        decltype((*std::forward<Pointer>(ptr)).*pmd)> {
+  return (*std::forward<Pointer>(ptr)).*pmd;
+}
+
+template <class F, class... Args>
+auto invoke_impl(F &&f, Args &&... args) noexcept(noexcept(std::forward<F>(f)(std::forward<Args>(args)...)))
+    -> std::enable_if_t<!std::is_member_pointer<std::decay_t<F>>::value,
+                        decltype(std::forward<F>(f)(std::forward<Args>(args)...))> {
+  return std::forward<F>(f)(std::forward<Args>(args)...);
+}
+
+template <class F, class... ArgTypes>
+auto invoke(F &&f,
+            ArgTypes &&... args) noexcept(noexcept(invoke_impl(std::forward<F>(f), std::forward<ArgTypes>(args)...)))
+    -> decltype(invoke_impl(std::forward<F>(f), std::forward<ArgTypes>(args)...)) {
+  return invoke_impl(std::forward<F>(f), std::forward<ArgTypes>(args)...);
+}
+
+template <class F, class... Args, std::size_t... S>
+auto call_tuple_impl(F &func, std::tuple<Args...> &&tuple, IntSeq<S...>) {
+  return func(std::forward<Args>(std::get<S>(tuple))...);
+}
+
+template <class... Args, std::size_t... S>
+auto invoke_tuple_impl(std::tuple<Args...> &&tuple, IntSeq<S...>) {
+  return invoke(std::forward<Args>(std::get<S>(tuple))...);
+}
+
+template <class ActorT, class F, class... Args, std::size_t... S>
+auto mem_call_tuple_impl(ActorT *actor, std::tuple<F, Args...> &&tuple, IntSeq<0, S...>) {
+  return (actor->*std::get<0>(tuple))(std::forward<Args>(std::get<S>(tuple))...);
+}
+
+template <class F, class... Args, std::size_t... S>
+void tuple_for_each_impl(std::tuple<Args...> &tuple, const F &func, IntSeq<S...>) {
+  const auto &dummy = {0, (func(std::get<S>(tuple)), 0)...};
+  (void)dummy;
+}
+
+template <class F, class... Args, std::size_t... S>
+void tuple_for_each_impl(const std::tuple<Args...> &tuple, const F &func, IntSeq<S...>) {
+  const auto &dummy = {0, (func(std::get<S>(tuple)), 0)...};
+  (void)dummy;
+}
+
+}  // namespace detail
+
+template <bool... Args>
+class LogicAnd {
+ public:
+  static constexpr bool value = detail::LogicAndImpl<true, Args...>::value;
+};
+
+template <class F, class... Args>
+auto call_tuple(F &func, std::tuple<Args...> &&tuple) {
+  return detail::call_tuple_impl(func, std::move(tuple), detail::IntRange<sizeof...(Args)>());
+}
+
+template <class... Args>
+auto invoke_tuple(std::tuple<Args...> &&tuple) {
+  return detail::invoke_tuple_impl(std::move(tuple), detail::IntRange<sizeof...(Args)>());
+}
+
+template <class ActorT, class... Args>
+auto mem_call_tuple(ActorT *actor, std::tuple<Args...> &&tuple) {
+  return detail::mem_call_tuple_impl(actor, std::move(tuple), detail::IntRange<sizeof...(Args)>());
+}
+
+template <class F, class... Args>
+void tuple_for_each(std::tuple<Args...> &tuple, const F &func) {
+  detail::tuple_for_each_impl(tuple, func, detail::IntRange<sizeof...(Args)>());
+}
+
+template <class F, class... Args>
+void tuple_for_each(const std::tuple<Args...> &tuple, const F &func) {
+  detail::tuple_for_each_impl(tuple, func, detail::IntRange<sizeof...(Args)>());
+}
+
+template <size_t N, class Arg, class... Args, std::enable_if_t<N == 0, int> = 0>
+auto &&get_nth_argument(Arg &&arg, Args &&... args) {
+  return std::forward<Arg>(arg);
+}
+
+template <size_t N, class Arg, class... Args, std::enable_if_t<N != 0, int> = 0>
+auto &&get_nth_argument(Arg &&arg, Args &&... args) {
+  return get_nth_argument<N - 1>(std::forward<Args &&>(args)...);
+}
+
+template <class... Args>
+auto &&get_last_argument(Args &&... args) {
+  return get_nth_argument<sizeof...(Args) - 1>(std::forward<Args &&>(args)...);
+}
+
+namespace detail {
+template <class F, class... Args, std::size_t... S>
+auto call_n_arguments_impl(IntSeq<S...>, F &&f, Args &&... args) {
+  return f(get_nth_argument<S>(std::forward<Args>(args)...)...);
+}
+}  // namespace detail
+
+template <size_t N, class F, class... Args>
+auto call_n_arguments(F &&f, Args &&... args) {
+  return detail::call_n_arguments_impl(detail::IntRange<N>(), f, std::forward<Args>(args)...);
+}
+
+template <class F, class X, class = void>
+struct is_callable : public std::false_type {};
+template <class F, class X>
+struct is_callable<F, X, decltype(std::declval<F>()(std::declval<X>()))> : public std::true_type {};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/logging.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/logging.cpp
new file mode 100644
index 0000000000..44479368a3
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/logging.cpp
@@ -0,0 +1,275 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/logging.h"
+
+#include "td/utils/port/Clocks.h"
+#include "td/utils/port/StdStreams.h"
+#include "td/utils/port/thread_local.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Time.h"
+
+#include <atomic>
+#include <cstdlib>
+
+#if TD_ANDROID
+#include <android/log.h>
+#define ALOG_TAG "DLTD"
+#elif TD_TIZEN
+#include <dlog.h>
+#define DLOG_TAG "DLTD"
+#elif TD_EMSCRIPTEN
+#include <emscripten.h>
+#endif
+
+namespace td {
+
+int VERBOSITY_NAME(net_query) = VERBOSITY_NAME(INFO);
+int VERBOSITY_NAME(td_requests) = VERBOSITY_NAME(INFO);
+int VERBOSITY_NAME(dc) = VERBOSITY_NAME(DEBUG) + 2;
+int VERBOSITY_NAME(files) = VERBOSITY_NAME(DEBUG) + 2;
+int VERBOSITY_NAME(mtproto) = VERBOSITY_NAME(DEBUG) + 7;
+int VERBOSITY_NAME(raw_mtproto) = VERBOSITY_NAME(DEBUG) + 10;
+int VERBOSITY_NAME(fd) = VERBOSITY_NAME(DEBUG) + 9;
+int VERBOSITY_NAME(actor) = VERBOSITY_NAME(DEBUG) + 10;
+int VERBOSITY_NAME(sqlite) = VERBOSITY_NAME(DEBUG) + 10;
+
+LogOptions log_options;
+
+TD_THREAD_LOCAL const char *Logger::tag_ = nullptr;
+TD_THREAD_LOCAL const char *Logger::tag2_ = nullptr;
+
+Logger::Logger(LogInterface &log, const LogOptions &options, int log_level, Slice file_name, int line_num,
+               Slice comment)
+    : Logger(log, options, log_level) {
+  if (!options_.add_info) {
+    return;
+  }
+
+  // log level
+  sb_ << '[';
+  if (log_level < 10) {
+    sb_ << ' ';
+  }
+  sb_ << log_level << ']';
+
+  // thread id
+  auto thread_id = get_thread_id();
+  sb_ << "[t";
+  if (thread_id < 10) {
+    sb_ << ' ';
+  }
+  sb_ << thread_id << ']';
+
+  // timestamp
+  sb_ << '[' << StringBuilder::FixedDouble(Clocks::system(), 9) << ']';
+
+  // file : line
+  if (!file_name.empty()) {
+    auto last_slash_ = static_cast<int32>(file_name.size()) - 1;
+    while (last_slash_ >= 0 && file_name[last_slash_] != '/' && file_name[last_slash_] != '\\') {
+      last_slash_--;
+    }
+    file_name = file_name.substr(last_slash_ + 1);
+    sb_ << "[" << file_name << ':' << line_num << ']';
+  }
+
+  // context from tag_
+  if (tag_ != nullptr && *tag_) {
+    sb_ << "[#" << Slice(tag_) << ']';
+  }
+
+  // context from tag2_
+  if (tag2_ != nullptr && *tag2_) {
+    sb_ << "[!" << Slice(tag2_) << ']';
+  }
+
+  // comment (e.g. condition in LOG_IF)
+  if (!comment.empty()) {
+    sb_ << "[&" << comment << ']';
+  }
+
+  sb_ << '\t';
+}
+
+Logger::~Logger() {
+  if (options_.fix_newlines) {
+    sb_ << '\n';
+    auto slice = as_cslice();
+    if (slice.back() != '\n') {
+      slice.back() = '\n';
+    }
+    while (slice.size() > 1 && slice[slice.size() - 2] == '\n') {
+      slice.back() = '\0';
+      slice = MutableCSlice(slice.begin(), slice.begin() + slice.size() - 1);
+    }
+    log_.append(slice, log_level_);
+  } else {
+    log_.append(as_cslice(), log_level_);
+  }
+}
+
+TsCerr::TsCerr() {
+  enterCritical();
+}
+TsCerr::~TsCerr() {
+  exitCritical();
+}
+TsCerr &TsCerr::operator<<(Slice slice) {
+  auto &fd = Stderr();
+  if (fd.empty()) {
+    return *this;
+  }
+  double end_time = 0;
+  while (!slice.empty()) {
+    auto res = fd.write(slice);
+    if (res.is_error()) {
+      if (res.error().code() == EPIPE) {
+        break;
+      }
+      // Resource temporary unavailable
+      if (end_time == 0) {
+        end_time = Time::now() + 0.01;
+      } else if (Time::now() > end_time) {
+        break;
+      }
+      continue;
+    }
+    slice.remove_prefix(res.ok());
+  }
+  return *this;
+}
+
+void TsCerr::enterCritical() {
+  while (lock_.test_and_set(std::memory_order_acquire)) {
+    // spin
+  }
+}
+
+void TsCerr::exitCritical() {
+  lock_.clear(std::memory_order_release);
+}
+TsCerr::Lock TsCerr::lock_ = ATOMIC_FLAG_INIT;
+
+class DefaultLog : public LogInterface {
+ public:
+  void append(CSlice slice, int log_level) override {
+#if TD_ANDROID
+    switch (log_level) {
+      case VERBOSITY_NAME(FATAL):
+        __android_log_write(ANDROID_LOG_FATAL, ALOG_TAG, slice.c_str());
+        break;
+      case VERBOSITY_NAME(ERROR):
+        __android_log_write(ANDROID_LOG_ERROR, ALOG_TAG, slice.c_str());
+        break;
+      case VERBOSITY_NAME(WARNING):
+        __android_log_write(ANDROID_LOG_WARN, ALOG_TAG, slice.c_str());
+        break;
+      case VERBOSITY_NAME(INFO):
+        __android_log_write(ANDROID_LOG_INFO, ALOG_TAG, slice.c_str());
+        break;
+      default:
+        __android_log_write(ANDROID_LOG_DEBUG, ALOG_TAG, slice.c_str());
+        break;
+    }
+#elif TD_TIZEN
+    switch (log_level) {
+      case VERBOSITY_NAME(FATAL):
+        dlog_print(DLOG_ERROR, DLOG_TAG, slice.c_str());
+        break;
+      case VERBOSITY_NAME(ERROR):
+        dlog_print(DLOG_ERROR, DLOG_TAG, slice.c_str());
+        break;
+      case VERBOSITY_NAME(WARNING):
+        dlog_print(DLOG_WARN, DLOG_TAG, slice.c_str());
+        break;
+      case VERBOSITY_NAME(INFO):
+        dlog_print(DLOG_INFO, DLOG_TAG, slice.c_str());
+        break;
+      default:
+        dlog_print(DLOG_DEBUG, DLOG_TAG, slice.c_str());
+        break;
+    }
+#elif TD_EMSCRIPTEN
+    switch (log_level) {
+      case VERBOSITY_NAME(FATAL):
+        emscripten_log(
+            EM_LOG_ERROR | EM_LOG_CONSOLE | EM_LOG_C_STACK | EM_LOG_JS_STACK | EM_LOG_DEMANGLE | EM_LOG_FUNC_PARAMS,
+            "%s", slice.c_str());
+        EM_ASM(throw(UTF8ToString($0)), slice.c_str());
+        break;
+      case VERBOSITY_NAME(ERROR):
+        emscripten_log(EM_LOG_ERROR | EM_LOG_CONSOLE, "%s", slice.c_str());
+        break;
+      case VERBOSITY_NAME(WARNING):
+        emscripten_log(EM_LOG_WARN | EM_LOG_CONSOLE, "%s", slice.c_str());
+        break;
+      default:
+        emscripten_log(EM_LOG_CONSOLE, "%s", slice.c_str());
+        break;
+    }
+#elif !TD_WINDOWS
+    Slice color;
+    switch (log_level) {
+      case VERBOSITY_NAME(FATAL):
+      case VERBOSITY_NAME(ERROR):
+        color = Slice(TC_RED);
+        break;
+      case VERBOSITY_NAME(WARNING):
+        color = Slice(TC_YELLOW);
+        break;
+      case VERBOSITY_NAME(INFO):
+        color = Slice(TC_CYAN);
+        break;
+    }
+    if (!slice.empty() && slice.back() == '\n') {
+      TsCerr() << color << slice.substr(0, slice.size() - 1) << TC_EMPTY "\n";
+    } else {
+      TsCerr() << color << slice << TC_EMPTY;
+    }
+#else
+    // TODO: color
+    TsCerr() << slice;
+#endif
+    if (log_level == VERBOSITY_NAME(FATAL)) {
+      process_fatal_error(slice);
+    }
+  }
+  void rotate() override {
+  }
+};
+static DefaultLog default_log;
+
+LogInterface *const default_log_interface = &default_log;
+LogInterface *log_interface = default_log_interface;
+
+static OnFatalErrorCallback on_fatal_error_callback = nullptr;
+
+void set_log_fatal_error_callback(OnFatalErrorCallback callback) {
+  on_fatal_error_callback = callback;
+}
+
+void process_fatal_error(CSlice message) {
+  auto callback = on_fatal_error_callback;
+  if (callback) {
+    callback(message);
+  }
+  std::abort();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/logging.h b/submodules/ton/tonlib-src/tdutils/td/utils/logging.h
new file mode 100644
index 0000000000..04d17992a5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/logging.h
@@ -0,0 +1,321 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+/*
+ * Simple logging.
+ *
+ * Predefined log levels: FATAL, ERROR, WARNING, INFO, DEBUG
+ *
+ * LOG(WARNING) << "Hello world!";
+ * LOG(INFO) << "Hello " << 1234 << " world!";
+ * LOG_IF(INFO, condition) << "Hello world if condition!";
+ *
+ * Custom log levels may be defined and used using VLOG:
+ * int VERBOSITY_NAME(custom) = VERBOSITY_NAME(WARNING);
+ * VLOG(custom) << "Hello custom world!"
+ *
+ * LOG(FATAL) << "Power is off";
+ * CHECK(condition) <===> LOG_IF(FATAL, !(condition))
+ */
+
+#include "td/utils/common.h"
+#include "td/utils/port/thread_local.h"
+#include "td/utils/Slice.h"
+#include "td/utils/StackAllocator.h"
+#include "td/utils/StringBuilder.h"
+
+#include <atomic>
+#include <type_traits>
+
+#define PSTR_IMPL() ::td::Logger(::td::NullLog().ref(), ::td::LogOptions::plain(), 0)
+#define PSLICE() ::td::detail::Slicify() & PSTR_IMPL()
+#define PSTRING() ::td::detail::Stringify() & PSTR_IMPL()
+#define PSLICE_SAFE() ::td::detail::SlicifySafe() & PSTR_IMPL()
+#define PSTRING_SAFE() ::td::detail::StringifySafe() & PSTR_IMPL()
+
+#define VERBOSITY_NAME(x) verbosity_##x
+
+#define GET_VERBOSITY_LEVEL() (::td::log_options.level)
+#define SET_VERBOSITY_LEVEL(new_level) (::td::log_options.level = (new_level))
+
+#ifndef STRIP_LOG
+#define STRIP_LOG VERBOSITY_NAME(DEBUG)
+#endif
+#define LOG_IS_STRIPPED(strip_level) \
+  (std::integral_constant<int, VERBOSITY_NAME(strip_level)>() > std::integral_constant<int, STRIP_LOG>())
+
+#define LOGGER(interface, options, level, comment) ::td::Logger(interface, options, level, __FILE__, __LINE__, comment)
+
+#define LOG_IMPL_FULL(interface, options, strip_level, runtime_level, condition, comment) \
+  LOG_IS_STRIPPED(strip_level) || runtime_level > options.level || !(condition)           \
+      ? (void)0                                                                           \
+      : ::td::detail::Voidify() & LOGGER(interface, options, runtime_level, comment)
+
+#define LOG_IMPL(strip_level, level, condition, comment) \
+  LOG_IMPL_FULL(*::td::log_interface, ::td::log_options, strip_level, VERBOSITY_NAME(level), condition, comment)
+
+#define LOG(level) LOG_IMPL(level, level, true, ::td::Slice())
+#define LOG_IF(level, condition) LOG_IMPL(level, level, condition, #condition)
+
+#define VLOG(level) LOG_IMPL(DEBUG, level, true, TD_DEFINE_STR(level))
+#define VLOG_IF(level, condition) LOG_IMPL(DEBUG, level, condition, TD_DEFINE_STR(level) " " #condition)
+
+#define LOG_ROTATE() ::td::log_interface->rotate()
+
+#define LOG_TAG ::td::Logger::tag_
+#define LOG_TAG2 ::td::Logger::tag2_
+
+#if TD_CLANG
+bool no_return_func() __attribute__((analyzer_noreturn));
+#endif
+
+inline bool no_return_func() {
+  return true;
+}
+
+// clang-format off
+#define DUMMY_LOG_CHECK(condition) LOG_IF(NEVER, !(condition))
+
+#ifdef TD_DEBUG
+  #if TD_MSVC
+    #define LOG_CHECK(condition)        \
+      __analysis_assume(!!(condition)); \
+      LOG_IMPL(FATAL, FATAL, !(condition), #condition)
+  #else
+    #define LOG_CHECK(condition) LOG_IMPL(FATAL, FATAL, !(condition) && no_return_func(), #condition)
+  #endif
+#else
+  #define LOG_CHECK DUMMY_LOG_CHECK
+#endif
+
+#if NDEBUG
+  #define LOG_DCHECK DUMMY_LOG_CHECK
+#else
+  #define LOG_DCHECK LOG_CHECK
+#endif
+// clang-format on
+
+constexpr int VERBOSITY_NAME(PLAIN) = -1;
+constexpr int VERBOSITY_NAME(FATAL) = 0;
+constexpr int VERBOSITY_NAME(ERROR) = 1;
+constexpr int VERBOSITY_NAME(WARNING) = 2;
+constexpr int VERBOSITY_NAME(INFO) = 3;
+constexpr int VERBOSITY_NAME(DEBUG) = 4;
+constexpr int VERBOSITY_NAME(NEVER) = 1024;
+
+namespace td {
+// TODO Not part of utils. Should be in some separate file
+extern int VERBOSITY_NAME(mtproto);
+extern int VERBOSITY_NAME(raw_mtproto);
+extern int VERBOSITY_NAME(dc);
+extern int VERBOSITY_NAME(fd);
+extern int VERBOSITY_NAME(net_query);
+extern int VERBOSITY_NAME(td_requests);
+extern int VERBOSITY_NAME(actor);
+extern int VERBOSITY_NAME(files);
+extern int VERBOSITY_NAME(sqlite);
+
+struct LogOptions {
+  int level{VERBOSITY_NAME(DEBUG) + 1};
+  bool fix_newlines{true};
+  bool add_info{true};
+
+  static constexpr LogOptions plain() {
+    return LogOptions{0, false, false};
+  }
+
+  constexpr LogOptions() = default;
+  constexpr LogOptions(int level, bool fix_newlines, bool add_info)
+      : level(level), fix_newlines(fix_newlines), add_info(add_info) {
+  }
+};
+
+extern LogOptions log_options;
+
+class LogInterface {
+ public:
+  LogInterface() = default;
+  LogInterface(const LogInterface &) = delete;
+  LogInterface &operator=(const LogInterface &) = delete;
+  LogInterface(LogInterface &&) = delete;
+  LogInterface &operator=(LogInterface &&) = delete;
+  virtual ~LogInterface() = default;
+  virtual void append(CSlice slice) {
+    append(slice, -1);
+  }
+  virtual void append(CSlice slice, int /*log_level*/) {
+    append(slice);
+  }
+  virtual void rotate() {
+  }
+  virtual vector<string> get_file_paths() {
+    return {};
+  }
+};
+
+class NullLog : public LogInterface {
+ public:
+  void append(CSlice /*slice*/, int /*log_level*/) override {
+  }
+  void rotate() override {
+  }
+  NullLog &ref() {
+    return *this;
+  }
+};
+
+extern LogInterface *const default_log_interface;
+extern LogInterface *log_interface;
+
+using OnFatalErrorCallback = void (*)(CSlice message);
+void set_log_fatal_error_callback(OnFatalErrorCallback callback);
+
+[[noreturn]] void process_fatal_error(CSlice message);
+
+#define TC_RED "\x1b[1;31m"
+#define TC_BLUE "\x1b[1;34m"
+#define TC_CYAN "\x1b[1;36m"
+#define TC_GREEN "\x1b[1;32m"
+#define TC_YELLOW "\x1b[1;33m"
+#define TC_EMPTY "\x1b[0m"
+
+class TsCerr {
+ public:
+  TsCerr();
+  TsCerr(const TsCerr &) = delete;
+  TsCerr &operator=(const TsCerr &) = delete;
+  TsCerr(TsCerr &&) = delete;
+  TsCerr &operator=(TsCerr &&) = delete;
+  ~TsCerr();
+  TsCerr &operator<<(Slice slice);
+
+ private:
+  using Lock = std::atomic_flag;
+  static Lock lock_;
+
+  void enterCritical();
+  void exitCritical();
+};
+
+class Logger {
+ public:
+  static const int BUFFER_SIZE = 128 * 1024;
+  Logger(LogInterface &log, const LogOptions &options, int log_level)
+      : buffer_(StackAllocator::alloc(BUFFER_SIZE))
+      , log_(log)
+      , sb_(buffer_.as_slice())
+      , options_(options)
+      , log_level_(log_level) {
+  }
+
+  Logger(LogInterface &log, const LogOptions &options, int log_level, Slice file_name, int line_num, Slice comment);
+
+  template <class T>
+  Logger &operator<<(const T &other) {
+    sb_ << other;
+    return *this;
+  }
+
+  MutableCSlice as_cslice() {
+    return sb_.as_cslice();
+  }
+  bool is_error() const {
+    return sb_.is_error();
+  }
+  Logger(const Logger &) = delete;
+  Logger &operator=(const Logger &) = delete;
+  Logger(Logger &&) = delete;
+  Logger &operator=(Logger &&) = delete;
+  ~Logger();
+
+  static TD_THREAD_LOCAL const char *tag_;
+  static TD_THREAD_LOCAL const char *tag2_;
+
+ private:
+  decltype(StackAllocator::alloc(0)) buffer_;
+  LogInterface &log_;
+  StringBuilder sb_;
+  const LogOptions &options_;
+  int log_level_;
+};
+
+namespace detail {
+class Voidify {
+ public:
+  template <class T>
+  void operator&(const T &) {
+  }
+};
+
+class Slicify {
+ public:
+  CSlice operator&(Logger &logger) {
+    return logger.as_cslice();
+  }
+};
+
+class Stringify {
+ public:
+  string operator&(Logger &logger) {
+    return logger.as_cslice().str();
+  }
+};
+}  // namespace detail
+
+class TsLog : public LogInterface {
+ public:
+  explicit TsLog(LogInterface *log) : log_(log) {
+  }
+  void init(LogInterface *log) {
+    enter_critical();
+    log_ = log;
+    exit_critical();
+  }
+  void append(CSlice slice, int level) override {
+    enter_critical();
+    log_->append(slice, level);
+    exit_critical();
+  }
+  void rotate() override {
+    enter_critical();
+    log_->rotate();
+    exit_critical();
+  }
+  vector<string> get_file_paths() override {
+    enter_critical();
+    auto result = log_->get_file_paths();
+    exit_critical();
+    return result;
+  }
+
+ private:
+  LogInterface *log_ = nullptr;
+  std::atomic_flag lock_ = ATOMIC_FLAG_INIT;
+  void enter_critical() {
+    while (lock_.test_and_set(std::memory_order_acquire)) {
+      // spin
+    }
+  }
+  void exit_critical() {
+    lock_.clear(std::memory_order_release);
+  }
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/misc.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/misc.cpp
new file mode 100644
index 0000000000..827d223c36
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/misc.cpp
@@ -0,0 +1,208 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/misc.h"
+
+#include "td/utils/port/thread_local.h"
+
+#include <algorithm>
+#include <cstdlib>
+#include <locale>
+#include <sstream>
+
+namespace td {
+
+char *str_dup(Slice str) {
+  char *res = static_cast<char *>(std::malloc(str.size() + 1));
+  if (res == nullptr) {
+    return nullptr;
+  }
+  std::copy(str.begin(), str.end(), res);
+  res[str.size()] = '\0';
+  return res;
+}
+
+string implode(const vector<string> &v, char delimiter) {
+  string result;
+  for (auto &str : v) {
+    if (!result.empty()) {
+      result += delimiter;
+    }
+    result += str;
+  }
+  return result;
+}
+
+string lpad0(string str, size_t size) {
+  if (str.size() >= size) {
+    return str;
+  }
+  return string(size - str.size(), '0') + str;
+}
+
+string oneline(Slice str) {
+  string result;
+  result.reserve(str.size());
+  bool after_new_line = true;
+  for (auto c : str) {
+    if (c != '\n') {
+      if (after_new_line) {
+        if (c == ' ') {
+          continue;
+        }
+        after_new_line = false;
+      }
+      result += c;
+    } else {
+      after_new_line = true;
+      result += ' ';
+    }
+  }
+  while (!result.empty() && result.back() == ' ') {
+    result.pop_back();
+  }
+  return result;
+}
+
+double to_double(Slice str) {
+  static TD_THREAD_LOCAL std::stringstream *ss;
+  if (init_thread_local<std::stringstream>(ss)) {
+    auto previous_locale = ss->imbue(std::locale::classic());
+  } else {
+    ss->str(std::string());
+    ss->clear();
+  }
+  ss->write(str.begin(), narrow_cast<std::streamsize>(str.size()));
+
+  double result = 0.0;
+  *ss >> result;
+  return result;
+}
+
+Result<string> hex_decode(Slice hex) {
+  if (hex.size() % 2 != 0) {
+    return Status::Error("Wrong hex string length");
+  }
+  string result(hex.size() / 2, '\0');
+  for (size_t i = 0; i < result.size(); i++) {
+    int high = hex_to_int(hex[i + i]);
+    int low = hex_to_int(hex[i + i + 1]);
+    if (high == 16 || low == 16) {
+      return Status::Error("Wrong hex string");
+    }
+    result[i] = static_cast<char>(high * 16 + low);  // TODO implementation-defined
+  }
+  return std::move(result);
+}
+
+static bool is_url_char(char c) {
+  return is_alnum(c) || c == '-' || c == '.' || c == '_' || c == '~';
+}
+
+string url_encode(Slice str) {
+  size_t length = 3 * str.size();
+  for (auto c : str) {
+    length -= 2 * is_url_char(c);
+  }
+  if (length == str.size()) {
+    return str.str();
+  }
+  string result;
+  result.reserve(length);
+  for (auto c : str) {
+    if (is_url_char(c)) {
+      result += c;
+    } else {
+      auto ch = static_cast<unsigned char>(c);
+      result += '%';
+      result += "0123456789ABCDEF"[ch / 16];
+      result += "0123456789ABCDEF"[ch % 16];
+    }
+  }
+  CHECK(result.size() == length);
+  return result;
+}
+
+namespace {
+
+template <class F>
+string x_decode(Slice s, F &&f) {
+  string res;
+  for (size_t n = s.size(), i = 0; i < n; i++) {
+    if (i + 1 < n && f(s[i])) {
+      res.append(static_cast<unsigned char>(s[i + 1]), s[i]);
+      i++;
+      continue;
+    }
+    res.push_back(s[i]);
+  }
+  return res;
+}
+
+template <class F>
+string x_encode(Slice s, F &&f) {
+  string res;
+  for (size_t n = s.size(), i = 0; i < n; i++) {
+    res.push_back(s[i]);
+    if (f(s[i])) {
+      unsigned char cnt = 1;
+      while (cnt < 250 && i + cnt < n && s[i + cnt] == s[i]) {
+        cnt++;
+      }
+      res.push_back(static_cast<char>(cnt));
+      i += cnt - 1;
+    }
+  }
+  return res;
+}
+
+bool is_zero(unsigned char c) {
+  return c == 0;
+}
+
+bool is_zero_or_one(unsigned char c) {
+  return c == 0 || c == 0xff;
+}
+
+}  // namespace
+
+string buffer_to_hex(Slice buffer) {
+  const char *hex = "0123456789ABCDEF";
+  string res(2 * buffer.size(), '\0');
+  for (std::size_t i = 0; i < buffer.size(); i++) {
+    auto c = buffer.ubegin()[i];
+    res[2 * i] = hex[c & 15];
+    res[2 * i + 1] = hex[c >> 4];
+  }
+  return res;
+}
+
+std::string zero_encode(Slice data) {
+  return x_encode(data, is_zero);
+}
+std::string zero_decode(Slice data) {
+  return x_decode(data, is_zero);
+}
+std::string zero_one_encode(Slice data) {
+  return x_encode(data, is_zero_or_one);
+}
+std::string zero_one_decode(Slice data) {
+  return x_decode(data, is_zero_or_one);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/misc.h b/submodules/ton/tonlib-src/tdutils/td/utils/misc.h
new file mode 100644
index 0000000000..d747313eb8
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/misc.h
@@ -0,0 +1,423 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+#include "td/utils/StringBuilder.h"
+
+#include <cstdint>
+#include <limits>
+#include <type_traits>
+#include <utility>
+
+namespace td {
+
+char *str_dup(Slice str);
+
+template <class T>
+std::pair<T, T> split(T s, char delimiter = ' ') {
+  auto delimiter_pos = s.find(delimiter);
+  if (delimiter_pos == string::npos) {
+    return {std::move(s), T()};
+  } else {
+    return {s.substr(0, delimiter_pos), s.substr(delimiter_pos + 1)};
+  }
+}
+
+template <class T>
+vector<T> full_split(T s, char delimiter = ' ') {
+  vector<T> result;
+  if (s.empty()) {
+    return result;
+  }
+  while (true) {
+    auto delimiter_pos = s.find(delimiter);
+    if (delimiter_pos == string::npos) {
+      result.push_back(std::move(s));
+      return result;
+    } else {
+      result.push_back(s.substr(0, delimiter_pos));
+      s = s.substr(delimiter_pos + 1);
+    }
+  }
+}
+
+string implode(const vector<string> &v, char delimiter = ' ');
+
+namespace detail {
+
+template <typename T>
+struct transform_helper {
+  template <class Func>
+  auto transform(const T &v, const Func &f) {
+    vector<decltype(f(*v.begin()))> result;
+    result.reserve(v.size());
+    for (auto &x : v) {
+      result.push_back(f(x));
+    }
+    return result;
+  }
+
+  template <class Func>
+  auto transform(T &&v, const Func &f) {
+    vector<decltype(f(std::move(*v.begin())))> result;
+    result.reserve(v.size());
+    for (auto &x : v) {
+      result.push_back(f(std::move(x)));
+    }
+    return result;
+  }
+};
+
+}  // namespace detail
+
+template <class T, class Func>
+auto transform(T &&v, const Func &f) {
+  return detail::transform_helper<std::decay_t<T>>().transform(std::forward<T>(v), f);
+}
+
+template <class T>
+void reset_to_empty(T &value) {
+  using std::swap;
+  std::decay_t<T> tmp;
+  swap(tmp, value);
+}
+
+template <class T>
+void append(vector<T> &destination, const vector<T> &source) {
+  destination.insert(destination.end(), source.begin(), source.end());
+}
+
+template <class T>
+void append(vector<T> &destination, vector<T> &&source) {
+  if (destination.empty()) {
+    destination.swap(source);
+    return;
+  }
+  destination.reserve(destination.size() + source.size());
+  for (auto &elem : source) {
+    destination.push_back(std::move(elem));
+  }
+  reset_to_empty(source);
+}
+
+template <class T>
+void combine(vector<T> &destination, const vector<T> &source) {
+  append(destination, source);
+}
+
+template <class T>
+void combine(vector<T> &destination, vector<T> &&source) {
+  if (destination.size() < source.size()) {
+    destination.swap(source);
+  }
+  destination.reserve(destination.size() + source.size());
+  for (auto &elem : source) {
+    destination.push_back(std::move(elem));
+  }
+  reset_to_empty(source);
+}
+
+inline bool begins_with(Slice str, Slice prefix) {
+  return prefix.size() <= str.size() && prefix == Slice(str.data(), prefix.size());
+}
+
+inline bool ends_with(Slice str, Slice suffix) {
+  return suffix.size() <= str.size() && suffix == Slice(str.data() + str.size() - suffix.size(), suffix.size());
+}
+
+inline char to_lower(char c) {
+  if ('A' <= c && c <= 'Z') {
+    return static_cast<char>(c - 'A' + 'a');
+  }
+
+  return c;
+}
+
+inline MutableSlice to_lower_inplace(MutableSlice slice) {
+  for (auto &c : slice) {
+    c = to_lower(c);
+  }
+  return slice;
+}
+
+inline string to_lower(Slice slice) {
+  auto result = slice.str();
+  to_lower_inplace(result);
+  return result;
+}
+
+inline char to_upper(char c) {
+  if ('a' <= c && c <= 'z') {
+    return static_cast<char>(c - 'a' + 'A');
+  }
+
+  return c;
+}
+
+inline void to_upper_inplace(MutableSlice slice) {
+  for (auto &c : slice) {
+    c = to_upper(c);
+  }
+}
+
+inline string to_upper(Slice slice) {
+  auto result = slice.str();
+  to_upper_inplace(result);
+  return result;
+}
+
+inline bool is_space(char c) {
+  return c == ' ' || c == '\t' || c == '\r' || c == '\n' || c == '\0' || c == '\v';
+}
+
+inline bool is_alpha(char c) {
+  c |= 0x20;
+  return 'a' <= c && c <= 'z';
+}
+
+inline bool is_digit(char c) {
+  return '0' <= c && c <= '9';
+}
+
+inline bool is_alnum(char c) {
+  return is_alpha(c) || is_digit(c);
+}
+
+inline bool is_hex_digit(char c) {
+  if (is_digit(c)) {
+    return true;
+  }
+  c |= 0x20;
+  return 'a' <= c && c <= 'f';
+}
+
+template <class T>
+T trim(T str) {
+  auto begin = str.data();
+  auto end = begin + str.size();
+  while (begin < end && is_space(*begin)) {
+    begin++;
+  }
+  while (begin < end && is_space(end[-1])) {
+    end--;
+  }
+  if (static_cast<size_t>(end - begin) == str.size()) {
+    return std::move(str);
+  }
+  return T(begin, end);
+}
+
+string lpad0(string str, size_t size);
+
+string oneline(Slice str);
+
+template <class T>
+std::enable_if_t<std::is_signed<T>::value, T> to_integer(Slice str) {
+  using unsigned_T = typename std::make_unsigned<T>::type;
+  unsigned_T integer_value = 0;
+  auto begin = str.begin();
+  auto end = str.end();
+  bool is_negative = false;
+  if (begin != end && *begin == '-') {
+    is_negative = true;
+    begin++;
+  }
+  while (begin != end && is_digit(*begin)) {
+    integer_value = static_cast<unsigned_T>(integer_value * 10 + static_cast<unsigned_T>(*begin++ - '0'));
+  }
+  if (integer_value > static_cast<unsigned_T>(std::numeric_limits<T>::max())) {
+    static_assert(~0 + 1 == 0, "Two's complement");
+    // Use ~x + 1 instead of -x to suppress Visual Studio warning.
+    integer_value = static_cast<unsigned_T>(~integer_value + 1);
+    is_negative = !is_negative;
+
+    if (integer_value > static_cast<unsigned_T>(std::numeric_limits<T>::max())) {
+      return std::numeric_limits<T>::min();
+    }
+  }
+
+  return is_negative ? static_cast<T>(-static_cast<T>(integer_value)) : static_cast<T>(integer_value);
+}
+
+template <class T>
+std::enable_if_t<std::is_unsigned<T>::value, T> to_integer(Slice str) {
+  T integer_value = 0;
+  auto begin = str.begin();
+  auto end = str.end();
+  while (begin != end && is_digit(*begin)) {
+    integer_value = static_cast<T>(integer_value * 10 + static_cast<T>(*begin++ - '0'));
+  }
+  return integer_value;
+}
+
+template <class T>
+Result<T> to_integer_safe(Slice str) {
+  auto res = to_integer<T>(str);
+  if ((PSLICE() << res) != str) {
+    return Status::Error(PSLICE() << "Can't parse \"" << str << "\" as number");
+  }
+  return res;
+}
+
+inline int hex_to_int(char c) {
+  if (is_digit(c)) {
+    return c - '0';
+  }
+  c |= 0x20;
+  if ('a' <= c && c <= 'f') {
+    return c - 'a' + 10;
+  }
+  return 16;
+}
+
+template <class T>
+typename std::enable_if<std::is_unsigned<T>::value, T>::type hex_to_integer(Slice str) {
+  T integer_value = 0;
+  auto begin = str.begin();
+  auto end = str.end();
+  while (begin != end && is_hex_digit(*begin)) {
+    integer_value = static_cast<T>(integer_value * 16 + hex_to_int(*begin++));
+  }
+  return integer_value;
+}
+
+double to_double(Slice str);
+
+template <class T>
+T clamp(T value, T min_value, T max_value) {
+  if (value < min_value) {
+    return min_value;
+  }
+  if (value > max_value) {
+    return max_value;
+  }
+  return value;
+}
+
+Result<string> hex_decode(Slice hex);
+
+string url_encode(Slice str);
+
+// run-time checked narrowing cast (type conversion):
+
+namespace detail {
+template <class T, class U>
+struct is_same_signedness : public std::integral_constant<bool, std::is_signed<T>::value == std::is_signed<U>::value> {
+};
+
+template <class T, class Enable = void>
+struct safe_undeflying_type {
+  using type = T;
+};
+
+template <class T>
+struct safe_undeflying_type<T, std::enable_if_t<std::is_enum<T>::value>> {
+  using type = std::underlying_type_t<T>;
+};
+
+class NarrowCast {
+  const char *file_;
+  int line_;
+
+ public:
+  NarrowCast(const char *file, int line) : file_(file), line_(line) {
+  }
+
+  template <class R, class A>
+  R cast(const A &a) {
+    using RT = typename safe_undeflying_type<R>::type;
+    using AT = typename safe_undeflying_type<A>::type;
+
+    static_assert(std::is_integral<RT>::value, "expected integral type to cast to");
+    static_assert(std::is_integral<AT>::value, "expected integral type to cast from");
+
+    auto r = R(a);
+    LOG_CHECK(A(r) == a) << static_cast<AT>(a) << " " << static_cast<RT>(r) << " " << file_ << " " << line_;
+    LOG_CHECK((is_same_signedness<RT, AT>::value) || ((static_cast<RT>(r) < RT{}) == (static_cast<AT>(a) < AT{})))
+        << static_cast<AT>(a) << " " << static_cast<RT>(r) << " " << file_ << " " << line_;
+
+    return r;
+  }
+};
+}  // namespace detail
+
+#define narrow_cast detail::NarrowCast(__FILE__, __LINE__).cast
+
+template <class R, class A>
+Result<R> narrow_cast_safe(const A &a) {
+  using RT = typename detail::safe_undeflying_type<R>::type;
+  using AT = typename detail::safe_undeflying_type<A>::type;
+
+  static_assert(std::is_integral<RT>::value, "expected integral type to cast to");
+  static_assert(std::is_integral<AT>::value, "expected integral type to cast from");
+
+  auto r = R(a);
+  if (!(A(r) == a)) {
+    return Status::Error("Narrow cast failed");
+  }
+  if (!((detail::is_same_signedness<RT, AT>::value) || ((static_cast<RT>(r) < RT{}) == (static_cast<AT>(a) < AT{})))) {
+    return Status::Error("Narrow cast failed");
+  }
+
+  return r;
+}
+
+template <int Alignment, class T>
+bool is_aligned_pointer(const T *pointer) {
+  static_assert(Alignment > 0 && (Alignment & (Alignment - 1)) == 0, "Wrong alignment");
+  return (reinterpret_cast<std::uintptr_t>(static_cast<const void *>(pointer)) & (Alignment - 1)) == 0;
+}
+
+namespace detail {
+template <typename T>
+struct reversion_wrapper {
+  T &iterable;
+};
+
+template <typename T>
+auto begin(reversion_wrapper<T> w) {
+  return w.iterable.rbegin();
+}
+
+template <typename T>
+auto end(reversion_wrapper<T> w) {
+  return w.iterable.rend();
+}
+}  // namespace detail
+
+template <typename T>
+detail::reversion_wrapper<T> reversed(T &iterable) {
+  return {iterable};
+}
+
+string buffer_to_hex(Slice buffer);
+
+string zero_encode(Slice data);
+
+string zero_decode(Slice data);
+
+string zero_one_encode(Slice data);
+
+string zero_one_decode(Slice data);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/optional.h b/submodules/ton/tonlib-src/tdutils/td/utils/optional.h
new file mode 100644
index 0000000000..7da14b6294
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/optional.h
@@ -0,0 +1,99 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Status.h"
+
+#include <type_traits>
+#include <utility>
+
+namespace td {
+
+template <class T, bool = std::is_copy_constructible<T>::value>
+class optional {
+ public:
+  optional() = default;
+  template <class T1,
+            std::enable_if_t<!std::is_same<std::decay_t<T1>, optional>::value && std::is_constructible<T, T1>::value,
+                             int> = 0>
+  optional(T1 &&t) : impl_(std::forward<T1>(t)) {
+  }
+
+  optional(const optional &other) {
+    if (other) {
+      impl_ = Result<T>(other.value());
+    }
+  }
+
+  optional &operator=(const optional &other) {
+    if (other) {
+      impl_ = Result<T>(other.value());
+    } else {
+      impl_ = Result<T>();
+    }
+    return *this;
+  }
+
+  optional(optional &&other) = default;
+  optional &operator=(optional &&other) = default;
+  ~optional() = default;
+
+  explicit operator bool() const {
+    return impl_.is_ok();
+  }
+  T &value() {
+    return impl_.ok_ref();
+  }
+  const T &value() const {
+    return impl_.ok_ref();
+  }
+  T &operator*() {
+    return value();
+  }
+  T unwrap() {
+    CHECK(*this);
+    auto res = std::move(value());
+    impl_ = {};
+    return res;
+  }
+
+  template <class... ArgsT>
+  void emplace(ArgsT &&... args) {
+    impl_.emplace(std::forward<ArgsT>(args)...);
+  }
+
+ private:
+  Result<T> impl_;
+};
+
+template <typename T>
+struct optional<T, false> : optional<T, true> {
+  optional() = default;
+
+  using optional<T, true>::optional;
+
+  optional(const optional &other) = delete;
+  optional &operator=(const optional &other) = delete;
+  optional(optional &&) = default;
+  optional &operator=(optional &&) = default;
+  ~optional() = default;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/overloaded.h b/submodules/ton/tonlib-src/tdutils/td/utils/overloaded.h
new file mode 100644
index 0000000000..176f0efe05
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/overloaded.h
@@ -0,0 +1,51 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace td {
+
+namespace detail {
+
+template <class... Fs>
+struct overload;
+
+template <class F>
+struct overload<F> : public F {
+  explicit overload(F f) : F(f) {
+  }
+};
+
+template <class F, class... Fs>
+struct overload<F, Fs...>
+    : public overload<F>
+    , overload<Fs...> {
+  overload(F f, Fs... fs) : overload<F>(f), overload<Fs...>(fs...) {
+  }
+  using overload<F>::operator();
+  using overload<Fs...>::operator();
+};
+
+}  // namespace detail
+
+template <class... F>
+auto overloaded(F... f) {
+  return detail::overload<F...>(f...);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/Clocks.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/Clocks.cpp
new file mode 100644
index 0000000000..9c0543a505
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/Clocks.cpp
@@ -0,0 +1,35 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/Clocks.h"
+
+#include <chrono>
+
+namespace td {
+
+ClocksDefault::Duration ClocksDefault::monotonic() {
+  auto duration = std::chrono::steady_clock::now().time_since_epoch();
+  return static_cast<double>(std::chrono::duration_cast<std::chrono::nanoseconds>(duration).count()) * 1e-9;
+}
+
+ClocksDefault::Duration ClocksDefault::system() {
+  auto duration = std::chrono::system_clock::now().time_since_epoch();
+  return static_cast<double>(std::chrono::duration_cast<std::chrono::nanoseconds>(duration).count()) * 1e-9;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/Clocks.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/Clocks.h
new file mode 100644
index 0000000000..d64db3e40e
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/Clocks.h
@@ -0,0 +1,40 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace td {
+
+class ClocksBase {
+ public:
+  using Duration = double;
+};
+
+// TODO: (maybe) write system specific functions.
+class ClocksDefault {
+ public:
+  using Duration = ClocksBase::Duration;
+
+  static Duration monotonic();
+
+  static Duration system();
+};
+
+using Clocks = ClocksDefault;
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/CxCli.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/CxCli.h
new file mode 100644
index 0000000000..cac9493ed6
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/CxCli.h
@@ -0,0 +1,159 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#include "td/utils/common.h"
+#undef small
+
+#if TD_WINRT
+
+#include "td/utils/port/wstring_convert.h"
+
+#include "collection.h"
+
+#include <cstdint>
+#include <map>
+#include <mutex>
+
+#define REF_NEW ref new
+#define CLRCALL
+#define DEPRECATED_ATTRIBUTE(message) ::Windows::Foundation::Metadata::Deprecated(message,\
+                                      ::Windows::Foundation::Metadata::DeprecationType::Deprecate, 0x0)
+
+namespace CxCli {
+
+using Windows::Foundation::Collections::IVector;
+#define Array IVector
+using Platform::Collections::Vector;
+#define ArraySize(arr) ((arr)->Size)
+#define ArrayGet(arr, index) ((arr)->GetAt(index))
+#define ArraySet(arr, index, value) ((arr)->SetAt((index), (value)))
+#define ArrayIndexType unsigned
+
+using Platform::String;
+
+using Platform::NullReferenceException;
+
+template <class Key, class Value> class ConcurrentDictionary {
+public:
+  bool TryGetValue(Key key, Value &value) {
+    std::lock_guard<std::mutex> guard(mutex_);
+    auto it = impl_.find(key);
+    if (it == impl_.end()) {
+      return false;
+    }
+    value = it->second;
+    return true;
+  }
+  bool TryRemove(Key key, Value &value) {
+    std::lock_guard<std::mutex> guard(mutex_);
+    auto it = impl_.find(key);
+    if (it == impl_.end()) {
+      return false;
+    }
+    value = std::move(it->second);
+    impl_.erase(it);
+    return true;
+  }
+  Value &operator [] (Key key) {
+    std::lock_guard<std::mutex> guard(mutex_);
+    return impl_[key];
+  }
+private:
+  std::mutex mutex_;
+  std::map<Key, Value> impl_;
+};
+
+inline std::int64_t Increment(volatile std::int64_t &value) {
+  return InterlockedIncrement64(&value);
+}
+
+inline std::string string_to_unmanaged(String^ str) {
+  if (!str) {
+    return std::string();
+  }
+  return td::from_wstring(str->Data(), str->Length()).ok();
+}
+
+inline String^ string_from_unmanaged(const std::string &from) {
+  auto tmp = td::to_wstring(from).ok();
+  return REF_NEW String(tmp.c_str(), static_cast<unsigned>(tmp.size()));
+}
+
+} // namespace CxCli
+
+#elif TD_CLI
+
+#define REF_NEW gcnew
+#define CLRCALL __clrcall
+#define DEPRECATED_ATTRIBUTE(message) System::ObsoleteAttribute(message)
+
+namespace CxCli {
+
+using uint8 = td::uint8;
+using int32 = td::int32;
+using int64 = td::int64;
+using float64 = double;
+
+#define Array array
+#define Vector array
+#define ArraySize(arr) ((arr)->Length)
+#define ArrayGet(arr, index) ((arr)[index])
+#define ArraySet(arr, index, value) ((arr)[index] = (value))
+#define ArrayIndexType int
+
+using System::String;
+
+using System::NullReferenceException;
+
+using System::Collections::Concurrent::ConcurrentDictionary;
+
+inline std::int64_t Increment(std::int64_t %value) {
+  return System::Threading::Interlocked::Increment(value);
+}
+
+inline std::string string_to_unmanaged(String^ str) {
+  if (!str || str->Length == 0) {
+    return std::string();
+  }
+
+  Array<System::Byte>^ bytes = System::Text::Encoding::UTF8->GetBytes(str);
+  cli::pin_ptr<System::Byte> pinned_ptr = &bytes[0];
+  std::string result(reinterpret_cast<const char *>(&pinned_ptr[0]), bytes->Length);
+  return result;
+}
+
+inline String^ string_from_unmanaged(const std::string &from) {
+  if (from.empty()) {
+    return String::Empty;
+  }
+
+  Array<System::Byte>^ bytes = REF_NEW Vector<System::Byte>(static_cast<ArrayIndexType>(from.size()));
+  cli::pin_ptr<System::Byte> pinned_ptr = &bytes[0];
+  for (size_t i = 0; i < from.size(); ++i) {
+    pinned_ptr[i] = from[i];
+  }
+  return System::Text::Encoding::UTF8->GetString(bytes);
+}
+
+} // namespace CxCli
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/EventFd.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/EventFd.h
new file mode 100644
index 0000000000..63dad15996
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/EventFd.h
@@ -0,0 +1,45 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+// include all and let config.h decide
+#include "td/utils/port/detail/EventFdBsd.h"
+#include "td/utils/port/detail/EventFdLinux.h"
+#include "td/utils/port/detail/EventFdWindows.h"
+
+namespace td {
+
+// clang-format off
+
+#if TD_EVENTFD_LINUX
+  using EventFd = detail::EventFdLinux;
+#elif TD_EVENTFD_BSD
+  using EventFd = detail::EventFdBsd;
+#elif TD_EVENTFD_WINDOWS
+  using EventFd = detail::EventFdWindows;
+#elif TD_EVENTFD_UNSUPPORTED
+#else
+  #error "EventFd's implementation is not defined"
+#endif
+
+// clang-format on
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/EventFdBase.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/EventFdBase.h
new file mode 100644
index 0000000000..5112ae4897
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/EventFdBase.h
@@ -0,0 +1,44 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/Status.h"
+
+namespace td {
+class EventFdBase {
+ public:
+  EventFdBase() = default;
+  EventFdBase(const EventFdBase &) = delete;
+  EventFdBase &operator=(const EventFdBase &) = delete;
+  EventFdBase(EventFdBase &&) = default;
+  EventFdBase &operator=(EventFdBase &&) = default;
+  virtual ~EventFdBase() = default;
+
+  virtual void init() = 0;
+  virtual bool empty() = 0;
+  virtual void close() = 0;
+  virtual PollableFdInfo &get_poll_info() = 0;
+  virtual Status get_pending_error() TD_WARN_UNUSED_RESULT = 0;
+  virtual void release() = 0;
+  virtual void acquire() = 0;
+  virtual void wait(int timeout_ms) = 0;
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/FileFd.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/FileFd.cpp
new file mode 100644
index 0000000000..37e26274c3
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/FileFd.cpp
@@ -0,0 +1,587 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/FileFd.h"
+
+#if TD_PORT_WINDOWS
+#include "td/utils/port/Stat.h"
+#include "td/utils/port/wstring_convert.h"
+#endif
+
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/PollFlags.h"
+#include "td/utils/port/sleep.h"
+#include "td/utils/ScopeGuard.h"
+#include "td/utils/StringBuilder.h"
+
+#include <cstring>
+#include <mutex>
+#include <unordered_set>
+
+#if TD_PORT_POSIX
+#include <fcntl.h>
+#include <sys/file.h>
+#include <sys/types.h>
+#include <sys/uio.h>
+#include <unistd.h>
+#endif
+
+namespace td {
+
+namespace {
+
+struct PrintFlags {
+  int32 flags;
+};
+
+StringBuilder &operator<<(StringBuilder &sb, const PrintFlags &print_flags) {
+  auto flags = print_flags.flags;
+  if (flags & ~(FileFd::Write | FileFd::Read | FileFd::Truncate | FileFd::Create | FileFd::Append | FileFd::CreateNew |
+                FileFd::Direct | FileFd::WinStat)) {
+    return sb << "opened with invalid flags " << flags;
+  }
+
+  if (flags & FileFd::Create) {
+    sb << "opened/created ";
+  } else if (flags & FileFd::CreateNew) {
+    sb << "created ";
+  } else {
+    sb << "opened ";
+  }
+
+  if ((flags & FileFd::Write) && (flags & FileFd::Read)) {
+    if (flags & FileFd::Append) {
+      sb << "for reading and appending";
+    } else {
+      sb << "for reading and writing";
+    }
+  } else if (flags & FileFd::Write) {
+    if (flags & FileFd::Append) {
+      sb << "for appending";
+    } else {
+      sb << "for writing";
+    }
+  } else if (flags & FileFd::Read) {
+    sb << "for reading";
+  } else {
+    sb << "for nothing";
+  }
+
+  if (flags & FileFd::Truncate) {
+    sb << " with truncation";
+  }
+  if (flags & FileFd::Direct) {
+    sb << " for direct io";
+  }
+  if (flags & FileFd::WinStat) {
+    sb << " for stat";
+  }
+  return sb;
+}
+
+}  // namespace
+
+namespace detail {
+class FileFdImpl {
+ public:
+  PollableFdInfo info;
+};
+}  // namespace detail
+
+FileFd::FileFd() = default;
+FileFd::FileFd(FileFd &&) = default;
+FileFd &FileFd::operator=(FileFd &&) = default;
+FileFd::~FileFd() = default;
+
+FileFd::FileFd(unique_ptr<detail::FileFdImpl> impl) : impl_(std::move(impl)) {
+}
+
+Result<FileFd> FileFd::open(CSlice filepath, int32 flags, int32 mode) {
+  if (flags & ~(Write | Read | Truncate | Create | Append | CreateNew | Direct | WinStat)) {
+    return Status::Error(PSLICE() << "File \"" << filepath << "\" has failed to be " << PrintFlags{flags});
+  }
+
+  if ((flags & (Write | Read)) == 0) {
+    return Status::Error(PSLICE() << "File \"" << filepath << "\" can't be " << PrintFlags{flags});
+  }
+
+#if TD_PORT_POSIX
+  int native_flags = 0;
+
+  if ((flags & Write) && (flags & Read)) {
+    native_flags |= O_RDWR;
+  } else if (flags & Write) {
+    native_flags |= O_WRONLY;
+  } else {
+    CHECK(flags & Read);
+    native_flags |= O_RDONLY;
+  }
+
+  if (flags & Truncate) {
+    native_flags |= O_TRUNC;
+  }
+
+  if (flags & Create) {
+    native_flags |= O_CREAT;
+  } else if (flags & CreateNew) {
+    native_flags |= O_CREAT;
+    native_flags |= O_EXCL;
+  }
+
+  if (flags & Append) {
+    native_flags |= O_APPEND;
+  }
+
+#if TD_LINUX
+  if (flags & Direct) {
+    native_flags |= O_DIRECT;
+  }
+#endif
+
+  int native_fd = detail::skip_eintr([&] { return ::open(filepath.c_str(), native_flags, static_cast<mode_t>(mode)); });
+  if (native_fd < 0) {
+    return OS_ERROR(PSLICE() << "File \"" << filepath << "\" can't be " << PrintFlags{flags});
+  }
+  return from_native_fd(NativeFd(native_fd));
+#elif TD_PORT_WINDOWS
+  // TODO: support modes
+  auto r_filepath = to_wstring(filepath);
+  if (r_filepath.is_error()) {
+    return Status::Error(PSLICE() << "Failed to convert file path \" << filepath << \" to UTF-16");
+  }
+  auto w_filepath = r_filepath.move_as_ok();
+  DWORD desired_access = 0;
+  if ((flags & Write) && (flags & Read)) {
+    desired_access |= GENERIC_READ | GENERIC_WRITE;
+  } else if (flags & Write) {
+    desired_access |= GENERIC_WRITE;
+  } else {
+    CHECK(flags & Read);
+    desired_access |= GENERIC_READ;
+  }
+
+  // TODO: share mode
+  DWORD share_mode = FILE_SHARE_READ | FILE_SHARE_DELETE | FILE_SHARE_WRITE;
+
+  DWORD creation_disposition = 0;
+  if (flags & Create) {
+    if (flags & Truncate) {
+      creation_disposition = CREATE_ALWAYS;
+    } else {
+      creation_disposition = OPEN_ALWAYS;
+    }
+  } else if (flags & CreateNew) {
+    creation_disposition = CREATE_NEW;
+  } else {
+    if (flags & Truncate) {
+      creation_disposition = TRUNCATE_EXISTING;
+    } else {
+      creation_disposition = OPEN_EXISTING;
+    }
+  }
+
+  DWORD native_flags = 0;
+  if (flags & Direct) {
+    native_flags |= FILE_FLAG_WRITE_THROUGH | FILE_FLAG_NO_BUFFERING;
+  }
+  if (flags & WinStat) {
+    native_flags |= FILE_FLAG_BACKUP_SEMANTICS;
+  }
+#if WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_DESKTOP | WINAPI_PARTITION_SYSTEM)
+  auto handle =
+      CreateFile(w_filepath.c_str(), desired_access, share_mode, nullptr, creation_disposition, native_flags, nullptr);
+#else
+  CREATEFILE2_EXTENDED_PARAMETERS extended_parameters;
+  std::memset(&extended_parameters, 0, sizeof(extended_parameters));
+  extended_parameters.dwSize = sizeof(extended_parameters);
+  extended_parameters.dwFileAttributes = FILE_ATTRIBUTE_NORMAL;
+  extended_parameters.dwFileFlags = native_flags;
+  auto handle = CreateFile2(w_filepath.c_str(), desired_access, share_mode, creation_disposition, &extended_parameters);
+#endif
+  if (handle == INVALID_HANDLE_VALUE) {
+    return OS_ERROR(PSLICE() << "File \"" << filepath << "\" can't be " << PrintFlags{flags});
+  }
+  auto native_fd = NativeFd(handle);
+  if (flags & Append) {
+    LARGE_INTEGER offset;
+    offset.QuadPart = 0;
+    auto set_pointer_res = SetFilePointerEx(handle, offset, nullptr, FILE_END);
+    if (!set_pointer_res) {
+      return OS_ERROR(PSLICE() << "Failed to seek to the end of file \"" << filepath << "\"");
+    }
+  }
+  return from_native_fd(std::move(native_fd));
+#endif
+}
+
+FileFd FileFd::from_native_fd(NativeFd native_fd) {
+  auto impl = make_unique<detail::FileFdImpl>();
+  impl->info.set_native_fd(std::move(native_fd));
+  impl->info.add_flags(PollFlags::Write());
+  return FileFd(std::move(impl));
+}
+
+Result<size_t> FileFd::write(Slice slice) {
+  auto native_fd = get_native_fd().fd();
+#if TD_PORT_POSIX
+  auto bytes_written = detail::skip_eintr([&] { return ::write(native_fd, slice.begin(), slice.size()); });
+  bool success = bytes_written >= 0;
+#elif TD_PORT_WINDOWS
+  DWORD bytes_written = 0;
+  BOOL success = WriteFile(native_fd, slice.data(), narrow_cast<DWORD>(slice.size()), &bytes_written, nullptr);
+#endif
+  if (success) {
+    return narrow_cast<size_t>(bytes_written);
+  }
+  return OS_ERROR(PSLICE() << "Write to " << get_native_fd() << " has failed");
+}
+
+Result<size_t> FileFd::writev(Span<IoSlice> slices) {
+#if TD_PORT_POSIX
+  auto native_fd = get_native_fd().fd();
+  TRY_RESULT(slices_size, narrow_cast_safe<int>(slices.size()));
+  auto bytes_written = detail::skip_eintr([&] { return ::writev(native_fd, slices.begin(), slices_size); });
+  bool success = bytes_written >= 0;
+  if (success) {
+    return narrow_cast<size_t>(bytes_written);
+  }
+  return OS_ERROR(PSLICE() << "Writev to " << get_native_fd() << " has failed");
+#else
+  size_t res = 0;
+  for (auto slice : slices) {
+    TRY_RESULT(size, write(slice));
+    res += size;
+  }
+  return res;
+#endif
+}
+
+Result<size_t> FileFd::read(MutableSlice slice) {
+  auto native_fd = get_native_fd().fd();
+#if TD_PORT_POSIX
+  auto bytes_read = detail::skip_eintr([&] { return ::read(native_fd, slice.begin(), slice.size()); });
+  bool success = bytes_read >= 0;
+  if (!success) {
+    auto read_errno = errno;
+    if (read_errno == EAGAIN
+#if EAGAIN != EWOULDBLOCK
+        || read_errno == EWOULDBLOCK
+#endif
+    ) {
+      success = true;
+      bytes_read = 0;
+    }
+  }
+  bool is_eof = success && narrow_cast<size_t>(bytes_read) < slice.size();
+#elif TD_PORT_WINDOWS
+  DWORD bytes_read = 0;
+  BOOL success = ReadFile(native_fd, slice.data(), narrow_cast<DWORD>(slice.size()), &bytes_read, nullptr);
+  bool is_eof = bytes_read == 0;
+#endif
+  if (success) {
+    if (is_eof) {
+      get_poll_info().clear_flags(PollFlags::Read());
+    }
+    return static_cast<size_t>(bytes_read);
+  }
+  return OS_ERROR(PSLICE() << "Read from " << get_native_fd() << " has failed");
+}
+
+Result<size_t> FileFd::pwrite(Slice slice, int64 offset) {
+  if (offset < 0) {
+    return Status::Error("Offset must be non-negative");
+  }
+  auto native_fd = get_native_fd().fd();
+#if TD_PORT_POSIX
+  TRY_RESULT(offset_off_t, narrow_cast_safe<off_t>(offset));
+  auto bytes_written =
+      detail::skip_eintr([&] { return ::pwrite(native_fd, slice.begin(), slice.size(), offset_off_t); });
+  bool success = bytes_written >= 0;
+#elif TD_PORT_WINDOWS
+  DWORD bytes_written = 0;
+  OVERLAPPED overlapped;
+  std::memset(&overlapped, 0, sizeof(overlapped));
+  overlapped.Offset = static_cast<DWORD>(offset);
+  overlapped.OffsetHigh = static_cast<DWORD>(offset >> 32);
+  BOOL success = WriteFile(native_fd, slice.data(), narrow_cast<DWORD>(slice.size()), &bytes_written, &overlapped);
+#endif
+  if (success) {
+    return narrow_cast<size_t>(bytes_written);
+  }
+  return OS_ERROR(PSLICE() << "Pwrite to " << get_native_fd() << " at offset " << offset << " has failed");
+}
+
+Result<size_t> FileFd::pread(MutableSlice slice, int64 offset) const {
+  if (offset < 0) {
+    return Status::Error("Offset must be non-negative");
+  }
+  auto native_fd = get_native_fd().fd();
+#if TD_PORT_POSIX
+  TRY_RESULT(offset_off_t, narrow_cast_safe<off_t>(offset));
+  auto bytes_read = detail::skip_eintr([&] { return ::pread(native_fd, slice.begin(), slice.size(), offset_off_t); });
+  bool success = bytes_read >= 0;
+#elif TD_PORT_WINDOWS
+  DWORD bytes_read = 0;
+  OVERLAPPED overlapped;
+  std::memset(&overlapped, 0, sizeof(overlapped));
+  overlapped.Offset = static_cast<DWORD>(offset);
+  overlapped.OffsetHigh = static_cast<DWORD>(offset >> 32);
+  BOOL success = ReadFile(native_fd, slice.data(), narrow_cast<DWORD>(slice.size()), &bytes_read, &overlapped);
+#endif
+  if (success) {
+    return narrow_cast<size_t>(bytes_read);
+  }
+  return OS_ERROR(PSLICE() << "Pread from " << get_native_fd() << " at offset " << offset << " has failed");
+}
+
+static std::mutex in_process_lock_mutex;
+static std::unordered_set<string> locked_files;
+
+static Status create_local_lock(const string &path, int32 &max_tries) {
+  while (true) {
+    {  // mutex lock scope
+      std::lock_guard<std::mutex> lock(in_process_lock_mutex);
+      if (locked_files.find(path) == locked_files.end()) {
+        VLOG(fd) << "Lock file \"" << path << '"';
+        locked_files.insert(path);
+        return Status::OK();
+      }
+    }
+
+    if (--max_tries <= 0) {
+      return Status::Error(
+          0, PSLICE() << "Can't lock file \"" << path << "\", because it is already in use by current program");
+    }
+
+    usleep_for(100000);
+  }
+}
+
+Status FileFd::lock(const LockFlags flags, const string &path, int32 max_tries) {
+  if (max_tries <= 0) {
+    return Status::Error(0, "Can't lock file: wrong max_tries");
+  }
+
+  bool need_local_unlock = false;
+  if (!path.empty()) {
+    if (flags == LockFlags::Unlock) {
+      need_local_unlock = true;
+    } else if (flags == LockFlags::Read) {
+      LOG(FATAL) << "Local locking in Read mode is unsupported";
+    } else {
+      CHECK(flags == LockFlags::Write);
+      VLOG(fd) << "Trying to lock file \"" << path << '"';
+      TRY_STATUS(create_local_lock(path, max_tries));
+      need_local_unlock = true;
+    }
+  }
+  SCOPE_EXIT {
+    if (need_local_unlock) {
+      remove_local_lock(path);
+    }
+  };
+
+#if TD_PORT_POSIX
+  auto native_fd = get_native_fd().fd();
+#elif TD_PORT_WINDOWS
+  auto native_fd = get_native_fd().fd();
+#endif
+  while (true) {
+#if TD_PORT_POSIX
+    struct flock lock;
+    std::memset(&lock, 0, sizeof(lock));
+
+    lock.l_type = static_cast<short>([&] {
+      switch (flags) {
+        case LockFlags::Read:
+          return F_RDLCK;
+        case LockFlags::Write:
+          return F_WRLCK;
+        case LockFlags::Unlock:
+          return F_UNLCK;
+        default:
+          UNREACHABLE();
+          return F_UNLCK;
+      }
+    }());
+
+    lock.l_whence = SEEK_SET;
+    if (fcntl(native_fd, F_SETLK, &lock) == -1) {
+      if (errno == EAGAIN) {
+#elif TD_PORT_WINDOWS
+    OVERLAPPED overlapped;
+    std::memset(&overlapped, 0, sizeof(overlapped));
+
+    BOOL result;
+    if (flags == LockFlags::Unlock) {
+      result = UnlockFileEx(native_fd, 0, MAXDWORD, MAXDWORD, &overlapped);
+    } else {
+      DWORD dw_flags = LOCKFILE_FAIL_IMMEDIATELY;
+      if (flags == LockFlags::Write) {
+        dw_flags |= LOCKFILE_EXCLUSIVE_LOCK;
+      }
+
+      result = LockFileEx(native_fd, dw_flags, 0, MAXDWORD, MAXDWORD, &overlapped);
+    }
+
+    if (!result) {
+      if (GetLastError() == ERROR_LOCK_VIOLATION) {
+#endif
+        if (--max_tries > 0) {
+          usleep_for(100000);
+          continue;
+        }
+
+        return OS_ERROR(PSLICE() << "Can't lock file \"" << path
+                                 << "\", because it is already in use; check for another program instance running");
+      }
+
+      return OS_ERROR("Can't lock file");
+    }
+
+    break;
+  }
+
+  if (flags == LockFlags::Write) {
+    need_local_unlock = false;
+  }
+  return Status::OK();
+}
+
+void FileFd::remove_local_lock(const string &path) {
+  if (!path.empty()) {
+    VLOG(fd) << "Unlock file \"" << path << '"';
+    std::unique_lock<std::mutex> lock(in_process_lock_mutex);
+    auto erased = locked_files.erase(path);
+    CHECK(erased > 0);
+  }
+}
+
+void FileFd::close() {
+  impl_.reset();
+}
+
+bool FileFd::empty() const {
+  return !impl_;
+}
+
+const NativeFd &FileFd::get_native_fd() const {
+  return get_poll_info().native_fd();
+}
+
+NativeFd FileFd::move_as_native_fd() {
+  auto res = get_poll_info().move_as_native_fd();
+  impl_.reset();
+  return res;
+}
+
+Result<int64> FileFd::get_size() const {
+  TRY_RESULT(s, stat());
+  return s.size_;
+}
+
+#if TD_PORT_WINDOWS
+static uint64 filetime_to_unix_time_nsec(LONGLONG filetime) {
+  const auto FILETIME_UNIX_TIME_DIFF = 116444736000000000ll;
+  return static_cast<uint64>((filetime - FILETIME_UNIX_TIME_DIFF) * 100);
+}
+#endif
+
+Result<Stat> FileFd::stat() const {
+  CHECK(!empty());
+#if TD_PORT_POSIX
+  return detail::fstat(get_native_fd().fd());
+#elif TD_PORT_WINDOWS
+  Stat res;
+
+  FILE_BASIC_INFO basic_info;
+  auto status = GetFileInformationByHandleEx(get_native_fd().fd(), FileBasicInfo, &basic_info, sizeof(basic_info));
+  if (!status) {
+    return OS_ERROR("Get FileBasicInfo failed");
+  }
+  res.atime_nsec_ = filetime_to_unix_time_nsec(basic_info.LastAccessTime.QuadPart);
+  res.mtime_nsec_ = filetime_to_unix_time_nsec(basic_info.LastWriteTime.QuadPart);
+  res.is_dir_ = (basic_info.FileAttributes & FILE_ATTRIBUTE_DIRECTORY) != 0;
+  res.is_reg_ = !res.is_dir_;  // TODO this is still wrong
+
+  FILE_STANDARD_INFO standard_info;
+  status = GetFileInformationByHandleEx(get_native_fd().fd(), FileStandardInfo, &standard_info, sizeof(standard_info));
+  if (!status) {
+    return OS_ERROR("Get FileStandardInfo failed");
+  }
+  res.size_ = standard_info.EndOfFile.QuadPart;
+
+  return res;
+#endif
+}
+
+Status FileFd::sync() {
+  CHECK(!empty());
+#if TD_PORT_POSIX
+#if TD_DARWIN
+  if (detail::skip_eintr([&] { return fcntl(get_native_fd().fd(), F_FULLFSYNC); }) == -1) {
+#else
+  if (detail::skip_eintr([&] { return fsync(get_native_fd().fd()); }) != 0) {
+#endif
+#elif TD_PORT_WINDOWS
+  if (FlushFileBuffers(get_native_fd().fd()) == 0) {
+#endif
+    return OS_ERROR("Sync failed");
+  }
+  return Status::OK();
+}
+
+Status FileFd::seek(int64 position) {
+  CHECK(!empty());
+#if TD_PORT_POSIX
+  TRY_RESULT(position_off_t, narrow_cast_safe<off_t>(position));
+  if (detail::skip_eintr([&] { return ::lseek(get_native_fd().fd(), position_off_t, SEEK_SET); }) < 0) {
+#elif TD_PORT_WINDOWS
+  LARGE_INTEGER offset;
+  offset.QuadPart = position;
+  if (SetFilePointerEx(get_native_fd().fd(), offset, nullptr, FILE_BEGIN) == 0) {
+#endif
+    return OS_ERROR("Seek failed");
+  }
+  return Status::OK();
+}
+
+Status FileFd::truncate_to_current_position(int64 current_position) {
+  CHECK(!empty());
+#if TD_PORT_POSIX
+  TRY_RESULT(current_position_off_t, narrow_cast_safe<off_t>(current_position));
+  if (detail::skip_eintr([&] { return ::ftruncate(get_native_fd().fd(), current_position_off_t); }) < 0) {
+#elif TD_PORT_WINDOWS
+  if (SetEndOfFile(get_native_fd().fd()) == 0) {
+#endif
+    return OS_ERROR("Truncate failed");
+  }
+  return Status::OK();
+}
+PollableFdInfo &FileFd::get_poll_info() {
+  CHECK(!empty());
+  return impl_->info;
+}
+const PollableFdInfo &FileFd::get_poll_info() const {
+  CHECK(!empty());
+  return impl_->info;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/FileFd.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/FileFd.h
new file mode 100644
index 0000000000..a69a4aba1a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/FileFd.h
@@ -0,0 +1,87 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#include "td/utils/common.h"
+#include "td/utils/port/detail/NativeFd.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/IoSlice.h"
+#include "td/utils/port/Stat.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Span.h"
+#include "td/utils/Status.h"
+
+namespace td {
+namespace detail {
+class FileFdImpl;
+}
+
+class FileFd {
+ public:
+  FileFd();
+  FileFd(FileFd &&);
+  FileFd &operator=(FileFd &&);
+  ~FileFd();
+  FileFd(const FileFd &) = delete;
+  FileFd &operator=(const FileFd &) = delete;
+
+  enum Flags : int32 { Write = 1, Read = 2, Truncate = 4, Create = 8, Append = 16, CreateNew = 32, Direct = 64 };
+  enum PrivateFlags : int32 { WinStat = 128 };
+
+  static Result<FileFd> open(CSlice filepath, int32 flags, int32 mode = 0600) TD_WARN_UNUSED_RESULT;
+  static FileFd from_native_fd(NativeFd fd) TD_WARN_UNUSED_RESULT;
+
+  Result<size_t> write(Slice slice) TD_WARN_UNUSED_RESULT;
+  Result<size_t> writev(Span<IoSlice> slices) TD_WARN_UNUSED_RESULT;
+  Result<size_t> read(MutableSlice slice) TD_WARN_UNUSED_RESULT;
+
+  Result<size_t> pwrite(Slice slice, int64 offset) TD_WARN_UNUSED_RESULT;
+  Result<size_t> pread(MutableSlice slice, int64 offset) const TD_WARN_UNUSED_RESULT;
+
+  enum class LockFlags { Write, Read, Unlock };
+  Status lock(const LockFlags flags, const string &path, int32 max_tries) TD_WARN_UNUSED_RESULT;
+  static void remove_local_lock(const string &path);
+
+  PollableFdInfo &get_poll_info();
+  const PollableFdInfo &get_poll_info() const;
+  void close();
+  bool empty() const;
+
+  Result<int64> get_size() const;
+
+  Result<Stat> stat() const;
+
+  Status sync() TD_WARN_UNUSED_RESULT;
+
+  Status seek(int64 position) TD_WARN_UNUSED_RESULT;
+
+  Status truncate_to_current_position(int64 current_position) TD_WARN_UNUSED_RESULT;
+
+  const NativeFd &get_native_fd() const;
+  NativeFd move_as_native_fd();
+
+ private:
+  unique_ptr<detail::FileFdImpl> impl_;
+
+  explicit FileFd(unique_ptr<detail::FileFdImpl> impl);
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/IPAddress.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/IPAddress.cpp
new file mode 100644
index 0000000000..9862091db2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/IPAddress.cpp
@@ -0,0 +1,622 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#define _WINSOCK_DEPRECATED_NO_WARNINGS  // we need to use inet_addr instead of inet_pton
+
+#include "td/utils/port/IPAddress.h"
+
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/SocketFd.h"
+#include "td/utils/port/thread_local.h"
+#include "td/utils/ScopeGuard.h"
+#include "td/utils/Slice.h"
+#include "td/utils/utf8.h"
+
+#if TD_WINDOWS
+#include "td/utils/port/wstring_convert.h"
+#else
+#include <netdb.h>
+#include <netinet/tcp.h>
+#include <sys/types.h>
+#endif
+
+#include <cstring>
+#include <limits>
+
+namespace td {
+
+static bool is_ascii_host_char(char c) {
+  return static_cast<unsigned char>(c) <= 127;
+}
+
+static bool is_ascii_host(Slice host) {
+  for (auto c : host) {
+    if (!is_ascii_host_char(c)) {
+      return false;
+    }
+  }
+  return true;
+}
+
+#if !TD_WINDOWS
+static void punycode(string &result, Slice part) {
+  vector<uint32> codes;
+  codes.reserve(utf8_length(part));
+  uint32 processed = 0;
+  auto begin = part.ubegin();
+  auto end = part.uend();
+  while (begin != end) {
+    uint32 code;
+    begin = next_utf8_unsafe(begin, &code, "punycode");
+    if (code <= 127u) {
+      result += to_lower(static_cast<char>(code));
+      processed++;
+    }
+    codes.push_back(code);
+  }
+
+  if (processed > 0) {
+    result += '-';
+  }
+
+  uint32 n = 127;
+  uint32 delta = 0;
+  int bias = -72;
+  bool is_first = true;
+  while (processed < codes.size()) {
+    // choose lowest not processed code
+    uint32 next_n = 0x110000;
+    for (auto code : codes) {
+      if (code > n && code < next_n) {
+        next_n = code;
+      }
+    }
+    delta += (next_n - n - 1) * (processed + 1);
+
+    for (auto code : codes) {
+      if (code < next_n) {
+        delta++;
+      }
+
+      if (code == next_n) {
+        // found next symbol, encode delta
+        int left = static_cast<int>(delta);
+        while (true) {
+          bias += 36;
+          auto t = clamp(bias, 1, 26);
+          if (left < t) {
+            result += static_cast<char>(left + 'a');
+            break;
+          }
+
+          left -= t;
+          auto digit = t + left % (36 - t);
+          result += static_cast<char>(digit < 26 ? digit + 'a' : digit - 26 + '0');
+          left /= 36 - t;
+        }
+        processed++;
+
+        // update bias
+        if (is_first) {
+          delta /= 700;
+          is_first = false;
+        } else {
+          delta /= 2;
+        }
+        delta += delta / processed;
+
+        bias = 0;
+        while (delta > 35 * 13) {
+          delta /= 35;
+          bias -= 36;
+        }
+        bias -= static_cast<int>(36 * delta / (delta + 38));
+        delta = 0;
+      }
+    }
+
+    delta++;
+    n = next_n;
+  }
+}
+#endif
+
+Result<string> idn_to_ascii(CSlice host) {
+  if (is_ascii_host(host)) {
+    return to_lower(host);
+  }
+  if (!check_utf8(host)) {
+    return Status::Error("Host name must be encoded in UTF-8");
+  }
+
+  const int MAX_DNS_NAME_LENGTH = 255;
+  if (host.size() >= MAX_DNS_NAME_LENGTH * 4) {  // upper bound, 4 characters per symbol
+    return Status::Error("Host name is too long");
+  }
+
+#if TD_WINDOWS
+  TRY_RESULT(whost, to_wstring(host));
+  wchar_t punycode[MAX_DNS_NAME_LENGTH + 1];
+  int result_length =
+      IdnToAscii(IDN_ALLOW_UNASSIGNED, whost.c_str(), narrow_cast<int>(whost.size()), punycode, MAX_DNS_NAME_LENGTH);
+  if (result_length == 0) {
+    return Status::Error("Host can't be converted to ASCII");
+  }
+
+  TRY_RESULT(idn_host, from_wstring(punycode, result_length));
+  return idn_host;
+#else
+  auto parts = full_split(Slice(host), '.');
+  bool is_first = true;
+  string result;
+  result.reserve(host.size());
+  for (auto part : parts) {
+    if (!is_first) {
+      result += '.';
+    }
+    if (is_ascii_host(part)) {
+      result.append(part.data(), part.size());
+    } else {
+      // TODO nameprep should be applied first, but punycode is better than nothing.
+      // It is better to use libidn/ICU here if available
+      result += "xn--";
+      punycode(result, part);
+    }
+    is_first = false;
+  }
+  return result;
+#endif
+}
+
+static CSlice get_ip_str(int family, const void *addr) {
+  const int buf_size = INET6_ADDRSTRLEN;
+  static TD_THREAD_LOCAL char *buf;
+  init_thread_local<char[]>(buf, buf_size);
+
+  const char *res = inet_ntop(family,
+#if TD_WINDOWS
+                              const_cast<PVOID>(addr),
+#else
+                              addr,
+#endif
+                              buf, buf_size);
+  if (res == nullptr) {
+    return CSlice();
+  } else {
+    return CSlice(res);
+  }
+}
+
+IPAddress::IPAddress() : is_valid_(false) {
+}
+
+bool IPAddress::is_valid() const {
+  return is_valid_;
+}
+
+bool IPAddress::is_reserved() const {
+  CHECK(is_valid());
+
+  if (is_ipv6()) {
+    // TODO proper check for reserved IPv6 addresses
+    return true;
+  }
+
+  uint32 ip = get_ipv4();
+  struct IpBlock {
+    CSlice ip;
+    int mask;
+    IpBlock(CSlice ip, int mask) : ip(ip), mask(mask) {
+    }
+  };
+  static const IpBlock blocks[] = {{"0.0.0.0", 8},      {"10.0.0.0", 8},     {"100.64.0.0", 10}, {"127.0.0.0", 8},
+                                   {"169.254.0.0", 16}, {"172.16.0.0", 12},  {"192.0.0.0", 24},  {"192.0.2.0", 24},
+                                   {"192.88.99.0", 24}, {"192.168.0.0", 16}, {"198.18.0.0", 15}, {"198.51.100.0", 24},
+                                   {"203.0.113.0", 24}, {"224.0.0.0", 3}};
+  for (auto &block : blocks) {
+    IPAddress block_ip_address;
+    block_ip_address.init_ipv4_port(block.ip, 80).ensure();
+    uint32 range = block_ip_address.get_ipv4();
+    CHECK(block.mask != 0);
+    uint32 mask = std::numeric_limits<uint32>::max() >> (32 - block.mask) << (32 - block.mask);
+    if ((ip & mask) == (range & mask)) {
+      return true;
+    }
+  }
+  return false;
+}
+
+const sockaddr *IPAddress::get_sockaddr() const {
+  CHECK(is_valid());
+  return &sockaddr_;
+}
+
+size_t IPAddress::get_sockaddr_len() const {
+  CHECK(is_valid());
+  switch (sockaddr_.sa_family) {
+    case AF_INET6:
+      return sizeof(ipv6_addr_);
+    case AF_INET:
+      return sizeof(ipv4_addr_);
+    default:
+      LOG(FATAL) << "Unknown address family";
+      return 0;
+  }
+}
+
+int IPAddress::get_address_family() const {
+  return get_sockaddr()->sa_family;
+}
+
+bool IPAddress::is_ipv4() const {
+  return is_valid() && get_address_family() == AF_INET;
+}
+
+bool IPAddress::is_ipv6() const {
+  return is_valid() && get_address_family() == AF_INET6;
+}
+
+uint32 IPAddress::get_ipv4() const {
+  CHECK(is_valid());
+  CHECK(is_ipv4());
+  return htonl(ipv4_addr_.sin_addr.s_addr);
+}
+
+Slice IPAddress::get_ipv6() const {
+  static_assert(sizeof(ipv6_addr_.sin6_addr) == 16, "ipv6 size == 16");
+  CHECK(is_valid());
+  CHECK(!is_ipv4());
+  return Slice(ipv6_addr_.sin6_addr.s6_addr, 16);
+}
+
+IPAddress IPAddress::get_any_addr() const {
+  IPAddress res;
+  switch (get_address_family()) {
+    case AF_INET6:
+      res.init_ipv6_any();
+      break;
+    case AF_INET:
+      res.init_ipv4_any();
+      break;
+    default:
+      LOG(FATAL) << "Unknown address family";
+  }
+  return res;
+}
+
+void IPAddress::init_ipv4_any() {
+  is_valid_ = true;
+  std::memset(&ipv4_addr_, 0, sizeof(ipv4_addr_));
+  ipv4_addr_.sin_family = AF_INET;
+  ipv4_addr_.sin_addr.s_addr = INADDR_ANY;
+  ipv4_addr_.sin_port = 0;
+}
+
+void IPAddress::init_ipv6_any() {
+  is_valid_ = true;
+  std::memset(&ipv6_addr_, 0, sizeof(ipv6_addr_));
+  ipv6_addr_.sin6_family = AF_INET6;
+  ipv6_addr_.sin6_addr = in6addr_any;
+  ipv6_addr_.sin6_port = 0;
+}
+
+Status IPAddress::init_ipv6_port(CSlice ipv6, int port) {
+  is_valid_ = false;
+  if (port <= 0 || port >= (1 << 16)) {
+    return Status::Error(PSLICE() << "Invalid [port=" << port << "]");
+  }
+  std::memset(&ipv6_addr_, 0, sizeof(ipv6_addr_));
+  ipv6_addr_.sin6_family = AF_INET6;
+  ipv6_addr_.sin6_port = htons(static_cast<uint16>(port));
+  int err = inet_pton(AF_INET6, ipv6.c_str(), &ipv6_addr_.sin6_addr);
+  if (err == 0) {
+    return Status::Error(PSLICE() << "Failed inet_pton(AF_INET6, " << ipv6 << ")");
+  } else if (err == -1) {
+    return OS_SOCKET_ERROR(PSLICE() << "Failed inet_pton(AF_INET6, " << ipv6 << ")");
+  }
+  is_valid_ = true;
+  return Status::OK();
+}
+
+Status IPAddress::init_ipv6_as_ipv4_port(CSlice ipv4, int port) {
+  return init_ipv6_port(string("::FFFF:").append(ipv4.begin(), ipv4.size()), port);
+}
+
+Status IPAddress::init_ipv4_port(CSlice ipv4, int port) {
+  is_valid_ = false;
+  if (port <= 0 || port >= (1 << 16)) {
+    return Status::Error(PSLICE() << "Invalid [port=" << port << "]");
+  }
+  std::memset(&ipv4_addr_, 0, sizeof(ipv4_addr_));
+  ipv4_addr_.sin_family = AF_INET;
+  ipv4_addr_.sin_port = htons(static_cast<uint16>(port));
+  int err = inet_pton(AF_INET, ipv4.c_str(), &ipv4_addr_.sin_addr);
+  if (err == 0) {
+    return Status::Error(PSLICE() << "Failed inet_pton(AF_INET, " << ipv4 << ")");
+  } else if (err == -1) {
+    return OS_SOCKET_ERROR(PSLICE() << "Failed inet_pton(AF_INET, " << ipv4 << ")");
+  }
+  is_valid_ = true;
+  return Status::OK();
+}
+
+Result<IPAddress> IPAddress::get_ipv4_address(CSlice host) {
+  // sometimes inet_addr allows much more valid IPv4 hosts than inet_pton,
+  // like 0x12.0x34.0x56.0x78, or 0x12345678, or 0x7f.001
+  auto ipv4_numeric_addr = inet_addr(host.c_str());
+  if (ipv4_numeric_addr == INADDR_NONE) {
+    return Status::Error("Host is not valid IPv4 address");
+  }
+
+  host = ::td::get_ip_str(AF_INET, &ipv4_numeric_addr);
+  IPAddress result;
+  auto status = result.init_ipv4_port(host, 1);
+  if (status.is_error()) {
+    return std::move(status);
+  }
+  return std::move(result);
+}
+
+Result<IPAddress> IPAddress::get_ipv6_address(CSlice host) {
+  IPAddress result;
+  auto status = result.init_ipv6_port(host, 1);
+  if (status.is_error()) {
+    return std::move(status);
+  }
+  return std::move(result);
+}
+
+Status IPAddress::init_host_port(CSlice host, int port, bool prefer_ipv6) {
+  return init_host_port(host, PSLICE() << port, prefer_ipv6);
+}
+
+Status IPAddress::init_host_port(CSlice host, CSlice port, bool prefer_ipv6) {
+  is_valid_ = false;
+  if (host.empty()) {
+    return Status::Error("Host is empty");
+  }
+#if TD_WINDOWS
+  if (host == "..localmachine") {
+    return Status::Error("Host is invalid");
+  }
+#endif
+  TRY_RESULT(ascii_host, idn_to_ascii(host));
+  host = ascii_host;
+
+  // some getaddrinfo implementations use inet_pton instead of inet_aton and support only decimal-dotted IPv4 form,
+  // and so doesn't recognize 0x12.0x34.0x56.0x78, or 0x12345678, or 0x7f.001 as valid IPv4 addresses
+  auto ipv4_numeric_addr = inet_addr(host.c_str());
+  if (ipv4_numeric_addr != INADDR_NONE) {
+    host = ::td::get_ip_str(AF_INET, &ipv4_numeric_addr);
+  }
+
+  addrinfo hints;
+  addrinfo *info = nullptr;
+  std::memset(&hints, 0, sizeof(hints));
+  hints.ai_family = AF_UNSPEC;
+  hints.ai_socktype = SOCK_STREAM;
+  hints.ai_protocol = IPPROTO_TCP;
+  LOG(DEBUG + 10) << "Try to init IP address of " << host << " with port " << port;
+  auto err = getaddrinfo(host.c_str(), port.c_str(), &hints, &info);
+  if (err != 0) {
+#if TD_WINDOWS
+    return OS_SOCKET_ERROR("Failed to resolve host");
+#else
+    return Status::Error(PSLICE() << "Failed to resolve host: " << gai_strerror(err));
+#endif
+  }
+  SCOPE_EXIT {
+    freeaddrinfo(info);
+  };
+
+  addrinfo *best_info = nullptr;
+  for (auto *ptr = info; ptr != nullptr; ptr = ptr->ai_next) {
+    if (ptr->ai_family == AF_INET && (!prefer_ipv6 || best_info == nullptr)) {
+      // just use first IPv4 address if there is no IPv6 and it isn't preferred
+      best_info = ptr;
+      if (!prefer_ipv6) {
+        break;
+      }
+    }
+    if (ptr->ai_family == AF_INET6 && (prefer_ipv6 || best_info == nullptr)) {
+      // or first IPv6 address if there is no IPv4 and it isn't preferred
+      best_info = ptr;
+      if (prefer_ipv6) {
+        break;
+      }
+    }
+  }
+  if (best_info == nullptr) {
+    return Status::Error("Failed to find IPv4/IPv6 address");
+  }
+  return init_sockaddr(best_info->ai_addr, narrow_cast<socklen_t>(best_info->ai_addrlen));
+}
+
+Status IPAddress::init_host_port(CSlice host_port) {
+  auto pos = host_port.rfind(':');
+  if (pos == static_cast<size_t>(-1)) {
+    return Status::Error("Can't split string into host and port");
+  }
+  return init_host_port(host_port.substr(0, pos).str(), host_port.substr(pos + 1).str());
+}
+
+Status IPAddress::init_sockaddr(sockaddr *addr) {
+  if (addr->sa_family == AF_INET6) {
+    return init_sockaddr(addr, sizeof(ipv6_addr_));
+  } else if (addr->sa_family == AF_INET) {
+    return init_sockaddr(addr, sizeof(ipv4_addr_));
+  } else {
+    return init_sockaddr(addr, 0);
+  }
+}
+Status IPAddress::init_sockaddr(sockaddr *addr, socklen_t len) {
+  if (addr->sa_family == AF_INET6) {
+    CHECK(len == sizeof(ipv6_addr_));
+    std::memcpy(&ipv6_addr_, reinterpret_cast<sockaddr_in6 *>(addr), sizeof(ipv6_addr_));
+  } else if (addr->sa_family == AF_INET) {
+    CHECK(len == sizeof(ipv4_addr_));
+    std::memcpy(&ipv4_addr_, reinterpret_cast<sockaddr_in *>(addr), sizeof(ipv4_addr_));
+  } else {
+    return Status::Error(PSLICE() << "Unknown " << tag("sa_family", addr->sa_family));
+  }
+
+  is_valid_ = true;
+  LOG(DEBUG + 10) << "Have address " << get_ip_str() << " with port " << get_port();
+  return Status::OK();
+}
+
+Status IPAddress::init_socket_address(const SocketFd &socket_fd) {
+  is_valid_ = false;
+  auto socket = socket_fd.get_native_fd().socket();
+  socklen_t len = storage_size();
+  int ret = getsockname(socket, &sockaddr_, &len);
+  if (ret != 0) {
+    return OS_SOCKET_ERROR("Failed to get socket address");
+  }
+  is_valid_ = true;
+  return Status::OK();
+}
+
+Status IPAddress::init_peer_address(const SocketFd &socket_fd) {
+  is_valid_ = false;
+  auto socket = socket_fd.get_native_fd().socket();
+  socklen_t len = storage_size();
+  int ret = getpeername(socket, &sockaddr_, &len);
+  if (ret != 0) {
+    return OS_SOCKET_ERROR("Failed to get peer socket address");
+  }
+  is_valid_ = true;
+  return Status::OK();
+}
+
+CSlice IPAddress::ipv4_to_str(uint32 ipv4) {
+  ipv4 = ntohl(ipv4);
+  return ::td::get_ip_str(AF_INET, &ipv4);
+}
+
+CSlice IPAddress::ipv6_to_str(Slice ipv6) {
+  CHECK(ipv6.size() == 16);
+  return ::td::get_ip_str(AF_INET6, ipv6.ubegin());
+}
+
+Slice IPAddress::get_ip_str() const {
+  if (!is_valid()) {
+    return Slice("0.0.0.0");
+  }
+
+  switch (get_address_family()) {
+    case AF_INET6:
+      return ::td::get_ip_str(AF_INET6, &ipv6_addr_.sin6_addr);
+    case AF_INET:
+      return ::td::get_ip_str(AF_INET, &ipv4_addr_.sin_addr);
+    default:
+      UNREACHABLE();
+      return Slice();
+  }
+}
+
+int IPAddress::get_port() const {
+  if (!is_valid()) {
+    return 0;
+  }
+
+  switch (get_address_family()) {
+    case AF_INET6:
+      return ntohs(ipv6_addr_.sin6_port);
+    case AF_INET:
+      return ntohs(ipv4_addr_.sin_port);
+    default:
+      UNREACHABLE();
+      return 0;
+  }
+}
+
+void IPAddress::set_port(int port) {
+  CHECK(is_valid());
+
+  switch (get_address_family()) {
+    case AF_INET6:
+      ipv6_addr_.sin6_port = htons(static_cast<uint16>(port));
+      break;
+    case AF_INET:
+      ipv4_addr_.sin_port = htons(static_cast<uint16>(port));
+      break;
+    default:
+      UNREACHABLE();
+  }
+}
+
+bool operator==(const IPAddress &a, const IPAddress &b) {
+  if (!a.is_valid() || !b.is_valid()) {
+    return !a.is_valid() && !b.is_valid();
+  }
+  if (a.get_address_family() != b.get_address_family()) {
+    return false;
+  }
+
+  if (a.get_address_family() == AF_INET) {
+    return a.ipv4_addr_.sin_port == b.ipv4_addr_.sin_port &&
+           std::memcmp(&a.ipv4_addr_.sin_addr, &b.ipv4_addr_.sin_addr, sizeof(a.ipv4_addr_.sin_addr)) == 0;
+  } else if (a.get_address_family() == AF_INET6) {
+    return a.ipv6_addr_.sin6_port == b.ipv6_addr_.sin6_port &&
+           std::memcmp(&a.ipv6_addr_.sin6_addr, &b.ipv6_addr_.sin6_addr, sizeof(a.ipv6_addr_.sin6_addr)) == 0;
+  }
+
+  LOG(FATAL) << "Unknown address family";
+  return false;
+}
+
+bool operator<(const IPAddress &a, const IPAddress &b) {
+  if (!a.is_valid() || !b.is_valid()) {
+    return !a.is_valid() && b.is_valid();
+  }
+  if (a.get_address_family() != b.get_address_family()) {
+    return a.get_address_family() < b.get_address_family();
+  }
+
+  if (a.get_address_family() == AF_INET) {
+    if (a.ipv4_addr_.sin_port != b.ipv4_addr_.sin_port) {
+      return a.ipv4_addr_.sin_port < b.ipv4_addr_.sin_port;
+    }
+    return std::memcmp(&a.ipv4_addr_.sin_addr, &b.ipv4_addr_.sin_addr, sizeof(a.ipv4_addr_.sin_addr)) < 0;
+  } else if (a.get_address_family() == AF_INET6) {
+    if (a.ipv6_addr_.sin6_port != b.ipv6_addr_.sin6_port) {
+      return a.ipv6_addr_.sin6_port < b.ipv6_addr_.sin6_port;
+    }
+    return std::memcmp(&a.ipv6_addr_.sin6_addr, &b.ipv6_addr_.sin6_addr, sizeof(a.ipv6_addr_.sin6_addr)) < 0;
+  }
+
+  LOG(FATAL) << "Unknown address family";
+  return false;
+}
+
+StringBuilder &operator<<(StringBuilder &builder, const IPAddress &address) {
+  if (!address.is_valid()) {
+    return builder << "[invalid]";
+  }
+  if (address.get_address_family() == AF_INET) {
+    return builder << "[" << address.get_ip_str() << ":" << address.get_port() << "]";
+  } else {
+    CHECK(address.get_address_family() == AF_INET6);
+    return builder << "[[" << address.get_ip_str() << "]:" << address.get_port() << "]";
+  }
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/IPAddress.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/IPAddress.h
new file mode 100644
index 0000000000..aecbfe7fc9
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/IPAddress.h
@@ -0,0 +1,100 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+#include "td/utils/StringBuilder.h"
+
+#if !TD_WINDOWS
+#include <arpa/inet.h>
+#include <netinet/in.h>
+#include <sys/socket.h>
+#endif
+
+namespace td {
+
+Result<string> idn_to_ascii(CSlice host);
+
+class SocketFd;
+
+class IPAddress {
+ public:
+  IPAddress();
+
+  bool is_valid() const;
+  bool is_ipv4() const;
+  bool is_ipv6() const;
+
+  bool is_reserved() const;
+
+  int get_port() const;
+  void set_port(int port);
+
+  uint32 get_ipv4() const;
+  Slice get_ipv6() const;
+  Slice get_ip_str() const;
+
+  IPAddress get_any_addr() const;
+
+  static Result<IPAddress> get_ipv4_address(CSlice host);
+  static Result<IPAddress> get_ipv6_address(CSlice host);
+
+  Status init_ipv6_port(CSlice ipv6, int port) TD_WARN_UNUSED_RESULT;
+  Status init_ipv6_as_ipv4_port(CSlice ipv4, int port) TD_WARN_UNUSED_RESULT;
+  Status init_ipv4_port(CSlice ipv4, int port) TD_WARN_UNUSED_RESULT;
+  Status init_host_port(CSlice host, int port, bool prefer_ipv6 = false) TD_WARN_UNUSED_RESULT;
+  Status init_host_port(CSlice host, CSlice port, bool prefer_ipv6 = false) TD_WARN_UNUSED_RESULT;
+  Status init_host_port(CSlice host_port) TD_WARN_UNUSED_RESULT;
+  Status init_socket_address(const SocketFd &socket_fd) TD_WARN_UNUSED_RESULT;
+  Status init_peer_address(const SocketFd &socket_fd) TD_WARN_UNUSED_RESULT;
+
+  friend bool operator==(const IPAddress &a, const IPAddress &b);
+  friend bool operator<(const IPAddress &a, const IPAddress &b);
+
+  // for internal usage only
+  const sockaddr *get_sockaddr() const;
+  size_t get_sockaddr_len() const;
+  int get_address_family() const;
+  static CSlice ipv4_to_str(uint32 ipv4);
+  static CSlice ipv6_to_str(Slice ipv6);
+  Status init_sockaddr(sockaddr *addr);
+  Status init_sockaddr(sockaddr *addr, socklen_t len) TD_WARN_UNUSED_RESULT;
+
+ private:
+  union {
+    sockaddr sockaddr_;
+    sockaddr_in ipv4_addr_;
+    sockaddr_in6 ipv6_addr_;
+  };
+  static constexpr socklen_t storage_size() {
+    return sizeof(ipv6_addr_);
+  }
+  bool is_valid_;
+
+  void init_ipv4_any();
+  void init_ipv6_any();
+};
+
+StringBuilder &operator<<(StringBuilder &builder, const IPAddress &address);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/IoSlice.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/IoSlice.h
new file mode 100644
index 0000000000..12e9748953
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/IoSlice.h
@@ -0,0 +1,54 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/Slice.h"
+
+#if TD_PORT_POSIX
+#include <sys/uio.h>
+#endif
+
+namespace td {
+
+#if TD_PORT_POSIX
+
+using IoSlice = struct iovec;
+
+inline IoSlice as_io_slice(Slice slice) {
+  IoSlice res;
+  res.iov_len = slice.size();
+  res.iov_base = const_cast<char *>(slice.data());
+  return res;
+}
+
+inline Slice as_slice(const IoSlice io_slice) {
+  return Slice(static_cast<const char *>(io_slice.iov_base), io_slice.iov_len);
+}
+
+#else
+
+using IoSlice = Slice;
+
+inline IoSlice as_io_slice(Slice slice) {
+  return slice;
+}
+
+#endif
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/MemoryMapping.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/MemoryMapping.cpp
new file mode 100644
index 0000000000..ae33cb649f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/MemoryMapping.cpp
@@ -0,0 +1,123 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/MemoryMapping.h"
+
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+
+// TODO:
+// windows,
+// anonymous maps,
+// huge pages?
+
+#if TD_WINDOWS
+#else
+#include <sys/mman.h>
+#include <unistd.h>
+#endif
+
+namespace td {
+
+class MemoryMapping::Impl {
+ public:
+  Impl(MutableSlice data, int64 offset) : data_(data), offset_(offset) {
+  }
+  Slice as_slice() const {
+    return data_.substr(narrow_cast<size_t>(offset_));
+  }
+  MutableSlice as_mutable_slice() const {
+    return {};
+  }
+
+ private:
+  MutableSlice data_;
+  int64 offset_;
+};
+
+static Result<int64> get_page_size() {
+#if TD_WINDOWS
+  return Status::Error("Unimplemented");
+#else
+  static Result<int64> page_size = []() -> Result<int64> {
+    auto page_size = sysconf(_SC_PAGESIZE);
+    if (page_size < 0) {
+      return OS_ERROR("Can't load page size from sysconf");
+    }
+    return page_size;
+  }();
+  return page_size.clone();
+#endif
+}
+
+Result<MemoryMapping> MemoryMapping::create_anonymous(const MemoryMapping::Options &options) {
+  return Status::Error("Unsupported yet");
+}
+
+Result<MemoryMapping> MemoryMapping::create_from_file(const FileFd &file_fd, const MemoryMapping::Options &options) {
+#if TD_WINDOWS
+  return Status::Error("Unsupported yet");
+#else
+  if (file_fd.empty()) {
+    return Status::Error("Can't create memory mapping: file is empty");
+  }
+  TRY_RESULT(stat, file_fd.stat());
+  auto fd = file_fd.get_native_fd().fd();
+  auto begin = options.offset;
+  if (begin < 0) {
+    return Status::Error(PSLICE() << "Can't create memory mapping: negative offset " << options.offset);
+  }
+
+  int64 end;
+  if (options.size < 0) {
+    end = stat.size_;
+  } else {
+    end = begin + stat.size_;
+  }
+
+  TRY_RESULT(page_size, get_page_size());
+  auto fixed_begin = begin / page_size * page_size;
+
+  auto data_offset = begin - fixed_begin;
+  TRY_RESULT(data_size, narrow_cast_safe<size_t>(end - fixed_begin));
+
+  void *data = mmap(nullptr, data_size, PROT_READ, MAP_PRIVATE, fd, narrow_cast<off_t>(fixed_begin));
+  if (data == MAP_FAILED) {
+    return OS_ERROR("mmap call failed");
+  }
+
+  return MemoryMapping(make_unique<Impl>(MutableSlice(static_cast<char *>(data), data_size), data_offset));
+#endif
+}
+
+MemoryMapping::MemoryMapping(MemoryMapping &&other) = default;
+MemoryMapping &MemoryMapping::operator=(MemoryMapping &&other) = default;
+MemoryMapping::~MemoryMapping() = default;
+
+MemoryMapping::MemoryMapping(unique_ptr<Impl> impl) : impl_(std::move(impl)) {
+}
+
+Slice MemoryMapping::as_slice() const {
+  return impl_->as_slice();
+}
+
+MutableSlice MemoryMapping::as_mutable_slice() {
+  return impl_->as_mutable_slice();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/MemoryMapping.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/MemoryMapping.h
new file mode 100644
index 0000000000..23ad625282
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/MemoryMapping.h
@@ -0,0 +1,64 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/port/FileFd.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+namespace td {
+
+class MemoryMapping {
+ public:
+  struct Options {
+    int64 offset{0};
+    int64 size{-1};
+
+    Options() {
+    }
+    Options &with_offset(int64 new_offset) {
+      offset = new_offset;
+      return *this;
+    }
+    Options &with_size(int64 new_size) {
+      size = new_size;
+      return *this;
+    }
+  };
+
+  static Result<MemoryMapping> create_anonymous(const Options &options = {});
+  static Result<MemoryMapping> create_from_file(const FileFd &file, const Options &options = {});
+
+  Slice as_slice() const;
+  MutableSlice as_mutable_slice();  // returns empty slice if memory is read-only
+
+  MemoryMapping(const MemoryMapping &other) = delete;
+  const MemoryMapping &operator=(const MemoryMapping &other) = delete;
+  MemoryMapping(MemoryMapping &&other);
+  MemoryMapping &operator=(MemoryMapping &&other);
+  ~MemoryMapping();
+
+ private:
+  class Impl;
+  unique_ptr<Impl> impl_;
+  explicit MemoryMapping(unique_ptr<Impl> impl);
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/Poll.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/Poll.h
new file mode 100644
index 0000000000..35b7e46ffb
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/Poll.h
@@ -0,0 +1,47 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#include "td/utils/port/detail/Epoll.h"
+#include "td/utils/port/detail/KQueue.h"
+#include "td/utils/port/detail/Poll.h"
+#include "td/utils/port/detail/Select.h"
+#include "td/utils/port/detail/WineventPoll.h"
+
+namespace td {
+
+// clang-format off
+
+#if TD_POLL_EPOLL
+  using Poll = detail::Epoll;
+#elif TD_POLL_KQUEUE
+  using Poll = detail::KQueue;
+#elif TD_POLL_WINEVENT
+  using Poll = detail::WineventPoll;
+#elif TD_POLL_POLL
+  using Poll = detail::Poll;
+#elif TD_POLL_SELECT
+  using Poll = detail::Select;
+#endif
+
+// clang-format on
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/PollBase.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/PollBase.h
new file mode 100644
index 0000000000..273577029f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/PollBase.h
@@ -0,0 +1,40 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/PollFlags.h"
+
+namespace td {
+class PollBase {
+ public:
+  PollBase() = default;
+  PollBase(const PollBase &) = delete;
+  PollBase &operator=(const PollBase &) = delete;
+  PollBase(PollBase &&) = default;
+  PollBase &operator=(PollBase &&) = default;
+  virtual ~PollBase() = default;
+  virtual void init() = 0;
+  virtual void clear() = 0;
+  virtual void subscribe(PollableFd fd, PollFlags flags) = 0;
+  virtual void unsubscribe(PollableFdRef fd) = 0;
+  virtual void unsubscribe_before_close(PollableFdRef fd) = 0;
+  virtual void run(int timeout_ms) = 0;
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/PollFlags.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/PollFlags.cpp
new file mode 100644
index 0000000000..092e0e861a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/PollFlags.cpp
@@ -0,0 +1,83 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/PollFlags.h"
+
+namespace td {
+
+bool PollFlagsSet::write_flags(PollFlags flags) {
+  if (flags.empty()) {
+    return false;
+  }
+  auto old_flags = to_write_.fetch_or(flags.raw(), std::memory_order_relaxed);
+  return (flags.raw() & ~old_flags) != 0;
+}
+
+bool PollFlagsSet::write_flags_local(PollFlags flags) {
+  return flags_.add_flags(flags);
+}
+
+bool PollFlagsSet::flush() const {
+  if (to_write_.load(std::memory_order_relaxed) == 0) {
+    return false;
+  }
+  auto to_write = to_write_.exchange(0, std::memory_order_relaxed);
+  auto old_flags = flags_;
+  flags_.add_flags(PollFlags::from_raw(to_write));
+  if (flags_.can_close()) {
+    flags_.remove_flags(PollFlags::Write());
+  }
+  return flags_ != old_flags;
+}
+
+PollFlags PollFlagsSet::read_flags() const {
+  flush();
+  return flags_;
+}
+
+PollFlags PollFlagsSet::read_flags_local() const {
+  return flags_;
+}
+
+void PollFlagsSet::clear_flags(PollFlags flags) {
+  flags_.remove_flags(flags);
+}
+
+void PollFlagsSet::clear() {
+  to_write_ = 0;
+  flags_ = {};
+}
+
+StringBuilder &operator<<(StringBuilder &sb, PollFlags flags) {
+  sb << '[';
+  if (flags.can_read()) {
+    sb << 'R';
+  }
+  if (flags.can_write()) {
+    sb << 'W';
+  }
+  if (flags.can_close()) {
+    sb << 'C';
+  }
+  if (flags.has_pending_error()) {
+    sb << 'E';
+  }
+  return sb << ']';
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/PollFlags.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/PollFlags.h
new file mode 100644
index 0000000000..f920d537de
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/PollFlags.h
@@ -0,0 +1,134 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/StringBuilder.h"
+
+#include <atomic>
+
+namespace td {
+
+class PollFlags {
+ public:
+  using Raw = int32;
+  bool can_read() const {
+    return has_flags(Read());
+  }
+  bool can_write() const {
+    return has_flags(Write());
+  }
+  bool can_close() const {
+    return has_flags(Close());
+  }
+  bool has_pending_error() const {
+    return has_flags(Error());
+  }
+  void remove_flags(PollFlags flags) {
+    remove_flags(flags.raw());
+  }
+  bool add_flags(PollFlags flags) {
+    auto old_flags = flags_;
+    add_flags(flags.raw());
+    return old_flags != flags_;
+  }
+  bool has_flags(PollFlags flags) const {
+    return has_flags(flags.raw());
+  }
+
+  bool empty() const {
+    return flags_ == 0;
+  }
+  Raw raw() const {
+    return flags_;
+  }
+  static PollFlags from_raw(Raw raw) {
+    return PollFlags(raw);
+  }
+  PollFlags() = default;
+
+  bool operator==(const PollFlags &other) const {
+    return flags_ == other.flags_;
+  }
+  bool operator!=(const PollFlags &other) const {
+    return !(*this == other);
+  }
+  PollFlags operator|(const PollFlags other) const {
+    return from_raw(raw() | other.raw());
+  }
+
+  static PollFlags Write() {
+    return PollFlags(Flag::Write);
+  }
+  static PollFlags Error() {
+    return PollFlags(Flag::Error);
+  }
+  static PollFlags Close() {
+    return PollFlags(Flag::Close);
+  }
+  static PollFlags Read() {
+    return PollFlags(Flag::Read);
+  }
+  static PollFlags ReadWrite() {
+    return Read() | Write();
+  }
+
+ private:
+  enum class Flag : Raw { Write = 0x001, Read = 0x002, Close = 0x004, Error = 0x008, None = 0 };
+  Raw flags_{static_cast<Raw>(Flag::None)};
+
+  explicit PollFlags(Raw raw) : flags_(raw) {
+  }
+  explicit PollFlags(Flag flag) : PollFlags(static_cast<Raw>(flag)) {
+  }
+
+  PollFlags &add_flags(Raw flags) {
+    flags_ |= flags;
+    return *this;
+  }
+  PollFlags &remove_flags(Raw flags) {
+    flags_ &= ~flags;
+    return *this;
+  }
+  bool has_flags(Raw flags) const {
+    return (flags_ & flags) == flags;
+  }
+};
+
+StringBuilder &operator<<(StringBuilder &sb, PollFlags flags);
+
+class PollFlagsSet {
+ public:
+  // write flags from any thread
+  // this is the only function that should be called from other threads
+  bool write_flags(PollFlags flags);
+
+  bool write_flags_local(PollFlags flags);
+  bool flush() const;
+
+  PollFlags read_flags() const;
+  PollFlags read_flags_local() const;
+  void clear_flags(PollFlags flags);
+  void clear();
+
+ private:
+  mutable std::atomic<PollFlags::Raw> to_write_{0};
+  mutable PollFlags flags_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/RwMutex.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/RwMutex.h
new file mode 100644
index 0000000000..abe3a6a295
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/RwMutex.h
@@ -0,0 +1,161 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#include "td/utils/common.h"
+#include "td/utils/Status.h"
+
+#if TD_PORT_POSIX
+#include <pthread.h>
+#endif
+
+#include <memory>
+
+namespace td {
+
+class RwMutex {
+ public:
+  RwMutex() {
+    init();
+  }
+  RwMutex(const RwMutex &) = delete;
+  RwMutex &operator=(const RwMutex &) = delete;
+  RwMutex(RwMutex &&other) {
+    init();
+    other.clear();
+  }
+  RwMutex &operator=(RwMutex &&other) {
+    other.clear();
+    return *this;
+  }
+  ~RwMutex() {
+    clear();
+  }
+
+  bool empty() const {
+    return !is_valid_;
+  }
+
+  void init();
+
+  void clear();
+
+  struct ReadUnlock {
+    void operator()(RwMutex *ptr) {
+      ptr->unlock_read_unsafe();
+    }
+  };
+  struct WriteUnlock {
+    void operator()(RwMutex *ptr) {
+      ptr->unlock_write_unsafe();
+    }
+  };
+
+  using ReadLock = std::unique_ptr<RwMutex, ReadUnlock>;
+  using WriteLock = std::unique_ptr<RwMutex, WriteUnlock>;
+
+  Result<ReadLock> lock_read() TD_WARN_UNUSED_RESULT {
+    lock_read_unsafe();
+    return ReadLock(this);
+  }
+
+  Result<WriteLock> lock_write() TD_WARN_UNUSED_RESULT {
+    lock_write_unsafe();
+    return WriteLock(this);
+  }
+
+  void lock_read_unsafe();
+
+  void lock_write_unsafe();
+
+  void unlock_read_unsafe();
+
+  void unlock_write_unsafe();
+
+ private:
+  bool is_valid_ = false;
+#if TD_PORT_POSIX
+  pthread_rwlock_t mutex_;
+#elif TD_PORT_WINDOWS
+  unique_ptr<SRWLOCK> mutex_;
+#endif
+};
+
+inline void RwMutex::init() {
+  CHECK(empty());
+  is_valid_ = true;
+#if TD_PORT_POSIX
+  pthread_rwlock_init(&mutex_, nullptr);
+#elif TD_PORT_WINDOWS
+  mutex_ = make_unique<SRWLOCK>();
+  InitializeSRWLock(mutex_.get());
+#endif
+}
+
+inline void RwMutex::clear() {
+  if (is_valid_) {
+#if TD_PORT_POSIX
+    pthread_rwlock_destroy(&mutex_);
+#elif TD_PORT_WINDOWS
+    mutex_.release();
+#endif
+    is_valid_ = false;
+  }
+}
+
+inline void RwMutex::lock_read_unsafe() {
+  CHECK(!empty());
+// TODO error handling
+#if TD_PORT_POSIX
+  pthread_rwlock_rdlock(&mutex_);
+#elif TD_PORT_WINDOWS
+  AcquireSRWLockShared(mutex_.get());
+#endif
+}
+
+inline void RwMutex::lock_write_unsafe() {
+  CHECK(!empty());
+#if TD_PORT_POSIX
+  pthread_rwlock_wrlock(&mutex_);
+#elif TD_PORT_WINDOWS
+  AcquireSRWLockExclusive(mutex_.get());
+#endif
+}
+
+inline void RwMutex::unlock_read_unsafe() {
+  CHECK(!empty());
+#if TD_PORT_POSIX
+  pthread_rwlock_unlock(&mutex_);
+#elif TD_PORT_WINDOWS
+  ReleaseSRWLockShared(mutex_.get());
+#endif
+}
+
+inline void RwMutex::unlock_write_unsafe() {
+  CHECK(!empty());
+#if TD_PORT_POSIX
+  pthread_rwlock_unlock(&mutex_);
+#elif TD_PORT_WINDOWS
+  ReleaseSRWLockExclusive(mutex_.get());
+#endif
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/ServerSocketFd.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/ServerSocketFd.cpp
new file mode 100644
index 0000000000..2aba231511
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/ServerSocketFd.cpp
@@ -0,0 +1,373 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/ServerSocketFd.h"
+
+#include "td/utils/port/config.h"
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/IPAddress.h"
+#include "td/utils/port/PollFlags.h"
+
+#if TD_PORT_POSIX
+
+#include <arpa/inet.h>
+#include <fcntl.h>
+#include <netinet/in.h>
+#include <netinet/tcp.h>
+#include <sys/socket.h>
+#include <sys/types.h>
+#include <unistd.h>
+
+#endif
+
+#if TD_PORT_WINDOWS
+#include "td/utils/port/detail/Iocp.h"
+#include "td/utils/SpinLock.h"
+#include "td/utils/VectorQueue.h"
+#endif
+
+#include <atomic>
+#include <cstring>
+
+namespace td {
+
+namespace detail {
+#if TD_PORT_WINDOWS
+class ServerSocketFdImpl : private Iocp::Callback {
+ public:
+  ServerSocketFdImpl(NativeFd fd, int socket_family) : info_(std::move(fd)), socket_family_(socket_family) {
+    VLOG(fd) << get_native_fd() << " create ServerSocketFd";
+    Iocp::get()->subscribe(get_native_fd(), this);
+    notify_iocp_read();
+  }
+  void close() {
+    notify_iocp_close();
+  }
+  PollableFdInfo &get_poll_info() {
+    return info_;
+  }
+  const PollableFdInfo &get_poll_info() const {
+    return info_;
+  }
+
+  const NativeFd &get_native_fd() const {
+    return info_.native_fd();
+  }
+
+  Result<SocketFd> accept() {
+    auto lock = lock_.lock();
+    if (accepted_.empty()) {
+      get_poll_info().clear_flags(PollFlags::Read());
+      return Status::Error(-1, "Operation would block");
+    }
+    return accepted_.pop();
+  }
+
+  Status get_pending_error() {
+    Status res;
+    {
+      auto lock = lock_.lock();
+      if (!pending_errors_.empty()) {
+        res = pending_errors_.pop();
+      }
+      if (res.is_ok()) {
+        get_poll_info().clear_flags(PollFlags::Error());
+      }
+    }
+    return res;
+  }
+
+ private:
+  PollableFdInfo info_;
+
+  SpinLock lock_;
+  VectorQueue<SocketFd> accepted_;
+  VectorQueue<Status> pending_errors_;
+  static constexpr size_t MAX_ADDR_SIZE = sizeof(sockaddr_in6) + 16;
+  char addr_buf_[MAX_ADDR_SIZE * 2];
+
+  bool close_flag_{false};
+  std::atomic<int> refcnt_{1};
+  bool is_read_active_{false};
+  WSAOVERLAPPED read_overlapped_;
+
+  char close_overlapped_;
+
+  NativeFd accept_socket_;
+  int socket_family_;
+
+  void on_close() {
+    close_flag_ = true;
+    info_.set_native_fd({});
+  }
+  void on_read() {
+    VLOG(fd) << get_native_fd() << " on_read";
+    if (is_read_active_) {
+      is_read_active_ = false;
+      auto r_socket = [&]() -> Result<SocketFd> {
+        auto from = get_native_fd().socket();
+        auto status = setsockopt(accept_socket_.socket(), SOL_SOCKET, SO_UPDATE_ACCEPT_CONTEXT,
+                                 reinterpret_cast<const char *>(&from), sizeof(from));
+        if (status != 0) {
+          return OS_SOCKET_ERROR("Failed to set SO_UPDATE_ACCEPT_CONTEXT options");
+        }
+        return SocketFd::from_native_fd(std::move(accept_socket_));
+      }();
+      VLOG(fd) << get_native_fd() << " finish accept";
+      if (r_socket.is_error()) {
+        return on_error(r_socket.move_as_error());
+      }
+      {
+        auto lock = lock_.lock();
+        accepted_.push(r_socket.move_as_ok());
+      }
+      get_poll_info().add_flags_from_poll(PollFlags::Read());
+    }
+    loop_read();
+  }
+  void loop_read() {
+    CHECK(!is_read_active_);
+    accept_socket_ = NativeFd(socket(socket_family_, SOCK_STREAM, 0));
+    std::memset(&read_overlapped_, 0, sizeof(read_overlapped_));
+    VLOG(fd) << get_native_fd() << " start accept";
+    BOOL status = AcceptEx(get_native_fd().socket(), accept_socket_.socket(), addr_buf_, 0, MAX_ADDR_SIZE,
+                           MAX_ADDR_SIZE, nullptr, &read_overlapped_);
+    if (status == TRUE || check_status("Failed to accept connection")) {
+      inc_refcnt();
+      is_read_active_ = true;
+    }
+  }
+  bool check_status(Slice message) {
+    auto last_error = WSAGetLastError();
+    if (last_error == ERROR_IO_PENDING) {
+      return true;
+    }
+    on_error(OS_SOCKET_ERROR(message));
+    return false;
+  }
+  bool dec_refcnt() {
+    if (--refcnt_ == 0) {
+      delete this;
+      return true;
+    }
+    return false;
+  }
+  void inc_refcnt() {
+    CHECK(refcnt_ != 0);
+    refcnt_++;
+  }
+
+  void on_error(Status status) {
+    {
+      auto lock = lock_.lock();
+      pending_errors_.push(std::move(status));
+    }
+    get_poll_info().add_flags_from_poll(PollFlags::Error());
+  }
+
+  void on_iocp(Result<size_t> r_size, WSAOVERLAPPED *overlapped) override {
+    // called from other thread
+    if (dec_refcnt() || close_flag_) {
+      VLOG(fd) << "Ignore IOCP (server socket is closing)";
+      return;
+    }
+    if (r_size.is_error()) {
+      return on_error(get_socket_pending_error(get_native_fd(), overlapped, r_size.move_as_error()));
+    }
+
+    if (overlapped == nullptr) {
+      return on_read();
+    }
+    if (overlapped == &read_overlapped_) {
+      return on_read();
+    }
+
+    if (overlapped == reinterpret_cast<WSAOVERLAPPED *>(&close_overlapped_)) {
+      return on_close();
+    }
+    UNREACHABLE();
+  }
+  void notify_iocp_read() {
+    VLOG(fd) << get_native_fd() << " notify_read";
+    inc_refcnt();
+    Iocp::get()->post(0, this, nullptr);
+  }
+  void notify_iocp_close() {
+    VLOG(fd) << get_native_fd() << " notify_close";
+    Iocp::get()->post(0, this, reinterpret_cast<WSAOVERLAPPED *>(&close_overlapped_));
+  }
+};
+void ServerSocketFdImplDeleter::operator()(ServerSocketFdImpl *impl) {
+  impl->close();
+}
+#elif TD_PORT_POSIX
+class ServerSocketFdImpl {
+ public:
+  explicit ServerSocketFdImpl(NativeFd fd) : info_(std::move(fd)) {
+  }
+  PollableFdInfo &get_poll_info() {
+    return info_;
+  }
+  const PollableFdInfo &get_poll_info() const {
+    return info_;
+  }
+
+  const NativeFd &get_native_fd() const {
+    return info_.native_fd();
+  }
+  Result<SocketFd> accept() {
+    sockaddr_storage addr;
+    socklen_t addr_len = sizeof(addr);
+    int native_fd = get_native_fd().socket();
+    int r_fd = detail::skip_eintr([&] { return ::accept(native_fd, reinterpret_cast<sockaddr *>(&addr), &addr_len); });
+    auto accept_errno = errno;
+    if (r_fd >= 0) {
+      return SocketFd::from_native_fd(NativeFd(r_fd));
+    }
+
+    if (accept_errno == EAGAIN
+#if EAGAIN != EWOULDBLOCK
+        || accept_errno == EWOULDBLOCK
+#endif
+    ) {
+      get_poll_info().clear_flags(PollFlags::Read());
+      return Status::Error(-1, "Operation would block");
+    }
+
+    auto error = Status::PosixError(accept_errno, PSLICE() << "Accept from " << get_native_fd() << " has failed");
+    switch (accept_errno) {
+      case EBADF:
+      case EFAULT:
+      case EINVAL:
+      case ENOTSOCK:
+      case EOPNOTSUPP:
+        LOG(FATAL) << error;
+        UNREACHABLE();
+        break;
+      default:
+        LOG(ERROR) << error;
+      // fallthrough
+      case EMFILE:
+      case ENFILE:
+      case ECONNABORTED:  //???
+        get_poll_info().clear_flags(PollFlags::Read());
+        get_poll_info().add_flags(PollFlags::Close());
+        return std::move(error);
+    }
+  }
+
+  Status get_pending_error() {
+    if (!get_poll_info().get_flags().has_pending_error()) {
+      return Status::OK();
+    }
+    TRY_STATUS(detail::get_socket_pending_error(get_native_fd()));
+    get_poll_info().clear_flags(PollFlags::Error());
+    return Status::OK();
+  }
+
+ private:
+  PollableFdInfo info_;
+};
+void ServerSocketFdImplDeleter::operator()(ServerSocketFdImpl *impl) {
+  delete impl;
+}
+#endif
+}  // namespace detail
+
+ServerSocketFd::ServerSocketFd() = default;
+ServerSocketFd::ServerSocketFd(ServerSocketFd &&) = default;
+ServerSocketFd &ServerSocketFd::operator=(ServerSocketFd &&) = default;
+ServerSocketFd::~ServerSocketFd() = default;
+ServerSocketFd::ServerSocketFd(unique_ptr<detail::ServerSocketFdImpl> impl) : impl_(impl.release()) {
+}
+PollableFdInfo &ServerSocketFd::get_poll_info() {
+  return impl_->get_poll_info();
+}
+
+const PollableFdInfo &ServerSocketFd::get_poll_info() const {
+  return impl_->get_poll_info();
+}
+
+Status ServerSocketFd::get_pending_error() {
+  return impl_->get_pending_error();
+}
+
+const NativeFd &ServerSocketFd::get_native_fd() const {
+  return impl_->get_native_fd();
+}
+
+Result<SocketFd> ServerSocketFd::accept() {
+  return impl_->accept();
+}
+
+void ServerSocketFd::close() {
+  impl_.reset();
+}
+
+bool ServerSocketFd::empty() const {
+  return !impl_;
+}
+
+Result<ServerSocketFd> ServerSocketFd::open(int32 port, CSlice addr) {
+  IPAddress address;
+  TRY_STATUS(address.init_ipv4_port(addr, port));
+  NativeFd fd{socket(address.get_address_family(), SOCK_STREAM, 0)};
+  if (!fd) {
+    return OS_SOCKET_ERROR("Failed to create a socket");
+  }
+
+  TRY_STATUS(fd.set_is_blocking_unsafe(false));
+  auto sock = fd.socket();
+
+  linger ling = {0, 0};
+#if TD_PORT_POSIX
+  int flags = 1;
+#ifdef SO_REUSEPORT
+  setsockopt(sock, SOL_SOCKET, SO_REUSEPORT, reinterpret_cast<const char *>(&flags), sizeof(flags));
+#endif
+#elif TD_PORT_WINDOWS
+  BOOL flags = TRUE;
+#endif
+  setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, reinterpret_cast<const char *>(&flags), sizeof(flags));
+  setsockopt(sock, SOL_SOCKET, SO_KEEPALIVE, reinterpret_cast<const char *>(&flags), sizeof(flags));
+  setsockopt(sock, SOL_SOCKET, SO_LINGER, reinterpret_cast<const char *>(&ling), sizeof(ling));
+  setsockopt(sock, IPPROTO_TCP, TCP_NODELAY, reinterpret_cast<const char *>(&flags), sizeof(flags));
+
+  int e_bind = bind(sock, address.get_sockaddr(), static_cast<socklen_t>(address.get_sockaddr_len()));
+  if (e_bind != 0) {
+    return OS_SOCKET_ERROR("Failed to bind a socket");
+  }
+
+  // TODO: magic constant
+  int e_listen = listen(sock, 8192);
+  if (e_listen != 0) {
+    return OS_SOCKET_ERROR("Failed to listen on a socket");
+  }
+
+#if TD_PORT_POSIX
+  auto impl = make_unique<detail::ServerSocketFdImpl>(std::move(fd));
+#elif TD_PORT_WINDOWS
+  auto impl = make_unique<detail::ServerSocketFdImpl>(std::move(fd), address.get_address_family());
+#endif
+
+  return ServerSocketFd(std::move(impl));
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/ServerSocketFd.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/ServerSocketFd.h
new file mode 100644
index 0000000000..c13c3c6e48
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/ServerSocketFd.h
@@ -0,0 +1,66 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/detail/NativeFd.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/SocketFd.h"
+
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+#include <memory>
+
+namespace td {
+namespace detail {
+class ServerSocketFdImpl;
+class ServerSocketFdImplDeleter {
+ public:
+  void operator()(ServerSocketFdImpl *impl);
+};
+}  // namespace detail
+
+class ServerSocketFd {
+ public:
+  ServerSocketFd();
+  ServerSocketFd(const ServerSocketFd &) = delete;
+  ServerSocketFd &operator=(const ServerSocketFd &) = delete;
+  ServerSocketFd(ServerSocketFd &&);
+  ServerSocketFd &operator=(ServerSocketFd &&);
+  ~ServerSocketFd();
+
+  static Result<ServerSocketFd> open(int32 port, CSlice addr = CSlice("0.0.0.0")) TD_WARN_UNUSED_RESULT;
+
+  PollableFdInfo &get_poll_info();
+  const PollableFdInfo &get_poll_info() const;
+
+  Status get_pending_error() TD_WARN_UNUSED_RESULT;
+
+  Result<SocketFd> accept() TD_WARN_UNUSED_RESULT;
+
+  void close();
+  bool empty() const;
+
+  const NativeFd &get_native_fd() const;
+
+ private:
+  std::unique_ptr<detail::ServerSocketFdImpl, detail::ServerSocketFdImplDeleter> impl_;
+  explicit ServerSocketFd(unique_ptr<detail::ServerSocketFdImpl> impl);
+};
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/SocketFd.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/SocketFd.cpp
new file mode 100644
index 0000000000..090b9672f2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/SocketFd.cpp
@@ -0,0 +1,632 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/SocketFd.h"
+
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/PollFlags.h"
+
+#if TD_PORT_WINDOWS
+#include "td/utils/buffer.h"
+#include "td/utils/port/detail/Iocp.h"
+#include "td/utils/SpinLock.h"
+#include "td/utils/VectorQueue.h"
+#endif
+
+#if TD_PORT_POSIX
+#include <arpa/inet.h>
+#include <fcntl.h>
+#include <netinet/in.h>
+#include <netinet/tcp.h>
+#include <sys/socket.h>
+#include <sys/types.h>
+#include <unistd.h>
+#endif
+
+#include <atomic>
+#include <cstring>
+
+namespace td {
+namespace detail {
+#if TD_PORT_WINDOWS
+class SocketFdImpl : private Iocp::Callback {
+ public:
+  explicit SocketFdImpl(NativeFd native_fd) : info(std::move(native_fd)) {
+    VLOG(fd) << get_native_fd() << " create from native_fd";
+    get_poll_info().add_flags(PollFlags::Write());
+    Iocp::get()->subscribe(get_native_fd(), this);
+    is_read_active_ = true;
+    notify_iocp_connected();
+  }
+
+  SocketFdImpl(NativeFd native_fd, const IPAddress &addr) : info(std::move(native_fd)) {
+    VLOG(fd) << get_native_fd() << " create from native_fd and connect";
+    get_poll_info().add_flags(PollFlags::Write());
+    Iocp::get()->subscribe(get_native_fd(), this);
+    LPFN_CONNECTEX ConnectExPtr = nullptr;
+    GUID guid = WSAID_CONNECTEX;
+    DWORD numBytes;
+    auto error =
+        ::WSAIoctl(get_native_fd().socket(), SIO_GET_EXTENSION_FUNCTION_POINTER, static_cast<void *>(&guid),
+                   sizeof(guid), static_cast<void *>(&ConnectExPtr), sizeof(ConnectExPtr), &numBytes, nullptr, nullptr);
+    if (error) {
+      on_error(OS_SOCKET_ERROR("WSAIoctl failed"));
+      return;
+    }
+    std::memset(&read_overlapped_, 0, sizeof(read_overlapped_));
+    inc_refcnt();
+    is_read_active_ = true;
+    auto status = ConnectExPtr(get_native_fd().socket(), addr.get_sockaddr(), narrow_cast<int>(addr.get_sockaddr_len()),
+                               nullptr, 0, nullptr, &read_overlapped_);
+
+    if (status == TRUE || !check_status("Failed to connect")) {
+      is_read_active_ = false;
+      dec_refcnt();
+    }
+  }
+
+  void close() {
+    notify_iocp_close();
+  }
+
+  PollableFdInfo &get_poll_info() {
+    return info;
+  }
+  const PollableFdInfo &get_poll_info() const {
+    return info;
+  }
+
+  const NativeFd &get_native_fd() const {
+    return info.native_fd();
+  }
+
+  Result<size_t> write(Slice data) {
+    // LOG(ERROR) << "Write: " << format::as_hex_dump<0>(data);
+    output_writer_.append(data);
+    return write_finish(data.size());
+  }
+
+  Result<size_t> writev(Span<IoSlice> slices) {
+    size_t total_size = 0;
+    for (auto io_slice : slices) {
+      total_size += as_slice(io_slice).size();
+    }
+
+    auto left_size = total_size;
+    for (auto io_slice : slices) {
+      auto slice = as_slice(io_slice);
+      output_writer_.append(slice, left_size);
+      left_size -= slice.size();
+    }
+
+    return write_finish(total_size);
+  }
+
+  Result<size_t> write_finish(size_t total_size) {
+    if (is_write_waiting_) {
+      auto lock = lock_.lock();
+      is_write_waiting_ = false;
+      lock.reset();
+      notify_iocp_write();
+    }
+    return total_size;
+  }
+
+  Result<size_t> read(MutableSlice slice) {
+    if (get_poll_info().get_flags().has_pending_error()) {
+      TRY_STATUS(get_pending_error());
+    }
+    input_reader_.sync_with_writer();
+    auto res = input_reader_.advance(td::min(slice.size(), input_reader_.size()), slice);
+    if (res == 0) {
+      get_poll_info().clear_flags(PollFlags::Read());
+    } else {
+      // LOG(ERROR) << "Read: " << format::as_hex_dump<0>(Slice(slice.substr(0, res)));
+    }
+    return res;
+  }
+
+  Status get_pending_error() {
+    Status res;
+    {
+      auto lock = lock_.lock();
+      if (!pending_errors_.empty()) {
+        res = pending_errors_.pop();
+      }
+      if (res.is_ok()) {
+        get_poll_info().clear_flags(PollFlags::Error());
+      }
+    }
+    return res;
+  }
+
+ private:
+  PollableFdInfo info;
+  SpinLock lock_;
+
+  std::atomic<int> refcnt_{1};
+  bool close_flag_{false};
+
+  bool is_connected_{false};
+  bool is_read_active_{false};
+  ChainBufferWriter input_writer_;
+  ChainBufferReader input_reader_ = input_writer_.extract_reader();
+  WSAOVERLAPPED read_overlapped_;
+  VectorQueue<Status> pending_errors_;
+
+  bool is_write_active_{false};
+  std::atomic<bool> is_write_waiting_{false};
+  ChainBufferWriter output_writer_;
+  ChainBufferReader output_reader_ = output_writer_.extract_reader();
+  WSAOVERLAPPED write_overlapped_;
+
+  char close_overlapped_;
+
+  bool check_status(Slice message) {
+    auto last_error = WSAGetLastError();
+    if (last_error == ERROR_IO_PENDING) {
+      return true;
+    }
+    on_error(OS_SOCKET_ERROR(message));
+    return false;
+  }
+
+  void loop_read() {
+    CHECK(is_connected_);
+    CHECK(!is_read_active_);
+    if (close_flag_) {
+      return;
+    }
+    std::memset(&read_overlapped_, 0, sizeof(read_overlapped_));
+    auto dest = input_writer_.prepare_append();
+    WSABUF buf;
+    buf.len = narrow_cast<ULONG>(dest.size());
+    buf.buf = dest.data();
+    DWORD flags = 0;
+    int status = WSARecv(get_native_fd().socket(), &buf, 1, nullptr, &flags, &read_overlapped_, nullptr);
+    if (status == 0 || check_status("Failed to read from connection")) {
+      inc_refcnt();
+      is_read_active_ = true;
+    }
+  }
+
+  void loop_write() {
+    CHECK(is_connected_);
+    CHECK(!is_write_active_);
+
+    output_reader_.sync_with_writer();
+    auto to_write = output_reader_.prepare_read();
+    if (to_write.empty()) {
+      auto lock = lock_.lock();
+      output_reader_.sync_with_writer();
+      to_write = output_reader_.prepare_read();
+      if (to_write.empty()) {
+        is_write_waiting_ = true;
+        return;
+      }
+    }
+    if (to_write.empty()) {
+      return;
+    }
+    std::memset(&write_overlapped_, 0, sizeof(write_overlapped_));
+    constexpr size_t buf_size = 20;
+    WSABUF buf[buf_size];
+    auto it = output_reader_.clone();
+    size_t buf_i;
+    for (buf_i = 0; buf_i < buf_size; buf_i++) {
+      auto src = it.prepare_read();
+      if (src.empty()) {
+        break;
+      }
+      buf[buf_i].len = narrow_cast<ULONG>(src.size());
+      buf[buf_i].buf = const_cast<CHAR *>(src.data());
+      it.confirm_read(src.size());
+    }
+    int status =
+        WSASend(get_native_fd().socket(), buf, narrow_cast<DWORD>(buf_i), nullptr, 0, &write_overlapped_, nullptr);
+    if (status == 0 || check_status("Failed to write to connection")) {
+      inc_refcnt();
+      is_write_active_ = true;
+    }
+  }
+
+  void on_iocp(Result<size_t> r_size, WSAOVERLAPPED *overlapped) override {
+    // called from other thread
+    if (dec_refcnt() || close_flag_) {
+      VLOG(fd) << "Ignore IOCP (socket is closing)";
+      return;
+    }
+    if (r_size.is_error()) {
+      return on_error(get_socket_pending_error(get_native_fd(), overlapped, r_size.move_as_error()));
+    }
+
+    if (!is_connected_ && overlapped == &read_overlapped_) {
+      return on_connected();
+    }
+
+    auto size = r_size.move_as_ok();
+    if (overlapped == &write_overlapped_) {
+      return on_write(size);
+    }
+    if (overlapped == nullptr) {
+      CHECK(size == 0);
+      return on_write(size);
+    }
+
+    if (overlapped == &read_overlapped_) {
+      return on_read(size);
+    }
+    if (overlapped == reinterpret_cast<WSAOVERLAPPED *>(&close_overlapped_)) {
+      return on_close();
+    }
+    UNREACHABLE();
+  }
+
+  void on_error(Status status) {
+    VLOG(fd) << get_native_fd() << " on error " << status;
+    {
+      auto lock = lock_.lock();
+      pending_errors_.push(std::move(status));
+    }
+    get_poll_info().add_flags_from_poll(PollFlags::Error());
+  }
+
+  void on_connected() {
+    VLOG(fd) << get_native_fd() << " on connected";
+    CHECK(!is_connected_);
+    CHECK(is_read_active_);
+    is_connected_ = true;
+    is_read_active_ = false;
+    loop_read();
+    loop_write();
+  }
+
+  void on_read(size_t size) {
+    VLOG(fd) << get_native_fd() << " on read " << size;
+    CHECK(is_read_active_);
+    is_read_active_ = false;
+    if (size == 0) {
+      get_poll_info().add_flags_from_poll(PollFlags::Close());
+      return;
+    }
+    input_writer_.confirm_append(size);
+    get_poll_info().add_flags_from_poll(PollFlags::Read());
+    loop_read();
+  }
+
+  void on_write(size_t size) {
+    VLOG(fd) << get_native_fd() << " on write " << size;
+    if (size == 0) {
+      if (is_write_active_) {
+        return;
+      }
+      is_write_active_ = true;
+    }
+    CHECK(is_write_active_);
+    is_write_active_ = false;
+    output_reader_.advance(size);
+    loop_write();
+  }
+
+  void on_close() {
+    VLOG(fd) << get_native_fd() << " on close";
+    close_flag_ = true;
+    info.set_native_fd({});
+  }
+  bool dec_refcnt() {
+    VLOG(fd) << get_native_fd() << " dec_refcnt from " << refcnt_;
+    if (--refcnt_ == 0) {
+      delete this;
+      return true;
+    }
+    return false;
+  }
+  void inc_refcnt() {
+    CHECK(refcnt_ != 0);
+    refcnt_++;
+    VLOG(fd) << get_native_fd() << " inc_refcnt to " << refcnt_;
+  }
+
+  void notify_iocp_write() {
+    inc_refcnt();
+    Iocp::get()->post(0, this, nullptr);
+  }
+  void notify_iocp_close() {
+    Iocp::get()->post(0, this, reinterpret_cast<WSAOVERLAPPED *>(&close_overlapped_));
+  }
+  void notify_iocp_connected() {
+    inc_refcnt();
+    Iocp::get()->post(0, this, &read_overlapped_);
+  }
+};
+
+void SocketFdImplDeleter::operator()(SocketFdImpl *impl) {
+  impl->close();
+}
+
+class InitWSA {
+ public:
+  InitWSA() {
+    /* Use the MAKEWORD(lowbyte, highbyte) macro declared in Windef.h */
+    WORD wVersionRequested = MAKEWORD(2, 2);
+    WSADATA wsaData;
+    if (WSAStartup(wVersionRequested, &wsaData) != 0) {
+      auto error = OS_SOCKET_ERROR("Failed to init WSA");
+      LOG(FATAL) << error;
+    }
+  }
+};
+
+static InitWSA init_wsa;
+
+#else
+class SocketFdImpl {
+ public:
+  PollableFdInfo info;
+  explicit SocketFdImpl(NativeFd fd) : info(std::move(fd)) {
+  }
+  PollableFdInfo &get_poll_info() {
+    return info;
+  }
+  const PollableFdInfo &get_poll_info() const {
+    return info;
+  }
+
+  const NativeFd &get_native_fd() const {
+    return info.native_fd();
+  }
+  Result<size_t> writev(Span<IoSlice> slices) {
+    int native_fd = get_native_fd().socket();
+    auto write_res =
+        detail::skip_eintr([&] { return ::writev(native_fd, slices.begin(), narrow_cast<int>(slices.size())); });
+    return write_finish(write_res);
+  }
+  Result<size_t> write(Slice slice) {
+    int native_fd = get_native_fd().socket();
+    auto write_res = detail::skip_eintr([&] { return ::write(native_fd, slice.begin(), slice.size()); });
+    return write_finish(write_res);
+  }
+  Result<size_t> write_finish(ssize_t write_res) {
+    auto write_errno = errno;
+    if (write_res >= 0) {
+      return narrow_cast<size_t>(write_res);
+    }
+
+    if (write_errno == EAGAIN
+#if EAGAIN != EWOULDBLOCK
+        || write_errno == EWOULDBLOCK
+#endif
+    ) {
+      get_poll_info().clear_flags(PollFlags::Write());
+      return 0;
+    }
+
+    auto error = Status::PosixError(write_errno, PSLICE() << "Write to " << get_native_fd() << " has failed");
+    switch (write_errno) {
+      case EBADF:
+      case ENXIO:
+      case EFAULT:
+      case EINVAL:
+        LOG(FATAL) << error;
+        UNREACHABLE();
+      default:
+        LOG(WARNING) << error;
+      // fallthrough
+      case ECONNRESET:
+      case EDQUOT:
+      case EFBIG:
+      case EIO:
+      case ENETDOWN:
+      case ENETUNREACH:
+      case ENOSPC:
+      case EPIPE:
+        get_poll_info().clear_flags(PollFlags::Write());
+        get_poll_info().add_flags(PollFlags::Close());
+        return std::move(error);
+    }
+  }
+  Result<size_t> read(MutableSlice slice) {
+    if (get_poll_info().get_flags().has_pending_error()) {
+      TRY_STATUS(get_pending_error());
+    }
+    int native_fd = get_native_fd().socket();
+    CHECK(slice.size() > 0);
+    auto read_res = detail::skip_eintr([&] { return ::read(native_fd, slice.begin(), slice.size()); });
+    auto read_errno = errno;
+    if (read_res >= 0) {
+      if (read_res == 0) {
+        errno = 0;
+        get_poll_info().clear_flags(PollFlags::Read());
+        get_poll_info().add_flags(PollFlags::Close());
+      }
+      return narrow_cast<size_t>(read_res);
+    }
+    if (read_errno == EAGAIN
+#if EAGAIN != EWOULDBLOCK
+        || read_errno == EWOULDBLOCK
+#endif
+    ) {
+      get_poll_info().clear_flags(PollFlags::Read());
+      return 0;
+    }
+    auto error = Status::PosixError(read_errno, PSLICE() << "Read from " << get_native_fd() << " has failed");
+    switch (read_errno) {
+      case EISDIR:
+      case EBADF:
+      case ENXIO:
+      case EFAULT:
+      case EINVAL:
+        LOG(FATAL) << error;
+        UNREACHABLE();
+      default:
+        LOG(WARNING) << error;
+      // fallthrough
+      case ENOTCONN:
+      case EIO:
+      case ENOBUFS:
+      case ENOMEM:
+      case ECONNRESET:
+      case ETIMEDOUT:
+        get_poll_info().clear_flags(PollFlags::Read());
+        get_poll_info().add_flags(PollFlags::Close());
+        return std::move(error);
+    }
+  }
+  Status get_pending_error() {
+    if (!get_poll_info().get_flags().has_pending_error()) {
+      return Status::OK();
+    }
+    TRY_STATUS(detail::get_socket_pending_error(get_native_fd()));
+    get_poll_info().clear_flags(PollFlags::Error());
+    return Status::OK();
+  }
+};
+
+void SocketFdImplDeleter::operator()(SocketFdImpl *impl) {
+  delete impl;
+}
+
+#endif
+
+#if TD_PORT_POSIX
+Status get_socket_pending_error(const NativeFd &fd) {
+  int error = 0;
+  socklen_t errlen = sizeof(error);
+  if (getsockopt(fd.socket(), SOL_SOCKET, SO_ERROR, static_cast<void *>(&error), &errlen) == 0) {
+    if (error == 0) {
+      return Status::OK();
+    }
+    return Status::PosixError(error, PSLICE() << "Error on " << fd);
+  }
+  auto status = OS_SOCKET_ERROR(PSLICE() << "Can't load error on socket " << fd);
+  LOG(INFO) << "Can't load pending socket error: " << status;
+  return status;
+}
+#elif TD_PORT_WINDOWS
+Status get_socket_pending_error(const NativeFd &fd, WSAOVERLAPPED *overlapped, Status iocp_error) {
+  // We need to call WSAGetOverlappedResult() just so WSAGetLastError() will return the correct error. See
+  // https://stackoverflow.com/questions/28925003/calling-wsagetlasterror-from-an-iocp-thread-return-incorrect-result
+  DWORD num_bytes = 0;
+  DWORD flags = 0;
+  BOOL success = WSAGetOverlappedResult(fd.socket(), overlapped, &num_bytes, false, &flags);
+  if (success) {
+    LOG(ERROR) << "WSAGetOverlappedResult succeded after " << iocp_error;
+    return iocp_error;
+  }
+  return OS_SOCKET_ERROR(PSLICE() << "Error on " << fd);
+}
+#endif
+
+Status init_socket_options(NativeFd &native_fd) {
+  TRY_STATUS(native_fd.set_is_blocking_unsafe(false));
+
+  auto sock = native_fd.socket();
+#if TD_PORT_POSIX
+  int flags = 1;
+#elif TD_PORT_WINDOWS
+  BOOL flags = TRUE;
+#endif
+  setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, reinterpret_cast<const char *>(&flags), sizeof(flags));
+  setsockopt(sock, SOL_SOCKET, SO_KEEPALIVE, reinterpret_cast<const char *>(&flags), sizeof(flags));
+  setsockopt(sock, IPPROTO_TCP, TCP_NODELAY, reinterpret_cast<const char *>(&flags), sizeof(flags));
+  // TODO: SO_REUSEADDR, SO_KEEPALIVE, TCP_NODELAY, SO_SNDBUF, SO_RCVBUF, TCP_QUICKACK, SO_LINGER
+
+  return Status::OK();
+}
+
+}  // namespace detail
+
+SocketFd::SocketFd() = default;
+SocketFd::SocketFd(SocketFd &&) = default;
+SocketFd &SocketFd::operator=(SocketFd &&) = default;
+SocketFd::~SocketFd() = default;
+
+SocketFd::SocketFd(unique_ptr<detail::SocketFdImpl> impl) : impl_(impl.release()) {
+}
+
+Result<SocketFd> SocketFd::from_native_fd(NativeFd fd) {
+  TRY_STATUS(detail::init_socket_options(fd));
+  return SocketFd(make_unique<detail::SocketFdImpl>(std::move(fd)));
+}
+
+Result<SocketFd> SocketFd::open(const IPAddress &address) {
+  NativeFd native_fd{socket(address.get_address_family(), SOCK_STREAM, IPPROTO_TCP)};
+  if (!native_fd) {
+    return OS_SOCKET_ERROR("Failed to create a socket");
+  }
+  TRY_STATUS(detail::init_socket_options(native_fd));
+
+#if TD_PORT_POSIX
+  int e_connect =
+      connect(native_fd.socket(), address.get_sockaddr(), narrow_cast<socklen_t>(address.get_sockaddr_len()));
+  if (e_connect == -1) {
+    auto connect_errno = errno;
+    if (connect_errno != EINPROGRESS) {
+      return Status::PosixError(connect_errno, PSLICE() << "Failed to connect to " << address);
+    }
+  }
+  return SocketFd(make_unique<detail::SocketFdImpl>(std::move(native_fd)));
+#elif TD_PORT_WINDOWS
+  auto bind_addr = address.get_any_addr();
+  auto e_bind = bind(native_fd.socket(), bind_addr.get_sockaddr(), narrow_cast<int>(bind_addr.get_sockaddr_len()));
+  if (e_bind != 0) {
+    return OS_SOCKET_ERROR("Failed to bind a socket");
+  }
+  return SocketFd(make_unique<detail::SocketFdImpl>(std::move(native_fd), address));
+#endif
+}
+
+void SocketFd::close() {
+  impl_.reset();
+}
+
+bool SocketFd::empty() const {
+  return !impl_;
+}
+
+PollableFdInfo &SocketFd::get_poll_info() {
+  return impl_->get_poll_info();
+}
+const PollableFdInfo &SocketFd::get_poll_info() const {
+  return impl_->get_poll_info();
+}
+
+const NativeFd &SocketFd::get_native_fd() const {
+  return impl_->get_native_fd();
+}
+
+Status SocketFd::get_pending_error() {
+  return impl_->get_pending_error();
+}
+
+Result<size_t> SocketFd::write(Slice slice) {
+  return impl_->write(slice);
+}
+
+Result<size_t> SocketFd::writev(Span<IoSlice> slices) {
+  return impl_->writev(slices);
+}
+
+Result<size_t> SocketFd::read(MutableSlice slice) {
+  return impl_->read(slice);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/SocketFd.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/SocketFd.h
new file mode 100644
index 0000000000..c19957c40c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/SocketFd.h
@@ -0,0 +1,82 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#include "td/utils/port/detail/NativeFd.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/IoSlice.h"
+#include "td/utils/port/IPAddress.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Span.h"
+#include "td/utils/Status.h"
+
+#include <memory>
+
+namespace td {
+
+namespace detail {
+class SocketFdImpl;
+class SocketFdImplDeleter {
+ public:
+  void operator()(SocketFdImpl *impl);
+};
+}  // namespace detail
+
+class SocketFd {
+ public:
+  SocketFd();
+  SocketFd(const SocketFd &) = delete;
+  SocketFd &operator=(const SocketFd &) = delete;
+  SocketFd(SocketFd &&);
+  SocketFd &operator=(SocketFd &&);
+  ~SocketFd();
+
+  static Result<SocketFd> open(const IPAddress &address) TD_WARN_UNUSED_RESULT;
+
+  PollableFdInfo &get_poll_info();
+  const PollableFdInfo &get_poll_info() const;
+
+  Status get_pending_error() TD_WARN_UNUSED_RESULT;
+
+  Result<size_t> write(Slice slice) TD_WARN_UNUSED_RESULT;
+  Result<size_t> writev(Span<IoSlice> slices) TD_WARN_UNUSED_RESULT;
+  Result<size_t> read(MutableSlice slice) TD_WARN_UNUSED_RESULT;
+
+  const NativeFd &get_native_fd() const;
+  static Result<SocketFd> from_native_fd(NativeFd fd);
+
+  void close();
+  bool empty() const;
+
+ private:
+  std::unique_ptr<detail::SocketFdImpl, detail::SocketFdImplDeleter> impl_;
+  explicit SocketFd(unique_ptr<detail::SocketFdImpl> impl);
+};
+
+namespace detail {
+#if TD_PORT_POSIX
+Status get_socket_pending_error(const NativeFd &fd);
+#elif TD_PORT_WINDOWS
+Status get_socket_pending_error(const NativeFd &fd, WSAOVERLAPPED *overlapped, Status iocp_error);
+#endif
+}  // namespace detail
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/Stat.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/Stat.cpp
new file mode 100644
index 0000000000..1e57ef2271
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/Stat.cpp
@@ -0,0 +1,373 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/Stat.h"
+
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/FileFd.h"
+
+#if TD_PORT_POSIX
+
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/Clocks.h"
+#include "td/utils/ScopeGuard.h"
+
+#include <utility>
+
+#if TD_DARWIN
+#include <mach/mach.h>
+#include <sys/time.h>
+#endif
+
+// We don't want warnings from system headers
+#if TD_GCC
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wconversion"
+#endif
+#include <sys/stat.h>
+#if TD_GCC
+#pragma GCC diagnostic pop
+#endif
+
+#if TD_ANDROID || TD_TIZEN
+#include <sys/syscall.h>
+#endif
+
+namespace td {
+
+namespace detail {
+
+template <class...>
+struct voider {
+  using type = void;
+};
+template <class... T>
+using void_t = typename voider<T...>::type;
+
+template <class T, class = void>
+struct TimeNsec {
+  static std::pair<int, int> get(const T &) {
+    T().warning("Platform lacks support of precise access/modification file times, comment this line to continue");
+    return {0, 0};
+  }
+};
+
+// remove libc compatibility hacks if any: we have our own hacks
+#ifdef st_atimespec
+#undef st_atimespec
+#endif
+
+#ifdef st_atimensec
+#undef st_atimensec
+#endif
+
+#ifdef st_atime_nsec
+#undef st_atime_nsec
+#endif
+
+template <class T>
+struct TimeNsec<T, void_t<char, decltype(T::st_atimespec), decltype(T::st_mtimespec)>> {
+  static std::pair<decltype(decltype(T::st_atimespec)::tv_nsec), decltype(decltype(T::st_mtimespec)::tv_nsec)> get(
+      const T &s) {
+    return {s.st_atimespec.tv_nsec, s.st_mtimespec.tv_nsec};
+  }
+};
+
+template <class T>
+struct TimeNsec<T, void_t<short, decltype(T::st_atimensec), decltype(T::st_mtimensec)>> {
+  static std::pair<decltype(T::st_atimensec), decltype(T::st_mtimensec)> get(const T &s) {
+    return {s.st_atimensec, s.st_mtimensec};
+  }
+};
+
+template <class T>
+struct TimeNsec<T, void_t<int, decltype(T::st_atim), decltype(T::st_mtim)>> {
+  static std::pair<decltype(decltype(T::st_atim)::tv_nsec), decltype(decltype(T::st_mtim)::tv_nsec)> get(const T &s) {
+    return {s.st_atim.tv_nsec, s.st_mtim.tv_nsec};
+  }
+};
+
+template <class T>
+struct TimeNsec<T, void_t<long, decltype(T::st_atime_nsec), decltype(T::st_mtime_nsec)>> {
+  static std::pair<decltype(T::st_atime_nsec), decltype(T::st_mtime_nsec)> get(const T &s) {
+    return {s.st_atime_nsec, s.st_mtime_nsec};
+  }
+};
+
+Stat from_native_stat(const struct ::stat &buf) {
+  auto time_nsec = TimeNsec<struct ::stat>::get(buf);
+
+  Stat res;
+  res.atime_nsec_ = static_cast<uint64>(buf.st_atime) * 1000000000 + time_nsec.first;
+  res.mtime_nsec_ = static_cast<uint64>(buf.st_mtime) * 1000000000 + time_nsec.second / 1000 * 1000;
+  res.size_ = buf.st_size;
+  res.is_dir_ = (buf.st_mode & S_IFMT) == S_IFDIR;
+  res.is_reg_ = (buf.st_mode & S_IFMT) == S_IFREG;
+  return res;
+}
+
+Result<Stat> fstat(int native_fd) {
+  struct ::stat buf;
+  if (detail::skip_eintr([&] { return ::fstat(native_fd, &buf); }) < 0) {
+    return OS_ERROR(PSLICE() << "Stat for fd " << native_fd << " failed");
+  }
+  return detail::from_native_stat(buf);
+}
+
+Status update_atime(int native_fd) {
+#if TD_LINUX
+  timespec times[2];
+  // access time
+  times[0].tv_nsec = UTIME_NOW;
+  times[0].tv_sec = 0;
+  // modify time
+  times[1].tv_nsec = UTIME_OMIT;
+  times[1].tv_sec = 0;
+  if (futimens(native_fd, times) < 0) {
+    auto status = OS_ERROR(PSLICE() << "futimens " << tag("fd", native_fd));
+    LOG(WARNING) << status;
+    return status;
+  }
+  return Status::OK();
+#elif TD_DARWIN
+  TRY_RESULT(info, fstat(native_fd));
+  timeval upd[2];
+  auto now = Clocks::system();
+  // access time
+  upd[0].tv_sec = static_cast<decltype(upd[0].tv_sec)>(now);
+  upd[0].tv_usec = static_cast<decltype(upd[0].tv_usec)>((now - static_cast<double>(upd[0].tv_sec)) * 1000000);
+  // modify time
+  upd[1].tv_sec = static_cast<decltype(upd[1].tv_sec)>(info.mtime_nsec_ / 1000000000ll);
+  upd[1].tv_usec = static_cast<decltype(upd[1].tv_usec)>(info.mtime_nsec_ % 1000000000ll / 1000);
+  if (futimes(native_fd, upd) < 0) {
+    auto status = OS_ERROR(PSLICE() << "futimes " << tag("fd", native_fd));
+    LOG(WARNING) << status;
+    return status;
+  }
+  return Status::OK();
+#else
+  return Status::Error("Not supported");
+// timespec times[2];
+//// access time
+// times[0].tv_nsec = UTIME_NOW;
+//// modify time
+// times[1].tv_nsec = UTIME_OMIT;
+////  int err = syscall(__NR_utimensat, native_fd, nullptr, times, 0);
+// if (futimens(native_fd, times) < 0) {
+//   auto status = OS_ERROR(PSLICE() << "futimens " << tag("fd", native_fd));
+//   LOG(WARNING) << status;
+//   return status;
+// }
+// return Status::OK();
+#endif
+}
+}  // namespace detail
+
+Status update_atime(CSlice path) {
+  TRY_RESULT(file, FileFd::open(path, FileFd::Flags::Read));
+  SCOPE_EXIT {
+    file.close();
+  };
+  return detail::update_atime(file.get_native_fd().fd());
+}
+
+Result<Stat> stat(CSlice path) {
+  struct ::stat buf;
+  int err = detail::skip_eintr([&] { return ::stat(path.c_str(), &buf); });
+  if (err < 0) {
+    return OS_ERROR(PSLICE() << "Stat for file \"" << path << "\" failed");
+  }
+  return detail::from_native_stat(buf);
+}
+
+Result<MemStat> mem_stat() {
+#if TD_DARWIN
+  task_basic_info t_info;
+  mach_msg_type_number_t t_info_count = TASK_BASIC_INFO_COUNT;
+
+  if (KERN_SUCCESS !=
+      task_info(mach_task_self(), TASK_BASIC_INFO, reinterpret_cast<task_info_t>(&t_info), &t_info_count)) {
+    return Status::Error("task_info failed");
+  }
+  MemStat res;
+  res.resident_size_ = t_info.resident_size;
+  res.virtual_size_ = t_info.virtual_size;
+  res.resident_size_peak_ = 0;
+  res.virtual_size_peak_ = 0;
+  return res;
+#elif TD_LINUX || TD_ANDROID || TD_TIZEN
+  TRY_RESULT(fd, FileFd::open("/proc/self/status", FileFd::Read));
+  SCOPE_EXIT {
+    fd.close();
+  };
+
+  constexpr int TMEM_SIZE = 10000;
+  char mem[TMEM_SIZE];
+  TRY_RESULT(size, fd.read(MutableSlice(mem, TMEM_SIZE - 1)));
+  CHECK(size < TMEM_SIZE - 1);
+  mem[size] = 0;
+
+  const char *s = mem;
+  MemStat res;
+  while (*s) {
+    const char *name_begin = s;
+    while (*s != 0 && *s != '\n') {
+      s++;
+    }
+    auto name_end = name_begin;
+    while (is_alpha(*name_end)) {
+      name_end++;
+    }
+    Slice name(name_begin, name_end);
+
+    uint64 *x = nullptr;
+    if (name == "VmPeak") {
+      x = &res.virtual_size_peak_;
+    }
+    if (name == "VmSize") {
+      x = &res.virtual_size_;
+    }
+    if (name == "VmHWM") {
+      x = &res.resident_size_peak_;
+    }
+    if (name == "VmRSS") {
+      x = &res.resident_size_;
+    }
+    if (x != nullptr) {
+      Slice value(name_end, s);
+      if (!value.empty() && value[0] == ':') {
+        value.remove_prefix(1);
+      }
+      value = trim(value);
+      value = split(value).first;
+      auto r_mem = to_integer_safe<uint64>(value);
+      if (r_mem.is_error()) {
+        LOG(ERROR) << "Failed to parse memory stats " << tag("name", name) << tag("value", value);
+        *x = static_cast<uint64>(-1);
+      } else {
+        *x = r_mem.ok() * 1024;  // memory is in kB
+      }
+    }
+    if (*s == 0) {
+      break;
+    }
+    s++;
+  }
+
+  return res;
+#else
+  return Status::Error("Not supported");
+#endif
+}
+
+#if TD_LINUX
+Status cpu_stat_self(CpuStat &stat) {
+  TRY_RESULT(fd, FileFd::open("/proc/self/stat", FileFd::Read));
+  SCOPE_EXIT {
+    fd.close();
+  };
+
+  constexpr int TMEM_SIZE = 10000;
+  char mem[TMEM_SIZE];
+  TRY_RESULT(size, fd.read(MutableSlice(mem, TMEM_SIZE - 1)));
+  CHECK(size < TMEM_SIZE - 1);
+  mem[size] = 0;
+
+  char *s = mem;
+  char *t = mem + size;
+  int pass_cnt = 0;
+
+  while (pass_cnt < 15) {
+    if (pass_cnt == 13) {
+      stat.process_user_ticks = to_integer<uint64>(Slice(s, t));
+    }
+    if (pass_cnt == 14) {
+      stat.process_system_ticks = to_integer<uint64>(Slice(s, t));
+    }
+    while (*s && *s != ' ') {
+      s++;
+    }
+    if (*s == ' ') {
+      s++;
+      pass_cnt++;
+    } else {
+      return Status::Error("unexpected end of proc file");
+    }
+  }
+  return Status::OK();
+}
+Status cpu_stat_total(CpuStat &stat) {
+  TRY_RESULT(fd, FileFd::open("/proc/stat", FileFd::Read));
+  SCOPE_EXIT {
+    fd.close();
+  };
+
+  constexpr int TMEM_SIZE = 10000;
+  char mem[TMEM_SIZE];
+  TRY_RESULT(size, fd.read(MutableSlice(mem, TMEM_SIZE - 1)));
+  CHECK(size < TMEM_SIZE - 1);
+  mem[size] = 0;
+
+  uint64 sum = 0, cur = 0;
+  for (size_t i = 0; i < size; i++) {
+    int c = mem[i];
+    if (c >= '0' && c <= '9') {
+      cur = cur * 10 + (uint64)c - '0';
+    } else {
+      sum += cur;
+      cur = 0;
+      if (c == '\n') {
+        break;
+      }
+    }
+  }
+
+  stat.total_ticks = sum;
+  return Status::OK();
+}
+#endif
+
+Result<CpuStat> cpu_stat() {
+#if TD_LINUX
+  CpuStat stat;
+  TRY_STATUS(cpu_stat_self(stat));
+  TRY_STATUS(cpu_stat_total(stat));
+  return stat;
+#else
+  return Status::Error("Not supported");
+#endif
+}
+}  // namespace td
+#endif
+
+#if TD_PORT_WINDOWS
+namespace td {
+
+Result<Stat> stat(CSlice path) {
+  TRY_RESULT(fd, FileFd::open(path, FileFd::Flags::Read | FileFd::PrivateFlags::WinStat));
+  return fd.stat();
+}
+
+Result<CpuStat> cpu_stat() {
+  return Status::Error("Not supported");
+}
+
+}  // namespace td
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/Stat.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/Stat.h
new file mode 100644
index 0000000000..5f8c002bd8
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/Stat.h
@@ -0,0 +1,65 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+namespace td {
+
+struct Stat {
+  bool is_dir_;
+  bool is_reg_;
+  int64 size_;
+  uint64 atime_nsec_;
+  uint64 mtime_nsec_;
+};
+
+Result<Stat> stat(CSlice path) TD_WARN_UNUSED_RESULT;
+
+struct CpuStat {
+  uint64 total_ticks{0};
+  uint64 process_user_ticks{0};
+  uint64 process_system_ticks{0};
+};
+Result<CpuStat> cpu_stat() TD_WARN_UNUSED_RESULT;
+
+#if TD_PORT_POSIX
+
+namespace detail {
+Result<Stat> fstat(int native_fd);
+}  // namespace detail
+
+Status update_atime(CSlice path) TD_WARN_UNUSED_RESULT;
+
+struct MemStat {
+  uint64 resident_size_ = 0;
+  uint64 resident_size_peak_ = 0;
+  uint64 virtual_size_ = 0;
+  uint64 virtual_size_peak_ = 0;
+};
+
+Result<MemStat> mem_stat() TD_WARN_UNUSED_RESULT;
+
+#endif
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/StdStreams.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/StdStreams.cpp
new file mode 100644
index 0000000000..f3d1501396
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/StdStreams.cpp
@@ -0,0 +1,252 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/StdStreams.h"
+
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/detail/Iocp.h"
+#include "td/utils/port/detail/NativeFd.h"
+#include "td/utils/port/PollFlags.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/Slice.h"
+
+#include <atomic>
+#include <cassert>
+
+namespace td {
+
+#if TD_PORT_POSIX
+template <int id>
+static FileFd &get_file_fd() {
+  static FileFd result = FileFd::from_native_fd(NativeFd(id, true));
+  static auto guard = td::ScopeExit() + [&] { result.move_as_native_fd().release(); };
+  assert(!result.empty());
+  return result;
+}
+
+FileFd &Stdin() {
+  return get_file_fd<0>();
+}
+FileFd &Stdout() {
+  return get_file_fd<1>();
+}
+FileFd &Stderr() {
+  return get_file_fd<2>();
+}
+#elif TD_PORT_WINDOWS
+template <DWORD id>
+static FileFd &get_file_fd() {
+#if WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_DESKTOP | WINAPI_PARTITION_SYSTEM)
+  static auto handle = GetStdHandle(id);
+  LOG_IF(FATAL, handle == INVALID_HANDLE_VALUE) << "Failed to GetStdHandle " << id;
+  static FileFd result = FileFd::from_native_fd(NativeFd(handle, true));
+  static auto guard = td::ScopeExit() + [&] { result.move_as_native_fd().release(); };
+#else
+  static FileFd result;
+#endif
+  return result;
+}
+
+FileFd &Stdin() {
+  return get_file_fd<STD_INPUT_HANDLE>();
+}
+FileFd &Stdout() {
+  return get_file_fd<STD_OUTPUT_HANDLE>();
+}
+FileFd &Stderr() {
+  return get_file_fd<STD_ERROR_HANDLE>();
+}
+#endif
+
+#if TD_PORT_WINDOWS
+namespace detail {
+class BufferedStdinImpl : public Iocp::Callback {
+ public:
+#if WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_DESKTOP | WINAPI_PARTITION_SYSTEM)
+  BufferedStdinImpl() : info_(NativeFd(GetStdHandle(STD_INPUT_HANDLE), true)) {
+    iocp_ref_ = Iocp::get()->get_ref();
+    read_thread_ = td::thread([this] { this->read_loop(); });
+  }
+#else
+  BufferedStdinImpl() {
+    close();
+  }
+#endif
+  BufferedStdinImpl(const BufferedStdinImpl &) = delete;
+  BufferedStdinImpl &operator=(const BufferedStdinImpl &) = delete;
+  BufferedStdinImpl(BufferedStdinImpl &&) = delete;
+  BufferedStdinImpl &operator=(BufferedStdinImpl &&) = delete;
+  ~BufferedStdinImpl() {
+    info_.move_as_native_fd().release();
+  }
+  void close() {
+    close_flag_ = true;
+  }
+
+  ChainBufferReader &input_buffer() {
+    return reader_;
+  }
+
+  PollableFdInfo &get_poll_info() {
+    return info_;
+  }
+  const PollableFdInfo &get_poll_info() const {
+    return info_;
+  }
+
+  Result<size_t> flush_read(size_t max_read = std::numeric_limits<size_t>::max()) TD_WARN_UNUSED_RESULT {
+    info_.get_flags();
+    info_.clear_flags(PollFlags::Read());
+    reader_.sync_with_writer();
+    return reader_.size();
+  }
+
+ private:
+  PollableFdInfo info_;
+  ChainBufferWriter writer_;
+  ChainBufferReader reader_ = writer_.extract_reader();
+  td::thread read_thread_;
+  std::atomic<bool> close_flag_{false};
+  IocpRef iocp_ref_;
+  std::atomic<int> refcnt_{1};
+
+  void read_loop() {
+    while (!close_flag_) {
+      auto slice = writer_.prepare_append();
+      auto r_size = read(slice);
+      if (r_size.is_error()) {
+        LOG(ERROR) << "Stop read stdin loop: " << r_size.error();
+        break;
+      }
+      writer_.confirm_append(r_size.ok());
+      if (iocp_ref_.post(0, this, nullptr)) {
+        inc_refcnt();
+      }
+    }
+    if (!iocp_ref_.post(0, this, nullptr)) {
+      dec_refcnt();
+    }
+  }
+  void on_iocp(Result<size_t> r_size, WSAOVERLAPPED *overlapped) override {
+    info_.add_flags_from_poll(td::PollFlags::Read());
+    dec_refcnt();
+  }
+
+  bool dec_refcnt() {
+    if (--refcnt_ == 0) {
+      delete this;
+      return true;
+    }
+    return false;
+  }
+  void inc_refcnt() {
+    CHECK(refcnt_ != 0);
+    refcnt_++;
+  }
+
+  Result<size_t> read(MutableSlice slice) {
+    auto native_fd = info_.native_fd().fd();
+    DWORD bytes_read = 0;
+    auto res = ReadFile(native_fd, slice.data(), narrow_cast<DWORD>(slice.size()), &bytes_read, nullptr);
+    if (res) {
+      return static_cast<size_t>(bytes_read);
+    }
+    return OS_ERROR(PSLICE() << "Read from " << info_.native_fd() << " has failed");
+  }
+};
+void BufferedStdinImplDeleter::operator()(BufferedStdinImpl *impl) {
+  //  LOG(ERROR) << "Close";
+  impl->close();
+}
+}  // namespace detail
+#elif TD_PORT_POSIX
+namespace detail {
+class BufferedStdinImpl {
+ public:
+  BufferedStdinImpl() {
+    file_fd_ = FileFd::from_native_fd(NativeFd(Stdin().get_native_fd().fd()));
+    file_fd_.get_native_fd().set_is_blocking(false);
+  }
+  BufferedStdinImpl(const BufferedStdinImpl &) = delete;
+  BufferedStdinImpl &operator=(const BufferedStdinImpl &) = delete;
+  BufferedStdinImpl(BufferedStdinImpl &&) = delete;
+  BufferedStdinImpl &operator=(BufferedStdinImpl &&) = delete;
+  ~BufferedStdinImpl() {
+    file_fd_.get_native_fd().set_is_blocking(true);
+    file_fd_.move_as_native_fd().release();
+  }
+
+  ChainBufferReader &input_buffer() {
+    return reader_;
+  }
+
+  PollableFdInfo &get_poll_info() {
+    return file_fd_.get_poll_info();
+  }
+  const PollableFdInfo &get_poll_info() const {
+    return file_fd_.get_poll_info();
+  }
+
+  Result<size_t> flush_read(size_t max_read = std::numeric_limits<size_t>::max()) TD_WARN_UNUSED_RESULT {
+    size_t result = 0;
+    while (::td::can_read(*this) && max_read) {
+      MutableSlice slice = writer_.prepare_append().truncate(max_read);
+      TRY_RESULT(x, file_fd_.read(slice));
+      slice.truncate(x);
+      writer_.confirm_append(x);
+      result += x;
+      max_read -= x;
+    }
+    if (result) {
+      reader_.sync_with_writer();
+    }
+    return result;
+  }
+
+ private:
+  FileFd file_fd_;
+  ChainBufferWriter writer_;
+  ChainBufferReader reader_ = writer_.extract_reader();
+};
+void BufferedStdinImplDeleter::operator()(BufferedStdinImpl *impl) {
+  delete impl;
+}
+}  // namespace detail
+#endif
+
+BufferedStdin::BufferedStdin() : impl_(make_unique<detail::BufferedStdinImpl>().release()) {
+}
+BufferedStdin::BufferedStdin(BufferedStdin &&) = default;
+BufferedStdin &BufferedStdin::operator=(BufferedStdin &&) = default;
+BufferedStdin::~BufferedStdin() = default;
+
+ChainBufferReader &BufferedStdin::input_buffer() {
+  return impl_->input_buffer();
+}
+PollableFdInfo &BufferedStdin::get_poll_info() {
+  return impl_->get_poll_info();
+}
+const PollableFdInfo &BufferedStdin::get_poll_info() const {
+  return impl_->get_poll_info();
+}
+Result<size_t> BufferedStdin::flush_read(size_t max_read) {
+  return impl_->flush_read(max_read);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/StdStreams.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/StdStreams.h
new file mode 100644
index 0000000000..28d3cd1967
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/StdStreams.h
@@ -0,0 +1,61 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/buffer.h"
+#include "td/utils/common.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/FileFd.h"
+#include "td/utils/Status.h"
+
+#include <limits>
+#include <memory>
+
+namespace td {
+
+FileFd &Stdin();
+FileFd &Stdout();
+FileFd &Stderr();
+
+namespace detail {
+class BufferedStdinImpl;
+class BufferedStdinImplDeleter {
+ public:
+  void operator()(BufferedStdinImpl *impl);
+};
+}  // namespace detail
+
+class BufferedStdin {
+ public:
+  BufferedStdin();
+  BufferedStdin(const BufferedStdin &) = delete;
+  BufferedStdin &operator=(const BufferedStdin &) = delete;
+  BufferedStdin(BufferedStdin &&);
+  BufferedStdin &operator=(BufferedStdin &&);
+  ~BufferedStdin();
+  ChainBufferReader &input_buffer();
+  PollableFdInfo &get_poll_info();
+  const PollableFdInfo &get_poll_info() const;
+  Result<size_t> flush_read(size_t max_read = std::numeric_limits<size_t>::max()) TD_WARN_UNUSED_RESULT;
+
+ private:
+  std::unique_ptr<detail::BufferedStdinImpl, detail::BufferedStdinImplDeleter> impl_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/UdpSocketFd.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/UdpSocketFd.cpp
new file mode 100644
index 0000000000..390cbc0283
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/UdpSocketFd.cpp
@@ -0,0 +1,873 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/UdpSocketFd.h"
+
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/PollFlags.h"
+#include "td/utils/port/SocketFd.h"
+#include "td/utils/VectorQueue.h"
+
+#if TD_PORT_WINDOWS
+#include "td/utils/port/detail/Iocp.h"
+#include "td/utils/SpinLock.h"
+#endif
+
+#if TD_PORT_POSIX
+#include <arpa/inet.h>
+#include <fcntl.h>
+#include <netinet/in.h>
+#include <netinet/tcp.h>
+#include <sys/socket.h>
+#include <sys/types.h>
+#include <unistd.h>
+
+#if TD_LINUX
+#include <linux/errqueue.h>
+#endif
+#endif  // TD_PORT_POSIX
+
+#include <array>
+#include <atomic>
+#include <cstring>
+
+namespace td {
+namespace detail {
+#if TD_PORT_WINDOWS
+class UdpSocketReceiveHelper {
+ public:
+  void to_native(const UdpMessage &message, WSAMSG &message_header) {
+    socklen_t addr_len{narrow_cast<socklen_t>(sizeof(addr_))};
+    message_header.name = reinterpret_cast<struct sockaddr *>(&addr_);
+    message_header.namelen = addr_len;
+    buf_.buf = const_cast<char *>(message.data.as_slice().begin());
+    buf_.len = narrow_cast<DWORD>(message.data.size());
+    message_header.lpBuffers = &buf_;
+    message_header.dwBufferCount = 1;
+    message_header.Control.buf = nullptr;  // control_buf_.data();
+    message_header.Control.len = 0;        // narrow_cast<decltype(message_header.Control.len)>(control_buf_.size());
+    message_header.dwFlags = 0;
+  }
+
+  void from_native(WSAMSG &message_header, size_t message_size, UdpMessage &message) {
+    message.address.init_sockaddr(reinterpret_cast<struct sockaddr *>(message_header.name), message_header.namelen)
+        .ignore();
+    message.error = Status::OK();
+
+    if ((message_header.dwFlags & (MSG_TRUNC | MSG_CTRUNC)) != 0) {
+      message.error = Status::Error(501, "message too long");
+      message.data = BufferSlice();
+      return;
+    }
+
+    CHECK(message_size <= message.data.size());
+    message.data.truncate(message_size);
+    CHECK(message_size == message.data.size());
+  }
+
+ private:
+  std::array<char, 1024> control_buf_;
+  sockaddr_storage addr_;
+  WSABUF buf_;
+};
+class UdpSocketSendHelper {
+ public:
+  void to_native(const UdpMessage &message, WSAMSG &message_header) {
+    message_header.name = const_cast<struct sockaddr *>(message.address.get_sockaddr());
+    message_header.namelen = narrow_cast<socklen_t>(message.address.get_sockaddr_len());
+    buf_.buf = const_cast<char *>(message.data.as_slice().begin());
+    buf_.len = narrow_cast<DWORD>(message.data.size());
+    message_header.lpBuffers = &buf_;
+    message_header.dwBufferCount = 1;
+
+    message_header.Control.buf = nullptr;
+    message_header.Control.len = 0;
+    message_header.dwFlags = 0;
+  }
+
+ private:
+  WSABUF buf_;
+};
+
+class UdpSocketFdImpl : private Iocp::Callback {
+ public:
+  explicit UdpSocketFdImpl(NativeFd fd) : info_(std::move(fd)) {
+    get_poll_info().add_flags(PollFlags::Write());
+    Iocp::get()->subscribe(get_native_fd(), this);
+    is_receive_active_ = true;
+    notify_iocp_connected();
+  }
+  PollableFdInfo &get_poll_info() {
+    return info_;
+  }
+  const PollableFdInfo &get_poll_info() const {
+    return info_;
+  }
+
+  const NativeFd &get_native_fd() const {
+    return info_.native_fd();
+  }
+
+  void close() {
+    notify_iocp_close();
+  }
+
+  Result<optional<UdpMessage>> receive() {
+    auto lock = lock_.lock();
+    if (!pending_errors_.empty()) {
+      auto status = pending_errors_.pop();
+      if (!UdpSocketFd::is_critical_read_error(status)) {
+        return UdpMessage{{}, {}, std::move(status)};
+      }
+      return std::move(status);
+    }
+    if (!receive_queue_.empty()) {
+      return receive_queue_.pop();
+    }
+
+    return optional<UdpMessage>{};
+  }
+
+  void send(UdpMessage message) {
+    auto lock = lock_.lock();
+    send_queue_.push(std::move(message));
+  }
+
+  Status flush_send() {
+    if (is_send_waiting_) {
+      auto lock = lock_.lock();
+      is_send_waiting_ = false;
+      notify_iocp_send();
+    }
+    return Status::OK();
+  }
+
+ private:
+  PollableFdInfo info_;
+  SpinLock lock_;
+
+  std::atomic<int> refcnt_{1};
+  bool is_connected_{false};
+  bool close_flag_{false};
+
+  bool is_send_active_{false};
+  bool is_send_waiting_{false};
+  VectorQueue<UdpMessage> send_queue_;
+  WSAOVERLAPPED send_overlapped_;
+
+  bool is_receive_active_{false};
+  VectorQueue<UdpMessage> receive_queue_;
+  VectorQueue<Status> pending_errors_;
+  UdpMessage to_receive_;
+  WSAMSG receive_message_;
+  UdpSocketReceiveHelper receive_helper_;
+  enum : size_t { MAX_PACKET_SIZE = 2048, RESERVED_SIZE = MAX_PACKET_SIZE * 8 };
+  BufferSlice receive_buffer_;
+
+  UdpMessage to_send_;
+  WSAOVERLAPPED receive_overlapped_;
+
+  char close_overlapped_;
+
+  bool check_status(Slice message) {
+    auto last_error = WSAGetLastError();
+    if (last_error == ERROR_IO_PENDING) {
+      return true;
+    }
+    on_error(OS_SOCKET_ERROR(message));
+    return false;
+  }
+
+  void loop_receive() {
+    CHECK(!is_receive_active_);
+    if (close_flag_) {
+      return;
+    }
+    std::memset(&receive_overlapped_, 0, sizeof(receive_overlapped_));
+    if (receive_buffer_.size() < MAX_PACKET_SIZE) {
+      receive_buffer_ = BufferSlice(RESERVED_SIZE);
+    }
+    to_receive_.data = receive_buffer_.clone();
+    receive_helper_.to_native(to_receive_, receive_message_);
+
+    LPFN_WSARECVMSG WSARecvMsgPtr = nullptr;
+    GUID guid = WSAID_WSARECVMSG;
+    DWORD numBytes;
+    auto error = ::WSAIoctl(get_native_fd().socket(), SIO_GET_EXTENSION_FUNCTION_POINTER, static_cast<void *>(&guid),
+                            sizeof(guid), static_cast<void *>(&WSARecvMsgPtr), sizeof(WSARecvMsgPtr), &numBytes,
+                            nullptr, nullptr);
+    if (error) {
+      on_error(OS_SOCKET_ERROR("WSAIoctl failed"));
+      return;
+    }
+
+    auto status = WSARecvMsgPtr(get_native_fd().socket(), &receive_message_, nullptr, &receive_overlapped_, nullptr);
+    if (status == 0 || check_status("WSARecvMsg failed")) {
+      inc_refcnt();
+      is_receive_active_ = true;
+    }
+  }
+
+  void loop_send() {
+    CHECK(!is_send_active_);
+
+    {
+      auto lock = lock_.lock();
+      if (send_queue_.empty()) {
+        is_send_waiting_ = true;
+        return;
+      }
+      to_send_ = send_queue_.pop();
+    }
+    std::memset(&send_overlapped_, 0, sizeof(send_overlapped_));
+    WSAMSG message;
+    UdpSocketSendHelper send_helper;
+    send_helper.to_native(to_send_, message);
+    auto status = WSASendMsg(get_native_fd().socket(), &message, 0, nullptr, &send_overlapped_, nullptr);
+    if (status == 0 || check_status("WSASendMsg failed")) {
+      inc_refcnt();
+      is_send_active_ = true;
+    }
+  }
+
+  void on_iocp(Result<size_t> r_size, WSAOVERLAPPED *overlapped) override {
+    // called from other thread
+    if (dec_refcnt() || close_flag_) {
+      VLOG(fd) << "Ignore IOCP (UDP socket is closing)";
+      return;
+    }
+    if (r_size.is_error()) {
+      return on_error(get_socket_pending_error(get_native_fd(), overlapped, r_size.move_as_error()));
+    }
+
+    if (!is_connected_ && overlapped == &receive_overlapped_) {
+      return on_connected();
+    }
+
+    auto size = r_size.move_as_ok();
+    if (overlapped == &send_overlapped_) {
+      return on_send(size);
+    }
+    if (overlapped == nullptr) {
+      CHECK(size == 0);
+      return on_send(size);
+    }
+
+    if (overlapped == &receive_overlapped_) {
+      return on_receive(size);
+    }
+    if (overlapped == reinterpret_cast<WSAOVERLAPPED *>(&close_overlapped_)) {
+      return on_close();
+    }
+    UNREACHABLE();
+  }
+
+  void on_error(Status status) {
+    VLOG(fd) << get_native_fd() << " on error " << status;
+    {
+      auto lock = lock_.lock();
+      pending_errors_.push(std::move(status));
+    }
+    get_poll_info().add_flags_from_poll(PollFlags::Error());
+  }
+
+  void on_connected() {
+    VLOG(fd) << get_native_fd() << " on connected";
+    CHECK(!is_connected_);
+    CHECK(is_receive_active_);
+    is_connected_ = true;
+    is_receive_active_ = false;
+    loop_receive();
+    loop_send();
+  }
+
+  void on_receive(size_t size) {
+    VLOG(fd) << get_native_fd() << " on receive " << size;
+    CHECK(is_receive_active_);
+    is_receive_active_ = false;
+    receive_helper_.from_native(receive_message_, size, to_receive_);
+    receive_buffer_.confirm_read((to_receive_.data.size() + 7) & ~7);
+    {
+      auto lock = lock_.lock();
+      // LOG(ERROR) << format::escaped(to_receive_.data.as_slice());
+      receive_queue_.push(std::move(to_receive_));
+    }
+    get_poll_info().add_flags_from_poll(PollFlags::Read());
+    loop_receive();
+  }
+
+  void on_send(size_t size) {
+    VLOG(fd) << get_native_fd() << " on send " << size;
+    if (size == 0) {
+      if (is_send_active_) {
+        return;
+      }
+      is_send_active_ = true;
+    }
+    CHECK(is_send_active_);
+    is_send_active_ = false;
+    loop_send();
+  }
+
+  void on_close() {
+    VLOG(fd) << get_native_fd() << " on close";
+    close_flag_ = true;
+    info_.set_native_fd({});
+  }
+
+  bool dec_refcnt() {
+    if (--refcnt_ == 0) {
+      delete this;
+      return true;
+    }
+    return false;
+  }
+
+  void inc_refcnt() {
+    CHECK(refcnt_ != 0);
+    refcnt_++;
+  }
+
+  void notify_iocp_send() {
+    inc_refcnt();
+    Iocp::get()->post(0, this, nullptr);
+  }
+  void notify_iocp_close() {
+    Iocp::get()->post(0, this, reinterpret_cast<WSAOVERLAPPED *>(&close_overlapped_));
+  }
+  void notify_iocp_connected() {
+    inc_refcnt();
+    Iocp::get()->post(0, this, reinterpret_cast<WSAOVERLAPPED *>(&receive_overlapped_));
+  }
+};
+
+void UdpSocketFdImplDeleter::operator()(UdpSocketFdImpl *impl) {
+  impl->close();
+}
+
+#elif TD_PORT_POSIX
+//struct iovec {                  [> Scatter/gather array items <]
+//  void  *iov_base;              [> Starting address <]
+//  size_t iov_len;               [> Number of bytes to transfer <]
+//};
+
+//struct msghdr {
+//  void         *msg_name;       [> optional address <]
+//  socklen_t     msg_namelen;    [> size of address <]
+//  struct iovec *msg_iov;        [> scatter/gather array <]
+//  size_t        msg_iovlen;     [> # elements in msg_iov <]
+//  void         *msg_control;    [> ancillary data, see below <]
+//  size_t        msg_controllen; [> ancillary data buffer len <]
+//  int           msg_flags;      [> flags on received message <]
+//};
+
+class UdpSocketReceiveHelper {
+ public:
+  void to_native(const UdpSocketFd::InboundMessage &message, struct msghdr &message_header) {
+    socklen_t addr_len{narrow_cast<socklen_t>(sizeof(addr_))};
+
+    message_header.msg_name = &addr_;
+    message_header.msg_namelen = addr_len;
+    io_vec_.iov_base = message.data.begin();
+    io_vec_.iov_len = message.data.size();
+    message_header.msg_iov = &io_vec_;
+    message_header.msg_iovlen = 1;
+    message_header.msg_control = control_buf_.data();
+    message_header.msg_controllen = narrow_cast<decltype(message_header.msg_controllen)>(control_buf_.size());
+    message_header.msg_flags = 0;
+  }
+
+  void from_native(struct msghdr &message_header, size_t message_size, UdpSocketFd::InboundMessage &message) {
+#if TD_LINUX
+    struct cmsghdr *cmsg;
+    struct sock_extended_err *ee = nullptr;
+    for (cmsg = CMSG_FIRSTHDR(&message_header); cmsg != nullptr; cmsg = CMSG_NXTHDR(&message_header, cmsg)) {
+      if (cmsg->cmsg_type == IP_PKTINFO && cmsg->cmsg_level == IPPROTO_IP) {
+        //auto *pi = reinterpret_cast<struct in_pktinfo *>(CMSG_DATA(cmsg));
+      } else if (cmsg->cmsg_type == IPV6_PKTINFO && cmsg->cmsg_level == IPPROTO_IPV6) {
+        //auto *pi = reinterpret_cast<struct in6_pktinfo *>(CMSG_DATA(cmsg));
+      } else if ((cmsg->cmsg_type == IP_RECVERR && cmsg->cmsg_level == IPPROTO_IP) ||
+                 (cmsg->cmsg_type == IPV6_RECVERR && cmsg->cmsg_level == IPPROTO_IPV6)) {
+        ee = reinterpret_cast<struct sock_extended_err *>(CMSG_DATA(cmsg));
+      }
+    }
+    if (ee != nullptr) {
+      auto *addr = reinterpret_cast<struct sockaddr *>(SO_EE_OFFENDER(ee));
+      IPAddress address;
+      address.init_sockaddr(addr).ignore();
+      if (message.from != nullptr) {
+        *message.from = address;
+      }
+      if (message.error) {
+        *message.error = Status::PosixError(ee->ee_errno, "");
+      }
+      //message.data = MutableSlice();
+      message.data.truncate(0);
+      return;
+    }
+#endif
+    if (message.from != nullptr) {
+      message.from
+          ->init_sockaddr(reinterpret_cast<struct sockaddr *>(message_header.msg_name), message_header.msg_namelen)
+          .ignore();
+    }
+    if (message.error) {
+      *message.error = Status::OK();
+    }
+    if (message_header.msg_flags & MSG_TRUNC) {
+      if (message.error) {
+        *message.error = Status::Error(501, "message too long");
+      }
+      message.data.truncate(0);
+      return;
+    }
+    CHECK(message_size <= message.data.size());
+    message.data.truncate(message_size);
+    CHECK(message_size == message.data.size());
+  }
+
+ private:
+  std::array<char, 1024> control_buf_;
+  sockaddr_storage addr_;
+  struct iovec io_vec_;
+};
+
+class UdpSocketSendHelper {
+ public:
+  void to_native(const UdpSocketFd::OutboundMessage &message, struct msghdr &message_header) {
+    CHECK(message.to != nullptr && message.to->is_valid());
+    message_header.msg_name = const_cast<struct sockaddr *>(message.to->get_sockaddr());
+    message_header.msg_namelen = narrow_cast<socklen_t>(message.to->get_sockaddr_len());
+    io_vec_.iov_base = const_cast<char *>(message.data.begin());
+    io_vec_.iov_len = message.data.size();
+    message_header.msg_iov = &io_vec_;
+    message_header.msg_iovlen = 1;
+    //TODO
+    message_header.msg_control = nullptr;
+    message_header.msg_controllen = 0;
+    message_header.msg_flags = 0;
+  }
+
+ private:
+  struct iovec io_vec_;
+};
+
+class UdpSocketFdImpl {
+ public:
+  explicit UdpSocketFdImpl(NativeFd fd) : info_(std::move(fd)) {
+  }
+  PollableFdInfo &get_poll_info() {
+    return info_;
+  }
+  const PollableFdInfo &get_poll_info() const {
+    return info_;
+  }
+
+  const NativeFd &get_native_fd() const {
+    return info_.native_fd();
+  }
+  Status get_pending_error() {
+    if (!get_poll_info().get_flags().has_pending_error()) {
+      return Status::OK();
+    }
+    TRY_STATUS(detail::get_socket_pending_error(get_native_fd()));
+    get_poll_info().clear_flags(PollFlags::Error());
+    return Status::OK();
+  }
+  Status receive_message(UdpSocketFd::InboundMessage &message, bool &is_received) {
+    is_received = false;
+    int flags = 0;
+    if (get_poll_info().get_flags().has_pending_error()) {
+#ifdef MSG_ERRQUEUE
+      flags = MSG_ERRQUEUE;
+#else
+      return get_pending_error();
+#endif
+    }
+
+    struct msghdr message_header;
+    detail::UdpSocketReceiveHelper helper;
+    helper.to_native(message, message_header);
+
+    auto native_fd = get_native_fd().socket();
+    auto recvmsg_res = detail::skip_eintr([&] { return recvmsg(native_fd, &message_header, flags); });
+    auto recvmsg_errno = errno;
+    if (recvmsg_res >= 0) {
+      helper.from_native(message_header, recvmsg_res, message);
+      is_received = true;
+      return Status::OK();
+    }
+    return process_recvmsg_error(recvmsg_errno, is_received);
+  }
+
+  Status process_recvmsg_error(int recvmsg_errno, bool &is_received) {
+    is_received = false;
+    if (recvmsg_errno == EAGAIN
+#if EAGAIN != EWOULDBLOCK
+        || recvmsg_errno == EWOULDBLOCK
+#endif
+    ) {
+      if (get_poll_info().get_flags_local().has_pending_error()) {
+        get_poll_info().clear_flags(PollFlags::Error());
+      } else {
+        get_poll_info().clear_flags(PollFlags::Read());
+      }
+      return Status::OK();
+    }
+
+    auto error = Status::PosixError(recvmsg_errno, PSLICE() << "Receive from " << get_native_fd() << " has failed");
+    switch (recvmsg_errno) {
+      case EBADF:
+      case EFAULT:
+      case EINVAL:
+      case ENOTCONN:
+      case ECONNRESET:
+      case ETIMEDOUT:
+        LOG(FATAL) << error;
+        UNREACHABLE();
+      default:
+        LOG(WARNING) << "Unknown error: " << error;
+      // fallthrough
+      case ENOBUFS:
+      case ENOMEM:
+#ifdef MSG_ERRQUEUE
+        get_poll_info().add_flags(PollFlags::Error());
+#endif
+        return error;
+    }
+  }
+
+  Status send_message(const UdpSocketFd::OutboundMessage &message, bool &is_sent) {
+    is_sent = false;
+    struct msghdr message_header;
+    detail::UdpSocketSendHelper helper;
+    helper.to_native(message, message_header);
+
+    auto native_fd = get_native_fd().socket();
+    auto sendmsg_res = detail::skip_eintr([&] { return sendmsg(native_fd, &message_header, 0); });
+    auto sendmsg_errno = errno;
+    if (sendmsg_res >= 0) {
+      is_sent = true;
+      return Status::OK();
+    }
+    return process_sendmsg_error(sendmsg_errno, is_sent);
+  }
+  Status process_sendmsg_error(int sendmsg_errno, bool &is_sent) {
+    if (sendmsg_errno == EAGAIN
+#if EAGAIN != EWOULDBLOCK
+        || sendmsg_errno == EWOULDBLOCK
+#endif
+    ) {
+      get_poll_info().clear_flags(PollFlags::Write());
+      return Status::OK();
+    }
+
+    auto error = Status::PosixError(sendmsg_errno, PSLICE() << "Send from " << get_native_fd() << " has failed");
+    switch (sendmsg_errno) {
+      // Still may send some other packets, but there is no point to resend this particular message
+      case EACCES:
+      case EMSGSIZE:
+      case EPERM:
+        LOG(WARNING) << "Silently drop packet :( " << error;
+        //TODO: get errors from MSG_ERRQUEUE is possible
+        is_sent = true;
+        return error;
+
+      // Some general problems, which may be fixed in future
+      case ENOMEM:
+      case EDQUOT:
+      case EFBIG:
+      case ENETDOWN:
+      case ENETUNREACH:
+      case ENOSPC:
+      case EHOSTUNREACH:
+      case ENOBUFS:
+      default:
+#ifdef MSG_ERRQUEUE
+        get_poll_info().add_flags(PollFlags::Error());
+#endif
+        return error;
+
+      case EBADF:         // impossible
+      case ENOTSOCK:      // impossible
+      case EPIPE:         // impossible for udp
+      case ECONNRESET:    // impossible for udp
+      case EDESTADDRREQ:  // we checked that address is valid
+      case ENOTCONN:      // we checked that address is valid
+      case EINTR:         // we already skipped all EINTR
+      case EISCONN:       // impossible for udp socket
+      case EOPNOTSUPP:
+      case ENOTDIR:
+      case EFAULT:
+      case EINVAL:
+      case EAFNOSUPPORT:
+        LOG(FATAL) << error;
+        UNREACHABLE();
+        return error;
+    }
+  }
+
+  Status send_messages(Span<UdpSocketFd::OutboundMessage> messages, size_t &cnt) {
+#if TD_HAS_MMSG
+    return send_messages_fast(messages, cnt);
+#else
+    return send_messages_slow(messages, cnt);
+#endif
+  }
+
+  Status receive_messages(MutableSpan<UdpSocketFd::InboundMessage> messages, size_t &cnt) {
+#if TD_HAS_MMSG
+    return receive_messages_fast(messages, cnt);
+#else
+    return receive_messages_slow(messages, cnt);
+#endif
+  }
+
+ private:
+  PollableFdInfo info_;
+
+  Status send_messages_slow(Span<UdpSocketFd::OutboundMessage> messages, size_t &cnt) {
+    cnt = 0;
+    for (auto &message : messages) {
+      CHECK(!message.data.empty());
+      bool is_sent;
+      auto error = send_message(message, is_sent);
+      cnt += is_sent;
+      TRY_STATUS(std::move(error));
+    }
+    return Status::OK();
+  }
+
+#if TD_HAS_MMSG
+  Status send_messages_fast(Span<UdpSocketFd::OutboundMessage> messages, size_t &cnt) {
+    //struct mmsghdr {
+    //  struct msghdr msg_hdr; [> Message header <]
+    //  unsigned int msg_len;  [> Number of bytes transmitted <]
+    //};
+    struct std::array<detail::UdpSocketSendHelper, 16> helpers;
+    struct std::array<struct mmsghdr, 16> headers;
+    size_t to_send = min(messages.size(), headers.size());
+    for (size_t i = 0; i < to_send; i++) {
+      helpers[i].to_native(messages[i], headers[i].msg_hdr);
+      headers[i].msg_len = 0;
+    }
+
+    auto native_fd = get_native_fd().socket();
+    auto sendmmsg_res =
+        detail::skip_eintr([&] { return sendmmsg(native_fd, headers.data(), narrow_cast<unsigned int>(to_send), 0); });
+    auto sendmmsg_errno = errno;
+    if (sendmmsg_res >= 0) {
+      cnt = sendmmsg_res;
+      return Status::OK();
+    }
+
+    bool is_sent = false;
+    auto status = process_sendmsg_error(sendmmsg_errno, is_sent);
+    cnt = is_sent;
+    return status;
+  }
+#endif
+  Status receive_messages_slow(MutableSpan<UdpSocketFd::InboundMessage> messages, size_t &cnt) {
+    cnt = 0;
+    while (cnt < messages.size() && get_poll_info().get_flags().can_read()) {
+      auto &message = messages[cnt];
+      CHECK(!message.data.empty());
+      bool is_received;
+      auto error = receive_message(message, is_received);
+      cnt += is_received;
+      TRY_STATUS(std::move(error));
+    }
+    return Status::OK();
+  }
+
+#if TD_HAS_MMSG
+  Status receive_messages_fast(MutableSpan<UdpSocketFd::InboundMessage> messages, size_t &cnt) {
+    int flags = 0;
+    cnt = 0;
+    if (get_poll_info().get_flags().has_pending_error()) {
+#ifdef MSG_ERRQUEUE
+      flags = MSG_ERRQUEUE;
+#else
+      return get_pending_error();
+#endif
+    }
+    //struct mmsghdr {
+    //  struct msghdr msg_hdr; [> Message header <]
+    //  unsigned int msg_len;  [> Number of bytes transmitted <]
+    //};
+    struct std::array<detail::UdpSocketReceiveHelper, 16> helpers;
+    struct std::array<struct mmsghdr, 16> headers;
+    size_t to_receive = min(messages.size(), headers.size());
+    for (size_t i = 0; i < to_receive; i++) {
+      helpers[i].to_native(messages[i], headers[i].msg_hdr);
+      headers[i].msg_len = 0;
+    }
+
+    auto native_fd = get_native_fd().socket();
+    auto recvmmsg_res = detail::skip_eintr(
+        [&] { return recvmmsg(native_fd, headers.data(), narrow_cast<unsigned int>(to_receive), flags, nullptr); });
+    auto recvmmsg_errno = errno;
+    if (recvmmsg_res >= 0) {
+      cnt = narrow_cast<size_t>(recvmmsg_res);
+      for (size_t i = 0; i < cnt; i++) {
+        helpers[i].from_native(headers[i].msg_hdr, headers[i].msg_len, messages[i]);
+      }
+      return Status::OK();
+    }
+
+    bool is_received;
+    auto status = process_recvmsg_error(recvmmsg_errno, is_received);
+    cnt = is_received;
+    return status;
+  }
+#endif
+};
+void UdpSocketFdImplDeleter::operator()(UdpSocketFdImpl *impl) {
+  delete impl;
+}
+#endif
+}  // namespace detail
+
+UdpSocketFd::UdpSocketFd() = default;
+UdpSocketFd::UdpSocketFd(UdpSocketFd &&) = default;
+UdpSocketFd &UdpSocketFd::operator=(UdpSocketFd &&) = default;
+UdpSocketFd::~UdpSocketFd() = default;
+PollableFdInfo &UdpSocketFd::get_poll_info() {
+  return impl_->get_poll_info();
+}
+const PollableFdInfo &UdpSocketFd::get_poll_info() const {
+  return impl_->get_poll_info();
+}
+
+Result<UdpSocketFd> UdpSocketFd::open(const IPAddress &address) {
+  NativeFd native_fd{socket(address.get_address_family(), SOCK_DGRAM, IPPROTO_UDP)};
+  if (!native_fd) {
+    return OS_SOCKET_ERROR("Failed to create a socket");
+  }
+  TRY_STATUS(native_fd.set_is_blocking_unsafe(false));
+
+  auto sock = native_fd.socket();
+#if TD_PORT_POSIX
+  int flags = 1;
+#elif TD_PORT_WINDOWS
+  BOOL flags = TRUE;
+#endif
+  setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, reinterpret_cast<const char *>(&flags), sizeof(flags));
+  // TODO: SO_REUSEADDR, SO_KEEPALIVE, TCP_NODELAY, SO_SNDBUF, SO_RCVBUF, TCP_QUICKACK, SO_LINGER
+
+  auto bind_addr = address.get_any_addr();
+  bind_addr.set_port(address.get_port());
+  auto e_bind = bind(sock, bind_addr.get_sockaddr(), narrow_cast<int>(bind_addr.get_sockaddr_len()));
+  if (e_bind != 0) {
+    return OS_SOCKET_ERROR("Failed to bind a socket");
+  }
+  return UdpSocketFd(make_unique<detail::UdpSocketFdImpl>(std::move(native_fd)));
+}
+
+UdpSocketFd::UdpSocketFd(unique_ptr<detail::UdpSocketFdImpl> impl) : impl_(impl.release()) {
+}
+
+void UdpSocketFd::close() {
+  impl_.reset();
+}
+
+bool UdpSocketFd::empty() const {
+  return !impl_;
+}
+
+const NativeFd &UdpSocketFd::get_native_fd() const {
+  return get_poll_info().native_fd();
+}
+
+#if TD_PORT_POSIX
+static Result<uint32> maximize_buffer(int socket_fd, int optname, uint32 max) {
+  /* Start with the default size. */
+  uint32 old_size;
+  socklen_t intsize = sizeof(old_size);
+  if (getsockopt(socket_fd, SOL_SOCKET, optname, &old_size, &intsize)) {
+    return OS_ERROR("getsockopt() failed");
+  }
+
+  /* Binary-search for the real maximum. */
+  uint32 last_good = old_size;
+  uint32 min = old_size;
+  while (min <= max) {
+    uint32 avg = min + (max - min) / 2;
+    if (setsockopt(socket_fd, SOL_SOCKET, optname, &avg, intsize) == 0) {
+      last_good = avg;
+      min = avg + 1;
+    } else {
+      max = avg - 1;
+    }
+  }
+  return last_good;
+}
+
+Result<uint32> UdpSocketFd::maximize_snd_buffer(uint32 max) {
+  return maximize_buffer(get_native_fd().fd(), SO_SNDBUF, max == 0 ? default_udp_max_snd_buffer_size : max);
+}
+
+Result<uint32> UdpSocketFd::maximize_rcv_buffer(uint32 max) {
+  return maximize_buffer(get_native_fd().fd(), SO_RCVBUF, max == 0 ? default_udp_max_rcv_buffer_size : max);
+}
+#else
+Result<uint32> UdpSocketFd::maximize_snd_buffer(uint32 max) {
+  return 0;
+}
+Result<uint32> UdpSocketFd::maximize_rcv_buffer(uint32 max) {
+  return 0;
+}
+#endif
+
+#if TD_PORT_POSIX
+Status UdpSocketFd::send_message(const OutboundMessage &message, bool &is_sent) {
+  return impl_->send_message(message, is_sent);
+}
+Status UdpSocketFd::receive_message(InboundMessage &message, bool &is_received) {
+  return impl_->receive_message(message, is_received);
+}
+
+Status UdpSocketFd::send_messages(Span<OutboundMessage> messages, size_t &count) {
+  return impl_->send_messages(messages, count);
+}
+Status UdpSocketFd::receive_messages(MutableSpan<InboundMessage> messages, size_t &count) {
+  return impl_->receive_messages(messages, count);
+}
+#endif
+#if TD_PORT_WINDOWS
+Result<optional<UdpMessage>> UdpSocketFd::receive() {
+  return impl_->receive();
+}
+
+void UdpSocketFd::send(UdpMessage message) {
+  return impl_->send(std::move(message));
+}
+
+Status UdpSocketFd::flush_send() {
+  return impl_->flush_send();
+}
+#endif
+
+bool UdpSocketFd::is_critical_read_error(const Status &status) {
+  return status.code() == ENOMEM || status.code() == ENOBUFS;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/UdpSocketFd.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/UdpSocketFd.h
new file mode 100644
index 0000000000..7f50c2ff00
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/UdpSocketFd.h
@@ -0,0 +1,105 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#include "td/utils/buffer.h"
+#include "td/utils/optional.h"
+#include "td/utils/port/detail/NativeFd.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/IPAddress.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Span.h"
+#include "td/utils/Status.h"
+
+#include <memory>
+
+namespace td {
+// Udp and errors
+namespace detail {
+class UdpSocketFdImpl;
+class UdpSocketFdImplDeleter {
+ public:
+  void operator()(UdpSocketFdImpl *impl);
+};
+}  // namespace detail
+
+struct UdpMessage {
+  IPAddress address;
+  BufferSlice data;
+  Status error;
+};
+
+class UdpSocketFd {
+ public:
+  UdpSocketFd();
+  UdpSocketFd(UdpSocketFd &&);
+  UdpSocketFd &operator=(UdpSocketFd &&);
+  ~UdpSocketFd();
+
+  UdpSocketFd(const UdpSocketFd &) = delete;
+  UdpSocketFd &operator=(const UdpSocketFd &) = delete;
+
+  Result<uint32> maximize_snd_buffer(uint32 max_buffer_size = 0);
+  Result<uint32> maximize_rcv_buffer(uint32 max_buffer_size = 0);
+
+  static Result<UdpSocketFd> open(const IPAddress &address) TD_WARN_UNUSED_RESULT;
+
+  PollableFdInfo &get_poll_info();
+  const PollableFdInfo &get_poll_info() const;
+  const NativeFd &get_native_fd() const;
+
+  void close();
+  bool empty() const;
+
+  static bool is_critical_read_error(const Status &status);
+
+#if TD_PORT_POSIX
+  struct OutboundMessage {
+    const IPAddress *to;
+    Slice data;
+  };
+  struct InboundMessage {
+    IPAddress *from;
+    MutableSlice data;
+    Status *error;
+  };
+
+  Status send_message(const OutboundMessage &message, bool &is_sent) TD_WARN_UNUSED_RESULT;
+  Status receive_message(InboundMessage &message, bool &is_received) TD_WARN_UNUSED_RESULT;
+
+  Status send_messages(Span<OutboundMessage> messages, size_t &count) TD_WARN_UNUSED_RESULT;
+  Status receive_messages(MutableSpan<InboundMessage> messages, size_t &count) TD_WARN_UNUSED_RESULT;
+#elif TD_PORT_WINDOWS
+  Result<optional<UdpMessage> > receive();
+
+  void send(UdpMessage message);
+
+  Status flush_send();
+#endif
+
+ private:
+  static constexpr uint32 default_udp_max_snd_buffer_size = (1 << 24);
+  static constexpr uint32 default_udp_max_rcv_buffer_size = (1 << 24);
+  std::unique_ptr<detail::UdpSocketFdImpl, detail::UdpSocketFdImplDeleter> impl_;
+  explicit UdpSocketFd(unique_ptr<detail::UdpSocketFdImpl> impl);
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/config.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/config.h
new file mode 100644
index 0000000000..cdc7c6d548
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/config.h
@@ -0,0 +1,65 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/platform.h"
+
+// clang-format off
+
+#if TD_WINDOWS
+  #define TD_PORT_WINDOWS 1
+#else
+  #define TD_PORT_POSIX 1
+#endif
+
+#if TD_LINUX || TD_ANDROID || TD_TIZEN
+  #define TD_POLL_EPOLL 1
+  #define TD_EVENTFD_LINUX 1
+#elif TD_FREEBSD || TD_OPENBSD || TD_NETBSD
+  #define TD_POLL_KQUEUE 1
+  #define TD_EVENTFD_BSD 1
+#elif TD_CYGWIN
+  #define TD_POLL_SELECT 1
+  #define TD_EVENTFD_BSD 1
+#elif TD_EMSCRIPTEN
+  #define TD_POLL_POLL 1
+  #define TD_EVENTFD_UNSUPPORTED 1
+#elif TD_DARWIN
+  #define TD_POLL_KQUEUE 1
+  #define TD_EVENTFD_BSD 1
+#elif TD_WINDOWS
+  #define TD_POLL_WINEVENT 1
+  #define TD_EVENTFD_WINDOWS 1
+#else
+  #error "Poll's implementation is not defined"
+#endif
+
+#if TD_EMSCRIPTEN
+  #define TD_THREAD_UNSUPPORTED 1
+#elif TD_TIZEN || TD_LINUX || TD_DARWIN
+  #define TD_THREAD_PTHREAD 1
+#else
+  #define TD_THREAD_STL 1
+#endif
+
+#if TD_LINUX
+  #define TD_HAS_MMSG 1
+#endif
+
+// clang-format on
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Epoll.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Epoll.cpp
new file mode 100644
index 0000000000..e72b39143d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Epoll.cpp
@@ -0,0 +1,136 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/detail/Epoll.h"
+
+char disable_linker_warning_about_empty_file_epoll_cpp TD_UNUSED;
+
+#ifdef TD_POLL_EPOLL
+
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/Status.h"
+
+#include <unistd.h>
+
+namespace td {
+namespace detail {
+void Epoll::init() {
+  CHECK(!epoll_fd_);
+  epoll_fd_ = NativeFd(epoll_create(1));
+  auto epoll_create_errno = errno;
+  LOG_IF(FATAL, !epoll_fd_) << Status::PosixError(epoll_create_errno, "epoll_create failed");
+
+  events_.resize(1000);
+}
+
+void Epoll::clear() {
+  if (!epoll_fd_) {
+    return;
+  }
+  events_.clear();
+
+  epoll_fd_.close();
+
+  for (auto *list_node = list_root_.next; list_node != &list_root_;) {
+    auto pollable_fd = PollableFd::from_list_node(list_node);
+    list_node = list_node->next;
+  }
+}
+
+void Epoll::subscribe(PollableFd fd, PollFlags flags) {
+  epoll_event event;
+  event.events = EPOLLHUP | EPOLLERR | EPOLLET;
+#ifdef EPOLLRDHUP
+  event.events |= EPOLLRDHUP;
+#endif
+  if (flags.can_read()) {
+    event.events |= EPOLLIN;
+  }
+  if (flags.can_write()) {
+    event.events |= EPOLLOUT;
+  }
+  auto native_fd = fd.native_fd().fd();
+  auto *list_node = fd.release_as_list_node();
+  list_root_.put(list_node);
+  event.data.ptr = list_node;
+
+  int err = epoll_ctl(epoll_fd_.fd(), EPOLL_CTL_ADD, native_fd, &event);
+  auto epoll_ctl_errno = errno;
+  LOG_IF(FATAL, err == -1) << Status::PosixError(epoll_ctl_errno, "epoll_ctl ADD failed")
+                           << ", epoll_fd = " << epoll_fd_.fd() << ", fd = " << native_fd;
+}
+
+void Epoll::unsubscribe(PollableFdRef fd_ref) {
+  auto fd = fd_ref.lock();
+  auto native_fd = fd.native_fd().fd();
+  int err = epoll_ctl(epoll_fd_.fd(), EPOLL_CTL_DEL, native_fd, nullptr);
+  auto epoll_ctl_errno = errno;
+  LOG_IF(FATAL, err == -1) << Status::PosixError(epoll_ctl_errno, "epoll_ctl DEL failed")
+                           << ", epoll_fd = " << epoll_fd_.fd() << ", fd = " << native_fd << fd.native_fd().validate();
+}
+
+void Epoll::unsubscribe_before_close(PollableFdRef fd) {
+  unsubscribe(fd);
+}
+
+void Epoll::run(int timeout_ms) {
+  int ready_n = epoll_wait(epoll_fd_.fd(), &events_[0], static_cast<int>(events_.size()), timeout_ms);
+  auto epoll_wait_errno = errno;
+  LOG_IF(FATAL, ready_n == -1 && epoll_wait_errno != EINTR)
+      << Status::PosixError(epoll_wait_errno, "epoll_wait failed");
+
+  for (int i = 0; i < ready_n; i++) {
+    PollFlags flags;
+    epoll_event *event = &events_[i];
+    if (event->events & EPOLLIN) {
+      event->events &= ~EPOLLIN;
+      flags = flags | PollFlags::Read();
+    }
+    if (event->events & EPOLLOUT) {
+      event->events &= ~EPOLLOUT;
+      flags = flags | PollFlags::Write();
+    }
+#ifdef EPOLLRDHUP
+    if (event->events & EPOLLRDHUP) {
+      event->events &= ~EPOLLRDHUP;
+      //      flags |= Fd::Close;
+      // TODO
+    }
+#endif
+    if (event->events & EPOLLHUP) {
+      event->events &= ~EPOLLHUP;
+      flags = flags | PollFlags::Close();
+    }
+    if (event->events & EPOLLERR) {
+      event->events &= ~EPOLLERR;
+      flags = flags | PollFlags::Error();
+    }
+    if (event->events) {
+      LOG(FATAL) << "Unsupported epoll events: " << event->events;
+    }
+    //LOG(DEBUG) << "Epoll event " << tag("fd", event->data.fd) << tag("flags", format::as_binary(flags));
+    auto pollable_fd = PollableFd::from_list_node(static_cast<ListNode *>(event->data.ptr));
+    pollable_fd.add_flags(flags);
+    pollable_fd.release_as_list_node();
+  }
+}
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Epoll.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Epoll.h
new file mode 100644
index 0000000000..8a915420d9
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Epoll.h
@@ -0,0 +1,71 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#ifdef TD_POLL_EPOLL
+
+#include "td/utils/common.h"
+#include "td/utils/List.h"
+#include "td/utils/port/detail/NativeFd.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/PollBase.h"
+#include "td/utils/port/PollFlags.h"
+
+#include <sys/epoll.h>
+
+namespace td {
+namespace detail {
+
+class Epoll final : public PollBase {
+ public:
+  Epoll() = default;
+  Epoll(const Epoll &) = delete;
+  Epoll &operator=(const Epoll &) = delete;
+  Epoll(Epoll &&) = delete;
+  Epoll &operator=(Epoll &&) = delete;
+  ~Epoll() override = default;
+
+  void init() override;
+
+  void clear() override;
+
+  void subscribe(PollableFd fd, PollFlags flags) override;
+
+  void unsubscribe(PollableFdRef fd) override;
+
+  void unsubscribe_before_close(PollableFdRef fd) override;
+
+  void run(int timeout_ms) override;
+
+  static bool is_edge_triggered() {
+    return true;
+  }
+
+ private:
+  NativeFd epoll_fd_;
+  vector<struct epoll_event> events_;
+  ListNode list_root_;
+};
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdBsd.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdBsd.cpp
new file mode 100644
index 0000000000..4afa1b8411
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdBsd.cpp
@@ -0,0 +1,114 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/detail/EventFdBsd.h"
+
+char disable_linker_warning_about_empty_file_event_fd_bsd_cpp TD_UNUSED;
+
+#ifdef TD_EVENTFD_BSD
+
+#include "td/utils/logging.h"
+#include "td/utils/port/detail/NativeFd.h"
+#include "td/utils/port/PollFlags.h"
+#include "td/utils/port/SocketFd.h"
+#include "td/utils/Slice.h"
+
+#include <fcntl.h>
+#include <poll.h>
+#include <sys/socket.h>
+#include <sys/types.h>
+
+namespace td {
+namespace detail {
+
+// TODO: it is extremely non optimal on Darwin. kqueue events should be used instead
+void EventFdBsd::init() {
+  int fds[2];
+  int err = socketpair(AF_UNIX, SOCK_STREAM, 0, fds);
+  auto socketpair_errno = errno;
+#if TD_CYGWIN
+  // it looks like CYGWIN bug
+  int max_retries = 1000000;
+  while (err == -1 && socketpair_errno == EADDRINUSE && max_retries-- > 0) {
+    err = socketpair(AF_UNIX, SOCK_STREAM, 0, fds);
+    socketpair_errno = errno;
+  }
+// LOG_IF(ERROR, max_retries < 1000000) << max_retries;
+#endif
+  LOG_IF(FATAL, err == -1) << Status::PosixError(socketpair_errno, "socketpair failed");
+
+  auto fd_a = NativeFd(fds[0]);
+  auto fd_b = NativeFd(fds[1]);
+  fd_a.set_is_blocking_unsafe(false).ensure();
+  fd_b.set_is_blocking_unsafe(false).ensure();
+
+  in_ = SocketFd::from_native_fd(std::move(fd_a)).move_as_ok();
+  out_ = SocketFd::from_native_fd(std::move(fd_b)).move_as_ok();
+}
+
+bool EventFdBsd::empty() {
+  return in_.empty();
+}
+
+void EventFdBsd::close() {
+  in_.close();
+  out_.close();
+}
+
+Status EventFdBsd::get_pending_error() {
+  return Status::OK();
+}
+
+PollableFdInfo &EventFdBsd::get_poll_info() {
+  return out_.get_poll_info();
+}
+
+void EventFdBsd::release() {
+  int value = 1;
+  auto result = in_.write(Slice(reinterpret_cast<const char *>(&value), sizeof(value)));
+  if (result.is_error()) {
+    LOG(FATAL) << "EventFdBsd write failed: " << result.error();
+  }
+  size_t size = result.ok();
+  if (size != sizeof(value)) {
+    LOG(FATAL) << "EventFdBsd write returned " << value << " instead of " << sizeof(value);
+  }
+}
+
+void EventFdBsd::acquire() {
+  out_.get_poll_info().add_flags(PollFlags::Read());
+  while (can_read(out_)) {
+    uint8 value[1024];
+    auto result = out_.read(MutableSlice(value, sizeof(value)));
+    if (result.is_error()) {
+      LOG(FATAL) << "EventFdBsd read failed:" << result.error();
+    }
+  }
+}
+
+void EventFdBsd::wait(int timeout_ms) {
+  pollfd fd;
+  fd.fd = get_poll_info().native_fd().fd();
+  fd.events = POLLIN;
+  poll(&fd, 1, timeout_ms);
+}
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdBsd.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdBsd.h
new file mode 100644
index 0000000000..c7b29700b9
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdBsd.h
@@ -0,0 +1,61 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#ifdef TD_EVENTFD_BSD
+
+#include "td/utils/common.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/EventFdBase.h"
+#include "td/utils/port/SocketFd.h"
+#include "td/utils/Status.h"
+
+namespace td {
+namespace detail {
+
+class EventFdBsd final : public EventFdBase {
+  SocketFd in_;
+  SocketFd out_;
+
+ public:
+  EventFdBsd() = default;
+
+  void init() override;
+
+  bool empty() override;
+
+  void close() override;
+
+  Status get_pending_error() override TD_WARN_UNUSED_RESULT;
+
+  PollableFdInfo &get_poll_info() override;
+
+  void release() override;
+
+  void acquire() override;
+
+  void wait(int timeout_ms) override;
+};
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdLinux.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdLinux.cpp
new file mode 100644
index 0000000000..8b4384a1b0
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdLinux.cpp
@@ -0,0 +1,138 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/detail/EventFdLinux.h"
+
+char disable_linker_warning_about_empty_file_event_fd_linux_cpp TD_UNUSED;
+
+#ifdef TD_EVENTFD_LINUX
+
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/detail/NativeFd.h"
+#include "td/utils/port/PollFlags.h"
+#include "td/utils/ScopeGuard.h"
+#include "td/utils/Slice.h"
+
+#include <poll.h>
+#include <sys/eventfd.h>
+#include <unistd.h>
+
+namespace td {
+namespace detail {
+class EventFdLinuxImpl {
+ public:
+  PollableFdInfo info;
+};
+
+EventFdLinux::EventFdLinux() = default;
+EventFdLinux::EventFdLinux(EventFdLinux &&) = default;
+EventFdLinux &EventFdLinux::operator=(EventFdLinux &&) = default;
+EventFdLinux::~EventFdLinux() = default;
+
+void EventFdLinux::init() {
+  auto fd = NativeFd(eventfd(0, EFD_NONBLOCK | EFD_CLOEXEC));
+  auto eventfd_errno = errno;
+  LOG_IF(FATAL, !fd) << Status::PosixError(eventfd_errno, "eventfd call failed");
+  impl_ = make_unique<EventFdLinuxImpl>();
+  impl_->info.set_native_fd(std::move(fd));
+}
+
+bool EventFdLinux::empty() {
+  return !impl_;
+}
+
+void EventFdLinux::close() {
+  impl_.reset();
+}
+
+Status EventFdLinux::get_pending_error() {
+  return Status::OK();
+}
+
+PollableFdInfo &EventFdLinux::get_poll_info() {
+  return impl_->info;
+}
+
+// NB: will be called from multiple threads
+void EventFdLinux::release() {
+  const uint64 value = 1;
+  auto slice = Slice(reinterpret_cast<const char *>(&value), sizeof(value));
+  auto native_fd = impl_->info.native_fd().fd();
+
+  auto result = [&]() -> Result<size_t> {
+    auto write_res = detail::skip_eintr([&] { return ::write(native_fd, slice.begin(), slice.size()); });
+    auto write_errno = errno;
+    if (write_res >= 0) {
+      return narrow_cast<size_t>(write_res);
+    }
+    return Status::PosixError(write_errno, PSLICE() << "Write to fd " << native_fd << " has failed");
+  }();
+
+  if (result.is_error()) {
+    LOG(FATAL) << "EventFdLinux write failed: " << result.error();
+  }
+  size_t size = result.ok();
+  if (size != sizeof(value)) {
+    LOG(FATAL) << "EventFdLinux write returned " << value << " instead of " << sizeof(value);
+  }
+}
+
+void EventFdLinux::acquire() {
+  impl_->info.get_flags();
+  SCOPE_EXIT {
+    // Clear flags without EAGAIN and EWOULDBLOCK
+    // Looks like it is safe thing to do with eventfd
+    get_poll_info().clear_flags(PollFlags::Read());
+  };
+  uint64 res;
+  auto slice = MutableSlice(reinterpret_cast<char *>(&res), sizeof(res));
+  auto native_fd = impl_->info.native_fd().fd();
+  auto result = [&]() -> Result<size_t> {
+    CHECK(slice.size() > 0);
+    auto read_res = detail::skip_eintr([&] { return ::read(native_fd, slice.begin(), slice.size()); });
+    auto read_errno = errno;
+    if (read_res >= 0) {
+      CHECK(read_res != 0);
+      return narrow_cast<size_t>(read_res);
+    }
+    if (read_errno == EAGAIN
+#if EAGAIN != EWOULDBLOCK
+        || read_errno == EWOULDBLOCK
+#endif
+    ) {
+      return 0;
+    }
+    return Status::PosixError(read_errno, PSLICE() << "Read from fd " << native_fd << " has failed");
+  }();
+  if (result.is_error()) {
+    LOG(FATAL) << "EventFdLinux read failed: " << result.error();
+  }
+}
+
+void EventFdLinux::wait(int timeout_ms) {
+  pollfd fd;
+  fd.fd = get_poll_info().native_fd().fd();
+  fd.events = POLLIN;
+  poll(&fd, 1, timeout_ms);
+}
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdLinux.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdLinux.h
new file mode 100644
index 0000000000..56c41baecd
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdLinux.h
@@ -0,0 +1,63 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#ifdef TD_EVENTFD_LINUX
+
+#include "td/utils/common.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/EventFdBase.h"
+#include "td/utils/Status.h"
+
+namespace td {
+namespace detail {
+class EventFdLinuxImpl;
+
+class EventFdLinux final : public EventFdBase {
+  unique_ptr<EventFdLinuxImpl> impl_;
+
+ public:
+  EventFdLinux();
+  EventFdLinux(EventFdLinux &&);
+  EventFdLinux &operator=(EventFdLinux &&);
+  ~EventFdLinux();
+
+  void init() override;
+
+  bool empty() override;
+
+  void close() override;
+
+  Status get_pending_error() override TD_WARN_UNUSED_RESULT;
+
+  PollableFdInfo &get_poll_info() override;
+
+  void release() override;
+
+  void acquire() override;
+
+  void wait(int timeout_ms) override;
+};
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdWindows.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdWindows.cpp
new file mode 100644
index 0000000000..4f675e642b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdWindows.cpp
@@ -0,0 +1,80 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/detail/EventFdWindows.h"
+
+char disable_linker_warning_about_empty_file_event_fd_windows_cpp TD_UNUSED;
+
+#ifdef TD_EVENTFD_WINDOWS
+
+#include "td/utils/logging.h"
+
+namespace td {
+namespace detail {
+
+void EventFdWindows::init() {
+  auto handle = CreateEventW(nullptr, true, false, nullptr);
+  if (handle == nullptr) {
+    auto error = OS_ERROR("CreateEventW failed");
+    LOG(FATAL) << error;
+  }
+  event_ = NativeFd(handle);
+}
+
+bool EventFdWindows::empty() {
+  return !event_;
+}
+
+void EventFdWindows::close() {
+  event_.close();
+}
+
+Status EventFdWindows::get_pending_error() {
+  return Status::OK();
+}
+
+PollableFdInfo &EventFdWindows::get_poll_info() {
+  UNREACHABLE();
+}
+
+void EventFdWindows::release() {
+  if (SetEvent(event_.fd()) == 0) {
+    auto error = OS_ERROR("SetEvent failed");
+    LOG(FATAL) << error;
+  }
+}
+
+void EventFdWindows::acquire() {
+  if (ResetEvent(event_.fd()) == 0) {
+    auto error = OS_ERROR("ResetEvent failed");
+    LOG(FATAL) << error;
+  }
+}
+
+void EventFdWindows::wait(int timeout_ms) {
+  WaitForSingleObject(event_.fd(), timeout_ms);
+  if (ResetEvent(event_.fd()) == 0) {
+    auto error = OS_ERROR("ResetEvent failed");
+    LOG(FATAL) << error;
+  }
+}
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdWindows.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdWindows.h
new file mode 100644
index 0000000000..4f77a6ab48
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/EventFdWindows.h
@@ -0,0 +1,60 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#ifdef TD_EVENTFD_WINDOWS
+
+#include "td/utils/common.h"
+#include "td/utils/port/detail/NativeFd.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/EventFdBase.h"
+#include "td/utils/Status.h"
+
+namespace td {
+namespace detail {
+
+class EventFdWindows final : public EventFdBase {
+  NativeFd event_;
+
+ public:
+  EventFdWindows() = default;
+
+  void init() override;
+
+  bool empty() override;
+
+  void close() override;
+
+  Status get_pending_error() override TD_WARN_UNUSED_RESULT;
+
+  PollableFdInfo &get_poll_info() override;
+
+  void release() override;
+
+  void acquire() override;
+
+  void wait(int timeout_ms) override;
+};
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Iocp.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Iocp.cpp
new file mode 100644
index 0000000000..ef8e4a99ca
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Iocp.cpp
@@ -0,0 +1,122 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/detail/Iocp.h"
+
+char disable_linker_warning_about_empty_file_iocp_cpp TD_UNUSED;
+
+#ifdef TD_PORT_WINDOWS
+
+#include "td/utils/logging.h"
+
+namespace td {
+namespace detail {
+Iocp::~Iocp() {
+  clear();
+}
+
+void Iocp::loop() {
+  Iocp::Guard guard(this);
+  while (true) {
+    DWORD bytes = 0;
+    ULONG_PTR key = 0;
+    WSAOVERLAPPED *overlapped = nullptr;
+    BOOL ok =
+        GetQueuedCompletionStatus(iocp_handle_->fd(), &bytes, &key, reinterpret_cast<OVERLAPPED **>(&overlapped), 1000);
+    if (bytes || key || overlapped) {
+      // LOG(ERROR) << "Got IOCP " << bytes << " " << key << " " << overlapped;
+    }
+    if (ok) {
+      auto callback = reinterpret_cast<Iocp::Callback *>(key);
+      if (callback == nullptr) {
+        // LOG(ERROR) << "Interrupt IOCP loop";
+        return;
+      }
+      callback->on_iocp(bytes, overlapped);
+    } else {
+      if (overlapped != nullptr) {
+        auto error = OS_ERROR("Received from IOCP");
+        auto callback = reinterpret_cast<Iocp::Callback *>(key);
+        CHECK(callback != nullptr);
+        callback->on_iocp(std::move(error), overlapped);
+      }
+    }
+  }
+}
+
+void Iocp::interrupt_loop() {
+  post(0, nullptr, nullptr);
+}
+
+void Iocp::init() {
+  CHECK(!iocp_handle_);
+  auto res = CreateIoCompletionPort(INVALID_HANDLE_VALUE, nullptr, 0, 0);
+  if (res == nullptr) {
+    auto error = OS_ERROR("IOCP creation failed");
+    LOG(FATAL) << error;
+  }
+  iocp_handle_ = std::make_shared<NativeFd>(res);
+}
+
+void Iocp::clear() {
+  iocp_handle_.reset();
+}
+
+void Iocp::subscribe(const NativeFd &native_fd, Callback *callback) {
+  CHECK(iocp_handle_);
+  auto iocp_handle =
+      CreateIoCompletionPort(native_fd.fd(), iocp_handle_->fd(), reinterpret_cast<ULONG_PTR>(callback), 0);
+  if (iocp_handle == nullptr) {
+    auto error = OS_ERROR("CreateIoCompletionPort");
+    LOG(FATAL) << error;
+  }
+  LOG_CHECK(iocp_handle == iocp_handle_->fd()) << iocp_handle << " " << iocp_handle_->fd();
+}
+
+IocpRef Iocp::get_ref() const {
+  return IocpRef(iocp_handle_);
+}
+
+static void iocp_post(NativeFd &iocp_handle, size_t size, Iocp::Callback *callback, WSAOVERLAPPED *overlapped) {
+  if (PostQueuedCompletionStatus(iocp_handle.fd(), DWORD(size), reinterpret_cast<ULONG_PTR>(callback),
+                                 reinterpret_cast<OVERLAPPED *>(overlapped)) == 0) {
+    auto error = OS_ERROR("IOCP post failed");
+    LOG(FATAL) << error;
+  }
+}
+
+void Iocp::post(size_t size, Callback *callback, WSAOVERLAPPED *overlapped) {
+  iocp_post(*iocp_handle_, size, callback, overlapped);
+}
+
+IocpRef::IocpRef(std::weak_ptr<NativeFd> iocp_handle) : iocp_handle_(std::move(iocp_handle)) {
+}
+
+bool IocpRef::post(size_t size, Iocp::Callback *callback, WSAOVERLAPPED *overlapped) {
+  auto iocp_handle = iocp_handle_.lock();
+  if (!iocp_handle) {
+    return false;
+  }
+  iocp_post(*iocp_handle, size, callback, overlapped);
+  return true;
+}
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Iocp.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Iocp.h
new file mode 100644
index 0000000000..c366d99c18
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Iocp.h
@@ -0,0 +1,83 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#ifdef TD_PORT_WINDOWS
+
+#include "td/utils/common.h"
+#include "td/utils/Context.h"
+#include "td/utils/port/detail/NativeFd.h"
+#include "td/utils/Status.h"
+
+#include <memory>
+
+namespace td {
+namespace detail {
+
+class IocpRef;
+class Iocp final : public Context<Iocp> {
+ public:
+  Iocp() = default;
+  Iocp(const Iocp &) = delete;
+  Iocp &operator=(const Iocp &) = delete;
+  Iocp(Iocp &&) = delete;
+  Iocp &operator=(Iocp &&) = delete;
+  ~Iocp();
+
+  class Callback {
+   public:
+    virtual ~Callback() = default;
+    virtual void on_iocp(Result<size_t> r_size, WSAOVERLAPPED *overlapped) = 0;
+  };
+
+  void init();
+  void subscribe(const NativeFd &fd, Callback *callback);
+  void post(size_t size, Callback *callback, WSAOVERLAPPED *overlapped);
+  void loop();
+  void interrupt_loop();
+  void clear();
+
+  IocpRef get_ref() const;
+
+ private:
+  std::shared_ptr<NativeFd> iocp_handle_;
+};
+
+class IocpRef {
+ public:
+  IocpRef() = default;
+  IocpRef(const Iocp &) = delete;
+  IocpRef &operator=(const Iocp &) = delete;
+  IocpRef(IocpRef &&) = default;
+  IocpRef &operator=(IocpRef &&) = default;
+
+  explicit IocpRef(std::weak_ptr<NativeFd> iocp_handle);
+
+  bool post(size_t size, Iocp::Callback *callback, WSAOVERLAPPED *overlapped);
+
+ private:
+  std::weak_ptr<NativeFd> iocp_handle_;
+};
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/KQueue.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/KQueue.cpp
new file mode 100644
index 0000000000..971142066c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/KQueue.cpp
@@ -0,0 +1,192 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/detail/KQueue.h"
+
+char disable_linker_warning_about_empty_file_kqueue_cpp TD_UNUSED;
+
+#ifdef TD_POLL_KQUEUE
+
+#include "td/utils/logging.h"
+#include "td/utils/Status.h"
+
+#include <utility>
+
+#include <sys/time.h>
+#include <unistd.h>
+
+namespace td {
+namespace detail {
+
+KQueue::~KQueue() {
+  clear();
+}
+void KQueue::init() {
+  kq_ = NativeFd(kqueue());
+  auto kqueue_errno = errno;
+  LOG_IF(FATAL, !kq_) << Status::PosixError(kqueue_errno, "kqueue creation failed");
+
+  // TODO: const
+  events_.resize(1000);
+  changes_n_ = 0;
+}
+
+void KQueue::clear() {
+  if (!kq_) {
+    return;
+  }
+  events_.clear();
+  kq_.close();
+  for (auto *list_node = list_root_.next; list_node != &list_root_;) {
+    auto pollable_fd = PollableFd::from_list_node(list_node);
+    list_node = list_node->next;
+  }
+}
+
+int KQueue::update(int nevents, const timespec *timeout, bool may_fail) {
+  int err = kevent(kq_.fd(), &events_[0], changes_n_, &events_[0], nevents, timeout);
+  auto kevent_errno = errno;
+
+  bool is_fatal_error = [&] {
+    if (err != -1) {
+      return false;
+    }
+    if (may_fail) {
+      return kevent_errno != ENOENT;
+    }
+    return kevent_errno != EINTR;
+  }();
+  LOG_IF(FATAL, is_fatal_error) << Status::PosixError(kevent_errno, "kevent failed");
+
+  changes_n_ = 0;
+  if (err < 0) {
+    return 0;
+  }
+  return err;
+}
+
+void KQueue::flush_changes(bool may_fail) {
+  if (!changes_n_) {
+    return;
+  }
+  int n = update(0, nullptr, may_fail);
+  CHECK(n == 0);
+}
+
+void KQueue::add_change(std::uintptr_t ident, int16 filter, uint16 flags, uint32 fflags, std::intptr_t data,
+                        void *udata) {
+  if (changes_n_ == static_cast<int>(events_.size())) {
+    flush_changes();
+  }
+#if TD_NETBSD
+  auto set_udata = reinterpret_cast<std::intptr_t>(udata);
+#else
+  auto set_udata = udata;
+#endif
+  EV_SET(&events_[changes_n_], ident, filter, flags, fflags, data, set_udata);
+  VLOG(fd) << "Subscribe [fd:" << ident << "] [filter:" << filter << "] [udata: " << udata << "]";
+  changes_n_++;
+}
+
+void KQueue::subscribe(PollableFd fd, PollFlags flags) {
+  auto native_fd = fd.native_fd().fd();
+  auto list_node = fd.release_as_list_node();
+  list_root_.put(list_node);
+  if (flags.can_read()) {
+    add_change(native_fd, EVFILT_READ, EV_ADD | EV_CLEAR, 0, 0, list_node);
+  }
+  if (flags.can_write()) {
+    add_change(native_fd, EVFILT_WRITE, EV_ADD | EV_CLEAR, 0, 0, list_node);
+  }
+}
+
+void KQueue::invalidate(int native_fd) {
+  for (int i = 0; i < changes_n_; i++) {
+    if (events_[i].ident == static_cast<std::uintptr_t>(native_fd)) {
+      changes_n_--;
+      std::swap(events_[i], events_[changes_n_]);
+      i--;
+    }
+  }
+}
+
+void KQueue::unsubscribe(PollableFdRef fd_ref) {
+  auto pollable_fd = fd_ref.lock();
+  auto native_fd = pollable_fd.native_fd().fd();
+
+  // invalidate(fd);
+  flush_changes();
+  add_change(native_fd, EVFILT_READ, EV_DELETE, 0, 0, nullptr);
+  flush_changes(true);
+  add_change(native_fd, EVFILT_WRITE, EV_DELETE, 0, 0, nullptr);
+  flush_changes(true);
+}
+
+void KQueue::unsubscribe_before_close(PollableFdRef fd_ref) {
+  auto pollable_fd = fd_ref.lock();
+  invalidate(pollable_fd.native_fd().fd());
+
+  // just to avoid O(changes_n ^ 2)
+  if (changes_n_ != 0) {
+    flush_changes();
+  }
+}
+
+void KQueue::run(int timeout_ms) {
+  timespec timeout_data;
+  timespec *timeout_ptr;
+  if (timeout_ms == -1) {
+    timeout_ptr = nullptr;
+  } else {
+    timeout_data.tv_sec = timeout_ms / 1000;
+    timeout_data.tv_nsec = timeout_ms % 1000 * 1000000;
+    timeout_ptr = &timeout_data;
+  }
+
+  int n = update(static_cast<int>(events_.size()), timeout_ptr);
+  for (int i = 0; i < n; i++) {
+    struct kevent *event = &events_[i];
+    PollFlags flags;
+    if (event->filter == EVFILT_WRITE) {
+      flags.add_flags(PollFlags::Write());
+    }
+    if (event->filter == EVFILT_READ) {
+      flags.add_flags(PollFlags::Read());
+    }
+    if (event->flags & EV_EOF) {
+      flags.add_flags(PollFlags::Close());
+    }
+    if (event->fflags & EV_ERROR) {
+      LOG(FATAL) << "EV_ERROR in kqueue is not supported";
+    }
+#if TD_NETBSD
+    auto udata = reinterpret_cast<void *>(event->udata);
+#else
+    auto udata = event->udata;
+#endif
+    VLOG(fd) << "Event [fd:" << event->ident << "] [filter:" << event->filter << "] [udata: " << udata << "]";
+    // LOG(WARNING) << "Have event->ident = " << event->ident << "event->filter = " << event->filter;
+    auto pollable_fd = PollableFd::from_list_node(static_cast<ListNode *>(udata));
+    pollable_fd.add_flags(flags);
+    pollable_fd.release_as_list_node();
+  }
+}
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/KQueue.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/KQueue.h
new file mode 100644
index 0000000000..80e6572b1b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/KQueue.h
@@ -0,0 +1,84 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#ifdef TD_POLL_KQUEUE
+
+#include "td/utils/common.h"
+#include "td/utils/List.h"
+#include "td/utils/port/detail/NativeFd.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/PollBase.h"
+#include "td/utils/port/PollFlags.h"
+
+#include <cstdint>
+
+#include <sys/types.h>  // must be included before sys/event.h, which depends on sys/types.h on FreeBSD
+
+#include <sys/event.h>
+
+namespace td {
+namespace detail {
+
+class KQueue final : public PollBase {
+ public:
+  KQueue() = default;
+  KQueue(const KQueue &) = delete;
+  KQueue &operator=(const KQueue &) = delete;
+  KQueue(KQueue &&) = delete;
+  KQueue &operator=(KQueue &&) = delete;
+  ~KQueue() override;
+
+  void init() override;
+
+  void clear() override;
+
+  void subscribe(PollableFd fd, PollFlags flags) override;
+
+  void unsubscribe(PollableFdRef fd) override;
+
+  void unsubscribe_before_close(PollableFdRef fd) override;
+
+  void run(int timeout_ms) override;
+
+  static bool is_edge_triggered() {
+    return true;
+  }
+
+ private:
+  vector<struct kevent> events_;
+  int changes_n_;
+  NativeFd kq_;
+  ListNode list_root_;
+
+  int update(int nevents, const timespec *timeout, bool may_fail = false);
+
+  void invalidate(int native_fd);
+
+  void flush_changes(bool may_fail = false);
+
+  void add_change(std::uintptr_t ident, int16 filter, uint16 flags, uint32 fflags, std::intptr_t data, void *udata);
+};
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/NativeFd.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/NativeFd.cpp
new file mode 100644
index 0000000000..3f52159e20
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/NativeFd.cpp
@@ -0,0 +1,259 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/detail/NativeFd.h"
+
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/Status.h"
+
+#if TD_PORT_POSIX
+#include <fcntl.h>
+#include <unistd.h>
+#endif
+
+#if TD_FD_DEBUG
+#include <mutex>
+#include <set>
+#endif
+
+namespace td {
+
+#if TD_FD_DEBUG
+class FdSet {
+ public:
+  void on_create_fd(NativeFd::Fd fd) {
+    CHECK(is_valid(fd));
+    if (is_stdio(fd)) {
+      return;
+    }
+    std::unique_lock<std::mutex> guard(mutex_);
+    if (fds_.count(fd) >= 1) {
+      LOG(FATAL) << "Create duplicated fd: " << fd;
+    }
+    fds_.insert(fd);
+  }
+
+  Status validate(NativeFd::Fd fd) {
+    if (!is_valid(fd)) {
+      return Status::Error(PSLICE() << "Invalid fd: " << fd);
+    }
+    if (is_stdio(fd)) {
+      return Status::OK();
+    }
+    std::unique_lock<std::mutex> guard(mutex_);
+    if (fds_.count(fd) != 1) {
+      return Status::Error(PSLICE() << "Unknown fd: " << fd);
+    }
+    return Status::OK();
+  }
+
+  void on_close_fd(NativeFd::Fd fd) {
+    CHECK(is_valid(fd));
+    if (is_stdio(fd)) {
+      return;
+    }
+    std::unique_lock<std::mutex> guard(mutex_);
+    if (fds_.count(fd) != 1) {
+      LOG(FATAL) << "Close unknown fd: " << fd;
+    }
+    fds_.erase(fd);
+  }
+
+ private:
+  std::mutex mutex_;
+  std::set<NativeFd::Fd> fds_;
+
+  bool is_stdio(NativeFd::Fd fd) const {
+#if TD_PORT_WINDOWS
+#if WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_DESKTOP | WINAPI_PARTITION_SYSTEM)
+    return fd == GetStdHandle(STD_INPUT_HANDLE) || fd == GetStdHandle(STD_OUTPUT_HANDLE) ||
+           fd == GetStdHandle(STD_ERROR_HANDLE);
+#else
+    return false;
+#endif
+#else
+    return fd >= 0 && fd <= 2;
+#endif
+  }
+
+  bool is_valid(NativeFd::Fd fd) const {
+#if TD_PORT_WINDOWS
+    return fd != INVALID_HANDLE_VALUE;
+#else
+    return fd >= 0;
+#endif
+  }
+};
+
+namespace {
+FdSet &get_fd_set() {
+  static FdSet res;
+  return res;
+}
+}  // namespace
+
+#endif
+
+Status NativeFd::validate() const {
+#if TD_FD_DEBUG
+  return get_fd_set().validate(fd_.get());
+#else
+  return Status::OK();
+#endif
+}
+
+NativeFd::NativeFd(Fd fd) : fd_(fd) {
+  VLOG(fd) << *this << " create";
+#if TD_FD_DEBUG
+  get_fd_set().on_create_fd(fd_.get());
+#endif
+}
+
+NativeFd::NativeFd(Fd fd, bool nolog) : fd_(fd) {
+#if TD_FD_DEBUG
+  get_fd_set().on_create_fd(fd_.get());
+#endif
+}
+
+#if TD_PORT_WINDOWS
+NativeFd::NativeFd(Socket socket) : fd_(reinterpret_cast<Fd>(socket)), is_socket_(true) {
+  VLOG(fd) << *this << " create";
+#if TD_FD_DEBUG
+  get_fd_set().on_create_fd(fd_.get());
+#endif
+}
+#endif
+
+NativeFd &NativeFd::operator=(NativeFd &&from) {
+  CHECK(this != &from);
+  close();
+  fd_ = std::move(from.fd_);
+#if TD_PORT_WINDOWS
+  is_socket_ = from.is_socket_;
+#endif
+  return *this;
+}
+
+NativeFd::~NativeFd() {
+  close();
+}
+
+NativeFd::operator bool() const {
+  return fd_.get() != empty_fd();
+}
+
+NativeFd::Fd NativeFd::empty_fd() {
+#if TD_PORT_POSIX
+  return -1;
+#elif TD_PORT_WINDOWS
+  return INVALID_HANDLE_VALUE;
+#endif
+}
+
+NativeFd::Fd NativeFd::fd() const {
+  return fd_.get();
+}
+
+NativeFd::Socket NativeFd::socket() const {
+#if TD_PORT_POSIX
+  return fd();
+#elif TD_PORT_WINDOWS
+  CHECK(is_socket_);
+  return reinterpret_cast<Socket>(fd_.get());
+#endif
+}
+
+Status NativeFd::set_is_blocking(bool is_blocking) const {
+#if TD_PORT_POSIX
+  auto old_flags = fcntl(fd(), F_GETFL);
+  if (old_flags == -1) {
+    return OS_SOCKET_ERROR("Failed to get socket flags");
+  }
+  auto new_flags = is_blocking ? old_flags & ~O_NONBLOCK : old_flags | O_NONBLOCK;
+  if (new_flags != old_flags && fcntl(fd(), F_SETFL, new_flags) == -1) {
+    return OS_SOCKET_ERROR("Failed to set socket flags");
+  }
+
+  return Status::OK();
+#elif TD_PORT_WINDOWS
+  return set_is_blocking_unsafe(is_blocking);
+#endif
+}
+
+Status NativeFd::set_is_blocking_unsafe(bool is_blocking) const {
+#if TD_PORT_POSIX
+  if (fcntl(fd(), F_SETFL, is_blocking ? 0 : O_NONBLOCK) == -1) {
+#elif TD_PORT_WINDOWS
+  u_long mode = is_blocking;
+  if (ioctlsocket(socket(), FIONBIO, &mode) != 0) {
+#endif
+    return OS_SOCKET_ERROR("Failed to change socket flags");
+  }
+  return Status::OK();
+}
+
+Status NativeFd::duplicate(const NativeFd &to) const {
+#if TD_PORT_POSIX
+  CHECK(*this);
+  CHECK(to);
+  if (dup2(fd(), to.fd()) == -1) {
+    return OS_ERROR("Failed to duplicate file descriptor");
+  }
+  return Status::OK();
+#elif TD_PORT_WINDOWS
+  return Status::Error("Not supported");
+#endif
+}
+
+void NativeFd::close() {
+  if (!*this) {
+    return;
+  }
+
+#if TD_FD_DEBUG
+  get_fd_set().on_close_fd(fd());
+#endif
+
+  VLOG(fd) << *this << " close";
+#if TD_PORT_WINDOWS
+  if (is_socket_ ? closesocket(socket()) : !CloseHandle(fd())) {
+#elif TD_PORT_POSIX
+  if (::close(fd()) < 0) {
+#endif
+    auto error = OS_ERROR("Close fd");
+    LOG(ERROR) << error;
+  }
+  fd_ = {};
+}
+
+NativeFd::Fd NativeFd::release() {
+  VLOG(fd) << *this << " release";
+  auto res = fd_.get();
+  fd_ = {};
+#if TD_FD_DEBUG
+  get_fd_set().on_close_fd(res);
+#endif
+  return res;
+}
+
+StringBuilder &operator<<(StringBuilder &sb, const NativeFd &fd) {
+  return sb << tag("fd", fd.fd());
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/NativeFd.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/NativeFd.h
new file mode 100644
index 0000000000..76284e92e9
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/NativeFd.h
@@ -0,0 +1,80 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#include "td/utils/common.h"
+#include "td/utils/MovableValue.h"
+#include "td/utils/Status.h"
+#include "td/utils/StringBuilder.h"
+
+namespace td {
+
+class NativeFd {
+ public:
+#if TD_PORT_POSIX
+  using Fd = int;
+  using Socket = int;
+#elif TD_PORT_WINDOWS
+  using Fd = HANDLE;
+  using Socket = SOCKET;
+#endif
+  NativeFd() = default;
+  NativeFd(NativeFd &&) = default;
+  NativeFd &operator=(NativeFd &&);
+  explicit NativeFd(Fd fd);
+  NativeFd(Fd fd, bool nolog);
+#if TD_PORT_WINDOWS
+  explicit NativeFd(Socket socket);
+#endif
+  NativeFd(const NativeFd &) = delete;
+  NativeFd &operator=(const NativeFd &) = delete;
+  ~NativeFd();
+
+  explicit operator bool() const;
+
+  static Fd empty_fd();
+
+  Fd fd() const;
+  Socket socket() const;
+
+  Status set_is_blocking(bool is_blocking) const;
+
+  Status set_is_blocking_unsafe(bool is_blocking) const;  // may drop other Fd flags on non-Windows
+
+  Status duplicate(const NativeFd &to) const;
+
+  void close();
+  Fd release();
+
+  Status validate() const;
+
+ private:
+#if TD_PORT_POSIX
+  MovableValue<Fd, -1> fd_;
+#elif TD_PORT_WINDOWS
+  MovableValue<Fd, INVALID_HANDLE_VALUE> fd_;
+  bool is_socket_{false};
+#endif
+};
+
+StringBuilder &operator<<(StringBuilder &sb, const NativeFd &fd);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Poll.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Poll.cpp
new file mode 100644
index 0000000000..25f6f4cb2e
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Poll.cpp
@@ -0,0 +1,114 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/detail/Poll.h"
+
+char disable_linker_warning_about_empty_file_poll_cpp TD_UNUSED;
+
+#ifdef TD_POLL_POLL
+
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/ScopeGuard.h"
+#include "td/utils/Status.h"
+
+namespace td {
+namespace detail {
+
+void Poll::init() {
+}
+
+void Poll::clear() {
+  pollfds_.clear();
+}
+
+void Poll::subscribe(PollableFd fd, PollFlags flags) {
+  unsubscribe(fd.ref());
+  struct pollfd pollfd;
+  pollfd.fd = fd.native_fd().fd();
+  pollfd.events = 0;
+  if (flags.can_read()) {
+    pollfd.events |= POLLIN;
+  }
+  if (flags.can_write()) {
+    pollfd.events |= POLLOUT;
+  }
+  pollfd.revents = 0;
+  pollfds_.push_back(pollfd);
+  fds_.push_back(std::move(fd));
+}
+
+void Poll::unsubscribe(PollableFdRef fd_ref) {
+  auto fd = fd_ref.lock();
+  SCOPE_EXIT {
+    fd.release_as_list_node();
+  };
+  for (auto it = pollfds_.begin(); it != pollfds_.end(); ++it) {
+    if (it->fd == fd.native_fd().fd()) {
+      pollfds_.erase(it);
+      fds_.erase(fds_.begin() + (it - pollfds_.begin()));
+      return;
+    }
+  }
+}
+
+void Poll::unsubscribe_before_close(PollableFdRef fd) {
+  unsubscribe(fd);
+}
+
+void Poll::run(int timeout_ms) {
+  int err = poll(pollfds_.data(), narrow_cast<int>(pollfds_.size()), timeout_ms);
+  auto poll_errno = errno;
+  LOG_IF(FATAL, err == -1 && poll_errno != EINTR) << Status::PosixError(poll_errno, "poll failed");
+
+  for (size_t i = 0; i < pollfds_.size(); i++) {
+    auto &pollfd = pollfds_[i];
+    auto &fd = fds_[i];
+
+    PollFlags flags;
+    if (pollfd.revents & POLLIN) {
+      pollfd.revents &= ~POLLIN;
+      flags = flags | PollFlags::Read();
+    }
+    if (pollfd.revents & POLLOUT) {
+      pollfd.revents &= ~POLLOUT;
+      flags = flags | PollFlags::Write();
+    }
+    if (pollfd.revents & POLLHUP) {
+      pollfd.revents &= ~POLLHUP;
+      flags = flags | PollFlags::Close();
+    }
+    if (pollfd.revents & POLLERR) {
+      pollfd.revents &= ~POLLERR;
+      flags = flags | PollFlags::Error();
+    }
+    if (pollfd.revents & POLLNVAL) {
+      LOG(FATAL) << "Unexpected POLLNVAL " << tag("fd", pollfd.fd);
+    }
+    if (pollfd.revents) {
+      LOG(FATAL) << "Unsupported poll events: " << pollfd.revents;
+    }
+    fd.add_flags(flags);
+  }
+}
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Poll.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Poll.h
new file mode 100644
index 0000000000..5ad03123c6
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Poll.h
@@ -0,0 +1,68 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#ifdef TD_POLL_POLL
+
+#include "td/utils/common.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/PollBase.h"
+#include "td/utils/port/PollFlags.h"
+
+#include <poll.h>
+
+namespace td {
+namespace detail {
+
+class Poll final : public PollBase {
+ public:
+  Poll() = default;
+  Poll(const Poll &) = delete;
+  Poll &operator=(const Poll &) = delete;
+  Poll(Poll &&) = delete;
+  Poll &operator=(Poll &&) = delete;
+  ~Poll() override = default;
+
+  void init() override;
+
+  void clear() override;
+
+  void subscribe(PollableFd fd, PollFlags flags) override;
+
+  void unsubscribe(PollableFdRef fd) override;
+
+  void unsubscribe_before_close(PollableFdRef fd) override;
+
+  void run(int timeout_ms) override;
+
+  static bool is_edge_triggered() {
+    return false;
+  }
+
+ private:
+  vector<pollfd> pollfds_;
+  vector<PollableFd> fds_;
+};
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/PollableFd.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/PollableFd.h
new file mode 100644
index 0000000000..4fd517a365
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/PollableFd.h
@@ -0,0 +1,262 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+#include "td/utils/List.h"
+#include "td/utils/logging.h"
+#include "td/utils/Observer.h"
+#include "td/utils/port/detail/NativeFd.h"
+#include "td/utils/port/PollFlags.h"
+#include "td/utils/SpinLock.h"
+
+#include <atomic>
+#include <memory>
+#include <type_traits>
+
+namespace td {
+
+class PollableFdInfo;
+class PollableFdInfoUnlock {
+ public:
+  void operator()(PollableFdInfo *ptr);
+};
+
+class PollableFd;
+class PollableFdRef {
+ public:
+  explicit PollableFdRef(ListNode *list_node) : list_node_(list_node) {
+  }
+  PollableFd lock();
+
+ private:
+  ListNode *list_node_;
+};
+
+class PollableFd {
+ public:
+  // Interface for kqueue, epoll and e.t.c.
+  const NativeFd &native_fd() const;
+
+  ListNode *release_as_list_node();
+  PollableFdRef ref();
+  static PollableFd from_list_node(ListNode *node);
+  void add_flags(PollFlags flags);
+  PollFlags get_flags_unsafe() const;
+
+ private:
+  std::unique_ptr<PollableFdInfo, PollableFdInfoUnlock> fd_info_;
+  friend class PollableFdInfo;
+
+  explicit PollableFd(std::unique_ptr<PollableFdInfo, PollableFdInfoUnlock> fd_info) : fd_info_(std::move(fd_info)) {
+  }
+};
+
+inline PollableFd PollableFdRef::lock() {
+  return PollableFd::from_list_node(list_node_);
+}
+
+class PollableFdInfo : private ListNode {
+ public:
+  PollableFdInfo() = default;
+  PollableFdInfo(const PollableFdInfo &) = delete;
+  PollableFdInfo &operator=(const PollableFdInfo &) = delete;
+  PollableFdInfo(PollableFdInfo &&) = delete;
+  PollableFdInfo &operator=(PollableFdInfo &&) = delete;
+
+  PollableFd extract_pollable_fd(ObserverBase *observer) {
+    VLOG(fd) << native_fd() << " extract pollable fd " << tag("observer", observer);
+    CHECK(!empty());
+    bool was_locked = lock_.test_and_set(std::memory_order_acquire);
+    CHECK(!was_locked);
+    set_observer(observer);
+    return PollableFd{std::unique_ptr<PollableFdInfo, PollableFdInfoUnlock>{this}};
+  }
+  PollableFdRef get_pollable_fd_ref() {
+    CHECK(!empty());
+    bool was_locked = lock_.test_and_set(std::memory_order_acquire);
+    CHECK(was_locked);
+    return PollableFdRef{as_list_node()};
+  }
+
+  void add_flags(PollFlags flags) {
+    flags_.write_flags_local(flags);
+  }
+
+  void clear_flags(PollFlags flags) {
+    flags_.clear_flags(flags);
+  }
+  PollFlags get_flags() const {
+    return flags_.read_flags();
+  }
+  PollFlags get_flags_local() const {
+    return flags_.read_flags_local();
+  }
+
+  bool empty() const {
+    return !fd_;
+  }
+
+  void set_native_fd(NativeFd new_native_fd) {
+    if (fd_) {
+      CHECK(!new_native_fd);
+      bool was_locked = lock_.test_and_set(std::memory_order_acquire);
+      CHECK(!was_locked);
+      lock_.clear(std::memory_order_release);
+    }
+
+    fd_ = std::move(new_native_fd);
+  }
+  explicit PollableFdInfo(NativeFd native_fd) {
+    set_native_fd(std::move(native_fd));
+  }
+  const NativeFd &native_fd() const {
+    //CHECK(!empty());
+    return fd_;
+  }
+  NativeFd move_as_native_fd() {
+    return std::move(fd_);
+  }
+
+  ~PollableFdInfo() {
+    VLOG(fd) << native_fd() << " destroy PollableFdInfo";
+    bool was_locked = lock_.test_and_set(std::memory_order_acquire);
+    CHECK(!was_locked);
+  }
+
+  void add_flags_from_poll(PollFlags flags) {
+    VLOG(fd) << native_fd() << " add flags from poll " << flags;
+    if (flags_.write_flags(flags)) {
+      notify_observer();
+    }
+  }
+
+ private:
+  NativeFd fd_{};
+  std::atomic_flag lock_ = ATOMIC_FLAG_INIT;
+  PollFlagsSet flags_;
+#if TD_PORT_WINDOWS
+  SpinLock observer_lock_;
+#endif
+  ObserverBase *observer_{nullptr};
+
+  friend class PollableFd;
+  friend class PollableFdInfoUnlock;
+
+  void set_observer(ObserverBase *observer) {
+#if TD_PORT_WINDOWS
+    auto lock = observer_lock_.lock();
+#endif
+    CHECK(!observer_);
+    observer_ = observer;
+  }
+  void clear_observer() {
+#if TD_PORT_WINDOWS
+    auto lock = observer_lock_.lock();
+#endif
+    observer_ = nullptr;
+  }
+  void notify_observer() {
+#if TD_PORT_WINDOWS
+    auto lock = observer_lock_.lock();
+#endif
+    VLOG(fd) << native_fd() << " notify " << tag("observer", observer_);
+    if (observer_) {
+      observer_->notify();
+    }
+  }
+
+  void unlock() {
+    clear_observer();
+    lock_.clear(std::memory_order_release);
+    as_list_node()->remove();
+  }
+
+  ListNode *as_list_node() {
+    return static_cast<ListNode *>(this);
+  }
+  static PollableFdInfo *from_list_node(ListNode *list_node) {
+    return static_cast<PollableFdInfo *>(list_node);
+  }
+};
+inline void PollableFdInfoUnlock::operator()(PollableFdInfo *ptr) {
+  ptr->unlock();
+}
+
+inline ListNode *PollableFd::release_as_list_node() {
+  return fd_info_.release()->as_list_node();
+}
+inline PollableFdRef PollableFd::ref() {
+  return PollableFdRef{fd_info_->as_list_node()};
+}
+inline PollableFd PollableFd::from_list_node(ListNode *node) {
+  return PollableFd(std::unique_ptr<PollableFdInfo, PollableFdInfoUnlock>(PollableFdInfo::from_list_node(node)));
+}
+
+inline void PollableFd::add_flags(PollFlags flags) {
+  fd_info_->add_flags_from_poll(flags);
+}
+inline PollFlags PollableFd::get_flags_unsafe() const {
+  return fd_info_->get_flags_local();
+}
+inline const NativeFd &PollableFd::native_fd() const {
+  return fd_info_->native_fd();
+}
+
+#if TD_PORT_POSIX
+namespace detail {
+template <class F>
+auto skip_eintr(F &&f) {
+  decltype(f()) res;
+  static_assert(std::is_integral<decltype(res)>::value, "integral type expected");
+  do {
+    errno = 0;  // just in case
+    res = f();
+  } while (res < 0 && errno == EINTR);
+  return res;
+}
+template <class F>
+auto skip_eintr_cstr(F &&f) {
+  char *res;
+  do {
+    errno = 0;  // just in case
+    res = f();
+  } while (res == nullptr && errno == EINTR);
+  return res;
+}
+}  // namespace detail
+#endif
+
+template <class FdT>
+bool can_read(const FdT &fd) {
+  return fd.get_poll_info().get_flags().can_read() || fd.get_poll_info().get_flags().has_pending_error();
+}
+
+template <class FdT>
+bool can_write(const FdT &fd) {
+  return fd.get_poll_info().get_flags().can_write();
+}
+
+template <class FdT>
+bool can_close(const FdT &fd) {
+  return fd.get_poll_info().get_flags().can_close();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Select.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Select.cpp
new file mode 100644
index 0000000000..1f328f251f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Select.cpp
@@ -0,0 +1,132 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/detail/Select.h"
+
+char disable_linker_warning_about_empty_file_select_cpp TD_UNUSED;
+
+#ifdef TD_POLL_SELECT
+
+#include "td/utils/logging.h"
+
+#include <utility>
+
+namespace td {
+namespace detail {
+
+void Select::init() {
+  FD_ZERO(&all_fd_);
+  FD_ZERO(&read_fd_);
+  FD_ZERO(&write_fd_);
+  FD_ZERO(&except_fd_);
+  max_fd_ = -1;
+}
+
+void Select::clear() {
+  fds_.clear();
+}
+
+void Select::subscribe(PollableFd fd, PollFlags flags) {
+  int native_fd = fd.native_fd().fd();
+  for (auto &it : fds_) {
+    CHECK(it.fd.native_fd().fd() != native_fd);
+  }
+  fds_.push_back(FdInfo{std::move(fd), flags});
+  LOG_CHECK(0 <= native_fd && native_fd < FD_SETSIZE) << native_fd << " " << FD_SETSIZE;
+  FD_SET(native_fd, &all_fd_);
+  if (native_fd > max_fd_) {
+    max_fd_ = native_fd;
+  }
+}
+
+void Select::unsubscribe(PollableFdRef fd) {
+  auto fd_locked = fd.lock();
+  int native_fd = fd_locked.native_fd().fd();
+  fd_locked.release_as_list_node();
+
+  LOG_CHECK(0 <= native_fd && native_fd < FD_SETSIZE) << native_fd << " " << FD_SETSIZE;
+  FD_CLR(native_fd, &all_fd_);
+  FD_CLR(native_fd, &read_fd_);
+  FD_CLR(native_fd, &write_fd_);
+  FD_CLR(native_fd, &except_fd_);
+  while (max_fd_ >= 0 && !FD_ISSET(max_fd_, &all_fd_)) {
+    max_fd_--;
+  }
+  for (auto it = fds_.begin(); it != fds_.end();) {
+    if (it->fd.native_fd().fd() == native_fd) {
+      std::swap(*it, fds_.back());
+      fds_.pop_back();
+      break;
+    } else {
+      ++it;
+    }
+  }
+}
+
+void Select::unsubscribe_before_close(PollableFdRef fd) {
+  unsubscribe(fd);
+}
+
+void Select::run(int timeout_ms) {
+  timeval timeout_data;
+  timeval *timeout_ptr;
+  if (timeout_ms == -1) {
+    timeout_ptr = nullptr;
+  } else {
+    timeout_data.tv_sec = timeout_ms / 1000;
+    timeout_data.tv_usec = timeout_ms % 1000 * 1000;
+    timeout_ptr = &timeout_data;
+  }
+
+  for (auto &it : fds_) {
+    int native_fd = it.fd.native_fd().fd();
+    PollFlags fd_flags = it.fd.get_flags_unsafe();  // concurrent calls are UB
+    if (it.flags.can_write() && !fd_flags.can_write()) {
+      FD_SET(native_fd, &write_fd_);
+    } else {
+      FD_CLR(native_fd, &write_fd_);
+    }
+    if (it.flags.can_read() && !fd_flags.can_read()) {
+      FD_SET(native_fd, &read_fd_);
+    } else {
+      FD_CLR(native_fd, &read_fd_);
+    }
+    FD_SET(native_fd, &except_fd_);
+  }
+
+  select(max_fd_ + 1, &read_fd_, &write_fd_, &except_fd_, timeout_ptr);
+  for (auto &it : fds_) {
+    int native_fd = it.fd.native_fd().fd();
+    PollFlags flags;
+    if (FD_ISSET(native_fd, &read_fd_)) {
+      flags = flags | PollFlags::Read();
+    }
+    if (FD_ISSET(native_fd, &write_fd_)) {
+      flags = flags | PollFlags::Write();
+    }
+    if (FD_ISSET(native_fd, &except_fd_)) {
+      flags = flags | PollFlags::Error();
+    }
+    it.fd.add_flags(flags);
+  }
+}
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Select.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Select.h
new file mode 100644
index 0000000000..a40f7b7f3b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/Select.h
@@ -0,0 +1,76 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#ifdef TD_POLL_SELECT
+
+#include "td/utils/common.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/PollBase.h"
+#include "td/utils/port/PollFlags.h"
+
+#include <sys/select.h>
+
+namespace td {
+namespace detail {
+
+class Select final : public PollBase {
+ public:
+  Select() = default;
+  Select(const Select &) = delete;
+  Select &operator=(const Select &) = delete;
+  Select(Select &&) = delete;
+  Select &operator=(Select &&) = delete;
+  ~Select() override = default;
+
+  void init() override;
+
+  void clear() override;
+
+  void subscribe(PollableFd fd, PollFlags flags) override;
+
+  void unsubscribe(PollableFdRef fd) override;
+
+  void unsubscribe_before_close(PollableFdRef fd) override;
+
+  void run(int timeout_ms) override;
+
+  static bool is_edge_triggered() {
+    return false;
+  }
+
+ private:
+  struct FdInfo {
+    PollableFd fd;
+    PollFlags flags;
+  };
+  vector<FdInfo> fds_;
+  fd_set all_fd_;
+  fd_set read_fd_;
+  fd_set write_fd_;
+  fd_set except_fd_;
+  int max_fd_;
+};
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/ThreadIdGuard.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/ThreadIdGuard.cpp
new file mode 100644
index 0000000000..6ec68a1736
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/ThreadIdGuard.cpp
@@ -0,0 +1,64 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/detail/ThreadIdGuard.h"
+
+#include "td/utils/common.h"
+#include "td/utils/port/thread_local.h"
+
+#include <mutex>
+#include <set>
+
+namespace td {
+namespace detail {
+class ThreadIdManager {
+ public:
+  int32 register_thread() {
+    std::lock_guard<std::mutex> guard(mutex_);
+    if (unused_thread_ids_.empty()) {
+      return ++max_thread_id_;
+    }
+    auto it = unused_thread_ids_.begin();
+    auto result = *it;
+    unused_thread_ids_.erase(it);
+    return result;
+  }
+  void unregister_thread(int32 thread_id) {
+    std::lock_guard<std::mutex> guard(mutex_);
+    CHECK(0 < thread_id && thread_id <= max_thread_id_);
+    bool is_inserted = unused_thread_ids_.insert(thread_id).second;
+    CHECK(is_inserted);
+  }
+
+ private:
+  std::mutex mutex_;
+  std::set<int32> unused_thread_ids_;
+  int32 max_thread_id_ = 0;
+};
+static ThreadIdManager thread_id_manager;
+
+ThreadIdGuard::ThreadIdGuard() {
+  thread_id_ = thread_id_manager.register_thread();
+  set_thread_id(thread_id_);
+}
+ThreadIdGuard::~ThreadIdGuard() {
+  thread_id_manager.unregister_thread(thread_id_);
+  set_thread_id(0);
+}
+}  // namespace detail
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/ThreadIdGuard.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/ThreadIdGuard.h
new file mode 100644
index 0000000000..d74694d181
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/ThreadIdGuard.h
@@ -0,0 +1,38 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+namespace td {
+namespace detail {
+class ThreadIdGuard {
+ public:
+  ThreadIdGuard();
+  ~ThreadIdGuard();
+  ThreadIdGuard(const ThreadIdGuard &) = delete;
+  ThreadIdGuard &operator=(const ThreadIdGuard &) = delete;
+  ThreadIdGuard(ThreadIdGuard &&) = delete;
+  ThreadIdGuard &operator=(ThreadIdGuard &&) = delete;
+
+ private:
+  int32 thread_id_;
+};
+}  // namespace detail
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/ThreadPthread.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/ThreadPthread.h
new file mode 100644
index 0000000000..9dad700b1f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/ThreadPthread.h
@@ -0,0 +1,121 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#ifdef TD_THREAD_PTHREAD
+
+#include "td/utils/common.h"
+#include "td/utils/Destructor.h"
+#include "td/utils/invoke.h"
+#include "td/utils/MovableValue.h"
+#include "td/utils/port/detail/ThreadIdGuard.h"
+#include "td/utils/port/thread_local.h"
+#include "td/utils/Slice.h"
+
+#include <tuple>
+#include <type_traits>
+#include <utility>
+
+#include <pthread.h>
+#include <sched.h>
+
+namespace td {
+namespace detail {
+class ThreadPthread {
+ public:
+  ThreadPthread() = default;
+  ThreadPthread(const ThreadPthread &other) = delete;
+  ThreadPthread &operator=(const ThreadPthread &other) = delete;
+  ThreadPthread(ThreadPthread &&) = default;
+  ThreadPthread &operator=(ThreadPthread &&other) {
+    join();
+    is_inited_ = std::move(other.is_inited_);
+    thread_ = other.thread_;
+    return *this;
+  }
+  template <class Function, class... Args>
+  explicit ThreadPthread(Function &&f, Args &&... args) {
+    auto func = create_destructor([args = std::make_tuple(decay_copy(std::forward<Function>(f)),
+                                                          decay_copy(std::forward<Args>(args))...)]() mutable {
+      invoke_tuple(std::move(args));
+      clear_thread_locals();
+    });
+    pthread_create(&thread_, nullptr, run_thread, func.release());
+    is_inited_ = true;
+  }
+  void set_name(CSlice name) {
+#if defined(_GNU_SOURCE) && defined(__GLIBC_PREREQ)
+#if __GLIBC_PREREQ(2, 12)
+    pthread_setname_np(thread_, name.c_str());
+#endif
+#endif
+  }
+  void join() {
+    if (is_inited_.get()) {
+      is_inited_ = false;
+      pthread_join(thread_, nullptr);
+    }
+  }
+
+  void detach() {
+    if (is_inited_.get()) {
+      is_inited_ = false;
+      pthread_detach(thread_);
+    }
+  }
+  ~ThreadPthread() {
+    join();
+  }
+
+  static unsigned hardware_concurrency() {
+    return 8;
+  }
+
+  using id = pthread_t;
+
+ private:
+  MovableValue<bool> is_inited_;
+  pthread_t thread_;
+
+  template <class T>
+  std::decay_t<T> decay_copy(T &&v) {
+    return std::forward<T>(v);
+  }
+
+  static void *run_thread(void *ptr) {
+    ThreadIdGuard thread_id_guard;
+    auto func = unique_ptr<Destructor>(static_cast<Destructor *>(ptr));
+    return nullptr;
+  }
+};
+
+namespace this_thread_pthread {
+inline void yield() {
+  sched_yield();
+}
+inline ThreadPthread::id get_id() {
+  return pthread_self();
+}
+}  // namespace this_thread_pthread
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/ThreadStl.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/ThreadStl.h
new file mode 100644
index 0000000000..0bd5c21c1b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/ThreadStl.h
@@ -0,0 +1,89 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#ifdef TD_THREAD_STL
+
+#include "td/utils/common.h"
+#include "td/utils/invoke.h"
+#include "td/utils/port/detail/ThreadIdGuard.h"
+#include "td/utils/port/thread_local.h"
+#include "td/utils/Slice.h"
+
+#include <thread>
+#include <tuple>
+#include <type_traits>
+#include <utility>
+
+namespace td {
+namespace detail {
+class ThreadStl {
+ public:
+  ThreadStl() = default;
+  ThreadStl(const ThreadStl &other) = delete;
+  ThreadStl &operator=(const ThreadStl &other) = delete;
+  ThreadStl(ThreadStl &&) = default;
+  ThreadStl &operator=(ThreadStl &&) = default;
+  ~ThreadStl() {
+    join();
+  }
+  template <class Function, class... Args>
+  explicit ThreadStl(Function &&f, Args &&... args) {
+    thread_ = std::thread([args = std::make_tuple(decay_copy(std::forward<Function>(f)),
+                                                  decay_copy(std::forward<Args>(args))...)]() mutable {
+      ThreadIdGuard thread_id_guard;
+      invoke_tuple(std::move(args));
+      clear_thread_locals();
+    });
+  }
+
+  void join() {
+    if (thread_.joinable()) {
+      thread_.join();
+    }
+  }
+  void detach() {
+    if (thread_.joinable()) {
+      thread_.detach();
+    }
+  }
+  void set_name(CSlice name) {
+  }
+
+  static unsigned hardware_concurrency() {
+    return std::thread::hardware_concurrency();
+  }
+
+  using id = std::thread::id;
+
+ private:
+  std::thread thread_;
+
+  template <class T>
+  std::decay_t<T> decay_copy(T &&v) {
+    return std::forward<T>(v);
+  }
+};
+namespace this_thread_stl = std::this_thread;
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/WineventPoll.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/WineventPoll.cpp
new file mode 100644
index 0000000000..ef62fad51d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/WineventPoll.cpp
@@ -0,0 +1,55 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/detail/WineventPoll.h"
+
+char disable_linker_warning_about_empty_file_wineventpoll_cpp TD_UNUSED;
+
+#ifdef TD_POLL_WINEVENT
+
+#include "td/utils/common.h"
+
+namespace td {
+namespace detail {
+
+void WineventPoll::init() {
+}
+
+void WineventPoll::clear() {
+}
+
+void WineventPoll::subscribe(PollableFd fd, PollFlags flags) {
+  fd.release_as_list_node();
+}
+
+void WineventPoll::unsubscribe(PollableFdRef fd) {
+  auto pollable_fd = fd.lock();  // unlocked in destructor
+}
+
+void WineventPoll::unsubscribe_before_close(PollableFdRef fd) {
+  unsubscribe(std::move(fd));
+}
+
+void WineventPoll::run(int timeout_ms) {
+  UNREACHABLE();
+}
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/WineventPoll.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/WineventPoll.h
new file mode 100644
index 0000000000..fc6d04390b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/detail/WineventPoll.h
@@ -0,0 +1,62 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#ifdef TD_POLL_WINEVENT
+
+#include "td/utils/common.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/port/PollBase.h"
+#include "td/utils/port/PollFlags.h"
+
+namespace td {
+namespace detail {
+
+class WineventPoll final : public PollBase {
+ public:
+  WineventPoll() = default;
+  WineventPoll(const WineventPoll &) = delete;
+  WineventPoll &operator=(const WineventPoll &) = delete;
+  WineventPoll(WineventPoll &&) = delete;
+  WineventPoll &operator=(WineventPoll &&) = delete;
+  ~WineventPoll() override = default;
+
+  void init() override;
+
+  void clear() override;
+
+  void subscribe(PollableFd fd, PollFlags flags) override;
+
+  void unsubscribe(PollableFdRef fd) override;
+
+  void unsubscribe_before_close(PollableFdRef fd) override;
+
+  void run(int timeout_ms) override;
+
+  static bool is_edge_triggered() {
+    return true;
+  }
+};
+
+}  // namespace detail
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/path.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/path.cpp
new file mode 100644
index 0000000000..36cb2ed2a1
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/path.cpp
@@ -0,0 +1,635 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/path.h"
+
+#include "td/utils/port/config.h"
+
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/detail/PollableFd.h"
+#include "td/utils/ScopeGuard.h"
+
+#if TD_PORT_WINDOWS
+#include "td/utils/port/wstring_convert.h"
+#include "td/utils/Random.h"
+#endif
+
+#if TD_PORT_POSIX
+
+#include <dirent.h>
+#include <limits.h>
+#include <stdio.h>
+
+// We don't want warnings from system headers
+#if TD_GCC
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wconversion"
+#endif
+#include <sys/stat.h>
+#if TD_GCC
+#pragma GCC diagnostic pop
+#endif
+
+#include <sys/types.h>
+#include <unistd.h>
+
+#endif
+
+#if TD_DARWIN
+#include <sys/syslimits.h>
+#endif
+
+#include <cstdlib>
+#include <string>
+
+namespace td {
+
+static string temporary_dir;
+
+Status set_temporary_dir(CSlice dir) {
+  string input_dir = dir.str();
+  if (!dir.empty() && dir.back() != TD_DIR_SLASH) {
+    input_dir += TD_DIR_SLASH;
+  }
+  TRY_STATUS(mkpath(input_dir, 0750));
+  TRY_RESULT(real_dir, realpath(input_dir));
+  temporary_dir = std::move(real_dir);
+  return Status::OK();
+}
+
+Status mkpath(CSlice path, int32 mode) {
+  Status first_error = Status::OK();
+  Status last_error = Status::OK();
+  for (size_t i = 1; i < path.size(); i++) {
+    if (path[i] == TD_DIR_SLASH) {
+      last_error = mkdir(PSLICE() << path.substr(0, i), mode);
+      if (last_error.is_error() && first_error.is_ok()) {
+        first_error = last_error.clone();
+      }
+    }
+  }
+  if (last_error.is_error()) {
+    return first_error;
+  }
+  return Status::OK();
+}
+
+Status rmrf(CSlice path) {
+  return walk_path(path, [](CSlice path, WalkPath::Type type) {
+    switch (type) {
+      case WalkPath::Type::EnterDir:
+        break;
+      case WalkPath::Type::ExitDir:
+        rmdir(path).ignore();
+        break;
+      case WalkPath::Type::NotDir:
+        unlink(path).ignore();
+        break;
+    }
+  });
+}
+
+#if TD_PORT_POSIX
+
+Status mkdir(CSlice dir, int32 mode) {
+  int mkdir_res = [&] {
+    int res;
+    do {
+      errno = 0;  // just in case
+      res = ::mkdir(dir.c_str(), static_cast<mode_t>(mode));
+    } while (res < 0 && (errno == EINTR || errno == EAGAIN));
+    return res;
+  }();
+  if (mkdir_res == 0) {
+    return Status::OK();
+  }
+  auto mkdir_errno = errno;
+  if (mkdir_errno == EEXIST) {
+    // TODO check that it is a directory
+    return Status::OK();
+  }
+  return Status::PosixError(mkdir_errno, PSLICE() << "Can't create directory \"" << dir << '"');
+}
+
+Status rename(CSlice from, CSlice to) {
+  int rename_res = detail::skip_eintr([&] { return ::rename(from.c_str(), to.c_str()); });
+  if (rename_res < 0) {
+    return OS_ERROR(PSLICE() << "Can't rename \"" << from << "\" to \"" << to << '\"');
+  }
+  return Status::OK();
+}
+
+Result<string> realpath(CSlice slice, bool ignore_access_denied) {
+  char full_path[PATH_MAX + 1];
+  string res;
+  char *err = detail::skip_eintr_cstr([&] { return ::realpath(slice.c_str(), full_path); });
+  if (err != full_path) {
+    if (ignore_access_denied && (errno == EACCES || errno == EPERM)) {
+      res = slice.str();
+    } else {
+      return OS_ERROR(PSLICE() << "Realpath failed for \"" << slice << '"');
+    }
+  } else {
+    res = full_path;
+  }
+  if (res.empty()) {
+    return Status::Error("Empty path");
+  }
+  if (!slice.empty() && slice.end()[-1] == TD_DIR_SLASH) {
+    if (res.back() != TD_DIR_SLASH) {
+      res += TD_DIR_SLASH;
+    }
+  }
+  return res;
+}
+
+Status chdir(CSlice dir) {
+  int chdir_res = detail::skip_eintr([&] { return ::chdir(dir.c_str()); });
+  if (chdir_res) {
+    return OS_ERROR(PSLICE() << "Can't change directory to \"" << dir << '"');
+  }
+  return Status::OK();
+}
+
+Status rmdir(CSlice dir) {
+  int rmdir_res = detail::skip_eintr([&] { return ::rmdir(dir.c_str()); });
+  if (rmdir_res) {
+    return OS_ERROR(PSLICE() << "Can't delete directory \"" << dir << '"');
+  }
+  return Status::OK();
+}
+
+Status unlink(CSlice path) {
+  int unlink_res = detail::skip_eintr([&] { return ::unlink(path.c_str()); });
+  if (unlink_res) {
+    return OS_ERROR(PSLICE() << "Can't unlink \"" << path << '"');
+  }
+  return Status::OK();
+}
+
+CSlice get_temporary_dir() {
+  static bool is_inited = [] {
+    if (temporary_dir.empty()) {
+      const char *s = std::getenv("TMPDIR");
+      if (s != nullptr && s[0] != '\0') {
+        temporary_dir = s;
+      } else if (P_tmpdir != nullptr && P_tmpdir[0] != '\0') {
+        temporary_dir = P_tmpdir;
+      } else {
+        return false;
+      }
+    }
+    if (temporary_dir.size() > 1 && temporary_dir.back() == TD_DIR_SLASH) {
+      temporary_dir.pop_back();
+    }
+    return true;
+  }();
+  LOG_IF(FATAL, !is_inited) << "Can't find temporary directory";
+  return temporary_dir;
+}
+
+Result<std::pair<FileFd, string>> mkstemp(CSlice dir) {
+  if (dir.empty()) {
+    dir = get_temporary_dir();
+    if (dir.empty()) {
+      return Status::Error("Can't find temporary directory");
+    }
+  }
+
+  TRY_RESULT(dir_real, realpath(dir));
+  CHECK(!dir_real.empty());
+
+  string file_pattern;
+  file_pattern.reserve(dir_real.size() + 14);
+  file_pattern = dir_real;
+  if (file_pattern.back() != TD_DIR_SLASH) {
+    file_pattern += TD_DIR_SLASH;
+  }
+  file_pattern += "tmpXXXXXXXXXX";
+
+  int fd = detail::skip_eintr([&] { return ::mkstemp(&file_pattern[0]); });
+  if (fd == -1) {
+    return OS_ERROR(PSLICE() << "Can't create temporary file \"" << file_pattern << '"');
+  }
+  if (close(fd)) {
+    return OS_ERROR(PSLICE() << "Can't close temporary file \"" << file_pattern << '"');
+  }
+  // TODO create file from fd
+  TRY_RESULT(file, FileFd::open(file_pattern, FileFd::Write | FileFd::Truncate | FileFd::Append));
+  return std::make_pair(std::move(file), std::move(file_pattern));
+}
+
+Result<string> mkdtemp(CSlice dir, Slice prefix) {
+  if (dir.empty()) {
+    dir = get_temporary_dir();
+    if (dir.empty()) {
+      return Status::Error("Can't find temporary directory");
+    }
+  }
+
+  TRY_RESULT(dir_real, realpath(dir));
+  CHECK(!dir_real.empty());
+
+  string dir_pattern;
+  dir_pattern.reserve(dir_real.size() + prefix.size() + 7);
+  dir_pattern = dir_real;
+  if (dir_pattern.back() != TD_DIR_SLASH) {
+    dir_pattern += TD_DIR_SLASH;
+  }
+  dir_pattern.append(prefix.begin(), prefix.size());
+  dir_pattern += "XXXXXX";
+
+  char *result = detail::skip_eintr_cstr([&] { return ::mkdtemp(&dir_pattern[0]); });
+  if (result == nullptr) {
+    return OS_ERROR(PSLICE() << "Can't create temporary directory \"" << dir_pattern << '"');
+  }
+  return result;
+}
+
+namespace detail {
+using WalkFunction = std::function<WalkPath::Action(CSlice name, WalkPath::Type type)>;
+Result<bool> walk_path_dir(string &path, FileFd fd, const WalkFunction &func) TD_WARN_UNUSED_RESULT;
+
+Result<bool> walk_path_dir(string &path, const WalkFunction &func) TD_WARN_UNUSED_RESULT;
+
+Result<bool> walk_path_file(string &path, const WalkFunction &func) TD_WARN_UNUSED_RESULT;
+
+Result<bool> walk_path(string &path, const WalkFunction &func) TD_WARN_UNUSED_RESULT;
+
+Result<bool> walk_path_subdir(string &path, DIR *dir, const WalkFunction &func) {
+  while (true) {
+    errno = 0;
+    auto *entry = readdir(dir);
+    auto readdir_errno = errno;
+    if (readdir_errno) {
+      return Status::PosixError(readdir_errno, "readdir");
+    }
+    if (entry == nullptr) {
+      return true;
+    }
+    Slice name = Slice(static_cast<const char *>(entry->d_name));
+    if (name == "." || name == "..") {
+      continue;
+    }
+    auto size = path.size();
+    if (path.back() != TD_DIR_SLASH) {
+      path += TD_DIR_SLASH;
+    }
+    path.append(name.begin(), name.size());
+    SCOPE_EXIT {
+      path.resize(size);
+    };
+    Result<bool> status = true;
+#ifdef DT_DIR
+    if (entry->d_type == DT_UNKNOWN) {
+      status = walk_path(path, func);
+    } else if (entry->d_type == DT_DIR) {
+      status = walk_path_dir(path, func);
+    } else if (entry->d_type == DT_REG) {
+      status = walk_path_file(path, func);
+    }
+#else
+#warning "Slow walk_path"
+    status = walk_path(path, func);
+#endif
+    if (status.is_error() || !status.ok()) {
+      return status;
+    }
+  }
+}
+
+Result<bool> walk_path_dir(string &path, DIR *subdir, const WalkFunction &func) {
+  SCOPE_EXIT {
+    closedir(subdir);
+  };
+  switch (func(path, WalkPath::Type::EnterDir)) {
+    case WalkPath::Action::Abort:
+      return false;
+    case WalkPath::Action::SkipDir:
+      return true;
+    case WalkPath::Action::Continue:
+      break;
+  }
+  auto status = walk_path_subdir(path, subdir, func);
+  if (status.is_error() || !status.ok()) {
+    return status;
+  }
+  switch (func(path, WalkPath::Type::ExitDir)) {
+    case WalkPath::Action::Abort:
+      return false;
+    case WalkPath::Action::SkipDir:
+    case WalkPath::Action::Continue:
+      break;
+  }
+  return true;
+}
+
+Result<bool> walk_path_dir(string &path, FileFd fd, const WalkFunction &func) {
+  auto native_fd = fd.move_as_native_fd();
+  auto *subdir = fdopendir(native_fd.fd());
+  if (subdir == nullptr) {
+    return OS_ERROR("fdopendir");
+  }
+  native_fd.release();
+  return walk_path_dir(path, subdir, func);
+}
+
+Result<bool> walk_path_dir(string &path, const WalkFunction &func) {
+  auto *subdir = opendir(path.c_str());
+  if (subdir == nullptr) {
+    return OS_ERROR(PSLICE() << tag("opendir", path));
+  }
+  return walk_path_dir(path, subdir, func);
+}
+
+Result<bool> walk_path_file(string &path, const WalkFunction &func) {
+  switch (func(path, WalkPath::Type::NotDir)) {
+    case WalkPath::Action::Abort:
+      return false;
+    case WalkPath::Action::SkipDir:
+    case WalkPath::Action::Continue:
+      break;
+  }
+  return true;
+}
+
+Result<bool> walk_path(string &path, const WalkFunction &func) {
+  TRY_RESULT(fd, FileFd::open(path, FileFd::Read));
+  TRY_RESULT(stat, fd.stat());
+
+  bool is_dir = stat.is_dir_;
+  bool is_reg = stat.is_reg_;
+  if (is_dir) {
+    return walk_path_dir(path, std::move(fd), func);
+  }
+
+  fd.close();
+  if (is_reg) {
+    return walk_path_file(path, func);
+  }
+
+  return true;
+}
+}  // namespace detail
+
+Status WalkPath::do_run(CSlice path, const detail::WalkFunction &func) {
+  string curr_path;
+  curr_path.reserve(PATH_MAX + 10);
+  curr_path = path.c_str();
+  TRY_STATUS(detail::walk_path(curr_path, func));
+  return Status::OK();
+}
+
+#endif
+
+#if TD_PORT_WINDOWS
+
+Status mkdir(CSlice dir, int32 mode) {
+  TRY_RESULT(wdir, to_wstring(dir));
+  auto status = CreateDirectoryW(wdir.c_str(), nullptr);
+  if (status == 0 && GetLastError() != ERROR_ALREADY_EXISTS) {
+    return OS_ERROR(PSLICE() << "Can't create directory \"" << dir << '"');
+  }
+  return Status::OK();
+}
+
+Status rename(CSlice from, CSlice to) {
+  TRY_RESULT(wfrom, to_wstring(from));
+  TRY_RESULT(wto, to_wstring(to));
+  auto status = MoveFileExW(wfrom.c_str(), wto.c_str(), MOVEFILE_REPLACE_EXISTING);
+  if (status == 0) {
+    return OS_ERROR(PSLICE() << "Can't rename \"" << from << "\" to \"" << to << '\"');
+  }
+  return Status::OK();
+}
+
+Result<string> realpath(CSlice slice, bool ignore_access_denied) {
+  wchar_t buf[MAX_PATH + 1];
+  TRY_RESULT(wslice, to_wstring(slice));
+  auto status = GetFullPathNameW(wslice.c_str(), MAX_PATH, buf, nullptr);
+  string res;
+  if (status == 0) {
+    if (ignore_access_denied && errno == ERROR_ACCESS_DENIED) {
+      res = slice.str();
+    } else {
+      return OS_ERROR(PSLICE() << "GetFullPathNameW failed for \"" << slice << '"');
+    }
+  } else {
+    TRY_RESULT(t_res, from_wstring(buf));
+    res = std::move(t_res);
+  }
+  if (res.empty()) {
+    return Status::Error("Empty path");
+  }
+  if (!slice.empty() && slice.end()[-1] == TD_DIR_SLASH) {
+    if (res.back() != TD_DIR_SLASH) {
+      res += TD_DIR_SLASH;
+    }
+  }
+  return res;
+}
+
+Status chdir(CSlice dir) {
+  TRY_RESULT(wdir, to_wstring(dir));
+  auto res = SetCurrentDirectoryW(wdir.c_str());
+  if (res == 0) {
+    return OS_ERROR(PSLICE() << "Can't change directory to \"" << dir << '"');
+  }
+  return Status::OK();
+}
+
+Status rmdir(CSlice dir) {
+  TRY_RESULT(wdir, to_wstring(dir));
+  int status = RemoveDirectoryW(wdir.c_str());
+  if (!status) {
+    return OS_ERROR(PSLICE() << "Can't delete directory \"" << dir << '"');
+  }
+  return Status::OK();
+}
+
+Status unlink(CSlice path) {
+  TRY_RESULT(wpath, to_wstring(path));
+  int status = DeleteFileW(wpath.c_str());
+  if (!status) {
+    return OS_ERROR(PSLICE() << "Can't unlink \"" << path << '"');
+  }
+  return Status::OK();
+}
+
+CSlice get_temporary_dir() {
+  static bool is_inited = [] {
+    if (temporary_dir.empty()) {
+      wchar_t buf[MAX_PATH + 1];
+      if (GetTempPathW(MAX_PATH, buf) == 0) {
+        auto error = OS_ERROR("GetTempPathW failed");
+        LOG(FATAL) << error;
+      }
+      auto rs = from_wstring(buf);
+      LOG_IF(FATAL, rs.is_error()) << "GetTempPathW failed: " << rs.error();
+      temporary_dir = rs.ok();
+    }
+    if (temporary_dir.size() > 1 && temporary_dir.back() == TD_DIR_SLASH) {
+      temporary_dir.pop_back();
+    }
+    return true;
+  }();
+  LOG_IF(FATAL, !is_inited) << "Can't find temporary directory";
+  return temporary_dir;
+}
+
+Result<string> mkdtemp(CSlice dir, Slice prefix) {
+  if (dir.empty()) {
+    dir = get_temporary_dir();
+    if (dir.empty()) {
+      return Status::Error("Can't find temporary directory");
+    }
+  }
+
+  TRY_RESULT(dir_real, realpath(dir));
+  CHECK(!dir_real.empty());
+
+  string dir_pattern;
+  dir_pattern.reserve(dir_real.size() + prefix.size() + 7);
+  dir_pattern = dir_real;
+  if (dir_pattern.back() != TD_DIR_SLASH) {
+    dir_pattern += TD_DIR_SLASH;
+  }
+  dir_pattern.append(prefix.begin(), prefix.size());
+
+  for (auto iter = 0; iter < 20; iter++) {
+    auto path = dir_pattern;
+    for (int i = 0; i < 6 + iter / 5; i++) {
+      path += static_cast<char>(Random::fast('a', 'z'));
+    }
+    auto status = mkdir(path);
+    if (status.is_ok()) {
+      return path;
+    }
+  }
+  return Status::Error(PSLICE() << "Can't create temporary directory \"" << dir_pattern << '"');
+}
+
+Result<std::pair<FileFd, string>> mkstemp(CSlice dir) {
+  if (dir.empty()) {
+    dir = get_temporary_dir();
+    if (dir.empty()) {
+      return Status::Error("Can't find temporary directory");
+    }
+  }
+
+  TRY_RESULT(dir_real, realpath(dir));
+  CHECK(!dir_real.empty());
+
+  string file_pattern;
+  file_pattern.reserve(dir_real.size() + 14);
+  file_pattern = dir_real;
+  if (file_pattern.back() != TD_DIR_SLASH) {
+    file_pattern += TD_DIR_SLASH;
+  }
+  file_pattern += "tmp";
+
+  for (auto iter = 0; iter < 20; iter++) {
+    auto path = file_pattern;
+    for (int i = 0; i < 6 + iter / 5; i++) {
+      path += static_cast<char>(Random::fast('a', 'z'));
+    }
+    auto r_file = FileFd::open(path, FileFd::Write | FileFd::Read | FileFd::CreateNew);
+    if (r_file.is_ok()) {
+      return std::make_pair(r_file.move_as_ok(), path);
+    }
+  }
+
+  return Status::Error(PSLICE() << "Can't create temporary file \"" << file_pattern << '"');
+}
+
+static Result<bool> walk_path_dir(const std::wstring &dir_name,
+                                  const std::function<WalkPath::Action(CSlice name, WalkPath::Type type)> &func) {
+  std::wstring name = dir_name + L"\\*";
+  WIN32_FIND_DATA file_data;
+  auto handle = FindFirstFileExW(name.c_str(), FindExInfoStandard, &file_data, FindExSearchNameMatch, nullptr, 0);
+  if (handle == INVALID_HANDLE_VALUE) {
+    return OS_ERROR(PSLICE() << "FindFirstFileEx" << tag("name", from_wstring(name).ok()));
+  }
+
+  SCOPE_EXIT {
+    FindClose(handle);
+  };
+
+  TRY_RESULT(dir_entry_name, from_wstring(dir_name));
+  switch (func(dir_entry_name, WalkPath::Type::EnterDir)) {
+    case WalkPath::Action::Abort:
+      return false;
+    case WalkPath::Action::SkipDir:
+      return true;
+    case WalkPath::Action::Continue:
+      break;
+  }
+
+  while (true) {
+    auto full_name = dir_name + L"\\" + file_data.cFileName;
+    TRY_RESULT(entry_name, from_wstring(full_name));
+    if (file_data.cFileName[0] != '.') {
+      if ((file_data.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) != 0) {
+        TRY_RESULT(is_ok, walk_path_dir(full_name, func));
+        if (!is_ok) {
+          return false;
+        }
+      } else {
+        switch (func(entry_name, WalkPath::Type::NotDir)) {
+          case WalkPath::Action::Abort:
+            return false;
+          case WalkPath::Action::SkipDir:
+          case WalkPath::Action::Continue:
+            break;
+        }
+      }
+    }
+    auto status = FindNextFileW(handle, &file_data);
+    if (status == 0) {
+      auto last_error = GetLastError();
+      if (last_error == ERROR_NO_MORE_FILES) {
+        break;
+      }
+      return OS_ERROR("FindNextFileW");
+    }
+  }
+  switch (func(dir_entry_name, WalkPath::Type::ExitDir)) {
+    case WalkPath::Action::Abort:
+      return false;
+    case WalkPath::Action::SkipDir:
+    case WalkPath::Action::Continue:
+      break;
+  }
+  return true;
+}
+
+Status WalkPath::do_run(CSlice path, const std::function<Action(CSlice name, Type)> &func) {
+  TRY_RESULT(wpath, to_wstring(path));
+  Slice path_slice = path;
+  while (!path_slice.empty() && (path_slice.back() == '/' || path_slice.back() == '\\')) {
+    path_slice.remove_suffix(1);
+    wpath.pop_back();
+  }
+  TRY_STATUS(walk_path_dir(wpath, func));
+  return Status::OK();
+}
+
+#endif
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/path.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/path.h
new file mode 100644
index 0000000000..aa6c2d5df1
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/path.h
@@ -0,0 +1,84 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/port/FileFd.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+#include <functional>
+#include <type_traits>
+#include <utility>
+
+namespace td {
+
+Status mkdir(CSlice dir, int32 mode = 0700) TD_WARN_UNUSED_RESULT;
+
+Status mkpath(CSlice path, int32 mode = 0700) TD_WARN_UNUSED_RESULT;
+
+Status rename(CSlice from, CSlice to) TD_WARN_UNUSED_RESULT;
+
+Result<string> realpath(CSlice slice, bool ignore_access_denied = false) TD_WARN_UNUSED_RESULT;
+
+Status chdir(CSlice dir) TD_WARN_UNUSED_RESULT;
+
+Status rmdir(CSlice dir) TD_WARN_UNUSED_RESULT;
+
+Status unlink(CSlice path) TD_WARN_UNUSED_RESULT;
+
+Status rmrf(CSlice path) TD_WARN_UNUSED_RESULT;
+
+Status set_temporary_dir(CSlice dir) TD_WARN_UNUSED_RESULT;
+
+CSlice get_temporary_dir();
+
+Result<std::pair<FileFd, string>> mkstemp(CSlice dir) TD_WARN_UNUSED_RESULT;
+
+Result<string> mkdtemp(CSlice dir, Slice prefix) TD_WARN_UNUSED_RESULT;
+
+class WalkPath {
+ public:
+  enum class Action { Continue, Abort, SkipDir };
+  enum class Type { EnterDir, ExitDir, NotDir };
+
+  template <class F, class R = decltype(std::declval<F>()("", Type::ExitDir))>
+  static TD_WARN_UNUSED_RESULT std::enable_if_t<std::is_same<R, Action>::value, Status> run(CSlice path, F &&func) {
+    return do_run(path, func);
+  }
+  template <class F, class R = decltype(std::declval<F>()("", Type::ExitDir))>
+  static TD_WARN_UNUSED_RESULT std::enable_if_t<!std::is_same<R, Action>::value, Status> run(CSlice path, F &&func) {
+    return do_run(path, [&](CSlice name, Type type) {
+      func(name, type);
+      return Action::Continue;
+    });
+  }
+
+ private:
+  static TD_WARN_UNUSED_RESULT Status do_run(CSlice path,
+                                             const std::function<WalkPath::Action(CSlice name, Type type)> &func);
+};
+
+// deprecated interface
+template <class F>
+TD_WARN_UNUSED_RESULT Status walk_path(CSlice path, F &&func) {
+  return WalkPath::run(path, func);
+}
+
+}  // namespace td
diff --git a/submodules/MtProtoKit/TON/iOS/include/td/utils/port/platform.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/platform.h
similarity index 100%
rename from submodules/MtProtoKit/TON/iOS/include/td/utils/port/platform.h
rename to submodules/ton/tonlib-src/tdutils/td/utils/port/platform.h
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/signals.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/signals.cpp
new file mode 100644
index 0000000000..ef5b5a1ea2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/signals.cpp
@@ -0,0 +1,342 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/signals.h"
+
+#include "td/utils/port/config.h"
+#include "td/utils/port/stacktrace.h"
+#include "td/utils/port/StdStreams.h"
+
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+
+#if TD_PORT_POSIX
+#include <signal.h>
+#include <sys/mman.h>
+#include <unistd.h>
+#endif
+#if TD_PORT_WINDOWS
+#include <csignal>
+#endif
+
+#include <cerrno>
+#include <cstdint>
+#include <cstdlib>
+#include <cstring>
+#include <ctime>
+#include <limits>
+
+namespace td {
+
+#if TD_PORT_POSIX && !TD_DARWIN_TV_OS && !TD_DARWIN_WATCH_OS
+static Status protect_memory(void *addr, size_t len) {
+  if (mprotect(addr, len, PROT_NONE) != 0) {
+    return OS_ERROR("mprotect failed");
+  }
+  return Status::OK();
+}
+#endif
+
+Status setup_signals_alt_stack() {
+#if TD_PORT_POSIX && !TD_DARWIN_TV_OS && !TD_DARWIN_WATCH_OS
+  auto page_size = getpagesize();
+  auto stack_size = (MINSIGSTKSZ + 16 * page_size - 1) / page_size * page_size;
+
+  void *stack = mmap(nullptr, stack_size + 2 * page_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
+  if (stack == MAP_FAILED) {
+    return OS_ERROR("Mmap failed");
+  }
+
+  TRY_STATUS(protect_memory(stack, page_size));
+  TRY_STATUS(protect_memory(static_cast<char *>(stack) + stack_size + page_size, page_size));
+
+  stack_t signal_stack;
+  signal_stack.ss_sp = static_cast<char *>(stack) + page_size;
+  signal_stack.ss_size = stack_size;
+  signal_stack.ss_flags = 0;
+
+  if (sigaltstack(&signal_stack, nullptr) != 0) {
+    return OS_ERROR("sigaltstack failed");
+  }
+#endif
+  return Status::OK();
+}
+
+#if TD_PORT_POSIX
+static void set_handler(struct sigaction &act, decltype(act.sa_handler) handler) {
+  act.sa_handler = handler;
+}
+static void set_handler(struct sigaction &act, decltype(act.sa_sigaction) handler) {
+  act.sa_sigaction = handler;
+  act.sa_flags |= SA_SIGINFO;
+}
+template <class F>
+static Status set_signal_handler_impl(vector<int> signals, F func) {
+  struct sigaction act;
+  std::memset(&act, '\0', sizeof(act));
+
+  sigemptyset(&act.sa_mask);
+  for (auto signal : signals) {
+    sigaddset(&act.sa_mask, signal);
+  }
+  act.sa_flags = SA_RESTART | SA_ONSTACK;
+  set_handler(act, func);
+
+  for (auto signal : signals) {
+    if (sigaction(signal, &act, nullptr) != 0) {
+      return OS_ERROR("sigaction failed");
+    }
+  }
+  return Status::OK();
+}
+
+static vector<int> get_native_signals(SignalType type) {
+  switch (type) {
+    case SignalType::Abort:
+      return {SIGABRT, SIGXCPU, SIGXFSZ};
+    case SignalType::Error:
+      return {SIGILL, SIGFPE, SIGBUS, SIGSEGV, SIGSYS};
+    case SignalType::Quit:
+      return {SIGINT, SIGTERM, SIGQUIT};
+    case SignalType::Pipe:
+      return {SIGPIPE};
+    case SignalType::HangUp:
+      return {SIGHUP};
+    case SignalType::User:
+      return {SIGUSR1, SIGUSR2};
+    case SignalType::Other:
+      return {SIGTRAP, SIGALRM, SIGVTALRM, SIGPROF, SIGTSTP, SIGTTIN, SIGTTOU};
+    default:
+      return {};
+  }
+}
+#endif
+#if TD_PORT_WINDOWS
+static Status set_signal_handler_impl(vector<int> signals, void (*func)(int sig)) {
+  for (auto signal : signals) {
+    if (std::signal(signal, func) == SIG_ERR) {
+      return Status::Error("Failed to set signal handler");
+    }
+  }
+  return Status::OK();
+}
+
+static vector<int> get_native_signals(SignalType type) {
+  switch (type) {
+    case SignalType::Abort:
+      return {SIGABRT};
+    case SignalType::Error:
+      return {SIGILL, SIGFPE, SIGSEGV};
+    case SignalType::Quit:
+      return {SIGINT, SIGTERM};
+    case SignalType::Pipe:
+      return {};
+    case SignalType::HangUp:
+      return {};
+    case SignalType::User:
+      return {};
+    case SignalType::Other:
+      return {};
+    default:
+      return {};
+  }
+}
+#endif
+
+Status set_signal_handler(SignalType type, void (*func)(int)) {
+  return set_signal_handler_impl(get_native_signals(type), func == nullptr ? SIG_DFL : func);
+}
+
+using extended_signal_handler = void (*)(int sig, void *addr);
+static extended_signal_handler extended_signal_handlers[NSIG] = {};
+
+#if TD_PORT_POSIX
+static void siginfo_handler(int signum, siginfo_t *info, void *data) {
+  auto handler = extended_signal_handlers[signum];
+  handler(signum, info->si_addr);
+}
+#elif TD_PORT_WINDOWS
+static void siginfo_handler(int signum) {
+  auto handler = extended_signal_handlers[signum];
+  handler(signum, nullptr);
+}
+#endif
+
+Status set_extended_signal_handler(SignalType type, extended_signal_handler func) {
+  CHECK(func != nullptr);
+  auto signals = get_native_signals(type);
+  for (auto signal : signals) {
+    if (0 <= signal && signal < NSIG) {
+      extended_signal_handlers[signal] = func;
+    } else {
+      UNREACHABLE();
+    }
+  }
+  return set_signal_handler_impl(std::move(signals), siginfo_handler);
+}
+
+Status set_runtime_signal_handler(int runtime_signal_number, void (*func)(int)) {
+#ifdef SIGRTMIN
+  CHECK(SIGRTMIN + runtime_signal_number <= SIGRTMAX);
+  return set_signal_handler_impl({SIGRTMIN + runtime_signal_number}, func == nullptr ? SIG_DFL : func);
+#else
+  return Status::OK();
+#endif
+}
+
+Status ignore_signal(SignalType type) {
+  return set_signal_handler_impl(get_native_signals(type), SIG_IGN);
+}
+
+static void signal_safe_append_int(char **s, Slice name, int number) {
+  if (number < 0) {
+    number = std::numeric_limits<int>::max();
+  }
+
+  *--*s = ' ';
+  *--*s = ']';
+
+  do {
+    *--*s = static_cast<char>(number % 10 + '0');
+    number /= 10;
+  } while (number > 0);
+
+  *--*s = ' ';
+
+  for (auto pos = static_cast<int>(name.size()) - 1; pos >= 0; pos--) {
+    *--*s = name[pos];
+  }
+
+  *--*s = '[';
+}
+
+static void signal_safe_write_data(Slice data) {
+#if TD_PORT_POSIX
+  while (!data.empty()) {
+    auto res = write(2, data.begin(), data.size());
+    if (res < 0 && errno == EINTR) {
+      continue;
+    }
+    if (res <= 0) {
+      break;
+    }
+
+    if (res > 0) {
+      data.remove_prefix(res);
+    }
+  }
+#elif TD_PORT_WINDOWS
+#if WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_DESKTOP | WINAPI_PARTITION_SYSTEM)
+  HANDLE stderr_handle = GetStdHandle(STD_ERROR_HANDLE);
+  DWORD bytes_written;
+  WriteFile(stderr_handle, data.data(), static_cast<DWORD>(data.size()), &bytes_written, nullptr);
+#else
+// there is no stderr
+#endif
+#endif
+}
+
+static int get_process_id() {
+#if TD_PORT_POSIX
+  return getpid();
+#elif TD_PORT_WINDOWS
+  return GetCurrentProcessId();
+#endif
+}
+
+void signal_safe_write(Slice data, bool add_header) {
+  auto old_errno = errno;
+
+  if (add_header) {
+    constexpr size_t HEADER_BUF_SIZE = 100;
+    char header[HEADER_BUF_SIZE];
+    char *header_end = header + HEADER_BUF_SIZE;
+    char *header_begin = header_end;
+
+    signal_safe_append_int(&header_begin, "time", static_cast<int>(std::time(nullptr)));
+    signal_safe_append_int(&header_begin, "pid", get_process_id());
+
+    signal_safe_write_data(Slice(header_begin, header_end));
+  }
+
+  signal_safe_write_data(data);
+
+  errno = old_errno;
+}
+
+void signal_safe_write_signal_number(int sig, bool add_header) {
+  char buf[100];
+  char *end = buf + sizeof(buf);
+  char *ptr = end;
+  *--ptr = '\n';
+  do {
+    *--ptr = static_cast<char>(sig % 10 + '0');
+    sig /= 10;
+  } while (sig != 0);
+
+  ptr -= 8;
+  std::memcpy(ptr, "Signal: ", 8);
+  signal_safe_write(Slice(ptr, end), add_header);
+}
+
+void signal_safe_write_pointer(void *p, bool add_header) {
+  std::uintptr_t addr = reinterpret_cast<std::uintptr_t>(p);
+  char buf[100];
+  char *end = buf + sizeof(buf);
+  char *ptr = end;
+  *--ptr = '\n';
+  do {
+    *--ptr = td::format::hex_digit(addr % 16);
+    addr /= 16;
+  } while (addr != 0);
+  *--ptr = 'x';
+  *--ptr = '0';
+  ptr -= 9;
+  std::memcpy(ptr, "Address: ", 9);
+  signal_safe_write(Slice(ptr, end), add_header);
+}
+
+static void block_stdin() {
+#if TD_PORT_POSIX
+  Stdin().get_native_fd().set_is_blocking(true).ignore();
+#endif
+}
+
+static void default_failure_signal_handler(int sig) {
+  signal_safe_write_signal_number(sig);
+
+  Stacktrace::PrintOptions options;
+  options.use_gdb = true;
+  Stacktrace::print_to_stderr(options);
+
+  block_stdin();
+  _Exit(EXIT_FAILURE);
+}
+
+Status set_default_failure_signal_handler() {
+#if TD_PORT_POSIX
+  Stdin();  // init static variables before atexit
+#endif
+  std::atexit(block_stdin);
+  TRY_STATUS(setup_signals_alt_stack());
+  TRY_STATUS(set_signal_handler(SignalType::Abort, default_failure_signal_handler));
+  TRY_STATUS(set_signal_handler(SignalType::Error, default_failure_signal_handler));
+  return Status::OK();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/signals.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/signals.h
new file mode 100644
index 0000000000..2b8d826f66
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/signals.h
@@ -0,0 +1,48 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+namespace td {
+
+Status setup_signals_alt_stack() TD_WARN_UNUSED_RESULT;
+
+enum class SignalType { Abort, Error, Quit, Pipe, HangUp, User, Other };
+
+Status set_signal_handler(SignalType type, void (*func)(int sig)) TD_WARN_UNUSED_RESULT;
+
+Status set_extended_signal_handler(SignalType type, void (*func)(int sig, void *addr)) TD_WARN_UNUSED_RESULT;
+
+Status set_runtime_signal_handler(int runtime_signal_number, void (*func)(int sig)) TD_WARN_UNUSED_RESULT;
+
+Status ignore_signal(SignalType type) TD_WARN_UNUSED_RESULT;
+
+// writes data to the standard error stream in a signal-safe way
+void signal_safe_write(Slice data, bool add_header = true);
+
+void signal_safe_write_signal_number(int sig, bool add_header = true);
+
+void signal_safe_write_pointer(void *p, bool add_header = true);
+
+Status set_default_failure_signal_handler();
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/sleep.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/sleep.cpp
new file mode 100644
index 0000000000..22f3401e95
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/sleep.cpp
@@ -0,0 +1,49 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/sleep.h"
+
+#include "td/utils/port/config.h"
+
+#if TD_PORT_POSIX
+#if _POSIX_C_SOURCE >= 199309L
+#include <time.h>
+#else
+#include <unistd.h>
+#endif
+#endif
+
+namespace td {
+
+void usleep_for(int32 microseconds) {
+#if TD_PORT_WINDOWS
+  int32 milliseconds = microseconds / 1000 + (microseconds % 1000 ? 1 : 0);
+  Sleep(milliseconds);
+#else
+#if _POSIX_C_SOURCE >= 199309L
+  timespec ts;
+  ts.tv_sec = microseconds / 1000000;
+  ts.tv_nsec = (microseconds % 1000000) * 1000;
+  nanosleep(&ts, nullptr);
+#else
+  usleep(microseconds);
+#endif
+#endif
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/sleep.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/sleep.h
new file mode 100644
index 0000000000..ad850a28aa
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/sleep.h
@@ -0,0 +1,27 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+namespace td {
+
+void usleep_for(int32 microseconds);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/stacktrace.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/stacktrace.cpp
new file mode 100644
index 0000000000..6429de3319
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/stacktrace.cpp
@@ -0,0 +1,129 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/stacktrace.h"
+
+#include "td/utils/port/signals.h"
+
+#if __GLIBC__
+#include <execinfo.h>
+#endif
+
+#if TD_LINUX || TD_FREEBSD
+#include <sys/types.h>
+#include <sys/wait.h>
+#include <unistd.h>
+
+#if TD_LINUX
+#include <sys/prctl.h>
+#endif
+#endif
+
+namespace td {
+
+namespace {
+
+void print_backtrace(void) {
+#if __GLIBC__
+  void *buffer[128];
+  int nptrs = backtrace(buffer, 128);
+  signal_safe_write("------- Stack Backtrace -------\n", false);
+  backtrace_symbols_fd(buffer, nptrs, 2);
+  signal_safe_write("-------------------------------\n", false);
+#endif
+}
+
+void print_backtrace_gdb(void) {
+#if TD_LINUX || TD_FREEBSD
+  char pid_buf[30];
+  char *pid_buf_begin = pid_buf + sizeof(pid_buf);
+  pid_t pid = getpid();
+  *--pid_buf_begin = '\0';
+  do {
+    *--pid_buf_begin = static_cast<char>(pid % 10 + '0');
+    pid /= 10;
+  } while (pid > 0);
+
+  char name_buf[512];
+  ssize_t res = readlink("/proc/self/exe", name_buf, 511);  // TODO works only under Linux
+  if (res >= 0) {
+    name_buf[res] = 0;
+
+#if TD_LINUX
+    if (prctl(PR_SET_DUMPABLE, 1, 0, 0, 0) < 0) {
+      signal_safe_write("Can't set dumpable\n");
+      return;
+    }
+#if defined(PR_SET_PTRACER)
+    // We can't use event fd because we are in a signal handler
+    int fds[2];
+    bool need_set_ptracer = true;
+    if (pipe(fds) < 0) {
+      need_set_ptracer = false;
+      signal_safe_write("Can't create a pipe\n");
+    }
+#endif
+#endif
+
+    int child_pid = fork();
+    if (child_pid < 0) {
+      signal_safe_write("Can't fork() to run gdb\n");
+      return;
+    }
+    if (!child_pid) {
+#if TD_LINUX && defined(PR_SET_PTRACER)
+      if (need_set_ptracer) {
+        char c;
+        if (read(fds[0], &c, 1) < 0) {
+          signal_safe_write("Failed to read from pipe\n");
+        }
+      }
+#endif
+      dup2(2, 1);  // redirect output to stderr
+      execlp("gdb", "gdb", "--batch", "-n", "-ex", "thread", "-ex", "thread apply all bt full", name_buf, pid_buf_begin,
+             nullptr);
+      return;
+    } else {
+#if TD_LINUX && defined(PR_SET_PTRACER)
+      if (need_set_ptracer) {
+        if (prctl(PR_SET_PTRACER, child_pid, 0, 0, 0) < 0) {
+          signal_safe_write("Can't set ptracer\n");
+        }
+        if (write(fds[1], "a", 1) != 1) {
+          signal_safe_write("Can't write to pipe\n");
+        }
+      }
+#endif
+      waitpid(child_pid, nullptr, 0);
+    }
+  } else {
+    signal_safe_write("Can't get name of executable file to pass to gdb\n");
+  }
+#endif
+}
+
+}  // namespace
+
+void Stacktrace::print_to_stderr(const PrintOptions &options) {
+  if (options.use_gdb) {
+    print_backtrace_gdb();
+  }
+  print_backtrace();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/stacktrace.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/stacktrace.h
new file mode 100644
index 0000000000..ec1969ec96
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/stacktrace.h
@@ -0,0 +1,33 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace td {
+
+class Stacktrace {
+ public:
+  struct PrintOptions {
+    bool use_gdb = false;
+    PrintOptions() {
+    }
+  };
+  static void print_to_stderr(const PrintOptions &options = PrintOptions());
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/thread.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/thread.h
new file mode 100644
index 0000000000..d24e13ba6a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/thread.h
@@ -0,0 +1,46 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#include "td/utils/port/detail/ThreadPthread.h"
+#include "td/utils/port/detail/ThreadStl.h"
+
+namespace td {
+
+// clang-format off
+
+#if TD_THREAD_PTHREAD
+  using thread = detail::ThreadPthread;
+  namespace this_thread = detail::this_thread_pthread;
+#elif TD_THREAD_STL
+  using thread = detail::ThreadStl;
+  namespace this_thread = detail::this_thread_stl;
+#elif TD_THREAD_UNSUPPORTED
+  namespace this_thread {
+    inline void yield() {}
+  }
+#else
+  #error "Thread's implementation is not defined"
+#endif
+
+// clang-format on
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/thread_local.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/thread_local.cpp
new file mode 100644
index 0000000000..d75c339755
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/thread_local.cpp
@@ -0,0 +1,53 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/thread_local.h"
+
+namespace td {
+
+namespace detail {
+
+static TD_THREAD_LOCAL int32 thread_id_;
+static TD_THREAD_LOCAL std::vector<unique_ptr<Destructor>> *thread_local_destructors;
+
+void add_thread_local_destructor(unique_ptr<Destructor> destructor) {
+  if (thread_local_destructors == nullptr) {
+    thread_local_destructors = new std::vector<unique_ptr<Destructor>>();
+  }
+  thread_local_destructors->push_back(std::move(destructor));
+}
+
+}  // namespace detail
+
+void clear_thread_locals() {
+  // ensure that no destructors were added during destructors invokation
+  auto to_delete = detail::thread_local_destructors;
+  detail::thread_local_destructors = nullptr;
+  delete to_delete;
+  CHECK(detail::thread_local_destructors == nullptr);
+}
+
+void set_thread_id(int32 id) {
+  detail::thread_id_ = id;
+}
+
+int32 get_thread_id() {
+  return detail::thread_id_;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/thread_local.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/thread_local.h
new file mode 100644
index 0000000000..4751f64223
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/thread_local.h
@@ -0,0 +1,77 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#include "td/utils/common.h"
+#include "td/utils/Destructor.h"
+
+#include <memory>
+#include <utility>
+
+namespace td {
+
+// clang-format off
+#if TD_GCC || TD_CLANG
+  #define TD_THREAD_LOCAL __thread
+#elif TD_INTEL || TD_MSVC
+  #define TD_THREAD_LOCAL thread_local
+#else
+  #warning "TD_THREAD_LOCAL is not defined, trying 'thread_local'"
+  #define TD_THREAD_LOCAL thread_local
+#endif
+// clang-format on
+
+// If raw_ptr is not nullptr, allocate T as in std::make_unique<T>(args...) and store pointer into raw_ptr
+template <class T, class P, class... ArgsT>
+bool init_thread_local(P &raw_ptr, ArgsT &&... args);
+
+// Destroy all thread locals, and store nullptr into corresponding pointers
+void clear_thread_locals();
+
+void set_thread_id(int32 id);
+
+int32 get_thread_id();
+
+namespace detail {
+void add_thread_local_destructor(unique_ptr<Destructor> destructor);
+
+template <class T, class P, class... ArgsT>
+void do_init_thread_local(P &raw_ptr, ArgsT &&... args) {
+  auto ptr = std::make_unique<T>(std::forward<ArgsT>(args)...);
+  raw_ptr = ptr.get();
+
+  detail::add_thread_local_destructor(create_destructor([ptr = std::move(ptr), &raw_ptr]() mutable {
+    ptr.reset();
+    raw_ptr = nullptr;
+  }));
+}
+}  // namespace detail
+
+template <class T, class P, class... ArgsT>
+bool init_thread_local(P &raw_ptr, ArgsT &&... args) {
+  if (likely(raw_ptr != nullptr)) {
+    return false;
+  }
+  detail::do_init_thread_local<T>(raw_ptr, std::forward<ArgsT>(args)...);
+  return true;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/user.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/user.cpp
new file mode 100644
index 0000000000..859bb70311
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/user.cpp
@@ -0,0 +1,41 @@
+#include "user.h"
+#if TD_LINUX
+#include <unistd.h>
+#include <sys/types.h>
+#include <pwd.h>
+#include <grp.h>
+#endif
+
+namespace td {
+
+#if TD_LINUX
+td::Status change_user(td::Slice user) {
+  struct passwd *pw;
+  if (getuid() != 0 || geteuid() != 0) {
+    return td::Status::PosixError(errno, "cannot setuid() as not root");
+  }
+  if ((pw = getpwnam(user.str().c_str())) == 0) {
+    return td::Status::PosixError(errno, PSTRING() << "bad user '" << user << "'");
+  }
+  gid_t gid = pw->pw_gid;
+  if (setgroups(1, &gid) < 0) {
+    return td::Status::PosixError(errno, "failed to clear supplementary groups list");
+  }
+  if (initgroups(user.str().c_str(), gid) != 0) {
+    return td::Status::PosixError(errno, "failed to load groups of user");
+  }
+  if (setgid(pw->pw_gid) < 0) {
+    return td::Status::PosixError(errno, "failed to setgid()");
+  }
+  if (setuid(pw->pw_uid) < 0) {
+    return td::Status::PosixError(errno, "failed to setuid()");
+  }
+  return td::Status::OK();
+}
+#else
+td::Status change_user(td::Slice username) {
+  return td::Status::Error("not implemented");
+}
+#endif
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/user.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/user.h
new file mode 100644
index 0000000000..4c5d48a457
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/user.h
@@ -0,0 +1,11 @@
+#pragma once
+
+#include "td/utils/port/config.h"
+#include "td/utils/port/platform.h"
+#include "td/utils/Status.h"
+
+namespace td {
+
+td::Status change_user(td::Slice username);
+
+}
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/wstring_convert.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/port/wstring_convert.cpp
new file mode 100644
index 0000000000..62fca856af
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/wstring_convert.cpp
@@ -0,0 +1,127 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/port/wstring_convert.h"
+
+char disable_linker_warning_about_empty_file_wstring_convert_cpp TD_UNUSED;
+
+#if TD_PORT_WINDOWS
+
+#include "td/utils/utf8.h"
+
+#include <cwchar>
+
+namespace td {
+
+Result<std::wstring> to_wstring(CSlice slice) {
+  if (!check_utf8(slice)) {
+    return Status::Error("Wrong encoding");
+  }
+
+  size_t wstring_len = 0;
+  for (auto c : slice) {
+    wstring_len += ((c & 0xc0) != 0x80) + ((c & 0xf8) == 0xf0);
+  }
+
+  std::wstring result(wstring_len, static_cast<wchar_t>(0));
+  if (wstring_len) {
+    wchar_t *res = &result[0];
+    for (size_t i = 0; i < slice.size();) {
+      unsigned int a = static_cast<unsigned char>(slice[i++]);
+      if (a >= 0x80) {
+        unsigned int b = static_cast<unsigned char>(slice[i++]);
+        if (a >= 0xe0) {
+          unsigned int c = static_cast<unsigned char>(slice[i++]);
+          if (a >= 0xf0) {
+            unsigned int d = static_cast<unsigned char>(slice[i++]);
+            unsigned int val = ((a & 0x07) << 18) + ((b & 0x3f) << 12) + ((c & 0x3f) << 6) + (d & 0x3f) - 0x10000;
+            *res++ = static_cast<wchar_t>(0xD800 + (val >> 10));
+            *res++ = static_cast<wchar_t>(0xDC00 + (val & 0x3ff));
+          } else {
+            *res++ = static_cast<wchar_t>(((a & 0x0f) << 12) + ((b & 0x3f) << 6) + (c & 0x3f));
+          }
+        } else {
+          *res++ = static_cast<wchar_t>(((a & 0x1f) << 6) + (b & 0x3f));
+        }
+      } else {
+        *res++ = static_cast<wchar_t>(a);
+      }
+    }
+    CHECK(res == &result[0] + wstring_len);
+  }
+  return result;
+}
+
+Result<string> from_wstring(const wchar_t *begin, size_t size) {
+  size_t result_len = 0;
+  for (size_t i = 0; i < size; i++) {
+    unsigned int cur = begin[i];
+    if ((cur & 0xF800) == 0xD800) {
+      if (i < size) {
+        unsigned int next = begin[++i];
+        if ((next & 0xFC00) == 0xDC00 && (cur & 0x400) == 0) {
+          result_len += 4;
+          continue;
+        }
+      }
+
+      return Status::Error("Wrong encoding");
+    }
+    result_len += 1 + (cur >= 0x80) + (cur >= 0x800);
+  }
+
+  std::string result(result_len, '\0');
+  if (result_len) {
+    char *res = &result[0];
+    for (size_t i = 0; i < size; i++) {
+      unsigned int cur = begin[i];
+      // TODO conversion unsigned int -> signed char is implementation defined
+      if (cur <= 0x7f) {
+        *res++ = static_cast<char>(cur);
+      } else if (cur <= 0x7ff) {
+        *res++ = static_cast<char>(0xc0 | (cur >> 6));
+        *res++ = static_cast<char>(0x80 | (cur & 0x3f));
+      } else if ((cur & 0xF800) != 0xD800) {
+        *res++ = static_cast<char>(0xe0 | (cur >> 12));
+        *res++ = static_cast<char>(0x80 | ((cur >> 6) & 0x3f));
+        *res++ = static_cast<char>(0x80 | (cur & 0x3f));
+      } else {
+        unsigned int next = begin[++i];
+        unsigned int val = ((cur - 0xD800) << 10) + next - 0xDC00 + 0x10000;
+
+        *res++ = static_cast<char>(0xf0 | (val >> 18));
+        *res++ = static_cast<char>(0x80 | ((val >> 12) & 0x3f));
+        *res++ = static_cast<char>(0x80 | ((val >> 6) & 0x3f));
+        *res++ = static_cast<char>(0x80 | (val & 0x3f));
+      }
+    }
+  }
+  return result;
+}
+
+Result<string> from_wstring(const std::wstring &str) {
+  return from_wstring(str.data(), str.size());
+}
+
+Result<string> from_wstring(const wchar_t *begin) {
+  return from_wstring(begin, std::wcslen(begin));
+}
+
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/port/wstring_convert.h b/submodules/ton/tonlib-src/tdutils/td/utils/port/wstring_convert.h
new file mode 100644
index 0000000000..3b2bc0004d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/port/wstring_convert.h
@@ -0,0 +1,43 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/config.h"
+
+#if TD_PORT_WINDOWS
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+#include <string>
+
+namespace td {
+
+Result<std::wstring> to_wstring(CSlice slice);
+
+Result<string> from_wstring(const std::wstring &str);
+
+Result<string> from_wstring(const wchar_t *begin, size_t size);
+
+Result<string> from_wstring(const wchar_t *begin);
+
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/queue.h b/submodules/ton/tonlib-src/tdutils/td/utils/queue.h
new file mode 100644
index 0000000000..c52b0d0268
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/queue.h
@@ -0,0 +1,484 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/port/EventFd.h"
+#include "td/utils/port/thread.h"
+
+#if !TD_THREAD_UNSUPPORTED && !TD_EVENTFD_UNSUPPORTED
+
+#include <atomic>
+#include <type_traits>
+#include <utility>
+
+namespace td {
+
+namespace detail {
+class Backoff {
+  int cnt = 0;
+
+ public:
+  bool next() {
+    // TODO: find out better strategy
+    // TODO: try adaptive backoff
+    // TODO: different strategy one core cpu
+    // return false;
+
+    cnt++;
+    if (cnt < 1) {  // 50
+      return true;
+    } else {
+      td::this_thread::yield();
+      return cnt < 3;  // 500
+    }
+  }
+};
+
+class InfBackoff {
+  int cnt = 0;
+
+ public:
+  bool next() {
+    cnt++;
+    if (cnt < 50) {
+      return true;
+    } else {
+      td::this_thread::yield();
+      return true;
+    }
+  }
+};
+
+}  // namespace detail
+
+template <class T, int P = 10>
+class SPSCBlockQueue {
+ public:
+  using ValueType = T;
+
+ private:
+  static constexpr int buffer_size() {
+    static_assert(P >= 1 && P <= 20, "Bad size of BlockQueue");
+    return 1 << P;
+  }
+
+  struct Position {
+    std::atomic<uint32> i{0};
+    char pad[64 - sizeof(std::atomic<uint32>)];
+    uint32 local_writer_i;
+    char pad2[64 - sizeof(uint32)];
+    uint32 local_reader_i;
+    char pad3[64 - sizeof(uint32)];
+
+    void init() {
+      i = 0;
+      local_reader_i = 0;
+      local_writer_i = 0;
+    }
+  };
+
+  typename std::aligned_storage<sizeof(ValueType)>::type data_[buffer_size()];
+  Position writer_;
+  Position reader_;
+
+  static int fix_i(int i) {
+    return i & (buffer_size() - 1);
+  }
+
+  ValueType *at_ptr(int i) {
+    return reinterpret_cast<ValueType *>(&data_[fix_i(i)]);
+  }
+
+  ValueType &at(int i) {
+    return *at_ptr(i);
+  }
+
+ public:
+  void init() {
+    writer_.init();
+    reader_.init();
+  }
+
+  void destroy() {
+  }
+
+  int writer_size() {
+    return static_cast<int>(writer_.local_reader_i + buffer_size() - writer_.local_writer_i);
+  }
+
+  bool writer_empty() {
+    return writer_.local_reader_i + buffer_size() == writer_.local_writer_i;
+  }
+
+  template <class PutValueType>
+  void writer_put_unsafe(PutValueType &&value) {
+    at(writer_.local_writer_i++) = std::forward<PutValueType>(value);
+  }
+
+  int writer_update() {
+    writer_.local_reader_i = reader_.i.load(std::memory_order_acquire);
+    return writer_size();
+  }
+
+  void writer_flush() {
+    writer_.i.store(writer_.local_writer_i, std::memory_order_release);
+  }
+
+  int reader_size() {
+    return static_cast<int>(reader_.local_writer_i - reader_.local_reader_i);
+  }
+
+  int reader_empty() {
+    return reader_.local_writer_i == reader_.local_reader_i;
+  }
+
+  ValueType reader_get_unsafe() {
+    return std::move(at(reader_.local_reader_i++));
+  }
+
+  int reader_update() {
+    reader_.local_writer_i = writer_.i.load(std::memory_order_acquire);
+    return reader_size();
+  }
+
+  void reader_flush() {
+    reader_.i.store(reader_.local_reader_i, std::memory_order_release);
+  }
+};
+
+template <class T, class BlockQueueT = SPSCBlockQueue<T> >
+class SPSCChainQueue {
+ public:
+  using ValueType = T;
+
+  void init() {
+    head_ = tail_ = create_node();
+  }
+
+  SPSCChainQueue() = default;
+  SPSCChainQueue(const SPSCChainQueue &) = delete;
+  SPSCChainQueue &operator=(const SPSCChainQueue &) = delete;
+  SPSCChainQueue(SPSCChainQueue &&) = delete;
+  SPSCChainQueue &operator=(SPSCChainQueue &&) = delete;
+  ~SPSCChainQueue() {
+    destroy();
+  }
+
+  void destroy() {
+    while (head_ != nullptr) {
+      Node *to_delete = head_;
+      head_ = head_->next_;
+      delete_node(to_delete);
+    }
+    tail_ = nullptr;
+  }
+
+  int writer_size() {
+    return tail_->q_.writer_size();
+  }
+
+  bool writer_empty() {
+    return tail_->q_.writer_empty();
+  }
+
+  template <class PutValueType>
+  void writer_put_unsafe(PutValueType &&value) {
+    tail_->q_.writer_put_unsafe(std::forward<PutValueType>(value));
+  }
+
+  int writer_update() {
+    int res = tail_->q_.writer_update();
+    if (res != 0) {
+      return res;
+    }
+
+    writer_flush();
+
+    Node *new_tail = create_node();
+    tail_->next_ = new_tail;
+    tail_->is_closed_.store(true, std::memory_order_release);
+    tail_ = new_tail;
+    return tail_->q_.writer_update();
+  }
+
+  void writer_flush() {
+    tail_->q_.writer_flush();
+  }
+
+  int reader_size() {
+    return head_->q_.reader_size();
+  }
+
+  int reader_empty() {
+    return head_->q_.reader_empty();
+  }
+
+  ValueType reader_get_unsafe() {
+    return std::move(head_->q_.reader_get_unsafe());
+  }
+
+  int reader_update() {
+    int res = head_->q_.reader_update();
+    if (res != 0) {
+      return res;
+    }
+
+    if (!head_->is_closed_.load(std::memory_order_acquire)) {
+      return 0;
+    }
+
+    res = head_->q_.reader_update();
+    if (res != 0) {
+      return res;
+    }
+
+    // reader_flush();
+
+    Node *old_head = head_;
+    head_ = head_->next_;
+    delete_node(old_head);
+
+    return head_->q_.reader_update();
+  }
+
+  void reader_flush() {
+    head_->q_.reader_flush();
+  }
+
+ private:
+  struct Node {
+    BlockQueueT q_;
+    std::atomic<bool> is_closed_{false};
+    Node *next_;
+
+    void init() {
+      q_.init();
+      is_closed_ = false;
+      next_ = nullptr;
+    }
+
+    void destroy() {
+      q_.destroy();
+      next_ = nullptr;
+    }
+  };
+
+  Node *head_;
+  char pad[64 - sizeof(Node *)];
+  Node *tail_;
+  char pad2[64 - sizeof(Node *)];
+
+  Node *create_node() {
+    Node *res = new Node();
+    res->init();
+    return res;
+  }
+
+  void delete_node(Node *node) {
+    node->destroy();
+    delete node;
+  }
+};
+
+template <class T, class QueueT = SPSCChainQueue<T>, class BackoffT = detail::Backoff>
+class BackoffQueue : public QueueT {
+ public:
+  using ValueType = T;
+
+  template <class PutValueType>
+  void writer_put(PutValueType &&value) {
+    if (this->writer_empty()) {
+      int sz = this->writer_update();
+      CHECK(sz != 0);
+    }
+    this->writer_put_unsafe(std::forward<PutValueType>(value));
+  }
+
+  int reader_wait() {
+    BackoffT backoff;
+    int res = 0;
+    do {
+      res = this->reader_update();
+    } while (res == 0 && backoff.next());
+    return res;
+  }
+};
+
+template <class T, class QueueT = SPSCChainQueue<T> >
+using InfBackoffQueue = BackoffQueue<T, QueueT, detail::InfBackoff>;
+
+template <class T, class QueueT = BackoffQueue<T> >
+class PollQueue : public QueueT {
+ public:
+  using ValueType = T;
+  using QueueType = QueueT;
+
+  void init() {
+    QueueType::init();
+    event_fd_.init();
+    wait_state_ = 0;
+    writer_wait_state_ = 0;
+  }
+
+  PollQueue() = default;
+  PollQueue(const PollQueue &) = delete;
+  PollQueue &operator=(const PollQueue &) = delete;
+  PollQueue(PollQueue &&) = delete;
+  PollQueue &operator=(PollQueue &&) = delete;
+  ~PollQueue() {
+    destroy_impl();
+  }
+  void destroy() {
+    destroy_impl();
+    QueueType::destroy();
+  }
+
+  void writer_flush() {
+    int old_wait_state = get_wait_state();
+
+    std::atomic_thread_fence(std::memory_order_seq_cst);
+
+    QueueType::writer_flush();
+
+    std::atomic_thread_fence(std::memory_order_seq_cst);
+
+    int wait_state = get_wait_state();
+    if ((wait_state & 1) && wait_state != writer_wait_state_) {
+      event_fd_.release();
+      writer_wait_state_ = old_wait_state;
+    }
+  }
+
+  EventFd &reader_get_event_fd() {
+    return event_fd_;
+  }
+
+  // if 0 is returned than it is useless to rerun it before fd is
+  // ready to read.
+  int reader_wait_nonblock() {
+    int res;
+
+    if ((get_wait_state() & 1) == 0) {
+      res = this->QueueType::reader_wait();
+      if (res != 0) {
+        return res;
+      }
+
+      inc_wait_state();
+
+      std::atomic_thread_fence(std::memory_order_seq_cst);
+
+      res = this->reader_update();
+      if (res != 0) {
+        inc_wait_state();
+        return res;
+      }
+    }
+
+    event_fd_.acquire();
+    std::atomic_thread_fence(std::memory_order_seq_cst);
+    res = this->reader_update();
+    if (res != 0) {
+      inc_wait_state();
+    }
+    return res;
+  }
+
+  // Just an example of usage
+  int reader_wait() {
+    int res;
+    while ((res = reader_wait_nonblock()) == 0) {
+      reader_get_event_fd().wait(1000);
+    }
+    return res;
+  }
+
+ private:
+  EventFd event_fd_;
+  std::atomic<int> wait_state_{0};
+  int writer_wait_state_;
+
+  int get_wait_state() {
+    return wait_state_.load(std::memory_order_relaxed);
+  }
+
+  void inc_wait_state() {
+    wait_state_.store(get_wait_state() + 1, std::memory_order_relaxed);
+  }
+
+  void destroy_impl() {
+    if (!event_fd_.empty()) {
+      event_fd_.close();
+    }
+  }
+};
+
+}  // namespace td
+
+#else
+
+#include "td/utils/common.h"
+
+namespace td {
+
+// dummy implementation which shouldn't be used
+
+template <class T>
+class PollQueue {
+ public:
+  using ValueType = T;
+
+  void init() {
+    UNREACHABLE();
+  }
+
+  template <class PutValueType>
+  void writer_put(PutValueType &&value) {
+    UNREACHABLE();
+  }
+
+  void writer_flush() {
+    UNREACHABLE();
+  }
+
+  int reader_wait_nonblock() {
+    UNREACHABLE();
+    return 0;
+  }
+
+  ValueType reader_get_unsafe() {
+    UNREACHABLE();
+    return ValueType();
+  }
+
+  void reader_flush() {
+    UNREACHABLE();
+  }
+
+  PollQueue() = default;
+  PollQueue(const PollQueue &) = delete;
+  PollQueue &operator=(const PollQueue &) = delete;
+  PollQueue(PollQueue &&) = delete;
+  PollQueue &operator=(PollQueue &&) = delete;
+  ~PollQueue() = default;
+};
+
+}  // namespace td
+
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/tests.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/tests.cpp
new file mode 100644
index 0000000000..054f8113df
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/tests.cpp
@@ -0,0 +1,243 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/tests.h"
+
+#include "td/utils/crypto.h"
+#include "td/utils/filesystem.h"
+#include "td/utils/Parser.h"
+#include "td/utils/PathView.h"
+#include "td/utils/port/path.h"
+#include "td/utils/port/Stat.h"
+#include "td/utils/ScopeGuard.h"
+#include "td/utils/StringBuilder.h"
+#include "td/utils/Time.h"
+
+#include <map>
+
+namespace td {
+
+struct TestInfo {
+  string name;
+  string result_hash;  // base64
+};
+StringBuilder &operator<<(StringBuilder &sb, const TestInfo &info) {
+  // should I use JSON?
+  CHECK(!info.name.empty());
+  CHECK(!info.result_hash.empty());
+  return sb << info.name << " " << info.result_hash << "\n";
+}
+
+class RegressionTesterImpl : public RegressionTester {
+ public:
+  static void destroy(CSlice db_path) {
+    unlink(db_path).ignore();
+  }
+
+  RegressionTesterImpl(string db_path, string db_cache_dir) : db_path_(db_path), db_cache_dir_(db_cache_dir) {
+    load_db(db_path);
+    if (db_cache_dir_.empty()) {
+      db_cache_dir_ = PathView(db_path).without_extension().str() + ".cache/";
+    }
+    mkdir(db_cache_dir_).ensure();
+  }
+
+  Status verify_test(Slice name, Slice result) override {
+#if TD_HAVE_OPENSSL
+    auto hash = PSTRING() << format::as_hex_dump<0>(Slice(sha256(result)));
+#else
+    auto hash = to_string(crc64(result));
+#endif
+    TestInfo &old_test_info = tests_[name.str()];
+    if (!old_test_info.result_hash.empty() && old_test_info.result_hash != hash) {
+      auto wa_path = db_cache_dir_ + "WA";
+      write_file(wa_path, result).ensure();
+      return Status::Error(PSLICE() << "Test " << name << " changed: " << tag("expected", old_test_info.result_hash)
+                                    << tag("got", hash));
+    }
+    auto result_cache_path = db_cache_dir_ + hash;
+    if (stat(result_cache_path).is_error()) {
+      write_file(result_cache_path, result).ensure();
+    }
+    if (!old_test_info.result_hash.empty()) {
+      return Status::OK();
+    }
+    old_test_info.name = name.str();
+    old_test_info.result_hash = hash;
+    is_dirty_ = true;
+
+    return Status::OK();
+  }
+
+  void save_db() override {
+    if (!is_dirty_) {
+      return;
+    }
+    SCOPE_EXIT {
+      is_dirty_ = false;
+    };
+    string buf(2000000, ' ');
+    StringBuilder sb(buf);
+    save_db(sb);
+    string new_db_path = db_path_ + ".new";
+    write_file(new_db_path, sb.as_cslice()).ensure();
+    rename(new_db_path, db_path_).ensure();
+  }
+
+  Slice magic() const {
+    return Slice("abce");
+  }
+
+  void save_db(StringBuilder &sb) {
+    sb << magic() << "\n";
+    for (auto it : tests_) {
+      sb << it.second;
+    }
+  }
+
+  Status load_db(CSlice path) {
+    TRY_RESULT(data, read_file(path));
+    ConstParser parser(data.as_slice());
+    auto db_magic = parser.read_word();
+    if (db_magic != magic()) {
+      return Status::Error(PSLICE() << "Wrong magic " << db_magic);
+    }
+    while (true) {
+      TestInfo info;
+      info.name = parser.read_word().str();
+      if (info.name.empty()) {
+        break;
+      }
+      info.result_hash = parser.read_word().str();
+      tests_[info.name] = info;
+    }
+    return Status::OK();
+  }
+
+ private:
+  string db_path_;
+  string db_cache_dir_;
+  bool is_dirty_{false};
+
+  std::map<string, TestInfo> tests_;
+};
+
+void RegressionTester::destroy(CSlice path) {
+  RegressionTesterImpl::destroy(path);
+}
+
+unique_ptr<RegressionTester> RegressionTester::create(string db_path, string db_cache_dir) {
+  return td::make_unique<RegressionTesterImpl>(std::move(db_path), std::move(db_cache_dir));
+}
+
+TestsRunner &TestsRunner::get_default() {
+  static TestsRunner default_runner;
+  return default_runner;
+}
+
+void TestsRunner::add_test(string name, unique_ptr<Test> test) {
+  for (auto &it : tests_) {
+    if (it.first == name) {
+      LOG(FATAL) << "Test name collision " << name;
+    }
+  }
+  tests_.emplace_back(name, std::move(test));
+}
+
+void TestsRunner::add_substr_filter(string str) {
+  if (str[0] != '+' && str[0] != '-') {
+    str = "+" + str;
+  }
+  substr_filters_.push_back(std::move(str));
+}
+
+void TestsRunner::set_regression_tester(unique_ptr<RegressionTester> regression_tester) {
+  regression_tester_ = std::move(regression_tester);
+}
+
+void TestsRunner::set_stress_flag(bool flag) {
+  stress_flag_ = flag;
+}
+
+void TestsRunner::run_all() {
+  while (run_all_step()) {
+  }
+}
+
+bool TestsRunner::run_all_step() {
+  Guard guard(this);
+  if (state_.it == state_.end) {
+    state_.end = tests_.size();
+    state_.it = 0;
+  }
+
+  while (state_.it != state_.end) {
+    auto &name = tests_[state_.it].first;
+    auto test = tests_[state_.it].second.get();
+    if (!state_.is_running) {
+      bool ok = true;
+      for (const auto &filter : substr_filters_) {
+        bool is_match = name.find(filter.substr(1)) != string::npos;
+        if (is_match != (filter[0] == '+')) {
+          ok = false;
+          break;
+        }
+      }
+      if (!ok) {
+        ++state_.it;
+        continue;
+      }
+      LOG(ERROR) << "Run test " << tag("name", name);
+      state_.start = Time::now();
+      state_.is_running = true;
+    }
+
+    if (test->step()) {
+      break;
+    }
+
+    LOG(ERROR) << format::as_time(Time::now() - state_.start);
+    if (regression_tester_) {
+      regression_tester_->save_db();
+    }
+    state_.is_running = false;
+    ++state_.it;
+  }
+
+  auto ret = state_.it != state_.end;
+  if (!ret) {
+    state_ = State();
+  }
+  return ret || stress_flag_;
+}
+
+Slice TestsRunner::name() {
+  CHECK(state_.is_running);
+  return tests_[state_.it].first;
+}
+
+Status TestsRunner::verify(Slice data) {
+  if (!regression_tester_) {
+    LOG(INFO) << data;
+    LOG(ERROR) << "Cannot verify and save <" << name() << "> answer. Use --regression <regression_db> option";
+    return Status::OK();
+  }
+  return regression_tester_->verify_test(PSLICE() << name() << "_default", data);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/tests.h b/submodules/ton/tonlib-src/tdutils/td/utils/tests.h
new file mode 100644
index 0000000000..eb1fc3a82c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/tests.h
@@ -0,0 +1,182 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Context.h"
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/Random.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+
+#include <atomic>
+#include <utility>
+
+#define REGISTER_TESTS(x)                \
+  void TD_CONCAT(register_tests_, x)() { \
+  }
+#define DESC_TESTS(x) void TD_CONCAT(register_tests_, x)()
+#define LOAD_TESTS(x) TD_CONCAT(register_tests_, x)()
+
+namespace td {
+
+class RegressionTester {
+ public:
+  virtual ~RegressionTester() = default;
+  static void destroy(CSlice db_path);
+  static unique_ptr<RegressionTester> create(string db_path, string db_cache_dir = "");
+
+  virtual Status verify_test(Slice name, Slice result) = 0;
+  virtual void save_db() = 0;
+};
+
+class Test {
+ public:
+  virtual ~Test() = default;
+  virtual void run() {
+    while (step()) {
+    }
+  }
+  virtual bool step() {
+    run();
+    return false;
+  }
+  Test() = default;
+  Test(const Test &) = delete;
+  Test &operator=(const Test &) = delete;
+  Test(Test &&) = delete;
+  Test &operator=(Test &&) = delete;
+};
+
+class TestContext : public Context<TestContext> {
+ public:
+  virtual ~TestContext() = default;
+  virtual Slice name() = 0;
+  virtual Status verify(Slice data) = 0;
+};
+
+class TestsRunner : public TestContext {
+ public:
+  static TestsRunner &get_default();
+
+  void add_test(string name, unique_ptr<Test> test);
+  void add_substr_filter(string str);
+  void set_stress_flag(bool flag);
+  void run_all();
+  bool run_all_step();
+  void set_regression_tester(unique_ptr<RegressionTester> regression_tester);
+
+ private:
+  struct State {
+    size_t it{0};
+    bool is_running = false;
+    double start{0};
+    size_t end{0};
+  };
+  bool stress_flag_{false};
+  vector<string> substr_filters_;
+  vector<std::pair<string, unique_ptr<Test>>> tests_;
+  State state_;
+  unique_ptr<RegressionTester> regression_tester_;
+
+  Slice name() override;
+  Status verify(Slice data) override;
+};
+
+template <class T>
+class RegisterTest {
+ public:
+  RegisterTest(string name, TestsRunner &runner = TestsRunner::get_default()) {
+    runner.add_test(name, make_unique<T>());
+  }
+};
+
+class Stage {
+ public:
+  void wait(uint64 need) {
+    value_.fetch_add(1, std::memory_order_release);
+    while (value_.load(std::memory_order_acquire) < need) {
+      td::this_thread::yield();
+    }
+  };
+
+ private:
+  std::atomic<uint64> value_{0};
+};
+
+inline string rand_string(char from, char to, int len) {
+  string res(len, 0);
+  for (auto &c : res) {
+    c = static_cast<char>(Random::fast(from, to));
+  }
+  return res;
+}
+
+inline vector<string> rand_split(Slice str) {
+  vector<string> res;
+  size_t pos = 0;
+  while (pos < str.size()) {
+    size_t len;
+    if (Random::fast(0, 1) == 1) {
+      len = Random::fast(1, 10);
+    } else {
+      len = Random::fast(100, 200);
+    }
+    res.push_back(str.substr(pos, len).str());
+    pos += len;
+  }
+  return res;
+}
+
+template <class T1, class T2>
+void assert_eq_impl(const T1 &expected, const T2 &got, const char *file, int line) {
+  LOG_CHECK(expected == got) << tag("expected", expected) << tag("got", got) << " in " << file << " at line " << line;
+}
+
+template <class T>
+void assert_true_impl(const T &got, const char *file, int line) {
+  LOG_CHECK(got) << "Expected true in " << file << " at line " << line;
+}
+
+}  // namespace td
+
+#define ASSERT_EQ(expected, got) ::td::assert_eq_impl((expected), (got), __FILE__, __LINE__)
+
+#define ASSERT_TRUE(got) ::td::assert_true_impl((got), __FILE__, __LINE__)
+
+#define ASSERT_STREQ(expected, got) \
+  ::td::assert_eq_impl(::td::Slice((expected)), ::td::Slice((got)), __FILE__, __LINE__)
+
+#define REGRESSION_VERIFY(data) ::td::TestContext::get()->verify(data).ensure()
+
+#define TEST_NAME(test_case_name, test_name) \
+  TD_CONCAT(Test, TD_CONCAT(_, TD_CONCAT(test_case_name, TD_CONCAT(_, test_name))))
+
+#define TEST(test_case_name, test_name) TEST_IMPL(TEST_NAME(test_case_name, test_name))
+
+#define TEST_IMPL(test_name)                                                                                         \
+  class test_name : public ::td::Test {                                                                              \
+   public:                                                                                                           \
+    using Test::Test;                                                                                                \
+    void run() final;                                                                                                \
+  };                                                                                                                 \
+  ::td::RegisterTest<test_name> TD_CONCAT(test_instance_, TD_CONCAT(test_name, __LINE__))(TD_DEFINE_STR(test_name)); \
+  void test_name::run()
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/tl_helpers.h b/submodules/ton/tonlib-src/tdutils/td/utils/tl_helpers.h
new file mode 100644
index 0000000000..30cf09556a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/tl_helpers.h
@@ -0,0 +1,276 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/Slice.h"
+#include "td/utils/SharedSlice.h"
+#include "td/utils/StackAllocator.h"
+#include "td/utils/Status.h"
+#include "td/utils/tl_parsers.h"
+#include "td/utils/tl_storers.h"
+#include "td/utils/Variant.h"
+
+#include <type_traits>
+#include <unordered_set>
+
+#define BEGIN_STORE_FLAGS() \
+  do {                      \
+    uint32 flags_store = 0; \
+  uint32 bit_offset_store = 0
+
+#define STORE_FLAG(flag)                     \
+  flags_store |= (flag) << bit_offset_store; \
+  bit_offset_store++
+
+#define END_STORE_FLAGS()         \
+  CHECK(bit_offset_store < 31);   \
+  td::store(flags_store, storer); \
+  }                               \
+  while (false)
+
+#define BEGIN_PARSE_FLAGS()      \
+  do {                           \
+    uint32 flags_parse;          \
+    uint32 bit_offset_parse = 0; \
+  td::parse(flags_parse, parser)
+
+#define PARSE_FLAG(flag)                               \
+  flag = ((flags_parse >> bit_offset_parse) & 1) != 0; \
+  bit_offset_parse++
+
+#define END_PARSE_FLAGS()                                                                                           \
+  CHECK(bit_offset_parse < 31);                                                                                     \
+  if ((flags_parse & ~((1 << bit_offset_parse) - 1)) != 0) {                                                        \
+    parser.set_error(PSTRING() << "Invalid flags " << flags_parse << " left, current bit is " << bit_offset_parse); \
+  }                                                                                                                 \
+  }                                                                                                                 \
+  while (false)
+
+namespace td {
+
+template <class StorerT>
+void store(bool x, StorerT &storer) {
+  storer.store_binary(static_cast<int32>(x));
+}
+template <class ParserT>
+void parse(bool &x, ParserT &parser) {
+  x = parser.fetch_int() != 0;
+}
+
+template <class StorerT>
+void store(int32 x, StorerT &storer) {
+  storer.store_binary(x);
+}
+template <class ParserT>
+void parse(int32 &x, ParserT &parser) {
+  x = parser.fetch_int();
+}
+
+template <class StorerT>
+void store(uint32 x, StorerT &storer) {
+  storer.store_binary(x);
+}
+template <class ParserT>
+void parse(uint32 &x, ParserT &parser) {
+  x = static_cast<uint32>(parser.fetch_int());
+}
+
+template <class StorerT>
+void store(int64 x, StorerT &storer) {
+  storer.store_binary(x);
+}
+template <class ParserT>
+void parse(int64 &x, ParserT &parser) {
+  x = parser.fetch_long();
+}
+template <class StorerT>
+void store(uint64 x, StorerT &storer) {
+  storer.store_binary(x);
+}
+template <class ParserT>
+void parse(uint64 &x, ParserT &parser) {
+  x = static_cast<uint64>(parser.fetch_long());
+}
+
+template <class StorerT>
+void store(double x, StorerT &storer) {
+  storer.store_binary(x);
+}
+template <class ParserT>
+void parse(double &x, ParserT &parser) {
+  x = parser.fetch_double();
+}
+
+template <class StorerT>
+void store(Slice x, StorerT &storer) {
+  storer.store_string(x);
+}
+template <class StorerT>
+void store(const string &x, StorerT &storer) {
+  storer.store_string(x);
+}
+template <class StorerT>
+void store(const SecureString &x, StorerT &storer) {
+  storer.store_string(x.as_slice());
+}
+template <class ParserT>
+void parse(string &x, ParserT &parser) {
+  x = parser.template fetch_string<string>();
+}
+
+template <class ParserT>
+void parse(SecureString &x, ParserT &parser) {
+  x = parser.template fetch_string<SecureString>();
+}
+
+template <class T, class StorerT>
+void store(const vector<T> &vec, StorerT &storer) {
+  storer.store_binary(narrow_cast<int32>(vec.size()));
+  for (auto &val : vec) {
+    store(val, storer);
+  }
+}
+template <class T, class ParserT>
+void parse(vector<T> &vec, ParserT &parser) {
+  uint32 size = parser.fetch_int();
+  if (parser.get_left_len() < size) {
+    parser.set_error("Wrong vector length");
+    return;
+  }
+  vec = vector<T>(size);
+  for (auto &val : vec) {
+    parse(val, parser);
+  }
+}
+
+template <class Key, class Hash, class KeyEqual, class Allocator, class StorerT>
+void store(const std::unordered_set<Key, Hash, KeyEqual, Allocator> &s, StorerT &storer) {
+  storer.store_binary(narrow_cast<int32>(s.size()));
+  for (auto &val : s) {
+    store(val, storer);
+  }
+}
+template <class Key, class Hash, class KeyEqual, class Allocator, class ParserT>
+void parse(std::unordered_set<Key, Hash, KeyEqual, Allocator> &s, ParserT &parser) {
+  uint32 size = parser.fetch_int();
+  if (parser.get_left_len() < size) {
+    parser.set_error("Wrong set length");
+    return;
+  }
+  s.clear();
+  for (uint32 i = 0; i < size; i++) {
+    Key val;
+    parse(val, parser);
+    s.insert(std::move(val));
+  }
+}
+
+template <class T, class StorerT>
+std::enable_if_t<std::is_enum<T>::value> store(const T &val, StorerT &storer) {
+  store(static_cast<int32>(val), storer);
+}
+template <class T, class ParserT>
+std::enable_if_t<std::is_enum<T>::value> parse(T &val, ParserT &parser) {
+  int32 result;
+  parse(result, parser);
+  val = static_cast<T>(result);
+}
+
+template <class T, class StorerT>
+std::enable_if_t<!std::is_enum<T>::value> store(const T &val, StorerT &storer) {
+  val.store(storer);
+}
+template <class T, class ParserT>
+std::enable_if_t<!std::is_enum<T>::value> parse(T &val, ParserT &parser) {
+  val.parse(parser);
+}
+
+template <class... Types, class StorerT>
+void store(const Variant<Types...> &variant, StorerT &storer) {
+  store(variant.get_offset(), storer);
+  variant.visit([&storer](auto &&value) {
+    using td::store;
+    store(value, storer);
+  });
+}
+template <class... Types, class ParserT>
+void parse(Variant<Types...> &variant, ParserT &parser) {
+  auto type_offset = parser.fetch_int();
+  if (type_offset < 0 || type_offset >= static_cast<int32>(sizeof...(Types))) {
+    return parser.set_error("Invalid type");
+  }
+  variant.for_each([type_offset, &parser, &variant](int offset, auto *ptr) {
+    using T = std::decay_t<decltype(*ptr)>;
+    if (offset == type_offset) {
+      variant = T();
+      parse(variant.template get<T>(), parser);
+    }
+  });
+}
+
+template <class T>
+string serialize(const T &object) {
+  TlStorerCalcLength calc_length;
+  store(object, calc_length);
+  size_t length = calc_length.get_length();
+
+  string key(length, '\0');
+  if (!is_aligned_pointer<4>(key.data())) {
+    auto ptr = StackAllocator::alloc(length);
+    MutableSlice data = ptr.as_slice();
+    TlStorerUnsafe storer(data.ubegin());
+    store(object, storer);
+    CHECK(storer.get_buf() == data.uend());
+    key.assign(data.begin(), data.size());
+  } else {
+    MutableSlice data = key;
+    TlStorerUnsafe storer(data.ubegin());
+    store(object, storer);
+    CHECK(storer.get_buf() == data.uend());
+  }
+  return key;
+}
+
+template <class T>
+SecureString serialize_secure(const T &object) {
+  TlStorerCalcLength calc_length;
+  store(object, calc_length);
+  size_t length = calc_length.get_length();
+
+  SecureString key(length, '\0');
+  CHECK(is_aligned_pointer<4>(key.data()));
+  MutableSlice data = key.as_mutable_slice();
+  TlStorerUnsafe storer(data.ubegin());
+  store(object, storer);
+  CHECK(storer.get_buf() == data.uend());
+  return key;
+}
+
+template <class T>
+TD_WARN_UNUSED_RESULT Status unserialize(T &object, Slice data) {
+  TlParser parser(data);
+  parse(object, parser);
+  parser.fetch_end();
+  return parser.get_status();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/tl_parsers.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/tl_parsers.cpp
new file mode 100644
index 0000000000..26212beb13
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/tl_parsers.cpp
@@ -0,0 +1,42 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/tl_parsers.h"
+
+namespace td {
+
+alignas(4) const unsigned char TlParser::empty_data[sizeof(UInt256)] = {};  // static zero-initialized
+
+void TlParser::set_error(const string &error_message) {
+  if (error.empty()) {
+    CHECK(!error_message.empty());
+    error = error_message;
+    error_pos = data_len - left_len;
+    data = empty_data;
+    left_len = 0;
+    data_len = 0;
+  } else {
+    data = empty_data;
+    CHECK(error_pos != std::numeric_limits<size_t>::max());
+    LOG_CHECK(data_len == 0) << data_len << " " << left_len << " " << data << " " << &empty_data[0] << " " << error_pos
+                             << " " << error;
+    CHECK(left_len == 0);
+  }
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/tl_parsers.h b/submodules/ton/tonlib-src/tdutils/td/utils/tl_parsers.h
new file mode 100644
index 0000000000..d9efc3ee5d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/tl_parsers.h
@@ -0,0 +1,268 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/buffer.h"
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+#include "td/utils/UInt.h"
+#include "td/utils/utf8.h"
+
+#include <array>
+#include <cstring>
+#include <limits>
+#include <memory>
+#include <string>
+
+namespace td {
+
+class TlParser {
+  const unsigned char *data = nullptr;
+  size_t data_len = 0;
+  size_t left_len = 0;
+  size_t error_pos = std::numeric_limits<size_t>::max();
+  std::string error;
+
+  std::unique_ptr<int32[]> data_buf;
+  static constexpr size_t SMALL_DATA_ARRAY_SIZE = 6;
+  std::array<int32, SMALL_DATA_ARRAY_SIZE> small_data_array;
+
+  alignas(4) static const unsigned char empty_data[sizeof(UInt256)];
+
+ public:
+  explicit TlParser(Slice slice) {
+    data_len = left_len = slice.size();
+    if (is_aligned_pointer<4>(slice.begin())) {
+      data = slice.ubegin();
+    } else {
+      int32 *buf;
+      if (data_len <= small_data_array.size() * sizeof(int32)) {
+        buf = &small_data_array[0];
+      } else {
+        LOG(ERROR) << "Unexpected big unaligned data pointer of length " << slice.size() << " at " << slice.begin();
+        data_buf = std::make_unique<int32[]>(1 + data_len / sizeof(int32));
+        buf = data_buf.get();
+      }
+      std::memcpy(buf, slice.begin(), slice.size());
+      data = reinterpret_cast<unsigned char *>(buf);
+    }
+  }
+
+  TlParser(const TlParser &other) = delete;
+  TlParser &operator=(const TlParser &other) = delete;
+
+  void set_error(const string &error_message);
+
+  const char *get_error() const {
+    if (error.empty()) {
+      return nullptr;
+    }
+    return error.c_str();
+  }
+
+  size_t get_error_pos() const {
+    return error_pos;
+  }
+
+  Status get_status() const {
+    if (error.empty()) {
+      return Status::OK();
+    }
+    return Status::Error(PSLICE() << error << " at " << error_pos);
+  }
+
+  void check_len(const size_t len) {
+    if (unlikely(left_len < len)) {
+      set_error("Not enough data to read");
+    } else {
+      left_len -= len;
+    }
+  }
+
+  int32 fetch_int_unsafe() {
+    int32 result;
+    std::memcpy(&result, data, sizeof(int32));
+    data += sizeof(int32);
+    return result;
+  }
+
+  int32 fetch_int() {
+    check_len(sizeof(int32));
+    return fetch_int_unsafe();
+  }
+
+  int64 fetch_long_unsafe() {
+    int64 result;
+    std::memcpy(&result, data, sizeof(int64));
+    data += sizeof(int64);
+    return result;
+  }
+
+  int64 fetch_long() {
+    check_len(sizeof(int64));
+    return fetch_long_unsafe();
+  }
+
+  double fetch_double_unsafe() {
+    double result;
+    std::memcpy(&result, data, sizeof(double));
+    data += sizeof(double);
+    return result;
+  }
+
+  double fetch_double() {
+    check_len(sizeof(double));
+    return fetch_double_unsafe();
+  }
+
+  template <class T>
+  T fetch_binary_unsafe() {
+    T result;
+    std::memcpy(&result, data, sizeof(T));
+    data += sizeof(T);
+    return result;
+  }
+
+  template <class T>
+  T fetch_binary() {
+    static_assert(sizeof(T) <= sizeof(empty_data), "too big fetch_binary");
+    //static_assert(sizeof(T) % sizeof(int32) == 0, "wrong call to fetch_binary");
+    check_len(sizeof(T));
+    return fetch_binary_unsafe<T>();
+  }
+
+  template <class T>
+  T fetch_string() {
+    check_len(sizeof(int32));
+    size_t result_len = *data;
+    const char *result_begin;
+    size_t result_aligned_len;
+    if (result_len < 254) {
+      result_begin = reinterpret_cast<const char *>(data + 1);
+      result_aligned_len = (result_len >> 2) << 2;
+      data += sizeof(int32);
+    } else if (result_len == 254) {
+      result_len = data[1] + (data[2] << 8) + (data[3] << 16);
+      result_begin = reinterpret_cast<const char *>(data + 4);
+      result_aligned_len = ((result_len + 3) >> 2) << 2;
+      data += sizeof(int32);
+    } else {
+      check_len(sizeof(int32));
+      result_len = data[1] + (data[2] << 8) + (data[3] << 16) + (data[4] << 24) + (static_cast<uint64>(data[5]) << 32) +
+                   (static_cast<uint64>(data[6]) << 40) + (static_cast<uint64>(data[7]) << 48);
+      if (result_len > std::numeric_limits<size_t>::max() - 3) {
+        set_error("Too big string found");
+        return T();
+      }
+      result_begin = reinterpret_cast<const char *>(data + 8);
+      result_aligned_len = ((result_len + 3) >> 2) << 2;
+      data += sizeof(int64);
+    }
+    check_len(result_aligned_len);
+    if (!error.empty()) {
+      return T();
+    }
+    data += result_aligned_len;
+    return T(result_begin, result_len);
+  }
+
+  template <class T>
+  T fetch_string_raw(const size_t size) {
+    //CHECK(size % sizeof(int32) == 0);
+    check_len(size);
+    if (!error.empty()) {
+      return T();
+    }
+    const char *result = reinterpret_cast<const char *>(data);
+    data += size;
+    return T(result, size);
+  }
+
+  void fetch_end() {
+    if (left_len) {
+      set_error("Too much data to fetch");
+    }
+  }
+
+  size_t get_left_len() const {
+    return left_len;
+  }
+};
+
+class TlBufferParser : public TlParser {
+ public:
+  explicit TlBufferParser(const BufferSlice *buffer_slice) : TlParser(buffer_slice->as_slice()), parent_(buffer_slice) {
+  }
+  template <class T>
+  T fetch_string() {
+    auto result = TlParser::fetch_string<T>();
+    for (auto &c : result) {
+      if (c == '\0') {
+        c = ' ';
+      }
+    }
+    if (check_utf8(result)) {
+      return result;
+    }
+    CHECK(!result.empty());
+    LOG(WARNING) << "Wrong UTF-8 string [[" << result << "]] in " << format::as_hex_dump<4>(parent_->as_slice());
+
+    // trying to remove last character
+    size_t new_size = result.size() - 1;
+    while (new_size != 0 && !is_utf8_character_first_code_unit(static_cast<unsigned char>(result[new_size]))) {
+      new_size--;
+    }
+    result.resize(new_size);
+    if (check_utf8(result)) {
+      return result;
+    }
+
+    return T();
+  }
+  template <class T>
+  T fetch_string_raw(const size_t size) {
+    return TlParser::fetch_string_raw<T>(size);
+  }
+
+ private:
+  const BufferSlice *parent_;
+
+  BufferSlice as_buffer_slice(Slice slice) {
+    if (is_aligned_pointer<4>(slice.data())) {
+      return parent_->from_slice(slice);
+    }
+    return BufferSlice(slice);
+  }
+};
+
+template <>
+inline BufferSlice TlBufferParser::fetch_string<BufferSlice>() {
+  return as_buffer_slice(TlParser::fetch_string<Slice>());
+}
+
+template <>
+inline BufferSlice TlBufferParser::fetch_string_raw<BufferSlice>(const size_t size) {
+  return as_buffer_slice(TlParser::fetch_string_raw<Slice>(size));
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/tl_storers.h b/submodules/ton/tonlib-src/tdutils/td/utils/tl_storers.h
new file mode 100644
index 0000000000..dd9bc38985
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/tl_storers.h
@@ -0,0 +1,328 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/Slice.h"
+#include "td/utils/StorerBase.h"
+#include "td/utils/UInt.h"
+
+//FIXME
+#include "crypto/common/bitstring.h"
+
+#include <cstring>
+
+namespace td {
+
+class TlStorerUnsafe {
+  unsigned char *buf_;
+
+ public:
+  explicit TlStorerUnsafe(unsigned char *buf) : buf_(buf) {
+    LOG_CHECK(is_aligned_pointer<4>(buf_)) << buf_;
+  }
+
+  TlStorerUnsafe(const TlStorerUnsafe &other) = delete;
+  TlStorerUnsafe &operator=(const TlStorerUnsafe &other) = delete;
+
+  template <class T>
+  void store_binary(const T &x) {
+    std::memcpy(buf_, &x, sizeof(T));
+    buf_ += sizeof(T);
+  }
+
+  void store_int(int32 x) {
+    store_binary<int32>(x);
+  }
+
+  void store_long(int64 x) {
+    store_binary<int64>(x);
+  }
+
+  void store_slice(Slice slice) {
+    std::memcpy(buf_, slice.begin(), slice.size());
+    buf_ += slice.size();
+  }
+  void store_storer(const Storer &storer) {
+    size_t size = storer.store(buf_);
+    buf_ += size;
+  }
+
+  template <class T>
+  void store_string(const T &str) {
+    size_t len = str.size();
+    if (len < 254) {
+      *buf_++ = static_cast<unsigned char>(len);
+      len++;
+    } else if (len < (1 << 24)) {
+      *buf_++ = static_cast<unsigned char>(254);
+      *buf_++ = static_cast<unsigned char>(len & 255);
+      *buf_++ = static_cast<unsigned char>((len >> 8) & 255);
+      *buf_++ = static_cast<unsigned char>(len >> 16);
+    } else if (len < (1ull << 32)) {
+      *buf_++ = static_cast<unsigned char>(255);
+      *buf_++ = static_cast<unsigned char>(len & 255);
+      *buf_++ = static_cast<unsigned char>((len >> 8) & 255);
+      *buf_++ = static_cast<unsigned char>((len >> 16) & 255);
+      *buf_++ = static_cast<unsigned char>((len >> 24) & 255);
+      *buf_++ = static_cast<unsigned char>(0);
+      *buf_++ = static_cast<unsigned char>(0);
+      *buf_++ = static_cast<unsigned char>(0);
+    } else {
+      LOG(FATAL) << "String size " << len << " is too big to be stored";
+    }
+    std::memcpy(buf_, str.data(), str.size());
+    buf_ += str.size();
+
+    switch (len & 3) {
+      case 1:
+        *buf_++ = 0;
+        // fallthrough
+      case 2:
+        *buf_++ = 0;
+      // fallthrough
+      case 3:
+        *buf_++ = 0;
+    }
+  }
+
+  unsigned char *get_buf() const {
+    return buf_;
+  }
+};
+
+class TlStorerCalcLength {
+  size_t length = 0;
+
+ public:
+  TlStorerCalcLength() = default;
+  TlStorerCalcLength(const TlStorerCalcLength &other) = delete;
+  TlStorerCalcLength &operator=(const TlStorerCalcLength &other) = delete;
+
+  template <class T>
+  void store_binary(const T &x) {
+    length += sizeof(T);
+  }
+
+  void store_int(int32 x) {
+    store_binary<int32>(x);
+  }
+
+  void store_long(int64 x) {
+    store_binary<int64>(x);
+  }
+
+  void store_slice(Slice slice) {
+    length += slice.size();
+  }
+
+  void store_storer(const Storer &storer) {
+    length += storer.size();
+  }
+
+  template <class T>
+  void store_string(const T &str) {
+    size_t add = str.size();
+    if (add < 254) {
+      add += 1;
+    } else if (add < (1 << 24)) {
+      add += 4;
+    } else {
+      add += 8;
+    }
+    add = (add + 3) & -4;
+    length += add;
+  }
+
+  size_t get_length() const {
+    return length;
+  }
+};
+
+class TlStorerToString {
+  std::string result;
+  int shift = 0;
+
+  void store_field_begin(const char *name) {
+    for (int i = 0; i < shift; i++) {
+      result += ' ';
+    }
+    if (name && name[0]) {
+      result += name;
+      result += " = ";
+    }
+  }
+
+  void store_field_end() {
+    result += "\n";
+  }
+
+  void store_long(int64 value) {
+    result += (PSLICE() << value).c_str();
+  }
+
+  void store_binary(Slice data) {
+    static const char *hex = "0123456789ABCDEF";
+
+    result.append("{ ");
+    for (auto c : data) {
+      unsigned char byte = c;
+      result += hex[byte >> 4];
+      result += hex[byte & 15];
+      result += ' ';
+    }
+    result.append("}");
+  }
+
+ public:
+  TlStorerToString() = default;
+  TlStorerToString(const TlStorerToString &other) = delete;
+  TlStorerToString &operator=(const TlStorerToString &other) = delete;
+
+  void store_field(const char *name, bool value) {
+    store_field_begin(name);
+    result += (value ? "true" : "false");
+    store_field_end();
+  }
+
+  void store_field(const char *name, int32 value) {
+    store_field(name, static_cast<int64>(value));
+  }
+
+  void store_field(const char *name, int64 value) {
+    store_field_begin(name);
+    store_long(value);
+    store_field_end();
+  }
+
+  void store_field(const char *name, double value) {
+    store_field_begin(name);
+    result += (PSLICE() << value).c_str();
+    store_field_end();
+  }
+
+  void store_field(const char *name, const char *value) {
+    store_field_begin(name);
+    result += value;
+    store_field_end();
+  }
+
+  void store_field(const char *name, const string &value) {
+    store_field_begin(name);
+    result += '"';
+    result.append(value.data(), value.size());
+    result += '"';
+    store_field_end();
+  }
+
+  template <class T>
+  void store_field(const char *name, const T &value) {
+    store_field_begin(name);
+    result.append(value.data(), value.size());
+    store_field_end();
+  }
+
+  template <class BytesT>
+  void store_bytes_field(const char *name, const BytesT &value) {
+    static const char *hex = "0123456789ABCDEF";
+
+    store_field_begin(name);
+    result.append("bytes [");
+    store_long(static_cast<int64>(value.size()));
+    result.append("] { ");
+    size_t len = min(static_cast<size_t>(64), value.size());
+    for (size_t i = 0; i < len; i++) {
+      int b = value[static_cast<int>(i)] & 0xff;
+      result += hex[b >> 4];
+      result += hex[b & 15];
+      result += ' ';
+    }
+    if (len < value.size()) {
+      result.append("...");
+    }
+    result += '}';
+    store_field_end();
+  }
+
+  //FIXME
+  void store_field(const char *name, const Bits128 &value) {
+    store_field_begin(name);
+    store_binary(as_slice(value));
+    store_field_end();
+  }
+
+  void store_field(const char *name, const Bits256 &value) {
+    store_field_begin(name);
+    store_binary(as_slice(value));
+    store_field_end();
+  }
+
+  void store_field(const char *name, const UInt128 &value) {
+    store_field_begin(name);
+    store_binary(as_slice(value));
+    store_field_end();
+  }
+
+  void store_field(const char *name, const UInt256 &value) {
+    store_field_begin(name);
+    store_binary(as_slice(value));
+    store_field_end();
+  }
+
+  void store_class_begin(const char *field_name, const char *class_name) {
+    store_field_begin(field_name);
+    result += class_name;
+    result += " {\n";
+    shift += 2;
+  }
+
+  void store_class_end() {
+    shift -= 2;
+    for (int i = 0; i < shift; i++) {
+      result += ' ';
+    }
+    result += "}\n";
+    CHECK(shift >= 0);
+  }
+
+  std::string str() const {
+    return result;
+  }
+};
+
+template <class T>
+size_t tl_calc_length(const T &data) {
+  TlStorerCalcLength storer_calc_length;
+  data.store(storer_calc_length);
+  return storer_calc_length.get_length();
+}
+
+template <class T>
+size_t tl_store_unsafe(const T &data, unsigned char *dst) TD_WARN_UNUSED_RESULT;
+
+template <class T>
+size_t tl_store_unsafe(const T &data, unsigned char *dst) {
+  TlStorerUnsafe storer_unsafe(dst);
+  data.store(storer_unsafe);
+  return static_cast<size_t>(storer_unsafe.get_buf() - dst);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/translit.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/translit.cpp
new file mode 100644
index 0000000000..9a5537acb2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/translit.cpp
@@ -0,0 +1,127 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/translit.h"
+
+#include "td/utils/misc.h"
+#include "td/utils/utf8.h"
+
+#include <algorithm>
+#include <unordered_map>
+#include <utility>
+
+namespace td {
+
+static const std::unordered_map<uint32, string> &get_en_to_ru_simple_rules() {
+  static const std::unordered_map<uint32, string> rules{
+      {'a', "а"}, {'b', "б"}, {'c', "к"}, {'d', "д"}, {'e', "е"}, {'f', "ф"},  {'g', "г"}, {'h', "х"}, {'i', "и"},
+      {'j', "й"}, {'k', "к"}, {'l', "л"}, {'m', "м"}, {'n', "н"}, {'o', "о"},  {'p', "п"}, {'q', "к"}, {'r', "р"},
+      {'s', "с"}, {'t', "т"}, {'u', "у"}, {'v', "в"}, {'w', "в"}, {'x', "кс"}, {'y', "и"}, {'z', "з"}};
+  return rules;
+}
+
+static const std::vector<std::pair<string, string>> &get_en_to_ru_complex_rules() {
+  static const std::vector<std::pair<string, string>> rules{
+      {"ch", "ч"}, {"ei", "ей"}, {"ey", "ей"}, {"ia", "ия"},  {"iy", "ий"}, {"jo", "е"},
+      {"ju", "ю"}, {"ja", "я"},  {"kh", "х"},  {"shch", "щ"}, {"sh", "ш"},  {"sch", "щ"},
+      {"ts", "ц"}, {"yo", "е"},  {"yu", "ю"},  {"ya", "я"},   {"zh", "ж"}};
+  return rules;
+}
+
+static const std::unordered_map<uint32, string> &get_ru_to_en_simple_rules() {
+  static const std::unordered_map<uint32, string> rules{
+      {0x430, "a"},  {0x431, "b"},  {0x432, "v"},  {0x433, "g"},  {0x434, "d"},  {0x435, "e"},   {0x451, "e"},
+      {0x436, "zh"}, {0x437, "z"},  {0x438, "i"},  {0x439, "y"},  {0x43a, "k"},  {0x43b, "l"},   {0x43c, "m"},
+      {0x43d, "n"},  {0x43e, "o"},  {0x43f, "p"},  {0x440, "r"},  {0x441, "s"},  {0x442, "t"},   {0x443, "u"},
+      {0x444, "f"},  {0x445, "kh"}, {0x446, "ts"}, {0x447, "ch"}, {0x448, "sh"}, {0x449, "sch"}, {0x44a, ""},
+      {0x44b, "y"},  {0x44c, ""},   {0x44d, "e"},  {0x44e, "yu"}, {0x44f, "ya"}};
+  return rules;
+}
+
+static const std::vector<std::pair<string, string>> &get_ru_to_en_complex_rules() {
+  static const std::vector<std::pair<string, string>> rules{
+      {"ий", "y"}, {"ия", "ia"}, {"кс", "x"}, {"yo", "e"}, {"jo", "e"}};
+  return rules;
+}
+
+void add_word_transliterations(vector<string> &result, Slice word, bool allow_partial,
+                               const std::unordered_map<uint32, string> &simple_rules,
+                               const std::vector<std::pair<string, string>> &complex_rules) {
+  string s;
+  auto pos = word.ubegin();
+  auto end = word.uend();
+  while (pos != end) {
+    uint32 code;
+    pos = next_utf8_unsafe(pos, &code, "add_word_transliterations");
+    auto it = simple_rules.find(code);
+    if (it != simple_rules.end()) {
+      s += it->second;
+    } else {
+      append_utf8_character(s, code);
+    }
+  }
+  if (!s.empty()) {
+    result.push_back(std::move(s));
+    s.clear();
+  }
+
+  pos = word.ubegin();
+  while (pos != end) {
+    auto suffix = Slice(pos, end);
+    bool found = false;
+    for (auto &rule : complex_rules) {
+      if (begins_with(suffix, rule.first)) {
+        found = true;
+        pos += rule.first.size();
+        s.append(rule.second);
+        break;
+      }
+      if (allow_partial && begins_with(rule.first, suffix)) {
+        result.push_back(s + rule.second);
+      }
+    }
+    if (found) {
+      continue;
+    }
+
+    uint32 code;
+    pos = next_utf8_unsafe(pos, &code, "add_word_transliterations 2");
+    auto it = simple_rules.find(code);
+    if (it != simple_rules.end()) {
+      s += it->second;
+    } else {
+      append_utf8_character(s, code);
+    }
+  }
+  if (!s.empty()) {
+    result.push_back(std::move(s));
+  }
+}
+
+vector<string> get_word_transliterations(Slice word, bool allow_partial) {
+  vector<string> result;
+
+  add_word_transliterations(result, word, allow_partial, get_en_to_ru_simple_rules(), get_en_to_ru_complex_rules());
+  add_word_transliterations(result, word, allow_partial, get_ru_to_en_simple_rules(), get_ru_to_en_complex_rules());
+
+  std::sort(result.begin(), result.end());
+  result.erase(std::unique(result.begin(), result.end()), result.end());
+  return result;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/translit.h b/submodules/ton/tonlib-src/tdutils/td/utils/translit.h
new file mode 100644
index 0000000000..2dcfb34b0a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/translit.h
@@ -0,0 +1,28 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+
+namespace td {
+
+vector<string> get_word_transliterations(Slice word, bool allow_partial);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/type_traits.h b/submodules/ton/tonlib-src/tdutils/td/utils/type_traits.h
new file mode 100644
index 0000000000..c11316c8fa
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/type_traits.h
@@ -0,0 +1,42 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+namespace td {
+
+template <class FunctionT>
+struct member_function_class;
+
+template <class ReturnType, class Type, class... Args>
+struct member_function_class<ReturnType (Type::*)(Args...)> {
+  using type = Type;
+  static constexpr size_t argument_count() {
+    return sizeof...(Args);
+  }
+};
+
+template <class FunctionT>
+using member_function_class_t = typename member_function_class<FunctionT>::type;
+
+template <class FunctionT>
+constexpr size_t member_function_argument_count() {
+  return member_function_class<FunctionT>::argument_count();
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/uint128.h b/submodules/ton/tonlib-src/tdutils/td/utils/uint128.h
new file mode 100644
index 0000000000..08ba97b8c6
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/uint128.h
@@ -0,0 +1,302 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/bits.h"
+#include "td/utils/common.h"
+
+#include <limits>
+#include <type_traits>
+
+namespace td {
+
+class uint128_emulated {
+ public:
+  using uint128 = uint128_emulated;
+  uint128_emulated(uint64 hi, uint64 lo) : hi_(hi), lo_(lo) {
+  }
+  template <class T, typename = std::enable_if_t<std::is_unsigned<T>::value>>
+  uint128_emulated(T lo) : uint128_emulated(0, lo) {
+  }
+  uint128_emulated() = default;
+
+  uint64 hi() const {
+    return hi_;
+  }
+  uint64 lo() const {
+    return lo_;
+  }
+  uint64 rounded_hi() const {
+    return hi_ + (lo_ >> 63);
+  }
+  static uint128 from_signed(int64 x) {
+    if (x >= 0) {
+      return uint128(0, x);
+    }
+    return uint128(std::numeric_limits<uint64>::max(), static_cast<uint64>(x));
+  }
+  static uint128 from_unsigned(uint64 x) {
+    return uint128(0, x);
+  }
+
+  uint128 add(uint128 other) const {
+    uint128 res(other.hi() + hi(), other.lo() + lo());
+    if (res.lo() < lo()) {
+      res.hi_++;
+    }
+    return res;
+  }
+
+  uint128 shl(int cnt) const {
+    if (cnt == 0) {
+      return *this;
+    }
+    if (cnt < 64) {
+      return uint128((hi() << cnt) | (lo() >> (64 - cnt)), lo() << cnt);
+    }
+    if (cnt < 128) {
+      return uint128(lo() << (cnt - 64), 0);
+    }
+    return uint128();
+  }
+  uint128 shr(int cnt) const {
+    if (cnt == 0) {
+      return *this;
+    }
+    if (cnt < 64) {
+      return uint128(hi() >> cnt, (lo() >> cnt) | (hi() << (64 - cnt)));
+    }
+    if (cnt < 128) {
+      return uint128(0, hi() >> (cnt - 64));
+    }
+    return uint128();
+  }
+
+  uint128 mult(uint128 other) const {
+    uint64 a_lo = lo() & 0xffffffff;
+    uint64 a_hi = lo() >> 32;
+    uint64 b_lo = other.lo() & 0xffffffff;
+    uint64 b_hi = other.lo() >> 32;
+    uint128 res(lo() * other.hi() + hi() * other.lo() + a_hi * b_hi, a_lo * b_lo);
+    uint128 add1(0, a_lo * b_hi);
+    uint128 add2(0, a_hi * b_lo);
+    return res.add(add1.shl(32)).add(add2.shl(32));
+  }
+  uint128 mult(uint64 other) const {
+    return mult(uint128(0, other));
+  }
+  uint128 mult_signed(int64 other) const {
+    return mult(uint128::from_signed(other));
+  }
+  bool is_zero() const {
+    return lo() == 0 && hi() == 0;
+  }
+  uint128 sub(uint128 other) const {
+    uint32 carry = 0;
+    if (other.lo() > lo()) {
+      carry = 1;
+    }
+    return uint128(hi() - other.hi() - carry, lo() - other.lo());
+  }
+  void divmod(uint128 other, uint128 *div_res, uint128 *mod_res) const {
+    CHECK(!other.is_zero());
+
+    auto from = *this;
+    auto ctz = from.count_leading_zeroes();
+    auto other_ctz = other.count_leading_zeroes();
+    if (ctz > other_ctz) {
+      *div_res = uint128();
+      *mod_res = from;
+      return;
+    }
+    auto shift = other_ctz - ctz;
+    auto res = uint128();
+    for (int i = shift; i >= 0; i--) {
+      auto sub = other.shl(i);
+      res = res.shl(1);
+      if (from.greater_or_equal(sub)) {
+        from = from.sub(sub);
+        res = res.set_lower_bit();
+      }
+    }
+
+    *div_res = res;
+    *mod_res = from;
+  }
+  uint128 div(uint128 other) const {
+    uint128 a, b;
+    divmod(other, &a, &b);
+    return a;
+  }
+  uint128 mod(uint128 other) const {
+    uint128 a, b;
+    divmod(other, &a, &b);
+    return b;
+  }
+
+  void divmod_signed(int64 y, int64 *quot, int64 *rem) const {
+    CHECK(y != 0);
+    auto x = *this;
+    int x_sgn = x.is_negative();
+    int y_sgn = y < 0;
+    if (x_sgn) {
+      x = x.negate();
+    }
+    uint128 uy = from_signed(y);
+    if (uy.is_negative()) {
+      uy = uy.negate();
+    }
+
+    uint128 t_quot, t_mod;
+    x.divmod(uy, &t_quot, &t_mod);
+    *quot = t_quot.lo();
+    *rem = t_mod.lo();
+    if (x_sgn != y_sgn) {
+      *quot = -*quot;
+    }
+    if (x_sgn) {
+      *rem = -*rem;
+    }
+  }
+
+ private:
+  uint64 hi_{0};
+  uint64 lo_{0};
+
+  bool is_negative() const {
+    return (hi_ >> 63) == 1;
+  }
+
+  int32 count_leading_zeroes() const {
+    if (hi() == 0) {
+      return 64 + count_leading_zeroes64(lo());
+    }
+    return count_leading_zeroes64(hi());
+  }
+  uint128 set_lower_bit() const {
+    return uint128(hi(), lo() | 1);
+  }
+  bool greater_or_equal(uint128 other) const {
+    return hi() > other.hi() || (hi() == other.hi() && lo() >= other.lo());
+  }
+  uint128 negate() const {
+    uint128 res(~hi(), ~lo() + 1);
+    if (res.lo() == 0) {
+      return uint128(res.hi() + 1, 0);
+    }
+    return res;
+  }
+};
+
+#if TD_HAVE_INT128
+class uint128_intrinsic {
+ public:
+  using ValueT = unsigned __int128;
+  using uint128 = uint128_intrinsic;
+  explicit uint128_intrinsic(ValueT value) : value_(value) {
+  }
+  uint128_intrinsic(uint64 hi, uint64 lo) : value_((ValueT(hi) << 64) | lo) {
+  }
+  uint128_intrinsic() = default;
+
+  static uint128 from_signed(int64 x) {
+    return uint128(static_cast<ValueT>(x));
+  }
+  static uint128 from_unsigned(uint64 x) {
+    return uint128(static_cast<ValueT>(x));
+  }
+  uint64 hi() const {
+    return uint64(value() >> 64);
+  }
+  uint64 lo() const {
+    return uint64(value() & std::numeric_limits<uint64>::max());
+  }
+  uint64 rounded_hi() const {
+    return uint64((value() + (1ULL << 63)) >> 64);
+  }
+  uint128 add(uint128 other) const {
+    return uint128(value() + other.value());
+  }
+  uint128 sub(uint128 other) const {
+    return uint128(value() - other.value());
+  }
+
+  uint128 shl(int cnt) const {
+    if (cnt >= 128) {
+      return uint128();
+    }
+    return uint128(value() << cnt);
+  }
+
+  uint128 shr(int cnt) const {
+    if (cnt >= 128) {
+      return uint128();
+    }
+    return uint128(value() >> cnt);
+  }
+
+  uint128 mult(uint128 other) const {
+    return uint128(value() * other.value());
+  }
+  uint128 mult(uint64 other) const {
+    return uint128(value() * other);
+  }
+  uint128 mult_signed(int64 other) const {
+    return uint128(value() * other);
+  }
+  bool is_zero() const {
+    return value() == 0;
+  }
+  void divmod(uint128 other, uint128 *div_res, uint128 *mod_res) const {
+    CHECK(!other.is_zero());
+    *div_res = uint128(value() / other.value());
+    *mod_res = uint128(value() % other.value());
+  }
+  uint128 div(uint128 other) const {
+    CHECK(!other.is_zero());
+    return uint128(value() / other.value());
+  }
+  uint128 mod(uint128 other) const {
+    CHECK(!other.is_zero());
+    return uint128(value() % other.value());
+  }
+  void divmod_signed(int64 y, int64 *quot, int64 *rem) const {
+    CHECK(y != 0);
+    *quot = (int64)(signed_value() / y);
+    *rem = (int64)(signed_value() % y);
+  }
+
+ private:
+  unsigned __int128 value_{0};
+  ValueT value() const {
+    return value_;
+  }
+  __int128 signed_value() const {
+    return static_cast<__int128>(value());
+  }
+};
+#endif
+
+#if TD_HAVE_INT128
+using uint128 = uint128_intrinsic;
+#else
+using uint128 = uint128_emulated;
+#endif
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/unicode.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/unicode.cpp
new file mode 100644
index 0000000000..997ec7fc17
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/unicode.cpp
@@ -0,0 +1,1194 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/unicode.h"
+
+#include "td/utils/logging.h"
+
+#include <algorithm>
+#include <iterator>
+
+namespace td {
+
+// list of [(range_begin << 5) + range_type]
+static const uint32 unicode_simple_category_ranges[] = {
+    0,       1028,    1056,    1538,    1856,    2081,    2912,    3105,      3936,    5124,    5152,    5441,
+    5472,    5699,    5760,    5793,    5824,    5923,    5953,    5984,      6019,    6112,    6145,    6880,
+    6913,    7904,    7937,    22592,   22721,   23104,   23553,   23712,     23937,   23968,   24001,   24032,
+    28161,   28320,   28353,   28416,   28481,   28608,   28641,   28672,     28865,   28896,   28929,   29024,
+    29057,   29088,   29121,   29760,   29793,   32448,   32481,   36928,     37185,   42496,   42529,   43744,
+    43809,   43840,   44065,   45312,   47617,   48480,   48641,   48736,     50177,   51552,   52226,   52544,
+    52673,   52736,   52769,   55936,   55969,   56000,   56481,   56544,     56769,   56834,   57153,   57248,
+    57313,   57344,   57857,   57888,   57921,   58880,   59809,   62656,     63009,   63040,   63490,   63809,
+    64864,   65153,   65216,   65345,   65376,   65537,   66240,   66369,     66400,   66689,   66720,   66817,
+    66848,   67585,   68384,   70657,   71328,   71361,   71616,   73857,     75584,   75681,   75712,   76289,
+    76320,   76545,   76864,   76994,   77312,   77345,   77856,   77985,     78240,   78305,   78368,   78433,
+    79136,   79169,   79392,   79425,   79456,   79553,   79680,   79777,     79808,   80321,   80352,   80769,
+    80832,   80865,   80960,   81090,   81409,   81472,   81539,   81728,     82081,   82272,   82401,   82464,
+    82529,   83232,   83265,   83488,   83521,   83584,   83617,   83680,     83713,   83776,   84769,   84896,
+    84929,   84960,   85186,   85504,   85569,   85664,   86177,   86464,     86497,   86592,   86625,   87328,
+    87361,   87584,   87617,   87680,   87713,   87872,   87969,   88000,     88577,   88608,   89089,   89152,
+    89282,   89600,   89889,   89920,   90273,   90528,   90593,   90656,     90721,   91424,   91457,   91680,
+    91713,   91776,   91809,   91968,   92065,   92096,   93057,   93120,     93153,   93248,   93378,   93696,
+    93729,   93763,   93952,   94305,   94336,   94369,   94560,   94657,     94752,   94785,   94912,   95009,
+    95072,   95105,   95136,   95169,   95232,   95329,   95392,   95489,     95584,   95681,   96064,   96769,
+    96800,   97474,   97795,   97888,   98465,   98720,   98753,   98848,     98881,   99616,   99649,   100160,
+    100257,  100288,  101121,  101216,  101377,  101440,  101570,  101888,    102147,  102368,  102401,  102432,
+    102561,  102816,  102849,  102944,  102977,  103712,  103745,  104064,    104097,  104256,  104353,  104384,
+    105409,  105440,  105473,  105536,  105666,  105984,  106017,  106080,    106657,  106912,  106945,  107040,
+    107073,  108384,  108449,  108480,  108993,  109024,  109185,  109280,    109315,  109537,  109632,  109762,
+    110083,  110368,  110401,  110592,  110753,  111328,  111425,  112192,    112225,  112512,  112545,  112576,
+    112641,  112864,  113858,  114176,  114721,  116256,  116289,  116352,    116737,  116960,  117250,  117568,
+    118817,  118880,  118913,  118944,  119009,  119072,  119105,  119136,    119201,  119232,  119425,  119552,
+    119585,  119808,  119841,  119936,  119969,  120000,  120033,  120064,    120129,  120192,  120225,  120352,
+    120385,  120448,  120737,  120768,  120833,  120992,  121025,  121056,    121346,  121664,  121729,  121856,
+    122881,  122912,  123906,  124227,  124544,  124929,  125184,  125217,    126368,  127233,  127392,  131073,
+    132448,  133089,  133122,  133440,  133633,  133824,  133953,  134080,    134177,  134208,  134305,  134368,
+    134593,  134688,  134817,  135232,  135617,  135648,  135682,  136000,    136193,  137408,  137441,  137472,
+    137633,  137664,  137729,  139104,  139137,  149792,  149825,  149952,    150017,  150240,  150273,  150304,
+    150337,  150464,  150529,  151840,  151873,  152000,  152065,  153120,    153153,  153280,  153345,  153568,
+    153601,  153632,  153665,  153792,  153857,  154336,  154369,  156192,    156225,  156352,  156417,  158560,
+    159011,  159648,  159745,  160256,  160769,  163520,  163585,  163776,    163873,  183712,  183777,  184324,
+    184353,  185184,  185345,  187744,  187843,  187937,  188192,  188417,    188832,  188865,  188992,  189441,
+    190016,  190465,  191040,  191489,  191904,  191937,  192032,  192513,    194176,  195297,  195328,  195457,
+    195488,  195586,  195904,  196099,  196416,  197122,  197440,  197633,    200448,  200705,  200864,  200929,
+    202016,  202049,  202080,  202241,  204480,  204801,  205792,  207042,    207361,  208320,  208385,  208544,
+    208897,  210304,  210433,  211264,  211458,  211779,  211808,  212993,    213728,  214017,  215712,  217090,
+    217408,  217602,  217920,  218337,  218368,  221345,  222848,  223393,    223616,  223746,  224064,  225377,
+    226336,  226753,  226818,  227137,  228544,  229377,  230528,  231426,    231744,  231841,  231938,  232257,
+    233408,  233473,  233760,  236833,  236960,  236993,  237120,  237217,    237280,  237569,  243712,  245761,
+    254656,  254721,  254912,  254977,  256192,  256257,  256448,  256513,    256768,  256801,  256832,  256865,
+    256896,  256929,  256960,  256993,  257984,  258049,  259744,  259777,    260000,  260033,  260064,  260161,
+    260256,  260289,  260512,  260609,  260736,  260801,  260992,  261121,    261536,  261697,  261792,  261825,
+    262048,  262148,  262496,  263428,  263488,  263652,  263680,  265188,    265216,  265731,  265761,  265792,
+    265859,  266048,  266209,  266243,  266560,  266753,  267168,  270401,    270432,  270561,  270592,  270657,
+    270976,  271009,  271040,  271137,  271296,  271489,  271520,  271553,    271584,  271617,  271648,  271681,
+    271808,  271841,  272192,  272257,  272384,  272545,  272704,  272833,    272864,  272899,  274529,  274595,
+    274752,  297987,  299904,  302403,  303104,  323267,  324224,  360449,    361952,  361985,  363488,  363521,
+    367776,  367969,  368096,  368193,  368256,  368547,  368576,  368641,    369856,  369889,  369920,  370081,
+    370112,  370177,  371968,  372193,  372224,  372737,  373472,  373761,    373984,  374017,  374240,  374273,
+    374496,  374529,  374752,  374785,  375008,  375041,  375264,  375297,    375520,  375553,  375776,  378337,
+    378368,  393220,  393248,  393377,  393443,  393472,  394275,  394560,    394785,  394944,  395011,  395105,
+    395168,  395297,  398048,  398241,  398336,  398369,  401248,  401281,    401408,  401569,  402880,  402977,
+    405984,  406083,  406208,  406529,  407392,  409089,  409600,  410627,    410944,  411907,  412160,  412195,
+    412672,  413699,  414016,  415267,  415744,  425985,  636608,  638977,    1309376, 1310721, 1348000, 1350145,
+    1351616, 1351681, 1360288, 1360385, 1360898, 1361217, 1361280, 1361921,   1363424, 1363937, 1364928, 1364993,
+    1367235, 1367552, 1368801, 1369088, 1369153, 1372448, 1372513, 1373664,   1373697, 1373952, 1375969, 1376320,
+    1376353, 1376448, 1376481, 1376608, 1376641, 1377376, 1377795, 1377984,   1378305, 1379968, 1380417, 1382016,
+    1382914, 1383232, 1384001, 1384192, 1384289, 1384320, 1384353, 1384384,   1384450, 1384769, 1385664, 1385985,
+    1386720, 1387521, 1388448, 1388673, 1390176, 1391073, 1391106, 1391424,   1391617, 1391776, 1391809, 1392130,
+    1392449, 1392608, 1392641, 1393952, 1394689, 1394784, 1394817, 1395072,   1395202, 1395520, 1395713, 1396448,
+    1396545, 1396576, 1396673, 1398272, 1398305, 1398336, 1398433, 1398496,   1398561, 1398720, 1398785, 1398816,
+    1398849, 1398880, 1399649, 1399744, 1399809, 1400160, 1400385, 1400480,   1400865, 1401056, 1401121, 1401312,
+    1401377, 1401568, 1401857, 1402080, 1402113, 1402336, 1402369, 1403744,   1403777, 1404096, 1404417, 1408096,
+    1408514, 1408832, 1409025, 1766528, 1766913, 1767648, 1767777, 1769344,   2039809, 2051520, 2051585, 2054976,
+    2056193, 2056416, 2056801, 2056960, 2057121, 2057152, 2057185, 2057504,   2057537, 2057952, 2057985, 2058144,
+    2058177, 2058208, 2058241, 2058304, 2058337, 2058400, 2058433, 2061888,   2062945, 2074560, 2075137, 2077184,
+    2077249, 2078976, 2080257, 2080640, 2084353, 2084512, 2084545, 2088864,   2089474, 2089792, 2090017, 2090848,
+    2091041, 2091872, 2092225, 2095072, 2095169, 2095360, 2095425, 2095616,   2095681, 2095872, 2095937, 2096032,
+    2097153, 2097536, 2097569, 2098400, 2098433, 2099040, 2099073, 2099136,   2099169, 2099648, 2099713, 2100160,
+    2101249, 2105184, 2105571, 2107008, 2107395, 2109216, 2109763, 2109824,   2117633, 2118560, 2118657, 2120224,
+    2120739, 2121600, 2121729, 2122755, 2122880, 2123265, 2123811, 2123841,   2124099, 2124128, 2124289, 2125504,
+    2125825, 2126784, 2126849, 2128000, 2128129, 2128384, 2128419, 2128576,   2129921, 2134976, 2135042, 2135360,
+    2135553, 2136704, 2136833, 2137984, 2138113, 2139392, 2139649, 2141312,   2146305, 2156256, 2156545, 2157248,
+    2157569, 2157824, 2162689, 2162880, 2162945, 2162976, 2163009, 2164416,   2164449, 2164512, 2164609, 2164640,
+    2164705, 2165440, 2165507, 2165761, 2166496, 2166563, 2166785, 2167776,   2168035, 2168320, 2169857, 2170464,
+    2170497, 2170560, 2170723, 2170881, 2171587, 2171776, 2171905, 2172736,   2174977, 2176768, 2176899, 2176961,
+    2177027, 2177536, 2177603, 2179073, 2179104, 2179585, 2179712, 2179745,   2179840, 2179873, 2180736, 2181123,
+    2181376, 2182145, 2183075, 2183136, 2183169, 2184099, 2184192, 2185217,   2185472, 2185505, 2186400, 2186595,
+    2186752, 2187265, 2188992, 2189313, 2190016, 2190083, 2190337, 2190944,   2191107, 2191361, 2191936, 2192675,
+    2192896, 2195457, 2197792, 2199553, 2201184, 2201601, 2203232, 2203459,   2203648, 2214915, 2215904, 2228321,
+    2230016, 2230851, 2231490, 2231808, 2232417, 2233856, 2234881, 2235680,   2235906, 2236224, 2236513, 2237664,
+    2238146, 2238464, 2238977, 2240096, 2240193, 2240224, 2240609, 2242144,   2242593, 2242720, 2243074, 2243393,
+    2243424, 2243457, 2243488, 2243619, 2244256, 2244609, 2245184, 2245217,   2246016, 2248705, 2248928, 2248961,
+    2248992, 2249025, 2249152, 2249185, 2249664, 2249697, 2250016, 2250241,   2251744, 2252290, 2252608, 2252961,
+    2253216, 2253281, 2253344, 2253409, 2254112, 2254145, 2254368, 2254401,   2254464, 2254497, 2254656, 2254753,
+    2254784, 2255361, 2255392, 2255777, 2255936, 2260993, 2262688, 2263265,   2263392, 2263554, 2263872, 2265089,
+    2266624, 2267265, 2267328, 2267361, 2267392, 2267650, 2267968, 2273281,   2274784, 2276097, 2276224, 2277377,
+    2278912, 2279553, 2279584, 2279938, 2280256, 2281473, 2282848, 2283522,   2283840, 2285569, 2286400, 2287106,
+    2287427, 2287488, 2298881, 2300930, 2301251, 2301536, 2301921, 2301952,   2316289, 2318112, 2326529, 2326816,
+    2326849, 2328032, 2328577, 2328608, 2329090, 2329411, 2330016, 2330177,   2331136, 2359297, 2388800, 2392067,
+    2395616, 2396161, 2402432, 2490369, 2524640, 2654209, 2672864, 2949121,   2967328, 2967553, 2968544, 2968578,
+    2968896, 2972161, 2973120, 2973697, 2975232, 2975745, 2975872, 2976258,   2976576, 2976611, 2976832, 2976865,
+    2977536, 2977697, 2978304, 3006465, 3008672, 3009025, 3009056, 3011169,   3011584, 3013633, 3013664, 3014657,
+    3210656, 3211265, 3235424, 3538945, 3539008, 3637249, 3640672, 3640833,   3641248, 3641345, 3641632, 3641857,
+    3642176, 3828739, 3829312, 3833857, 3836576, 3836609, 3838880, 3838913,   3838976, 3839041, 3839072, 3839137,
+    3839200, 3839265, 3839392, 3839425, 3839808, 3839841, 3839872, 3839905,   3840128, 3840161, 3842240, 3842273,
+    3842400, 3842465, 3842720, 3842753, 3842976, 3843009, 3843904, 3843937,   3844064, 3844097, 3844256, 3844289,
+    3844320, 3844417, 3844640, 3844673, 3855552, 3855617, 3856416, 3856449,   3857248, 3857281, 3858272, 3858305,
+    3859104, 3859137, 3860128, 3860161, 3860960, 3860993, 3861984, 3862017,   3862816, 3862849, 3863840, 3863873,
+    3864672, 3864705, 3864960, 3865026, 3866624, 3997697, 4004000, 4004067,   4004352, 4005889, 4008064, 4008450,
+    4008768, 4046849, 4046976, 4047009, 4047872, 4047905, 4047968, 4048001,   4048032, 4048097, 4048128, 4048161,
+    4048480, 4048513, 4048640, 4048673, 4048704, 4048737, 4048768, 4048961,   4048992, 4049121, 4049152, 4049185,
+    4049216, 4049249, 4049280, 4049313, 4049408, 4049441, 4049504, 4049537,   4049568, 4049633, 4049664, 4049697,
+    4049728, 4049761, 4049792, 4049825, 4049856, 4049889, 4049920, 4049953,   4050016, 4050049, 4050080, 4050145,
+    4050272, 4050305, 4050528, 4050561, 4050688, 4050721, 4050848, 4050881,   4050912, 4050945, 4051264, 4051297,
+    4051840, 4052001, 4052096, 4052129, 4052288, 4052321, 4052864, 4071427,   4071840, 4194305, 5561056, 5562369,
+    5695136, 5695489, 5702592, 5702657, 5887040, 6225921, 6243264, 4294967295};
+
+static constexpr uint32 TABLE_SIZE = 1280;
+
+static const int16 prepare_search_character_table[TABLE_SIZE] = {
+    0,     32,   32,   32,   32,    32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,
+    32,    32,   32,   32,   32,    32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,
+    32,    32,   32,   32,   32,    32,   32,   32,   32,   32,   48,   49,   50,   51,   52,   53,   54,   55,   56,
+    57,    32,   32,   32,   32,    32,   32,   32,   97,   98,   99,   100,  101,  102,  103,  104,  105,  106,  107,
+    108,   109,  110,  111,  112,   113,  114,  115,  116,  117,  118,  119,  120,  121,  122,  32,   32,   32,   32,
+    32,    32,   97,   98,   99,    100,  101,  102,  103,  104,  105,  106,  107,  108,  109,  110,  111,  112,  113,
+    114,   115,  116,  117,  118,   119,  120,  121,  122,  32,   32,   32,   32,   32,   32,   32,   32,   32,   32,
+    32,    32,   32,   32,   32,    32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,
+    32,    32,   32,   32,   32,    32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   32,   170,
+    32,    32,   0,    32,   32,    32,   32,   178,  179,  32,   956,  32,   0,    32,   185,  186,  32,   188,  189,
+    190,   32,   224,  225,  226,   227,  228,  229,  230,  231,  232,  233,  234,  235,  236,  237,  238,  239,  240,
+    241,   242,  243,  244,  245,   246,  32,   248,  249,  250,  251,  252,  253,  254,  223,  224,  225,  226,  227,
+    228,   229,  230,  231,  232,   233,  234,  235,  236,  237,  238,  239,  240,  241,  242,  243,  244,  245,  246,
+    32,    248,  249,  250,  251,   252,  253,  254,  255,  257,  257,  259,  259,  261,  261,  263,  263,  265,  265,
+    267,   267,  269,  269,  271,   271,  273,  273,  275,  275,  277,  277,  279,  279,  281,  281,  283,  283,  285,
+    285,   287,  287,  289,  289,   291,  291,  293,  293,  295,  295,  297,  297,  299,  299,  301,  301,  303,  303,
+    105,   305,  307,  307,  309,   309,  311,  311,  312,  314,  314,  316,  316,  318,  318,  320,  320,  322,  322,
+    324,   324,  326,  326,  328,   328,  329,  331,  331,  333,  333,  335,  335,  337,  337,  339,  339,  341,  341,
+    343,   343,  345,  345,  347,   347,  349,  349,  351,  351,  353,  353,  355,  355,  357,  357,  359,  359,  361,
+    361,   363,  363,  365,  365,   367,  367,  369,  369,  371,  371,  373,  373,  375,  375,  255,  378,  378,  380,
+    380,   382,  382,  115,  384,   595,  387,  387,  389,  389,  596,  392,  392,  598,  599,  396,  396,  397,  477,
+    601,   603,  402,  402,  608,   611,  405,  617,  616,  409,  409,  410,  411,  623,  626,  414,  629,  417,  417,
+    419,   419,  421,  421,  640,   424,  424,  643,  426,  427,  429,  429,  648,  432,  432,  650,  651,  436,  436,
+    438,   438,  658,  441,  441,   442,  443,  445,  445,  446,  447,  448,  449,  450,  451,  454,  454,  454,  457,
+    457,   457,  460,  460,  460,   462,  462,  464,  464,  466,  466,  468,  468,  470,  470,  472,  472,  474,  474,
+    476,   476,  477,  479,  479,   481,  481,  483,  483,  485,  485,  487,  487,  489,  489,  491,  491,  493,  493,
+    495,   495,  496,  499,  499,   499,  501,  501,  405,  447,  505,  505,  507,  507,  509,  509,  511,  511,  513,
+    513,   515,  515,  517,  517,   519,  519,  521,  521,  523,  523,  525,  525,  527,  527,  529,  529,  531,  531,
+    533,   533,  535,  535,  537,   537,  539,  539,  541,  541,  543,  543,  414,  545,  547,  547,  549,  549,  551,
+    551,   553,  553,  555,  555,   557,  557,  559,  559,  561,  561,  563,  563,  564,  565,  566,  567,  568,  569,
+    11365, 572,  572,  410,  11366, 575,  576,  578,  578,  384,  649,  652,  583,  583,  585,  585,  587,  587,  589,
+    589,   591,  591,  592,  593,   594,  595,  596,  597,  598,  599,  600,  601,  602,  603,  604,  605,  606,  607,
+    608,   609,  610,  611,  612,   613,  614,  615,  616,  617,  618,  619,  620,  621,  622,  623,  624,  625,  626,
+    627,   628,  629,  630,  631,   632,  633,  634,  635,  636,  637,  638,  639,  640,  641,  642,  643,  644,  645,
+    646,   647,  648,  649,  650,   651,  652,  653,  654,  655,  656,  657,  658,  659,  660,  661,  662,  663,  664,
+    665,   666,  667,  668,  669,   670,  671,  672,  673,  674,  675,  676,  677,  678,  679,  680,  681,  682,  683,
+    684,   685,  686,  687,  688,   689,  690,  691,  692,  693,  694,  695,  696,  697,  698,  699,  0,    701,  0,
+    703,   704,  705,  32,   32,    32,   32,   710,  711,  712,  713,  714,  715,  716,  717,  718,  719,  720,  721,
+    32,    32,   32,   32,   32,    32,   32,   32,   32,   32,   32,   32,   32,   32,   736,  737,  738,  739,  740,
+    32,    32,   32,   32,   32,    32,   32,   748,  32,   750,  32,   32,   32,   32,   32,   32,   32,   32,   32,
+    32,    32,   32,   32,   32,    32,   32,   32,   0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,     0,    0,    0,    0,     0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,     0,    0,    0,    0,     0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,     0,    0,    0,    0,     0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,     837,  0,    0,    0,     0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,     0,    0,    0,    0,     0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,     0,    0,    0,    0,     0,    881,  881,  883,  883,  884,  32,   887,  887,  888,  889,  890,  891,  892,
+    893,   32,   1011, 896,  897,   898,  899,  32,   32,   940,  32,   941,  942,  943,  907,  972,  909,  973,  974,
+    912,   945,  946,  947,  948,   949,  950,  951,  952,  953,  954,  955,  956,  957,  958,  959,  960,  961,  930,
+    963,   964,  965,  966,  967,   968,  969,  970,  971,  940,  941,  942,  943,  944,  945,  946,  947,  948,  949,
+    950,   951,  952,  953,  954,   955,  956,  957,  958,  959,  960,  961,  963,  963,  964,  965,  966,  967,  968,
+    969,   970,  971,  972,  973,   974,  983,  946,  952,  965,  965,  965,  966,  960,  983,  985,  985,  987,  987,
+    989,   989,  991,  991,  993,   993,  995,  995,  997,  997,  999,  999,  1001, 1001, 1003, 1003, 1005, 1005, 1007,
+    1007,  954,  961,  963,  1011,  952,  949,  32,   1016, 1016, 1010, 1019, 1019, 1020, 891,  892,  893,  1104, 1105,
+    1106,  1107, 1108, 1109, 1110,  1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1072, 1073, 1074, 1075, 1076,
+    1077,  1078, 1079, 1080, 1081,  1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095,
+    1096,  1097, 1098, 1099, 1100,  1101, 1102, 1103, 1072, 1073, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1081, 1082,
+    1083,  1084, 1085, 1086, 1087,  1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101,
+    1102,  1103, 1104, 1105, 1106,  1107, 1108, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1121,
+    1121,  1123, 1123, 1125, 1125,  1127, 1127, 1129, 1129, 1131, 1131, 1133, 1133, 1135, 1135, 1137, 1137, 1139, 1139,
+    1141,  1141, 1143, 1143, 1145,  1145, 1147, 1147, 1149, 1149, 1151, 1151, 1153, 1153, 32,   0,    0,    0,    0,
+    0,     0,    0,    1163, 1163,  1165, 1165, 1167, 1167, 1169, 1169, 1171, 1171, 1173, 1173, 1175, 1175, 1177, 1177,
+    1179,  1179, 1181, 1181, 1183,  1183, 1185, 1185, 1187, 1187, 1189, 1189, 1191, 1191, 1193, 1193, 1195, 1195, 1197,
+    1197,  1199, 1199, 1201, 1201,  1203, 1203, 1205, 1205, 1207, 1207, 1209, 1209, 1211, 1211, 1213, 1213, 1215, 1215,
+    1231,  1218, 1218, 1220, 1220,  1222, 1222, 1224, 1224, 1226, 1226, 1228, 1228, 1230, 1230, 1231, 1233, 1233, 1235,
+    1235,  1237, 1237, 1239, 1239,  1241, 1241, 1243, 1243, 1245, 1245, 1247, 1247, 1249, 1249, 1251, 1251, 1253, 1253,
+    1255,  1255, 1257, 1257, 1259,  1259, 1261, 1261, 1263, 1263, 1265, 1265, 1267, 1267, 1269, 1269, 1271, 1271, 1273,
+    1273,  1275, 1275, 1277, 1277,  1279, 1279};
+
+static const int32 prepare_search_character_ranges[] = {
+    1280,   2097153, 1328,   1328,    1329,    -1378,   1367,    -1368,    1370,    32,      1376,       -1377,
+    1417,   32,      1419,   -1420,   1421,    32,      1424,    1424,     1425,    0,       1470,       32,
+    1471,   0,       1472,   32,      1473,    0,       1475,    32,       1476,    0,       1478,       32,
+    1479,   0,       1480,   -1481,   1523,    32,      1525,    -1526,    1536,    0,       1542,       32,
+    1552,   0,       1563,   32,      1564,    0,       1565,    1565,     1566,    32,      1568,       -1569,
+    1611,   0,       1632,   -1633,   1642,    32,      1646,    -1647,    1648,    0,       1649,       -1650,
+    1748,   32,      1749,   1749,    1750,    0,       1758,    32,       1759,    0,       1765,       -1766,
+    1767,   0,       1769,   32,      1770,    0,       1774,    -1775,    1789,    32,      1791,       1791,
+    1792,   32,      1806,   1806,    1807,    0,       1808,    1808,     1809,    0,       1810,       -1811,
+    1840,   0,       1867,   -1868,   1958,    0,       1969,    -1970,    2027,    0,       2036,       -2037,
+    2038,   32,      2042,   -2043,   2070,    0,       2074,    2074,     2075,    0,       2084,       2084,
+    2085,   0,       2088,   2088,    2089,    0,       2094,    -2095,    2096,    32,      2111,       -2112,
+    2137,   0,       2140,   -2141,   2142,    32,      2143,    -2144,    2260,    0,       2308,       -2309,
+    2362,   0,       2365,   2365,    2366,    0,       2384,    2384,     2385,    0,       2392,       -2393,
+    2402,   0,       2404,   32,      2406,    -2407,   2416,    32,       2417,    -2418,   2433,       0,
+    2436,   -2437,   2492,   0,       2493,    2493,    2494,    0,        2501,    -2502,   2503,       0,
+    2505,   -2506,   2507,   0,       2510,    -2511,   2519,    0,        2520,    -2521,   2530,       0,
+    2532,   -2533,   2546,   32,      2548,    -2549,   2554,    32,       2556,    -2557,   2561,       0,
+    2564,   -2565,   2620,   0,       2621,    2621,    2622,    0,        2627,    -2628,   2631,       0,
+    2633,   -2634,   2635,   0,       2638,    -2639,   2641,    0,        2642,    -2643,   2672,       0,
+    2674,   -2675,   2677,   0,       2678,    -2679,   2689,    0,        2692,    -2693,   2748,       0,
+    2749,   2749,    2750,   0,       2758,    2758,    2759,    0,        2762,    2762,    2763,       0,
+    2766,   -2767,   2786,   0,       2788,    -2789,   2800,    32,       2802,    -2803,   2817,       0,
+    2820,   -2821,   2876,   0,       2877,    2877,    2878,    0,        2885,    -2886,   2887,       0,
+    2889,   -2890,   2891,   0,       2894,    -2895,   2902,    0,        2904,    -2905,   2914,       0,
+    2916,   -2917,   2928,   32,      2929,    -2930,   2946,    0,        2947,    -2948,   3006,       0,
+    3011,   -3012,   3014,   0,       3017,    3017,    3018,    0,        3022,    -3023,   3031,       0,
+    3032,   -3033,   3059,   32,      3067,    -3068,   3072,    0,        3076,    -3077,   3134,       0,
+    3141,   3141,    3142,   0,       3145,    3145,    3146,    0,        3150,    -3151,   3157,       0,
+    3159,   -3160,   3170,   0,       3172,    -3173,   3199,    32,       3200,    3200,    3201,       0,
+    3204,   -3205,   3260,   0,       3261,    3261,    3262,    0,        3269,    3269,    3270,       0,
+    3273,   3273,    3274,   0,       3278,    -3279,   3285,    0,        3287,    -3288,   3298,       0,
+    3300,   -3301,   3329,   0,       3332,    -3333,   3390,    0,        3397,    3397,    3398,       0,
+    3401,   3401,    3402,   0,       3406,    3406,    3407,    32,       3408,    -3409,   3415,       0,
+    3416,   -3417,   3426,   0,       3428,    -3429,   3449,    32,       3450,    -3451,   3458,       0,
+    3460,   -3461,   3530,   0,       3531,    -3532,   3535,    0,        3541,    3541,    3542,       0,
+    3543,   3543,    3544,   0,       3552,    -3553,   3570,    0,        3572,    32,      3573,       -3574,
+    3633,   0,       3634,   -3635,   3636,    0,       3643,    -3644,    3647,    32,      3648,       -3649,
+    3655,   0,       3663,   32,      3664,    -3665,   3674,    32,       3676,    -3677,   3761,       0,
+    3762,   -3763,   3764,   0,       3770,    3770,    3771,    0,        3773,    -3774,   3784,       0,
+    3790,   -3791,   3841,   32,      3864,    0,       3866,    32,       3872,    -3873,   3892,       32,
+    3893,   0,       3894,   32,      3895,    0,       3896,    32,       3897,    0,       3898,       32,
+    3902,   0,       3904,   -3905,   3953,    0,       3973,    32,       3974,    0,       3976,       -3977,
+    3981,   0,       3992,   3992,    3993,    0,       4029,    4029,     4030,    32,      4038,       0,
+    4039,   32,      4045,   4045,    4046,    32,      4059,    -4060,    4139,    0,       4159,       -4160,
+    4170,   32,      4176,   -4177,   4182,    0,       4186,    -4187,    4190,    0,       4193,       4193,
+    4194,   0,       4197,   -4198,   4199,    0,       4206,    -4207,    4209,    0,       4213,       -4214,
+    4226,   0,       4238,   4238,    4239,    0,       4240,    -4241,    4250,    0,       4254,       32,
+    4256,   -11521,  4294,   4294,    4295,    11559,   4296,    -4297,    4301,    11565,   4302,       -4303,
+    4347,   32,      4348,   -4349,   4957,    0,       4960,    32,       4969,    -4970,   5008,       32,
+    5018,   -5019,   5112,   -5105,   5118,    -5119,   5120,    32,       5121,    -5122,   5741,       32,
+    5743,   -5744,   5760,   32,      5761,    -5762,   5787,    32,       5789,    -5790,   5867,       32,
+    5870,   -5871,   5906,   0,       5909,    -5910,   5938,    0,        5941,    32,      5943,       -5944,
+    5970,   0,       5972,   -5973,   6002,    0,       6004,    -6005,    6068,    0,       6100,       32,
+    6103,   6103,    6104,   32,      6108,    6108,    6109,    0,        6110,    -6111,   6144,       32,
+    6155,   0,       6159,   -6160,   6277,    0,       6279,    -6280,    6313,    0,       6314,       -6315,
+    6432,   0,       6444,   -6445,   6448,    0,       6460,    -6461,    6464,    32,      6465,       -6466,
+    6468,   32,      6470,   -6471,   6622,    32,      6656,    -6657,    6679,    0,       6684,       -6685,
+    6686,   32,      6688,   -6689,   6741,    0,       6751,    6751,     6752,    0,       6781,       -6782,
+    6783,   0,       6784,   -6785,   6816,    32,      6823,    6823,     6824,    32,      6830,       -6831,
+    6832,   0,       6847,   -6848,   6912,    0,       6917,    -6918,    6964,    0,       6981,       -6982,
+    7002,   32,      7019,   0,       7028,    32,      7037,    -7038,    7040,    0,       7043,       -7044,
+    7073,   0,       7086,   -7087,   7142,    0,       7156,    -7157,    7164,    32,      7168,       -7169,
+    7204,   0,       7224,   -7225,   7227,    32,      7232,    -7233,    7294,    32,      7296,       1074,
+    7297,   1076,    7298,   1086,    7299,    -1090,   7301,    1090,     7302,    1098,    7303,       1123,
+    7304,   42571,   7305,   -7306,   7360,    32,      7368,    -7369,    7376,    0,       7379,       32,
+    7380,   0,       7401,   -7402,   7405,    0,       7406,    -7407,    7410,    0,       7413,       -7414,
+    7416,   0,       7418,   -7419,   7468,    97,      7469,    230,      7470,    98,      7471,       7471,
+    7472,   -101,    7474,   477,     7475,    -104,    7483,    7483,     7484,    111,     7485,       547,
+    7486,   112,     7487,   114,     7488,    -117,    7490,    119,      7491,    -7492,   7616,       0,
+    7670,   -7671,   7675,   0,       7680,    2097153, 7830,    -7831,    7835,    7777,    7836,       -7837,
+    7838,   223,     7839,   2097153, 7936,    -7937,   7944,    -7937,    7952,    -7953,   7960,       -7953,
+    7966,   -7967,   7976,   -7969,   7984,    -7985,   7992,    -7985,    8000,    -8001,   8008,       -8001,
+    8014,   -8015,   8025,   8017,    8026,    8026,    8027,    8019,     8028,    8028,    8029,       8021,
+    8030,   8030,    8031,   8023,    8032,    -8033,   8040,    -8033,    8048,    -8049,   8072,       -8065,
+    8080,   -8081,   8088,   -8081,   8096,    -8097,   8104,    -8097,    8112,    -8113,   8120,       -8113,
+    8122,   -8049,   8124,   8115,    8125,    32,      8126,    953,      8127,    32,      8130,       -8131,
+    8136,   -8051,   8140,   8131,    8141,    32,      8144,    -8145,    8152,    -8145,   8154,       -8055,
+    8156,   8156,    8157,   32,      8160,    -8161,   8168,    -8161,    8170,    -8059,   8172,       8165,
+    8173,   32,      8176,   -8177,   8184,    -8057,   8186,    -8061,    8188,    8179,    8189,       32,
+    8191,   8191,    8192,   32,      8203,    0,       8208,    32,       8234,    0,       8239,       32,
+    8288,   0,       8293,   8293,    8294,    0,       8304,    -8305,    8314,    32,      8319,       -8320,
+    8330,   32,      8335,   -8336,   8352,    32,      8383,    -8384,    8400,    0,       8433,       -8434,
+    8448,   32,      8450,   99,      8452,    32,      8455,    603,      8456,    32,      8457,       102,
+    8458,   8458,    8459,   104,     8462,    -8463,   8464,    105,      8466,    108,     8467,       8467,
+    8468,   32,      8469,   110,     8470,    32,      8473,    -113,     8476,    114,     8478,       32,
+    8484,   122,     8485,   32,      8486,    969,     8487,    32,       8488,    122,     8489,       32,
+    8490,   107,     8491,   229,     8492,    -99,     8494,    32,       8495,    8495,    8496,       -102,
+    8498,   8526,    8499,   109,     8500,    -8501,   8506,    32,       8508,    -8509,   8510,       947,
+    8511,   960,     8512,   32,      8517,    100,     8518,    -8519,    8522,    32,      8526,       8526,
+    8527,   32,      8528,   -8529,   8544,    -8561,   8560,    -8561,    8579,    8580,    8581,       -8582,
+    8586,   32,      8588,   -8589,   8592,    32,      9215,    9215,     9216,    32,      9255,       -9256,
+    9280,   32,      9291,   -9292,   9372,    32,      9398,    -9425,    9424,    -9425,   9472,       32,
+    10102,  -10103,  10132,  32,      11124,   -11125,  11126,   32,       11158,   -11159,  11160,      32,
+    11194,  -11195,  11197,  32,      11209,   11209,   11210,   32,       11218,   -11219,  11244,      32,
+    11248,  -11249,  11264,  -11313,  11311,   -11312,  11360,   11361,    11362,   619,     11363,      7549,
+    11364,  637,     11365,  -11366,  11367,   11368,   11369,   11370,    11371,   11372,   11373,      593,
+    11374,  625,     11375,  592,     11376,   594,     11377,   2097153,  11380,   11380,   11381,      11382,
+    11383,  -11384,  11389,  118,     11390,   -576,    11392,   2097153,  11492,   11492,   11493,      32,
+    11499,  11500,   11501,  11502,   11503,   0,       11506,   11507,    11508,   -11509,  11513,      32,
+    11517,  11517,   11518,  32,      11520,   -11521,  11632,   32,       11633,   -11634,  11647,      0,
+    11648,  -11649,  11744,  0,       11776,   32,      11823,   11823,    11824,   32,      11845,      -11846,
+    11904,  32,      11930,  11930,   11931,   32,      11935,   11935,    11936,   32,      12019,      -12020,
+    12272,  32,      12284,  -12285,  12288,   32,      12293,   -12294,   12296,   32,      12321,      -12322,
+    12330,  0,       12336,  32,      12337,   -12338,  12342,   32,       12344,   -12345,  12349,      32,
+    12352,  -12353,  12441,  0,       12443,   32,      12445,   -12446,   12448,   32,      12449,      -12450,
+    12539,  32,      12540,  0,       12541,   -12542,  12688,   32,       12690,   -12691,  12736,      32,
+    12772,  -12773,  12800,  32,      12831,   -12832,  12842,   32,       12868,   -12869,  12880,      32,
+    12881,  -12882,  12910,  32,      12928,   -12929,  12992,   32,       13008,   -13009,  13056,      32,
+    13312,  -13313,  19904,  32,      19968,   -19969,  42128,   32,       42183,   -42184,  42238,      32,
+    42240,  -42241,  42509,  32,      42512,   -42513,  42560,   2097153,  42606,   42606,   42607,      0,
+    42611,  32,      42612,  0,       42622,   32,      42623,   2097153,  42652,   -42653,  42654,      0,
+    42656,  -42657,  42736,  0,       42738,   32,      42744,   -42745,   42752,   32,      42775,      -42776,
+    42784,  32,      42786,  2097153, 42800,   -42801,  42802,   2097153,  42864,   -42865,  42873,      42874,
+    42875,  42876,   42877,  7545,    42878,   2097153, 42888,   42888,    42889,   32,      42891,      42892,
+    42893,  613,     42894,  -42895,  42896,   2097153, 42900,   -42901,   42902,   2097153, 42922,      614,
+    42923,  604,     42924,  609,     42925,   620,     42926,   618,      42927,   42927,   42928,      670,
+    42929,  647,     42930,  669,     42931,   43859,   42932,   2097153,  42936,   -42937,  43000,      295,
+    43001,  -43002,  43010,  0,       43011,   -43012,  43014,   0,        43015,   -43016,  43019,      0,
+    43020,  -43021,  43043,  0,       43048,   32,      43052,   -43053,   43062,   32,      43066,      -43067,
+    43124,  32,      43128,  -43129,  43136,   0,       43138,   -43139,   43188,   0,       43206,      -43207,
+    43214,  32,      43216,  -43217,  43232,   0,       43250,   -43251,   43256,   32,      43259,      43259,
+    43260,  32,      43261,  -43262,  43302,   0,       43310,   32,       43312,   -43313,  43335,      0,
+    43348,  -43349,  43359,  32,      43360,   -43361,  43392,   0,        43396,   -43397,  43443,      0,
+    43457,  32,      43470,  -43471,  43486,   32,      43488,   -43489,   43493,   0,       43494,      -43495,
+    43561,  0,       43575,  -43576,  43587,   0,       43588,   -43589,   43596,   0,       43598,      -43599,
+    43612,  32,      43616,  -43617,  43639,   32,      43642,   43642,    43643,   0,       43646,      -43647,
+    43696,  0,       43697,  43697,   43698,   0,       43701,   -43702,   43703,   0,       43705,      -43706,
+    43710,  0,       43712,  43712,   43713,   0,       43714,   -43715,   43742,   32,      43744,      -43745,
+    43755,  0,       43760,  32,      43762,   -43763,  43765,   0,        43767,   -43768,  43867,      32,
+    43868,  -43869,  43888,  -5025,   43968,   -43969,  44003,   0,        44011,   32,      44012,      0,
+    44014,  -44015,  55296,  0,       57344,   -57345,  64286,   0,        64287,   -64288,  64297,      32,
+    64298,  -64299,  64434,  32,      64450,   -64451,  64830,   32,       64832,   -64833,  64976,      32,
+    65008,  -65009,  65020,  32,      65022,   -65023,  65024,   0,        65040,   32,      65050,      -65051,
+    65056,  0,       65072,  32,      65107,   65107,   65108,   32,       65127,   65127,   65128,      32,
+    65132,  -65133,  65279,  0,       65280,   65280,   65281,   32,       65296,   -65297,  65306,      32,
+    65313,  -65346,  65339,  32,      65345,   -65346,  65371,   32,       65382,   -65383,  65504,      32,
+    65511,  65511,   65512,  32,      65519,   -65520,  65529,   0,        65532,   32,      65536,      -65537,
+    65792,  32,      65795,  -65796,  65847,   32,      65856,   -65857,   65913,   32,      65930,      -65931,
+    65932,  32,      65935,  65935,   65936,   32,      65948,   -65949,   65952,   32,      65953,      -65954,
+    66000,  32,      66045,  0,       66046,   -66047,  66272,   0,        66273,   -66274,  66422,      0,
+    66427,  -66428,  66463,  32,      66464,   -66465,  66512,   32,       66513,   -66514,  66560,      -66601,
+    66600,  -66601,  66736,  -66777,  66772,   -66773,  66927,   32,       66928,   -66929,  67671,      32,
+    67672,  -67673,  67703,  32,      67705,   -67706,  67871,   32,       67872,   -67873,  67903,      32,
+    67904,  -67905,  68097,  0,       68100,   68100,   68101,   0,        68103,   -68104,  68108,      0,
+    68112,  -68113,  68152,  0,       68155,   -68156,  68159,   0,        68160,   -68161,  68176,      32,
+    68185,  -68186,  68223,  32,      68224,   -68225,  68296,   32,       68297,   -68298,  68325,      0,
+    68327,  -68328,  68336,  32,      68343,   -68344,  68409,   32,       68416,   -68417,  68505,      32,
+    68509,  -68510,  68736,  -68801,  68787,   -68788,  69632,   0,        69635,   -69636,  69688,      0,
+    69703,  32,      69710,  -69711,  69759,   0,       69763,   -69764,   69808,   0,       69819,      32,
+    69821,  0,       69822,  32,      69826,   -69827,  69888,   0,        69891,   -69892,  69927,      0,
+    69941,  -69942,  69952,  32,      69956,   -69957,  70003,   0,        70004,   32,      70006,      -70007,
+    70016,  0,       70019,  -70020,  70067,   0,       70081,   -70082,   70085,   32,      70090,      0,
+    70093,  32,      70094,  -70095,  70107,   32,      70108,   70108,    70109,   32,      70112,      -70113,
+    70188,  0,       70200,  32,      70206,   0,       70207,   -70208,   70313,   32,      70314,      -70315,
+    70367,  0,       70379,  -70380,  70400,   0,       70404,   -70405,   70460,   0,       70461,      70461,
+    70462,  0,       70469,  -70470,  70471,   0,       70473,   -70474,   70475,   0,       70478,      -70479,
+    70487,  0,       70488,  -70489,  70498,   0,       70500,   -70501,   70502,   0,       70509,      -70510,
+    70512,  0,       70517,  -70518,  70709,   0,       70727,   -70728,   70731,   32,      70736,      -70737,
+    70747,  32,      70748,  70748,   70749,   32,      70750,   -70751,   70832,   0,       70852,      -70853,
+    70854,  32,      70855,  -70856,  71087,   0,       71094,   -71095,   71096,   0,       71105,      32,
+    71128,  -71129,  71132,  0,       71134,   -71135,  71216,   0,        71233,   32,      71236,      -71237,
+    71264,  32,      71277,  -71278,  71339,   0,       71352,   -71353,   71453,   0,       71468,      -71469,
+    71484,  32,      71488,  -71489,  71840,   -71873,  71872,   -71873,   72751,   0,       72759,      72759,
+    72760,  0,       72768,  72768,   72769,   32,      72774,   -72775,   72816,   32,      72818,      -72819,
+    72850,  0,       72872,  72872,   72873,   0,       72887,   -72888,   74864,   32,      74869,      -74870,
+    92782,  32,      92784,  -92785,  92912,   0,       92917,   32,       92918,   -92919,  92976,      0,
+    92983,  32,      92992,  -92993,  92996,   32,      92998,   -92999,   94033,   0,       94079,      -94080,
+    94095,  0,       94099,  -94100,  113820,  32,      113821,  0,        113823,  32,      113824,     0,
+    113828, -113829, 118784, 32,      119030,  -119031, 119040,  32,       119079,  -119080, 119081,     32,
+    119141, 0,       119146, 32,      119149,  0,       119171,  32,       119173,  0,       119180,     32,
+    119210, 0,       119214, 32,      119273,  -119274, 119296,  32,       119362,  0,       119365,     32,
+    119366, -119367, 119552, 32,      119639,  -119640, 119808,  -98,      119834,  -119835, 119860,     -98,
+    119886, -119887, 119912, -98,     119938,  -119939, 119964,  97,       119965,  119965,  119966,     -100,
+    119968, -119969, 119970, 103,     119971,  -119972, 119973,  -107,     119975,  -119976, 119977,     -111,
+    119981, 119981,  119982, -116,    119990,  -119991, 120016,  -98,      120042,  -120043, 120068,     -98,
+    120070, 120070,  120071, -101,    120075,  -120076, 120077,  -107,     120085,  120085,  120086,     -116,
+    120093, -120094, 120120, -98,     120122,  120122,  120123,  -101,     120127,  120127,  120128,     -106,
+    120133, 120133,  120134, 111,     120135,  -120136, 120138,  -116,     120145,  -120146, 120172,     -98,
+    120198, -120199, 120224, -98,     120250,  -120251, 120276,  -98,      120302,  -120303, 120328,     -98,
+    120354, -120355, 120380, -98,     120406,  -120407, 120432,  -98,      120458,  -120459, 120488,     -946,
+    120505, 952,     120506, -964,    120513,  32,      120514,  -120515,  120531,  963,     120532,     -120533,
+    120539, 32,      120540, -120541, 120546,  -946,    120563,  952,      120564,  -964,    120571,     32,
+    120572, -120573, 120589, 963,     120590,  -120591, 120597,  32,       120598,  -120599, 120604,     -946,
+    120621, 952,     120622, -964,    120629,  32,      120630,  -120631,  120647,  963,     120648,     -120649,
+    120655, 32,      120656, -120657, 120662,  -946,    120679,  952,      120680,  -964,    120687,     32,
+    120688, -120689, 120705, 963,     120706,  -120707, 120713,  32,       120714,  -120715, 120720,     -946,
+    120737, 952,     120738, -964,    120745,  32,      120746,  -120747,  120763,  963,     120764,     -120765,
+    120771, 32,      120772, -120773, 120778,  989,     120779,  -120780,  120832,  32,      121344,     0,
+    121399, 32,      121403, 0,       121453,  32,      121461,  0,        121462,  32,      121476,     0,
+    121477, 32,      121484, -121485, 121499,  0,       121504,  121504,   121505,  0,       121520,     -121521,
+    122880, 0,       122887, 122887,  122888,  0,       122905,  -122906,  122907,  0,       122914,     122914,
+    122915, 0,       122917, 122917,  122918,  0,       122923,  -122924,  125136,  0,       125143,     -125144,
+    125184, -125219, 125218, -125219, 125252,  0,       125259,  -125260,  125278,  32,      125280,     -125281,
+    126704, 32,      126706, -126707, 126976,  32,      127020,  -127021,  127024,  32,      127124,     -127125,
+    127136, 32,      127151, -127152, 127153,  32,      127168,  127168,   127169,  32,      127184,     127184,
+    127185, 32,      127222, -127223, 127248,  32,      127275,  99,       127276,  114,     127277,     32,
+    127279, 127279,  127280, -98,     127306,  32,      127340,  -127341,  127344,  32,      127405,     -127406,
+    127462, 32,      127490, -127491, 127552,  32,      127561,  -127562,  127744,  32,      128723,     -128724,
+    128736, 32,      128749, -128750, 128752,  32,      128759,  -128760,  128768,  32,      128884,     -128885,
+    128896, 32,      128981, -128982, 129024,  32,      129036,  -129037,  129040,  32,      129096,     -129097,
+    129104, 32,      129114, -129115, 129120,  32,      129160,  -129161,  129168,  32,      129198,     -129199,
+    129296, 32,      129311, 129311,  129312,  32,      129320,  -129321,  129328,  32,      129329,     -129330,
+    129331, 32,      129343, 129343,  129344,  32,      129356,  -129357,  129360,  32,      129375,     -129376,
+    129408, 32,      129426, -129427, 129472,  32,      129473,  -129474,  131070,  32,      131072,     -131073,
+    196606, 32,      196608, -196609, 262142,  32,      262144,  -262145,  327678,  32,      327680,     -327681,
+    393214, 32,      393216, -393217, 458750,  32,      458752,  -458753,  524286,  32,      524288,     -524289,
+    589822, 32,      589824, -589825, 655358,  32,      655360,  -655361,  720894,  32,      720896,     -720897,
+    786430, 32,      786432, -786433, 851966,  32,      851968,  -851969,  917502,  32,      917504,     917504,
+    917505, 0,       917506, -917507, 917536,  0,       917632,  -917633,  917760,  0,       918000,     -918001,
+    983038, 32,      983040, -983041, 1048574, 32,      1048576, -1048577, 1114110, 32,      2147483647, 0};
+
+static const int16 to_lower_table[TABLE_SIZE] = {
+    0,     1,    2,    3,    4,     5,    6,    7,    8,    9,    10,   11,   12,   13,   14,   15,   16,   17,   18,
+    19,    20,   21,   22,   23,    24,   25,   26,   27,   28,   29,   30,   31,   32,   33,   34,   35,   36,   37,
+    38,    39,   40,   41,   42,    43,   44,   45,   46,   47,   48,   49,   50,   51,   52,   53,   54,   55,   56,
+    57,    58,   59,   60,   61,    62,   63,   64,   97,   98,   99,   100,  101,  102,  103,  104,  105,  106,  107,
+    108,   109,  110,  111,  112,   113,  114,  115,  116,  117,  118,  119,  120,  121,  122,  91,   92,   93,   94,
+    95,    96,   97,   98,   99,    100,  101,  102,  103,  104,  105,  106,  107,  108,  109,  110,  111,  112,  113,
+    114,   115,  116,  117,  118,   119,  120,  121,  122,  123,  124,  125,  126,  127,  128,  129,  130,  131,  132,
+    133,   134,  135,  136,  137,   138,  139,  140,  141,  142,  143,  144,  145,  146,  147,  148,  149,  150,  151,
+    152,   153,  154,  155,  156,   157,  158,  159,  160,  161,  162,  163,  164,  165,  166,  167,  168,  169,  170,
+    171,   172,  173,  174,  175,   176,  177,  178,  179,  180,  181,  182,  183,  184,  185,  186,  187,  188,  189,
+    190,   191,  224,  225,  226,   227,  228,  229,  230,  231,  232,  233,  234,  235,  236,  237,  238,  239,  240,
+    241,   242,  243,  244,  245,   246,  215,  248,  249,  250,  251,  252,  253,  254,  223,  224,  225,  226,  227,
+    228,   229,  230,  231,  232,   233,  234,  235,  236,  237,  238,  239,  240,  241,  242,  243,  244,  245,  246,
+    247,   248,  249,  250,  251,   252,  253,  254,  255,  257,  257,  259,  259,  261,  261,  263,  263,  265,  265,
+    267,   267,  269,  269,  271,   271,  273,  273,  275,  275,  277,  277,  279,  279,  281,  281,  283,  283,  285,
+    285,   287,  287,  289,  289,   291,  291,  293,  293,  295,  295,  297,  297,  299,  299,  301,  301,  303,  303,
+    105,   305,  307,  307,  309,   309,  311,  311,  312,  314,  314,  316,  316,  318,  318,  320,  320,  322,  322,
+    324,   324,  326,  326,  328,   328,  329,  331,  331,  333,  333,  335,  335,  337,  337,  339,  339,  341,  341,
+    343,   343,  345,  345,  347,   347,  349,  349,  351,  351,  353,  353,  355,  355,  357,  357,  359,  359,  361,
+    361,   363,  363,  365,  365,   367,  367,  369,  369,  371,  371,  373,  373,  375,  375,  255,  378,  378,  380,
+    380,   382,  382,  383,  384,   595,  387,  387,  389,  389,  596,  392,  392,  598,  599,  396,  396,  397,  477,
+    601,   603,  402,  402,  608,   611,  405,  617,  616,  409,  409,  410,  411,  623,  626,  414,  629,  417,  417,
+    419,   419,  421,  421,  640,   424,  424,  643,  426,  427,  429,  429,  648,  432,  432,  650,  651,  436,  436,
+    438,   438,  658,  441,  441,   442,  443,  445,  445,  446,  447,  448,  449,  450,  451,  454,  454,  454,  457,
+    457,   457,  460,  460,  460,   462,  462,  464,  464,  466,  466,  468,  468,  470,  470,  472,  472,  474,  474,
+    476,   476,  477,  479,  479,   481,  481,  483,  483,  485,  485,  487,  487,  489,  489,  491,  491,  493,  493,
+    495,   495,  496,  499,  499,   499,  501,  501,  405,  447,  505,  505,  507,  507,  509,  509,  511,  511,  513,
+    513,   515,  515,  517,  517,   519,  519,  521,  521,  523,  523,  525,  525,  527,  527,  529,  529,  531,  531,
+    533,   533,  535,  535,  537,   537,  539,  539,  541,  541,  543,  543,  414,  545,  547,  547,  549,  549,  551,
+    551,   553,  553,  555,  555,   557,  557,  559,  559,  561,  561,  563,  563,  564,  565,  566,  567,  568,  569,
+    11365, 572,  572,  410,  11366, 575,  576,  578,  578,  384,  649,  652,  583,  583,  585,  585,  587,  587,  589,
+    589,   591,  591,  592,  593,   594,  595,  596,  597,  598,  599,  600,  601,  602,  603,  604,  605,  606,  607,
+    608,   609,  610,  611,  612,   613,  614,  615,  616,  617,  618,  619,  620,  621,  622,  623,  624,  625,  626,
+    627,   628,  629,  630,  631,   632,  633,  634,  635,  636,  637,  638,  639,  640,  641,  642,  643,  644,  645,
+    646,   647,  648,  649,  650,   651,  652,  653,  654,  655,  656,  657,  658,  659,  660,  661,  662,  663,  664,
+    665,   666,  667,  668,  669,   670,  671,  672,  673,  674,  675,  676,  677,  678,  679,  680,  681,  682,  683,
+    684,   685,  686,  687,  688,   689,  690,  691,  692,  693,  694,  695,  696,  697,  698,  699,  700,  701,  702,
+    703,   704,  705,  706,  707,   708,  709,  710,  711,  712,  713,  714,  715,  716,  717,  718,  719,  720,  721,
+    722,   723,  724,  725,  726,   727,  728,  729,  730,  731,  732,  733,  734,  735,  736,  737,  738,  739,  740,
+    741,   742,  743,  744,  745,   746,  747,  748,  749,  750,  751,  752,  753,  754,  755,  756,  757,  758,  759,
+    760,   761,  762,  763,  764,   765,  766,  767,  768,  769,  770,  771,  772,  773,  774,  775,  776,  777,  778,
+    779,   780,  781,  782,  783,   784,  785,  786,  787,  788,  789,  790,  791,  792,  793,  794,  795,  796,  797,
+    798,   799,  800,  801,  802,   803,  804,  805,  806,  807,  808,  809,  810,  811,  812,  813,  814,  815,  816,
+    817,   818,  819,  820,  821,   822,  823,  824,  825,  826,  827,  828,  829,  830,  831,  832,  833,  834,  835,
+    836,   837,  838,  839,  840,   841,  842,  843,  844,  845,  846,  847,  848,  849,  850,  851,  852,  853,  854,
+    855,   856,  857,  858,  859,   860,  861,  862,  863,  864,  865,  866,  867,  868,  869,  870,  871,  872,  873,
+    874,   875,  876,  877,  878,   879,  881,  881,  883,  883,  884,  885,  887,  887,  888,  889,  890,  891,  892,
+    893,   894,  1011, 896,  897,   898,  899,  900,  901,  940,  903,  941,  942,  943,  907,  972,  909,  973,  974,
+    912,   945,  946,  947,  948,   949,  950,  951,  952,  953,  954,  955,  956,  957,  958,  959,  960,  961,  930,
+    963,   964,  965,  966,  967,   968,  969,  970,  971,  940,  941,  942,  943,  944,  945,  946,  947,  948,  949,
+    950,   951,  952,  953,  954,   955,  956,  957,  958,  959,  960,  961,  962,  963,  964,  965,  966,  967,  968,
+    969,   970,  971,  972,  973,   974,  983,  976,  977,  978,  979,  980,  981,  982,  983,  985,  985,  987,  987,
+    989,   989,  991,  991,  993,   993,  995,  995,  997,  997,  999,  999,  1001, 1001, 1003, 1003, 1005, 1005, 1007,
+    1007,  1008, 1009, 1010, 1011,  952,  1013, 1014, 1016, 1016, 1010, 1019, 1019, 1020, 891,  892,  893,  1104, 1105,
+    1106,  1107, 1108, 1109, 1110,  1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1072, 1073, 1074, 1075, 1076,
+    1077,  1078, 1079, 1080, 1081,  1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095,
+    1096,  1097, 1098, 1099, 1100,  1101, 1102, 1103, 1072, 1073, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1081, 1082,
+    1083,  1084, 1085, 1086, 1087,  1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101,
+    1102,  1103, 1104, 1105, 1106,  1107, 1108, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1121,
+    1121,  1123, 1123, 1125, 1125,  1127, 1127, 1129, 1129, 1131, 1131, 1133, 1133, 1135, 1135, 1137, 1137, 1139, 1139,
+    1141,  1141, 1143, 1143, 1145,  1145, 1147, 1147, 1149, 1149, 1151, 1151, 1153, 1153, 1154, 1155, 1156, 1157, 1158,
+    1159,  1160, 1161, 1163, 1163,  1165, 1165, 1167, 1167, 1169, 1169, 1171, 1171, 1173, 1173, 1175, 1175, 1177, 1177,
+    1179,  1179, 1181, 1181, 1183,  1183, 1185, 1185, 1187, 1187, 1189, 1189, 1191, 1191, 1193, 1193, 1195, 1195, 1197,
+    1197,  1199, 1199, 1201, 1201,  1203, 1203, 1205, 1205, 1207, 1207, 1209, 1209, 1211, 1211, 1213, 1213, 1215, 1215,
+    1231,  1218, 1218, 1220, 1220,  1222, 1222, 1224, 1224, 1226, 1226, 1228, 1228, 1230, 1230, 1231, 1233, 1233, 1235,
+    1235,  1237, 1237, 1239, 1239,  1241, 1241, 1243, 1243, 1245, 1245, 1247, 1247, 1249, 1249, 1251, 1251, 1253, 1253,
+    1255,  1255, 1257, 1257, 1259,  1259, 1261, 1261, 1263, 1263, 1265, 1265, 1267, 1267, 1269, 1269, 1271, 1271, 1273,
+    1273,  1275, 1275, 1277, 1277,  1279, 1279};
+
+static const int32 to_lower_ranges[] = {
+    1280,   2097153, 1328,       1328,    1329,    -1378,   1367,   -1368,   4256,    -11521, 4294,    4294,   4295,
+    11559,  4296,    -4297,      4301,    11565,   4302,    -4303,  5024,    -43889,  5104,   -5113,   5110,   -5111,
+    7680,   2097153, 7830,       -7831,   7838,    223,     7839,   2097153, 7936,    -7937,  7944,    -7937,  7952,
+    -7953,  7960,    -7953,      7966,    -7967,   7976,    -7969,  7984,    -7985,   7992,   -7985,   8000,   -8001,
+    8008,   -8001,   8014,       -8015,   8025,    8017,    8026,   8026,    8027,    8019,   8028,    8028,   8029,
+    8021,   8030,    8030,       8031,    8023,    8032,    -8033,  8040,    -8033,   8048,   -8049,   8072,   -8065,
+    8080,   -8081,   8088,       -8081,   8096,    -8097,   8104,   -8097,   8112,    -8113,  8120,    -8113,  8122,
+    -8049,  8124,    8115,       8125,    -8126,   8136,    -8051,  8140,    8131,    8141,   -8142,   8152,   -8145,
+    8154,   -8055,   8156,       -8157,   8168,    -8161,   8170,   -8059,   8172,    8165,   8173,    -8174,  8184,
+    -8057,  8186,    -8061,      8188,    8179,    8189,    -8190,  8486,    969,     8487,   -8488,   8490,   107,
+    8491,   229,     8492,       -8493,   8498,    8526,    8499,   -8500,   8544,    -8561,  8560,    -8561,  8579,
+    8580,   8581,    -8582,      9398,    -9425,   9424,    -9425,  11264,   -11313,  11311,  -11312,  11360,  11361,
+    11362,  619,     11363,      7549,    11364,   637,     11365,  -11366,  11367,   11368,  11369,   11370,  11371,
+    11372,  11373,   593,        11374,   625,     11375,   592,    11376,   594,     11377,  2097153, 11380,  11380,
+    11381,  11382,   11383,      -11384,  11390,   -576,    11392,  2097153, 11492,   -11493, 11499,   11500,  11501,
+    11502,  11503,   -11504,     11506,   11507,   11508,   -11509, 42560,   2097153, 42606,  -42607,  42624,  2097153,
+    42652,  -42653,  42786,      2097153, 42800,   -42801,  42802,  2097153, 42864,   -42865, 42873,   42874,  42875,
+    42876,  42877,   7545,       42878,   2097153, 42888,   -42889, 42891,   42892,   42893,  613,     42894,  -42895,
+    42896,  2097153, 42900,      -42901,  42902,   2097153, 42922,  614,     42923,   604,    42924,   609,    42925,
+    620,    42926,   618,        42927,   42927,   42928,   670,    42929,   647,     42930,  669,     42931,  43859,
+    42932,  2097153, 42936,      -42937,  65313,   -65346,  65339,  -65340,  66560,   -66601, 66600,   -66601, 66736,
+    -66777, 66772,   -66773,     68736,   -68801,  68787,   -68788, 71840,   -71873,  71872,  -71873,  125184, -125219,
+    125218, -125219, 2147483647, 0};
+
+static const int16 without_diacritics_table[TABLE_SIZE] = {
+    0,    1,    2,    3,    4,    5,    6,    7,    8,    9,    10,   11,   12,   13,   14,   15,   16,   17,   18,
+    19,   20,   21,   22,   23,   24,   25,   26,   27,   28,   29,   30,   31,   32,   33,   34,   35,   36,   37,
+    38,   39,   40,   41,   42,   43,   44,   45,   46,   47,   48,   49,   50,   51,   52,   53,   54,   55,   56,
+    57,   58,   59,   60,   61,   62,   63,   64,   65,   66,   67,   68,   69,   70,   71,   72,   73,   74,   75,
+    76,   77,   78,   79,   80,   81,   82,   83,   84,   85,   86,   87,   88,   89,   90,   91,   92,   93,   94,
+    95,   96,   97,   98,   99,   100,  101,  102,  103,  104,  105,  106,  107,  108,  109,  110,  111,  112,  113,
+    114,  115,  116,  117,  118,  119,  120,  121,  122,  123,  124,  125,  126,  127,  128,  129,  130,  131,  132,
+    133,  134,  135,  136,  137,  138,  139,  140,  141,  142,  143,  144,  145,  146,  147,  148,  149,  150,  151,
+    152,  153,  154,  155,  156,  157,  158,  159,  32,   161,  162,  163,  164,  165,  166,  167,  32,   169,  97,
+    171,  172,  0,    174,  32,   176,  177,  50,   51,   32,   956,  182,  0,    32,   49,   111,  187,  188,  189,
+    190,  191,  65,   65,   65,   65,   65,   65,   198,  67,   69,   69,   69,   69,   73,   73,   73,   73,   208,
+    78,   79,   79,   79,   79,   79,   215,  216,  85,   85,   85,   85,   89,   222,  223,  97,   97,   97,   97,
+    97,   97,   230,  99,   101,  101,  101,  101,  105,  105,  105,  105,  240,  110,  111,  111,  111,  111,  111,
+    247,  248,  117,  117,  117,  117,  121,  254,  121,  65,   97,   65,   97,   65,   97,   67,   99,   67,   99,
+    67,   99,   67,   99,   68,   100,  272,  273,  69,   101,  69,   101,  69,   101,  69,   101,  69,   101,  71,
+    103,  71,   103,  71,   103,  71,   103,  72,   104,  294,  295,  73,   105,  73,   105,  73,   105,  73,   105,
+    73,   305,  306,  307,  74,   106,  75,   107,  312,  76,   108,  76,   108,  76,   108,  76,   108,  321,  322,
+    78,   110,  78,   110,  78,   110,  110,  330,  331,  79,   111,  79,   111,  79,   111,  338,  339,  82,   114,
+    82,   114,  82,   114,  83,   115,  83,   115,  83,   115,  83,   115,  84,   116,  84,   116,  358,  359,  85,
+    117,  85,   117,  85,   117,  85,   117,  85,   117,  85,   117,  87,   119,  89,   121,  89,   90,   122,  90,
+    122,  90,   122,  115,  384,  385,  386,  387,  388,  389,  390,  391,  392,  393,  394,  395,  396,  397,  398,
+    399,  400,  401,  402,  403,  404,  405,  406,  407,  408,  409,  410,  411,  412,  413,  414,  415,  79,   111,
+    418,  419,  420,  421,  422,  423,  424,  425,  426,  427,  428,  429,  430,  85,   117,  433,  434,  435,  436,
+    437,  438,  439,  440,  441,  442,  443,  444,  445,  446,  447,  448,  449,  450,  451,  452,  453,  454,  455,
+    456,  457,  458,  459,  460,  65,   97,   73,   105,  79,   111,  85,   117,  85,   117,  85,   117,  85,   117,
+    85,   117,  477,  65,   97,   65,   97,   198,  230,  484,  485,  71,   103,  75,   107,  79,   111,  79,   111,
+    439,  658,  106,  497,  498,  499,  71,   103,  502,  503,  78,   110,  65,   97,   198,  230,  216,  248,  65,
+    97,   65,   97,   69,   101,  69,   101,  73,   105,  73,   105,  79,   111,  79,   111,  82,   114,  82,   114,
+    85,   117,  85,   117,  83,   115,  84,   116,  540,  541,  72,   104,  544,  545,  546,  547,  548,  549,  65,
+    97,   69,   101,  79,   111,  79,   111,  79,   111,  79,   111,  89,   121,  564,  565,  566,  567,  568,  569,
+    570,  571,  572,  573,  574,  575,  576,  577,  578,  579,  580,  581,  582,  583,  584,  585,  586,  587,  588,
+    589,  590,  591,  592,  593,  594,  595,  596,  597,  598,  599,  600,  601,  602,  603,  604,  605,  606,  607,
+    608,  609,  610,  611,  612,  613,  614,  615,  616,  617,  618,  619,  620,  621,  622,  623,  624,  625,  626,
+    627,  628,  629,  630,  631,  632,  633,  634,  635,  636,  637,  638,  639,  640,  641,  642,  643,  644,  645,
+    646,  647,  648,  649,  650,  651,  652,  653,  654,  655,  656,  657,  658,  659,  660,  661,  662,  663,  664,
+    665,  666,  667,  668,  669,  670,  671,  672,  673,  674,  675,  676,  677,  678,  679,  680,  681,  682,  683,
+    684,  685,  686,  687,  104,  614,  106,  114,  633,  635,  641,  119,  121,  697,  698,  699,  0,    701,  0,
+    703,  704,  705,  706,  707,  708,  709,  710,  711,  712,  713,  714,  715,  716,  717,  718,  719,  720,  721,
+    722,  723,  724,  725,  726,  727,  32,   32,   32,   32,   32,   32,   734,  735,  611,  108,  115,  120,  661,
+    741,  742,  743,  744,  745,  746,  747,  748,  749,  750,  751,  752,  753,  754,  755,  756,  757,  758,  759,
+    760,  761,  762,  763,  764,  765,  766,  767,  0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,    837,  0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+    0,    0,    0,    0,    0,    0,    880,  881,  882,  883,  697,  885,  886,  887,  888,  889,  32,   891,  892,
+    893,  59,   895,  896,  897,  898,  899,  32,   32,   913,  903,  917,  919,  921,  907,  927,  909,  933,  937,
+    953,  913,  914,  915,  916,  917,  918,  919,  920,  921,  922,  923,  924,  925,  926,  927,  928,  929,  930,
+    931,  932,  933,  934,  935,  936,  937,  921,  933,  945,  949,  951,  953,  965,  945,  946,  947,  948,  949,
+    950,  951,  952,  953,  954,  955,  956,  957,  958,  959,  960,  961,  962,  963,  964,  965,  966,  967,  968,
+    969,  953,  965,  959,  965,  969,  975,  946,  952,  933,  933,  933,  966,  960,  983,  984,  985,  986,  987,
+    988,  989,  990,  991,  992,  993,  994,  995,  996,  997,  998,  999,  1000, 1001, 1002, 1003, 1004, 1005, 1006,
+    1007, 954,  961,  962,  1011, 920,  949,  1014, 1015, 1016, 931,  1018, 1019, 1020, 1021, 1022, 1023, 1045, 1045,
+    1026, 1043, 1028, 1029, 1030, 1030, 1032, 1033, 1034, 1035, 1050, 1048, 1059, 1039, 1040, 1041, 1042, 1043, 1044,
+    1045, 1046, 1047, 1048, 1048, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1060, 1061, 1062, 1063,
+    1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1080, 1082,
+    1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101,
+    1102, 1103, 1077, 1077, 1106, 1075, 1108, 1109, 1110, 1110, 1112, 1113, 1114, 1115, 1082, 1080, 1091, 1119, 1120,
+    1121, 1122, 1123, 1124, 1125, 1126, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1137, 1138, 1139,
+    1140, 1141, 1140, 1141, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1151, 1152, 1153, 1154, 0,    0,    0,    0,
+    0,    0,    0,    1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177,
+    1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196,
+    1197, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215,
+    1216, 1046, 1078, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1040, 1072, 1040,
+    1072, 1236, 1237, 1045, 1077, 1240, 1241, 1240, 1241, 1046, 1078, 1047, 1079, 1248, 1249, 1048, 1080, 1048, 1080,
+    1054, 1086, 1256, 1257, 1256, 1257, 1069, 1101, 1059, 1091, 1059, 1091, 1059, 1091, 1063, 1095, 1270, 1271, 1067,
+    1099, 1274, 1275, 1276, 1277, 1278, 1279};
+
+static const int32 without_diacritics_ranges[] = {
+    1280,   -1281,   1425,   0,       1470,       1470,    1471,   0,       1472,   1472,    1473,   0,
+    1475,   1475,    1476,   0,       1478,       1478,    1479,   0,       1480,   -1481,   1536,   0,
+    1542,   -1543,   1552,   0,       1563,       1563,    1564,   0,       1565,   -1566,   1570,   1575,
+    1572,   1608,    1573,   1575,    1574,       1610,    1575,   -1576,   1611,   0,       1632,   -1633,
+    1648,   0,       1649,   -1650,   1728,       1749,    1729,   2097154, 1732,   -1733,   1747,   2097152,
+    1749,   1749,    1750,   0,       1758,       1758,    1759,   0,       1765,   -1766,   1767,   0,
+    1769,   1769,    1770,   0,       1774,       -1775,   1807,   0,       1808,   1808,    1809,   0,
+    1810,   -1811,   1840,   0,       1867,       -1868,   1958,   0,       1969,   -1970,   2027,   0,
+    2036,   -2037,   2070,   0,       2074,       2074,    2075,   0,       2084,   2084,    2085,   0,
+    2088,   2088,    2089,   0,       2094,       -2095,   2137,   0,       2140,   -2141,   2260,   0,
+    2308,   -2309,   2345,   2097152, 2347,       -2348,   2353,   2097152, 2355,   2097154, 2358,   -2359,
+    2362,   0,       2365,   2365,    2366,       0,       2384,   2384,    2385,   0,       2392,   -2326,
+    2395,   2332,    2396,   -2338,   2398,       2347,    2399,   2351,    2400,   -2401,   2402,   0,
+    2404,   -2405,   2433,   0,       2436,       -2437,   2492,   0,       2493,   2493,    2494,   0,
+    2501,   -2502,   2503,   0,       2505,       -2506,   2507,   0,       2510,   -2511,   2519,   0,
+    2520,   -2521,   2524,   -2466,   2526,       2526,    2527,   2479,    2528,   -2529,   2530,   0,
+    2532,   -2533,   2561,   0,       2564,       -2565,   2611,   2097152, 2613,   2613,    2614,   2616,
+    2615,   -2616,   2620,   0,       2621,       2621,    2622,   0,       2627,   -2628,   2631,   0,
+    2633,   -2634,   2635,   0,       2638,       -2639,   2641,   0,       2642,   -2643,   2649,   -2583,
+    2651,   2588,    2652,   -2653,   2654,       2603,    2655,   -2656,   2672,   0,       2674,   -2675,
+    2677,   0,       2678,   -2679,   2689,       0,       2692,   -2693,   2748,   0,       2749,   2749,
+    2750,   0,       2758,   2758,    2759,       0,       2762,   2762,    2763,   0,       2766,   -2767,
+    2786,   0,       2788,   -2789,   2817,       0,       2820,   -2821,   2876,   0,       2877,   2877,
+    2878,   0,       2885,   -2886,   2887,       0,       2889,   -2890,   2891,   0,       2894,   -2895,
+    2902,   0,       2904,   -2905,   2908,       -2850,   2910,   -2911,   2914,   0,       2916,   -2917,
+    2946,   0,       2947,   -2948,   2964,       2962,    2965,   -2966,   3006,   0,       3011,   -3012,
+    3014,   0,       3017,   3017,    3018,       0,       3022,   -3023,   3031,   0,       3032,   -3033,
+    3072,   0,       3076,   -3077,   3134,       0,       3141,   3141,    3142,   0,       3145,   3145,
+    3146,   0,       3150,   -3151,   3157,       0,       3159,   -3160,   3170,   0,       3172,   -3173,
+    3201,   0,       3204,   -3205,   3260,       0,       3261,   3261,    3262,   0,       3269,   3269,
+    3270,   0,       3273,   3273,    3274,       0,       3278,   -3279,   3285,   0,       3287,   -3288,
+    3298,   0,       3300,   -3301,   3329,       0,       3332,   -3333,   3390,   0,       3397,   3397,
+    3398,   0,       3401,   3401,    3402,       0,       3406,   -3407,   3415,   0,       3416,   -3417,
+    3426,   0,       3428,   -3429,   3458,       0,       3460,   -3461,   3530,   0,       3531,   -3532,
+    3535,   0,       3541,   3541,    3542,       0,       3543,   3543,    3544,   0,       3552,   -3553,
+    3570,   0,       3572,   -3573,   3633,       0,       3634,   3634,    3636,   0,       3643,   -3644,
+    3655,   0,       3663,   -3664,   3761,       0,       3762,   3762,    3764,   0,       3770,   3770,
+    3771,   0,       3773,   -3774,   3784,       0,       3790,   -3791,   3852,   2097154, 3854,   -3855,
+    3864,   0,       3866,   -3867,   3893,       0,       3894,   3894,    3895,   0,       3896,   3896,
+    3897,   0,       3898,   -3899,   3902,       0,       3904,   -3905,   3907,   2097152, 3909,   -3910,
+    3917,   2097152, 3919,   -3920,   3922,       2097154, 3924,   -3925,   3927,   2097152, 3929,   -3930,
+    3932,   2097154, 3934,   -3935,   3945,       3904,    3946,   -3947,   3953,   0,       3973,   3973,
+    3974,   0,       3976,   -3977,   3981,       0,       3992,   3992,    3993,   0,       4029,   -4030,
+    4038,   0,       4039,   -4040,   4134,       2097154, 4136,   -4137,   4139,   0,       4159,   -4160,
+    4182,   0,       4186,   -4187,   4190,       0,       4193,   4193,    4194,   0,       4197,   -4198,
+    4199,   0,       4206,   -4207,   4209,       0,       4213,   -4214,   4226,   0,       4238,   4238,
+    4239,   0,       4240,   -4241,   4250,       0,       4254,   -4255,   4348,   4316,    4349,   -4350,
+    4957,   0,       4960,   -4961,   5906,       0,       5909,   -5910,   5938,   0,       5941,   -5942,
+    5970,   0,       5972,   -5973,   6002,       0,       6004,   -6005,   6068,   0,       6100,   -6101,
+    6109,   0,       6110,   -6111,   6155,       0,       6159,   -6160,   6277,   0,       6279,   -6280,
+    6313,   0,       6314,   -6315,   6432,       0,       6444,   -6445,   6448,   0,       6460,   -6461,
+    6679,   0,       6684,   -6685,   6741,       0,       6751,   6751,    6752,   0,       6781,   -6782,
+    6783,   0,       6784,   -6785,   6832,       0,       6847,   -6848,   6912,   0,       6917,   2097154,
+    6928,   -6929,   6930,   2097154, 6932,       -6933,   6964,   0,       6981,   -6982,   7019,   0,
+    7028,   -7029,   7040,   0,       7043,       -7044,   7073,   0,       7086,   -7087,   7142,   0,
+    7156,   -7157,   7204,   0,       7224,       -7225,   7376,   0,       7379,   7379,    7380,   0,
+    7401,   -7402,   7405,   0,       7406,       -7407,   7410,   0,       7413,   -7414,   7416,   0,
+    7418,   -7419,   7468,   65,      7469,       198,     7470,   66,      7471,   7471,    7472,   -69,
+    7474,   398,     7475,   -72,     7483,       7483,    7484,   79,      7485,   546,     7486,   80,
+    7487,   82,      7488,   -85,     7490,       87,      7491,   97,      7492,   -593,    7494,   7426,
+    7495,   98,      7496,   -101,    7498,       601,     7499,   -604,    7501,   103,     7502,   7502,
+    7503,   107,     7504,   109,     7505,       331,     7506,   111,     7507,   596,     7508,   -7447,
+    7510,   112,     7511,   -117,    7513,       7453,    7514,   623,     7515,   118,     7516,   7461,
+    7517,   -947,    7520,   -967,    7522,       105,     7523,   114,     7524,   -118,    7526,   -947,
+    7528,   961,     7529,   -967,    7531,       -7532,   7544,   1085,    7545,   -7546,   7579,   594,
+    7580,   99,      7581,   597,     7582,       240,     7583,   604,     7584,   102,     7585,   607,
+    7586,   609,     7587,   613,     7588,       -617,    7591,   7547,    7592,   669,     7593,   621,
+    7594,   7557,    7595,   671,     7596,       625,     7597,   624,     7598,   -627,    7602,   632,
+    7603,   -643,    7605,   427,     7606,       -650,    7608,   7452,    7609,   -652,    7611,   122,
+    7612,   -657,    7615,   952,     7616,       0,       7670,   -7671,   7675,   0,       7680,   65,
+    7681,   97,      7682,   66,      7683,       98,      7684,   66,      7685,   98,      7686,   66,
+    7687,   98,      7688,   67,      7689,       99,      7690,   68,      7691,   100,     7692,   68,
+    7693,   100,     7694,   68,      7695,       100,     7696,   68,      7697,   100,     7698,   68,
+    7699,   100,     7700,   69,      7701,       101,     7702,   69,      7703,   101,     7704,   69,
+    7705,   101,     7706,   69,      7707,       101,     7708,   69,      7709,   101,     7710,   70,
+    7711,   102,     7712,   71,      7713,       103,     7714,   72,      7715,   104,     7716,   72,
+    7717,   104,     7718,   72,      7719,       104,     7720,   72,      7721,   104,     7722,   72,
+    7723,   104,     7724,   73,      7725,       105,     7726,   73,      7727,   105,     7728,   75,
+    7729,   107,     7730,   75,      7731,       107,     7732,   75,      7733,   107,     7734,   76,
+    7735,   108,     7736,   76,      7737,       108,     7738,   76,      7739,   108,     7740,   76,
+    7741,   108,     7742,   77,      7743,       109,     7744,   77,      7745,   109,     7746,   77,
+    7747,   109,     7748,   78,      7749,       110,     7750,   78,      7751,   110,     7752,   78,
+    7753,   110,     7754,   78,      7755,       110,     7756,   79,      7757,   111,     7758,   79,
+    7759,   111,     7760,   79,      7761,       111,     7762,   79,      7763,   111,     7764,   80,
+    7765,   112,     7766,   80,      7767,       112,     7768,   82,      7769,   114,     7770,   82,
+    7771,   114,     7772,   82,      7773,       114,     7774,   82,      7775,   114,     7776,   83,
+    7777,   115,     7778,   83,      7779,       115,     7780,   83,      7781,   115,     7782,   83,
+    7783,   115,     7784,   83,      7785,       115,     7786,   84,      7787,   116,     7788,   84,
+    7789,   116,     7790,   84,      7791,       116,     7792,   84,      7793,   116,     7794,   85,
+    7795,   117,     7796,   85,      7797,       117,     7798,   85,      7799,   117,     7800,   85,
+    7801,   117,     7802,   85,      7803,       117,     7804,   86,      7805,   118,     7806,   86,
+    7807,   118,     7808,   87,      7809,       119,     7810,   87,      7811,   119,     7812,   87,
+    7813,   119,     7814,   87,      7815,       119,     7816,   87,      7817,   119,     7818,   88,
+    7819,   120,     7820,   88,      7821,       120,     7822,   89,      7823,   121,     7824,   90,
+    7825,   122,     7826,   90,      7827,       122,     7828,   90,      7829,   122,     7830,   104,
+    7831,   116,     7832,   119,     7833,       121,     7834,   97,      7835,   115,     7836,   -7837,
+    7840,   65,      7841,   97,      7842,       65,      7843,   97,      7844,   65,      7845,   97,
+    7846,   65,      7847,   97,      7848,       65,      7849,   97,      7850,   65,      7851,   97,
+    7852,   65,      7853,   97,      7854,       65,      7855,   97,      7856,   65,      7857,   97,
+    7858,   65,      7859,   97,      7860,       65,      7861,   97,      7862,   65,      7863,   97,
+    7864,   69,      7865,   101,     7866,       69,      7867,   101,     7868,   69,      7869,   101,
+    7870,   69,      7871,   101,     7872,       69,      7873,   101,     7874,   69,      7875,   101,
+    7876,   69,      7877,   101,     7878,       69,      7879,   101,     7880,   73,      7881,   105,
+    7882,   73,      7883,   105,     7884,       79,      7885,   111,     7886,   79,      7887,   111,
+    7888,   79,      7889,   111,     7890,       79,      7891,   111,     7892,   79,      7893,   111,
+    7894,   79,      7895,   111,     7896,       79,      7897,   111,     7898,   79,      7899,   111,
+    7900,   79,      7901,   111,     7902,       79,      7903,   111,     7904,   79,      7905,   111,
+    7906,   79,      7907,   111,     7908,       85,      7909,   117,     7910,   85,      7911,   117,
+    7912,   85,      7913,   117,     7914,       85,      7915,   117,     7916,   85,      7917,   117,
+    7918,   85,      7919,   117,     7920,       85,      7921,   117,     7922,   89,      7923,   121,
+    7924,   89,      7925,   121,     7926,       89,      7927,   121,     7928,   89,      7929,   121,
+    7930,   -7931,   7936,   945,     7944,       913,     7952,   949,     7958,   -7959,   7960,   917,
+    7966,   -7967,   7968,   951,     7976,       919,     7984,   953,     7992,   921,     8000,   959,
+    8006,   -8007,   8008,   927,     8014,       -8015,   8016,   965,     8024,   8024,    8025,   933,
+    8026,   8026,    8027,   933,     8028,       8028,    8029,   933,     8030,   8030,    8031,   933,
+    8032,   969,     8040,   937,     8048,       945,     8050,   949,     8052,   951,     8054,   953,
+    8056,   959,     8058,   965,     8060,       969,     8062,   -8063,   8064,   945,     8072,   913,
+    8080,   951,     8088,   919,     8096,       969,     8104,   937,     8112,   945,     8117,   8117,
+    8118,   945,     8120,   913,     8125,       32,      8126,   953,     8127,   32,      8130,   951,
+    8133,   8133,    8134,   951,     8136,       917,     8138,   919,     8141,   32,      8144,   953,
+    8148,   -8149,   8150,   953,     8152,       921,     8156,   8156,    8157,   32,      8160,   965,
+    8164,   961,     8166,   965,     8168,       933,     8172,   929,     8173,   32,      8175,   96,
+    8176,   -8177,   8178,   969,     8181,       8181,    8182,   969,     8184,   927,     8186,   937,
+    8189,   32,      8191,   8191,    8192,       32,      8203,   0,       8208,   2097152, 8211,   -8212,
+    8215,   32,      8216,   -8217,   8228,       46,      8229,   -8230,   8234,   0,       8239,   32,
+    8240,   -8241,   8254,   32,      8255,       -8256,   8287,   32,      8288,   0,       8293,   8293,
+    8294,   0,       8304,   48,      8305,       105,     8306,   -8307,   8308,   -53,     8314,   43,
+    8315,   8722,    8316,   61,      8317,       -41,     8319,   110,     8320,   -49,     8330,   43,
+    8331,   8722,    8332,   61,      8333,       -41,     8335,   8335,    8336,   97,      8337,   101,
+    8338,   111,     8339,   120,     8340,       601,     8341,   104,     8342,   -108,    8346,   112,
+    8347,   -116,    8349,   -8350,   8400,       0,       8433,   -8434,   8450,   67,      8452,   -8453,
+    8455,   400,     8456,   8456,    8457,       70,      8458,   103,     8459,   72,      8462,   104,
+    8463,   295,     8464,   73,      8466,       76,      8467,   108,     8468,   8468,    8469,   78,
+    8470,   -8471,   8473,   -81,     8476,       82,      8478,   -8479,   8484,   90,      8485,   8485,
+    8486,   937,     8487,   8487,    8488,       90,      8489,   8489,    8490,   75,      8491,   -66,
+    8494,   8494,    8495,   101,     8496,       -70,     8498,   8498,    8499,   77,      8500,   111,
+    8501,   -1489,   8505,   105,     8506,       -8507,   8508,   960,     8509,   947,     8510,   915,
+    8511,   928,     8512,   8721,    8513,       -8514,   8517,   68,      8518,   -101,    8520,   -106,
+    8522,   -8523,   8543,   49,      8544,       73,      8545,   -8546,   8548,   86,      8549,   -8550,
+    8553,   88,      8554,   -8555,   8556,       76,      8557,   -68,     8559,   77,      8560,   105,
+    8561,   -8562,   8564,   118,     8565,       -8566,   8569,   120,     8570,   -8571,   8572,   108,
+    8573,   -100,    8575,   109,     8576,       -8577,   8602,   8592,    8603,   8594,    8604,   -8605,
+    8622,   8596,    8623,   -8624,   8653,       8656,    8654,   8660,    8655,   8658,    8656,   -8657,
+    8708,   2097154, 8710,   -8711,   8713,       2097152, 8715,   2097154, 8718,   -8719,   8740,   2097154,
+    8744,   -8745,   8769,   8764,    8770,       -8771,   8772,   2097154, 8774,   8774,    8775,   8773,
+    8776,   2097152, 8779,   -8780,   8800,       61,      8801,   2097154, 8804,   -8805,   8813,   8781,
+    8814,   60,      8815,   62,      8816,       -8805,   8818,   -8819,   8820,   -8819,   8822,   -8823,
+    8824,   -8823,   8826,   -8827,   8832,       -8827,   8834,   -8835,   8836,   -8835,   8838,   -8839,
+    8840,   -8839,   8842,   -8843,   8876,       8866,    8877,   -8873,   8879,   8875,    8880,   -8881,
+    8928,   -8829,   8930,   -8850,   8932,       -8933,   8938,   -8883,   8942,   -8943,   9001,   -12297,
+    9003,   -9004,   9312,   -50,     9321,       -9322,   9352,   -50,     9361,   -9362,   9398,   -66,
+    9424,   -98,     9450,   48,      9451,       -9452,   10972,  10973,   10974,  -10975,  11388,  106,
+    11389,  86,      11390,  -11391,  11503,      0,       11506,  -11507,  11631,  11617,   11632,  -11633,
+    11647,  0,       11648,  -11649,  11744,      0,       11776,  -11777,  11935,  27597,   11936,  -11937,
+    12019,  40863,   12020,  -12021,  12032,      19968,   12033,  20008,   12034,  20022,   12035,  20031,
+    12036,  20057,   12037,  20101,   12038,      20108,   12039,  20128,   12040,  20154,   12041,  20799,
+    12042,  20837,   12043,  20843,   12044,      20866,   12045,  20886,   12046,  20907,   12047,  20960,
+    12048,  20981,   12049,  20992,   12050,      21147,   12051,  21241,   12052,  21269,   12053,  21274,
+    12054,  21304,   12055,  21313,   12056,      21340,   12057,  21353,   12058,  21378,   12059,  21430,
+    12060,  21448,   12061,  21475,   12062,      22231,   12063,  22303,   12064,  22763,   12065,  22786,
+    12066,  22794,   12067,  22805,   12068,      22823,   12069,  22899,   12070,  23376,   12071,  23424,
+    12072,  23544,   12073,  23567,   12074,      23586,   12075,  23608,   12076,  23662,   12077,  23665,
+    12078,  24027,   12079,  24037,   12080,      24049,   12081,  24062,   12082,  24178,   12083,  24186,
+    12084,  24191,   12085,  24308,   12086,      24318,   12087,  24331,   12088,  24339,   12089,  24400,
+    12090,  24417,   12091,  24435,   12092,      24515,   12093,  25096,   12094,  25142,   12095,  25163,
+    12096,  25903,   12097,  25908,   12098,      25991,   12099,  26007,   12100,  26020,   12101,  26041,
+    12102,  26080,   12103,  26085,   12104,      26352,   12105,  26376,   12106,  26408,   12107,  27424,
+    12108,  27490,   12109,  27513,   12110,      27571,   12111,  27595,   12112,  27604,   12113,  27611,
+    12114,  27663,   12115,  27668,   12116,      27700,   12117,  28779,   12118,  29226,   12119,  29238,
+    12120,  29243,   12121,  29247,   12122,      29255,   12123,  29273,   12124,  29275,   12125,  29356,
+    12126,  29572,   12127,  29577,   12128,      29916,   12129,  29926,   12130,  29976,   12131,  29983,
+    12132,  29992,   12133,  30000,   12134,      30091,   12135,  30098,   12136,  30326,   12137,  30333,
+    12138,  30382,   12139,  30399,   12140,      30446,   12141,  30683,   12142,  30690,   12143,  30707,
+    12144,  31034,   12145,  31160,   12146,      31166,   12147,  31348,   12148,  31435,   12149,  31481,
+    12150,  31859,   12151,  31992,   12152,      32566,   12153,  32593,   12154,  32650,   12155,  32701,
+    12156,  32769,   12157,  32780,   12158,      32786,   12159,  32819,   12160,  32895,   12161,  32905,
+    12162,  33251,   12163,  33258,   12164,      33267,   12165,  33276,   12166,  33292,   12167,  33307,
+    12168,  33311,   12169,  33390,   12170,      33394,   12171,  33400,   12172,  34381,   12173,  34411,
+    12174,  34880,   12175,  34892,   12176,      34915,   12177,  35198,   12178,  35211,   12179,  35282,
+    12180,  35328,   12181,  35895,   12182,      35910,   12183,  35925,   12184,  35960,   12185,  35997,
+    12186,  36196,   12187,  36208,   12188,      36275,   12189,  36523,   12190,  36554,   12191,  36763,
+    12192,  36784,   12193,  36789,   12194,      37009,   12195,  37193,   12196,  37318,   12197,  37324,
+    12198,  37329,   12199,  38263,   12200,      38272,   12201,  38428,   12202,  38582,   12203,  38585,
+    12204,  38632,   12205,  38737,   12206,      38750,   12207,  38754,   12208,  38761,   12209,  38859,
+    12210,  38893,   12211,  38899,   12212,      38913,   12213,  39080,   12214,  39131,   12215,  39135,
+    12216,  39318,   12217,  39321,   12218,      39340,   12219,  39592,   12220,  39640,   12221,  39647,
+    12222,  39717,   12223,  39727,   12224,      39730,   12225,  39740,   12226,  39770,   12227,  40165,
+    12228,  40565,   12229,  40575,   12230,      40613,   12231,  40635,   12232,  40643,   12233,  40653,
+    12234,  40657,   12235,  40697,   12236,      40701,   12237,  40718,   12238,  40723,   12239,  40736,
+    12240,  40763,   12241,  40778,   12242,      40786,   12243,  40845,   12244,  40860,   12245,  40864,
+    12246,  -12247,  12288,  32,      12289,      -12290,  12330,  0,       12336,  -12337,  12342,  12306,
+    12343,  12343,   12344,  21313,   12345,      -21317,  12347,  -12348,  12364,  2097154, 12388,  2097152,
+    12395,  -12396,  12400,  12399,   12402,      12402,   12405,  12405,   12408,  12408,   12411,  12411,
+    12414,  -12415,  12436,  12358,   12437,      -12438,  12441,  0,       12443,  32,      12445,  2097154,
+    12448,  -12449,  12460,  2097154, 12484,      2097152, 12491,  -12492,  12496,  12495,   12498,  12498,
+    12501,  12501,   12504,  12504,   12507,      12507,   12510,  -12511,  12532,  12454,   12533,  -12534,
+    12535,  -12528,  12539,  12539,   12540,      0,       12541,  2097154, 12544,  -12545,  12593,  -4353,
+    12595,  4522,    12596,  4354,    12597,      -4525,   12599,  -4356,   12602,  -4529,   12608,  4378,
+    12609,  -4359,   12612,  4385,    12613,      -4362,   12623,  -4450,   12644,  4448,    12645,  -4373,
+    12647,  -4552,   12649,  4556,    12650,      4558,    12651,  4563,    12652,  4567,    12653,  4569,
+    12654,  4380,    12655,  4573,    12656,      4575,    12657,  -4382,   12659,  4384,    12660,  -4387,
+    12662,  4391,    12663,  4393,    12664,      -4396,   12669,  4402,    12670,  4406,    12671,  4416,
+    12672,  4423,    12673,  4428,    12674,      -4594,   12676,  -4440,   12679,  -4485,   12681,  4488,
+    12682,  -4498,   12684,  4500,    12685,      4510,    12686,  4513,    12687,  -12688,  12690,  19968,
+    12691,  20108,   12692,  19977,   12693,      22235,   12694,  19978,   12695,  20013,   12696,  19979,
+    12697,  30002,   12698,  20057,   12699,      19993,   12700,  19969,   12701,  22825,   12702,  22320,
+    12703,  20154,   12704,  -12705,  12868,      21839,   12869,  24188,   12870,  25991,   12871,  31631,
+    12872,  -12873,  12896,  4352,    12897,      -4355,   12899,  -4358,   12902,  4361,    12903,  -4364,
+    12905,  -4367,   12910,  -12911,  12928,      19968,   12929,  20108,   12930,  19977,   12931,  22235,
+    12932,  20116,   12933,  20845,   12934,      19971,   12935,  20843,   12936,  20061,   12937,  21313,
+    12938,  26376,   12939,  28779,   12940,      27700,   12941,  26408,   12942,  37329,   12943,  22303,
+    12944,  26085,   12945,  26666,   12946,      26377,   12947,  31038,   12948,  21517,   12949,  29305,
+    12950,  36001,   12951,  31069,   12952,      21172,   12953,  31192,   12954,  30007,   12955,  22899,
+    12956,  36969,   12957,  20778,   12958,      21360,   12959,  27880,   12960,  38917,   12961,  20241,
+    12962,  20889,   12963,  27491,   12964,      19978,   12965,  20013,   12966,  19979,   12967,  24038,
+    12968,  21491,   12969,  21307,   12970,      23447,   12971,  23398,   12972,  30435,   12973,  20225,
+    12974,  36039,   12975,  21332,   12976,      22812,   12977,  -12978,  13008,  12450,   13009,  12452,
+    13010,  12454,   13011,  12456,   13012,      -12459,  13014,  12461,   13015,  12463,   13016,  12465,
+    13017,  12467,   13018,  12469,   13019,      12471,   13020,  12473,   13021,  12475,   13022,  12477,
+    13023,  12479,   13024,  12481,   13025,      12484,   13026,  12486,   13027,  12488,   13028,  -12491,
+    13034,  12498,   13035,  12501,   13036,      12504,   13037,  12507,   13038,  -12511,  13043,  12516,
+    13044,  12518,   13045,  -12521,  13051,      -12528,  13055,  -13056,  42607,  0,       42611,  42611,
+    42612,  0,       42622,  -42623,  42652,      1098,    42653,  1100,    42654,  0,       42656,  -42657,
+    42736,  0,       42738,  -42739,  42864,      2097154, 42866,  -42867,  43000,  294,     43001,  339,
+    43002,  -43003,  43010,  0,       43011,      -43012,  43014,  0,       43015,  -43016,  43019,  0,
+    43020,  -43021,  43043,  0,       43048,      -43049,  43136,  0,       43138,  -43139,  43188,  0,
+    43206,  -43207,  43232,  0,       43250,      -43251,  43302,  0,       43310,  -43311,  43335,  0,
+    43348,  -43349,  43392,  0,       43396,      -43397,  43443,  0,       43457,  -43458,  43493,  0,
+    43494,  -43495,  43561,  0,       43575,      -43576,  43587,  0,       43588,  -43589,  43596,  0,
+    43598,  -43599,  43643,  0,       43646,      -43647,  43696,  0,       43697,  43697,   43698,  0,
+    43701,  -43702,  43703,  0,       43705,      -43706,  43710,  0,       43712,  43712,   43713,  0,
+    43714,  -43715,  43755,  0,       43760,      -43761,  43765,  0,       43767,  -43768,  43868,  42791,
+    43869,  43831,   43870,  619,     43871,      43858,   43872,  -43873,  44003,  0,       44011,  44011,
+    44012,  0,       44014,  -44015,  55296,      0,       57344,  -57345,  63744,  35912,   63745,  26356,
+    63746,  36554,   63747,  36040,   63748,      28369,   63749,  20018,   63750,  21477,   63751,  40860,
+    63753,  22865,   63754,  37329,   63755,      21895,   63756,  22856,   63757,  25078,   63758,  30313,
+    63759,  32645,   63760,  34367,   63761,      34746,   63762,  35064,   63763,  37007,   63764,  27138,
+    63765,  27931,   63766,  28889,   63767,      29662,   63768,  33853,   63769,  37226,   63770,  39409,
+    63771,  20098,   63772,  21365,   63773,      27396,   63774,  29211,   63775,  34349,   63776,  40478,
+    63777,  23888,   63778,  28651,   63779,      34253,   63780,  35172,   63781,  25289,   63782,  33240,
+    63783,  34847,   63784,  24266,   63785,      26391,   63786,  28010,   63787,  29436,   63788,  37070,
+    63789,  20358,   63790,  20919,   63791,      21214,   63792,  25796,   63793,  27347,   63794,  29200,
+    63795,  30439,   63796,  32769,   63797,      34310,   63798,  34396,   63799,  36335,   63800,  38706,
+    63801,  39791,   63802,  40442,   63803,      30860,   63804,  31103,   63805,  32160,   63806,  33737,
+    63807,  37636,   63808,  40575,   63809,      35542,   63810,  22751,   63811,  24324,   63812,  31840,
+    63813,  32894,   63814,  29282,   63815,      30922,   63816,  36034,   63817,  38647,   63818,  22744,
+    63819,  23650,   63820,  27155,   63821,      28122,   63822,  28431,   63823,  32047,   63824,  32311,
+    63825,  38475,   63826,  21202,   63827,      32907,   63828,  20956,   63829,  20940,   63830,  31260,
+    63831,  32190,   63832,  33777,   63833,      38517,   63834,  35712,   63835,  25295,   63836,  27138,
+    63837,  35582,   63838,  20025,   63839,      23527,   63840,  24594,   63841,  29575,   63842,  30064,
+    63843,  21271,   63844,  30971,   63845,      20415,   63846,  24489,   63847,  19981,   63848,  27852,
+    63849,  25976,   63850,  32034,   63851,      21443,   63852,  22622,   63853,  30465,   63854,  33865,
+    63855,  35498,   63856,  27578,   63857,      36784,   63858,  27784,   63859,  25342,   63860,  33509,
+    63861,  25504,   63862,  30053,   63863,      20142,   63864,  20841,   63865,  20937,   63866,  26753,
+    63867,  31975,   63868,  33391,   63869,      35538,   63870,  37327,   63871,  21237,   63872,  21570,
+    63873,  22899,   63874,  24300,   63875,      26053,   63876,  28670,   63877,  31018,   63878,  38317,
+    63879,  39530,   63880,  40599,   63881,      40654,   63882,  21147,   63883,  26310,   63884,  27511,
+    63885,  36706,   63886,  24180,   63887,      24976,   63888,  25088,   63889,  25754,   63890,  28451,
+    63891,  29001,   63892,  29833,   63893,      31178,   63894,  32244,   63895,  32879,   63896,  36646,
+    63897,  34030,   63898,  36899,   63899,      37706,   63900,  21015,   63901,  21155,   63902,  21693,
+    63903,  28872,   63904,  35010,   63905,      35498,   63906,  24265,   63907,  24565,   63908,  25467,
+    63909,  27566,   63910,  31806,   63911,      29557,   63912,  20196,   63913,  22265,   63914,  23527,
+    63915,  23994,   63916,  24604,   63917,      29618,   63918,  29801,   63919,  32666,   63920,  32838,
+    63921,  37428,   63922,  38646,   63923,      38728,   63924,  38936,   63925,  20363,   63926,  31150,
+    63927,  37300,   63928,  38584,   63929,      24801,   63930,  20102,   63931,  20698,   63932,  23534,
+    63933,  23615,   63934,  26009,   63935,      27138,   63936,  29134,   63937,  30274,   63938,  34044,
+    63939,  36988,   63940,  40845,   63941,      26248,   63942,  38446,   63943,  21129,   63944,  26491,
+    63945,  26611,   63946,  27969,   63947,      28316,   63948,  29705,   63949,  30041,   63950,  30827,
+    63951,  32016,   63952,  39006,   63953,      20845,   63954,  25134,   63955,  38520,   63956,  20523,
+    63957,  23833,   63958,  28138,   63959,      36650,   63960,  24459,   63961,  24900,   63962,  26647,
+    63963,  29575,   63964,  38534,   63965,      21033,   63966,  21519,   63967,  23653,   63968,  26131,
+    63969,  26446,   63970,  26792,   63971,      27877,   63972,  29702,   63973,  30178,   63974,  32633,
+    63975,  35023,   63976,  35041,   63977,      37324,   63978,  38626,   63979,  21311,   63980,  28346,
+    63981,  21533,   63982,  29136,   63983,      29848,   63984,  34298,   63985,  38563,   63986,  40023,
+    63987,  40607,   63988,  26519,   63989,      28107,   63990,  33256,   63991,  31435,   63992,  31520,
+    63993,  31890,   63994,  29376,   63995,      28825,   63996,  35672,   63997,  20160,   63998,  33590,
+    63999,  21050,   64000,  20999,   64001,      24230,   64002,  25299,   64003,  31958,   64004,  23429,
+    64005,  27934,   64006,  26292,   64007,      36667,   64008,  34892,   64009,  38477,   64010,  35211,
+    64011,  24275,   64012,  20800,   64013,      21952,   64014,  -64015,  64016,  22618,   64017,  64017,
+    64018,  26228,   64019,  -64020,  64021,      20958,   64022,  29482,   64023,  30410,   64024,  31036,
+    64025,  31070,   64026,  31077,   64027,      31119,   64028,  38742,   64029,  31934,   64030,  32701,
+    64031,  64031,   64032,  34322,   64033,      64033,   64034,  35576,   64035,  -64036,  64037,  36920,
+    64038,  37117,   64039,  -64040,  64042,      39151,   64043,  39164,   64044,  39208,   64045,  40372,
+    64046,  37086,   64047,  38583,   64048,      20398,   64049,  20711,   64050,  20813,   64051,  21193,
+    64052,  21220,   64053,  21329,   64054,      21917,   64055,  22022,   64056,  22120,   64057,  22592,
+    64058,  22696,   64059,  23652,   64060,      23662,   64061,  24724,   64062,  24936,   64063,  24974,
+    64064,  25074,   64065,  25935,   64066,      26082,   64067,  26257,   64068,  26757,   64069,  28023,
+    64070,  28186,   64071,  28450,   64072,      29038,   64073,  29227,   64074,  29730,   64075,  30865,
+    64076,  31038,   64077,  31049,   64078,      31048,   64079,  31056,   64080,  31062,   64081,  31069,
+    64082,  -31118,  64084,  31296,   64085,      31361,   64086,  31680,   64087,  32244,   64088,  32265,
+    64089,  32321,   64090,  32626,   64091,      32773,   64092,  33261,   64093,  33401,   64095,  33879,
+    64096,  35088,   64097,  35222,   64098,      35585,   64099,  35641,   64100,  36051,   64101,  36104,
+    64102,  36790,   64103,  36920,   64104,      38627,   64105,  38911,   64106,  38971,   64107,  24693,
+    64108,  148206,  64109,  33304,   64110,      -64111,  64112,  20006,   64113,  20917,   64114,  20840,
+    64115,  20352,   64116,  20805,   64117,      20864,   64118,  21191,   64119,  21242,   64120,  21917,
+    64121,  21845,   64122,  21913,   64123,      21986,   64124,  22618,   64125,  22707,   64126,  22852,
+    64127,  22868,   64128,  23138,   64129,      23336,   64130,  24274,   64131,  24281,   64132,  24425,
+    64133,  24493,   64134,  24792,   64135,      24910,   64136,  24840,   64137,  24974,   64138,  24928,
+    64139,  25074,   64140,  25140,   64141,      25540,   64142,  25628,   64143,  25682,   64144,  25942,
+    64145,  26228,   64146,  26391,   64147,      26395,   64148,  26454,   64149,  27513,   64150,  27578,
+    64151,  27969,   64152,  28379,   64153,      28363,   64154,  28450,   64155,  28702,   64156,  29038,
+    64157,  30631,   64158,  29237,   64159,      29359,   64160,  29482,   64161,  29809,   64162,  29958,
+    64163,  30011,   64164,  30237,   64165,      30239,   64166,  30410,   64167,  30427,   64168,  30452,
+    64169,  30538,   64170,  30528,   64171,      30924,   64172,  31409,   64173,  31680,   64174,  31867,
+    64175,  32091,   64176,  32244,   64177,      32574,   64178,  32773,   64179,  33618,   64180,  33775,
+    64181,  34681,   64182,  35137,   64183,      35206,   64184,  35222,   64185,  35519,   64186,  35576,
+    64187,  35531,   64188,  35585,   64189,      35582,   64190,  35565,   64191,  35641,   64192,  35722,
+    64193,  36104,   64194,  36664,   64195,      36978,   64196,  37273,   64197,  37494,   64198,  38524,
+    64199,  38627,   64200,  38742,   64201,      38875,   64202,  38911,   64203,  38923,   64204,  38971,
+    64205,  39698,   64206,  40860,   64207,      141386,  64208,  141380,  64209,  144341,  64210,  15261,
+    64211,  16408,   64212,  16441,   64213,      152137,  64214,  154832,  64215,  163539,  64216,  40771,
+    64217,  40846,   64218,  -64219,  64285,      1497,    64286,  0,       64287,  1522,    64288,  1506,
+    64289,  1488,    64290,  -1492,   64292,      -1500,   64295,  1512,    64296,  1514,    64297,  43,
+    64298,  1513,    64302,  1488,    64305,      -1490,   64311,  64311,   64312,  -1497,   64317,  64317,
+    64318,  1502,    64319,  64319,   64320,      -1505,   64322,  64322,   64323,  -1508,   64325,  64325,
+    64326,  -1511,   64331,  1493,    64332,      1489,    64333,  1499,    64334,  1508,    64335,  64335,
+    64336,  1649,    64338,  1659,    64342,      1662,    64346,  1664,    64350,  1658,    64354,  1663,
+    64358,  1657,    64362,  1700,    64366,      1702,    64370,  1668,    64374,  1667,    64378,  1670,
+    64382,  1671,    64386,  1677,    64388,      1676,    64390,  1678,    64392,  1672,    64394,  1688,
+    64396,  1681,    64398,  1705,    64402,      1711,    64406,  1715,    64410,  1713,    64414,  1722,
+    64416,  1723,    64420,  1749,    64422,      1729,    64426,  1726,    64430,  1746,    64434,  -64435,
+    64467,  1709,    64471,  1735,    64473,      1734,    64475,  1736,    64477,  1655,    64478,  1739,
+    64480,  1733,    64482,  1737,    64484,      1744,    64488,  1609,    64490,  -64491,  64508,  1740,
+    64512,  -64513,  64603,  -1585,   64605,      1609,    64606,  32,      64612,  -64613,  64656,  1609,
+    64657,  -64658,  64729,  1607,    64730,      -64731,  64754,  1600,    64757,  -64758,  64828,  1575,
+    64830,  -64831,  65024,  0,       65040,      44,      65041,  -12290,  65043,  -59,     65045,  33,
+    65046,  63,      65047,  -12311,  65049,      8230,    65050,  -65051,  65056,  0,       65072,  8229,
+    65073,  8212,    65074,  8211,    65075,      95,      65077,  -41,     65079,  123,     65080,  125,
+    65081,  -12309,  65083,  -12305,  65085,      -12299,  65087,  -12297,  65089,  -12301,  65093,  -65094,
+    65095,  91,      65096,  93,      65097,      32,      65101,  95,      65104,  44,      65105,  12289,
+    65106,  46,      65107,  65107,   65108,      59,      65109,  58,      65110,  63,      65111,  33,
+    65112,  8212,    65113,  -41,     65115,      123,     65116,  125,     65117,  -12309,  65119,  35,
+    65120,  38,      65121,  -43,     65123,      45,      65124,  60,      65125,  62,      65126,  61,
+    65127,  65127,   65128,  92,      65129,      -37,     65131,  64,      65132,  -65133,  65136,  32,
+    65137,  1600,    65138,  32,      65139,      65139,   65140,  32,      65141,  65141,   65142,  32,
+    65143,  1600,    65144,  32,      65145,      1600,    65146,  32,      65147,  1600,    65148,  32,
+    65149,  1600,    65150,  32,      65151,      1600,    65152,  1569,    65153,  1575,    65157,  1608,
+    65159,  1575,    65161,  1610,    65165,      1575,    65167,  1576,    65171,  1577,    65173,  1578,
+    65177,  1579,    65181,  1580,    65185,      1581,    65189,  1582,    65193,  1583,    65195,  1584,
+    65197,  1585,    65199,  1586,    65201,      1587,    65205,  1588,    65209,  1589,    65213,  1590,
+    65217,  1591,    65221,  1592,    65225,      1593,    65229,  1594,    65233,  1601,    65237,  1602,
+    65241,  1603,    65245,  1604,    65249,      1605,    65253,  1606,    65257,  1607,    65261,  1608,
+    65263,  1609,    65265,  1610,    65269,      -65270,  65279,  0,       65280,  65280,   65281,  -34,
+    65375,  -10630,  65377,  12290,   65378,      -12301,  65380,  12289,   65381,  12539,   65382,  12530,
+    65383,  12449,   65384,  12451,   65385,      12453,   65386,  12455,   65387,  12457,   65388,  12515,
+    65389,  12517,   65390,  12519,   65391,      12483,   65392,  65392,   65393,  12450,   65394,  12452,
+    65395,  12454,   65396,  12456,   65397,      -12459,  65399,  12461,   65400,  12463,   65401,  12465,
+    65402,  12467,   65403,  12469,   65404,      12471,   65405,  12473,   65406,  12475,   65407,  12477,
+    65408,  12479,   65409,  12481,   65410,      12484,   65411,  12486,   65412,  12488,   65413,  -12491,
+    65419,  12498,   65420,  12501,   65421,      12504,   65422,  12507,   65423,  -12511,  65428,  12516,
+    65429,  12518,   65430,  -12521,  65436,      12527,   65437,  12531,   65438,  -65439,  65440,  4448,
+    65441,  -4353,   65443,  4522,    65444,      4354,    65445,  -4525,   65447,  -4356,   65450,  -4529,
+    65456,  4378,    65457,  -4359,   65460,      4385,    65461,  -4362,   65471,  -65472,  65474,  -4450,
+    65480,  -65481,  65482,  -4456,   65488,      -65489,  65490,  -4462,   65496,  -65497,  65498,  -4468,
+    65501,  -65502,  65504,  -163,    65506,      172,     65507,  32,      65508,  166,     65509,  165,
+    65510,  8361,    65511,  65511,   65512,      9474,    65513,  -8593,   65517,  9632,    65518,  9675,
+    65519,  -65520,  65529,  0,       65532,      -65533,  66045,  0,       66046,  -66047,  66272,  0,
+    66273,  -66274,  66422,  0,       66427,      -66428,  68097,  0,       68100,  68100,   68101,  0,
+    68103,  -68104,  68108,  0,       68112,      -68113,  68152,  0,       68155,  -68156,  68159,  0,
+    68160,  -68161,  68325,  0,       68327,      -68328,  69632,  0,       69635,  -69636,  69688,  0,
+    69703,  -69704,  69759,  0,       69763,      -69764,  69786,  2097154, 69790,  -69791,  69803,  69797,
+    69804,  -69805,  69808,  0,       69819,      -69820,  69821,  0,       69822,  -69823,  69888,  0,
+    69891,  -69892,  69927,  0,       69941,      -69942,  70003,  0,       70004,  -70005,  70016,  0,
+    70019,  -70020,  70067,  0,       70081,      -70082,  70090,  0,       70093,  -70094,  70188,  0,
+    70200,  -70201,  70206,  0,       70207,      -70208,  70367,  0,       70379,  -70380,  70400,  0,
+    70404,  -70405,  70460,  0,       70461,      70461,   70462,  0,       70469,  -70470,  70471,  0,
+    70473,  -70474,  70475,  0,       70478,      -70479,  70487,  0,       70488,  -70489,  70498,  0,
+    70500,  -70501,  70502,  0,       70509,      -70510,  70512,  0,       70517,  -70518,  70709,  0,
+    70727,  -70728,  70832,  0,       70852,      -70853,  71087,  0,       71094,  -71095,  71096,  0,
+    71105,  -71106,  71132,  0,       71134,      -71135,  71216,  0,       71233,  -71234,  71339,  0,
+    71352,  -71353,  71453,  0,       71468,      -71469,  72751,  0,       72759,  72759,   72760,  0,
+    72768,  -72769,  72850,  0,       72872,      72872,   72873,  0,       72887,  -72888,  92912,  0,
+    92917,  -92918,  92976,  0,       92983,      -92984,  94033,  0,       94079,  -94080,  94095,  0,
+    94099,  -94100,  113821, 0,       113823,     113823,  113824, 0,       113828, -113829, 119134, -119128,
+    119136, 119128,  119141, 0,       119146,     -119147, 119149, 0,       119171, -119172, 119173, 0,
+    119180, -119181, 119210, 0,       119214,     -119215, 119227, -119226, 119229, -119226, 119231, -119226,
+    119233, -119234, 119362, 0,       119365,     -119366, 119808, -66,     119834, -98,     119860, -66,
+    119886, -98,     119893, 119893,  119894,     -106,    119912, -66,     119938, -98,     119964, 65,
+    119965, 119965,  119966, -68,     119968,     -119969, 119970, 71,      119971, -119972, 119973, -75,
+    119975, -119976, 119977, -79,     119981,     119981,  119982, -84,     119990, -98,     119994, 119994,
+    119995, 102,     119996, 119996,  119997,     -105,    120004, 120004,  120005, -113,    120016, -66,
+    120042, -98,     120068, -66,     120070,     120070,  120071, -69,     120075, -120076, 120077, -75,
+    120085, 120085,  120086, -84,     120093,     120093,  120094, -98,     120120, -66,     120122, 120122,
+    120123, -69,     120127, 120127,  120128,     -74,     120133, 120133,  120134, 79,      120135, -120136,
+    120138, -84,     120145, 120145,  120146,     -98,     120172, -66,     120198, -98,     120224, -66,
+    120250, -98,     120276, -66,     120302,     -98,     120328, -66,     120354, -98,     120380, -66,
+    120406, -98,     120432, -66,     120458,     -98,     120484, 305,     120485, 567,     120486, -120487,
+    120488, -914,    120505, 920,     120506,     -932,    120513, 8711,    120514, -946,    120539, 8706,
+    120540, 949,     120541, 952,     120542,     954,     120543, 966,     120544, 961,     120545, 960,
+    120546, -914,    120563, 920,     120564,     -932,    120571, 8711,    120572, -946,    120597, 8706,
+    120598, 949,     120599, 952,     120600,     954,     120601, 966,     120602, 961,     120603, 960,
+    120604, -914,    120621, 920,     120622,     -932,    120629, 8711,    120630, -946,    120655, 8706,
+    120656, 949,     120657, 952,     120658,     954,     120659, 966,     120660, 961,     120661, 960,
+    120662, -914,    120679, 920,     120680,     -932,    120687, 8711,    120688, -946,    120713, 8706,
+    120714, 949,     120715, 952,     120716,     954,     120717, 966,     120718, 961,     120719, 960,
+    120720, -914,    120737, 920,     120738,     -932,    120745, 8711,    120746, -946,    120771, 8706,
+    120772, 949,     120773, 952,     120774,     954,     120775, 966,     120776, 961,     120777, 960,
+    120778, -989,    120780, -120781, 120782,     -49,     120792, -49,     120802, -49,     120812, -49,
+    120822, -49,     120832, -120833, 121344,     0,       121399, -121400, 121403, 0,       121453, -121454,
+    121461, 0,       121462, -121463, 121476,     0,       121477, -121478, 121499, 0,       121504, 121504,
+    121505, 0,       121520, -121521, 122880,     0,       122887, 122887,  122888, 0,       122905, -122906,
+    122907, 0,       122914, 122914,  122915,     0,       122917, 122917,  122918, 0,       122923, -122924,
+    125136, 0,       125143, -125144, 125252,     0,       125259, -125260, 126464, -1576,   126466, 1580,
+    126467, 1583,    126468, 126468,  126469,     1608,    126470, 1586,    126471, 1581,    126472, 1591,
+    126473, 1610,    126474, -1604,   126478,     1587,    126479, 1593,    126480, 1601,    126481, 1589,
+    126482, 1602,    126483, 1585,    126484,     1588,    126485, -1579,   126487, 1582,    126488, 1584,
+    126489, 1590,    126490, 1592,    126491,     1594,    126492, 1646,    126493, 1722,    126494, 1697,
+    126495, 1647,    126496, 126496,  126497,     1576,    126498, 1580,    126499, 126499,  126500, 1607,
+    126501, -126502, 126503, 1581,    126504,     126504,  126505, 1610,    126506, -1604,   126510, 1587,
+    126511, 1593,    126512, 1601,    126513,     1589,    126514, 1602,    126515, 126515,  126516, 1588,
+    126517, -1579,   126519, 1582,    126520,     126520,  126521, 1590,    126522, 126522,  126523, 1594,
+    126524, -126525, 126530, 1580,    126531,     -126532, 126535, 1581,    126536, 126536,  126537, 1610,
+    126538, 126538,  126539, 1604,    126540,     126540,  126541, 1606,    126542, 1587,    126543, 1593,
+    126544, 126544,  126545, 1589,    126546,     1602,    126547, 126547,  126548, 1588,    126549, -126550,
+    126551, 1582,    126552, 126552,  126553,     1590,    126554, 126554,  126555, 1594,    126556, 126556,
+    126557, 1722,    126558, 126558,  126559,     1647,    126560, 126560,  126561, 1576,    126562, 1580,
+    126563, 126563,  126564, 1607,    126565,     -126566, 126567, 1581,    126568, 1591,    126569, 1610,
+    126570, 1603,    126571, 126571,  126572,     -1606,   126574, 1587,    126575, 1593,    126576, 1601,
+    126577, 1589,    126578, 1602,    126579,     126579,  126580, 1588,    126581, -1579,   126583, 1582,
+    126584, 126584,  126585, 1590,    126586,     1592,    126587, 1594,    126588, 1646,    126589, 126589,
+    126590, 1697,    126591, 126591,  126592,     -1576,   126594, 1580,    126595, 1583,    126596, -1608,
+    126598, 1586,    126599, 1581,    126600,     1591,    126601, 1610,    126602, 126602,  126603, -1605,
+    126606, 1587,    126607, 1593,    126608,     1601,    126609, 1589,    126610, 1602,    126611, 1585,
+    126612, 1588,    126613, -1579,   126615,     1582,    126616, 1584,    126617, 1590,    126618, 1592,
+    126619, 1594,    126620, -126621, 126625,     1576,    126626, 1580,    126627, 1583,    126628, 126628,
+    126629, 1608,    126630, 1586,    126631,     1581,    126632, 1591,    126633, 1610,    126634, 126634,
+    126635, -1605,   126638, 1587,    126639,     1593,    126640, 1601,    126641, 1589,    126642, 1602,
+    126643, 1585,    126644, 1588,    126645,     -1579,   126647, 1582,    126648, 1584,    126649, 1590,
+    126650, 1592,    126651, 1594,    126652,     -126653, 127232, 48,      127234, -50,     127243, -127244,
+    127275, 67,      127276, 82,      127277,     -127278, 127280, -66,     127306, -127307, 127490, 12469,
+    127491, -127492, 127504, 25163,   127505,     23383,   127506, 21452,   127507, 12486,   127508, 20108,
+    127509, 22810,   127510, 35299,   127511,     22825,   127512, 20132,   127513, 26144,   127514, 28961,
+    127515, 26009,   127516, 21069,   127517,     24460,   127518, 20877,   127519, 26032,   127520, 21021,
+    127521, 32066,   127522, 29983,   127523,     36009,   127524, 22768,   127525, 21561,   127526, 28436,
+    127527, 25237,   127528, 25429,   127529,     19968,   127530, 19977,   127531, 36938,   127532, 24038,
+    127533, 20013,   127534, 21491,   127535,     25351,   127536, 36208,   127537, 25171,   127538, 31105,
+    127539, 31354,   127540, 21512,   127541,     28288,   127542, 26377,   127543, 26376,   127544, 30003,
+    127545, 21106,   127546, 21942,   127547,     37197,   127548, -127549, 127568, 24471,   127569, 21487,
+    127570, -127571, 194560, 20029,   194561,     20024,   194562, 20033,   194563, 131362,  194564, 20320,
+    194565, 20398,   194566, 20411,   194567,     20482,   194568, 20602,   194569, 20633,   194570, 20711,
+    194571, 20687,   194572, 13470,   194573,     132666,  194574, 20813,   194575, 20820,   194576, 20836,
+    194577, 20855,   194578, 132380,  194579,     13497,   194580, 20839,   194581, 20877,   194582, 132427,
+    194583, 20887,   194584, 20900,   194585,     20172,   194586, 20908,   194587, 20917,   194588, 168415,
+    194589, 20981,   194590, 20995,   194591,     13535,   194592, 21051,   194593, 21062,   194594, 21106,
+    194595, 21111,   194596, 13589,   194597,     21191,   194598, 21193,   194599, 21220,   194600, 21242,
+    194601, -21254,  194603, 21271,   194604,     21321,   194605, 21329,   194606, 21338,   194607, 21363,
+    194608, 21373,   194609, 21375,   194612,     133676,  194613, 28784,   194614, 21450,   194615, 21471,
+    194616, 133987,  194617, 21483,   194618,     21489,   194619, 21510,   194620, 21662,   194621, 21560,
+    194622, 21576,   194623, 21608,   194624,     21666,   194625, 21750,   194626, 21776,   194627, 21843,
+    194628, 21859,   194629, 21892,   194631,     21913,   194632, 21931,   194633, 21939,   194634, 21954,
+    194635, 22294,   194636, 22022,   194637,     22295,   194638, 22097,   194639, 22132,   194640, 20999,
+    194641, 22766,   194642, 22478,   194643,     22516,   194644, 22541,   194645, 22411,   194646, 22578,
+    194647, 22577,   194648, 22700,   194649,     136420,  194650, 22770,   194651, 22775,   194652, 22790,
+    194653, 22810,   194654, 22818,   194655,     22882,   194656, 136872,  194657, 136938,  194658, 23020,
+    194659, 23067,   194660, 23079,   194661,     23000,   194662, 23142,   194663, 14062,   194664, 14076,
+    194665, 23304,   194666, 23358,   194668,     137672,  194669, 23491,   194670, 23512,   194671, 23527,
+    194672, 23539,   194673, 138008,  194674,     23551,   194675, 23558,   194676, 24403,   194677, 23586,
+    194678, 14209,   194679, 23648,   194680,     23662,   194681, 23744,   194682, 23693,   194683, 138724,
+    194684, 23875,   194685, 138726,  194686,     23918,   194687, 23915,   194688, 23932,   194689, -24034,
+    194691, 14383,   194692, 24061,   194693,     24104,   194694, 24125,   194695, 24169,   194696, 14434,
+    194697, 139651,  194698, 14460,   194699,     24240,   194700, 24243,   194701, 24246,   194702, 24266,
+    194703, 172946,  194704, 24318,   194705,     140081,  194707, 33281,   194708, 24354,   194710, 14535,
+    194711, 144056,  194712, 156122,  194713,     24418,   194714, 24427,   194715, 14563,   194716, 24474,
+    194717, 24525,   194718, 24535,   194719,     24569,   194720, 24705,   194721, 14650,   194722, 14620,
+    194723, 24724,   194724, 141012,  194725,     24775,   194726, 24904,   194727, 24908,   194728, 24910,
+    194729, 24908,   194730, 24954,   194731,     24974,   194732, 25010,   194733, 24996,   194734, 25007,
+    194735, 25054,   194736, 25074,   194737,     25078,   194738, 25104,   194739, 25115,   194740, 25181,
+    194741, 25265,   194742, 25300,   194743,     25424,   194744, 142092,  194745, 25405,   194746, 25340,
+    194747, 25448,   194748, 25475,   194749,     25572,   194750, 142321,  194751, 25634,   194752, 25541,
+    194753, 25513,   194754, 14894,   194755,     25705,   194756, 25726,   194757, 25757,   194758, 25719,
+    194759, 14956,   194760, 25935,   194761,     25964,   194762, 143370,  194763, 26083,   194764, 26360,
+    194765, 26185,   194766, 15129,   194767,     26257,   194768, 15112,   194769, 15076,   194770, 20882,
+    194771, 20885,   194772, 26368,   194773,     26268,   194774, 32941,   194775, 17369,   194776, 26391,
+    194777, 26395,   194778, 26401,   194779,     26462,   194780, 26451,   194781, 144323,  194782, 15177,
+    194783, 26618,   194784, 26501,   194785,     26706,   194786, 26757,   194787, 144493,  194788, 26766,
+    194789, 26655,   194790, 26900,   194791,     15261,   194792, 26946,   194793, 27043,   194794, 27114,
+    194795, 27304,   194796, 145059,  194797,     27355,   194798, 15384,   194799, 27425,   194800, 145575,
+    194801, 27476,   194802, 15438,   194803,     27506,   194804, 27551,   194805, -27579,  194807, 146061,
+    194808, 138507,  194809, 146170,  194810,     27726,   194811, 146620,  194812, 27839,   194813, 27853,
+    194814, 27751,   194815, 27926,   194816,     27966,   194817, 28023,   194818, 27969,   194819, 28009,
+    194820, 28024,   194821, 28037,   194822,     146718,  194823, 27956,   194824, 28207,   194825, 28270,
+    194826, 15667,   194827, 28363,   194828,     28359,   194829, 147153,  194830, 28153,   194831, 28526,
+    194832, 147294,  194833, 147342,  194834,     28614,   194835, 28729,   194836, 28702,   194837, 28699,
+    194838, 15766,   194839, 28746,   194840,     28797,   194841, 28791,   194842, 28845,   194843, 132389,
+    194844, 28997,   194845, 148067,  194846,     29084,   194847, 148395,  194848, 29224,   194849, 29237,
+    194850, 29264,   194851, 149000,  194852,     29312,   194853, 29333,   194854, 149301,  194855, 149524,
+    194856, 29562,   194857, 29579,   194858,     16044,   194859, 29605,   194860, 16056,   194862, 29767,
+    194863, 29788,   194864, 29809,   194865,     29829,   194866, 29898,   194867, 16155,   194868, 29988,
+    194869, 150582,  194870, 30014,   194871,     150674,  194872, 30064,   194873, 139679,  194874, 30224,
+    194875, 151457,  194876, 151480,  194877,     151620,  194878, 16380,   194879, 16392,   194880, 30452,
+    194881, 151795,  194882, 151794,  194883,     151833,  194884, 151859,  194885, -30495,  194887, 30495,
+    194888, 30538,   194889, 16441,   194890,     30603,   194891, 16454,   194892, 16534,   194893, 152605,
+    194894, 30798,   194895, 30860,   194896,     30924,   194897, 16611,   194898, 153126,  194899, 31062,
+    194900, 153242,  194901, 153285,  194902,     31119,   194903, 31211,   194904, 16687,   194905, 31296,
+    194906, 31306,   194907, 31311,   194908,     153980,  194909, 154279,  194911, 31470,   194912, 16898,
+    194913, 154539,  194914, 31686,   194915,     31689,   194916, 16935,   194917, 154752,  194918, 31954,
+    194919, 17056,   194920, 31976,   194921,     31971,   194922, 32000,   194923, 155526,  194924, 32099,
+    194925, 17153,   194926, 32199,   194927,     32258,   194928, 32325,   194929, 17204,   194930, 156200,
+    194931, 156231,  194932, 17241,   194933,     156377,  194934, 32634,   194935, 156478,  194936, 32661,
+    194937, 32762,   194938, 32773,   194939,     156890,  194940, 156963,  194941, 32864,   194942, 157096,
+    194943, 32880,   194944, 144223,  194945,     17365,   194946, 32946,   194947, 33027,   194948, 17419,
+    194949, 33086,   194950, 23221,   194951,     157607,  194952, 157621,  194953, 144275,  194954, 144284,
+    194955, 33281,   194956, 33284,   194957,     36766,   194958, 17515,   194959, 33425,   194960, 33419,
+    194961, 33437,   194962, 21171,   194963,     33457,   194964, 33459,   194965, 33469,   194966, 33510,
+    194967, 158524,  194968, 33509,   194969,     33565,   194970, 33635,   194971, 33709,   194972, 33571,
+    194973, 33725,   194974, 33767,   194975,     33879,   194976, 33619,   194977, 33738,   194978, 33740,
+    194979, 33756,   194980, 158774,  194981,     159083,  194982, 158933,  194983, 17707,   194984, 34033,
+    194985, 34035,   194986, 34070,   194987,     160714,  194988, 34148,   194989, 159532,  194990, 17757,
+    194991, 17761,   194992, 159665,  194993,     159954,  194994, 17771,   194995, 34384,   194996, 34396,
+    194997, 34407,   194998, 34409,   194999,     34473,   195000, 34440,   195001, 34574,   195002, 34530,
+    195003, 34681,   195004, 34600,   195005,     34667,   195006, 34694,   195007, 17879,   195008, 34785,
+    195009, 34817,   195010, 17913,   195011,     34912,   195012, 34915,   195013, 161383,  195014, 35031,
+    195015, 35038,   195016, 17973,   195017,     35066,   195018, 13499,   195019, 161966,  195020, 162150,
+    195021, 18110,   195022, 18119,   195023,     35488,   195024, 35565,   195025, 35722,   195026, 35925,
+    195027, 162984,  195028, 36011,   195029,     36033,   195030, 36123,   195031, 36215,   195032, 163631,
+    195033, 133124,  195034, 36299,   195035,     36284,   195036, 36336,   195037, 133342,  195038, 36564,
+    195039, 36664,   195040, 165330,  195041,     165357,  195042, 37012,   195043, 37105,   195044, 37137,
+    195045, 165678,  195046, 37147,   195047,     37432,   195048, -37592,  195050, 37500,   195051, 37881,
+    195052, 37909,   195053, 166906,  195054,     38283,   195055, 18837,   195056, 38327,   195057, 167287,
+    195058, 18918,   195059, 38595,   195060,     23986,   195061, 38691,   195062, 168261,  195063, 168474,
+    195064, 19054,   195065, 19062,   195066,     38880,   195067, 168970,  195068, 19122,   195069, 169110,
+    195070, 38923,   195072, 38953,   195073,     169398,  195074, 39138,   195075, 19251,   195076, 39209,
+    195077, 39335,   195078, 39362,   195079,     39422,   195080, 19406,   195081, 170800,  195082, 39698,
+    195083, 40000,   195084, 40189,   195085,     19662,   195086, 19693,   195087, 40295,   195088, 172238,
+    195089, 19704,   195090, 172293,  195091,     172558,  195092, 172689,  195093, 40635,   195094, 19798,
+    195095, 40697,   195096, 40702,   195097,     40709,   195098, 40719,   195099, 40726,   195100, 40763,
+    195101, 173568,  195102, -195103, 917505,     0,       917506, -917507, 917536, 0,       917632, -917633,
+    917760, 0,       918000, -918001, 2147483647, 0};
+
+UnicodeSimpleCategory get_unicode_simple_category(uint32 code) {
+  auto it = std::upper_bound(std::begin(unicode_simple_category_ranges), std::end(unicode_simple_category_ranges),
+                             (code << 5) + 30);
+  return static_cast<UnicodeSimpleCategory>(*(it - 1) & 31);
+}
+
+/**
+ * Search pregenerated ranges of pairs for the replacement of specified character
+ */
+template <size_t N>
+static uint32 binary_search_ranges(const int32 (&ranges)[N], uint32 code) {
+  if (code > 0x10ffff) {
+    return 0;
+  }
+
+  int32 code_int = static_cast<int32>(code);
+  size_t l = 0, r = N;
+  while (l < r) {
+    size_t m = ((l + r + 2) >> 2) << 1;
+    if (ranges[m] <= code_int) {
+      l = m;
+    } else {
+      r = m - 2;
+    }
+  }
+
+  int32 t = ranges[l + 1];
+  if (t < 0) {
+    return code - ranges[l] + (~t);
+  }
+  if (t <= 0x10ffff) {
+    return t;
+  }
+  switch (t - 0x200000) {
+    case 0:
+      return (code & -2);
+    case 1:
+      return (code | 1);
+    case 2:
+      return ((code - 1) | 1);
+    default:
+      LOG(FATAL) << code << " " << l << " " << r << " " << t;
+      return 0;
+  }
+}
+
+uint32 prepare_search_character(uint32 code) {
+  if (code < TABLE_SIZE) {
+    return prepare_search_character_table[code];
+  } else {
+    return binary_search_ranges(prepare_search_character_ranges, code);
+  }
+}
+
+uint32 unicode_to_lower(uint32 code) {
+  if (code < TABLE_SIZE) {
+    return to_lower_table[code];
+  } else {
+    return binary_search_ranges(to_lower_ranges, code);
+  }
+}
+
+uint32 remove_diacritics(uint32 code) {
+  if (code < TABLE_SIZE) {
+    return without_diacritics_table[code];
+  } else {
+    return binary_search_ranges(without_diacritics_ranges, code);
+  }
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/unicode.h b/submodules/ton/tonlib-src/tdutils/td/utils/unicode.h
new file mode 100644
index 0000000000..b2a9249910
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/unicode.h
@@ -0,0 +1,45 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+
+namespace td {
+
+enum class UnicodeSimpleCategory { Unknown, Letter, DecimalNumber, Number, Separator };
+
+UnicodeSimpleCategory get_unicode_simple_category(uint32 code);
+
+/**
+ * Prepares unicode character for search, leaving only digits and lowercased letters.
+ * Return code of replacing character or 0 if the character should be skipped.
+ */
+uint32 prepare_search_character(uint32 code);
+
+/**
+ * Converts unicode character to lower case.
+ */
+uint32 unicode_to_lower(uint32 code);
+
+/**
+ * Removes diacritics from a unicode character.
+ */
+uint32 remove_diacritics(uint32 code);
+
+}  // namespace td
diff --git a/submodules/MtProtoKit/TON/iOS/include/td/utils/unique_ptr.h b/submodules/ton/tonlib-src/tdutils/td/utils/unique_ptr.h
similarity index 100%
rename from submodules/MtProtoKit/TON/iOS/include/td/utils/unique_ptr.h
rename to submodules/ton/tonlib-src/tdutils/td/utils/unique_ptr.h
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/utf8.cpp b/submodules/ton/tonlib-src/tdutils/td/utils/utf8.cpp
new file mode 100644
index 0000000000..f616cff73b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/utf8.cpp
@@ -0,0 +1,136 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/utf8.h"
+
+#include "td/utils/logging.h"  // for UNREACHABLE
+#include "td/utils/unicode.h"
+
+namespace td {
+
+bool check_utf8(CSlice str) {
+  const char *data = str.data();
+  const char *data_end = data + str.size();
+  do {
+    unsigned int a = static_cast<unsigned char>(*data++);
+    if ((a & 0x80) == 0) {
+      if (data == data_end + 1) {
+        return true;
+      }
+      continue;
+    }
+
+#define ENSURE(condition) \
+  if (!(condition)) {     \
+    return false;         \
+  }
+
+    ENSURE((a & 0x40) != 0);
+
+    unsigned int b = static_cast<unsigned char>(*data++);
+    ENSURE((b & 0xc0) == 0x80);
+    if ((a & 0x20) == 0) {
+      ENSURE((a & 0x1e) > 0);
+      continue;
+    }
+
+    unsigned int c = static_cast<unsigned char>(*data++);
+    ENSURE((c & 0xc0) == 0x80);
+    if ((a & 0x10) == 0) {
+      int x = (((a & 0x0f) << 6) | (b & 0x20));
+      ENSURE(x != 0 && x != 0x360);  // surrogates
+      continue;
+    }
+
+    unsigned int d = static_cast<unsigned char>(*data++);
+    ENSURE((d & 0xc0) == 0x80);
+    if ((a & 0x08) == 0) {
+      int t = (((a & 0x07) << 6) | (b & 0x30));
+      ENSURE(0 < t && t < 0x110);  // end of unicode
+      continue;
+    }
+
+    return false;
+#undef ENSURE
+  } while (true);
+
+  UNREACHABLE();
+  return false;
+}
+
+void append_utf8_character(string &str, uint32 ch) {
+  if (ch <= 0x7f) {
+    str.push_back(static_cast<char>(ch));
+  } else if (ch <= 0x7ff) {
+    str.push_back(static_cast<char>(0xc0 | (ch >> 6)));  // implementation-defined
+    str.push_back(static_cast<char>(0x80 | (ch & 0x3f)));
+  } else if (ch <= 0xffff) {
+    str.push_back(static_cast<char>(0xe0 | (ch >> 12)));  // implementation-defined
+    str.push_back(static_cast<char>(0x80 | ((ch >> 6) & 0x3f)));
+    str.push_back(static_cast<char>(0x80 | (ch & 0x3f)));
+  } else {
+    str.push_back(static_cast<char>(0xf0 | (ch >> 18)));  // implementation-defined
+    str.push_back(static_cast<char>(0x80 | ((ch >> 12) & 0x3f)));
+    str.push_back(static_cast<char>(0x80 | ((ch >> 6) & 0x3f)));
+    str.push_back(static_cast<char>(0x80 | (ch & 0x3f)));
+  }
+}
+
+const unsigned char *next_utf8_unsafe(const unsigned char *ptr, uint32 *code, const char *source) {
+  uint32 a = ptr[0];
+  if ((a & 0x80) == 0) {
+    if (code) {
+      *code = a;
+    }
+    return ptr + 1;
+  } else if ((a & 0x20) == 0) {
+    if (code) {
+      *code = ((a & 0x1f) << 6) | (ptr[1] & 0x3f);
+    }
+    return ptr + 2;
+  } else if ((a & 0x10) == 0) {
+    if (code) {
+      *code = ((a & 0x0f) << 12) | ((ptr[1] & 0x3f) << 6) | (ptr[2] & 0x3f);
+    }
+    return ptr + 3;
+  } else if ((a & 0x08) == 0) {
+    if (code) {
+      *code = ((a & 0x07) << 18) | ((ptr[1] & 0x3f) << 12) | ((ptr[2] & 0x3f) << 6) | (ptr[3] & 0x3f);
+    }
+    return ptr + 4;
+  }
+  LOG(FATAL) << a << " " << source;
+  if (code) {
+    *code = 0;
+  }
+  return ptr;
+}
+
+string utf8_to_lower(Slice str) {
+  string result;
+  auto pos = str.ubegin();
+  auto end = str.uend();
+  while (pos != end) {
+    uint32 code;
+    pos = next_utf8_unsafe(pos, &code, "utf8_to_lower");
+    append_utf8_character(result, unicode_to_lower(code));
+  }
+  return result;
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/td/utils/utf8.h b/submodules/ton/tonlib-src/tdutils/td/utils/utf8.h
new file mode 100644
index 0000000000..e338e1b70c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/td/utils/utf8.h
@@ -0,0 +1,118 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+
+namespace td {
+
+/// checks UTF-8 string for correctness
+bool check_utf8(CSlice str);
+
+/// checks if a code unit is a first code unit of a UTF-8 character
+inline bool is_utf8_character_first_code_unit(unsigned char c) {
+  return (c & 0xC0) != 0x80;
+}
+
+/// returns length of UTF-8 string in characters
+inline size_t utf8_length(Slice str) {
+  size_t result = 0;
+  for (auto c : str) {
+    result += is_utf8_character_first_code_unit(c);
+  }
+  return result;
+}
+
+/// appends a Unicode character using UTF-8 encoding
+void append_utf8_character(string &str, uint32 ch);
+
+/// moves pointer one UTF-8 character back
+inline const unsigned char *prev_utf8_unsafe(const unsigned char *ptr) {
+  while (!is_utf8_character_first_code_unit(*--ptr)) {
+    // pass
+  }
+  return ptr;
+}
+
+/// moves pointer one UTF-8 character forward and saves code of the skipped character in *code
+const unsigned char *next_utf8_unsafe(const unsigned char *ptr, uint32 *code, const char *source);
+
+/// truncates UTF-8 string to the given length in Unicode characters
+template <class T>
+T utf8_truncate(T str, size_t length) {
+  if (str.size() > length) {
+    for (size_t i = 0; i < str.size(); i++) {
+      if (is_utf8_character_first_code_unit(static_cast<unsigned char>(str[i]))) {
+        if (length == 0) {
+          return str.substr(0, i);
+        } else {
+          length--;
+        }
+      }
+    }
+  }
+  return str;
+}
+
+/// truncates UTF-8 string to the given length given in UTF-16 code units
+template <class T>
+T utf8_utf16_truncate(T str, size_t length) {
+  for (size_t i = 0; i < str.size(); i++) {
+    auto c = static_cast<unsigned char>(str[i]);
+    if (is_utf8_character_first_code_unit(c)) {
+      if (length <= 0) {
+        return str.substr(0, i);
+      } else {
+        length--;
+        if (c >= 0xf0) {  // >= 4 bytes in symbol => surrogaite pair
+          length--;
+        }
+      }
+    }
+  }
+  return str;
+}
+
+template <class T>
+T utf8_substr(T str, size_t offset) {
+  auto offset_pos = utf8_truncate(str, offset).size();
+  return str.substr(offset_pos);
+}
+
+template <class T>
+T utf8_substr(T str, size_t offset, size_t length) {
+  return utf8_truncate(utf8_substr(str, offset), length);
+}
+
+template <class T>
+T utf8_utf16_substr(T str, size_t offset) {
+  auto offset_pos = utf8_utf16_truncate(str, offset).size();
+  return str.substr(offset_pos);
+}
+
+template <class T>
+T utf8_utf16_substr(T str, size_t offset, size_t length) {
+  return utf8_utf16_truncate(utf8_utf16_substr(str, offset), length);
+}
+
+/// Returns UTF-8 string converted to lower case.
+string utf8_to_lower(Slice str);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tdutils/test/ConcurrentHashMap.cpp b/submodules/ton/tonlib-src/tdutils/test/ConcurrentHashMap.cpp
new file mode 100644
index 0000000000..ba52105dff
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/ConcurrentHashMap.cpp
@@ -0,0 +1,266 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/benchmark.h"
+#include "td/utils/ConcurrentHashTable.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/SpinLock.h"
+#include "td/utils/tests.h"
+
+#include <atomic>
+#include <mutex>
+
+#if !TD_THREAD_UNSUPPORTED
+
+#if TD_HAVE_ABSL
+#include <absl/container/flat_hash_map.h>
+#else
+#include <unordered_map>
+#endif
+
+#if TD_WITH_LIBCUCKOO
+#include <third-party/libcuckoo/libcuckoo/cuckoohash_map.hh>
+#endif
+
+#if TD_WITH_JUNCTION
+#include <junction/ConcurrentMap_Grampa.h>
+#include <junction/ConcurrentMap_Leapfrog.h>
+#include <junction/ConcurrentMap_Linear.h>
+#endif
+
+namespace td {
+
+// Non resizable HashMap. Just an example
+template <class KeyT, class ValueT>
+class ArrayHashMap {
+ public:
+  explicit ArrayHashMap(size_t n) : array_(n) {
+  }
+  struct Node {
+    std::atomic<KeyT> key{KeyT{}};
+    std::atomic<ValueT> value{ValueT{}};
+  };
+  static std::string get_name() {
+    return "ArrayHashMap";
+  }
+  KeyT empty_key() const {
+    return KeyT{};
+  }
+
+  void insert(KeyT key, ValueT value) {
+    array_.with_value(key, true, [&](auto &node_value) { node_value.store(value, std::memory_order_release); });
+  }
+  ValueT find(KeyT key, ValueT value) {
+    array_.with_value(key, false, [&](auto &node_value) { value = node_value.load(std::memory_order_acquire); });
+    return value;
+  }
+
+ private:
+  AtomicHashArray<KeyT, std::atomic<ValueT>> array_;
+};
+
+template <class KeyT, class ValueT>
+class ConcurrentHashMapMutex {
+ public:
+  explicit ConcurrentHashMapMutex(size_t) {
+  }
+  static std::string get_name() {
+    return "ConcurrentHashMapMutex";
+  }
+  void insert(KeyT key, ValueT value) {
+    std::unique_lock<std::mutex> lock(mutex_);
+    hash_map_.emplace(key, value);
+  }
+  ValueT find(KeyT key, ValueT default_value) {
+    std::unique_lock<std::mutex> lock(mutex_);
+    auto it = hash_map_.find(key);
+    if (it == hash_map_.end()) {
+      return default_value;
+    }
+    return it->second;
+  }
+
+ private:
+  std::mutex mutex_;
+#if TD_HAVE_ABSL
+  absl::flat_hash_map<KeyT, ValueT> hash_map_;
+#else
+  std::unordered_map<KeyT, ValueT> hash_map_;
+#endif
+};
+
+template <class KeyT, class ValueT>
+class ConcurrentHashMapSpinlock {
+ public:
+  explicit ConcurrentHashMapSpinlock(size_t) {
+  }
+  static std::string get_name() {
+    return "ConcurrentHashMapSpinlock";
+  }
+  void insert(KeyT key, ValueT value) {
+    auto guard = spinlock_.lock();
+    hash_map_.emplace(key, value);
+  }
+  ValueT find(KeyT key, ValueT default_value) {
+    auto guard = spinlock_.lock();
+    auto it = hash_map_.find(key);
+    if (it == hash_map_.end()) {
+      return default_value;
+    }
+    return it->second;
+  }
+
+ private:
+  SpinLock spinlock_;
+#if TD_HAVE_ABSL
+  absl::flat_hash_map<KeyT, ValueT> hash_map_;
+#else
+  std::unordered_map<KeyT, ValueT> hash_map_;
+#endif
+};
+
+#if TD_WITH_LIBCUCKOO
+template <class KeyT, class ValueT>
+class ConcurrentHashMapLibcuckoo {
+ public:
+  explicit ConcurrentHashMapLibcuckoo(size_t) {
+  }
+  static std::string get_name() {
+    return "ConcurrentHashMapLibcuckoo";
+  }
+  void insert(KeyT key, ValueT value) {
+    hash_map_.insert(key, value);
+  }
+  ValueT find(KeyT key, ValueT default_value) {
+    hash_map_.find(key, default_value);
+    return default_value;
+  }
+
+ private:
+  cuckoohash_map<KeyT, ValueT> hash_map_;
+};
+#endif
+
+#if TD_WITH_JUNCTION
+template <class KeyT, class ValueT>
+class ConcurrentHashMapJunction {
+ public:
+  explicit ConcurrentHashMapJunction(size_t size) : hash_map_() {
+  }
+  static std::string get_name() {
+    return "ConcurrentHashMapJunction";
+  }
+  void insert(KeyT key, ValueT value) {
+    hash_map_.assign(key, value);
+  }
+  ValueT find(KeyT key, ValueT default_value) {
+    return hash_map_.get(key);
+  }
+
+  ConcurrentHashMapJunction(const ConcurrentHashMapJunction &) = delete;
+  ConcurrentHashMapJunction &operator=(const ConcurrentHashMapJunction &) = delete;
+  ConcurrentHashMapJunction(ConcurrentHashMapJunction &&other) = delete;
+  ConcurrentHashMapJunction &operator=(ConcurrentHashMapJunction &&) = delete;
+  ~ConcurrentHashMapJunction() {
+    junction::DefaultQSBR.flush();
+  }
+
+ private:
+  junction::ConcurrentMap_Leapfrog<KeyT, ValueT> hash_map_;
+};
+#endif
+
+}  // namespace td
+
+template <class HashMap>
+class HashMapBenchmark : public td::Benchmark {
+  struct Query {
+    int key;
+    int value;
+  };
+  std::vector<Query> queries;
+  td::unique_ptr<HashMap> hash_map;
+
+  size_t threads_n = 16;
+  int mod_;
+  static constexpr size_t mul_ = 7273;  //1000000000 + 7;
+  int n_;
+
+ public:
+  explicit HashMapBenchmark(size_t threads_n) : threads_n(threads_n) {
+  }
+  std::string get_description() const override {
+    return hash_map->get_name();
+  }
+  void start_up_n(int n) override {
+    n *= (int)threads_n;
+    n_ = n;
+    hash_map = td::make_unique<HashMap>(n * 2);
+  }
+
+  void run(int n) override {
+    n = n_;
+    std::vector<td::thread> threads;
+
+    for (size_t i = 0; i < threads_n; i++) {
+      size_t l = n * i / threads_n;
+      size_t r = n * (i + 1) / threads_n;
+      threads.emplace_back([l, r, this] {
+        for (size_t i = l; i < r; i++) {
+          auto x = int((i + 1) * mul_ % n_) + 3;
+          auto y = int(i + 2);
+          hash_map->insert(x, y);
+        }
+      });
+    }
+    for (auto &thread : threads) {
+      thread.join();
+    }
+  }
+
+  void tear_down() override {
+    for (int i = 0; i < n_; i++) {
+      auto x = int((i + 1) * mul_ % n_) + 3;
+      auto y = int(i + 2);
+      ASSERT_EQ(y, hash_map->find(x, -1));
+    }
+    queries.clear();
+    hash_map.reset();
+  }
+};
+
+template <class HashMap>
+static void bench_hash_map() {
+  td::bench(HashMapBenchmark<HashMap>(16));
+  td::bench(HashMapBenchmark<HashMap>(1));
+}
+
+TEST(ConcurrentHashMap, Benchmark) {
+  bench_hash_map<td::ConcurrentHashMap<int, int>>();
+  bench_hash_map<td::ArrayHashMap<int, int>>();
+  bench_hash_map<td::ConcurrentHashMapSpinlock<int, int>>();
+  bench_hash_map<td::ConcurrentHashMapMutex<int, int>>();
+#if TD_WITH_LIBCUCKOO
+  bench_hash_map<td::ConcurrentHashMapLibcuckoo<int, int>>();
+#endif
+#if TD_WITH_JUNCTION
+  bench_hash_map<td::ConcurrentHashMapJunction<int, int>>();
+#endif
+}
+
+#endif
\ No newline at end of file
diff --git a/submodules/ton/tonlib-src/tdutils/test/Enumerator.cpp b/submodules/ton/tonlib-src/tdutils/test/Enumerator.cpp
new file mode 100644
index 0000000000..fa0409c64b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/Enumerator.cpp
@@ -0,0 +1,36 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/Enumerator.h"
+#include "td/utils/tests.h"
+
+TEST(Enumerator, simple) {
+  td::Enumerator<std::string> e;
+  auto b = e.add("b");
+  auto a = e.add("a");
+  auto d = e.add("d");
+  auto c = e.add("c");
+  ASSERT_STREQ(e.get(a), "a");
+  ASSERT_STREQ(e.get(b), "b");
+  ASSERT_STREQ(e.get(c), "c");
+  ASSERT_STREQ(e.get(d), "d");
+  ASSERT_EQ(a, e.add("a"));
+  ASSERT_EQ(b, e.add("b"));
+  ASSERT_EQ(c, e.add("c"));
+  ASSERT_EQ(d, e.add("d"));
+}
diff --git a/submodules/ton/tonlib-src/tdutils/test/EpochBasedMemoryReclamation.cpp b/submodules/ton/tonlib-src/tdutils/test/EpochBasedMemoryReclamation.cpp
new file mode 100644
index 0000000000..f7e4725f9a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/EpochBasedMemoryReclamation.cpp
@@ -0,0 +1,80 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/common.h"
+#include "td/utils/EpochBasedMemoryReclamation.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/Random.h"
+#include "td/utils/tests.h"
+
+#include <atomic>
+
+#if !TD_THREAD_UNSUPPORTED
+TEST(EpochBaseMemoryReclamation, stress) {
+  struct Node {
+    std::atomic<std::string *> name_{nullptr};
+    char pad[64];
+  };
+
+  int threads_n = 10;
+  std::vector<Node> nodes(threads_n);
+  td::EpochBasedMemoryReclamation<std::string> ebmr(threads_n + 1);
+  auto locker = ebmr.get_locker(threads_n);
+  locker.lock();
+  locker.unlock();
+  std::vector<td::thread> threads(threads_n);
+  int thread_id = 0;
+  for (auto &thread : threads) {
+    thread = td::thread([&, thread_id] {
+      auto locker = ebmr.get_locker(thread_id);
+      locker.lock();
+      for (int i = 0; i < 1000000; i++) {
+        auto &node = nodes[td::Random::fast(0, threads_n - 1)];
+        auto *str = node.name_.load(std::memory_order_acquire);
+        if (str) {
+          CHECK(*str == "one" || *str == "twotwo");
+        }
+        if ((i + 1) % 100 == 0) {
+          locker.retire();
+        }
+        if (td::Random::fast(0, 5) == 0) {
+          std::string *new_str = new std::string(td::Random::fast(0, 1) == 0 ? "one" : "twotwo");
+          if (node.name_.compare_exchange_strong(str, new_str, std::memory_order_acq_rel)) {
+            locker.retire(str);
+          } else {
+            delete new_str;
+          }
+        }
+      }
+      locker.retire_sync();
+      locker.unlock();
+    });
+    thread_id++;
+  }
+  for (auto &thread : threads) {
+    thread.join();
+  }
+  LOG(ERROR) << "Undeleted pointers: " << ebmr.to_delete_size_unsafe();
+  //CHECK(static_cast<int>(ebmr.to_delete_size_unsafe()) <= threads_n * threads_n);
+  for (int i = 0; i < threads_n; i++) {
+    ebmr.get_locker(i).retire_sync();
+  }
+  CHECK(ebmr.to_delete_size_unsafe() == 0);
+}
+#endif  //!TD_THREAD_UNSUPPORTED
diff --git a/submodules/ton/tonlib-src/tdutils/test/HazardPointers.cpp b/submodules/ton/tonlib-src/tdutils/test/HazardPointers.cpp
new file mode 100644
index 0000000000..1c47158b56
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/HazardPointers.cpp
@@ -0,0 +1,72 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/common.h"
+#include "td/utils/HazardPointers.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/Random.h"
+#include "td/utils/Slice.h"
+#include "td/utils/tests.h"
+
+#include <atomic>
+
+#if !TD_THREAD_UNSUPPORTED
+TEST(HazardPointers, stress) {
+  struct Node {
+    std::atomic<std::string *> name_{nullptr};
+    char pad[64];
+  };
+  int threads_n = 10;
+  std::vector<Node> nodes(threads_n);
+  td::HazardPointers<std::string> hazard_pointers(threads_n);
+  std::vector<td::thread> threads(threads_n);
+  int thread_id = 0;
+  for (auto &thread : threads) {
+    thread = td::thread([&, thread_id] {
+      std::remove_reference_t<decltype(hazard_pointers)>::Holder holder(hazard_pointers, thread_id, 0);
+      for (int i = 0; i < 1000000; i++) {
+        auto &node = nodes[td::Random::fast(0, threads_n - 1)];
+        auto *str = holder.protect(node.name_);
+        if (str) {
+          CHECK(*str == td::Slice("one") || *str == td::Slice("twotwo"));
+        }
+        holder.clear();
+        if (td::Random::fast(0, 5) == 0) {
+          std::string *new_str = new std::string(td::Random::fast(0, 1) == 0 ? "one" : "twotwo");
+          if (node.name_.compare_exchange_strong(str, new_str, std::memory_order_acq_rel)) {
+            hazard_pointers.retire(thread_id, str);
+          } else {
+            delete new_str;
+          }
+        }
+      }
+    });
+    thread_id++;
+  }
+  for (auto &thread : threads) {
+    thread.join();
+  }
+  LOG(ERROR) << "Undeleted pointers: " << hazard_pointers.to_delete_size_unsafe();
+  CHECK(static_cast<int>(hazard_pointers.to_delete_size_unsafe()) <= threads_n * threads_n);
+  for (int i = 0; i < threads_n; i++) {
+    hazard_pointers.retire(i);
+  }
+  CHECK(hazard_pointers.to_delete_size_unsafe() == 0);
+}
+#endif  //!TD_THREAD_UNSUPPORTED
diff --git a/submodules/ton/tonlib-src/tdutils/test/MpmcQueue.cpp b/submodules/ton/tonlib-src/tdutils/test/MpmcQueue.cpp
new file mode 100644
index 0000000000..2f88177bd0
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/MpmcQueue.cpp
@@ -0,0 +1,219 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/MpmcQueue.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/tests.h"
+
+#include <algorithm>
+#include <tuple>
+
+TEST(OneValue, simple) {
+  {
+    std::string x{"hello"};
+    td::OneValue<std::string> value;
+    auto status = value.set_value(x);
+    CHECK(status);
+    CHECK(x.empty());
+    status = value.get_value(x);
+    CHECK(status);
+    CHECK(x == "hello");
+  }
+  {
+    td::OneValue<std::string> value;
+    std::string x;
+    auto status = value.get_value(x);
+    CHECK(!status);
+    CHECK(x.empty());
+    std::string y{"hello"};
+    status = value.set_value(y);
+    CHECK(!status);
+    CHECK(y == "hello");
+  }
+}
+
+#if !TD_THREAD_UNSUPPORTED
+TEST(OneValue, stress) {
+  td::Stage run;
+  td::Stage check;
+
+  std::string from;
+  bool set_status;
+
+  std::string to;
+  bool get_status;
+  std::vector<td::thread> threads;
+  td::OneValue<std::string> value;
+  for (size_t i = 0; i < 2; i++) {
+    threads.push_back(td::thread([&, id = i] {
+      for (td::uint64 round = 1; round < 100000; round++) {
+        if (id == 0) {
+          value.reset();
+          to = "";
+          from = "";
+        }
+        run.wait(round * 2);
+        if (id == 0) {
+          from = "hello";
+          set_status = value.set_value(from);
+        } else {
+          get_status = value.get_value(to);
+        }
+        check.wait(round * 2);
+        if (id == 0) {
+          if (set_status) {
+            CHECK(get_status);
+            CHECK(from.empty());
+            LOG_CHECK(to == "hello") << to;
+          } else {
+            CHECK(!get_status);
+            CHECK(from == "hello");
+            CHECK(to.empty());
+          }
+        }
+      }
+    }));
+  }
+  for (auto &thread : threads) {
+    thread.join();
+  }
+}
+#endif  //!TD_THREAD_UNSUPPORTED
+
+TEST(MpmcQueueBlock, simple) {
+  // Test doesn't work now and it is ok, try_pop, logic changed
+  /*
+  td::MpmcQueueBlock<std::string> block(2);
+  std::string x = "hello";
+  using PushStatus = td::MpmcQueueBlock<std::string>::PushStatus;
+  using PopStatus = td::MpmcQueueBlock<std::string>::PopStatus;
+  auto push_status = block.push(x);
+  CHECK(push_status == PushStatus::Ok);
+  CHECK(x.empty());
+  auto pop_status = block.pop(x);
+  CHECK(pop_status == PopStatus::Ok);
+  CHECK(x == "hello");
+  pop_status = block.try_pop(x);
+  CHECK(pop_status == PopStatus::Empty);
+  x = "hello";
+  push_status = block.push(x);
+  CHECK(push_status == PushStatus::Ok);
+  x = "hello";
+  push_status = block.push(x);
+  CHECK(push_status == PushStatus::Closed);
+  CHECK(x == "hello");
+  x = "";
+  pop_status = block.try_pop(x);
+  CHECK(pop_status == PopStatus::Ok);
+  pop_status = block.try_pop(x);
+  CHECK(pop_status == PopStatus::Closed);
+  */
+}
+
+TEST(MpmcQueue, simple) {
+  td::MpmcQueue<int> q(2, 1);
+  for (int t = 0; t < 2; t++) {
+    for (int i = 0; i < 100; i++) {
+      q.push(i, 0);
+    }
+    for (int i = 0; i < 100; i++) {
+      int x = q.pop(0);
+      LOG_CHECK(x == i) << x << " expected " << i;
+    }
+  }
+}
+
+#if !TD_THREAD_UNSUPPORTED
+TEST(MpmcQueue, multi_thread) {
+  size_t n = 10;
+  size_t m = 10;
+  struct Data {
+    size_t from{0};
+    size_t value{0};
+  };
+  struct ThreadData {
+    std::vector<Data> v;
+    char pad[64];
+  };
+  td::MpmcQueue<Data> q(1024, n + m + 1);
+  std::vector<td::thread> n_threads(n);
+  std::vector<td::thread> m_threads(m);
+  std::vector<ThreadData> thread_data(m);
+  size_t thread_id = 0;
+  for (auto &thread : m_threads) {
+    thread = td::thread([&, thread_id] {
+      while (true) {
+        auto data = q.pop(thread_id);
+        if (data.value == 0) {
+          return;
+        }
+        thread_data[thread_id].v.push_back(data);
+      }
+    });
+    thread_id++;
+  }
+  size_t qn = 100000;
+  for (auto &thread : n_threads) {
+    thread = td::thread([&, thread_id] {
+      for (size_t i = 0; i < qn; i++) {
+        Data data;
+        data.from = thread_id - m;
+        data.value = i + 1;
+        q.push(data, thread_id);
+      }
+    });
+    thread_id++;
+  }
+  for (auto &thread : n_threads) {
+    thread.join();
+  }
+  for (size_t i = 0; i < m; i++) {
+    Data data;
+    data.from = 0;
+    data.value = 0;
+    q.push(data, thread_id);
+  }
+  for (auto &thread : m_threads) {
+    thread.join();
+  }
+  std::vector<Data> all;
+  for (size_t i = 0; i < m; i++) {
+    std::vector<size_t> from(n, 0);
+    for (auto &data : thread_data[i].v) {
+      all.push_back(data);
+      CHECK(data.value > from[data.from]);
+      from[data.from] = data.value;
+    }
+  }
+  LOG_CHECK(all.size() == n * qn) << all.size();
+  std::sort(all.begin(), all.end(),
+            [](const auto &a, const auto &b) { return std::tie(a.from, a.value) < std::tie(b.from, b.value); });
+  for (size_t i = 0; i < n * qn; i++) {
+    CHECK(all[i].from == i / qn);
+    CHECK(all[i].value == i % qn + 1);
+  }
+  LOG(INFO) << "Undeleted pointers: " << q.hazard_pointers_to_delele_size_unsafe();
+  CHECK(q.hazard_pointers_to_delele_size_unsafe() <= (n + m + 1) * (n + m + 1));
+  for (size_t id = 0; id < n + m + 1; id++) {
+    q.gc(id);
+  }
+  LOG_CHECK(q.hazard_pointers_to_delele_size_unsafe() == 0) << q.hazard_pointers_to_delele_size_unsafe();
+}
+#endif  //!TD_THREAD_UNSUPPORTED
diff --git a/submodules/ton/tonlib-src/tdutils/test/MpmcWaiter.cpp b/submodules/ton/tonlib-src/tdutils/test/MpmcWaiter.cpp
new file mode 100644
index 0000000000..cf75b5252d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/MpmcWaiter.cpp
@@ -0,0 +1,129 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/MpmcWaiter.h"
+#include "td/utils/port/sleep.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/Random.h"
+#include "td/utils/tests.h"
+
+#include <atomic>
+
+#if !TD_THREAD_UNSUPPORTED
+TEST(MpmcWaiter, stress_one_one) {
+  td::Stage run;
+  td::Stage check;
+
+  std::vector<td::thread> threads;
+  std::atomic<size_t> value{0};
+  size_t write_cnt = 10;
+  td::unique_ptr<td::MpmcWaiter> waiter;
+  size_t threads_n = 2;
+  for (size_t i = 0; i < threads_n; i++) {
+    threads.push_back(td::thread([&, id = static_cast<td::uint32>(i)] {
+      for (td::uint64 round = 1; round < 100000; round++) {
+        if (id == 0) {
+          value = 0;
+          waiter = td::make_unique<td::MpmcWaiter>();
+          write_cnt = td::Random::fast(1, 10);
+        }
+        run.wait(round * threads_n);
+        if (id == 1) {
+          for (size_t i = 0; i < write_cnt; i++) {
+            value.store(i + 1, std::memory_order_relaxed);
+            waiter->notify();
+          }
+        } else {
+          int yields = 0;
+          for (size_t i = 1; i <= write_cnt; i++) {
+            while (true) {
+              auto x = value.load(std::memory_order_relaxed);
+              if (x >= i) {
+                break;
+              }
+              yields = waiter->wait(yields, id);
+            }
+            yields = waiter->stop_wait(yields, id);
+          }
+        }
+        check.wait(round * threads_n);
+      }
+    }));
+  }
+  for (auto &thread : threads) {
+    thread.join();
+  }
+}
+TEST(MpmcWaiter, stress) {
+  td::Stage run;
+  td::Stage check;
+
+  std::vector<td::thread> threads;
+  size_t write_n;
+  size_t read_n;
+  std::atomic<size_t> write_pos{0};
+  std::atomic<size_t> read_pos{0};
+  size_t end_pos;
+  size_t write_cnt;
+  size_t threads_n = 20;
+  td::unique_ptr<td::MpmcWaiter> waiter;
+  for (size_t i = 0; i < threads_n; i++) {
+    threads.push_back(td::thread([&, id = static_cast<td::uint32>(i)] {
+      for (td::uint64 round = 1; round < 1000; round++) {
+        if (id == 0) {
+          write_n = td::Random::fast(1, 10);
+          read_n = td::Random::fast(1, 10);
+          write_cnt = td::Random::fast(1, 50);
+          end_pos = write_n * write_cnt;
+          write_pos = 0;
+          read_pos = 0;
+          waiter = td::make_unique<td::MpmcWaiter>();
+        }
+        run.wait(round * threads_n);
+        if (id <= write_n) {
+          for (size_t i = 0; i < write_cnt; i++) {
+            if (td::Random::fast(0, 20) == 0) {
+              td::usleep_for(td::Random::fast(1, 300));
+            }
+            write_pos.fetch_add(1, std::memory_order_relaxed);
+            waiter->notify();
+          }
+        } else if (id > 10 && id - 10 <= read_n) {
+          int yields = 0;
+          while (true) {
+            auto x = read_pos.load(std::memory_order_relaxed);
+            if (x == end_pos) {
+              break;
+            }
+            if (x == write_pos.load(std::memory_order_relaxed)) {
+              yields = waiter->wait(yields, id);
+              continue;
+            }
+            yields = waiter->stop_wait(yields, id);
+            read_pos.compare_exchange_strong(x, x + 1, std::memory_order_relaxed);
+          }
+        }
+        check.wait(round * threads_n);
+      }
+    }));
+  }
+  for (auto &thread : threads) {
+    thread.join();
+  }
+}
+#endif  // !TD_THREAD_UNSUPPORTED
diff --git a/submodules/ton/tonlib-src/tdutils/test/MpscLinkQueue.cpp b/submodules/ton/tonlib-src/tdutils/test/MpscLinkQueue.cpp
new file mode 100644
index 0000000000..c7243ce0b2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/MpscLinkQueue.cpp
@@ -0,0 +1,128 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/MpscLinkQueue.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/tests.h"
+
+class NodeX : public td::MpscLinkQueueImpl::Node {
+ public:
+  explicit NodeX(int value) : value_(value) {
+  }
+  td::MpscLinkQueueImpl::Node *to_mpsc_link_queue_node() {
+    return static_cast<td::MpscLinkQueueImpl::Node *>(this);
+  }
+  static NodeX *from_mpsc_link_queue_node(td::MpscLinkQueueImpl::Node *node) {
+    return static_cast<NodeX *>(node);
+  }
+  int value() {
+    return value_;
+  }
+
+ private:
+  int value_;
+};
+using QueueNode = td::MpscLinkQueueUniquePtrNode<NodeX>;
+
+QueueNode create_node(int value) {
+  return QueueNode(td::make_unique<NodeX>(value));
+}
+
+TEST(MpscLinkQueue, one_thread) {
+  td::MpscLinkQueue<QueueNode> queue;
+
+  {
+    queue.push(create_node(1));
+    queue.push(create_node(2));
+    queue.push(create_node(3));
+    td::MpscLinkQueue<QueueNode>::Reader reader;
+    queue.pop_all(reader);
+    queue.push(create_node(4));
+    queue.pop_all(reader);
+    std::vector<int> v;
+    while (auto node = reader.read()) {
+      v.push_back(node.value().value());
+    }
+    LOG_CHECK((v == std::vector<int>{1, 2, 3, 4})) << td::format::as_array(v);
+
+    v.clear();
+    queue.push(create_node(5));
+    queue.pop_all(reader);
+    while (auto node = reader.read()) {
+      v.push_back(node.value().value());
+    }
+    LOG_CHECK((v == std::vector<int>{5})) << td::format::as_array(v);
+  }
+
+  {
+    queue.push_unsafe(create_node(3));
+    queue.push_unsafe(create_node(2));
+    queue.push_unsafe(create_node(1));
+    queue.push_unsafe(create_node(0));
+    td::MpscLinkQueue<QueueNode>::Reader reader;
+    queue.pop_all_unsafe(reader);
+    std::vector<int> v;
+    while (auto node = reader.read()) {
+      v.push_back(node.value().value());
+    }
+    LOG_CHECK((v == std::vector<int>{3, 2, 1, 0})) << td::format::as_array(v);
+  }
+}
+
+#if !TD_THREAD_UNSUPPORTED
+TEST(MpscLinkQueue, multi_thread) {
+  td::MpscLinkQueue<QueueNode> queue;
+  int threads_n = 10;
+  int queries_n = 1000000;
+  std::vector<int> next_value(threads_n);
+  std::vector<td::thread> threads(threads_n);
+  int thread_i = 0;
+  for (auto &thread : threads) {
+    thread = td::thread([&, id = thread_i] {
+      for (int i = 0; i < queries_n; i++) {
+        queue.push(create_node(i * threads_n + id));
+      }
+    });
+    thread_i++;
+  }
+
+  int active_threads = threads_n;
+
+  td::MpscLinkQueue<QueueNode>::Reader reader;
+  while (active_threads) {
+    queue.pop_all(reader);
+    while (auto value = reader.read()) {
+      auto x = value.value().value();
+      auto thread_id = x % threads_n;
+      x /= threads_n;
+      CHECK(next_value[thread_id] == x);
+      next_value[thread_id]++;
+      if (x + 1 == queries_n) {
+        active_threads--;
+      }
+    }
+  }
+
+  for (auto &thread : threads) {
+    thread.join();
+  }
+}
+#endif  //!TD_THREAD_UNSUPPORTED
diff --git a/submodules/ton/tonlib-src/tdutils/test/OrderedEventsProcessor.cpp b/submodules/ton/tonlib-src/tdutils/test/OrderedEventsProcessor.cpp
new file mode 100644
index 0000000000..487a70c04b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/OrderedEventsProcessor.cpp
@@ -0,0 +1,48 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/OrderedEventsProcessor.h"
+#include "td/utils/Random.h"
+#include "td/utils/tests.h"
+
+#include <algorithm>
+#include <utility>
+#include <vector>
+
+TEST(OrderedEventsProcessor, random) {
+  int d = 5001;
+  int n = 1000000;
+  int offset = 1000000;
+  std::vector<std::pair<int, int>> v;
+  for (int i = 0; i < n; i++) {
+    auto shift = td::Random::fast(0, 1) ? td::Random::fast(0, d) : td::Random::fast(0, 1) * d;
+    v.push_back({i + shift, i + offset});
+  }
+  std::sort(v.begin(), v.end());
+
+  td::OrderedEventsProcessor<int> processor(offset);
+  int next_pos = offset;
+  for (auto p : v) {
+    int seq_no = p.second;
+    processor.add(seq_no, seq_no, [&](auto seq_no, int x) {
+      ASSERT_EQ(x, next_pos);
+      next_pos++;
+    });
+  }
+  ASSERT_EQ(next_pos, n + offset);
+}
diff --git a/submodules/ton/tonlib-src/tdutils/test/SharedObjectPool.cpp b/submodules/ton/tonlib-src/tdutils/test/SharedObjectPool.cpp
new file mode 100644
index 0000000000..b6d42ebe6c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/SharedObjectPool.cpp
@@ -0,0 +1,117 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/common.h"
+#include "td/utils/SharedObjectPool.h"
+#include "td/utils/tests.h"
+
+#include <memory>
+
+TEST(AtomicRefCnt, simple) {
+  td::detail::AtomicRefCnt cnt{0};
+  cnt.inc();
+  cnt.inc();
+  CHECK(!cnt.dec());
+  cnt.inc();
+  CHECK(!cnt.dec());
+  CHECK(cnt.dec());
+  cnt.inc();
+  CHECK(cnt.dec());
+}
+
+template <class T, class D>
+using Ptr = td::detail::SharedPtr<T, D>;
+class Deleter {
+ public:
+  template <class T>
+  void operator()(T *t) {
+    std::default_delete<T>()(t);
+    was_delete() = true;
+  }
+  static bool &was_delete() {
+    static bool flag = false;
+    return flag;
+  }
+};
+
+TEST(SharedPtr, simple) {
+  CHECK(!Deleter::was_delete());
+  Ptr<std::string, Deleter> ptr = Ptr<std::string, Deleter>::create("hello");
+  auto ptr2 = ptr;
+  CHECK(*ptr == "hello");
+  CHECK(*ptr2 == "hello");
+  ptr.reset();
+  CHECK(*ptr2 == "hello");
+  CHECK(ptr.empty());
+  Ptr<std::string, Deleter> ptr3 = std::move(ptr2);
+  CHECK(ptr2.empty());
+  CHECK(*ptr3 == "hello");
+  ptr = ptr3;
+  CHECK(*ptr3 == "hello");
+  ptr3.reset();
+  CHECK(*ptr == "hello");
+  ptr2 = std::move(ptr);
+  CHECK(ptr.empty());
+  CHECK(*ptr2 == "hello");
+#if TD_CLANG
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wunknown-pragmas"
+#pragma clang diagnostic ignored "-Wunknown-warning-option"
+#pragma clang diagnostic ignored "-Wself-assign-overloaded"
+#endif
+  ptr2 = ptr2;
+#if TD_CLANG
+#pragma clang diagnostic pop
+#endif
+  CHECK(*ptr2 == "hello");
+  CHECK(!Deleter::was_delete());
+  ptr2.reset();
+  CHECK(Deleter::was_delete());
+  CHECK(ptr2.empty());
+}
+
+TEST(SharedObjectPool, simple) {
+  class Node {
+   public:
+    Node() {
+      cnt()++;
+    };
+    ~Node() {
+      cnt()--;
+    }
+    static int &cnt() {
+      static int cnt_ = 0;
+      return cnt_;
+    }
+  };
+  {
+    td::SharedObjectPool<Node> pool;
+    { auto ptr1 = pool.alloc(); }
+    { auto ptr2 = pool.alloc(); }
+    { auto ptr3 = pool.alloc(); }
+    { auto ptr4 = pool.alloc(); }
+    { auto ptr5 = pool.alloc(); }
+    CHECK(Node::cnt() == 0);
+    CHECK(pool.total_size() == 1);
+    CHECK(pool.calc_free_size() == 1);
+    { auto ptr6 = pool.alloc(), ptr7 = pool.alloc(), ptr8 = pool.alloc(); }
+    CHECK(pool.total_size() == 3);
+    CHECK(pool.calc_free_size() == 3);
+  }
+  CHECK(Node::cnt() == 0);
+}
diff --git a/submodules/ton/tonlib-src/tdutils/test/SharedSlice.cpp b/submodules/ton/tonlib-src/tdutils/test/SharedSlice.cpp
new file mode 100644
index 0000000000..af1b2ad60c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/SharedSlice.cpp
@@ -0,0 +1,97 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/tests.h"
+#include "td/utils/SharedSlice.h"
+
+using namespace td;
+
+TEST(SharedSlice, Hands) {
+  {
+    SharedSlice h("hello");
+    ASSERT_EQ("hello", h.as_slice());
+    // auto g = h; // CE
+    auto g = h.clone();
+    ASSERT_EQ("hello", g.as_slice());
+  }
+
+  {
+    SharedSlice h("hello");
+    UniqueSharedSlice g(std::move(h));
+    ASSERT_EQ("", h.as_slice());
+    ASSERT_EQ("hello", g.as_slice());
+  }
+  {
+    SharedSlice h("hello");
+    SharedSlice t = h.clone();
+    UniqueSharedSlice g(std::move(h));
+    ASSERT_EQ("", h.as_slice());
+    ASSERT_EQ("hello", g.as_slice());
+    ASSERT_EQ("hello", t.as_slice());
+  }
+
+  {
+    UniqueSharedSlice g(5);
+    g.as_mutable_slice().copy_from("hello");
+    SharedSlice h(std::move(g));
+    ASSERT_EQ("hello", h);
+    ASSERT_EQ("", g);
+  }
+
+  {
+    UniqueSlice h("hello");
+    UniqueSlice g(std::move(h));
+    ASSERT_EQ("", h.as_slice());
+    ASSERT_EQ("hello", g.as_slice());
+  }
+
+  {
+    SecureString h("hello");
+    SecureString g(std::move(h));
+    ASSERT_EQ("", h.as_slice());
+    ASSERT_EQ("hello", g.as_slice());
+  }
+
+  {
+    Stage stage;
+    SharedSlice a, b;
+    std::vector<td::thread> threads(2);
+    for (int i = 0; i < 2; i++) {
+      threads[i] = td::thread([i, &stage, &a, &b] {
+        for (int j = 0; j < 10000; j++) {
+          if (i == 0) {
+            a = SharedSlice("hello");
+            b = a.clone();
+          }
+          stage.wait((2 * j + 1) * 2);
+          if (i == 0) {
+            ASSERT_EQ('h', a[0]);
+            a.clear();
+          } else {
+            UniqueSharedSlice c(std::move(b));
+            c.as_mutable_slice()[0] = '!';
+          }
+          stage.wait((2 * j + 2) * 2);
+        }
+      });
+    }
+    for (auto &thread : threads) {
+      thread.join();
+    }
+  }
+}
diff --git a/submodules/ton/tonlib-src/tdutils/test/buffer.cpp b/submodules/ton/tonlib-src/tdutils/test/buffer.cpp
new file mode 100644
index 0000000000..ff3af4b1be
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/buffer.cpp
@@ -0,0 +1,70 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/tests.h"
+
+#include "td/utils/buffer.h"
+#include "td/utils/Random.h"
+
+using namespace td;
+
+TEST(Buffer, buffer_builder) {
+  {
+    BufferBuilder builder;
+    builder.append("b");
+    builder.prepend("a");
+    builder.append("c");
+    ASSERT_EQ(builder.extract().as_slice(), "abc");
+  }
+  {
+    BufferBuilder builder{"hello", 0, 0};
+    ASSERT_EQ(builder.extract().as_slice(), "hello");
+  }
+  {
+    BufferBuilder builder{"hello", 1, 1};
+    builder.prepend("A ");
+    builder.append(" B");
+    ASSERT_EQ(builder.extract().as_slice(), "A hello B");
+  }
+  {
+    std::string str = rand_string('a', 'z', 10000);
+    auto splitted_str = rand_split(str);
+
+    int l = Random::fast(0, static_cast<int32>(splitted_str.size() - 1));
+    int r = l;
+    BufferBuilder builder(splitted_str[l], 123, 1000);
+    while (l != 0 || r != static_cast<int32>(splitted_str.size()) - 1) {
+      if (l == 0 || (Random::fast(0, 1) == 1 && r != static_cast<int32>(splitted_str.size() - 1))) {
+        r++;
+        if (Random::fast(0, 1) == 1) {
+          builder.append(splitted_str[r]);
+        } else {
+          builder.append(BufferSlice(splitted_str[r]));
+        }
+      } else {
+        l--;
+        if (Random::fast(0, 1) == 1) {
+          builder.prepend(splitted_str[l]);
+        } else {
+          builder.prepend(BufferSlice(splitted_str[l]));
+        }
+      }
+    }
+    ASSERT_EQ(builder.extract().as_slice(), str);
+  }
+}
diff --git a/submodules/ton/tonlib-src/tdutils/test/crypto.cpp b/submodules/ton/tonlib-src/tdutils/test/crypto.cpp
new file mode 100644
index 0000000000..b965b428ea
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/crypto.cpp
@@ -0,0 +1,304 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/base64.h"
+#include "td/utils/benchmark.h"
+#include "td/utils/common.h"
+#include "td/utils/crypto.h"
+#include "td/utils/logging.h"
+#include "td/utils/Slice.h"
+#include "td/utils/tests.h"
+#include "td/utils/UInt.h"
+
+#include <limits>
+
+static td::vector<td::string> strings{"", "1", "short test string", td::string(1000000, 'a')};
+
+#if TD_HAVE_OPENSSL
+TEST(Crypto, AesCtrState) {
+  td::vector<td::uint32> answers1{0u,         1141589763u, 596296607u,  3673001485u, 2302125528u,
+                                  330967191u, 2047392231u, 3537459563u, 307747798u,  2149598133u};
+  td::vector<td::uint32> answers2{0u,         2053451992u, 1384063362u, 3266188502u, 2893295118u,
+                                  780356167u, 1904947434u, 2043402406u, 472080809u,  1807109488u};
+
+  std::size_t i = 0;
+  for (auto length : {0, 1, 31, 32, 33, 9999, 10000, 10001, 999999, 1000001}) {
+    td::uint32 seed = length;
+    td::string s(length, '\0');
+    for (auto &c : s) {
+      seed = seed * 123457567u + 987651241u;
+      c = static_cast<char>((seed >> 23) & 255);
+    }
+
+    td::UInt256 key;
+    for (auto &c : key.raw) {
+      seed = seed * 123457567u + 987651241u;
+      c = (seed >> 23) & 255;
+    }
+    td::UInt128 iv;
+    for (auto &c : iv.raw) {
+      seed = seed * 123457567u + 987651241u;
+      c = (seed >> 23) & 255;
+    }
+
+    td::AesCtrState state;
+    state.init(as_slice(key), as_slice(iv));
+    td::string t(length, '\0');
+    state.encrypt(s, t);
+    ASSERT_EQ(answers1[i], td::crc32(t));
+    state.init(as_slice(key), as_slice(iv));
+    state.decrypt(t, t);
+    ASSERT_STREQ(s, t);
+
+    for (auto &c : iv.raw) {
+      c = 0xFF;
+    }
+    state.init(as_slice(key), as_slice(iv));
+    state.encrypt(s, t);
+    ASSERT_EQ(answers2[i], td::crc32(t));
+
+    i++;
+  }
+}
+
+TEST(Crypto, Sha256State) {
+  for (auto length : {0, 1, 31, 32, 33, 9999, 10000, 10001, 999999, 1000001}) {
+    auto s = td::rand_string(std::numeric_limits<char>::min(), std::numeric_limits<char>::max(), length);
+    td::UInt256 baseline;
+    td::sha256(s, as_slice(baseline));
+
+    td::Sha256State state;
+    state.init();
+    td::Sha256State state2 = std::move(state);
+    auto v = td::rand_split(s);
+    for (auto &x : v) {
+      state2.feed(x);
+    }
+    state = std::move(state2);
+    td::UInt256 result;
+    state.extract(as_slice(result));
+    ASSERT_TRUE(baseline == result);
+  }
+}
+
+TEST(Crypto, PBKDF) {
+  td::vector<td::string> passwords{"", "qwerty", std::string(1000, 'a')};
+  td::vector<td::string> salts{"", "qwerty", std::string(1000, 'a')};
+  td::vector<int> iteration_counts{1, 2, 1000};
+  td::vector<td::Slice> answers{
+      "984LZT0tcqQQjPWr6RL/3Xd2Ftu7J6cOggTzri0Pb60=", "lzmEEdaupDp3rO+SImq4J41NsGaL0denanJfdoCsRcU=",
+      "T8WKIcEAzhg1uPmZHXOLVpZdFLJOF2H73/xprF4LZno=", "NHxAnMhPOATsb1wV0cGDlAIs+ofzI6I4I8eGJeWN9Qw=",
+      "fjYi7waEPjbVYEuZ61/Nm2hbk/vRdShoJoXg4Ygnqe4=", "GhW6e95hGJSf+ID5IrSbvzWyBZ1l35A+UoL55Uh/njk=",
+      "BueLDpqSCEc0GWk83WgMwz3UsWwfvVKcvllETSB/Yq8=", "hgHgJZNWRh78PyPdVJsK8whgHOHQbNQiyaTuGDX2IFo=",
+      "T2xdyNT1GlcA4+MVNzOe7NCgSAAzNkanNsmuoSr+4xQ=", "/f6t++GUPE+e63+0TrlInL+UsmzRSAAFopa8BBBmb2w=",
+      "8Zn98QEAKS9wPOUlN09+pfm0SWs1IGeQxQkNMT/1k48=", "sURLQ/6UX/KVYedyQB21oAtMJ+STZ4iwpxfQtqmWkLw=",
+      "T9t/EJXFpPs2Lhca7IVGphTC/OdEloPMHw1UhDnXcyQ=", "TIrtN05E9KQL6Lp/wjtbsFS+KkWZ8jlGK0ErtaoitOg=",
+      "+1KcMBjyUNz5VMaIfE5wkGwS6I+IQ5FhK+Ou2HgtVoQ=", "h36ci1T0vGllCl/xJxq6vI7n28Bg40dilzWOKg6Jt8k=",
+      "9uwsHJsotTiTqqCYftN729Dg7QI2BijIjV2MvSEUAeE=", "/l+vd/XYgbioh1SfLMaGRr13udmY6TLSlG4OYmytwGU=",
+      "7qfZZBbMRLtgjqq7GHgWa/UfXPajW8NXpJ6/T3P1rxI=", "ufwz94p28WnoOFdbrb1oyQEzm/v0CV2b0xBVxeEPJGA=",
+      "T/PUUBX2vGMUsI6httlhbMHlGPMvqFBNzayU5voVlaw=", "viMvsvTg9GfQymF3AXZ8uFYTDa3qLrqJJk9w/74iZfg=",
+      "HQF+rOZMW4DAdgZz8kAMe28eyIi0rs3a3u/mUeGPNfs=", "7lBVA+GnSxWF/eOo+tyyTB7niMDl1MqP8yzo+xnHTyw=",
+      "aTWb7HQAxaTKhSiRPY3GuM1GVmq/FPuwWBU/TUpdy70=", "fbg8M/+Ht/oU+UAZ4dQcGPo+wgCCHaA+GM4tm5jnWcY=",
+      "DJbCGFMIR/5neAlpda8Td5zftK4NGekVrg2xjrKW/4c="};
+
+  std::size_t pos = 0;
+  for (auto &password : passwords) {
+    for (auto &salt : salts) {
+      for (auto &iteration_count : iteration_counts) {
+        char result[32];
+        td::pbkdf2_sha256(password, salt, iteration_count, {result, 32});
+        ASSERT_STREQ(answers[pos], td::base64_encode({result, 32}));
+        pos++;
+      }
+    }
+  }
+}
+
+TEST(Crypto, sha1) {
+  td::vector<td::Slice> answers{"2jmj7l5rSw0yVb/vlWAYkK/YBwk=", "NWoZK3kTsExUV00Ywo1G5jlUKKs=",
+                                "uRysQwoax0pNJeBC3+zpQzJy1rA=", "NKqXPNTE2qT2Husr260nMWU0AW8="};
+
+  for (std::size_t i = 0; i < strings.size(); i++) {
+    unsigned char output[20];
+    td::sha1(strings[i], output);
+    ASSERT_STREQ(answers[i], td::base64_encode(td::Slice(output, 20)));
+  }
+}
+
+TEST(Crypto, sha256) {
+  td::vector<td::Slice> answers{
+      "47DEQpj8HBSa+/TImW+5JCeuQeRkm5NMpJWZG3hSuFU=", "a4ayc/80/OGda4BO/1o/V0etpOqiLx1JwB5S3beHW0s=",
+      "yPMaY7Q8PKPwCsw64UnDD5mhRcituEJgzLZMvr0O8pY=", "zcduXJkU+5KBocfihNc+Z/GAmkiklyAOBG05zMcRLNA="};
+
+  for (std::size_t i = 0; i < strings.size(); i++) {
+    td::string output(32, '\0');
+    td::sha256(strings[i], output);
+    ASSERT_STREQ(answers[i], td::base64_encode(output));
+  }
+}
+
+TEST(Crypto, md5) {
+  td::vector<td::Slice> answers{
+      "1B2M2Y8AsgTpgAmY7PhCfg==", "xMpCOKC5I4INzFCab3WEmw==", "vwBninYbDRkgk+uA7GMiIQ==", "dwfWrk4CfHDuoqk1wilvIQ=="};
+
+  for (std::size_t i = 0; i < strings.size(); i++) {
+    td::string output(16, '\0');
+    td::md5(strings[i], output);
+    ASSERT_STREQ(answers[i], td::base64_encode(output));
+  }
+}
+#endif
+
+#if TD_HAVE_ZLIB
+TEST(Crypto, crc32) {
+  td::vector<td::uint32> answers{0u, 2212294583u, 3013144151u, 3693461436u};
+
+  for (std::size_t i = 0; i < strings.size(); i++) {
+    ASSERT_EQ(answers[i], td::crc32(strings[i]));
+  }
+}
+#endif
+
+#if TD_HAVE_CRC32C
+TEST(Crypto, crc32c) {
+  td::vector<td::uint32> answers{0u, 2432014819u, 1077264849u, 1131405888u};
+
+  for (std::size_t i = 0; i < strings.size(); i++) {
+    ASSERT_EQ(answers[i], td::crc32c(strings[i]));
+
+    auto v = td::rand_split(strings[i]);
+    td::uint32 a = 0;
+    td::uint32 b = 0;
+    for (auto &x : v) {
+      a = td::crc32c_extend(a, x);
+      auto x_crc = td::crc32c(x);
+      b = td::crc32c_extend(b, x_crc, x.size());
+    }
+    ASSERT_EQ(answers[i], a);
+    ASSERT_EQ(answers[i], b);
+  }
+}
+
+TEST(Crypto, crc32c_benchmark) {
+  class Crc32cExtendBenchmark : public td::Benchmark {
+   public:
+    explicit Crc32cExtendBenchmark(size_t chunk_size) : chunk_size_(chunk_size) {
+    }
+    std::string get_description() const override {
+      return PSTRING() << "Crc32c with chunk_size=" << chunk_size_;
+    }
+    void start_up_n(int n) override {
+      if (n > (1 << 20)) {
+        cnt_ = n / (1 << 20);
+        n = (1 << 20);
+      } else {
+        cnt_ = 1;
+      }
+      data_ = std::string(n, 'a');
+    }
+    void run(int n) override {
+      td::uint32 res = 0;
+      for (int i = 0; i < cnt_; i++) {
+        td::Slice data(data_);
+        while (!data.empty()) {
+          auto head = data.substr(0, chunk_size_);
+          data = data.substr(head.size());
+          res = td::crc32c_extend(res, head);
+        }
+      }
+      td::do_not_optimize_away(res);
+    }
+
+   private:
+    size_t chunk_size_;
+    std::string data_;
+    int cnt_;
+  };
+  bench(Crc32cExtendBenchmark(2));
+  bench(Crc32cExtendBenchmark(8));
+  bench(Crc32cExtendBenchmark(32));
+  bench(Crc32cExtendBenchmark(128));
+  bench(Crc32cExtendBenchmark(65536));
+}
+#endif
+
+TEST(Crypto, crc64) {
+  td::vector<td::uint64> answers{0ull, 3039664240384658157ull, 17549519902062861804ull, 8794730974279819706ull};
+
+  for (std::size_t i = 0; i < strings.size(); i++) {
+    ASSERT_EQ(answers[i], td::crc64(strings[i]));
+  }
+}
+
+TEST(Crypto, crc16) {
+  td::vector<td::uint16> answers{0, 9842, 25046, 37023};
+
+  for (std::size_t i = 0; i < strings.size(); i++) {
+    ASSERT_EQ(answers[i], td::crc16(strings[i]));
+  }
+}
+
+static td::Slice rsa_private_key = R"ABCD(
+-----BEGIN PRIVATE KEY-----
+MIIEvQIBADANBgkqhkiG9w0BAQEFAASCBKcwggSjAgEAAoIBAQDeYT5/prmLEa2Q
+tZND+UwTmif8kl2VlXaMCjj1k1lJJq8BqS8cVM2vPnOPzFoiC2LYykhm4kk7goCC
+ZH6wez9yakg28fcq0Ycv0x8DL1K+VKHJuwIhVfQs//IY1/cBOrMESc+NQowPbv1t
+TIFxBO2gebnpLuseht8ix7XtpGC4qAaHN2aEvT2cRsnA76TAK1RVxf1OYGUFBDzY
+318WpVZfVIjcQ7K9+eU6b2Yb84VLlvJXw3e1rvw+fBzx2EjpD4zhXy11YppWDyV6
+HEb2hs3cGS/LbHfHvdcSfil2omaJP97MDEEY2HFxjR/E5CEf2suvPzX4XS3RE+S3
+2aEJaaQbAgMBAAECggEAKo3XRNwls0wNt5xXcvF4smOUdUuY5u/0AHZQUgYBVvM1
+GA9E+ZnsxjUgLgs/0DX3k16aHj39H4sohksuxxy+lmlqKkGBN8tioC85RwW+Qre1
+QgIsNS7ai+XqcQCavrx51z88nV53qNhnXIwAVR1JT6Ubg1i8G1pZxrEKyk/jRlJd
+mGjf6vjitH//PPkghPJ/D42k93YRcy+duOgqYDQpLZp8DiEGfYrX10B1H7HrWLV+
+Wp5KO1YXtKgQUplj6kYy72bVajbxYTvzgjaaKsh74jBO0uT3tHTtXG0dcKGb0VR/
+cqP/1H/lC9bAnAqAGefNusGJQZIElvTsrpIQXOeZsQKBgQD2W04S+FjqYYFjnEFX
+6eL4it01afs5M3/C6CcI5JQtN6p+Na4NCSILol33xwhakn87zqdADHawBYQVQ8Uw
+dPurl805wfkzN3AbfdDmtx0IJ8vK4HFpktRjfpwBVhlVtm1doAYFqqsuCF2vWW1t
+mM2YOSq4AnRHCeBb/P6kRIW0MwKBgQDnFawKKqiC4tuyBOkkEhexlm7x9he0md7D
+3Z2hc3Bmdcq1niw4wBq3HUxGLReGCcSr5epKSQwkunlTn5ZSC6Rmbe4zxsGIwbb3
+5W3342swBaoxEIuBokBvZ/xUOXVwiqKj+S/NzVkZcnT6K9V/HnUCQR+JBbQxFQaX
+iiezcjKoeQKBgCIVUcDoIQ0UPl10ocmy7xbpx177calhSZzCl5vwW9vBptHdRV5C
+VDZ92ThNjgdR205/8b23u7fwm2yBusdQd/0ufFMwVfTTB6yWBI/W56pYLya7VJWB
+nebB/n1k1w53tbvNRugDy7kLqUJ4Qd521ILp7dIVbNbjM+omH2jEnibnAoGBAIM5
+a1jaoJay/M86uqohHBNcuePtO8jzF+1iDAGC7HFCsrov+CzB6mnR2V6AfLtBEM4M
+4d8NXDf/LKawGUy+D72a74m3dG+UkbJ0Nt5t5pB+pwb1vkL/QFgDVOb/OhGOqI01
+FFBqLA6nUIZAHhzxzsBY+u90rb6xkey8J49faiUBAoGAaMgOgEvQB5H19ZL5tMkl
+A/DKtTz/NFzN4Zw/vNPVb7eNn4jg9M25d9xqvL4acOa+nuV3nLHbcUWE1/7STXw1
+gT58CvoEmD1AiP95nup+HKHENJ1DWMgF5MDfVQwGCvWP5/Qy89ybr0eG8HjbldbN
+MpSmzz2wOz152oGdOd3syT4=
+-----END PRIVATE KEY-----
+)ABCD";
+
+static td::Slice rsa_public_key = R"ABCD(
+-----BEGIN PUBLIC KEY-----
+MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA3mE+f6a5ixGtkLWTQ/lM
+E5on/JJdlZV2jAo49ZNZSSavAakvHFTNrz5zj8xaIgti2MpIZuJJO4KAgmR+sHs/
+cmpINvH3KtGHL9MfAy9SvlShybsCIVX0LP/yGNf3ATqzBEnPjUKMD279bUyBcQTt
+oHm56S7rHobfIse17aRguKgGhzdmhL09nEbJwO+kwCtUVcX9TmBlBQQ82N9fFqVW
+X1SI3EOyvfnlOm9mG/OFS5byV8N3ta78Pnwc8dhI6Q+M4V8tdWKaVg8lehxG9obN
+3Bkvy2x3x73XEn4pdqJmiT/ezAxBGNhxcY0fxOQhH9rLrz81+F0t0RPkt9mhCWmk
+GwIDAQAB
+-----END PUBLIC KEY-----
+)ABCD";
+
+TEST(Crypto, rsa) {
+  auto value = td::rand_string('a', 'z', 200);
+  auto encrypted_value = td::rsa_encrypt_pkcs1_oaep(rsa_public_key, value).move_as_ok();
+  auto decrypted_value = td::rsa_decrypt_pkcs1_oaep(rsa_private_key, encrypted_value.as_slice()).move_as_ok();
+  ASSERT_TRUE(decrypted_value.as_slice().truncate(value.size()) == value);
+}
diff --git a/submodules/ton/tonlib-src/tdutils/test/filesystem.cpp b/submodules/ton/tonlib-src/tdutils/test/filesystem.cpp
new file mode 100644
index 0000000000..3abdb54f56
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/filesystem.cpp
@@ -0,0 +1,54 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/filesystem.h"
+#include "td/utils/tests.h"
+
+TEST(Misc, clean_filename) {
+  using td::clean_filename;
+  ASSERT_STREQ(clean_filename("-1234567"), "-1234567");
+  ASSERT_STREQ(clean_filename(".git"), "git");
+  ASSERT_STREQ(clean_filename("../../.git"), "git");
+  ASSERT_STREQ(clean_filename(".././.."), "");
+  ASSERT_STREQ(clean_filename("../"), "");
+  ASSERT_STREQ(clean_filename(".."), "");
+  ASSERT_STREQ(clean_filename("test/git/   as   dsa  .   a"), "as   dsa.a");
+  ASSERT_STREQ(clean_filename("     .    "), "");
+  ASSERT_STREQ(clean_filename("!@#$%^&*()_+-=[]{;|:\"}'<>?,.`~"), "!@#$%^  ()_+-=[]{;   }    ,.~");
+  ASSERT_STREQ(clean_filename("!@#$%^&*()_+-=[]{}\\|:\";'<>?,.`~"), ";    ,.~");
+  ASSERT_STREQ(clean_filename("عرفها بعد قد. هذا مع تاريخ اليميني واندونيسيا،, لعدم تاريخ لهيمنة الى"),
+               "عرفها بعد قد.هذا مع تاريخ اليميني");
+  ASSERT_STREQ(
+      clean_filename(
+          "012345678901234567890123456789012345678901234567890123456789adsasdasdsaa.01234567890123456789asdasdasdasd"),
+      "012345678901234567890123456789012345678901234567890123456789.01234567890123456789");
+  ASSERT_STREQ(clean_filename("01234567890123456789012345678901234567890123456789<>*?: <>*?:0123456789adsasdasdsaa.   "
+                              "0123456789`<><<>><><>0123456789asdasdasdasd"),
+               "01234567890123456789012345678901234567890123456789.0123456789");
+  ASSERT_STREQ(clean_filename("01234567890123456789012345678901234567890123456789<>*?: <>*?:0123456789adsasdasdsaa.   "
+                              "0123456789`<><><>0123456789asdasdasdasd"),
+               "01234567890123456789012345678901234567890123456789.0123456789       012");
+  ASSERT_STREQ(clean_filename("C:/document.tar.gz"), "document.tar.gz");
+  ASSERT_STREQ(clean_filename("test...."), "test");
+  ASSERT_STREQ(clean_filename("....test"), "test");
+  ASSERT_STREQ(clean_filename("test.exe...."), "test.exe");  // extension has changed
+  ASSERT_STREQ(clean_filename("test.exe01234567890123456789...."),
+               "test.exe01234567890123456789");  // extension may be more then 20 characters
+  ASSERT_STREQ(clean_filename("....test....asdf"), "test.asdf");
+  ASSERT_STREQ(clean_filename("കറുപ്പ്.txt"), "കറപപ.txt");
+}
diff --git a/submodules/ton/tonlib-src/tdutils/test/gzip.cpp b/submodules/ton/tonlib-src/tdutils/test/gzip.cpp
new file mode 100644
index 0000000000..c1e9306e47
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/gzip.cpp
@@ -0,0 +1,125 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/buffer.h"
+#include "td/utils/ByteFlow.h"
+#include "td/utils/Gzip.h"
+#include "td/utils/GzipByteFlow.h"
+#include "td/utils/logging.h"
+#include "td/utils/Status.h"
+#include "td/utils/tests.h"
+
+static void encode_decode(td::string s) {
+  auto r = td::gzencode(s, 2);
+  ASSERT_TRUE(!r.empty());
+  if (r.empty()) {
+    return;
+  }
+  auto new_s = td::gzdecode(r.as_slice());
+  ASSERT_TRUE(!new_s.empty());
+  if (new_s.empty()) {
+    return;
+  }
+  ASSERT_EQ(s, new_s.as_slice().str());
+}
+
+TEST(Gzip, gzencode_gzdecode) {
+  auto str = td::rand_string(0, 127, 1000);
+  encode_decode(str);
+  str = td::rand_string('a', 'z', 1000000);
+  encode_decode(str);
+  str = td::string(1000000, 'a');
+  encode_decode(str);
+}
+
+TEST(Gzip, flow) {
+  auto str = td::rand_string('a', 'z', 1000000);
+  auto parts = td::rand_split(str);
+
+  td::ChainBufferWriter input_writer;
+  auto input = input_writer.extract_reader();
+  td::ByteFlowSource source(&input);
+  td::GzipByteFlow gzip_flow(td::Gzip::Encode);
+  gzip_flow = td::GzipByteFlow(td::Gzip::Encode);
+  td::ByteFlowSink sink;
+
+  source >> gzip_flow >> sink;
+
+  ASSERT_TRUE(!sink.is_ready());
+  for (auto &part : parts) {
+    input_writer.append(part);
+    source.wakeup();
+  }
+  ASSERT_TRUE(!sink.is_ready());
+  source.close_input(td::Status::OK());
+  ASSERT_TRUE(sink.is_ready());
+  ASSERT_TRUE(sink.status().is_ok());
+  auto res = sink.result()->move_as_buffer_slice().as_slice().str();
+  ASSERT_TRUE(!res.empty());
+  ASSERT_EQ(td::gzencode(str, 2).as_slice().str(), res);
+}
+TEST(Gzip, flow_error) {
+  auto str = td::rand_string('a', 'z', 1000000);
+  auto zip = td::gzencode(str).as_slice().str();
+  zip.resize(zip.size() - 1);
+  auto parts = td::rand_split(zip);
+
+  auto input_writer = td::ChainBufferWriter();
+  auto input = input_writer.extract_reader();
+  td::ByteFlowSource source(&input);
+  td::GzipByteFlow gzip_flow(td::Gzip::Decode);
+  td::ByteFlowSink sink;
+
+  source >> gzip_flow >> sink;
+
+  ASSERT_TRUE(!sink.is_ready());
+  for (auto &part : parts) {
+    input_writer.append(part);
+    source.wakeup();
+  }
+  ASSERT_TRUE(!sink.is_ready());
+  source.close_input(td::Status::OK());
+  ASSERT_TRUE(sink.is_ready());
+  ASSERT_TRUE(!sink.status().is_ok());
+}
+
+TEST(Gzip, encode_decode_flow) {
+  auto str = td::rand_string('a', 'z', 1000000);
+  auto parts = td::rand_split(str);
+  td::ChainBufferWriter input_writer;
+  auto input = input_writer.extract_reader();
+  td::ByteFlowSource source(&input);
+  td::GzipByteFlow gzip_encode_flow(td::Gzip::Encode);
+  td::GzipByteFlow gzip_decode_flow(td::Gzip::Decode);
+  td::GzipByteFlow gzip_encode_flow2(td::Gzip::Encode);
+  td::GzipByteFlow gzip_decode_flow2(td::Gzip::Decode);
+  td::ByteFlowSink sink;
+  source >> gzip_encode_flow >> gzip_decode_flow >> gzip_encode_flow2 >> gzip_decode_flow2 >> sink;
+
+  ASSERT_TRUE(!sink.is_ready());
+  for (auto &part : parts) {
+    input_writer.append(part);
+    source.wakeup();
+  }
+  ASSERT_TRUE(!sink.is_ready());
+  source.close_input(td::Status::OK());
+  ASSERT_TRUE(sink.is_ready());
+  LOG_IF(ERROR, sink.status().is_error()) << sink.status();
+  ASSERT_TRUE(sink.status().is_ok());
+  ASSERT_EQ(str, sink.result()->move_as_buffer_slice().as_slice().str());
+}
diff --git a/submodules/ton/tonlib-src/tdutils/test/heap.cpp b/submodules/ton/tonlib-src/tdutils/test/heap.cpp
new file mode 100644
index 0000000000..1eef4330b2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/heap.cpp
@@ -0,0 +1,189 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/tests.h"
+
+#include "td/utils/common.h"
+#include "td/utils/Heap.h"
+#include "td/utils/Random.h"
+
+#include <algorithm>
+#include <cstdio>
+#include <cstdlib>
+#include <set>
+#include <utility>
+
+REGISTER_TESTS(heap)
+
+using namespace td;
+
+TEST(Heap, sort_random_perm) {
+  int n = 1000000;
+  std::vector<int> v(n);
+  for (int i = 0; i < n; i++) {
+    v[i] = i;
+  }
+  std::srand(123);
+  std::random_shuffle(v.begin(), v.end());
+  std::vector<HeapNode> nodes(n);
+  KHeap<int> kheap;
+  for (int i = 0; i < n; i++) {
+    kheap.insert(v[i], &nodes[i]);
+  }
+  for (int i = 0; i < n; i++) {
+    ASSERT_EQ(i, kheap.top_key());
+    kheap.pop();
+  }
+};
+
+class CheckedHeap {
+ public:
+  void set_max_size(int max_size) {
+    nodes.resize(max_size);
+    free_ids.resize(max_size);
+    rev_ids.resize(max_size);
+    for (int i = 0; i < max_size; i++) {
+      free_ids[i] = max_size - i - 1;
+      nodes[i].value = i;
+    }
+  }
+  static void xx(int key, const HeapNode *heap_node) {
+    const Node *node = static_cast<const Node *>(heap_node);
+    std::fprintf(stderr, "(%d;%d)", node->key, node->value);
+  }
+  void check() const {
+    for (auto p : set_heap) {
+      std::fprintf(stderr, "(%d;%d)", p.first, p.second);
+    }
+    std::fprintf(stderr, "\n");
+    kheap.for_each(xx);
+    std::fprintf(stderr, "\n");
+    kheap.check();
+  }
+  int random_id() const {
+    CHECK(!empty());
+    return ids[Random::fast(0, static_cast<int>(ids.size() - 1))];
+  }
+  size_t size() const {
+    return ids.size();
+  }
+  bool empty() const {
+    return ids.empty();
+  }
+
+  int top_key() const {
+    CHECK(!empty());
+    int res = set_heap.begin()->first;
+    ASSERT_EQ(set_heap.size(), kheap.size());
+    ASSERT_EQ(res, kheap.top_key());
+    return res;
+  }
+  int insert(int key) {
+    // std::fprintf(stderr, "insert %d\n", key);
+    int id;
+    if (free_ids.empty()) {
+      UNREACHABLE();
+      id = static_cast<int>(nodes.size());
+      nodes.emplace_back(key, id);
+      rev_ids.push_back(-1);
+    } else {
+      id = free_ids.back();
+      free_ids.pop_back();
+      nodes[id].key = key;
+    }
+    rev_ids[id] = static_cast<int>(ids.size());
+    ids.push_back(id);
+    kheap.insert(key, &nodes[id]);
+    set_heap.emplace(key, id);
+    return id;
+  }
+  void fix_key(int new_key, int id) {
+    // std::fprintf(stderr, "fix key %d %d (old_key = %d)\n", new_key, id, nodes[id].key);
+    set_heap.erase(std::make_pair(nodes[id].key, id));
+    nodes[id].key = new_key;
+    kheap.fix(new_key, &nodes[id]);
+    set_heap.emplace(new_key, id);
+  }
+  void erase(int id) {
+    // std::fprintf(stderr, "erase %d\n", id);
+    int pos = rev_ids[id];
+    CHECK(pos != -1);
+    ids[pos] = ids.back();
+    rev_ids[ids[pos]] = pos;
+    ids.pop_back();
+    rev_ids[id] = -1;
+    free_ids.push_back(id);
+
+    kheap.erase(&nodes[id]);
+    set_heap.erase(std::make_pair(nodes[id].key, id));
+  }
+  void pop() {
+    // std::fprintf(stderr, "pop\n");
+    CHECK(!empty());
+    Node *node = static_cast<Node *>(kheap.pop());
+    int id = node->value;
+    ASSERT_EQ(node->key, set_heap.begin()->first);
+
+    int pos = rev_ids[id];
+    CHECK(pos != -1);
+    ids[pos] = ids.back();
+    rev_ids[ids[pos]] = pos;
+    ids.pop_back();
+    rev_ids[id] = -1;
+    free_ids.push_back(id);
+
+    set_heap.erase(std::make_pair(nodes[id].key, id));
+  }
+
+ private:
+  struct Node : public HeapNode {
+    Node() = default;
+    Node(int key, int value) : key(key), value(value) {
+    }
+    int key = 0;
+    int value = 0;
+  };
+  vector<int> ids;
+  vector<int> rev_ids;
+  vector<int> free_ids;
+  vector<Node> nodes;
+  std::set<std::pair<int, int>> set_heap;
+  KHeap<int> kheap;
+};
+
+TEST(Heap, random_events) {
+  CheckedHeap heap;
+  heap.set_max_size(1000);
+  for (int i = 0; i < 300000; i++) {
+    if (!heap.empty()) {
+      heap.top_key();
+    }
+
+    int x = Random::fast(0, 4);
+    if (heap.empty() || (x < 2 && heap.size() < 1000)) {
+      heap.insert(Random::fast(0, 99));
+    } else if (x < 3) {
+      heap.fix_key(Random::fast(0, 99), heap.random_id());
+    } else if (x < 4) {
+      heap.erase(heap.random_id());
+    } else if (x < 5) {
+      heap.pop();
+    }
+    // heap.check();
+  }
+}
diff --git a/submodules/ton/tonlib-src/tdutils/test/json.cpp b/submodules/ton/tonlib-src/tdutils/test/json.cpp
new file mode 100644
index 0000000000..80ffa2e9fc
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/json.cpp
@@ -0,0 +1,107 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/tests.h"
+
+#include "td/utils/JsonBuilder.h"
+#include "td/utils/logging.h"
+#include "td/utils/Slice.h"
+#include "td/utils/StringBuilder.h"
+
+#include <tuple>
+#include <utility>
+
+REGISTER_TESTS(json)
+
+using namespace td;
+
+static void decode_encode(string str, string result = "") {
+  auto str_copy = str;
+  auto r_value = json_decode(str_copy);
+  ASSERT_TRUE(r_value.is_ok());
+  if (r_value.is_error()) {
+    LOG(INFO) << r_value.error();
+    return;
+  }
+  auto new_str = json_encode<string>(r_value.ok());
+  if (result.empty()) {
+    result = str;
+  }
+  ASSERT_EQ(result, new_str);
+}
+
+TEST(JSON, array) {
+  char tmp[1000];
+  StringBuilder sb(MutableSlice{tmp, sizeof(tmp)});
+  JsonBuilder jb(std::move(sb));
+  jb.enter_value().enter_array() << "Hello" << -123;
+  ASSERT_EQ(jb.string_builder().is_error(), false);
+  auto encoded = jb.string_builder().as_cslice().str();
+  ASSERT_EQ("[\"Hello\",-123]", encoded);
+  decode_encode(encoded);
+}
+TEST(JSON, object) {
+  char tmp[1000];
+  StringBuilder sb(MutableSlice{tmp, sizeof(tmp)});
+  JsonBuilder jb(std::move(sb));
+  auto c = jb.enter_object();
+  c << std::tie("key", "value");
+  c << std::make_pair("1", 2);
+  c.leave();
+  ASSERT_EQ(jb.string_builder().is_error(), false);
+  auto encoded = jb.string_builder().as_cslice().str();
+  ASSERT_EQ("{\"key\":\"value\",\"1\":2}", encoded);
+  decode_encode(encoded);
+}
+
+TEST(JSON, nested) {
+  char tmp[1000];
+  StringBuilder sb(MutableSlice{tmp, sizeof(tmp)});
+  JsonBuilder jb(std::move(sb));
+  {
+    auto a = jb.enter_array();
+    a << 1;
+    { a.enter_value().enter_array() << 2; }
+    a << 3;
+  }
+  ASSERT_EQ(jb.string_builder().is_error(), false);
+  auto encoded = jb.string_builder().as_cslice().str();
+  ASSERT_EQ("[1,[2],3]", encoded);
+  decode_encode(encoded);
+}
+
+TEST(JSON, kphp) {
+  decode_encode("[]");
+  decode_encode("[[]]");
+  decode_encode("{}");
+  decode_encode("{}");
+  decode_encode("\"\\n\"");
+  decode_encode(
+      "\""
+      "some long string \\t \\r \\\\ \\n \\f \\\" "
+      "\\u1234"
+      "\"");
+  decode_encode(
+      "{\"keyboard\":[[\"\\u2022 abcdefg\"],[\"\\u2022 hijklmnop\"],[\"\\u2022 "
+      "qrstuvwxyz\"]],\"one_time_keyboard\":true}");
+  decode_encode(
+      "  \n   {  \"keyboard\"  : \n  [[  \"\\u2022 abcdefg\"  ]  , \n [  \"\\u2022 hijklmnop\" \n ],[  \n \"\\u2022 "
+      "qrstuvwxyz\"]], \n  \"one_time_keyboard\"\n:\ntrue\n}\n   \n",
+      "{\"keyboard\":[[\"\\u2022 abcdefg\"],[\"\\u2022 hijklmnop\"],[\"\\u2022 "
+      "qrstuvwxyz\"]],\"one_time_keyboard\":true}");
+}
diff --git a/submodules/ton/tonlib-src/tdutils/test/log.cpp b/submodules/ton/tonlib-src/tdutils/test/log.cpp
new file mode 100644
index 0000000000..99be2d59b5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/log.cpp
@@ -0,0 +1,136 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/tests.h"
+#include "td/utils/FileLog.h"
+#include "td/utils/TsFileLog.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/path.h"
+#include "td/utils/benchmark.h"
+
+#include <limits>
+
+// Thread safe logging with tests
+//
+// LOG uses thread local LogInterface
+// void append(CSlice slice, int log_level);
+//
+
+template <class Log>
+class LogBenchmark : public td::Benchmark {
+ public:
+  explicit LogBenchmark(std::string name, int threads_n, std::function<td::unique_ptr<Log>()> creator)
+      : name_(std::move(name)), threads_n_(threads_n), creator_(std::move(creator)) {
+  }
+  std::string get_description() const override {
+    return PSTRING() << name_ << " " << td::tag("threads_n", threads_n_);
+  }
+  void start_up() override {
+    log_ = creator_();
+    threads_.resize(threads_n_);
+  }
+  void tear_down() override {
+    for (auto path : log_->get_file_paths()) {
+      td::unlink(path).ignore();
+    }
+    log_.reset();
+  }
+  void run(int n) override {
+    for (auto &thread : threads_) {
+      thread = td::thread([this, n] { this->run_thread(n); });
+    }
+    for (auto &thread : threads_) {
+      thread.join();
+    }
+  }
+
+  void run_thread(int n) {
+    auto str = PSTRING() << "#" << n << " : fsjklfdjsklfjdsklfjdksl\n";
+    for (int i = 0; i < n; i++) {
+      log_->append(str);
+    }
+  }
+
+ private:
+  std::string name_;
+  td::unique_ptr<Log> log_;
+  int threads_n_{0};
+  std::function<td::unique_ptr<Log>()> creator_;
+  std::vector<td::thread> threads_;
+};
+
+template <class F>
+void bench_log(std::string name, int threads_n, F &&f) {
+  bench(LogBenchmark<typename decltype(f())::element_type>(std::move(name), threads_n, std::move(f)));
+};
+
+TEST(Log, TsLogger) {
+  bench_log("NewTsFileLog", 4, [] { return td::TsFileLog::create("tmplog").move_as_ok(); });
+  bench_log("TsFileLog", 8, [] {
+    class FileLog : public td::LogInterface {
+     public:
+      FileLog() {
+        file_log_.init("tmplog", std::numeric_limits<td::int64>::max(), false);
+        ts_log_.init(&file_log_);
+      }
+      ~FileLog() {
+      }
+      void append(td::CSlice slice) override {
+        ts_log_.append(slice, -1);
+      }
+      std::vector<std::string> get_file_paths() override {
+        return file_log_.get_file_paths();
+      }
+
+     private:
+      td::FileLog file_log_;
+      td::TsLog ts_log_{nullptr};
+    };
+    return td::make_unique<FileLog>();
+  });
+
+  bench_log("noop", 4, [] {
+    class NoopLog : public td::LogInterface {
+     public:
+      void append(td::CSlice slice) override {
+      }
+    };
+    return td::make_unique<NoopLog>();
+  });
+
+  bench_log("FileLog", 4, [] {
+    class FileLog : public td::LogInterface {
+     public:
+      FileLog() {
+        file_log_.init("tmplog", std::numeric_limits<td::int64>::max(), false);
+      }
+      ~FileLog() {
+      }
+      void append(td::CSlice slice) override {
+        file_log_.append(slice, -1);
+      }
+      std::vector<std::string> get_file_paths() override {
+        return file_log_.get_file_paths();
+      }
+
+     private:
+      td::FileLog file_log_;
+    };
+    return td::make_unique<FileLog>();
+  });
+}
diff --git a/submodules/ton/tonlib-src/tdutils/test/misc.cpp b/submodules/ton/tonlib-src/tdutils/test/misc.cpp
new file mode 100644
index 0000000000..b3c472507f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/misc.cpp
@@ -0,0 +1,939 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/as.h"
+#include "td/utils/base64.h"
+#include "td/utils/BigNum.h"
+#include "td/utils/bits.h"
+#include "td/utils/CancellationToken.h"
+#include "td/utils/common.h"
+#include "td/utils/Hash.h"
+#include "td/utils/HashMap.h"
+#include "td/utils/HashSet.h"
+#include "td/utils/HttpUrl.h"
+#include "td/utils/invoke.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/EventFd.h"
+#include "td/utils/port/FileFd.h"
+#include "td/utils/port/IPAddress.h"
+#include "td/utils/port/path.h"
+#include "td/utils/port/sleep.h"
+#include "td/utils/port/Stat.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/port/wstring_convert.h"
+#include "td/utils/Random.h"
+#include "td/utils/Slice.h"
+#include "td/utils/Status.h"
+#include "td/utils/StringBuilder.h"
+#include "td/utils/tests.h"
+#include "td/utils/Time.h"
+#include "td/utils/translit.h"
+#include "td/utils/uint128.h"
+#include "td/utils/unicode.h"
+#include "td/utils/utf8.h"
+
+#include <atomic>
+#include <clocale>
+#include <limits>
+#include <locale>
+#include <unordered_map>
+#include <utility>
+
+#if TD_HAVE_ABSL
+#include <absl/container/flat_hash_map.h>
+#endif
+
+using namespace td;
+
+#if TD_LINUX || TD_DARWIN
+TEST(Misc, update_atime_saves_mtime) {
+  SET_VERBOSITY_LEVEL(VERBOSITY_NAME(ERROR));
+  std::string name = "test_file";
+  unlink(name).ignore();
+  auto r_file = FileFd::open(name, FileFd::Read | FileFd::Flags::Create | FileFd::Flags::Truncate);
+  LOG_IF(ERROR, r_file.is_error()) << r_file.error();
+  ASSERT_TRUE(r_file.is_ok());
+  r_file.move_as_ok().close();
+
+  auto info = stat(name).ok();
+  int32 tests_ok = 0;
+  int32 tests_wa = 0;
+  for (int i = 0; i < 10000; i++) {
+    update_atime(name).ensure();
+    auto new_info = stat(name).ok();
+    if (info.mtime_nsec_ == new_info.mtime_nsec_) {
+      tests_ok++;
+    } else {
+      tests_wa++;
+      info.mtime_nsec_ = new_info.mtime_nsec_;
+    }
+    ASSERT_EQ(info.mtime_nsec_, new_info.mtime_nsec_);
+    usleep_for(Random::fast(0, 1000));
+  }
+  if (tests_wa > 0) {
+    LOG(ERROR) << "Access time was unexpectedly updated " << tests_wa << " times";
+  }
+  unlink(name).ensure();
+}
+
+TEST(Misc, update_atime_change_atime) {
+  SET_VERBOSITY_LEVEL(VERBOSITY_NAME(ERROR));
+  std::string name = "test_file";
+  unlink(name).ignore();
+  auto r_file = FileFd::open(name, FileFd::Read | FileFd::Flags::Create | FileFd::Flags::Truncate);
+  LOG_IF(ERROR, r_file.is_error()) << r_file.error();
+  ASSERT_TRUE(r_file.is_ok());
+  r_file.move_as_ok().close();
+  auto info = stat(name).ok();
+  // not enough for fat and e.t.c.
+  usleep_for(5000000);
+  update_atime(name).ensure();
+  auto new_info = stat(name).ok();
+  if (info.atime_nsec_ == new_info.atime_nsec_) {
+    LOG(ERROR) << "Access time was unexpectedly not changed";
+  }
+  unlink(name).ensure();
+}
+#endif
+
+TEST(Misc, errno_tls_bug) {
+  // That's a problem that should be avoided
+  // errno = 0;
+  // impl_.alloc(123);
+  // CHECK(errno == 0);
+
+#if !TD_THREAD_UNSUPPORTED && !TD_EVENTFD_UNSUPPORTED
+  EventFd test_event_fd;
+  test_event_fd.init();
+  std::atomic<int> s{0};
+  s = 1;
+  td::thread th([&] {
+    while (s != 1) {
+    }
+    test_event_fd.acquire();
+  });
+  th.join();
+
+  for (int i = 0; i < 1000; i++) {
+    vector<EventFd> events(10);
+    vector<td::thread> threads;
+    for (auto &event : events) {
+      event.init();
+      event.release();
+    }
+    for (auto &event : events) {
+      threads.push_back(td::thread([&] {
+        {
+          EventFd tmp;
+          tmp.init();
+          tmp.acquire();
+        }
+        event.acquire();
+      }));
+    }
+    for (auto &thread : threads) {
+      thread.join();
+    }
+  }
+#endif
+}
+
+TEST(Misc, get_last_argument) {
+  auto a = make_unique<int>(5);
+  ASSERT_EQ(*get_last_argument(std::move(a)), 5);
+  ASSERT_EQ(*get_last_argument(1, 2, 3, 4, a), 5);
+  ASSERT_EQ(*get_last_argument(a), 5);
+  auto b = get_last_argument(1, 2, 3, std::move(a));
+  ASSERT_TRUE(!a);
+  ASSERT_EQ(*b, 5);
+}
+
+TEST(Misc, call_n_arguments) {
+  auto f = [](int, int) {};
+  call_n_arguments<2>(f, 1, 3, 4);
+}
+
+TEST(Misc, base64) {
+  ASSERT_TRUE(is_base64("dGVzdA==") == true);
+  ASSERT_TRUE(is_base64("dGVzdB==") == false);
+  ASSERT_TRUE(is_base64("dGVzdA=") == false);
+  ASSERT_TRUE(is_base64("dGVzdA") == false);
+  ASSERT_TRUE(is_base64("dGVz") == true);
+  ASSERT_TRUE(is_base64("") == true);
+  ASSERT_TRUE(is_base64("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/") == true);
+  ASSERT_TRUE(is_base64("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=") == false);
+  ASSERT_TRUE(is_base64("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-/") == false);
+  ASSERT_TRUE(is_base64("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_") == false);
+  ASSERT_TRUE(is_base64("====") == false);
+
+  ASSERT_TRUE(is_base64url("dGVzdA==") == true);
+  ASSERT_TRUE(is_base64url("dGVzdB==") == false);
+  ASSERT_TRUE(is_base64url("dGVzdA=") == false);
+  ASSERT_TRUE(is_base64url("dGVzdA") == true);
+  ASSERT_TRUE(is_base64url("dGVz") == true);
+  ASSERT_TRUE(is_base64url("") == true);
+  ASSERT_TRUE(is_base64url("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_") == true);
+  ASSERT_TRUE(is_base64url("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=") == false);
+  ASSERT_TRUE(is_base64url("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-/") == false);
+  ASSERT_TRUE(is_base64url("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/") == false);
+  ASSERT_TRUE(is_base64url("====") == false);
+
+  for (int l = 0; l < 300000; l += l / 20 + l / 1000 * 500 + 1) {
+    for (int t = 0; t < 10; t++) {
+      string s = rand_string(std::numeric_limits<char>::min(), std::numeric_limits<char>::max(), l);
+      string encoded = base64url_encode(s);
+      auto decoded = base64url_decode(encoded);
+      ASSERT_TRUE(decoded.is_ok());
+      ASSERT_TRUE(decoded.ok() == s);
+
+      encoded = base64_encode(s);
+      decoded = base64_decode(encoded);
+      ASSERT_TRUE(decoded.is_ok());
+      ASSERT_TRUE(decoded.ok() == s);
+    }
+  }
+
+  ASSERT_TRUE(base64url_decode("dGVzdA").is_ok());
+  ASSERT_TRUE(base64url_decode("dGVzdB").is_error());
+  ASSERT_TRUE(base64_encode(base64url_decode("dGVzdA").ok()) == "dGVzdA==");
+  ASSERT_TRUE(base64_encode("any carnal pleas") == "YW55IGNhcm5hbCBwbGVhcw==");
+  ASSERT_TRUE(base64_encode("any carnal pleasu") == "YW55IGNhcm5hbCBwbGVhc3U=");
+  ASSERT_TRUE(base64_encode("any carnal pleasur") == "YW55IGNhcm5hbCBwbGVhc3Vy");
+  ASSERT_TRUE(base64_encode("      /'.;.';≤.];,].',[.;/,.;/]/..;!@#!*(%?::;!%\";") ==
+              "ICAgICAgLycuOy4nO+KJpC5dOyxdLicsWy47LywuOy9dLy4uOyFAIyEqKCU/"
+              "Ojo7ISUiOw==");
+}
+
+TEST(Misc, to_integer) {
+  ASSERT_EQ(to_integer<int32>("-1234567"), -1234567);
+  ASSERT_EQ(to_integer<int64>("-1234567"), -1234567);
+  ASSERT_EQ(to_integer<uint32>("-1234567"), 0u);
+  ASSERT_EQ(to_integer<int16>("-1234567"), 10617);
+  ASSERT_EQ(to_integer<uint16>("-1234567"), 0u);
+  ASSERT_EQ(to_integer<int16>("-1254567"), -9383);
+  ASSERT_EQ(to_integer<uint16>("1254567"), 9383u);
+  ASSERT_EQ(to_integer<int64>("-12345678910111213"), -12345678910111213);
+  ASSERT_EQ(to_integer<uint64>("12345678910111213"), 12345678910111213ull);
+
+  ASSERT_EQ(to_integer_safe<int32>("-1234567").ok(), -1234567);
+  ASSERT_EQ(to_integer_safe<int64>("-1234567").ok(), -1234567);
+  ASSERT_TRUE(to_integer_safe<uint32>("-1234567").is_error());
+  ASSERT_TRUE(to_integer_safe<int16>("-1234567").is_error());
+  ASSERT_TRUE(to_integer_safe<uint16>("-1234567").is_error());
+  ASSERT_TRUE(to_integer_safe<int16>("-1254567").is_error());
+  ASSERT_TRUE(to_integer_safe<uint16>("1254567").is_error());
+  ASSERT_EQ(to_integer_safe<int64>("-12345678910111213").ok(), -12345678910111213);
+  ASSERT_EQ(to_integer_safe<uint64>("12345678910111213").ok(), 12345678910111213ull);
+  ASSERT_TRUE(to_integer_safe<uint64>("-12345678910111213").is_error());
+}
+
+static void test_to_double_one(CSlice str, Slice expected, int precision = 6) {
+  auto result = PSTRING() << td::StringBuilder::FixedDouble(to_double(str), precision);
+  if (expected != result) {
+    LOG(ERROR) << "To double conversion failed: have " << str << ", expected " << expected << ", parsed "
+               << to_double(str) << ", got " << result;
+  }
+}
+
+static void test_to_double() {
+  test_to_double_one("0", "0.000000");
+  test_to_double_one("1", "1.000000");
+  test_to_double_one("-10", "-10.000000");
+  test_to_double_one("1.234", "1.234000");
+  test_to_double_one("-1.234e2", "-123.400000");
+  test_to_double_one("inf", "inf");
+  test_to_double_one("  inF  asdasd", "inf");
+  test_to_double_one("  inFasdasd", "0.000000");
+  test_to_double_one("  NaN", "nan");
+  test_to_double_one("  12345678910111213141516171819  asdasd", "12345678910111213670658736128.000000");
+  test_to_double_one("1.234567891011121314E123",
+                     "1234567891011121363209105003376291141757777526749278953577304234065881343284952489418916814035346"
+                     "625663604561924259911303168.000000");
+  test_to_double_one("1.234567891011121314E-9", "0.000000");
+  test_to_double_one("123456789", "123456789.000000");
+  test_to_double_one("-1,234567891011121314E123", "-1.000000");
+  test_to_double_one("123456789", "123456789", 0);
+  test_to_double_one("1.23456789", "1", 0);
+  test_to_double_one("1.23456789", "1.2", 1);
+  test_to_double_one("1.23456789", "1.23", 2);
+  test_to_double_one("1.23456789", "1.235", 3);
+  test_to_double_one("1.23456789", "1.2346", 4);
+  test_to_double_one("1.23456789", "1.23457", 5);
+  test_to_double_one("1.23456789", "1.234568", 6);
+  test_to_double_one("1.23456789", "1.2345679", 7);
+  test_to_double_one("1.23456789", "1.23456789", 8);
+  test_to_double_one("1.23456789", "1.234567890", 9);
+  test_to_double_one("1.23456789", "1.2345678900", 10);
+}
+
+TEST(Misc, to_double) {
+  test_to_double();
+  const char *locale_name = (std::setlocale(LC_ALL, "fr-FR") == nullptr ? "" : "fr-FR");
+  std::locale new_locale(locale_name);
+  auto host_locale = std::locale::global(new_locale);
+  test_to_double();
+  new_locale = std::locale::global(std::locale::classic());
+  test_to_double();
+  auto classic_locale = std::locale::global(host_locale);
+  test_to_double();
+}
+
+TEST(Misc, print_int) {
+  ASSERT_STREQ("-9223372036854775808", PSLICE() << -9223372036854775807 - 1);
+  ASSERT_STREQ("-2147483649", PSLICE() << -2147483649ll);
+  ASSERT_STREQ("-2147483648", PSLICE() << -2147483647 - 1);
+  ASSERT_STREQ("-2147483647", PSLICE() << -2147483647);
+  ASSERT_STREQ("-123456789", PSLICE() << -123456789);
+  ASSERT_STREQ("-1", PSLICE() << -1);
+  ASSERT_STREQ("0", PSLICE() << 0);
+  ASSERT_STREQ("1", PSLICE() << 1);
+  ASSERT_STREQ("9", PSLICE() << 9);
+  ASSERT_STREQ("10", PSLICE() << 10);
+  ASSERT_STREQ("2147483647", PSLICE() << 2147483647);
+  ASSERT_STREQ("2147483648", PSLICE() << 2147483648ll);
+  ASSERT_STREQ("2147483649", PSLICE() << 2147483649ll);
+  ASSERT_STREQ("9223372036854775807", PSLICE() << 9223372036854775807ll);
+}
+
+TEST(Misc, print_uint) {
+  ASSERT_STREQ("0", PSLICE() << 0u);
+  ASSERT_STREQ("1", PSLICE() << 1u);
+  ASSERT_STREQ("9", PSLICE() << 9u);
+  ASSERT_STREQ("10", PSLICE() << 10u);
+  ASSERT_STREQ("2147483647", PSLICE() << 2147483647u);
+  ASSERT_STREQ("2147483648", PSLICE() << 2147483648u);
+  ASSERT_STREQ("2147483649", PSLICE() << 2147483649u);
+  ASSERT_STREQ("9223372036854775807", PSLICE() << 9223372036854775807u);
+}
+
+static void test_get_url_query_file_name_one(const char *prefix, const char *suffix, const char *file_name) {
+  auto path = string(prefix) + string(file_name) + string(suffix);
+  ASSERT_STREQ(file_name, get_url_query_file_name(path));
+  ASSERT_STREQ(file_name, get_url_file_name("http://telegram.org" + path));
+  ASSERT_STREQ(file_name, get_url_file_name("http://telegram.org:80" + path));
+  ASSERT_STREQ(file_name, get_url_file_name("telegram.org" + path));
+}
+
+TEST(Misc, get_url_query_file_name) {
+  for (auto suffix : {"?t=1#test", "#test?t=1", "#?t=1", "?t=1#", "#test", "?t=1", "#", "?", ""}) {
+    test_get_url_query_file_name_one("", suffix, "");
+    test_get_url_query_file_name_one("/", suffix, "");
+    test_get_url_query_file_name_one("/a/adasd/", suffix, "");
+    test_get_url_query_file_name_one("/a/lklrjetn/", suffix, "adasd.asdas");
+    test_get_url_query_file_name_one("/", suffix, "a123asadas");
+    test_get_url_query_file_name_one("/", suffix, "\\a\\1\\2\\3\\a\\s\\a\\das");
+  }
+}
+
+static void test_idn_to_ascii_one(string host, string result) {
+  if (result != idn_to_ascii(host).ok()) {
+    LOG(ERROR) << "Failed to convert " << host << " to " << result << ", got \"" << idn_to_ascii(host).ok() << "\"";
+  }
+}
+
+TEST(Misc, idn_to_ascii) {
+  test_idn_to_ascii_one("::::::::::::::::::::::::::::::::::::::@/", "::::::::::::::::::::::::::::::::::::::@/");
+  test_idn_to_ascii_one("", "");
+  test_idn_to_ascii_one("%30", "%30");
+  test_idn_to_ascii_one("127.0.0.1", "127.0.0.1");
+  test_idn_to_ascii_one("fe80::", "fe80::");
+  test_idn_to_ascii_one("fe80:0:0:0:200:f8ff:fe21:67cf", "fe80:0:0:0:200:f8ff:fe21:67cf");
+  test_idn_to_ascii_one("2001:0db8:11a3:09d7:1f34:8a2e:07a0:765d", "2001:0db8:11a3:09d7:1f34:8a2e:07a0:765d");
+  test_idn_to_ascii_one("::ffff:192.0.2.1", "::ffff:192.0.2.1");
+  test_idn_to_ascii_one("ABCDEF", "abcdef");
+  test_idn_to_ascii_one("abcdef", "abcdef");
+  test_idn_to_ascii_one("abæcdöef", "xn--abcdef-qua4k");
+  test_idn_to_ascii_one("schön", "xn--schn-7qa");
+  test_idn_to_ascii_one("ยจฆฟคฏข", "xn--22cdfh1b8fsa");
+  test_idn_to_ascii_one("☺", "xn--74h");
+  test_idn_to_ascii_one("правда", "xn--80aafi6cg");
+  test_idn_to_ascii_one("büücher", "xn--bcher-kvaa");
+  test_idn_to_ascii_one("BüüCHER", "xn--bcher-kvaa");
+  test_idn_to_ascii_one("bücüher", "xn--bcher-kvab");
+  test_idn_to_ascii_one("bücherü", "xn--bcher-kvae");
+  test_idn_to_ascii_one("ýbücher", "xn--bcher-kvaf");
+  test_idn_to_ascii_one("übücher", "xn--bcher-jvab");
+  test_idn_to_ascii_one("bücher.tld", "xn--bcher-kva.tld");
+  test_idn_to_ascii_one("кто.рф", "xn--j1ail.xn--p1ai");
+  test_idn_to_ascii_one("wіkіреdіа.org", "xn--wkd-8cdx9d7hbd.org");
+  test_idn_to_ascii_one("cnwin2k8中国.avol.com", "xn--cnwin2k8-sd0mx14e.avol.com");
+  test_idn_to_ascii_one("win-2k12r2-addc.阿伯测阿伯测ad.hai.com", "win-2k12r2-addc.xn--ad-tl3ca3569aba8944eca.hai.com");
+  test_idn_to_ascii_one("✌.ws", "xn--7bi.ws");
+  //  test_idn_to_ascii_one("✌️.ws", "xn--7bi.ws"); // needs nameprep to succeed
+  test_idn_to_ascii_one("⛧", "xn--59h");
+  test_idn_to_ascii_one("--рф.рф", "xn-----mmcq.xn--p1ai");
+  ASSERT_TRUE(idn_to_ascii("\xc0").is_error());
+}
+
+#if TD_WINDOWS
+static void test_to_wstring_one(string str) {
+  ASSERT_STREQ(str, from_wstring(to_wstring(str).ok()).ok());
+}
+
+TEST(Misc, to_wstring) {
+  test_to_wstring_one("");
+  for (int i = 0; i < 10; i++) {
+    test_to_wstring_one("test");
+    test_to_wstring_one("тест");
+  }
+  string str;
+  for (uint32 i = 0; i <= 0xD7FF; i++) {
+    append_utf8_character(str, i);
+  }
+  for (uint32 i = 0xE000; i <= 0x10FFFF; i++) {
+    append_utf8_character(str, i);
+  }
+  test_to_wstring_one(str);
+  ASSERT_TRUE(to_wstring("\xc0").is_error());
+  auto emoji = to_wstring("🏟").ok();
+  ASSERT_TRUE(from_wstring(emoji).ok() == "🏟");
+  ASSERT_TRUE(emoji.size() == 2);
+  auto emoji2 = emoji;
+  emoji[0] = emoji[1];
+  emoji2[1] = emoji2[0];
+  ASSERT_TRUE(from_wstring(emoji).is_error());
+  ASSERT_TRUE(from_wstring(emoji2).is_error());
+  emoji2[0] = emoji[0];
+  ASSERT_TRUE(from_wstring(emoji2).is_error());
+}
+#endif
+
+static void test_translit(string word, vector<string> result, bool allow_partial = true) {
+  ASSERT_EQ(result, get_word_transliterations(word, allow_partial));
+}
+
+TEST(Misc, translit) {
+  test_translit("word", {"word", "ворд"});
+  test_translit("", {});
+  test_translit("ььььььььь", {"ььььььььь"});
+  test_translit("крыло", {"krylo", "крыло"});
+  test_translit("krylo", {"krylo", "крило"});
+  test_translit("crylo", {"crylo", "крило"});
+  test_translit("cheiia", {"cheiia", "кхеииа", "чейия"});
+  test_translit("cheii", {"cheii", "кхеии", "чейи", "чейий", "чейия"});
+  test_translit("s", {"s", "с", "ш", "щ"});
+  test_translit("y", {"e", "y", "е", "и", "ю", "я"});
+  test_translit("j", {"e", "j", "е", "й", "ю", "я"});
+  test_translit("yo", {"e", "yo", "е", "ио"});
+  test_translit("artjom", {"artem", "artjom", "артем", "артйом"});
+  test_translit("artyom", {"artem", "artyom", "артем", "артиом"});
+  test_translit("arty", {"arte", "arty", "арте", "арти", "артю", "артя"});
+  test_translit("льи", {"li", "lia", "ly", "льи"});
+  test_translit("y", {"y", "и"}, false);
+  test_translit("yo", {"e", "yo", "е", "ио"}, false);
+}
+
+static void test_unicode(uint32 (*func)(uint32)) {
+  for (uint32 i = 0; i <= 0x110000; i++) {
+    auto res = func(i);
+    CHECK(res <= 0x10ffff);
+  }
+}
+
+TEST(Misc, unicode) {
+  test_unicode(prepare_search_character);
+  test_unicode(unicode_to_lower);
+  test_unicode(remove_diacritics);
+}
+
+TEST(BigNum, from_decimal) {
+  ASSERT_TRUE(BigNum::from_decimal("").is_error());
+  ASSERT_TRUE(BigNum::from_decimal("a").is_error());
+  ASSERT_TRUE(BigNum::from_decimal("123a").is_error());
+  ASSERT_TRUE(BigNum::from_decimal("-123a").is_error());
+  // ASSERT_TRUE(BigNum::from_decimal("-").is_error());
+  ASSERT_TRUE(BigNum::from_decimal("123").is_ok());
+  ASSERT_TRUE(BigNum::from_decimal("-123").is_ok());
+  ASSERT_TRUE(BigNum::from_decimal("0").is_ok());
+  ASSERT_TRUE(BigNum::from_decimal("-0").is_ok());
+  ASSERT_TRUE(BigNum::from_decimal("-999999999999999999999999999999999999999999999999").is_ok());
+  ASSERT_TRUE(BigNum::from_decimal("999999999999999999999999999999999999999999999999").is_ok());
+}
+
+static void test_get_ipv4(uint32 ip) {
+  td::IPAddress ip_address;
+  ip_address.init_ipv4_port(td::IPAddress::ipv4_to_str(ip), 80).ensure();
+  ASSERT_EQ(ip_address.get_ipv4(), ip);
+}
+
+TEST(Misc, IPAddress_get_ipv4) {
+  test_get_ipv4(0x00000000);
+  test_get_ipv4(0x010000FF);
+  test_get_ipv4(0xFF000001);
+  test_get_ipv4(0x01020304);
+  test_get_ipv4(0x04030201);
+  test_get_ipv4(0xFFFFFFFF);
+}
+
+static void test_is_reserved(string ip, bool is_reserved) {
+  IPAddress ip_address;
+  ip_address.init_ipv4_port(ip, 80).ensure();
+  ASSERT_EQ(is_reserved, ip_address.is_reserved());
+}
+
+TEST(Misc, IPAddress_is_reserved) {
+  test_is_reserved("0.0.0.0", true);
+  test_is_reserved("0.255.255.255", true);
+  test_is_reserved("1.0.0.0", false);
+  test_is_reserved("5.0.0.0", false);
+  test_is_reserved("9.255.255.255", false);
+  test_is_reserved("10.0.0.0", true);
+  test_is_reserved("10.255.255.255", true);
+  test_is_reserved("11.0.0.0", false);
+  test_is_reserved("100.63.255.255", false);
+  test_is_reserved("100.64.0.0", true);
+  test_is_reserved("100.127.255.255", true);
+  test_is_reserved("100.128.0.0", false);
+  test_is_reserved("126.255.255.255", false);
+  test_is_reserved("127.0.0.0", true);
+  test_is_reserved("127.255.255.255", true);
+  test_is_reserved("128.0.0.0", false);
+  test_is_reserved("169.253.255.255", false);
+  test_is_reserved("169.254.0.0", true);
+  test_is_reserved("169.254.255.255", true);
+  test_is_reserved("169.255.0.0", false);
+  test_is_reserved("172.15.255.255", false);
+  test_is_reserved("172.16.0.0", true);
+  test_is_reserved("172.31.255.255", true);
+  test_is_reserved("172.32.0.0", false);
+  test_is_reserved("191.255.255.255", false);
+  test_is_reserved("192.0.0.0", true);
+  test_is_reserved("192.0.0.255", true);
+  test_is_reserved("192.0.1.0", false);
+  test_is_reserved("192.0.1.255", false);
+  test_is_reserved("192.0.2.0", true);
+  test_is_reserved("192.0.2.255", true);
+  test_is_reserved("192.0.3.0", false);
+  test_is_reserved("192.88.98.255", false);
+  test_is_reserved("192.88.99.0", true);
+  test_is_reserved("192.88.99.255", true);
+  test_is_reserved("192.88.100.0", false);
+  test_is_reserved("192.167.255.255", false);
+  test_is_reserved("192.168.0.0", true);
+  test_is_reserved("192.168.255.255", true);
+  test_is_reserved("192.169.0.0", false);
+  test_is_reserved("198.17.255.255", false);
+  test_is_reserved("198.18.0.0", true);
+  test_is_reserved("198.19.255.255", true);
+  test_is_reserved("198.20.0.0", false);
+  test_is_reserved("198.51.99.255", false);
+  test_is_reserved("198.51.100.0", true);
+  test_is_reserved("198.51.100.255", true);
+  test_is_reserved("198.51.101.0", false);
+  test_is_reserved("203.0.112.255", false);
+  test_is_reserved("203.0.113.0", true);
+  test_is_reserved("203.0.113.255", true);
+  test_is_reserved("203.0.114.0", false);
+  test_is_reserved("223.255.255.255", false);
+  test_is_reserved("224.0.0.0", true);
+  test_is_reserved("239.255.255.255", true);
+  test_is_reserved("240.0.0.0", true);
+  test_is_reserved("255.255.255.254", true);
+  test_is_reserved("255.255.255.255", true);
+}
+
+static void test_split(Slice str, std::pair<Slice, Slice> expected) {
+  ASSERT_EQ(expected, td::split(str));
+}
+
+TEST(Misc, split) {
+  test_split("", {"", ""});
+  test_split(" ", {"", ""});
+  test_split("abcdef", {"abcdef", ""});
+  test_split("abc def", {"abc", "def"});
+  test_split("a bcdef", {"a", "bcdef"});
+  test_split(" abcdef", {"", "abcdef"});
+  test_split("abcdef ", {"abcdef", ""});
+  test_split("ab cd ef", {"ab", "cd ef"});
+  test_split("ab cdef ", {"ab", "cdef "});
+  test_split(" abcd ef", {"", "abcd ef"});
+  test_split(" abcdef ", {"", "abcdef "});
+}
+
+static void test_full_split(Slice str, vector<Slice> expected) {
+  ASSERT_EQ(expected, td::full_split(str));
+}
+
+TEST(Misc, full_split) {
+  test_full_split("", {});
+  test_full_split(" ", {"", ""});
+  test_full_split("  ", {"", "", ""});
+  test_full_split("abcdef", {"abcdef"});
+  test_full_split("abc def", {"abc", "def"});
+  test_full_split("a bcdef", {"a", "bcdef"});
+  test_full_split(" abcdef", {"", "abcdef"});
+  test_full_split("abcdef ", {"abcdef", ""});
+  test_full_split("ab cd ef", {"ab", "cd", "ef"});
+  test_full_split("ab cdef ", {"ab", "cdef", ""});
+  test_full_split(" abcd ef", {"", "abcd", "ef"});
+  test_full_split(" abcdef ", {"", "abcdef", ""});
+  test_full_split(" ab cd ef ", {"", "ab", "cd", "ef", ""});
+  test_full_split("  ab  cd  ef  ", {"", "", "ab", "", "cd", "", "ef", "", ""});
+}
+
+TEST(Misc, StringBuilder) {
+  auto small_str = std::string{"abcdefghij"};
+  auto big_str = std::string(1000, 'a');
+  using V = std::vector<std::string>;
+  for (auto use_buf : {false, true}) {
+    for (size_t initial_buffer_size : {0, 1, 5, 10, 100, 1000, 2000}) {
+      for (auto test : {V{small_str}, V{small_str, big_str, big_str, small_str}, V{big_str, small_str, big_str}}) {
+        std::string buf(initial_buffer_size, '\0');
+        td::StringBuilder sb(buf, use_buf);
+        std::string res;
+        for (auto x : test) {
+          res += x;
+          sb << x;
+        }
+        if (use_buf) {
+          ASSERT_EQ(res, sb.as_cslice());
+        } else {
+          auto got = sb.as_cslice();
+          res.resize(got.size());
+          ASSERT_EQ(res, got);
+        }
+      }
+    }
+  }
+}
+
+TEST(Misc, As) {
+  char buf[100];
+  as<int>(buf) = 123;
+  ASSERT_EQ(123, as<int>((const char *)buf));
+  ASSERT_EQ(123, as<int>((char *)buf));
+  char buf2[100];
+  as<int>(buf2) = as<int>(buf);
+  ASSERT_EQ(123, as<int>((const char *)buf2));
+  ASSERT_EQ(123, as<int>((char *)buf2));
+}
+
+TEST(Misc, Regression) {
+  string name = "regression_db";
+  RegressionTester::destroy(name);
+
+  {
+    auto tester = RegressionTester::create(name);
+    tester->save_db();
+    tester->verify_test("one_plus_one", "two").ensure();
+    tester->verify_test("one_plus_one", "two").ensure();
+    tester->verify_test("two_plus_one", "three").ensure();
+    tester->verify_test("one_plus_one", "two").ensure();
+    tester->verify_test("two_plus_one", "three").ensure();
+    tester->save_db();
+  }
+  {
+    auto tester = RegressionTester::create(name);
+    tester->save_db();
+    tester->verify_test("one_plus_one", "two").ensure();
+    tester->verify_test("one_plus_one", "two").ensure();
+    tester->verify_test("two_plus_one", "three").ensure();
+    tester->verify_test("one_plus_one", "two").ensure();
+    tester->verify_test("two_plus_one", "three").ensure();
+    tester->save_db();
+    tester->verify_test("one_plus_one", "three").ensure_error();
+    tester->verify_test("two_plus_one", "two").ensure_error();
+  }
+  {
+    auto tester = RegressionTester::create(name);
+    tester->verify_test("one_plus_one", "three").ensure_error();
+    tester->verify_test("two_plus_one", "two").ensure_error();
+  }
+}
+
+TEST(Misc, Bits) {
+  ASSERT_EQ(32, count_leading_zeroes32(0));
+  ASSERT_EQ(64, count_leading_zeroes64(0));
+  ASSERT_EQ(32, count_trailing_zeroes32(0));
+  ASSERT_EQ(64, count_trailing_zeroes64(0));
+
+  for (int i = 0; i < 32; i++) {
+    ASSERT_EQ(31 - i, count_leading_zeroes32(1u << i));
+    ASSERT_EQ(i, count_trailing_zeroes32(1u << i));
+    ASSERT_EQ(31 - i, count_leading_zeroes_non_zero32(1u << i));
+    ASSERT_EQ(i, count_trailing_zeroes_non_zero32(1u << i));
+  }
+  for (int i = 0; i < 64; i++) {
+    ASSERT_EQ(63 - i, count_leading_zeroes64(1ull << i));
+    ASSERT_EQ(i, count_trailing_zeroes64(1ull << i));
+    ASSERT_EQ(63 - i, count_leading_zeroes_non_zero64(1ull << i));
+    ASSERT_EQ(i, count_trailing_zeroes_non_zero64(1ull << i));
+  }
+
+  ASSERT_EQ(0x12345678u, td::bswap32(0x78563412u));
+  ASSERT_EQ(0x12345678abcdef67ull, td::bswap64(0x67efcdab78563412ull));
+
+  ASSERT_EQ(0, count_bits32(0));
+  ASSERT_EQ(0, count_bits64(0));
+  ASSERT_EQ(4, count_bits32((1u << 31) | 7));
+  ASSERT_EQ(4, count_bits64((1ull << 63) | 7));
+}
+
+#if !TD_THREAD_UNSUPPORTED
+TEST(Misc, Time) {
+  Stage run;
+  Stage check;
+  Stage finish;
+
+  size_t threads_n = 3;
+  std::vector<thread> threads;
+  std::vector<std::atomic<double>> ts(threads_n);
+  for (size_t i = 0; i < threads_n; i++) {
+    threads.emplace_back([&, thread_id = i] {
+      for (uint64 round = 1; round < 100000; round++) {
+        ts[thread_id] = 0;
+        run.wait(round * threads_n);
+        ts[thread_id] = Time::now();
+        check.wait(round * threads_n);
+        for (auto &ts_ref : ts) {
+          auto other_ts = ts_ref.load();
+          if (other_ts != 0) {
+            ASSERT_TRUE(other_ts <= Time::now_cached());
+          }
+        }
+
+        finish.wait(round * threads_n);
+      }
+    });
+  }
+  for (auto &thread : threads) {
+    thread.join();
+  }
+}
+#endif
+
+TEST(Misc, uint128) {
+  std::vector<uint64> parts = {0,
+                               1,
+                               2000,
+                               2001,
+                               std::numeric_limits<uint64>::max(),
+                               std::numeric_limits<uint64>::max() - 1,
+                               std::numeric_limits<uint32>::max(),
+                               static_cast<uint64>(std::numeric_limits<uint32>::max()) + 1};
+  std::vector<int64> signed_parts = {0,
+                                     1,
+                                     2000,
+                                     2001,
+                                     -1,
+                                     -2000,
+                                     -2001,
+                                     std::numeric_limits<int64>::max(),
+                                     std::numeric_limits<int64>::max() - 1,
+                                     std::numeric_limits<int64>::min(),
+                                     std::numeric_limits<int64>::min() + 1,
+                                     std::numeric_limits<int32>::max(),
+                                     static_cast<int64>(std::numeric_limits<int32>::max()) + 1,
+                                     std::numeric_limits<int32>::max() - 1,
+                                     std::numeric_limits<int32>::min(),
+                                     std::numeric_limits<int32>::min() + 1,
+                                     static_cast<int64>(std::numeric_limits<int32>::min()) - 1};
+
+#if TD_HAVE_INT128
+  auto to_intrinsic = [](uint128_emulated num) { return uint128_intrinsic(num.hi(), num.lo()); };
+  auto eq = [](uint128_emulated a, uint128_intrinsic b) { return a.hi() == b.hi() && a.lo() == b.lo(); };
+  auto ensure_eq = [&](uint128_emulated a, uint128_intrinsic b) {
+    if (!eq(a, b)) {
+      LOG(FATAL) << "[" << a.hi() << ";" << a.lo() << "] vs [" << b.hi() << ";" << b.lo() << "]";
+    }
+  };
+#endif
+
+  std::vector<uint128_emulated> nums;
+  for (auto hi : parts) {
+    for (auto lo : parts) {
+      auto a = uint128_emulated(hi, lo);
+#if TD_HAVE_INT128
+      auto ia = uint128_intrinsic(hi, lo);
+      ensure_eq(a, ia);
+#endif
+      nums.push_back(a);
+      nums.pop_back();
+      nums.push_back({hi, lo});
+    }
+  }
+
+#if TD_HAVE_INT128
+  for (auto a : nums) {
+    auto ia = to_intrinsic(a);
+    ensure_eq(a, ia);
+    CHECK(a.is_zero() == ia.is_zero());
+    for (int i = 0; i <= 130; i++) {
+      ensure_eq(a.shl(i), ia.shl(i));
+      ensure_eq(a.shr(i), ia.shr(i));
+    }
+    for (auto b : parts) {
+      ensure_eq(a.mult(b), ia.mult(b));
+    }
+    for (auto b : signed_parts) {
+      ensure_eq(a.mult_signed(b), ia.mult_signed(b));
+      if (b == 0) {
+        continue;
+      }
+      int64 q, r;
+      a.divmod_signed(b, &q, &r);
+      int64 iq, ir;
+      ia.divmod_signed(b, &iq, &ir);
+      ASSERT_EQ(q, iq);
+      ASSERT_EQ(r, ir);
+    }
+    for (auto b : nums) {
+      auto ib = to_intrinsic(b);
+      //LOG(ERROR) << ia.hi() << ";" << ia.lo() << " " << ib.hi() << ";" << ib.lo();
+      ensure_eq(a.mult(b), ia.mult(ib));
+      ensure_eq(a.add(b), ia.add(ib));
+      ensure_eq(a.sub(b), ia.sub(ib));
+      if (!b.is_zero()) {
+        ensure_eq(a.div(b), ia.div(ib));
+        ensure_eq(a.mod(b), ia.mod(ib));
+      }
+    }
+  }
+
+  for (auto signed_part : signed_parts) {
+    auto a = uint128_emulated::from_signed(signed_part);
+    auto ia = uint128_intrinsic::from_signed(signed_part);
+    ensure_eq(a, ia);
+  }
+#endif
+}
+
+template <template <class T> class HashT, class ValueT>
+Status test_hash(const std::vector<ValueT> &values) {
+  for (size_t i = 0; i < values.size(); i++) {
+    for (size_t j = i; j < values.size(); j++) {
+      auto &a = values[i];
+      auto &b = values[j];
+      auto a_hash = HashT<ValueT>()(a);
+      auto b_hash = HashT<ValueT>()(b);
+      if (a == b) {
+        if (a_hash != b_hash) {
+          return Status::Error("Hash differs for same values");
+        }
+      } else {
+        if (a_hash == b_hash) {
+          return Status::Error("Hash is the same for different values");
+        }
+      }
+    }
+  }
+  return Status::OK();
+}
+
+class BadValue {
+ public:
+  explicit BadValue(size_t value) : value_(value) {
+  }
+
+  template <class H>
+  friend H AbslHashValue(H hasher, const BadValue &value) {
+    return hasher;
+  }
+  bool operator==(const BadValue &other) const {
+    return value_ == other.value_;
+  }
+
+ private:
+  size_t value_;
+};
+
+class ValueA {
+ public:
+  explicit ValueA(size_t value) : value_(value) {
+  }
+  template <class H>
+  friend H AbslHashValue(H hasher, ValueA value) {
+    return H::combine(std::move(hasher), value.value_);
+  }
+  bool operator==(const ValueA &other) const {
+    return value_ == other.value_;
+  }
+
+ private:
+  size_t value_;
+};
+
+class ValueB {
+ public:
+  explicit ValueB(size_t value) : value_(value) {
+  }
+
+  template <class H>
+  friend H AbslHashValue(H hasher, ValueB value) {
+    return H::combine(std::move(hasher), value.value_);
+  }
+  bool operator==(const ValueB &other) const {
+    return value_ == other.value_;
+  }
+
+ private:
+  size_t value_;
+};
+
+template <template <class T> class HashT>
+static void test_hash() {
+  // Just check that the following compiles
+  AbslHashValue(Hasher(), ValueA{1});
+  HashT<ValueA>()(ValueA{1});
+  std::unordered_map<ValueA, int, HashT<ValueA>> s;
+  s[ValueA{1}] = 1;
+  HashMap<ValueA, int> su;
+  su[ValueA{1}] = 1;
+  HashSet<ValueA> su2;
+  su2.insert(ValueA{1});
+#if TD_HAVE_ABSL
+  std::unordered_map<ValueA, int, absl::Hash<ValueA>> x;
+  absl::flat_hash_map<ValueA, int, HashT<ValueA>> sa;
+  sa[ValueA{1}] = 1;
+#endif
+
+  test_hash<HashT, size_t>({1, 2, 3, 4, 5}).ensure();
+  test_hash<HashT, BadValue>({BadValue{1}, BadValue{2}}).ensure_error();
+  test_hash<HashT, ValueA>({ValueA{1}, ValueA{2}}).ensure();
+  test_hash<HashT, ValueB>({ValueB{1}, ValueB{2}}).ensure();
+  test_hash<HashT, std::pair<int, int>>({{1, 1}, {1, 2}}).ensure();
+  // FIXME: use some better hash
+  //test_hash<HashT, std::pair<int, int>>({{1, 1}, {1, 2}, {2, 1}, {2, 2}}).ensure();
+}
+
+TEST(Misc, Hasher) {
+  test_hash<TdHash>();
+#if TD_HAVE_ABSL
+  test_hash<AbslHash>();
+#endif
+}
+TEST(Misc, CancellationToken) {
+  CancellationTokenSource source;
+  source.cancel();
+  auto token1 = source.get_cancellation_token();
+  auto token2 = source.get_cancellation_token();
+  CHECK(!token1);
+  source.cancel();
+  CHECK(token1);
+  CHECK(token2);
+  auto token3 = source.get_cancellation_token();
+  CHECK(!token3);
+  source.cancel();
+  CHECK(token3);
+
+  auto token4 = source.get_cancellation_token();
+  CHECK(!token4);
+  source = CancellationTokenSource{};
+  CHECK(token4);
+}
diff --git a/submodules/ton/tonlib-src/tdutils/test/port.cpp b/submodules/ton/tonlib-src/tdutils/test/port.cpp
new file mode 100644
index 0000000000..b8e38907ae
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/port.cpp
@@ -0,0 +1,216 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/port/FileFd.h"
+#include "td/utils/port/IoSlice.h"
+#include "td/utils/port/path.h"
+#include "td/utils/port/signals.h"
+#include "td/utils/port/thread.h"
+#include "td/utils/port/thread_local.h"
+#include "td/utils/Slice.h"
+#include "td/utils/tests.h"
+
+using namespace td;
+
+TEST(Port, files) {
+  CSlice main_dir = "test_dir";
+  rmrf(main_dir).ignore();
+  ASSERT_TRUE(FileFd::open(main_dir, FileFd::Write).is_error());
+  ASSERT_TRUE(walk_path(main_dir, [](CSlice name, WalkPath::Type type) { UNREACHABLE(); }).is_error());
+  mkdir(main_dir).ensure();
+  mkdir(PSLICE() << main_dir << TD_DIR_SLASH << "A").ensure();
+  mkdir(PSLICE() << main_dir << TD_DIR_SLASH << "B").ensure();
+  mkdir(PSLICE() << main_dir << TD_DIR_SLASH << "B" << TD_DIR_SLASH << "D").ensure();
+  mkdir(PSLICE() << main_dir << TD_DIR_SLASH << "C").ensure();
+  ASSERT_TRUE(FileFd::open(main_dir, FileFd::Write).is_error());
+  std::string fd_path = PSTRING() << main_dir << TD_DIR_SLASH << "t.txt";
+  std::string fd2_path = PSTRING() << main_dir << TD_DIR_SLASH << "C" << TD_DIR_SLASH << "t2.txt";
+
+  auto fd = FileFd::open(fd_path, FileFd::Write | FileFd::CreateNew).move_as_ok();
+  auto fd2 = FileFd::open(fd2_path, FileFd::Write | FileFd::CreateNew).move_as_ok();
+  fd2.close();
+
+  int cnt = 0;
+  const int ITER_COUNT = 1000;
+  for (int i = 0; i < ITER_COUNT; i++) {
+    walk_path(main_dir,
+              [&](CSlice name, WalkPath::Type type) {
+                if (type == WalkPath::Type::NotDir) {
+                  ASSERT_TRUE(name == fd_path || name == fd2_path);
+                }
+                cnt++;
+              })
+        .ensure();
+  }
+  ASSERT_EQ((5 * 2 + 2) * ITER_COUNT, cnt);
+  bool was_abort = false;
+  walk_path(main_dir,
+            [&](CSlice name, WalkPath::Type type) {
+              CHECK(!was_abort);
+              if (type == WalkPath::Type::EnterDir && ends_with(name, PSLICE() << TD_DIR_SLASH << "B")) {
+                was_abort = true;
+                return WalkPath::Action::Abort;
+              }
+              return WalkPath::Action::Continue;
+            })
+      .ensure();
+  CHECK(was_abort);
+
+  cnt = 0;
+  bool is_first_dir = true;
+  walk_path(main_dir,
+            [&](CSlice name, WalkPath::Type type) {
+              cnt++;
+              if (type == WalkPath::Type::EnterDir) {
+                if (is_first_dir) {
+                  is_first_dir = false;
+                } else {
+                  return WalkPath::Action::SkipDir;
+                }
+              }
+              return WalkPath::Action::Continue;
+            })
+      .ensure();
+  ASSERT_EQ(6, cnt);
+
+  ASSERT_EQ(0u, fd.get_size().move_as_ok());
+  ASSERT_EQ(12u, fd.write("Hello world!").move_as_ok());
+  ASSERT_EQ(4u, fd.pwrite("abcd", 1).move_as_ok());
+  char buf[100];
+  MutableSlice buf_slice(buf, sizeof(buf));
+  ASSERT_TRUE(fd.pread(buf_slice.substr(0, 4), 2).is_error());
+  fd.seek(11).ensure();
+  ASSERT_EQ(2u, fd.write("?!").move_as_ok());
+
+  ASSERT_TRUE(FileFd::open(main_dir, FileFd::Read | FileFd::CreateNew).is_error());
+  fd = FileFd::open(fd_path, FileFd::Read | FileFd::Create).move_as_ok();
+  ASSERT_EQ(13u, fd.get_size().move_as_ok());
+  ASSERT_EQ(4u, fd.pread(buf_slice.substr(0, 4), 1).move_as_ok());
+  ASSERT_STREQ("abcd", buf_slice.substr(0, 4));
+
+  fd.seek(0).ensure();
+  ASSERT_EQ(13u, fd.read(buf_slice.substr(0, 13)).move_as_ok());
+  ASSERT_STREQ("Habcd world?!", buf_slice.substr(0, 13));
+}
+
+TEST(Port, Writev) {
+  std::vector<IoSlice> vec;
+  CSlice test_file_path = "test.txt";
+  unlink(test_file_path).ignore();
+  auto fd = FileFd::open(test_file_path, FileFd::Write | FileFd::CreateNew).move_as_ok();
+  vec.push_back(as_io_slice("a"));
+  vec.push_back(as_io_slice("b"));
+  vec.push_back(as_io_slice("cd"));
+  ASSERT_EQ(4u, fd.writev(vec).move_as_ok());
+  vec.clear();
+  vec.push_back(as_io_slice("efg"));
+  vec.push_back(as_io_slice(""));
+  vec.push_back(as_io_slice("hi"));
+  ASSERT_EQ(5u, fd.writev(vec).move_as_ok());
+  fd.close();
+  fd = FileFd::open(test_file_path, FileFd::Read).move_as_ok();
+  Slice expected_content = "abcdefghi";
+  ASSERT_EQ(static_cast<int64>(expected_content.size()), fd.get_size().ok());
+  std::string content(expected_content.size(), '\0');
+  ASSERT_EQ(content.size(), fd.read(content).move_as_ok());
+  ASSERT_EQ(expected_content, content);
+}
+
+#if TD_PORT_POSIX && !TD_THREAD_UNSUPPORTED
+#include <signal.h>
+#include <sys/syscall.h>
+#include <unistd.h>
+
+#include <algorithm>
+#include <mutex>
+
+static std::mutex m;
+static std::vector<std::string> ptrs;
+static std::vector<int *> addrs;
+static TD_THREAD_LOCAL int thread_id;
+
+static void on_user_signal(int sig) {
+  int addr;
+  addrs[thread_id] = &addr;
+  char ptr[10];
+  snprintf(ptr, 6, "%d", thread_id);
+  std::unique_lock<std::mutex> guard(m);
+  ptrs.push_back(std::string(ptr));
+}
+
+TEST(Post, SignalsAndThread) {
+  setup_signals_alt_stack().ensure();
+  set_signal_handler(SignalType::User, on_user_signal).ensure();
+  std::vector<std::string> ans = {"0", "1", "2", "3", "4", "5", "6", "7", "8", "9"};
+  {
+    std::vector<td::thread> threads;
+    int thread_n = 10;
+    std::vector<Stage> stages(thread_n);
+    ptrs.clear();
+    addrs.resize(thread_n);
+    for (int i = 0; i < 10; i++) {
+      threads.emplace_back([&, i] {
+        setup_signals_alt_stack().ensure();
+        if (i != 0) {
+          stages[i].wait(2);
+        }
+        thread_id = i;
+        pthread_kill(pthread_self(), SIGUSR1);
+        if (i + 1 < thread_n) {
+          stages[i + 1].wait(2);
+        }
+      });
+    }
+    for (auto &t : threads) {
+      t.join();
+    }
+    CHECK(ptrs == ans);
+
+    LOG(ERROR) << ptrs;
+    //LOG(ERROR) << std::set<int *>(addrs.begin(), addrs.end()).size();
+    //LOG(ERROR) << addrs;
+  }
+
+  {
+    Stage stage;
+    std::vector<td::thread> threads;
+    int thread_n = 10;
+    ptrs.clear();
+    addrs.resize(thread_n);
+    for (int i = 0; i < 10; i++) {
+      threads.emplace_back([&, i] {
+        stage.wait(thread_n);
+        thread_id = i;
+        pthread_kill(pthread_self(), SIGUSR1);
+        //kill(pid_t(syscall(SYS_gettid)), SIGUSR1);
+      });
+    }
+    for (auto &t : threads) {
+      t.join();
+    }
+    std::sort(ptrs.begin(), ptrs.end());
+    CHECK(ptrs == ans);
+    std::sort(addrs.begin(), addrs.end());
+    ASSERT_TRUE(std::unique(addrs.begin(), addrs.end()) == addrs.end());
+    //LOG(ERROR) << addrs;
+  }
+}
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/test/pq.cpp b/submodules/ton/tonlib-src/tdutils/test/pq.cpp
new file mode 100644
index 0000000000..bfe2e1e168
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/pq.cpp
@@ -0,0 +1,130 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/tests.h"
+
+#include "td/utils/BigNum.h"
+#include "td/utils/common.h"
+#include "td/utils/crypto.h"
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+
+#include <algorithm>
+#include <limits>
+#include <utility>
+
+REGISTER_TESTS(pq)
+
+using namespace td;
+
+#if TD_HAVE_OPENSSL
+static bool is_prime(uint64 x) {
+  for (uint64 d = 2; d < x && d * d <= x; d++) {
+    if (x % d == 0) {
+      return false;
+    }
+  }
+  return true;
+}
+
+static std::vector<uint64> gen_primes(uint64 L, uint64 R, int limit = 0) {
+  std::vector<uint64> res;
+  for (auto x = L; x <= R && (limit <= 0 || res.size() < static_cast<std::size_t>(limit)); x++) {
+    if (is_prime(x)) {
+      res.push_back(x);
+    }
+  }
+  return res;
+}
+
+static std::vector<uint64> gen_primes() {
+  std::vector<uint64> result;
+  append(result, gen_primes(1, 100));
+  append(result, gen_primes((1ull << 31) - 500000, std::numeric_limits<uint64>::max(), 5));
+  append(result, gen_primes((1ull << 32) - 500000, std::numeric_limits<uint64>::max(), 5));
+  append(result, gen_primes((1ull << 39) - 500000, std::numeric_limits<uint64>::max(), 1));
+  return result;
+}
+
+using PqQuery = std::pair<uint64, uint64>;
+static bool cmp(const PqQuery &a, const PqQuery &b) {
+  return a.first * a.second < b.first * b.second;
+}
+static std::vector<PqQuery> gen_pq_queries() {
+  std::vector<PqQuery> res;
+  auto primes = gen_primes();
+  for (auto q : primes) {
+    for (auto p : primes) {
+      if (p > q) {
+        break;
+      }
+      res.emplace_back(p, q);
+    }
+  }
+  std::sort(res.begin(), res.end(), cmp);
+  return res;
+}
+
+static void test_pq(uint64 first, uint64 second) {
+  BigNum p = BigNum::from_decimal(PSLICE() << first).move_as_ok();
+  BigNum q = BigNum::from_decimal(PSLICE() << second).move_as_ok();
+
+  BigNum pq;
+  BigNumContext context;
+  BigNum::mul(pq, p, q, context);
+  std::string pq_str = pq.to_binary();
+
+  std::string p_str, q_str;
+  int err = td::pq_factorize(pq_str, &p_str, &q_str);
+  LOG_CHECK(err == 0) << first << " * " << second;
+
+  BigNum p_res = BigNum::from_binary(p_str);
+  BigNum q_res = BigNum::from_binary(q_str);
+
+  LOG_CHECK(p_str == p.to_binary()) << td::tag("got", p_res.to_decimal()) << td::tag("expected", first);
+  LOG_CHECK(q_str == q.to_binary()) << td::tag("got", q_res.to_decimal()) << td::tag("expected", second);
+}
+#endif
+
+TEST(CryptoPQ, hands) {
+  ASSERT_EQ(1ull, td::pq_factorize(0));
+  ASSERT_EQ(1ull, td::pq_factorize(1));
+  ASSERT_EQ(1ull, td::pq_factorize(2));
+  ASSERT_EQ(1ull, td::pq_factorize(3));
+  ASSERT_EQ(2ull, td::pq_factorize(4));
+  ASSERT_EQ(1ull, td::pq_factorize(5));
+  ASSERT_EQ(3ull, td::pq_factorize(7 * 3));
+  ASSERT_EQ(179424611ull, td::pq_factorize(179424611ull * 179424673ull));
+
+#if TD_HAVE_OPENSSL
+  test_pq(4294467311, 4294467449);
+#endif
+}
+
+#if TD_HAVE_OPENSSL
+TEST(CryptoPQ, generated_slow) {
+  for (int i = 0; i < 100000; i++) {
+    test_pq(2, 2);
+  }
+  auto queries = gen_pq_queries();
+  for (auto query : queries) {
+    test_pq(query.first, query.second);
+  }
+}
+#endif
diff --git a/submodules/ton/tonlib-src/tdutils/test/variant.cpp b/submodules/ton/tonlib-src/tdutils/test/variant.cpp
new file mode 100644
index 0000000000..961d82986a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tdutils/test/variant.cpp
@@ -0,0 +1,85 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/Slice.h"
+#include "td/utils/StringBuilder.h"
+#include "td/utils/tests.h"
+#include "td/utils/Variant.h"
+
+REGISTER_TESTS(variant);
+
+static const size_t BUF_SIZE = 1024 * 1024;
+static char buf[BUF_SIZE], buf2[BUF_SIZE];
+static td::StringBuilder sb(td::MutableSlice(buf, BUF_SIZE - 1));
+static td::StringBuilder sb2(td::MutableSlice(buf2, BUF_SIZE - 1));
+
+static td::string move_sb() {
+  auto res = sb.as_cslice().str();
+  sb.clear();
+  return res;
+}
+
+static td::string name(int id) {
+  if (id == 1) {
+    return "A";
+  }
+  if (id == 2) {
+    return "B";
+  }
+  if (id == 3) {
+    return "C";
+  }
+  return "";
+}
+
+template <int id>
+class Class {
+ public:
+  Class() {
+    sb << "+" << name(id);
+  }
+  Class(const Class &) = delete;
+  Class &operator=(const Class &) = delete;
+  Class(Class &&) = delete;
+  Class &operator=(Class &&) = delete;
+  ~Class() {
+    sb << "-" << name(id);
+  }
+};
+
+using A = Class<1>;
+using B = Class<2>;
+using C = Class<3>;
+
+TEST(Variant, simple) {
+  {
+    td::Variant<td::unique_ptr<A>, td::unique_ptr<B>, td::unique_ptr<C>> abc;
+    ASSERT_STREQ("", sb.as_cslice());
+    abc = td::make_unique<A>();
+    ASSERT_STREQ("+A", sb.as_cslice());
+    sb.clear();
+    abc = td::make_unique<B>();
+    ASSERT_STREQ("+B-A", sb.as_cslice());
+    sb.clear();
+    abc = td::make_unique<C>();
+    ASSERT_STREQ("+C-B", sb.as_cslice());
+    sb.clear();
+  }
+  ASSERT_STREQ("-C", move_sb());
+  sb.clear();
+};
diff --git a/submodules/ton/tonlib-src/terminal/CMakeLists.txt b/submodules/ton/tonlib-src/terminal/CMakeLists.txt
new file mode 100644
index 0000000000..ae8c70bd80
--- /dev/null
+++ b/submodules/ton/tonlib-src/terminal/CMakeLists.txt
@@ -0,0 +1,49 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+if (NOT OPENSSL_FOUND)
+  find_package(OpenSSL REQUIRED)
+endif()
+
+set(TERMINAL_SOURCE
+  terminal.cpp
+
+  terminal.h
+  terminal.hpp
+)
+
+add_library(terminal STATIC ${TERMINAL_SOURCE})
+target_include_directories(terminal PUBLIC 
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}> 
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>/.. 
+  ${OPENSSL_INCLUDE_DIR}
+)
+target_link_libraries(terminal PRIVATE tdutils tdactor )
+  
+if (NOT READLINE_FOUND)
+  find_package(Readline)
+endif()
+if (NOT READLINE_FOUND)
+  message(STATUS "Could NOT find Readline (this is NOT an error)")
+else()
+  message(STATUS "Found Readline: ${READLINE_INCLUDE_DIR} ${READLINE_LIBRARY}")
+  if (NOT USABLE_READLINE_FOUND)
+    set(CMAKE_REQUIRED_INCLUDES "${READLINE_INCLUDE_DIR}")
+    set(CMAKE_REQUIRED_LIBRARIES "${READLINE_LIBRARY}")
+    include(CheckCXXSourceCompiles)
+    unset(USABLE_READLINE_FOUND CACHE)
+    check_cxx_source_compiles("#include <stdio.h>\n#include <readline/readline.h>\nint main() { rl_free(0); }" USABLE_READLINE_FOUND)
+    if (NOT USABLE_READLINE_FOUND)
+      message(STATUS "Found Readline is too old, ignore it (this is NOT an error)")
+      unset(READLINE_INCLUDE_DIR CACHE)
+      unset(READLINE_LIBRARY CACHE)
+    endif()
+  endif()
+  if (USABLE_READLINE_FOUND)
+    target_link_libraries(terminal PRIVATE ${READLINE_LIBRARY})
+    target_include_directories(terminal SYSTEM PRIVATE ${READLINE_INCLUDE_DIR})
+    target_compile_definitions(terminal PRIVATE -DUSE_READLINE=1)
+  endif()
+endif()
+
+
+
diff --git a/submodules/ton/tonlib-src/terminal/terminal.cpp b/submodules/ton/tonlib-src/terminal/terminal.cpp
new file mode 100644
index 0000000000..c0b44e557e
--- /dev/null
+++ b/submodules/ton/tonlib-src/terminal/terminal.cpp
@@ -0,0 +1,281 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "terminal.hpp"
+#include "td/utils/port/StdStreams.h"
+
+#ifdef USE_READLINE
+#include <readline/readline.h>
+#include <readline/history.h>
+#endif
+
+#include "td/utils/find_boundary.h"
+
+namespace td {
+
+void TerminalLogInterface::append(CSlice slice, int log_level) {
+  auto instance_ = TerminalIOImpl::instance();
+  if (!instance_) {
+    default_log_interface->append(slice, log_level);
+  } else {
+    instance_->deactivate_readline();
+    std::string color;
+    if (log_level == 0 || log_level == 1) {
+      color = TC_RED;
+    } else if (log_level == 2) {
+      color = TC_YELLOW;
+    } else {
+      color = TC_GREEN;
+    }
+    td::TsCerr() << color << slice << TC_EMPTY;
+    instance_->reactivate_readline();
+    if (log_level == VERBOSITY_NAME(FATAL)) {
+      process_fatal_error(slice);
+    }
+  }
+}
+
+void TerminalIOImpl::deactivate_readline() {
+  out_mutex_.lock();
+#ifdef USE_READLINE
+  if (use_readline_) {
+    saved_point_ = rl_point;
+    saved_line_ = std::string(rl_line_buffer, rl_end);
+
+    rl_set_prompt("");
+    rl_replace_line("", 0);
+    rl_redisplay();
+  }
+#endif
+}
+
+void TerminalIOImpl::reactivate_readline() {
+#ifdef USE_READLINE
+  if (use_readline_) {
+    rl_set_prompt(prompt_.c_str());
+    rl_point = saved_point_;
+    rl_replace_line(saved_line_.c_str(), 0);
+    rl_redisplay();
+  }
+#endif
+  out_mutex_.unlock();
+}
+
+void TerminalIOImpl::output_line(std::string line) {
+  deactivate_readline();
+  Stdout().write(line).ensure();
+  reactivate_readline();
+}
+
+void TerminalIOImpl::start_up() {
+  instance_ = this;
+  self_ = actor_id(this);
+
+#ifndef USE_READLINE
+  if (use_readline_) {
+    use_readline_ = false;
+    LOG(WARNING) << "disabling readline";
+  }
+#endif
+
+#ifdef USE_READLINE
+  if (use_readline_) {
+    deactivate_readline();
+    rl_getc_function = s_stdin_getc;
+    rl_callback_handler_install(prompt_.c_str(), s_line);
+    //rl_attempted_completion_function = tg_cli_completion;
+    reactivate_readline();
+  }
+#endif
+
+  td::actor::SchedulerContext::get()->get_poll().subscribe(stdin_.get_poll_info().extract_pollable_fd(this),
+                                                           td::PollFlags::Read());
+  loop();
+}
+
+void TerminalIOImpl::tear_down() {
+  log_interface = default_log_interface;
+  td::actor::SchedulerContext::get()->get_poll().unsubscribe(stdin_.get_poll_info().get_pollable_fd_ref());
+  out_mutex_.lock();
+#ifdef USE_READLINE
+  if (use_readline_) {
+    //out_mutex_.lock();
+    rl_callback_handler_remove();
+    //out_mutex_.unlock();
+  }
+#endif
+  instance_ = nullptr;
+  out_mutex_.unlock();
+  log_interface_.release();  // TODO: actually release memory
+}
+
+/*void TerminalIOImpl::read_line() {
+  LOG(DEBUG) << "read line";
+  while (can_read(stdin_)) {
+    LOG(DEBUG) << "read line it";
+    if (buf_end_ == buf_size) {
+      if (buf_start_ == 0) {
+        LOG(FATAL) << "too long command";
+      } else {
+        std::memmove(buf_, buf_ + buf_start_, buf_end_ - buf_start_);
+      }
+    }
+    auto t = buf_end_;
+    CHECK(buf_end_ != buf_size);
+    {
+      auto R = stdin_.read(td::MutableSlice(buf_ + buf_end_, buf_size - buf_end_)).move_as_ok();
+      buf_end_ += static_cast<uint32>(R);
+    }
+    while (t < buf_end_) {
+      while (t < buf_end_ && buf_[t] != '\n') {
+        t++;
+      }
+      if (t < buf_end_) {
+        td::BufferSlice d{t - buf_start_};
+        d.as_slice().copy_from(td::Slice(buf_ + buf_start_, t - buf_start_));
+        callback_->line_cb(std::move(d));
+        t++;
+        buf_start_ = t;
+      }
+    }
+  }
+}*/
+
+void TerminalIOImpl::loop() {
+  stdin_.flush_read().ignore();
+#ifdef USE_READLINE
+  if (use_readline_) {
+    while (!stdin_.input_buffer().empty()) {
+      rl_callback_read_char();
+    }
+  } else {
+#else
+  if (1) {
+#endif
+    while (true) {
+      auto cmd = process_stdin(&stdin_.input_buffer());
+      if (cmd.is_error()) {
+        break;
+      }
+      cmd_queue_.push(cmd.move_as_ok());
+    }
+  }
+
+  while (!cmd_queue_.empty()) {
+    auto cmd = std::move(cmd_queue_.front());
+    cmd_queue_.pop();
+    callback_->line_cb(std::move(cmd));
+  }
+}
+
+td::Result<td::BufferSlice> TerminalIOImpl::process_stdin(td::ChainBufferReader *buffer) {
+  auto found = td::find_boundary(buffer->clone(), "\n", buffer_pos_);
+
+  if (!found) {
+    return Status::Error("End of line not found");
+  }
+
+  auto data = buffer->cut_head(buffer_pos_).move_as_buffer_slice();
+  if (!data.empty() && data[data.size() - 1] == '\r') {
+    data.truncate(data.size() - 1);
+  }
+  buffer->advance(1);
+  buffer_pos_ = 0;
+  return std::move(data);
+}
+
+void TerminalIOImpl::s_line(char *line) {
+#ifdef USE_READLINE
+  /* Can use ^D (stty eof) to exit. */
+  if (line == nullptr) {
+    LOG(FATAL) << "Closed";
+    return;
+  }
+  CHECK(instance_);
+  if (*line) {
+    add_history(line);
+  }
+  instance_->line_cb(line);
+  rl_free(line);
+#endif
+}
+
+int TerminalIOImpl::s_stdin_getc(FILE *) {
+  return instance_->stdin_getc();
+}
+
+void TerminalIOImpl::set_log_interface() {
+  if (!log_interface_) {
+    log_interface_ = std::make_unique<TerminalLogInterface>();
+  }
+  log_interface = log_interface_.get();
+}
+
+int TerminalIOImpl::stdin_getc() {
+  auto slice = stdin_.input_buffer().prepare_read();
+  if (slice.empty()) {
+    return EOF;
+  }
+  int res = slice[0];
+  stdin_.input_buffer().confirm_read(1);
+  return res;
+}
+
+void TerminalIOImpl::line_cb(std::string cmd) {
+  cmd_queue_.push(td::BufferSlice{std::move(cmd)});
+}
+
+void TerminalIO::output(std::string line) {
+  auto instance_ = TerminalIOImpl::instance();
+  if (!instance_) {
+    std::cout << line;
+  } else {
+    instance_->deactivate_readline();
+    td::TsCerr() << line;
+    instance_->reactivate_readline();
+  }
+}
+
+void TerminalIO::output(td::Slice line) {
+  auto instance_ = TerminalIOImpl::instance();
+  if (!instance_) {
+    td::TsCerr() << line;
+  } else {
+    instance_->deactivate_readline();
+    td::TsCerr() << line;
+    instance_->reactivate_readline();
+  }
+}
+
+TerminalIOOutputter::~TerminalIOOutputter() {
+  if (buffer_) {
+    CHECK(sb_);
+    TerminalIO::output(sb_->as_cslice());
+    delete[] buffer_;
+  }
+}
+
+td::actor::ActorOwn<TerminalIO> TerminalIO::create(std::string prompt, bool use_readline,
+                                                   std::unique_ptr<Callback> callback) {
+  return actor::create_actor<TerminalIOImpl>(actor::ActorOptions().with_name("terminal io").with_poll(), prompt,
+                                             use_readline, std::move(callback));
+}
+
+TerminalIOImpl *TerminalIOImpl::instance_ = nullptr;
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/terminal/terminal.h b/submodules/ton/tonlib-src/terminal/terminal.h
new file mode 100644
index 0000000000..49a7d7b324
--- /dev/null
+++ b/submodules/ton/tonlib-src/terminal/terminal.h
@@ -0,0 +1,88 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/actor/actor.h"
+#include "td/utils/buffer.h"
+
+#include <functional>
+#include <ostream>
+
+namespace td {
+
+class TerminalIOOutputter {
+ public:
+  static const size_t BUFFER_SIZE = 128 * 1024;
+  TerminalIOOutputter()
+      : buffer_(new char[BUFFER_SIZE]), sb_(std::make_unique<StringBuilder>(td::MutableSlice{buffer_, BUFFER_SIZE})) {
+  }
+  TerminalIOOutputter(TerminalIOOutputter &&X) = default;
+
+  template <class T>
+  TerminalIOOutputter &operator<<(const T &other) {
+    *sb_ << other;
+    return *this;
+  }
+  TerminalIOOutputter &operator<<(std::ostream &(*pManip)(std::ostream &)) {
+    *sb_ << '\n';
+    return *this;
+  }
+
+  auto &sb() {
+    return *sb_;
+  }
+
+  MutableCSlice as_cslice() {
+    return sb_->as_cslice();
+  }
+  bool is_error() const {
+    return sb_->is_error();
+  }
+  ~TerminalIOOutputter();
+
+ private:
+  char *buffer_;
+  std::unique_ptr<StringBuilder> sb_;
+};
+
+class TerminalIO : public actor::Actor {
+ public:
+  class Callback {
+   public:
+    virtual ~Callback() = default;
+    virtual void line_cb(td::BufferSlice line) = 0;
+    //virtual std::vector<std::string> autocomplete_cb(std::string line) = 0;
+  };
+
+  virtual ~TerminalIO() = default;
+  virtual void update_prompt(std::string new_prompt) = 0;
+  virtual void update_callback(std::unique_ptr<Callback> callback) = 0;
+  static void output(std::string line);
+  static void output(td::Slice slice);
+  static TerminalIOOutputter out() {
+    return TerminalIOOutputter{};
+  }
+  virtual void output_line(std::string line) = 0;
+  virtual void set_log_interface() = 0;
+
+  static td::actor::ActorOwn<TerminalIO> create(std::string prompt, bool use_readline,
+                                                std::unique_ptr<Callback> callback);
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/terminal/terminal.hpp b/submodules/ton/tonlib-src/terminal/terminal.hpp
new file mode 100644
index 0000000000..637d753b45
--- /dev/null
+++ b/submodules/ton/tonlib-src/terminal/terminal.hpp
@@ -0,0 +1,100 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "terminal.h"
+#include <iostream>
+#include "td/utils/port/FileFd.h"
+#include "td/utils/port/StdStreams.h"
+#include <queue>
+
+namespace td {
+
+class TerminalLogInterface : public LogInterface {
+ public:
+  void append(CSlice slice, int log_level) override;
+};
+
+class TerminalIOImpl : public TerminalIO, td::ObserverBase {
+ public:
+  void refresh() {
+  }
+  void update_prompt(std::string new_prompt) override {
+    prompt_ = new_prompt;
+    refresh();
+  };
+  void update_callback(std::unique_ptr<Callback> callback) override {
+    callback_ = std::move(callback);
+  }
+  void deactivate_readline();
+  void reactivate_readline();
+  void output_line(std::string line) override;
+  void set_log_interface() override;
+  //void read_line();
+  void loop() override;
+  void start_up() override;
+  void tear_down() override;
+
+  static TerminalIOImpl *instance() {
+    return instance_;
+  }
+
+  void notify() override {
+    // NB: Interface will be changed
+    td::actor::send_closure_later(self_, &TerminalIOImpl::on_net);
+  }
+  void on_net() {
+    loop();
+  }
+  TerminalIOImpl(std::string prompt, bool use_readline, std::unique_ptr<Callback> callback)
+      : prompt_(prompt), use_readline_(use_readline), callback_(std::move(callback)) {
+  }
+
+  int stdin_getc();
+  void line_cb(std::string line);
+  static int s_stdin_getc(FILE *);
+  static void s_line(char *line);
+
+  td::Result<td::BufferSlice> process_stdin(td::ChainBufferReader *buffer);
+
+ private:
+  static constexpr td::uint32 buf_size = 1 << 20;
+  td::BufferedStdin stdin_;
+
+  std::string prompt_;
+  bool use_readline_ = false;
+  std::unique_ptr<Callback> callback_;
+  std::mutex out_mutex_;
+
+  char buf_[buf_size];
+  td::uint32 buf_start_ = 0;
+  td::uint32 buf_end_ = 0;
+
+  static TerminalIOImpl *instance_;
+  td::actor::ActorId<TerminalIOImpl> self_;
+  std::unique_ptr<TerminalLogInterface> log_interface_;
+
+  td::uint32 saved_point_;
+  std::string saved_line_;
+  size_t buffer_pos_ = 0;
+
+  std::queue<td::BufferSlice> cmd_queue_;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/test/regression-tests.ans b/submodules/ton/tonlib-src/test/regression-tests.ans
new file mode 100644
index 0000000000..ba4b51d503
--- /dev/null
+++ b/submodules/ton/tonlib-src/test/regression-tests.ans
@@ -0,0 +1,56 @@
+abce
+Test_Bigint_main_default 0327a04f1252c37f77b6706b902ab2c3235c47738bca3f183c837a2c5d22bb6f
+Test_Bitstrings_main_default a8b08af3116923c4c2a14e138d168375abd0c059f2f780d3267b294929a1110e
+Test_Cells_simple_default 832502642fe4fe5db70de82681aedb7d54d7f3530e0069861fff405fe6f6cf23
+Test_Fift_bug_div_default 1ac42861ce96b2896001c587f65e9afe1617db48859f19c2f4e3063a20ea60b0
+Test_Fift_bug_newlize_default e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855
+Test_Fift_contfrac_default 09ebce5c91bcb70696c6fb6981d82dc3b9e3444dab608a7a1b044c0ddd778a96
+Test_Fift_test_default 4e44b3382963ec89f7b5c8f2ebd85da3bc8aebad5b49f5b11b14075061477b4d
+Test_Fift_testvm2_default 4dcb0f98fd689cbdd81a3a1f937a497dd64d27ecebdcd67cf28fd6888469d93d
+Test_Fift_testvm3_default 3c1b77471c5fd914ed8b5f528b9faed618e278693f5030b953ff150e543864ae
+Test_Fift_testvm4_default 4dcb0f98fd689cbdd81a3a1f937a497dd64d27ecebdcd67cf28fd6888469d93d
+Test_Fift_testvm4a_default 523b561d6bf2f5ebb26a755e687bfbda8e33462c98e9978119755f79a086cf5e
+Test_Fift_testvm4b_default daf8567bd58f05c10bb6596cea33b63e1061fa02dd5560db18ff22f96736f0d5
+Test_Fift_testvm4c_default 2bbd67831d90bceaae29546ee3a58c4d376c2e8fb6a5b8ea2eae3ab8787e063e
+Test_Fift_testvm4d_default 32eee098378e64c938dea09990287a349d0d8f6aabb7360535c782a958cd5fea
+Test_Fift_testvm5_default bab109acfdf626a192171d74c69c3176d661a8dedf730aea616d4997b98830f1
+Test_Fift_testvm6_default dd6353c8f3f21cf62a4769ee1f3daaec46f43fd633ffb84c5d6535b120af9027
+Test_Fift_testvm7_default 77f54b6c8c9a728d262e912efcc347de7014a37d08793c3adeac8b96fe063342
+Test_Fift_testvm8_default 17c9e2205ccecfd8549328b4a501d07dde0336899a7a496e747e1032ad5efff9
+Test_Fift_testvm_default ee4cbfec76c050b6de7877cfc39817d594cd1e175b6265b76fb642e30b940437
+Test_Fift_testvmprog_default 3aeebf868c0492f2bafe339505751449e9d258bf25ea5d956efe70c6fce408ed
+Test_RefInt_main_default 768493e0aef8e09a401a6d369edd1ef503a9215fb09dc460f52b27a8bde767cb
+Test_VM_assert_code_not_null_default 05bc07e129181c972b976442f200de9487dee8bfb5ac53dd36ff61c5d4d4291d
+Test_VM_assert_extract_minmax_key_default c352309c61bdf62ba7a0ba7280d303c88b0696fe7efa550c05feb2c662275297
+Test_VM_assert_lookup_prefix_default 18e4fd70d6fa718bd352a6edf5d550a51355d4fb6f2fac58860a646c27a29bc9
+Test_VM_assert_pfx_dict_lookup_default fa6e3f96b31cf2ed9a9dac6b279ec05acfedf13b8ed7b815789f167d1ed7352f
+Test_VM_bigint_default feeb473a4ac51133989e1c145d0f49defa77117d2ae8b66bd7d12e3579e91b9f
+Test_VM_bug_div_short_any_default f69aca6873f75d53dd37b6952151a2d858407a04589330762827dbc96d8b7c04
+Test_VM_bug_exec_dict_getnear_default db314c2e25b49c1f7f044d271e225f36da546c66242a8ab12f6afae37628a81e
+Test_VM_bug_stack_overflow_default 7e0e3e96ca438ac96648d569c55213aa82154cf004e80265b1c481b1c4219719
+Test_VM_memory_leak_default e10dc118f3538720a16bcbd39be9a68c3ea07f76b3d2ed5719a5e866d91f0ab3
+Test_VM_memory_leak_new_default fd2eec0a1d5ae49fb5ff8ba4b938fd9d0fe330be4a07b2b8be12bab249b00d90
+Test_VM_memory_leak_old_default f3076ae38d14000c021597b824d2f0e51de4f00601429ec3e23cca1b32dba844
+Test_VM_report3_1_default 7bc6a8e66f9a0e40cd131e9829ff36fed16b464170d27c0b365a3f549df57282
+Test_VM_report3_2_default 2231bc352cf431e72a84abad2261969bd5b0ee3d9051bb7a53b69fd8ea05f951
+Test_VM_report3_3_default 9416187eb0600ed247795837ca820bccaffb39841bd9d2ff625816bfbba35d6d
+Test_VM_report3_4_default 11661eb00ea37c68e3483a8e048f922f73070c6da8219247663e3d6471c5c0cc
+Test_VM_report3_6_default 1d7be98a8b07f803e80168247459e620ce4b91df634ad896e878d21a3ed757c0
+Test_VM_report3_int_overflow_1_default a0c2414ca2c9672d54409ee375a6aad6e2233306eaa3dfd33a82de3c90bba3ba
+Test_VM_report3_int_overflow_2_default 01cd461802e532a6830705ad50eaa1760278737ff7beeb654e3c59ceb4aa8e2e
+Test_VM_report3_loop_1_default b28b35d057a1b4fa2282d6f422ecd822b18cc4344733d923ef7b002f64bc4d72
+Test_VM_report3_loop_2_default 9f8236535902b04e403d412fcf1f79e64d0f2eb25b3cc014b7d61b2d7a34b9ef
+Test_VM_report3_loop_3_default 7ee05ea553c48a2476035817b9d860f614a355927c9e011b2f824dc6e5f7b0cf
+Test_VM_report3_loop_4_default 4b6c2f65fda3c9e9c6660b6cbbcb1b2103c5b52870cb5daa8876bbed0ca9bbc9
+Test_VM_report3_loop_5_default 0d5d504884172ef8513757d7f6b2a3870dbd28efd5960857441c032e1c67d836
+Test_VM_report3_loop_6_default 5c35b92144debdb61b2020d690669bffbdd96f75ecde827fd0c75c05da22b5a0
+Test_VM_report3_qnot_default dc280444c7e3886cc3412f96f44c803c45287a07fcb9c638643e21bcdfe3905d
+Test_VM_simple_default f6733549069427c2beb1a85ee25635540e27aa68cb8ad101d8435e19afeae862
+Test_VM_unhandled_exception_1_default 0abe2740dd3b6a6b91eb67fee573f638086fecc72653d2d81c956782186b5d78
+Test_VM_unhandled_exception_4_default 412cbfe13745fde55cdcc5e41d7b15ba4d09f0e723f8e4421ae0b7066ca07b8f
+Test_VM_unhandled_exception_5_default d760e540cd9c200c207f71c540cdaf06d11c96e32ec19860b9c1046cb1e38855
+Test_base64_main_default e90d541bd810871c4a81e162f1fffb555024b72807cb895414d16bc11494b789
+Test_bigexp_main_default 45a1f51fb2abcc1ebf8569e1a57bebee04c334a15e03535ff5869bc9a9db8956
+Test_bits256_scan_main_default 3ec7434e1cabc8e08eb2e79064e67747ffbfed177473c7873b88c144a7ed6f42
+Test_crc16_main_default 84abc15310c7d8fe3344a73e97ad3c8d2e23645e1f8e67f8c8756bdf5012ebd6
+Test_uint64_exp_main_default 263a1a9b021031de86dd72f75ecc42d3024a39bf69133e7a1028afad67db6df8
diff --git a/submodules/ton/tonlib-src/test/test-hello-world.cpp b/submodules/ton/tonlib-src/test/test-hello-world.cpp
new file mode 100644
index 0000000000..427528f108
--- /dev/null
+++ b/submodules/ton/tonlib-src/test/test-hello-world.cpp
@@ -0,0 +1,138 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include <iostream>
+
+#include "auto/tl/ton_api.h"
+#include "auto/tl/ton_api_json.h"
+
+#include "tl/tl_json.h"
+
+namespace {
+std::string config = R"json(
+{
+  "@type" : "config.local",
+  "dht": [
+    {
+      "@type" : "dht.config.local",
+      "id" : {
+        "@type" : "adnl.id.pk.ed25519",
+        "key" : "VdeZz3BEIE8+tuPSBUNKN0jQXL/0T/SoK4ZpJ9vTCNQ="
+      },
+      "addr_list" : {
+        "@type" : "adnl.addressList",
+        "version" : 0,
+        "addrs" : [
+          {
+            "@type" : "adnl.address.udp",
+            "ip" : 2130706433,
+            "port" : 16000
+          }
+        ]
+      }
+    }
+  ]
+}
+)json";
+std::string config2 = R"json(
+{
+  "@type" : "config.local",
+  "dht": [
+    {
+      "@type" : "dht.config.local",
+      "id" : {
+        "@type" : "adnl.id.pk.ed25519",
+        "key" : "VdeZz3BEIE8+tuPSBUNKN0jQXL/0T/SoK4ZpJ9vTCNQ="
+      },
+      "addr_list" : {
+        "@type" : "adnl.addressList",
+        "version" : 0,
+        "addrs" : [
+          {
+            "@type" : "adnl.address.udp",
+            "ip" : 2130706433,
+            "port" : 16000
+          }
+        ]
+      }
+    }
+  ],
+  "adnl" : {
+    "@type" : "adnl.config.local"
+  }
+}
+)json";
+}  // namespace
+
+int main() {
+  std::cout << "hello world!\n";
+
+  auto decode_encode = [](auto obj_json) {
+    auto as_json_value = td::json_decode(obj_json).move_as_ok();
+    ton::ton_api::object_ptr<ton::ton_api::Object> obj2;
+    from_json(obj2, as_json_value).ensure();
+    CHECK(obj2 != nullptr);
+    return td::json_encode<std::string>(td::ToJson(obj2));
+  };
+
+  auto test_tl_json = [&decode_encode](auto obj) {
+    auto obj_json = td::json_encode<std::string>(td::ToJson(obj));
+    std::cout << obj_json << "\n";
+
+    auto obj2_json = decode_encode(obj_json);
+    CHECK(obj_json == obj2_json);
+  };
+
+  td::Bits256 uint256;
+  uint256.set_ones();
+  test_tl_json(ton::ton_api::make_object<ton::ton_api::adnl_id_short>(uint256));
+
+  test_tl_json(ton::ton_api::make_object<ton::ton_api::testObject>(
+      1, ton::ton_api::make_object<ton::ton_api::adnl_id_short>(uint256),
+      ton::ton_api::make_object<ton::ton_api::getTestObject>()));
+
+  std::cout << decode_encode(config) << std::endl;
+  std::cout << decode_encode(config2) << std::endl;
+
+  auto decode_encode_local = [](auto obj_json) {
+    auto as_json_value = td::json_decode(obj_json).move_as_ok();
+    ton::ton_api::config_local config_local;
+    from_json(config_local, as_json_value.get_object()).ensure();
+    return td::json_encode<std::string>(td::ToJson(config_local));
+  };
+  std::cout << decode_encode_local(config) << std::endl;
+  std::cout << decode_encode_local(config2) << std::endl;
+
+  auto create_vector_bytes = [] {
+    std::vector<td::BufferSlice> res;
+    res.emplace_back("fdjskld");
+    res.emplace_back("fdj\0kld");
+    res.emplace_back("fdj\0\x01\xff\x7fkld");
+    return res;
+  };
+  test_tl_json(ton::ton_api::make_object<ton::ton_api::testVectorBytes>(create_vector_bytes()));
+}
diff --git a/submodules/ton/tonlib-src/test/test-td-main.cpp b/submodules/ton/tonlib-src/test/test-td-main.cpp
new file mode 100644
index 0000000000..ce9976a712
--- /dev/null
+++ b/submodules/ton/tonlib-src/test/test-td-main.cpp
@@ -0,0 +1,55 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "td/utils/tests.h"
+#include "td/utils/misc.h"
+
+#include <cstring>
+
+#include "td/utils/port/signals.h"
+
+int main(int argc, char **argv) {
+  td::set_default_failure_signal_handler().ensure();
+  // TODO port OptionsParser to Windows
+  auto &runner = td::TestsRunner::get_default();
+  for (int i = 1; i < argc; i++) {
+    if (!std::strcmp(argv[i], "--filter")) {
+      CHECK(i + 1 < argc);
+      runner.add_substr_filter(argv[++i]);
+    } else if (!std::strcmp(argv[i], "--stress")) {
+      runner.set_stress_flag(true);
+    } else if (!std::strcmp(argv[i], "--regression")) {
+      CHECK(i + 1 < argc);
+      runner.set_regression_tester(td::RegressionTester::create(argv[++i]));
+    } else if (!std::strcmp(argv[i], "--verbosity")) {
+      CHECK(i + 1 < argc);
+      SET_VERBOSITY_LEVEL(td::to_integer<td::int32>(td::Slice(argv[++i])));
+    }
+  }
+  runner.run_all();
+  return 0;
+}
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/.appveyor.yml b/submodules/ton/tonlib-src/third-party/crc32c/.appveyor.yml
new file mode 100644
index 0000000000..52d0c273cf
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/.appveyor.yml
@@ -0,0 +1,40 @@
+# Build matrix / environment variables are explained on:
+# https://www.appveyor.com/docs/appveyor-yml/
+# This file can be validated on: https://ci.appveyor.com/tools/validate-yaml
+
+version: "{build}"
+
+environment:
+  matrix:
+    # AppVeyor currently has no custom job name feature.
+    # http://help.appveyor.com/discussions/questions/1623-can-i-provide-a-friendly-name-for-jobs
+    - JOB: Visual Studio 2017
+      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
+      CMAKE_GENERATOR: Visual Studio 15 2017
+
+platform:
+  - x86
+  - x64
+
+configuration:
+  - RelWithDebInfo
+  - Debug
+
+build:
+  verbosity: minimal
+
+build_script:
+  - git submodule update --init --recursive
+  - mkdir build
+  - cd build
+  - if "%platform%"=="x64" set CMAKE_GENERATOR=%CMAKE_GENERATOR% Win64
+  - cmake --version
+  - cmake .. -G "%CMAKE_GENERATOR%" -DCRC32C_USE_GLOG=0
+      -DCMAKE_CONFIGURATION_TYPES="%CONFIGURATION%"
+  - cmake --build . --config "%CONFIGURATION%"
+  - cd ..
+
+test_script:
+  - build\%CONFIGURATION%\crc32c_tests.exe
+  - build\%CONFIGURATION%\crc32c_capi_tests.exe
+  - build\%CONFIGURATION%\crc32c_bench.exe
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/.clang-format b/submodules/ton/tonlib-src/third-party/crc32c/.clang-format
new file mode 100644
index 0000000000..be9b80799f
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/.clang-format
@@ -0,0 +1,3 @@
+---
+Language:      Cpp
+BasedOnStyle:  Google
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/.clang_complete b/submodules/ton/tonlib-src/third-party/crc32c/.clang_complete
new file mode 100644
index 0000000000..fa6757c6f3
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/.clang_complete
@@ -0,0 +1,8 @@
+-Ibuild/include/
+-Ibuild/third_party/glog/
+-Iinclude/
+-Ithird_party/benchmark/include/
+-Ithird_party/googletest/googletest/include/
+-Ithird_party/googletest/googlemock/include/
+-Ithird_party/glog/src/
+-std=c++11
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/.gitignore b/submodules/ton/tonlib-src/third-party/crc32c/.gitignore
new file mode 100644
index 0000000000..747a664ab9
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/.gitignore
@@ -0,0 +1,7 @@
+# Editors.
+*.sw*
+.DS_Store
+
+# Build directory.
+build/
+out/
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/.gitmodules b/submodules/ton/tonlib-src/third-party/crc32c/.gitmodules
new file mode 100644
index 0000000000..888541f407
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/.gitmodules
@@ -0,0 +1,9 @@
+[submodule "third_party/googletest"]
+	path = third_party/googletest
+	url = https://github.com/google/googletest.git
+[submodule "third_party/glog"]
+	path = third_party/glog
+	url = https://github.com/google/glog.git
+[submodule "third_party/benchmark"]
+	path = third_party/benchmark
+	url = https://github.com/google/benchmark.git
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/.travis.yml b/submodules/ton/tonlib-src/third-party/crc32c/.travis.yml
new file mode 100644
index 0000000000..bc9dd703d7
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/.travis.yml
@@ -0,0 +1,60 @@
+# Build matrix / environment variable are explained on:
+# http://about.travis-ci.org/docs/user/build-configuration/
+# This file can be validated on: http://lint.travis-ci.org/
+
+sudo: false
+dist: trusty
+language: cpp
+
+compiler:
+  - gcc
+  - clang
+os:
+  - linux
+  - osx
+
+env:
+  - GLOG=1 BUILD_TYPE=Debug
+  - GLOG=1 BUILD_TYPE=RelWithDebInfo
+  - GLOG=0 BUILD_TYPE=Debug
+  - GLOG=0 BUILD_TYPE=RelWithDebInfo
+
+addons:
+  apt:
+    # List of whitelisted in travis packages for ubuntu-trusty can be found here:
+    #   https://github.com/travis-ci/apt-package-whitelist/blob/master/ubuntu-trusty
+    # List of whitelisted in travis apt-sources:
+    #   https://github.com/travis-ci/apt-source-whitelist/blob/master/ubuntu.json
+    sources:
+    - ubuntu-toolchain-r-test
+    - llvm-toolchain-trusty-6.0
+    packages:
+    - cmake
+    - gcc-8
+    - g++-8
+    - clang-6.0
+
+install:
+# Travis doesn't have a nice way to install homebrew packages yet.
+# https://github.com/travis-ci/travis-ci/issues/5377
+- if [ "$TRAVIS_OS_NAME" == "osx" ]; then brew update; fi
+# https://github.com/Homebrew/brew/issues/1742
+- if [ "$TRAVIS_OS_NAME" == "osx" ]; then rm -f /usr/local/include/c++ ; fi
+- if [ "$TRAVIS_OS_NAME" == "osx" ]; then brew install gcc@8; fi
+# /usr/bin/gcc is stuck to old versions by on both Linux and OSX.
+- if [ "$CXX" = "g++" ]; then export CXX="g++-8" CC="gcc-8"; fi
+- echo ${CC}
+- echo ${CXX}
+- ${CXX} --version
+- cmake --version
+
+before_script:
+- mkdir -p build && cd build
+- cmake .. -DCRC32C_USE_GLOG=$GLOG -DCMAKE_BUILD_TYPE=$BUILD_TYPE
+- cmake --build .
+- cd ..
+
+script:
+- build/crc32c_tests
+- build/crc32c_capi_tests
+- build/crc32c_bench
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/.ycm_extra_conf.py b/submodules/ton/tonlib-src/third-party/crc32c/.ycm_extra_conf.py
new file mode 100644
index 0000000000..536aadcec8
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/.ycm_extra_conf.py
@@ -0,0 +1,142 @@
+# Copyright 2017 The CRC32C Authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+"""YouCompleteMe configuration that interprets a .clang_complete file.
+
+This module implementes the YouCompleteMe configuration API documented at:
+https://github.com/Valloric/ycmd#ycm_extra_confpy-specification
+
+The implementation loads and processes a .clang_complete file, documented at:
+https://github.com/Rip-Rip/clang_complete/blob/master/README.md
+"""
+
+import os
+
+# Flags added to the list in .clang_complete.
+BASE_FLAGS = [
+    '-Werror',  # Unlike clang_complete, YCM can also be used as a linter.
+    '-DUSE_CLANG_COMPLETER',  # YCM needs this.
+    '-xc++',  # YCM needs this to avoid compiling headers as C code.
+]
+
+# Clang flags that take in paths.
+# See https://clang.llvm.org/docs/ClangCommandLineReference.html
+PATH_FLAGS = [
+    '-isystem',
+    '-I',
+    '-iquote',
+    '--sysroot='
+]
+
+
+def DirectoryOfThisScript():
+  """Returns the absolute path to the directory containing this script."""
+  return os.path.dirname(os.path.abspath(__file__))
+
+
+def MakeRelativePathsInFlagsAbsolute(flags, build_root):
+  """Expands relative paths in a list of Clang command-line flags.
+
+  Args:
+    flags: The list of flags passed to Clang.
+    build_root: The current directory when running the Clang compiler. Should be
+        an absolute path.
+
+  Returns:
+    A list of flags with relative paths replaced by absolute paths.
+  """
+  new_flags = []
+  make_next_absolute = False
+  for flag in flags:
+    new_flag = flag
+
+    if make_next_absolute:
+      make_next_absolute = False
+      if not flag.startswith('/'):
+        new_flag = os.path.join(build_root, flag)
+
+    for path_flag in PATH_FLAGS:
+      if flag == path_flag:
+        make_next_absolute = True
+        break
+
+      if flag.startswith(path_flag):
+        path = flag[len(path_flag):]
+        new_flag = path_flag + os.path.join(build_root, path)
+        break
+
+    if new_flag:
+      new_flags.append(new_flag)
+  return new_flags
+
+
+def FindNearest(target, path, build_root):
+  """Looks for a file with a specific name closest to a project path.
+
+  This is similar to the logic used by a version-control system (like git) to
+  find its configuration directory (.git) based on the current directory when a
+  command is invoked.
+
+  Args:
+    target: The file name to search for.
+    path: The directory where the search starts. The search will explore the
+        given directory's ascendants using the parent relationship. Should be an
+        absolute path.
+    build_root: A directory that acts as a fence for the search. If the search
+        reaches this directory, it will not advance to its parent. Should be an
+        absolute path.
+
+  Returns:
+    The path to a file with the desired name. None if the search failed.
+  """
+  candidate = os.path.join(path, target)
+  if os.path.isfile(candidate):
+    return candidate
+
+  if path == build_root:
+    return None
+
+  parent = os.path.dirname(path)
+  if parent == path:
+    return None
+
+  return FindNearest(target, parent, build_root)
+
+
+def FlagsForClangComplete(file_path, build_root):
+  """Reads the .clang_complete flags for a source file.
+
+  Args:
+    file_path: The path to the source file. Should be inside the project. Used
+      to locate the relevant .clang_complete file.
+    build_root: The current directory when running the Clang compiler for this
+        file. Should be an absolute path.
+
+  Returns:
+    A list of strings, where each element is a Clang command-line flag.
+  """
+  clang_complete_path = FindNearest('.clang_complete', file_path, build_root)
+  if clang_complete_path is None:
+    return None
+  clang_complete_flags = open(clang_complete_path, 'r').read().splitlines()
+  return clang_complete_flags
+
+
+def FlagsForFile(filename, **kwargs):
+  """Implements the YouCompleteMe API."""
+
+  # kwargs can be used to pass 'client_data' to the YCM configuration. This
+  # configuration script does not need any extra information, so
+  # pylint: disable=unused-argument
+
+  build_root = DirectoryOfThisScript()
+  file_path = os.path.realpath(filename)
+
+  flags = BASE_FLAGS
+  clang_flags = FlagsForClangComplete(file_path, build_root)
+  if clang_flags:
+    flags += clang_flags
+
+  final_flags = MakeRelativePathsInFlagsAbsolute(flags, build_root)
+
+  return {'flags': final_flags}
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/AUTHORS b/submodules/ton/tonlib-src/third-party/crc32c/AUTHORS
new file mode 100644
index 0000000000..6f1f6871a6
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/AUTHORS
@@ -0,0 +1,9 @@
+# This is the list of CRC32C authors for copyright purposes.
+#
+# This does not necessarily list everyone who has contributed code, since in
+# some cases, their employer may be the copyright holder.  To see the full list
+# of contributors, see the revision history in source control.
+Google Inc.
+
+Fangming Fang <Fangming.Fang@arm.com>
+Vadim Skipin <vadim.skipin@gmail.com>
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/CMakeLists.txt b/submodules/ton/tonlib-src/third-party/crc32c/CMakeLists.txt
new file mode 100644
index 0000000000..04881e9b66
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/CMakeLists.txt
@@ -0,0 +1,403 @@
+# Copyright 2017 The CRC32C Authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+cmake_minimum_required(VERSION 3.1)
+project(Crc32c VERSION 0.1.0 LANGUAGES C CXX)
+
+# This project can use C11, but will gracefully decay down to C89.
+set(CMAKE_C_STANDARD 11)
+set(CMAKE_C_STANDARD_REQUIRED OFF)
+set(CMAKE_C_EXTENSIONS OFF)
+
+# This project requires C++11.
+set(CMAKE_CXX_STANDARD 11)
+set(CMAKE_CXX_STANDARD_REQUIRED ON)
+set(CMAKE_CXX_EXTENSIONS OFF)
+
+# https://github.com/izenecloud/cmake/blob/master/SetCompilerWarningAll.cmake
+if(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+  # Use the highest warning level for Visual Studio.
+  set(CMAKE_CXX_WARNING_LEVEL 4)
+  if(CMAKE_CXX_FLAGS MATCHES "/W[0-4]")
+    string(REGEX REPLACE "/W[0-4]" "/W4" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
+  else(CMAKE_CXX_FLAGS MATCHES "/W[0-4]")
+    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /W4")
+  endif(CMAKE_CXX_FLAGS MATCHES "/W[0-4]")
+
+  # Disable C++ exceptions.
+  string(REGEX REPLACE "/EH[a-z]+" "" CMAKE_CXX_FLAGS ${CMAKE_CXX_FLAGS})
+  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /EHs-c-")
+  add_definitions(-D_HAS_EXCEPTIONS=0)
+
+  # Disable RTTI.
+  string(REGEX REPLACE "/GR" "" CMAKE_CXX_FLAGS ${CMAKE_CXX_FLAGS})
+  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /GR-")
+else(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+  # Use -Wall for clang and gcc.
+  if(NOT CMAKE_CXX_FLAGS MATCHES "-Wall")
+    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wall")
+  endif(NOT CMAKE_CXX_FLAGS MATCHES "-Wall")
+
+  # Use -Wextra for clang and gcc.
+  if(NOT CMAKE_CXX_FLAGS MATCHES "-Wextra")
+    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wextra")
+  endif(NOT CMAKE_CXX_FLAGS MATCHES "-Wextra")
+
+  # Use -Werror for clang and gcc.
+  if(NOT CMAKE_CXX_FLAGS MATCHES "-Werror")
+    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Werror")
+  endif(NOT CMAKE_CXX_FLAGS MATCHES "-Werror")
+
+  # Disable C++ exceptions.
+  string(REGEX REPLACE "-fexceptions" "" CMAKE_CXX_FLAGS ${CMAKE_CXX_FLAGS})
+  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fno-exceptions")
+
+  # Disable RTTI.
+  string(REGEX REPLACE "-frtti" "" CMAKE_CXX_FLAGS ${CMAKE_CXX_FLAGS})
+  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fno-rtti")
+endif(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+
+option(CRC32C_BUILD_TESTS "Build CRC32C's unit tests" ON)
+option(CRC32C_BUILD_BENCHMARKS "Build CRC32C's benchmarks" ON)
+option(CRC32C_USE_GLOG "Build CRC32C's tests with Google Logging" ON)
+option(CRC32C_INSTALL "Install CRC32C's header and library" ON)
+
+include(TestBigEndian)
+test_big_endian(BYTE_ORDER_BIG_ENDIAN)
+
+include(CheckCXXCompilerFlag)
+# Used by glog.
+check_cxx_compiler_flag(-Wno-deprecated CRC32C_HAVE_NO_DEPRECATED)
+# Used by glog.
+check_cxx_compiler_flag(-Wno-sign-compare CRC32C_HAVE_NO_SIGN_COMPARE)
+# Used by glog.
+check_cxx_compiler_flag(-Wno-unused-parameter CRC32C_HAVE_NO_UNUSED_PARAMETER)
+# Used by googletest.
+check_cxx_compiler_flag(-Wno-missing-field-initializers
+                        CRC32C_HAVE_NO_MISSING_FIELD_INITIALIZERS)
+
+# Check for __builtin_prefetch support in the compiler.
+include(CheckCXXSourceCompiles)
+check_cxx_source_compiles("
+int main() {
+  char data = 0;
+  const char* address = &data;
+  __builtin_prefetch(address, 0, 0);
+  return 0;
+}
+"  HAVE_BUILTIN_PREFETCH)
+
+# Check for _mm_prefetch support in the compiler.
+include(CheckCXXSourceCompiles)
+check_cxx_source_compiles("
+#if defined(_MSC_VER)
+#include <intrin.h>
+#else  // !defined(_MSC_VER)
+#include <xmmintrin.h>
+#endif  // defined(_MSC_VER)
+
+int main() {
+  char data = 0;
+  const char* address = &data;
+  _mm_prefetch(address, _MM_HINT_NTA);
+  return 0;
+}
+"  HAVE_MM_PREFETCH)
+
+# Check for SSE4.2 support in the compiler.
+set(OLD_CMAKE_REQURED_FLAGS ${CMAKE_REQUIRED_FLAGS})
+if(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+  set(CMAKE_REQUIRED_FLAGS "${CMAKE_REQUIRED_FLAGS} /arch:AVX")
+else(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+  set(CMAKE_REQUIRED_FLAGS "${CMAKE_REQUIRED_FLAGS} -msse4.2")
+endif(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+check_cxx_source_compiles("
+#if defined(_MSC_VER)
+#include <intrin.h>
+#else  // !defined(_MSC_VER)
+#include <cpuid.h>
+#include <nmmintrin.h>
+#endif  // defined(_MSC_VER)
+
+int main() {
+  _mm_crc32_u8(0, 0); _mm_crc32_u32(0, 0);
+#if defined(_M_X64) || defined(__x86_64__)
+   _mm_crc32_u64(0, 0);
+#endif // defined(_M_X64) || defined(__x86_64__)
+  return 0;
+}
+"  HAVE_SSE42)
+set(CMAKE_REQUIRED_FLAGS ${OLD_CMAKE_REQURED_FLAGS})
+
+# Check for ARMv8 w/ CRC and CRYPTO extensions support in the compiler.
+set(OLD_CMAKE_REQURED_FLAGS ${CMAKE_REQUIRED_FLAGS})
+if(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+  # TODO(pwnall): Insert correct flag when VS gets ARM CRC32C support.
+  set(CMAKE_REQUIRED_FLAGS "${CMAKE_REQUIRED_FLAGS} /arch:NOTYET")
+else(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+  set(CMAKE_REQUIRED_FLAGS "${CMAKE_REQUIRED_FLAGS} -march=armv8-a+crc+crypto")
+endif(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+check_cxx_source_compiles("
+#include <arm_acle.h>
+#include <arm_neon.h>
+
+int main() {
+  __crc32cb(0, 0); __crc32ch(0, 0); __crc32cw(0, 0); __crc32cd(0, 0);
+  vmull_p64(0, 0);
+  return 0;
+}
+" HAVE_ARM64_CRC32C)
+set(CMAKE_REQUIRED_FLAGS ${OLD_CMAKE_REQURED_FLAGS})
+
+# Check for strong getauxval() support in the system headers.
+check_cxx_source_compiles("
+#include <arm_acle.h>
+#include <arm_neon.h>
+#include <sys/auxv.h>
+
+int main() {
+  getauxval(AT_HWCAP);
+  return 0;
+}
+" HAVE_STRONG_GETAUXVAL)
+
+# Check for weak getauxval() support in the compiler.
+check_cxx_source_compiles("
+unsigned long getauxval(unsigned long type) __attribute__((weak));
+#define AT_HWCAP 16
+
+int main() {
+  getauxval(AT_HWCAP);
+  return 0;
+}
+" HAVE_WEAK_GETAUXVAL)
+
+if(CRC32C_USE_GLOG)
+  # glog requires this setting to avoid using dynamic_cast.
+  set(DISABLE_RTTI ON CACHE BOOL "" FORCE)
+
+  # glog's test targets trigger deprecation warnings, and compiling them burns
+  # CPU cycles on the CI.
+  set(BUILD_TESTING_SAVED "${BUILD_TESTING}")
+  set(BUILD_TESTING OFF CACHE BOOL "" FORCE)
+  add_subdirectory("${PROJECT_SOURCE_DIR}/third_party/glog" EXCLUDE_FROM_ALL)
+  set(BUILD_TESTING "${BUILD_TESTING_SAVED}" CACHE BOOL "" FORCE)
+
+  # glog triggers deprecation warnings on OSX.
+  # https://github.com/google/glog/issues/185
+  if(CRC32C_HAVE_NO_DEPRECATED)
+    set_property(TARGET glog APPEND PROPERTY COMPILE_OPTIONS -Wno-deprecated)
+  endif(CRC32C_HAVE_NO_DEPRECATED)
+
+  # glog triggers sign comparison warnings on gcc.
+  if(CRC32C_HAVE_NO_SIGN_COMPARE)
+    set_property(TARGET glog APPEND PROPERTY COMPILE_OPTIONS -Wno-sign-compare)
+  endif(CRC32C_HAVE_NO_SIGN_COMPARE)
+
+  # glog triggers unused parameter warnings on clang.
+  if(CRC32C_HAVE_NO_UNUSED_PARAMETER)
+    set_property(TARGET glog
+                 APPEND PROPERTY COMPILE_OPTIONS -Wno-unused-parameter)
+  endif(CRC32C_HAVE_NO_UNUSED_PARAMETER)
+
+  set(CRC32C_TESTS_BUILT_WITH_GLOG 1)
+endif(CRC32C_USE_GLOG)
+
+configure_file(
+  "${PROJECT_SOURCE_DIR}/src/crc32c_config.h.in"
+  "${PROJECT_BINARY_DIR}/include/crc32c/crc32c_config.h"
+)
+
+include_directories("${PROJECT_BINARY_DIR}/include")
+
+# ARM64 CRC32C code is built separately, so we don't accidentally compile
+# unsupported instructions into code that gets run without ARM32 support.
+add_library(crc32c_arm64 OBJECT "")
+target_sources(crc32c_arm64
+  PRIVATE
+    "${PROJECT_BINARY_DIR}/include/crc32c/crc32c_config.h"
+    "${PROJECT_SOURCE_DIR}/src/crc32c_arm64.cc"
+    "${PROJECT_SOURCE_DIR}/src/crc32c_arm64.h"
+)
+if(HAVE_ARM64_CRC32C)
+  if(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+    # TODO(pwnall): Insert correct flag when VS gets ARM64 CRC32C support.
+    target_compile_options(crc32c_arm64 PRIVATE "/arch:NOTYET")
+  else(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+    target_compile_options(crc32c_arm64 PRIVATE "-march=armv8-a+crc+crypto")
+  endif(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+endif(HAVE_ARM64_CRC32C)
+
+# SSE4.2 code is built separately, so we don't accidentally compile unsupported
+# instructions into code that gets run without SSE4.2 support.
+add_library(crc32c_sse42 OBJECT "")
+target_sources(crc32c_sse42
+  PRIVATE
+    "${PROJECT_BINARY_DIR}/include/crc32c/crc32c_config.h"
+    "${PROJECT_SOURCE_DIR}/src/crc32c_sse42.cc"
+    "${PROJECT_SOURCE_DIR}/src/crc32c_sse42.h"
+)
+if(HAVE_SSE42)
+  if(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+    target_compile_options(crc32c_sse42 PRIVATE "/arch:AVX")
+  else(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+    target_compile_options(crc32c_sse42 PRIVATE "-msse4.2")
+  endif(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+endif(HAVE_SSE42)
+
+add_library(crc32c ""
+  # TODO(pwnall): Move the TARGET_OBJECTS generator expressions to the PRIVATE
+  # section of target_sources when cmake_minimum_required becomes 3.9 or above.
+  $<TARGET_OBJECTS:crc32c_arm64>
+  $<TARGET_OBJECTS:crc32c_sse42>
+)
+target_sources(crc32c
+  PRIVATE
+    "${PROJECT_BINARY_DIR}/include/crc32c/crc32c_config.h"
+    "${PROJECT_SOURCE_DIR}/src/crc32c_arm64.h"
+    "${PROJECT_SOURCE_DIR}/src/crc32c_arm64_linux_check.h"
+    "${PROJECT_SOURCE_DIR}/src/crc32c_internal.h"
+    "${PROJECT_SOURCE_DIR}/src/crc32c_portable.cc"
+    "${PROJECT_SOURCE_DIR}/src/crc32c_prefetch.h"
+    "${PROJECT_SOURCE_DIR}/src/crc32c_read_le.h"
+    "${PROJECT_SOURCE_DIR}/src/crc32c_round_up.h"
+    "${PROJECT_SOURCE_DIR}/src/crc32c_sse42.h"
+    "${PROJECT_SOURCE_DIR}/src/crc32c_sse42_check.h"
+    "${PROJECT_SOURCE_DIR}/src/crc32c.cc"
+
+  # Only CMake 3.3+ supports PUBLIC sources in targets exported by "install".
+  $<$<VERSION_GREATER:CMAKE_VERSION,3.2>:PUBLIC>
+    "include/crc32c/crc32c.h"
+)
+
+target_include_directories(crc32c
+  PUBLIC
+    $<BUILD_INTERFACE:${PROJECT_SOURCE_DIR}/include>
+    $<INSTALL_INTERFACE:${CMAKE_INSTALL_INCLUDEDIR}>
+)
+
+# Warnings as errors in Visual Studio for this project's targets.
+if(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+  set_property(TARGET crc32c APPEND PROPERTY COMPILE_OPTIONS "/WX")
+  set_property(TARGET crc32c_arm64 APPEND PROPERTY COMPILE_OPTIONS "/WX")
+  set_property(TARGET crc32c_sse42 APPEND PROPERTY COMPILE_OPTIONS "/WX")
+endif(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+
+if(CRC32C_BUILD_TESTS)
+  enable_testing()
+
+  # Prevent overriding the parent project's compiler/linker settings on Windows.
+  set(gtest_force_shared_crt ON CACHE BOOL "" FORCE)
+  set(install_gtest OFF)
+  set(install_gmock OFF)
+
+  # This project is tested using GoogleTest.
+  add_subdirectory("${PROJECT_SOURCE_DIR}/third_party/googletest")
+
+  # GoogleTest triggers a missing field initializers warning.
+  if(CRC32C_HAVE_NO_MISSING_FIELD_INITIALIZERS)
+    set_property(TARGET gtest
+        APPEND PROPERTY COMPILE_OPTIONS -Wno-missing-field-initializers)
+    set_property(TARGET gmock
+        APPEND PROPERTY COMPILE_OPTIONS -Wno-missing-field-initializers)
+  endif(CRC32C_HAVE_NO_MISSING_FIELD_INITIALIZERS)
+
+  add_executable(crc32c_tests "")
+  target_sources(crc32c_tests
+    PRIVATE
+      "${PROJECT_BINARY_DIR}/include/crc32c/crc32c_config.h"
+      "${PROJECT_SOURCE_DIR}/src/crc32c_arm64_unittest.cc"
+      "${PROJECT_SOURCE_DIR}/src/crc32c_extend_unittests.h"
+      "${PROJECT_SOURCE_DIR}/src/crc32c_portable_unittest.cc"
+      "${PROJECT_SOURCE_DIR}/src/crc32c_prefetch_unittest.cc"
+      "${PROJECT_SOURCE_DIR}/src/crc32c_read_le_unittest.cc"
+      "${PROJECT_SOURCE_DIR}/src/crc32c_round_up_unittest.cc"
+      "${PROJECT_SOURCE_DIR}/src/crc32c_sse42_unittest.cc"
+      "${PROJECT_SOURCE_DIR}/src/crc32c_unittest.cc"
+      "${PROJECT_SOURCE_DIR}/src/crc32c_test_main.cc"
+  )
+  target_link_libraries(crc32c_tests crc32c gtest)
+
+  # Warnings as errors in Visual Studio for this project's targets.
+  if(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+    set_property(TARGET crc32c_tests APPEND PROPERTY COMPILE_OPTIONS "/WX")
+  endif(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+
+  if(CRC32C_USE_GLOG)
+    target_link_libraries(crc32c_tests glog)
+  endif(CRC32C_USE_GLOG)
+
+  add_test(NAME crc32c_tests COMMAND crc32c_tests)
+
+  add_executable(crc32c_capi_tests "")
+  target_sources(crc32c_capi_tests
+    PRIVATE
+      "${PROJECT_SOURCE_DIR}/src/crc32c_capi_unittest.c"
+  )
+  target_link_libraries(crc32c_capi_tests crc32c)
+
+  # Warnings as errors in Visual Studio for this project's targets.
+  if(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+    set_property(TARGET crc32c_capi_tests APPEND PROPERTY COMPILE_OPTIONS "/WX")
+  endif(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+
+  add_test(NAME crc32c_capi_tests COMMAND crc32c_capi_tests)
+endif(CRC32C_BUILD_TESTS)
+
+if(CRC32C_BUILD_BENCHMARKS)
+  add_executable(crc32c_bench "")
+  target_sources(crc32c_bench
+    PRIVATE
+      "${PROJECT_BINARY_DIR}/include/crc32c/crc32c_config.h"
+      "${PROJECT_SOURCE_DIR}/src/crc32c_benchmark.cc"
+  )
+  target_link_libraries(crc32c_bench crc32c)
+
+  # This project uses Google benchmark for benchmarking.
+  set(BENCHMARK_ENABLE_TESTING OFF CACHE BOOL "" FORCE)
+  set(BENCHMARK_ENABLE_EXCEPTIONS OFF CACHE BOOL "" FORCE)
+  add_subdirectory("${PROJECT_SOURCE_DIR}/third_party/benchmark")
+  target_link_libraries(crc32c_bench benchmark)
+
+  if(CRC32C_USE_GLOG)
+    target_link_libraries(crc32c_bench glog)
+  endif(CRC32C_USE_GLOG)
+
+  # Warnings as errors in Visual Studio for this project's targets.
+  if(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+    set_property(TARGET crc32c_bench APPEND PROPERTY COMPILE_OPTIONS "/WX")
+  endif(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+endif(CRC32C_BUILD_BENCHMARKS)
+
+if(CRC32C_INSTALL)
+  include(GNUInstallDirs)
+  install(TARGETS crc32c
+    EXPORT Crc32cTargets
+    RUNTIME DESTINATION ${CMAKE_INSTALL_BINDIR}
+    LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR}
+    ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR}
+  )
+  install(
+    FILES
+      "${PROJECT_SOURCE_DIR}/include/crc32c/crc32c.h"
+    DESTINATION "${CMAKE_INSTALL_INCLUDEDIR}/crc32c"
+  )
+
+  include(CMakePackageConfigHelpers)
+  write_basic_package_version_file(
+      "${PROJECT_BINARY_DIR}/Crc32cConfigVersion.cmake"
+      COMPATIBILITY SameMajorVersion
+  )
+  install(
+    EXPORT Crc32cTargets
+    NAMESPACE Crc32c::
+    DESTINATION "${CMAKE_INSTALL_LIBDIR}/cmake/Crc32c"
+  )
+  install(
+    FILES
+      "${PROJECT_SOURCE_DIR}/Crc32cConfig.cmake"
+      "${PROJECT_BINARY_DIR}/Crc32cConfigVersion.cmake"
+    DESTINATION "${CMAKE_INSTALL_LIBDIR}/cmake/Crc32c"
+  )
+endif(CRC32C_INSTALL)
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/CONTRIBUTING.md b/submodules/ton/tonlib-src/third-party/crc32c/CONTRIBUTING.md
new file mode 100644
index 0000000000..ae319c70ac
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/CONTRIBUTING.md
@@ -0,0 +1,23 @@
+# How to Contribute
+
+We'd love to accept your patches and contributions to this project. There are
+just a few small guidelines you need to follow.
+
+## Contributor License Agreement
+
+Contributions to this project must be accompanied by a Contributor License
+Agreement. You (or your employer) retain the copyright to your contribution,
+this simply gives us permission to use and redistribute your contributions as
+part of the project. Head over to <https://cla.developers.google.com/> to see
+your current agreements on file or to sign a new one.
+
+You generally only need to submit a CLA once, so if you've already submitted one
+(even if it was for a different project), you probably don't need to do it
+again.
+
+## Code reviews
+
+All submissions, including submissions by project members, require review. We
+use GitHub pull requests for this purpose. Consult
+[GitHub Help](https://help.github.com/articles/about-pull-requests/) for more
+information on using pull requests.
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/Crc32cConfig.cmake b/submodules/ton/tonlib-src/third-party/crc32c/Crc32cConfig.cmake
new file mode 100644
index 0000000000..4d6057ec26
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/Crc32cConfig.cmake
@@ -0,0 +1,5 @@
+# Copyright 2017 The CRC32C Authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+include("${CMAKE_CURRENT_LIST_DIR}/Crc32cTargets.cmake")
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/LICENSE b/submodules/ton/tonlib-src/third-party/crc32c/LICENSE
new file mode 100644
index 0000000000..8c8735cf12
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/LICENSE
@@ -0,0 +1,28 @@
+Copyright 2017, The CRC32C Authors.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+   * Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+   * Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+
+   * Neither the name of Google Inc. nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/README.md b/submodules/ton/tonlib-src/third-party/crc32c/README.md
new file mode 100644
index 0000000000..0bd69f7f09
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/README.md
@@ -0,0 +1,125 @@
+# CRC32C
+
+[![Build Status](https://travis-ci.org/google/crc32c.svg?branch=master)](https://travis-ci.org/google/crc32c)
+[![Build Status](https://ci.appveyor.com/api/projects/status/moiq7331pett4xuj/branch/master?svg=true)](https://ci.appveyor.com/project/pwnall/crc32c)
+
+New file format authors should consider
+[HighwayHash](https://github.com/google/highwayhash). The initial version of
+this code was extracted from [LevelDB](https://github.com/google/leveldb), which
+is a stable key-value store that is widely used at Google.
+
+This project collects a few CRC32C implementations under an umbrella that
+dispatches to a suitable implementation based on the host computer's hardware
+capabilities.
+
+CRC32C is specified as the CRC that uses the iSCSI polynomial in
+[RFC 3720](https://tools.ietf.org/html/rfc3720#section-12.1). The polynomial was
+introduced by G. Castagnoli, S. Braeuer and M. Herrmann. CRC32C is used in
+software such as Btrfs, ext4, Ceph and leveldb.
+
+
+## Usage
+
+```cpp
+#include "crc32c/crc32c.h"
+
+int main() {
+  const std::uint8_t buffer[] = {0, 0, 0, 0};
+  std::uint32_t result;
+
+  // Process a raw buffer.
+  result = crc32c::Crc32c(buffer, 4);
+
+  // Process a std::string.
+  std::string string;
+  string.resize(4);
+  result = crc32c::Crc32c(string);
+
+  // If you have C++17 support, process a std::string_view.
+  std::string_view string_view(string);
+  result = crc32c::Crc32c(string_view);
+
+  return 0;
+}
+```
+
+
+## Prerequisites
+
+This project uses [CMake](https://cmake.org/) for building and testing. CMake is
+available in all popular Linux distributions, as well as in
+[Homebrew](https://brew.sh/).
+
+This project uses submodules for dependency management.
+
+```bash
+git submodule update --init --recursive
+```
+
+If you're using [Atom](https://atom.io/), the following packages can help.
+
+```bash
+apm install autocomplete-clang build build-cmake clang-format language-cmake \
+    linter linter-clang
+```
+
+If you don't mind more setup in return for more speed, replace
+`autocomplete-clang` and `linter-clang` with `you-complete-me`. This requires
+[setting up ycmd](https://github.com/Valloric/ycmd#building).
+
+```bash
+apm install autocomplete-plus build build-cmake clang-format language-cmake \
+    linter you-complete-me
+```
+
+## Building
+
+The following commands build and install the project.
+
+```bash
+mkdir build
+cd build
+cmake -DCRC32C_BUILD_TESTS=0 -DCRC32C_BUILD_BENCHMARKS=0 .. && make all install
+```
+
+
+## Development
+
+The following command (when executed from `build/`) (re)builds the project and
+runs the tests.
+
+```bash
+cmake .. && cmake --build . && ctest --output-on-failure
+```
+
+
+### Android testing
+
+The following command builds the project against the Android NDK, which is
+useful for benchmarking against ARM processors.
+
+```bash
+cmake .. -DCMAKE_SYSTEM_NAME=Android -DCMAKE_ANDROID_ARCH_ABI=arm64-v8a \
+    -DCMAKE_ANDROID_NDK=$HOME/Library/Android/sdk/ndk-bundle \
+    -DCMAKE_ANDROID_NDK_TOOLCHAIN_VERSION=clang \
+    -DCMAKE_ANDROID_STL_TYPE=c++_static -DCRC32C_USE_GLOG=0 \
+    -DCMAKE_BUILD_TYPE=Release && cmake --build .
+```
+
+The following commands install and run the benchmarks.
+
+```bash
+adb push crc32c_bench /data/local/tmp
+adb shell chmod +x /data/local/tmp/crc32c_bench
+adb shell 'cd /data/local/tmp && ./crc32c_bench'
+adb shell rm /data/local/tmp/crc32c_bench
+```
+
+The following commands install and run the tests.
+
+```bash
+adb push crc32c_tests /data/local/tmp
+adb shell chmod +x /data/local/tmp/crc32c_tests
+adb shell 'cd /data/local/tmp && ./crc32c_tests'
+adb shell rm /data/local/tmp/crc32c_tests
+```
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/include/crc32c/crc32c.h b/submodules/ton/tonlib-src/third-party/crc32c/include/crc32c/crc32c.h
new file mode 100644
index 0000000000..e8a78170a9
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/include/crc32c/crc32c.h
@@ -0,0 +1,89 @@
+/* Copyright 2017 The CRC32C Authors. All rights reserved.
+   Use of this source code is governed by a BSD-style license that can be
+   found in the LICENSE file. See the AUTHORS file for names of contributors. */
+
+#ifndef CRC32C_CRC32C_H_
+#define CRC32C_CRC32C_H_
+
+/* The API exported by the CRC32C project. */
+
+#if defined(__cplusplus)
+
+#include <cstddef>
+#include <cstdint>
+#include <string>
+
+#else  /* !defined(__cplusplus) */
+
+#include <stddef.h>
+#include <stdint.h>
+
+#endif  /* !defined(__cplusplus) */
+
+
+/* The C API. */
+
+#if defined(__cplusplus)
+extern "C" {
+#endif  /* defined(__cplusplus) */
+
+/* Extends "crc" with the CRC32C of "count" bytes in the buffer pointed by
+   "data" */
+uint32_t crc32c_extend(uint32_t crc, const uint8_t* data, size_t count);
+
+/* Computes the CRC32C of "count" bytes in the buffer pointed by "data". */
+uint32_t crc32c_value(const uint8_t* data, size_t count);
+
+#ifdef __cplusplus
+}  /* end extern "C" */
+#endif  /* defined(__cplusplus) */
+
+
+/* The C++ API. */
+
+#if defined(__cplusplus)
+
+namespace crc32c {
+
+// Extends "crc" with the CRC32C of "count" bytes in the buffer pointed by
+// "data".
+uint32_t Extend(uint32_t crc, const uint8_t* data, size_t count);
+
+// Computes the CRC32C of "count" bytes in the buffer pointed by "data".
+inline uint32_t Crc32c(const uint8_t* data, size_t count) {
+  return Extend(0, data, count);
+}
+
+// Computes the CRC32C of "count" bytes in the buffer pointed by "data".
+inline uint32_t Crc32c(const char* data, size_t count) {
+  return Extend(0, reinterpret_cast<const uint8_t*>(data), count);
+}
+
+// Computes the CRC32C of the string's content.
+inline uint32_t Crc32c(const std::string& string) {
+  return Crc32c(reinterpret_cast<const uint8_t*>(string.data()),
+                string.size());
+}
+
+}  // namespace crc32c
+
+#if __cplusplus > 201402L
+#if __has_include(<string_view>)
+#include <string_view>
+
+namespace crc32c {
+
+// Computes the CRC32C of the bytes in the string_view.
+inline uint32_t Crc32c(const std::string_view& string_view) {
+  return Crc32c(reinterpret_cast<const uint8_t*>(string_view.data()),
+                string_view.size());
+}
+
+}  // namespace crc32c
+
+#endif  // __has_include(<string_view>)
+#endif  // __cplusplus > 201402L
+
+#endif  /* defined(__cplusplus) */
+
+#endif  // CRC32C_CRC32C_H_
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c.cc b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c.cc
new file mode 100644
index 0000000000..4d3018af47
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c.cc
@@ -0,0 +1,39 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "crc32c/crc32c.h"
+
+#include <cstddef>
+#include <cstdint>
+
+#include "./crc32c_arm64.h"
+#include "./crc32c_arm64_linux_check.h"
+#include "./crc32c_internal.h"
+#include "./crc32c_sse42.h"
+#include "./crc32c_sse42_check.h"
+
+namespace crc32c {
+
+uint32_t Extend(uint32_t crc, const uint8_t* data, size_t count) {
+#if HAVE_SSE42 && (defined(_M_X64) || defined(__x86_64__))
+  static bool can_use_sse42 = CanUseSse42();
+  if (can_use_sse42) return ExtendSse42(crc, data, count);
+#elif HAVE_ARM64_CRC32C
+  static bool can_use_arm_linux = CanUseArm64Linux();
+  if (can_use_arm_linux) return ExtendArm64(crc, data, count);
+#endif  // HAVE_SSE42 && (defined(_M_X64) || defined(__x86_64__))
+
+  return ExtendPortable(crc, data, count);
+}
+
+extern "C" uint32_t crc32c_extend(uint32_t crc, const uint8_t* data,
+                                  size_t count) {
+  return crc32c::Extend(crc, data, count);
+}
+
+extern "C" uint32_t crc32c_value(const uint8_t* data, size_t count) {
+  return crc32c::Crc32c(data, count);
+}
+
+}  // namespace crc32c
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_arm64.cc b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_arm64.cc
new file mode 100644
index 0000000000..9a988c1eed
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_arm64.cc
@@ -0,0 +1,124 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "./crc32c_arm64.h"
+
+// In a separate source file to allow this accelerated CRC32C function to be
+// compiled with the appropriate compiler flags to enable ARM NEON CRC32C
+// instructions.
+
+// This implementation is based on https://github.com/google/leveldb/pull/490.
+
+#include <cstddef>
+#include <cstdint>
+
+#include "./crc32c_internal.h"
+#include "crc32c/crc32c_config.h"
+
+#if HAVE_ARM64_CRC32C
+
+#include <arm_acle.h>
+#include <arm_neon.h>
+
+#define KBYTES 1032
+#define SEGMENTBYTES 256
+
+// compute 8bytes for each segment parallelly
+#define CRC32C32BYTES(P, IND)                                             \
+  do {                                                                    \
+    crc1 = __crc32cd(                                                     \
+        crc1, *((const uint64_t *)(P) + (SEGMENTBYTES / 8) * 1 + (IND))); \
+    crc2 = __crc32cd(                                                     \
+        crc2, *((const uint64_t *)(P) + (SEGMENTBYTES / 8) * 2 + (IND))); \
+    crc3 = __crc32cd(                                                     \
+        crc3, *((const uint64_t *)(P) + (SEGMENTBYTES / 8) * 3 + (IND))); \
+    crc0 = __crc32cd(                                                     \
+        crc0, *((const uint64_t *)(P) + (SEGMENTBYTES / 8) * 0 + (IND))); \
+  } while (0);
+
+// compute 8*8 bytes for each segment parallelly
+#define CRC32C256BYTES(P, IND)      \
+  do {                              \
+    CRC32C32BYTES((P), (IND)*8 + 0) \
+    CRC32C32BYTES((P), (IND)*8 + 1) \
+    CRC32C32BYTES((P), (IND)*8 + 2) \
+    CRC32C32BYTES((P), (IND)*8 + 3) \
+    CRC32C32BYTES((P), (IND)*8 + 4) \
+    CRC32C32BYTES((P), (IND)*8 + 5) \
+    CRC32C32BYTES((P), (IND)*8 + 6) \
+    CRC32C32BYTES((P), (IND)*8 + 7) \
+  } while (0);
+
+// compute 4*8*8 bytes for each segment parallelly
+#define CRC32C1024BYTES(P)   \
+  do {                       \
+    CRC32C256BYTES((P), 0)   \
+    CRC32C256BYTES((P), 1)   \
+    CRC32C256BYTES((P), 2)   \
+    CRC32C256BYTES((P), 3)   \
+    (P) += 4 * SEGMENTBYTES; \
+  } while (0)
+
+namespace crc32c {
+
+uint32_t ExtendArm64(uint32_t crc, const uint8_t *buf, size_t size) {
+  int64_t length = size;
+  uint32_t crc0, crc1, crc2, crc3;
+  uint64_t t0, t1, t2;
+
+  // k0=CRC(x^(3*SEGMENTBYTES*8)), k1=CRC(x^(2*SEGMENTBYTES*8)),
+  // k2=CRC(x^(SEGMENTBYTES*8))
+  const poly64_t k0 = 0x8d96551c, k1 = 0xbd6f81f8, k2 = 0xdcb17aa4;
+
+  crc = crc ^ kCRC32Xor;
+  const uint8_t *p = reinterpret_cast<const uint8_t *>(buf);
+
+  while (length >= KBYTES) {
+    crc0 = crc;
+    crc1 = 0;
+    crc2 = 0;
+    crc3 = 0;
+
+    // Process 1024 bytes in parallel.
+    CRC32C1024BYTES(p);
+
+    // Merge the 4 partial CRC32C values.
+    t2 = (uint64_t)vmull_p64(crc2, k2);
+    t1 = (uint64_t)vmull_p64(crc1, k1);
+    t0 = (uint64_t)vmull_p64(crc0, k0);
+    crc = __crc32cd(crc3, *(uint64_t *)p);
+    p += sizeof(uint64_t);
+    crc ^= __crc32cd(0, t2);
+    crc ^= __crc32cd(0, t1);
+    crc ^= __crc32cd(0, t0);
+
+    length -= KBYTES;
+  }
+
+  while (length >= 8) {
+    crc = __crc32cd(crc, *(uint64_t *)p);
+    p += 8;
+    length -= 8;
+  }
+
+  if (length & 4) {
+    crc = __crc32cw(crc, *(uint32_t *)p);
+    p += 4;
+  }
+
+  if (length & 2) {
+    crc = __crc32ch(crc, *(uint16_t *)p);
+    p += 2;
+  }
+
+  if (length & 1) {
+    crc = __crc32cb(crc, *p);
+  }
+
+  return crc ^ kCRC32Xor;
+}
+
+}  // namespace crc32c
+
+#endif  // HAVE_ARM64_CRC32C
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_arm64.h b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_arm64.h
new file mode 100644
index 0000000000..bbdece46c7
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_arm64.h
@@ -0,0 +1,25 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+// Linux-specific code checking the availability for ARM CRC32C instructions.
+
+#ifndef CRC32C_CRC32C_ARM_LINUX_H_
+#define CRC32C_CRC32C_ARM_LINUX_H_
+
+#include <cstddef>
+#include <cstdint>
+
+#include "crc32c/crc32c_config.h"
+
+#if HAVE_ARM64_CRC32C
+
+namespace crc32c {
+
+uint32_t ExtendArm64(uint32_t crc, const uint8_t* data, size_t count);
+
+}  // namespace crc32c
+
+#endif  // HAVE_ARM64_CRC32C
+
+#endif  // CRC32C_CRC32C_ARM_LINUX_H_
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_arm64_linux_check.h b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_arm64_linux_check.h
new file mode 100644
index 0000000000..6817979aac
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_arm64_linux_check.h
@@ -0,0 +1,48 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+// ARM Linux-specific code checking for the availability of CRC32C instructions.
+
+#ifndef CRC32C_CRC32C_ARM_LINUX_CHECK_H_
+#define CRC32C_CRC32C_ARM_LINUX_CHECK_H_
+
+// X86-specific code checking for the availability of SSE4.2 instructions.
+
+#include <cstddef>
+#include <cstdint>
+
+#include "crc32c/crc32c_config.h"
+
+#if HAVE_ARM64_CRC32C
+
+#if HAVE_STRONG_GETAUXVAL
+#include <sys/auxv.h>
+#elif HAVE_WEAK_GETAUXVAL
+// getauxval() is not available on Android until API level 20. Link it as a weak
+// symbol.
+extern "C" unsigned long getauxval(unsigned long type) __attribute__((weak));
+
+#define AT_HWCAP 16
+#endif  // HAVE_STRONG_GETAUXVAL || HAVE_WEAK_GETAUXVAL
+
+namespace crc32c {
+
+inline bool CanUseArm64Linux() {
+#if HAVE_STRONG_GETAUXVAL || HAVE_WEAK_GETAUXVAL
+  // From 'arch/arm64/include/uapi/asm/hwcap.h' in Linux kernel source code.
+  constexpr unsigned long kHWCAP_PMULL = 1 << 4;
+  constexpr unsigned long kHWCAP_CRC32 = 1 << 7;
+  unsigned long hwcap = (&getauxval != nullptr) ? getauxval(AT_HWCAP) : 0;
+  return (hwcap & (kHWCAP_PMULL | kHWCAP_CRC32)) ==
+         (kHWCAP_PMULL | kHWCAP_CRC32);
+#else
+  return false;
+#endif  // HAVE_STRONG_GETAUXVAL || HAVE_WEAK_GETAUXVAL
+}
+
+}  // namespace crc32c
+
+#endif  // HAVE_ARM64_CRC32C
+
+#endif  // CRC32C_CRC32C_ARM_LINUX_CHECK_H_
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_arm64_unittest.cc b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_arm64_unittest.cc
new file mode 100644
index 0000000000..ea9e84163f
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_arm64_unittest.cc
@@ -0,0 +1,24 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "gtest/gtest.h"
+
+#include "./crc32c_arm64.h"
+#include "./crc32c_extend_unittests.h"
+
+namespace crc32c {
+
+#if HAVE_ARM64_CRC32C
+
+struct Arm64TestTraits {
+  static uint32_t Extend(uint32_t crc, const uint8_t* data, size_t count) {
+    return ExtendArm64(crc, data, count);
+  }
+};
+
+INSTANTIATE_TYPED_TEST_CASE_P(Arm64, ExtendTest, Arm64TestTraits);
+
+#endif  // HAVE_ARM64_CRC32C
+
+}  // namespace crc32c
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_benchmark.cc b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_benchmark.cc
new file mode 100644
index 0000000000..d31af92256
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_benchmark.cc
@@ -0,0 +1,104 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include <cstddef>
+#include <cstdint>
+
+#include "crc32c/crc32c_config.h"
+
+#include "benchmark/benchmark.h"
+
+#if CRC32C_TESTS_BUILT_WITH_GLOG
+#include "glog/logging.h"
+#endif  // CRC32C_TESTS_BUILT_WITH_GLOG
+
+#include "./crc32c_arm64.h"
+#include "./crc32c_arm64_linux_check.h"
+#include "./crc32c_internal.h"
+#include "./crc32c_sse42.h"
+#include "./crc32c_sse42_check.h"
+#include "crc32c/crc32c.h"
+
+class CRC32CBenchmark : public benchmark::Fixture {
+ public:
+  void SetUp(const benchmark::State& state) override {
+    block_size_ = static_cast<size_t>(state.range(0));
+    block_data_ = std::string(block_size_, 'x');
+    block_buffer_ = reinterpret_cast<const uint8_t*>(block_data_.data());
+  }
+
+ protected:
+  std::string block_data_;
+  const uint8_t* block_buffer_;
+  size_t block_size_;
+};
+
+BENCHMARK_DEFINE_F(CRC32CBenchmark, Public)(benchmark::State& state) {
+  uint32_t crc = 0;
+  for (auto _ : state)
+    crc = crc32c::Extend(crc, block_buffer_, block_size_);
+  state.SetBytesProcessed(state.iterations() * block_size_);
+}
+BENCHMARK_REGISTER_F(CRC32CBenchmark, Public)
+    ->RangeMultiplier(16)
+    ->Range(256, 16777216);  // Block size.
+
+BENCHMARK_DEFINE_F(CRC32CBenchmark, Portable)(benchmark::State& state) {
+  uint32_t crc = 0;
+  for (auto _ : state)
+    crc = crc32c::ExtendPortable(crc, block_buffer_, block_size_);
+  state.SetBytesProcessed(state.iterations() * block_size_);
+}
+BENCHMARK_REGISTER_F(CRC32CBenchmark, Portable)
+    ->RangeMultiplier(16)
+    ->Range(256, 16777216);  // Block size.
+
+#if HAVE_ARM64_CRC32C
+
+BENCHMARK_DEFINE_F(CRC32CBenchmark, ArmLinux)(benchmark::State& state) {
+  if (!crc32c::CanUseArm64Linux()) {
+    state.SkipWithError("ARM CRC32C instructions not available or not enabled");
+    return;
+  }
+
+  uint32_t crc = 0;
+  for (auto _ : state)
+    crc = crc32c::ExtendArm64(crc, block_buffer_, block_size_);
+  state.SetBytesProcessed(state.iterations() * block_size_);
+}
+BENCHMARK_REGISTER_F(CRC32CBenchmark, ArmLinux)
+    ->RangeMultiplier(16)
+    ->Range(256, 16777216);  // Block size.
+
+#endif  // HAVE_ARM64_CRC32C
+
+#if HAVE_SSE42 && (defined(_M_X64) || defined(__x86_64__))
+
+BENCHMARK_DEFINE_F(CRC32CBenchmark, Sse42)(benchmark::State& state) {
+  if (!crc32c::CanUseSse42()) {
+    state.SkipWithError("SSE4.2 instructions not available or not enabled");
+    return;
+  }
+
+  uint32_t crc = 0;
+  for (auto _ : state)
+    crc = crc32c::ExtendSse42(crc, block_buffer_, block_size_);
+  state.SetBytesProcessed(state.iterations() * block_size_);
+}
+BENCHMARK_REGISTER_F(CRC32CBenchmark, Sse42)
+    ->RangeMultiplier(16)
+    ->Range(256, 16777216);  // Block size.
+
+#endif  // HAVE_SSE42 && (defined(_M_X64) || defined(__x86_64__))
+
+int main(int argc, char** argv) {
+#if CRC32C_TESTS_BUILT_WITH_GLOG
+  google::InitGoogleLogging(argv[0]);
+  google::InstallFailureSignalHandler();
+#endif  // CRC32C_TESTS_BUILT_WITH_GLOG
+
+  benchmark::Initialize(&argc, argv);
+  benchmark::RunSpecifiedBenchmarks();
+  return 0;
+}
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_capi_unittest.c b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_capi_unittest.c
new file mode 100644
index 0000000000..c8993a0959
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_capi_unittest.c
@@ -0,0 +1,66 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "crc32c/crc32c.h"
+
+#include <stddef.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+int main() {
+  /* From rfc3720 section B.4. */
+  uint8_t buf[32];
+
+  memset(buf, 0, sizeof(buf));
+  if ((uint32_t)0x8a9136aa != crc32c_value(buf, sizeof(buf))) {
+    printf("crc32c_value(zeros) test failed\n");
+    return 1;
+  }
+
+  memset(buf, 0xff, sizeof(buf));
+  if ((uint32_t)0x62a8ab43 != crc32c_value(buf, sizeof(buf))) {
+    printf("crc32c_value(0xff) test failed\n");
+    return 1;
+  }
+
+  for (size_t i = 0; i < 32; ++i)
+    buf[i] = (uint8_t)i;
+  if ((uint32_t)0x46dd794e != crc32c_value(buf, sizeof(buf))) {
+    printf("crc32c_value(0..31) test failed\n");
+    return 1;
+  }
+
+  for (size_t i = 0; i < 32; ++i)
+    buf[i] = (uint8_t)(31 - i);
+  if ((uint32_t)0x113fdb5c != crc32c_value(buf, sizeof(buf))) {
+    printf("crc32c_value(31..0) test failed\n");
+    return 1;
+  }
+
+  uint8_t data[48] = {
+      0x01, 0xc0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+      0x00, 0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00,
+      0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x18, 0x28, 0x00, 0x00, 0x00,
+      0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+  };
+  if ((uint32_t)0xd9963a56 != crc32c_value(data, sizeof(data))) {
+    printf("crc32c_value(31..0) test failed\n");
+    return 1;
+  }
+
+  const uint8_t* hello_space_world = (const uint8_t*)"hello world";
+  const uint8_t* hello_space = (const uint8_t*)"hello ";
+  const uint8_t* world = (const uint8_t*)"world";
+
+  if (crc32c_value(hello_space_world, 11) !=
+      crc32c_extend(crc32c_value(hello_space, 6), world, 5)) {
+    printf("crc32c_extend test failed\n");
+    return 1;
+  }
+
+  printf("All tests passed\n");
+  return 0;
+}
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_config.h.in b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_config.h.in
new file mode 100644
index 0000000000..4034fa5644
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_config.h.in
@@ -0,0 +1,36 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef CRC32C_CRC32C_CONFIG_H_
+#define CRC32C_CRC32C_CONFIG_H_
+
+// Define to 1 if building for a big-endian platform.
+#cmakedefine01 BYTE_ORDER_BIG_ENDIAN
+
+// Define to 1 if the compiler has the __builtin_prefetch intrinsic.
+#cmakedefine01 HAVE_BUILTIN_PREFETCH
+
+// Define to 1 if targeting X86 and the compiler has the _mm_prefetch intrinsic.
+#cmakedefine01 HAVE_MM_PREFETCH
+
+// Define to 1 if targeting X86 and the compiler has the _mm_crc32_u{8,32,64}
+// intrinsics.
+#cmakedefine01 HAVE_SSE42
+
+// Define to 1 if targeting ARM and the compiler has the __crc32c{b,h,w,d} and
+// the vmull_p64 intrinsics.
+#cmakedefine01 HAVE_ARM64_CRC32C
+
+// Define to 1 if the system libraries have the getauxval function in the
+// <sys/auxv.h> header. Should be true on Linux and Android API level 20+.
+#cmakedefine01 HAVE_STRONG_GETAUXVAL
+
+// Define to 1 if the compiler supports defining getauxval as a weak symbol.
+// Should be true for any compiler that supports __attribute__((weak)).
+#cmakedefine01 HAVE_WEAK_GETAUXVAL
+
+// Define to 1 if CRC32C tests have been built with Google Logging.
+#cmakedefine01 CRC32C_TESTS_BUILT_WITH_GLOG
+
+#endif  // CRC32C_CRC32C_CONFIG_H_
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_extend_unittests.h b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_extend_unittests.h
new file mode 100644
index 0000000000..398a5ef73e
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_extend_unittests.h
@@ -0,0 +1,112 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef CRC32C_CRC32C_EXTEND_UNITTESTS_H_
+#define CRC32C_CRC32C_EXTEND_UNITTESTS_H_
+
+#include <cstddef>
+#include <cstdint>
+#include <cstring>
+
+#include "gtest/gtest.h"
+
+// Common test cases for all implementations of CRC32C_Extend().
+
+namespace crc32c {
+
+template<typename TestTraits>
+class ExtendTest : public testing::Test {};
+
+TYPED_TEST_CASE_P(ExtendTest);
+
+TYPED_TEST_P(ExtendTest, StandardResults) {
+  // From rfc3720 section B.4.
+  uint8_t buf[32];
+
+  std::memset(buf, 0, sizeof(buf));
+  EXPECT_EQ(static_cast<uint32_t>(0x8a9136aa),
+            TypeParam::Extend(0, buf, sizeof(buf)));
+
+  std::memset(buf, 0xff, sizeof(buf));
+  EXPECT_EQ(static_cast<uint32_t>(0x62a8ab43),
+            TypeParam::Extend(0, buf, sizeof(buf)));
+
+  for (int i = 0; i < 32; ++i)
+    buf[i] = static_cast<uint8_t>(i);
+  EXPECT_EQ(static_cast<uint32_t>(0x46dd794e),
+            TypeParam::Extend(0, buf, sizeof(buf)));
+
+  for (int i = 0; i < 32; ++i)
+    buf[i] = static_cast<uint8_t>(31 - i);
+  EXPECT_EQ(static_cast<uint32_t>(0x113fdb5c),
+            TypeParam::Extend(0, buf, sizeof(buf)));
+
+  uint8_t data[48] = {
+      0x01, 0xc0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+      0x00, 0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00,
+      0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x18, 0x28, 0x00, 0x00, 0x00,
+      0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+  };
+  EXPECT_EQ(static_cast<uint32_t>(0xd9963a56),
+            TypeParam::Extend(0, data, sizeof(data)));
+}
+
+TYPED_TEST_P(ExtendTest, HelloWorld) {
+  const uint8_t* hello_space_world =
+      reinterpret_cast<const uint8_t*>("hello world");
+  const uint8_t* hello_space = reinterpret_cast<const uint8_t*>("hello ");
+  const uint8_t* world = reinterpret_cast<const uint8_t*>("world");
+
+  EXPECT_EQ(TypeParam::Extend(0, hello_space_world, 11),
+            TypeParam::Extend(TypeParam::Extend(0, hello_space, 6), world, 5));
+}
+
+TYPED_TEST_P(ExtendTest, BufferSlicing) {
+  uint8_t buffer[48] = {
+      0x01, 0xc0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+      0x00, 0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00,
+      0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x18, 0x28, 0x00, 0x00, 0x00,
+      0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+  };
+
+  for (size_t i = 0; i < 48; ++i) {
+    for (size_t j = i + 1; j <= 48; ++j) {
+      uint32_t crc = 0;
+
+      if (i > 0) crc = TypeParam::Extend(crc, buffer, i);
+      crc = TypeParam::Extend(crc, buffer + i, j - i);
+      if (j < 48) crc = TypeParam::Extend(crc, buffer + j, 48 - j);
+
+      EXPECT_EQ(static_cast<uint32_t>(0xd9963a56), crc);
+    }
+  }
+}
+
+TYPED_TEST_P(ExtendTest, LargeBufferSlicing) {
+  uint8_t buffer[2048];
+  for (size_t i = 0; i < 2048; i++)
+    buffer[i] = static_cast<uint8_t>(3 * i * i + 7 * i + 11);
+
+  for (size_t i = 0; i < 2048; ++i) {
+    for (size_t j = i + 1; j <= 2048; ++j) {
+      uint32_t crc = 0;
+
+      if (i > 0) crc = TypeParam::Extend(crc, buffer, i);
+      crc = TypeParam::Extend(crc, buffer + i, j - i);
+      if (j < 2048) crc = TypeParam::Extend(crc, buffer + j, 2048 - j);
+
+      EXPECT_EQ(static_cast<uint32_t>(0x36dcc753), crc);
+    }
+  }
+}
+
+REGISTER_TYPED_TEST_CASE_P(ExtendTest,
+    StandardResults,
+    HelloWorld,
+    BufferSlicing,
+    LargeBufferSlicing);
+
+}  // namespace crc32c
+
+#endif  // CRC32C_CRC32C_EXTEND_UNITTESTS_H_
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_internal.h b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_internal.h
new file mode 100644
index 0000000000..2bd23dea43
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_internal.h
@@ -0,0 +1,23 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef CRC32C_CRC32C_INTERNAL_H_
+#define CRC32C_CRC32C_INTERNAL_H_
+
+// Internal functions that may change between releases.
+
+#include <cstddef>
+#include <cstdint>
+
+namespace crc32c {
+
+// Un-accelerated implementation that works on all CPUs.
+uint32_t ExtendPortable(uint32_t crc, const uint8_t* data, size_t count);
+
+// CRCs are pre- and post- conditioned by xoring with all ones.
+static constexpr const uint32_t kCRC32Xor = static_cast<uint32_t>(0xffffffffU);
+
+}  // namespace crc32c
+
+#endif  // CRC32C_CRC32C_INTERNAL_H_
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_portable.cc b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_portable.cc
new file mode 100644
index 0000000000..31ec6eac53
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_portable.cc
@@ -0,0 +1,351 @@
+// Copyright 2008 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "./crc32c_internal.h"
+
+#include <cstddef>
+#include <cstdint>
+
+#include "./crc32c_prefetch.h"
+#include "./crc32c_read_le.h"
+#include "./crc32c_round_up.h"
+
+namespace {
+
+const uint32_t kByteExtensionTable[256] = {
+    0x00000000, 0xf26b8303, 0xe13b70f7, 0x1350f3f4, 0xc79a971f, 0x35f1141c,
+    0x26a1e7e8, 0xd4ca64eb, 0x8ad958cf, 0x78b2dbcc, 0x6be22838, 0x9989ab3b,
+    0x4d43cfd0, 0xbf284cd3, 0xac78bf27, 0x5e133c24, 0x105ec76f, 0xe235446c,
+    0xf165b798, 0x030e349b, 0xd7c45070, 0x25afd373, 0x36ff2087, 0xc494a384,
+    0x9a879fa0, 0x68ec1ca3, 0x7bbcef57, 0x89d76c54, 0x5d1d08bf, 0xaf768bbc,
+    0xbc267848, 0x4e4dfb4b, 0x20bd8ede, 0xd2d60ddd, 0xc186fe29, 0x33ed7d2a,
+    0xe72719c1, 0x154c9ac2, 0x061c6936, 0xf477ea35, 0xaa64d611, 0x580f5512,
+    0x4b5fa6e6, 0xb93425e5, 0x6dfe410e, 0x9f95c20d, 0x8cc531f9, 0x7eaeb2fa,
+    0x30e349b1, 0xc288cab2, 0xd1d83946, 0x23b3ba45, 0xf779deae, 0x05125dad,
+    0x1642ae59, 0xe4292d5a, 0xba3a117e, 0x4851927d, 0x5b016189, 0xa96ae28a,
+    0x7da08661, 0x8fcb0562, 0x9c9bf696, 0x6ef07595, 0x417b1dbc, 0xb3109ebf,
+    0xa0406d4b, 0x522bee48, 0x86e18aa3, 0x748a09a0, 0x67dafa54, 0x95b17957,
+    0xcba24573, 0x39c9c670, 0x2a993584, 0xd8f2b687, 0x0c38d26c, 0xfe53516f,
+    0xed03a29b, 0x1f682198, 0x5125dad3, 0xa34e59d0, 0xb01eaa24, 0x42752927,
+    0x96bf4dcc, 0x64d4cecf, 0x77843d3b, 0x85efbe38, 0xdbfc821c, 0x2997011f,
+    0x3ac7f2eb, 0xc8ac71e8, 0x1c661503, 0xee0d9600, 0xfd5d65f4, 0x0f36e6f7,
+    0x61c69362, 0x93ad1061, 0x80fde395, 0x72966096, 0xa65c047d, 0x5437877e,
+    0x4767748a, 0xb50cf789, 0xeb1fcbad, 0x197448ae, 0x0a24bb5a, 0xf84f3859,
+    0x2c855cb2, 0xdeeedfb1, 0xcdbe2c45, 0x3fd5af46, 0x7198540d, 0x83f3d70e,
+    0x90a324fa, 0x62c8a7f9, 0xb602c312, 0x44694011, 0x5739b3e5, 0xa55230e6,
+    0xfb410cc2, 0x092a8fc1, 0x1a7a7c35, 0xe811ff36, 0x3cdb9bdd, 0xceb018de,
+    0xdde0eb2a, 0x2f8b6829, 0x82f63b78, 0x709db87b, 0x63cd4b8f, 0x91a6c88c,
+    0x456cac67, 0xb7072f64, 0xa457dc90, 0x563c5f93, 0x082f63b7, 0xfa44e0b4,
+    0xe9141340, 0x1b7f9043, 0xcfb5f4a8, 0x3dde77ab, 0x2e8e845f, 0xdce5075c,
+    0x92a8fc17, 0x60c37f14, 0x73938ce0, 0x81f80fe3, 0x55326b08, 0xa759e80b,
+    0xb4091bff, 0x466298fc, 0x1871a4d8, 0xea1a27db, 0xf94ad42f, 0x0b21572c,
+    0xdfeb33c7, 0x2d80b0c4, 0x3ed04330, 0xccbbc033, 0xa24bb5a6, 0x502036a5,
+    0x4370c551, 0xb11b4652, 0x65d122b9, 0x97baa1ba, 0x84ea524e, 0x7681d14d,
+    0x2892ed69, 0xdaf96e6a, 0xc9a99d9e, 0x3bc21e9d, 0xef087a76, 0x1d63f975,
+    0x0e330a81, 0xfc588982, 0xb21572c9, 0x407ef1ca, 0x532e023e, 0xa145813d,
+    0x758fe5d6, 0x87e466d5, 0x94b49521, 0x66df1622, 0x38cc2a06, 0xcaa7a905,
+    0xd9f75af1, 0x2b9cd9f2, 0xff56bd19, 0x0d3d3e1a, 0x1e6dcdee, 0xec064eed,
+    0xc38d26c4, 0x31e6a5c7, 0x22b65633, 0xd0ddd530, 0x0417b1db, 0xf67c32d8,
+    0xe52cc12c, 0x1747422f, 0x49547e0b, 0xbb3ffd08, 0xa86f0efc, 0x5a048dff,
+    0x8ecee914, 0x7ca56a17, 0x6ff599e3, 0x9d9e1ae0, 0xd3d3e1ab, 0x21b862a8,
+    0x32e8915c, 0xc083125f, 0x144976b4, 0xe622f5b7, 0xf5720643, 0x07198540,
+    0x590ab964, 0xab613a67, 0xb831c993, 0x4a5a4a90, 0x9e902e7b, 0x6cfbad78,
+    0x7fab5e8c, 0x8dc0dd8f, 0xe330a81a, 0x115b2b19, 0x020bd8ed, 0xf0605bee,
+    0x24aa3f05, 0xd6c1bc06, 0xc5914ff2, 0x37faccf1, 0x69e9f0d5, 0x9b8273d6,
+    0x88d28022, 0x7ab90321, 0xae7367ca, 0x5c18e4c9, 0x4f48173d, 0xbd23943e,
+    0xf36e6f75, 0x0105ec76, 0x12551f82, 0xe03e9c81, 0x34f4f86a, 0xc69f7b69,
+    0xd5cf889d, 0x27a40b9e, 0x79b737ba, 0x8bdcb4b9, 0x988c474d, 0x6ae7c44e,
+    0xbe2da0a5, 0x4c4623a6, 0x5f16d052, 0xad7d5351};
+
+const uint32_t kStrideExtensionTable0[256] = {
+    0x00000000, 0x30d23865, 0x61a470ca, 0x517648af, 0xc348e194, 0xf39ad9f1,
+    0xa2ec915e, 0x923ea93b, 0x837db5d9, 0xb3af8dbc, 0xe2d9c513, 0xd20bfd76,
+    0x4035544d, 0x70e76c28, 0x21912487, 0x11431ce2, 0x03171d43, 0x33c52526,
+    0x62b36d89, 0x526155ec, 0xc05ffcd7, 0xf08dc4b2, 0xa1fb8c1d, 0x9129b478,
+    0x806aa89a, 0xb0b890ff, 0xe1ced850, 0xd11ce035, 0x4322490e, 0x73f0716b,
+    0x228639c4, 0x125401a1, 0x062e3a86, 0x36fc02e3, 0x678a4a4c, 0x57587229,
+    0xc566db12, 0xf5b4e377, 0xa4c2abd8, 0x941093bd, 0x85538f5f, 0xb581b73a,
+    0xe4f7ff95, 0xd425c7f0, 0x461b6ecb, 0x76c956ae, 0x27bf1e01, 0x176d2664,
+    0x053927c5, 0x35eb1fa0, 0x649d570f, 0x544f6f6a, 0xc671c651, 0xf6a3fe34,
+    0xa7d5b69b, 0x97078efe, 0x8644921c, 0xb696aa79, 0xe7e0e2d6, 0xd732dab3,
+    0x450c7388, 0x75de4bed, 0x24a80342, 0x147a3b27, 0x0c5c750c, 0x3c8e4d69,
+    0x6df805c6, 0x5d2a3da3, 0xcf149498, 0xffc6acfd, 0xaeb0e452, 0x9e62dc37,
+    0x8f21c0d5, 0xbff3f8b0, 0xee85b01f, 0xde57887a, 0x4c692141, 0x7cbb1924,
+    0x2dcd518b, 0x1d1f69ee, 0x0f4b684f, 0x3f99502a, 0x6eef1885, 0x5e3d20e0,
+    0xcc0389db, 0xfcd1b1be, 0xada7f911, 0x9d75c174, 0x8c36dd96, 0xbce4e5f3,
+    0xed92ad5c, 0xdd409539, 0x4f7e3c02, 0x7fac0467, 0x2eda4cc8, 0x1e0874ad,
+    0x0a724f8a, 0x3aa077ef, 0x6bd63f40, 0x5b040725, 0xc93aae1e, 0xf9e8967b,
+    0xa89eded4, 0x984ce6b1, 0x890ffa53, 0xb9ddc236, 0xe8ab8a99, 0xd879b2fc,
+    0x4a471bc7, 0x7a9523a2, 0x2be36b0d, 0x1b315368, 0x096552c9, 0x39b76aac,
+    0x68c12203, 0x58131a66, 0xca2db35d, 0xfaff8b38, 0xab89c397, 0x9b5bfbf2,
+    0x8a18e710, 0xbacadf75, 0xebbc97da, 0xdb6eafbf, 0x49500684, 0x79823ee1,
+    0x28f4764e, 0x18264e2b, 0x18b8ea18, 0x286ad27d, 0x791c9ad2, 0x49cea2b7,
+    0xdbf00b8c, 0xeb2233e9, 0xba547b46, 0x8a864323, 0x9bc55fc1, 0xab1767a4,
+    0xfa612f0b, 0xcab3176e, 0x588dbe55, 0x685f8630, 0x3929ce9f, 0x09fbf6fa,
+    0x1baff75b, 0x2b7dcf3e, 0x7a0b8791, 0x4ad9bff4, 0xd8e716cf, 0xe8352eaa,
+    0xb9436605, 0x89915e60, 0x98d24282, 0xa8007ae7, 0xf9763248, 0xc9a40a2d,
+    0x5b9aa316, 0x6b489b73, 0x3a3ed3dc, 0x0aecebb9, 0x1e96d09e, 0x2e44e8fb,
+    0x7f32a054, 0x4fe09831, 0xddde310a, 0xed0c096f, 0xbc7a41c0, 0x8ca879a5,
+    0x9deb6547, 0xad395d22, 0xfc4f158d, 0xcc9d2de8, 0x5ea384d3, 0x6e71bcb6,
+    0x3f07f419, 0x0fd5cc7c, 0x1d81cddd, 0x2d53f5b8, 0x7c25bd17, 0x4cf78572,
+    0xdec92c49, 0xee1b142c, 0xbf6d5c83, 0x8fbf64e6, 0x9efc7804, 0xae2e4061,
+    0xff5808ce, 0xcf8a30ab, 0x5db49990, 0x6d66a1f5, 0x3c10e95a, 0x0cc2d13f,
+    0x14e49f14, 0x2436a771, 0x7540efde, 0x4592d7bb, 0xd7ac7e80, 0xe77e46e5,
+    0xb6080e4a, 0x86da362f, 0x97992acd, 0xa74b12a8, 0xf63d5a07, 0xc6ef6262,
+    0x54d1cb59, 0x6403f33c, 0x3575bb93, 0x05a783f6, 0x17f38257, 0x2721ba32,
+    0x7657f29d, 0x4685caf8, 0xd4bb63c3, 0xe4695ba6, 0xb51f1309, 0x85cd2b6c,
+    0x948e378e, 0xa45c0feb, 0xf52a4744, 0xc5f87f21, 0x57c6d61a, 0x6714ee7f,
+    0x3662a6d0, 0x06b09eb5, 0x12caa592, 0x22189df7, 0x736ed558, 0x43bced3d,
+    0xd1824406, 0xe1507c63, 0xb02634cc, 0x80f40ca9, 0x91b7104b, 0xa165282e,
+    0xf0136081, 0xc0c158e4, 0x52fff1df, 0x622dc9ba, 0x335b8115, 0x0389b970,
+    0x11ddb8d1, 0x210f80b4, 0x7079c81b, 0x40abf07e, 0xd2955945, 0xe2476120,
+    0xb331298f, 0x83e311ea, 0x92a00d08, 0xa272356d, 0xf3047dc2, 0xc3d645a7,
+    0x51e8ec9c, 0x613ad4f9, 0x304c9c56, 0x009ea433};
+
+const uint32_t kStrideExtensionTable1[256] = {
+    0x00000000, 0x54075546, 0xa80eaa8c, 0xfc09ffca, 0x55f123e9, 0x01f676af,
+    0xfdff8965, 0xa9f8dc23, 0xabe247d2, 0xffe51294, 0x03eced5e, 0x57ebb818,
+    0xfe13643b, 0xaa14317d, 0x561dceb7, 0x021a9bf1, 0x5228f955, 0x062fac13,
+    0xfa2653d9, 0xae21069f, 0x07d9dabc, 0x53de8ffa, 0xafd77030, 0xfbd02576,
+    0xf9cabe87, 0xadcdebc1, 0x51c4140b, 0x05c3414d, 0xac3b9d6e, 0xf83cc828,
+    0x043537e2, 0x503262a4, 0xa451f2aa, 0xf056a7ec, 0x0c5f5826, 0x58580d60,
+    0xf1a0d143, 0xa5a78405, 0x59ae7bcf, 0x0da92e89, 0x0fb3b578, 0x5bb4e03e,
+    0xa7bd1ff4, 0xf3ba4ab2, 0x5a429691, 0x0e45c3d7, 0xf24c3c1d, 0xa64b695b,
+    0xf6790bff, 0xa27e5eb9, 0x5e77a173, 0x0a70f435, 0xa3882816, 0xf78f7d50,
+    0x0b86829a, 0x5f81d7dc, 0x5d9b4c2d, 0x099c196b, 0xf595e6a1, 0xa192b3e7,
+    0x086a6fc4, 0x5c6d3a82, 0xa064c548, 0xf463900e, 0x4d4f93a5, 0x1948c6e3,
+    0xe5413929, 0xb1466c6f, 0x18beb04c, 0x4cb9e50a, 0xb0b01ac0, 0xe4b74f86,
+    0xe6add477, 0xb2aa8131, 0x4ea37efb, 0x1aa42bbd, 0xb35cf79e, 0xe75ba2d8,
+    0x1b525d12, 0x4f550854, 0x1f676af0, 0x4b603fb6, 0xb769c07c, 0xe36e953a,
+    0x4a964919, 0x1e911c5f, 0xe298e395, 0xb69fb6d3, 0xb4852d22, 0xe0827864,
+    0x1c8b87ae, 0x488cd2e8, 0xe1740ecb, 0xb5735b8d, 0x497aa447, 0x1d7df101,
+    0xe91e610f, 0xbd193449, 0x4110cb83, 0x15179ec5, 0xbcef42e6, 0xe8e817a0,
+    0x14e1e86a, 0x40e6bd2c, 0x42fc26dd, 0x16fb739b, 0xeaf28c51, 0xbef5d917,
+    0x170d0534, 0x430a5072, 0xbf03afb8, 0xeb04fafe, 0xbb36985a, 0xef31cd1c,
+    0x133832d6, 0x473f6790, 0xeec7bbb3, 0xbac0eef5, 0x46c9113f, 0x12ce4479,
+    0x10d4df88, 0x44d38ace, 0xb8da7504, 0xecdd2042, 0x4525fc61, 0x1122a927,
+    0xed2b56ed, 0xb92c03ab, 0x9a9f274a, 0xce98720c, 0x32918dc6, 0x6696d880,
+    0xcf6e04a3, 0x9b6951e5, 0x6760ae2f, 0x3367fb69, 0x317d6098, 0x657a35de,
+    0x9973ca14, 0xcd749f52, 0x648c4371, 0x308b1637, 0xcc82e9fd, 0x9885bcbb,
+    0xc8b7de1f, 0x9cb08b59, 0x60b97493, 0x34be21d5, 0x9d46fdf6, 0xc941a8b0,
+    0x3548577a, 0x614f023c, 0x635599cd, 0x3752cc8b, 0xcb5b3341, 0x9f5c6607,
+    0x36a4ba24, 0x62a3ef62, 0x9eaa10a8, 0xcaad45ee, 0x3eced5e0, 0x6ac980a6,
+    0x96c07f6c, 0xc2c72a2a, 0x6b3ff609, 0x3f38a34f, 0xc3315c85, 0x973609c3,
+    0x952c9232, 0xc12bc774, 0x3d2238be, 0x69256df8, 0xc0ddb1db, 0x94dae49d,
+    0x68d31b57, 0x3cd44e11, 0x6ce62cb5, 0x38e179f3, 0xc4e88639, 0x90efd37f,
+    0x39170f5c, 0x6d105a1a, 0x9119a5d0, 0xc51ef096, 0xc7046b67, 0x93033e21,
+    0x6f0ac1eb, 0x3b0d94ad, 0x92f5488e, 0xc6f21dc8, 0x3afbe202, 0x6efcb744,
+    0xd7d0b4ef, 0x83d7e1a9, 0x7fde1e63, 0x2bd94b25, 0x82219706, 0xd626c240,
+    0x2a2f3d8a, 0x7e2868cc, 0x7c32f33d, 0x2835a67b, 0xd43c59b1, 0x803b0cf7,
+    0x29c3d0d4, 0x7dc48592, 0x81cd7a58, 0xd5ca2f1e, 0x85f84dba, 0xd1ff18fc,
+    0x2df6e736, 0x79f1b270, 0xd0096e53, 0x840e3b15, 0x7807c4df, 0x2c009199,
+    0x2e1a0a68, 0x7a1d5f2e, 0x8614a0e4, 0xd213f5a2, 0x7beb2981, 0x2fec7cc7,
+    0xd3e5830d, 0x87e2d64b, 0x73814645, 0x27861303, 0xdb8fecc9, 0x8f88b98f,
+    0x267065ac, 0x727730ea, 0x8e7ecf20, 0xda799a66, 0xd8630197, 0x8c6454d1,
+    0x706dab1b, 0x246afe5d, 0x8d92227e, 0xd9957738, 0x259c88f2, 0x719bddb4,
+    0x21a9bf10, 0x75aeea56, 0x89a7159c, 0xdda040da, 0x74589cf9, 0x205fc9bf,
+    0xdc563675, 0x88516333, 0x8a4bf8c2, 0xde4cad84, 0x2245524e, 0x76420708,
+    0xdfbadb2b, 0x8bbd8e6d, 0x77b471a7, 0x23b324e1};
+
+const uint32_t kStrideExtensionTable2[256] = {
+    0x00000000, 0x678efd01, 0xcf1dfa02, 0xa8930703, 0x9bd782f5, 0xfc597ff4,
+    0x54ca78f7, 0x334485f6, 0x3243731b, 0x55cd8e1a, 0xfd5e8919, 0x9ad07418,
+    0xa994f1ee, 0xce1a0cef, 0x66890bec, 0x0107f6ed, 0x6486e636, 0x03081b37,
+    0xab9b1c34, 0xcc15e135, 0xff5164c3, 0x98df99c2, 0x304c9ec1, 0x57c263c0,
+    0x56c5952d, 0x314b682c, 0x99d86f2f, 0xfe56922e, 0xcd1217d8, 0xaa9cead9,
+    0x020fedda, 0x658110db, 0xc90dcc6c, 0xae83316d, 0x0610366e, 0x619ecb6f,
+    0x52da4e99, 0x3554b398, 0x9dc7b49b, 0xfa49499a, 0xfb4ebf77, 0x9cc04276,
+    0x34534575, 0x53ddb874, 0x60993d82, 0x0717c083, 0xaf84c780, 0xc80a3a81,
+    0xad8b2a5a, 0xca05d75b, 0x6296d058, 0x05182d59, 0x365ca8af, 0x51d255ae,
+    0xf94152ad, 0x9ecfafac, 0x9fc85941, 0xf846a440, 0x50d5a343, 0x375b5e42,
+    0x041fdbb4, 0x639126b5, 0xcb0221b6, 0xac8cdcb7, 0x97f7ee29, 0xf0791328,
+    0x58ea142b, 0x3f64e92a, 0x0c206cdc, 0x6bae91dd, 0xc33d96de, 0xa4b36bdf,
+    0xa5b49d32, 0xc23a6033, 0x6aa96730, 0x0d279a31, 0x3e631fc7, 0x59ede2c6,
+    0xf17ee5c5, 0x96f018c4, 0xf371081f, 0x94fff51e, 0x3c6cf21d, 0x5be20f1c,
+    0x68a68aea, 0x0f2877eb, 0xa7bb70e8, 0xc0358de9, 0xc1327b04, 0xa6bc8605,
+    0x0e2f8106, 0x69a17c07, 0x5ae5f9f1, 0x3d6b04f0, 0x95f803f3, 0xf276fef2,
+    0x5efa2245, 0x3974df44, 0x91e7d847, 0xf6692546, 0xc52da0b0, 0xa2a35db1,
+    0x0a305ab2, 0x6dbea7b3, 0x6cb9515e, 0x0b37ac5f, 0xa3a4ab5c, 0xc42a565d,
+    0xf76ed3ab, 0x90e02eaa, 0x387329a9, 0x5ffdd4a8, 0x3a7cc473, 0x5df23972,
+    0xf5613e71, 0x92efc370, 0xa1ab4686, 0xc625bb87, 0x6eb6bc84, 0x09384185,
+    0x083fb768, 0x6fb14a69, 0xc7224d6a, 0xa0acb06b, 0x93e8359d, 0xf466c89c,
+    0x5cf5cf9f, 0x3b7b329e, 0x2a03aaa3, 0x4d8d57a2, 0xe51e50a1, 0x8290ada0,
+    0xb1d42856, 0xd65ad557, 0x7ec9d254, 0x19472f55, 0x1840d9b8, 0x7fce24b9,
+    0xd75d23ba, 0xb0d3debb, 0x83975b4d, 0xe419a64c, 0x4c8aa14f, 0x2b045c4e,
+    0x4e854c95, 0x290bb194, 0x8198b697, 0xe6164b96, 0xd552ce60, 0xb2dc3361,
+    0x1a4f3462, 0x7dc1c963, 0x7cc63f8e, 0x1b48c28f, 0xb3dbc58c, 0xd455388d,
+    0xe711bd7b, 0x809f407a, 0x280c4779, 0x4f82ba78, 0xe30e66cf, 0x84809bce,
+    0x2c139ccd, 0x4b9d61cc, 0x78d9e43a, 0x1f57193b, 0xb7c41e38, 0xd04ae339,
+    0xd14d15d4, 0xb6c3e8d5, 0x1e50efd6, 0x79de12d7, 0x4a9a9721, 0x2d146a20,
+    0x85876d23, 0xe2099022, 0x878880f9, 0xe0067df8, 0x48957afb, 0x2f1b87fa,
+    0x1c5f020c, 0x7bd1ff0d, 0xd342f80e, 0xb4cc050f, 0xb5cbf3e2, 0xd2450ee3,
+    0x7ad609e0, 0x1d58f4e1, 0x2e1c7117, 0x49928c16, 0xe1018b15, 0x868f7614,
+    0xbdf4448a, 0xda7ab98b, 0x72e9be88, 0x15674389, 0x2623c67f, 0x41ad3b7e,
+    0xe93e3c7d, 0x8eb0c17c, 0x8fb73791, 0xe839ca90, 0x40aacd93, 0x27243092,
+    0x1460b564, 0x73ee4865, 0xdb7d4f66, 0xbcf3b267, 0xd972a2bc, 0xbefc5fbd,
+    0x166f58be, 0x71e1a5bf, 0x42a52049, 0x252bdd48, 0x8db8da4b, 0xea36274a,
+    0xeb31d1a7, 0x8cbf2ca6, 0x242c2ba5, 0x43a2d6a4, 0x70e65352, 0x1768ae53,
+    0xbffba950, 0xd8755451, 0x74f988e6, 0x137775e7, 0xbbe472e4, 0xdc6a8fe5,
+    0xef2e0a13, 0x88a0f712, 0x2033f011, 0x47bd0d10, 0x46bafbfd, 0x213406fc,
+    0x89a701ff, 0xee29fcfe, 0xdd6d7908, 0xbae38409, 0x1270830a, 0x75fe7e0b,
+    0x107f6ed0, 0x77f193d1, 0xdf6294d2, 0xb8ec69d3, 0x8ba8ec25, 0xec261124,
+    0x44b51627, 0x233beb26, 0x223c1dcb, 0x45b2e0ca, 0xed21e7c9, 0x8aaf1ac8,
+    0xb9eb9f3e, 0xde65623f, 0x76f6653c, 0x1178983d};
+
+const uint32_t kStrideExtensionTable3[256] = {
+    0x00000000, 0xf20c0dfe, 0xe1f46d0d, 0x13f860f3, 0xc604aceb, 0x3408a115,
+    0x27f0c1e6, 0xd5fccc18, 0x89e52f27, 0x7be922d9, 0x6811422a, 0x9a1d4fd4,
+    0x4fe183cc, 0xbded8e32, 0xae15eec1, 0x5c19e33f, 0x162628bf, 0xe42a2541,
+    0xf7d245b2, 0x05de484c, 0xd0228454, 0x222e89aa, 0x31d6e959, 0xc3dae4a7,
+    0x9fc30798, 0x6dcf0a66, 0x7e376a95, 0x8c3b676b, 0x59c7ab73, 0xabcba68d,
+    0xb833c67e, 0x4a3fcb80, 0x2c4c517e, 0xde405c80, 0xcdb83c73, 0x3fb4318d,
+    0xea48fd95, 0x1844f06b, 0x0bbc9098, 0xf9b09d66, 0xa5a97e59, 0x57a573a7,
+    0x445d1354, 0xb6511eaa, 0x63add2b2, 0x91a1df4c, 0x8259bfbf, 0x7055b241,
+    0x3a6a79c1, 0xc866743f, 0xdb9e14cc, 0x29921932, 0xfc6ed52a, 0x0e62d8d4,
+    0x1d9ab827, 0xef96b5d9, 0xb38f56e6, 0x41835b18, 0x527b3beb, 0xa0773615,
+    0x758bfa0d, 0x8787f7f3, 0x947f9700, 0x66739afe, 0x5898a2fc, 0xaa94af02,
+    0xb96ccff1, 0x4b60c20f, 0x9e9c0e17, 0x6c9003e9, 0x7f68631a, 0x8d646ee4,
+    0xd17d8ddb, 0x23718025, 0x3089e0d6, 0xc285ed28, 0x17792130, 0xe5752cce,
+    0xf68d4c3d, 0x048141c3, 0x4ebe8a43, 0xbcb287bd, 0xaf4ae74e, 0x5d46eab0,
+    0x88ba26a8, 0x7ab62b56, 0x694e4ba5, 0x9b42465b, 0xc75ba564, 0x3557a89a,
+    0x26afc869, 0xd4a3c597, 0x015f098f, 0xf3530471, 0xe0ab6482, 0x12a7697c,
+    0x74d4f382, 0x86d8fe7c, 0x95209e8f, 0x672c9371, 0xb2d05f69, 0x40dc5297,
+    0x53243264, 0xa1283f9a, 0xfd31dca5, 0x0f3dd15b, 0x1cc5b1a8, 0xeec9bc56,
+    0x3b35704e, 0xc9397db0, 0xdac11d43, 0x28cd10bd, 0x62f2db3d, 0x90fed6c3,
+    0x8306b630, 0x710abbce, 0xa4f677d6, 0x56fa7a28, 0x45021adb, 0xb70e1725,
+    0xeb17f41a, 0x191bf9e4, 0x0ae39917, 0xf8ef94e9, 0x2d1358f1, 0xdf1f550f,
+    0xcce735fc, 0x3eeb3802, 0xb13145f8, 0x433d4806, 0x50c528f5, 0xa2c9250b,
+    0x7735e913, 0x8539e4ed, 0x96c1841e, 0x64cd89e0, 0x38d46adf, 0xcad86721,
+    0xd92007d2, 0x2b2c0a2c, 0xfed0c634, 0x0cdccbca, 0x1f24ab39, 0xed28a6c7,
+    0xa7176d47, 0x551b60b9, 0x46e3004a, 0xb4ef0db4, 0x6113c1ac, 0x931fcc52,
+    0x80e7aca1, 0x72eba15f, 0x2ef24260, 0xdcfe4f9e, 0xcf062f6d, 0x3d0a2293,
+    0xe8f6ee8b, 0x1afae375, 0x09028386, 0xfb0e8e78, 0x9d7d1486, 0x6f711978,
+    0x7c89798b, 0x8e857475, 0x5b79b86d, 0xa975b593, 0xba8dd560, 0x4881d89e,
+    0x14983ba1, 0xe694365f, 0xf56c56ac, 0x07605b52, 0xd29c974a, 0x20909ab4,
+    0x3368fa47, 0xc164f7b9, 0x8b5b3c39, 0x795731c7, 0x6aaf5134, 0x98a35cca,
+    0x4d5f90d2, 0xbf539d2c, 0xacabfddf, 0x5ea7f021, 0x02be131e, 0xf0b21ee0,
+    0xe34a7e13, 0x114673ed, 0xc4babff5, 0x36b6b20b, 0x254ed2f8, 0xd742df06,
+    0xe9a9e704, 0x1ba5eafa, 0x085d8a09, 0xfa5187f7, 0x2fad4bef, 0xdda14611,
+    0xce5926e2, 0x3c552b1c, 0x604cc823, 0x9240c5dd, 0x81b8a52e, 0x73b4a8d0,
+    0xa64864c8, 0x54446936, 0x47bc09c5, 0xb5b0043b, 0xff8fcfbb, 0x0d83c245,
+    0x1e7ba2b6, 0xec77af48, 0x398b6350, 0xcb876eae, 0xd87f0e5d, 0x2a7303a3,
+    0x766ae09c, 0x8466ed62, 0x979e8d91, 0x6592806f, 0xb06e4c77, 0x42624189,
+    0x519a217a, 0xa3962c84, 0xc5e5b67a, 0x37e9bb84, 0x2411db77, 0xd61dd689,
+    0x03e11a91, 0xf1ed176f, 0xe215779c, 0x10197a62, 0x4c00995d, 0xbe0c94a3,
+    0xadf4f450, 0x5ff8f9ae, 0x8a0435b6, 0x78083848, 0x6bf058bb, 0x99fc5545,
+    0xd3c39ec5, 0x21cf933b, 0x3237f3c8, 0xc03bfe36, 0x15c7322e, 0xe7cb3fd0,
+    0xf4335f23, 0x063f52dd, 0x5a26b1e2, 0xa82abc1c, 0xbbd2dcef, 0x49ded111,
+    0x9c221d09, 0x6e2e10f7, 0x7dd67004, 0x8fda7dfa};
+
+constexpr const ptrdiff_t kPrefetchHorizon = 256;
+
+}  // namespace
+
+namespace crc32c {
+
+uint32_t ExtendPortable(uint32_t crc, const uint8_t* data, size_t size) {
+  const uint8_t* p = data;
+  const uint8_t* e = p + size;
+  uint32_t l = crc ^ kCRC32Xor;
+
+// Process one byte at a time.
+#define STEP1                              \
+  do {                                     \
+    int c = (l & 0xff) ^ *p++;             \
+    l = kByteExtensionTable[c] ^ (l >> 8); \
+  } while (0)
+
+// Process one of the 4 strides of 4-byte data.
+#define STEP4(s)                                                               \
+  do {                                                                         \
+    crc##s = ReadUint32LE(p + s * 4) ^ kStrideExtensionTable3[crc##s & 0xff] ^ \
+             kStrideExtensionTable2[(crc##s >> 8) & 0xff] ^                    \
+             kStrideExtensionTable1[(crc##s >> 16) & 0xff] ^                   \
+             kStrideExtensionTable0[crc##s >> 24];                             \
+  } while (0)
+
+// Process a 16-byte swath of 4 strides, each of which has 4 bytes of data.
+#define STEP16 \
+  do {         \
+    STEP4(0);  \
+    STEP4(1);  \
+    STEP4(2);  \
+    STEP4(3);  \
+    p += 16;   \
+  } while (0)
+
+// Process 4 bytes that were already loaded into a word.
+#define STEP4W(w)                                   \
+  do {                                              \
+    w ^= l;                                         \
+    for (size_t i = 0; i < 4; ++i) {                \
+      w = (w >> 8) ^ kByteExtensionTable[w & 0xff]; \
+    }                                               \
+    l = w;                                          \
+  } while (0)
+
+  // Point x at first 4-byte aligned byte in the buffer. This might be past the
+  // end of the buffer.
+  const uint8_t* x = RoundUp<4>(p);
+  if (x <= e) {
+    // Process bytes p is 4-byte aligned.
+    while (p != x) {
+      STEP1;
+    }
+  }
+
+  if ((e - p) >= 16) {
+    // Load a 16-byte swath into the stride partial results.
+    uint32_t crc0 = ReadUint32LE(p + 0 * 4) ^ l;
+    uint32_t crc1 = ReadUint32LE(p + 1 * 4);
+    uint32_t crc2 = ReadUint32LE(p + 2 * 4);
+    uint32_t crc3 = ReadUint32LE(p + 3 * 4);
+    p += 16;
+
+    while ((e - p) > kPrefetchHorizon) {
+      RequestPrefetch(p + kPrefetchHorizon);
+
+      // Process 64 bytes at a time.
+      STEP16;
+      STEP16;
+      STEP16;
+      STEP16;
+    }
+
+    // Process one 16-byte swath at a time.
+    while ((e - p) >= 16) {
+      STEP16;
+    }
+
+    // Advance one word at a time as far as possible.
+    while ((e - p) >= 4) {
+      STEP4(0);
+      uint32_t tmp = crc0;
+      crc0 = crc1;
+      crc1 = crc2;
+      crc2 = crc3;
+      crc3 = tmp;
+      p += 4;
+    }
+
+    // Combine the 4 partial stride results.
+    l = 0;
+    STEP4W(crc0);
+    STEP4W(crc1);
+    STEP4W(crc2);
+    STEP4W(crc3);
+  }
+
+  // Process the last few bytes.
+  while (p != e) {
+    STEP1;
+  }
+#undef STEP4W
+#undef STEP16
+#undef STEP4
+#undef STEP1
+  return l ^ kCRC32Xor;
+}
+
+}  // namespace crc32c
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_portable_unittest.cc b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_portable_unittest.cc
new file mode 100644
index 0000000000..7d87d92553
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_portable_unittest.cc
@@ -0,0 +1,20 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "gtest/gtest.h"
+
+#include "./crc32c_extend_unittests.h"
+#include "./crc32c_internal.h"
+
+namespace crc32c {
+
+struct PortableTestTraits {
+  static uint32_t Extend(uint32_t crc, const uint8_t* data, size_t count) {
+    return ExtendPortable(crc, data, count);
+  }
+};
+
+INSTANTIATE_TYPED_TEST_CASE_P(Portable, ExtendTest, PortableTestTraits);
+
+}  // namespace crc32c
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_prefetch.h b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_prefetch.h
new file mode 100644
index 0000000000..e8df540494
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_prefetch.h
@@ -0,0 +1,44 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef CRC32C_CRC32C_PREFETCH_H_
+#define CRC32C_CRC32C_PREFETCH_H_
+
+#include <cstddef>
+#include <cstdint>
+
+#include "crc32c/crc32c_config.h"
+
+#if HAVE_MM_PREFETCH
+
+#if defined(_MSC_VER)
+#include <intrin.h>
+#else  // !defined(_MSC_VER)
+#include <xmmintrin.h>
+#endif  // defined(_MSC_VER)
+
+#endif  // HAVE_MM_PREFETCH
+
+namespace crc32c {
+
+// Ask the hardware to prefetch the data at the given address into the L1 cache.
+inline void RequestPrefetch(const uint8_t* address) {
+#if HAVE_BUILTIN_PREFETCH
+  // Clang and GCC implement the __builtin_prefetch non-standard extension,
+  // which maps to the best instruction on the target architecture.
+  __builtin_prefetch(reinterpret_cast<const char*>(address), 0 /* Read only. */,
+                     0 /* No temporal locality. */);
+#elif HAVE_MM_PREFETCH
+  // Visual Studio doesn't implement __builtin_prefetch, but exposes the
+  // PREFETCHNTA instruction via the _mm_prefetch intrinsic.
+  _mm_prefetch(reinterpret_cast<const char*>(address), _MM_HINT_NTA);
+#else
+  // No prefetch support. Silence compiler warnings.
+  (void)address;
+#endif  // HAVE_BUILTIN_PREFETCH
+}
+
+}  // namespace crc32c
+
+#endif  // CRC32C_CRC32C_ROUND_UP_H_
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_prefetch_unittest.cc b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_prefetch_unittest.cc
new file mode 100644
index 0000000000..b34ed2d5fe
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_prefetch_unittest.cc
@@ -0,0 +1,9 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "./crc32c_prefetch.h"
+
+// There is no easy way to test cache prefetching. We can only test that the
+// crc32c_prefetch.h header compiles on its own, so it doesn't have any unstated
+// dependencies.
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_read_le.h b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_read_le.h
new file mode 100644
index 0000000000..fe455623c2
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_read_le.h
@@ -0,0 +1,51 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef CRC32C_CRC32C_READ_LE_H_
+#define CRC32C_CRC32C_READ_LE_H_
+
+#include <cstdint>
+#include <cstring>
+
+#include "crc32c/crc32c_config.h"
+
+namespace crc32c {
+
+// Reads a little-endian 32-bit integer from a 32-bit-aligned buffer.
+inline uint32_t ReadUint32LE(const uint8_t* buffer) {
+#if BYTE_ORDER_BIG_ENDIAN
+  return ((static_cast<uint32_t>(static_cast<uint8_t>(buffer[0]))) |
+          (static_cast<uint32_t>(static_cast<uint8_t>(buffer[1])) << 8) |
+          (static_cast<uint32_t>(static_cast<uint8_t>(buffer[2])) << 16) |
+          (static_cast<uint32_t>(static_cast<uint8_t>(buffer[3])) << 24));
+#else   // !BYTE_ORDER_BIG_ENDIAN
+  uint32_t result;
+  // This should be optimized to a single instruction.
+  std::memcpy(&result, buffer, sizeof(result));
+  return result;
+#endif  // BYTE_ORDER_BIG_ENDIAN
+}
+
+// Reads a little-endian 64-bit integer from a 64-bit-aligned buffer.
+inline uint64_t ReadUint64LE(const uint8_t* buffer) {
+#if BYTE_ORDER_BIG_ENDIAN
+  return ((static_cast<uint32_t>(static_cast<uint8_t>(buffer[0]))) |
+          (static_cast<uint32_t>(static_cast<uint8_t>(buffer[1])) << 8) |
+          (static_cast<uint32_t>(static_cast<uint8_t>(buffer[2])) << 16) |
+          (static_cast<uint32_t>(static_cast<uint8_t>(buffer[3])) << 24) |
+          (static_cast<uint32_t>(static_cast<uint8_t>(buffer[4])) << 32) |
+          (static_cast<uint32_t>(static_cast<uint8_t>(buffer[5])) << 40) |
+          (static_cast<uint32_t>(static_cast<uint8_t>(buffer[6])) << 48) |
+          (static_cast<uint32_t>(static_cast<uint8_t>(buffer[7])) << 56));
+#else   // !BYTE_ORDER_BIG_ENDIAN
+  uint64_t result;
+  // This should be optimized to a single instruction.
+  std::memcpy(&result, buffer, sizeof(result));
+  return result;
+#endif  // BYTE_ORDER_BIG_ENDIAN
+}
+
+}  // namespace crc32c
+
+#endif  // CRC32C_CRC32C_READ_LE_H_
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_read_le_unittest.cc b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_read_le_unittest.cc
new file mode 100644
index 0000000000..2a30302adf
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_read_le_unittest.cc
@@ -0,0 +1,32 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "./crc32c_read_le.h"
+
+#include <cstddef>
+#include <cstdint>
+
+#include "gtest/gtest.h"
+
+#include "./crc32c_round_up.h"
+
+namespace crc32c {
+
+TEST(Crc32CReadLETest, ReadUint32LE) {
+  // little-endian 0x12345678
+  alignas(4) uint8_t bytes[] = {0x78, 0x56, 0x34, 0x12};
+
+  ASSERT_EQ(RoundUp<4>(bytes), bytes) << "Stack array is not aligned";
+  EXPECT_EQ(static_cast<uint32_t>(0x12345678), ReadUint32LE(bytes));
+}
+
+TEST(Crc32CReadLETest, ReadUint64LE) {
+  // little-endian 0x123456789ABCDEF0
+  alignas(8) uint8_t bytes[] = {0xF0, 0xDE, 0xBC, 0x9A, 0x78, 0x56, 0x34, 0x12};
+
+  ASSERT_EQ(RoundUp<8>(bytes), bytes) << "Stack array is not aligned";
+  EXPECT_EQ(static_cast<uint64_t>(0x123456789ABCDEF0), ReadUint64LE(bytes));
+}
+
+}  // namespace crc32c
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_round_up.h b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_round_up.h
new file mode 100644
index 0000000000..d3b922beb9
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_round_up.h
@@ -0,0 +1,34 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef CRC32C_CRC32C_ROUND_UP_H_
+#define CRC32C_CRC32C_ROUND_UP_H_
+
+#include <cstddef>
+#include <cstdint>
+
+namespace crc32c {
+
+// Returns the smallest number >= the given number that is evenly divided by N.
+//
+// N must be a power of two.
+template <int N>
+constexpr inline uintptr_t RoundUp(uintptr_t pointer) {
+  static_assert((N & (N - 1)) == 0, "N must be a power of two");
+  return (pointer + (N - 1)) & ~(N - 1);
+}
+
+// Returns the smallest address >= the given address that is aligned to N bytes.
+//
+// N must be a power of two.
+template <int N>
+constexpr inline const uint8_t* RoundUp(const uint8_t* pointer) {
+  static_assert((N & (N - 1)) == 0, "N must be a power of two");
+  return reinterpret_cast<uint8_t*>(
+      RoundUp<N>(reinterpret_cast<uintptr_t>(pointer)));
+}
+
+}  // namespace crc32c
+
+#endif  // CRC32C_CRC32C_ROUND_UP_H_
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_round_up_unittest.cc b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_round_up_unittest.cc
new file mode 100644
index 0000000000..5ff657bb5c
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_round_up_unittest.cc
@@ -0,0 +1,84 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "./crc32c_round_up.h"
+
+#include <cstddef>
+#include <cstdint>
+
+#include "gtest/gtest.h"
+
+namespace crc32c {
+
+TEST(CRC32CRoundUpTest, RoundUpUintptr) {
+  uintptr_t zero = 0;
+
+  ASSERT_EQ(zero, RoundUp<1>(zero));
+  ASSERT_EQ(1U, RoundUp<1>(1U));
+  ASSERT_EQ(2U, RoundUp<1>(2U));
+  ASSERT_EQ(3U, RoundUp<1>(3U));
+  ASSERT_EQ(~static_cast<uintptr_t>(0), RoundUp<1>(~static_cast<uintptr_t>(0)));
+  ASSERT_EQ(~static_cast<uintptr_t>(1), RoundUp<1>(~static_cast<uintptr_t>(1)));
+  ASSERT_EQ(~static_cast<uintptr_t>(2), RoundUp<1>(~static_cast<uintptr_t>(2)));
+  ASSERT_EQ(~static_cast<uintptr_t>(3), RoundUp<1>(~static_cast<uintptr_t>(3)));
+
+  ASSERT_EQ(zero, RoundUp<2>(zero));
+  ASSERT_EQ(2U, RoundUp<2>(1U));
+  ASSERT_EQ(2U, RoundUp<2>(2U));
+  ASSERT_EQ(4U, RoundUp<2>(3U));
+  ASSERT_EQ(4U, RoundUp<2>(4U));
+  ASSERT_EQ(6U, RoundUp<2>(5U));
+  ASSERT_EQ(6U, RoundUp<2>(6U));
+  ASSERT_EQ(8U, RoundUp<2>(7U));
+  ASSERT_EQ(8U, RoundUp<2>(8U));
+  ASSERT_EQ(~static_cast<uintptr_t>(1), RoundUp<2>(~static_cast<uintptr_t>(1)));
+  ASSERT_EQ(~static_cast<uintptr_t>(1), RoundUp<2>(~static_cast<uintptr_t>(2)));
+  ASSERT_EQ(~static_cast<uintptr_t>(3), RoundUp<2>(~static_cast<uintptr_t>(3)));
+  ASSERT_EQ(~static_cast<uintptr_t>(3), RoundUp<2>(~static_cast<uintptr_t>(4)));
+
+  ASSERT_EQ(zero, RoundUp<4>(zero));
+  ASSERT_EQ(4U, RoundUp<4>(1U));
+  ASSERT_EQ(4U, RoundUp<4>(2U));
+  ASSERT_EQ(4U, RoundUp<4>(3U));
+  ASSERT_EQ(4U, RoundUp<4>(4U));
+  ASSERT_EQ(8U, RoundUp<4>(5U));
+  ASSERT_EQ(8U, RoundUp<4>(6U));
+  ASSERT_EQ(8U, RoundUp<4>(7U));
+  ASSERT_EQ(8U, RoundUp<4>(8U));
+  ASSERT_EQ(~static_cast<uintptr_t>(3), RoundUp<4>(~static_cast<uintptr_t>(3)));
+  ASSERT_EQ(~static_cast<uintptr_t>(3), RoundUp<4>(~static_cast<uintptr_t>(4)));
+  ASSERT_EQ(~static_cast<uintptr_t>(3), RoundUp<4>(~static_cast<uintptr_t>(5)));
+  ASSERT_EQ(~static_cast<uintptr_t>(3), RoundUp<4>(~static_cast<uintptr_t>(6)));
+  ASSERT_EQ(~static_cast<uintptr_t>(7), RoundUp<4>(~static_cast<uintptr_t>(7)));
+  ASSERT_EQ(~static_cast<uintptr_t>(7), RoundUp<4>(~static_cast<uintptr_t>(8)));
+  ASSERT_EQ(~static_cast<uintptr_t>(7), RoundUp<4>(~static_cast<uintptr_t>(9)));
+}
+
+TEST(CRC32CRoundUpTest, RoundUpPointer) {
+  uintptr_t zero = 0, three = 3, four = 4, seven = 7, eight = 8;
+
+  const uint8_t* zero_ptr = reinterpret_cast<const uint8_t*>(zero);
+  const uint8_t* three_ptr = reinterpret_cast<const uint8_t*>(three);
+  const uint8_t* four_ptr = reinterpret_cast<const uint8_t*>(four);
+  const uint8_t* seven_ptr = reinterpret_cast<const uint8_t*>(seven);
+  const uint8_t* eight_ptr = reinterpret_cast<uint8_t*>(eight);
+
+  ASSERT_EQ(zero_ptr, RoundUp<1>(zero_ptr));
+  ASSERT_EQ(zero_ptr, RoundUp<4>(zero_ptr));
+  ASSERT_EQ(zero_ptr, RoundUp<8>(zero_ptr));
+
+  ASSERT_EQ(three_ptr, RoundUp<1>(three_ptr));
+  ASSERT_EQ(four_ptr, RoundUp<4>(three_ptr));
+  ASSERT_EQ(eight_ptr, RoundUp<8>(three_ptr));
+
+  ASSERT_EQ(four_ptr, RoundUp<1>(four_ptr));
+  ASSERT_EQ(four_ptr, RoundUp<4>(four_ptr));
+  ASSERT_EQ(eight_ptr, RoundUp<8>(four_ptr));
+
+  ASSERT_EQ(seven_ptr, RoundUp<1>(seven_ptr));
+  ASSERT_EQ(eight_ptr, RoundUp<4>(seven_ptr));
+  ASSERT_EQ(eight_ptr, RoundUp<8>(four_ptr));
+}
+
+}  // namespace crc32c
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_sse42.cc b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_sse42.cc
new file mode 100644
index 0000000000..fc0cb0725f
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_sse42.cc
@@ -0,0 +1,256 @@
+// Copyright 2008 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "./crc32c_sse42.h"
+
+// In a separate source file to allow this accelerated CRC32C function to be
+// compiled with the appropriate compiler flags to enable SSE4.2 instructions.
+
+// This implementation is loosely based on Intel Pub 323405 from April 2011,
+// "Fast CRC Computation for iSCSI Polynomial Using CRC32 Instruction".
+
+#include <cstddef>
+#include <cstdint>
+
+#include "./crc32c_internal.h"
+#include "./crc32c_prefetch.h"
+#include "./crc32c_read_le.h"
+#include "./crc32c_round_up.h"
+#include "crc32c/crc32c_config.h"
+
+#if HAVE_SSE42 && (defined(_M_X64) || defined(__x86_64__))
+
+#if defined(_MSC_VER)
+#include <intrin.h>
+#else  // !defined(_MSC_VER)
+#include <nmmintrin.h>
+#endif  // defined(_MSC_VER)
+
+namespace crc32c {
+
+namespace {
+
+constexpr const ptrdiff_t kGroups = 3;
+constexpr const ptrdiff_t kBlock0Size = 16 * 1024 / kGroups / 64 * 64;
+constexpr const ptrdiff_t kBlock1Size = 4 * 1024 / kGroups / 8 * 8;
+constexpr const ptrdiff_t kBlock2Size = 1024 / kGroups / 8 * 8;
+
+const uint32_t kBlock0SkipTable[8][16] = {
+    {0x00000000, 0xff770459, 0xfb027e43, 0x04757a1a, 0xf3e88a77, 0x0c9f8e2e,
+     0x08eaf434, 0xf79df06d, 0xe23d621f, 0x1d4a6646, 0x193f1c5c, 0xe6481805,
+     0x11d5e868, 0xeea2ec31, 0xead7962b, 0x15a09272},
+    {0x00000000, 0xc196b2cf, 0x86c1136f, 0x4757a1a0, 0x086e502f, 0xc9f8e2e0,
+     0x8eaf4340, 0x4f39f18f, 0x10dca05e, 0xd14a1291, 0x961db331, 0x578b01fe,
+     0x18b2f071, 0xd92442be, 0x9e73e31e, 0x5fe551d1},
+    {0x00000000, 0x21b940bc, 0x43728178, 0x62cbc1c4, 0x86e502f0, 0xa75c424c,
+     0xc5978388, 0xe42ec334, 0x08267311, 0x299f33ad, 0x4b54f269, 0x6aedb2d5,
+     0x8ec371e1, 0xaf7a315d, 0xcdb1f099, 0xec08b025},
+    {0x00000000, 0x104ce622, 0x2099cc44, 0x30d52a66, 0x41339888, 0x517f7eaa,
+     0x61aa54cc, 0x71e6b2ee, 0x82673110, 0x922bd732, 0xa2fefd54, 0xb2b21b76,
+     0xc354a998, 0xd3184fba, 0xe3cd65dc, 0xf38183fe},
+    {0x00000000, 0x012214d1, 0x024429a2, 0x03663d73, 0x04885344, 0x05aa4795,
+     0x06cc7ae6, 0x07ee6e37, 0x0910a688, 0x0832b259, 0x0b548f2a, 0x0a769bfb,
+     0x0d98f5cc, 0x0cbae11d, 0x0fdcdc6e, 0x0efec8bf},
+    {0x00000000, 0x12214d10, 0x24429a20, 0x3663d730, 0x48853440, 0x5aa47950,
+     0x6cc7ae60, 0x7ee6e370, 0x910a6880, 0x832b2590, 0xb548f2a0, 0xa769bfb0,
+     0xd98f5cc0, 0xcbae11d0, 0xfdcdc6e0, 0xefec8bf0},
+    {0x00000000, 0x27f8a7f1, 0x4ff14fe2, 0x6809e813, 0x9fe29fc4, 0xb81a3835,
+     0xd013d026, 0xf7eb77d7, 0x3a294979, 0x1dd1ee88, 0x75d8069b, 0x5220a16a,
+     0xa5cbd6bd, 0x8233714c, 0xea3a995f, 0xcdc23eae},
+    {0x00000000, 0x745292f2, 0xe8a525e4, 0x9cf7b716, 0xd4a63d39, 0xa0f4afcb,
+     0x3c0318dd, 0x48518a2f, 0xaca00c83, 0xd8f29e71, 0x44052967, 0x3057bb95,
+     0x780631ba, 0x0c54a348, 0x90a3145e, 0xe4f186ac},
+};
+const uint32_t kBlock1SkipTable[8][16] = {
+    {0x00000000, 0x79113270, 0xf22264e0, 0x8b335690, 0xe1a8bf31, 0x98b98d41,
+     0x138adbd1, 0x6a9be9a1, 0xc6bd0893, 0xbfac3ae3, 0x349f6c73, 0x4d8e5e03,
+     0x2715b7a2, 0x5e0485d2, 0xd537d342, 0xac26e132},
+    {0x00000000, 0x889667d7, 0x14c0b95f, 0x9c56de88, 0x298172be, 0xa1171569,
+     0x3d41cbe1, 0xb5d7ac36, 0x5302e57c, 0xdb9482ab, 0x47c25c23, 0xcf543bf4,
+     0x7a8397c2, 0xf215f015, 0x6e432e9d, 0xe6d5494a},
+    {0x00000000, 0xa605caf8, 0x49e7e301, 0xefe229f9, 0x93cfc602, 0x35ca0cfa,
+     0xda282503, 0x7c2deffb, 0x2273faf5, 0x8476300d, 0x6b9419f4, 0xcd91d30c,
+     0xb1bc3cf7, 0x17b9f60f, 0xf85bdff6, 0x5e5e150e},
+    {0x00000000, 0x44e7f5ea, 0x89cfebd4, 0xcd281e3e, 0x1673a159, 0x529454b3,
+     0x9fbc4a8d, 0xdb5bbf67, 0x2ce742b2, 0x6800b758, 0xa528a966, 0xe1cf5c8c,
+     0x3a94e3eb, 0x7e731601, 0xb35b083f, 0xf7bcfdd5},
+    {0x00000000, 0x59ce8564, 0xb39d0ac8, 0xea538fac, 0x62d66361, 0x3b18e605,
+     0xd14b69a9, 0x8885eccd, 0xc5acc6c2, 0x9c6243a6, 0x7631cc0a, 0x2fff496e,
+     0xa77aa5a3, 0xfeb420c7, 0x14e7af6b, 0x4d292a0f},
+    {0x00000000, 0x8eb5fb75, 0x1887801b, 0x96327b6e, 0x310f0036, 0xbfbafb43,
+     0x2988802d, 0xa73d7b58, 0x621e006c, 0xecabfb19, 0x7a998077, 0xf42c7b02,
+     0x5311005a, 0xdda4fb2f, 0x4b968041, 0xc5237b34},
+    {0x00000000, 0xc43c00d8, 0x8d947741, 0x49a87799, 0x1ec49873, 0xdaf898ab,
+     0x9350ef32, 0x576cefea, 0x3d8930e6, 0xf9b5303e, 0xb01d47a7, 0x7421477f,
+     0x234da895, 0xe771a84d, 0xaed9dfd4, 0x6ae5df0c},
+    {0x00000000, 0x7b1261cc, 0xf624c398, 0x8d36a254, 0xe9a5f1c1, 0x92b7900d,
+     0x1f813259, 0x64935395, 0xd6a79573, 0xadb5f4bf, 0x208356eb, 0x5b913727,
+     0x3f0264b2, 0x4410057e, 0xc926a72a, 0xb234c6e6},
+};
+const uint32_t kBlock2SkipTable[8][16] = {
+    {0x00000000, 0x8f158014, 0x1bc776d9, 0x94d2f6cd, 0x378eedb2, 0xb89b6da6,
+     0x2c499b6b, 0xa35c1b7f, 0x6f1ddb64, 0xe0085b70, 0x74daadbd, 0xfbcf2da9,
+     0x589336d6, 0xd786b6c2, 0x4354400f, 0xcc41c01b},
+    {0x00000000, 0xde3bb6c8, 0xb99b1b61, 0x67a0ada9, 0x76da4033, 0xa8e1f6fb,
+     0xcf415b52, 0x117aed9a, 0xedb48066, 0x338f36ae, 0x542f9b07, 0x8a142dcf,
+     0x9b6ec055, 0x4555769d, 0x22f5db34, 0xfcce6dfc},
+    {0x00000000, 0xde85763d, 0xb8e69a8b, 0x6663ecb6, 0x742143e7, 0xaaa435da,
+     0xccc7d96c, 0x1242af51, 0xe84287ce, 0x36c7f1f3, 0x50a41d45, 0x8e216b78,
+     0x9c63c429, 0x42e6b214, 0x24855ea2, 0xfa00289f},
+    {0x00000000, 0xd569796d, 0xaf3e842b, 0x7a57fd46, 0x5b917ea7, 0x8ef807ca,
+     0xf4affa8c, 0x21c683e1, 0xb722fd4e, 0x624b8423, 0x181c7965, 0xcd750008,
+     0xecb383e9, 0x39dafa84, 0x438d07c2, 0x96e47eaf},
+    {0x00000000, 0x6ba98c6d, 0xd75318da, 0xbcfa94b7, 0xab4a4745, 0xc0e3cb28,
+     0x7c195f9f, 0x17b0d3f2, 0x5378f87b, 0x38d17416, 0x842be0a1, 0xef826ccc,
+     0xf832bf3e, 0x939b3353, 0x2f61a7e4, 0x44c82b89},
+    {0x00000000, 0xa6f1f0f6, 0x480f971d, 0xeefe67eb, 0x901f2e3a, 0x36eedecc,
+     0xd810b927, 0x7ee149d1, 0x25d22a85, 0x8323da73, 0x6dddbd98, 0xcb2c4d6e,
+     0xb5cd04bf, 0x133cf449, 0xfdc293a2, 0x5b336354},
+    {0x00000000, 0x4ba4550a, 0x9748aa14, 0xdcecff1e, 0x2b7d22d9, 0x60d977d3,
+     0xbc3588cd, 0xf791ddc7, 0x56fa45b2, 0x1d5e10b8, 0xc1b2efa6, 0x8a16baac,
+     0x7d87676b, 0x36233261, 0xeacfcd7f, 0xa16b9875},
+    {0x00000000, 0xadf48b64, 0x5e056039, 0xf3f1eb5d, 0xbc0ac072, 0x11fe4b16,
+     0xe20fa04b, 0x4ffb2b2f, 0x7df9f615, 0xd00d7d71, 0x23fc962c, 0x8e081d48,
+     0xc1f33667, 0x6c07bd03, 0x9ff6565e, 0x3202dd3a},
+};
+
+constexpr const ptrdiff_t kPrefetchHorizon = 256;
+
+}  // namespace
+
+uint32_t ExtendSse42(uint32_t crc, const uint8_t* data, size_t size) {
+  const uint8_t* p = data;
+  const uint8_t* e = data + size;
+  uint32_t l = crc ^ kCRC32Xor;
+
+#define STEP1                  \
+  do {                         \
+    l = _mm_crc32_u8(l, *p++); \
+  } while (0)
+
+#define STEP4(crc)                             \
+  do {                                         \
+    crc = _mm_crc32_u32(crc, ReadUint32LE(p)); \
+    p += 4;                                    \
+  } while (0)
+
+#define STEP8(crc, data)                          \
+  do {                                            \
+    crc = _mm_crc32_u64(crc, ReadUint64LE(data)); \
+    data += 8;                                    \
+  } while (0)
+
+#define STEP8BY3(crc0, crc1, crc2, p0, p1, p2) \
+  do {                                         \
+    STEP8(crc0, p0);                           \
+    STEP8(crc1, p1);                           \
+    STEP8(crc2, p2);                           \
+  } while (0)
+
+#define STEP8X3(crc0, crc1, crc2, bs)                     \
+  do {                                                    \
+    crc0 = _mm_crc32_u64(crc0, ReadUint64LE(p));          \
+    crc1 = _mm_crc32_u64(crc1, ReadUint64LE(p + bs));     \
+    crc2 = _mm_crc32_u64(crc2, ReadUint64LE(p + 2 * bs)); \
+    p += 8;                                               \
+  } while (0)
+
+#define SKIP_BLOCK(crc, tab)                                      \
+  do {                                                            \
+    crc = tab[0][crc & 0xf] ^ tab[1][(crc >> 4) & 0xf] ^          \
+          tab[2][(crc >> 8) & 0xf] ^ tab[3][(crc >> 12) & 0xf] ^  \
+          tab[4][(crc >> 16) & 0xf] ^ tab[5][(crc >> 20) & 0xf] ^ \
+          tab[6][(crc >> 24) & 0xf] ^ tab[7][(crc >> 28) & 0xf];  \
+  } while (0)
+
+  // Point x at first 8-byte aligned byte in the buffer. This might be past the
+  // end of the buffer.
+  const uint8_t* x = RoundUp<8>(p);
+  if (x <= e) {
+    // Process bytes p is 8-byte aligned.
+    while (p != x) {
+      STEP1;
+    }
+  }
+
+  // Proccess the data in predetermined block sizes with tables for quickly
+  // combining the checksum. Experimentally it's better to use larger block
+  // sizes where possible so use a hierarchy of decreasing block sizes.
+  uint64_t l64 = l;
+  while ((e - p) >= kGroups * kBlock0Size) {
+    uint64_t l641 = 0;
+    uint64_t l642 = 0;
+    for (int i = 0; i < kBlock0Size; i += 8 * 8) {
+      // Prefetch ahead to hide latency.
+      RequestPrefetch(p + kPrefetchHorizon);
+      RequestPrefetch(p + kBlock0Size + kPrefetchHorizon);
+      RequestPrefetch(p + 2 * kBlock0Size + kPrefetchHorizon);
+
+      // Process 64 bytes at a time.
+      STEP8X3(l64, l641, l642, kBlock0Size);
+      STEP8X3(l64, l641, l642, kBlock0Size);
+      STEP8X3(l64, l641, l642, kBlock0Size);
+      STEP8X3(l64, l641, l642, kBlock0Size);
+      STEP8X3(l64, l641, l642, kBlock0Size);
+      STEP8X3(l64, l641, l642, kBlock0Size);
+      STEP8X3(l64, l641, l642, kBlock0Size);
+      STEP8X3(l64, l641, l642, kBlock0Size);
+    }
+
+    // Combine results.
+    SKIP_BLOCK(l64, kBlock0SkipTable);
+    l64 ^= l641;
+    SKIP_BLOCK(l64, kBlock0SkipTable);
+    l64 ^= l642;
+    p += (kGroups - 1) * kBlock0Size;
+  }
+  while ((e - p) >= kGroups * kBlock1Size) {
+    uint64_t l641 = 0;
+    uint64_t l642 = 0;
+    for (int i = 0; i < kBlock1Size; i += 8) {
+      STEP8X3(l64, l641, l642, kBlock1Size);
+    }
+    SKIP_BLOCK(l64, kBlock1SkipTable);
+    l64 ^= l641;
+    SKIP_BLOCK(l64, kBlock1SkipTable);
+    l64 ^= l642;
+    p += (kGroups - 1) * kBlock1Size;
+  }
+  while ((e - p) >= kGroups * kBlock2Size) {
+    uint64_t l641 = 0;
+    uint64_t l642 = 0;
+    for (int i = 0; i < kBlock2Size; i += 8) {
+      STEP8X3(l64, l641, l642, kBlock2Size);
+    }
+    SKIP_BLOCK(l64, kBlock2SkipTable);
+    l64 ^= l641;
+    SKIP_BLOCK(l64, kBlock2SkipTable);
+    l64 ^= l642;
+    p += (kGroups - 1) * kBlock2Size;
+  }
+
+  // Process bytes 16 at a time
+  while ((e - p) >= 16) {
+    STEP8(l64, p);
+    STEP8(l64, p);
+  }
+
+  l = static_cast<uint32_t>(l64);
+  // Process the last few bytes.
+  while (p != e) {
+    STEP1;
+  }
+#undef SKIP_BLOCK
+#undef STEP8X3
+#undef STEP8BY3
+#undef STEP8
+#undef STEP4
+#undef STEP1
+
+  return l ^ kCRC32Xor;
+}
+
+}  // namespace crc32c
+
+#endif  // HAVE_SSE42 && (defined(_M_X64) || defined(__x86_64__))
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_sse42.h b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_sse42.h
new file mode 100644
index 0000000000..b9ed179e54
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_sse42.h
@@ -0,0 +1,31 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef CRC32C_CRC32C_SSE42_H_
+#define CRC32C_CRC32C_SSE42_H_
+
+// X86-specific code.
+
+#include <cstddef>
+#include <cstdint>
+
+#include "crc32c/crc32c_config.h"
+
+// The hardware-accelerated implementation is only enabled for 64-bit builds,
+// because a straightforward 32-bit implementation actually runs slower than the
+// portable version. Most X86 machines are 64-bit nowadays, so it doesn't make
+// much sense to spend time building an optimized hardware-accelerated
+// implementation.
+#if HAVE_SSE42 && (defined(_M_X64) || defined(__x86_64__))
+
+namespace crc32c {
+
+// SSE4.2-accelerated implementation in crc32c_sse42.cc
+uint32_t ExtendSse42(uint32_t crc, const uint8_t* data, size_t count);
+
+}  // namespace crc32c
+
+#endif  // HAVE_SSE42 && (defined(_M_X64) || defined(__x86_64__))
+
+#endif  // CRC32C_CRC32C_SSE42_H_
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_sse42_check.h b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_sse42_check.h
new file mode 100644
index 0000000000..ad380dd20e
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_sse42_check.h
@@ -0,0 +1,48 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef CRC32C_CRC32C_SSE42_CHECK_H_
+#define CRC32C_CRC32C_SSE42_CHECK_H_
+
+// X86-specific code checking the availability of SSE4.2 instructions.
+
+#include <cstddef>
+#include <cstdint>
+
+#include "crc32c/crc32c_config.h"
+
+#if HAVE_SSE42 && (defined(_M_X64) || defined(__x86_64__))
+
+// If the compiler supports SSE4.2, it definitely supports X86.
+
+#if defined(_MSC_VER)
+#include <intrin.h>
+
+namespace crc32c {
+
+inline bool CanUseSse42() {
+  int cpu_info[4];
+  __cpuid(cpu_info, 1);
+  return (cpu_info[2] & (1 << 20)) != 0;
+}
+
+}  // namespace crc32c
+
+#else  // !defined(_MSC_VER)
+#include <cpuid.h>
+
+namespace crc32c {
+
+inline bool CanUseSse42() {
+  unsigned int eax, ebx, ecx, edx;
+  return __get_cpuid(1, &eax, &ebx, &ecx, &edx) && ((ecx & (1 << 20)) != 0);
+}
+
+}  // namespace crc32c
+
+#endif  // defined(_MSC_VER)
+
+#endif  // HAVE_SSE42 && (defined(_M_X64) || defined(__x86_64__))
+
+#endif  // CRC32C_CRC32C_SSE42_CHECK_H_
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_sse42_unittest.cc b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_sse42_unittest.cc
new file mode 100644
index 0000000000..af2ecc4197
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_sse42_unittest.cc
@@ -0,0 +1,24 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "gtest/gtest.h"
+
+#include "./crc32c_extend_unittests.h"
+#include "./crc32c_sse42.h"
+
+namespace crc32c {
+
+#if HAVE_SSE42 && (defined(_M_X64) || defined(__x86_64__))
+
+struct Sse42TestTraits {
+  static uint32_t Extend(uint32_t crc, const uint8_t* data, size_t count) {
+    return ExtendSse42(crc, data, count);
+  }
+};
+
+INSTANTIATE_TYPED_TEST_CASE_P(Sse42, ExtendTest, Sse42TestTraits);
+
+#endif  // HAVE_SSE42 && (defined(_M_X64) || defined(__x86_64__))
+
+}  // namespace crc32c
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_test_main.cc b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_test_main.cc
new file mode 100644
index 0000000000..c07e1c8bc4
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_test_main.cc
@@ -0,0 +1,20 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "crc32c/crc32c_config.h"
+
+#include "gtest/gtest.h"
+
+#if CRC32C_TESTS_BUILT_WITH_GLOG
+#include "glog/logging.h"
+#endif  // CRC32C_TESTS_BUILT_WITH_GLOG
+
+int main(int argc, char** argv) {
+#if CRC32C_TESTS_BUILT_WITH_GLOG
+  google::InitGoogleLogging(argv[0]);
+  google::InstallFailureSignalHandler();
+#endif  // CRC32C_TESTS_BUILT_WITH_GLOG
+  testing::InitGoogleTest(&argc, argv);
+  return RUN_ALL_TESTS();
+}
diff --git a/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_unittest.cc b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_unittest.cc
new file mode 100644
index 0000000000..e9c97715ed
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/crc32c/src/crc32c_unittest.cc
@@ -0,0 +1,129 @@
+// Copyright 2017 The CRC32C Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "crc32c/crc32c.h"
+
+#include <cstddef>
+#include <cstdint>
+#include <cstring>
+
+#include "gtest/gtest.h"
+
+#include "./crc32c_extend_unittests.h"
+
+TEST(Crc32CTest, Crc32c) {
+  // From rfc3720 section B.4.
+  uint8_t buf[32];
+
+  std::memset(buf, 0, sizeof(buf));
+  EXPECT_EQ(static_cast<uint32_t>(0x8a9136aa),
+            crc32c::Crc32c(buf, sizeof(buf)));
+
+  std::memset(buf, 0xff, sizeof(buf));
+  EXPECT_EQ(static_cast<uint32_t>(0x62a8ab43),
+            crc32c::Crc32c(buf, sizeof(buf)));
+
+  for (size_t i = 0; i < 32; ++i)
+    buf[i] = static_cast<uint8_t>(i);
+  EXPECT_EQ(static_cast<uint32_t>(0x46dd794e),
+            crc32c::Crc32c(buf, sizeof(buf)));
+
+  for (size_t i = 0; i < 32; ++i)
+    buf[i] = static_cast<uint8_t>(31 - i);
+  EXPECT_EQ(static_cast<uint32_t>(0x113fdb5c),
+            crc32c::Crc32c(buf, sizeof(buf)));
+
+  uint8_t data[48] = {
+      0x01, 0xc0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+      0x00, 0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00,
+      0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x18, 0x28, 0x00, 0x00, 0x00,
+      0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+  };
+  EXPECT_EQ(static_cast<uint32_t>(0xd9963a56),
+            crc32c::Crc32c(data, sizeof(data)));
+}
+
+namespace crc32c {
+
+struct ApiTestTraits {
+  static uint32_t Extend(uint32_t crc, const uint8_t* data, size_t count) {
+    return ::crc32c::Extend(crc, data, count);
+  }
+};
+
+INSTANTIATE_TYPED_TEST_CASE_P(Api, ExtendTest, ApiTestTraits);
+
+}  // namespace crc32c
+
+TEST(CRC32CTest, Crc32cCharPointer) {
+  char buf[32];
+
+  std::memset(buf, 0, sizeof(buf));
+  EXPECT_EQ(static_cast<uint32_t>(0x8a9136aa),
+            crc32c::Crc32c(buf, sizeof(buf)));
+
+  std::memset(buf, 0xff, sizeof(buf));
+  EXPECT_EQ(static_cast<uint32_t>(0x62a8ab43),
+            crc32c::Crc32c(buf, sizeof(buf)));
+
+  for (size_t i = 0; i < 32; ++i)
+    buf[i] = static_cast<char>(i);
+  EXPECT_EQ(static_cast<uint32_t>(0x46dd794e),
+            crc32c::Crc32c(buf, sizeof(buf)));
+
+  for (size_t i = 0; i < 32; ++i)
+    buf[i] = static_cast<char>(31 - i);
+  EXPECT_EQ(static_cast<uint32_t>(0x113fdb5c),
+            crc32c::Crc32c(buf, sizeof(buf)));
+}
+
+TEST(CRC32CTest, Crc32cStdString) {
+  std::string buf;
+  buf.resize(32);
+
+  for (size_t i = 0; i < 32; ++i)
+    buf[i] = static_cast<char>(0x00);
+  EXPECT_EQ(static_cast<uint32_t>(0x8a9136aa), crc32c::Crc32c(buf));
+
+  for (size_t i = 0; i < 32; ++i)
+    buf[i] = '\xff';
+  EXPECT_EQ(static_cast<uint32_t>(0x62a8ab43), crc32c::Crc32c(buf));
+
+  for (size_t i = 0; i < 32; ++i)
+    buf[i] = static_cast<char>(i);
+  EXPECT_EQ(static_cast<uint32_t>(0x46dd794e), crc32c::Crc32c(buf));
+
+  for (size_t i = 0; i < 32; ++i)
+    buf[i] = static_cast<char>(31 - i);
+  EXPECT_EQ(static_cast<uint32_t>(0x113fdb5c), crc32c::Crc32c(buf));
+}
+
+#if __cplusplus > 201402L
+#if __has_include(<string_view>)
+
+TEST(CRC32CTest, Crc32cStdStringView) {
+  uint8_t buf[32];
+  std::string_view view(reinterpret_cast<const char*>(buf), sizeof(buf));
+
+  std::memset(buf, 0, sizeof(buf));
+  EXPECT_EQ(static_cast<uint32_t>(0x8a9136aa), crc32c::Crc32c(view));
+
+  std::memset(buf, 0xff, sizeof(buf));
+  EXPECT_EQ(static_cast<uint32_t>(0x62a8ab43), crc32c::Crc32c(view));
+
+  for (size_t i = 0; i < 32; ++i)
+    buf[i] = static_cast<uint8_t>(i);
+  EXPECT_EQ(static_cast<uint32_t>(0x46dd794e), crc32c::Crc32c(view));
+
+  for (size_t i = 0; i < 32; ++i)
+    buf[i] = static_cast<uint8_t>(31 - i);
+  EXPECT_EQ(static_cast<uint32_t>(0x113fdb5c), crc32c::Crc32c(view));
+}
+
+#endif  // __has_include(<string_view>)
+#endif  // __cplusplus > 201402L
+
+#define TESTED_EXTEND Extend
+#include "./crc32c_extend_unittests.h"
+#undef TESTED_EXTEND
diff --git a/submodules/ton/tonlib-src/third-party/wingetopt/.gitignore b/submodules/ton/tonlib-src/third-party/wingetopt/.gitignore
new file mode 100644
index 0000000000..5500d01460
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/wingetopt/.gitignore
@@ -0,0 +1,8 @@
+CMakeCache.txt
+CMakeFiles
+Makefile
+cmake_install.cmake
+install_manifest.txt
+build
+*.lib
+*.pdb
diff --git a/submodules/ton/tonlib-src/third-party/wingetopt/.gitrepo b/submodules/ton/tonlib-src/third-party/wingetopt/.gitrepo
new file mode 100644
index 0000000000..17d8026f34
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/wingetopt/.gitrepo
@@ -0,0 +1,11 @@
+; DO NOT EDIT (unless you know what you are doing)
+;
+; This subdirectory is a git "subrepo", and this file is maintained by the
+; git-subrepo command. See https://github.com/git-commands/git-subrepo#readme
+;
+[subrepo]
+	remote = https://github.com/alex85k/wingetopt
+	branch = master
+	commit = fed839a02eca9abaebb834d3e53c583ff4304e1c
+	parent = 0615991cbf4014fddd7be014dfb112b812c5a089
+	cmdver = 0.3.1
diff --git a/submodules/ton/tonlib-src/third-party/wingetopt/CMakeLists.txt b/submodules/ton/tonlib-src/third-party/wingetopt/CMakeLists.txt
new file mode 100644
index 0000000000..3700633b00
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/wingetopt/CMakeLists.txt
@@ -0,0 +1,7 @@
+PROJECT(wingetopt)
+cmake_minimum_required(VERSION 2.8)
+
+add_definitions(-D_CRT_SECURE_NO_WARNINGS)
+add_library(wingetopt src/getopt.c src/getopt.h)
+target_include_directories(wingetopt PUBLIC ${CMAKE_CURRENT_SOURCE_DIR}/src)
+
diff --git a/submodules/ton/tonlib-src/third-party/wingetopt/LICENSE b/submodules/ton/tonlib-src/third-party/wingetopt/LICENSE
new file mode 100644
index 0000000000..b1ded6d834
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/wingetopt/LICENSE
@@ -0,0 +1,54 @@
+#### AUTHORS:
+
+* Todd C. Miller <Todd.Miller@courtesan.com>
+* The NetBSD Foundation, Inc.
+* Alexei Kasatkin is the author of trivial CMakeLists.txt, build script itself is Public Domain
+
+#### LICENSE
+
+    Copyright (c) 2002 Todd C. Miller <Todd.Miller@courtesan.com>
+    
+    Permission to use, copy, modify, and distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+    
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+    
+    Sponsored in part by the Defense Advanced Research Projects
+    Agency (DARPA) and Air Force Research Laboratory, Air Force
+    Materiel Command, USAF, under agreement number F39502-99-1-0512.
+
+***
+
+    Copyright (c) 2000 The NetBSD Foundation, Inc.
+    All rights reserved.
+    
+    This code is derived from software contributed to The NetBSD Foundation
+    by Dieter Baron and Thomas Klausner.
+    
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+    1. Redistributions of source code must retain the above copyright
+       notice, this list of conditions and the following disclaimer.
+    2. Redistributions in binary form must reproduce the above copyright
+       notice, this list of conditions and the following disclaimer in the
+       documentation and/or other materials provided with the distribution.
+    
+    THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
+    ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
+    TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
+    BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+    CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+    SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+    INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+    CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+    ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+    POSSIBILITY OF SUCH DAMAGE.
diff --git a/submodules/ton/tonlib-src/third-party/wingetopt/README.md b/submodules/ton/tonlib-src/third-party/wingetopt/README.md
new file mode 100644
index 0000000000..16b855a614
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/wingetopt/README.md
@@ -0,0 +1,63 @@
+# wingetopt
+
+getopt library for Windows compilers
+
+
+This library was created to allow compilation linux-based software on Windows.
+http://en.wikipedia.org/wiki/Getopt
+
+The sources were taken from MinGW-runtime project.
+
+#### AUTHORS:
+
+* Todd C. Miller <Todd.Miller@courtesan.com>
+* The NetBSD Foundation, Inc.
+
+#### LICENSE
+
+    Copyright (c) 2002 Todd C. Miller <Todd.Miller@courtesan.com>
+    
+    Permission to use, copy, modify, and distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+    
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+    
+    Sponsored in part by the Defense Advanced Research Projects
+    Agency (DARPA) and Air Force Research Laboratory, Air Force
+    Materiel Command, USAF, under agreement number F39502-99-1-0512.
+
+***
+
+    Copyright (c) 2000 The NetBSD Foundation, Inc.
+    All rights reserved.
+    
+    This code is derived from software contributed to The NetBSD Foundation
+    by Dieter Baron and Thomas Klausner.
+    
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+    1. Redistributions of source code must retain the above copyright
+       notice, this list of conditions and the following disclaimer.
+    2. Redistributions in binary form must reproduce the above copyright
+       notice, this list of conditions and the following disclaimer in the
+       documentation and/or other materials provided with the distribution.
+    
+    THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
+    ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
+    TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
+    BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+    CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+    SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+    INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+    CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+    ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+    POSSIBILITY OF SUCH DAMAGE.
diff --git a/submodules/ton/tonlib-src/third-party/wingetopt/src/getopt.c b/submodules/ton/tonlib-src/third-party/wingetopt/src/getopt.c
new file mode 100644
index 0000000000..93a0c3d1dc
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/wingetopt/src/getopt.c
@@ -0,0 +1,563 @@
+/*	$OpenBSD: getopt_long.c,v 1.23 2007/10/31 12:34:57 chl Exp $	*/
+/*	$NetBSD: getopt_long.c,v 1.15 2002/01/31 22:43:40 tv Exp $	*/
+
+/*
+ * Copyright (c) 2002 Todd C. Miller <Todd.Miller@courtesan.com>
+ *
+ * Permission to use, copy, modify, and distribute this software for any
+ * purpose with or without fee is hereby granted, provided that the above
+ * copyright notice and this permission notice appear in all copies.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+ * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+ * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+ * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+ * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+ *
+ * Sponsored in part by the Defense Advanced Research Projects
+ * Agency (DARPA) and Air Force Research Laboratory, Air Force
+ * Materiel Command, USAF, under agreement number F39502-99-1-0512.
+ */
+/*-
+ * Copyright (c) 2000 The NetBSD Foundation, Inc.
+ * All rights reserved.
+ *
+ * This code is derived from software contributed to The NetBSD Foundation
+ * by Dieter Baron and Thomas Klausner.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
+ * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
+ * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
+ * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <errno.h>
+#include <stdlib.h>
+#include <string.h>
+#include <stdarg.h>
+#include <stdio.h>
+#include <windows.h>
+
+#include "getopt.h"
+
+#define	REPLACE_GETOPT		/* use this getopt as the system getopt(3) */
+
+#ifdef REPLACE_GETOPT
+int	opterr = 1;		/* if error message should be printed */
+int	optind = 1;		/* index into parent argv vector */
+int	optopt = '?';		/* character checked for validity */
+#undef	optreset		/* see getopt.h */
+#define	optreset		__mingw_optreset
+int	optreset;		/* reset getopt */
+char    *optarg;		/* argument associated with option */
+#endif
+
+#define PRINT_ERROR	((opterr) && (*options != ':'))
+
+#define FLAG_PERMUTE	0x01	/* permute non-options to the end of argv */
+#define FLAG_ALLARGS	0x02	/* treat non-options as args to option "-1" */
+#define FLAG_LONGONLY	0x04	/* operate as getopt_long_only */
+
+/* return values */
+#define	BADCH		(int)'?'
+#define	BADARG		((*options == ':') ? (int)':' : (int)'?')
+#define	INORDER 	(int)1
+
+#ifndef __CYGWIN__
+#define __progname __argv[0]
+#else
+extern char __declspec(dllimport) *__progname;
+#endif
+
+#ifdef __CYGWIN__
+static char EMSG[] = "";
+#else
+#define	EMSG		""
+#endif
+
+static int getopt_internal(int, char * const *, const char *,
+			   const struct option *, int *, int);
+static int parse_long_options(char * const *, const char *,
+			      const struct option *, int *, int);
+static int gcd(int, int);
+static void permute_args(int, int, int, char * const *);
+
+static char *place = EMSG; /* option letter processing */
+
+/* XXX: set optreset to 1 rather than these two */
+static int nonopt_start = -1; /* first non option argument (for permute) */
+static int nonopt_end = -1;   /* first option after non options (for permute) */
+
+/* Error messages */
+static const char recargchar[] = "option requires an argument -- %c";
+static const char recargstring[] = "option requires an argument -- %s";
+static const char ambig[] = "ambiguous option -- %.*s";
+static const char noarg[] = "option doesn't take an argument -- %.*s";
+static const char illoptchar[] = "unknown option -- %c";
+static const char illoptstring[] = "unknown option -- %s";
+
+static void
+_vwarnx(const char *fmt,va_list ap)
+{
+  (void)fprintf(stderr,"%s: ",__progname);
+  if (fmt != NULL)
+    (void)vfprintf(stderr,fmt,ap);
+  (void)fprintf(stderr,"\n");
+}
+
+static void
+warnx(const char *fmt,...)
+{
+  va_list ap;
+  va_start(ap,fmt);
+  _vwarnx(fmt,ap);
+  va_end(ap);
+}
+
+/*
+ * Compute the greatest common divisor of a and b.
+ */
+static int
+gcd(int a, int b)
+{
+	int c;
+
+	c = a % b;
+	while (c != 0) {
+		a = b;
+		b = c;
+		c = a % b;
+	}
+
+	return (b);
+}
+
+/*
+ * Exchange the block from nonopt_start to nonopt_end with the block
+ * from nonopt_end to opt_end (keeping the same order of arguments
+ * in each block).
+ */
+static void
+permute_args(int panonopt_start, int panonopt_end, int opt_end,
+	char * const *nargv)
+{
+	int cstart, cyclelen, i, j, ncycle, nnonopts, nopts, pos;
+	char *swap;
+
+	/*
+	 * compute lengths of blocks and number and size of cycles
+	 */
+	nnonopts = panonopt_end - panonopt_start;
+	nopts = opt_end - panonopt_end;
+	ncycle = gcd(nnonopts, nopts);
+	cyclelen = (opt_end - panonopt_start) / ncycle;
+
+	for (i = 0; i < ncycle; i++) {
+		cstart = panonopt_end+i;
+		pos = cstart;
+		for (j = 0; j < cyclelen; j++) {
+			if (pos >= panonopt_end)
+				pos -= nnonopts;
+			else
+				pos += nopts;
+			swap = nargv[pos];
+			/* LINTED const cast */
+			((char **) nargv)[pos] = nargv[cstart];
+			/* LINTED const cast */
+			((char **)nargv)[cstart] = swap;
+		}
+	}
+}
+
+/*
+ * parse_long_options --
+ *	Parse long options in argc/argv argument vector.
+ * Returns -1 if short_too is set and the option does not match long_options.
+ */
+static int
+parse_long_options(char * const *nargv, const char *options,
+	const struct option *long_options, int *idx, int short_too)
+{
+	char *current_argv, *has_equal;
+	size_t current_argv_len;
+	int i, ambiguous, match;
+
+#define IDENTICAL_INTERPRETATION(_x, _y)                                \
+	(long_options[(_x)].has_arg == long_options[(_y)].has_arg &&    \
+	 long_options[(_x)].flag == long_options[(_y)].flag &&          \
+	 long_options[(_x)].val == long_options[(_y)].val)
+
+	current_argv = place;
+	match = -1;
+	ambiguous = 0;
+
+	optind++;
+
+	if ((has_equal = strchr(current_argv, '=')) != NULL) {
+		/* argument found (--option=arg) */
+		current_argv_len = has_equal - current_argv;
+		has_equal++;
+	} else
+		current_argv_len = strlen(current_argv);
+
+	for (i = 0; long_options[i].name; i++) {
+		/* find matching long option */
+		if (strncmp(current_argv, long_options[i].name,
+		    current_argv_len))
+			continue;
+
+		if (strlen(long_options[i].name) == current_argv_len) {
+			/* exact match */
+			match = i;
+			ambiguous = 0;
+			break;
+		}
+		/*
+		 * If this is a known short option, don't allow
+		 * a partial match of a single character.
+		 */
+		if (short_too && current_argv_len == 1)
+			continue;
+
+		if (match == -1)	/* partial match */
+			match = i;
+		else if (!IDENTICAL_INTERPRETATION(i, match))
+			ambiguous = 1;
+	}
+	if (ambiguous) {
+		/* ambiguous abbreviation */
+		if (PRINT_ERROR)
+			warnx(ambig, (int)current_argv_len,
+			     current_argv);
+		optopt = 0;
+		return (BADCH);
+	}
+	if (match != -1) {		/* option found */
+		if (long_options[match].has_arg == no_argument
+		    && has_equal) {
+			if (PRINT_ERROR)
+				warnx(noarg, (int)current_argv_len,
+				     current_argv);
+			/*
+			 * XXX: GNU sets optopt to val regardless of flag
+			 */
+			if (long_options[match].flag == NULL)
+				optopt = long_options[match].val;
+			else
+				optopt = 0;
+			return (BADARG);
+		}
+		if (long_options[match].has_arg == required_argument ||
+		    long_options[match].has_arg == optional_argument) {
+			if (has_equal)
+				optarg = has_equal;
+			else if (long_options[match].has_arg ==
+			    required_argument) {
+				/*
+				 * optional argument doesn't use next nargv
+				 */
+				optarg = nargv[optind++];
+			}
+		}
+		if ((long_options[match].has_arg == required_argument)
+		    && (optarg == NULL)) {
+			/*
+			 * Missing argument; leading ':' indicates no error
+			 * should be generated.
+			 */
+			if (PRINT_ERROR)
+				warnx(recargstring,
+				    current_argv);
+			/*
+			 * XXX: GNU sets optopt to val regardless of flag
+			 */
+			if (long_options[match].flag == NULL)
+				optopt = long_options[match].val;
+			else
+				optopt = 0;
+			--optind;
+			return (BADARG);
+		}
+	} else {			/* unknown option */
+		if (short_too) {
+			--optind;
+			return (-1);
+		}
+		if (PRINT_ERROR)
+			warnx(illoptstring, current_argv);
+		optopt = 0;
+		return (BADCH);
+	}
+	if (idx)
+		*idx = match;
+	if (long_options[match].flag) {
+		*long_options[match].flag = long_options[match].val;
+		return (0);
+	} else
+		return (long_options[match].val);
+#undef IDENTICAL_INTERPRETATION
+}
+
+/*
+ * getopt_internal --
+ *	Parse argc/argv argument vector.  Called by user level routines.
+ */
+static int
+getopt_internal(int nargc, char * const *nargv, const char *options,
+	const struct option *long_options, int *idx, int flags)
+{
+	const char *oli;				/* option letter list index */
+	int optchar, short_too;
+	static int posixly_correct = -1;
+
+	if (options == NULL)
+		return (-1);
+
+	/*
+	 * XXX Some GNU programs (like cvs) set optind to 0 instead of
+	 * XXX using optreset.  Work around this braindamage.
+	 */
+	if (optind == 0)
+		optind = optreset = 1;
+
+	/*
+	 * Disable GNU extensions if POSIXLY_CORRECT is set or options
+	 * string begins with a '+'.
+	 *
+	 * CV, 2009-12-14: Check POSIXLY_CORRECT anew if optind == 0 or
+	 *                 optreset != 0 for GNU compatibility.
+	 */
+	if (posixly_correct == -1 || optreset != 0)
+		posixly_correct = (getenv("POSIXLY_CORRECT") != NULL);
+	if (*options == '-')
+		flags |= FLAG_ALLARGS;
+	else if (posixly_correct || *options == '+')
+		flags &= ~FLAG_PERMUTE;
+	if (*options == '+' || *options == '-')
+		options++;
+
+	optarg = NULL;
+	if (optreset)
+		nonopt_start = nonopt_end = -1;
+start:
+	if (optreset || !*place) {		/* update scanning pointer */
+		optreset = 0;
+		if (optind >= nargc) {          /* end of argument vector */
+			place = EMSG;
+			if (nonopt_end != -1) {
+				/* do permutation, if we have to */
+				permute_args(nonopt_start, nonopt_end,
+				    optind, nargv);
+				optind -= nonopt_end - nonopt_start;
+			}
+			else if (nonopt_start != -1) {
+				/*
+				 * If we skipped non-options, set optind
+				 * to the first of them.
+				 */
+				optind = nonopt_start;
+			}
+			nonopt_start = nonopt_end = -1;
+			return (-1);
+		}
+		if (*(place = nargv[optind]) != '-' ||
+		    (place[1] == '\0' && strchr(options, '-') == NULL)) {
+			place = EMSG;		/* found non-option */
+			if (flags & FLAG_ALLARGS) {
+				/*
+				 * GNU extension:
+				 * return non-option as argument to option 1
+				 */
+				optarg = nargv[optind++];
+				return (INORDER);
+			}
+			if (!(flags & FLAG_PERMUTE)) {
+				/*
+				 * If no permutation wanted, stop parsing
+				 * at first non-option.
+				 */
+				return (-1);
+			}
+			/* do permutation */
+			if (nonopt_start == -1)
+				nonopt_start = optind;
+			else if (nonopt_end != -1) {
+				permute_args(nonopt_start, nonopt_end,
+				    optind, nargv);
+				nonopt_start = optind -
+				    (nonopt_end - nonopt_start);
+				nonopt_end = -1;
+			}
+			optind++;
+			/* process next argument */
+			goto start;
+		}
+		if (nonopt_start != -1 && nonopt_end == -1)
+			nonopt_end = optind;
+
+		/*
+		 * If we have "-" do nothing, if "--" we are done.
+		 */
+		if (place[1] != '\0' && *++place == '-' && place[1] == '\0') {
+			optind++;
+			place = EMSG;
+			/*
+			 * We found an option (--), so if we skipped
+			 * non-options, we have to permute.
+			 */
+			if (nonopt_end != -1) {
+				permute_args(nonopt_start, nonopt_end,
+				    optind, nargv);
+				optind -= nonopt_end - nonopt_start;
+			}
+			nonopt_start = nonopt_end = -1;
+			return (-1);
+		}
+	}
+
+	/*
+	 * Check long options if:
+	 *  1) we were passed some
+	 *  2) the arg is not just "-"
+	 *  3) either the arg starts with -- we are getopt_long_only()
+	 */
+	if (long_options != NULL && place != nargv[optind] &&
+	    (*place == '-' || (flags & FLAG_LONGONLY))) {
+		short_too = 0;
+		if (*place == '-')
+			place++;		/* --foo long option */
+		else if (*place != ':' && strchr(options, *place) != NULL)
+			short_too = 1;		/* could be short option too */
+
+		optchar = parse_long_options(nargv, options, long_options,
+		    idx, short_too);
+		if (optchar != -1) {
+			place = EMSG;
+			return (optchar);
+		}
+	}
+
+	if ((optchar = (int)*place++) == (int)':' ||
+	    (optchar == (int)'-' && *place != '\0') ||
+	    (oli = strchr(options, optchar)) == NULL) {
+		/*
+		 * If the user specified "-" and  '-' isn't listed in
+		 * options, return -1 (non-option) as per POSIX.
+		 * Otherwise, it is an unknown option character (or ':').
+		 */
+		if (optchar == (int)'-' && *place == '\0')
+			return (-1);
+		if (!*place)
+			++optind;
+		if (PRINT_ERROR)
+			warnx(illoptchar, optchar);
+		optopt = optchar;
+		return (BADCH);
+	}
+	if (long_options != NULL && optchar == 'W' && oli[1] == ';') {
+		/* -W long-option */
+		if (*place)			/* no space */
+			/* NOTHING */;
+		else if (++optind >= nargc) {	/* no arg */
+			place = EMSG;
+			if (PRINT_ERROR)
+				warnx(recargchar, optchar);
+			optopt = optchar;
+			return (BADARG);
+		} else				/* white space */
+			place = nargv[optind];
+		optchar = parse_long_options(nargv, options, long_options,
+		    idx, 0);
+		place = EMSG;
+		return (optchar);
+	}
+	if (*++oli != ':') {			/* doesn't take argument */
+		if (!*place)
+			++optind;
+	} else {				/* takes (optional) argument */
+		optarg = NULL;
+		if (*place)			/* no white space */
+			optarg = place;
+		else if (oli[1] != ':') {	/* arg not optional */
+			if (++optind >= nargc) {	/* no arg */
+				place = EMSG;
+				if (PRINT_ERROR)
+					warnx(recargchar, optchar);
+				optopt = optchar;
+				return (BADARG);
+			} else
+				optarg = nargv[optind];
+		}
+		place = EMSG;
+		++optind;
+	}
+	/* dump back option letter */
+	return (optchar);
+}
+
+#ifdef REPLACE_GETOPT
+/*
+ * getopt --
+ *	Parse argc/argv argument vector.
+ *
+ * [eventually this will replace the BSD getopt]
+ */
+int
+getopt(int nargc, char * const *nargv, const char *options)
+{
+
+	/*
+	 * We don't pass FLAG_PERMUTE to getopt_internal() since
+	 * the BSD getopt(3) (unlike GNU) has never done this.
+	 *
+	 * Furthermore, since many privileged programs call getopt()
+	 * before dropping privileges it makes sense to keep things
+	 * as simple (and bug-free) as possible.
+	 */
+	return (getopt_internal(nargc, nargv, options, NULL, NULL, 0));
+}
+#endif /* REPLACE_GETOPT */
+
+/*
+ * getopt_long --
+ *	Parse argc/argv argument vector.
+ */
+int
+getopt_long(int nargc, char * const *nargv, const char *options,
+    const struct option *long_options, int *idx)
+{
+
+	return (getopt_internal(nargc, nargv, options, long_options, idx,
+	    FLAG_PERMUTE));
+}
+
+/*
+ * getopt_long_only --
+ *	Parse argc/argv argument vector.
+ */
+int
+getopt_long_only(int nargc, char * const *nargv, const char *options,
+    const struct option *long_options, int *idx)
+{
+
+	return (getopt_internal(nargc, nargv, options, long_options, idx,
+	    FLAG_PERMUTE|FLAG_LONGONLY));
+}
diff --git a/submodules/ton/tonlib-src/third-party/wingetopt/src/getopt.h b/submodules/ton/tonlib-src/third-party/wingetopt/src/getopt.h
new file mode 100644
index 0000000000..f3f864bda6
--- /dev/null
+++ b/submodules/ton/tonlib-src/third-party/wingetopt/src/getopt.h
@@ -0,0 +1,105 @@
+#ifndef __GETOPT_H__
+/**
+ * DISCLAIMER
+ * This file has no copyright assigned and is placed in the Public Domain.
+ * This file is a part of the w64 mingw-runtime package.
+ *
+ * The w64 mingw-runtime package and its code is distributed in the hope that it 
+ * will be useful but WITHOUT ANY WARRANTY.  ALL WARRANTIES, EXPRESSED OR 
+ * IMPLIED ARE HEREBY DISCLAIMED.  This includes but is not limited to 
+ * warranties of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ */
+
+#define __GETOPT_H__
+
+/* All the headers include this file. */
+#include <crtdefs.h>
+
+#if defined( WINGETOPT_SHARED_LIB )
+# if defined( BUILDING_WINGETOPT_DLL )
+#  define WINGETOPT_API __declspec(dllexport)
+# else
+#  define WINGETOPT_API __declspec(dllimport)
+# endif
+#else
+# define WINGETOPT_API
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+WINGETOPT_API extern int optind;		/* index of first non-option in argv      */
+WINGETOPT_API extern int optopt;		/* single option character, as parsed     */
+WINGETOPT_API extern int opterr;		/* flag to enable built-in diagnostics... */
+				/* (user may set to zero, to suppress)    */
+
+WINGETOPT_API extern char *optarg;		/* pointer to argument of current option  */
+
+extern int getopt(int nargc, char * const *nargv, const char *options);
+
+#ifdef _BSD_SOURCE
+/*
+ * BSD adds the non-standard `optreset' feature, for reinitialisation
+ * of `getopt' parsing.  We support this feature, for applications which
+ * proclaim their BSD heritage, before including this header; however,
+ * to maintain portability, developers are advised to avoid it.
+ */
+# define optreset  __mingw_optreset
+extern int optreset;
+#endif
+#ifdef __cplusplus
+}
+#endif
+/*
+ * POSIX requires the `getopt' API to be specified in `unistd.h';
+ * thus, `unistd.h' includes this header.  However, we do not want
+ * to expose the `getopt_long' or `getopt_long_only' APIs, when
+ * included in this manner.  Thus, close the standard __GETOPT_H__
+ * declarations block, and open an additional __GETOPT_LONG_H__
+ * specific block, only when *not* __UNISTD_H_SOURCED__, in which
+ * to declare the extended API.
+ */
+#endif /* !defined(__GETOPT_H__) */
+
+#if !defined(__UNISTD_H_SOURCED__) && !defined(__GETOPT_LONG_H__)
+#define __GETOPT_LONG_H__
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+struct option		/* specification for a long form option...	*/
+{
+  const char *name;		/* option name, without leading hyphens */
+  int         has_arg;		/* does it take an argument?		*/
+  int        *flag;		/* where to save its status, or NULL	*/
+  int         val;		/* its associated status value		*/
+};
+
+enum    		/* permitted values for its `has_arg' field...	*/
+{
+  no_argument = 0,      	/* option never takes an argument	*/
+  required_argument,		/* option always requires an argument	*/
+  optional_argument		/* option may take an argument		*/
+};
+
+extern int getopt_long(int nargc, char * const *nargv, const char *options,
+    const struct option *long_options, int *idx);
+extern int getopt_long_only(int nargc, char * const *nargv, const char *options,
+    const struct option *long_options, int *idx);
+/*
+ * Previous MinGW implementation had...
+ */
+#ifndef HAVE_DECL_GETOPT
+/*
+ * ...for the long form API only; keep this for compatibility.
+ */
+# define HAVE_DECL_GETOPT	1
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* !defined(__UNISTD_H_SOURCED__) && !defined(__GETOPT_LONG_H__) */
diff --git a/submodules/ton/tonlib-src/tl-utils/CMakeLists.txt b/submodules/ton/tonlib-src/tl-utils/CMakeLists.txt
new file mode 100644
index 0000000000..b17b7dc987
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl-utils/CMakeLists.txt
@@ -0,0 +1,23 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+set(TL_UTILS_SOURCE
+  common-utils.hpp
+  tl-utils.hpp
+  tl-utils.cpp
+)
+
+add_library(tl-utils STATIC ${TL_UTILS_SOURCE})
+
+target_include_directories(tl-utils PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/..>)
+target_link_libraries(tl-utils PUBLIC tl_api ton_crypto )
+
+set(TL_LITE_UTILS_SOURCE
+  common-utils.hpp
+  lite-utils.hpp
+  lite-utils.cpp
+)
+
+add_library(tl-lite-utils STATIC ${TL_LITE_UTILS_SOURCE})
+
+target_include_directories(tl-lite-utils PUBLIC $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/..>)
+target_link_libraries(tl-lite-utils PUBLIC tl_lite_api ton_crypto )
diff --git a/submodules/ton/tonlib-src/tl-utils/common-utils.hpp b/submodules/ton/tonlib-src/tl-utils/common-utils.hpp
new file mode 100644
index 0000000000..388202b678
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl-utils/common-utils.hpp
@@ -0,0 +1,208 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "tl/tl_object_parse.h"
+#include "td/utils/tl_parsers.h"
+
+#include "crypto/common/bitstring.h"
+
+namespace ton {
+
+template <class Tp>
+td::BufferSlice serialize_tl_object(const tl_object_ptr<Tp> &T, bool boxed) {
+  return serialize_tl_object(T.get(), boxed);
+}
+
+template <class Tp>
+td::BufferSlice serialize_tl_object(const tl_object_ptr<Tp> &T, bool boxed, td::BufferSlice &&suffix) {
+  return serialize_tl_object(T.get(), boxed, std::move(suffix));
+}
+
+template <class Tp>
+td::BufferSlice serialize_tl_object(const tl_object_ptr<Tp> &T, bool boxed, td::Slice suffix) {
+  return serialize_tl_object(T.get(), boxed, std::move(suffix));
+}
+
+template <class Tp>
+td::UInt256 get_tl_object_sha256(const tl_object_ptr<Tp> &T) {
+  return get_tl_object_sha256(T.get());
+}
+
+template <class Tp>
+td::Bits256 get_tl_object_sha_bits256(const tl_object_ptr<Tp> &T) {
+  return get_tl_object_sha_bits256(T.get());
+}
+
+template <typename T>
+td::Result<tl_object_ptr<std::enable_if_t<std::is_constructible<T>::value, T>>> fetch_tl_object(
+    const td::BufferSlice &data, bool boxed) {
+  td::TlBufferParser p(&data);
+  tl_object_ptr<T> R;
+  if (boxed) {
+    R = TlFetchBoxed<TlFetchObject<T>, T::ID>::parse(p);
+  } else {
+    R = move_tl_object_as<T>(T::fetch(p));
+  }
+  p.fetch_end();
+  if (p.get_status().is_ok()) {
+    return std::move(R);
+  } else {
+    return p.get_status();
+  }
+}
+
+template <typename T>
+td::Result<tl_object_ptr<std::enable_if_t<!std::is_constructible<T>::value, T>>> fetch_tl_object(
+    const td::BufferSlice &data, bool boxed) {
+  CHECK(boxed);
+  td::TlBufferParser p(&data);
+  tl_object_ptr<T> R;
+  R = move_tl_object_as<T>(T::fetch(p));
+  p.fetch_end();
+  if (p.get_status().is_ok()) {
+    return std::move(R);
+  } else {
+    return p.get_status();
+  }
+}
+
+template <typename T>
+td::Result<tl_object_ptr<std::enable_if_t<std::is_constructible<T>::value, T>>> fetch_tl_object(td::Slice data,
+                                                                                                bool boxed) {
+  td::TlParser p(data);
+  tl_object_ptr<T> R;
+  if (boxed) {
+    R = TlFetchBoxed<TlFetchObject<T>, T::ID>::parse(p);
+  } else {
+    R = move_tl_object_as<T>(T::fetch(p));
+  }
+  p.fetch_end();
+  if (p.get_status().is_ok()) {
+    return std::move(R);
+  } else {
+    return p.get_status();
+  }
+}
+
+template <typename T>
+td::Result<tl_object_ptr<std::enable_if_t<!std::is_constructible<T>::value, T>>> fetch_tl_object(td::Slice data,
+                                                                                                 bool boxed) {
+  CHECK(boxed);
+  td::TlParser p(data);
+  tl_object_ptr<T> R;
+  R = move_tl_object_as<T>(T::fetch(p));
+  p.fetch_end();
+  if (p.get_status().is_ok()) {
+    return std::move(R);
+  } else {
+    return p.get_status();
+  }
+}
+
+template <typename T>
+td::Result<tl_object_ptr<std::enable_if_t<std::is_constructible<T>::value, T>>> fetch_tl_prefix(td::BufferSlice &data,
+                                                                                                bool boxed) {
+  td::TlBufferParser p(&data);
+  tl_object_ptr<T> R;
+  if (boxed) {
+    R = TlFetchBoxed<TlFetchObject<T>, T::ID>::parse(p);
+  } else {
+    R = move_tl_object_as<T>(T::fetch(p));
+  }
+  if (p.get_status().is_ok()) {
+    data.confirm_read(data.size() - p.get_left_len());
+    return std::move(R);
+  } else {
+    return p.get_status();
+  }
+}
+
+template <typename T>
+td::Result<tl_object_ptr<std::enable_if_t<!std::is_constructible<T>::value, T>>> fetch_tl_prefix(td::BufferSlice &data,
+                                                                                                 bool boxed) {
+  CHECK(boxed);
+  td::TlBufferParser p(&data);
+  tl_object_ptr<T> R;
+  R = move_tl_object_as<T>(T::fetch(p));
+  if (p.get_status().is_ok()) {
+    data.confirm_read(data.size() - p.get_left_len());
+    return std::move(R);
+  } else {
+    return p.get_status();
+  }
+}
+
+template <class T>
+[[deprecated]] tl_object_ptr<T> clone_tl_object(const tl_object_ptr<T> &obj) {
+  auto B = serialize_tl_object(obj, true);
+  auto R = fetch_tl_object<T>(std::move(B), true);
+  R.ensure();
+  return R.move_as_ok();
+}
+
+template <class T>
+td::Result<typename T::ReturnType> fetch_result(td::Slice message, bool check_end = true) {
+  td::TlParser parser(message);
+  auto result = T::fetch_result(parser);
+
+  if (check_end) {
+    parser.fetch_end();
+  }
+  const char *error = parser.get_error();
+  if (error != nullptr) {
+    LOG(ERROR) << "Can't parse: " << td::format::as_hex_dump<4>(message);
+    return td::Status::Error(500, td::Slice(error));
+  }
+
+  return std::move(result);
+}
+
+template <class T>
+td::Result<typename T::ReturnType> fetch_result(const td::BufferSlice &message, bool check_end = true) {
+  td::TlBufferParser parser(&message);
+  auto result = T::fetch_result(parser);
+
+  if (check_end) {
+    parser.fetch_end();
+  }
+  const char *error = parser.get_error();
+  if (error != nullptr) {
+    LOG(ERROR) << "Can't parse: " << td::format::as_hex_dump<4>(message.as_slice());
+    return td::Status::Error(500, td::Slice(error));
+  }
+
+  return std::move(result);
+}
+
+template <class Type, class... Args>
+td::BufferSlice create_serialize_tl_object(Args &&... args) {
+  return serialize_tl_object(create_tl_object<Type>(std::forward<Args>(args)...), true);
+}
+
+template <class Type, class... Args>
+td::BufferSlice create_serialize_tl_object_suffix(td::Slice suffix, Args &&... args) {
+  return serialize_tl_object(create_tl_object<Type>(std::forward<Args>(args)...), true, suffix);
+}
+
+template <class Type, class... Args>
+auto create_hash_tl_object(Args &&... args) {
+  return get_tl_object_sha_bits256(create_tl_object<Type>(std::forward<Args>(args)...));
+}
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl-utils/lite-utils.cpp b/submodules/ton/tonlib-src/tl-utils/lite-utils.cpp
new file mode 100644
index 0000000000..fd8f1620b4
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl-utils/lite-utils.cpp
@@ -0,0 +1,132 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl-utils.hpp"
+#include "tl/tl_object_store.h"
+#include "auto/tl/lite_api.hpp"
+#include "td/utils/tl_storers.h"
+#include "td/utils/crypto.h"
+#include "crypto/common/bitstring.h"
+
+namespace ton {
+
+td::BufferSlice serialize_tl_object(const lite_api::Object *T, bool boxed, td::BufferSlice &&suffix) {
+  td::TlStorerCalcLength X;
+  T->store(X);
+  auto l = X.get_length() + (boxed ? 4 : 0);
+  auto len = l + suffix.size();
+
+  td::BufferSlice B(len);
+  td::TlStorerUnsafe Y(B.as_slice().ubegin());
+  if (boxed) {
+    Y.store_binary(T->get_id());
+  }
+  T->store(Y);
+
+  auto S = B.as_slice();
+  S.remove_prefix(l);
+  S.copy_from(suffix.as_slice());
+  suffix.clear();
+
+  return B;
+}
+
+td::BufferSlice serialize_tl_object(const lite_api::Object *T, bool boxed) {
+  td::TlStorerCalcLength X;
+  T->store(X);
+  auto l = X.get_length() + (boxed ? 4 : 0);
+  auto len = l;
+
+  td::BufferSlice B(len);
+  td::TlStorerUnsafe Y(B.as_slice().ubegin());
+  if (boxed) {
+    Y.store_binary(T->get_id());
+  }
+  T->store(Y);
+
+  return B;
+}
+
+td::BufferSlice serialize_tl_object(const lite_api::Function *T, bool boxed) {
+  CHECK(boxed);
+  td::TlStorerCalcLength X;
+  T->store(X);
+  auto l = X.get_length();
+  auto len = l;
+
+  td::BufferSlice B(len);
+  td::TlStorerUnsafe Y(B.as_slice().ubegin());
+
+  T->store(Y);
+
+  return B;
+}
+
+td::BufferSlice serialize_tl_object(const lite_api::Function *T, bool boxed, td::BufferSlice &&suffix) {
+  CHECK(boxed);
+  td::TlStorerCalcLength X;
+  T->store(X);
+  auto l = X.get_length();
+  auto len = l + suffix.size();
+
+  td::BufferSlice B(len);
+  td::TlStorerUnsafe Y(B.as_slice().ubegin());
+
+  T->store(Y);
+
+  auto S = B.as_slice();
+  S.remove_prefix(l);
+  S.copy_from(suffix.as_slice());
+  suffix.clear();
+
+  return B;
+}
+
+td::UInt256 get_tl_object_sha256(const lite_api::Object *T) {
+  td::TlStorerCalcLength X;
+  T->store(X);
+  auto len = X.get_length() + 4;
+
+  td::BufferSlice B(len);
+  td::TlStorerUnsafe Y(B.as_slice().ubegin());
+  Y.store_binary(T->get_id());
+  T->store(Y);
+
+  td::UInt256 id256;
+  td::sha256(B.as_slice(), id256.as_slice());
+
+  return id256;
+}
+
+td::Bits256 get_tl_object_sha_bits256(const lite_api::Object *T) {
+  td::TlStorerCalcLength X;
+  T->store(X);
+  auto len = X.get_length() + 4;
+
+  td::BufferSlice B(len);
+  td::TlStorerUnsafe Y(B.as_slice().ubegin());
+  Y.store_binary(T->get_id());
+  T->store(Y);
+
+  td::Bits256 id256;
+  td::sha256(B.as_slice(), id256.as_slice());
+
+  return id256;
+}
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl-utils/lite-utils.hpp b/submodules/ton/tonlib-src/tl-utils/lite-utils.hpp
new file mode 100644
index 0000000000..e09099ac7f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl-utils/lite-utils.hpp
@@ -0,0 +1,49 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "auto/tl/lite_api.h"
+
+#include "tl/tl_object_parse.h"
+#include "td/utils/tl_parsers.h"
+
+#include "crypto/common/bitstring.h"
+
+#include "common-utils.hpp"
+
+namespace ton {
+td::BufferSlice serialize_tl_object(const lite_api::Object *T, bool boxed);
+td::BufferSlice serialize_tl_object(const lite_api::Function *T, bool boxed);
+td::BufferSlice serialize_tl_object(const lite_api::Object *T, bool boxed, td::BufferSlice &&suffix);
+td::BufferSlice serialize_tl_object(const lite_api::Function *T, bool boxed, td::BufferSlice &&suffix);
+
+td::UInt256 get_tl_object_sha256(const lite_api::Object *T);
+
+template <class Tp, std::enable_if_t<std::is_base_of<lite_api::Object, Tp>::value>>
+td::UInt256 get_tl_object_sha256(const Tp &T) {
+  return get_tl_object_sha256(static_cast<const lite_api::Object *>(&T));
+}
+
+td::Bits256 get_tl_object_sha_bits256(const lite_api::Object *T);
+
+template <class Tp, std::enable_if_t<std::is_base_of<lite_api::Object, Tp>::value>>
+td::Bits256 get_tl_object_sha_bits256(const Tp &T) {
+  return get_tl_object_sha_bits256(static_cast<const lite_api::Object *>(&T));
+}
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl-utils/tl-utils.cpp b/submodules/ton/tonlib-src/tl-utils/tl-utils.cpp
new file mode 100644
index 0000000000..df165be191
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl-utils/tl-utils.cpp
@@ -0,0 +1,138 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl-utils.hpp"
+#include "tl/tl_object_store.h"
+#include "auto/tl/ton_api.hpp"
+#include "td/utils/tl_storers.h"
+#include "td/utils/crypto.h"
+#include "crypto/common/bitstring.h"
+
+namespace ton {
+
+td::BufferSlice serialize_tl_object(const ton_api::Object *T, bool boxed, td::BufferSlice &&suffix) {
+  return serialize_tl_object(T, boxed, suffix.as_slice());
+}
+
+td::BufferSlice serialize_tl_object(const ton_api::Object *T, bool boxed, td::Slice suffix) {
+  td::TlStorerCalcLength X;
+  T->store(X);
+  auto l = X.get_length() + (boxed ? 4 : 0);
+  auto len = l + suffix.size();
+
+  td::BufferSlice B(len);
+  td::TlStorerUnsafe Y(B.as_slice().ubegin());
+  if (boxed) {
+    Y.store_binary(T->get_id());
+  }
+  T->store(Y);
+
+  auto S = B.as_slice();
+  S.remove_prefix(l);
+  S.copy_from(suffix);
+
+  return B;
+}
+
+td::BufferSlice serialize_tl_object(const ton_api::Object *T, bool boxed) {
+  td::TlStorerCalcLength X;
+  T->store(X);
+  auto l = X.get_length() + (boxed ? 4 : 0);
+  auto len = l;
+
+  td::BufferSlice B(len);
+  td::TlStorerUnsafe Y(B.as_slice().ubegin());
+  if (boxed) {
+    Y.store_binary(T->get_id());
+  }
+  T->store(Y);
+
+  return B;
+}
+
+td::BufferSlice serialize_tl_object(const ton_api::Function *T, bool boxed) {
+  CHECK(boxed);
+  td::TlStorerCalcLength X;
+  T->store(X);
+  auto l = X.get_length();
+  auto len = l;
+
+  td::BufferSlice B(len);
+  td::TlStorerUnsafe Y(B.as_slice().ubegin());
+
+  T->store(Y);
+
+  return B;
+}
+
+td::BufferSlice serialize_tl_object(const ton_api::Function *T, bool boxed, td::BufferSlice &&suffix) {
+  return serialize_tl_object(T, boxed, suffix.as_slice());
+}
+
+td::BufferSlice serialize_tl_object(const ton_api::Function *T, bool boxed, td::Slice suffix) {
+  CHECK(boxed);
+  td::TlStorerCalcLength X;
+  T->store(X);
+  auto l = X.get_length();
+  auto len = l + suffix.size();
+
+  td::BufferSlice B(len);
+  td::TlStorerUnsafe Y(B.as_slice().ubegin());
+
+  T->store(Y);
+
+  auto S = B.as_slice();
+  S.remove_prefix(l);
+  S.copy_from(suffix);
+
+  return B;
+}
+
+td::UInt256 get_tl_object_sha256(const ton_api::Object *T) {
+  td::TlStorerCalcLength X;
+  T->store(X);
+  auto len = X.get_length() + 4;
+
+  td::BufferSlice B(len);
+  td::TlStorerUnsafe Y(B.as_slice().ubegin());
+  Y.store_binary(T->get_id());
+  T->store(Y);
+
+  td::UInt256 id256;
+  td::sha256(B.as_slice(), id256.as_slice());
+
+  return id256;
+}
+
+td::Bits256 get_tl_object_sha_bits256(const ton_api::Object *T) {
+  td::TlStorerCalcLength X;
+  T->store(X);
+  auto len = X.get_length() + 4;
+
+  td::BufferSlice B(len);
+  td::TlStorerUnsafe Y(B.as_slice().ubegin());
+  Y.store_binary(T->get_id());
+  T->store(Y);
+
+  td::Bits256 id256;
+  td::sha256(B.as_slice(), id256.as_slice());
+
+  return id256;
+}
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl-utils/tl-utils.hpp b/submodules/ton/tonlib-src/tl-utils/tl-utils.hpp
new file mode 100644
index 0000000000..94c359ba3c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl-utils/tl-utils.hpp
@@ -0,0 +1,51 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "auto/tl/ton_api.h"
+
+#include "tl/tl_object_parse.h"
+#include "td/utils/tl_parsers.h"
+
+#include "crypto/common/bitstring.h"
+
+#include "common-utils.hpp"
+
+namespace ton {
+td::BufferSlice serialize_tl_object(const ton_api::Object *T, bool boxed);
+td::BufferSlice serialize_tl_object(const ton_api::Function *T, bool boxed);
+td::BufferSlice serialize_tl_object(const ton_api::Object *T, bool boxed, td::BufferSlice &&suffix);
+td::BufferSlice serialize_tl_object(const ton_api::Function *T, bool boxed, td::BufferSlice &&suffix);
+td::BufferSlice serialize_tl_object(const ton_api::Object *T, bool boxed, td::Slice suffix);
+td::BufferSlice serialize_tl_object(const ton_api::Function *T, bool boxed, td::Slice suffix);
+
+td::UInt256 get_tl_object_sha256(const ton_api::Object *T);
+
+template <class Tp, std::enable_if_t<std::is_base_of<ton_api::Object, Tp>::value>>
+td::UInt256 get_tl_object_sha256(const Tp &T) {
+  return get_tl_object_sha256(static_cast<const ton_api::Object *>(&T));
+}
+
+td::Bits256 get_tl_object_sha_bits256(const ton_api::Object *T);
+
+template <class Tp, std::enable_if_t<std::is_base_of<ton_api::Object, Tp>::value>>
+td::Bits256 get_tl_object_sha_bits256(const Tp &T) {
+  return get_tl_object_sha_bits256(static_cast<const ton_api::Object *>(&T));
+}
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl/CMakeLists.txt b/submodules/ton/tonlib-src/tl/CMakeLists.txt
new file mode 100644
index 0000000000..8adabedae6
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/CMakeLists.txt
@@ -0,0 +1,55 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+add_subdirectory(generate)
+set_source_files_properties(${TL_TON_API} PROPERTIES GENERATED TRUE)
+add_library(tl_api STATIC 
+	${TL_TON_API} 
+	tl/tl_object_parse.h 
+	tl/tl_object_store.h 
+	tl/TlObject.h)
+add_dependencies(tl_api tl_generate_common)
+target_link_libraries(tl_api tdutils)
+target_include_directories(tl_api PUBLIC
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/..>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/../crypto/> $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/generate>)
+
+set_source_files_properties(${TL_LITE_API} PROPERTIES GENERATED TRUE)
+add_library(tl_lite_api STATIC 
+	${TL_LITE_API} 
+	tl/tl_object_parse.h 
+	tl/tl_object_store.h 
+	tl/TlObject.h)
+add_dependencies(tl_lite_api tl_generate_common)
+target_link_libraries(tl_lite_api tdutils)
+target_include_directories(tl_lite_api PUBLIC
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/..>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/../crypto/> $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/generate>)
+
+if (TONLIB_ENABLE_JNI)
+  set(TL_JNI_OBJECT
+    tl/tl_jni_object.cpp
+    tl/tl_jni_object.h
+  )
+else()
+  set(TL_JNI_OBJECT)
+endif()
+set_source_files_properties(${TL_TONLIB_API} PROPERTIES GENERATED TRUE)
+set_source_files_properties(${TL_TONLIB_API_JSON} PROPERTIES GENERATED TRUE)
+add_library(tl_tonlib_api STATIC ${TL_TONLIB_API} tl/tl_object_parse.h tl/tl_object_store.h tl/TlObject.h
+	${TL_JNI_OBJECT})
+add_library(tl_tonlib_api_json STATIC ${TL_TONLIB_API_JSON} tl/tl_object_parse.h tl/tl_object_store.h tl/TlObject.h)
+add_dependencies(tl_tonlib_api tl_generate_common)
+target_link_libraries(tl_tonlib_api tdutils)
+target_link_libraries(tl_tonlib_api_json tdutils tl_tonlib_api)
+target_include_directories(tl_tonlib_api PUBLIC
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/..>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/../crypto/>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/generate> )
+target_include_directories(tl_tonlib_api_json PUBLIC
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/..>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/../crypto/>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/generate> )
diff --git a/submodules/ton/tonlib-src/tl/generate/CMakeLists.txt b/submodules/ton/tonlib-src/tl/generate/CMakeLists.txt
new file mode 100644
index 0000000000..61d66c932b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/CMakeLists.txt
@@ -0,0 +1,83 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+file(MAKE_DIRECTORY auto/tl)
+
+set(TL_TON_API
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/tl/ton_api.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/tl/ton_api.h
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/tl/ton_api.hpp
+
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/tl/ton_api_json.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/tl/ton_api_json.h
+)
+set(TL_TON_API ${TL_TON_API} PARENT_SCOPE)
+
+set(TL_LITE_API
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/tl/lite_api.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/tl/lite_api.h
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/tl/lite_api.hpp
+)
+set(TL_LITE_API ${TL_LITE_API} PARENT_SCOPE)
+
+set(TL_TONLIB_API
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/tl/tonlib_api.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/tl/tonlib_api.h
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/tl/tonlib_api.hpp
+)
+set(TL_TONLIB_API ${TL_TONLIB_API} PARENT_SCOPE)
+
+set(TL_TONLIB_API_JSON
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/tl/tonlib_api_json.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/auto/tl/tonlib_api_json.h
+)
+set(TL_TONLIB_API_JSON ${TL_TONLIB_API_JSON} PARENT_SCOPE)
+
+set(TL_GENERATE_COMMON_SOURCE
+  generate_common.cpp
+
+  tl_json_converter.cpp
+  tl_writer_cpp.cpp
+  tl_writer_h.cpp
+  tl_writer_hpp.cpp
+  tl_writer_td.cpp
+  tl_writer_jni_cpp.cpp
+  tl_writer_jni_h.cpp
+
+  tl_json_converter.h
+  tl_writer_cpp.h
+  tl_writer_h.h
+  tl_writer_hpp.h
+  tl_writer_td.h
+  tl_writer_jni_cpp.h
+  tl_writer_jni_h.h
+)
+
+set(TL_GENERATE_JAVA_SOURCE
+  generate_java.cpp
+  tl_writer_java.cpp
+
+  tl_writer_java.h
+)
+add_executable(tonlib_generate_java_api ${TL_GENERATE_JAVA_SOURCE})
+target_link_libraries(tonlib_generate_java_api PRIVATE tdtl)
+
+if (NOT CMAKE_CROSSCOMPILING)
+  find_program(PHP_EXECUTABLE php)
+
+  set(GENERATE_COMMON_CMD generate_common)
+  add_executable(generate_common ${TL_GENERATE_COMMON_SOURCE})
+  target_link_libraries(generate_common PRIVATE tdtl tdutils)
+  add_custom_command(
+    WORKING_DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR}
+    COMMAND ${GENERATE_COMMON_CMD}
+    COMMENT "Generate common tl source files"
+    DEPENDS generate_common scheme/ton_api.tlo scheme/lite_api.tlo scheme/tonlib_api.tlo
+    OUTPUT ${TL_TON_API} ${TL_LITE_API} ${TL_TONLIB_API} ${TL_TONLIB_API_JSON}
+  )
+  add_custom_target(tl_generate_common DEPENDS ${TL_TON_API} ${TL_LITE_API} ${TL_TONLIB_API} ${TL_TONLIB_API_JSON})
+  if (TONLIB_ENABLE_JNI)
+    target_compile_definitions(generate_common PRIVATE TONLIB_ENABLE_JNI=1)
+  endif()
+else()
+  add_custom_target(tl_generate_common)
+endif()
diff --git a/submodules/ton/tonlib-src/tl/generate/JavadocTlDocumentationGenerator.php b/submodules/ton/tonlib-src/tl/generate/JavadocTlDocumentationGenerator.php
new file mode 100644
index 0000000000..f33c9e99ad
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/JavadocTlDocumentationGenerator.php
@@ -0,0 +1,268 @@
+<?php
+
+require_once 'TlDocumentationGenerator.php';
+
+class JavadocTlDocumentationGenerator extends TlDocumentationGenerator
+{
+    private $nullable_type;
+    private $nullable_annotation;
+    private $java_version;
+
+    protected function escapeDocumentation($doc)
+    {
+        $doc = preg_replace_callback('/(?<!["A-Za-z_\/])[A-Za-z]*_[A-Za-z_]*/',
+            function ($word_matches)
+            {
+                return preg_replace_callback('/_([A-Za-z])/', function ($matches) {return strtoupper($matches[1]);}, $word_matches[0]);
+            }, $doc);
+        $doc = htmlspecialchars($doc);
+        $doc = str_replace('*/', '*&#47;', $doc);
+        return $doc;
+    }
+
+    protected function getFieldName($name, $class_name)
+    {
+        if (substr($name, 0, 6) === 'param_') {
+            $name = substr($name, 6);
+        }
+        return preg_replace_callback('/_([A-Za-z])/', function ($matches) {return strtoupper($matches[1]);}, trim($name));
+    }
+
+    protected function getClassName($type)
+    {
+        return implode(array_map('ucfirst', explode('.', trim($type, "\r\n ;"))));
+    }
+
+    protected function getTypeName($type)
+    {
+        switch ($type) {
+            case 'Bool':
+                return 'boolean';
+            case 'int32':
+                return 'int';
+            case 'int53':
+            case 'int64':
+                return 'long';
+            case 'double':
+                return $type;
+            case 'string':
+                return 'String';
+            case 'bytes':
+                return 'byte[]';
+            case 'bool':
+            case 'int':
+            case 'long':
+            case 'Int':
+            case 'Long':
+            case 'Int32':
+            case 'Int53':
+            case 'Int64':
+            case 'Double':
+            case 'String':
+            case 'Bytes':
+                $this->printError("Wrong type $type");
+                return '';
+            default:
+                if (substr($type, 0, 6) === 'vector') {
+                    if ($type[6] !== '<' || $type[strlen($type) - 1] !== '>') {
+                        $this->printError("Wrong vector subtype in $type");
+                        return '';
+                    }
+                    return $this->getTypeName(substr($type, 7, -1)).'[]';
+                }
+
+                if (preg_match('/[^A-Za-z0-9.]/', $type)) {
+                    $this->printError("Wrong type $type");
+                    return '';
+                }
+                return $this->getClassName($type);
+        }
+    }
+
+    protected function getBaseClassName($is_function)
+    {
+        return $is_function ? 'Function' : 'Object';
+    }
+
+    protected function needRemoveLine($line)
+    {
+        return strpos(trim($line), '/**') === 0 || strpos(trim($line), '*') === 0 ||
+            ($this->nullable_type && strpos($line, $this->nullable_type) > 0);
+    }
+
+    protected function needSkipLine($line)
+    {
+        $line = $this->fixLine(trim($line));
+        return (strpos($line, 'public') !== 0 && !$this->isHeaderLine($line)) || $line === 'public @interface Constructors {}';
+    }
+
+    protected function isHeaderLine($line)
+    {
+        return trim($line) === '@Override' || trim($line) === '@Constructors';
+    }
+
+    protected function extractClassName($line)
+    {
+        if (strpos($line, 'public static class ') > 0) {
+            return explode(' ', trim($line))[3];
+        }
+        return '';
+    }
+
+    protected function fixLine($line)
+    {
+        if (strpos($line, 'CONSTRUCTOR = ') > 0) {
+            return substr($line, 0, strpos($line, '='));
+        }
+
+        return $this->nullable_annotation ? str_replace($this->nullable_annotation.' ', '', $line) : $line;
+    }
+
+    protected function addGlobalDocumentation()
+    {
+        if ($this->nullable_type) {
+            $nullable_type_import = "import $this->nullable_type;".PHP_EOL;
+        } else {
+            $nullable_type_import = '';
+        }
+
+        $this->addDocumentation('public class TdApi {', <<<EOT
+$nullable_type_import/**
+ * This class contains as static nested classes all other TDLib interface
+ * type-classes and function-classes.
+ * <p>
+ * It has no inner classes, functions or public members.
+ */
+EOT
+);
+
+        $this->addDocumentation('    public abstract static class Object {', <<<EOT
+    /**
+     * This class is a base class for all TDLib interface classes.
+     */
+EOT
+);
+
+        $this->addDocumentation('        public abstract int getConstructor();', <<<EOT
+        /**
+         * @return identifier uniquely determining type of the object.
+         */
+EOT
+);
+
+        $this->addDocumentation('        public native String toString();', <<<EOT
+        /**
+         * @return string representation of the object.
+         */
+EOT
+);
+
+        $this->addDocumentation('    public abstract static class Function extends Object {', <<<EOT
+    /**
+     * This class is a base class for all TDLib interface function-classes.
+     */
+EOT
+);
+
+        $this->addDocumentation('        public static final int CONSTRUCTOR', <<<EOT
+        /**
+         * Identifier uniquely determining type of the object.
+         */
+EOT
+);
+
+        $this->addDocumentation('        public int getConstructor() {', <<<EOT
+        /**
+         * @return this.CONSTRUCTOR
+         */
+EOT
+);
+    }
+
+    protected function addAbstractClassDocumentation($class_name, $documentation)
+    {
+        $this->addDocumentation("    public abstract static class $class_name extends Object {", <<<EOT
+    /**
+     * This class is an abstract base class.
+     * $documentation
+     */
+EOT
+);
+    }
+
+    protected function getFunctionReturnTypeDescription($return_type, $for_constructor)
+    {
+        $shift = $for_constructor ? '         ' : '     ';
+        return PHP_EOL.$shift.'*'.PHP_EOL.$shift."* <p> Returns {@link $return_type $return_type} </p>";
+    }
+
+    protected function addClassDocumentation($class_name, $base_class_name, $description)
+    {
+        $this->addDocumentation("    public static class $class_name extends $base_class_name {", <<<EOT
+    /**
+     * $description
+     */
+EOT
+);
+    }
+
+    protected function addFieldDocumentation($class_name, $field_name, $type_name, $field_info, $may_be_null)
+    {
+        $full_line = $class_name."        public $type_name $field_name;";
+        $this->addDocumentation($full_line, <<<EOT
+        /**
+         * $field_info
+         */
+EOT
+);
+        if ($may_be_null && $this->nullable_annotation && ($this->java_version >= 8 || substr($type_name, -1) != ']')) {
+            $this->addLineReplacement($full_line, "        $this->nullable_annotation public $type_name $field_name;".PHP_EOL);
+        }
+    }
+
+    protected function addDefaultConstructorDocumentation($class_name, $class_description)
+    {
+        $this->addDocumentation("        public $class_name() {", <<<EOT
+        /**
+         * $class_description
+         */
+EOT
+);
+    }
+
+    protected function addFullConstructorDocumentation($class_name, $class_description, $known_fields, $info)
+    {
+        $full_constructor = "        public $class_name(";
+        $colon = '';
+        foreach ($known_fields as $name => $type) {
+            $full_constructor .= $colon.$this->getTypeName($type).' '.$this->getFieldName($name, $class_name);
+            $colon = ', ';
+        }
+        $full_constructor .= ') {';
+
+        $full_doc = <<<EOT
+        /**
+         * $class_description
+         *
+
+EOT;
+        foreach ($known_fields as $name => $type) {
+            $full_doc .= '         * @param '.$this->getFieldName($name, $class_name).' '.$info[$name].PHP_EOL;
+        }
+        $full_doc .= '         */';
+        $this->addDocumentation($full_constructor, $full_doc);
+    }
+
+    public function __construct($nullable_type, $nullable_annotation, $java_version) {
+        $this->nullable_type = trim($nullable_type);
+        $this->nullable_annotation = trim($nullable_annotation);
+        $this->java_version = intval($java_version);
+    }
+}
+
+$nullable_type = isset($argv[3]) ? $argv[3] : '';
+$nullable_annotation = isset($argv[4]) ? $argv[4] : '';
+$java_version = isset($argv[5]) ? intval($argv[5]) : 7;
+
+$generator = new JavadocTlDocumentationGenerator($nullable_type, $nullable_annotation, $java_version);
+$generator->generate($argv[1], $argv[2]);
diff --git a/submodules/ton/tonlib-src/tl/generate/TlDocumentationGenerator.php b/submodules/ton/tonlib-src/tl/generate/TlDocumentationGenerator.php
new file mode 100644
index 0000000000..61101e1c73
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/TlDocumentationGenerator.php
@@ -0,0 +1,323 @@
+<?php
+
+abstract class TlDocumentationGenerator
+{
+    private $current_line = '';
+    private $documentation = array();
+    private $line_replacement = array();
+
+    final protected function printError($error)
+    {
+        fwrite(STDERR, "$error near line \"".rtrim($this->current_line)."\"\n");
+    }
+
+    final protected function addDocumentation($code, $doc) {
+        if (isset($this->documentation[$code])) {
+            $this->printError("Duplicate documentation for \"$code\"");
+        }
+
+        $this->documentation[$code] = $doc;
+        // $this->printError($code);
+    }
+
+    final protected function addLineReplacement($line, $new_line) {
+        if (isset($this->line_replacement[$line])) {
+            $this->printError("Duplicate line replacement for \"$line\"");
+        }
+
+        $this->line_replacement[$line] = $new_line;
+    }
+
+    final protected function addDot($str) {
+        if (!$str) {
+            return '';
+        }
+
+        $len = strlen($str);
+        if ($str[$len - 1] === '.') {
+            return $str;
+        }
+
+        if ($str[$len - 1] === ')') {
+            // trying to place dot inside the brackets
+            $bracket_count = 1;
+            for ($pos = $len - 2; $pos >= 0; $pos--) {
+                if ($str[$pos] === ')') {
+                    $bracket_count++;
+                }
+                if ($str[$pos] === '(') {
+                    $bracket_count--;
+                    if ($bracket_count === 0) {
+                        break;
+                    }
+                }
+            }
+            if ($bracket_count === 0) {
+                if (ctype_upper($str[$pos + 1])) {
+                    return substr($str, 0, -1).'.)';
+                }
+            } else {
+                $this->printError("Unmatched bracket");
+            }
+        }
+        return $str.'.';
+    }
+
+    abstract protected function escapeDocumentation($doc);
+
+    abstract protected function getFieldName($name, $class_name);
+
+    abstract protected function getClassName($name);
+
+    abstract protected function getTypeName($type);
+
+    abstract protected function getBaseClassName($is_function);
+
+    abstract protected function needRemoveLine($line);
+
+    abstract protected function needSkipLine($line);
+
+    abstract protected function isHeaderLine($line);
+
+    abstract protected function extractClassName($line);
+
+    abstract protected function fixLine($line);
+
+    abstract protected function addGlobalDocumentation();
+
+    abstract protected function addAbstractClassDocumentation($class_name, $value);
+
+    abstract protected function getFunctionReturnTypeDescription($return_type, $for_constructor);
+
+    abstract protected function addClassDocumentation($class_name, $base_class_name, $description);
+
+    abstract protected function addFieldDocumentation($class_name, $field_name, $type_name, $field_info, $may_be_null);
+
+    abstract protected function addDefaultConstructorDocumentation($class_name, $class_description);
+
+    abstract protected function addFullConstructorDocumentation($class_name, $class_description, $known_fields, $info);
+
+    public function generate($tl_scheme_file, $source_file)
+    {
+        $lines = array_filter(array_map('trim', file($tl_scheme_file)));
+        $description = '';
+        $current_class = '';
+        $is_function = false;
+        $need_class_description = false;
+
+        $this->addGlobalDocumentation();
+
+        foreach ($lines as $line) {
+            $this->current_line = $line;
+            if ($line === '---types---') {
+                $is_function = false;
+            } elseif ($line === '---functions---') {
+                $is_function = true;
+                $current_class = '';
+                $need_class_description = false;
+            } elseif ($line[0] === '/') {
+                if ($line[1] !== '/') {
+                    $this->printError('Wrong comment');
+                    continue;
+                }
+                if ($line[2] === '@' || $line[2] === '-') {
+                    $description .= trim(substr($line, 2 + intval($line[2] === '-'))).' ';
+                } else {
+                    $this->printError('Unexpected comment');
+                }
+            } elseif (strpos($line, '? =') || strpos($line, ' = Vector t;') || $line === 'boolFalse = Bool;' ||
+                      $line === 'boolTrue = Bool;' || $line === 'bytes = Bytes;' || $line === 'int32 = Int32;' ||
+                      $line === 'int53 = Int53;'|| $line === 'int64 = Int64;') {
+                // skip built-in types
+                continue;
+            } else {
+                $description = trim($description);
+                if ($description[0] !== '@') {
+                    $this->printError('Wrong description begin');
+                }
+
+                $docs = explode('@', $description);
+                array_shift($docs);
+                $info = array();
+
+                foreach ($docs as $doc) {
+                    list($key, $value) = explode(' ', $doc, 2);
+                    $value = trim($value);
+
+                    if ($need_class_description) {
+                        if ($key === 'description') {
+                            $need_class_description = false;
+
+                            $value = $this->escapeDocumentation($this->addDot($value));
+
+                            $this->addAbstractClassDocumentation($current_class, $value);
+                            continue;
+                        } else {
+                            $this->printError('Expected abstract class description');
+                        }
+                    }
+
+                    if ($key === 'class') {
+                        $current_class = $this->getClassName($value);
+                        $need_class_description = true;
+
+                        if ($is_function) {
+                            $this->printError('Unexpected class definition');
+                        }
+                    } else {
+                        if (isset($info[$key])) {
+                            $this->printError("Duplicate info about `$key`");
+                        }
+                        $info[$key] = trim($value);
+                    }
+                }
+
+                if (substr_count($line, '=') !== 1) {
+                    $this->printError("Wrong '=' count");
+                    continue;
+                }
+
+                list($fields, $type) = explode('=', $line);
+                $type = $this->getClassName($type);
+                $fields = explode(' ', trim($fields));
+                $class_name = $this->getClassName(array_shift($fields));
+
+                if ($type !== $current_class) {
+                    $current_class = '';
+                    $need_class_description = false;
+                }
+
+                if (!$is_function) {
+                    $type_lower = strtolower($type);
+                    $class_name_lower = strtolower($class_name);
+                    if (empty($current_class) === ($type_lower !== $class_name_lower)) {
+                        $this->printError('Wrong constructor name');
+                    }
+                    if (strpos($class_name_lower, $type_lower) !== 0) {
+                        // $this->printError('Wrong constructor name');
+                    }
+                }
+
+                $known_fields = array();
+                foreach ($fields as $field) {
+                    list ($field_name, $field_type) = explode(':', $field);
+                    if (isset($info['param_'.$field_name])) {
+                        $known_fields['param_'.$field_name] = $field_type;
+                        continue;
+                    }
+                    if (isset($info[$field_name])) {
+                        $known_fields[$field_name] = $field_type;
+                        continue;
+                    }
+                    $this->printError("Have no info about field `$field_name`");
+                }
+
+                foreach ($info as $name => $value) {
+                    if (!$value) {
+                        $this->printError("info[$name] for $class_name is empty");
+                    } elseif (($value[0] < 'A' || $value[0] > 'Z') && ($value[0] < '0' || $value[0] > '9')) {
+                        $this->printError("info[$name] for $class_name doesn't begins with capital letter");
+                    }
+                }
+
+                foreach (array_diff_key($info, $known_fields) as $field_name => $field_info) {
+                    if ($field_name !== 'description') {
+                        $this->printError("Have info about unexisted field `$field_name`");
+                    }
+                }
+
+                if (!$info['description']) {
+                    $this->printError("Have no description for class `$class_name`");
+                }
+
+                foreach ($info as &$v) {
+                    $v = $this->escapeDocumentation($this->addDot($v));
+                }
+
+                $base_class_name = $current_class ?: $this->getBaseClassName($is_function);
+                $class_description = $info['description'];
+                if ($is_function) {
+                    $class_description .= $this->getFunctionReturnTypeDescription($this->getTypeName($type), false);
+                }
+                $this->addClassDocumentation($class_name, $base_class_name, $class_description);
+
+                foreach ($known_fields as $name => $field_type) {
+                    $may_be_null = stripos($info[$name], 'may be null') !== false;
+                    $field_name = $this->getFieldName($name, $class_name);
+                    $field_type_name = $this->getTypeName($field_type);
+                    $this->addFieldDocumentation($class_name, $field_name, $field_type_name, $info[$name], $may_be_null);
+                }
+
+                if ($is_function) {
+                    $default_constructor_prefix = 'Default constructor for a function, which ';
+                    $full_constructor_prefix = 'Creates a function, which ';
+                    $class_description = lcfirst($info['description']);
+                    $class_description .= $this->getFunctionReturnTypeDescription($this->getTypeName($type), true);
+                } else {
+                    $default_constructor_prefix = '';
+                    $full_constructor_prefix = '';
+                }
+                $this->addDefaultConstructorDocumentation($class_name, $default_constructor_prefix.$class_description);
+
+                if ($known_fields) {
+                    $this->addFullConstructorDocumentation($class_name, $full_constructor_prefix.$class_description, $known_fields, $info);
+                }
+
+                $description = '';
+            }
+        }
+
+        $lines = file($source_file);
+        $result = '';
+        $current_class = '';
+        $current_headers = '';
+        foreach ($lines as $line) {
+            $this->current_line = $line;
+            if ($this->needRemoveLine($line)) {
+                continue;
+            }
+            if ($this->needSkipLine($line)) {
+                $result .= $current_headers.$line;
+                $current_headers = '';
+                continue;
+            }
+            if ($this->isHeaderLine($line)) {
+                $current_headers .= $line;
+                continue;
+            }
+
+            $current_class = $this->extractClassName($line) ?: $current_class;
+
+            $fixed_line = rtrim($this->fixLine($line));
+
+            $doc = '';
+            if (isset($this->documentation[$fixed_line])) {
+                $doc = $this->documentation[$fixed_line];
+                // unset($this->documentation[$fixed_line]);
+            } elseif (isset($this->documentation[$current_class.$fixed_line])) {
+                $doc = $this->documentation[$current_class.$fixed_line];
+                // unset($this->documentation[$current_class.$fixed_line]);
+            } else {
+                $this->printError('Have no docs for "'.$fixed_line.'"');
+            }
+            if ($doc) {
+                $result .= $doc."\n";
+            }
+            if (isset($this->line_replacement[$fixed_line])) {
+                $line = $this->line_replacement[$fixed_line];
+            } elseif (isset($this->line_replacement[$current_class.$fixed_line])) {
+                $line = $this->line_replacement[$current_class.$fixed_line];
+            }
+            $result .= $current_headers.$line;
+            $current_headers = '';
+        }
+
+        if (file_get_contents($source_file) !== $result) {
+            file_put_contents($source_file, $result);
+        }
+
+        if (count($this->documentation)) {
+            // $this->printError('Have unused docs '.print_r(array_keys($this->documentation), true));
+        }
+    }
+}
diff --git a/submodules/ton/tonlib-src/tl/generate/auto/tl/lite_api.cpp b/submodules/ton/tonlib-src/tl/generate/auto/tl/lite_api.cpp
new file mode 100644
index 0000000000..0870103c53
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/auto/tl/lite_api.cpp
@@ -0,0 +1,2774 @@
+#include "lite_api.h"
+
+#include "tl/tl_object_parse.h"
+#include "tl/tl_object_store.h"
+#include "td/utils/int_types.h"
+#include "crypto/common/bitstring.h"
+
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/tl_parsers.h"
+#include "td/utils/tl_storers.h"
+
+namespace ton {
+namespace lite_api {
+
+std::string to_string(const BaseObject &value) {
+  td::TlStorerToString storer;
+  value.store(storer, "");
+  return storer.str();
+}
+
+object_ptr<Object> Object::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case adnl_message_query::ID:
+      return adnl_message_query::fetch(p);
+    case adnl_message_answer::ID:
+      return adnl_message_answer::fetch(p);
+    case liteServer_accountId::ID:
+      return liteServer_accountId::fetch(p);
+    case liteServer_accountState::ID:
+      return liteServer_accountState::fetch(p);
+    case liteServer_allShardsInfo::ID:
+      return liteServer_allShardsInfo::fetch(p);
+    case liteServer_blockData::ID:
+      return liteServer_blockData::fetch(p);
+    case liteServer_blockHeader::ID:
+      return liteServer_blockHeader::fetch(p);
+    case liteServer_blockLinkBack::ID:
+      return liteServer_blockLinkBack::fetch(p);
+    case liteServer_blockLinkForward::ID:
+      return liteServer_blockLinkForward::fetch(p);
+    case liteServer_blockState::ID:
+      return liteServer_blockState::fetch(p);
+    case liteServer_blockTransactions::ID:
+      return liteServer_blockTransactions::fetch(p);
+    case liteServer_configInfo::ID:
+      return liteServer_configInfo::fetch(p);
+    case liteServer_currentTime::ID:
+      return liteServer_currentTime::fetch(p);
+    case liteServer_error::ID:
+      return liteServer_error::fetch(p);
+    case liteServer_masterchainInfo::ID:
+      return liteServer_masterchainInfo::fetch(p);
+    case liteServer_masterchainInfoExt::ID:
+      return liteServer_masterchainInfoExt::fetch(p);
+    case liteServer_partialBlockProof::ID:
+      return liteServer_partialBlockProof::fetch(p);
+    case liteServer_sendMsgStatus::ID:
+      return liteServer_sendMsgStatus::fetch(p);
+    case liteServer_shardInfo::ID:
+      return liteServer_shardInfo::fetch(p);
+    case liteServer_signature::ID:
+      return liteServer_signature::fetch(p);
+    case liteServer_signatureSet::ID:
+      return liteServer_signatureSet::fetch(p);
+    case liteServer_transactionId::ID:
+      return liteServer_transactionId::fetch(p);
+    case liteServer_transactionId3::ID:
+      return liteServer_transactionId3::fetch(p);
+    case liteServer_transactionInfo::ID:
+      return liteServer_transactionInfo::fetch(p);
+    case liteServer_transactionList::ID:
+      return liteServer_transactionList::fetch(p);
+    case liteServer_version::ID:
+      return liteServer_version::fetch(p);
+    case liteServer_debug_verbosity::ID:
+      return liteServer_debug_verbosity::fetch(p);
+    case tonNode_blockId::ID:
+      return tonNode_blockId::fetch(p);
+    case tonNode_blockIdExt::ID:
+      return tonNode_blockIdExt::fetch(p);
+    case tonNode_zeroStateIdExt::ID:
+      return tonNode_zeroStateIdExt::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+object_ptr<Function> Function::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case liteServer_getAccountState::ID:
+      return liteServer_getAccountState::fetch(p);
+    case liteServer_getAllShardsInfo::ID:
+      return liteServer_getAllShardsInfo::fetch(p);
+    case liteServer_getBlock::ID:
+      return liteServer_getBlock::fetch(p);
+    case liteServer_getBlockHeader::ID:
+      return liteServer_getBlockHeader::fetch(p);
+    case liteServer_getBlockProof::ID:
+      return liteServer_getBlockProof::fetch(p);
+    case liteServer_getConfigAll::ID:
+      return liteServer_getConfigAll::fetch(p);
+    case liteServer_getConfigParams::ID:
+      return liteServer_getConfigParams::fetch(p);
+    case liteServer_getMasterchainInfo::ID:
+      return liteServer_getMasterchainInfo::fetch(p);
+    case liteServer_getMasterchainInfoExt::ID:
+      return liteServer_getMasterchainInfoExt::fetch(p);
+    case liteServer_getOneTransaction::ID:
+      return liteServer_getOneTransaction::fetch(p);
+    case liteServer_getShardInfo::ID:
+      return liteServer_getShardInfo::fetch(p);
+    case liteServer_getState::ID:
+      return liteServer_getState::fetch(p);
+    case liteServer_getTime::ID:
+      return liteServer_getTime::fetch(p);
+    case liteServer_getTransactions::ID:
+      return liteServer_getTransactions::fetch(p);
+    case liteServer_getVersion::ID:
+      return liteServer_getVersion::fetch(p);
+    case liteServer_listBlockTransactions::ID:
+      return liteServer_listBlockTransactions::fetch(p);
+    case liteServer_lookupBlock::ID:
+      return liteServer_lookupBlock::fetch(p);
+    case liteServer_query::ID:
+      return liteServer_query::fetch(p);
+    case liteServer_queryPrefix::ID:
+      return liteServer_queryPrefix::fetch(p);
+    case liteServer_sendMessage::ID:
+      return liteServer_sendMessage::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+object_ptr<adnl_Message> adnl_Message::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case adnl_message_query::ID:
+      return adnl_message_query::fetch(p);
+    case adnl_message_answer::ID:
+      return adnl_message_answer::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+adnl_message_query::adnl_message_query()
+  : query_id_()
+  , query_()
+{}
+
+adnl_message_query::adnl_message_query(td::Bits256 const &query_id_, td::BufferSlice &&query_)
+  : query_id_(query_id_)
+  , query_(std::move(query_))
+{}
+
+const std::int32_t adnl_message_query::ID;
+
+object_ptr<adnl_Message> adnl_message_query::fetch(td::TlParser &p) {
+  return make_object<adnl_message_query>(p);
+}
+
+adnl_message_query::adnl_message_query(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : query_id_(TlFetchInt256::parse(p))
+  , query_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void adnl_message_query::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(query_id_, s);
+  TlStoreString::store(query_, s);
+}
+
+void adnl_message_query::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(query_id_, s);
+  TlStoreString::store(query_, s);
+}
+
+void adnl_message_query::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_message_query");
+    s.store_field("query_id", query_id_);
+    s.store_bytes_field("query", query_);
+    s.store_class_end();
+  }
+}
+
+adnl_message_answer::adnl_message_answer()
+  : query_id_()
+  , answer_()
+{}
+
+adnl_message_answer::adnl_message_answer(td::Bits256 const &query_id_, td::BufferSlice &&answer_)
+  : query_id_(query_id_)
+  , answer_(std::move(answer_))
+{}
+
+const std::int32_t adnl_message_answer::ID;
+
+object_ptr<adnl_Message> adnl_message_answer::fetch(td::TlParser &p) {
+  return make_object<adnl_message_answer>(p);
+}
+
+adnl_message_answer::adnl_message_answer(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : query_id_(TlFetchInt256::parse(p))
+  , answer_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void adnl_message_answer::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(query_id_, s);
+  TlStoreString::store(answer_, s);
+}
+
+void adnl_message_answer::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(query_id_, s);
+  TlStoreString::store(answer_, s);
+}
+
+void adnl_message_answer::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_message_answer");
+    s.store_field("query_id", query_id_);
+    s.store_bytes_field("answer", answer_);
+    s.store_class_end();
+  }
+}
+
+liteServer_accountId::liteServer_accountId()
+  : workchain_()
+  , id_()
+{}
+
+liteServer_accountId::liteServer_accountId(std::int32_t workchain_, td::Bits256 const &id_)
+  : workchain_(workchain_)
+  , id_(id_)
+{}
+
+const std::int32_t liteServer_accountId::ID;
+
+object_ptr<liteServer_accountId> liteServer_accountId::fetch(td::TlParser &p) {
+  return make_object<liteServer_accountId>(p);
+}
+
+liteServer_accountId::liteServer_accountId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : workchain_(TlFetchInt::parse(p))
+  , id_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void liteServer_accountId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(id_, s);
+}
+
+void liteServer_accountId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(id_, s);
+}
+
+void liteServer_accountId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_accountId");
+    s.store_field("workchain", workchain_);
+    s.store_field("id", id_);
+    s.store_class_end();
+  }
+}
+
+liteServer_accountState::liteServer_accountState()
+  : id_()
+  , shardblk_()
+  , shard_proof_()
+  , proof_()
+  , state_()
+{}
+
+liteServer_accountState::liteServer_accountState(object_ptr<tonNode_blockIdExt> &&id_, object_ptr<tonNode_blockIdExt> &&shardblk_, td::BufferSlice &&shard_proof_, td::BufferSlice &&proof_, td::BufferSlice &&state_)
+  : id_(std::move(id_))
+  , shardblk_(std::move(shardblk_))
+  , shard_proof_(std::move(shard_proof_))
+  , proof_(std::move(proof_))
+  , state_(std::move(state_))
+{}
+
+const std::int32_t liteServer_accountState::ID;
+
+object_ptr<liteServer_accountState> liteServer_accountState::fetch(td::TlParser &p) {
+  return make_object<liteServer_accountState>(p);
+}
+
+liteServer_accountState::liteServer_accountState(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , shardblk_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , shard_proof_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , proof_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , state_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_accountState::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreObject::store(shardblk_, s);
+  TlStoreString::store(shard_proof_, s);
+  TlStoreString::store(proof_, s);
+  TlStoreString::store(state_, s);
+}
+
+void liteServer_accountState::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreObject::store(shardblk_, s);
+  TlStoreString::store(shard_proof_, s);
+  TlStoreString::store(proof_, s);
+  TlStoreString::store(state_, s);
+}
+
+void liteServer_accountState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_accountState");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    if (shardblk_ == nullptr) { s.store_field("shardblk", "null"); } else { shardblk_->store(s, "shardblk"); }
+    s.store_bytes_field("shard_proof", shard_proof_);
+    s.store_bytes_field("proof", proof_);
+    s.store_bytes_field("state", state_);
+    s.store_class_end();
+  }
+}
+
+liteServer_allShardsInfo::liteServer_allShardsInfo()
+  : id_()
+  , proof_()
+  , data_()
+{}
+
+liteServer_allShardsInfo::liteServer_allShardsInfo(object_ptr<tonNode_blockIdExt> &&id_, td::BufferSlice &&proof_, td::BufferSlice &&data_)
+  : id_(std::move(id_))
+  , proof_(std::move(proof_))
+  , data_(std::move(data_))
+{}
+
+const std::int32_t liteServer_allShardsInfo::ID;
+
+object_ptr<liteServer_allShardsInfo> liteServer_allShardsInfo::fetch(td::TlParser &p) {
+  return make_object<liteServer_allShardsInfo>(p);
+}
+
+liteServer_allShardsInfo::liteServer_allShardsInfo(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , proof_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_allShardsInfo::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreString::store(proof_, s);
+  TlStoreString::store(data_, s);
+}
+
+void liteServer_allShardsInfo::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreString::store(proof_, s);
+  TlStoreString::store(data_, s);
+}
+
+void liteServer_allShardsInfo::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_allShardsInfo");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_bytes_field("proof", proof_);
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+liteServer_blockData::liteServer_blockData()
+  : id_()
+  , data_()
+{}
+
+liteServer_blockData::liteServer_blockData(object_ptr<tonNode_blockIdExt> &&id_, td::BufferSlice &&data_)
+  : id_(std::move(id_))
+  , data_(std::move(data_))
+{}
+
+const std::int32_t liteServer_blockData::ID;
+
+object_ptr<liteServer_blockData> liteServer_blockData::fetch(td::TlParser &p) {
+  return make_object<liteServer_blockData>(p);
+}
+
+liteServer_blockData::liteServer_blockData(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_blockData::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreString::store(data_, s);
+}
+
+void liteServer_blockData::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreString::store(data_, s);
+}
+
+void liteServer_blockData::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_blockData");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+liteServer_blockHeader::liteServer_blockHeader()
+  : id_()
+  , mode_()
+  , header_proof_()
+{}
+
+liteServer_blockHeader::liteServer_blockHeader(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t mode_, td::BufferSlice &&header_proof_)
+  : id_(std::move(id_))
+  , mode_(mode_)
+  , header_proof_(std::move(header_proof_))
+{}
+
+const std::int32_t liteServer_blockHeader::ID;
+
+object_ptr<liteServer_blockHeader> liteServer_blockHeader::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_blockHeader> res = make_object<liteServer_blockHeader>();
+  std::int32_t var0;
+  res->id_ = TlFetchObject<tonNode_blockIdExt>::parse(p);
+  if ((var0 = res->mode_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  res->header_proof_ = TlFetchBytes<td::BufferSlice>::parse(p);
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_blockHeader::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreString::store(header_proof_, s);
+}
+
+void liteServer_blockHeader::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreString::store(header_proof_, s);
+}
+
+void liteServer_blockHeader::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_blockHeader");
+  std::int32_t var0;
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("mode", (var0 = mode_));
+    s.store_bytes_field("header_proof", header_proof_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<liteServer_BlockLink> liteServer_BlockLink::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case liteServer_blockLinkBack::ID:
+      return liteServer_blockLinkBack::fetch(p);
+    case liteServer_blockLinkForward::ID:
+      return liteServer_blockLinkForward::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+liteServer_blockLinkBack::liteServer_blockLinkBack()
+  : to_key_block_()
+  , from_()
+  , to_()
+  , dest_proof_()
+  , proof_()
+  , state_proof_()
+{}
+
+liteServer_blockLinkBack::liteServer_blockLinkBack(bool to_key_block_, object_ptr<tonNode_blockIdExt> &&from_, object_ptr<tonNode_blockIdExt> &&to_, td::BufferSlice &&dest_proof_, td::BufferSlice &&proof_, td::BufferSlice &&state_proof_)
+  : to_key_block_(to_key_block_)
+  , from_(std::move(from_))
+  , to_(std::move(to_))
+  , dest_proof_(std::move(dest_proof_))
+  , proof_(std::move(proof_))
+  , state_proof_(std::move(state_proof_))
+{}
+
+const std::int32_t liteServer_blockLinkBack::ID;
+
+object_ptr<liteServer_BlockLink> liteServer_blockLinkBack::fetch(td::TlParser &p) {
+  return make_object<liteServer_blockLinkBack>(p);
+}
+
+liteServer_blockLinkBack::liteServer_blockLinkBack(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : to_key_block_(TlFetchBool::parse(p))
+  , from_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , to_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , dest_proof_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , proof_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , state_proof_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_blockLinkBack::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBool::store(to_key_block_, s);
+  TlStoreObject::store(from_, s);
+  TlStoreObject::store(to_, s);
+  TlStoreString::store(dest_proof_, s);
+  TlStoreString::store(proof_, s);
+  TlStoreString::store(state_proof_, s);
+}
+
+void liteServer_blockLinkBack::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBool::store(to_key_block_, s);
+  TlStoreObject::store(from_, s);
+  TlStoreObject::store(to_, s);
+  TlStoreString::store(dest_proof_, s);
+  TlStoreString::store(proof_, s);
+  TlStoreString::store(state_proof_, s);
+}
+
+void liteServer_blockLinkBack::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_blockLinkBack");
+    s.store_field("to_key_block", to_key_block_);
+    if (from_ == nullptr) { s.store_field("from", "null"); } else { from_->store(s, "from"); }
+    if (to_ == nullptr) { s.store_field("to", "null"); } else { to_->store(s, "to"); }
+    s.store_bytes_field("dest_proof", dest_proof_);
+    s.store_bytes_field("proof", proof_);
+    s.store_bytes_field("state_proof", state_proof_);
+    s.store_class_end();
+  }
+}
+
+liteServer_blockLinkForward::liteServer_blockLinkForward()
+  : to_key_block_()
+  , from_()
+  , to_()
+  , dest_proof_()
+  , config_proof_()
+  , signatures_()
+{}
+
+liteServer_blockLinkForward::liteServer_blockLinkForward(bool to_key_block_, object_ptr<tonNode_blockIdExt> &&from_, object_ptr<tonNode_blockIdExt> &&to_, td::BufferSlice &&dest_proof_, td::BufferSlice &&config_proof_, object_ptr<liteServer_signatureSet> &&signatures_)
+  : to_key_block_(to_key_block_)
+  , from_(std::move(from_))
+  , to_(std::move(to_))
+  , dest_proof_(std::move(dest_proof_))
+  , config_proof_(std::move(config_proof_))
+  , signatures_(std::move(signatures_))
+{}
+
+const std::int32_t liteServer_blockLinkForward::ID;
+
+object_ptr<liteServer_BlockLink> liteServer_blockLinkForward::fetch(td::TlParser &p) {
+  return make_object<liteServer_blockLinkForward>(p);
+}
+
+liteServer_blockLinkForward::liteServer_blockLinkForward(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : to_key_block_(TlFetchBool::parse(p))
+  , from_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , to_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , dest_proof_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , config_proof_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , signatures_(TlFetchBoxed<TlFetchObject<liteServer_signatureSet>, -163272986>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_blockLinkForward::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBool::store(to_key_block_, s);
+  TlStoreObject::store(from_, s);
+  TlStoreObject::store(to_, s);
+  TlStoreString::store(dest_proof_, s);
+  TlStoreString::store(config_proof_, s);
+  TlStoreBoxed<TlStoreObject, -163272986>::store(signatures_, s);
+}
+
+void liteServer_blockLinkForward::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBool::store(to_key_block_, s);
+  TlStoreObject::store(from_, s);
+  TlStoreObject::store(to_, s);
+  TlStoreString::store(dest_proof_, s);
+  TlStoreString::store(config_proof_, s);
+  TlStoreBoxed<TlStoreObject, -163272986>::store(signatures_, s);
+}
+
+void liteServer_blockLinkForward::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_blockLinkForward");
+    s.store_field("to_key_block", to_key_block_);
+    if (from_ == nullptr) { s.store_field("from", "null"); } else { from_->store(s, "from"); }
+    if (to_ == nullptr) { s.store_field("to", "null"); } else { to_->store(s, "to"); }
+    s.store_bytes_field("dest_proof", dest_proof_);
+    s.store_bytes_field("config_proof", config_proof_);
+    if (signatures_ == nullptr) { s.store_field("signatures", "null"); } else { signatures_->store(s, "signatures"); }
+    s.store_class_end();
+  }
+}
+
+liteServer_blockState::liteServer_blockState()
+  : id_()
+  , root_hash_()
+  , file_hash_()
+  , data_()
+{}
+
+liteServer_blockState::liteServer_blockState(object_ptr<tonNode_blockIdExt> &&id_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_, td::BufferSlice &&data_)
+  : id_(std::move(id_))
+  , root_hash_(root_hash_)
+  , file_hash_(file_hash_)
+  , data_(std::move(data_))
+{}
+
+const std::int32_t liteServer_blockState::ID;
+
+object_ptr<liteServer_blockState> liteServer_blockState::fetch(td::TlParser &p) {
+  return make_object<liteServer_blockState>(p);
+}
+
+liteServer_blockState::liteServer_blockState(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , root_hash_(TlFetchInt256::parse(p))
+  , file_hash_(TlFetchInt256::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_blockState::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+  TlStoreString::store(data_, s);
+}
+
+void liteServer_blockState::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+  TlStoreString::store(data_, s);
+}
+
+void liteServer_blockState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_blockState");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("root_hash", root_hash_);
+    s.store_field("file_hash", file_hash_);
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+liteServer_blockTransactions::liteServer_blockTransactions()
+  : id_()
+  , req_count_()
+  , incomplete_()
+  , ids_()
+  , proof_()
+{}
+
+liteServer_blockTransactions::liteServer_blockTransactions(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t req_count_, bool incomplete_, std::vector<object_ptr<liteServer_transactionId>> &&ids_, td::BufferSlice &&proof_)
+  : id_(std::move(id_))
+  , req_count_(req_count_)
+  , incomplete_(incomplete_)
+  , ids_(std::move(ids_))
+  , proof_(std::move(proof_))
+{}
+
+const std::int32_t liteServer_blockTransactions::ID;
+
+object_ptr<liteServer_blockTransactions> liteServer_blockTransactions::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_blockTransactions> res = make_object<liteServer_blockTransactions>();
+  std::int32_t var0;
+  res->id_ = TlFetchObject<tonNode_blockIdExt>::parse(p);
+  if ((var0 = res->req_count_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  res->incomplete_ = TlFetchBool::parse(p);
+  res->ids_ = TlFetchVector<TlFetchObject<liteServer_transactionId>>::parse(p);
+  res->proof_ = TlFetchBytes<td::BufferSlice>::parse(p);
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_blockTransactions::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store((var0 = req_count_), s);
+  TlStoreBool::store(incomplete_, s);
+  TlStoreVector<TlStoreObject>::store(ids_, s);
+  TlStoreString::store(proof_, s);
+}
+
+void liteServer_blockTransactions::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store((var0 = req_count_), s);
+  TlStoreBool::store(incomplete_, s);
+  TlStoreVector<TlStoreObject>::store(ids_, s);
+  TlStoreString::store(proof_, s);
+}
+
+void liteServer_blockTransactions::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_blockTransactions");
+  std::int32_t var0;
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("req_count", (var0 = req_count_));
+    s.store_field("incomplete", incomplete_);
+    { const std::vector<object_ptr<liteServer_transactionId>> &v = ids_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("ids", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_bytes_field("proof", proof_);
+    s.store_class_end();
+  }
+}
+
+liteServer_configInfo::liteServer_configInfo()
+  : mode_()
+  , id_()
+  , state_proof_()
+  , config_proof_()
+{}
+
+liteServer_configInfo::liteServer_configInfo(std::int32_t mode_, object_ptr<tonNode_blockIdExt> &&id_, td::BufferSlice &&state_proof_, td::BufferSlice &&config_proof_)
+  : mode_(mode_)
+  , id_(std::move(id_))
+  , state_proof_(std::move(state_proof_))
+  , config_proof_(std::move(config_proof_))
+{}
+
+const std::int32_t liteServer_configInfo::ID;
+
+object_ptr<liteServer_configInfo> liteServer_configInfo::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_configInfo> res = make_object<liteServer_configInfo>();
+  std::int32_t var0;
+  if ((var0 = res->mode_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  res->id_ = TlFetchObject<tonNode_blockIdExt>::parse(p);
+  res->state_proof_ = TlFetchBytes<td::BufferSlice>::parse(p);
+  res->config_proof_ = TlFetchBytes<td::BufferSlice>::parse(p);
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_configInfo::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreObject::store(id_, s);
+  TlStoreString::store(state_proof_, s);
+  TlStoreString::store(config_proof_, s);
+}
+
+void liteServer_configInfo::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreObject::store(id_, s);
+  TlStoreString::store(state_proof_, s);
+  TlStoreString::store(config_proof_, s);
+}
+
+void liteServer_configInfo::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_configInfo");
+  std::int32_t var0;
+    s.store_field("mode", (var0 = mode_));
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_bytes_field("state_proof", state_proof_);
+    s.store_bytes_field("config_proof", config_proof_);
+    s.store_class_end();
+  }
+}
+
+liteServer_currentTime::liteServer_currentTime()
+  : now_()
+{}
+
+liteServer_currentTime::liteServer_currentTime(std::int32_t now_)
+  : now_(now_)
+{}
+
+const std::int32_t liteServer_currentTime::ID;
+
+object_ptr<liteServer_currentTime> liteServer_currentTime::fetch(td::TlParser &p) {
+  return make_object<liteServer_currentTime>(p);
+}
+
+liteServer_currentTime::liteServer_currentTime(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : now_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void liteServer_currentTime::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(now_, s);
+}
+
+void liteServer_currentTime::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(now_, s);
+}
+
+void liteServer_currentTime::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_currentTime");
+    s.store_field("now", now_);
+    s.store_class_end();
+  }
+}
+
+liteServer_error::liteServer_error()
+  : code_()
+  , message_()
+{}
+
+liteServer_error::liteServer_error(std::int32_t code_, std::string const &message_)
+  : code_(code_)
+  , message_(std::move(message_))
+{}
+
+const std::int32_t liteServer_error::ID;
+
+object_ptr<liteServer_error> liteServer_error::fetch(td::TlParser &p) {
+  return make_object<liteServer_error>(p);
+}
+
+liteServer_error::liteServer_error(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : code_(TlFetchInt::parse(p))
+  , message_(TlFetchString<std::string>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_error::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(code_, s);
+  TlStoreString::store(message_, s);
+}
+
+void liteServer_error::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(code_, s);
+  TlStoreString::store(message_, s);
+}
+
+void liteServer_error::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_error");
+    s.store_field("code", code_);
+    s.store_field("message", message_);
+    s.store_class_end();
+  }
+}
+
+liteServer_masterchainInfo::liteServer_masterchainInfo()
+  : last_()
+  , state_root_hash_()
+  , init_()
+{}
+
+liteServer_masterchainInfo::liteServer_masterchainInfo(object_ptr<tonNode_blockIdExt> &&last_, td::Bits256 const &state_root_hash_, object_ptr<tonNode_zeroStateIdExt> &&init_)
+  : last_(std::move(last_))
+  , state_root_hash_(state_root_hash_)
+  , init_(std::move(init_))
+{}
+
+const std::int32_t liteServer_masterchainInfo::ID;
+
+object_ptr<liteServer_masterchainInfo> liteServer_masterchainInfo::fetch(td::TlParser &p) {
+  return make_object<liteServer_masterchainInfo>(p);
+}
+
+liteServer_masterchainInfo::liteServer_masterchainInfo(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : last_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , state_root_hash_(TlFetchInt256::parse(p))
+  , init_(TlFetchObject<tonNode_zeroStateIdExt>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_masterchainInfo::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(last_, s);
+  TlStoreBinary::store(state_root_hash_, s);
+  TlStoreObject::store(init_, s);
+}
+
+void liteServer_masterchainInfo::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(last_, s);
+  TlStoreBinary::store(state_root_hash_, s);
+  TlStoreObject::store(init_, s);
+}
+
+void liteServer_masterchainInfo::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_masterchainInfo");
+    if (last_ == nullptr) { s.store_field("last", "null"); } else { last_->store(s, "last"); }
+    s.store_field("state_root_hash", state_root_hash_);
+    if (init_ == nullptr) { s.store_field("init", "null"); } else { init_->store(s, "init"); }
+    s.store_class_end();
+  }
+}
+
+liteServer_masterchainInfoExt::liteServer_masterchainInfoExt()
+  : mode_()
+  , version_()
+  , capabilities_()
+  , last_()
+  , last_utime_()
+  , now_()
+  , state_root_hash_()
+  , init_()
+{}
+
+liteServer_masterchainInfoExt::liteServer_masterchainInfoExt(std::int32_t mode_, std::int32_t version_, std::int64_t capabilities_, object_ptr<tonNode_blockIdExt> &&last_, std::int32_t last_utime_, std::int32_t now_, td::Bits256 const &state_root_hash_, object_ptr<tonNode_zeroStateIdExt> &&init_)
+  : mode_(mode_)
+  , version_(version_)
+  , capabilities_(capabilities_)
+  , last_(std::move(last_))
+  , last_utime_(last_utime_)
+  , now_(now_)
+  , state_root_hash_(state_root_hash_)
+  , init_(std::move(init_))
+{}
+
+const std::int32_t liteServer_masterchainInfoExt::ID;
+
+object_ptr<liteServer_masterchainInfoExt> liteServer_masterchainInfoExt::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_masterchainInfoExt> res = make_object<liteServer_masterchainInfoExt>();
+  std::int32_t var0;
+  if ((var0 = res->mode_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  res->version_ = TlFetchInt::parse(p);
+  res->capabilities_ = TlFetchLong::parse(p);
+  res->last_ = TlFetchObject<tonNode_blockIdExt>::parse(p);
+  res->last_utime_ = TlFetchInt::parse(p);
+  res->now_ = TlFetchInt::parse(p);
+  res->state_root_hash_ = TlFetchInt256::parse(p);
+  res->init_ = TlFetchObject<tonNode_zeroStateIdExt>::parse(p);
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_masterchainInfoExt::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreBinary::store(version_, s);
+  TlStoreBinary::store(capabilities_, s);
+  TlStoreObject::store(last_, s);
+  TlStoreBinary::store(last_utime_, s);
+  TlStoreBinary::store(now_, s);
+  TlStoreBinary::store(state_root_hash_, s);
+  TlStoreObject::store(init_, s);
+}
+
+void liteServer_masterchainInfoExt::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreBinary::store(version_, s);
+  TlStoreBinary::store(capabilities_, s);
+  TlStoreObject::store(last_, s);
+  TlStoreBinary::store(last_utime_, s);
+  TlStoreBinary::store(now_, s);
+  TlStoreBinary::store(state_root_hash_, s);
+  TlStoreObject::store(init_, s);
+}
+
+void liteServer_masterchainInfoExt::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_masterchainInfoExt");
+  std::int32_t var0;
+    s.store_field("mode", (var0 = mode_));
+    s.store_field("version", version_);
+    s.store_field("capabilities", capabilities_);
+    if (last_ == nullptr) { s.store_field("last", "null"); } else { last_->store(s, "last"); }
+    s.store_field("last_utime", last_utime_);
+    s.store_field("now", now_);
+    s.store_field("state_root_hash", state_root_hash_);
+    if (init_ == nullptr) { s.store_field("init", "null"); } else { init_->store(s, "init"); }
+    s.store_class_end();
+  }
+}
+
+liteServer_partialBlockProof::liteServer_partialBlockProof()
+  : complete_()
+  , from_()
+  , to_()
+  , steps_()
+{}
+
+liteServer_partialBlockProof::liteServer_partialBlockProof(bool complete_, object_ptr<tonNode_blockIdExt> &&from_, object_ptr<tonNode_blockIdExt> &&to_, std::vector<object_ptr<liteServer_BlockLink>> &&steps_)
+  : complete_(complete_)
+  , from_(std::move(from_))
+  , to_(std::move(to_))
+  , steps_(std::move(steps_))
+{}
+
+const std::int32_t liteServer_partialBlockProof::ID;
+
+object_ptr<liteServer_partialBlockProof> liteServer_partialBlockProof::fetch(td::TlParser &p) {
+  return make_object<liteServer_partialBlockProof>(p);
+}
+
+liteServer_partialBlockProof::liteServer_partialBlockProof(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : complete_(TlFetchBool::parse(p))
+  , from_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , to_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , steps_(TlFetchVector<TlFetchObject<liteServer_BlockLink>>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_partialBlockProof::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBool::store(complete_, s);
+  TlStoreObject::store(from_, s);
+  TlStoreObject::store(to_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(steps_, s);
+}
+
+void liteServer_partialBlockProof::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBool::store(complete_, s);
+  TlStoreObject::store(from_, s);
+  TlStoreObject::store(to_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(steps_, s);
+}
+
+void liteServer_partialBlockProof::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_partialBlockProof");
+    s.store_field("complete", complete_);
+    if (from_ == nullptr) { s.store_field("from", "null"); } else { from_->store(s, "from"); }
+    if (to_ == nullptr) { s.store_field("to", "null"); } else { to_->store(s, "to"); }
+    { const std::vector<object_ptr<liteServer_BlockLink>> &v = steps_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("steps", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+liteServer_sendMsgStatus::liteServer_sendMsgStatus()
+  : status_()
+{}
+
+liteServer_sendMsgStatus::liteServer_sendMsgStatus(std::int32_t status_)
+  : status_(status_)
+{}
+
+const std::int32_t liteServer_sendMsgStatus::ID;
+
+object_ptr<liteServer_sendMsgStatus> liteServer_sendMsgStatus::fetch(td::TlParser &p) {
+  return make_object<liteServer_sendMsgStatus>(p);
+}
+
+liteServer_sendMsgStatus::liteServer_sendMsgStatus(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : status_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void liteServer_sendMsgStatus::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(status_, s);
+}
+
+void liteServer_sendMsgStatus::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(status_, s);
+}
+
+void liteServer_sendMsgStatus::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_sendMsgStatus");
+    s.store_field("status", status_);
+    s.store_class_end();
+  }
+}
+
+liteServer_shardInfo::liteServer_shardInfo()
+  : id_()
+  , shardblk_()
+  , shard_proof_()
+  , shard_descr_()
+{}
+
+liteServer_shardInfo::liteServer_shardInfo(object_ptr<tonNode_blockIdExt> &&id_, object_ptr<tonNode_blockIdExt> &&shardblk_, td::BufferSlice &&shard_proof_, td::BufferSlice &&shard_descr_)
+  : id_(std::move(id_))
+  , shardblk_(std::move(shardblk_))
+  , shard_proof_(std::move(shard_proof_))
+  , shard_descr_(std::move(shard_descr_))
+{}
+
+const std::int32_t liteServer_shardInfo::ID;
+
+object_ptr<liteServer_shardInfo> liteServer_shardInfo::fetch(td::TlParser &p) {
+  return make_object<liteServer_shardInfo>(p);
+}
+
+liteServer_shardInfo::liteServer_shardInfo(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , shardblk_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , shard_proof_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , shard_descr_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_shardInfo::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreObject::store(shardblk_, s);
+  TlStoreString::store(shard_proof_, s);
+  TlStoreString::store(shard_descr_, s);
+}
+
+void liteServer_shardInfo::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreObject::store(shardblk_, s);
+  TlStoreString::store(shard_proof_, s);
+  TlStoreString::store(shard_descr_, s);
+}
+
+void liteServer_shardInfo::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_shardInfo");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    if (shardblk_ == nullptr) { s.store_field("shardblk", "null"); } else { shardblk_->store(s, "shardblk"); }
+    s.store_bytes_field("shard_proof", shard_proof_);
+    s.store_bytes_field("shard_descr", shard_descr_);
+    s.store_class_end();
+  }
+}
+
+liteServer_signature::liteServer_signature()
+  : node_id_short_()
+  , signature_()
+{}
+
+liteServer_signature::liteServer_signature(td::Bits256 const &node_id_short_, td::BufferSlice &&signature_)
+  : node_id_short_(node_id_short_)
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t liteServer_signature::ID;
+
+object_ptr<liteServer_signature> liteServer_signature::fetch(td::TlParser &p) {
+  return make_object<liteServer_signature>(p);
+}
+
+liteServer_signature::liteServer_signature(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : node_id_short_(TlFetchInt256::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_signature::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(node_id_short_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void liteServer_signature::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(node_id_short_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void liteServer_signature::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_signature");
+    s.store_field("node_id_short", node_id_short_);
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+liteServer_signatureSet::liteServer_signatureSet()
+  : validator_set_hash_()
+  , catchain_seqno_()
+  , signatures_()
+{}
+
+liteServer_signatureSet::liteServer_signatureSet(std::int32_t validator_set_hash_, std::int32_t catchain_seqno_, std::vector<object_ptr<liteServer_signature>> &&signatures_)
+  : validator_set_hash_(validator_set_hash_)
+  , catchain_seqno_(catchain_seqno_)
+  , signatures_(std::move(signatures_))
+{}
+
+const std::int32_t liteServer_signatureSet::ID;
+
+object_ptr<liteServer_signatureSet> liteServer_signatureSet::fetch(td::TlParser &p) {
+  return make_object<liteServer_signatureSet>(p);
+}
+
+liteServer_signatureSet::liteServer_signatureSet(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : validator_set_hash_(TlFetchInt::parse(p))
+  , catchain_seqno_(TlFetchInt::parse(p))
+  , signatures_(TlFetchVector<TlFetchObject<liteServer_signature>>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_signatureSet::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(validator_set_hash_, s);
+  TlStoreBinary::store(catchain_seqno_, s);
+  TlStoreVector<TlStoreObject>::store(signatures_, s);
+}
+
+void liteServer_signatureSet::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(validator_set_hash_, s);
+  TlStoreBinary::store(catchain_seqno_, s);
+  TlStoreVector<TlStoreObject>::store(signatures_, s);
+}
+
+void liteServer_signatureSet::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_signatureSet");
+    s.store_field("validator_set_hash", validator_set_hash_);
+    s.store_field("catchain_seqno", catchain_seqno_);
+    { const std::vector<object_ptr<liteServer_signature>> &v = signatures_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("signatures", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+liteServer_transactionId::liteServer_transactionId()
+  : mode_()
+  , account_()
+  , lt_()
+  , hash_()
+{}
+
+liteServer_transactionId::liteServer_transactionId(std::int32_t mode_, td::Bits256 const &account_, std::int64_t lt_, td::Bits256 const &hash_)
+  : mode_(mode_)
+  , account_(account_)
+  , lt_(lt_)
+  , hash_(hash_)
+{}
+
+const std::int32_t liteServer_transactionId::ID;
+
+object_ptr<liteServer_transactionId> liteServer_transactionId::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_transactionId> res = make_object<liteServer_transactionId>();
+  std::int32_t var0;
+  if ((var0 = res->mode_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  if (var0 & 1) { res->account_ = TlFetchInt256::parse(p); }
+  if (var0 & 2) { res->lt_ = TlFetchLong::parse(p); }
+  if (var0 & 4) { res->hash_ = TlFetchInt256::parse(p); }
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_transactionId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreBinary::store((var0 = mode_), s);
+  if (var0 & 1) { TlStoreBinary::store(account_, s); }
+  if (var0 & 2) { TlStoreBinary::store(lt_, s); }
+  if (var0 & 4) { TlStoreBinary::store(hash_, s); }
+}
+
+void liteServer_transactionId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreBinary::store((var0 = mode_), s);
+  if (var0 & 1) { TlStoreBinary::store(account_, s); }
+  if (var0 & 2) { TlStoreBinary::store(lt_, s); }
+  if (var0 & 4) { TlStoreBinary::store(hash_, s); }
+}
+
+void liteServer_transactionId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_transactionId");
+  std::int32_t var0;
+    s.store_field("mode", (var0 = mode_));
+    if (var0 & 1) { s.store_field("account", account_); }
+    if (var0 & 2) { s.store_field("lt", lt_); }
+    if (var0 & 4) { s.store_field("hash", hash_); }
+    s.store_class_end();
+  }
+}
+
+liteServer_transactionId3::liteServer_transactionId3()
+  : account_()
+  , lt_()
+{}
+
+liteServer_transactionId3::liteServer_transactionId3(td::Bits256 const &account_, std::int64_t lt_)
+  : account_(account_)
+  , lt_(lt_)
+{}
+
+const std::int32_t liteServer_transactionId3::ID;
+
+object_ptr<liteServer_transactionId3> liteServer_transactionId3::fetch(td::TlParser &p) {
+  return make_object<liteServer_transactionId3>(p);
+}
+
+liteServer_transactionId3::liteServer_transactionId3(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : account_(TlFetchInt256::parse(p))
+  , lt_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void liteServer_transactionId3::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(account_, s);
+  TlStoreBinary::store(lt_, s);
+}
+
+void liteServer_transactionId3::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(account_, s);
+  TlStoreBinary::store(lt_, s);
+}
+
+void liteServer_transactionId3::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_transactionId3");
+    s.store_field("account", account_);
+    s.store_field("lt", lt_);
+    s.store_class_end();
+  }
+}
+
+liteServer_transactionInfo::liteServer_transactionInfo()
+  : id_()
+  , proof_()
+  , transaction_()
+{}
+
+liteServer_transactionInfo::liteServer_transactionInfo(object_ptr<tonNode_blockIdExt> &&id_, td::BufferSlice &&proof_, td::BufferSlice &&transaction_)
+  : id_(std::move(id_))
+  , proof_(std::move(proof_))
+  , transaction_(std::move(transaction_))
+{}
+
+const std::int32_t liteServer_transactionInfo::ID;
+
+object_ptr<liteServer_transactionInfo> liteServer_transactionInfo::fetch(td::TlParser &p) {
+  return make_object<liteServer_transactionInfo>(p);
+}
+
+liteServer_transactionInfo::liteServer_transactionInfo(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , proof_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , transaction_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_transactionInfo::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreString::store(proof_, s);
+  TlStoreString::store(transaction_, s);
+}
+
+void liteServer_transactionInfo::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreString::store(proof_, s);
+  TlStoreString::store(transaction_, s);
+}
+
+void liteServer_transactionInfo::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_transactionInfo");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_bytes_field("proof", proof_);
+    s.store_bytes_field("transaction", transaction_);
+    s.store_class_end();
+  }
+}
+
+liteServer_transactionList::liteServer_transactionList()
+  : ids_()
+  , transactions_()
+{}
+
+liteServer_transactionList::liteServer_transactionList(std::vector<object_ptr<tonNode_blockIdExt>> &&ids_, td::BufferSlice &&transactions_)
+  : ids_(std::move(ids_))
+  , transactions_(std::move(transactions_))
+{}
+
+const std::int32_t liteServer_transactionList::ID;
+
+object_ptr<liteServer_transactionList> liteServer_transactionList::fetch(td::TlParser &p) {
+  return make_object<liteServer_transactionList>(p);
+}
+
+liteServer_transactionList::liteServer_transactionList(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : ids_(TlFetchVector<TlFetchObject<tonNode_blockIdExt>>::parse(p))
+  , transactions_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_transactionList::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(ids_, s);
+  TlStoreString::store(transactions_, s);
+}
+
+void liteServer_transactionList::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(ids_, s);
+  TlStoreString::store(transactions_, s);
+}
+
+void liteServer_transactionList::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_transactionList");
+    { const std::vector<object_ptr<tonNode_blockIdExt>> &v = ids_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("ids", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_bytes_field("transactions", transactions_);
+    s.store_class_end();
+  }
+}
+
+liteServer_version::liteServer_version()
+  : mode_()
+  , version_()
+  , capabilities_()
+  , now_()
+{}
+
+liteServer_version::liteServer_version(std::int32_t mode_, std::int32_t version_, std::int64_t capabilities_, std::int32_t now_)
+  : mode_(mode_)
+  , version_(version_)
+  , capabilities_(capabilities_)
+  , now_(now_)
+{}
+
+const std::int32_t liteServer_version::ID;
+
+object_ptr<liteServer_version> liteServer_version::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_version> res = make_object<liteServer_version>();
+  std::int32_t var0;
+  if ((var0 = res->mode_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  res->version_ = TlFetchInt::parse(p);
+  res->capabilities_ = TlFetchLong::parse(p);
+  res->now_ = TlFetchInt::parse(p);
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_version::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreBinary::store(version_, s);
+  TlStoreBinary::store(capabilities_, s);
+  TlStoreBinary::store(now_, s);
+}
+
+void liteServer_version::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreBinary::store(version_, s);
+  TlStoreBinary::store(capabilities_, s);
+  TlStoreBinary::store(now_, s);
+}
+
+void liteServer_version::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_version");
+  std::int32_t var0;
+    s.store_field("mode", (var0 = mode_));
+    s.store_field("version", version_);
+    s.store_field("capabilities", capabilities_);
+    s.store_field("now", now_);
+    s.store_class_end();
+  }
+}
+
+liteServer_debug_verbosity::liteServer_debug_verbosity()
+  : value_()
+{}
+
+liteServer_debug_verbosity::liteServer_debug_verbosity(std::int32_t value_)
+  : value_(value_)
+{}
+
+const std::int32_t liteServer_debug_verbosity::ID;
+
+object_ptr<liteServer_debug_verbosity> liteServer_debug_verbosity::fetch(td::TlParser &p) {
+  return make_object<liteServer_debug_verbosity>(p);
+}
+
+liteServer_debug_verbosity::liteServer_debug_verbosity(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void liteServer_debug_verbosity::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+}
+
+void liteServer_debug_verbosity::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+}
+
+void liteServer_debug_verbosity::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_debug_verbosity");
+    s.store_field("value", value_);
+    s.store_class_end();
+  }
+}
+
+tonNode_blockId::tonNode_blockId()
+  : workchain_()
+  , shard_()
+  , seqno_()
+{}
+
+tonNode_blockId::tonNode_blockId(std::int32_t workchain_, std::int64_t shard_, std::int32_t seqno_)
+  : workchain_(workchain_)
+  , shard_(shard_)
+  , seqno_(seqno_)
+{}
+
+const std::int32_t tonNode_blockId::ID;
+
+object_ptr<tonNode_blockId> tonNode_blockId::fetch(td::TlParser &p) {
+  return make_object<tonNode_blockId>(p);
+}
+
+tonNode_blockId::tonNode_blockId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : workchain_(TlFetchInt::parse(p))
+  , shard_(TlFetchLong::parse(p))
+  , seqno_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void tonNode_blockId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(seqno_, s);
+}
+
+void tonNode_blockId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(seqno_, s);
+}
+
+void tonNode_blockId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_blockId");
+    s.store_field("workchain", workchain_);
+    s.store_field("shard", shard_);
+    s.store_field("seqno", seqno_);
+    s.store_class_end();
+  }
+}
+
+tonNode_blockIdExt::tonNode_blockIdExt()
+  : workchain_()
+  , shard_()
+  , seqno_()
+  , root_hash_()
+  , file_hash_()
+{}
+
+tonNode_blockIdExt::tonNode_blockIdExt(std::int32_t workchain_, std::int64_t shard_, std::int32_t seqno_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_)
+  : workchain_(workchain_)
+  , shard_(shard_)
+  , seqno_(seqno_)
+  , root_hash_(root_hash_)
+  , file_hash_(file_hash_)
+{}
+
+const std::int32_t tonNode_blockIdExt::ID;
+
+object_ptr<tonNode_blockIdExt> tonNode_blockIdExt::fetch(td::TlParser &p) {
+  return make_object<tonNode_blockIdExt>(p);
+}
+
+tonNode_blockIdExt::tonNode_blockIdExt(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : workchain_(TlFetchInt::parse(p))
+  , shard_(TlFetchLong::parse(p))
+  , seqno_(TlFetchInt::parse(p))
+  , root_hash_(TlFetchInt256::parse(p))
+  , file_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void tonNode_blockIdExt::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void tonNode_blockIdExt::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void tonNode_blockIdExt::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_blockIdExt");
+    s.store_field("workchain", workchain_);
+    s.store_field("shard", shard_);
+    s.store_field("seqno", seqno_);
+    s.store_field("root_hash", root_hash_);
+    s.store_field("file_hash", file_hash_);
+    s.store_class_end();
+  }
+}
+
+tonNode_zeroStateIdExt::tonNode_zeroStateIdExt()
+  : workchain_()
+  , root_hash_()
+  , file_hash_()
+{}
+
+tonNode_zeroStateIdExt::tonNode_zeroStateIdExt(std::int32_t workchain_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_)
+  : workchain_(workchain_)
+  , root_hash_(root_hash_)
+  , file_hash_(file_hash_)
+{}
+
+const std::int32_t tonNode_zeroStateIdExt::ID;
+
+object_ptr<tonNode_zeroStateIdExt> tonNode_zeroStateIdExt::fetch(td::TlParser &p) {
+  return make_object<tonNode_zeroStateIdExt>(p);
+}
+
+tonNode_zeroStateIdExt::tonNode_zeroStateIdExt(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : workchain_(TlFetchInt::parse(p))
+  , root_hash_(TlFetchInt256::parse(p))
+  , file_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void tonNode_zeroStateIdExt::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void tonNode_zeroStateIdExt::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void tonNode_zeroStateIdExt::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_zeroStateIdExt");
+    s.store_field("workchain", workchain_);
+    s.store_field("root_hash", root_hash_);
+    s.store_field("file_hash", file_hash_);
+    s.store_class_end();
+  }
+}
+
+liteServer_getAccountState::liteServer_getAccountState()
+  : id_()
+  , account_()
+{}
+
+liteServer_getAccountState::liteServer_getAccountState(object_ptr<tonNode_blockIdExt> &&id_, object_ptr<liteServer_accountId> &&account_)
+  : id_(std::move(id_))
+  , account_(std::move(account_))
+{}
+
+const std::int32_t liteServer_getAccountState::ID;
+
+object_ptr<liteServer_getAccountState> liteServer_getAccountState::fetch(td::TlParser &p) {
+  return make_object<liteServer_getAccountState>(p);
+}
+
+liteServer_getAccountState::liteServer_getAccountState(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , account_(TlFetchObject<liteServer_accountId>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_getAccountState::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1804144165);
+  TlStoreObject::store(id_, s);
+  TlStoreObject::store(account_, s);
+}
+
+void liteServer_getAccountState::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1804144165);
+  TlStoreObject::store(id_, s);
+  TlStoreObject::store(account_, s);
+}
+
+void liteServer_getAccountState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getAccountState");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    if (account_ == nullptr) { s.store_field("account", "null"); } else { account_->store(s, "account"); }
+    s.store_class_end();
+  }
+}
+
+liteServer_getAccountState::ReturnType liteServer_getAccountState::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_accountState>, 1887029073>::parse(p);
+#undef FAIL
+}
+
+liteServer_getAllShardsInfo::liteServer_getAllShardsInfo()
+  : id_()
+{}
+
+liteServer_getAllShardsInfo::liteServer_getAllShardsInfo(object_ptr<tonNode_blockIdExt> &&id_)
+  : id_(std::move(id_))
+{}
+
+const std::int32_t liteServer_getAllShardsInfo::ID;
+
+object_ptr<liteServer_getAllShardsInfo> liteServer_getAllShardsInfo::fetch(td::TlParser &p) {
+  return make_object<liteServer_getAllShardsInfo>(p);
+}
+
+liteServer_getAllShardsInfo::liteServer_getAllShardsInfo(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_getAllShardsInfo::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1960050027);
+  TlStoreObject::store(id_, s);
+}
+
+void liteServer_getAllShardsInfo::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1960050027);
+  TlStoreObject::store(id_, s);
+}
+
+void liteServer_getAllShardsInfo::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getAllShardsInfo");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_class_end();
+  }
+}
+
+liteServer_getAllShardsInfo::ReturnType liteServer_getAllShardsInfo::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_allShardsInfo>, 160425773>::parse(p);
+#undef FAIL
+}
+
+liteServer_getBlock::liteServer_getBlock()
+  : id_()
+{}
+
+liteServer_getBlock::liteServer_getBlock(object_ptr<tonNode_blockIdExt> &&id_)
+  : id_(std::move(id_))
+{}
+
+const std::int32_t liteServer_getBlock::ID;
+
+object_ptr<liteServer_getBlock> liteServer_getBlock::fetch(td::TlParser &p) {
+  return make_object<liteServer_getBlock>(p);
+}
+
+liteServer_getBlock::liteServer_getBlock(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_getBlock::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1668796173);
+  TlStoreObject::store(id_, s);
+}
+
+void liteServer_getBlock::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1668796173);
+  TlStoreObject::store(id_, s);
+}
+
+void liteServer_getBlock::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getBlock");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_class_end();
+  }
+}
+
+liteServer_getBlock::ReturnType liteServer_getBlock::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_blockData>, -1519063700>::parse(p);
+#undef FAIL
+}
+
+liteServer_getBlockHeader::liteServer_getBlockHeader()
+  : id_()
+  , mode_()
+{}
+
+liteServer_getBlockHeader::liteServer_getBlockHeader(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t mode_)
+  : id_(std::move(id_))
+  , mode_(mode_)
+{}
+
+const std::int32_t liteServer_getBlockHeader::ID;
+
+object_ptr<liteServer_getBlockHeader> liteServer_getBlockHeader::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_getBlockHeader> res = make_object<liteServer_getBlockHeader>();
+  std::int32_t var0;
+  res->id_ = TlFetchObject<tonNode_blockIdExt>::parse(p);
+  if ((var0 = res->mode_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_getBlockHeader::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(569116318);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store((var0 = mode_), s);
+}
+
+void liteServer_getBlockHeader::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(569116318);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store((var0 = mode_), s);
+}
+
+void liteServer_getBlockHeader::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getBlockHeader");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("mode", (var0 = mode_));
+    s.store_class_end();
+  }
+}
+
+liteServer_getBlockHeader::ReturnType liteServer_getBlockHeader::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_blockHeader>, 1965916697>::parse(p);
+#undef FAIL
+}
+
+liteServer_getBlockProof::liteServer_getBlockProof()
+  : mode_()
+  , known_block_()
+  , target_block_()
+{}
+
+liteServer_getBlockProof::liteServer_getBlockProof(std::int32_t mode_, object_ptr<tonNode_blockIdExt> &&known_block_, object_ptr<tonNode_blockIdExt> &&target_block_)
+  : mode_(mode_)
+  , known_block_(std::move(known_block_))
+  , target_block_(std::move(target_block_))
+{}
+
+const std::int32_t liteServer_getBlockProof::ID;
+
+object_ptr<liteServer_getBlockProof> liteServer_getBlockProof::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_getBlockProof> res = make_object<liteServer_getBlockProof>();
+  std::int32_t var0;
+  if ((var0 = res->mode_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  res->known_block_ = TlFetchObject<tonNode_blockIdExt>::parse(p);
+  if (var0 & 1) { res->target_block_ = TlFetchObject<tonNode_blockIdExt>::parse(p); }
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_getBlockProof::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1964336060);
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreObject::store(known_block_, s);
+  if (var0 & 1) { TlStoreObject::store(target_block_, s); }
+}
+
+void liteServer_getBlockProof::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1964336060);
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreObject::store(known_block_, s);
+  if (var0 & 1) { TlStoreObject::store(target_block_, s); }
+}
+
+void liteServer_getBlockProof::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getBlockProof");
+    s.store_field("mode", (var0 = mode_));
+    if (known_block_ == nullptr) { s.store_field("known_block", "null"); } else { known_block_->store(s, "known_block"); }
+    if (var0 & 1) { if (target_block_ == nullptr) { s.store_field("target_block", "null"); } else { target_block_->store(s, "target_block"); } }
+    s.store_class_end();
+  }
+}
+
+liteServer_getBlockProof::ReturnType liteServer_getBlockProof::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_partialBlockProof>, -1898917183>::parse(p);
+#undef FAIL
+}
+
+liteServer_getConfigAll::liteServer_getConfigAll()
+  : mode_()
+  , id_()
+{}
+
+liteServer_getConfigAll::liteServer_getConfigAll(std::int32_t mode_, object_ptr<tonNode_blockIdExt> &&id_)
+  : mode_(mode_)
+  , id_(std::move(id_))
+{}
+
+const std::int32_t liteServer_getConfigAll::ID;
+
+object_ptr<liteServer_getConfigAll> liteServer_getConfigAll::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_getConfigAll> res = make_object<liteServer_getConfigAll>();
+  std::int32_t var0;
+  if ((var0 = res->mode_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  res->id_ = TlFetchObject<tonNode_blockIdExt>::parse(p);
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_getConfigAll::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1860491593);
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreObject::store(id_, s);
+}
+
+void liteServer_getConfigAll::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1860491593);
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreObject::store(id_, s);
+}
+
+void liteServer_getConfigAll::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getConfigAll");
+    s.store_field("mode", (var0 = mode_));
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_class_end();
+  }
+}
+
+liteServer_getConfigAll::ReturnType liteServer_getConfigAll::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_configInfo>, -1367660753>::parse(p);
+#undef FAIL
+}
+
+liteServer_getConfigParams::liteServer_getConfigParams()
+  : mode_()
+  , id_()
+  , param_list_()
+{}
+
+liteServer_getConfigParams::liteServer_getConfigParams(std::int32_t mode_, object_ptr<tonNode_blockIdExt> &&id_, std::vector<std::int32_t> &&param_list_)
+  : mode_(mode_)
+  , id_(std::move(id_))
+  , param_list_(std::move(param_list_))
+{}
+
+const std::int32_t liteServer_getConfigParams::ID;
+
+object_ptr<liteServer_getConfigParams> liteServer_getConfigParams::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_getConfigParams> res = make_object<liteServer_getConfigParams>();
+  std::int32_t var0;
+  if ((var0 = res->mode_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  res->id_ = TlFetchObject<tonNode_blockIdExt>::parse(p);
+  res->param_list_ = TlFetchVector<TlFetchInt>::parse(p);
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_getConfigParams::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(705764377);
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreObject::store(id_, s);
+  TlStoreVector<TlStoreBinary>::store(param_list_, s);
+}
+
+void liteServer_getConfigParams::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(705764377);
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreObject::store(id_, s);
+  TlStoreVector<TlStoreBinary>::store(param_list_, s);
+}
+
+void liteServer_getConfigParams::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getConfigParams");
+    s.store_field("mode", (var0 = mode_));
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    { const std::vector<std::int32_t> &v = param_list_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("param_list", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+liteServer_getConfigParams::ReturnType liteServer_getConfigParams::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_configInfo>, -1367660753>::parse(p);
+#undef FAIL
+}
+
+liteServer_getMasterchainInfo::liteServer_getMasterchainInfo() {
+}
+
+const std::int32_t liteServer_getMasterchainInfo::ID;
+
+object_ptr<liteServer_getMasterchainInfo> liteServer_getMasterchainInfo::fetch(td::TlParser &p) {
+  return make_object<liteServer_getMasterchainInfo>(p);
+}
+
+liteServer_getMasterchainInfo::liteServer_getMasterchainInfo(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void liteServer_getMasterchainInfo::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1984567762);
+}
+
+void liteServer_getMasterchainInfo::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1984567762);
+}
+
+void liteServer_getMasterchainInfo::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getMasterchainInfo");
+    s.store_class_end();
+  }
+}
+
+liteServer_getMasterchainInfo::ReturnType liteServer_getMasterchainInfo::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_masterchainInfo>, -2055001983>::parse(p);
+#undef FAIL
+}
+
+liteServer_getMasterchainInfoExt::liteServer_getMasterchainInfoExt()
+  : mode_()
+{}
+
+liteServer_getMasterchainInfoExt::liteServer_getMasterchainInfoExt(std::int32_t mode_)
+  : mode_(mode_)
+{}
+
+const std::int32_t liteServer_getMasterchainInfoExt::ID;
+
+object_ptr<liteServer_getMasterchainInfoExt> liteServer_getMasterchainInfoExt::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_getMasterchainInfoExt> res = make_object<liteServer_getMasterchainInfoExt>();
+  std::int32_t var0;
+  if ((var0 = res->mode_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_getMasterchainInfoExt::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1889956319);
+  TlStoreBinary::store((var0 = mode_), s);
+}
+
+void liteServer_getMasterchainInfoExt::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1889956319);
+  TlStoreBinary::store((var0 = mode_), s);
+}
+
+void liteServer_getMasterchainInfoExt::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getMasterchainInfoExt");
+    s.store_field("mode", (var0 = mode_));
+    s.store_class_end();
+  }
+}
+
+liteServer_getMasterchainInfoExt::ReturnType liteServer_getMasterchainInfoExt::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_masterchainInfoExt>, -1462968075>::parse(p);
+#undef FAIL
+}
+
+liteServer_getOneTransaction::liteServer_getOneTransaction()
+  : id_()
+  , account_()
+  , lt_()
+{}
+
+liteServer_getOneTransaction::liteServer_getOneTransaction(object_ptr<tonNode_blockIdExt> &&id_, object_ptr<liteServer_accountId> &&account_, std::int64_t lt_)
+  : id_(std::move(id_))
+  , account_(std::move(account_))
+  , lt_(lt_)
+{}
+
+const std::int32_t liteServer_getOneTransaction::ID;
+
+object_ptr<liteServer_getOneTransaction> liteServer_getOneTransaction::fetch(td::TlParser &p) {
+  return make_object<liteServer_getOneTransaction>(p);
+}
+
+liteServer_getOneTransaction::liteServer_getOneTransaction(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , account_(TlFetchObject<liteServer_accountId>::parse(p))
+  , lt_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void liteServer_getOneTransaction::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-737205014);
+  TlStoreObject::store(id_, s);
+  TlStoreObject::store(account_, s);
+  TlStoreBinary::store(lt_, s);
+}
+
+void liteServer_getOneTransaction::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-737205014);
+  TlStoreObject::store(id_, s);
+  TlStoreObject::store(account_, s);
+  TlStoreBinary::store(lt_, s);
+}
+
+void liteServer_getOneTransaction::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getOneTransaction");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    if (account_ == nullptr) { s.store_field("account", "null"); } else { account_->store(s, "account"); }
+    s.store_field("lt", lt_);
+    s.store_class_end();
+  }
+}
+
+liteServer_getOneTransaction::ReturnType liteServer_getOneTransaction::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_transactionInfo>, 249490759>::parse(p);
+#undef FAIL
+}
+
+liteServer_getShardInfo::liteServer_getShardInfo()
+  : id_()
+  , workchain_()
+  , shard_()
+  , exact_()
+{}
+
+liteServer_getShardInfo::liteServer_getShardInfo(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t workchain_, std::int64_t shard_, bool exact_)
+  : id_(std::move(id_))
+  , workchain_(workchain_)
+  , shard_(shard_)
+  , exact_(exact_)
+{}
+
+const std::int32_t liteServer_getShardInfo::ID;
+
+object_ptr<liteServer_getShardInfo> liteServer_getShardInfo::fetch(td::TlParser &p) {
+  return make_object<liteServer_getShardInfo>(p);
+}
+
+liteServer_getShardInfo::liteServer_getShardInfo(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , workchain_(TlFetchInt::parse(p))
+  , shard_(TlFetchLong::parse(p))
+  , exact_(TlFetchBool::parse(p))
+#undef FAIL
+{}
+
+void liteServer_getShardInfo::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1185084453);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBool::store(exact_, s);
+}
+
+void liteServer_getShardInfo::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1185084453);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBool::store(exact_, s);
+}
+
+void liteServer_getShardInfo::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getShardInfo");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("workchain", workchain_);
+    s.store_field("shard", shard_);
+    s.store_field("exact", exact_);
+    s.store_class_end();
+  }
+}
+
+liteServer_getShardInfo::ReturnType liteServer_getShardInfo::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_shardInfo>, -1612264060>::parse(p);
+#undef FAIL
+}
+
+liteServer_getState::liteServer_getState()
+  : id_()
+{}
+
+liteServer_getState::liteServer_getState(object_ptr<tonNode_blockIdExt> &&id_)
+  : id_(std::move(id_))
+{}
+
+const std::int32_t liteServer_getState::ID;
+
+object_ptr<liteServer_getState> liteServer_getState::fetch(td::TlParser &p) {
+  return make_object<liteServer_getState>(p);
+}
+
+liteServer_getState::liteServer_getState(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_getState::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1167184202);
+  TlStoreObject::store(id_, s);
+}
+
+void liteServer_getState::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1167184202);
+  TlStoreObject::store(id_, s);
+}
+
+void liteServer_getState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getState");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_class_end();
+  }
+}
+
+liteServer_getState::ReturnType liteServer_getState::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_blockState>, -1414669300>::parse(p);
+#undef FAIL
+}
+
+liteServer_getTime::liteServer_getTime() {
+}
+
+const std::int32_t liteServer_getTime::ID;
+
+object_ptr<liteServer_getTime> liteServer_getTime::fetch(td::TlParser &p) {
+  return make_object<liteServer_getTime>(p);
+}
+
+liteServer_getTime::liteServer_getTime(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void liteServer_getTime::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(380459572);
+}
+
+void liteServer_getTime::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(380459572);
+}
+
+void liteServer_getTime::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getTime");
+    s.store_class_end();
+  }
+}
+
+liteServer_getTime::ReturnType liteServer_getTime::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_currentTime>, -380436467>::parse(p);
+#undef FAIL
+}
+
+liteServer_getTransactions::liteServer_getTransactions()
+  : count_()
+  , account_()
+  , lt_()
+  , hash_()
+{}
+
+liteServer_getTransactions::liteServer_getTransactions(std::int32_t count_, object_ptr<liteServer_accountId> &&account_, std::int64_t lt_, td::Bits256 const &hash_)
+  : count_(count_)
+  , account_(std::move(account_))
+  , lt_(lt_)
+  , hash_(hash_)
+{}
+
+const std::int32_t liteServer_getTransactions::ID;
+
+object_ptr<liteServer_getTransactions> liteServer_getTransactions::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_getTransactions> res = make_object<liteServer_getTransactions>();
+  std::int32_t var0;
+  if ((var0 = res->count_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  res->account_ = TlFetchObject<liteServer_accountId>::parse(p);
+  res->lt_ = TlFetchLong::parse(p);
+  res->hash_ = TlFetchInt256::parse(p);
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_getTransactions::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(474015649);
+  TlStoreBinary::store((var0 = count_), s);
+  TlStoreObject::store(account_, s);
+  TlStoreBinary::store(lt_, s);
+  TlStoreBinary::store(hash_, s);
+}
+
+void liteServer_getTransactions::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(474015649);
+  TlStoreBinary::store((var0 = count_), s);
+  TlStoreObject::store(account_, s);
+  TlStoreBinary::store(lt_, s);
+  TlStoreBinary::store(hash_, s);
+}
+
+void liteServer_getTransactions::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getTransactions");
+    s.store_field("count", (var0 = count_));
+    if (account_ == nullptr) { s.store_field("account", "null"); } else { account_->store(s, "account"); }
+    s.store_field("lt", lt_);
+    s.store_field("hash", hash_);
+    s.store_class_end();
+  }
+}
+
+liteServer_getTransactions::ReturnType liteServer_getTransactions::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_transactionList>, 1864812043>::parse(p);
+#undef FAIL
+}
+
+liteServer_getVersion::liteServer_getVersion() {
+}
+
+const std::int32_t liteServer_getVersion::ID;
+
+object_ptr<liteServer_getVersion> liteServer_getVersion::fetch(td::TlParser &p) {
+  return make_object<liteServer_getVersion>(p);
+}
+
+liteServer_getVersion::liteServer_getVersion(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void liteServer_getVersion::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(590058507);
+}
+
+void liteServer_getVersion::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(590058507);
+}
+
+void liteServer_getVersion::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_getVersion");
+    s.store_class_end();
+  }
+}
+
+liteServer_getVersion::ReturnType liteServer_getVersion::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_version>, 1510248933>::parse(p);
+#undef FAIL
+}
+
+liteServer_listBlockTransactions::liteServer_listBlockTransactions()
+  : id_()
+  , mode_()
+  , count_()
+  , after_()
+  , reverse_order_()
+  , want_proof_()
+{}
+
+liteServer_listBlockTransactions::liteServer_listBlockTransactions(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t mode_, std::int32_t count_, object_ptr<liteServer_transactionId3> &&after_, bool reverse_order_, bool want_proof_)
+  : id_(std::move(id_))
+  , mode_(mode_)
+  , count_(count_)
+  , after_(std::move(after_))
+  , reverse_order_(reverse_order_)
+  , want_proof_(want_proof_)
+{}
+
+const std::int32_t liteServer_listBlockTransactions::ID;
+
+object_ptr<liteServer_listBlockTransactions> liteServer_listBlockTransactions::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_listBlockTransactions> res = make_object<liteServer_listBlockTransactions>();
+  std::int32_t var0;
+  std::int32_t var1;
+  res->id_ = TlFetchObject<tonNode_blockIdExt>::parse(p);
+  if ((var0 = res->mode_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  if ((var1 = res->count_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  if (var0 & 128) { res->after_ = TlFetchObject<liteServer_transactionId3>::parse(p); }
+  if (var0 & 64) { res->reverse_order_ = TlFetchTrue::parse(p); }
+  if (var0 & 32) { res->want_proof_ = TlFetchTrue::parse(p); }
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_listBlockTransactions::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1375942694);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreBinary::store((var1 = count_), s);
+  if (var0 & 128) { TlStoreObject::store(after_, s); }
+  if (var0 & 64) { TlStoreTrue::store(reverse_order_, s); }
+  if (var0 & 32) { TlStoreTrue::store(want_proof_, s); }
+}
+
+void liteServer_listBlockTransactions::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1375942694);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreBinary::store((var1 = count_), s);
+  if (var0 & 128) { TlStoreObject::store(after_, s); }
+  if (var0 & 64) { TlStoreTrue::store(reverse_order_, s); }
+  if (var0 & 32) { TlStoreTrue::store(want_proof_, s); }
+}
+
+void liteServer_listBlockTransactions::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_listBlockTransactions");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("mode", (var0 = mode_));
+    s.store_field("count", (var1 = count_));
+    if (var0 & 128) { if (after_ == nullptr) { s.store_field("after", "null"); } else { after_->store(s, "after"); } }
+    if (var0 & 64) {  }
+    if (var0 & 32) {  }
+    s.store_class_end();
+  }
+}
+
+liteServer_listBlockTransactions::ReturnType liteServer_listBlockTransactions::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_blockTransactions>, -1114854101>::parse(p);
+#undef FAIL
+}
+
+liteServer_lookupBlock::liteServer_lookupBlock()
+  : mode_()
+  , id_()
+  , lt_()
+  , utime_()
+{}
+
+liteServer_lookupBlock::liteServer_lookupBlock(std::int32_t mode_, object_ptr<tonNode_blockId> &&id_, std::int64_t lt_, std::int32_t utime_)
+  : mode_(mode_)
+  , id_(std::move(id_))
+  , lt_(lt_)
+  , utime_(utime_)
+{}
+
+const std::int32_t liteServer_lookupBlock::ID;
+
+object_ptr<liteServer_lookupBlock> liteServer_lookupBlock::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<liteServer_lookupBlock> res = make_object<liteServer_lookupBlock>();
+  std::int32_t var0;
+  if ((var0 = res->mode_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  res->id_ = TlFetchObject<tonNode_blockId>::parse(p);
+  if (var0 & 2) { res->lt_ = TlFetchLong::parse(p); }
+  if (var0 & 4) { res->utime_ = TlFetchInt::parse(p); }
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void liteServer_lookupBlock::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-87492834);
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreObject::store(id_, s);
+  if (var0 & 2) { TlStoreBinary::store(lt_, s); }
+  if (var0 & 4) { TlStoreBinary::store(utime_, s); }
+}
+
+void liteServer_lookupBlock::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-87492834);
+  TlStoreBinary::store((var0 = mode_), s);
+  TlStoreObject::store(id_, s);
+  if (var0 & 2) { TlStoreBinary::store(lt_, s); }
+  if (var0 & 4) { TlStoreBinary::store(utime_, s); }
+}
+
+void liteServer_lookupBlock::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_lookupBlock");
+    s.store_field("mode", (var0 = mode_));
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    if (var0 & 2) { s.store_field("lt", lt_); }
+    if (var0 & 4) { s.store_field("utime", utime_); }
+    s.store_class_end();
+  }
+}
+
+liteServer_lookupBlock::ReturnType liteServer_lookupBlock::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_blockHeader>, 1965916697>::parse(p);
+#undef FAIL
+}
+
+liteServer_query::liteServer_query()
+  : data_()
+{}
+
+liteServer_query::liteServer_query(td::BufferSlice &&data_)
+  : data_(std::move(data_))
+{}
+
+const std::int32_t liteServer_query::ID;
+
+object_ptr<liteServer_query> liteServer_query::fetch(td::TlParser &p) {
+  return make_object<liteServer_query>(p);
+}
+
+liteServer_query::liteServer_query(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_query::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(2039219935);
+  TlStoreString::store(data_, s);
+}
+
+void liteServer_query::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(2039219935);
+  TlStoreString::store(data_, s);
+}
+
+void liteServer_query::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_query");
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+liteServer_query::ReturnType liteServer_query::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<Object>, 695225504>::parse(p);
+#undef FAIL
+}
+
+liteServer_queryPrefix::liteServer_queryPrefix() {
+}
+
+const std::int32_t liteServer_queryPrefix::ID;
+
+object_ptr<liteServer_queryPrefix> liteServer_queryPrefix::fetch(td::TlParser &p) {
+  return make_object<liteServer_queryPrefix>(p);
+}
+
+liteServer_queryPrefix::liteServer_queryPrefix(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void liteServer_queryPrefix::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1926489734);
+}
+
+void liteServer_queryPrefix::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1926489734);
+}
+
+void liteServer_queryPrefix::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_queryPrefix");
+    s.store_class_end();
+  }
+}
+
+liteServer_queryPrefix::ReturnType liteServer_queryPrefix::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<Object>, 695225504>::parse(p);
+#undef FAIL
+}
+
+liteServer_sendMessage::liteServer_sendMessage()
+  : body_()
+{}
+
+liteServer_sendMessage::liteServer_sendMessage(td::BufferSlice &&body_)
+  : body_(std::move(body_))
+{}
+
+const std::int32_t liteServer_sendMessage::ID;
+
+object_ptr<liteServer_sendMessage> liteServer_sendMessage::fetch(td::TlParser &p) {
+  return make_object<liteServer_sendMessage>(p);
+}
+
+liteServer_sendMessage::liteServer_sendMessage(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : body_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void liteServer_sendMessage::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1762317442);
+  TlStoreString::store(body_, s);
+}
+
+void liteServer_sendMessage::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1762317442);
+  TlStoreString::store(body_, s);
+}
+
+void liteServer_sendMessage::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteServer_sendMessage");
+    s.store_bytes_field("body", body_);
+    s.store_class_end();
+  }
+}
+
+liteServer_sendMessage::ReturnType liteServer_sendMessage::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<liteServer_sendMsgStatus>, 961602967>::parse(p);
+#undef FAIL
+}
+}  // namespace lite_api
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl/generate/auto/tl/lite_api.h b/submodules/ton/tonlib-src/tl/generate/auto/tl/lite_api.h
new file mode 100644
index 0000000000..4dab1932cf
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/auto/tl/lite_api.h
@@ -0,0 +1,1485 @@
+#pragma once
+
+#include "tl/TlObject.h"
+
+#include "td/utils/int_types.h"
+
+#include <string>
+#include "td/utils/buffer.h"
+#include "crypto/common/bitstring.h"
+
+#include <cstdint>
+#include <memory>
+#include <utility>
+#include <vector>
+
+namespace td {
+class TlStorerCalcLength;
+}  // namespace td
+namespace td {
+class TlStorerUnsafe;
+}  // namespace td
+namespace td {
+class TlStorerToString;
+}  // namespace td
+namespace td {
+class TlParser;
+}  // namespace td
+
+namespace ton {
+namespace lite_api{
+using BaseObject = ::ton::TlObject;
+
+template <class Type>
+using object_ptr = ::ton::tl_object_ptr<Type>;
+
+template <class Type, class... Args>
+object_ptr<Type> make_object(Args &&... args) {
+  return object_ptr<Type>(new Type(std::forward<Args>(args)...));
+}
+
+template <class ToType, class FromType>
+object_ptr<ToType> move_object_as(FromType &&from) {
+  return object_ptr<ToType>(static_cast<ToType *>(from.release()));
+}
+
+std::string to_string(const BaseObject &value);
+
+template <class T>
+std::string to_string(const object_ptr<T> &value) {
+  if (value == nullptr) {
+    return "null";
+  }
+
+  return to_string(*value);
+}
+
+class adnl_Message;
+
+class liteServer_accountId;
+
+class liteServer_accountState;
+
+class liteServer_allShardsInfo;
+
+class liteServer_blockData;
+
+class liteServer_blockHeader;
+
+class liteServer_BlockLink;
+
+class liteServer_blockState;
+
+class liteServer_blockTransactions;
+
+class liteServer_configInfo;
+
+class liteServer_currentTime;
+
+class liteServer_error;
+
+class liteServer_masterchainInfo;
+
+class liteServer_masterchainInfoExt;
+
+class liteServer_partialBlockProof;
+
+class liteServer_sendMsgStatus;
+
+class liteServer_shardInfo;
+
+class liteServer_signature;
+
+class liteServer_signatureSet;
+
+class liteServer_transactionId;
+
+class liteServer_transactionId3;
+
+class liteServer_transactionInfo;
+
+class liteServer_transactionList;
+
+class liteServer_version;
+
+class liteServer_debug_verbosity;
+
+class tonNode_blockId;
+
+class tonNode_blockIdExt;
+
+class tonNode_zeroStateIdExt;
+
+class Object;
+
+class Object: public TlObject {
+ public:
+
+  static object_ptr<Object> fetch(td::TlParser &p);
+};
+
+class Function: public TlObject {
+ public:
+
+  static object_ptr<Function> fetch(td::TlParser &p);
+};
+
+class adnl_Message: public Object {
+ public:
+
+  static object_ptr<adnl_Message> fetch(td::TlParser &p);
+};
+
+class adnl_message_query final : public adnl_Message {
+ public:
+  td::Bits256 query_id_;
+  td::BufferSlice query_;
+
+  adnl_message_query();
+
+  adnl_message_query(td::Bits256 const &query_id_, td::BufferSlice &&query_);
+
+  static const std::int32_t ID = -1265895046;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Message> fetch(td::TlParser &p);
+
+  explicit adnl_message_query(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_message_answer final : public adnl_Message {
+ public:
+  td::Bits256 query_id_;
+  td::BufferSlice answer_;
+
+  adnl_message_answer();
+
+  adnl_message_answer(td::Bits256 const &query_id_, td::BufferSlice &&answer_);
+
+  static const std::int32_t ID = 262964246;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Message> fetch(td::TlParser &p);
+
+  explicit adnl_message_answer(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_accountId final : public Object {
+ public:
+  std::int32_t workchain_;
+  td::Bits256 id_;
+
+  liteServer_accountId();
+
+  liteServer_accountId(std::int32_t workchain_, td::Bits256 const &id_);
+
+  static const std::int32_t ID = 1973478085;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_accountId> fetch(td::TlParser &p);
+
+  explicit liteServer_accountId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_accountState final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  object_ptr<tonNode_blockIdExt> shardblk_;
+  td::BufferSlice shard_proof_;
+  td::BufferSlice proof_;
+  td::BufferSlice state_;
+
+  liteServer_accountState();
+
+  liteServer_accountState(object_ptr<tonNode_blockIdExt> &&id_, object_ptr<tonNode_blockIdExt> &&shardblk_, td::BufferSlice &&shard_proof_, td::BufferSlice &&proof_, td::BufferSlice &&state_);
+
+  static const std::int32_t ID = 1887029073;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_accountState> fetch(td::TlParser &p);
+
+  explicit liteServer_accountState(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_allShardsInfo final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  td::BufferSlice proof_;
+  td::BufferSlice data_;
+
+  liteServer_allShardsInfo();
+
+  liteServer_allShardsInfo(object_ptr<tonNode_blockIdExt> &&id_, td::BufferSlice &&proof_, td::BufferSlice &&data_);
+
+  static const std::int32_t ID = 160425773;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_allShardsInfo> fetch(td::TlParser &p);
+
+  explicit liteServer_allShardsInfo(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_blockData final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  td::BufferSlice data_;
+
+  liteServer_blockData();
+
+  liteServer_blockData(object_ptr<tonNode_blockIdExt> &&id_, td::BufferSlice &&data_);
+
+  static const std::int32_t ID = -1519063700;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_blockData> fetch(td::TlParser &p);
+
+  explicit liteServer_blockData(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_blockHeader final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  std::int32_t mode_;
+  td::BufferSlice header_proof_;
+
+  liteServer_blockHeader();
+
+  liteServer_blockHeader(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t mode_, td::BufferSlice &&header_proof_);
+
+  static const std::int32_t ID = 1965916697;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_blockHeader> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_BlockLink: public Object {
+ public:
+
+  static object_ptr<liteServer_BlockLink> fetch(td::TlParser &p);
+};
+
+class liteServer_blockLinkBack final : public liteServer_BlockLink {
+ public:
+  bool to_key_block_;
+  object_ptr<tonNode_blockIdExt> from_;
+  object_ptr<tonNode_blockIdExt> to_;
+  td::BufferSlice dest_proof_;
+  td::BufferSlice proof_;
+  td::BufferSlice state_proof_;
+
+  liteServer_blockLinkBack();
+
+  liteServer_blockLinkBack(bool to_key_block_, object_ptr<tonNode_blockIdExt> &&from_, object_ptr<tonNode_blockIdExt> &&to_, td::BufferSlice &&dest_proof_, td::BufferSlice &&proof_, td::BufferSlice &&state_proof_);
+
+  static const std::int32_t ID = -276947985;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_BlockLink> fetch(td::TlParser &p);
+
+  explicit liteServer_blockLinkBack(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_blockLinkForward final : public liteServer_BlockLink {
+ public:
+  bool to_key_block_;
+  object_ptr<tonNode_blockIdExt> from_;
+  object_ptr<tonNode_blockIdExt> to_;
+  td::BufferSlice dest_proof_;
+  td::BufferSlice config_proof_;
+  object_ptr<liteServer_signatureSet> signatures_;
+
+  liteServer_blockLinkForward();
+
+  liteServer_blockLinkForward(bool to_key_block_, object_ptr<tonNode_blockIdExt> &&from_, object_ptr<tonNode_blockIdExt> &&to_, td::BufferSlice &&dest_proof_, td::BufferSlice &&config_proof_, object_ptr<liteServer_signatureSet> &&signatures_);
+
+  static const std::int32_t ID = 1376767516;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_BlockLink> fetch(td::TlParser &p);
+
+  explicit liteServer_blockLinkForward(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_blockState final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  td::Bits256 root_hash_;
+  td::Bits256 file_hash_;
+  td::BufferSlice data_;
+
+  liteServer_blockState();
+
+  liteServer_blockState(object_ptr<tonNode_blockIdExt> &&id_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_, td::BufferSlice &&data_);
+
+  static const std::int32_t ID = -1414669300;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_blockState> fetch(td::TlParser &p);
+
+  explicit liteServer_blockState(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_blockTransactions final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  std::int32_t req_count_;
+  bool incomplete_;
+  std::vector<object_ptr<liteServer_transactionId>> ids_;
+  td::BufferSlice proof_;
+
+  liteServer_blockTransactions();
+
+  liteServer_blockTransactions(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t req_count_, bool incomplete_, std::vector<object_ptr<liteServer_transactionId>> &&ids_, td::BufferSlice &&proof_);
+
+  static const std::int32_t ID = -1114854101;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_blockTransactions> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_configInfo final : public Object {
+ public:
+  std::int32_t mode_;
+  object_ptr<tonNode_blockIdExt> id_;
+  td::BufferSlice state_proof_;
+  td::BufferSlice config_proof_;
+
+  liteServer_configInfo();
+
+  liteServer_configInfo(std::int32_t mode_, object_ptr<tonNode_blockIdExt> &&id_, td::BufferSlice &&state_proof_, td::BufferSlice &&config_proof_);
+
+  static const std::int32_t ID = -1367660753;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_configInfo> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_currentTime final : public Object {
+ public:
+  std::int32_t now_;
+
+  liteServer_currentTime();
+
+  explicit liteServer_currentTime(std::int32_t now_);
+
+  static const std::int32_t ID = -380436467;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_currentTime> fetch(td::TlParser &p);
+
+  explicit liteServer_currentTime(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_error final : public Object {
+ public:
+  std::int32_t code_;
+  std::string message_;
+
+  liteServer_error();
+
+  liteServer_error(std::int32_t code_, std::string const &message_);
+
+  static const std::int32_t ID = -1146494648;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_error> fetch(td::TlParser &p);
+
+  explicit liteServer_error(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_masterchainInfo final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> last_;
+  td::Bits256 state_root_hash_;
+  object_ptr<tonNode_zeroStateIdExt> init_;
+
+  liteServer_masterchainInfo();
+
+  liteServer_masterchainInfo(object_ptr<tonNode_blockIdExt> &&last_, td::Bits256 const &state_root_hash_, object_ptr<tonNode_zeroStateIdExt> &&init_);
+
+  static const std::int32_t ID = -2055001983;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_masterchainInfo> fetch(td::TlParser &p);
+
+  explicit liteServer_masterchainInfo(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_masterchainInfoExt final : public Object {
+ public:
+  std::int32_t mode_;
+  std::int32_t version_;
+  std::int64_t capabilities_;
+  object_ptr<tonNode_blockIdExt> last_;
+  std::int32_t last_utime_;
+  std::int32_t now_;
+  td::Bits256 state_root_hash_;
+  object_ptr<tonNode_zeroStateIdExt> init_;
+
+  liteServer_masterchainInfoExt();
+
+  liteServer_masterchainInfoExt(std::int32_t mode_, std::int32_t version_, std::int64_t capabilities_, object_ptr<tonNode_blockIdExt> &&last_, std::int32_t last_utime_, std::int32_t now_, td::Bits256 const &state_root_hash_, object_ptr<tonNode_zeroStateIdExt> &&init_);
+
+  static const std::int32_t ID = -1462968075;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_masterchainInfoExt> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_partialBlockProof final : public Object {
+ public:
+  bool complete_;
+  object_ptr<tonNode_blockIdExt> from_;
+  object_ptr<tonNode_blockIdExt> to_;
+  std::vector<object_ptr<liteServer_BlockLink>> steps_;
+
+  liteServer_partialBlockProof();
+
+  liteServer_partialBlockProof(bool complete_, object_ptr<tonNode_blockIdExt> &&from_, object_ptr<tonNode_blockIdExt> &&to_, std::vector<object_ptr<liteServer_BlockLink>> &&steps_);
+
+  static const std::int32_t ID = -1898917183;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_partialBlockProof> fetch(td::TlParser &p);
+
+  explicit liteServer_partialBlockProof(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_sendMsgStatus final : public Object {
+ public:
+  std::int32_t status_;
+
+  liteServer_sendMsgStatus();
+
+  explicit liteServer_sendMsgStatus(std::int32_t status_);
+
+  static const std::int32_t ID = 961602967;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_sendMsgStatus> fetch(td::TlParser &p);
+
+  explicit liteServer_sendMsgStatus(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_shardInfo final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  object_ptr<tonNode_blockIdExt> shardblk_;
+  td::BufferSlice shard_proof_;
+  td::BufferSlice shard_descr_;
+
+  liteServer_shardInfo();
+
+  liteServer_shardInfo(object_ptr<tonNode_blockIdExt> &&id_, object_ptr<tonNode_blockIdExt> &&shardblk_, td::BufferSlice &&shard_proof_, td::BufferSlice &&shard_descr_);
+
+  static const std::int32_t ID = -1612264060;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_shardInfo> fetch(td::TlParser &p);
+
+  explicit liteServer_shardInfo(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_signature final : public Object {
+ public:
+  td::Bits256 node_id_short_;
+  td::BufferSlice signature_;
+
+  liteServer_signature();
+
+  liteServer_signature(td::Bits256 const &node_id_short_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = -1545668523;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_signature> fetch(td::TlParser &p);
+
+  explicit liteServer_signature(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_signatureSet final : public Object {
+ public:
+  std::int32_t validator_set_hash_;
+  std::int32_t catchain_seqno_;
+  std::vector<object_ptr<liteServer_signature>> signatures_;
+
+  liteServer_signatureSet();
+
+  liteServer_signatureSet(std::int32_t validator_set_hash_, std::int32_t catchain_seqno_, std::vector<object_ptr<liteServer_signature>> &&signatures_);
+
+  static const std::int32_t ID = -163272986;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_signatureSet> fetch(td::TlParser &p);
+
+  explicit liteServer_signatureSet(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_transactionId final : public Object {
+ public:
+  std::int32_t mode_;
+  td::Bits256 account_;
+  std::int64_t lt_;
+  td::Bits256 hash_;
+  enum Flags : std::int32_t {ACCOUNT_MASK = 1, LT_MASK = 2, HASH_MASK = 4};
+
+  liteServer_transactionId();
+
+  liteServer_transactionId(std::int32_t mode_, td::Bits256 const &account_, std::int64_t lt_, td::Bits256 const &hash_);
+
+  static const std::int32_t ID = -1322293841;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_transactionId> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_transactionId3 final : public Object {
+ public:
+  td::Bits256 account_;
+  std::int64_t lt_;
+
+  liteServer_transactionId3();
+
+  liteServer_transactionId3(td::Bits256 const &account_, std::int64_t lt_);
+
+  static const std::int32_t ID = 746707575;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_transactionId3> fetch(td::TlParser &p);
+
+  explicit liteServer_transactionId3(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_transactionInfo final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  td::BufferSlice proof_;
+  td::BufferSlice transaction_;
+
+  liteServer_transactionInfo();
+
+  liteServer_transactionInfo(object_ptr<tonNode_blockIdExt> &&id_, td::BufferSlice &&proof_, td::BufferSlice &&transaction_);
+
+  static const std::int32_t ID = 249490759;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_transactionInfo> fetch(td::TlParser &p);
+
+  explicit liteServer_transactionInfo(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_transactionList final : public Object {
+ public:
+  std::vector<object_ptr<tonNode_blockIdExt>> ids_;
+  td::BufferSlice transactions_;
+
+  liteServer_transactionList();
+
+  liteServer_transactionList(std::vector<object_ptr<tonNode_blockIdExt>> &&ids_, td::BufferSlice &&transactions_);
+
+  static const std::int32_t ID = 1864812043;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_transactionList> fetch(td::TlParser &p);
+
+  explicit liteServer_transactionList(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_version final : public Object {
+ public:
+  std::int32_t mode_;
+  std::int32_t version_;
+  std::int64_t capabilities_;
+  std::int32_t now_;
+
+  liteServer_version();
+
+  liteServer_version(std::int32_t mode_, std::int32_t version_, std::int64_t capabilities_, std::int32_t now_);
+
+  static const std::int32_t ID = 1510248933;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_version> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_debug_verbosity final : public Object {
+ public:
+  std::int32_t value_;
+
+  liteServer_debug_verbosity();
+
+  explicit liteServer_debug_verbosity(std::int32_t value_);
+
+  static const std::int32_t ID = 1564493619;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteServer_debug_verbosity> fetch(td::TlParser &p);
+
+  explicit liteServer_debug_verbosity(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_blockId final : public Object {
+ public:
+  std::int32_t workchain_;
+  std::int64_t shard_;
+  std::int32_t seqno_;
+
+  tonNode_blockId();
+
+  tonNode_blockId(std::int32_t workchain_, std::int64_t shard_, std::int32_t seqno_);
+
+  static const std::int32_t ID = -1211256473;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_blockId> fetch(td::TlParser &p);
+
+  explicit tonNode_blockId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_blockIdExt final : public Object {
+ public:
+  std::int32_t workchain_;
+  std::int64_t shard_;
+  std::int32_t seqno_;
+  td::Bits256 root_hash_;
+  td::Bits256 file_hash_;
+
+  tonNode_blockIdExt();
+
+  tonNode_blockIdExt(std::int32_t workchain_, std::int64_t shard_, std::int32_t seqno_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_);
+
+  static const std::int32_t ID = 1733487480;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_blockIdExt> fetch(td::TlParser &p);
+
+  explicit tonNode_blockIdExt(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_zeroStateIdExt final : public Object {
+ public:
+  std::int32_t workchain_;
+  td::Bits256 root_hash_;
+  td::Bits256 file_hash_;
+
+  tonNode_zeroStateIdExt();
+
+  tonNode_zeroStateIdExt(std::int32_t workchain_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_);
+
+  static const std::int32_t ID = 494024110;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_zeroStateIdExt> fetch(td::TlParser &p);
+
+  explicit tonNode_zeroStateIdExt(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteServer_getAccountState final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  object_ptr<liteServer_accountId> account_;
+
+  liteServer_getAccountState();
+
+  liteServer_getAccountState(object_ptr<tonNode_blockIdExt> &&id_, object_ptr<liteServer_accountId> &&account_);
+
+  static const std::int32_t ID = 1804144165;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_accountState>;
+
+  static object_ptr<liteServer_getAccountState> fetch(td::TlParser &p);
+
+  explicit liteServer_getAccountState(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getAllShardsInfo final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+
+  liteServer_getAllShardsInfo();
+
+  explicit liteServer_getAllShardsInfo(object_ptr<tonNode_blockIdExt> &&id_);
+
+  static const std::int32_t ID = 1960050027;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_allShardsInfo>;
+
+  static object_ptr<liteServer_getAllShardsInfo> fetch(td::TlParser &p);
+
+  explicit liteServer_getAllShardsInfo(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getBlock final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+
+  liteServer_getBlock();
+
+  explicit liteServer_getBlock(object_ptr<tonNode_blockIdExt> &&id_);
+
+  static const std::int32_t ID = 1668796173;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_blockData>;
+
+  static object_ptr<liteServer_getBlock> fetch(td::TlParser &p);
+
+  explicit liteServer_getBlock(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getBlockHeader final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  std::int32_t mode_;
+  mutable std::int32_t var0;
+
+  liteServer_getBlockHeader();
+
+  liteServer_getBlockHeader(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t mode_);
+
+  static const std::int32_t ID = 569116318;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_blockHeader>;
+
+  static object_ptr<liteServer_getBlockHeader> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getBlockProof final : public Function {
+ public:
+  std::int32_t mode_;
+  object_ptr<tonNode_blockIdExt> known_block_;
+  object_ptr<tonNode_blockIdExt> target_block_;
+  enum Flags : std::int32_t {TARGET_BLOCK_MASK = 1};
+  mutable std::int32_t var0;
+
+  liteServer_getBlockProof();
+
+  liteServer_getBlockProof(std::int32_t mode_, object_ptr<tonNode_blockIdExt> &&known_block_, object_ptr<tonNode_blockIdExt> &&target_block_);
+
+  static const std::int32_t ID = -1964336060;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_partialBlockProof>;
+
+  static object_ptr<liteServer_getBlockProof> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getConfigAll final : public Function {
+ public:
+  std::int32_t mode_;
+  object_ptr<tonNode_blockIdExt> id_;
+  mutable std::int32_t var0;
+
+  liteServer_getConfigAll();
+
+  liteServer_getConfigAll(std::int32_t mode_, object_ptr<tonNode_blockIdExt> &&id_);
+
+  static const std::int32_t ID = -1860491593;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_configInfo>;
+
+  static object_ptr<liteServer_getConfigAll> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getConfigParams final : public Function {
+ public:
+  std::int32_t mode_;
+  object_ptr<tonNode_blockIdExt> id_;
+  std::vector<std::int32_t> param_list_;
+  mutable std::int32_t var0;
+
+  liteServer_getConfigParams();
+
+  liteServer_getConfigParams(std::int32_t mode_, object_ptr<tonNode_blockIdExt> &&id_, std::vector<std::int32_t> &&param_list_);
+
+  static const std::int32_t ID = 705764377;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_configInfo>;
+
+  static object_ptr<liteServer_getConfigParams> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getMasterchainInfo final : public Function {
+ public:
+
+  liteServer_getMasterchainInfo();
+
+  static const std::int32_t ID = -1984567762;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_masterchainInfo>;
+
+  static object_ptr<liteServer_getMasterchainInfo> fetch(td::TlParser &p);
+
+  explicit liteServer_getMasterchainInfo(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getMasterchainInfoExt final : public Function {
+ public:
+  std::int32_t mode_;
+  mutable std::int32_t var0;
+
+  liteServer_getMasterchainInfoExt();
+
+  explicit liteServer_getMasterchainInfoExt(std::int32_t mode_);
+
+  static const std::int32_t ID = 1889956319;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_masterchainInfoExt>;
+
+  static object_ptr<liteServer_getMasterchainInfoExt> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getOneTransaction final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  object_ptr<liteServer_accountId> account_;
+  std::int64_t lt_;
+
+  liteServer_getOneTransaction();
+
+  liteServer_getOneTransaction(object_ptr<tonNode_blockIdExt> &&id_, object_ptr<liteServer_accountId> &&account_, std::int64_t lt_);
+
+  static const std::int32_t ID = -737205014;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_transactionInfo>;
+
+  static object_ptr<liteServer_getOneTransaction> fetch(td::TlParser &p);
+
+  explicit liteServer_getOneTransaction(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getShardInfo final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  std::int32_t workchain_;
+  std::int64_t shard_;
+  bool exact_;
+
+  liteServer_getShardInfo();
+
+  liteServer_getShardInfo(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t workchain_, std::int64_t shard_, bool exact_);
+
+  static const std::int32_t ID = 1185084453;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_shardInfo>;
+
+  static object_ptr<liteServer_getShardInfo> fetch(td::TlParser &p);
+
+  explicit liteServer_getShardInfo(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getState final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+
+  liteServer_getState();
+
+  explicit liteServer_getState(object_ptr<tonNode_blockIdExt> &&id_);
+
+  static const std::int32_t ID = -1167184202;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_blockState>;
+
+  static object_ptr<liteServer_getState> fetch(td::TlParser &p);
+
+  explicit liteServer_getState(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getTime final : public Function {
+ public:
+
+  liteServer_getTime();
+
+  static const std::int32_t ID = 380459572;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_currentTime>;
+
+  static object_ptr<liteServer_getTime> fetch(td::TlParser &p);
+
+  explicit liteServer_getTime(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getTransactions final : public Function {
+ public:
+  std::int32_t count_;
+  object_ptr<liteServer_accountId> account_;
+  std::int64_t lt_;
+  td::Bits256 hash_;
+  mutable std::int32_t var0;
+
+  liteServer_getTransactions();
+
+  liteServer_getTransactions(std::int32_t count_, object_ptr<liteServer_accountId> &&account_, std::int64_t lt_, td::Bits256 const &hash_);
+
+  static const std::int32_t ID = 474015649;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_transactionList>;
+
+  static object_ptr<liteServer_getTransactions> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_getVersion final : public Function {
+ public:
+
+  liteServer_getVersion();
+
+  static const std::int32_t ID = 590058507;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_version>;
+
+  static object_ptr<liteServer_getVersion> fetch(td::TlParser &p);
+
+  explicit liteServer_getVersion(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_listBlockTransactions final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  std::int32_t mode_;
+  std::int32_t count_;
+  object_ptr<liteServer_transactionId3> after_;
+  bool reverse_order_;
+  bool want_proof_;
+  enum Flags : std::int32_t {AFTER_MASK = 128, REVERSE_ORDER_MASK = 64, WANT_PROOF_MASK = 32};
+  mutable std::int32_t var0;
+  mutable std::int32_t var1;
+
+  liteServer_listBlockTransactions();
+
+  liteServer_listBlockTransactions(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t mode_, std::int32_t count_, object_ptr<liteServer_transactionId3> &&after_, bool reverse_order_, bool want_proof_);
+
+  static const std::int32_t ID = -1375942694;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_blockTransactions>;
+
+  static object_ptr<liteServer_listBlockTransactions> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_lookupBlock final : public Function {
+ public:
+  std::int32_t mode_;
+  object_ptr<tonNode_blockId> id_;
+  std::int64_t lt_;
+  std::int32_t utime_;
+  enum Flags : std::int32_t {LT_MASK = 2, UTIME_MASK = 4};
+  mutable std::int32_t var0;
+
+  liteServer_lookupBlock();
+
+  liteServer_lookupBlock(std::int32_t mode_, object_ptr<tonNode_blockId> &&id_, std::int64_t lt_, std::int32_t utime_);
+
+  static const std::int32_t ID = -87492834;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_blockHeader>;
+
+  static object_ptr<liteServer_lookupBlock> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_query final : public Function {
+ public:
+  td::BufferSlice data_;
+
+  liteServer_query();
+
+  explicit liteServer_query(td::BufferSlice &&data_);
+
+  static const std::int32_t ID = 2039219935;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<Object>;
+
+  static object_ptr<liteServer_query> fetch(td::TlParser &p);
+
+  explicit liteServer_query(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_queryPrefix final : public Function {
+ public:
+
+  liteServer_queryPrefix();
+
+  static const std::int32_t ID = 1926489734;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<Object>;
+
+  static object_ptr<liteServer_queryPrefix> fetch(td::TlParser &p);
+
+  explicit liteServer_queryPrefix(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class liteServer_sendMessage final : public Function {
+ public:
+  td::BufferSlice body_;
+
+  liteServer_sendMessage();
+
+  explicit liteServer_sendMessage(td::BufferSlice &&body_);
+
+  static const std::int32_t ID = 1762317442;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<liteServer_sendMsgStatus>;
+
+  static object_ptr<liteServer_sendMessage> fetch(td::TlParser &p);
+
+  explicit liteServer_sendMessage(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+}  // namespace lite_api
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl/generate/auto/tl/lite_api.hpp b/submodules/ton/tonlib-src/tl/generate/auto/tl/lite_api.hpp
new file mode 100644
index 0000000000..985b30666e
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/auto/tl/lite_api.hpp
@@ -0,0 +1,227 @@
+#pragma once
+
+#include "lite_api.h"
+
+namespace ton {
+namespace lite_api {
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(Object &obj, const T &func) {
+  switch (obj.get_id()) {
+    case adnl_message_query::ID:
+      func(static_cast<adnl_message_query &>(obj));
+      return true;
+    case adnl_message_answer::ID:
+      func(static_cast<adnl_message_answer &>(obj));
+      return true;
+    case liteServer_accountId::ID:
+      func(static_cast<liteServer_accountId &>(obj));
+      return true;
+    case liteServer_accountState::ID:
+      func(static_cast<liteServer_accountState &>(obj));
+      return true;
+    case liteServer_allShardsInfo::ID:
+      func(static_cast<liteServer_allShardsInfo &>(obj));
+      return true;
+    case liteServer_blockData::ID:
+      func(static_cast<liteServer_blockData &>(obj));
+      return true;
+    case liteServer_blockHeader::ID:
+      func(static_cast<liteServer_blockHeader &>(obj));
+      return true;
+    case liteServer_blockLinkBack::ID:
+      func(static_cast<liteServer_blockLinkBack &>(obj));
+      return true;
+    case liteServer_blockLinkForward::ID:
+      func(static_cast<liteServer_blockLinkForward &>(obj));
+      return true;
+    case liteServer_blockState::ID:
+      func(static_cast<liteServer_blockState &>(obj));
+      return true;
+    case liteServer_blockTransactions::ID:
+      func(static_cast<liteServer_blockTransactions &>(obj));
+      return true;
+    case liteServer_configInfo::ID:
+      func(static_cast<liteServer_configInfo &>(obj));
+      return true;
+    case liteServer_currentTime::ID:
+      func(static_cast<liteServer_currentTime &>(obj));
+      return true;
+    case liteServer_error::ID:
+      func(static_cast<liteServer_error &>(obj));
+      return true;
+    case liteServer_masterchainInfo::ID:
+      func(static_cast<liteServer_masterchainInfo &>(obj));
+      return true;
+    case liteServer_masterchainInfoExt::ID:
+      func(static_cast<liteServer_masterchainInfoExt &>(obj));
+      return true;
+    case liteServer_partialBlockProof::ID:
+      func(static_cast<liteServer_partialBlockProof &>(obj));
+      return true;
+    case liteServer_sendMsgStatus::ID:
+      func(static_cast<liteServer_sendMsgStatus &>(obj));
+      return true;
+    case liteServer_shardInfo::ID:
+      func(static_cast<liteServer_shardInfo &>(obj));
+      return true;
+    case liteServer_signature::ID:
+      func(static_cast<liteServer_signature &>(obj));
+      return true;
+    case liteServer_signatureSet::ID:
+      func(static_cast<liteServer_signatureSet &>(obj));
+      return true;
+    case liteServer_transactionId::ID:
+      func(static_cast<liteServer_transactionId &>(obj));
+      return true;
+    case liteServer_transactionId3::ID:
+      func(static_cast<liteServer_transactionId3 &>(obj));
+      return true;
+    case liteServer_transactionInfo::ID:
+      func(static_cast<liteServer_transactionInfo &>(obj));
+      return true;
+    case liteServer_transactionList::ID:
+      func(static_cast<liteServer_transactionList &>(obj));
+      return true;
+    case liteServer_version::ID:
+      func(static_cast<liteServer_version &>(obj));
+      return true;
+    case liteServer_debug_verbosity::ID:
+      func(static_cast<liteServer_debug_verbosity &>(obj));
+      return true;
+    case tonNode_blockId::ID:
+      func(static_cast<tonNode_blockId &>(obj));
+      return true;
+    case tonNode_blockIdExt::ID:
+      func(static_cast<tonNode_blockIdExt &>(obj));
+      return true;
+    case tonNode_zeroStateIdExt::ID:
+      func(static_cast<tonNode_zeroStateIdExt &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(Function &obj, const T &func) {
+  switch (obj.get_id()) {
+    case liteServer_getAccountState::ID:
+      func(static_cast<liteServer_getAccountState &>(obj));
+      return true;
+    case liteServer_getAllShardsInfo::ID:
+      func(static_cast<liteServer_getAllShardsInfo &>(obj));
+      return true;
+    case liteServer_getBlock::ID:
+      func(static_cast<liteServer_getBlock &>(obj));
+      return true;
+    case liteServer_getBlockHeader::ID:
+      func(static_cast<liteServer_getBlockHeader &>(obj));
+      return true;
+    case liteServer_getBlockProof::ID:
+      func(static_cast<liteServer_getBlockProof &>(obj));
+      return true;
+    case liteServer_getConfigAll::ID:
+      func(static_cast<liteServer_getConfigAll &>(obj));
+      return true;
+    case liteServer_getConfigParams::ID:
+      func(static_cast<liteServer_getConfigParams &>(obj));
+      return true;
+    case liteServer_getMasterchainInfo::ID:
+      func(static_cast<liteServer_getMasterchainInfo &>(obj));
+      return true;
+    case liteServer_getMasterchainInfoExt::ID:
+      func(static_cast<liteServer_getMasterchainInfoExt &>(obj));
+      return true;
+    case liteServer_getOneTransaction::ID:
+      func(static_cast<liteServer_getOneTransaction &>(obj));
+      return true;
+    case liteServer_getShardInfo::ID:
+      func(static_cast<liteServer_getShardInfo &>(obj));
+      return true;
+    case liteServer_getState::ID:
+      func(static_cast<liteServer_getState &>(obj));
+      return true;
+    case liteServer_getTime::ID:
+      func(static_cast<liteServer_getTime &>(obj));
+      return true;
+    case liteServer_getTransactions::ID:
+      func(static_cast<liteServer_getTransactions &>(obj));
+      return true;
+    case liteServer_getVersion::ID:
+      func(static_cast<liteServer_getVersion &>(obj));
+      return true;
+    case liteServer_listBlockTransactions::ID:
+      func(static_cast<liteServer_listBlockTransactions &>(obj));
+      return true;
+    case liteServer_lookupBlock::ID:
+      func(static_cast<liteServer_lookupBlock &>(obj));
+      return true;
+    case liteServer_query::ID:
+      func(static_cast<liteServer_query &>(obj));
+      return true;
+    case liteServer_queryPrefix::ID:
+      func(static_cast<liteServer_queryPrefix &>(obj));
+      return true;
+    case liteServer_sendMessage::ID:
+      func(static_cast<liteServer_sendMessage &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(adnl_Message &obj, const T &func) {
+  switch (obj.get_id()) {
+    case adnl_message_query::ID:
+      func(static_cast<adnl_message_query &>(obj));
+      return true;
+    case adnl_message_answer::ID:
+      func(static_cast<adnl_message_answer &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(liteServer_BlockLink &obj, const T &func) {
+  switch (obj.get_id()) {
+    case liteServer_blockLinkBack::ID:
+      func(static_cast<liteServer_blockLinkBack &>(obj));
+      return true;
+    case liteServer_blockLinkForward::ID:
+      func(static_cast<liteServer_blockLinkForward &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+}  // namespace lite_api
+}  // namespace ton 
diff --git a/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api.cpp b/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api.cpp
new file mode 100644
index 0000000000..b79817aa3c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api.cpp
@@ -0,0 +1,15406 @@
+#include "ton_api.h"
+
+#include "tl/tl_object_parse.h"
+#include "tl/tl_object_store.h"
+#include "td/utils/int_types.h"
+#include "crypto/common/bitstring.h"
+
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/tl_parsers.h"
+#include "td/utils/tl_storers.h"
+
+namespace ton {
+namespace ton_api {
+
+std::string to_string(const BaseObject &value) {
+  td::TlStorerToString storer;
+  value.store(storer, "");
+  return storer.str();
+}
+
+object_ptr<Object> Object::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case hashable_bool::ID:
+      return hashable_bool::fetch(p);
+    case hashable_int32::ID:
+      return hashable_int32::fetch(p);
+    case hashable_int64::ID:
+      return hashable_int64::fetch(p);
+    case hashable_int256::ID:
+      return hashable_int256::fetch(p);
+    case hashable_bytes::ID:
+      return hashable_bytes::fetch(p);
+    case hashable_pair::ID:
+      return hashable_pair::fetch(p);
+    case hashable_vector::ID:
+      return hashable_vector::fetch(p);
+    case hashable_validatorSessionOldRound::ID:
+      return hashable_validatorSessionOldRound::fetch(p);
+    case hashable_validatorSessionRoundAttempt::ID:
+      return hashable_validatorSessionRoundAttempt::fetch(p);
+    case hashable_validatorSessionRound::ID:
+      return hashable_validatorSessionRound::fetch(p);
+    case hashable_blockSignature::ID:
+      return hashable_blockSignature::fetch(p);
+    case hashable_sentBlock::ID:
+      return hashable_sentBlock::fetch(p);
+    case hashable_sentBlockEmpty::ID:
+      return hashable_sentBlockEmpty::fetch(p);
+    case hashable_vote::ID:
+      return hashable_vote::fetch(p);
+    case hashable_blockCandidate::ID:
+      return hashable_blockCandidate::fetch(p);
+    case hashable_blockVoteCandidate::ID:
+      return hashable_blockVoteCandidate::fetch(p);
+    case hashable_blockCandidateAttempt::ID:
+      return hashable_blockCandidateAttempt::fetch(p);
+    case hashable_cntVector::ID:
+      return hashable_cntVector::fetch(p);
+    case hashable_cntSortedVector::ID:
+      return hashable_cntSortedVector::fetch(p);
+    case hashable_validatorSession::ID:
+      return hashable_validatorSession::fetch(p);
+    case pk_unenc::ID:
+      return pk_unenc::fetch(p);
+    case pk_ed25519::ID:
+      return pk_ed25519::fetch(p);
+    case pk_aes::ID:
+      return pk_aes::fetch(p);
+    case pk_overlay::ID:
+      return pk_overlay::fetch(p);
+    case pub_unenc::ID:
+      return pub_unenc::fetch(p);
+    case pub_ed25519::ID:
+      return pub_ed25519::fetch(p);
+    case pub_aes::ID:
+      return pub_aes::fetch(p);
+    case pub_overlay::ID:
+      return pub_overlay::fetch(p);
+    case testObject::ID:
+      return testObject::fetch(p);
+    case testString::ID:
+      return testString::fetch(p);
+    case testInt::ID:
+      return testInt::fetch(p);
+    case testVectorBytes::ID:
+      return testVectorBytes::fetch(p);
+    case adnl_address_udp::ID:
+      return adnl_address_udp::fetch(p);
+    case adnl_address_udp6::ID:
+      return adnl_address_udp6::fetch(p);
+    case adnl_addressList::ID:
+      return adnl_addressList::fetch(p);
+    case adnl_message_createChannel::ID:
+      return adnl_message_createChannel::fetch(p);
+    case adnl_message_confirmChannel::ID:
+      return adnl_message_confirmChannel::fetch(p);
+    case adnl_message_custom::ID:
+      return adnl_message_custom::fetch(p);
+    case adnl_message_nop::ID:
+      return adnl_message_nop::fetch(p);
+    case adnl_message_reinit::ID:
+      return adnl_message_reinit::fetch(p);
+    case adnl_message_query::ID:
+      return adnl_message_query::fetch(p);
+    case adnl_message_answer::ID:
+      return adnl_message_answer::fetch(p);
+    case adnl_message_part::ID:
+      return adnl_message_part::fetch(p);
+    case adnl_node::ID:
+      return adnl_node::fetch(p);
+    case adnl_nodes::ID:
+      return adnl_nodes::fetch(p);
+    case adnl_packetContents::ID:
+      return adnl_packetContents::fetch(p);
+    case adnl_pong::ID:
+      return adnl_pong::fetch(p);
+    case adnl_proxy_none::ID:
+      return adnl_proxy_none::fetch(p);
+    case adnl_proxy_fast::ID:
+      return adnl_proxy_fast::fetch(p);
+    case adnl_proxyToFastHash::ID:
+      return adnl_proxyToFastHash::fetch(p);
+    case adnl_proxyToFast::ID:
+      return adnl_proxyToFast::fetch(p);
+    case adnl_config_global::ID:
+      return adnl_config_global::fetch(p);
+    case adnl_db_node_key::ID:
+      return adnl_db_node_key::fetch(p);
+    case adnl_db_node_value::ID:
+      return adnl_db_node_value::fetch(p);
+    case adnl_id_short::ID:
+      return adnl_id_short::fetch(p);
+    case catchain_block::ID:
+      return catchain_block::fetch(p);
+    case catchain_blockNotFound::ID:
+      return catchain_blockNotFound::fetch(p);
+    case catchain_blockResult::ID:
+      return catchain_blockResult::fetch(p);
+    case catchain_blocks::ID:
+      return catchain_blocks::fetch(p);
+    case catchain_difference::ID:
+      return catchain_difference::fetch(p);
+    case catchain_differenceFork::ID:
+      return catchain_differenceFork::fetch(p);
+    case catchain_firstblock::ID:
+      return catchain_firstblock::fetch(p);
+    case catchain_sent::ID:
+      return catchain_sent::fetch(p);
+    case catchain_blockUpdate::ID:
+      return catchain_blockUpdate::fetch(p);
+    case catchain_block_data::ID:
+      return catchain_block_data::fetch(p);
+    case catchain_block_dep::ID:
+      return catchain_block_dep::fetch(p);
+    case catchain_block_id::ID:
+      return catchain_block_id::fetch(p);
+    case catchain_block_data_badBlock::ID:
+      return catchain_block_data_badBlock::fetch(p);
+    case catchain_block_data_fork::ID:
+      return catchain_block_data_fork::fetch(p);
+    case catchain_block_data_nop::ID:
+      return catchain_block_data_nop::fetch(p);
+    case catchain_block_data_vector::ID:
+      return catchain_block_data_vector::fetch(p);
+    case catchain_config_global::ID:
+      return catchain_config_global::fetch(p);
+    case config_global::ID:
+      return config_global::fetch(p);
+    case config_local::ID:
+      return config_local::fetch(p);
+    case control_config_local::ID:
+      return control_config_local::fetch(p);
+    case db_candidate::ID:
+      return db_candidate::fetch(p);
+    case db_block_info::ID:
+      return db_block_info::fetch(p);
+    case db_block_archivedInfo::ID:
+      return db_block_archivedInfo::fetch(p);
+    case db_blockdb_key_lru::ID:
+      return db_blockdb_key_lru::fetch(p);
+    case db_blockdb_key_value::ID:
+      return db_blockdb_key_value::fetch(p);
+    case db_blockdb_lru::ID:
+      return db_blockdb_lru::fetch(p);
+    case db_blockdb_value::ID:
+      return db_blockdb_value::fetch(p);
+    case db_candidate_id::ID:
+      return db_candidate_id::fetch(p);
+    case db_celldb_value::ID:
+      return db_celldb_value::fetch(p);
+    case db_celldb_key_value::ID:
+      return db_celldb_key_value::fetch(p);
+    case db_filedb_key_empty::ID:
+      return db_filedb_key_empty::fetch(p);
+    case db_filedb_key_blockFile::ID:
+      return db_filedb_key_blockFile::fetch(p);
+    case db_filedb_key_zeroStateFile::ID:
+      return db_filedb_key_zeroStateFile::fetch(p);
+    case db_filedb_key_persistentStateFile::ID:
+      return db_filedb_key_persistentStateFile::fetch(p);
+    case db_filedb_key_proof::ID:
+      return db_filedb_key_proof::fetch(p);
+    case db_filedb_key_proofLink::ID:
+      return db_filedb_key_proofLink::fetch(p);
+    case db_filedb_key_signatures::ID:
+      return db_filedb_key_signatures::fetch(p);
+    case db_filedb_key_candidate::ID:
+      return db_filedb_key_candidate::fetch(p);
+    case db_filedb_value::ID:
+      return db_filedb_value::fetch(p);
+    case db_lt_el_key::ID:
+      return db_lt_el_key::fetch(p);
+    case db_lt_desc_key::ID:
+      return db_lt_desc_key::fetch(p);
+    case db_lt_shard_key::ID:
+      return db_lt_shard_key::fetch(p);
+    case db_lt_status_key::ID:
+      return db_lt_status_key::fetch(p);
+    case db_lt_desc_value::ID:
+      return db_lt_desc_value::fetch(p);
+    case db_lt_el_value::ID:
+      return db_lt_el_value::fetch(p);
+    case db_lt_shard_value::ID:
+      return db_lt_shard_value::fetch(p);
+    case db_lt_status_value::ID:
+      return db_lt_status_value::fetch(p);
+    case db_root_config::ID:
+      return db_root_config::fetch(p);
+    case db_root_dbDescription::ID:
+      return db_root_dbDescription::fetch(p);
+    case db_root_key_cellDb::ID:
+      return db_root_key_cellDb::fetch(p);
+    case db_root_key_blockDb::ID:
+      return db_root_key_blockDb::fetch(p);
+    case db_root_key_config::ID:
+      return db_root_key_config::fetch(p);
+    case db_state_asyncSerializer::ID:
+      return db_state_asyncSerializer::fetch(p);
+    case db_state_destroyedSessions::ID:
+      return db_state_destroyedSessions::fetch(p);
+    case db_state_gcBlockId::ID:
+      return db_state_gcBlockId::fetch(p);
+    case db_state_initBlockId::ID:
+      return db_state_initBlockId::fetch(p);
+    case db_state_key_destroyedSessions::ID:
+      return db_state_key_destroyedSessions::fetch(p);
+    case db_state_key_initBlockId::ID:
+      return db_state_key_initBlockId::fetch(p);
+    case db_state_key_gcBlockId::ID:
+      return db_state_key_gcBlockId::fetch(p);
+    case db_state_key_shardClient::ID:
+      return db_state_key_shardClient::fetch(p);
+    case db_state_key_asyncSerializer::ID:
+      return db_state_key_asyncSerializer::fetch(p);
+    case db_state_shardClient::ID:
+      return db_state_shardClient::fetch(p);
+    case dht_key::ID:
+      return dht_key::fetch(p);
+    case dht_keyDescription::ID:
+      return dht_keyDescription::fetch(p);
+    case dht_message::ID:
+      return dht_message::fetch(p);
+    case dht_node::ID:
+      return dht_node::fetch(p);
+    case dht_nodes::ID:
+      return dht_nodes::fetch(p);
+    case dht_pong::ID:
+      return dht_pong::fetch(p);
+    case dht_stored::ID:
+      return dht_stored::fetch(p);
+    case dht_updateRule_signature::ID:
+      return dht_updateRule_signature::fetch(p);
+    case dht_updateRule_anybody::ID:
+      return dht_updateRule_anybody::fetch(p);
+    case dht_updateRule_overlayNodes::ID:
+      return dht_updateRule_overlayNodes::fetch(p);
+    case dht_value::ID:
+      return dht_value::fetch(p);
+    case dht_valueNotFound::ID:
+      return dht_valueNotFound::fetch(p);
+    case dht_valueFound::ID:
+      return dht_valueFound::fetch(p);
+    case dht_config_global::ID:
+      return dht_config_global::fetch(p);
+    case dht_config_local::ID:
+      return dht_config_local::fetch(p);
+    case dht_config_random_local::ID:
+      return dht_config_random_local::fetch(p);
+    case dht_db_bucket::ID:
+      return dht_db_bucket::fetch(p);
+    case dht_db_key_bucket::ID:
+      return dht_db_key_bucket::fetch(p);
+    case dummyworkchain0_config_global::ID:
+      return dummyworkchain0_config_global::fetch(p);
+    case engine_addr::ID:
+      return engine_addr::fetch(p);
+    case engine_addrProxy::ID:
+      return engine_addrProxy::fetch(p);
+    case engine_adnl::ID:
+      return engine_adnl::fetch(p);
+    case engine_controlInterface::ID:
+      return engine_controlInterface::fetch(p);
+    case engine_controlProcess::ID:
+      return engine_controlProcess::fetch(p);
+    case engine_dht::ID:
+      return engine_dht::fetch(p);
+    case engine_gc::ID:
+      return engine_gc::fetch(p);
+    case engine_liteServer::ID:
+      return engine_liteServer::fetch(p);
+    case engine_validator::ID:
+      return engine_validator::fetch(p);
+    case engine_validatorAdnlAddress::ID:
+      return engine_validatorAdnlAddress::fetch(p);
+    case engine_validatorTempKey::ID:
+      return engine_validatorTempKey::fetch(p);
+    case engine_adnlProxy_config::ID:
+      return engine_adnlProxy_config::fetch(p);
+    case engine_adnlProxy_port::ID:
+      return engine_adnlProxy_port::fetch(p);
+    case engine_dht_config::ID:
+      return engine_dht_config::fetch(p);
+    case engine_validator_config::ID:
+      return engine_validator_config::fetch(p);
+    case engine_validator_controlQueryError::ID:
+      return engine_validator_controlQueryError::fetch(p);
+    case engine_validator_dhtServerStatus::ID:
+      return engine_validator_dhtServerStatus::fetch(p);
+    case engine_validator_dhtServersStatus::ID:
+      return engine_validator_dhtServersStatus::fetch(p);
+    case engine_validator_electionBid::ID:
+      return engine_validator_electionBid::fetch(p);
+    case validator_groupMember::ID:
+      return validator_groupMember::fetch(p);
+    case engine_validator_jsonConfig::ID:
+      return engine_validator_jsonConfig::fetch(p);
+    case engine_validator_keyHash::ID:
+      return engine_validator_keyHash::fetch(p);
+    case engine_validator_oneStat::ID:
+      return engine_validator_oneStat::fetch(p);
+    case engine_validator_signature::ID:
+      return engine_validator_signature::fetch(p);
+    case engine_validator_stats::ID:
+      return engine_validator_stats::fetch(p);
+    case engine_validator_success::ID:
+      return engine_validator_success::fetch(p);
+    case engine_validator_time::ID:
+      return engine_validator_time::fetch(p);
+    case fec_raptorQ::ID:
+      return fec_raptorQ::fetch(p);
+    case fec_roundRobin::ID:
+      return fec_roundRobin::fetch(p);
+    case fec_online::ID:
+      return fec_online::fetch(p);
+    case id_config_local::ID:
+      return id_config_local::fetch(p);
+    case liteclient_config_global::ID:
+      return liteclient_config_global::fetch(p);
+    case liteserver_desc::ID:
+      return liteserver_desc::fetch(p);
+    case liteserver_config_local::ID:
+      return liteserver_config_local::fetch(p);
+    case liteserver_config_random_local::ID:
+      return liteserver_config_random_local::fetch(p);
+    case overlay_fec_received::ID:
+      return overlay_fec_received::fetch(p);
+    case overlay_fec_completed::ID:
+      return overlay_fec_completed::fetch(p);
+    case overlay_unicast::ID:
+      return overlay_unicast::fetch(p);
+    case overlay_broadcast::ID:
+      return overlay_broadcast::fetch(p);
+    case overlay_broadcastFec::ID:
+      return overlay_broadcastFec::fetch(p);
+    case overlay_broadcastFecShort::ID:
+      return overlay_broadcastFecShort::fetch(p);
+    case overlay_broadcastNotFound::ID:
+      return overlay_broadcastNotFound::fetch(p);
+    case overlay_broadcastList::ID:
+      return overlay_broadcastList::fetch(p);
+    case overlay_certificate::ID:
+      return overlay_certificate::fetch(p);
+    case overlay_emptyCertificate::ID:
+      return overlay_emptyCertificate::fetch(p);
+    case overlay_certificateId::ID:
+      return overlay_certificateId::fetch(p);
+    case overlay_message::ID:
+      return overlay_message::fetch(p);
+    case overlay_node::ID:
+      return overlay_node::fetch(p);
+    case overlay_nodes::ID:
+      return overlay_nodes::fetch(p);
+    case overlay_broadcast_id::ID:
+      return overlay_broadcast_id::fetch(p);
+    case overlay_broadcast_toSign::ID:
+      return overlay_broadcast_toSign::fetch(p);
+    case overlay_broadcastFec_id::ID:
+      return overlay_broadcastFec_id::fetch(p);
+    case overlay_broadcastFec_partId::ID:
+      return overlay_broadcastFec_partId::fetch(p);
+    case overlay_db_key_nodes::ID:
+      return overlay_db_key_nodes::fetch(p);
+    case overlay_db_nodes::ID:
+      return overlay_db_nodes::fetch(p);
+    case overlay_node_toSign::ID:
+      return overlay_node_toSign::fetch(p);
+    case rldp_message::ID:
+      return rldp_message::fetch(p);
+    case rldp_query::ID:
+      return rldp_query::fetch(p);
+    case rldp_answer::ID:
+      return rldp_answer::fetch(p);
+    case rldp_messagePart::ID:
+      return rldp_messagePart::fetch(p);
+    case rldp_confirm::ID:
+      return rldp_confirm::fetch(p);
+    case rldp_complete::ID:
+      return rldp_complete::fetch(p);
+    case tcp_authentificate::ID:
+      return tcp_authentificate::fetch(p);
+    case tcp_authentificationNonce::ID:
+      return tcp_authentificationNonce::fetch(p);
+    case tcp_authentificationComplete::ID:
+      return tcp_authentificationComplete::fetch(p);
+    case tcp_pong::ID:
+      return tcp_pong::fetch(p);
+    case ton_blockId::ID:
+      return ton_blockId::fetch(p);
+    case ton_blockIdApprove::ID:
+      return ton_blockIdApprove::fetch(p);
+    case tonNode_blockDescriptionEmpty::ID:
+      return tonNode_blockDescriptionEmpty::fetch(p);
+    case tonNode_blockDescription::ID:
+      return tonNode_blockDescription::fetch(p);
+    case tonNode_blockId::ID:
+      return tonNode_blockId::fetch(p);
+    case tonNode_blockIdExt::ID:
+      return tonNode_blockIdExt::fetch(p);
+    case tonNode_blockSignature::ID:
+      return tonNode_blockSignature::fetch(p);
+    case tonNode_blockBroadcast::ID:
+      return tonNode_blockBroadcast::fetch(p);
+    case tonNode_ihrMessageBroadcast::ID:
+      return tonNode_ihrMessageBroadcast::fetch(p);
+    case tonNode_externalMessageBroadcast::ID:
+      return tonNode_externalMessageBroadcast::fetch(p);
+    case tonNode_newShardBlockBroadcast::ID:
+      return tonNode_newShardBlockBroadcast::fetch(p);
+    case tonNode_data::ID:
+      return tonNode_data::fetch(p);
+    case tonNode_externalMessage::ID:
+      return tonNode_externalMessage::fetch(p);
+    case tonNode_ihrMessage::ID:
+      return tonNode_ihrMessage::fetch(p);
+    case tonNode_keyBlocks::ID:
+      return tonNode_keyBlocks::fetch(p);
+    case tonNode_newShardBlock::ID:
+      return tonNode_newShardBlock::fetch(p);
+    case tonNode_prepared::ID:
+      return tonNode_prepared::fetch(p);
+    case tonNode_notFound::ID:
+      return tonNode_notFound::fetch(p);
+    case tonNode_preparedProofEmpty::ID:
+      return tonNode_preparedProofEmpty::fetch(p);
+    case tonNode_preparedProof::ID:
+      return tonNode_preparedProof::fetch(p);
+    case tonNode_preparedProofLink::ID:
+      return tonNode_preparedProofLink::fetch(p);
+    case tonNode_preparedState::ID:
+      return tonNode_preparedState::fetch(p);
+    case tonNode_notFoundState::ID:
+      return tonNode_notFoundState::fetch(p);
+    case tonNode_sessionId::ID:
+      return tonNode_sessionId::fetch(p);
+    case tonNode_shardPublicOverlayId::ID:
+      return tonNode_shardPublicOverlayId::fetch(p);
+    case tonNode_zeroStateIdExt::ID:
+      return tonNode_zeroStateIdExt::fetch(p);
+    case validator_group::ID:
+      return validator_group::fetch(p);
+    case validator_config_global::ID:
+      return validator_config_global::fetch(p);
+    case validator_config_local::ID:
+      return validator_config_local::fetch(p);
+    case validator_config_random_local::ID:
+      return validator_config_random_local::fetch(p);
+    case validatorSession_blockUpdate::ID:
+      return validatorSession_blockUpdate::fetch(p);
+    case validatorSession_candidate::ID:
+      return validatorSession_candidate::fetch(p);
+    case validatorSession_candidateId::ID:
+      return validatorSession_candidateId::fetch(p);
+    case validatorSession_config::ID:
+      return validatorSession_config::fetch(p);
+    case validatorSession_message_startSession::ID:
+      return validatorSession_message_startSession::fetch(p);
+    case validatorSession_message_finishSession::ID:
+      return validatorSession_message_finishSession::fetch(p);
+    case validatorSession_pong::ID:
+      return validatorSession_pong::fetch(p);
+    case validatorSession_round_id::ID:
+      return validatorSession_round_id::fetch(p);
+    case validatorSession_message_submittedBlock::ID:
+      return validatorSession_message_submittedBlock::fetch(p);
+    case validatorSession_message_approvedBlock::ID:
+      return validatorSession_message_approvedBlock::fetch(p);
+    case validatorSession_message_rejectedBlock::ID:
+      return validatorSession_message_rejectedBlock::fetch(p);
+    case validatorSession_message_commit::ID:
+      return validatorSession_message_commit::fetch(p);
+    case validatorSession_message_vote::ID:
+      return validatorSession_message_vote::fetch(p);
+    case validatorSession_message_voteFor::ID:
+      return validatorSession_message_voteFor::fetch(p);
+    case validatorSession_message_precommit::ID:
+      return validatorSession_message_precommit::fetch(p);
+    case validatorSession_message_empty::ID:
+      return validatorSession_message_empty::fetch(p);
+    case validatorSession_candidate_id::ID:
+      return validatorSession_candidate_id::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+object_ptr<Function> Function::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case adnl_ping::ID:
+      return adnl_ping::fetch(p);
+    case catchain_getBlock::ID:
+      return catchain_getBlock::fetch(p);
+    case catchain_getBlockHistory::ID:
+      return catchain_getBlockHistory::fetch(p);
+    case catchain_getBlocks::ID:
+      return catchain_getBlocks::fetch(p);
+    case catchain_getDifference::ID:
+      return catchain_getDifference::fetch(p);
+    case dht_findNode::ID:
+      return dht_findNode::fetch(p);
+    case dht_findValue::ID:
+      return dht_findValue::fetch(p);
+    case dht_getSignedAddressList::ID:
+      return dht_getSignedAddressList::fetch(p);
+    case dht_ping::ID:
+      return dht_ping::fetch(p);
+    case dht_query::ID:
+      return dht_query::fetch(p);
+    case dht_store::ID:
+      return dht_store::fetch(p);
+    case engine_validator_addAdnlId::ID:
+      return engine_validator_addAdnlId::fetch(p);
+    case engine_validator_addControlInterface::ID:
+      return engine_validator_addControlInterface::fetch(p);
+    case engine_validator_addControlProcess::ID:
+      return engine_validator_addControlProcess::fetch(p);
+    case engine_validator_addDhtId::ID:
+      return engine_validator_addDhtId::fetch(p);
+    case engine_validator_addListeningPort::ID:
+      return engine_validator_addListeningPort::fetch(p);
+    case engine_validator_addLiteserver::ID:
+      return engine_validator_addLiteserver::fetch(p);
+    case engine_validator_addProxy::ID:
+      return engine_validator_addProxy::fetch(p);
+    case engine_validator_addValidatorAdnlAddress::ID:
+      return engine_validator_addValidatorAdnlAddress::fetch(p);
+    case engine_validator_addValidatorPermanentKey::ID:
+      return engine_validator_addValidatorPermanentKey::fetch(p);
+    case engine_validator_addValidatorTempKey::ID:
+      return engine_validator_addValidatorTempKey::fetch(p);
+    case engine_validator_changeFullNodeAdnlAddress::ID:
+      return engine_validator_changeFullNodeAdnlAddress::fetch(p);
+    case engine_validator_checkDhtServers::ID:
+      return engine_validator_checkDhtServers::fetch(p);
+    case engine_validator_controlQuery::ID:
+      return engine_validator_controlQuery::fetch(p);
+    case engine_validator_createElectionBid::ID:
+      return engine_validator_createElectionBid::fetch(p);
+    case engine_validator_delAdnlId::ID:
+      return engine_validator_delAdnlId::fetch(p);
+    case engine_validator_delDhtId::ID:
+      return engine_validator_delDhtId::fetch(p);
+    case engine_validator_delListeningPort::ID:
+      return engine_validator_delListeningPort::fetch(p);
+    case engine_validator_delProxy::ID:
+      return engine_validator_delProxy::fetch(p);
+    case engine_validator_delValidatorAdnlAddress::ID:
+      return engine_validator_delValidatorAdnlAddress::fetch(p);
+    case engine_validator_delValidatorPermanentKey::ID:
+      return engine_validator_delValidatorPermanentKey::fetch(p);
+    case engine_validator_delValidatorTempKey::ID:
+      return engine_validator_delValidatorTempKey::fetch(p);
+    case engine_validator_exportPrivateKey::ID:
+      return engine_validator_exportPrivateKey::fetch(p);
+    case engine_validator_exportPublicKey::ID:
+      return engine_validator_exportPublicKey::fetch(p);
+    case engine_validator_generateKeyPair::ID:
+      return engine_validator_generateKeyPair::fetch(p);
+    case engine_validator_getConfig::ID:
+      return engine_validator_getConfig::fetch(p);
+    case engine_validator_getStats::ID:
+      return engine_validator_getStats::fetch(p);
+    case engine_validator_getTime::ID:
+      return engine_validator_getTime::fetch(p);
+    case engine_validator_importPrivateKey::ID:
+      return engine_validator_importPrivateKey::fetch(p);
+    case engine_validator_setVerbosity::ID:
+      return engine_validator_setVerbosity::fetch(p);
+    case engine_validator_sign::ID:
+      return engine_validator_sign::fetch(p);
+    case getTestObject::ID:
+      return getTestObject::fetch(p);
+    case overlay_getBroadcast::ID:
+      return overlay_getBroadcast::fetch(p);
+    case overlay_getBroadcastList::ID:
+      return overlay_getBroadcastList::fetch(p);
+    case overlay_getRandomPeers::ID:
+      return overlay_getRandomPeers::fetch(p);
+    case overlay_query::ID:
+      return overlay_query::fetch(p);
+    case tcp_ping::ID:
+      return tcp_ping::fetch(p);
+    case tonNode_downloadBlock::ID:
+      return tonNode_downloadBlock::fetch(p);
+    case tonNode_downloadBlockProof::ID:
+      return tonNode_downloadBlockProof::fetch(p);
+    case tonNode_downloadBlockProofLink::ID:
+      return tonNode_downloadBlockProofLink::fetch(p);
+    case tonNode_downloadPersistentState::ID:
+      return tonNode_downloadPersistentState::fetch(p);
+    case tonNode_downloadZeroState::ID:
+      return tonNode_downloadZeroState::fetch(p);
+    case tonNode_getNextBlockDescription::ID:
+      return tonNode_getNextBlockDescription::fetch(p);
+    case tonNode_getNextKeyBlockIds::ID:
+      return tonNode_getNextKeyBlockIds::fetch(p);
+    case tonNode_prepareBlock::ID:
+      return tonNode_prepareBlock::fetch(p);
+    case tonNode_prepareBlockProof::ID:
+      return tonNode_prepareBlockProof::fetch(p);
+    case tonNode_preparePersistentState::ID:
+      return tonNode_preparePersistentState::fetch(p);
+    case tonNode_prepareZeroState::ID:
+      return tonNode_prepareZeroState::fetch(p);
+    case validatorSession_downloadCandidate::ID:
+      return validatorSession_downloadCandidate::fetch(p);
+    case validatorSession_ping::ID:
+      return validatorSession_ping::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+object_ptr<Hashable> Hashable::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case hashable_bool::ID:
+      return hashable_bool::fetch(p);
+    case hashable_int32::ID:
+      return hashable_int32::fetch(p);
+    case hashable_int64::ID:
+      return hashable_int64::fetch(p);
+    case hashable_int256::ID:
+      return hashable_int256::fetch(p);
+    case hashable_bytes::ID:
+      return hashable_bytes::fetch(p);
+    case hashable_pair::ID:
+      return hashable_pair::fetch(p);
+    case hashable_vector::ID:
+      return hashable_vector::fetch(p);
+    case hashable_validatorSessionOldRound::ID:
+      return hashable_validatorSessionOldRound::fetch(p);
+    case hashable_validatorSessionRoundAttempt::ID:
+      return hashable_validatorSessionRoundAttempt::fetch(p);
+    case hashable_validatorSessionRound::ID:
+      return hashable_validatorSessionRound::fetch(p);
+    case hashable_blockSignature::ID:
+      return hashable_blockSignature::fetch(p);
+    case hashable_sentBlock::ID:
+      return hashable_sentBlock::fetch(p);
+    case hashable_sentBlockEmpty::ID:
+      return hashable_sentBlockEmpty::fetch(p);
+    case hashable_vote::ID:
+      return hashable_vote::fetch(p);
+    case hashable_blockCandidate::ID:
+      return hashable_blockCandidate::fetch(p);
+    case hashable_blockVoteCandidate::ID:
+      return hashable_blockVoteCandidate::fetch(p);
+    case hashable_blockCandidateAttempt::ID:
+      return hashable_blockCandidateAttempt::fetch(p);
+    case hashable_cntVector::ID:
+      return hashable_cntVector::fetch(p);
+    case hashable_cntSortedVector::ID:
+      return hashable_cntSortedVector::fetch(p);
+    case hashable_validatorSession::ID:
+      return hashable_validatorSession::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+hashable_bool::hashable_bool()
+  : value_()
+{}
+
+hashable_bool::hashable_bool(bool value_)
+  : value_(value_)
+{}
+
+const std::int32_t hashable_bool::ID;
+
+object_ptr<Hashable> hashable_bool::fetch(td::TlParser &p) {
+  return make_object<hashable_bool>(p);
+}
+
+hashable_bool::hashable_bool(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchBool::parse(p))
+#undef FAIL
+{}
+
+void hashable_bool::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBool::store(value_, s);
+}
+
+void hashable_bool::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBool::store(value_, s);
+}
+
+void hashable_bool::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_bool");
+    s.store_field("value", value_);
+    s.store_class_end();
+  }
+}
+
+hashable_int32::hashable_int32()
+  : value_()
+{}
+
+hashable_int32::hashable_int32(std::int32_t value_)
+  : value_(value_)
+{}
+
+const std::int32_t hashable_int32::ID;
+
+object_ptr<Hashable> hashable_int32::fetch(td::TlParser &p) {
+  return make_object<hashable_int32>(p);
+}
+
+hashable_int32::hashable_int32(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_int32::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+}
+
+void hashable_int32::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+}
+
+void hashable_int32::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_int32");
+    s.store_field("value", value_);
+    s.store_class_end();
+  }
+}
+
+hashable_int64::hashable_int64()
+  : value_()
+{}
+
+hashable_int64::hashable_int64(std::int64_t value_)
+  : value_(value_)
+{}
+
+const std::int32_t hashable_int64::ID;
+
+object_ptr<Hashable> hashable_int64::fetch(td::TlParser &p) {
+  return make_object<hashable_int64>(p);
+}
+
+hashable_int64::hashable_int64(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void hashable_int64::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+}
+
+void hashable_int64::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+}
+
+void hashable_int64::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_int64");
+    s.store_field("value", value_);
+    s.store_class_end();
+  }
+}
+
+hashable_int256::hashable_int256()
+  : value_()
+{}
+
+hashable_int256::hashable_int256(td::Bits256 const &value_)
+  : value_(value_)
+{}
+
+const std::int32_t hashable_int256::ID;
+
+object_ptr<Hashable> hashable_int256::fetch(td::TlParser &p) {
+  return make_object<hashable_int256>(p);
+}
+
+hashable_int256::hashable_int256(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void hashable_int256::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+}
+
+void hashable_int256::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+}
+
+void hashable_int256::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_int256");
+    s.store_field("value", value_);
+    s.store_class_end();
+  }
+}
+
+hashable_bytes::hashable_bytes()
+  : value_()
+{}
+
+hashable_bytes::hashable_bytes(td::BufferSlice &&value_)
+  : value_(std::move(value_))
+{}
+
+const std::int32_t hashable_bytes::ID;
+
+object_ptr<Hashable> hashable_bytes::fetch(td::TlParser &p) {
+  return make_object<hashable_bytes>(p);
+}
+
+hashable_bytes::hashable_bytes(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void hashable_bytes::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(value_, s);
+}
+
+void hashable_bytes::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(value_, s);
+}
+
+void hashable_bytes::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_bytes");
+    s.store_bytes_field("value", value_);
+    s.store_class_end();
+  }
+}
+
+hashable_pair::hashable_pair()
+  : left_()
+  , right_()
+{}
+
+hashable_pair::hashable_pair(std::int32_t left_, std::int32_t right_)
+  : left_(left_)
+  , right_(right_)
+{}
+
+const std::int32_t hashable_pair::ID;
+
+object_ptr<Hashable> hashable_pair::fetch(td::TlParser &p) {
+  return make_object<hashable_pair>(p);
+}
+
+hashable_pair::hashable_pair(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : left_(TlFetchInt::parse(p))
+  , right_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_pair::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(left_, s);
+  TlStoreBinary::store(right_, s);
+}
+
+void hashable_pair::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(left_, s);
+  TlStoreBinary::store(right_, s);
+}
+
+void hashable_pair::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_pair");
+    s.store_field("left", left_);
+    s.store_field("right", right_);
+    s.store_class_end();
+  }
+}
+
+hashable_vector::hashable_vector()
+  : value_()
+{}
+
+hashable_vector::hashable_vector(std::vector<std::int32_t> &&value_)
+  : value_(std::move(value_))
+{}
+
+const std::int32_t hashable_vector::ID;
+
+object_ptr<Hashable> hashable_vector::fetch(td::TlParser &p) {
+  return make_object<hashable_vector>(p);
+}
+
+hashable_vector::hashable_vector(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchVector<TlFetchInt>::parse(p))
+#undef FAIL
+{}
+
+void hashable_vector::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreBinary>::store(value_, s);
+}
+
+void hashable_vector::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreBinary>::store(value_, s);
+}
+
+void hashable_vector::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_vector");
+    { const std::vector<std::int32_t> &v = value_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("value", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+hashable_validatorSessionOldRound::hashable_validatorSessionOldRound()
+  : seqno_()
+  , block_()
+  , signatures_()
+  , approve_signatures_()
+{}
+
+hashable_validatorSessionOldRound::hashable_validatorSessionOldRound(std::int32_t seqno_, std::int32_t block_, std::int32_t signatures_, std::int32_t approve_signatures_)
+  : seqno_(seqno_)
+  , block_(block_)
+  , signatures_(signatures_)
+  , approve_signatures_(approve_signatures_)
+{}
+
+const std::int32_t hashable_validatorSessionOldRound::ID;
+
+object_ptr<Hashable> hashable_validatorSessionOldRound::fetch(td::TlParser &p) {
+  return make_object<hashable_validatorSessionOldRound>(p);
+}
+
+hashable_validatorSessionOldRound::hashable_validatorSessionOldRound(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : seqno_(TlFetchInt::parse(p))
+  , block_(TlFetchInt::parse(p))
+  , signatures_(TlFetchInt::parse(p))
+  , approve_signatures_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_validatorSessionOldRound::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreBinary::store(block_, s);
+  TlStoreBinary::store(signatures_, s);
+  TlStoreBinary::store(approve_signatures_, s);
+}
+
+void hashable_validatorSessionOldRound::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreBinary::store(block_, s);
+  TlStoreBinary::store(signatures_, s);
+  TlStoreBinary::store(approve_signatures_, s);
+}
+
+void hashable_validatorSessionOldRound::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_validatorSessionOldRound");
+    s.store_field("seqno", seqno_);
+    s.store_field("block", block_);
+    s.store_field("signatures", signatures_);
+    s.store_field("approve_signatures", approve_signatures_);
+    s.store_class_end();
+  }
+}
+
+hashable_validatorSessionRoundAttempt::hashable_validatorSessionRoundAttempt()
+  : seqno_()
+  , votes_()
+  , precommitted_()
+  , vote_for_inited_()
+  , vote_for_()
+{}
+
+hashable_validatorSessionRoundAttempt::hashable_validatorSessionRoundAttempt(std::int32_t seqno_, std::int32_t votes_, std::int32_t precommitted_, std::int32_t vote_for_inited_, std::int32_t vote_for_)
+  : seqno_(seqno_)
+  , votes_(votes_)
+  , precommitted_(precommitted_)
+  , vote_for_inited_(vote_for_inited_)
+  , vote_for_(vote_for_)
+{}
+
+const std::int32_t hashable_validatorSessionRoundAttempt::ID;
+
+object_ptr<Hashable> hashable_validatorSessionRoundAttempt::fetch(td::TlParser &p) {
+  return make_object<hashable_validatorSessionRoundAttempt>(p);
+}
+
+hashable_validatorSessionRoundAttempt::hashable_validatorSessionRoundAttempt(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : seqno_(TlFetchInt::parse(p))
+  , votes_(TlFetchInt::parse(p))
+  , precommitted_(TlFetchInt::parse(p))
+  , vote_for_inited_(TlFetchInt::parse(p))
+  , vote_for_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_validatorSessionRoundAttempt::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreBinary::store(votes_, s);
+  TlStoreBinary::store(precommitted_, s);
+  TlStoreBinary::store(vote_for_inited_, s);
+  TlStoreBinary::store(vote_for_, s);
+}
+
+void hashable_validatorSessionRoundAttempt::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreBinary::store(votes_, s);
+  TlStoreBinary::store(precommitted_, s);
+  TlStoreBinary::store(vote_for_inited_, s);
+  TlStoreBinary::store(vote_for_, s);
+}
+
+void hashable_validatorSessionRoundAttempt::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_validatorSessionRoundAttempt");
+    s.store_field("seqno", seqno_);
+    s.store_field("votes", votes_);
+    s.store_field("precommitted", precommitted_);
+    s.store_field("vote_for_inited", vote_for_inited_);
+    s.store_field("vote_for", vote_for_);
+    s.store_class_end();
+  }
+}
+
+hashable_validatorSessionRound::hashable_validatorSessionRound()
+  : locked_round_()
+  , locked_block_()
+  , seqno_()
+  , precommitted_()
+  , first_attempt_()
+  , approved_blocks_()
+  , signatures_()
+  , attempts_()
+{}
+
+hashable_validatorSessionRound::hashable_validatorSessionRound(std::int32_t locked_round_, std::int32_t locked_block_, std::int32_t seqno_, bool precommitted_, std::int32_t first_attempt_, std::int32_t approved_blocks_, std::int32_t signatures_, std::int32_t attempts_)
+  : locked_round_(locked_round_)
+  , locked_block_(locked_block_)
+  , seqno_(seqno_)
+  , precommitted_(precommitted_)
+  , first_attempt_(first_attempt_)
+  , approved_blocks_(approved_blocks_)
+  , signatures_(signatures_)
+  , attempts_(attempts_)
+{}
+
+const std::int32_t hashable_validatorSessionRound::ID;
+
+object_ptr<Hashable> hashable_validatorSessionRound::fetch(td::TlParser &p) {
+  return make_object<hashable_validatorSessionRound>(p);
+}
+
+hashable_validatorSessionRound::hashable_validatorSessionRound(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : locked_round_(TlFetchInt::parse(p))
+  , locked_block_(TlFetchInt::parse(p))
+  , seqno_(TlFetchInt::parse(p))
+  , precommitted_(TlFetchBool::parse(p))
+  , first_attempt_(TlFetchInt::parse(p))
+  , approved_blocks_(TlFetchInt::parse(p))
+  , signatures_(TlFetchInt::parse(p))
+  , attempts_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_validatorSessionRound::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(locked_round_, s);
+  TlStoreBinary::store(locked_block_, s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreBool::store(precommitted_, s);
+  TlStoreBinary::store(first_attempt_, s);
+  TlStoreBinary::store(approved_blocks_, s);
+  TlStoreBinary::store(signatures_, s);
+  TlStoreBinary::store(attempts_, s);
+}
+
+void hashable_validatorSessionRound::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(locked_round_, s);
+  TlStoreBinary::store(locked_block_, s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreBool::store(precommitted_, s);
+  TlStoreBinary::store(first_attempt_, s);
+  TlStoreBinary::store(approved_blocks_, s);
+  TlStoreBinary::store(signatures_, s);
+  TlStoreBinary::store(attempts_, s);
+}
+
+void hashable_validatorSessionRound::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_validatorSessionRound");
+    s.store_field("locked_round", locked_round_);
+    s.store_field("locked_block", locked_block_);
+    s.store_field("seqno", seqno_);
+    s.store_field("precommitted", precommitted_);
+    s.store_field("first_attempt", first_attempt_);
+    s.store_field("approved_blocks", approved_blocks_);
+    s.store_field("signatures", signatures_);
+    s.store_field("attempts", attempts_);
+    s.store_class_end();
+  }
+}
+
+hashable_blockSignature::hashable_blockSignature()
+  : signature_()
+{}
+
+hashable_blockSignature::hashable_blockSignature(std::int32_t signature_)
+  : signature_(signature_)
+{}
+
+const std::int32_t hashable_blockSignature::ID;
+
+object_ptr<Hashable> hashable_blockSignature::fetch(td::TlParser &p) {
+  return make_object<hashable_blockSignature>(p);
+}
+
+hashable_blockSignature::hashable_blockSignature(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : signature_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_blockSignature::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(signature_, s);
+}
+
+void hashable_blockSignature::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(signature_, s);
+}
+
+void hashable_blockSignature::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_blockSignature");
+    s.store_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+hashable_sentBlock::hashable_sentBlock()
+  : src_()
+  , root_hash_()
+  , file_hash_()
+  , collated_data_file_hash_()
+{}
+
+hashable_sentBlock::hashable_sentBlock(std::int32_t src_, std::int32_t root_hash_, std::int32_t file_hash_, std::int32_t collated_data_file_hash_)
+  : src_(src_)
+  , root_hash_(root_hash_)
+  , file_hash_(file_hash_)
+  , collated_data_file_hash_(collated_data_file_hash_)
+{}
+
+const std::int32_t hashable_sentBlock::ID;
+
+object_ptr<Hashable> hashable_sentBlock::fetch(td::TlParser &p) {
+  return make_object<hashable_sentBlock>(p);
+}
+
+hashable_sentBlock::hashable_sentBlock(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : src_(TlFetchInt::parse(p))
+  , root_hash_(TlFetchInt::parse(p))
+  , file_hash_(TlFetchInt::parse(p))
+  , collated_data_file_hash_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_sentBlock::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+  TlStoreBinary::store(collated_data_file_hash_, s);
+}
+
+void hashable_sentBlock::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+  TlStoreBinary::store(collated_data_file_hash_, s);
+}
+
+void hashable_sentBlock::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_sentBlock");
+    s.store_field("src", src_);
+    s.store_field("root_hash", root_hash_);
+    s.store_field("file_hash", file_hash_);
+    s.store_field("collated_data_file_hash", collated_data_file_hash_);
+    s.store_class_end();
+  }
+}
+
+hashable_sentBlockEmpty::hashable_sentBlockEmpty() {
+}
+
+const std::int32_t hashable_sentBlockEmpty::ID;
+
+object_ptr<Hashable> hashable_sentBlockEmpty::fetch(td::TlParser &p) {
+  return make_object<hashable_sentBlockEmpty>(p);
+}
+
+hashable_sentBlockEmpty::hashable_sentBlockEmpty(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void hashable_sentBlockEmpty::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void hashable_sentBlockEmpty::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void hashable_sentBlockEmpty::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_sentBlockEmpty");
+    s.store_class_end();
+  }
+}
+
+hashable_vote::hashable_vote()
+  : block_()
+  , node_()
+{}
+
+hashable_vote::hashable_vote(std::int32_t block_, std::int32_t node_)
+  : block_(block_)
+  , node_(node_)
+{}
+
+const std::int32_t hashable_vote::ID;
+
+object_ptr<Hashable> hashable_vote::fetch(td::TlParser &p) {
+  return make_object<hashable_vote>(p);
+}
+
+hashable_vote::hashable_vote(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchInt::parse(p))
+  , node_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_vote::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(block_, s);
+  TlStoreBinary::store(node_, s);
+}
+
+void hashable_vote::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(block_, s);
+  TlStoreBinary::store(node_, s);
+}
+
+void hashable_vote::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_vote");
+    s.store_field("block", block_);
+    s.store_field("node", node_);
+    s.store_class_end();
+  }
+}
+
+hashable_blockCandidate::hashable_blockCandidate()
+  : block_()
+  , approved_()
+{}
+
+hashable_blockCandidate::hashable_blockCandidate(std::int32_t block_, std::int32_t approved_)
+  : block_(block_)
+  , approved_(approved_)
+{}
+
+const std::int32_t hashable_blockCandidate::ID;
+
+object_ptr<Hashable> hashable_blockCandidate::fetch(td::TlParser &p) {
+  return make_object<hashable_blockCandidate>(p);
+}
+
+hashable_blockCandidate::hashable_blockCandidate(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchInt::parse(p))
+  , approved_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_blockCandidate::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(block_, s);
+  TlStoreBinary::store(approved_, s);
+}
+
+void hashable_blockCandidate::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(block_, s);
+  TlStoreBinary::store(approved_, s);
+}
+
+void hashable_blockCandidate::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_blockCandidate");
+    s.store_field("block", block_);
+    s.store_field("approved", approved_);
+    s.store_class_end();
+  }
+}
+
+hashable_blockVoteCandidate::hashable_blockVoteCandidate()
+  : block_()
+  , approved_()
+{}
+
+hashable_blockVoteCandidate::hashable_blockVoteCandidate(std::int32_t block_, std::int32_t approved_)
+  : block_(block_)
+  , approved_(approved_)
+{}
+
+const std::int32_t hashable_blockVoteCandidate::ID;
+
+object_ptr<Hashable> hashable_blockVoteCandidate::fetch(td::TlParser &p) {
+  return make_object<hashable_blockVoteCandidate>(p);
+}
+
+hashable_blockVoteCandidate::hashable_blockVoteCandidate(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchInt::parse(p))
+  , approved_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_blockVoteCandidate::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(block_, s);
+  TlStoreBinary::store(approved_, s);
+}
+
+void hashable_blockVoteCandidate::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(block_, s);
+  TlStoreBinary::store(approved_, s);
+}
+
+void hashable_blockVoteCandidate::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_blockVoteCandidate");
+    s.store_field("block", block_);
+    s.store_field("approved", approved_);
+    s.store_class_end();
+  }
+}
+
+hashable_blockCandidateAttempt::hashable_blockCandidateAttempt()
+  : block_()
+  , votes_()
+{}
+
+hashable_blockCandidateAttempt::hashable_blockCandidateAttempt(std::int32_t block_, std::int32_t votes_)
+  : block_(block_)
+  , votes_(votes_)
+{}
+
+const std::int32_t hashable_blockCandidateAttempt::ID;
+
+object_ptr<Hashable> hashable_blockCandidateAttempt::fetch(td::TlParser &p) {
+  return make_object<hashable_blockCandidateAttempt>(p);
+}
+
+hashable_blockCandidateAttempt::hashable_blockCandidateAttempt(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchInt::parse(p))
+  , votes_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_blockCandidateAttempt::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(block_, s);
+  TlStoreBinary::store(votes_, s);
+}
+
+void hashable_blockCandidateAttempt::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(block_, s);
+  TlStoreBinary::store(votes_, s);
+}
+
+void hashable_blockCandidateAttempt::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_blockCandidateAttempt");
+    s.store_field("block", block_);
+    s.store_field("votes", votes_);
+    s.store_class_end();
+  }
+}
+
+hashable_cntVector::hashable_cntVector()
+  : data_()
+{}
+
+hashable_cntVector::hashable_cntVector(std::int32_t data_)
+  : data_(data_)
+{}
+
+const std::int32_t hashable_cntVector::ID;
+
+object_ptr<Hashable> hashable_cntVector::fetch(td::TlParser &p) {
+  return make_object<hashable_cntVector>(p);
+}
+
+hashable_cntVector::hashable_cntVector(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_cntVector::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(data_, s);
+}
+
+void hashable_cntVector::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(data_, s);
+}
+
+void hashable_cntVector::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_cntVector");
+    s.store_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+hashable_cntSortedVector::hashable_cntSortedVector()
+  : data_()
+{}
+
+hashable_cntSortedVector::hashable_cntSortedVector(std::int32_t data_)
+  : data_(data_)
+{}
+
+const std::int32_t hashable_cntSortedVector::ID;
+
+object_ptr<Hashable> hashable_cntSortedVector::fetch(td::TlParser &p) {
+  return make_object<hashable_cntSortedVector>(p);
+}
+
+hashable_cntSortedVector::hashable_cntSortedVector(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_cntSortedVector::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(data_, s);
+}
+
+void hashable_cntSortedVector::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(data_, s);
+}
+
+void hashable_cntSortedVector::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_cntSortedVector");
+    s.store_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+hashable_validatorSession::hashable_validatorSession()
+  : ts_()
+  , old_rounds_()
+  , cur_round_()
+{}
+
+hashable_validatorSession::hashable_validatorSession(std::int32_t ts_, std::int32_t old_rounds_, std::int32_t cur_round_)
+  : ts_(ts_)
+  , old_rounds_(old_rounds_)
+  , cur_round_(cur_round_)
+{}
+
+const std::int32_t hashable_validatorSession::ID;
+
+object_ptr<Hashable> hashable_validatorSession::fetch(td::TlParser &p) {
+  return make_object<hashable_validatorSession>(p);
+}
+
+hashable_validatorSession::hashable_validatorSession(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : ts_(TlFetchInt::parse(p))
+  , old_rounds_(TlFetchInt::parse(p))
+  , cur_round_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void hashable_validatorSession::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ts_, s);
+  TlStoreBinary::store(old_rounds_, s);
+  TlStoreBinary::store(cur_round_, s);
+}
+
+void hashable_validatorSession::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ts_, s);
+  TlStoreBinary::store(old_rounds_, s);
+  TlStoreBinary::store(cur_round_, s);
+}
+
+void hashable_validatorSession::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "hashable_validatorSession");
+    s.store_field("ts", ts_);
+    s.store_field("old_rounds", old_rounds_);
+    s.store_field("cur_round", cur_round_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<PrivateKey> PrivateKey::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case pk_unenc::ID:
+      return pk_unenc::fetch(p);
+    case pk_ed25519::ID:
+      return pk_ed25519::fetch(p);
+    case pk_aes::ID:
+      return pk_aes::fetch(p);
+    case pk_overlay::ID:
+      return pk_overlay::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+pk_unenc::pk_unenc()
+  : data_()
+{}
+
+pk_unenc::pk_unenc(td::BufferSlice &&data_)
+  : data_(std::move(data_))
+{}
+
+const std::int32_t pk_unenc::ID;
+
+object_ptr<PrivateKey> pk_unenc::fetch(td::TlParser &p) {
+  return make_object<pk_unenc>(p);
+}
+
+pk_unenc::pk_unenc(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void pk_unenc::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void pk_unenc::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void pk_unenc::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "pk_unenc");
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+pk_ed25519::pk_ed25519()
+  : key_()
+{}
+
+pk_ed25519::pk_ed25519(td::Bits256 const &key_)
+  : key_(key_)
+{}
+
+const std::int32_t pk_ed25519::ID;
+
+object_ptr<PrivateKey> pk_ed25519::fetch(td::TlParser &p) {
+  return make_object<pk_ed25519>(p);
+}
+
+pk_ed25519::pk_ed25519(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void pk_ed25519::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+}
+
+void pk_ed25519::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+}
+
+void pk_ed25519::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "pk_ed25519");
+    s.store_field("key", key_);
+    s.store_class_end();
+  }
+}
+
+pk_aes::pk_aes()
+  : key_()
+{}
+
+pk_aes::pk_aes(td::Bits256 const &key_)
+  : key_(key_)
+{}
+
+const std::int32_t pk_aes::ID;
+
+object_ptr<PrivateKey> pk_aes::fetch(td::TlParser &p) {
+  return make_object<pk_aes>(p);
+}
+
+pk_aes::pk_aes(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void pk_aes::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+}
+
+void pk_aes::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+}
+
+void pk_aes::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "pk_aes");
+    s.store_field("key", key_);
+    s.store_class_end();
+  }
+}
+
+pk_overlay::pk_overlay()
+  : name_()
+{}
+
+pk_overlay::pk_overlay(td::BufferSlice &&name_)
+  : name_(std::move(name_))
+{}
+
+const std::int32_t pk_overlay::ID;
+
+object_ptr<PrivateKey> pk_overlay::fetch(td::TlParser &p) {
+  return make_object<pk_overlay>(p);
+}
+
+pk_overlay::pk_overlay(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : name_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void pk_overlay::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(name_, s);
+}
+
+void pk_overlay::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(name_, s);
+}
+
+void pk_overlay::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "pk_overlay");
+    s.store_bytes_field("name", name_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<PublicKey> PublicKey::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case pub_unenc::ID:
+      return pub_unenc::fetch(p);
+    case pub_ed25519::ID:
+      return pub_ed25519::fetch(p);
+    case pub_aes::ID:
+      return pub_aes::fetch(p);
+    case pub_overlay::ID:
+      return pub_overlay::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+pub_unenc::pub_unenc()
+  : data_()
+{}
+
+pub_unenc::pub_unenc(td::BufferSlice &&data_)
+  : data_(std::move(data_))
+{}
+
+const std::int32_t pub_unenc::ID;
+
+object_ptr<PublicKey> pub_unenc::fetch(td::TlParser &p) {
+  return make_object<pub_unenc>(p);
+}
+
+pub_unenc::pub_unenc(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void pub_unenc::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void pub_unenc::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void pub_unenc::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "pub_unenc");
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+pub_ed25519::pub_ed25519()
+  : key_()
+{}
+
+pub_ed25519::pub_ed25519(td::Bits256 const &key_)
+  : key_(key_)
+{}
+
+const std::int32_t pub_ed25519::ID;
+
+object_ptr<PublicKey> pub_ed25519::fetch(td::TlParser &p) {
+  return make_object<pub_ed25519>(p);
+}
+
+pub_ed25519::pub_ed25519(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void pub_ed25519::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+}
+
+void pub_ed25519::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+}
+
+void pub_ed25519::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "pub_ed25519");
+    s.store_field("key", key_);
+    s.store_class_end();
+  }
+}
+
+pub_aes::pub_aes()
+  : key_()
+{}
+
+pub_aes::pub_aes(td::Bits256 const &key_)
+  : key_(key_)
+{}
+
+const std::int32_t pub_aes::ID;
+
+object_ptr<PublicKey> pub_aes::fetch(td::TlParser &p) {
+  return make_object<pub_aes>(p);
+}
+
+pub_aes::pub_aes(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void pub_aes::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+}
+
+void pub_aes::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+}
+
+void pub_aes::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "pub_aes");
+    s.store_field("key", key_);
+    s.store_class_end();
+  }
+}
+
+pub_overlay::pub_overlay()
+  : name_()
+{}
+
+pub_overlay::pub_overlay(td::BufferSlice &&name_)
+  : name_(std::move(name_))
+{}
+
+const std::int32_t pub_overlay::ID;
+
+object_ptr<PublicKey> pub_overlay::fetch(td::TlParser &p) {
+  return make_object<pub_overlay>(p);
+}
+
+pub_overlay::pub_overlay(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : name_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void pub_overlay::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(name_, s);
+}
+
+void pub_overlay::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(name_, s);
+}
+
+void pub_overlay::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "pub_overlay");
+    s.store_bytes_field("name", name_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<TestObject> TestObject::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case testObject::ID:
+      return testObject::fetch(p);
+    case testString::ID:
+      return testString::fetch(p);
+    case testInt::ID:
+      return testInt::fetch(p);
+    case testVectorBytes::ID:
+      return testVectorBytes::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+testObject::testObject()
+  : value_()
+  , o_()
+  , f_()
+{}
+
+testObject::testObject(std::int32_t value_, object_ptr<Object> &&o_, object_ptr<Function> &&f_)
+  : value_(value_)
+  , o_(std::move(o_))
+  , f_(std::move(f_))
+{}
+
+const std::int32_t testObject::ID;
+
+object_ptr<TestObject> testObject::fetch(td::TlParser &p) {
+  return make_object<testObject>(p);
+}
+
+testObject::testObject(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchInt::parse(p))
+  , o_(TlFetchObject<Object>::parse(p))
+  , f_(TlFetchObject<Function>::parse(p))
+#undef FAIL
+{}
+
+void testObject::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+  TlStoreObject::store(o_, s);
+  TlStoreObject::store(f_, s);
+}
+
+void testObject::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+  TlStoreObject::store(o_, s);
+  TlStoreObject::store(f_, s);
+}
+
+void testObject::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testObject");
+    s.store_field("value", value_);
+    if (o_ == nullptr) { s.store_field("o", "null"); } else { o_->store(s, "o"); }
+    if (f_ == nullptr) { s.store_field("f", "null"); } else { f_->store(s, "f"); }
+    s.store_class_end();
+  }
+}
+
+testString::testString()
+  : value_()
+{}
+
+testString::testString(std::string const &value_)
+  : value_(std::move(value_))
+{}
+
+const std::int32_t testString::ID;
+
+object_ptr<TestObject> testString::fetch(td::TlParser &p) {
+  return make_object<testString>(p);
+}
+
+testString::testString(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchString<std::string>::parse(p))
+#undef FAIL
+{}
+
+void testString::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(value_, s);
+}
+
+void testString::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(value_, s);
+}
+
+void testString::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testString");
+    s.store_field("value", value_);
+    s.store_class_end();
+  }
+}
+
+testInt::testInt()
+  : value_()
+{}
+
+testInt::testInt(std::int32_t value_)
+  : value_(value_)
+{}
+
+const std::int32_t testInt::ID;
+
+object_ptr<TestObject> testInt::fetch(td::TlParser &p) {
+  return make_object<testInt>(p);
+}
+
+testInt::testInt(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void testInt::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+}
+
+void testInt::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+}
+
+void testInt::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testInt");
+    s.store_field("value", value_);
+    s.store_class_end();
+  }
+}
+
+testVectorBytes::testVectorBytes()
+  : value_()
+{}
+
+testVectorBytes::testVectorBytes(std::vector<td::BufferSlice> &&value_)
+  : value_(std::move(value_))
+{}
+
+const std::int32_t testVectorBytes::ID;
+
+object_ptr<TestObject> testVectorBytes::fetch(td::TlParser &p) {
+  return make_object<testVectorBytes>(p);
+}
+
+testVectorBytes::testVectorBytes(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchVector<TlFetchBytes<td::BufferSlice>>::parse(p))
+#undef FAIL
+{}
+
+void testVectorBytes::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreString>::store(value_, s);
+}
+
+void testVectorBytes::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreString>::store(value_, s);
+}
+
+void testVectorBytes::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testVectorBytes");
+    { const std::vector<td::BufferSlice> &v = value_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("value", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_bytes_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+object_ptr<adnl_Address> adnl_Address::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case adnl_address_udp::ID:
+      return adnl_address_udp::fetch(p);
+    case adnl_address_udp6::ID:
+      return adnl_address_udp6::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+adnl_address_udp::adnl_address_udp()
+  : ip_()
+  , port_()
+{}
+
+adnl_address_udp::adnl_address_udp(std::int32_t ip_, std::int32_t port_)
+  : ip_(ip_)
+  , port_(port_)
+{}
+
+const std::int32_t adnl_address_udp::ID;
+
+object_ptr<adnl_Address> adnl_address_udp::fetch(td::TlParser &p) {
+  return make_object<adnl_address_udp>(p);
+}
+
+adnl_address_udp::adnl_address_udp(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : ip_(TlFetchInt::parse(p))
+  , port_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void adnl_address_udp::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void adnl_address_udp::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void adnl_address_udp::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_address_udp");
+    s.store_field("ip", ip_);
+    s.store_field("port", port_);
+    s.store_class_end();
+  }
+}
+
+adnl_address_udp6::adnl_address_udp6()
+  : ip_()
+  , port_()
+{}
+
+adnl_address_udp6::adnl_address_udp6(td::Bits128 const &ip_, std::int32_t port_)
+  : ip_(ip_)
+  , port_(port_)
+{}
+
+const std::int32_t adnl_address_udp6::ID;
+
+object_ptr<adnl_Address> adnl_address_udp6::fetch(td::TlParser &p) {
+  return make_object<adnl_address_udp6>(p);
+}
+
+adnl_address_udp6::adnl_address_udp6(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : ip_(TlFetchInt128::parse(p))
+  , port_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void adnl_address_udp6::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void adnl_address_udp6::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void adnl_address_udp6::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_address_udp6");
+    s.store_field("ip", ip_);
+    s.store_field("port", port_);
+    s.store_class_end();
+  }
+}
+
+adnl_addressList::adnl_addressList()
+  : addrs_()
+  , version_()
+  , reinit_date_()
+  , priority_()
+  , expire_at_()
+{}
+
+adnl_addressList::adnl_addressList(std::vector<object_ptr<adnl_Address>> &&addrs_, std::int32_t version_, std::int32_t reinit_date_, std::int32_t priority_, std::int32_t expire_at_)
+  : addrs_(std::move(addrs_))
+  , version_(version_)
+  , reinit_date_(reinit_date_)
+  , priority_(priority_)
+  , expire_at_(expire_at_)
+{}
+
+const std::int32_t adnl_addressList::ID;
+
+object_ptr<adnl_addressList> adnl_addressList::fetch(td::TlParser &p) {
+  return make_object<adnl_addressList>(p);
+}
+
+adnl_addressList::adnl_addressList(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : addrs_(TlFetchVector<TlFetchObject<adnl_Address>>::parse(p))
+  , version_(TlFetchInt::parse(p))
+  , reinit_date_(TlFetchInt::parse(p))
+  , priority_(TlFetchInt::parse(p))
+  , expire_at_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void adnl_addressList::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(addrs_, s);
+  TlStoreBinary::store(version_, s);
+  TlStoreBinary::store(reinit_date_, s);
+  TlStoreBinary::store(priority_, s);
+  TlStoreBinary::store(expire_at_, s);
+}
+
+void adnl_addressList::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(addrs_, s);
+  TlStoreBinary::store(version_, s);
+  TlStoreBinary::store(reinit_date_, s);
+  TlStoreBinary::store(priority_, s);
+  TlStoreBinary::store(expire_at_, s);
+}
+
+void adnl_addressList::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_addressList");
+    { const std::vector<object_ptr<adnl_Address>> &v = addrs_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("addrs", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_field("version", version_);
+    s.store_field("reinit_date", reinit_date_);
+    s.store_field("priority", priority_);
+    s.store_field("expire_at", expire_at_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<adnl_Message> adnl_Message::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case adnl_message_createChannel::ID:
+      return adnl_message_createChannel::fetch(p);
+    case adnl_message_confirmChannel::ID:
+      return adnl_message_confirmChannel::fetch(p);
+    case adnl_message_custom::ID:
+      return adnl_message_custom::fetch(p);
+    case adnl_message_nop::ID:
+      return adnl_message_nop::fetch(p);
+    case adnl_message_reinit::ID:
+      return adnl_message_reinit::fetch(p);
+    case adnl_message_query::ID:
+      return adnl_message_query::fetch(p);
+    case adnl_message_answer::ID:
+      return adnl_message_answer::fetch(p);
+    case adnl_message_part::ID:
+      return adnl_message_part::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+adnl_message_createChannel::adnl_message_createChannel()
+  : key_()
+  , date_()
+{}
+
+adnl_message_createChannel::adnl_message_createChannel(td::Bits256 const &key_, std::int32_t date_)
+  : key_(key_)
+  , date_(date_)
+{}
+
+const std::int32_t adnl_message_createChannel::ID;
+
+object_ptr<adnl_Message> adnl_message_createChannel::fetch(td::TlParser &p) {
+  return make_object<adnl_message_createChannel>(p);
+}
+
+adnl_message_createChannel::adnl_message_createChannel(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchInt256::parse(p))
+  , date_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void adnl_message_createChannel::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+  TlStoreBinary::store(date_, s);
+}
+
+void adnl_message_createChannel::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+  TlStoreBinary::store(date_, s);
+}
+
+void adnl_message_createChannel::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_message_createChannel");
+    s.store_field("key", key_);
+    s.store_field("date", date_);
+    s.store_class_end();
+  }
+}
+
+adnl_message_confirmChannel::adnl_message_confirmChannel()
+  : key_()
+  , peer_key_()
+  , date_()
+{}
+
+adnl_message_confirmChannel::adnl_message_confirmChannel(td::Bits256 const &key_, td::Bits256 const &peer_key_, std::int32_t date_)
+  : key_(key_)
+  , peer_key_(peer_key_)
+  , date_(date_)
+{}
+
+const std::int32_t adnl_message_confirmChannel::ID;
+
+object_ptr<adnl_Message> adnl_message_confirmChannel::fetch(td::TlParser &p) {
+  return make_object<adnl_message_confirmChannel>(p);
+}
+
+adnl_message_confirmChannel::adnl_message_confirmChannel(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchInt256::parse(p))
+  , peer_key_(TlFetchInt256::parse(p))
+  , date_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void adnl_message_confirmChannel::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+  TlStoreBinary::store(peer_key_, s);
+  TlStoreBinary::store(date_, s);
+}
+
+void adnl_message_confirmChannel::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+  TlStoreBinary::store(peer_key_, s);
+  TlStoreBinary::store(date_, s);
+}
+
+void adnl_message_confirmChannel::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_message_confirmChannel");
+    s.store_field("key", key_);
+    s.store_field("peer_key", peer_key_);
+    s.store_field("date", date_);
+    s.store_class_end();
+  }
+}
+
+adnl_message_custom::adnl_message_custom()
+  : data_()
+{}
+
+adnl_message_custom::adnl_message_custom(td::BufferSlice &&data_)
+  : data_(std::move(data_))
+{}
+
+const std::int32_t adnl_message_custom::ID;
+
+object_ptr<adnl_Message> adnl_message_custom::fetch(td::TlParser &p) {
+  return make_object<adnl_message_custom>(p);
+}
+
+adnl_message_custom::adnl_message_custom(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void adnl_message_custom::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void adnl_message_custom::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void adnl_message_custom::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_message_custom");
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+adnl_message_nop::adnl_message_nop() {
+}
+
+const std::int32_t adnl_message_nop::ID;
+
+object_ptr<adnl_Message> adnl_message_nop::fetch(td::TlParser &p) {
+  return make_object<adnl_message_nop>(p);
+}
+
+adnl_message_nop::adnl_message_nop(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void adnl_message_nop::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void adnl_message_nop::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void adnl_message_nop::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_message_nop");
+    s.store_class_end();
+  }
+}
+
+adnl_message_reinit::adnl_message_reinit()
+  : date_()
+{}
+
+adnl_message_reinit::adnl_message_reinit(std::int32_t date_)
+  : date_(date_)
+{}
+
+const std::int32_t adnl_message_reinit::ID;
+
+object_ptr<adnl_Message> adnl_message_reinit::fetch(td::TlParser &p) {
+  return make_object<adnl_message_reinit>(p);
+}
+
+adnl_message_reinit::adnl_message_reinit(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : date_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void adnl_message_reinit::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(date_, s);
+}
+
+void adnl_message_reinit::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(date_, s);
+}
+
+void adnl_message_reinit::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_message_reinit");
+    s.store_field("date", date_);
+    s.store_class_end();
+  }
+}
+
+adnl_message_query::adnl_message_query()
+  : query_id_()
+  , query_()
+{}
+
+adnl_message_query::adnl_message_query(td::Bits256 const &query_id_, td::BufferSlice &&query_)
+  : query_id_(query_id_)
+  , query_(std::move(query_))
+{}
+
+const std::int32_t adnl_message_query::ID;
+
+object_ptr<adnl_Message> adnl_message_query::fetch(td::TlParser &p) {
+  return make_object<adnl_message_query>(p);
+}
+
+adnl_message_query::adnl_message_query(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : query_id_(TlFetchInt256::parse(p))
+  , query_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void adnl_message_query::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(query_id_, s);
+  TlStoreString::store(query_, s);
+}
+
+void adnl_message_query::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(query_id_, s);
+  TlStoreString::store(query_, s);
+}
+
+void adnl_message_query::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_message_query");
+    s.store_field("query_id", query_id_);
+    s.store_bytes_field("query", query_);
+    s.store_class_end();
+  }
+}
+
+adnl_message_answer::adnl_message_answer()
+  : query_id_()
+  , answer_()
+{}
+
+adnl_message_answer::adnl_message_answer(td::Bits256 const &query_id_, td::BufferSlice &&answer_)
+  : query_id_(query_id_)
+  , answer_(std::move(answer_))
+{}
+
+const std::int32_t adnl_message_answer::ID;
+
+object_ptr<adnl_Message> adnl_message_answer::fetch(td::TlParser &p) {
+  return make_object<adnl_message_answer>(p);
+}
+
+adnl_message_answer::adnl_message_answer(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : query_id_(TlFetchInt256::parse(p))
+  , answer_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void adnl_message_answer::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(query_id_, s);
+  TlStoreString::store(answer_, s);
+}
+
+void adnl_message_answer::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(query_id_, s);
+  TlStoreString::store(answer_, s);
+}
+
+void adnl_message_answer::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_message_answer");
+    s.store_field("query_id", query_id_);
+    s.store_bytes_field("answer", answer_);
+    s.store_class_end();
+  }
+}
+
+adnl_message_part::adnl_message_part()
+  : hash_()
+  , total_size_()
+  , offset_()
+  , data_()
+{}
+
+adnl_message_part::adnl_message_part(td::Bits256 const &hash_, std::int32_t total_size_, std::int32_t offset_, td::BufferSlice &&data_)
+  : hash_(hash_)
+  , total_size_(total_size_)
+  , offset_(offset_)
+  , data_(std::move(data_))
+{}
+
+const std::int32_t adnl_message_part::ID;
+
+object_ptr<adnl_Message> adnl_message_part::fetch(td::TlParser &p) {
+  return make_object<adnl_message_part>(p);
+}
+
+adnl_message_part::adnl_message_part(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : hash_(TlFetchInt256::parse(p))
+  , total_size_(TlFetchInt::parse(p))
+  , offset_(TlFetchInt::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void adnl_message_part::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(hash_, s);
+  TlStoreBinary::store(total_size_, s);
+  TlStoreBinary::store(offset_, s);
+  TlStoreString::store(data_, s);
+}
+
+void adnl_message_part::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(hash_, s);
+  TlStoreBinary::store(total_size_, s);
+  TlStoreBinary::store(offset_, s);
+  TlStoreString::store(data_, s);
+}
+
+void adnl_message_part::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_message_part");
+    s.store_field("hash", hash_);
+    s.store_field("total_size", total_size_);
+    s.store_field("offset", offset_);
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+adnl_node::adnl_node()
+  : id_()
+  , addr_list_()
+{}
+
+adnl_node::adnl_node(object_ptr<PublicKey> &&id_, object_ptr<adnl_addressList> &&addr_list_)
+  : id_(std::move(id_))
+  , addr_list_(std::move(addr_list_))
+{}
+
+const std::int32_t adnl_node::ID;
+
+object_ptr<adnl_node> adnl_node::fetch(td::TlParser &p) {
+  return make_object<adnl_node>(p);
+}
+
+adnl_node::adnl_node(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<PublicKey>::parse(p))
+  , addr_list_(TlFetchObject<adnl_addressList>::parse(p))
+#undef FAIL
+{}
+
+void adnl_node::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreObject::store(addr_list_, s);
+}
+
+void adnl_node::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreObject::store(addr_list_, s);
+}
+
+void adnl_node::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_node");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    if (addr_list_ == nullptr) { s.store_field("addr_list", "null"); } else { addr_list_->store(s, "addr_list"); }
+    s.store_class_end();
+  }
+}
+
+adnl_nodes::adnl_nodes()
+  : nodes_()
+{}
+
+adnl_nodes::adnl_nodes(std::vector<object_ptr<adnl_node>> &&nodes_)
+  : nodes_(std::move(nodes_))
+{}
+
+const std::int32_t adnl_nodes::ID;
+
+object_ptr<adnl_nodes> adnl_nodes::fetch(td::TlParser &p) {
+  return make_object<adnl_nodes>(p);
+}
+
+adnl_nodes::adnl_nodes(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : nodes_(TlFetchVector<TlFetchObject<adnl_node>>::parse(p))
+#undef FAIL
+{}
+
+void adnl_nodes::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(nodes_, s);
+}
+
+void adnl_nodes::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(nodes_, s);
+}
+
+void adnl_nodes::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_nodes");
+    { const std::vector<object_ptr<adnl_node>> &v = nodes_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("nodes", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+adnl_packetContents::adnl_packetContents()
+  : rand1_()
+  , flags_()
+  , from_()
+  , from_short_()
+  , message_()
+  , messages_()
+  , address_()
+  , priority_address_()
+  , seqno_()
+  , confirm_seqno_()
+  , recv_addr_list_version_()
+  , recv_priority_addr_list_version_()
+  , reinit_date_()
+  , dst_reinit_date_()
+  , signature_()
+  , rand2_()
+{}
+
+adnl_packetContents::adnl_packetContents(td::BufferSlice &&rand1_, std::int32_t flags_, object_ptr<PublicKey> &&from_, object_ptr<adnl_id_short> &&from_short_, object_ptr<adnl_Message> &&message_, std::vector<object_ptr<adnl_Message>> &&messages_, object_ptr<adnl_addressList> &&address_, object_ptr<adnl_addressList> &&priority_address_, std::int64_t seqno_, std::int64_t confirm_seqno_, std::int32_t recv_addr_list_version_, std::int32_t recv_priority_addr_list_version_, std::int32_t reinit_date_, std::int32_t dst_reinit_date_, td::BufferSlice &&signature_, td::BufferSlice &&rand2_)
+  : rand1_(std::move(rand1_))
+  , flags_(flags_)
+  , from_(std::move(from_))
+  , from_short_(std::move(from_short_))
+  , message_(std::move(message_))
+  , messages_(std::move(messages_))
+  , address_(std::move(address_))
+  , priority_address_(std::move(priority_address_))
+  , seqno_(seqno_)
+  , confirm_seqno_(confirm_seqno_)
+  , recv_addr_list_version_(recv_addr_list_version_)
+  , recv_priority_addr_list_version_(recv_priority_addr_list_version_)
+  , reinit_date_(reinit_date_)
+  , dst_reinit_date_(dst_reinit_date_)
+  , signature_(std::move(signature_))
+  , rand2_(std::move(rand2_))
+{}
+
+const std::int32_t adnl_packetContents::ID;
+
+object_ptr<adnl_packetContents> adnl_packetContents::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<adnl_packetContents> res = make_object<adnl_packetContents>();
+  std::int32_t var0;
+  res->rand1_ = TlFetchBytes<td::BufferSlice>::parse(p);
+  if ((var0 = res->flags_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  if (var0 & 1) { res->from_ = TlFetchObject<PublicKey>::parse(p); }
+  if (var0 & 2) { res->from_short_ = TlFetchObject<adnl_id_short>::parse(p); }
+  if (var0 & 4) { res->message_ = TlFetchObject<adnl_Message>::parse(p); }
+  if (var0 & 8) { res->messages_ = TlFetchVector<TlFetchObject<adnl_Message>>::parse(p); }
+  if (var0 & 16) { res->address_ = TlFetchObject<adnl_addressList>::parse(p); }
+  if (var0 & 32) { res->priority_address_ = TlFetchObject<adnl_addressList>::parse(p); }
+  if (var0 & 64) { res->seqno_ = TlFetchLong::parse(p); }
+  if (var0 & 128) { res->confirm_seqno_ = TlFetchLong::parse(p); }
+  if (var0 & 256) { res->recv_addr_list_version_ = TlFetchInt::parse(p); }
+  if (var0 & 512) { res->recv_priority_addr_list_version_ = TlFetchInt::parse(p); }
+  if (var0 & 1024) { res->reinit_date_ = TlFetchInt::parse(p); }
+  if (var0 & 1024) { res->dst_reinit_date_ = TlFetchInt::parse(p); }
+  if (var0 & 2048) { res->signature_ = TlFetchBytes<td::BufferSlice>::parse(p); }
+  res->rand2_ = TlFetchBytes<td::BufferSlice>::parse(p);
+  if (p.get_error()) { FAIL(""); }
+  return res;
+#undef FAIL
+}
+
+void adnl_packetContents::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreString::store(rand1_, s);
+  TlStoreBinary::store((var0 = flags_), s);
+  if (var0 & 1) { TlStoreBoxedUnknown<TlStoreObject>::store(from_, s); }
+  if (var0 & 2) { TlStoreObject::store(from_short_, s); }
+  if (var0 & 4) { TlStoreBoxedUnknown<TlStoreObject>::store(message_, s); }
+  if (var0 & 8) { TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(messages_, s); }
+  if (var0 & 16) { TlStoreObject::store(address_, s); }
+  if (var0 & 32) { TlStoreObject::store(priority_address_, s); }
+  if (var0 & 64) { TlStoreBinary::store(seqno_, s); }
+  if (var0 & 128) { TlStoreBinary::store(confirm_seqno_, s); }
+  if (var0 & 256) { TlStoreBinary::store(recv_addr_list_version_, s); }
+  if (var0 & 512) { TlStoreBinary::store(recv_priority_addr_list_version_, s); }
+  if (var0 & 1024) { TlStoreBinary::store(reinit_date_, s); }
+  if (var0 & 1024) { TlStoreBinary::store(dst_reinit_date_, s); }
+  if (var0 & 2048) { TlStoreString::store(signature_, s); }
+  TlStoreString::store(rand2_, s);
+}
+
+void adnl_packetContents::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreString::store(rand1_, s);
+  TlStoreBinary::store((var0 = flags_), s);
+  if (var0 & 1) { TlStoreBoxedUnknown<TlStoreObject>::store(from_, s); }
+  if (var0 & 2) { TlStoreObject::store(from_short_, s); }
+  if (var0 & 4) { TlStoreBoxedUnknown<TlStoreObject>::store(message_, s); }
+  if (var0 & 8) { TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(messages_, s); }
+  if (var0 & 16) { TlStoreObject::store(address_, s); }
+  if (var0 & 32) { TlStoreObject::store(priority_address_, s); }
+  if (var0 & 64) { TlStoreBinary::store(seqno_, s); }
+  if (var0 & 128) { TlStoreBinary::store(confirm_seqno_, s); }
+  if (var0 & 256) { TlStoreBinary::store(recv_addr_list_version_, s); }
+  if (var0 & 512) { TlStoreBinary::store(recv_priority_addr_list_version_, s); }
+  if (var0 & 1024) { TlStoreBinary::store(reinit_date_, s); }
+  if (var0 & 1024) { TlStoreBinary::store(dst_reinit_date_, s); }
+  if (var0 & 2048) { TlStoreString::store(signature_, s); }
+  TlStoreString::store(rand2_, s);
+}
+
+void adnl_packetContents::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_packetContents");
+  std::int32_t var0;
+    s.store_bytes_field("rand1", rand1_);
+    s.store_field("flags", (var0 = flags_));
+    if (var0 & 1) { if (from_ == nullptr) { s.store_field("from", "null"); } else { from_->store(s, "from"); } }
+    if (var0 & 2) { if (from_short_ == nullptr) { s.store_field("from_short", "null"); } else { from_short_->store(s, "from_short"); } }
+    if (var0 & 4) { if (message_ == nullptr) { s.store_field("message", "null"); } else { message_->store(s, "message"); } }
+    if (var0 & 8) { { const std::vector<object_ptr<adnl_Message>> &v = messages_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("messages", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); } }
+    if (var0 & 16) { if (address_ == nullptr) { s.store_field("address", "null"); } else { address_->store(s, "address"); } }
+    if (var0 & 32) { if (priority_address_ == nullptr) { s.store_field("priority_address", "null"); } else { priority_address_->store(s, "priority_address"); } }
+    if (var0 & 64) { s.store_field("seqno", seqno_); }
+    if (var0 & 128) { s.store_field("confirm_seqno", confirm_seqno_); }
+    if (var0 & 256) { s.store_field("recv_addr_list_version", recv_addr_list_version_); }
+    if (var0 & 512) { s.store_field("recv_priority_addr_list_version", recv_priority_addr_list_version_); }
+    if (var0 & 1024) { s.store_field("reinit_date", reinit_date_); }
+    if (var0 & 1024) { s.store_field("dst_reinit_date", dst_reinit_date_); }
+    if (var0 & 2048) { s.store_bytes_field("signature", signature_); }
+    s.store_bytes_field("rand2", rand2_);
+    s.store_class_end();
+  }
+}
+
+adnl_pong::adnl_pong()
+  : value_()
+{}
+
+adnl_pong::adnl_pong(std::int64_t value_)
+  : value_(value_)
+{}
+
+const std::int32_t adnl_pong::ID;
+
+object_ptr<adnl_pong> adnl_pong::fetch(td::TlParser &p) {
+  return make_object<adnl_pong>(p);
+}
+
+adnl_pong::adnl_pong(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void adnl_pong::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+}
+
+void adnl_pong::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(value_, s);
+}
+
+void adnl_pong::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_pong");
+    s.store_field("value", value_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<adnl_Proxy> adnl_Proxy::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case adnl_proxy_none::ID:
+      return adnl_proxy_none::fetch(p);
+    case adnl_proxy_fast::ID:
+      return adnl_proxy_fast::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+adnl_proxy_none::adnl_proxy_none() {
+}
+
+const std::int32_t adnl_proxy_none::ID;
+
+object_ptr<adnl_Proxy> adnl_proxy_none::fetch(td::TlParser &p) {
+  return make_object<adnl_proxy_none>(p);
+}
+
+adnl_proxy_none::adnl_proxy_none(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void adnl_proxy_none::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void adnl_proxy_none::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void adnl_proxy_none::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_proxy_none");
+    s.store_class_end();
+  }
+}
+
+adnl_proxy_fast::adnl_proxy_fast()
+  : shared_secret_()
+{}
+
+adnl_proxy_fast::adnl_proxy_fast(td::BufferSlice &&shared_secret_)
+  : shared_secret_(std::move(shared_secret_))
+{}
+
+const std::int32_t adnl_proxy_fast::ID;
+
+object_ptr<adnl_Proxy> adnl_proxy_fast::fetch(td::TlParser &p) {
+  return make_object<adnl_proxy_fast>(p);
+}
+
+adnl_proxy_fast::adnl_proxy_fast(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : shared_secret_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void adnl_proxy_fast::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(shared_secret_, s);
+}
+
+void adnl_proxy_fast::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(shared_secret_, s);
+}
+
+void adnl_proxy_fast::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_proxy_fast");
+    s.store_bytes_field("shared_secret", shared_secret_);
+    s.store_class_end();
+  }
+}
+
+adnl_proxyToFastHash::adnl_proxyToFastHash()
+  : ip_()
+  , port_()
+  , date_()
+  , data_hash_()
+  , shared_secret_()
+{}
+
+adnl_proxyToFastHash::adnl_proxyToFastHash(std::int32_t ip_, std::int32_t port_, std::int32_t date_, td::Bits256 const &data_hash_, td::Bits256 const &shared_secret_)
+  : ip_(ip_)
+  , port_(port_)
+  , date_(date_)
+  , data_hash_(data_hash_)
+  , shared_secret_(shared_secret_)
+{}
+
+const std::int32_t adnl_proxyToFastHash::ID;
+
+object_ptr<adnl_proxyToFastHash> adnl_proxyToFastHash::fetch(td::TlParser &p) {
+  return make_object<adnl_proxyToFastHash>(p);
+}
+
+adnl_proxyToFastHash::adnl_proxyToFastHash(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : ip_(TlFetchInt::parse(p))
+  , port_(TlFetchInt::parse(p))
+  , date_(TlFetchInt::parse(p))
+  , data_hash_(TlFetchInt256::parse(p))
+  , shared_secret_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void adnl_proxyToFastHash::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreBinary::store(date_, s);
+  TlStoreBinary::store(data_hash_, s);
+  TlStoreBinary::store(shared_secret_, s);
+}
+
+void adnl_proxyToFastHash::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreBinary::store(date_, s);
+  TlStoreBinary::store(data_hash_, s);
+  TlStoreBinary::store(shared_secret_, s);
+}
+
+void adnl_proxyToFastHash::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_proxyToFastHash");
+    s.store_field("ip", ip_);
+    s.store_field("port", port_);
+    s.store_field("date", date_);
+    s.store_field("data_hash", data_hash_);
+    s.store_field("shared_secret", shared_secret_);
+    s.store_class_end();
+  }
+}
+
+adnl_proxyToFast::adnl_proxyToFast()
+  : ip_()
+  , port_()
+  , date_()
+  , signature_()
+{}
+
+adnl_proxyToFast::adnl_proxyToFast(std::int32_t ip_, std::int32_t port_, std::int32_t date_, td::Bits256 const &signature_)
+  : ip_(ip_)
+  , port_(port_)
+  , date_(date_)
+  , signature_(signature_)
+{}
+
+const std::int32_t adnl_proxyToFast::ID;
+
+object_ptr<adnl_proxyToFast> adnl_proxyToFast::fetch(td::TlParser &p) {
+  return make_object<adnl_proxyToFast>(p);
+}
+
+adnl_proxyToFast::adnl_proxyToFast(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : ip_(TlFetchInt::parse(p))
+  , port_(TlFetchInt::parse(p))
+  , date_(TlFetchInt::parse(p))
+  , signature_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void adnl_proxyToFast::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreBinary::store(date_, s);
+  TlStoreBinary::store(signature_, s);
+}
+
+void adnl_proxyToFast::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreBinary::store(date_, s);
+  TlStoreBinary::store(signature_, s);
+}
+
+void adnl_proxyToFast::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_proxyToFast");
+    s.store_field("ip", ip_);
+    s.store_field("port", port_);
+    s.store_field("date", date_);
+    s.store_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+adnl_config_global::adnl_config_global()
+  : static_nodes_()
+{}
+
+adnl_config_global::adnl_config_global(object_ptr<adnl_nodes> &&static_nodes_)
+  : static_nodes_(std::move(static_nodes_))
+{}
+
+const std::int32_t adnl_config_global::ID;
+
+object_ptr<adnl_config_global> adnl_config_global::fetch(td::TlParser &p) {
+  return make_object<adnl_config_global>(p);
+}
+
+adnl_config_global::adnl_config_global(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : static_nodes_(TlFetchObject<adnl_nodes>::parse(p))
+#undef FAIL
+{}
+
+void adnl_config_global::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(static_nodes_, s);
+}
+
+void adnl_config_global::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(static_nodes_, s);
+}
+
+void adnl_config_global::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_config_global");
+    if (static_nodes_ == nullptr) { s.store_field("static_nodes", "null"); } else { static_nodes_->store(s, "static_nodes"); }
+    s.store_class_end();
+  }
+}
+
+adnl_db_node_key::adnl_db_node_key()
+  : local_id_()
+  , peer_id_()
+{}
+
+adnl_db_node_key::adnl_db_node_key(td::Bits256 const &local_id_, td::Bits256 const &peer_id_)
+  : local_id_(local_id_)
+  , peer_id_(peer_id_)
+{}
+
+const std::int32_t adnl_db_node_key::ID;
+
+object_ptr<adnl_db_node_key> adnl_db_node_key::fetch(td::TlParser &p) {
+  return make_object<adnl_db_node_key>(p);
+}
+
+adnl_db_node_key::adnl_db_node_key(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : local_id_(TlFetchInt256::parse(p))
+  , peer_id_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void adnl_db_node_key::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(local_id_, s);
+  TlStoreBinary::store(peer_id_, s);
+}
+
+void adnl_db_node_key::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(local_id_, s);
+  TlStoreBinary::store(peer_id_, s);
+}
+
+void adnl_db_node_key::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_db_node_key");
+    s.store_field("local_id", local_id_);
+    s.store_field("peer_id", peer_id_);
+    s.store_class_end();
+  }
+}
+
+adnl_db_node_value::adnl_db_node_value()
+  : date_()
+  , id_()
+  , addr_list_()
+  , priority_addr_list_()
+{}
+
+adnl_db_node_value::adnl_db_node_value(std::int32_t date_, object_ptr<PublicKey> &&id_, object_ptr<adnl_addressList> &&addr_list_, object_ptr<adnl_addressList> &&priority_addr_list_)
+  : date_(date_)
+  , id_(std::move(id_))
+  , addr_list_(std::move(addr_list_))
+  , priority_addr_list_(std::move(priority_addr_list_))
+{}
+
+const std::int32_t adnl_db_node_value::ID;
+
+object_ptr<adnl_db_node_value> adnl_db_node_value::fetch(td::TlParser &p) {
+  return make_object<adnl_db_node_value>(p);
+}
+
+adnl_db_node_value::adnl_db_node_value(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : date_(TlFetchInt::parse(p))
+  , id_(TlFetchObject<PublicKey>::parse(p))
+  , addr_list_(TlFetchObject<adnl_addressList>::parse(p))
+  , priority_addr_list_(TlFetchObject<adnl_addressList>::parse(p))
+#undef FAIL
+{}
+
+void adnl_db_node_value::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(date_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreObject::store(addr_list_, s);
+  TlStoreObject::store(priority_addr_list_, s);
+}
+
+void adnl_db_node_value::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(date_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreObject::store(addr_list_, s);
+  TlStoreObject::store(priority_addr_list_, s);
+}
+
+void adnl_db_node_value::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_db_node_value");
+    s.store_field("date", date_);
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    if (addr_list_ == nullptr) { s.store_field("addr_list", "null"); } else { addr_list_->store(s, "addr_list"); }
+    if (priority_addr_list_ == nullptr) { s.store_field("priority_addr_list", "null"); } else { priority_addr_list_->store(s, "priority_addr_list"); }
+    s.store_class_end();
+  }
+}
+
+adnl_id_short::adnl_id_short()
+  : id_()
+{}
+
+adnl_id_short::adnl_id_short(td::Bits256 const &id_)
+  : id_(id_)
+{}
+
+const std::int32_t adnl_id_short::ID;
+
+object_ptr<adnl_id_short> adnl_id_short::fetch(td::TlParser &p) {
+  return make_object<adnl_id_short>(p);
+}
+
+adnl_id_short::adnl_id_short(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void adnl_id_short::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+}
+
+void adnl_id_short::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+}
+
+void adnl_id_short::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_id_short");
+    s.store_field("id", id_);
+    s.store_class_end();
+  }
+}
+
+catchain_block::catchain_block()
+  : incarnation_()
+  , src_()
+  , height_()
+  , data_()
+  , signature_()
+{}
+
+catchain_block::catchain_block(td::Bits256 const &incarnation_, std::int32_t src_, std::int32_t height_, object_ptr<catchain_block_data> &&data_, td::BufferSlice &&signature_)
+  : incarnation_(incarnation_)
+  , src_(src_)
+  , height_(height_)
+  , data_(std::move(data_))
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t catchain_block::ID;
+
+object_ptr<catchain_block> catchain_block::fetch(td::TlParser &p) {
+  return make_object<catchain_block>(p);
+}
+
+catchain_block::catchain_block(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : incarnation_(TlFetchInt256::parse(p))
+  , src_(TlFetchInt::parse(p))
+  , height_(TlFetchInt::parse(p))
+  , data_(TlFetchObject<catchain_block_data>::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void catchain_block::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(incarnation_, s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(height_, s);
+  TlStoreObject::store(data_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void catchain_block::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(incarnation_, s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(height_, s);
+  TlStoreObject::store(data_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void catchain_block::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_block");
+    s.store_field("incarnation", incarnation_);
+    s.store_field("src", src_);
+    s.store_field("height", height_);
+    if (data_ == nullptr) { s.store_field("data", "null"); } else { data_->store(s, "data"); }
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<catchain_BlockResult> catchain_BlockResult::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case catchain_blockNotFound::ID:
+      return catchain_blockNotFound::fetch(p);
+    case catchain_blockResult::ID:
+      return catchain_blockResult::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+catchain_blockNotFound::catchain_blockNotFound() {
+}
+
+const std::int32_t catchain_blockNotFound::ID;
+
+object_ptr<catchain_BlockResult> catchain_blockNotFound::fetch(td::TlParser &p) {
+  return make_object<catchain_blockNotFound>(p);
+}
+
+catchain_blockNotFound::catchain_blockNotFound(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void catchain_blockNotFound::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void catchain_blockNotFound::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void catchain_blockNotFound::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_blockNotFound");
+    s.store_class_end();
+  }
+}
+
+catchain_blockResult::catchain_blockResult()
+  : block_()
+{}
+
+catchain_blockResult::catchain_blockResult(object_ptr<catchain_block> &&block_)
+  : block_(std::move(block_))
+{}
+
+const std::int32_t catchain_blockResult::ID;
+
+object_ptr<catchain_BlockResult> catchain_blockResult::fetch(td::TlParser &p) {
+  return make_object<catchain_blockResult>(p);
+}
+
+catchain_blockResult::catchain_blockResult(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<catchain_block>::parse(p))
+#undef FAIL
+{}
+
+void catchain_blockResult::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void catchain_blockResult::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void catchain_blockResult::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_blockResult");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_class_end();
+  }
+}
+
+catchain_blocks::catchain_blocks()
+  : blocks_()
+{}
+
+catchain_blocks::catchain_blocks(std::vector<object_ptr<catchain_block>> &&blocks_)
+  : blocks_(std::move(blocks_))
+{}
+
+const std::int32_t catchain_blocks::ID;
+
+object_ptr<catchain_blocks> catchain_blocks::fetch(td::TlParser &p) {
+  return make_object<catchain_blocks>(p);
+}
+
+catchain_blocks::catchain_blocks(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : blocks_(TlFetchVector<TlFetchObject<catchain_block>>::parse(p))
+#undef FAIL
+{}
+
+void catchain_blocks::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(blocks_, s);
+}
+
+void catchain_blocks::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(blocks_, s);
+}
+
+void catchain_blocks::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_blocks");
+    { const std::vector<object_ptr<catchain_block>> &v = blocks_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("blocks", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+object_ptr<catchain_Difference> catchain_Difference::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case catchain_difference::ID:
+      return catchain_difference::fetch(p);
+    case catchain_differenceFork::ID:
+      return catchain_differenceFork::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+catchain_difference::catchain_difference()
+  : sent_upto_()
+{}
+
+catchain_difference::catchain_difference(std::vector<std::int32_t> &&sent_upto_)
+  : sent_upto_(std::move(sent_upto_))
+{}
+
+const std::int32_t catchain_difference::ID;
+
+object_ptr<catchain_Difference> catchain_difference::fetch(td::TlParser &p) {
+  return make_object<catchain_difference>(p);
+}
+
+catchain_difference::catchain_difference(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : sent_upto_(TlFetchVector<TlFetchInt>::parse(p))
+#undef FAIL
+{}
+
+void catchain_difference::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreBinary>::store(sent_upto_, s);
+}
+
+void catchain_difference::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreBinary>::store(sent_upto_, s);
+}
+
+void catchain_difference::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_difference");
+    { const std::vector<std::int32_t> &v = sent_upto_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("sent_upto", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+catchain_differenceFork::catchain_differenceFork()
+  : left_()
+  , right_()
+{}
+
+catchain_differenceFork::catchain_differenceFork(object_ptr<catchain_block_dep> &&left_, object_ptr<catchain_block_dep> &&right_)
+  : left_(std::move(left_))
+  , right_(std::move(right_))
+{}
+
+const std::int32_t catchain_differenceFork::ID;
+
+object_ptr<catchain_Difference> catchain_differenceFork::fetch(td::TlParser &p) {
+  return make_object<catchain_differenceFork>(p);
+}
+
+catchain_differenceFork::catchain_differenceFork(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : left_(TlFetchObject<catchain_block_dep>::parse(p))
+  , right_(TlFetchObject<catchain_block_dep>::parse(p))
+#undef FAIL
+{}
+
+void catchain_differenceFork::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(left_, s);
+  TlStoreObject::store(right_, s);
+}
+
+void catchain_differenceFork::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(left_, s);
+  TlStoreObject::store(right_, s);
+}
+
+void catchain_differenceFork::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_differenceFork");
+    if (left_ == nullptr) { s.store_field("left", "null"); } else { left_->store(s, "left"); }
+    if (right_ == nullptr) { s.store_field("right", "null"); } else { right_->store(s, "right"); }
+    s.store_class_end();
+  }
+}
+
+catchain_firstblock::catchain_firstblock()
+  : unique_hash_()
+  , nodes_()
+{}
+
+catchain_firstblock::catchain_firstblock(td::Bits256 const &unique_hash_, std::vector<td::Bits256> &&nodes_)
+  : unique_hash_(unique_hash_)
+  , nodes_(std::move(nodes_))
+{}
+
+const std::int32_t catchain_firstblock::ID;
+
+object_ptr<catchain_firstblock> catchain_firstblock::fetch(td::TlParser &p) {
+  return make_object<catchain_firstblock>(p);
+}
+
+catchain_firstblock::catchain_firstblock(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : unique_hash_(TlFetchInt256::parse(p))
+  , nodes_(TlFetchVector<TlFetchInt256>::parse(p))
+#undef FAIL
+{}
+
+void catchain_firstblock::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(unique_hash_, s);
+  TlStoreVector<TlStoreBinary>::store(nodes_, s);
+}
+
+void catchain_firstblock::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(unique_hash_, s);
+  TlStoreVector<TlStoreBinary>::store(nodes_, s);
+}
+
+void catchain_firstblock::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_firstblock");
+    s.store_field("unique_hash", unique_hash_);
+    { const std::vector<td::Bits256> &v = nodes_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("nodes", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+catchain_sent::catchain_sent()
+  : cnt_()
+{}
+
+catchain_sent::catchain_sent(std::int32_t cnt_)
+  : cnt_(cnt_)
+{}
+
+const std::int32_t catchain_sent::ID;
+
+object_ptr<catchain_sent> catchain_sent::fetch(td::TlParser &p) {
+  return make_object<catchain_sent>(p);
+}
+
+catchain_sent::catchain_sent(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : cnt_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void catchain_sent::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(cnt_, s);
+}
+
+void catchain_sent::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(cnt_, s);
+}
+
+void catchain_sent::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_sent");
+    s.store_field("cnt", cnt_);
+    s.store_class_end();
+  }
+}
+
+catchain_blockUpdate::catchain_blockUpdate()
+  : block_()
+{}
+
+catchain_blockUpdate::catchain_blockUpdate(object_ptr<catchain_block> &&block_)
+  : block_(std::move(block_))
+{}
+
+const std::int32_t catchain_blockUpdate::ID;
+
+object_ptr<catchain_blockUpdate> catchain_blockUpdate::fetch(td::TlParser &p) {
+  return make_object<catchain_blockUpdate>(p);
+}
+
+catchain_blockUpdate::catchain_blockUpdate(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<catchain_block>::parse(p))
+#undef FAIL
+{}
+
+void catchain_blockUpdate::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void catchain_blockUpdate::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void catchain_blockUpdate::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_blockUpdate");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_class_end();
+  }
+}
+
+catchain_block_data::catchain_block_data()
+  : prev_()
+  , deps_()
+{}
+
+catchain_block_data::catchain_block_data(object_ptr<catchain_block_dep> &&prev_, std::vector<object_ptr<catchain_block_dep>> &&deps_)
+  : prev_(std::move(prev_))
+  , deps_(std::move(deps_))
+{}
+
+const std::int32_t catchain_block_data::ID;
+
+object_ptr<catchain_block_data> catchain_block_data::fetch(td::TlParser &p) {
+  return make_object<catchain_block_data>(p);
+}
+
+catchain_block_data::catchain_block_data(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : prev_(TlFetchObject<catchain_block_dep>::parse(p))
+  , deps_(TlFetchVector<TlFetchObject<catchain_block_dep>>::parse(p))
+#undef FAIL
+{}
+
+void catchain_block_data::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(prev_, s);
+  TlStoreVector<TlStoreObject>::store(deps_, s);
+}
+
+void catchain_block_data::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(prev_, s);
+  TlStoreVector<TlStoreObject>::store(deps_, s);
+}
+
+void catchain_block_data::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_block_data");
+    if (prev_ == nullptr) { s.store_field("prev", "null"); } else { prev_->store(s, "prev"); }
+    { const std::vector<object_ptr<catchain_block_dep>> &v = deps_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("deps", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+catchain_block_dep::catchain_block_dep()
+  : src_()
+  , height_()
+  , data_hash_()
+  , signature_()
+{}
+
+catchain_block_dep::catchain_block_dep(std::int32_t src_, std::int32_t height_, td::Bits256 const &data_hash_, td::BufferSlice &&signature_)
+  : src_(src_)
+  , height_(height_)
+  , data_hash_(data_hash_)
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t catchain_block_dep::ID;
+
+object_ptr<catchain_block_dep> catchain_block_dep::fetch(td::TlParser &p) {
+  return make_object<catchain_block_dep>(p);
+}
+
+catchain_block_dep::catchain_block_dep(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : src_(TlFetchInt::parse(p))
+  , height_(TlFetchInt::parse(p))
+  , data_hash_(TlFetchInt256::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void catchain_block_dep::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(height_, s);
+  TlStoreBinary::store(data_hash_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void catchain_block_dep::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(height_, s);
+  TlStoreBinary::store(data_hash_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void catchain_block_dep::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_block_dep");
+    s.store_field("src", src_);
+    s.store_field("height", height_);
+    s.store_field("data_hash", data_hash_);
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+catchain_block_id::catchain_block_id()
+  : incarnation_()
+  , src_()
+  , height_()
+  , data_hash_()
+{}
+
+catchain_block_id::catchain_block_id(td::Bits256 const &incarnation_, td::Bits256 const &src_, std::int32_t height_, td::Bits256 const &data_hash_)
+  : incarnation_(incarnation_)
+  , src_(src_)
+  , height_(height_)
+  , data_hash_(data_hash_)
+{}
+
+const std::int32_t catchain_block_id::ID;
+
+object_ptr<catchain_block_id> catchain_block_id::fetch(td::TlParser &p) {
+  return make_object<catchain_block_id>(p);
+}
+
+catchain_block_id::catchain_block_id(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : incarnation_(TlFetchInt256::parse(p))
+  , src_(TlFetchInt256::parse(p))
+  , height_(TlFetchInt::parse(p))
+  , data_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void catchain_block_id::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(incarnation_, s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(height_, s);
+  TlStoreBinary::store(data_hash_, s);
+}
+
+void catchain_block_id::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(incarnation_, s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(height_, s);
+  TlStoreBinary::store(data_hash_, s);
+}
+
+void catchain_block_id::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_block_id");
+    s.store_field("incarnation", incarnation_);
+    s.store_field("src", src_);
+    s.store_field("height", height_);
+    s.store_field("data_hash", data_hash_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<catchain_block_inner_Data> catchain_block_inner_Data::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case catchain_block_data_badBlock::ID:
+      return catchain_block_data_badBlock::fetch(p);
+    case catchain_block_data_fork::ID:
+      return catchain_block_data_fork::fetch(p);
+    case catchain_block_data_nop::ID:
+      return catchain_block_data_nop::fetch(p);
+    case catchain_block_data_vector::ID:
+      return catchain_block_data_vector::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+catchain_block_data_badBlock::catchain_block_data_badBlock()
+  : block_()
+{}
+
+catchain_block_data_badBlock::catchain_block_data_badBlock(object_ptr<catchain_block> &&block_)
+  : block_(std::move(block_))
+{}
+
+const std::int32_t catchain_block_data_badBlock::ID;
+
+object_ptr<catchain_block_inner_Data> catchain_block_data_badBlock::fetch(td::TlParser &p) {
+  return make_object<catchain_block_data_badBlock>(p);
+}
+
+catchain_block_data_badBlock::catchain_block_data_badBlock(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<catchain_block>::parse(p))
+#undef FAIL
+{}
+
+void catchain_block_data_badBlock::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void catchain_block_data_badBlock::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void catchain_block_data_badBlock::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_block_data_badBlock");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_class_end();
+  }
+}
+
+catchain_block_data_fork::catchain_block_data_fork()
+  : left_()
+  , right_()
+{}
+
+catchain_block_data_fork::catchain_block_data_fork(object_ptr<catchain_block_dep> &&left_, object_ptr<catchain_block_dep> &&right_)
+  : left_(std::move(left_))
+  , right_(std::move(right_))
+{}
+
+const std::int32_t catchain_block_data_fork::ID;
+
+object_ptr<catchain_block_inner_Data> catchain_block_data_fork::fetch(td::TlParser &p) {
+  return make_object<catchain_block_data_fork>(p);
+}
+
+catchain_block_data_fork::catchain_block_data_fork(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : left_(TlFetchBoxed<TlFetchObject<catchain_block_dep>, 1511706959>::parse(p))
+  , right_(TlFetchBoxed<TlFetchObject<catchain_block_dep>, 1511706959>::parse(p))
+#undef FAIL
+{}
+
+void catchain_block_data_fork::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxed<TlStoreObject, 1511706959>::store(left_, s);
+  TlStoreBoxed<TlStoreObject, 1511706959>::store(right_, s);
+}
+
+void catchain_block_data_fork::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxed<TlStoreObject, 1511706959>::store(left_, s);
+  TlStoreBoxed<TlStoreObject, 1511706959>::store(right_, s);
+}
+
+void catchain_block_data_fork::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_block_data_fork");
+    if (left_ == nullptr) { s.store_field("left", "null"); } else { left_->store(s, "left"); }
+    if (right_ == nullptr) { s.store_field("right", "null"); } else { right_->store(s, "right"); }
+    s.store_class_end();
+  }
+}
+
+catchain_block_data_nop::catchain_block_data_nop() {
+}
+
+const std::int32_t catchain_block_data_nop::ID;
+
+object_ptr<catchain_block_inner_Data> catchain_block_data_nop::fetch(td::TlParser &p) {
+  return make_object<catchain_block_data_nop>(p);
+}
+
+catchain_block_data_nop::catchain_block_data_nop(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void catchain_block_data_nop::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void catchain_block_data_nop::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void catchain_block_data_nop::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_block_data_nop");
+    s.store_class_end();
+  }
+}
+
+catchain_block_data_vector::catchain_block_data_vector()
+  : msgs_()
+{}
+
+catchain_block_data_vector::catchain_block_data_vector(std::vector<td::BufferSlice> &&msgs_)
+  : msgs_(std::move(msgs_))
+{}
+
+const std::int32_t catchain_block_data_vector::ID;
+
+object_ptr<catchain_block_inner_Data> catchain_block_data_vector::fetch(td::TlParser &p) {
+  return make_object<catchain_block_data_vector>(p);
+}
+
+catchain_block_data_vector::catchain_block_data_vector(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : msgs_(TlFetchVector<TlFetchBytes<td::BufferSlice>>::parse(p))
+#undef FAIL
+{}
+
+void catchain_block_data_vector::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreString>::store(msgs_, s);
+}
+
+void catchain_block_data_vector::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreString>::store(msgs_, s);
+}
+
+void catchain_block_data_vector::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_block_data_vector");
+    { const std::vector<td::BufferSlice> &v = msgs_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("msgs", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_bytes_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+catchain_config_global::catchain_config_global()
+  : tag_()
+  , nodes_()
+{}
+
+catchain_config_global::catchain_config_global(td::Bits256 const &tag_, std::vector<object_ptr<PublicKey>> &&nodes_)
+  : tag_(tag_)
+  , nodes_(std::move(nodes_))
+{}
+
+const std::int32_t catchain_config_global::ID;
+
+object_ptr<catchain_config_global> catchain_config_global::fetch(td::TlParser &p) {
+  return make_object<catchain_config_global>(p);
+}
+
+catchain_config_global::catchain_config_global(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : tag_(TlFetchInt256::parse(p))
+  , nodes_(TlFetchVector<TlFetchObject<PublicKey>>::parse(p))
+#undef FAIL
+{}
+
+void catchain_config_global::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(tag_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(nodes_, s);
+}
+
+void catchain_config_global::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(tag_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(nodes_, s);
+}
+
+void catchain_config_global::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_config_global");
+    s.store_field("tag", tag_);
+    { const std::vector<object_ptr<PublicKey>> &v = nodes_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("nodes", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+config_global::config_global()
+  : adnl_()
+  , dht_()
+  , validator_()
+{}
+
+config_global::config_global(object_ptr<adnl_config_global> &&adnl_, object_ptr<dht_config_global> &&dht_, object_ptr<validator_config_global> &&validator_)
+  : adnl_(std::move(adnl_))
+  , dht_(std::move(dht_))
+  , validator_(std::move(validator_))
+{}
+
+const std::int32_t config_global::ID;
+
+object_ptr<config_global> config_global::fetch(td::TlParser &p) {
+  return make_object<config_global>(p);
+}
+
+config_global::config_global(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : adnl_(TlFetchObject<adnl_config_global>::parse(p))
+  , dht_(TlFetchObject<dht_config_global>::parse(p))
+  , validator_(TlFetchObject<validator_config_global>::parse(p))
+#undef FAIL
+{}
+
+void config_global::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(adnl_, s);
+  TlStoreObject::store(dht_, s);
+  TlStoreObject::store(validator_, s);
+}
+
+void config_global::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(adnl_, s);
+  TlStoreObject::store(dht_, s);
+  TlStoreObject::store(validator_, s);
+}
+
+void config_global::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "config_global");
+    if (adnl_ == nullptr) { s.store_field("adnl", "null"); } else { adnl_->store(s, "adnl"); }
+    if (dht_ == nullptr) { s.store_field("dht", "null"); } else { dht_->store(s, "dht"); }
+    if (validator_ == nullptr) { s.store_field("validator", "null"); } else { validator_->store(s, "validator"); }
+    s.store_class_end();
+  }
+}
+
+config_local::config_local()
+  : local_ids_()
+  , dht_()
+  , validators_()
+  , liteservers_()
+  , control_()
+{}
+
+config_local::config_local(std::vector<object_ptr<id_config_local>> &&local_ids_, std::vector<object_ptr<dht_config_Local>> &&dht_, std::vector<object_ptr<validator_config_Local>> &&validators_, std::vector<object_ptr<liteserver_config_Local>> &&liteservers_, std::vector<object_ptr<control_config_local>> &&control_)
+  : local_ids_(std::move(local_ids_))
+  , dht_(std::move(dht_))
+  , validators_(std::move(validators_))
+  , liteservers_(std::move(liteservers_))
+  , control_(std::move(control_))
+{}
+
+const std::int32_t config_local::ID;
+
+object_ptr<config_local> config_local::fetch(td::TlParser &p) {
+  return make_object<config_local>(p);
+}
+
+config_local::config_local(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : local_ids_(TlFetchVector<TlFetchObject<id_config_local>>::parse(p))
+  , dht_(TlFetchVector<TlFetchObject<dht_config_Local>>::parse(p))
+  , validators_(TlFetchVector<TlFetchObject<validator_config_Local>>::parse(p))
+  , liteservers_(TlFetchVector<TlFetchObject<liteserver_config_Local>>::parse(p))
+  , control_(TlFetchVector<TlFetchObject<control_config_local>>::parse(p))
+#undef FAIL
+{}
+
+void config_local::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(local_ids_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(dht_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(validators_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(liteservers_, s);
+  TlStoreVector<TlStoreObject>::store(control_, s);
+}
+
+void config_local::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(local_ids_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(dht_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(validators_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(liteservers_, s);
+  TlStoreVector<TlStoreObject>::store(control_, s);
+}
+
+void config_local::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "config_local");
+    { const std::vector<object_ptr<id_config_local>> &v = local_ids_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("local_ids", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    { const std::vector<object_ptr<dht_config_Local>> &v = dht_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("dht", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    { const std::vector<object_ptr<validator_config_Local>> &v = validators_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("validators", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    { const std::vector<object_ptr<liteserver_config_Local>> &v = liteservers_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("liteservers", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    { const std::vector<object_ptr<control_config_local>> &v = control_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("control", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+control_config_local::control_config_local()
+  : priv_()
+  , pub_()
+  , port_()
+{}
+
+control_config_local::control_config_local(object_ptr<PrivateKey> &&priv_, td::Bits256 const &pub_, std::int32_t port_)
+  : priv_(std::move(priv_))
+  , pub_(pub_)
+  , port_(port_)
+{}
+
+const std::int32_t control_config_local::ID;
+
+object_ptr<control_config_local> control_config_local::fetch(td::TlParser &p) {
+  return make_object<control_config_local>(p);
+}
+
+control_config_local::control_config_local(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : priv_(TlFetchObject<PrivateKey>::parse(p))
+  , pub_(TlFetchInt256::parse(p))
+  , port_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void control_config_local::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(priv_, s);
+  TlStoreBinary::store(pub_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void control_config_local::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(priv_, s);
+  TlStoreBinary::store(pub_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void control_config_local::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "control_config_local");
+    if (priv_ == nullptr) { s.store_field("priv", "null"); } else { priv_->store(s, "priv"); }
+    s.store_field("pub", pub_);
+    s.store_field("port", port_);
+    s.store_class_end();
+  }
+}
+
+db_candidate::db_candidate()
+  : source_()
+  , id_()
+  , data_()
+  , collated_data_()
+{}
+
+db_candidate::db_candidate(object_ptr<PublicKey> &&source_, object_ptr<tonNode_blockIdExt> &&id_, td::BufferSlice &&data_, td::BufferSlice &&collated_data_)
+  : source_(std::move(source_))
+  , id_(std::move(id_))
+  , data_(std::move(data_))
+  , collated_data_(std::move(collated_data_))
+{}
+
+const std::int32_t db_candidate::ID;
+
+object_ptr<db_candidate> db_candidate::fetch(td::TlParser &p) {
+  return make_object<db_candidate>(p);
+}
+
+db_candidate::db_candidate(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : source_(TlFetchObject<PublicKey>::parse(p))
+  , id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , collated_data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void db_candidate::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(source_, s);
+  TlStoreObject::store(id_, s);
+  TlStoreString::store(data_, s);
+  TlStoreString::store(collated_data_, s);
+}
+
+void db_candidate::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(source_, s);
+  TlStoreObject::store(id_, s);
+  TlStoreString::store(data_, s);
+  TlStoreString::store(collated_data_, s);
+}
+
+void db_candidate::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_candidate");
+    if (source_ == nullptr) { s.store_field("source", "null"); } else { source_->store(s, "source"); }
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_bytes_field("data", data_);
+    s.store_bytes_field("collated_data", collated_data_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<db_block_Info> db_block_Info::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case db_block_info::ID:
+      return db_block_info::fetch(p);
+    case db_block_archivedInfo::ID:
+      return db_block_archivedInfo::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+db_block_info::db_block_info()
+  : id_()
+  , flags_()
+  , prev_left_()
+  , prev_right_()
+  , next_left_()
+  , next_right_()
+  , lt_()
+  , ts_()
+  , state_()
+{}
+
+db_block_info::db_block_info(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t flags_, object_ptr<tonNode_blockIdExt> &&prev_left_, object_ptr<tonNode_blockIdExt> &&prev_right_, object_ptr<tonNode_blockIdExt> &&next_left_, object_ptr<tonNode_blockIdExt> &&next_right_, std::int64_t lt_, std::int32_t ts_, td::Bits256 const &state_)
+  : id_(std::move(id_))
+  , flags_(flags_)
+  , prev_left_(std::move(prev_left_))
+  , prev_right_(std::move(prev_right_))
+  , next_left_(std::move(next_left_))
+  , next_right_(std::move(next_right_))
+  , lt_(lt_)
+  , ts_(ts_)
+  , state_(state_)
+{}
+
+const std::int32_t db_block_info::ID;
+
+object_ptr<db_block_Info> db_block_info::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<db_block_info> res = make_object<db_block_info>();
+  std::int32_t var0;
+  res->id_ = TlFetchObject<tonNode_blockIdExt>::parse(p);
+  if ((var0 = res->flags_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  if (var0 & 2) { res->prev_left_ = TlFetchObject<tonNode_blockIdExt>::parse(p); }
+  if (var0 & 4) { res->prev_right_ = TlFetchObject<tonNode_blockIdExt>::parse(p); }
+  if (var0 & 8) { res->next_left_ = TlFetchObject<tonNode_blockIdExt>::parse(p); }
+  if (var0 & 16) { res->next_right_ = TlFetchObject<tonNode_blockIdExt>::parse(p); }
+  if (var0 & 8192) { res->lt_ = TlFetchLong::parse(p); }
+  if (var0 & 16384) { res->ts_ = TlFetchInt::parse(p); }
+  if (var0 & 131072) { res->state_ = TlFetchInt256::parse(p); }
+  if (p.get_error()) { FAIL(""); }
+  return std::move(res);
+#undef FAIL
+}
+
+void db_block_info::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store((var0 = flags_), s);
+  if (var0 & 2) { TlStoreObject::store(prev_left_, s); }
+  if (var0 & 4) { TlStoreObject::store(prev_right_, s); }
+  if (var0 & 8) { TlStoreObject::store(next_left_, s); }
+  if (var0 & 16) { TlStoreObject::store(next_right_, s); }
+  if (var0 & 8192) { TlStoreBinary::store(lt_, s); }
+  if (var0 & 16384) { TlStoreBinary::store(ts_, s); }
+  if (var0 & 131072) { TlStoreBinary::store(state_, s); }
+}
+
+void db_block_info::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store((var0 = flags_), s);
+  if (var0 & 2) { TlStoreObject::store(prev_left_, s); }
+  if (var0 & 4) { TlStoreObject::store(prev_right_, s); }
+  if (var0 & 8) { TlStoreObject::store(next_left_, s); }
+  if (var0 & 16) { TlStoreObject::store(next_right_, s); }
+  if (var0 & 8192) { TlStoreBinary::store(lt_, s); }
+  if (var0 & 16384) { TlStoreBinary::store(ts_, s); }
+  if (var0 & 131072) { TlStoreBinary::store(state_, s); }
+}
+
+void db_block_info::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_block_info");
+  std::int32_t var0;
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("flags", (var0 = flags_));
+    if (var0 & 2) { if (prev_left_ == nullptr) { s.store_field("prev_left", "null"); } else { prev_left_->store(s, "prev_left"); } }
+    if (var0 & 4) { if (prev_right_ == nullptr) { s.store_field("prev_right", "null"); } else { prev_right_->store(s, "prev_right"); } }
+    if (var0 & 8) { if (next_left_ == nullptr) { s.store_field("next_left", "null"); } else { next_left_->store(s, "next_left"); } }
+    if (var0 & 16) { if (next_right_ == nullptr) { s.store_field("next_right", "null"); } else { next_right_->store(s, "next_right"); } }
+    if (var0 & 8192) { s.store_field("lt", lt_); }
+    if (var0 & 16384) { s.store_field("ts", ts_); }
+    if (var0 & 131072) { s.store_field("state", state_); }
+    s.store_class_end();
+  }
+}
+
+db_block_archivedInfo::db_block_archivedInfo()
+  : id_()
+  , flags_()
+  , next_()
+{}
+
+db_block_archivedInfo::db_block_archivedInfo(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t flags_, object_ptr<tonNode_blockIdExt> &&next_)
+  : id_(std::move(id_))
+  , flags_(flags_)
+  , next_(std::move(next_))
+{}
+
+const std::int32_t db_block_archivedInfo::ID;
+
+object_ptr<db_block_Info> db_block_archivedInfo::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  object_ptr<db_block_archivedInfo> res = make_object<db_block_archivedInfo>();
+  std::int32_t var0;
+  res->id_ = TlFetchObject<tonNode_blockIdExt>::parse(p);
+  if ((var0 = res->flags_ = TlFetchInt::parse(p)) < 0) { FAIL("Variable of type # can't be negative"); }
+  if (var0 & 1) { res->next_ = TlFetchObject<tonNode_blockIdExt>::parse(p); }
+  if (p.get_error()) { FAIL(""); }
+  return std::move(res);
+#undef FAIL
+}
+
+void db_block_archivedInfo::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store((var0 = flags_), s);
+  if (var0 & 1) { TlStoreObject::store(next_, s); }
+}
+
+void db_block_archivedInfo::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  std::int32_t var0;
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store((var0 = flags_), s);
+  if (var0 & 1) { TlStoreObject::store(next_, s); }
+}
+
+void db_block_archivedInfo::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_block_archivedInfo");
+  std::int32_t var0;
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("flags", (var0 = flags_));
+    if (var0 & 1) { if (next_ == nullptr) { s.store_field("next", "null"); } else { next_->store(s, "next"); } }
+    s.store_class_end();
+  }
+}
+
+object_ptr<db_blockdb_Key> db_blockdb_Key::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case db_blockdb_key_lru::ID:
+      return db_blockdb_key_lru::fetch(p);
+    case db_blockdb_key_value::ID:
+      return db_blockdb_key_value::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+db_blockdb_key_lru::db_blockdb_key_lru()
+  : id_()
+{}
+
+db_blockdb_key_lru::db_blockdb_key_lru(object_ptr<tonNode_blockIdExt> &&id_)
+  : id_(std::move(id_))
+{}
+
+const std::int32_t db_blockdb_key_lru::ID;
+
+object_ptr<db_blockdb_Key> db_blockdb_key_lru::fetch(td::TlParser &p) {
+  return make_object<db_blockdb_key_lru>(p);
+}
+
+db_blockdb_key_lru::db_blockdb_key_lru(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void db_blockdb_key_lru::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+}
+
+void db_blockdb_key_lru::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+}
+
+void db_blockdb_key_lru::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_blockdb_key_lru");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_class_end();
+  }
+}
+
+db_blockdb_key_value::db_blockdb_key_value()
+  : id_()
+{}
+
+db_blockdb_key_value::db_blockdb_key_value(object_ptr<tonNode_blockIdExt> &&id_)
+  : id_(std::move(id_))
+{}
+
+const std::int32_t db_blockdb_key_value::ID;
+
+object_ptr<db_blockdb_Key> db_blockdb_key_value::fetch(td::TlParser &p) {
+  return make_object<db_blockdb_key_value>(p);
+}
+
+db_blockdb_key_value::db_blockdb_key_value(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void db_blockdb_key_value::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+}
+
+void db_blockdb_key_value::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+}
+
+void db_blockdb_key_value::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_blockdb_key_value");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_class_end();
+  }
+}
+
+db_blockdb_lru::db_blockdb_lru()
+  : id_()
+  , prev_()
+  , next_()
+{}
+
+db_blockdb_lru::db_blockdb_lru(object_ptr<tonNode_blockIdExt> &&id_, td::Bits256 const &prev_, td::Bits256 const &next_)
+  : id_(std::move(id_))
+  , prev_(prev_)
+  , next_(next_)
+{}
+
+const std::int32_t db_blockdb_lru::ID;
+
+object_ptr<db_blockdb_lru> db_blockdb_lru::fetch(td::TlParser &p) {
+  return make_object<db_blockdb_lru>(p);
+}
+
+db_blockdb_lru::db_blockdb_lru(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , prev_(TlFetchInt256::parse(p))
+  , next_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void db_blockdb_lru::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(prev_, s);
+  TlStoreBinary::store(next_, s);
+}
+
+void db_blockdb_lru::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(prev_, s);
+  TlStoreBinary::store(next_, s);
+}
+
+void db_blockdb_lru::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_blockdb_lru");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("prev", prev_);
+    s.store_field("next", next_);
+    s.store_class_end();
+  }
+}
+
+db_blockdb_value::db_blockdb_value()
+  : next_()
+  , data_()
+{}
+
+db_blockdb_value::db_blockdb_value(object_ptr<tonNode_blockIdExt> &&next_, td::BufferSlice &&data_)
+  : next_(std::move(next_))
+  , data_(std::move(data_))
+{}
+
+const std::int32_t db_blockdb_value::ID;
+
+object_ptr<db_blockdb_value> db_blockdb_value::fetch(td::TlParser &p) {
+  return make_object<db_blockdb_value>(p);
+}
+
+db_blockdb_value::db_blockdb_value(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : next_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void db_blockdb_value::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(next_, s);
+  TlStoreString::store(data_, s);
+}
+
+void db_blockdb_value::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(next_, s);
+  TlStoreString::store(data_, s);
+}
+
+void db_blockdb_value::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_blockdb_value");
+    if (next_ == nullptr) { s.store_field("next", "null"); } else { next_->store(s, "next"); }
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+db_candidate_id::db_candidate_id()
+  : source_()
+  , id_()
+  , collated_data_file_hash_()
+{}
+
+db_candidate_id::db_candidate_id(object_ptr<PublicKey> &&source_, object_ptr<tonNode_blockIdExt> &&id_, td::Bits256 const &collated_data_file_hash_)
+  : source_(std::move(source_))
+  , id_(std::move(id_))
+  , collated_data_file_hash_(collated_data_file_hash_)
+{}
+
+const std::int32_t db_candidate_id::ID;
+
+object_ptr<db_candidate_id> db_candidate_id::fetch(td::TlParser &p) {
+  return make_object<db_candidate_id>(p);
+}
+
+db_candidate_id::db_candidate_id(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : source_(TlFetchObject<PublicKey>::parse(p))
+  , id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , collated_data_file_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void db_candidate_id::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(source_, s);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(collated_data_file_hash_, s);
+}
+
+void db_candidate_id::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(source_, s);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(collated_data_file_hash_, s);
+}
+
+void db_candidate_id::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_candidate_id");
+    if (source_ == nullptr) { s.store_field("source", "null"); } else { source_->store(s, "source"); }
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("collated_data_file_hash", collated_data_file_hash_);
+    s.store_class_end();
+  }
+}
+
+db_celldb_value::db_celldb_value()
+  : block_id_()
+  , prev_()
+  , next_()
+  , root_hash_()
+{}
+
+db_celldb_value::db_celldb_value(object_ptr<tonNode_blockIdExt> &&block_id_, td::Bits256 const &prev_, td::Bits256 const &next_, td::Bits256 const &root_hash_)
+  : block_id_(std::move(block_id_))
+  , prev_(prev_)
+  , next_(next_)
+  , root_hash_(root_hash_)
+{}
+
+const std::int32_t db_celldb_value::ID;
+
+object_ptr<db_celldb_value> db_celldb_value::fetch(td::TlParser &p) {
+  return make_object<db_celldb_value>(p);
+}
+
+db_celldb_value::db_celldb_value(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , prev_(TlFetchInt256::parse(p))
+  , next_(TlFetchInt256::parse(p))
+  , root_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void db_celldb_value::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+  TlStoreBinary::store(prev_, s);
+  TlStoreBinary::store(next_, s);
+  TlStoreBinary::store(root_hash_, s);
+}
+
+void db_celldb_value::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+  TlStoreBinary::store(prev_, s);
+  TlStoreBinary::store(next_, s);
+  TlStoreBinary::store(root_hash_, s);
+}
+
+void db_celldb_value::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_celldb_value");
+    if (block_id_ == nullptr) { s.store_field("block_id", "null"); } else { block_id_->store(s, "block_id"); }
+    s.store_field("prev", prev_);
+    s.store_field("next", next_);
+    s.store_field("root_hash", root_hash_);
+    s.store_class_end();
+  }
+}
+
+db_celldb_key_value::db_celldb_key_value()
+  : hash_()
+{}
+
+db_celldb_key_value::db_celldb_key_value(td::Bits256 const &hash_)
+  : hash_(hash_)
+{}
+
+const std::int32_t db_celldb_key_value::ID;
+
+object_ptr<db_celldb_key_value> db_celldb_key_value::fetch(td::TlParser &p) {
+  return make_object<db_celldb_key_value>(p);
+}
+
+db_celldb_key_value::db_celldb_key_value(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void db_celldb_key_value::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(hash_, s);
+}
+
+void db_celldb_key_value::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(hash_, s);
+}
+
+void db_celldb_key_value::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_celldb_key_value");
+    s.store_field("hash", hash_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<db_filedb_Key> db_filedb_Key::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case db_filedb_key_empty::ID:
+      return db_filedb_key_empty::fetch(p);
+    case db_filedb_key_blockFile::ID:
+      return db_filedb_key_blockFile::fetch(p);
+    case db_filedb_key_zeroStateFile::ID:
+      return db_filedb_key_zeroStateFile::fetch(p);
+    case db_filedb_key_persistentStateFile::ID:
+      return db_filedb_key_persistentStateFile::fetch(p);
+    case db_filedb_key_proof::ID:
+      return db_filedb_key_proof::fetch(p);
+    case db_filedb_key_proofLink::ID:
+      return db_filedb_key_proofLink::fetch(p);
+    case db_filedb_key_signatures::ID:
+      return db_filedb_key_signatures::fetch(p);
+    case db_filedb_key_candidate::ID:
+      return db_filedb_key_candidate::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+db_filedb_key_empty::db_filedb_key_empty() {
+}
+
+const std::int32_t db_filedb_key_empty::ID;
+
+object_ptr<db_filedb_Key> db_filedb_key_empty::fetch(td::TlParser &p) {
+  return make_object<db_filedb_key_empty>(p);
+}
+
+db_filedb_key_empty::db_filedb_key_empty(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void db_filedb_key_empty::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void db_filedb_key_empty::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void db_filedb_key_empty::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_filedb_key_empty");
+    s.store_class_end();
+  }
+}
+
+db_filedb_key_blockFile::db_filedb_key_blockFile()
+  : block_id_()
+{}
+
+db_filedb_key_blockFile::db_filedb_key_blockFile(object_ptr<tonNode_blockIdExt> &&block_id_)
+  : block_id_(std::move(block_id_))
+{}
+
+const std::int32_t db_filedb_key_blockFile::ID;
+
+object_ptr<db_filedb_Key> db_filedb_key_blockFile::fetch(td::TlParser &p) {
+  return make_object<db_filedb_key_blockFile>(p);
+}
+
+db_filedb_key_blockFile::db_filedb_key_blockFile(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void db_filedb_key_blockFile::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+}
+
+void db_filedb_key_blockFile::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+}
+
+void db_filedb_key_blockFile::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_filedb_key_blockFile");
+    if (block_id_ == nullptr) { s.store_field("block_id", "null"); } else { block_id_->store(s, "block_id"); }
+    s.store_class_end();
+  }
+}
+
+db_filedb_key_zeroStateFile::db_filedb_key_zeroStateFile()
+  : block_id_()
+{}
+
+db_filedb_key_zeroStateFile::db_filedb_key_zeroStateFile(object_ptr<tonNode_blockIdExt> &&block_id_)
+  : block_id_(std::move(block_id_))
+{}
+
+const std::int32_t db_filedb_key_zeroStateFile::ID;
+
+object_ptr<db_filedb_Key> db_filedb_key_zeroStateFile::fetch(td::TlParser &p) {
+  return make_object<db_filedb_key_zeroStateFile>(p);
+}
+
+db_filedb_key_zeroStateFile::db_filedb_key_zeroStateFile(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void db_filedb_key_zeroStateFile::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+}
+
+void db_filedb_key_zeroStateFile::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+}
+
+void db_filedb_key_zeroStateFile::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_filedb_key_zeroStateFile");
+    if (block_id_ == nullptr) { s.store_field("block_id", "null"); } else { block_id_->store(s, "block_id"); }
+    s.store_class_end();
+  }
+}
+
+db_filedb_key_persistentStateFile::db_filedb_key_persistentStateFile()
+  : block_id_()
+  , masterchain_block_id_()
+{}
+
+db_filedb_key_persistentStateFile::db_filedb_key_persistentStateFile(object_ptr<tonNode_blockIdExt> &&block_id_, object_ptr<tonNode_blockIdExt> &&masterchain_block_id_)
+  : block_id_(std::move(block_id_))
+  , masterchain_block_id_(std::move(masterchain_block_id_))
+{}
+
+const std::int32_t db_filedb_key_persistentStateFile::ID;
+
+object_ptr<db_filedb_Key> db_filedb_key_persistentStateFile::fetch(td::TlParser &p) {
+  return make_object<db_filedb_key_persistentStateFile>(p);
+}
+
+db_filedb_key_persistentStateFile::db_filedb_key_persistentStateFile(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , masterchain_block_id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void db_filedb_key_persistentStateFile::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+  TlStoreObject::store(masterchain_block_id_, s);
+}
+
+void db_filedb_key_persistentStateFile::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+  TlStoreObject::store(masterchain_block_id_, s);
+}
+
+void db_filedb_key_persistentStateFile::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_filedb_key_persistentStateFile");
+    if (block_id_ == nullptr) { s.store_field("block_id", "null"); } else { block_id_->store(s, "block_id"); }
+    if (masterchain_block_id_ == nullptr) { s.store_field("masterchain_block_id", "null"); } else { masterchain_block_id_->store(s, "masterchain_block_id"); }
+    s.store_class_end();
+  }
+}
+
+db_filedb_key_proof::db_filedb_key_proof()
+  : block_id_()
+{}
+
+db_filedb_key_proof::db_filedb_key_proof(object_ptr<tonNode_blockIdExt> &&block_id_)
+  : block_id_(std::move(block_id_))
+{}
+
+const std::int32_t db_filedb_key_proof::ID;
+
+object_ptr<db_filedb_Key> db_filedb_key_proof::fetch(td::TlParser &p) {
+  return make_object<db_filedb_key_proof>(p);
+}
+
+db_filedb_key_proof::db_filedb_key_proof(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void db_filedb_key_proof::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+}
+
+void db_filedb_key_proof::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+}
+
+void db_filedb_key_proof::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_filedb_key_proof");
+    if (block_id_ == nullptr) { s.store_field("block_id", "null"); } else { block_id_->store(s, "block_id"); }
+    s.store_class_end();
+  }
+}
+
+db_filedb_key_proofLink::db_filedb_key_proofLink()
+  : block_id_()
+{}
+
+db_filedb_key_proofLink::db_filedb_key_proofLink(object_ptr<tonNode_blockIdExt> &&block_id_)
+  : block_id_(std::move(block_id_))
+{}
+
+const std::int32_t db_filedb_key_proofLink::ID;
+
+object_ptr<db_filedb_Key> db_filedb_key_proofLink::fetch(td::TlParser &p) {
+  return make_object<db_filedb_key_proofLink>(p);
+}
+
+db_filedb_key_proofLink::db_filedb_key_proofLink(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void db_filedb_key_proofLink::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+}
+
+void db_filedb_key_proofLink::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+}
+
+void db_filedb_key_proofLink::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_filedb_key_proofLink");
+    if (block_id_ == nullptr) { s.store_field("block_id", "null"); } else { block_id_->store(s, "block_id"); }
+    s.store_class_end();
+  }
+}
+
+db_filedb_key_signatures::db_filedb_key_signatures()
+  : block_id_()
+{}
+
+db_filedb_key_signatures::db_filedb_key_signatures(object_ptr<tonNode_blockIdExt> &&block_id_)
+  : block_id_(std::move(block_id_))
+{}
+
+const std::int32_t db_filedb_key_signatures::ID;
+
+object_ptr<db_filedb_Key> db_filedb_key_signatures::fetch(td::TlParser &p) {
+  return make_object<db_filedb_key_signatures>(p);
+}
+
+db_filedb_key_signatures::db_filedb_key_signatures(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void db_filedb_key_signatures::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+}
+
+void db_filedb_key_signatures::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_id_, s);
+}
+
+void db_filedb_key_signatures::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_filedb_key_signatures");
+    if (block_id_ == nullptr) { s.store_field("block_id", "null"); } else { block_id_->store(s, "block_id"); }
+    s.store_class_end();
+  }
+}
+
+db_filedb_key_candidate::db_filedb_key_candidate()
+  : id_()
+{}
+
+db_filedb_key_candidate::db_filedb_key_candidate(object_ptr<db_candidate_id> &&id_)
+  : id_(std::move(id_))
+{}
+
+const std::int32_t db_filedb_key_candidate::ID;
+
+object_ptr<db_filedb_Key> db_filedb_key_candidate::fetch(td::TlParser &p) {
+  return make_object<db_filedb_key_candidate>(p);
+}
+
+db_filedb_key_candidate::db_filedb_key_candidate(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<db_candidate_id>::parse(p))
+#undef FAIL
+{}
+
+void db_filedb_key_candidate::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+}
+
+void db_filedb_key_candidate::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+}
+
+void db_filedb_key_candidate::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_filedb_key_candidate");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_class_end();
+  }
+}
+
+db_filedb_value::db_filedb_value()
+  : key_()
+  , prev_()
+  , next_()
+  , file_hash_()
+{}
+
+db_filedb_value::db_filedb_value(object_ptr<db_filedb_Key> &&key_, td::Bits256 const &prev_, td::Bits256 const &next_, td::Bits256 const &file_hash_)
+  : key_(std::move(key_))
+  , prev_(prev_)
+  , next_(next_)
+  , file_hash_(file_hash_)
+{}
+
+const std::int32_t db_filedb_value::ID;
+
+object_ptr<db_filedb_value> db_filedb_value::fetch(td::TlParser &p) {
+  return make_object<db_filedb_value>(p);
+}
+
+db_filedb_value::db_filedb_value(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchObject<db_filedb_Key>::parse(p))
+  , prev_(TlFetchInt256::parse(p))
+  , next_(TlFetchInt256::parse(p))
+  , file_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void db_filedb_value::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(key_, s);
+  TlStoreBinary::store(prev_, s);
+  TlStoreBinary::store(next_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void db_filedb_value::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(key_, s);
+  TlStoreBinary::store(prev_, s);
+  TlStoreBinary::store(next_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void db_filedb_value::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_filedb_value");
+    if (key_ == nullptr) { s.store_field("key", "null"); } else { key_->store(s, "key"); }
+    s.store_field("prev", prev_);
+    s.store_field("next", next_);
+    s.store_field("file_hash", file_hash_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<db_lt_Key> db_lt_Key::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case db_lt_el_key::ID:
+      return db_lt_el_key::fetch(p);
+    case db_lt_desc_key::ID:
+      return db_lt_desc_key::fetch(p);
+    case db_lt_shard_key::ID:
+      return db_lt_shard_key::fetch(p);
+    case db_lt_status_key::ID:
+      return db_lt_status_key::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+db_lt_el_key::db_lt_el_key()
+  : workchain_()
+  , shard_()
+  , idx_()
+{}
+
+db_lt_el_key::db_lt_el_key(std::int32_t workchain_, std::int64_t shard_, std::int32_t idx_)
+  : workchain_(workchain_)
+  , shard_(shard_)
+  , idx_(idx_)
+{}
+
+const std::int32_t db_lt_el_key::ID;
+
+object_ptr<db_lt_Key> db_lt_el_key::fetch(td::TlParser &p) {
+  return make_object<db_lt_el_key>(p);
+}
+
+db_lt_el_key::db_lt_el_key(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : workchain_(TlFetchInt::parse(p))
+  , shard_(TlFetchLong::parse(p))
+  , idx_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void db_lt_el_key::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(idx_, s);
+}
+
+void db_lt_el_key::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(idx_, s);
+}
+
+void db_lt_el_key::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_lt_el_key");
+    s.store_field("workchain", workchain_);
+    s.store_field("shard", shard_);
+    s.store_field("idx", idx_);
+    s.store_class_end();
+  }
+}
+
+db_lt_desc_key::db_lt_desc_key()
+  : workchain_()
+  , shard_()
+{}
+
+db_lt_desc_key::db_lt_desc_key(std::int32_t workchain_, std::int64_t shard_)
+  : workchain_(workchain_)
+  , shard_(shard_)
+{}
+
+const std::int32_t db_lt_desc_key::ID;
+
+object_ptr<db_lt_Key> db_lt_desc_key::fetch(td::TlParser &p) {
+  return make_object<db_lt_desc_key>(p);
+}
+
+db_lt_desc_key::db_lt_desc_key(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : workchain_(TlFetchInt::parse(p))
+  , shard_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void db_lt_desc_key::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+}
+
+void db_lt_desc_key::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+}
+
+void db_lt_desc_key::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_lt_desc_key");
+    s.store_field("workchain", workchain_);
+    s.store_field("shard", shard_);
+    s.store_class_end();
+  }
+}
+
+db_lt_shard_key::db_lt_shard_key()
+  : idx_()
+{}
+
+db_lt_shard_key::db_lt_shard_key(std::int32_t idx_)
+  : idx_(idx_)
+{}
+
+const std::int32_t db_lt_shard_key::ID;
+
+object_ptr<db_lt_Key> db_lt_shard_key::fetch(td::TlParser &p) {
+  return make_object<db_lt_shard_key>(p);
+}
+
+db_lt_shard_key::db_lt_shard_key(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : idx_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void db_lt_shard_key::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(idx_, s);
+}
+
+void db_lt_shard_key::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(idx_, s);
+}
+
+void db_lt_shard_key::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_lt_shard_key");
+    s.store_field("idx", idx_);
+    s.store_class_end();
+  }
+}
+
+db_lt_status_key::db_lt_status_key() {
+}
+
+const std::int32_t db_lt_status_key::ID;
+
+object_ptr<db_lt_Key> db_lt_status_key::fetch(td::TlParser &p) {
+  return make_object<db_lt_status_key>(p);
+}
+
+db_lt_status_key::db_lt_status_key(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void db_lt_status_key::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void db_lt_status_key::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void db_lt_status_key::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_lt_status_key");
+    s.store_class_end();
+  }
+}
+
+db_lt_desc_value::db_lt_desc_value()
+  : first_idx_()
+  , last_idx_()
+  , last_seqno_()
+  , last_lt_()
+  , last_ts_()
+{}
+
+db_lt_desc_value::db_lt_desc_value(std::int32_t first_idx_, std::int32_t last_idx_, std::int32_t last_seqno_, std::int64_t last_lt_, std::int32_t last_ts_)
+  : first_idx_(first_idx_)
+  , last_idx_(last_idx_)
+  , last_seqno_(last_seqno_)
+  , last_lt_(last_lt_)
+  , last_ts_(last_ts_)
+{}
+
+const std::int32_t db_lt_desc_value::ID;
+
+object_ptr<db_lt_desc_value> db_lt_desc_value::fetch(td::TlParser &p) {
+  return make_object<db_lt_desc_value>(p);
+}
+
+db_lt_desc_value::db_lt_desc_value(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : first_idx_(TlFetchInt::parse(p))
+  , last_idx_(TlFetchInt::parse(p))
+  , last_seqno_(TlFetchInt::parse(p))
+  , last_lt_(TlFetchLong::parse(p))
+  , last_ts_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void db_lt_desc_value::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(first_idx_, s);
+  TlStoreBinary::store(last_idx_, s);
+  TlStoreBinary::store(last_seqno_, s);
+  TlStoreBinary::store(last_lt_, s);
+  TlStoreBinary::store(last_ts_, s);
+}
+
+void db_lt_desc_value::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(first_idx_, s);
+  TlStoreBinary::store(last_idx_, s);
+  TlStoreBinary::store(last_seqno_, s);
+  TlStoreBinary::store(last_lt_, s);
+  TlStoreBinary::store(last_ts_, s);
+}
+
+void db_lt_desc_value::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_lt_desc_value");
+    s.store_field("first_idx", first_idx_);
+    s.store_field("last_idx", last_idx_);
+    s.store_field("last_seqno", last_seqno_);
+    s.store_field("last_lt", last_lt_);
+    s.store_field("last_ts", last_ts_);
+    s.store_class_end();
+  }
+}
+
+db_lt_el_value::db_lt_el_value()
+  : id_()
+  , lt_()
+  , ts_()
+{}
+
+db_lt_el_value::db_lt_el_value(object_ptr<tonNode_blockIdExt> &&id_, std::int64_t lt_, std::int32_t ts_)
+  : id_(std::move(id_))
+  , lt_(lt_)
+  , ts_(ts_)
+{}
+
+const std::int32_t db_lt_el_value::ID;
+
+object_ptr<db_lt_el_value> db_lt_el_value::fetch(td::TlParser &p) {
+  return make_object<db_lt_el_value>(p);
+}
+
+db_lt_el_value::db_lt_el_value(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , lt_(TlFetchLong::parse(p))
+  , ts_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void db_lt_el_value::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(lt_, s);
+  TlStoreBinary::store(ts_, s);
+}
+
+void db_lt_el_value::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(lt_, s);
+  TlStoreBinary::store(ts_, s);
+}
+
+void db_lt_el_value::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_lt_el_value");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("lt", lt_);
+    s.store_field("ts", ts_);
+    s.store_class_end();
+  }
+}
+
+db_lt_shard_value::db_lt_shard_value()
+  : workchain_()
+  , shard_()
+{}
+
+db_lt_shard_value::db_lt_shard_value(std::int32_t workchain_, std::int64_t shard_)
+  : workchain_(workchain_)
+  , shard_(shard_)
+{}
+
+const std::int32_t db_lt_shard_value::ID;
+
+object_ptr<db_lt_shard_value> db_lt_shard_value::fetch(td::TlParser &p) {
+  return make_object<db_lt_shard_value>(p);
+}
+
+db_lt_shard_value::db_lt_shard_value(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : workchain_(TlFetchInt::parse(p))
+  , shard_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void db_lt_shard_value::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+}
+
+void db_lt_shard_value::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+}
+
+void db_lt_shard_value::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_lt_shard_value");
+    s.store_field("workchain", workchain_);
+    s.store_field("shard", shard_);
+    s.store_class_end();
+  }
+}
+
+db_lt_status_value::db_lt_status_value()
+  : total_shards_()
+{}
+
+db_lt_status_value::db_lt_status_value(std::int32_t total_shards_)
+  : total_shards_(total_shards_)
+{}
+
+const std::int32_t db_lt_status_value::ID;
+
+object_ptr<db_lt_status_value> db_lt_status_value::fetch(td::TlParser &p) {
+  return make_object<db_lt_status_value>(p);
+}
+
+db_lt_status_value::db_lt_status_value(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : total_shards_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void db_lt_status_value::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(total_shards_, s);
+}
+
+void db_lt_status_value::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(total_shards_, s);
+}
+
+void db_lt_status_value::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_lt_status_value");
+    s.store_field("total_shards", total_shards_);
+    s.store_class_end();
+  }
+}
+
+db_root_config::db_root_config()
+  : celldb_version_()
+  , blockdb_version_()
+{}
+
+db_root_config::db_root_config(std::int32_t celldb_version_, std::int32_t blockdb_version_)
+  : celldb_version_(celldb_version_)
+  , blockdb_version_(blockdb_version_)
+{}
+
+const std::int32_t db_root_config::ID;
+
+object_ptr<db_root_config> db_root_config::fetch(td::TlParser &p) {
+  return make_object<db_root_config>(p);
+}
+
+db_root_config::db_root_config(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : celldb_version_(TlFetchInt::parse(p))
+  , blockdb_version_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void db_root_config::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(celldb_version_, s);
+  TlStoreBinary::store(blockdb_version_, s);
+}
+
+void db_root_config::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(celldb_version_, s);
+  TlStoreBinary::store(blockdb_version_, s);
+}
+
+void db_root_config::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_root_config");
+    s.store_field("celldb_version", celldb_version_);
+    s.store_field("blockdb_version", blockdb_version_);
+    s.store_class_end();
+  }
+}
+
+db_root_dbDescription::db_root_dbDescription()
+  : version_()
+  , first_masterchain_block_id_()
+  , flags_()
+{}
+
+db_root_dbDescription::db_root_dbDescription(std::int32_t version_, object_ptr<tonNode_blockIdExt> &&first_masterchain_block_id_, std::int32_t flags_)
+  : version_(version_)
+  , first_masterchain_block_id_(std::move(first_masterchain_block_id_))
+  , flags_(flags_)
+{}
+
+const std::int32_t db_root_dbDescription::ID;
+
+object_ptr<db_root_dbDescription> db_root_dbDescription::fetch(td::TlParser &p) {
+  return make_object<db_root_dbDescription>(p);
+}
+
+db_root_dbDescription::db_root_dbDescription(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : version_(TlFetchInt::parse(p))
+  , first_masterchain_block_id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , flags_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void db_root_dbDescription::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(version_, s);
+  TlStoreObject::store(first_masterchain_block_id_, s);
+  TlStoreBinary::store(flags_, s);
+}
+
+void db_root_dbDescription::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(version_, s);
+  TlStoreObject::store(first_masterchain_block_id_, s);
+  TlStoreBinary::store(flags_, s);
+}
+
+void db_root_dbDescription::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_root_dbDescription");
+    s.store_field("version", version_);
+    if (first_masterchain_block_id_ == nullptr) { s.store_field("first_masterchain_block_id", "null"); } else { first_masterchain_block_id_->store(s, "first_masterchain_block_id"); }
+    s.store_field("flags", flags_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<db_root_Key> db_root_Key::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case db_root_key_cellDb::ID:
+      return db_root_key_cellDb::fetch(p);
+    case db_root_key_blockDb::ID:
+      return db_root_key_blockDb::fetch(p);
+    case db_root_key_config::ID:
+      return db_root_key_config::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+db_root_key_cellDb::db_root_key_cellDb()
+  : version_()
+{}
+
+db_root_key_cellDb::db_root_key_cellDb(std::int32_t version_)
+  : version_(version_)
+{}
+
+const std::int32_t db_root_key_cellDb::ID;
+
+object_ptr<db_root_Key> db_root_key_cellDb::fetch(td::TlParser &p) {
+  return make_object<db_root_key_cellDb>(p);
+}
+
+db_root_key_cellDb::db_root_key_cellDb(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : version_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void db_root_key_cellDb::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(version_, s);
+}
+
+void db_root_key_cellDb::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(version_, s);
+}
+
+void db_root_key_cellDb::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_root_key_cellDb");
+    s.store_field("version", version_);
+    s.store_class_end();
+  }
+}
+
+db_root_key_blockDb::db_root_key_blockDb()
+  : version_()
+{}
+
+db_root_key_blockDb::db_root_key_blockDb(std::int32_t version_)
+  : version_(version_)
+{}
+
+const std::int32_t db_root_key_blockDb::ID;
+
+object_ptr<db_root_Key> db_root_key_blockDb::fetch(td::TlParser &p) {
+  return make_object<db_root_key_blockDb>(p);
+}
+
+db_root_key_blockDb::db_root_key_blockDb(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : version_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void db_root_key_blockDb::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(version_, s);
+}
+
+void db_root_key_blockDb::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(version_, s);
+}
+
+void db_root_key_blockDb::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_root_key_blockDb");
+    s.store_field("version", version_);
+    s.store_class_end();
+  }
+}
+
+db_root_key_config::db_root_key_config() {
+}
+
+const std::int32_t db_root_key_config::ID;
+
+object_ptr<db_root_Key> db_root_key_config::fetch(td::TlParser &p) {
+  return make_object<db_root_key_config>(p);
+}
+
+db_root_key_config::db_root_key_config(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void db_root_key_config::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void db_root_key_config::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void db_root_key_config::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_root_key_config");
+    s.store_class_end();
+  }
+}
+
+db_state_asyncSerializer::db_state_asyncSerializer()
+  : block_()
+  , last_()
+  , last_ts_()
+{}
+
+db_state_asyncSerializer::db_state_asyncSerializer(object_ptr<tonNode_blockIdExt> &&block_, object_ptr<tonNode_blockIdExt> &&last_, std::int32_t last_ts_)
+  : block_(std::move(block_))
+  , last_(std::move(last_))
+  , last_ts_(last_ts_)
+{}
+
+const std::int32_t db_state_asyncSerializer::ID;
+
+object_ptr<db_state_asyncSerializer> db_state_asyncSerializer::fetch(td::TlParser &p) {
+  return make_object<db_state_asyncSerializer>(p);
+}
+
+db_state_asyncSerializer::db_state_asyncSerializer(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , last_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , last_ts_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void db_state_asyncSerializer::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+  TlStoreObject::store(last_, s);
+  TlStoreBinary::store(last_ts_, s);
+}
+
+void db_state_asyncSerializer::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+  TlStoreObject::store(last_, s);
+  TlStoreBinary::store(last_ts_, s);
+}
+
+void db_state_asyncSerializer::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_state_asyncSerializer");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    if (last_ == nullptr) { s.store_field("last", "null"); } else { last_->store(s, "last"); }
+    s.store_field("last_ts", last_ts_);
+    s.store_class_end();
+  }
+}
+
+db_state_destroyedSessions::db_state_destroyedSessions()
+  : sessions_()
+{}
+
+db_state_destroyedSessions::db_state_destroyedSessions(std::vector<td::Bits256> &&sessions_)
+  : sessions_(std::move(sessions_))
+{}
+
+const std::int32_t db_state_destroyedSessions::ID;
+
+object_ptr<db_state_destroyedSessions> db_state_destroyedSessions::fetch(td::TlParser &p) {
+  return make_object<db_state_destroyedSessions>(p);
+}
+
+db_state_destroyedSessions::db_state_destroyedSessions(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : sessions_(TlFetchVector<TlFetchInt256>::parse(p))
+#undef FAIL
+{}
+
+void db_state_destroyedSessions::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreBinary>::store(sessions_, s);
+}
+
+void db_state_destroyedSessions::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreBinary>::store(sessions_, s);
+}
+
+void db_state_destroyedSessions::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_state_destroyedSessions");
+    { const std::vector<td::Bits256> &v = sessions_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("sessions", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+db_state_gcBlockId::db_state_gcBlockId()
+  : block_()
+{}
+
+db_state_gcBlockId::db_state_gcBlockId(object_ptr<tonNode_blockIdExt> &&block_)
+  : block_(std::move(block_))
+{}
+
+const std::int32_t db_state_gcBlockId::ID;
+
+object_ptr<db_state_gcBlockId> db_state_gcBlockId::fetch(td::TlParser &p) {
+  return make_object<db_state_gcBlockId>(p);
+}
+
+db_state_gcBlockId::db_state_gcBlockId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void db_state_gcBlockId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void db_state_gcBlockId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void db_state_gcBlockId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_state_gcBlockId");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_class_end();
+  }
+}
+
+db_state_initBlockId::db_state_initBlockId()
+  : block_()
+{}
+
+db_state_initBlockId::db_state_initBlockId(object_ptr<tonNode_blockIdExt> &&block_)
+  : block_(std::move(block_))
+{}
+
+const std::int32_t db_state_initBlockId::ID;
+
+object_ptr<db_state_initBlockId> db_state_initBlockId::fetch(td::TlParser &p) {
+  return make_object<db_state_initBlockId>(p);
+}
+
+db_state_initBlockId::db_state_initBlockId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void db_state_initBlockId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void db_state_initBlockId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void db_state_initBlockId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_state_initBlockId");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_class_end();
+  }
+}
+
+object_ptr<db_state_Key> db_state_Key::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case db_state_key_destroyedSessions::ID:
+      return db_state_key_destroyedSessions::fetch(p);
+    case db_state_key_initBlockId::ID:
+      return db_state_key_initBlockId::fetch(p);
+    case db_state_key_gcBlockId::ID:
+      return db_state_key_gcBlockId::fetch(p);
+    case db_state_key_shardClient::ID:
+      return db_state_key_shardClient::fetch(p);
+    case db_state_key_asyncSerializer::ID:
+      return db_state_key_asyncSerializer::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+db_state_key_destroyedSessions::db_state_key_destroyedSessions() {
+}
+
+const std::int32_t db_state_key_destroyedSessions::ID;
+
+object_ptr<db_state_Key> db_state_key_destroyedSessions::fetch(td::TlParser &p) {
+  return make_object<db_state_key_destroyedSessions>(p);
+}
+
+db_state_key_destroyedSessions::db_state_key_destroyedSessions(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void db_state_key_destroyedSessions::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void db_state_key_destroyedSessions::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void db_state_key_destroyedSessions::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_state_key_destroyedSessions");
+    s.store_class_end();
+  }
+}
+
+db_state_key_initBlockId::db_state_key_initBlockId() {
+}
+
+const std::int32_t db_state_key_initBlockId::ID;
+
+object_ptr<db_state_Key> db_state_key_initBlockId::fetch(td::TlParser &p) {
+  return make_object<db_state_key_initBlockId>(p);
+}
+
+db_state_key_initBlockId::db_state_key_initBlockId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void db_state_key_initBlockId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void db_state_key_initBlockId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void db_state_key_initBlockId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_state_key_initBlockId");
+    s.store_class_end();
+  }
+}
+
+db_state_key_gcBlockId::db_state_key_gcBlockId() {
+}
+
+const std::int32_t db_state_key_gcBlockId::ID;
+
+object_ptr<db_state_Key> db_state_key_gcBlockId::fetch(td::TlParser &p) {
+  return make_object<db_state_key_gcBlockId>(p);
+}
+
+db_state_key_gcBlockId::db_state_key_gcBlockId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void db_state_key_gcBlockId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void db_state_key_gcBlockId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void db_state_key_gcBlockId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_state_key_gcBlockId");
+    s.store_class_end();
+  }
+}
+
+db_state_key_shardClient::db_state_key_shardClient() {
+}
+
+const std::int32_t db_state_key_shardClient::ID;
+
+object_ptr<db_state_Key> db_state_key_shardClient::fetch(td::TlParser &p) {
+  return make_object<db_state_key_shardClient>(p);
+}
+
+db_state_key_shardClient::db_state_key_shardClient(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void db_state_key_shardClient::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void db_state_key_shardClient::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void db_state_key_shardClient::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_state_key_shardClient");
+    s.store_class_end();
+  }
+}
+
+db_state_key_asyncSerializer::db_state_key_asyncSerializer() {
+}
+
+const std::int32_t db_state_key_asyncSerializer::ID;
+
+object_ptr<db_state_Key> db_state_key_asyncSerializer::fetch(td::TlParser &p) {
+  return make_object<db_state_key_asyncSerializer>(p);
+}
+
+db_state_key_asyncSerializer::db_state_key_asyncSerializer(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void db_state_key_asyncSerializer::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void db_state_key_asyncSerializer::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void db_state_key_asyncSerializer::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_state_key_asyncSerializer");
+    s.store_class_end();
+  }
+}
+
+db_state_shardClient::db_state_shardClient()
+  : block_()
+{}
+
+db_state_shardClient::db_state_shardClient(object_ptr<tonNode_blockIdExt> &&block_)
+  : block_(std::move(block_))
+{}
+
+const std::int32_t db_state_shardClient::ID;
+
+object_ptr<db_state_shardClient> db_state_shardClient::fetch(td::TlParser &p) {
+  return make_object<db_state_shardClient>(p);
+}
+
+db_state_shardClient::db_state_shardClient(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void db_state_shardClient::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void db_state_shardClient::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void db_state_shardClient::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "db_state_shardClient");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_class_end();
+  }
+}
+
+dht_key::dht_key()
+  : id_()
+  , name_()
+  , idx_()
+{}
+
+dht_key::dht_key(td::Bits256 const &id_, td::BufferSlice &&name_, std::int32_t idx_)
+  : id_(id_)
+  , name_(std::move(name_))
+  , idx_(idx_)
+{}
+
+const std::int32_t dht_key::ID;
+
+object_ptr<dht_key> dht_key::fetch(td::TlParser &p) {
+  return make_object<dht_key>(p);
+}
+
+dht_key::dht_key(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchInt256::parse(p))
+  , name_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , idx_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void dht_key::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreString::store(name_, s);
+  TlStoreBinary::store(idx_, s);
+}
+
+void dht_key::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreString::store(name_, s);
+  TlStoreBinary::store(idx_, s);
+}
+
+void dht_key::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_key");
+    s.store_field("id", id_);
+    s.store_bytes_field("name", name_);
+    s.store_field("idx", idx_);
+    s.store_class_end();
+  }
+}
+
+dht_keyDescription::dht_keyDescription()
+  : key_()
+  , id_()
+  , update_rule_()
+  , signature_()
+{}
+
+dht_keyDescription::dht_keyDescription(object_ptr<dht_key> &&key_, object_ptr<PublicKey> &&id_, object_ptr<dht_UpdateRule> &&update_rule_, td::BufferSlice &&signature_)
+  : key_(std::move(key_))
+  , id_(std::move(id_))
+  , update_rule_(std::move(update_rule_))
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t dht_keyDescription::ID;
+
+object_ptr<dht_keyDescription> dht_keyDescription::fetch(td::TlParser &p) {
+  return make_object<dht_keyDescription>(p);
+}
+
+dht_keyDescription::dht_keyDescription(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchObject<dht_key>::parse(p))
+  , id_(TlFetchObject<PublicKey>::parse(p))
+  , update_rule_(TlFetchObject<dht_UpdateRule>::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void dht_keyDescription::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(key_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(update_rule_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void dht_keyDescription::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(key_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(update_rule_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void dht_keyDescription::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_keyDescription");
+    if (key_ == nullptr) { s.store_field("key", "null"); } else { key_->store(s, "key"); }
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    if (update_rule_ == nullptr) { s.store_field("update_rule", "null"); } else { update_rule_->store(s, "update_rule"); }
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+dht_message::dht_message()
+  : node_()
+{}
+
+dht_message::dht_message(object_ptr<dht_node> &&node_)
+  : node_(std::move(node_))
+{}
+
+const std::int32_t dht_message::ID;
+
+object_ptr<dht_message> dht_message::fetch(td::TlParser &p) {
+  return make_object<dht_message>(p);
+}
+
+dht_message::dht_message(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : node_(TlFetchObject<dht_node>::parse(p))
+#undef FAIL
+{}
+
+void dht_message::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(node_, s);
+}
+
+void dht_message::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(node_, s);
+}
+
+void dht_message::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_message");
+    if (node_ == nullptr) { s.store_field("node", "null"); } else { node_->store(s, "node"); }
+    s.store_class_end();
+  }
+}
+
+dht_node::dht_node()
+  : id_()
+  , addr_list_()
+  , version_()
+  , signature_()
+{}
+
+dht_node::dht_node(object_ptr<PublicKey> &&id_, object_ptr<adnl_addressList> &&addr_list_, std::int32_t version_, td::BufferSlice &&signature_)
+  : id_(std::move(id_))
+  , addr_list_(std::move(addr_list_))
+  , version_(version_)
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t dht_node::ID;
+
+object_ptr<dht_node> dht_node::fetch(td::TlParser &p) {
+  return make_object<dht_node>(p);
+}
+
+dht_node::dht_node(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<PublicKey>::parse(p))
+  , addr_list_(TlFetchObject<adnl_addressList>::parse(p))
+  , version_(TlFetchInt::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void dht_node::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreObject::store(addr_list_, s);
+  TlStoreBinary::store(version_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void dht_node::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreObject::store(addr_list_, s);
+  TlStoreBinary::store(version_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void dht_node::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_node");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    if (addr_list_ == nullptr) { s.store_field("addr_list", "null"); } else { addr_list_->store(s, "addr_list"); }
+    s.store_field("version", version_);
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+dht_nodes::dht_nodes()
+  : nodes_()
+{}
+
+dht_nodes::dht_nodes(std::vector<object_ptr<dht_node>> &&nodes_)
+  : nodes_(std::move(nodes_))
+{}
+
+const std::int32_t dht_nodes::ID;
+
+object_ptr<dht_nodes> dht_nodes::fetch(td::TlParser &p) {
+  return make_object<dht_nodes>(p);
+}
+
+dht_nodes::dht_nodes(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : nodes_(TlFetchVector<TlFetchObject<dht_node>>::parse(p))
+#undef FAIL
+{}
+
+void dht_nodes::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(nodes_, s);
+}
+
+void dht_nodes::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(nodes_, s);
+}
+
+void dht_nodes::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_nodes");
+    { const std::vector<object_ptr<dht_node>> &v = nodes_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("nodes", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+dht_pong::dht_pong()
+  : random_id_()
+{}
+
+dht_pong::dht_pong(std::int64_t random_id_)
+  : random_id_(random_id_)
+{}
+
+const std::int32_t dht_pong::ID;
+
+object_ptr<dht_pong> dht_pong::fetch(td::TlParser &p) {
+  return make_object<dht_pong>(p);
+}
+
+dht_pong::dht_pong(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : random_id_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void dht_pong::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(random_id_, s);
+}
+
+void dht_pong::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(random_id_, s);
+}
+
+void dht_pong::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_pong");
+    s.store_field("random_id", random_id_);
+    s.store_class_end();
+  }
+}
+
+dht_stored::dht_stored() {
+}
+
+const std::int32_t dht_stored::ID;
+
+object_ptr<dht_stored> dht_stored::fetch(td::TlParser &p) {
+  return make_object<dht_stored>(p);
+}
+
+dht_stored::dht_stored(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void dht_stored::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void dht_stored::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void dht_stored::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_stored");
+    s.store_class_end();
+  }
+}
+
+object_ptr<dht_UpdateRule> dht_UpdateRule::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case dht_updateRule_signature::ID:
+      return dht_updateRule_signature::fetch(p);
+    case dht_updateRule_anybody::ID:
+      return dht_updateRule_anybody::fetch(p);
+    case dht_updateRule_overlayNodes::ID:
+      return dht_updateRule_overlayNodes::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+dht_updateRule_signature::dht_updateRule_signature() {
+}
+
+const std::int32_t dht_updateRule_signature::ID;
+
+object_ptr<dht_UpdateRule> dht_updateRule_signature::fetch(td::TlParser &p) {
+  return make_object<dht_updateRule_signature>(p);
+}
+
+dht_updateRule_signature::dht_updateRule_signature(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void dht_updateRule_signature::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void dht_updateRule_signature::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void dht_updateRule_signature::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_updateRule_signature");
+    s.store_class_end();
+  }
+}
+
+dht_updateRule_anybody::dht_updateRule_anybody() {
+}
+
+const std::int32_t dht_updateRule_anybody::ID;
+
+object_ptr<dht_UpdateRule> dht_updateRule_anybody::fetch(td::TlParser &p) {
+  return make_object<dht_updateRule_anybody>(p);
+}
+
+dht_updateRule_anybody::dht_updateRule_anybody(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void dht_updateRule_anybody::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void dht_updateRule_anybody::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void dht_updateRule_anybody::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_updateRule_anybody");
+    s.store_class_end();
+  }
+}
+
+dht_updateRule_overlayNodes::dht_updateRule_overlayNodes() {
+}
+
+const std::int32_t dht_updateRule_overlayNodes::ID;
+
+object_ptr<dht_UpdateRule> dht_updateRule_overlayNodes::fetch(td::TlParser &p) {
+  return make_object<dht_updateRule_overlayNodes>(p);
+}
+
+dht_updateRule_overlayNodes::dht_updateRule_overlayNodes(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void dht_updateRule_overlayNodes::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void dht_updateRule_overlayNodes::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void dht_updateRule_overlayNodes::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_updateRule_overlayNodes");
+    s.store_class_end();
+  }
+}
+
+dht_value::dht_value()
+  : key_()
+  , value_()
+  , ttl_()
+  , signature_()
+{}
+
+dht_value::dht_value(object_ptr<dht_keyDescription> &&key_, td::BufferSlice &&value_, std::int32_t ttl_, td::BufferSlice &&signature_)
+  : key_(std::move(key_))
+  , value_(std::move(value_))
+  , ttl_(ttl_)
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t dht_value::ID;
+
+object_ptr<dht_value> dht_value::fetch(td::TlParser &p) {
+  return make_object<dht_value>(p);
+}
+
+dht_value::dht_value(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchObject<dht_keyDescription>::parse(p))
+  , value_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , ttl_(TlFetchInt::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void dht_value::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(key_, s);
+  TlStoreString::store(value_, s);
+  TlStoreBinary::store(ttl_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void dht_value::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(key_, s);
+  TlStoreString::store(value_, s);
+  TlStoreBinary::store(ttl_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void dht_value::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_value");
+    if (key_ == nullptr) { s.store_field("key", "null"); } else { key_->store(s, "key"); }
+    s.store_bytes_field("value", value_);
+    s.store_field("ttl", ttl_);
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<dht_ValueResult> dht_ValueResult::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case dht_valueNotFound::ID:
+      return dht_valueNotFound::fetch(p);
+    case dht_valueFound::ID:
+      return dht_valueFound::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+dht_valueNotFound::dht_valueNotFound()
+  : nodes_()
+{}
+
+dht_valueNotFound::dht_valueNotFound(object_ptr<dht_nodes> &&nodes_)
+  : nodes_(std::move(nodes_))
+{}
+
+const std::int32_t dht_valueNotFound::ID;
+
+object_ptr<dht_ValueResult> dht_valueNotFound::fetch(td::TlParser &p) {
+  return make_object<dht_valueNotFound>(p);
+}
+
+dht_valueNotFound::dht_valueNotFound(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : nodes_(TlFetchObject<dht_nodes>::parse(p))
+#undef FAIL
+{}
+
+void dht_valueNotFound::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(nodes_, s);
+}
+
+void dht_valueNotFound::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(nodes_, s);
+}
+
+void dht_valueNotFound::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_valueNotFound");
+    if (nodes_ == nullptr) { s.store_field("nodes", "null"); } else { nodes_->store(s, "nodes"); }
+    s.store_class_end();
+  }
+}
+
+dht_valueFound::dht_valueFound()
+  : value_()
+{}
+
+dht_valueFound::dht_valueFound(object_ptr<dht_value> &&value_)
+  : value_(std::move(value_))
+{}
+
+const std::int32_t dht_valueFound::ID;
+
+object_ptr<dht_ValueResult> dht_valueFound::fetch(td::TlParser &p) {
+  return make_object<dht_valueFound>(p);
+}
+
+dht_valueFound::dht_valueFound(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchBoxed<TlFetchObject<dht_value>, -1867700277>::parse(p))
+#undef FAIL
+{}
+
+void dht_valueFound::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxed<TlStoreObject, -1867700277>::store(value_, s);
+}
+
+void dht_valueFound::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxed<TlStoreObject, -1867700277>::store(value_, s);
+}
+
+void dht_valueFound::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_valueFound");
+    if (value_ == nullptr) { s.store_field("value", "null"); } else { value_->store(s, "value"); }
+    s.store_class_end();
+  }
+}
+
+dht_config_global::dht_config_global()
+  : static_nodes_()
+  , k_()
+  , a_()
+{}
+
+dht_config_global::dht_config_global(object_ptr<dht_nodes> &&static_nodes_, std::int32_t k_, std::int32_t a_)
+  : static_nodes_(std::move(static_nodes_))
+  , k_(k_)
+  , a_(a_)
+{}
+
+const std::int32_t dht_config_global::ID;
+
+object_ptr<dht_config_global> dht_config_global::fetch(td::TlParser &p) {
+  return make_object<dht_config_global>(p);
+}
+
+dht_config_global::dht_config_global(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : static_nodes_(TlFetchObject<dht_nodes>::parse(p))
+  , k_(TlFetchInt::parse(p))
+  , a_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void dht_config_global::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(static_nodes_, s);
+  TlStoreBinary::store(k_, s);
+  TlStoreBinary::store(a_, s);
+}
+
+void dht_config_global::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(static_nodes_, s);
+  TlStoreBinary::store(k_, s);
+  TlStoreBinary::store(a_, s);
+}
+
+void dht_config_global::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_config_global");
+    if (static_nodes_ == nullptr) { s.store_field("static_nodes", "null"); } else { static_nodes_->store(s, "static_nodes"); }
+    s.store_field("k", k_);
+    s.store_field("a", a_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<dht_config_Local> dht_config_Local::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case dht_config_local::ID:
+      return dht_config_local::fetch(p);
+    case dht_config_random_local::ID:
+      return dht_config_random_local::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+dht_config_local::dht_config_local()
+  : id_()
+{}
+
+dht_config_local::dht_config_local(object_ptr<adnl_id_short> &&id_)
+  : id_(std::move(id_))
+{}
+
+const std::int32_t dht_config_local::ID;
+
+object_ptr<dht_config_Local> dht_config_local::fetch(td::TlParser &p) {
+  return make_object<dht_config_local>(p);
+}
+
+dht_config_local::dht_config_local(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<adnl_id_short>::parse(p))
+#undef FAIL
+{}
+
+void dht_config_local::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+}
+
+void dht_config_local::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+}
+
+void dht_config_local::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_config_local");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_class_end();
+  }
+}
+
+dht_config_random_local::dht_config_random_local()
+  : cnt_()
+{}
+
+dht_config_random_local::dht_config_random_local(std::int32_t cnt_)
+  : cnt_(cnt_)
+{}
+
+const std::int32_t dht_config_random_local::ID;
+
+object_ptr<dht_config_Local> dht_config_random_local::fetch(td::TlParser &p) {
+  return make_object<dht_config_random_local>(p);
+}
+
+dht_config_random_local::dht_config_random_local(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : cnt_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void dht_config_random_local::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(cnt_, s);
+}
+
+void dht_config_random_local::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(cnt_, s);
+}
+
+void dht_config_random_local::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_config_random_local");
+    s.store_field("cnt", cnt_);
+    s.store_class_end();
+  }
+}
+
+dht_db_bucket::dht_db_bucket()
+  : nodes_()
+{}
+
+dht_db_bucket::dht_db_bucket(object_ptr<dht_nodes> &&nodes_)
+  : nodes_(std::move(nodes_))
+{}
+
+const std::int32_t dht_db_bucket::ID;
+
+object_ptr<dht_db_bucket> dht_db_bucket::fetch(td::TlParser &p) {
+  return make_object<dht_db_bucket>(p);
+}
+
+dht_db_bucket::dht_db_bucket(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : nodes_(TlFetchObject<dht_nodes>::parse(p))
+#undef FAIL
+{}
+
+void dht_db_bucket::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(nodes_, s);
+}
+
+void dht_db_bucket::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(nodes_, s);
+}
+
+void dht_db_bucket::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_db_bucket");
+    if (nodes_ == nullptr) { s.store_field("nodes", "null"); } else { nodes_->store(s, "nodes"); }
+    s.store_class_end();
+  }
+}
+
+dht_db_key_bucket::dht_db_key_bucket()
+  : id_()
+{}
+
+dht_db_key_bucket::dht_db_key_bucket(std::int32_t id_)
+  : id_(id_)
+{}
+
+const std::int32_t dht_db_key_bucket::ID;
+
+object_ptr<dht_db_key_bucket> dht_db_key_bucket::fetch(td::TlParser &p) {
+  return make_object<dht_db_key_bucket>(p);
+}
+
+dht_db_key_bucket::dht_db_key_bucket(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void dht_db_key_bucket::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+}
+
+void dht_db_key_bucket::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+}
+
+void dht_db_key_bucket::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_db_key_bucket");
+    s.store_field("id", id_);
+    s.store_class_end();
+  }
+}
+
+dummyworkchain0_config_global::dummyworkchain0_config_global()
+  : zero_state_hash_()
+{}
+
+dummyworkchain0_config_global::dummyworkchain0_config_global(td::Bits256 const &zero_state_hash_)
+  : zero_state_hash_(zero_state_hash_)
+{}
+
+const std::int32_t dummyworkchain0_config_global::ID;
+
+object_ptr<dummyworkchain0_config_global> dummyworkchain0_config_global::fetch(td::TlParser &p) {
+  return make_object<dummyworkchain0_config_global>(p);
+}
+
+dummyworkchain0_config_global::dummyworkchain0_config_global(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : zero_state_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void dummyworkchain0_config_global::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(zero_state_hash_, s);
+}
+
+void dummyworkchain0_config_global::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(zero_state_hash_, s);
+}
+
+void dummyworkchain0_config_global::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dummyworkchain0_config_global");
+    s.store_field("zero_state_hash", zero_state_hash_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<engine_Addr> engine_Addr::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case engine_addr::ID:
+      return engine_addr::fetch(p);
+    case engine_addrProxy::ID:
+      return engine_addrProxy::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+engine_addr::engine_addr()
+  : ip_()
+  , port_()
+  , categories_()
+  , priority_categories_()
+{}
+
+engine_addr::engine_addr(std::int32_t ip_, std::int32_t port_, std::vector<std::int32_t> &&categories_, std::vector<std::int32_t> &&priority_categories_)
+  : ip_(ip_)
+  , port_(port_)
+  , categories_(std::move(categories_))
+  , priority_categories_(std::move(priority_categories_))
+{}
+
+const std::int32_t engine_addr::ID;
+
+object_ptr<engine_Addr> engine_addr::fetch(td::TlParser &p) {
+  return make_object<engine_addr>(p);
+}
+
+engine_addr::engine_addr(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : ip_(TlFetchInt::parse(p))
+  , port_(TlFetchInt::parse(p))
+  , categories_(TlFetchVector<TlFetchInt>::parse(p))
+  , priority_categories_(TlFetchVector<TlFetchInt>::parse(p))
+#undef FAIL
+{}
+
+void engine_addr::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreVector<TlStoreBinary>::store(categories_, s);
+  TlStoreVector<TlStoreBinary>::store(priority_categories_, s);
+}
+
+void engine_addr::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreVector<TlStoreBinary>::store(categories_, s);
+  TlStoreVector<TlStoreBinary>::store(priority_categories_, s);
+}
+
+void engine_addr::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_addr");
+    s.store_field("ip", ip_);
+    s.store_field("port", port_);
+    { const std::vector<std::int32_t> &v = categories_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("categories", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    { const std::vector<std::int32_t> &v = priority_categories_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("priority_categories", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+engine_addrProxy::engine_addrProxy()
+  : in_ip_()
+  , in_port_()
+  , out_ip_()
+  , out_port_()
+  , proxy_type_()
+  , categories_()
+  , priority_categories_()
+{}
+
+engine_addrProxy::engine_addrProxy(std::int32_t in_ip_, std::int32_t in_port_, std::int32_t out_ip_, std::int32_t out_port_, object_ptr<adnl_Proxy> &&proxy_type_, std::vector<std::int32_t> &&categories_, std::vector<std::int32_t> &&priority_categories_)
+  : in_ip_(in_ip_)
+  , in_port_(in_port_)
+  , out_ip_(out_ip_)
+  , out_port_(out_port_)
+  , proxy_type_(std::move(proxy_type_))
+  , categories_(std::move(categories_))
+  , priority_categories_(std::move(priority_categories_))
+{}
+
+const std::int32_t engine_addrProxy::ID;
+
+object_ptr<engine_Addr> engine_addrProxy::fetch(td::TlParser &p) {
+  return make_object<engine_addrProxy>(p);
+}
+
+engine_addrProxy::engine_addrProxy(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : in_ip_(TlFetchInt::parse(p))
+  , in_port_(TlFetchInt::parse(p))
+  , out_ip_(TlFetchInt::parse(p))
+  , out_port_(TlFetchInt::parse(p))
+  , proxy_type_(TlFetchObject<adnl_Proxy>::parse(p))
+  , categories_(TlFetchVector<TlFetchInt>::parse(p))
+  , priority_categories_(TlFetchVector<TlFetchInt>::parse(p))
+#undef FAIL
+{}
+
+void engine_addrProxy::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(in_ip_, s);
+  TlStoreBinary::store(in_port_, s);
+  TlStoreBinary::store(out_ip_, s);
+  TlStoreBinary::store(out_port_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(proxy_type_, s);
+  TlStoreVector<TlStoreBinary>::store(categories_, s);
+  TlStoreVector<TlStoreBinary>::store(priority_categories_, s);
+}
+
+void engine_addrProxy::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(in_ip_, s);
+  TlStoreBinary::store(in_port_, s);
+  TlStoreBinary::store(out_ip_, s);
+  TlStoreBinary::store(out_port_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(proxy_type_, s);
+  TlStoreVector<TlStoreBinary>::store(categories_, s);
+  TlStoreVector<TlStoreBinary>::store(priority_categories_, s);
+}
+
+void engine_addrProxy::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_addrProxy");
+    s.store_field("in_ip", in_ip_);
+    s.store_field("in_port", in_port_);
+    s.store_field("out_ip", out_ip_);
+    s.store_field("out_port", out_port_);
+    if (proxy_type_ == nullptr) { s.store_field("proxy_type", "null"); } else { proxy_type_->store(s, "proxy_type"); }
+    { const std::vector<std::int32_t> &v = categories_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("categories", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    { const std::vector<std::int32_t> &v = priority_categories_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("priority_categories", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+engine_adnl::engine_adnl()
+  : id_()
+  , category_()
+{}
+
+engine_adnl::engine_adnl(td::Bits256 const &id_, std::int32_t category_)
+  : id_(id_)
+  , category_(category_)
+{}
+
+const std::int32_t engine_adnl::ID;
+
+object_ptr<engine_adnl> engine_adnl::fetch(td::TlParser &p) {
+  return make_object<engine_adnl>(p);
+}
+
+engine_adnl::engine_adnl(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchInt256::parse(p))
+  , category_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_adnl::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreBinary::store(category_, s);
+}
+
+void engine_adnl::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreBinary::store(category_, s);
+}
+
+void engine_adnl::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_adnl");
+    s.store_field("id", id_);
+    s.store_field("category", category_);
+    s.store_class_end();
+  }
+}
+
+engine_controlInterface::engine_controlInterface()
+  : id_()
+  , port_()
+  , allowed_()
+{}
+
+engine_controlInterface::engine_controlInterface(td::Bits256 const &id_, std::int32_t port_, std::vector<object_ptr<engine_controlProcess>> &&allowed_)
+  : id_(id_)
+  , port_(port_)
+  , allowed_(std::move(allowed_))
+{}
+
+const std::int32_t engine_controlInterface::ID;
+
+object_ptr<engine_controlInterface> engine_controlInterface::fetch(td::TlParser &p) {
+  return make_object<engine_controlInterface>(p);
+}
+
+engine_controlInterface::engine_controlInterface(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchInt256::parse(p))
+  , port_(TlFetchInt::parse(p))
+  , allowed_(TlFetchVector<TlFetchObject<engine_controlProcess>>::parse(p))
+#undef FAIL
+{}
+
+void engine_controlInterface::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreVector<TlStoreObject>::store(allowed_, s);
+}
+
+void engine_controlInterface::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreVector<TlStoreObject>::store(allowed_, s);
+}
+
+void engine_controlInterface::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_controlInterface");
+    s.store_field("id", id_);
+    s.store_field("port", port_);
+    { const std::vector<object_ptr<engine_controlProcess>> &v = allowed_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("allowed", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+engine_controlProcess::engine_controlProcess()
+  : id_()
+  , permissions_()
+{}
+
+engine_controlProcess::engine_controlProcess(td::Bits256 const &id_, std::int32_t permissions_)
+  : id_(id_)
+  , permissions_(permissions_)
+{}
+
+const std::int32_t engine_controlProcess::ID;
+
+object_ptr<engine_controlProcess> engine_controlProcess::fetch(td::TlParser &p) {
+  return make_object<engine_controlProcess>(p);
+}
+
+engine_controlProcess::engine_controlProcess(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchInt256::parse(p))
+  , permissions_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_controlProcess::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreBinary::store(permissions_, s);
+}
+
+void engine_controlProcess::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreBinary::store(permissions_, s);
+}
+
+void engine_controlProcess::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_controlProcess");
+    s.store_field("id", id_);
+    s.store_field("permissions", permissions_);
+    s.store_class_end();
+  }
+}
+
+engine_dht::engine_dht()
+  : id_()
+{}
+
+engine_dht::engine_dht(td::Bits256 const &id_)
+  : id_(id_)
+{}
+
+const std::int32_t engine_dht::ID;
+
+object_ptr<engine_dht> engine_dht::fetch(td::TlParser &p) {
+  return make_object<engine_dht>(p);
+}
+
+engine_dht::engine_dht(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void engine_dht::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+}
+
+void engine_dht::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+}
+
+void engine_dht::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_dht");
+    s.store_field("id", id_);
+    s.store_class_end();
+  }
+}
+
+engine_gc::engine_gc()
+  : ids_()
+{}
+
+engine_gc::engine_gc(std::vector<td::Bits256> &&ids_)
+  : ids_(std::move(ids_))
+{}
+
+const std::int32_t engine_gc::ID;
+
+object_ptr<engine_gc> engine_gc::fetch(td::TlParser &p) {
+  return make_object<engine_gc>(p);
+}
+
+engine_gc::engine_gc(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : ids_(TlFetchVector<TlFetchInt256>::parse(p))
+#undef FAIL
+{}
+
+void engine_gc::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreBinary>::store(ids_, s);
+}
+
+void engine_gc::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreBinary>::store(ids_, s);
+}
+
+void engine_gc::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_gc");
+    { const std::vector<td::Bits256> &v = ids_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("ids", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+engine_liteServer::engine_liteServer()
+  : id_()
+  , port_()
+{}
+
+engine_liteServer::engine_liteServer(td::Bits256 const &id_, std::int32_t port_)
+  : id_(id_)
+  , port_(port_)
+{}
+
+const std::int32_t engine_liteServer::ID;
+
+object_ptr<engine_liteServer> engine_liteServer::fetch(td::TlParser &p) {
+  return make_object<engine_liteServer>(p);
+}
+
+engine_liteServer::engine_liteServer(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchInt256::parse(p))
+  , port_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_liteServer::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void engine_liteServer::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void engine_liteServer::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_liteServer");
+    s.store_field("id", id_);
+    s.store_field("port", port_);
+    s.store_class_end();
+  }
+}
+
+engine_validator::engine_validator()
+  : id_()
+  , temp_keys_()
+  , adnl_addrs_()
+  , election_date_()
+  , expire_at_()
+{}
+
+engine_validator::engine_validator(td::Bits256 const &id_, std::vector<object_ptr<engine_validatorTempKey>> &&temp_keys_, std::vector<object_ptr<engine_validatorAdnlAddress>> &&adnl_addrs_, std::int32_t election_date_, std::int32_t expire_at_)
+  : id_(id_)
+  , temp_keys_(std::move(temp_keys_))
+  , adnl_addrs_(std::move(adnl_addrs_))
+  , election_date_(election_date_)
+  , expire_at_(expire_at_)
+{}
+
+const std::int32_t engine_validator::ID;
+
+object_ptr<engine_validator> engine_validator::fetch(td::TlParser &p) {
+  return make_object<engine_validator>(p);
+}
+
+engine_validator::engine_validator(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchInt256::parse(p))
+  , temp_keys_(TlFetchVector<TlFetchObject<engine_validatorTempKey>>::parse(p))
+  , adnl_addrs_(TlFetchVector<TlFetchObject<engine_validatorAdnlAddress>>::parse(p))
+  , election_date_(TlFetchInt::parse(p))
+  , expire_at_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_validator::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreVector<TlStoreObject>::store(temp_keys_, s);
+  TlStoreVector<TlStoreObject>::store(adnl_addrs_, s);
+  TlStoreBinary::store(election_date_, s);
+  TlStoreBinary::store(expire_at_, s);
+}
+
+void engine_validator::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreVector<TlStoreObject>::store(temp_keys_, s);
+  TlStoreVector<TlStoreObject>::store(adnl_addrs_, s);
+  TlStoreBinary::store(election_date_, s);
+  TlStoreBinary::store(expire_at_, s);
+}
+
+void engine_validator::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator");
+    s.store_field("id", id_);
+    { const std::vector<object_ptr<engine_validatorTempKey>> &v = temp_keys_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("temp_keys", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    { const std::vector<object_ptr<engine_validatorAdnlAddress>> &v = adnl_addrs_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("adnl_addrs", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_field("election_date", election_date_);
+    s.store_field("expire_at", expire_at_);
+    s.store_class_end();
+  }
+}
+
+engine_validatorAdnlAddress::engine_validatorAdnlAddress()
+  : id_()
+  , expire_at_()
+{}
+
+engine_validatorAdnlAddress::engine_validatorAdnlAddress(td::Bits256 const &id_, std::int32_t expire_at_)
+  : id_(id_)
+  , expire_at_(expire_at_)
+{}
+
+const std::int32_t engine_validatorAdnlAddress::ID;
+
+object_ptr<engine_validatorAdnlAddress> engine_validatorAdnlAddress::fetch(td::TlParser &p) {
+  return make_object<engine_validatorAdnlAddress>(p);
+}
+
+engine_validatorAdnlAddress::engine_validatorAdnlAddress(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchInt256::parse(p))
+  , expire_at_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_validatorAdnlAddress::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreBinary::store(expire_at_, s);
+}
+
+void engine_validatorAdnlAddress::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreBinary::store(expire_at_, s);
+}
+
+void engine_validatorAdnlAddress::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validatorAdnlAddress");
+    s.store_field("id", id_);
+    s.store_field("expire_at", expire_at_);
+    s.store_class_end();
+  }
+}
+
+engine_validatorTempKey::engine_validatorTempKey()
+  : key_()
+  , expire_at_()
+{}
+
+engine_validatorTempKey::engine_validatorTempKey(td::Bits256 const &key_, std::int32_t expire_at_)
+  : key_(key_)
+  , expire_at_(expire_at_)
+{}
+
+const std::int32_t engine_validatorTempKey::ID;
+
+object_ptr<engine_validatorTempKey> engine_validatorTempKey::fetch(td::TlParser &p) {
+  return make_object<engine_validatorTempKey>(p);
+}
+
+engine_validatorTempKey::engine_validatorTempKey(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchInt256::parse(p))
+  , expire_at_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_validatorTempKey::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+  TlStoreBinary::store(expire_at_, s);
+}
+
+void engine_validatorTempKey::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_, s);
+  TlStoreBinary::store(expire_at_, s);
+}
+
+void engine_validatorTempKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validatorTempKey");
+    s.store_field("key", key_);
+    s.store_field("expire_at", expire_at_);
+    s.store_class_end();
+  }
+}
+
+engine_adnlProxy_config::engine_adnlProxy_config()
+  : ports_()
+{}
+
+engine_adnlProxy_config::engine_adnlProxy_config(std::vector<object_ptr<engine_adnlProxy_port>> &&ports_)
+  : ports_(std::move(ports_))
+{}
+
+const std::int32_t engine_adnlProxy_config::ID;
+
+object_ptr<engine_adnlProxy_config> engine_adnlProxy_config::fetch(td::TlParser &p) {
+  return make_object<engine_adnlProxy_config>(p);
+}
+
+engine_adnlProxy_config::engine_adnlProxy_config(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : ports_(TlFetchVector<TlFetchObject<engine_adnlProxy_port>>::parse(p))
+#undef FAIL
+{}
+
+void engine_adnlProxy_config::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(ports_, s);
+}
+
+void engine_adnlProxy_config::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(ports_, s);
+}
+
+void engine_adnlProxy_config::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_adnlProxy_config");
+    { const std::vector<object_ptr<engine_adnlProxy_port>> &v = ports_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("ports", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+engine_adnlProxy_port::engine_adnlProxy_port()
+  : in_port_()
+  , out_port_()
+  , dst_ip_()
+  , dst_port_()
+  , proxy_type_()
+{}
+
+engine_adnlProxy_port::engine_adnlProxy_port(std::int32_t in_port_, std::int32_t out_port_, std::int32_t dst_ip_, std::int32_t dst_port_, object_ptr<adnl_Proxy> &&proxy_type_)
+  : in_port_(in_port_)
+  , out_port_(out_port_)
+  , dst_ip_(dst_ip_)
+  , dst_port_(dst_port_)
+  , proxy_type_(std::move(proxy_type_))
+{}
+
+const std::int32_t engine_adnlProxy_port::ID;
+
+object_ptr<engine_adnlProxy_port> engine_adnlProxy_port::fetch(td::TlParser &p) {
+  return make_object<engine_adnlProxy_port>(p);
+}
+
+engine_adnlProxy_port::engine_adnlProxy_port(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : in_port_(TlFetchInt::parse(p))
+  , out_port_(TlFetchInt::parse(p))
+  , dst_ip_(TlFetchInt::parse(p))
+  , dst_port_(TlFetchInt::parse(p))
+  , proxy_type_(TlFetchObject<adnl_Proxy>::parse(p))
+#undef FAIL
+{}
+
+void engine_adnlProxy_port::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(in_port_, s);
+  TlStoreBinary::store(out_port_, s);
+  TlStoreBinary::store(dst_ip_, s);
+  TlStoreBinary::store(dst_port_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(proxy_type_, s);
+}
+
+void engine_adnlProxy_port::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(in_port_, s);
+  TlStoreBinary::store(out_port_, s);
+  TlStoreBinary::store(dst_ip_, s);
+  TlStoreBinary::store(dst_port_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(proxy_type_, s);
+}
+
+void engine_adnlProxy_port::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_adnlProxy_port");
+    s.store_field("in_port", in_port_);
+    s.store_field("out_port", out_port_);
+    s.store_field("dst_ip", dst_ip_);
+    s.store_field("dst_port", dst_port_);
+    if (proxy_type_ == nullptr) { s.store_field("proxy_type", "null"); } else { proxy_type_->store(s, "proxy_type"); }
+    s.store_class_end();
+  }
+}
+
+engine_dht_config::engine_dht_config()
+  : dht_()
+  , gc_()
+{}
+
+engine_dht_config::engine_dht_config(std::vector<object_ptr<engine_dht>> &&dht_, object_ptr<engine_gc> &&gc_)
+  : dht_(std::move(dht_))
+  , gc_(std::move(gc_))
+{}
+
+const std::int32_t engine_dht_config::ID;
+
+object_ptr<engine_dht_config> engine_dht_config::fetch(td::TlParser &p) {
+  return make_object<engine_dht_config>(p);
+}
+
+engine_dht_config::engine_dht_config(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : dht_(TlFetchVector<TlFetchObject<engine_dht>>::parse(p))
+  , gc_(TlFetchObject<engine_gc>::parse(p))
+#undef FAIL
+{}
+
+void engine_dht_config::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(dht_, s);
+  TlStoreObject::store(gc_, s);
+}
+
+void engine_dht_config::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(dht_, s);
+  TlStoreObject::store(gc_, s);
+}
+
+void engine_dht_config::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_dht_config");
+    { const std::vector<object_ptr<engine_dht>> &v = dht_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("dht", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    if (gc_ == nullptr) { s.store_field("gc", "null"); } else { gc_->store(s, "gc"); }
+    s.store_class_end();
+  }
+}
+
+engine_validator_config::engine_validator_config()
+  : out_port_()
+  , addrs_()
+  , adnl_()
+  , dht_()
+  , validators_()
+  , fullnode_()
+  , liteservers_()
+  , control_()
+  , gc_()
+{}
+
+engine_validator_config::engine_validator_config(std::int32_t out_port_, std::vector<object_ptr<engine_Addr>> &&addrs_, std::vector<object_ptr<engine_adnl>> &&adnl_, std::vector<object_ptr<engine_dht>> &&dht_, std::vector<object_ptr<engine_validator>> &&validators_, td::Bits256 const &fullnode_, std::vector<object_ptr<engine_liteServer>> &&liteservers_, std::vector<object_ptr<engine_controlInterface>> &&control_, object_ptr<engine_gc> &&gc_)
+  : out_port_(out_port_)
+  , addrs_(std::move(addrs_))
+  , adnl_(std::move(adnl_))
+  , dht_(std::move(dht_))
+  , validators_(std::move(validators_))
+  , fullnode_(fullnode_)
+  , liteservers_(std::move(liteservers_))
+  , control_(std::move(control_))
+  , gc_(std::move(gc_))
+{}
+
+const std::int32_t engine_validator_config::ID;
+
+object_ptr<engine_validator_config> engine_validator_config::fetch(td::TlParser &p) {
+  return make_object<engine_validator_config>(p);
+}
+
+engine_validator_config::engine_validator_config(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : out_port_(TlFetchInt::parse(p))
+  , addrs_(TlFetchVector<TlFetchObject<engine_Addr>>::parse(p))
+  , adnl_(TlFetchVector<TlFetchObject<engine_adnl>>::parse(p))
+  , dht_(TlFetchVector<TlFetchObject<engine_dht>>::parse(p))
+  , validators_(TlFetchVector<TlFetchObject<engine_validator>>::parse(p))
+  , fullnode_(TlFetchInt256::parse(p))
+  , liteservers_(TlFetchVector<TlFetchObject<engine_liteServer>>::parse(p))
+  , control_(TlFetchVector<TlFetchObject<engine_controlInterface>>::parse(p))
+  , gc_(TlFetchObject<engine_gc>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_config::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(out_port_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(addrs_, s);
+  TlStoreVector<TlStoreObject>::store(adnl_, s);
+  TlStoreVector<TlStoreObject>::store(dht_, s);
+  TlStoreVector<TlStoreObject>::store(validators_, s);
+  TlStoreBinary::store(fullnode_, s);
+  TlStoreVector<TlStoreObject>::store(liteservers_, s);
+  TlStoreVector<TlStoreObject>::store(control_, s);
+  TlStoreObject::store(gc_, s);
+}
+
+void engine_validator_config::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(out_port_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(addrs_, s);
+  TlStoreVector<TlStoreObject>::store(adnl_, s);
+  TlStoreVector<TlStoreObject>::store(dht_, s);
+  TlStoreVector<TlStoreObject>::store(validators_, s);
+  TlStoreBinary::store(fullnode_, s);
+  TlStoreVector<TlStoreObject>::store(liteservers_, s);
+  TlStoreVector<TlStoreObject>::store(control_, s);
+  TlStoreObject::store(gc_, s);
+}
+
+void engine_validator_config::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_config");
+    s.store_field("out_port", out_port_);
+    { const std::vector<object_ptr<engine_Addr>> &v = addrs_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("addrs", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    { const std::vector<object_ptr<engine_adnl>> &v = adnl_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("adnl", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    { const std::vector<object_ptr<engine_dht>> &v = dht_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("dht", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    { const std::vector<object_ptr<engine_validator>> &v = validators_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("validators", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_field("fullnode", fullnode_);
+    { const std::vector<object_ptr<engine_liteServer>> &v = liteservers_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("liteservers", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    { const std::vector<object_ptr<engine_controlInterface>> &v = control_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("control", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    if (gc_ == nullptr) { s.store_field("gc", "null"); } else { gc_->store(s, "gc"); }
+    s.store_class_end();
+  }
+}
+
+engine_validator_controlQueryError::engine_validator_controlQueryError()
+  : code_()
+  , message_()
+{}
+
+engine_validator_controlQueryError::engine_validator_controlQueryError(std::int32_t code_, std::string const &message_)
+  : code_(code_)
+  , message_(std::move(message_))
+{}
+
+const std::int32_t engine_validator_controlQueryError::ID;
+
+object_ptr<engine_validator_controlQueryError> engine_validator_controlQueryError::fetch(td::TlParser &p) {
+  return make_object<engine_validator_controlQueryError>(p);
+}
+
+engine_validator_controlQueryError::engine_validator_controlQueryError(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : code_(TlFetchInt::parse(p))
+  , message_(TlFetchString<std::string>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_controlQueryError::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(code_, s);
+  TlStoreString::store(message_, s);
+}
+
+void engine_validator_controlQueryError::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(code_, s);
+  TlStoreString::store(message_, s);
+}
+
+void engine_validator_controlQueryError::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_controlQueryError");
+    s.store_field("code", code_);
+    s.store_field("message", message_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_dhtServerStatus::engine_validator_dhtServerStatus()
+  : id_()
+  , status_()
+{}
+
+engine_validator_dhtServerStatus::engine_validator_dhtServerStatus(td::Bits256 const &id_, std::int32_t status_)
+  : id_(id_)
+  , status_(status_)
+{}
+
+const std::int32_t engine_validator_dhtServerStatus::ID;
+
+object_ptr<engine_validator_dhtServerStatus> engine_validator_dhtServerStatus::fetch(td::TlParser &p) {
+  return make_object<engine_validator_dhtServerStatus>(p);
+}
+
+engine_validator_dhtServerStatus::engine_validator_dhtServerStatus(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchInt256::parse(p))
+  , status_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_dhtServerStatus::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreBinary::store(status_, s);
+}
+
+void engine_validator_dhtServerStatus::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreBinary::store(status_, s);
+}
+
+void engine_validator_dhtServerStatus::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_dhtServerStatus");
+    s.store_field("id", id_);
+    s.store_field("status", status_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_dhtServersStatus::engine_validator_dhtServersStatus()
+  : servers_()
+{}
+
+engine_validator_dhtServersStatus::engine_validator_dhtServersStatus(std::vector<object_ptr<engine_validator_dhtServerStatus>> &&servers_)
+  : servers_(std::move(servers_))
+{}
+
+const std::int32_t engine_validator_dhtServersStatus::ID;
+
+object_ptr<engine_validator_dhtServersStatus> engine_validator_dhtServersStatus::fetch(td::TlParser &p) {
+  return make_object<engine_validator_dhtServersStatus>(p);
+}
+
+engine_validator_dhtServersStatus::engine_validator_dhtServersStatus(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : servers_(TlFetchVector<TlFetchObject<engine_validator_dhtServerStatus>>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_dhtServersStatus::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(servers_, s);
+}
+
+void engine_validator_dhtServersStatus::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(servers_, s);
+}
+
+void engine_validator_dhtServersStatus::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_dhtServersStatus");
+    { const std::vector<object_ptr<engine_validator_dhtServerStatus>> &v = servers_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("servers", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+engine_validator_electionBid::engine_validator_electionBid()
+  : election_date_()
+  , perm_key_()
+  , adnl_addr_()
+  , to_send_payload_()
+{}
+
+engine_validator_electionBid::engine_validator_electionBid(std::int32_t election_date_, td::Bits256 const &perm_key_, td::Bits256 const &adnl_addr_, td::BufferSlice &&to_send_payload_)
+  : election_date_(election_date_)
+  , perm_key_(perm_key_)
+  , adnl_addr_(adnl_addr_)
+  , to_send_payload_(std::move(to_send_payload_))
+{}
+
+const std::int32_t engine_validator_electionBid::ID;
+
+object_ptr<engine_validator_electionBid> engine_validator_electionBid::fetch(td::TlParser &p) {
+  return make_object<engine_validator_electionBid>(p);
+}
+
+engine_validator_electionBid::engine_validator_electionBid(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : election_date_(TlFetchInt::parse(p))
+  , perm_key_(TlFetchInt256::parse(p))
+  , adnl_addr_(TlFetchInt256::parse(p))
+  , to_send_payload_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_electionBid::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(election_date_, s);
+  TlStoreBinary::store(perm_key_, s);
+  TlStoreBinary::store(adnl_addr_, s);
+  TlStoreString::store(to_send_payload_, s);
+}
+
+void engine_validator_electionBid::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(election_date_, s);
+  TlStoreBinary::store(perm_key_, s);
+  TlStoreBinary::store(adnl_addr_, s);
+  TlStoreString::store(to_send_payload_, s);
+}
+
+void engine_validator_electionBid::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_electionBid");
+    s.store_field("election_date", election_date_);
+    s.store_field("perm_key", perm_key_);
+    s.store_field("adnl_addr", adnl_addr_);
+    s.store_bytes_field("to_send_payload", to_send_payload_);
+    s.store_class_end();
+  }
+}
+
+validator_groupMember::validator_groupMember()
+  : public_key_hash_()
+  , adnl_()
+  , weight_()
+{}
+
+validator_groupMember::validator_groupMember(td::Bits256 const &public_key_hash_, td::Bits256 const &adnl_, std::int64_t weight_)
+  : public_key_hash_(public_key_hash_)
+  , adnl_(adnl_)
+  , weight_(weight_)
+{}
+
+const std::int32_t validator_groupMember::ID;
+
+object_ptr<validator_groupMember> validator_groupMember::fetch(td::TlParser &p) {
+  return make_object<validator_groupMember>(p);
+}
+
+validator_groupMember::validator_groupMember(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : public_key_hash_(TlFetchInt256::parse(p))
+  , adnl_(TlFetchInt256::parse(p))
+  , weight_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void validator_groupMember::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(public_key_hash_, s);
+  TlStoreBinary::store(adnl_, s);
+  TlStoreBinary::store(weight_, s);
+}
+
+void validator_groupMember::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(public_key_hash_, s);
+  TlStoreBinary::store(adnl_, s);
+  TlStoreBinary::store(weight_, s);
+}
+
+void validator_groupMember::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validator_groupMember");
+    s.store_field("public_key_hash", public_key_hash_);
+    s.store_field("adnl", adnl_);
+    s.store_field("weight", weight_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_jsonConfig::engine_validator_jsonConfig()
+  : data_()
+{}
+
+engine_validator_jsonConfig::engine_validator_jsonConfig(std::string const &data_)
+  : data_(std::move(data_))
+{}
+
+const std::int32_t engine_validator_jsonConfig::ID;
+
+object_ptr<engine_validator_jsonConfig> engine_validator_jsonConfig::fetch(td::TlParser &p) {
+  return make_object<engine_validator_jsonConfig>(p);
+}
+
+engine_validator_jsonConfig::engine_validator_jsonConfig(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_(TlFetchString<std::string>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_jsonConfig::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void engine_validator_jsonConfig::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void engine_validator_jsonConfig::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_jsonConfig");
+    s.store_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_keyHash::engine_validator_keyHash()
+  : key_hash_()
+{}
+
+engine_validator_keyHash::engine_validator_keyHash(td::Bits256 const &key_hash_)
+  : key_hash_(key_hash_)
+{}
+
+const std::int32_t engine_validator_keyHash::ID;
+
+object_ptr<engine_validator_keyHash> engine_validator_keyHash::fetch(td::TlParser &p) {
+  return make_object<engine_validator_keyHash>(p);
+}
+
+engine_validator_keyHash::engine_validator_keyHash(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_keyHash::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_keyHash::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_keyHash::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_keyHash");
+    s.store_field("key_hash", key_hash_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_oneStat::engine_validator_oneStat()
+  : key_()
+  , value_()
+{}
+
+engine_validator_oneStat::engine_validator_oneStat(std::string const &key_, std::string const &value_)
+  : key_(std::move(key_))
+  , value_(std::move(value_))
+{}
+
+const std::int32_t engine_validator_oneStat::ID;
+
+object_ptr<engine_validator_oneStat> engine_validator_oneStat::fetch(td::TlParser &p) {
+  return make_object<engine_validator_oneStat>(p);
+}
+
+engine_validator_oneStat::engine_validator_oneStat(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchString<std::string>::parse(p))
+  , value_(TlFetchString<std::string>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_oneStat::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(key_, s);
+  TlStoreString::store(value_, s);
+}
+
+void engine_validator_oneStat::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(key_, s);
+  TlStoreString::store(value_, s);
+}
+
+void engine_validator_oneStat::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_oneStat");
+    s.store_field("key", key_);
+    s.store_field("value", value_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_signature::engine_validator_signature()
+  : signature_()
+{}
+
+engine_validator_signature::engine_validator_signature(td::BufferSlice &&signature_)
+  : signature_(std::move(signature_))
+{}
+
+const std::int32_t engine_validator_signature::ID;
+
+object_ptr<engine_validator_signature> engine_validator_signature::fetch(td::TlParser &p) {
+  return make_object<engine_validator_signature>(p);
+}
+
+engine_validator_signature::engine_validator_signature(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_signature::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(signature_, s);
+}
+
+void engine_validator_signature::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(signature_, s);
+}
+
+void engine_validator_signature::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_signature");
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_stats::engine_validator_stats()
+  : stats_()
+{}
+
+engine_validator_stats::engine_validator_stats(std::vector<object_ptr<engine_validator_oneStat>> &&stats_)
+  : stats_(std::move(stats_))
+{}
+
+const std::int32_t engine_validator_stats::ID;
+
+object_ptr<engine_validator_stats> engine_validator_stats::fetch(td::TlParser &p) {
+  return make_object<engine_validator_stats>(p);
+}
+
+engine_validator_stats::engine_validator_stats(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : stats_(TlFetchVector<TlFetchObject<engine_validator_oneStat>>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_stats::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(stats_, s);
+}
+
+void engine_validator_stats::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(stats_, s);
+}
+
+void engine_validator_stats::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_stats");
+    { const std::vector<object_ptr<engine_validator_oneStat>> &v = stats_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("stats", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+engine_validator_success::engine_validator_success() {
+}
+
+const std::int32_t engine_validator_success::ID;
+
+object_ptr<engine_validator_success> engine_validator_success::fetch(td::TlParser &p) {
+  return make_object<engine_validator_success>(p);
+}
+
+engine_validator_success::engine_validator_success(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void engine_validator_success::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void engine_validator_success::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void engine_validator_success::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_success");
+    s.store_class_end();
+  }
+}
+
+engine_validator_time::engine_validator_time()
+  : time_()
+{}
+
+engine_validator_time::engine_validator_time(std::int32_t time_)
+  : time_(time_)
+{}
+
+const std::int32_t engine_validator_time::ID;
+
+object_ptr<engine_validator_time> engine_validator_time::fetch(td::TlParser &p) {
+  return make_object<engine_validator_time>(p);
+}
+
+engine_validator_time::engine_validator_time(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : time_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_time::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(time_, s);
+}
+
+void engine_validator_time::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(time_, s);
+}
+
+void engine_validator_time::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_time");
+    s.store_field("time", time_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<fec_Type> fec_Type::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case fec_raptorQ::ID:
+      return fec_raptorQ::fetch(p);
+    case fec_roundRobin::ID:
+      return fec_roundRobin::fetch(p);
+    case fec_online::ID:
+      return fec_online::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+fec_raptorQ::fec_raptorQ()
+  : data_size_()
+  , symbol_size_()
+  , symbols_count_()
+{}
+
+fec_raptorQ::fec_raptorQ(std::int32_t data_size_, std::int32_t symbol_size_, std::int32_t symbols_count_)
+  : data_size_(data_size_)
+  , symbol_size_(symbol_size_)
+  , symbols_count_(symbols_count_)
+{}
+
+const std::int32_t fec_raptorQ::ID;
+
+object_ptr<fec_Type> fec_raptorQ::fetch(td::TlParser &p) {
+  return make_object<fec_raptorQ>(p);
+}
+
+fec_raptorQ::fec_raptorQ(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_size_(TlFetchInt::parse(p))
+  , symbol_size_(TlFetchInt::parse(p))
+  , symbols_count_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void fec_raptorQ::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(data_size_, s);
+  TlStoreBinary::store(symbol_size_, s);
+  TlStoreBinary::store(symbols_count_, s);
+}
+
+void fec_raptorQ::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(data_size_, s);
+  TlStoreBinary::store(symbol_size_, s);
+  TlStoreBinary::store(symbols_count_, s);
+}
+
+void fec_raptorQ::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "fec_raptorQ");
+    s.store_field("data_size", data_size_);
+    s.store_field("symbol_size", symbol_size_);
+    s.store_field("symbols_count", symbols_count_);
+    s.store_class_end();
+  }
+}
+
+fec_roundRobin::fec_roundRobin()
+  : data_size_()
+  , symbol_size_()
+  , symbols_count_()
+{}
+
+fec_roundRobin::fec_roundRobin(std::int32_t data_size_, std::int32_t symbol_size_, std::int32_t symbols_count_)
+  : data_size_(data_size_)
+  , symbol_size_(symbol_size_)
+  , symbols_count_(symbols_count_)
+{}
+
+const std::int32_t fec_roundRobin::ID;
+
+object_ptr<fec_Type> fec_roundRobin::fetch(td::TlParser &p) {
+  return make_object<fec_roundRobin>(p);
+}
+
+fec_roundRobin::fec_roundRobin(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_size_(TlFetchInt::parse(p))
+  , symbol_size_(TlFetchInt::parse(p))
+  , symbols_count_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void fec_roundRobin::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(data_size_, s);
+  TlStoreBinary::store(symbol_size_, s);
+  TlStoreBinary::store(symbols_count_, s);
+}
+
+void fec_roundRobin::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(data_size_, s);
+  TlStoreBinary::store(symbol_size_, s);
+  TlStoreBinary::store(symbols_count_, s);
+}
+
+void fec_roundRobin::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "fec_roundRobin");
+    s.store_field("data_size", data_size_);
+    s.store_field("symbol_size", symbol_size_);
+    s.store_field("symbols_count", symbols_count_);
+    s.store_class_end();
+  }
+}
+
+fec_online::fec_online()
+  : data_size_()
+  , symbol_size_()
+  , symbols_count_()
+{}
+
+fec_online::fec_online(std::int32_t data_size_, std::int32_t symbol_size_, std::int32_t symbols_count_)
+  : data_size_(data_size_)
+  , symbol_size_(symbol_size_)
+  , symbols_count_(symbols_count_)
+{}
+
+const std::int32_t fec_online::ID;
+
+object_ptr<fec_Type> fec_online::fetch(td::TlParser &p) {
+  return make_object<fec_online>(p);
+}
+
+fec_online::fec_online(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_size_(TlFetchInt::parse(p))
+  , symbol_size_(TlFetchInt::parse(p))
+  , symbols_count_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void fec_online::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(data_size_, s);
+  TlStoreBinary::store(symbol_size_, s);
+  TlStoreBinary::store(symbols_count_, s);
+}
+
+void fec_online::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(data_size_, s);
+  TlStoreBinary::store(symbol_size_, s);
+  TlStoreBinary::store(symbols_count_, s);
+}
+
+void fec_online::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "fec_online");
+    s.store_field("data_size", data_size_);
+    s.store_field("symbol_size", symbol_size_);
+    s.store_field("symbols_count", symbols_count_);
+    s.store_class_end();
+  }
+}
+
+id_config_local::id_config_local()
+  : id_()
+{}
+
+id_config_local::id_config_local(object_ptr<PrivateKey> &&id_)
+  : id_(std::move(id_))
+{}
+
+const std::int32_t id_config_local::ID;
+
+object_ptr<id_config_local> id_config_local::fetch(td::TlParser &p) {
+  return make_object<id_config_local>(p);
+}
+
+id_config_local::id_config_local(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<PrivateKey>::parse(p))
+#undef FAIL
+{}
+
+void id_config_local::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+}
+
+void id_config_local::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+}
+
+void id_config_local::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "id_config_local");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_class_end();
+  }
+}
+
+liteclient_config_global::liteclient_config_global()
+  : liteservers_()
+  , validator_()
+{}
+
+liteclient_config_global::liteclient_config_global(std::vector<object_ptr<liteserver_desc>> &&liteservers_, object_ptr<validator_config_global> &&validator_)
+  : liteservers_(std::move(liteservers_))
+  , validator_(std::move(validator_))
+{}
+
+const std::int32_t liteclient_config_global::ID;
+
+object_ptr<liteclient_config_global> liteclient_config_global::fetch(td::TlParser &p) {
+  return make_object<liteclient_config_global>(p);
+}
+
+liteclient_config_global::liteclient_config_global(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : liteservers_(TlFetchVector<TlFetchObject<liteserver_desc>>::parse(p))
+  , validator_(TlFetchObject<validator_config_global>::parse(p))
+#undef FAIL
+{}
+
+void liteclient_config_global::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(liteservers_, s);
+  TlStoreObject::store(validator_, s);
+}
+
+void liteclient_config_global::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(liteservers_, s);
+  TlStoreObject::store(validator_, s);
+}
+
+void liteclient_config_global::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteclient_config_global");
+    { const std::vector<object_ptr<liteserver_desc>> &v = liteservers_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("liteservers", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    if (validator_ == nullptr) { s.store_field("validator", "null"); } else { validator_->store(s, "validator"); }
+    s.store_class_end();
+  }
+}
+
+liteserver_desc::liteserver_desc()
+  : id_()
+  , ip_()
+  , port_()
+{}
+
+liteserver_desc::liteserver_desc(object_ptr<PublicKey> &&id_, std::int32_t ip_, std::int32_t port_)
+  : id_(std::move(id_))
+  , ip_(ip_)
+  , port_(port_)
+{}
+
+const std::int32_t liteserver_desc::ID;
+
+object_ptr<liteserver_desc> liteserver_desc::fetch(td::TlParser &p) {
+  return make_object<liteserver_desc>(p);
+}
+
+liteserver_desc::liteserver_desc(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<PublicKey>::parse(p))
+  , ip_(TlFetchInt::parse(p))
+  , port_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void liteserver_desc::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void liteserver_desc::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void liteserver_desc::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteserver_desc");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("ip", ip_);
+    s.store_field("port", port_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<liteserver_config_Local> liteserver_config_Local::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case liteserver_config_local::ID:
+      return liteserver_config_local::fetch(p);
+    case liteserver_config_random_local::ID:
+      return liteserver_config_random_local::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+liteserver_config_local::liteserver_config_local()
+  : id_()
+  , port_()
+{}
+
+liteserver_config_local::liteserver_config_local(object_ptr<PrivateKey> &&id_, std::int32_t port_)
+  : id_(std::move(id_))
+  , port_(port_)
+{}
+
+const std::int32_t liteserver_config_local::ID;
+
+object_ptr<liteserver_config_Local> liteserver_config_local::fetch(td::TlParser &p) {
+  return make_object<liteserver_config_local>(p);
+}
+
+liteserver_config_local::liteserver_config_local(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<PrivateKey>::parse(p))
+  , port_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void liteserver_config_local::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void liteserver_config_local::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void liteserver_config_local::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteserver_config_local");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("port", port_);
+    s.store_class_end();
+  }
+}
+
+liteserver_config_random_local::liteserver_config_random_local()
+  : port_()
+{}
+
+liteserver_config_random_local::liteserver_config_random_local(std::int32_t port_)
+  : port_(port_)
+{}
+
+const std::int32_t liteserver_config_random_local::ID;
+
+object_ptr<liteserver_config_Local> liteserver_config_random_local::fetch(td::TlParser &p) {
+  return make_object<liteserver_config_random_local>(p);
+}
+
+liteserver_config_random_local::liteserver_config_random_local(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : port_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void liteserver_config_random_local::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(port_, s);
+}
+
+void liteserver_config_random_local::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(port_, s);
+}
+
+void liteserver_config_random_local::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "liteserver_config_random_local");
+    s.store_field("port", port_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<overlay_Broadcast> overlay_Broadcast::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case overlay_fec_received::ID:
+      return overlay_fec_received::fetch(p);
+    case overlay_fec_completed::ID:
+      return overlay_fec_completed::fetch(p);
+    case overlay_unicast::ID:
+      return overlay_unicast::fetch(p);
+    case overlay_broadcast::ID:
+      return overlay_broadcast::fetch(p);
+    case overlay_broadcastFec::ID:
+      return overlay_broadcastFec::fetch(p);
+    case overlay_broadcastFecShort::ID:
+      return overlay_broadcastFecShort::fetch(p);
+    case overlay_broadcastNotFound::ID:
+      return overlay_broadcastNotFound::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+overlay_fec_received::overlay_fec_received()
+  : hash_()
+{}
+
+overlay_fec_received::overlay_fec_received(td::Bits256 const &hash_)
+  : hash_(hash_)
+{}
+
+const std::int32_t overlay_fec_received::ID;
+
+object_ptr<overlay_Broadcast> overlay_fec_received::fetch(td::TlParser &p) {
+  return make_object<overlay_fec_received>(p);
+}
+
+overlay_fec_received::overlay_fec_received(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void overlay_fec_received::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(hash_, s);
+}
+
+void overlay_fec_received::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(hash_, s);
+}
+
+void overlay_fec_received::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_fec_received");
+    s.store_field("hash", hash_);
+    s.store_class_end();
+  }
+}
+
+overlay_fec_completed::overlay_fec_completed()
+  : hash_()
+{}
+
+overlay_fec_completed::overlay_fec_completed(td::Bits256 const &hash_)
+  : hash_(hash_)
+{}
+
+const std::int32_t overlay_fec_completed::ID;
+
+object_ptr<overlay_Broadcast> overlay_fec_completed::fetch(td::TlParser &p) {
+  return make_object<overlay_fec_completed>(p);
+}
+
+overlay_fec_completed::overlay_fec_completed(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void overlay_fec_completed::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(hash_, s);
+}
+
+void overlay_fec_completed::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(hash_, s);
+}
+
+void overlay_fec_completed::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_fec_completed");
+    s.store_field("hash", hash_);
+    s.store_class_end();
+  }
+}
+
+overlay_unicast::overlay_unicast()
+  : data_()
+{}
+
+overlay_unicast::overlay_unicast(td::BufferSlice &&data_)
+  : data_(std::move(data_))
+{}
+
+const std::int32_t overlay_unicast::ID;
+
+object_ptr<overlay_Broadcast> overlay_unicast::fetch(td::TlParser &p) {
+  return make_object<overlay_unicast>(p);
+}
+
+overlay_unicast::overlay_unicast(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void overlay_unicast::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void overlay_unicast::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void overlay_unicast::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_unicast");
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+overlay_broadcast::overlay_broadcast()
+  : src_()
+  , certificate_()
+  , flags_()
+  , data_()
+  , date_()
+  , signature_()
+{}
+
+overlay_broadcast::overlay_broadcast(object_ptr<PublicKey> &&src_, object_ptr<overlay_Certificate> &&certificate_, std::int32_t flags_, td::BufferSlice &&data_, std::int32_t date_, td::BufferSlice &&signature_)
+  : src_(std::move(src_))
+  , certificate_(std::move(certificate_))
+  , flags_(flags_)
+  , data_(std::move(data_))
+  , date_(date_)
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t overlay_broadcast::ID;
+
+object_ptr<overlay_Broadcast> overlay_broadcast::fetch(td::TlParser &p) {
+  return make_object<overlay_broadcast>(p);
+}
+
+overlay_broadcast::overlay_broadcast(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : src_(TlFetchObject<PublicKey>::parse(p))
+  , certificate_(TlFetchObject<overlay_Certificate>::parse(p))
+  , flags_(TlFetchInt::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , date_(TlFetchInt::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void overlay_broadcast::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(src_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(certificate_, s);
+  TlStoreBinary::store(flags_, s);
+  TlStoreString::store(data_, s);
+  TlStoreBinary::store(date_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void overlay_broadcast::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(src_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(certificate_, s);
+  TlStoreBinary::store(flags_, s);
+  TlStoreString::store(data_, s);
+  TlStoreBinary::store(date_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void overlay_broadcast::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_broadcast");
+    if (src_ == nullptr) { s.store_field("src", "null"); } else { src_->store(s, "src"); }
+    if (certificate_ == nullptr) { s.store_field("certificate", "null"); } else { certificate_->store(s, "certificate"); }
+    s.store_field("flags", flags_);
+    s.store_bytes_field("data", data_);
+    s.store_field("date", date_);
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+overlay_broadcastFec::overlay_broadcastFec()
+  : src_()
+  , certificate_()
+  , data_hash_()
+  , data_size_()
+  , flags_()
+  , data_()
+  , seqno_()
+  , fec_()
+  , date_()
+  , signature_()
+{}
+
+overlay_broadcastFec::overlay_broadcastFec(object_ptr<PublicKey> &&src_, object_ptr<overlay_Certificate> &&certificate_, td::Bits256 const &data_hash_, std::int32_t data_size_, std::int32_t flags_, td::BufferSlice &&data_, std::int32_t seqno_, object_ptr<fec_Type> &&fec_, std::int32_t date_, td::BufferSlice &&signature_)
+  : src_(std::move(src_))
+  , certificate_(std::move(certificate_))
+  , data_hash_(data_hash_)
+  , data_size_(data_size_)
+  , flags_(flags_)
+  , data_(std::move(data_))
+  , seqno_(seqno_)
+  , fec_(std::move(fec_))
+  , date_(date_)
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t overlay_broadcastFec::ID;
+
+object_ptr<overlay_Broadcast> overlay_broadcastFec::fetch(td::TlParser &p) {
+  return make_object<overlay_broadcastFec>(p);
+}
+
+overlay_broadcastFec::overlay_broadcastFec(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : src_(TlFetchObject<PublicKey>::parse(p))
+  , certificate_(TlFetchObject<overlay_Certificate>::parse(p))
+  , data_hash_(TlFetchInt256::parse(p))
+  , data_size_(TlFetchInt::parse(p))
+  , flags_(TlFetchInt::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , seqno_(TlFetchInt::parse(p))
+  , fec_(TlFetchObject<fec_Type>::parse(p))
+  , date_(TlFetchInt::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void overlay_broadcastFec::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(src_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(certificate_, s);
+  TlStoreBinary::store(data_hash_, s);
+  TlStoreBinary::store(data_size_, s);
+  TlStoreBinary::store(flags_, s);
+  TlStoreString::store(data_, s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(fec_, s);
+  TlStoreBinary::store(date_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void overlay_broadcastFec::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(src_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(certificate_, s);
+  TlStoreBinary::store(data_hash_, s);
+  TlStoreBinary::store(data_size_, s);
+  TlStoreBinary::store(flags_, s);
+  TlStoreString::store(data_, s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(fec_, s);
+  TlStoreBinary::store(date_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void overlay_broadcastFec::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_broadcastFec");
+    if (src_ == nullptr) { s.store_field("src", "null"); } else { src_->store(s, "src"); }
+    if (certificate_ == nullptr) { s.store_field("certificate", "null"); } else { certificate_->store(s, "certificate"); }
+    s.store_field("data_hash", data_hash_);
+    s.store_field("data_size", data_size_);
+    s.store_field("flags", flags_);
+    s.store_bytes_field("data", data_);
+    s.store_field("seqno", seqno_);
+    if (fec_ == nullptr) { s.store_field("fec", "null"); } else { fec_->store(s, "fec"); }
+    s.store_field("date", date_);
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+overlay_broadcastFecShort::overlay_broadcastFecShort()
+  : src_()
+  , certificate_()
+  , broadcast_hash_()
+  , part_data_hash_()
+  , seqno_()
+  , signature_()
+{}
+
+overlay_broadcastFecShort::overlay_broadcastFecShort(object_ptr<PublicKey> &&src_, object_ptr<overlay_Certificate> &&certificate_, td::Bits256 const &broadcast_hash_, td::Bits256 const &part_data_hash_, std::int32_t seqno_, td::BufferSlice &&signature_)
+  : src_(std::move(src_))
+  , certificate_(std::move(certificate_))
+  , broadcast_hash_(broadcast_hash_)
+  , part_data_hash_(part_data_hash_)
+  , seqno_(seqno_)
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t overlay_broadcastFecShort::ID;
+
+object_ptr<overlay_Broadcast> overlay_broadcastFecShort::fetch(td::TlParser &p) {
+  return make_object<overlay_broadcastFecShort>(p);
+}
+
+overlay_broadcastFecShort::overlay_broadcastFecShort(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : src_(TlFetchObject<PublicKey>::parse(p))
+  , certificate_(TlFetchObject<overlay_Certificate>::parse(p))
+  , broadcast_hash_(TlFetchInt256::parse(p))
+  , part_data_hash_(TlFetchInt256::parse(p))
+  , seqno_(TlFetchInt::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void overlay_broadcastFecShort::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(src_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(certificate_, s);
+  TlStoreBinary::store(broadcast_hash_, s);
+  TlStoreBinary::store(part_data_hash_, s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void overlay_broadcastFecShort::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(src_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(certificate_, s);
+  TlStoreBinary::store(broadcast_hash_, s);
+  TlStoreBinary::store(part_data_hash_, s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void overlay_broadcastFecShort::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_broadcastFecShort");
+    if (src_ == nullptr) { s.store_field("src", "null"); } else { src_->store(s, "src"); }
+    if (certificate_ == nullptr) { s.store_field("certificate", "null"); } else { certificate_->store(s, "certificate"); }
+    s.store_field("broadcast_hash", broadcast_hash_);
+    s.store_field("part_data_hash", part_data_hash_);
+    s.store_field("seqno", seqno_);
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+overlay_broadcastNotFound::overlay_broadcastNotFound() {
+}
+
+const std::int32_t overlay_broadcastNotFound::ID;
+
+object_ptr<overlay_Broadcast> overlay_broadcastNotFound::fetch(td::TlParser &p) {
+  return make_object<overlay_broadcastNotFound>(p);
+}
+
+overlay_broadcastNotFound::overlay_broadcastNotFound(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void overlay_broadcastNotFound::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void overlay_broadcastNotFound::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void overlay_broadcastNotFound::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_broadcastNotFound");
+    s.store_class_end();
+  }
+}
+
+overlay_broadcastList::overlay_broadcastList()
+  : hashes_()
+{}
+
+overlay_broadcastList::overlay_broadcastList(std::vector<td::Bits256> &&hashes_)
+  : hashes_(std::move(hashes_))
+{}
+
+const std::int32_t overlay_broadcastList::ID;
+
+object_ptr<overlay_broadcastList> overlay_broadcastList::fetch(td::TlParser &p) {
+  return make_object<overlay_broadcastList>(p);
+}
+
+overlay_broadcastList::overlay_broadcastList(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : hashes_(TlFetchVector<TlFetchInt256>::parse(p))
+#undef FAIL
+{}
+
+void overlay_broadcastList::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreBinary>::store(hashes_, s);
+}
+
+void overlay_broadcastList::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreBinary>::store(hashes_, s);
+}
+
+void overlay_broadcastList::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_broadcastList");
+    { const std::vector<td::Bits256> &v = hashes_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("hashes", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+object_ptr<overlay_Certificate> overlay_Certificate::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case overlay_certificate::ID:
+      return overlay_certificate::fetch(p);
+    case overlay_emptyCertificate::ID:
+      return overlay_emptyCertificate::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+overlay_certificate::overlay_certificate()
+  : issued_by_()
+  , expire_at_()
+  , max_size_()
+  , signature_()
+{}
+
+overlay_certificate::overlay_certificate(object_ptr<PublicKey> &&issued_by_, std::int32_t expire_at_, std::int32_t max_size_, td::BufferSlice &&signature_)
+  : issued_by_(std::move(issued_by_))
+  , expire_at_(expire_at_)
+  , max_size_(max_size_)
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t overlay_certificate::ID;
+
+object_ptr<overlay_Certificate> overlay_certificate::fetch(td::TlParser &p) {
+  return make_object<overlay_certificate>(p);
+}
+
+overlay_certificate::overlay_certificate(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : issued_by_(TlFetchObject<PublicKey>::parse(p))
+  , expire_at_(TlFetchInt::parse(p))
+  , max_size_(TlFetchInt::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void overlay_certificate::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(issued_by_, s);
+  TlStoreBinary::store(expire_at_, s);
+  TlStoreBinary::store(max_size_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void overlay_certificate::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(issued_by_, s);
+  TlStoreBinary::store(expire_at_, s);
+  TlStoreBinary::store(max_size_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void overlay_certificate::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_certificate");
+    if (issued_by_ == nullptr) { s.store_field("issued_by", "null"); } else { issued_by_->store(s, "issued_by"); }
+    s.store_field("expire_at", expire_at_);
+    s.store_field("max_size", max_size_);
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+overlay_emptyCertificate::overlay_emptyCertificate() {
+}
+
+const std::int32_t overlay_emptyCertificate::ID;
+
+object_ptr<overlay_Certificate> overlay_emptyCertificate::fetch(td::TlParser &p) {
+  return make_object<overlay_emptyCertificate>(p);
+}
+
+overlay_emptyCertificate::overlay_emptyCertificate(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void overlay_emptyCertificate::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void overlay_emptyCertificate::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void overlay_emptyCertificate::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_emptyCertificate");
+    s.store_class_end();
+  }
+}
+
+overlay_certificateId::overlay_certificateId()
+  : overlay_id_()
+  , node_()
+  , expire_at_()
+  , max_size_()
+{}
+
+overlay_certificateId::overlay_certificateId(td::Bits256 const &overlay_id_, td::Bits256 const &node_, std::int32_t expire_at_, std::int32_t max_size_)
+  : overlay_id_(overlay_id_)
+  , node_(node_)
+  , expire_at_(expire_at_)
+  , max_size_(max_size_)
+{}
+
+const std::int32_t overlay_certificateId::ID;
+
+object_ptr<overlay_certificateId> overlay_certificateId::fetch(td::TlParser &p) {
+  return make_object<overlay_certificateId>(p);
+}
+
+overlay_certificateId::overlay_certificateId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : overlay_id_(TlFetchInt256::parse(p))
+  , node_(TlFetchInt256::parse(p))
+  , expire_at_(TlFetchInt::parse(p))
+  , max_size_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void overlay_certificateId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(overlay_id_, s);
+  TlStoreBinary::store(node_, s);
+  TlStoreBinary::store(expire_at_, s);
+  TlStoreBinary::store(max_size_, s);
+}
+
+void overlay_certificateId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(overlay_id_, s);
+  TlStoreBinary::store(node_, s);
+  TlStoreBinary::store(expire_at_, s);
+  TlStoreBinary::store(max_size_, s);
+}
+
+void overlay_certificateId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_certificateId");
+    s.store_field("overlay_id", overlay_id_);
+    s.store_field("node", node_);
+    s.store_field("expire_at", expire_at_);
+    s.store_field("max_size", max_size_);
+    s.store_class_end();
+  }
+}
+
+overlay_message::overlay_message()
+  : overlay_()
+{}
+
+overlay_message::overlay_message(td::Bits256 const &overlay_)
+  : overlay_(overlay_)
+{}
+
+const std::int32_t overlay_message::ID;
+
+object_ptr<overlay_message> overlay_message::fetch(td::TlParser &p) {
+  return make_object<overlay_message>(p);
+}
+
+overlay_message::overlay_message(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : overlay_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void overlay_message::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(overlay_, s);
+}
+
+void overlay_message::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(overlay_, s);
+}
+
+void overlay_message::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_message");
+    s.store_field("overlay", overlay_);
+    s.store_class_end();
+  }
+}
+
+overlay_node::overlay_node()
+  : id_()
+  , overlay_()
+  , version_()
+  , signature_()
+{}
+
+overlay_node::overlay_node(object_ptr<PublicKey> &&id_, td::Bits256 const &overlay_, std::int32_t version_, td::BufferSlice &&signature_)
+  : id_(std::move(id_))
+  , overlay_(overlay_)
+  , version_(version_)
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t overlay_node::ID;
+
+object_ptr<overlay_node> overlay_node::fetch(td::TlParser &p) {
+  return make_object<overlay_node>(p);
+}
+
+overlay_node::overlay_node(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<PublicKey>::parse(p))
+  , overlay_(TlFetchInt256::parse(p))
+  , version_(TlFetchInt::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void overlay_node::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreBinary::store(overlay_, s);
+  TlStoreBinary::store(version_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void overlay_node::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(id_, s);
+  TlStoreBinary::store(overlay_, s);
+  TlStoreBinary::store(version_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void overlay_node::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_node");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("overlay", overlay_);
+    s.store_field("version", version_);
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+overlay_nodes::overlay_nodes()
+  : nodes_()
+{}
+
+overlay_nodes::overlay_nodes(std::vector<object_ptr<overlay_node>> &&nodes_)
+  : nodes_(std::move(nodes_))
+{}
+
+const std::int32_t overlay_nodes::ID;
+
+object_ptr<overlay_nodes> overlay_nodes::fetch(td::TlParser &p) {
+  return make_object<overlay_nodes>(p);
+}
+
+overlay_nodes::overlay_nodes(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : nodes_(TlFetchVector<TlFetchObject<overlay_node>>::parse(p))
+#undef FAIL
+{}
+
+void overlay_nodes::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(nodes_, s);
+}
+
+void overlay_nodes::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(nodes_, s);
+}
+
+void overlay_nodes::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_nodes");
+    { const std::vector<object_ptr<overlay_node>> &v = nodes_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("nodes", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+overlay_broadcast_id::overlay_broadcast_id()
+  : src_()
+  , data_hash_()
+  , flags_()
+{}
+
+overlay_broadcast_id::overlay_broadcast_id(td::Bits256 const &src_, td::Bits256 const &data_hash_, std::int32_t flags_)
+  : src_(src_)
+  , data_hash_(data_hash_)
+  , flags_(flags_)
+{}
+
+const std::int32_t overlay_broadcast_id::ID;
+
+object_ptr<overlay_broadcast_id> overlay_broadcast_id::fetch(td::TlParser &p) {
+  return make_object<overlay_broadcast_id>(p);
+}
+
+overlay_broadcast_id::overlay_broadcast_id(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : src_(TlFetchInt256::parse(p))
+  , data_hash_(TlFetchInt256::parse(p))
+  , flags_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void overlay_broadcast_id::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(data_hash_, s);
+  TlStoreBinary::store(flags_, s);
+}
+
+void overlay_broadcast_id::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(data_hash_, s);
+  TlStoreBinary::store(flags_, s);
+}
+
+void overlay_broadcast_id::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_broadcast_id");
+    s.store_field("src", src_);
+    s.store_field("data_hash", data_hash_);
+    s.store_field("flags", flags_);
+    s.store_class_end();
+  }
+}
+
+overlay_broadcast_toSign::overlay_broadcast_toSign()
+  : hash_()
+  , date_()
+{}
+
+overlay_broadcast_toSign::overlay_broadcast_toSign(td::Bits256 const &hash_, std::int32_t date_)
+  : hash_(hash_)
+  , date_(date_)
+{}
+
+const std::int32_t overlay_broadcast_toSign::ID;
+
+object_ptr<overlay_broadcast_toSign> overlay_broadcast_toSign::fetch(td::TlParser &p) {
+  return make_object<overlay_broadcast_toSign>(p);
+}
+
+overlay_broadcast_toSign::overlay_broadcast_toSign(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : hash_(TlFetchInt256::parse(p))
+  , date_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void overlay_broadcast_toSign::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(hash_, s);
+  TlStoreBinary::store(date_, s);
+}
+
+void overlay_broadcast_toSign::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(hash_, s);
+  TlStoreBinary::store(date_, s);
+}
+
+void overlay_broadcast_toSign::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_broadcast_toSign");
+    s.store_field("hash", hash_);
+    s.store_field("date", date_);
+    s.store_class_end();
+  }
+}
+
+overlay_broadcastFec_id::overlay_broadcastFec_id()
+  : src_()
+  , type_()
+  , data_hash_()
+  , size_()
+  , flags_()
+{}
+
+overlay_broadcastFec_id::overlay_broadcastFec_id(td::Bits256 const &src_, td::Bits256 const &type_, td::Bits256 const &data_hash_, std::int32_t size_, std::int32_t flags_)
+  : src_(src_)
+  , type_(type_)
+  , data_hash_(data_hash_)
+  , size_(size_)
+  , flags_(flags_)
+{}
+
+const std::int32_t overlay_broadcastFec_id::ID;
+
+object_ptr<overlay_broadcastFec_id> overlay_broadcastFec_id::fetch(td::TlParser &p) {
+  return make_object<overlay_broadcastFec_id>(p);
+}
+
+overlay_broadcastFec_id::overlay_broadcastFec_id(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : src_(TlFetchInt256::parse(p))
+  , type_(TlFetchInt256::parse(p))
+  , data_hash_(TlFetchInt256::parse(p))
+  , size_(TlFetchInt::parse(p))
+  , flags_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void overlay_broadcastFec_id::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(type_, s);
+  TlStoreBinary::store(data_hash_, s);
+  TlStoreBinary::store(size_, s);
+  TlStoreBinary::store(flags_, s);
+}
+
+void overlay_broadcastFec_id::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(type_, s);
+  TlStoreBinary::store(data_hash_, s);
+  TlStoreBinary::store(size_, s);
+  TlStoreBinary::store(flags_, s);
+}
+
+void overlay_broadcastFec_id::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_broadcastFec_id");
+    s.store_field("src", src_);
+    s.store_field("type", type_);
+    s.store_field("data_hash", data_hash_);
+    s.store_field("size", size_);
+    s.store_field("flags", flags_);
+    s.store_class_end();
+  }
+}
+
+overlay_broadcastFec_partId::overlay_broadcastFec_partId()
+  : broadcast_hash_()
+  , data_hash_()
+  , seqno_()
+{}
+
+overlay_broadcastFec_partId::overlay_broadcastFec_partId(td::Bits256 const &broadcast_hash_, td::Bits256 const &data_hash_, std::int32_t seqno_)
+  : broadcast_hash_(broadcast_hash_)
+  , data_hash_(data_hash_)
+  , seqno_(seqno_)
+{}
+
+const std::int32_t overlay_broadcastFec_partId::ID;
+
+object_ptr<overlay_broadcastFec_partId> overlay_broadcastFec_partId::fetch(td::TlParser &p) {
+  return make_object<overlay_broadcastFec_partId>(p);
+}
+
+overlay_broadcastFec_partId::overlay_broadcastFec_partId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : broadcast_hash_(TlFetchInt256::parse(p))
+  , data_hash_(TlFetchInt256::parse(p))
+  , seqno_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void overlay_broadcastFec_partId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(broadcast_hash_, s);
+  TlStoreBinary::store(data_hash_, s);
+  TlStoreBinary::store(seqno_, s);
+}
+
+void overlay_broadcastFec_partId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(broadcast_hash_, s);
+  TlStoreBinary::store(data_hash_, s);
+  TlStoreBinary::store(seqno_, s);
+}
+
+void overlay_broadcastFec_partId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_broadcastFec_partId");
+    s.store_field("broadcast_hash", broadcast_hash_);
+    s.store_field("data_hash", data_hash_);
+    s.store_field("seqno", seqno_);
+    s.store_class_end();
+  }
+}
+
+overlay_db_key_nodes::overlay_db_key_nodes()
+  : local_id_()
+  , overlay_()
+{}
+
+overlay_db_key_nodes::overlay_db_key_nodes(td::Bits256 const &local_id_, td::Bits256 const &overlay_)
+  : local_id_(local_id_)
+  , overlay_(overlay_)
+{}
+
+const std::int32_t overlay_db_key_nodes::ID;
+
+object_ptr<overlay_db_key_nodes> overlay_db_key_nodes::fetch(td::TlParser &p) {
+  return make_object<overlay_db_key_nodes>(p);
+}
+
+overlay_db_key_nodes::overlay_db_key_nodes(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : local_id_(TlFetchInt256::parse(p))
+  , overlay_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void overlay_db_key_nodes::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(local_id_, s);
+  TlStoreBinary::store(overlay_, s);
+}
+
+void overlay_db_key_nodes::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(local_id_, s);
+  TlStoreBinary::store(overlay_, s);
+}
+
+void overlay_db_key_nodes::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_db_key_nodes");
+    s.store_field("local_id", local_id_);
+    s.store_field("overlay", overlay_);
+    s.store_class_end();
+  }
+}
+
+overlay_db_nodes::overlay_db_nodes()
+  : nodes_()
+{}
+
+overlay_db_nodes::overlay_db_nodes(object_ptr<overlay_nodes> &&nodes_)
+  : nodes_(std::move(nodes_))
+{}
+
+const std::int32_t overlay_db_nodes::ID;
+
+object_ptr<overlay_db_nodes> overlay_db_nodes::fetch(td::TlParser &p) {
+  return make_object<overlay_db_nodes>(p);
+}
+
+overlay_db_nodes::overlay_db_nodes(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : nodes_(TlFetchObject<overlay_nodes>::parse(p))
+#undef FAIL
+{}
+
+void overlay_db_nodes::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(nodes_, s);
+}
+
+void overlay_db_nodes::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(nodes_, s);
+}
+
+void overlay_db_nodes::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_db_nodes");
+    if (nodes_ == nullptr) { s.store_field("nodes", "null"); } else { nodes_->store(s, "nodes"); }
+    s.store_class_end();
+  }
+}
+
+overlay_node_toSign::overlay_node_toSign()
+  : id_()
+  , overlay_()
+  , version_()
+{}
+
+overlay_node_toSign::overlay_node_toSign(object_ptr<adnl_id_short> &&id_, td::Bits256 const &overlay_, std::int32_t version_)
+  : id_(std::move(id_))
+  , overlay_(overlay_)
+  , version_(version_)
+{}
+
+const std::int32_t overlay_node_toSign::ID;
+
+object_ptr<overlay_node_toSign> overlay_node_toSign::fetch(td::TlParser &p) {
+  return make_object<overlay_node_toSign>(p);
+}
+
+overlay_node_toSign::overlay_node_toSign(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<adnl_id_short>::parse(p))
+  , overlay_(TlFetchInt256::parse(p))
+  , version_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void overlay_node_toSign::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(overlay_, s);
+  TlStoreBinary::store(version_, s);
+}
+
+void overlay_node_toSign::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(overlay_, s);
+  TlStoreBinary::store(version_, s);
+}
+
+void overlay_node_toSign::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_node_toSign");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("overlay", overlay_);
+    s.store_field("version", version_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<rldp_Message> rldp_Message::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case rldp_message::ID:
+      return rldp_message::fetch(p);
+    case rldp_query::ID:
+      return rldp_query::fetch(p);
+    case rldp_answer::ID:
+      return rldp_answer::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+rldp_message::rldp_message()
+  : id_()
+  , data_()
+{}
+
+rldp_message::rldp_message(td::Bits256 const &id_, td::BufferSlice &&data_)
+  : id_(id_)
+  , data_(std::move(data_))
+{}
+
+const std::int32_t rldp_message::ID;
+
+object_ptr<rldp_Message> rldp_message::fetch(td::TlParser &p) {
+  return make_object<rldp_message>(p);
+}
+
+rldp_message::rldp_message(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchInt256::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void rldp_message::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreString::store(data_, s);
+}
+
+void rldp_message::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(id_, s);
+  TlStoreString::store(data_, s);
+}
+
+void rldp_message::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "rldp_message");
+    s.store_field("id", id_);
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+rldp_query::rldp_query()
+  : query_id_()
+  , max_answer_size_()
+  , timeout_()
+  , data_()
+{}
+
+rldp_query::rldp_query(td::Bits256 const &query_id_, std::int64_t max_answer_size_, std::int32_t timeout_, td::BufferSlice &&data_)
+  : query_id_(query_id_)
+  , max_answer_size_(max_answer_size_)
+  , timeout_(timeout_)
+  , data_(std::move(data_))
+{}
+
+const std::int32_t rldp_query::ID;
+
+object_ptr<rldp_Message> rldp_query::fetch(td::TlParser &p) {
+  return make_object<rldp_query>(p);
+}
+
+rldp_query::rldp_query(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : query_id_(TlFetchInt256::parse(p))
+  , max_answer_size_(TlFetchLong::parse(p))
+  , timeout_(TlFetchInt::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void rldp_query::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(query_id_, s);
+  TlStoreBinary::store(max_answer_size_, s);
+  TlStoreBinary::store(timeout_, s);
+  TlStoreString::store(data_, s);
+}
+
+void rldp_query::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(query_id_, s);
+  TlStoreBinary::store(max_answer_size_, s);
+  TlStoreBinary::store(timeout_, s);
+  TlStoreString::store(data_, s);
+}
+
+void rldp_query::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "rldp_query");
+    s.store_field("query_id", query_id_);
+    s.store_field("max_answer_size", max_answer_size_);
+    s.store_field("timeout", timeout_);
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+rldp_answer::rldp_answer()
+  : query_id_()
+  , data_()
+{}
+
+rldp_answer::rldp_answer(td::Bits256 const &query_id_, td::BufferSlice &&data_)
+  : query_id_(query_id_)
+  , data_(std::move(data_))
+{}
+
+const std::int32_t rldp_answer::ID;
+
+object_ptr<rldp_Message> rldp_answer::fetch(td::TlParser &p) {
+  return make_object<rldp_answer>(p);
+}
+
+rldp_answer::rldp_answer(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : query_id_(TlFetchInt256::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void rldp_answer::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(query_id_, s);
+  TlStoreString::store(data_, s);
+}
+
+void rldp_answer::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(query_id_, s);
+  TlStoreString::store(data_, s);
+}
+
+void rldp_answer::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "rldp_answer");
+    s.store_field("query_id", query_id_);
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<rldp_MessagePart> rldp_MessagePart::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case rldp_messagePart::ID:
+      return rldp_messagePart::fetch(p);
+    case rldp_confirm::ID:
+      return rldp_confirm::fetch(p);
+    case rldp_complete::ID:
+      return rldp_complete::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+rldp_messagePart::rldp_messagePart()
+  : transfer_id_()
+  , fec_type_()
+  , part_()
+  , total_size_()
+  , seqno_()
+  , data_()
+{}
+
+rldp_messagePart::rldp_messagePart(td::Bits256 const &transfer_id_, object_ptr<fec_Type> &&fec_type_, std::int32_t part_, std::int64_t total_size_, std::int32_t seqno_, td::BufferSlice &&data_)
+  : transfer_id_(transfer_id_)
+  , fec_type_(std::move(fec_type_))
+  , part_(part_)
+  , total_size_(total_size_)
+  , seqno_(seqno_)
+  , data_(std::move(data_))
+{}
+
+const std::int32_t rldp_messagePart::ID;
+
+object_ptr<rldp_MessagePart> rldp_messagePart::fetch(td::TlParser &p) {
+  return make_object<rldp_messagePart>(p);
+}
+
+rldp_messagePart::rldp_messagePart(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : transfer_id_(TlFetchInt256::parse(p))
+  , fec_type_(TlFetchObject<fec_Type>::parse(p))
+  , part_(TlFetchInt::parse(p))
+  , total_size_(TlFetchLong::parse(p))
+  , seqno_(TlFetchInt::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void rldp_messagePart::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(transfer_id_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(fec_type_, s);
+  TlStoreBinary::store(part_, s);
+  TlStoreBinary::store(total_size_, s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreString::store(data_, s);
+}
+
+void rldp_messagePart::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(transfer_id_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(fec_type_, s);
+  TlStoreBinary::store(part_, s);
+  TlStoreBinary::store(total_size_, s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreString::store(data_, s);
+}
+
+void rldp_messagePart::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "rldp_messagePart");
+    s.store_field("transfer_id", transfer_id_);
+    if (fec_type_ == nullptr) { s.store_field("fec_type", "null"); } else { fec_type_->store(s, "fec_type"); }
+    s.store_field("part", part_);
+    s.store_field("total_size", total_size_);
+    s.store_field("seqno", seqno_);
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+rldp_confirm::rldp_confirm()
+  : transfer_id_()
+  , part_()
+  , seqno_()
+{}
+
+rldp_confirm::rldp_confirm(td::Bits256 const &transfer_id_, std::int32_t part_, std::int32_t seqno_)
+  : transfer_id_(transfer_id_)
+  , part_(part_)
+  , seqno_(seqno_)
+{}
+
+const std::int32_t rldp_confirm::ID;
+
+object_ptr<rldp_MessagePart> rldp_confirm::fetch(td::TlParser &p) {
+  return make_object<rldp_confirm>(p);
+}
+
+rldp_confirm::rldp_confirm(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : transfer_id_(TlFetchInt256::parse(p))
+  , part_(TlFetchInt::parse(p))
+  , seqno_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void rldp_confirm::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(transfer_id_, s);
+  TlStoreBinary::store(part_, s);
+  TlStoreBinary::store(seqno_, s);
+}
+
+void rldp_confirm::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(transfer_id_, s);
+  TlStoreBinary::store(part_, s);
+  TlStoreBinary::store(seqno_, s);
+}
+
+void rldp_confirm::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "rldp_confirm");
+    s.store_field("transfer_id", transfer_id_);
+    s.store_field("part", part_);
+    s.store_field("seqno", seqno_);
+    s.store_class_end();
+  }
+}
+
+rldp_complete::rldp_complete()
+  : transfer_id_()
+  , part_()
+{}
+
+rldp_complete::rldp_complete(td::Bits256 const &transfer_id_, std::int32_t part_)
+  : transfer_id_(transfer_id_)
+  , part_(part_)
+{}
+
+const std::int32_t rldp_complete::ID;
+
+object_ptr<rldp_MessagePart> rldp_complete::fetch(td::TlParser &p) {
+  return make_object<rldp_complete>(p);
+}
+
+rldp_complete::rldp_complete(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : transfer_id_(TlFetchInt256::parse(p))
+  , part_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void rldp_complete::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(transfer_id_, s);
+  TlStoreBinary::store(part_, s);
+}
+
+void rldp_complete::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(transfer_id_, s);
+  TlStoreBinary::store(part_, s);
+}
+
+void rldp_complete::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "rldp_complete");
+    s.store_field("transfer_id", transfer_id_);
+    s.store_field("part", part_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<tcp_Message> tcp_Message::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case tcp_authentificate::ID:
+      return tcp_authentificate::fetch(p);
+    case tcp_authentificationNonce::ID:
+      return tcp_authentificationNonce::fetch(p);
+    case tcp_authentificationComplete::ID:
+      return tcp_authentificationComplete::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+tcp_authentificate::tcp_authentificate()
+  : nonce_()
+{}
+
+tcp_authentificate::tcp_authentificate(td::BufferSlice &&nonce_)
+  : nonce_(std::move(nonce_))
+{}
+
+const std::int32_t tcp_authentificate::ID;
+
+object_ptr<tcp_Message> tcp_authentificate::fetch(td::TlParser &p) {
+  return make_object<tcp_authentificate>(p);
+}
+
+tcp_authentificate::tcp_authentificate(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : nonce_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void tcp_authentificate::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(nonce_, s);
+}
+
+void tcp_authentificate::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(nonce_, s);
+}
+
+void tcp_authentificate::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tcp_authentificate");
+    s.store_bytes_field("nonce", nonce_);
+    s.store_class_end();
+  }
+}
+
+tcp_authentificationNonce::tcp_authentificationNonce()
+  : nonce_()
+{}
+
+tcp_authentificationNonce::tcp_authentificationNonce(td::BufferSlice &&nonce_)
+  : nonce_(std::move(nonce_))
+{}
+
+const std::int32_t tcp_authentificationNonce::ID;
+
+object_ptr<tcp_Message> tcp_authentificationNonce::fetch(td::TlParser &p) {
+  return make_object<tcp_authentificationNonce>(p);
+}
+
+tcp_authentificationNonce::tcp_authentificationNonce(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : nonce_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void tcp_authentificationNonce::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(nonce_, s);
+}
+
+void tcp_authentificationNonce::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(nonce_, s);
+}
+
+void tcp_authentificationNonce::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tcp_authentificationNonce");
+    s.store_bytes_field("nonce", nonce_);
+    s.store_class_end();
+  }
+}
+
+tcp_authentificationComplete::tcp_authentificationComplete()
+  : key_()
+  , signature_()
+{}
+
+tcp_authentificationComplete::tcp_authentificationComplete(object_ptr<PublicKey> &&key_, td::BufferSlice &&signature_)
+  : key_(std::move(key_))
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t tcp_authentificationComplete::ID;
+
+object_ptr<tcp_Message> tcp_authentificationComplete::fetch(td::TlParser &p) {
+  return make_object<tcp_authentificationComplete>(p);
+}
+
+tcp_authentificationComplete::tcp_authentificationComplete(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchObject<PublicKey>::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void tcp_authentificationComplete::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(key_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void tcp_authentificationComplete::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(key_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void tcp_authentificationComplete::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tcp_authentificationComplete");
+    if (key_ == nullptr) { s.store_field("key", "null"); } else { key_->store(s, "key"); }
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+tcp_pong::tcp_pong()
+  : random_id_()
+{}
+
+tcp_pong::tcp_pong(std::int64_t random_id_)
+  : random_id_(random_id_)
+{}
+
+const std::int32_t tcp_pong::ID;
+
+object_ptr<tcp_pong> tcp_pong::fetch(td::TlParser &p) {
+  return make_object<tcp_pong>(p);
+}
+
+tcp_pong::tcp_pong(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : random_id_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void tcp_pong::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(random_id_, s);
+}
+
+void tcp_pong::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(random_id_, s);
+}
+
+void tcp_pong::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tcp_pong");
+    s.store_field("random_id", random_id_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<ton_BlockId> ton_BlockId::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case ton_blockId::ID:
+      return ton_blockId::fetch(p);
+    case ton_blockIdApprove::ID:
+      return ton_blockIdApprove::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+ton_blockId::ton_blockId()
+  : root_cell_hash_()
+  , file_hash_()
+{}
+
+ton_blockId::ton_blockId(td::Bits256 const &root_cell_hash_, td::Bits256 const &file_hash_)
+  : root_cell_hash_(root_cell_hash_)
+  , file_hash_(file_hash_)
+{}
+
+const std::int32_t ton_blockId::ID;
+
+object_ptr<ton_BlockId> ton_blockId::fetch(td::TlParser &p) {
+  return make_object<ton_blockId>(p);
+}
+
+ton_blockId::ton_blockId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : root_cell_hash_(TlFetchInt256::parse(p))
+  , file_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void ton_blockId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(root_cell_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void ton_blockId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(root_cell_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void ton_blockId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "ton_blockId");
+    s.store_field("root_cell_hash", root_cell_hash_);
+    s.store_field("file_hash", file_hash_);
+    s.store_class_end();
+  }
+}
+
+ton_blockIdApprove::ton_blockIdApprove()
+  : root_cell_hash_()
+  , file_hash_()
+{}
+
+ton_blockIdApprove::ton_blockIdApprove(td::Bits256 const &root_cell_hash_, td::Bits256 const &file_hash_)
+  : root_cell_hash_(root_cell_hash_)
+  , file_hash_(file_hash_)
+{}
+
+const std::int32_t ton_blockIdApprove::ID;
+
+object_ptr<ton_BlockId> ton_blockIdApprove::fetch(td::TlParser &p) {
+  return make_object<ton_blockIdApprove>(p);
+}
+
+ton_blockIdApprove::ton_blockIdApprove(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : root_cell_hash_(TlFetchInt256::parse(p))
+  , file_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void ton_blockIdApprove::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(root_cell_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void ton_blockIdApprove::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(root_cell_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void ton_blockIdApprove::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "ton_blockIdApprove");
+    s.store_field("root_cell_hash", root_cell_hash_);
+    s.store_field("file_hash", file_hash_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<tonNode_BlockDescription> tonNode_BlockDescription::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case tonNode_blockDescriptionEmpty::ID:
+      return tonNode_blockDescriptionEmpty::fetch(p);
+    case tonNode_blockDescription::ID:
+      return tonNode_blockDescription::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+tonNode_blockDescriptionEmpty::tonNode_blockDescriptionEmpty() {
+}
+
+const std::int32_t tonNode_blockDescriptionEmpty::ID;
+
+object_ptr<tonNode_BlockDescription> tonNode_blockDescriptionEmpty::fetch(td::TlParser &p) {
+  return make_object<tonNode_blockDescriptionEmpty>(p);
+}
+
+tonNode_blockDescriptionEmpty::tonNode_blockDescriptionEmpty(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void tonNode_blockDescriptionEmpty::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_blockDescriptionEmpty::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_blockDescriptionEmpty::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_blockDescriptionEmpty");
+    s.store_class_end();
+  }
+}
+
+tonNode_blockDescription::tonNode_blockDescription()
+  : id_()
+{}
+
+tonNode_blockDescription::tonNode_blockDescription(object_ptr<tonNode_blockIdExt> &&id_)
+  : id_(std::move(id_))
+{}
+
+const std::int32_t tonNode_blockDescription::ID;
+
+object_ptr<tonNode_BlockDescription> tonNode_blockDescription::fetch(td::TlParser &p) {
+  return make_object<tonNode_blockDescription>(p);
+}
+
+tonNode_blockDescription::tonNode_blockDescription(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_blockDescription::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+}
+
+void tonNode_blockDescription::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+}
+
+void tonNode_blockDescription::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_blockDescription");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_class_end();
+  }
+}
+
+tonNode_blockId::tonNode_blockId()
+  : workchain_()
+  , shard_()
+  , seqno_()
+{}
+
+tonNode_blockId::tonNode_blockId(std::int32_t workchain_, std::int64_t shard_, std::int32_t seqno_)
+  : workchain_(workchain_)
+  , shard_(shard_)
+  , seqno_(seqno_)
+{}
+
+const std::int32_t tonNode_blockId::ID;
+
+object_ptr<tonNode_blockId> tonNode_blockId::fetch(td::TlParser &p) {
+  return make_object<tonNode_blockId>(p);
+}
+
+tonNode_blockId::tonNode_blockId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : workchain_(TlFetchInt::parse(p))
+  , shard_(TlFetchLong::parse(p))
+  , seqno_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void tonNode_blockId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(seqno_, s);
+}
+
+void tonNode_blockId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(seqno_, s);
+}
+
+void tonNode_blockId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_blockId");
+    s.store_field("workchain", workchain_);
+    s.store_field("shard", shard_);
+    s.store_field("seqno", seqno_);
+    s.store_class_end();
+  }
+}
+
+tonNode_blockIdExt::tonNode_blockIdExt()
+  : workchain_()
+  , shard_()
+  , seqno_()
+  , root_hash_()
+  , file_hash_()
+{}
+
+tonNode_blockIdExt::tonNode_blockIdExt(std::int32_t workchain_, std::int64_t shard_, std::int32_t seqno_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_)
+  : workchain_(workchain_)
+  , shard_(shard_)
+  , seqno_(seqno_)
+  , root_hash_(root_hash_)
+  , file_hash_(file_hash_)
+{}
+
+const std::int32_t tonNode_blockIdExt::ID;
+
+object_ptr<tonNode_blockIdExt> tonNode_blockIdExt::fetch(td::TlParser &p) {
+  return make_object<tonNode_blockIdExt>(p);
+}
+
+tonNode_blockIdExt::tonNode_blockIdExt(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : workchain_(TlFetchInt::parse(p))
+  , shard_(TlFetchLong::parse(p))
+  , seqno_(TlFetchInt::parse(p))
+  , root_hash_(TlFetchInt256::parse(p))
+  , file_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void tonNode_blockIdExt::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void tonNode_blockIdExt::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(seqno_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void tonNode_blockIdExt::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_blockIdExt");
+    s.store_field("workchain", workchain_);
+    s.store_field("shard", shard_);
+    s.store_field("seqno", seqno_);
+    s.store_field("root_hash", root_hash_);
+    s.store_field("file_hash", file_hash_);
+    s.store_class_end();
+  }
+}
+
+tonNode_blockSignature::tonNode_blockSignature()
+  : who_()
+  , signature_()
+{}
+
+tonNode_blockSignature::tonNode_blockSignature(td::Bits256 const &who_, td::BufferSlice &&signature_)
+  : who_(who_)
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t tonNode_blockSignature::ID;
+
+object_ptr<tonNode_blockSignature> tonNode_blockSignature::fetch(td::TlParser &p) {
+  return make_object<tonNode_blockSignature>(p);
+}
+
+tonNode_blockSignature::tonNode_blockSignature(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : who_(TlFetchInt256::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_blockSignature::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(who_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void tonNode_blockSignature::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(who_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void tonNode_blockSignature::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_blockSignature");
+    s.store_field("who", who_);
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<tonNode_Broadcast> tonNode_Broadcast::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case tonNode_blockBroadcast::ID:
+      return tonNode_blockBroadcast::fetch(p);
+    case tonNode_ihrMessageBroadcast::ID:
+      return tonNode_ihrMessageBroadcast::fetch(p);
+    case tonNode_externalMessageBroadcast::ID:
+      return tonNode_externalMessageBroadcast::fetch(p);
+    case tonNode_newShardBlockBroadcast::ID:
+      return tonNode_newShardBlockBroadcast::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+tonNode_blockBroadcast::tonNode_blockBroadcast()
+  : id_()
+  , catchain_seqno_()
+  , validator_set_hash_()
+  , signatures_()
+  , proof_()
+  , data_()
+{}
+
+tonNode_blockBroadcast::tonNode_blockBroadcast(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t catchain_seqno_, std::int32_t validator_set_hash_, std::vector<object_ptr<tonNode_blockSignature>> &&signatures_, td::BufferSlice &&proof_, td::BufferSlice &&data_)
+  : id_(std::move(id_))
+  , catchain_seqno_(catchain_seqno_)
+  , validator_set_hash_(validator_set_hash_)
+  , signatures_(std::move(signatures_))
+  , proof_(std::move(proof_))
+  , data_(std::move(data_))
+{}
+
+const std::int32_t tonNode_blockBroadcast::ID;
+
+object_ptr<tonNode_Broadcast> tonNode_blockBroadcast::fetch(td::TlParser &p) {
+  return make_object<tonNode_blockBroadcast>(p);
+}
+
+tonNode_blockBroadcast::tonNode_blockBroadcast(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , catchain_seqno_(TlFetchInt::parse(p))
+  , validator_set_hash_(TlFetchInt::parse(p))
+  , signatures_(TlFetchVector<TlFetchObject<tonNode_blockSignature>>::parse(p))
+  , proof_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_blockBroadcast::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(catchain_seqno_, s);
+  TlStoreBinary::store(validator_set_hash_, s);
+  TlStoreVector<TlStoreObject>::store(signatures_, s);
+  TlStoreString::store(proof_, s);
+  TlStoreString::store(data_, s);
+}
+
+void tonNode_blockBroadcast::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+  TlStoreBinary::store(catchain_seqno_, s);
+  TlStoreBinary::store(validator_set_hash_, s);
+  TlStoreVector<TlStoreObject>::store(signatures_, s);
+  TlStoreString::store(proof_, s);
+  TlStoreString::store(data_, s);
+}
+
+void tonNode_blockBroadcast::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_blockBroadcast");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_field("catchain_seqno", catchain_seqno_);
+    s.store_field("validator_set_hash", validator_set_hash_);
+    { const std::vector<object_ptr<tonNode_blockSignature>> &v = signatures_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("signatures", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_bytes_field("proof", proof_);
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+tonNode_ihrMessageBroadcast::tonNode_ihrMessageBroadcast()
+  : message_()
+{}
+
+tonNode_ihrMessageBroadcast::tonNode_ihrMessageBroadcast(object_ptr<tonNode_ihrMessage> &&message_)
+  : message_(std::move(message_))
+{}
+
+const std::int32_t tonNode_ihrMessageBroadcast::ID;
+
+object_ptr<tonNode_Broadcast> tonNode_ihrMessageBroadcast::fetch(td::TlParser &p) {
+  return make_object<tonNode_ihrMessageBroadcast>(p);
+}
+
+tonNode_ihrMessageBroadcast::tonNode_ihrMessageBroadcast(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : message_(TlFetchObject<tonNode_ihrMessage>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_ihrMessageBroadcast::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(message_, s);
+}
+
+void tonNode_ihrMessageBroadcast::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(message_, s);
+}
+
+void tonNode_ihrMessageBroadcast::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_ihrMessageBroadcast");
+    if (message_ == nullptr) { s.store_field("message", "null"); } else { message_->store(s, "message"); }
+    s.store_class_end();
+  }
+}
+
+tonNode_externalMessageBroadcast::tonNode_externalMessageBroadcast()
+  : message_()
+{}
+
+tonNode_externalMessageBroadcast::tonNode_externalMessageBroadcast(object_ptr<tonNode_externalMessage> &&message_)
+  : message_(std::move(message_))
+{}
+
+const std::int32_t tonNode_externalMessageBroadcast::ID;
+
+object_ptr<tonNode_Broadcast> tonNode_externalMessageBroadcast::fetch(td::TlParser &p) {
+  return make_object<tonNode_externalMessageBroadcast>(p);
+}
+
+tonNode_externalMessageBroadcast::tonNode_externalMessageBroadcast(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : message_(TlFetchObject<tonNode_externalMessage>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_externalMessageBroadcast::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(message_, s);
+}
+
+void tonNode_externalMessageBroadcast::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(message_, s);
+}
+
+void tonNode_externalMessageBroadcast::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_externalMessageBroadcast");
+    if (message_ == nullptr) { s.store_field("message", "null"); } else { message_->store(s, "message"); }
+    s.store_class_end();
+  }
+}
+
+tonNode_newShardBlockBroadcast::tonNode_newShardBlockBroadcast()
+  : block_()
+{}
+
+tonNode_newShardBlockBroadcast::tonNode_newShardBlockBroadcast(object_ptr<tonNode_newShardBlock> &&block_)
+  : block_(std::move(block_))
+{}
+
+const std::int32_t tonNode_newShardBlockBroadcast::ID;
+
+object_ptr<tonNode_Broadcast> tonNode_newShardBlockBroadcast::fetch(td::TlParser &p) {
+  return make_object<tonNode_newShardBlockBroadcast>(p);
+}
+
+tonNode_newShardBlockBroadcast::tonNode_newShardBlockBroadcast(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_newShardBlock>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_newShardBlockBroadcast::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_newShardBlockBroadcast::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_newShardBlockBroadcast::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_newShardBlockBroadcast");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_class_end();
+  }
+}
+
+tonNode_data::tonNode_data()
+  : data_()
+{}
+
+tonNode_data::tonNode_data(td::BufferSlice &&data_)
+  : data_(std::move(data_))
+{}
+
+const std::int32_t tonNode_data::ID;
+
+object_ptr<tonNode_data> tonNode_data::fetch(td::TlParser &p) {
+  return make_object<tonNode_data>(p);
+}
+
+tonNode_data::tonNode_data(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_data::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void tonNode_data::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void tonNode_data::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_data");
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+tonNode_externalMessage::tonNode_externalMessage()
+  : data_()
+{}
+
+tonNode_externalMessage::tonNode_externalMessage(td::BufferSlice &&data_)
+  : data_(std::move(data_))
+{}
+
+const std::int32_t tonNode_externalMessage::ID;
+
+object_ptr<tonNode_externalMessage> tonNode_externalMessage::fetch(td::TlParser &p) {
+  return make_object<tonNode_externalMessage>(p);
+}
+
+tonNode_externalMessage::tonNode_externalMessage(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_externalMessage::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void tonNode_externalMessage::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void tonNode_externalMessage::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_externalMessage");
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+tonNode_ihrMessage::tonNode_ihrMessage()
+  : data_()
+{}
+
+tonNode_ihrMessage::tonNode_ihrMessage(td::BufferSlice &&data_)
+  : data_(std::move(data_))
+{}
+
+const std::int32_t tonNode_ihrMessage::ID;
+
+object_ptr<tonNode_ihrMessage> tonNode_ihrMessage::fetch(td::TlParser &p) {
+  return make_object<tonNode_ihrMessage>(p);
+}
+
+tonNode_ihrMessage::tonNode_ihrMessage(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_ihrMessage::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void tonNode_ihrMessage::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreString::store(data_, s);
+}
+
+void tonNode_ihrMessage::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_ihrMessage");
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+tonNode_keyBlocks::tonNode_keyBlocks()
+  : blocks_()
+  , incomplete_()
+  , error_()
+{}
+
+tonNode_keyBlocks::tonNode_keyBlocks(std::vector<object_ptr<tonNode_blockIdExt>> &&blocks_, bool incomplete_, bool error_)
+  : blocks_(std::move(blocks_))
+  , incomplete_(incomplete_)
+  , error_(error_)
+{}
+
+const std::int32_t tonNode_keyBlocks::ID;
+
+object_ptr<tonNode_keyBlocks> tonNode_keyBlocks::fetch(td::TlParser &p) {
+  return make_object<tonNode_keyBlocks>(p);
+}
+
+tonNode_keyBlocks::tonNode_keyBlocks(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : blocks_(TlFetchVector<TlFetchObject<tonNode_blockIdExt>>::parse(p))
+  , incomplete_(TlFetchBool::parse(p))
+  , error_(TlFetchBool::parse(p))
+#undef FAIL
+{}
+
+void tonNode_keyBlocks::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(blocks_, s);
+  TlStoreBool::store(incomplete_, s);
+  TlStoreBool::store(error_, s);
+}
+
+void tonNode_keyBlocks::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreVector<TlStoreObject>::store(blocks_, s);
+  TlStoreBool::store(incomplete_, s);
+  TlStoreBool::store(error_, s);
+}
+
+void tonNode_keyBlocks::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_keyBlocks");
+    { const std::vector<object_ptr<tonNode_blockIdExt>> &v = blocks_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("blocks", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_field("incomplete", incomplete_);
+    s.store_field("error", error_);
+    s.store_class_end();
+  }
+}
+
+tonNode_newShardBlock::tonNode_newShardBlock()
+  : block_()
+  , cc_seqno_()
+  , data_()
+{}
+
+tonNode_newShardBlock::tonNode_newShardBlock(object_ptr<tonNode_blockIdExt> &&block_, std::int32_t cc_seqno_, td::BufferSlice &&data_)
+  : block_(std::move(block_))
+  , cc_seqno_(cc_seqno_)
+  , data_(std::move(data_))
+{}
+
+const std::int32_t tonNode_newShardBlock::ID;
+
+object_ptr<tonNode_newShardBlock> tonNode_newShardBlock::fetch(td::TlParser &p) {
+  return make_object<tonNode_newShardBlock>(p);
+}
+
+tonNode_newShardBlock::tonNode_newShardBlock(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , cc_seqno_(TlFetchInt::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_newShardBlock::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+  TlStoreBinary::store(cc_seqno_, s);
+  TlStoreString::store(data_, s);
+}
+
+void tonNode_newShardBlock::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(block_, s);
+  TlStoreBinary::store(cc_seqno_, s);
+  TlStoreString::store(data_, s);
+}
+
+void tonNode_newShardBlock::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_newShardBlock");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_field("cc_seqno", cc_seqno_);
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<tonNode_Prepared> tonNode_Prepared::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case tonNode_prepared::ID:
+      return tonNode_prepared::fetch(p);
+    case tonNode_notFound::ID:
+      return tonNode_notFound::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+tonNode_prepared::tonNode_prepared() {
+}
+
+const std::int32_t tonNode_prepared::ID;
+
+object_ptr<tonNode_Prepared> tonNode_prepared::fetch(td::TlParser &p) {
+  return make_object<tonNode_prepared>(p);
+}
+
+tonNode_prepared::tonNode_prepared(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void tonNode_prepared::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_prepared::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_prepared::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_prepared");
+    s.store_class_end();
+  }
+}
+
+tonNode_notFound::tonNode_notFound() {
+}
+
+const std::int32_t tonNode_notFound::ID;
+
+object_ptr<tonNode_Prepared> tonNode_notFound::fetch(td::TlParser &p) {
+  return make_object<tonNode_notFound>(p);
+}
+
+tonNode_notFound::tonNode_notFound(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void tonNode_notFound::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_notFound::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_notFound::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_notFound");
+    s.store_class_end();
+  }
+}
+
+object_ptr<tonNode_PreparedProof> tonNode_PreparedProof::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case tonNode_preparedProofEmpty::ID:
+      return tonNode_preparedProofEmpty::fetch(p);
+    case tonNode_preparedProof::ID:
+      return tonNode_preparedProof::fetch(p);
+    case tonNode_preparedProofLink::ID:
+      return tonNode_preparedProofLink::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+tonNode_preparedProofEmpty::tonNode_preparedProofEmpty() {
+}
+
+const std::int32_t tonNode_preparedProofEmpty::ID;
+
+object_ptr<tonNode_PreparedProof> tonNode_preparedProofEmpty::fetch(td::TlParser &p) {
+  return make_object<tonNode_preparedProofEmpty>(p);
+}
+
+tonNode_preparedProofEmpty::tonNode_preparedProofEmpty(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void tonNode_preparedProofEmpty::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_preparedProofEmpty::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_preparedProofEmpty::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_preparedProofEmpty");
+    s.store_class_end();
+  }
+}
+
+tonNode_preparedProof::tonNode_preparedProof() {
+}
+
+const std::int32_t tonNode_preparedProof::ID;
+
+object_ptr<tonNode_PreparedProof> tonNode_preparedProof::fetch(td::TlParser &p) {
+  return make_object<tonNode_preparedProof>(p);
+}
+
+tonNode_preparedProof::tonNode_preparedProof(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void tonNode_preparedProof::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_preparedProof::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_preparedProof::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_preparedProof");
+    s.store_class_end();
+  }
+}
+
+tonNode_preparedProofLink::tonNode_preparedProofLink() {
+}
+
+const std::int32_t tonNode_preparedProofLink::ID;
+
+object_ptr<tonNode_PreparedProof> tonNode_preparedProofLink::fetch(td::TlParser &p) {
+  return make_object<tonNode_preparedProofLink>(p);
+}
+
+tonNode_preparedProofLink::tonNode_preparedProofLink(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void tonNode_preparedProofLink::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_preparedProofLink::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_preparedProofLink::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_preparedProofLink");
+    s.store_class_end();
+  }
+}
+
+object_ptr<tonNode_PreparedState> tonNode_PreparedState::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case tonNode_preparedState::ID:
+      return tonNode_preparedState::fetch(p);
+    case tonNode_notFoundState::ID:
+      return tonNode_notFoundState::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+tonNode_preparedState::tonNode_preparedState() {
+}
+
+const std::int32_t tonNode_preparedState::ID;
+
+object_ptr<tonNode_PreparedState> tonNode_preparedState::fetch(td::TlParser &p) {
+  return make_object<tonNode_preparedState>(p);
+}
+
+tonNode_preparedState::tonNode_preparedState(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void tonNode_preparedState::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_preparedState::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_preparedState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_preparedState");
+    s.store_class_end();
+  }
+}
+
+tonNode_notFoundState::tonNode_notFoundState() {
+}
+
+const std::int32_t tonNode_notFoundState::ID;
+
+object_ptr<tonNode_PreparedState> tonNode_notFoundState::fetch(td::TlParser &p) {
+  return make_object<tonNode_notFoundState>(p);
+}
+
+tonNode_notFoundState::tonNode_notFoundState(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void tonNode_notFoundState::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_notFoundState::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void tonNode_notFoundState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_notFoundState");
+    s.store_class_end();
+  }
+}
+
+tonNode_sessionId::tonNode_sessionId()
+  : workchain_()
+  , shard_()
+  , cc_seqno_()
+  , opts_hash_()
+{}
+
+tonNode_sessionId::tonNode_sessionId(std::int32_t workchain_, std::int64_t shard_, std::int32_t cc_seqno_, td::Bits256 const &opts_hash_)
+  : workchain_(workchain_)
+  , shard_(shard_)
+  , cc_seqno_(cc_seqno_)
+  , opts_hash_(opts_hash_)
+{}
+
+const std::int32_t tonNode_sessionId::ID;
+
+object_ptr<tonNode_sessionId> tonNode_sessionId::fetch(td::TlParser &p) {
+  return make_object<tonNode_sessionId>(p);
+}
+
+tonNode_sessionId::tonNode_sessionId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : workchain_(TlFetchInt::parse(p))
+  , shard_(TlFetchLong::parse(p))
+  , cc_seqno_(TlFetchInt::parse(p))
+  , opts_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void tonNode_sessionId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(cc_seqno_, s);
+  TlStoreBinary::store(opts_hash_, s);
+}
+
+void tonNode_sessionId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(cc_seqno_, s);
+  TlStoreBinary::store(opts_hash_, s);
+}
+
+void tonNode_sessionId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_sessionId");
+    s.store_field("workchain", workchain_);
+    s.store_field("shard", shard_);
+    s.store_field("cc_seqno", cc_seqno_);
+    s.store_field("opts_hash", opts_hash_);
+    s.store_class_end();
+  }
+}
+
+tonNode_shardPublicOverlayId::tonNode_shardPublicOverlayId()
+  : workchain_()
+  , shard_()
+  , zero_state_file_hash_()
+{}
+
+tonNode_shardPublicOverlayId::tonNode_shardPublicOverlayId(std::int32_t workchain_, std::int64_t shard_, td::Bits256 const &zero_state_file_hash_)
+  : workchain_(workchain_)
+  , shard_(shard_)
+  , zero_state_file_hash_(zero_state_file_hash_)
+{}
+
+const std::int32_t tonNode_shardPublicOverlayId::ID;
+
+object_ptr<tonNode_shardPublicOverlayId> tonNode_shardPublicOverlayId::fetch(td::TlParser &p) {
+  return make_object<tonNode_shardPublicOverlayId>(p);
+}
+
+tonNode_shardPublicOverlayId::tonNode_shardPublicOverlayId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : workchain_(TlFetchInt::parse(p))
+  , shard_(TlFetchLong::parse(p))
+  , zero_state_file_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void tonNode_shardPublicOverlayId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(zero_state_file_hash_, s);
+}
+
+void tonNode_shardPublicOverlayId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(zero_state_file_hash_, s);
+}
+
+void tonNode_shardPublicOverlayId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_shardPublicOverlayId");
+    s.store_field("workchain", workchain_);
+    s.store_field("shard", shard_);
+    s.store_field("zero_state_file_hash", zero_state_file_hash_);
+    s.store_class_end();
+  }
+}
+
+tonNode_zeroStateIdExt::tonNode_zeroStateIdExt()
+  : workchain_()
+  , root_hash_()
+  , file_hash_()
+{}
+
+tonNode_zeroStateIdExt::tonNode_zeroStateIdExt(std::int32_t workchain_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_)
+  : workchain_(workchain_)
+  , root_hash_(root_hash_)
+  , file_hash_(file_hash_)
+{}
+
+const std::int32_t tonNode_zeroStateIdExt::ID;
+
+object_ptr<tonNode_zeroStateIdExt> tonNode_zeroStateIdExt::fetch(td::TlParser &p) {
+  return make_object<tonNode_zeroStateIdExt>(p);
+}
+
+tonNode_zeroStateIdExt::tonNode_zeroStateIdExt(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : workchain_(TlFetchInt::parse(p))
+  , root_hash_(TlFetchInt256::parse(p))
+  , file_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void tonNode_zeroStateIdExt::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void tonNode_zeroStateIdExt::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+}
+
+void tonNode_zeroStateIdExt::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_zeroStateIdExt");
+    s.store_field("workchain", workchain_);
+    s.store_field("root_hash", root_hash_);
+    s.store_field("file_hash", file_hash_);
+    s.store_class_end();
+  }
+}
+
+validator_group::validator_group()
+  : workchain_()
+  , shard_()
+  , catchain_seqno_()
+  , config_hash_()
+  , members_()
+{}
+
+validator_group::validator_group(std::int32_t workchain_, std::int64_t shard_, std::int32_t catchain_seqno_, td::Bits256 const &config_hash_, std::vector<object_ptr<validator_groupMember>> &&members_)
+  : workchain_(workchain_)
+  , shard_(shard_)
+  , catchain_seqno_(catchain_seqno_)
+  , config_hash_(config_hash_)
+  , members_(std::move(members_))
+{}
+
+const std::int32_t validator_group::ID;
+
+object_ptr<validator_group> validator_group::fetch(td::TlParser &p) {
+  return make_object<validator_group>(p);
+}
+
+validator_group::validator_group(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : workchain_(TlFetchInt::parse(p))
+  , shard_(TlFetchLong::parse(p))
+  , catchain_seqno_(TlFetchInt::parse(p))
+  , config_hash_(TlFetchInt256::parse(p))
+  , members_(TlFetchVector<TlFetchObject<validator_groupMember>>::parse(p))
+#undef FAIL
+{}
+
+void validator_group::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(catchain_seqno_, s);
+  TlStoreBinary::store(config_hash_, s);
+  TlStoreVector<TlStoreObject>::store(members_, s);
+}
+
+void validator_group::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(workchain_, s);
+  TlStoreBinary::store(shard_, s);
+  TlStoreBinary::store(catchain_seqno_, s);
+  TlStoreBinary::store(config_hash_, s);
+  TlStoreVector<TlStoreObject>::store(members_, s);
+}
+
+void validator_group::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validator_group");
+    s.store_field("workchain", workchain_);
+    s.store_field("shard", shard_);
+    s.store_field("catchain_seqno", catchain_seqno_);
+    s.store_field("config_hash", config_hash_);
+    { const std::vector<object_ptr<validator_groupMember>> &v = members_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("members", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+validator_config_global::validator_config_global()
+  : zero_state_()
+  , init_block_()
+  , hardforks_()
+{}
+
+validator_config_global::validator_config_global(object_ptr<tonNode_blockIdExt> &&zero_state_, object_ptr<tonNode_blockIdExt> &&init_block_, std::vector<object_ptr<tonNode_blockIdExt>> &&hardforks_)
+  : zero_state_(std::move(zero_state_))
+  , init_block_(std::move(init_block_))
+  , hardforks_(std::move(hardforks_))
+{}
+
+const std::int32_t validator_config_global::ID;
+
+object_ptr<validator_config_global> validator_config_global::fetch(td::TlParser &p) {
+  return make_object<validator_config_global>(p);
+}
+
+validator_config_global::validator_config_global(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : zero_state_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , init_block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , hardforks_(TlFetchVector<TlFetchObject<tonNode_blockIdExt>>::parse(p))
+#undef FAIL
+{}
+
+void validator_config_global::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(zero_state_, s);
+  TlStoreObject::store(init_block_, s);
+  TlStoreVector<TlStoreObject>::store(hardforks_, s);
+}
+
+void validator_config_global::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(zero_state_, s);
+  TlStoreObject::store(init_block_, s);
+  TlStoreVector<TlStoreObject>::store(hardforks_, s);
+}
+
+void validator_config_global::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validator_config_global");
+    if (zero_state_ == nullptr) { s.store_field("zero_state", "null"); } else { zero_state_->store(s, "zero_state"); }
+    if (init_block_ == nullptr) { s.store_field("init_block", "null"); } else { init_block_->store(s, "init_block"); }
+    { const std::vector<object_ptr<tonNode_blockIdExt>> &v = hardforks_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("hardforks", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+object_ptr<validator_config_Local> validator_config_Local::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case validator_config_local::ID:
+      return validator_config_local::fetch(p);
+    case validator_config_random_local::ID:
+      return validator_config_random_local::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+validator_config_local::validator_config_local()
+  : id_()
+{}
+
+validator_config_local::validator_config_local(object_ptr<adnl_id_short> &&id_)
+  : id_(std::move(id_))
+{}
+
+const std::int32_t validator_config_local::ID;
+
+object_ptr<validator_config_Local> validator_config_local::fetch(td::TlParser &p) {
+  return make_object<validator_config_local>(p);
+}
+
+validator_config_local::validator_config_local(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchObject<adnl_id_short>::parse(p))
+#undef FAIL
+{}
+
+void validator_config_local::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+}
+
+void validator_config_local::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(id_, s);
+}
+
+void validator_config_local::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validator_config_local");
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_class_end();
+  }
+}
+
+validator_config_random_local::validator_config_random_local()
+  : addr_list_()
+{}
+
+validator_config_random_local::validator_config_random_local(object_ptr<adnl_addressList> &&addr_list_)
+  : addr_list_(std::move(addr_list_))
+{}
+
+const std::int32_t validator_config_random_local::ID;
+
+object_ptr<validator_config_Local> validator_config_random_local::fetch(td::TlParser &p) {
+  return make_object<validator_config_random_local>(p);
+}
+
+validator_config_random_local::validator_config_random_local(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : addr_list_(TlFetchObject<adnl_addressList>::parse(p))
+#undef FAIL
+{}
+
+void validator_config_random_local::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(addr_list_, s);
+}
+
+void validator_config_random_local::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreObject::store(addr_list_, s);
+}
+
+void validator_config_random_local::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validator_config_random_local");
+    if (addr_list_ == nullptr) { s.store_field("addr_list", "null"); } else { addr_list_->store(s, "addr_list"); }
+    s.store_class_end();
+  }
+}
+
+validatorSession_blockUpdate::validatorSession_blockUpdate()
+  : ts_()
+  , actions_()
+  , state_()
+{}
+
+validatorSession_blockUpdate::validatorSession_blockUpdate(std::int64_t ts_, std::vector<object_ptr<validatorSession_round_Message>> &&actions_, std::int32_t state_)
+  : ts_(ts_)
+  , actions_(std::move(actions_))
+  , state_(state_)
+{}
+
+const std::int32_t validatorSession_blockUpdate::ID;
+
+object_ptr<validatorSession_blockUpdate> validatorSession_blockUpdate::fetch(td::TlParser &p) {
+  return make_object<validatorSession_blockUpdate>(p);
+}
+
+validatorSession_blockUpdate::validatorSession_blockUpdate(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : ts_(TlFetchLong::parse(p))
+  , actions_(TlFetchVector<TlFetchObject<validatorSession_round_Message>>::parse(p))
+  , state_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_blockUpdate::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ts_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(actions_, s);
+  TlStoreBinary::store(state_, s);
+}
+
+void validatorSession_blockUpdate::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(ts_, s);
+  TlStoreVector<TlStoreBoxedUnknown<TlStoreObject>>::store(actions_, s);
+  TlStoreBinary::store(state_, s);
+}
+
+void validatorSession_blockUpdate::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_blockUpdate");
+    s.store_field("ts", ts_);
+    { const std::vector<object_ptr<validatorSession_round_Message>> &v = actions_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("actions", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_field("state", state_);
+    s.store_class_end();
+  }
+}
+
+validatorSession_candidate::validatorSession_candidate()
+  : src_()
+  , round_()
+  , root_hash_()
+  , data_()
+  , collated_data_()
+{}
+
+validatorSession_candidate::validatorSession_candidate(td::Bits256 const &src_, std::int32_t round_, td::Bits256 const &root_hash_, td::BufferSlice &&data_, td::BufferSlice &&collated_data_)
+  : src_(src_)
+  , round_(round_)
+  , root_hash_(root_hash_)
+  , data_(std::move(data_))
+  , collated_data_(std::move(collated_data_))
+{}
+
+const std::int32_t validatorSession_candidate::ID;
+
+object_ptr<validatorSession_candidate> validatorSession_candidate::fetch(td::TlParser &p) {
+  return make_object<validatorSession_candidate>(p);
+}
+
+validatorSession_candidate::validatorSession_candidate(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : src_(TlFetchInt256::parse(p))
+  , round_(TlFetchInt::parse(p))
+  , root_hash_(TlFetchInt256::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+  , collated_data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_candidate::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreString::store(data_, s);
+  TlStoreString::store(collated_data_, s);
+}
+
+void validatorSession_candidate::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreString::store(data_, s);
+  TlStoreString::store(collated_data_, s);
+}
+
+void validatorSession_candidate::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_candidate");
+    s.store_field("src", src_);
+    s.store_field("round", round_);
+    s.store_field("root_hash", root_hash_);
+    s.store_bytes_field("data", data_);
+    s.store_bytes_field("collated_data", collated_data_);
+    s.store_class_end();
+  }
+}
+
+validatorSession_candidateId::validatorSession_candidateId()
+  : src_()
+  , root_hash_()
+  , file_hash_()
+  , collated_data_file_hash_()
+{}
+
+validatorSession_candidateId::validatorSession_candidateId(td::Bits256 const &src_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_, td::Bits256 const &collated_data_file_hash_)
+  : src_(src_)
+  , root_hash_(root_hash_)
+  , file_hash_(file_hash_)
+  , collated_data_file_hash_(collated_data_file_hash_)
+{}
+
+const std::int32_t validatorSession_candidateId::ID;
+
+object_ptr<validatorSession_candidateId> validatorSession_candidateId::fetch(td::TlParser &p) {
+  return make_object<validatorSession_candidateId>(p);
+}
+
+validatorSession_candidateId::validatorSession_candidateId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : src_(TlFetchInt256::parse(p))
+  , root_hash_(TlFetchInt256::parse(p))
+  , file_hash_(TlFetchInt256::parse(p))
+  , collated_data_file_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_candidateId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+  TlStoreBinary::store(collated_data_file_hash_, s);
+}
+
+void validatorSession_candidateId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(src_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+  TlStoreBinary::store(collated_data_file_hash_, s);
+}
+
+void validatorSession_candidateId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_candidateId");
+    s.store_field("src", src_);
+    s.store_field("root_hash", root_hash_);
+    s.store_field("file_hash", file_hash_);
+    s.store_field("collated_data_file_hash", collated_data_file_hash_);
+    s.store_class_end();
+  }
+}
+
+validatorSession_config::validatorSession_config()
+  : catchain_idle_timeout_()
+  , catchain_max_deps_()
+  , round_candidates_()
+  , next_candidate_delay_()
+  , round_attempt_duration_()
+  , max_round_attempts_()
+  , max_block_size_()
+  , max_collated_data_size_()
+{}
+
+validatorSession_config::validatorSession_config(double catchain_idle_timeout_, std::int32_t catchain_max_deps_, std::int32_t round_candidates_, double next_candidate_delay_, std::int32_t round_attempt_duration_, std::int32_t max_round_attempts_, std::int32_t max_block_size_, std::int32_t max_collated_data_size_)
+  : catchain_idle_timeout_(catchain_idle_timeout_)
+  , catchain_max_deps_(catchain_max_deps_)
+  , round_candidates_(round_candidates_)
+  , next_candidate_delay_(next_candidate_delay_)
+  , round_attempt_duration_(round_attempt_duration_)
+  , max_round_attempts_(max_round_attempts_)
+  , max_block_size_(max_block_size_)
+  , max_collated_data_size_(max_collated_data_size_)
+{}
+
+const std::int32_t validatorSession_config::ID;
+
+object_ptr<validatorSession_config> validatorSession_config::fetch(td::TlParser &p) {
+  return make_object<validatorSession_config>(p);
+}
+
+validatorSession_config::validatorSession_config(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : catchain_idle_timeout_(TlFetchDouble::parse(p))
+  , catchain_max_deps_(TlFetchInt::parse(p))
+  , round_candidates_(TlFetchInt::parse(p))
+  , next_candidate_delay_(TlFetchDouble::parse(p))
+  , round_attempt_duration_(TlFetchInt::parse(p))
+  , max_round_attempts_(TlFetchInt::parse(p))
+  , max_block_size_(TlFetchInt::parse(p))
+  , max_collated_data_size_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_config::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(catchain_idle_timeout_, s);
+  TlStoreBinary::store(catchain_max_deps_, s);
+  TlStoreBinary::store(round_candidates_, s);
+  TlStoreBinary::store(next_candidate_delay_, s);
+  TlStoreBinary::store(round_attempt_duration_, s);
+  TlStoreBinary::store(max_round_attempts_, s);
+  TlStoreBinary::store(max_block_size_, s);
+  TlStoreBinary::store(max_collated_data_size_, s);
+}
+
+void validatorSession_config::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(catchain_idle_timeout_, s);
+  TlStoreBinary::store(catchain_max_deps_, s);
+  TlStoreBinary::store(round_candidates_, s);
+  TlStoreBinary::store(next_candidate_delay_, s);
+  TlStoreBinary::store(round_attempt_duration_, s);
+  TlStoreBinary::store(max_round_attempts_, s);
+  TlStoreBinary::store(max_block_size_, s);
+  TlStoreBinary::store(max_collated_data_size_, s);
+}
+
+void validatorSession_config::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_config");
+    s.store_field("catchain_idle_timeout", catchain_idle_timeout_);
+    s.store_field("catchain_max_deps", catchain_max_deps_);
+    s.store_field("round_candidates", round_candidates_);
+    s.store_field("next_candidate_delay", next_candidate_delay_);
+    s.store_field("round_attempt_duration", round_attempt_duration_);
+    s.store_field("max_round_attempts", max_round_attempts_);
+    s.store_field("max_block_size", max_block_size_);
+    s.store_field("max_collated_data_size", max_collated_data_size_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<validatorSession_Message> validatorSession_Message::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case validatorSession_message_startSession::ID:
+      return validatorSession_message_startSession::fetch(p);
+    case validatorSession_message_finishSession::ID:
+      return validatorSession_message_finishSession::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+validatorSession_message_startSession::validatorSession_message_startSession() {
+}
+
+const std::int32_t validatorSession_message_startSession::ID;
+
+object_ptr<validatorSession_Message> validatorSession_message_startSession::fetch(td::TlParser &p) {
+  return make_object<validatorSession_message_startSession>(p);
+}
+
+validatorSession_message_startSession::validatorSession_message_startSession(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void validatorSession_message_startSession::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void validatorSession_message_startSession::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void validatorSession_message_startSession::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_message_startSession");
+    s.store_class_end();
+  }
+}
+
+validatorSession_message_finishSession::validatorSession_message_finishSession() {
+}
+
+const std::int32_t validatorSession_message_finishSession::ID;
+
+object_ptr<validatorSession_Message> validatorSession_message_finishSession::fetch(td::TlParser &p) {
+  return make_object<validatorSession_message_finishSession>(p);
+}
+
+validatorSession_message_finishSession::validatorSession_message_finishSession(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void validatorSession_message_finishSession::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+}
+
+void validatorSession_message_finishSession::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+}
+
+void validatorSession_message_finishSession::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_message_finishSession");
+    s.store_class_end();
+  }
+}
+
+validatorSession_pong::validatorSession_pong()
+  : hash_()
+{}
+
+validatorSession_pong::validatorSession_pong(std::int64_t hash_)
+  : hash_(hash_)
+{}
+
+const std::int32_t validatorSession_pong::ID;
+
+object_ptr<validatorSession_pong> validatorSession_pong::fetch(td::TlParser &p) {
+  return make_object<validatorSession_pong>(p);
+}
+
+validatorSession_pong::validatorSession_pong(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : hash_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_pong::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(hash_, s);
+}
+
+void validatorSession_pong::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(hash_, s);
+}
+
+void validatorSession_pong::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_pong");
+    s.store_field("hash", hash_);
+    s.store_class_end();
+  }
+}
+
+validatorSession_round_id::validatorSession_round_id()
+  : session_()
+  , height_()
+  , prev_block_()
+  , seqno_()
+{}
+
+validatorSession_round_id::validatorSession_round_id(td::Bits256 const &session_, std::int64_t height_, td::Bits256 const &prev_block_, std::int32_t seqno_)
+  : session_(session_)
+  , height_(height_)
+  , prev_block_(prev_block_)
+  , seqno_(seqno_)
+{}
+
+const std::int32_t validatorSession_round_id::ID;
+
+object_ptr<validatorSession_round_id> validatorSession_round_id::fetch(td::TlParser &p) {
+  return make_object<validatorSession_round_id>(p);
+}
+
+validatorSession_round_id::validatorSession_round_id(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : session_(TlFetchInt256::parse(p))
+  , height_(TlFetchLong::parse(p))
+  , prev_block_(TlFetchInt256::parse(p))
+  , seqno_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_round_id::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(session_, s);
+  TlStoreBinary::store(height_, s);
+  TlStoreBinary::store(prev_block_, s);
+  TlStoreBinary::store(seqno_, s);
+}
+
+void validatorSession_round_id::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(session_, s);
+  TlStoreBinary::store(height_, s);
+  TlStoreBinary::store(prev_block_, s);
+  TlStoreBinary::store(seqno_, s);
+}
+
+void validatorSession_round_id::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_round_id");
+    s.store_field("session", session_);
+    s.store_field("height", height_);
+    s.store_field("prev_block", prev_block_);
+    s.store_field("seqno", seqno_);
+    s.store_class_end();
+  }
+}
+
+object_ptr<validatorSession_round_Message> validatorSession_round_Message::fetch(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return nullptr;
+  int constructor = p.fetch_int();
+  switch (constructor) {
+    case validatorSession_message_submittedBlock::ID:
+      return validatorSession_message_submittedBlock::fetch(p);
+    case validatorSession_message_approvedBlock::ID:
+      return validatorSession_message_approvedBlock::fetch(p);
+    case validatorSession_message_rejectedBlock::ID:
+      return validatorSession_message_rejectedBlock::fetch(p);
+    case validatorSession_message_commit::ID:
+      return validatorSession_message_commit::fetch(p);
+    case validatorSession_message_vote::ID:
+      return validatorSession_message_vote::fetch(p);
+    case validatorSession_message_voteFor::ID:
+      return validatorSession_message_voteFor::fetch(p);
+    case validatorSession_message_precommit::ID:
+      return validatorSession_message_precommit::fetch(p);
+    case validatorSession_message_empty::ID:
+      return validatorSession_message_empty::fetch(p);
+    default:
+      FAIL(PSTRING() << "Unknown constructor found " << td::format::as_hex(constructor));
+  }
+#undef FAIL
+}
+
+validatorSession_message_submittedBlock::validatorSession_message_submittedBlock()
+  : round_()
+  , root_hash_()
+  , file_hash_()
+  , collated_data_file_hash_()
+{}
+
+validatorSession_message_submittedBlock::validatorSession_message_submittedBlock(std::int32_t round_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_, td::Bits256 const &collated_data_file_hash_)
+  : round_(round_)
+  , root_hash_(root_hash_)
+  , file_hash_(file_hash_)
+  , collated_data_file_hash_(collated_data_file_hash_)
+{}
+
+const std::int32_t validatorSession_message_submittedBlock::ID;
+
+object_ptr<validatorSession_round_Message> validatorSession_message_submittedBlock::fetch(td::TlParser &p) {
+  return make_object<validatorSession_message_submittedBlock>(p);
+}
+
+validatorSession_message_submittedBlock::validatorSession_message_submittedBlock(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : round_(TlFetchInt::parse(p))
+  , root_hash_(TlFetchInt256::parse(p))
+  , file_hash_(TlFetchInt256::parse(p))
+  , collated_data_file_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_message_submittedBlock::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+  TlStoreBinary::store(collated_data_file_hash_, s);
+}
+
+void validatorSession_message_submittedBlock::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(root_hash_, s);
+  TlStoreBinary::store(file_hash_, s);
+  TlStoreBinary::store(collated_data_file_hash_, s);
+}
+
+void validatorSession_message_submittedBlock::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_message_submittedBlock");
+    s.store_field("round", round_);
+    s.store_field("root_hash", root_hash_);
+    s.store_field("file_hash", file_hash_);
+    s.store_field("collated_data_file_hash", collated_data_file_hash_);
+    s.store_class_end();
+  }
+}
+
+validatorSession_message_approvedBlock::validatorSession_message_approvedBlock()
+  : round_()
+  , candidate_()
+  , signature_()
+{}
+
+validatorSession_message_approvedBlock::validatorSession_message_approvedBlock(std::int32_t round_, td::Bits256 const &candidate_, td::BufferSlice &&signature_)
+  : round_(round_)
+  , candidate_(candidate_)
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t validatorSession_message_approvedBlock::ID;
+
+object_ptr<validatorSession_round_Message> validatorSession_message_approvedBlock::fetch(td::TlParser &p) {
+  return make_object<validatorSession_message_approvedBlock>(p);
+}
+
+validatorSession_message_approvedBlock::validatorSession_message_approvedBlock(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : round_(TlFetchInt::parse(p))
+  , candidate_(TlFetchInt256::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_message_approvedBlock::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(candidate_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void validatorSession_message_approvedBlock::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(candidate_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void validatorSession_message_approvedBlock::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_message_approvedBlock");
+    s.store_field("round", round_);
+    s.store_field("candidate", candidate_);
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+validatorSession_message_rejectedBlock::validatorSession_message_rejectedBlock()
+  : round_()
+  , candidate_()
+  , reason_()
+{}
+
+validatorSession_message_rejectedBlock::validatorSession_message_rejectedBlock(std::int32_t round_, td::Bits256 const &candidate_, td::BufferSlice &&reason_)
+  : round_(round_)
+  , candidate_(candidate_)
+  , reason_(std::move(reason_))
+{}
+
+const std::int32_t validatorSession_message_rejectedBlock::ID;
+
+object_ptr<validatorSession_round_Message> validatorSession_message_rejectedBlock::fetch(td::TlParser &p) {
+  return make_object<validatorSession_message_rejectedBlock>(p);
+}
+
+validatorSession_message_rejectedBlock::validatorSession_message_rejectedBlock(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : round_(TlFetchInt::parse(p))
+  , candidate_(TlFetchInt256::parse(p))
+  , reason_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_message_rejectedBlock::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(candidate_, s);
+  TlStoreString::store(reason_, s);
+}
+
+void validatorSession_message_rejectedBlock::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(candidate_, s);
+  TlStoreString::store(reason_, s);
+}
+
+void validatorSession_message_rejectedBlock::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_message_rejectedBlock");
+    s.store_field("round", round_);
+    s.store_field("candidate", candidate_);
+    s.store_bytes_field("reason", reason_);
+    s.store_class_end();
+  }
+}
+
+validatorSession_message_commit::validatorSession_message_commit()
+  : round_()
+  , candidate_()
+  , signature_()
+{}
+
+validatorSession_message_commit::validatorSession_message_commit(std::int32_t round_, td::Bits256 const &candidate_, td::BufferSlice &&signature_)
+  : round_(round_)
+  , candidate_(candidate_)
+  , signature_(std::move(signature_))
+{}
+
+const std::int32_t validatorSession_message_commit::ID;
+
+object_ptr<validatorSession_round_Message> validatorSession_message_commit::fetch(td::TlParser &p) {
+  return make_object<validatorSession_message_commit>(p);
+}
+
+validatorSession_message_commit::validatorSession_message_commit(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : round_(TlFetchInt::parse(p))
+  , candidate_(TlFetchInt256::parse(p))
+  , signature_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_message_commit::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(candidate_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void validatorSession_message_commit::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(candidate_, s);
+  TlStoreString::store(signature_, s);
+}
+
+void validatorSession_message_commit::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_message_commit");
+    s.store_field("round", round_);
+    s.store_field("candidate", candidate_);
+    s.store_bytes_field("signature", signature_);
+    s.store_class_end();
+  }
+}
+
+validatorSession_message_vote::validatorSession_message_vote()
+  : round_()
+  , attempt_()
+  , candidate_()
+{}
+
+validatorSession_message_vote::validatorSession_message_vote(std::int32_t round_, std::int32_t attempt_, td::Bits256 const &candidate_)
+  : round_(round_)
+  , attempt_(attempt_)
+  , candidate_(candidate_)
+{}
+
+const std::int32_t validatorSession_message_vote::ID;
+
+object_ptr<validatorSession_round_Message> validatorSession_message_vote::fetch(td::TlParser &p) {
+  return make_object<validatorSession_message_vote>(p);
+}
+
+validatorSession_message_vote::validatorSession_message_vote(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : round_(TlFetchInt::parse(p))
+  , attempt_(TlFetchInt::parse(p))
+  , candidate_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_message_vote::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(attempt_, s);
+  TlStoreBinary::store(candidate_, s);
+}
+
+void validatorSession_message_vote::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(attempt_, s);
+  TlStoreBinary::store(candidate_, s);
+}
+
+void validatorSession_message_vote::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_message_vote");
+    s.store_field("round", round_);
+    s.store_field("attempt", attempt_);
+    s.store_field("candidate", candidate_);
+    s.store_class_end();
+  }
+}
+
+validatorSession_message_voteFor::validatorSession_message_voteFor()
+  : round_()
+  , attempt_()
+  , candidate_()
+{}
+
+validatorSession_message_voteFor::validatorSession_message_voteFor(std::int32_t round_, std::int32_t attempt_, td::Bits256 const &candidate_)
+  : round_(round_)
+  , attempt_(attempt_)
+  , candidate_(candidate_)
+{}
+
+const std::int32_t validatorSession_message_voteFor::ID;
+
+object_ptr<validatorSession_round_Message> validatorSession_message_voteFor::fetch(td::TlParser &p) {
+  return make_object<validatorSession_message_voteFor>(p);
+}
+
+validatorSession_message_voteFor::validatorSession_message_voteFor(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : round_(TlFetchInt::parse(p))
+  , attempt_(TlFetchInt::parse(p))
+  , candidate_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_message_voteFor::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(attempt_, s);
+  TlStoreBinary::store(candidate_, s);
+}
+
+void validatorSession_message_voteFor::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(attempt_, s);
+  TlStoreBinary::store(candidate_, s);
+}
+
+void validatorSession_message_voteFor::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_message_voteFor");
+    s.store_field("round", round_);
+    s.store_field("attempt", attempt_);
+    s.store_field("candidate", candidate_);
+    s.store_class_end();
+  }
+}
+
+validatorSession_message_precommit::validatorSession_message_precommit()
+  : round_()
+  , attempt_()
+  , candidate_()
+{}
+
+validatorSession_message_precommit::validatorSession_message_precommit(std::int32_t round_, std::int32_t attempt_, td::Bits256 const &candidate_)
+  : round_(round_)
+  , attempt_(attempt_)
+  , candidate_(candidate_)
+{}
+
+const std::int32_t validatorSession_message_precommit::ID;
+
+object_ptr<validatorSession_round_Message> validatorSession_message_precommit::fetch(td::TlParser &p) {
+  return make_object<validatorSession_message_precommit>(p);
+}
+
+validatorSession_message_precommit::validatorSession_message_precommit(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : round_(TlFetchInt::parse(p))
+  , attempt_(TlFetchInt::parse(p))
+  , candidate_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_message_precommit::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(attempt_, s);
+  TlStoreBinary::store(candidate_, s);
+}
+
+void validatorSession_message_precommit::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(attempt_, s);
+  TlStoreBinary::store(candidate_, s);
+}
+
+void validatorSession_message_precommit::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_message_precommit");
+    s.store_field("round", round_);
+    s.store_field("attempt", attempt_);
+    s.store_field("candidate", candidate_);
+    s.store_class_end();
+  }
+}
+
+validatorSession_message_empty::validatorSession_message_empty()
+  : round_()
+  , attempt_()
+{}
+
+validatorSession_message_empty::validatorSession_message_empty(std::int32_t round_, std::int32_t attempt_)
+  : round_(round_)
+  , attempt_(attempt_)
+{}
+
+const std::int32_t validatorSession_message_empty::ID;
+
+object_ptr<validatorSession_round_Message> validatorSession_message_empty::fetch(td::TlParser &p) {
+  return make_object<validatorSession_message_empty>(p);
+}
+
+validatorSession_message_empty::validatorSession_message_empty(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : round_(TlFetchInt::parse(p))
+  , attempt_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_message_empty::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(attempt_, s);
+}
+
+void validatorSession_message_empty::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(attempt_, s);
+}
+
+void validatorSession_message_empty::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_message_empty");
+    s.store_field("round", round_);
+    s.store_field("attempt", attempt_);
+    s.store_class_end();
+  }
+}
+
+validatorSession_candidate_id::validatorSession_candidate_id()
+  : round_()
+  , block_hash_()
+{}
+
+validatorSession_candidate_id::validatorSession_candidate_id(td::Bits256 const &round_, td::Bits256 const &block_hash_)
+  : round_(round_)
+  , block_hash_(block_hash_)
+{}
+
+const std::int32_t validatorSession_candidate_id::ID;
+
+object_ptr<validatorSession_candidate_id> validatorSession_candidate_id::fetch(td::TlParser &p) {
+  return make_object<validatorSession_candidate_id>(p);
+}
+
+validatorSession_candidate_id::validatorSession_candidate_id(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : round_(TlFetchInt256::parse(p))
+  , block_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_candidate_id::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(block_hash_, s);
+}
+
+void validatorSession_candidate_id::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  TlStoreBinary::store(round_, s);
+  TlStoreBinary::store(block_hash_, s);
+}
+
+void validatorSession_candidate_id::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_candidate_id");
+    s.store_field("round", round_);
+    s.store_field("block_hash", block_hash_);
+    s.store_class_end();
+  }
+}
+
+adnl_ping::adnl_ping()
+  : value_()
+{}
+
+adnl_ping::adnl_ping(std::int64_t value_)
+  : value_(value_)
+{}
+
+const std::int32_t adnl_ping::ID;
+
+object_ptr<adnl_ping> adnl_ping::fetch(td::TlParser &p) {
+  return make_object<adnl_ping>(p);
+}
+
+adnl_ping::adnl_ping(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void adnl_ping::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(531276223);
+  TlStoreBinary::store(value_, s);
+}
+
+void adnl_ping::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(531276223);
+  TlStoreBinary::store(value_, s);
+}
+
+void adnl_ping::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "adnl_ping");
+    s.store_field("value", value_);
+    s.store_class_end();
+  }
+}
+
+adnl_ping::ReturnType adnl_ping::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<adnl_pong>, 544504846>::parse(p);
+#undef FAIL
+}
+
+catchain_getBlock::catchain_getBlock()
+  : block_()
+{}
+
+catchain_getBlock::catchain_getBlock(td::Bits256 const &block_)
+  : block_(block_)
+{}
+
+const std::int32_t catchain_getBlock::ID;
+
+object_ptr<catchain_getBlock> catchain_getBlock::fetch(td::TlParser &p) {
+  return make_object<catchain_getBlock>(p);
+}
+
+catchain_getBlock::catchain_getBlock(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void catchain_getBlock::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(155049336);
+  TlStoreBinary::store(block_, s);
+}
+
+void catchain_getBlock::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(155049336);
+  TlStoreBinary::store(block_, s);
+}
+
+void catchain_getBlock::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_getBlock");
+    s.store_field("block", block_);
+    s.store_class_end();
+  }
+}
+
+catchain_getBlock::ReturnType catchain_getBlock::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchObject<catchain_BlockResult>::parse(p);
+#undef FAIL
+}
+
+catchain_getBlockHistory::catchain_getBlockHistory()
+  : block_()
+  , height_()
+  , stop_if_()
+{}
+
+catchain_getBlockHistory::catchain_getBlockHistory(td::Bits256 const &block_, std::int64_t height_, std::vector<td::Bits256> &&stop_if_)
+  : block_(block_)
+  , height_(height_)
+  , stop_if_(std::move(stop_if_))
+{}
+
+const std::int32_t catchain_getBlockHistory::ID;
+
+object_ptr<catchain_getBlockHistory> catchain_getBlockHistory::fetch(td::TlParser &p) {
+  return make_object<catchain_getBlockHistory>(p);
+}
+
+catchain_getBlockHistory::catchain_getBlockHistory(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchInt256::parse(p))
+  , height_(TlFetchLong::parse(p))
+  , stop_if_(TlFetchVector<TlFetchInt256>::parse(p))
+#undef FAIL
+{}
+
+void catchain_getBlockHistory::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1470730762);
+  TlStoreBinary::store(block_, s);
+  TlStoreBinary::store(height_, s);
+  TlStoreVector<TlStoreBinary>::store(stop_if_, s);
+}
+
+void catchain_getBlockHistory::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1470730762);
+  TlStoreBinary::store(block_, s);
+  TlStoreBinary::store(height_, s);
+  TlStoreVector<TlStoreBinary>::store(stop_if_, s);
+}
+
+void catchain_getBlockHistory::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_getBlockHistory");
+    s.store_field("block", block_);
+    s.store_field("height", height_);
+    { const std::vector<td::Bits256> &v = stop_if_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("stop_if", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+catchain_getBlockHistory::ReturnType catchain_getBlockHistory::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<catchain_sent>, -84454993>::parse(p);
+#undef FAIL
+}
+
+catchain_getBlocks::catchain_getBlocks()
+  : blocks_()
+{}
+
+catchain_getBlocks::catchain_getBlocks(std::vector<td::Bits256> &&blocks_)
+  : blocks_(std::move(blocks_))
+{}
+
+const std::int32_t catchain_getBlocks::ID;
+
+object_ptr<catchain_getBlocks> catchain_getBlocks::fetch(td::TlParser &p) {
+  return make_object<catchain_getBlocks>(p);
+}
+
+catchain_getBlocks::catchain_getBlocks(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : blocks_(TlFetchVector<TlFetchInt256>::parse(p))
+#undef FAIL
+{}
+
+void catchain_getBlocks::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(53062594);
+  TlStoreVector<TlStoreBinary>::store(blocks_, s);
+}
+
+void catchain_getBlocks::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(53062594);
+  TlStoreVector<TlStoreBinary>::store(blocks_, s);
+}
+
+void catchain_getBlocks::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_getBlocks");
+    { const std::vector<td::Bits256> &v = blocks_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("blocks", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+catchain_getBlocks::ReturnType catchain_getBlocks::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<catchain_sent>, -84454993>::parse(p);
+#undef FAIL
+}
+
+catchain_getDifference::catchain_getDifference()
+  : rt_()
+{}
+
+catchain_getDifference::catchain_getDifference(std::vector<std::int32_t> &&rt_)
+  : rt_(std::move(rt_))
+{}
+
+const std::int32_t catchain_getDifference::ID;
+
+object_ptr<catchain_getDifference> catchain_getDifference::fetch(td::TlParser &p) {
+  return make_object<catchain_getDifference>(p);
+}
+
+catchain_getDifference::catchain_getDifference(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : rt_(TlFetchVector<TlFetchInt>::parse(p))
+#undef FAIL
+{}
+
+void catchain_getDifference::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-798175528);
+  TlStoreVector<TlStoreBinary>::store(rt_, s);
+}
+
+void catchain_getDifference::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-798175528);
+  TlStoreVector<TlStoreBinary>::store(rt_, s);
+}
+
+void catchain_getDifference::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "catchain_getDifference");
+    { const std::vector<std::int32_t> &v = rt_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("rt", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+catchain_getDifference::ReturnType catchain_getDifference::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchObject<catchain_Difference>::parse(p);
+#undef FAIL
+}
+
+dht_findNode::dht_findNode()
+  : key_()
+  , k_()
+{}
+
+dht_findNode::dht_findNode(td::Bits256 const &key_, std::int32_t k_)
+  : key_(key_)
+  , k_(k_)
+{}
+
+const std::int32_t dht_findNode::ID;
+
+object_ptr<dht_findNode> dht_findNode::fetch(td::TlParser &p) {
+  return make_object<dht_findNode>(p);
+}
+
+dht_findNode::dht_findNode(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchInt256::parse(p))
+  , k_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void dht_findNode::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1826803307);
+  TlStoreBinary::store(key_, s);
+  TlStoreBinary::store(k_, s);
+}
+
+void dht_findNode::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1826803307);
+  TlStoreBinary::store(key_, s);
+  TlStoreBinary::store(k_, s);
+}
+
+void dht_findNode::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_findNode");
+    s.store_field("key", key_);
+    s.store_field("k", k_);
+    s.store_class_end();
+  }
+}
+
+dht_findNode::ReturnType dht_findNode::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<dht_nodes>, 2037686462>::parse(p);
+#undef FAIL
+}
+
+dht_findValue::dht_findValue()
+  : key_()
+  , k_()
+{}
+
+dht_findValue::dht_findValue(td::Bits256 const &key_, std::int32_t k_)
+  : key_(key_)
+  , k_(k_)
+{}
+
+const std::int32_t dht_findValue::ID;
+
+object_ptr<dht_findValue> dht_findValue::fetch(td::TlParser &p) {
+  return make_object<dht_findValue>(p);
+}
+
+dht_findValue::dht_findValue(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchInt256::parse(p))
+  , k_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void dht_findValue::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1370791919);
+  TlStoreBinary::store(key_, s);
+  TlStoreBinary::store(k_, s);
+}
+
+void dht_findValue::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1370791919);
+  TlStoreBinary::store(key_, s);
+  TlStoreBinary::store(k_, s);
+}
+
+void dht_findValue::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_findValue");
+    s.store_field("key", key_);
+    s.store_field("k", k_);
+    s.store_class_end();
+  }
+}
+
+dht_findValue::ReturnType dht_findValue::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchObject<dht_ValueResult>::parse(p);
+#undef FAIL
+}
+
+dht_getSignedAddressList::dht_getSignedAddressList() {
+}
+
+const std::int32_t dht_getSignedAddressList::ID;
+
+object_ptr<dht_getSignedAddressList> dht_getSignedAddressList::fetch(td::TlParser &p) {
+  return make_object<dht_getSignedAddressList>(p);
+}
+
+dht_getSignedAddressList::dht_getSignedAddressList(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void dht_getSignedAddressList::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1451669267);
+}
+
+void dht_getSignedAddressList::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1451669267);
+}
+
+void dht_getSignedAddressList::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_getSignedAddressList");
+    s.store_class_end();
+  }
+}
+
+dht_getSignedAddressList::ReturnType dht_getSignedAddressList::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<dht_node>, -2074922424>::parse(p);
+#undef FAIL
+}
+
+dht_ping::dht_ping()
+  : random_id_()
+{}
+
+dht_ping::dht_ping(std::int64_t random_id_)
+  : random_id_(random_id_)
+{}
+
+const std::int32_t dht_ping::ID;
+
+object_ptr<dht_ping> dht_ping::fetch(td::TlParser &p) {
+  return make_object<dht_ping>(p);
+}
+
+dht_ping::dht_ping(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : random_id_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void dht_ping::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-873775336);
+  TlStoreBinary::store(random_id_, s);
+}
+
+void dht_ping::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-873775336);
+  TlStoreBinary::store(random_id_, s);
+}
+
+void dht_ping::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_ping");
+    s.store_field("random_id", random_id_);
+    s.store_class_end();
+  }
+}
+
+dht_ping::ReturnType dht_ping::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<dht_pong>, 1519054721>::parse(p);
+#undef FAIL
+}
+
+dht_query::dht_query()
+  : node_()
+{}
+
+dht_query::dht_query(object_ptr<dht_node> &&node_)
+  : node_(std::move(node_))
+{}
+
+const std::int32_t dht_query::ID;
+
+object_ptr<dht_query> dht_query::fetch(td::TlParser &p) {
+  return make_object<dht_query>(p);
+}
+
+dht_query::dht_query(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : node_(TlFetchObject<dht_node>::parse(p))
+#undef FAIL
+{}
+
+void dht_query::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(2102593385);
+  TlStoreObject::store(node_, s);
+}
+
+void dht_query::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(2102593385);
+  TlStoreObject::store(node_, s);
+}
+
+void dht_query::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_query");
+    if (node_ == nullptr) { s.store_field("node", "null"); } else { node_->store(s, "node"); }
+    s.store_class_end();
+  }
+}
+
+dht_query::ReturnType dht_query::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchTrue, 1072550713>::parse(p);
+#undef FAIL
+}
+
+dht_store::dht_store()
+  : value_()
+{}
+
+dht_store::dht_store(object_ptr<dht_value> &&value_)
+  : value_(std::move(value_))
+{}
+
+const std::int32_t dht_store::ID;
+
+object_ptr<dht_store> dht_store::fetch(td::TlParser &p) {
+  return make_object<dht_store>(p);
+}
+
+dht_store::dht_store(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : value_(TlFetchObject<dht_value>::parse(p))
+#undef FAIL
+{}
+
+void dht_store::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(882065938);
+  TlStoreObject::store(value_, s);
+}
+
+void dht_store::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(882065938);
+  TlStoreObject::store(value_, s);
+}
+
+void dht_store::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "dht_store");
+    if (value_ == nullptr) { s.store_field("value", "null"); } else { value_->store(s, "value"); }
+    s.store_class_end();
+  }
+}
+
+dht_store::ReturnType dht_store::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<dht_stored>, 1881602824>::parse(p);
+#undef FAIL
+}
+
+engine_validator_addAdnlId::engine_validator_addAdnlId()
+  : key_hash_()
+  , category_()
+{}
+
+engine_validator_addAdnlId::engine_validator_addAdnlId(td::Bits256 const &key_hash_, std::int32_t category_)
+  : key_hash_(key_hash_)
+  , category_(category_)
+{}
+
+const std::int32_t engine_validator_addAdnlId::ID;
+
+object_ptr<engine_validator_addAdnlId> engine_validator_addAdnlId::fetch(td::TlParser &p) {
+  return make_object<engine_validator_addAdnlId>(p);
+}
+
+engine_validator_addAdnlId::engine_validator_addAdnlId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_hash_(TlFetchInt256::parse(p))
+  , category_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_addAdnlId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-310029141);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(category_, s);
+}
+
+void engine_validator_addAdnlId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-310029141);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(category_, s);
+}
+
+void engine_validator_addAdnlId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_addAdnlId");
+    s.store_field("key_hash", key_hash_);
+    s.store_field("category", category_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_addAdnlId::ReturnType engine_validator_addAdnlId::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_addControlInterface::engine_validator_addControlInterface()
+  : key_hash_()
+  , port_()
+{}
+
+engine_validator_addControlInterface::engine_validator_addControlInterface(td::Bits256 const &key_hash_, std::int32_t port_)
+  : key_hash_(key_hash_)
+  , port_(port_)
+{}
+
+const std::int32_t engine_validator_addControlInterface::ID;
+
+object_ptr<engine_validator_addControlInterface> engine_validator_addControlInterface::fetch(td::TlParser &p) {
+  return make_object<engine_validator_addControlInterface>(p);
+}
+
+engine_validator_addControlInterface::engine_validator_addControlInterface(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_hash_(TlFetchInt256::parse(p))
+  , port_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_addControlInterface::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(881587196);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void engine_validator_addControlInterface::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(881587196);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void engine_validator_addControlInterface::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_addControlInterface");
+    s.store_field("key_hash", key_hash_);
+    s.store_field("port", port_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_addControlInterface::ReturnType engine_validator_addControlInterface::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_addControlProcess::engine_validator_addControlProcess()
+  : key_hash_()
+  , port_()
+  , peer_key_()
+  , permissions_()
+{}
+
+engine_validator_addControlProcess::engine_validator_addControlProcess(td::Bits256 const &key_hash_, std::int32_t port_, td::Bits256 const &peer_key_, std::int32_t permissions_)
+  : key_hash_(key_hash_)
+  , port_(port_)
+  , peer_key_(peer_key_)
+  , permissions_(permissions_)
+{}
+
+const std::int32_t engine_validator_addControlProcess::ID;
+
+object_ptr<engine_validator_addControlProcess> engine_validator_addControlProcess::fetch(td::TlParser &p) {
+  return make_object<engine_validator_addControlProcess>(p);
+}
+
+engine_validator_addControlProcess::engine_validator_addControlProcess(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_hash_(TlFetchInt256::parse(p))
+  , port_(TlFetchInt::parse(p))
+  , peer_key_(TlFetchInt256::parse(p))
+  , permissions_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_addControlProcess::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1524692816);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreBinary::store(peer_key_, s);
+  TlStoreBinary::store(permissions_, s);
+}
+
+void engine_validator_addControlProcess::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1524692816);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreBinary::store(peer_key_, s);
+  TlStoreBinary::store(permissions_, s);
+}
+
+void engine_validator_addControlProcess::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_addControlProcess");
+    s.store_field("key_hash", key_hash_);
+    s.store_field("port", port_);
+    s.store_field("peer_key", peer_key_);
+    s.store_field("permissions", permissions_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_addControlProcess::ReturnType engine_validator_addControlProcess::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_addDhtId::engine_validator_addDhtId()
+  : key_hash_()
+{}
+
+engine_validator_addDhtId::engine_validator_addDhtId(td::Bits256 const &key_hash_)
+  : key_hash_(key_hash_)
+{}
+
+const std::int32_t engine_validator_addDhtId::ID;
+
+object_ptr<engine_validator_addDhtId> engine_validator_addDhtId::fetch(td::TlParser &p) {
+  return make_object<engine_validator_addDhtId>(p);
+}
+
+engine_validator_addDhtId::engine_validator_addDhtId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_addDhtId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-183755124);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_addDhtId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-183755124);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_addDhtId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_addDhtId");
+    s.store_field("key_hash", key_hash_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_addDhtId::ReturnType engine_validator_addDhtId::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_addListeningPort::engine_validator_addListeningPort()
+  : ip_()
+  , port_()
+  , categories_()
+  , priority_categories_()
+{}
+
+engine_validator_addListeningPort::engine_validator_addListeningPort(std::int32_t ip_, std::int32_t port_, std::vector<std::int32_t> &&categories_, std::vector<std::int32_t> &&priority_categories_)
+  : ip_(ip_)
+  , port_(port_)
+  , categories_(std::move(categories_))
+  , priority_categories_(std::move(priority_categories_))
+{}
+
+const std::int32_t engine_validator_addListeningPort::ID;
+
+object_ptr<engine_validator_addListeningPort> engine_validator_addListeningPort::fetch(td::TlParser &p) {
+  return make_object<engine_validator_addListeningPort>(p);
+}
+
+engine_validator_addListeningPort::engine_validator_addListeningPort(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : ip_(TlFetchInt::parse(p))
+  , port_(TlFetchInt::parse(p))
+  , categories_(TlFetchVector<TlFetchInt>::parse(p))
+  , priority_categories_(TlFetchVector<TlFetchInt>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_addListeningPort::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-362051147);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreVector<TlStoreBinary>::store(categories_, s);
+  TlStoreVector<TlStoreBinary>::store(priority_categories_, s);
+}
+
+void engine_validator_addListeningPort::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-362051147);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreVector<TlStoreBinary>::store(categories_, s);
+  TlStoreVector<TlStoreBinary>::store(priority_categories_, s);
+}
+
+void engine_validator_addListeningPort::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_addListeningPort");
+    s.store_field("ip", ip_);
+    s.store_field("port", port_);
+    { const std::vector<std::int32_t> &v = categories_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("categories", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    { const std::vector<std::int32_t> &v = priority_categories_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("priority_categories", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+engine_validator_addListeningPort::ReturnType engine_validator_addListeningPort::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_addLiteserver::engine_validator_addLiteserver()
+  : key_hash_()
+  , port_()
+{}
+
+engine_validator_addLiteserver::engine_validator_addLiteserver(td::Bits256 const &key_hash_, std::int32_t port_)
+  : key_hash_(key_hash_)
+  , port_(port_)
+{}
+
+const std::int32_t engine_validator_addLiteserver::ID;
+
+object_ptr<engine_validator_addLiteserver> engine_validator_addLiteserver::fetch(td::TlParser &p) {
+  return make_object<engine_validator_addLiteserver>(p);
+}
+
+engine_validator_addLiteserver::engine_validator_addLiteserver(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_hash_(TlFetchInt256::parse(p))
+  , port_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_addLiteserver::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-259387577);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void engine_validator_addLiteserver::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-259387577);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(port_, s);
+}
+
+void engine_validator_addLiteserver::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_addLiteserver");
+    s.store_field("key_hash", key_hash_);
+    s.store_field("port", port_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_addLiteserver::ReturnType engine_validator_addLiteserver::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_addProxy::engine_validator_addProxy()
+  : in_ip_()
+  , in_port_()
+  , out_ip_()
+  , out_port_()
+  , proxy_()
+  , categories_()
+  , priority_categories_()
+{}
+
+engine_validator_addProxy::engine_validator_addProxy(std::int32_t in_ip_, std::int32_t in_port_, std::int32_t out_ip_, std::int32_t out_port_, object_ptr<adnl_Proxy> &&proxy_, std::vector<std::int32_t> &&categories_, std::vector<std::int32_t> &&priority_categories_)
+  : in_ip_(in_ip_)
+  , in_port_(in_port_)
+  , out_ip_(out_ip_)
+  , out_port_(out_port_)
+  , proxy_(std::move(proxy_))
+  , categories_(std::move(categories_))
+  , priority_categories_(std::move(priority_categories_))
+{}
+
+const std::int32_t engine_validator_addProxy::ID;
+
+object_ptr<engine_validator_addProxy> engine_validator_addProxy::fetch(td::TlParser &p) {
+  return make_object<engine_validator_addProxy>(p);
+}
+
+engine_validator_addProxy::engine_validator_addProxy(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : in_ip_(TlFetchInt::parse(p))
+  , in_port_(TlFetchInt::parse(p))
+  , out_ip_(TlFetchInt::parse(p))
+  , out_port_(TlFetchInt::parse(p))
+  , proxy_(TlFetchObject<adnl_Proxy>::parse(p))
+  , categories_(TlFetchVector<TlFetchInt>::parse(p))
+  , priority_categories_(TlFetchVector<TlFetchInt>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_addProxy::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-151178251);
+  TlStoreBinary::store(in_ip_, s);
+  TlStoreBinary::store(in_port_, s);
+  TlStoreBinary::store(out_ip_, s);
+  TlStoreBinary::store(out_port_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(proxy_, s);
+  TlStoreVector<TlStoreBinary>::store(categories_, s);
+  TlStoreVector<TlStoreBinary>::store(priority_categories_, s);
+}
+
+void engine_validator_addProxy::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-151178251);
+  TlStoreBinary::store(in_ip_, s);
+  TlStoreBinary::store(in_port_, s);
+  TlStoreBinary::store(out_ip_, s);
+  TlStoreBinary::store(out_port_, s);
+  TlStoreBoxedUnknown<TlStoreObject>::store(proxy_, s);
+  TlStoreVector<TlStoreBinary>::store(categories_, s);
+  TlStoreVector<TlStoreBinary>::store(priority_categories_, s);
+}
+
+void engine_validator_addProxy::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_addProxy");
+    s.store_field("in_ip", in_ip_);
+    s.store_field("in_port", in_port_);
+    s.store_field("out_ip", out_ip_);
+    s.store_field("out_port", out_port_);
+    if (proxy_ == nullptr) { s.store_field("proxy", "null"); } else { proxy_->store(s, "proxy"); }
+    { const std::vector<std::int32_t> &v = categories_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("categories", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    { const std::vector<std::int32_t> &v = priority_categories_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("priority_categories", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+engine_validator_addProxy::ReturnType engine_validator_addProxy::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_addValidatorAdnlAddress::engine_validator_addValidatorAdnlAddress()
+  : permanent_key_hash_()
+  , key_hash_()
+  , ttl_()
+{}
+
+engine_validator_addValidatorAdnlAddress::engine_validator_addValidatorAdnlAddress(td::Bits256 const &permanent_key_hash_, td::Bits256 const &key_hash_, std::int32_t ttl_)
+  : permanent_key_hash_(permanent_key_hash_)
+  , key_hash_(key_hash_)
+  , ttl_(ttl_)
+{}
+
+const std::int32_t engine_validator_addValidatorAdnlAddress::ID;
+
+object_ptr<engine_validator_addValidatorAdnlAddress> engine_validator_addValidatorAdnlAddress::fetch(td::TlParser &p) {
+  return make_object<engine_validator_addValidatorAdnlAddress>(p);
+}
+
+engine_validator_addValidatorAdnlAddress::engine_validator_addValidatorAdnlAddress(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : permanent_key_hash_(TlFetchInt256::parse(p))
+  , key_hash_(TlFetchInt256::parse(p))
+  , ttl_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_addValidatorAdnlAddress::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-624187774);
+  TlStoreBinary::store(permanent_key_hash_, s);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(ttl_, s);
+}
+
+void engine_validator_addValidatorAdnlAddress::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-624187774);
+  TlStoreBinary::store(permanent_key_hash_, s);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(ttl_, s);
+}
+
+void engine_validator_addValidatorAdnlAddress::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_addValidatorAdnlAddress");
+    s.store_field("permanent_key_hash", permanent_key_hash_);
+    s.store_field("key_hash", key_hash_);
+    s.store_field("ttl", ttl_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_addValidatorAdnlAddress::ReturnType engine_validator_addValidatorAdnlAddress::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_addValidatorPermanentKey::engine_validator_addValidatorPermanentKey()
+  : key_hash_()
+  , election_date_()
+  , ttl_()
+{}
+
+engine_validator_addValidatorPermanentKey::engine_validator_addValidatorPermanentKey(td::Bits256 const &key_hash_, std::int32_t election_date_, std::int32_t ttl_)
+  : key_hash_(key_hash_)
+  , election_date_(election_date_)
+  , ttl_(ttl_)
+{}
+
+const std::int32_t engine_validator_addValidatorPermanentKey::ID;
+
+object_ptr<engine_validator_addValidatorPermanentKey> engine_validator_addValidatorPermanentKey::fetch(td::TlParser &p) {
+  return make_object<engine_validator_addValidatorPermanentKey>(p);
+}
+
+engine_validator_addValidatorPermanentKey::engine_validator_addValidatorPermanentKey(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_hash_(TlFetchInt256::parse(p))
+  , election_date_(TlFetchInt::parse(p))
+  , ttl_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_addValidatorPermanentKey::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1844116104);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(election_date_, s);
+  TlStoreBinary::store(ttl_, s);
+}
+
+void engine_validator_addValidatorPermanentKey::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1844116104);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(election_date_, s);
+  TlStoreBinary::store(ttl_, s);
+}
+
+void engine_validator_addValidatorPermanentKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_addValidatorPermanentKey");
+    s.store_field("key_hash", key_hash_);
+    s.store_field("election_date", election_date_);
+    s.store_field("ttl", ttl_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_addValidatorPermanentKey::ReturnType engine_validator_addValidatorPermanentKey::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_addValidatorTempKey::engine_validator_addValidatorTempKey()
+  : permanent_key_hash_()
+  , key_hash_()
+  , ttl_()
+{}
+
+engine_validator_addValidatorTempKey::engine_validator_addValidatorTempKey(td::Bits256 const &permanent_key_hash_, td::Bits256 const &key_hash_, std::int32_t ttl_)
+  : permanent_key_hash_(permanent_key_hash_)
+  , key_hash_(key_hash_)
+  , ttl_(ttl_)
+{}
+
+const std::int32_t engine_validator_addValidatorTempKey::ID;
+
+object_ptr<engine_validator_addValidatorTempKey> engine_validator_addValidatorTempKey::fetch(td::TlParser &p) {
+  return make_object<engine_validator_addValidatorTempKey>(p);
+}
+
+engine_validator_addValidatorTempKey::engine_validator_addValidatorTempKey(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : permanent_key_hash_(TlFetchInt256::parse(p))
+  , key_hash_(TlFetchInt256::parse(p))
+  , ttl_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_addValidatorTempKey::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1926009038);
+  TlStoreBinary::store(permanent_key_hash_, s);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(ttl_, s);
+}
+
+void engine_validator_addValidatorTempKey::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1926009038);
+  TlStoreBinary::store(permanent_key_hash_, s);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreBinary::store(ttl_, s);
+}
+
+void engine_validator_addValidatorTempKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_addValidatorTempKey");
+    s.store_field("permanent_key_hash", permanent_key_hash_);
+    s.store_field("key_hash", key_hash_);
+    s.store_field("ttl", ttl_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_addValidatorTempKey::ReturnType engine_validator_addValidatorTempKey::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_changeFullNodeAdnlAddress::engine_validator_changeFullNodeAdnlAddress()
+  : adnl_id_()
+{}
+
+engine_validator_changeFullNodeAdnlAddress::engine_validator_changeFullNodeAdnlAddress(td::Bits256 const &adnl_id_)
+  : adnl_id_(adnl_id_)
+{}
+
+const std::int32_t engine_validator_changeFullNodeAdnlAddress::ID;
+
+object_ptr<engine_validator_changeFullNodeAdnlAddress> engine_validator_changeFullNodeAdnlAddress::fetch(td::TlParser &p) {
+  return make_object<engine_validator_changeFullNodeAdnlAddress>(p);
+}
+
+engine_validator_changeFullNodeAdnlAddress::engine_validator_changeFullNodeAdnlAddress(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : adnl_id_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_changeFullNodeAdnlAddress::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1094268539);
+  TlStoreBinary::store(adnl_id_, s);
+}
+
+void engine_validator_changeFullNodeAdnlAddress::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1094268539);
+  TlStoreBinary::store(adnl_id_, s);
+}
+
+void engine_validator_changeFullNodeAdnlAddress::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_changeFullNodeAdnlAddress");
+    s.store_field("adnl_id", adnl_id_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_changeFullNodeAdnlAddress::ReturnType engine_validator_changeFullNodeAdnlAddress::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_checkDhtServers::engine_validator_checkDhtServers()
+  : id_()
+{}
+
+engine_validator_checkDhtServers::engine_validator_checkDhtServers(td::Bits256 const &id_)
+  : id_(id_)
+{}
+
+const std::int32_t engine_validator_checkDhtServers::ID;
+
+object_ptr<engine_validator_checkDhtServers> engine_validator_checkDhtServers::fetch(td::TlParser &p) {
+  return make_object<engine_validator_checkDhtServers>(p);
+}
+
+engine_validator_checkDhtServers::engine_validator_checkDhtServers(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : id_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_checkDhtServers::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-773578550);
+  TlStoreBinary::store(id_, s);
+}
+
+void engine_validator_checkDhtServers::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-773578550);
+  TlStoreBinary::store(id_, s);
+}
+
+void engine_validator_checkDhtServers::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_checkDhtServers");
+    s.store_field("id", id_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_checkDhtServers::ReturnType engine_validator_checkDhtServers::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_dhtServersStatus>, 725155112>::parse(p);
+#undef FAIL
+}
+
+engine_validator_controlQuery::engine_validator_controlQuery()
+  : data_()
+{}
+
+engine_validator_controlQuery::engine_validator_controlQuery(td::BufferSlice &&data_)
+  : data_(std::move(data_))
+{}
+
+const std::int32_t engine_validator_controlQuery::ID;
+
+object_ptr<engine_validator_controlQuery> engine_validator_controlQuery::fetch(td::TlParser &p) {
+  return make_object<engine_validator_controlQuery>(p);
+}
+
+engine_validator_controlQuery::engine_validator_controlQuery(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_controlQuery::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1535722048);
+  TlStoreString::store(data_, s);
+}
+
+void engine_validator_controlQuery::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1535722048);
+  TlStoreString::store(data_, s);
+}
+
+void engine_validator_controlQuery::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_controlQuery");
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_controlQuery::ReturnType engine_validator_controlQuery::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<Object>, 695225504>::parse(p);
+#undef FAIL
+}
+
+engine_validator_createElectionBid::engine_validator_createElectionBid()
+  : election_date_()
+  , election_addr_()
+  , wallet_()
+{}
+
+engine_validator_createElectionBid::engine_validator_createElectionBid(std::int32_t election_date_, std::string const &election_addr_, std::string const &wallet_)
+  : election_date_(election_date_)
+  , election_addr_(std::move(election_addr_))
+  , wallet_(std::move(wallet_))
+{}
+
+const std::int32_t engine_validator_createElectionBid::ID;
+
+object_ptr<engine_validator_createElectionBid> engine_validator_createElectionBid::fetch(td::TlParser &p) {
+  return make_object<engine_validator_createElectionBid>(p);
+}
+
+engine_validator_createElectionBid::engine_validator_createElectionBid(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : election_date_(TlFetchInt::parse(p))
+  , election_addr_(TlFetchString<std::string>::parse(p))
+  , wallet_(TlFetchString<std::string>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_createElectionBid::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-451038907);
+  TlStoreBinary::store(election_date_, s);
+  TlStoreString::store(election_addr_, s);
+  TlStoreString::store(wallet_, s);
+}
+
+void engine_validator_createElectionBid::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-451038907);
+  TlStoreBinary::store(election_date_, s);
+  TlStoreString::store(election_addr_, s);
+  TlStoreString::store(wallet_, s);
+}
+
+void engine_validator_createElectionBid::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_createElectionBid");
+    s.store_field("election_date", election_date_);
+    s.store_field("election_addr", election_addr_);
+    s.store_field("wallet", wallet_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_createElectionBid::ReturnType engine_validator_createElectionBid::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_electionBid>, 598899261>::parse(p);
+#undef FAIL
+}
+
+engine_validator_delAdnlId::engine_validator_delAdnlId()
+  : key_hash_()
+{}
+
+engine_validator_delAdnlId::engine_validator_delAdnlId(td::Bits256 const &key_hash_)
+  : key_hash_(key_hash_)
+{}
+
+const std::int32_t engine_validator_delAdnlId::ID;
+
+object_ptr<engine_validator_delAdnlId> engine_validator_delAdnlId::fetch(td::TlParser &p) {
+  return make_object<engine_validator_delAdnlId>(p);
+}
+
+engine_validator_delAdnlId::engine_validator_delAdnlId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_delAdnlId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(691696882);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_delAdnlId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(691696882);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_delAdnlId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_delAdnlId");
+    s.store_field("key_hash", key_hash_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_delAdnlId::ReturnType engine_validator_delAdnlId::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_delDhtId::engine_validator_delDhtId()
+  : key_hash_()
+{}
+
+engine_validator_delDhtId::engine_validator_delDhtId(td::Bits256 const &key_hash_)
+  : key_hash_(key_hash_)
+{}
+
+const std::int32_t engine_validator_delDhtId::ID;
+
+object_ptr<engine_validator_delDhtId> engine_validator_delDhtId::fetch(td::TlParser &p) {
+  return make_object<engine_validator_delDhtId>(p);
+}
+
+engine_validator_delDhtId::engine_validator_delDhtId(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_delDhtId::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-2063770818);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_delDhtId::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-2063770818);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_delDhtId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_delDhtId");
+    s.store_field("key_hash", key_hash_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_delDhtId::ReturnType engine_validator_delDhtId::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_delListeningPort::engine_validator_delListeningPort()
+  : ip_()
+  , port_()
+  , categories_()
+  , priority_categories_()
+{}
+
+engine_validator_delListeningPort::engine_validator_delListeningPort(std::int32_t ip_, std::int32_t port_, std::vector<std::int32_t> &&categories_, std::vector<std::int32_t> &&priority_categories_)
+  : ip_(ip_)
+  , port_(port_)
+  , categories_(std::move(categories_))
+  , priority_categories_(std::move(priority_categories_))
+{}
+
+const std::int32_t engine_validator_delListeningPort::ID;
+
+object_ptr<engine_validator_delListeningPort> engine_validator_delListeningPort::fetch(td::TlParser &p) {
+  return make_object<engine_validator_delListeningPort>(p);
+}
+
+engine_validator_delListeningPort::engine_validator_delListeningPort(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : ip_(TlFetchInt::parse(p))
+  , port_(TlFetchInt::parse(p))
+  , categories_(TlFetchVector<TlFetchInt>::parse(p))
+  , priority_categories_(TlFetchVector<TlFetchInt>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_delListeningPort::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(828094543);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreVector<TlStoreBinary>::store(categories_, s);
+  TlStoreVector<TlStoreBinary>::store(priority_categories_, s);
+}
+
+void engine_validator_delListeningPort::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(828094543);
+  TlStoreBinary::store(ip_, s);
+  TlStoreBinary::store(port_, s);
+  TlStoreVector<TlStoreBinary>::store(categories_, s);
+  TlStoreVector<TlStoreBinary>::store(priority_categories_, s);
+}
+
+void engine_validator_delListeningPort::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_delListeningPort");
+    s.store_field("ip", ip_);
+    s.store_field("port", port_);
+    { const std::vector<std::int32_t> &v = categories_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("categories", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    { const std::vector<std::int32_t> &v = priority_categories_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("priority_categories", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+engine_validator_delListeningPort::ReturnType engine_validator_delListeningPort::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_delProxy::engine_validator_delProxy()
+  : out_ip_()
+  , out_port_()
+  , categories_()
+  , priority_categories_()
+{}
+
+engine_validator_delProxy::engine_validator_delProxy(std::int32_t out_ip_, std::int32_t out_port_, std::vector<std::int32_t> &&categories_, std::vector<std::int32_t> &&priority_categories_)
+  : out_ip_(out_ip_)
+  , out_port_(out_port_)
+  , categories_(std::move(categories_))
+  , priority_categories_(std::move(priority_categories_))
+{}
+
+const std::int32_t engine_validator_delProxy::ID;
+
+object_ptr<engine_validator_delProxy> engine_validator_delProxy::fetch(td::TlParser &p) {
+  return make_object<engine_validator_delProxy>(p);
+}
+
+engine_validator_delProxy::engine_validator_delProxy(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : out_ip_(TlFetchInt::parse(p))
+  , out_port_(TlFetchInt::parse(p))
+  , categories_(TlFetchVector<TlFetchInt>::parse(p))
+  , priority_categories_(TlFetchVector<TlFetchInt>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_delProxy::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1970850941);
+  TlStoreBinary::store(out_ip_, s);
+  TlStoreBinary::store(out_port_, s);
+  TlStoreVector<TlStoreBinary>::store(categories_, s);
+  TlStoreVector<TlStoreBinary>::store(priority_categories_, s);
+}
+
+void engine_validator_delProxy::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1970850941);
+  TlStoreBinary::store(out_ip_, s);
+  TlStoreBinary::store(out_port_, s);
+  TlStoreVector<TlStoreBinary>::store(categories_, s);
+  TlStoreVector<TlStoreBinary>::store(priority_categories_, s);
+}
+
+void engine_validator_delProxy::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_delProxy");
+    s.store_field("out_ip", out_ip_);
+    s.store_field("out_port", out_port_);
+    { const std::vector<std::int32_t> &v = categories_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("categories", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    { const std::vector<std::int32_t> &v = priority_categories_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("priority_categories", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+engine_validator_delProxy::ReturnType engine_validator_delProxy::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_delValidatorAdnlAddress::engine_validator_delValidatorAdnlAddress()
+  : permanent_key_hash_()
+  , key_hash_()
+{}
+
+engine_validator_delValidatorAdnlAddress::engine_validator_delValidatorAdnlAddress(td::Bits256 const &permanent_key_hash_, td::Bits256 const &key_hash_)
+  : permanent_key_hash_(permanent_key_hash_)
+  , key_hash_(key_hash_)
+{}
+
+const std::int32_t engine_validator_delValidatorAdnlAddress::ID;
+
+object_ptr<engine_validator_delValidatorAdnlAddress> engine_validator_delValidatorAdnlAddress::fetch(td::TlParser &p) {
+  return make_object<engine_validator_delValidatorAdnlAddress>(p);
+}
+
+engine_validator_delValidatorAdnlAddress::engine_validator_delValidatorAdnlAddress(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : permanent_key_hash_(TlFetchInt256::parse(p))
+  , key_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_delValidatorAdnlAddress::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-150453414);
+  TlStoreBinary::store(permanent_key_hash_, s);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_delValidatorAdnlAddress::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-150453414);
+  TlStoreBinary::store(permanent_key_hash_, s);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_delValidatorAdnlAddress::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_delValidatorAdnlAddress");
+    s.store_field("permanent_key_hash", permanent_key_hash_);
+    s.store_field("key_hash", key_hash_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_delValidatorAdnlAddress::ReturnType engine_validator_delValidatorAdnlAddress::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_delValidatorPermanentKey::engine_validator_delValidatorPermanentKey()
+  : key_hash_()
+{}
+
+engine_validator_delValidatorPermanentKey::engine_validator_delValidatorPermanentKey(td::Bits256 const &key_hash_)
+  : key_hash_(key_hash_)
+{}
+
+const std::int32_t engine_validator_delValidatorPermanentKey::ID;
+
+object_ptr<engine_validator_delValidatorPermanentKey> engine_validator_delValidatorPermanentKey::fetch(td::TlParser &p) {
+  return make_object<engine_validator_delValidatorPermanentKey>(p);
+}
+
+engine_validator_delValidatorPermanentKey::engine_validator_delValidatorPermanentKey(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_delValidatorPermanentKey::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(390777082);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_delValidatorPermanentKey::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(390777082);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_delValidatorPermanentKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_delValidatorPermanentKey");
+    s.store_field("key_hash", key_hash_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_delValidatorPermanentKey::ReturnType engine_validator_delValidatorPermanentKey::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_delValidatorTempKey::engine_validator_delValidatorTempKey()
+  : permanent_key_hash_()
+  , key_hash_()
+{}
+
+engine_validator_delValidatorTempKey::engine_validator_delValidatorTempKey(td::Bits256 const &permanent_key_hash_, td::Bits256 const &key_hash_)
+  : permanent_key_hash_(permanent_key_hash_)
+  , key_hash_(key_hash_)
+{}
+
+const std::int32_t engine_validator_delValidatorTempKey::ID;
+
+object_ptr<engine_validator_delValidatorTempKey> engine_validator_delValidatorTempKey::fetch(td::TlParser &p) {
+  return make_object<engine_validator_delValidatorTempKey>(p);
+}
+
+engine_validator_delValidatorTempKey::engine_validator_delValidatorTempKey(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : permanent_key_hash_(TlFetchInt256::parse(p))
+  , key_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_delValidatorTempKey::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1595481903);
+  TlStoreBinary::store(permanent_key_hash_, s);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_delValidatorTempKey::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1595481903);
+  TlStoreBinary::store(permanent_key_hash_, s);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_delValidatorTempKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_delValidatorTempKey");
+    s.store_field("permanent_key_hash", permanent_key_hash_);
+    s.store_field("key_hash", key_hash_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_delValidatorTempKey::ReturnType engine_validator_delValidatorTempKey::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_exportPrivateKey::engine_validator_exportPrivateKey()
+  : key_hash_()
+{}
+
+engine_validator_exportPrivateKey::engine_validator_exportPrivateKey(td::Bits256 const &key_hash_)
+  : key_hash_(key_hash_)
+{}
+
+const std::int32_t engine_validator_exportPrivateKey::ID;
+
+object_ptr<engine_validator_exportPrivateKey> engine_validator_exportPrivateKey::fetch(td::TlParser &p) {
+  return make_object<engine_validator_exportPrivateKey>(p);
+}
+
+engine_validator_exportPrivateKey::engine_validator_exportPrivateKey(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_exportPrivateKey::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-864911288);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_exportPrivateKey::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-864911288);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_exportPrivateKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_exportPrivateKey");
+    s.store_field("key_hash", key_hash_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_exportPrivateKey::ReturnType engine_validator_exportPrivateKey::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchObject<PrivateKey>::parse(p);
+#undef FAIL
+}
+
+engine_validator_exportPublicKey::engine_validator_exportPublicKey()
+  : key_hash_()
+{}
+
+engine_validator_exportPublicKey::engine_validator_exportPublicKey(td::Bits256 const &key_hash_)
+  : key_hash_(key_hash_)
+{}
+
+const std::int32_t engine_validator_exportPublicKey::ID;
+
+object_ptr<engine_validator_exportPublicKey> engine_validator_exportPublicKey::fetch(td::TlParser &p) {
+  return make_object<engine_validator_exportPublicKey>(p);
+}
+
+engine_validator_exportPublicKey::engine_validator_exportPublicKey(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_exportPublicKey::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1647618233);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_exportPublicKey::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1647618233);
+  TlStoreBinary::store(key_hash_, s);
+}
+
+void engine_validator_exportPublicKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_exportPublicKey");
+    s.store_field("key_hash", key_hash_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_exportPublicKey::ReturnType engine_validator_exportPublicKey::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchObject<PublicKey>::parse(p);
+#undef FAIL
+}
+
+engine_validator_generateKeyPair::engine_validator_generateKeyPair() {
+}
+
+const std::int32_t engine_validator_generateKeyPair::ID;
+
+object_ptr<engine_validator_generateKeyPair> engine_validator_generateKeyPair::fetch(td::TlParser &p) {
+  return make_object<engine_validator_generateKeyPair>(p);
+}
+
+engine_validator_generateKeyPair::engine_validator_generateKeyPair(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void engine_validator_generateKeyPair::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-349872005);
+}
+
+void engine_validator_generateKeyPair::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-349872005);
+}
+
+void engine_validator_generateKeyPair::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_generateKeyPair");
+    s.store_class_end();
+  }
+}
+
+engine_validator_generateKeyPair::ReturnType engine_validator_generateKeyPair::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_keyHash>, -1027168946>::parse(p);
+#undef FAIL
+}
+
+engine_validator_getConfig::engine_validator_getConfig() {
+}
+
+const std::int32_t engine_validator_getConfig::ID;
+
+object_ptr<engine_validator_getConfig> engine_validator_getConfig::fetch(td::TlParser &p) {
+  return make_object<engine_validator_getConfig>(p);
+}
+
+engine_validator_getConfig::engine_validator_getConfig(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void engine_validator_getConfig::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1504518693);
+}
+
+void engine_validator_getConfig::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1504518693);
+}
+
+void engine_validator_getConfig::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_getConfig");
+    s.store_class_end();
+  }
+}
+
+engine_validator_getConfig::ReturnType engine_validator_getConfig::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_jsonConfig>, 321753611>::parse(p);
+#undef FAIL
+}
+
+engine_validator_getStats::engine_validator_getStats() {
+}
+
+const std::int32_t engine_validator_getStats::ID;
+
+object_ptr<engine_validator_getStats> engine_validator_getStats::fetch(td::TlParser &p) {
+  return make_object<engine_validator_getStats>(p);
+}
+
+engine_validator_getStats::engine_validator_getStats(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void engine_validator_getStats::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1389740817);
+}
+
+void engine_validator_getStats::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1389740817);
+}
+
+void engine_validator_getStats::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_getStats");
+    s.store_class_end();
+  }
+}
+
+engine_validator_getStats::ReturnType engine_validator_getStats::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_stats>, 1565119343>::parse(p);
+#undef FAIL
+}
+
+engine_validator_getTime::engine_validator_getTime() {
+}
+
+const std::int32_t engine_validator_getTime::ID;
+
+object_ptr<engine_validator_getTime> engine_validator_getTime::fetch(td::TlParser &p) {
+  return make_object<engine_validator_getTime>(p);
+}
+
+engine_validator_getTime::engine_validator_getTime(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void engine_validator_getTime::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-515850543);
+}
+
+void engine_validator_getTime::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-515850543);
+}
+
+void engine_validator_getTime::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_getTime");
+    s.store_class_end();
+  }
+}
+
+engine_validator_getTime::ReturnType engine_validator_getTime::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_time>, -547380738>::parse(p);
+#undef FAIL
+}
+
+engine_validator_importPrivateKey::engine_validator_importPrivateKey()
+  : key_()
+{}
+
+engine_validator_importPrivateKey::engine_validator_importPrivateKey(object_ptr<PrivateKey> &&key_)
+  : key_(std::move(key_))
+{}
+
+const std::int32_t engine_validator_importPrivateKey::ID;
+
+object_ptr<engine_validator_importPrivateKey> engine_validator_importPrivateKey::fetch(td::TlParser &p) {
+  return make_object<engine_validator_importPrivateKey>(p);
+}
+
+engine_validator_importPrivateKey::engine_validator_importPrivateKey(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_(TlFetchObject<PrivateKey>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_importPrivateKey::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(360741575);
+  TlStoreBoxedUnknown<TlStoreObject>::store(key_, s);
+}
+
+void engine_validator_importPrivateKey::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(360741575);
+  TlStoreBoxedUnknown<TlStoreObject>::store(key_, s);
+}
+
+void engine_validator_importPrivateKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_importPrivateKey");
+    if (key_ == nullptr) { s.store_field("key", "null"); } else { key_->store(s, "key"); }
+    s.store_class_end();
+  }
+}
+
+engine_validator_importPrivateKey::ReturnType engine_validator_importPrivateKey::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_keyHash>, -1027168946>::parse(p);
+#undef FAIL
+}
+
+engine_validator_setVerbosity::engine_validator_setVerbosity()
+  : verbosity_()
+{}
+
+engine_validator_setVerbosity::engine_validator_setVerbosity(std::int32_t verbosity_)
+  : verbosity_(verbosity_)
+{}
+
+const std::int32_t engine_validator_setVerbosity::ID;
+
+object_ptr<engine_validator_setVerbosity> engine_validator_setVerbosity::fetch(td::TlParser &p) {
+  return make_object<engine_validator_setVerbosity>(p);
+}
+
+engine_validator_setVerbosity::engine_validator_setVerbosity(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : verbosity_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_setVerbosity::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1316856190);
+  TlStoreBinary::store(verbosity_, s);
+}
+
+void engine_validator_setVerbosity::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1316856190);
+  TlStoreBinary::store(verbosity_, s);
+}
+
+void engine_validator_setVerbosity::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_setVerbosity");
+    s.store_field("verbosity", verbosity_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_setVerbosity::ReturnType engine_validator_setVerbosity::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_success>, -1276860789>::parse(p);
+#undef FAIL
+}
+
+engine_validator_sign::engine_validator_sign()
+  : key_hash_()
+  , data_()
+{}
+
+engine_validator_sign::engine_validator_sign(td::Bits256 const &key_hash_, td::BufferSlice &&data_)
+  : key_hash_(key_hash_)
+  , data_(std::move(data_))
+{}
+
+const std::int32_t engine_validator_sign::ID;
+
+object_ptr<engine_validator_sign> engine_validator_sign::fetch(td::TlParser &p) {
+  return make_object<engine_validator_sign>(p);
+}
+
+engine_validator_sign::engine_validator_sign(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : key_hash_(TlFetchInt256::parse(p))
+  , data_(TlFetchBytes<td::BufferSlice>::parse(p))
+#undef FAIL
+{}
+
+void engine_validator_sign::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(451549736);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreString::store(data_, s);
+}
+
+void engine_validator_sign::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(451549736);
+  TlStoreBinary::store(key_hash_, s);
+  TlStoreString::store(data_, s);
+}
+
+void engine_validator_sign::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "engine_validator_sign");
+    s.store_field("key_hash", key_hash_);
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+engine_validator_sign::ReturnType engine_validator_sign::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<engine_validator_signature>, -76791000>::parse(p);
+#undef FAIL
+}
+
+getTestObject::getTestObject() {
+}
+
+const std::int32_t getTestObject::ID;
+
+object_ptr<getTestObject> getTestObject::fetch(td::TlParser &p) {
+  return make_object<getTestObject>(p);
+}
+
+getTestObject::getTestObject(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+#undef FAIL
+{
+  (void)p;
+}
+
+void getTestObject::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(197109379);
+}
+
+void getTestObject::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(197109379);
+}
+
+void getTestObject::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "getTestObject");
+    s.store_class_end();
+  }
+}
+
+getTestObject::ReturnType getTestObject::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchObject<TestObject>::parse(p);
+#undef FAIL
+}
+
+overlay_getBroadcast::overlay_getBroadcast()
+  : hash_()
+{}
+
+overlay_getBroadcast::overlay_getBroadcast(td::Bits256 const &hash_)
+  : hash_(hash_)
+{}
+
+const std::int32_t overlay_getBroadcast::ID;
+
+object_ptr<overlay_getBroadcast> overlay_getBroadcast::fetch(td::TlParser &p) {
+  return make_object<overlay_getBroadcast>(p);
+}
+
+overlay_getBroadcast::overlay_getBroadcast(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : hash_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void overlay_getBroadcast::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(758510240);
+  TlStoreBinary::store(hash_, s);
+}
+
+void overlay_getBroadcast::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(758510240);
+  TlStoreBinary::store(hash_, s);
+}
+
+void overlay_getBroadcast::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_getBroadcast");
+    s.store_field("hash", hash_);
+    s.store_class_end();
+  }
+}
+
+overlay_getBroadcast::ReturnType overlay_getBroadcast::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchObject<overlay_Broadcast>::parse(p);
+#undef FAIL
+}
+
+overlay_getBroadcastList::overlay_getBroadcastList()
+  : list_()
+{}
+
+overlay_getBroadcastList::overlay_getBroadcastList(object_ptr<overlay_broadcastList> &&list_)
+  : list_(std::move(list_))
+{}
+
+const std::int32_t overlay_getBroadcastList::ID;
+
+object_ptr<overlay_getBroadcastList> overlay_getBroadcastList::fetch(td::TlParser &p) {
+  return make_object<overlay_getBroadcastList>(p);
+}
+
+overlay_getBroadcastList::overlay_getBroadcastList(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : list_(TlFetchObject<overlay_broadcastList>::parse(p))
+#undef FAIL
+{}
+
+void overlay_getBroadcastList::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1109141562);
+  TlStoreObject::store(list_, s);
+}
+
+void overlay_getBroadcastList::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1109141562);
+  TlStoreObject::store(list_, s);
+}
+
+void overlay_getBroadcastList::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_getBroadcastList");
+    if (list_ == nullptr) { s.store_field("list", "null"); } else { list_->store(s, "list"); }
+    s.store_class_end();
+  }
+}
+
+overlay_getBroadcastList::ReturnType overlay_getBroadcastList::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<overlay_broadcastList>, 416407263>::parse(p);
+#undef FAIL
+}
+
+overlay_getRandomPeers::overlay_getRandomPeers()
+  : peers_()
+{}
+
+overlay_getRandomPeers::overlay_getRandomPeers(object_ptr<overlay_nodes> &&peers_)
+  : peers_(std::move(peers_))
+{}
+
+const std::int32_t overlay_getRandomPeers::ID;
+
+object_ptr<overlay_getRandomPeers> overlay_getRandomPeers::fetch(td::TlParser &p) {
+  return make_object<overlay_getRandomPeers>(p);
+}
+
+overlay_getRandomPeers::overlay_getRandomPeers(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : peers_(TlFetchObject<overlay_nodes>::parse(p))
+#undef FAIL
+{}
+
+void overlay_getRandomPeers::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1223582891);
+  TlStoreObject::store(peers_, s);
+}
+
+void overlay_getRandomPeers::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1223582891);
+  TlStoreObject::store(peers_, s);
+}
+
+void overlay_getRandomPeers::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_getRandomPeers");
+    if (peers_ == nullptr) { s.store_field("peers", "null"); } else { peers_->store(s, "peers"); }
+    s.store_class_end();
+  }
+}
+
+overlay_getRandomPeers::ReturnType overlay_getRandomPeers::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<overlay_nodes>, -460904178>::parse(p);
+#undef FAIL
+}
+
+overlay_query::overlay_query()
+  : overlay_()
+{}
+
+overlay_query::overlay_query(td::Bits256 const &overlay_)
+  : overlay_(overlay_)
+{}
+
+const std::int32_t overlay_query::ID;
+
+object_ptr<overlay_query> overlay_query::fetch(td::TlParser &p) {
+  return make_object<overlay_query>(p);
+}
+
+overlay_query::overlay_query(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : overlay_(TlFetchInt256::parse(p))
+#undef FAIL
+{}
+
+void overlay_query::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-855800765);
+  TlStoreBinary::store(overlay_, s);
+}
+
+void overlay_query::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-855800765);
+  TlStoreBinary::store(overlay_, s);
+}
+
+void overlay_query::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "overlay_query");
+    s.store_field("overlay", overlay_);
+    s.store_class_end();
+  }
+}
+
+overlay_query::ReturnType overlay_query::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchTrue, 1072550713>::parse(p);
+#undef FAIL
+}
+
+tcp_ping::tcp_ping()
+  : random_id_()
+{}
+
+tcp_ping::tcp_ping(std::int64_t random_id_)
+  : random_id_(random_id_)
+{}
+
+const std::int32_t tcp_ping::ID;
+
+object_ptr<tcp_ping> tcp_ping::fetch(td::TlParser &p) {
+  return make_object<tcp_ping>(p);
+}
+
+tcp_ping::tcp_ping(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : random_id_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void tcp_ping::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1292381082);
+  TlStoreBinary::store(random_id_, s);
+}
+
+void tcp_ping::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1292381082);
+  TlStoreBinary::store(random_id_, s);
+}
+
+void tcp_ping::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tcp_ping");
+    s.store_field("random_id", random_id_);
+    s.store_class_end();
+  }
+}
+
+tcp_ping::ReturnType tcp_ping::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<tcp_pong>, -597034237>::parse(p);
+#undef FAIL
+}
+
+tonNode_downloadBlock::tonNode_downloadBlock()
+  : block_()
+{}
+
+tonNode_downloadBlock::tonNode_downloadBlock(object_ptr<tonNode_blockIdExt> &&block_)
+  : block_(std::move(block_))
+{}
+
+const std::int32_t tonNode_downloadBlock::ID;
+
+object_ptr<tonNode_downloadBlock> tonNode_downloadBlock::fetch(td::TlParser &p) {
+  return make_object<tonNode_downloadBlock>(p);
+}
+
+tonNode_downloadBlock::tonNode_downloadBlock(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_downloadBlock::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-495814205);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_downloadBlock::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-495814205);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_downloadBlock::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_downloadBlock");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_class_end();
+  }
+}
+
+tonNode_downloadBlock::ReturnType tonNode_downloadBlock::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<tonNode_data>, 1443505284>::parse(p);
+#undef FAIL
+}
+
+tonNode_downloadBlockProof::tonNode_downloadBlockProof()
+  : block_()
+{}
+
+tonNode_downloadBlockProof::tonNode_downloadBlockProof(object_ptr<tonNode_blockIdExt> &&block_)
+  : block_(std::move(block_))
+{}
+
+const std::int32_t tonNode_downloadBlockProof::ID;
+
+object_ptr<tonNode_downloadBlockProof> tonNode_downloadBlockProof::fetch(td::TlParser &p) {
+  return make_object<tonNode_downloadBlockProof>(p);
+}
+
+tonNode_downloadBlockProof::tonNode_downloadBlockProof(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_downloadBlockProof::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1272334218);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_downloadBlockProof::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1272334218);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_downloadBlockProof::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_downloadBlockProof");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_class_end();
+  }
+}
+
+tonNode_downloadBlockProof::ReturnType tonNode_downloadBlockProof::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<tonNode_data>, 1443505284>::parse(p);
+#undef FAIL
+}
+
+tonNode_downloadBlockProofLink::tonNode_downloadBlockProofLink()
+  : block_()
+{}
+
+tonNode_downloadBlockProofLink::tonNode_downloadBlockProofLink(object_ptr<tonNode_blockIdExt> &&block_)
+  : block_(std::move(block_))
+{}
+
+const std::int32_t tonNode_downloadBlockProofLink::ID;
+
+object_ptr<tonNode_downloadBlockProofLink> tonNode_downloadBlockProofLink::fetch(td::TlParser &p) {
+  return make_object<tonNode_downloadBlockProofLink>(p);
+}
+
+tonNode_downloadBlockProofLink::tonNode_downloadBlockProofLink(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_downloadBlockProofLink::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(632488134);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_downloadBlockProofLink::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(632488134);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_downloadBlockProofLink::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_downloadBlockProofLink");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_class_end();
+  }
+}
+
+tonNode_downloadBlockProofLink::ReturnType tonNode_downloadBlockProofLink::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<tonNode_data>, 1443505284>::parse(p);
+#undef FAIL
+}
+
+tonNode_downloadPersistentState::tonNode_downloadPersistentState()
+  : block_()
+  , masterchain_block_()
+{}
+
+tonNode_downloadPersistentState::tonNode_downloadPersistentState(object_ptr<tonNode_blockIdExt> &&block_, object_ptr<tonNode_blockIdExt> &&masterchain_block_)
+  : block_(std::move(block_))
+  , masterchain_block_(std::move(masterchain_block_))
+{}
+
+const std::int32_t tonNode_downloadPersistentState::ID;
+
+object_ptr<tonNode_downloadPersistentState> tonNode_downloadPersistentState::fetch(td::TlParser &p) {
+  return make_object<tonNode_downloadPersistentState>(p);
+}
+
+tonNode_downloadPersistentState::tonNode_downloadPersistentState(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , masterchain_block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_downloadPersistentState::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(2140791736);
+  TlStoreObject::store(block_, s);
+  TlStoreObject::store(masterchain_block_, s);
+}
+
+void tonNode_downloadPersistentState::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(2140791736);
+  TlStoreObject::store(block_, s);
+  TlStoreObject::store(masterchain_block_, s);
+}
+
+void tonNode_downloadPersistentState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_downloadPersistentState");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    if (masterchain_block_ == nullptr) { s.store_field("masterchain_block", "null"); } else { masterchain_block_->store(s, "masterchain_block"); }
+    s.store_class_end();
+  }
+}
+
+tonNode_downloadPersistentState::ReturnType tonNode_downloadPersistentState::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<tonNode_data>, 1443505284>::parse(p);
+#undef FAIL
+}
+
+tonNode_downloadZeroState::tonNode_downloadZeroState()
+  : block_()
+{}
+
+tonNode_downloadZeroState::tonNode_downloadZeroState(object_ptr<tonNode_blockIdExt> &&block_)
+  : block_(std::move(block_))
+{}
+
+const std::int32_t tonNode_downloadZeroState::ID;
+
+object_ptr<tonNode_downloadZeroState> tonNode_downloadZeroState::fetch(td::TlParser &p) {
+  return make_object<tonNode_downloadZeroState>(p);
+}
+
+tonNode_downloadZeroState::tonNode_downloadZeroState(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_downloadZeroState::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1379131814);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_downloadZeroState::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-1379131814);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_downloadZeroState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_downloadZeroState");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_class_end();
+  }
+}
+
+tonNode_downloadZeroState::ReturnType tonNode_downloadZeroState::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<tonNode_data>, 1443505284>::parse(p);
+#undef FAIL
+}
+
+tonNode_getNextBlockDescription::tonNode_getNextBlockDescription()
+  : prev_block_()
+{}
+
+tonNode_getNextBlockDescription::tonNode_getNextBlockDescription(object_ptr<tonNode_blockIdExt> &&prev_block_)
+  : prev_block_(std::move(prev_block_))
+{}
+
+const std::int32_t tonNode_getNextBlockDescription::ID;
+
+object_ptr<tonNode_getNextBlockDescription> tonNode_getNextBlockDescription::fetch(td::TlParser &p) {
+  return make_object<tonNode_getNextBlockDescription>(p);
+}
+
+tonNode_getNextBlockDescription::tonNode_getNextBlockDescription(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : prev_block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_getNextBlockDescription::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(341160179);
+  TlStoreObject::store(prev_block_, s);
+}
+
+void tonNode_getNextBlockDescription::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(341160179);
+  TlStoreObject::store(prev_block_, s);
+}
+
+void tonNode_getNextBlockDescription::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_getNextBlockDescription");
+    if (prev_block_ == nullptr) { s.store_field("prev_block", "null"); } else { prev_block_->store(s, "prev_block"); }
+    s.store_class_end();
+  }
+}
+
+tonNode_getNextBlockDescription::ReturnType tonNode_getNextBlockDescription::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchObject<tonNode_BlockDescription>::parse(p);
+#undef FAIL
+}
+
+tonNode_getNextKeyBlockIds::tonNode_getNextKeyBlockIds()
+  : block_()
+  , max_size_()
+{}
+
+tonNode_getNextKeyBlockIds::tonNode_getNextKeyBlockIds(object_ptr<tonNode_blockIdExt> &&block_, std::int32_t max_size_)
+  : block_(std::move(block_))
+  , max_size_(max_size_)
+{}
+
+const std::int32_t tonNode_getNextKeyBlockIds::ID;
+
+object_ptr<tonNode_getNextKeyBlockIds> tonNode_getNextKeyBlockIds::fetch(td::TlParser &p) {
+  return make_object<tonNode_getNextKeyBlockIds>(p);
+}
+
+tonNode_getNextKeyBlockIds::tonNode_getNextKeyBlockIds(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , max_size_(TlFetchInt::parse(p))
+#undef FAIL
+{}
+
+void tonNode_getNextKeyBlockIds::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-219689029);
+  TlStoreObject::store(block_, s);
+  TlStoreBinary::store(max_size_, s);
+}
+
+void tonNode_getNextKeyBlockIds::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-219689029);
+  TlStoreObject::store(block_, s);
+  TlStoreBinary::store(max_size_, s);
+}
+
+void tonNode_getNextKeyBlockIds::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_getNextKeyBlockIds");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_field("max_size", max_size_);
+    s.store_class_end();
+  }
+}
+
+tonNode_getNextKeyBlockIds::ReturnType tonNode_getNextKeyBlockIds::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<tonNode_keyBlocks>, 124144985>::parse(p);
+#undef FAIL
+}
+
+tonNode_prepareBlock::tonNode_prepareBlock()
+  : block_()
+{}
+
+tonNode_prepareBlock::tonNode_prepareBlock(object_ptr<tonNode_blockIdExt> &&block_)
+  : block_(std::move(block_))
+{}
+
+const std::int32_t tonNode_prepareBlock::ID;
+
+object_ptr<tonNode_prepareBlock> tonNode_prepareBlock::fetch(td::TlParser &p) {
+  return make_object<tonNode_prepareBlock>(p);
+}
+
+tonNode_prepareBlock::tonNode_prepareBlock(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_prepareBlock::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1973649230);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_prepareBlock::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1973649230);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_prepareBlock::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_prepareBlock");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_class_end();
+  }
+}
+
+tonNode_prepareBlock::ReturnType tonNode_prepareBlock::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchObject<tonNode_Prepared>::parse(p);
+#undef FAIL
+}
+
+tonNode_prepareBlockProof::tonNode_prepareBlockProof()
+  : block_()
+  , allow_partial_()
+{}
+
+tonNode_prepareBlockProof::tonNode_prepareBlockProof(object_ptr<tonNode_blockIdExt> &&block_, bool allow_partial_)
+  : block_(std::move(block_))
+  , allow_partial_(allow_partial_)
+{}
+
+const std::int32_t tonNode_prepareBlockProof::ID;
+
+object_ptr<tonNode_prepareBlockProof> tonNode_prepareBlockProof::fetch(td::TlParser &p) {
+  return make_object<tonNode_prepareBlockProof>(p);
+}
+
+tonNode_prepareBlockProof::tonNode_prepareBlockProof(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , allow_partial_(TlFetchBool::parse(p))
+#undef FAIL
+{}
+
+void tonNode_prepareBlockProof::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-2024000760);
+  TlStoreObject::store(block_, s);
+  TlStoreBool::store(allow_partial_, s);
+}
+
+void tonNode_prepareBlockProof::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-2024000760);
+  TlStoreObject::store(block_, s);
+  TlStoreBool::store(allow_partial_, s);
+}
+
+void tonNode_prepareBlockProof::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_prepareBlockProof");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_field("allow_partial", allow_partial_);
+    s.store_class_end();
+  }
+}
+
+tonNode_prepareBlockProof::ReturnType tonNode_prepareBlockProof::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchObject<tonNode_PreparedProof>::parse(p);
+#undef FAIL
+}
+
+tonNode_preparePersistentState::tonNode_preparePersistentState()
+  : block_()
+  , masterchain_block_()
+{}
+
+tonNode_preparePersistentState::tonNode_preparePersistentState(object_ptr<tonNode_blockIdExt> &&block_, object_ptr<tonNode_blockIdExt> &&masterchain_block_)
+  : block_(std::move(block_))
+  , masterchain_block_(std::move(masterchain_block_))
+{}
+
+const std::int32_t tonNode_preparePersistentState::ID;
+
+object_ptr<tonNode_preparePersistentState> tonNode_preparePersistentState::fetch(td::TlParser &p) {
+  return make_object<tonNode_preparePersistentState>(p);
+}
+
+tonNode_preparePersistentState::tonNode_preparePersistentState(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+  , masterchain_block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_preparePersistentState::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-18209122);
+  TlStoreObject::store(block_, s);
+  TlStoreObject::store(masterchain_block_, s);
+}
+
+void tonNode_preparePersistentState::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-18209122);
+  TlStoreObject::store(block_, s);
+  TlStoreObject::store(masterchain_block_, s);
+}
+
+void tonNode_preparePersistentState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_preparePersistentState");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    if (masterchain_block_ == nullptr) { s.store_field("masterchain_block", "null"); } else { masterchain_block_->store(s, "masterchain_block"); }
+    s.store_class_end();
+  }
+}
+
+tonNode_preparePersistentState::ReturnType tonNode_preparePersistentState::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchObject<tonNode_PreparedState>::parse(p);
+#undef FAIL
+}
+
+tonNode_prepareZeroState::tonNode_prepareZeroState()
+  : block_()
+{}
+
+tonNode_prepareZeroState::tonNode_prepareZeroState(object_ptr<tonNode_blockIdExt> &&block_)
+  : block_(std::move(block_))
+{}
+
+const std::int32_t tonNode_prepareZeroState::ID;
+
+object_ptr<tonNode_prepareZeroState> tonNode_prepareZeroState::fetch(td::TlParser &p) {
+  return make_object<tonNode_prepareZeroState>(p);
+}
+
+tonNode_prepareZeroState::tonNode_prepareZeroState(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : block_(TlFetchObject<tonNode_blockIdExt>::parse(p))
+#undef FAIL
+{}
+
+void tonNode_prepareZeroState::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1104021541);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_prepareZeroState::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1104021541);
+  TlStoreObject::store(block_, s);
+}
+
+void tonNode_prepareZeroState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "tonNode_prepareZeroState");
+    if (block_ == nullptr) { s.store_field("block", "null"); } else { block_->store(s, "block"); }
+    s.store_class_end();
+  }
+}
+
+tonNode_prepareZeroState::ReturnType tonNode_prepareZeroState::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchObject<tonNode_PreparedState>::parse(p);
+#undef FAIL
+}
+
+validatorSession_downloadCandidate::validatorSession_downloadCandidate()
+  : round_()
+  , id_()
+{}
+
+validatorSession_downloadCandidate::validatorSession_downloadCandidate(std::int32_t round_, object_ptr<validatorSession_candidateId> &&id_)
+  : round_(round_)
+  , id_(std::move(id_))
+{}
+
+const std::int32_t validatorSession_downloadCandidate::ID;
+
+object_ptr<validatorSession_downloadCandidate> validatorSession_downloadCandidate::fetch(td::TlParser &p) {
+  return make_object<validatorSession_downloadCandidate>(p);
+}
+
+validatorSession_downloadCandidate::validatorSession_downloadCandidate(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : round_(TlFetchInt::parse(p))
+  , id_(TlFetchObject<validatorSession_candidateId>::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_downloadCandidate::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(-520274443);
+  TlStoreBinary::store(round_, s);
+  TlStoreObject::store(id_, s);
+}
+
+void validatorSession_downloadCandidate::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(-520274443);
+  TlStoreBinary::store(round_, s);
+  TlStoreObject::store(id_, s);
+}
+
+void validatorSession_downloadCandidate::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_downloadCandidate");
+    s.store_field("round", round_);
+    if (id_ == nullptr) { s.store_field("id", "null"); } else { id_->store(s, "id"); }
+    s.store_class_end();
+  }
+}
+
+validatorSession_downloadCandidate::ReturnType validatorSession_downloadCandidate::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<validatorSession_candidate>, 2100525125>::parse(p);
+#undef FAIL
+}
+
+validatorSession_ping::validatorSession_ping()
+  : hash_()
+{}
+
+validatorSession_ping::validatorSession_ping(std::int64_t hash_)
+  : hash_(hash_)
+{}
+
+const std::int32_t validatorSession_ping::ID;
+
+object_ptr<validatorSession_ping> validatorSession_ping::fetch(td::TlParser &p) {
+  return make_object<validatorSession_ping>(p);
+}
+
+validatorSession_ping::validatorSession_ping(td::TlParser &p)
+#define FAIL(error) p.set_error(error)
+  : hash_(TlFetchLong::parse(p))
+#undef FAIL
+{}
+
+void validatorSession_ping::store(td::TlStorerCalcLength &s) const {
+  (void)sizeof(s);
+  s.store_binary(1745111469);
+  TlStoreBinary::store(hash_, s);
+}
+
+void validatorSession_ping::store(td::TlStorerUnsafe &s) const {
+  (void)sizeof(s);
+  s.store_binary(1745111469);
+  TlStoreBinary::store(hash_, s);
+}
+
+void validatorSession_ping::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "validatorSession_ping");
+    s.store_field("hash", hash_);
+    s.store_class_end();
+  }
+}
+
+validatorSession_ping::ReturnType validatorSession_ping::fetch_result(td::TlParser &p) {
+#define FAIL(error) p.set_error(error); return ReturnType()
+  return TlFetchBoxed<TlFetchObject<validatorSession_pong>, -590989459>::parse(p);
+#undef FAIL
+}
+}  // namespace ton_api
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api.h b/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api.h
new file mode 100644
index 0000000000..6517914a09
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api.h
@@ -0,0 +1,8489 @@
+#pragma once
+
+#include "tl/TlObject.h"
+
+#include "td/utils/int_types.h"
+
+#include <string>
+#include "td/utils/buffer.h"
+#include "crypto/common/bitstring.h"
+
+#include <cstdint>
+#include <memory>
+#include <utility>
+#include <vector>
+
+namespace td {
+class TlStorerCalcLength;
+}  // namespace td
+namespace td {
+class TlStorerUnsafe;
+}  // namespace td
+namespace td {
+class TlStorerToString;
+}  // namespace td
+namespace td {
+class TlParser;
+}  // namespace td
+
+namespace ton {
+namespace ton_api{
+using BaseObject = ::ton::TlObject;
+
+template <class Type>
+using object_ptr = ::ton::tl_object_ptr<Type>;
+
+template <class Type, class... Args>
+object_ptr<Type> make_object(Args &&... args) {
+  return object_ptr<Type>(new Type(std::forward<Args>(args)...));
+}
+
+template <class ToType, class FromType>
+object_ptr<ToType> move_object_as(FromType &&from) {
+  return object_ptr<ToType>(static_cast<ToType *>(from.release()));
+}
+
+std::string to_string(const BaseObject &value);
+
+template <class T>
+std::string to_string(const object_ptr<T> &value) {
+  if (value == nullptr) {
+    return "null";
+  }
+
+  return to_string(*value);
+}
+
+class Hashable;
+
+class PrivateKey;
+
+class PublicKey;
+
+class TestObject;
+
+class adnl_Address;
+
+class adnl_addressList;
+
+class adnl_Message;
+
+class adnl_node;
+
+class adnl_nodes;
+
+class adnl_packetContents;
+
+class adnl_pong;
+
+class adnl_Proxy;
+
+class adnl_proxyToFastHash;
+
+class adnl_proxyToFast;
+
+class adnl_config_global;
+
+class adnl_db_node_key;
+
+class adnl_db_node_value;
+
+class adnl_id_short;
+
+class catchain_block;
+
+class catchain_BlockResult;
+
+class catchain_blocks;
+
+class catchain_Difference;
+
+class catchain_firstblock;
+
+class catchain_sent;
+
+class catchain_blockUpdate;
+
+class catchain_block_data;
+
+class catchain_block_dep;
+
+class catchain_block_id;
+
+class catchain_block_inner_Data;
+
+class catchain_config_global;
+
+class config_global;
+
+class config_local;
+
+class control_config_local;
+
+class db_candidate;
+
+class db_block_Info;
+
+class db_blockdb_Key;
+
+class db_blockdb_lru;
+
+class db_blockdb_value;
+
+class db_candidate_id;
+
+class db_celldb_value;
+
+class db_celldb_key_value;
+
+class db_filedb_Key;
+
+class db_filedb_value;
+
+class db_lt_Key;
+
+class db_lt_desc_value;
+
+class db_lt_el_value;
+
+class db_lt_shard_value;
+
+class db_lt_status_value;
+
+class db_root_config;
+
+class db_root_dbDescription;
+
+class db_root_Key;
+
+class db_state_asyncSerializer;
+
+class db_state_destroyedSessions;
+
+class db_state_gcBlockId;
+
+class db_state_initBlockId;
+
+class db_state_Key;
+
+class db_state_shardClient;
+
+class dht_key;
+
+class dht_keyDescription;
+
+class dht_message;
+
+class dht_node;
+
+class dht_nodes;
+
+class dht_pong;
+
+class dht_stored;
+
+class dht_UpdateRule;
+
+class dht_value;
+
+class dht_ValueResult;
+
+class dht_config_global;
+
+class dht_config_Local;
+
+class dht_db_bucket;
+
+class dht_db_key_bucket;
+
+class dummyworkchain0_config_global;
+
+class engine_Addr;
+
+class engine_adnl;
+
+class engine_controlInterface;
+
+class engine_controlProcess;
+
+class engine_dht;
+
+class engine_gc;
+
+class engine_liteServer;
+
+class engine_validator;
+
+class engine_validatorAdnlAddress;
+
+class engine_validatorTempKey;
+
+class engine_adnlProxy_config;
+
+class engine_adnlProxy_port;
+
+class engine_dht_config;
+
+class engine_validator_config;
+
+class engine_validator_controlQueryError;
+
+class engine_validator_dhtServerStatus;
+
+class engine_validator_dhtServersStatus;
+
+class engine_validator_electionBid;
+
+class validator_groupMember;
+
+class engine_validator_jsonConfig;
+
+class engine_validator_keyHash;
+
+class engine_validator_oneStat;
+
+class engine_validator_signature;
+
+class engine_validator_stats;
+
+class engine_validator_success;
+
+class engine_validator_time;
+
+class fec_Type;
+
+class id_config_local;
+
+class liteclient_config_global;
+
+class liteserver_desc;
+
+class liteserver_config_Local;
+
+class overlay_Broadcast;
+
+class overlay_broadcastList;
+
+class overlay_Certificate;
+
+class overlay_certificateId;
+
+class overlay_message;
+
+class overlay_node;
+
+class overlay_nodes;
+
+class overlay_broadcast_id;
+
+class overlay_broadcast_toSign;
+
+class overlay_broadcastFec_id;
+
+class overlay_broadcastFec_partId;
+
+class overlay_db_key_nodes;
+
+class overlay_db_nodes;
+
+class overlay_node_toSign;
+
+class rldp_Message;
+
+class rldp_MessagePart;
+
+class tcp_Message;
+
+class tcp_pong;
+
+class ton_BlockId;
+
+class tonNode_BlockDescription;
+
+class tonNode_blockId;
+
+class tonNode_blockIdExt;
+
+class tonNode_blockSignature;
+
+class tonNode_Broadcast;
+
+class tonNode_data;
+
+class tonNode_externalMessage;
+
+class tonNode_ihrMessage;
+
+class tonNode_keyBlocks;
+
+class tonNode_newShardBlock;
+
+class tonNode_Prepared;
+
+class tonNode_PreparedProof;
+
+class tonNode_PreparedState;
+
+class tonNode_sessionId;
+
+class tonNode_shardPublicOverlayId;
+
+class tonNode_zeroStateIdExt;
+
+class validator_group;
+
+class validator_config_global;
+
+class validator_config_Local;
+
+class validatorSession_blockUpdate;
+
+class validatorSession_candidate;
+
+class validatorSession_candidateId;
+
+class validatorSession_config;
+
+class validatorSession_Message;
+
+class validatorSession_pong;
+
+class validatorSession_round_id;
+
+class validatorSession_round_Message;
+
+class validatorSession_candidate_id;
+
+class Object;
+
+class Object: public TlObject {
+ public:
+
+  static object_ptr<Object> fetch(td::TlParser &p);
+};
+
+class Function: public TlObject {
+ public:
+
+  static object_ptr<Function> fetch(td::TlParser &p);
+};
+
+class Hashable: public Object {
+ public:
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+};
+
+class hashable_bool final : public Hashable {
+ public:
+  bool value_;
+
+  hashable_bool();
+
+  explicit hashable_bool(bool value_);
+
+  static const std::int32_t ID = -815709156;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_bool(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_int32 final : public Hashable {
+ public:
+  std::int32_t value_;
+
+  hashable_int32();
+
+  explicit hashable_int32(std::int32_t value_);
+
+  static const std::int32_t ID = -743074986;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_int32(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_int64 final : public Hashable {
+ public:
+  std::int64_t value_;
+
+  hashable_int64();
+
+  explicit hashable_int64(std::int64_t value_);
+
+  static const std::int32_t ID = -405107134;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_int64(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_int256 final : public Hashable {
+ public:
+  td::Bits256 value_;
+
+  hashable_int256();
+
+  explicit hashable_int256(td::Bits256 const &value_);
+
+  static const std::int32_t ID = 975377359;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_int256(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_bytes final : public Hashable {
+ public:
+  td::BufferSlice value_;
+
+  hashable_bytes();
+
+  explicit hashable_bytes(td::BufferSlice &&value_);
+
+  static const std::int32_t ID = 118742546;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_bytes(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_pair final : public Hashable {
+ public:
+  std::int32_t left_;
+  std::int32_t right_;
+
+  hashable_pair();
+
+  hashable_pair(std::int32_t left_, std::int32_t right_);
+
+  static const std::int32_t ID = -941266795;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_pair(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_vector final : public Hashable {
+ public:
+  std::vector<std::int32_t> value_;
+
+  hashable_vector();
+
+  explicit hashable_vector(std::vector<std::int32_t> &&value_);
+
+  static const std::int32_t ID = -550190227;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_vector(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_validatorSessionOldRound final : public Hashable {
+ public:
+  std::int32_t seqno_;
+  std::int32_t block_;
+  std::int32_t signatures_;
+  std::int32_t approve_signatures_;
+
+  hashable_validatorSessionOldRound();
+
+  hashable_validatorSessionOldRound(std::int32_t seqno_, std::int32_t block_, std::int32_t signatures_, std::int32_t approve_signatures_);
+
+  static const std::int32_t ID = 1200318377;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_validatorSessionOldRound(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_validatorSessionRoundAttempt final : public Hashable {
+ public:
+  std::int32_t seqno_;
+  std::int32_t votes_;
+  std::int32_t precommitted_;
+  std::int32_t vote_for_inited_;
+  std::int32_t vote_for_;
+
+  hashable_validatorSessionRoundAttempt();
+
+  hashable_validatorSessionRoundAttempt(std::int32_t seqno_, std::int32_t votes_, std::int32_t precommitted_, std::int32_t vote_for_inited_, std::int32_t vote_for_);
+
+  static const std::int32_t ID = 1276247981;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_validatorSessionRoundAttempt(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_validatorSessionRound final : public Hashable {
+ public:
+  std::int32_t locked_round_;
+  std::int32_t locked_block_;
+  std::int32_t seqno_;
+  bool precommitted_;
+  std::int32_t first_attempt_;
+  std::int32_t approved_blocks_;
+  std::int32_t signatures_;
+  std::int32_t attempts_;
+
+  hashable_validatorSessionRound();
+
+  hashable_validatorSessionRound(std::int32_t locked_round_, std::int32_t locked_block_, std::int32_t seqno_, bool precommitted_, std::int32_t first_attempt_, std::int32_t approved_blocks_, std::int32_t signatures_, std::int32_t attempts_);
+
+  static const std::int32_t ID = 897011683;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_validatorSessionRound(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_blockSignature final : public Hashable {
+ public:
+  std::int32_t signature_;
+
+  hashable_blockSignature();
+
+  explicit hashable_blockSignature(std::int32_t signature_);
+
+  static const std::int32_t ID = 937530018;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_blockSignature(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_sentBlock final : public Hashable {
+ public:
+  std::int32_t src_;
+  std::int32_t root_hash_;
+  std::int32_t file_hash_;
+  std::int32_t collated_data_file_hash_;
+
+  hashable_sentBlock();
+
+  hashable_sentBlock(std::int32_t src_, std::int32_t root_hash_, std::int32_t file_hash_, std::int32_t collated_data_file_hash_);
+
+  static const std::int32_t ID = -1111911125;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_sentBlock(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_sentBlockEmpty final : public Hashable {
+ public:
+
+  hashable_sentBlockEmpty();
+
+  static const std::int32_t ID = -1628289361;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_sentBlockEmpty(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_vote final : public Hashable {
+ public:
+  std::int32_t block_;
+  std::int32_t node_;
+
+  hashable_vote();
+
+  hashable_vote(std::int32_t block_, std::int32_t node_);
+
+  static const std::int32_t ID = -1363203131;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_vote(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_blockCandidate final : public Hashable {
+ public:
+  std::int32_t block_;
+  std::int32_t approved_;
+
+  hashable_blockCandidate();
+
+  hashable_blockCandidate(std::int32_t block_, std::int32_t approved_);
+
+  static const std::int32_t ID = 195670285;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_blockCandidate(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_blockVoteCandidate final : public Hashable {
+ public:
+  std::int32_t block_;
+  std::int32_t approved_;
+
+  hashable_blockVoteCandidate();
+
+  hashable_blockVoteCandidate(std::int32_t block_, std::int32_t approved_);
+
+  static const std::int32_t ID = -821202971;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_blockVoteCandidate(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_blockCandidateAttempt final : public Hashable {
+ public:
+  std::int32_t block_;
+  std::int32_t votes_;
+
+  hashable_blockCandidateAttempt();
+
+  hashable_blockCandidateAttempt(std::int32_t block_, std::int32_t votes_);
+
+  static const std::int32_t ID = 1063025931;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_blockCandidateAttempt(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_cntVector final : public Hashable {
+ public:
+  std::int32_t data_;
+
+  hashable_cntVector();
+
+  explicit hashable_cntVector(std::int32_t data_);
+
+  static const std::int32_t ID = 187199288;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_cntVector(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_cntSortedVector final : public Hashable {
+ public:
+  std::int32_t data_;
+
+  hashable_cntSortedVector();
+
+  explicit hashable_cntSortedVector(std::int32_t data_);
+
+  static const std::int32_t ID = 2073445977;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_cntSortedVector(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class hashable_validatorSession final : public Hashable {
+ public:
+  std::int32_t ts_;
+  std::int32_t old_rounds_;
+  std::int32_t cur_round_;
+
+  hashable_validatorSession();
+
+  hashable_validatorSession(std::int32_t ts_, std::int32_t old_rounds_, std::int32_t cur_round_);
+
+  static const std::int32_t ID = 1746035669;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<Hashable> fetch(td::TlParser &p);
+
+  explicit hashable_validatorSession(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class PrivateKey: public Object {
+ public:
+
+  static object_ptr<PrivateKey> fetch(td::TlParser &p);
+};
+
+class pk_unenc final : public PrivateKey {
+ public:
+  td::BufferSlice data_;
+
+  pk_unenc();
+
+  explicit pk_unenc(td::BufferSlice &&data_);
+
+  static const std::int32_t ID = -1311007952;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<PrivateKey> fetch(td::TlParser &p);
+
+  explicit pk_unenc(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class pk_ed25519 final : public PrivateKey {
+ public:
+  td::Bits256 key_;
+
+  pk_ed25519();
+
+  explicit pk_ed25519(td::Bits256 const &key_);
+
+  static const std::int32_t ID = 1231561495;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<PrivateKey> fetch(td::TlParser &p);
+
+  explicit pk_ed25519(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class pk_aes final : public PrivateKey {
+ public:
+  td::Bits256 key_;
+
+  pk_aes();
+
+  explicit pk_aes(td::Bits256 const &key_);
+
+  static const std::int32_t ID = -1511501513;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<PrivateKey> fetch(td::TlParser &p);
+
+  explicit pk_aes(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class pk_overlay final : public PrivateKey {
+ public:
+  td::BufferSlice name_;
+
+  pk_overlay();
+
+  explicit pk_overlay(td::BufferSlice &&name_);
+
+  static const std::int32_t ID = 933623387;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<PrivateKey> fetch(td::TlParser &p);
+
+  explicit pk_overlay(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class PublicKey: public Object {
+ public:
+
+  static object_ptr<PublicKey> fetch(td::TlParser &p);
+};
+
+class pub_unenc final : public PublicKey {
+ public:
+  td::BufferSlice data_;
+
+  pub_unenc();
+
+  explicit pub_unenc(td::BufferSlice &&data_);
+
+  static const std::int32_t ID = -1239464694;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<PublicKey> fetch(td::TlParser &p);
+
+  explicit pub_unenc(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class pub_ed25519 final : public PublicKey {
+ public:
+  td::Bits256 key_;
+
+  pub_ed25519();
+
+  explicit pub_ed25519(td::Bits256 const &key_);
+
+  static const std::int32_t ID = 1209251014;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<PublicKey> fetch(td::TlParser &p);
+
+  explicit pub_ed25519(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class pub_aes final : public PublicKey {
+ public:
+  td::Bits256 key_;
+
+  pub_aes();
+
+  explicit pub_aes(td::Bits256 const &key_);
+
+  static const std::int32_t ID = 767339988;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<PublicKey> fetch(td::TlParser &p);
+
+  explicit pub_aes(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class pub_overlay final : public PublicKey {
+ public:
+  td::BufferSlice name_;
+
+  pub_overlay();
+
+  explicit pub_overlay(td::BufferSlice &&name_);
+
+  static const std::int32_t ID = 884622795;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<PublicKey> fetch(td::TlParser &p);
+
+  explicit pub_overlay(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class TestObject: public Object {
+ public:
+
+  static object_ptr<TestObject> fetch(td::TlParser &p);
+};
+
+class testObject final : public TestObject {
+ public:
+  std::int32_t value_;
+  object_ptr<Object> o_;
+  object_ptr<Function> f_;
+
+  testObject();
+
+  testObject(std::int32_t value_, object_ptr<Object> &&o_, object_ptr<Function> &&f_);
+
+  static const std::int32_t ID = -1521006198;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<TestObject> fetch(td::TlParser &p);
+
+  explicit testObject(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class testString final : public TestObject {
+ public:
+  std::string value_;
+
+  testString();
+
+  explicit testString(std::string const &value_);
+
+  static const std::int32_t ID = -934972983;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<TestObject> fetch(td::TlParser &p);
+
+  explicit testString(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class testInt final : public TestObject {
+ public:
+  std::int32_t value_;
+
+  testInt();
+
+  explicit testInt(std::int32_t value_);
+
+  static const std::int32_t ID = 731271633;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<TestObject> fetch(td::TlParser &p);
+
+  explicit testInt(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class testVectorBytes final : public TestObject {
+ public:
+  std::vector<td::BufferSlice> value_;
+
+  testVectorBytes();
+
+  explicit testVectorBytes(std::vector<td::BufferSlice> &&value_);
+
+  static const std::int32_t ID = 1267407827;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<TestObject> fetch(td::TlParser &p);
+
+  explicit testVectorBytes(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_Address: public Object {
+ public:
+
+  static object_ptr<adnl_Address> fetch(td::TlParser &p);
+};
+
+class adnl_address_udp final : public adnl_Address {
+ public:
+  std::int32_t ip_;
+  std::int32_t port_;
+
+  adnl_address_udp();
+
+  adnl_address_udp(std::int32_t ip_, std::int32_t port_);
+
+  static const std::int32_t ID = 1728947943;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Address> fetch(td::TlParser &p);
+
+  explicit adnl_address_udp(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_address_udp6 final : public adnl_Address {
+ public:
+  td::Bits128 ip_;
+  std::int32_t port_;
+
+  adnl_address_udp6();
+
+  adnl_address_udp6(td::Bits128 const &ip_, std::int32_t port_);
+
+  static const std::int32_t ID = -484613126;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Address> fetch(td::TlParser &p);
+
+  explicit adnl_address_udp6(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_addressList final : public Object {
+ public:
+  std::vector<object_ptr<adnl_Address>> addrs_;
+  std::int32_t version_;
+  std::int32_t reinit_date_;
+  std::int32_t priority_;
+  std::int32_t expire_at_;
+
+  adnl_addressList();
+
+  adnl_addressList(std::vector<object_ptr<adnl_Address>> &&addrs_, std::int32_t version_, std::int32_t reinit_date_, std::int32_t priority_, std::int32_t expire_at_);
+
+  static const std::int32_t ID = 573040216;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_addressList> fetch(td::TlParser &p);
+
+  explicit adnl_addressList(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_Message: public Object {
+ public:
+
+  static object_ptr<adnl_Message> fetch(td::TlParser &p);
+};
+
+class adnl_message_createChannel final : public adnl_Message {
+ public:
+  td::Bits256 key_;
+  std::int32_t date_;
+
+  adnl_message_createChannel();
+
+  adnl_message_createChannel(td::Bits256 const &key_, std::int32_t date_);
+
+  static const std::int32_t ID = -428620869;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Message> fetch(td::TlParser &p);
+
+  explicit adnl_message_createChannel(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_message_confirmChannel final : public adnl_Message {
+ public:
+  td::Bits256 key_;
+  td::Bits256 peer_key_;
+  std::int32_t date_;
+
+  adnl_message_confirmChannel();
+
+  adnl_message_confirmChannel(td::Bits256 const &key_, td::Bits256 const &peer_key_, std::int32_t date_);
+
+  static const std::int32_t ID = 1625103721;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Message> fetch(td::TlParser &p);
+
+  explicit adnl_message_confirmChannel(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_message_custom final : public adnl_Message {
+ public:
+  td::BufferSlice data_;
+
+  adnl_message_custom();
+
+  explicit adnl_message_custom(td::BufferSlice &&data_);
+
+  static const std::int32_t ID = 541595893;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Message> fetch(td::TlParser &p);
+
+  explicit adnl_message_custom(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_message_nop final : public adnl_Message {
+ public:
+
+  adnl_message_nop();
+
+  static const std::int32_t ID = 402186202;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Message> fetch(td::TlParser &p);
+
+  explicit adnl_message_nop(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_message_reinit final : public adnl_Message {
+ public:
+  std::int32_t date_;
+
+  adnl_message_reinit();
+
+  explicit adnl_message_reinit(std::int32_t date_);
+
+  static const std::int32_t ID = 281150752;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Message> fetch(td::TlParser &p);
+
+  explicit adnl_message_reinit(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_message_query final : public adnl_Message {
+ public:
+  td::Bits256 query_id_;
+  td::BufferSlice query_;
+
+  adnl_message_query();
+
+  adnl_message_query(td::Bits256 const &query_id_, td::BufferSlice &&query_);
+
+  static const std::int32_t ID = -1265895046;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Message> fetch(td::TlParser &p);
+
+  explicit adnl_message_query(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_message_answer final : public adnl_Message {
+ public:
+  td::Bits256 query_id_;
+  td::BufferSlice answer_;
+
+  adnl_message_answer();
+
+  adnl_message_answer(td::Bits256 const &query_id_, td::BufferSlice &&answer_);
+
+  static const std::int32_t ID = 262964246;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Message> fetch(td::TlParser &p);
+
+  explicit adnl_message_answer(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_message_part final : public adnl_Message {
+ public:
+  td::Bits256 hash_;
+  std::int32_t total_size_;
+  std::int32_t offset_;
+  td::BufferSlice data_;
+
+  adnl_message_part();
+
+  adnl_message_part(td::Bits256 const &hash_, std::int32_t total_size_, std::int32_t offset_, td::BufferSlice &&data_);
+
+  static const std::int32_t ID = -45798087;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Message> fetch(td::TlParser &p);
+
+  explicit adnl_message_part(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_node final : public Object {
+ public:
+  object_ptr<PublicKey> id_;
+  object_ptr<adnl_addressList> addr_list_;
+
+  adnl_node();
+
+  adnl_node(object_ptr<PublicKey> &&id_, object_ptr<adnl_addressList> &&addr_list_);
+
+  static const std::int32_t ID = 1800802949;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_node> fetch(td::TlParser &p);
+
+  explicit adnl_node(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_nodes final : public Object {
+ public:
+  std::vector<object_ptr<adnl_node>> nodes_;
+
+  adnl_nodes();
+
+  explicit adnl_nodes(std::vector<object_ptr<adnl_node>> &&nodes_);
+
+  static const std::int32_t ID = -1576412330;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_nodes> fetch(td::TlParser &p);
+
+  explicit adnl_nodes(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_packetContents final : public Object {
+ public:
+  td::BufferSlice rand1_;
+  std::int32_t flags_;
+  object_ptr<PublicKey> from_;
+  object_ptr<adnl_id_short> from_short_;
+  object_ptr<adnl_Message> message_;
+  std::vector<object_ptr<adnl_Message>> messages_;
+  object_ptr<adnl_addressList> address_;
+  object_ptr<adnl_addressList> priority_address_;
+  std::int64_t seqno_;
+  std::int64_t confirm_seqno_;
+  std::int32_t recv_addr_list_version_;
+  std::int32_t recv_priority_addr_list_version_;
+  std::int32_t reinit_date_;
+  std::int32_t dst_reinit_date_;
+  td::BufferSlice signature_;
+  td::BufferSlice rand2_;
+  enum Flags : std::int32_t {FROM_MASK = 1, FROM_SHORT_MASK = 2, MESSAGE_MASK = 4, MESSAGES_MASK = 8, ADDRESS_MASK = 16, PRIORITY_ADDRESS_MASK = 32, SEQNO_MASK = 64, CONFIRM_SEQNO_MASK = 128, RECV_ADDR_LIST_VERSION_MASK = 256, RECV_PRIORITY_ADDR_LIST_VERSION_MASK = 512, REINIT_DATE_MASK = 1024, DST_REINIT_DATE_MASK = 1024, SIGNATURE_MASK = 2048};
+
+  adnl_packetContents();
+
+  adnl_packetContents(td::BufferSlice &&rand1_, std::int32_t flags_, object_ptr<PublicKey> &&from_, object_ptr<adnl_id_short> &&from_short_, object_ptr<adnl_Message> &&message_, std::vector<object_ptr<adnl_Message>> &&messages_, object_ptr<adnl_addressList> &&address_, object_ptr<adnl_addressList> &&priority_address_, std::int64_t seqno_, std::int64_t confirm_seqno_, std::int32_t recv_addr_list_version_, std::int32_t recv_priority_addr_list_version_, std::int32_t reinit_date_, std::int32_t dst_reinit_date_, td::BufferSlice &&signature_, td::BufferSlice &&rand2_);
+
+  static const std::int32_t ID = -784151159;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_packetContents> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_pong final : public Object {
+ public:
+  std::int64_t value_;
+
+  adnl_pong();
+
+  explicit adnl_pong(std::int64_t value_);
+
+  static const std::int32_t ID = 544504846;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_pong> fetch(td::TlParser &p);
+
+  explicit adnl_pong(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_Proxy: public Object {
+ public:
+
+  static object_ptr<adnl_Proxy> fetch(td::TlParser &p);
+};
+
+class adnl_proxy_none final : public adnl_Proxy {
+ public:
+
+  adnl_proxy_none();
+
+  static const std::int32_t ID = -90551726;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Proxy> fetch(td::TlParser &p);
+
+  explicit adnl_proxy_none(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_proxy_fast final : public adnl_Proxy {
+ public:
+  td::BufferSlice shared_secret_;
+
+  adnl_proxy_fast();
+
+  explicit adnl_proxy_fast(td::BufferSlice &&shared_secret_);
+
+  static const std::int32_t ID = 554536094;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_Proxy> fetch(td::TlParser &p);
+
+  explicit adnl_proxy_fast(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_proxyToFastHash final : public Object {
+ public:
+  std::int32_t ip_;
+  std::int32_t port_;
+  std::int32_t date_;
+  td::Bits256 data_hash_;
+  td::Bits256 shared_secret_;
+
+  adnl_proxyToFastHash();
+
+  adnl_proxyToFastHash(std::int32_t ip_, std::int32_t port_, std::int32_t date_, td::Bits256 const &data_hash_, td::Bits256 const &shared_secret_);
+
+  static const std::int32_t ID = -574752674;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_proxyToFastHash> fetch(td::TlParser &p);
+
+  explicit adnl_proxyToFastHash(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_proxyToFast final : public Object {
+ public:
+  std::int32_t ip_;
+  std::int32_t port_;
+  std::int32_t date_;
+  td::Bits256 signature_;
+
+  adnl_proxyToFast();
+
+  adnl_proxyToFast(std::int32_t ip_, std::int32_t port_, std::int32_t date_, td::Bits256 const &signature_);
+
+  static const std::int32_t ID = -1259462186;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_proxyToFast> fetch(td::TlParser &p);
+
+  explicit adnl_proxyToFast(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_config_global final : public Object {
+ public:
+  object_ptr<adnl_nodes> static_nodes_;
+
+  adnl_config_global();
+
+  explicit adnl_config_global(object_ptr<adnl_nodes> &&static_nodes_);
+
+  static const std::int32_t ID = -1099988784;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_config_global> fetch(td::TlParser &p);
+
+  explicit adnl_config_global(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_db_node_key final : public Object {
+ public:
+  td::Bits256 local_id_;
+  td::Bits256 peer_id_;
+
+  adnl_db_node_key();
+
+  adnl_db_node_key(td::Bits256 const &local_id_, td::Bits256 const &peer_id_);
+
+  static const std::int32_t ID = -979114962;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_db_node_key> fetch(td::TlParser &p);
+
+  explicit adnl_db_node_key(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_db_node_value final : public Object {
+ public:
+  std::int32_t date_;
+  object_ptr<PublicKey> id_;
+  object_ptr<adnl_addressList> addr_list_;
+  object_ptr<adnl_addressList> priority_addr_list_;
+
+  adnl_db_node_value();
+
+  adnl_db_node_value(std::int32_t date_, object_ptr<PublicKey> &&id_, object_ptr<adnl_addressList> &&addr_list_, object_ptr<adnl_addressList> &&priority_addr_list_);
+
+  static const std::int32_t ID = 1415390983;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_db_node_value> fetch(td::TlParser &p);
+
+  explicit adnl_db_node_value(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_id_short final : public Object {
+ public:
+  td::Bits256 id_;
+
+  adnl_id_short();
+
+  explicit adnl_id_short(td::Bits256 const &id_);
+
+  static const std::int32_t ID = 1044342095;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<adnl_id_short> fetch(td::TlParser &p);
+
+  explicit adnl_id_short(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_block final : public Object {
+ public:
+  td::Bits256 incarnation_;
+  std::int32_t src_;
+  std::int32_t height_;
+  object_ptr<catchain_block_data> data_;
+  td::BufferSlice signature_;
+
+  catchain_block();
+
+  catchain_block(td::Bits256 const &incarnation_, std::int32_t src_, std::int32_t height_, object_ptr<catchain_block_data> &&data_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = -699055756;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_block> fetch(td::TlParser &p);
+
+  explicit catchain_block(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_BlockResult: public Object {
+ public:
+
+  static object_ptr<catchain_BlockResult> fetch(td::TlParser &p);
+};
+
+class catchain_blockNotFound final : public catchain_BlockResult {
+ public:
+
+  catchain_blockNotFound();
+
+  static const std::int32_t ID = -1240397692;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_BlockResult> fetch(td::TlParser &p);
+
+  explicit catchain_blockNotFound(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_blockResult final : public catchain_BlockResult {
+ public:
+  object_ptr<catchain_block> block_;
+
+  catchain_blockResult();
+
+  explicit catchain_blockResult(object_ptr<catchain_block> &&block_);
+
+  static const std::int32_t ID = -1658179513;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_BlockResult> fetch(td::TlParser &p);
+
+  explicit catchain_blockResult(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_blocks final : public Object {
+ public:
+  std::vector<object_ptr<catchain_block>> blocks_;
+
+  catchain_blocks();
+
+  explicit catchain_blocks(std::vector<object_ptr<catchain_block>> &&blocks_);
+
+  static const std::int32_t ID = 1357697473;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_blocks> fetch(td::TlParser &p);
+
+  explicit catchain_blocks(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_Difference: public Object {
+ public:
+
+  static object_ptr<catchain_Difference> fetch(td::TlParser &p);
+};
+
+class catchain_difference final : public catchain_Difference {
+ public:
+  std::vector<std::int32_t> sent_upto_;
+
+  catchain_difference();
+
+  explicit catchain_difference(std::vector<std::int32_t> &&sent_upto_);
+
+  static const std::int32_t ID = 336974282;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_Difference> fetch(td::TlParser &p);
+
+  explicit catchain_difference(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_differenceFork final : public catchain_Difference {
+ public:
+  object_ptr<catchain_block_dep> left_;
+  object_ptr<catchain_block_dep> right_;
+
+  catchain_differenceFork();
+
+  catchain_differenceFork(object_ptr<catchain_block_dep> &&left_, object_ptr<catchain_block_dep> &&right_);
+
+  static const std::int32_t ID = 1227341935;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_Difference> fetch(td::TlParser &p);
+
+  explicit catchain_differenceFork(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_firstblock final : public Object {
+ public:
+  td::Bits256 unique_hash_;
+  std::vector<td::Bits256> nodes_;
+
+  catchain_firstblock();
+
+  catchain_firstblock(td::Bits256 const &unique_hash_, std::vector<td::Bits256> &&nodes_);
+
+  static const std::int32_t ID = 281609467;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_firstblock> fetch(td::TlParser &p);
+
+  explicit catchain_firstblock(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_sent final : public Object {
+ public:
+  std::int32_t cnt_;
+
+  catchain_sent();
+
+  explicit catchain_sent(std::int32_t cnt_);
+
+  static const std::int32_t ID = -84454993;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_sent> fetch(td::TlParser &p);
+
+  explicit catchain_sent(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_blockUpdate final : public Object {
+ public:
+  object_ptr<catchain_block> block_;
+
+  catchain_blockUpdate();
+
+  explicit catchain_blockUpdate(object_ptr<catchain_block> &&block_);
+
+  static const std::int32_t ID = 593975492;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_blockUpdate> fetch(td::TlParser &p);
+
+  explicit catchain_blockUpdate(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_block_data final : public Object {
+ public:
+  object_ptr<catchain_block_dep> prev_;
+  std::vector<object_ptr<catchain_block_dep>> deps_;
+
+  catchain_block_data();
+
+  catchain_block_data(object_ptr<catchain_block_dep> &&prev_, std::vector<object_ptr<catchain_block_dep>> &&deps_);
+
+  static const std::int32_t ID = -122903008;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_block_data> fetch(td::TlParser &p);
+
+  explicit catchain_block_data(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_block_dep final : public Object {
+ public:
+  std::int32_t src_;
+  std::int32_t height_;
+  td::Bits256 data_hash_;
+  td::BufferSlice signature_;
+
+  catchain_block_dep();
+
+  catchain_block_dep(std::int32_t src_, std::int32_t height_, td::Bits256 const &data_hash_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = 1511706959;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_block_dep> fetch(td::TlParser &p);
+
+  explicit catchain_block_dep(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_block_id final : public Object {
+ public:
+  td::Bits256 incarnation_;
+  td::Bits256 src_;
+  std::int32_t height_;
+  td::Bits256 data_hash_;
+
+  catchain_block_id();
+
+  catchain_block_id(td::Bits256 const &incarnation_, td::Bits256 const &src_, std::int32_t height_, td::Bits256 const &data_hash_);
+
+  static const std::int32_t ID = 620665018;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_block_id> fetch(td::TlParser &p);
+
+  explicit catchain_block_id(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_block_inner_Data: public Object {
+ public:
+
+  static object_ptr<catchain_block_inner_Data> fetch(td::TlParser &p);
+};
+
+class catchain_block_data_badBlock final : public catchain_block_inner_Data {
+ public:
+  object_ptr<catchain_block> block_;
+
+  catchain_block_data_badBlock();
+
+  explicit catchain_block_data_badBlock(object_ptr<catchain_block> &&block_);
+
+  static const std::int32_t ID = -1241359786;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_block_inner_Data> fetch(td::TlParser &p);
+
+  explicit catchain_block_data_badBlock(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_block_data_fork final : public catchain_block_inner_Data {
+ public:
+  object_ptr<catchain_block_dep> left_;
+  object_ptr<catchain_block_dep> right_;
+
+  catchain_block_data_fork();
+
+  catchain_block_data_fork(object_ptr<catchain_block_dep> &&left_, object_ptr<catchain_block_dep> &&right_);
+
+  static const std::int32_t ID = 1685731922;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_block_inner_Data> fetch(td::TlParser &p);
+
+  explicit catchain_block_data_fork(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_block_data_nop final : public catchain_block_inner_Data {
+ public:
+
+  catchain_block_data_nop();
+
+  static const std::int32_t ID = 1417852112;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_block_inner_Data> fetch(td::TlParser &p);
+
+  explicit catchain_block_data_nop(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_block_data_vector final : public catchain_block_inner_Data {
+ public:
+  std::vector<td::BufferSlice> msgs_;
+
+  catchain_block_data_vector();
+
+  explicit catchain_block_data_vector(std::vector<td::BufferSlice> &&msgs_);
+
+  static const std::int32_t ID = 1688809258;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_block_inner_Data> fetch(td::TlParser &p);
+
+  explicit catchain_block_data_vector(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class catchain_config_global final : public Object {
+ public:
+  td::Bits256 tag_;
+  std::vector<object_ptr<PublicKey>> nodes_;
+
+  catchain_config_global();
+
+  catchain_config_global(td::Bits256 const &tag_, std::vector<object_ptr<PublicKey>> &&nodes_);
+
+  static const std::int32_t ID = 1757918801;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<catchain_config_global> fetch(td::TlParser &p);
+
+  explicit catchain_config_global(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class config_global final : public Object {
+ public:
+  object_ptr<adnl_config_global> adnl_;
+  object_ptr<dht_config_global> dht_;
+  object_ptr<validator_config_global> validator_;
+
+  config_global();
+
+  config_global(object_ptr<adnl_config_global> &&adnl_, object_ptr<dht_config_global> &&dht_, object_ptr<validator_config_global> &&validator_);
+
+  static const std::int32_t ID = -198795310;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<config_global> fetch(td::TlParser &p);
+
+  explicit config_global(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class config_local final : public Object {
+ public:
+  std::vector<object_ptr<id_config_local>> local_ids_;
+  std::vector<object_ptr<dht_config_Local>> dht_;
+  std::vector<object_ptr<validator_config_Local>> validators_;
+  std::vector<object_ptr<liteserver_config_Local>> liteservers_;
+  std::vector<object_ptr<control_config_local>> control_;
+
+  config_local();
+
+  config_local(std::vector<object_ptr<id_config_local>> &&local_ids_, std::vector<object_ptr<dht_config_Local>> &&dht_, std::vector<object_ptr<validator_config_Local>> &&validators_, std::vector<object_ptr<liteserver_config_Local>> &&liteservers_, std::vector<object_ptr<control_config_local>> &&control_);
+
+  static const std::int32_t ID = 2023657820;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<config_local> fetch(td::TlParser &p);
+
+  explicit config_local(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class control_config_local final : public Object {
+ public:
+  object_ptr<PrivateKey> priv_;
+  td::Bits256 pub_;
+  std::int32_t port_;
+
+  control_config_local();
+
+  control_config_local(object_ptr<PrivateKey> &&priv_, td::Bits256 const &pub_, std::int32_t port_);
+
+  static const std::int32_t ID = 1964895469;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<control_config_local> fetch(td::TlParser &p);
+
+  explicit control_config_local(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_candidate final : public Object {
+ public:
+  object_ptr<PublicKey> source_;
+  object_ptr<tonNode_blockIdExt> id_;
+  td::BufferSlice data_;
+  td::BufferSlice collated_data_;
+
+  db_candidate();
+
+  db_candidate(object_ptr<PublicKey> &&source_, object_ptr<tonNode_blockIdExt> &&id_, td::BufferSlice &&data_, td::BufferSlice &&collated_data_);
+
+  static const std::int32_t ID = 1708747482;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_candidate> fetch(td::TlParser &p);
+
+  explicit db_candidate(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_block_Info: public Object {
+ public:
+
+  static object_ptr<db_block_Info> fetch(td::TlParser &p);
+};
+
+class db_block_info final : public db_block_Info {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  std::int32_t flags_;
+  object_ptr<tonNode_blockIdExt> prev_left_;
+  object_ptr<tonNode_blockIdExt> prev_right_;
+  object_ptr<tonNode_blockIdExt> next_left_;
+  object_ptr<tonNode_blockIdExt> next_right_;
+  std::int64_t lt_;
+  std::int32_t ts_;
+  td::Bits256 state_;
+  enum Flags : std::int32_t {PREV_LEFT_MASK = 2, PREV_RIGHT_MASK = 4, NEXT_LEFT_MASK = 8, NEXT_RIGHT_MASK = 16, LT_MASK = 8192, TS_MASK = 16384, STATE_MASK = 131072};
+
+  db_block_info();
+
+  db_block_info(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t flags_, object_ptr<tonNode_blockIdExt> &&prev_left_, object_ptr<tonNode_blockIdExt> &&prev_right_, object_ptr<tonNode_blockIdExt> &&next_left_, object_ptr<tonNode_blockIdExt> &&next_right_, std::int64_t lt_, std::int32_t ts_, td::Bits256 const &state_);
+
+  static const std::int32_t ID = 1254549287;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_block_Info> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_block_archivedInfo final : public db_block_Info {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  std::int32_t flags_;
+  object_ptr<tonNode_blockIdExt> next_;
+  enum Flags : std::int32_t {NEXT_MASK = 1};
+
+  db_block_archivedInfo();
+
+  db_block_archivedInfo(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t flags_, object_ptr<tonNode_blockIdExt> &&next_);
+
+  static const std::int32_t ID = 543128145;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_block_Info> fetch(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_blockdb_Key: public Object {
+ public:
+
+  static object_ptr<db_blockdb_Key> fetch(td::TlParser &p);
+};
+
+class db_blockdb_key_lru final : public db_blockdb_Key {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+
+  db_blockdb_key_lru();
+
+  explicit db_blockdb_key_lru(object_ptr<tonNode_blockIdExt> &&id_);
+
+  static const std::int32_t ID = 1354536506;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_blockdb_Key> fetch(td::TlParser &p);
+
+  explicit db_blockdb_key_lru(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_blockdb_key_value final : public db_blockdb_Key {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+
+  db_blockdb_key_value();
+
+  explicit db_blockdb_key_value(object_ptr<tonNode_blockIdExt> &&id_);
+
+  static const std::int32_t ID = 2136461683;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_blockdb_Key> fetch(td::TlParser &p);
+
+  explicit db_blockdb_key_value(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_blockdb_lru final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  td::Bits256 prev_;
+  td::Bits256 next_;
+
+  db_blockdb_lru();
+
+  db_blockdb_lru(object_ptr<tonNode_blockIdExt> &&id_, td::Bits256 const &prev_, td::Bits256 const &next_);
+
+  static const std::int32_t ID = -1055500877;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_blockdb_lru> fetch(td::TlParser &p);
+
+  explicit db_blockdb_lru(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_blockdb_value final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> next_;
+  td::BufferSlice data_;
+
+  db_blockdb_value();
+
+  db_blockdb_value(object_ptr<tonNode_blockIdExt> &&next_, td::BufferSlice &&data_);
+
+  static const std::int32_t ID = -1299266515;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_blockdb_value> fetch(td::TlParser &p);
+
+  explicit db_blockdb_value(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_candidate_id final : public Object {
+ public:
+  object_ptr<PublicKey> source_;
+  object_ptr<tonNode_blockIdExt> id_;
+  td::Bits256 collated_data_file_hash_;
+
+  db_candidate_id();
+
+  db_candidate_id(object_ptr<PublicKey> &&source_, object_ptr<tonNode_blockIdExt> &&id_, td::Bits256 const &collated_data_file_hash_);
+
+  static const std::int32_t ID = 935375495;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_candidate_id> fetch(td::TlParser &p);
+
+  explicit db_candidate_id(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_celldb_value final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> block_id_;
+  td::Bits256 prev_;
+  td::Bits256 next_;
+  td::Bits256 root_hash_;
+
+  db_celldb_value();
+
+  db_celldb_value(object_ptr<tonNode_blockIdExt> &&block_id_, td::Bits256 const &prev_, td::Bits256 const &next_, td::Bits256 const &root_hash_);
+
+  static const std::int32_t ID = -435153856;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_celldb_value> fetch(td::TlParser &p);
+
+  explicit db_celldb_value(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_celldb_key_value final : public Object {
+ public:
+  td::Bits256 hash_;
+
+  db_celldb_key_value();
+
+  explicit db_celldb_key_value(td::Bits256 const &hash_);
+
+  static const std::int32_t ID = 1538341155;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_celldb_key_value> fetch(td::TlParser &p);
+
+  explicit db_celldb_key_value(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_filedb_Key: public Object {
+ public:
+
+  static object_ptr<db_filedb_Key> fetch(td::TlParser &p);
+};
+
+class db_filedb_key_empty final : public db_filedb_Key {
+ public:
+
+  db_filedb_key_empty();
+
+  static const std::int32_t ID = 2080319307;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_filedb_Key> fetch(td::TlParser &p);
+
+  explicit db_filedb_key_empty(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_filedb_key_blockFile final : public db_filedb_Key {
+ public:
+  object_ptr<tonNode_blockIdExt> block_id_;
+
+  db_filedb_key_blockFile();
+
+  explicit db_filedb_key_blockFile(object_ptr<tonNode_blockIdExt> &&block_id_);
+
+  static const std::int32_t ID = -1326783375;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_filedb_Key> fetch(td::TlParser &p);
+
+  explicit db_filedb_key_blockFile(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_filedb_key_zeroStateFile final : public db_filedb_Key {
+ public:
+  object_ptr<tonNode_blockIdExt> block_id_;
+
+  db_filedb_key_zeroStateFile();
+
+  explicit db_filedb_key_zeroStateFile(object_ptr<tonNode_blockIdExt> &&block_id_);
+
+  static const std::int32_t ID = 307398205;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_filedb_Key> fetch(td::TlParser &p);
+
+  explicit db_filedb_key_zeroStateFile(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_filedb_key_persistentStateFile final : public db_filedb_Key {
+ public:
+  object_ptr<tonNode_blockIdExt> block_id_;
+  object_ptr<tonNode_blockIdExt> masterchain_block_id_;
+
+  db_filedb_key_persistentStateFile();
+
+  db_filedb_key_persistentStateFile(object_ptr<tonNode_blockIdExt> &&block_id_, object_ptr<tonNode_blockIdExt> &&masterchain_block_id_);
+
+  static const std::int32_t ID = -1346996660;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_filedb_Key> fetch(td::TlParser &p);
+
+  explicit db_filedb_key_persistentStateFile(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_filedb_key_proof final : public db_filedb_Key {
+ public:
+  object_ptr<tonNode_blockIdExt> block_id_;
+
+  db_filedb_key_proof();
+
+  explicit db_filedb_key_proof(object_ptr<tonNode_blockIdExt> &&block_id_);
+
+  static const std::int32_t ID = -627749396;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_filedb_Key> fetch(td::TlParser &p);
+
+  explicit db_filedb_key_proof(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_filedb_key_proofLink final : public db_filedb_Key {
+ public:
+  object_ptr<tonNode_blockIdExt> block_id_;
+
+  db_filedb_key_proofLink();
+
+  explicit db_filedb_key_proofLink(object_ptr<tonNode_blockIdExt> &&block_id_);
+
+  static const std::int32_t ID = -1728330290;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_filedb_Key> fetch(td::TlParser &p);
+
+  explicit db_filedb_key_proofLink(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_filedb_key_signatures final : public db_filedb_Key {
+ public:
+  object_ptr<tonNode_blockIdExt> block_id_;
+
+  db_filedb_key_signatures();
+
+  explicit db_filedb_key_signatures(object_ptr<tonNode_blockIdExt> &&block_id_);
+
+  static const std::int32_t ID = -685175541;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_filedb_Key> fetch(td::TlParser &p);
+
+  explicit db_filedb_key_signatures(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_filedb_key_candidate final : public db_filedb_Key {
+ public:
+  object_ptr<db_candidate_id> id_;
+
+  db_filedb_key_candidate();
+
+  explicit db_filedb_key_candidate(object_ptr<db_candidate_id> &&id_);
+
+  static const std::int32_t ID = -494269767;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_filedb_Key> fetch(td::TlParser &p);
+
+  explicit db_filedb_key_candidate(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_filedb_value final : public Object {
+ public:
+  object_ptr<db_filedb_Key> key_;
+  td::Bits256 prev_;
+  td::Bits256 next_;
+  td::Bits256 file_hash_;
+
+  db_filedb_value();
+
+  db_filedb_value(object_ptr<db_filedb_Key> &&key_, td::Bits256 const &prev_, td::Bits256 const &next_, td::Bits256 const &file_hash_);
+
+  static const std::int32_t ID = -220390867;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_filedb_value> fetch(td::TlParser &p);
+
+  explicit db_filedb_value(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_lt_Key: public Object {
+ public:
+
+  static object_ptr<db_lt_Key> fetch(td::TlParser &p);
+};
+
+class db_lt_el_key final : public db_lt_Key {
+ public:
+  std::int32_t workchain_;
+  std::int64_t shard_;
+  std::int32_t idx_;
+
+  db_lt_el_key();
+
+  db_lt_el_key(std::int32_t workchain_, std::int64_t shard_, std::int32_t idx_);
+
+  static const std::int32_t ID = -1523442974;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_lt_Key> fetch(td::TlParser &p);
+
+  explicit db_lt_el_key(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_lt_desc_key final : public db_lt_Key {
+ public:
+  std::int32_t workchain_;
+  std::int64_t shard_;
+
+  db_lt_desc_key();
+
+  db_lt_desc_key(std::int32_t workchain_, std::int64_t shard_);
+
+  static const std::int32_t ID = -236722287;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_lt_Key> fetch(td::TlParser &p);
+
+  explicit db_lt_desc_key(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_lt_shard_key final : public db_lt_Key {
+ public:
+  std::int32_t idx_;
+
+  db_lt_shard_key();
+
+  explicit db_lt_shard_key(std::int32_t idx_);
+
+  static const std::int32_t ID = 1353120015;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_lt_Key> fetch(td::TlParser &p);
+
+  explicit db_lt_shard_key(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_lt_status_key final : public db_lt_Key {
+ public:
+
+  db_lt_status_key();
+
+  static const std::int32_t ID = 2003591255;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_lt_Key> fetch(td::TlParser &p);
+
+  explicit db_lt_status_key(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_lt_desc_value final : public Object {
+ public:
+  std::int32_t first_idx_;
+  std::int32_t last_idx_;
+  std::int32_t last_seqno_;
+  std::int64_t last_lt_;
+  std::int32_t last_ts_;
+
+  db_lt_desc_value();
+
+  db_lt_desc_value(std::int32_t first_idx_, std::int32_t last_idx_, std::int32_t last_seqno_, std::int64_t last_lt_, std::int32_t last_ts_);
+
+  static const std::int32_t ID = 1907315124;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_lt_desc_value> fetch(td::TlParser &p);
+
+  explicit db_lt_desc_value(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_lt_el_value final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  std::int64_t lt_;
+  std::int32_t ts_;
+
+  db_lt_el_value();
+
+  db_lt_el_value(object_ptr<tonNode_blockIdExt> &&id_, std::int64_t lt_, std::int32_t ts_);
+
+  static const std::int32_t ID = -1780064412;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_lt_el_value> fetch(td::TlParser &p);
+
+  explicit db_lt_el_value(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_lt_shard_value final : public Object {
+ public:
+  std::int32_t workchain_;
+  std::int64_t shard_;
+
+  db_lt_shard_value();
+
+  db_lt_shard_value(std::int32_t workchain_, std::int64_t shard_);
+
+  static const std::int32_t ID = 1014209147;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_lt_shard_value> fetch(td::TlParser &p);
+
+  explicit db_lt_shard_value(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_lt_status_value final : public Object {
+ public:
+  std::int32_t total_shards_;
+
+  db_lt_status_value();
+
+  explicit db_lt_status_value(std::int32_t total_shards_);
+
+  static const std::int32_t ID = -88150727;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_lt_status_value> fetch(td::TlParser &p);
+
+  explicit db_lt_status_value(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_root_config final : public Object {
+ public:
+  std::int32_t celldb_version_;
+  std::int32_t blockdb_version_;
+
+  db_root_config();
+
+  db_root_config(std::int32_t celldb_version_, std::int32_t blockdb_version_);
+
+  static const std::int32_t ID = -703495519;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_root_config> fetch(td::TlParser &p);
+
+  explicit db_root_config(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_root_dbDescription final : public Object {
+ public:
+  std::int32_t version_;
+  object_ptr<tonNode_blockIdExt> first_masterchain_block_id_;
+  std::int32_t flags_;
+
+  db_root_dbDescription();
+
+  db_root_dbDescription(std::int32_t version_, object_ptr<tonNode_blockIdExt> &&first_masterchain_block_id_, std::int32_t flags_);
+
+  static const std::int32_t ID = -1273465869;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_root_dbDescription> fetch(td::TlParser &p);
+
+  explicit db_root_dbDescription(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_root_Key: public Object {
+ public:
+
+  static object_ptr<db_root_Key> fetch(td::TlParser &p);
+};
+
+class db_root_key_cellDb final : public db_root_Key {
+ public:
+  std::int32_t version_;
+
+  db_root_key_cellDb();
+
+  explicit db_root_key_cellDb(std::int32_t version_);
+
+  static const std::int32_t ID = 1928966974;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_root_Key> fetch(td::TlParser &p);
+
+  explicit db_root_key_cellDb(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_root_key_blockDb final : public db_root_Key {
+ public:
+  std::int32_t version_;
+
+  db_root_key_blockDb();
+
+  explicit db_root_key_blockDb(std::int32_t version_);
+
+  static const std::int32_t ID = 806534976;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_root_Key> fetch(td::TlParser &p);
+
+  explicit db_root_key_blockDb(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_root_key_config final : public db_root_Key {
+ public:
+
+  db_root_key_config();
+
+  static const std::int32_t ID = 331559556;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_root_Key> fetch(td::TlParser &p);
+
+  explicit db_root_key_config(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_state_asyncSerializer final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+  object_ptr<tonNode_blockIdExt> last_;
+  std::int32_t last_ts_;
+
+  db_state_asyncSerializer();
+
+  db_state_asyncSerializer(object_ptr<tonNode_blockIdExt> &&block_, object_ptr<tonNode_blockIdExt> &&last_, std::int32_t last_ts_);
+
+  static const std::int32_t ID = -751883871;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_state_asyncSerializer> fetch(td::TlParser &p);
+
+  explicit db_state_asyncSerializer(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_state_destroyedSessions final : public Object {
+ public:
+  std::vector<td::Bits256> sessions_;
+
+  db_state_destroyedSessions();
+
+  explicit db_state_destroyedSessions(std::vector<td::Bits256> &&sessions_);
+
+  static const std::int32_t ID = -1381443196;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_state_destroyedSessions> fetch(td::TlParser &p);
+
+  explicit db_state_destroyedSessions(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_state_gcBlockId final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+
+  db_state_gcBlockId();
+
+  explicit db_state_gcBlockId(object_ptr<tonNode_blockIdExt> &&block_);
+
+  static const std::int32_t ID = -550453937;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_state_gcBlockId> fetch(td::TlParser &p);
+
+  explicit db_state_gcBlockId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_state_initBlockId final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+
+  db_state_initBlockId();
+
+  explicit db_state_initBlockId(object_ptr<tonNode_blockIdExt> &&block_);
+
+  static const std::int32_t ID = 1932303605;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_state_initBlockId> fetch(td::TlParser &p);
+
+  explicit db_state_initBlockId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_state_Key: public Object {
+ public:
+
+  static object_ptr<db_state_Key> fetch(td::TlParser &p);
+};
+
+class db_state_key_destroyedSessions final : public db_state_Key {
+ public:
+
+  db_state_key_destroyedSessions();
+
+  static const std::int32_t ID = -386404007;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_state_Key> fetch(td::TlParser &p);
+
+  explicit db_state_key_destroyedSessions(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_state_key_initBlockId final : public db_state_Key {
+ public:
+
+  db_state_key_initBlockId();
+
+  static const std::int32_t ID = 1971484899;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_state_Key> fetch(td::TlParser &p);
+
+  explicit db_state_key_initBlockId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_state_key_gcBlockId final : public db_state_Key {
+ public:
+
+  db_state_key_gcBlockId();
+
+  static const std::int32_t ID = -1015417890;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_state_Key> fetch(td::TlParser &p);
+
+  explicit db_state_key_gcBlockId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_state_key_shardClient final : public db_state_Key {
+ public:
+
+  db_state_key_shardClient();
+
+  static const std::int32_t ID = -912576121;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_state_Key> fetch(td::TlParser &p);
+
+  explicit db_state_key_shardClient(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_state_key_asyncSerializer final : public db_state_Key {
+ public:
+
+  db_state_key_asyncSerializer();
+
+  static const std::int32_t ID = 699304479;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_state_Key> fetch(td::TlParser &p);
+
+  explicit db_state_key_asyncSerializer(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class db_state_shardClient final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+
+  db_state_shardClient();
+
+  explicit db_state_shardClient(object_ptr<tonNode_blockIdExt> &&block_);
+
+  static const std::int32_t ID = 186033821;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<db_state_shardClient> fetch(td::TlParser &p);
+
+  explicit db_state_shardClient(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_key final : public Object {
+ public:
+  td::Bits256 id_;
+  td::BufferSlice name_;
+  std::int32_t idx_;
+
+  dht_key();
+
+  dht_key(td::Bits256 const &id_, td::BufferSlice &&name_, std::int32_t idx_);
+
+  static const std::int32_t ID = -160964977;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_key> fetch(td::TlParser &p);
+
+  explicit dht_key(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_keyDescription final : public Object {
+ public:
+  object_ptr<dht_key> key_;
+  object_ptr<PublicKey> id_;
+  object_ptr<dht_UpdateRule> update_rule_;
+  td::BufferSlice signature_;
+
+  dht_keyDescription();
+
+  dht_keyDescription(object_ptr<dht_key> &&key_, object_ptr<PublicKey> &&id_, object_ptr<dht_UpdateRule> &&update_rule_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = 673009157;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_keyDescription> fetch(td::TlParser &p);
+
+  explicit dht_keyDescription(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_message final : public Object {
+ public:
+  object_ptr<dht_node> node_;
+
+  dht_message();
+
+  explicit dht_message(object_ptr<dht_node> &&node_);
+
+  static const std::int32_t ID = -1140008050;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_message> fetch(td::TlParser &p);
+
+  explicit dht_message(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_node final : public Object {
+ public:
+  object_ptr<PublicKey> id_;
+  object_ptr<adnl_addressList> addr_list_;
+  std::int32_t version_;
+  td::BufferSlice signature_;
+
+  dht_node();
+
+  dht_node(object_ptr<PublicKey> &&id_, object_ptr<adnl_addressList> &&addr_list_, std::int32_t version_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = -2074922424;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_node> fetch(td::TlParser &p);
+
+  explicit dht_node(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_nodes final : public Object {
+ public:
+  std::vector<object_ptr<dht_node>> nodes_;
+
+  dht_nodes();
+
+  explicit dht_nodes(std::vector<object_ptr<dht_node>> &&nodes_);
+
+  static const std::int32_t ID = 2037686462;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_nodes> fetch(td::TlParser &p);
+
+  explicit dht_nodes(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_pong final : public Object {
+ public:
+  std::int64_t random_id_;
+
+  dht_pong();
+
+  explicit dht_pong(std::int64_t random_id_);
+
+  static const std::int32_t ID = 1519054721;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_pong> fetch(td::TlParser &p);
+
+  explicit dht_pong(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_stored final : public Object {
+ public:
+
+  dht_stored();
+
+  static const std::int32_t ID = 1881602824;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_stored> fetch(td::TlParser &p);
+
+  explicit dht_stored(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_UpdateRule: public Object {
+ public:
+
+  static object_ptr<dht_UpdateRule> fetch(td::TlParser &p);
+};
+
+class dht_updateRule_signature final : public dht_UpdateRule {
+ public:
+
+  dht_updateRule_signature();
+
+  static const std::int32_t ID = -861982217;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_UpdateRule> fetch(td::TlParser &p);
+
+  explicit dht_updateRule_signature(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_updateRule_anybody final : public dht_UpdateRule {
+ public:
+
+  dht_updateRule_anybody();
+
+  static const std::int32_t ID = 1633127956;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_UpdateRule> fetch(td::TlParser &p);
+
+  explicit dht_updateRule_anybody(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_updateRule_overlayNodes final : public dht_UpdateRule {
+ public:
+
+  dht_updateRule_overlayNodes();
+
+  static const std::int32_t ID = 645370755;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_UpdateRule> fetch(td::TlParser &p);
+
+  explicit dht_updateRule_overlayNodes(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_value final : public Object {
+ public:
+  object_ptr<dht_keyDescription> key_;
+  td::BufferSlice value_;
+  std::int32_t ttl_;
+  td::BufferSlice signature_;
+
+  dht_value();
+
+  dht_value(object_ptr<dht_keyDescription> &&key_, td::BufferSlice &&value_, std::int32_t ttl_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = -1867700277;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_value> fetch(td::TlParser &p);
+
+  explicit dht_value(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_ValueResult: public Object {
+ public:
+
+  static object_ptr<dht_ValueResult> fetch(td::TlParser &p);
+};
+
+class dht_valueNotFound final : public dht_ValueResult {
+ public:
+  object_ptr<dht_nodes> nodes_;
+
+  dht_valueNotFound();
+
+  explicit dht_valueNotFound(object_ptr<dht_nodes> &&nodes_);
+
+  static const std::int32_t ID = -1570634392;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_ValueResult> fetch(td::TlParser &p);
+
+  explicit dht_valueNotFound(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_valueFound final : public dht_ValueResult {
+ public:
+  object_ptr<dht_value> value_;
+
+  dht_valueFound();
+
+  explicit dht_valueFound(object_ptr<dht_value> &&value_);
+
+  static const std::int32_t ID = -468912268;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_ValueResult> fetch(td::TlParser &p);
+
+  explicit dht_valueFound(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_config_global final : public Object {
+ public:
+  object_ptr<dht_nodes> static_nodes_;
+  std::int32_t k_;
+  std::int32_t a_;
+
+  dht_config_global();
+
+  dht_config_global(object_ptr<dht_nodes> &&static_nodes_, std::int32_t k_, std::int32_t a_);
+
+  static const std::int32_t ID = -2066822649;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_config_global> fetch(td::TlParser &p);
+
+  explicit dht_config_global(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_config_Local: public Object {
+ public:
+
+  static object_ptr<dht_config_Local> fetch(td::TlParser &p);
+};
+
+class dht_config_local final : public dht_config_Local {
+ public:
+  object_ptr<adnl_id_short> id_;
+
+  dht_config_local();
+
+  explicit dht_config_local(object_ptr<adnl_id_short> &&id_);
+
+  static const std::int32_t ID = 1981827695;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_config_Local> fetch(td::TlParser &p);
+
+  explicit dht_config_local(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_config_random_local final : public dht_config_Local {
+ public:
+  std::int32_t cnt_;
+
+  dht_config_random_local();
+
+  explicit dht_config_random_local(std::int32_t cnt_);
+
+  static const std::int32_t ID = -1679088265;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_config_Local> fetch(td::TlParser &p);
+
+  explicit dht_config_random_local(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_db_bucket final : public Object {
+ public:
+  object_ptr<dht_nodes> nodes_;
+
+  dht_db_bucket();
+
+  explicit dht_db_bucket(object_ptr<dht_nodes> &&nodes_);
+
+  static const std::int32_t ID = -1281557908;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_db_bucket> fetch(td::TlParser &p);
+
+  explicit dht_db_bucket(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dht_db_key_bucket final : public Object {
+ public:
+  std::int32_t id_;
+
+  dht_db_key_bucket();
+
+  explicit dht_db_key_bucket(std::int32_t id_);
+
+  static const std::int32_t ID = -1553420724;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dht_db_key_bucket> fetch(td::TlParser &p);
+
+  explicit dht_db_key_bucket(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class dummyworkchain0_config_global final : public Object {
+ public:
+  td::Bits256 zero_state_hash_;
+
+  dummyworkchain0_config_global();
+
+  explicit dummyworkchain0_config_global(td::Bits256 const &zero_state_hash_);
+
+  static const std::int32_t ID = -631148845;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<dummyworkchain0_config_global> fetch(td::TlParser &p);
+
+  explicit dummyworkchain0_config_global(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_Addr: public Object {
+ public:
+
+  static object_ptr<engine_Addr> fetch(td::TlParser &p);
+};
+
+class engine_addr final : public engine_Addr {
+ public:
+  std::int32_t ip_;
+  std::int32_t port_;
+  std::vector<std::int32_t> categories_;
+  std::vector<std::int32_t> priority_categories_;
+
+  engine_addr();
+
+  engine_addr(std::int32_t ip_, std::int32_t port_, std::vector<std::int32_t> &&categories_, std::vector<std::int32_t> &&priority_categories_);
+
+  static const std::int32_t ID = -281993236;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_Addr> fetch(td::TlParser &p);
+
+  explicit engine_addr(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_addrProxy final : public engine_Addr {
+ public:
+  std::int32_t in_ip_;
+  std::int32_t in_port_;
+  std::int32_t out_ip_;
+  std::int32_t out_port_;
+  object_ptr<adnl_Proxy> proxy_type_;
+  std::vector<std::int32_t> categories_;
+  std::vector<std::int32_t> priority_categories_;
+
+  engine_addrProxy();
+
+  engine_addrProxy(std::int32_t in_ip_, std::int32_t in_port_, std::int32_t out_ip_, std::int32_t out_port_, object_ptr<adnl_Proxy> &&proxy_type_, std::vector<std::int32_t> &&categories_, std::vector<std::int32_t> &&priority_categories_);
+
+  static const std::int32_t ID = -1965071031;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_Addr> fetch(td::TlParser &p);
+
+  explicit engine_addrProxy(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_adnl final : public Object {
+ public:
+  td::Bits256 id_;
+  std::int32_t category_;
+
+  engine_adnl();
+
+  engine_adnl(td::Bits256 const &id_, std::int32_t category_);
+
+  static const std::int32_t ID = 1658283344;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_adnl> fetch(td::TlParser &p);
+
+  explicit engine_adnl(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_controlInterface final : public Object {
+ public:
+  td::Bits256 id_;
+  std::int32_t port_;
+  std::vector<object_ptr<engine_controlProcess>> allowed_;
+
+  engine_controlInterface();
+
+  engine_controlInterface(td::Bits256 const &id_, std::int32_t port_, std::vector<object_ptr<engine_controlProcess>> &&allowed_);
+
+  static const std::int32_t ID = 830566315;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_controlInterface> fetch(td::TlParser &p);
+
+  explicit engine_controlInterface(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_controlProcess final : public Object {
+ public:
+  td::Bits256 id_;
+  std::int32_t permissions_;
+
+  engine_controlProcess();
+
+  engine_controlProcess(td::Bits256 const &id_, std::int32_t permissions_);
+
+  static const std::int32_t ID = 1790986263;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_controlProcess> fetch(td::TlParser &p);
+
+  explicit engine_controlProcess(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_dht final : public Object {
+ public:
+  td::Bits256 id_;
+
+  engine_dht();
+
+  explicit engine_dht(td::Bits256 const &id_);
+
+  static const std::int32_t ID = 1575613178;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_dht> fetch(td::TlParser &p);
+
+  explicit engine_dht(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_gc final : public Object {
+ public:
+  std::vector<td::Bits256> ids_;
+
+  engine_gc();
+
+  explicit engine_gc(std::vector<td::Bits256> &&ids_);
+
+  static const std::int32_t ID = -1078093701;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_gc> fetch(td::TlParser &p);
+
+  explicit engine_gc(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_liteServer final : public Object {
+ public:
+  td::Bits256 id_;
+  std::int32_t port_;
+
+  engine_liteServer();
+
+  engine_liteServer(td::Bits256 const &id_, std::int32_t port_);
+
+  static const std::int32_t ID = -1150251266;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_liteServer> fetch(td::TlParser &p);
+
+  explicit engine_liteServer(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validator final : public Object {
+ public:
+  td::Bits256 id_;
+  std::vector<object_ptr<engine_validatorTempKey>> temp_keys_;
+  std::vector<object_ptr<engine_validatorAdnlAddress>> adnl_addrs_;
+  std::int32_t election_date_;
+  std::int32_t expire_at_;
+
+  engine_validator();
+
+  engine_validator(td::Bits256 const &id_, std::vector<object_ptr<engine_validatorTempKey>> &&temp_keys_, std::vector<object_ptr<engine_validatorAdnlAddress>> &&adnl_addrs_, std::int32_t election_date_, std::int32_t expire_at_);
+
+  static const std::int32_t ID = -2006980055;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validator> fetch(td::TlParser &p);
+
+  explicit engine_validator(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validatorAdnlAddress final : public Object {
+ public:
+  td::Bits256 id_;
+  std::int32_t expire_at_;
+
+  engine_validatorAdnlAddress();
+
+  engine_validatorAdnlAddress(td::Bits256 const &id_, std::int32_t expire_at_);
+
+  static const std::int32_t ID = -750434882;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validatorAdnlAddress> fetch(td::TlParser &p);
+
+  explicit engine_validatorAdnlAddress(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validatorTempKey final : public Object {
+ public:
+  td::Bits256 key_;
+  std::int32_t expire_at_;
+
+  engine_validatorTempKey();
+
+  engine_validatorTempKey(td::Bits256 const &key_, std::int32_t expire_at_);
+
+  static const std::int32_t ID = 1581962974;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validatorTempKey> fetch(td::TlParser &p);
+
+  explicit engine_validatorTempKey(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_adnlProxy_config final : public Object {
+ public:
+  std::vector<object_ptr<engine_adnlProxy_port>> ports_;
+
+  engine_adnlProxy_config();
+
+  explicit engine_adnlProxy_config(std::vector<object_ptr<engine_adnlProxy_port>> &&ports_);
+
+  static const std::int32_t ID = 1848000769;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_adnlProxy_config> fetch(td::TlParser &p);
+
+  explicit engine_adnlProxy_config(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_adnlProxy_port final : public Object {
+ public:
+  std::int32_t in_port_;
+  std::int32_t out_port_;
+  std::int32_t dst_ip_;
+  std::int32_t dst_port_;
+  object_ptr<adnl_Proxy> proxy_type_;
+
+  engine_adnlProxy_port();
+
+  engine_adnlProxy_port(std::int32_t in_port_, std::int32_t out_port_, std::int32_t dst_ip_, std::int32_t dst_port_, object_ptr<adnl_Proxy> &&proxy_type_);
+
+  static const std::int32_t ID = -117344950;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_adnlProxy_port> fetch(td::TlParser &p);
+
+  explicit engine_adnlProxy_port(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_dht_config final : public Object {
+ public:
+  std::vector<object_ptr<engine_dht>> dht_;
+  object_ptr<engine_gc> gc_;
+
+  engine_dht_config();
+
+  engine_dht_config(std::vector<object_ptr<engine_dht>> &&dht_, object_ptr<engine_gc> &&gc_);
+
+  static const std::int32_t ID = -197295930;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_dht_config> fetch(td::TlParser &p);
+
+  explicit engine_dht_config(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validator_config final : public Object {
+ public:
+  std::int32_t out_port_;
+  std::vector<object_ptr<engine_Addr>> addrs_;
+  std::vector<object_ptr<engine_adnl>> adnl_;
+  std::vector<object_ptr<engine_dht>> dht_;
+  std::vector<object_ptr<engine_validator>> validators_;
+  td::Bits256 fullnode_;
+  std::vector<object_ptr<engine_liteServer>> liteservers_;
+  std::vector<object_ptr<engine_controlInterface>> control_;
+  object_ptr<engine_gc> gc_;
+
+  engine_validator_config();
+
+  engine_validator_config(std::int32_t out_port_, std::vector<object_ptr<engine_Addr>> &&addrs_, std::vector<object_ptr<engine_adnl>> &&adnl_, std::vector<object_ptr<engine_dht>> &&dht_, std::vector<object_ptr<engine_validator>> &&validators_, td::Bits256 const &fullnode_, std::vector<object_ptr<engine_liteServer>> &&liteservers_, std::vector<object_ptr<engine_controlInterface>> &&control_, object_ptr<engine_gc> &&gc_);
+
+  static const std::int32_t ID = -1061804008;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validator_config> fetch(td::TlParser &p);
+
+  explicit engine_validator_config(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validator_controlQueryError final : public Object {
+ public:
+  std::int32_t code_;
+  std::string message_;
+
+  engine_validator_controlQueryError();
+
+  engine_validator_controlQueryError(std::int32_t code_, std::string const &message_);
+
+  static const std::int32_t ID = 1999018527;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validator_controlQueryError> fetch(td::TlParser &p);
+
+  explicit engine_validator_controlQueryError(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validator_dhtServerStatus final : public Object {
+ public:
+  td::Bits256 id_;
+  std::int32_t status_;
+
+  engine_validator_dhtServerStatus();
+
+  engine_validator_dhtServerStatus(td::Bits256 const &id_, std::int32_t status_);
+
+  static const std::int32_t ID = -1323440290;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validator_dhtServerStatus> fetch(td::TlParser &p);
+
+  explicit engine_validator_dhtServerStatus(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validator_dhtServersStatus final : public Object {
+ public:
+  std::vector<object_ptr<engine_validator_dhtServerStatus>> servers_;
+
+  engine_validator_dhtServersStatus();
+
+  explicit engine_validator_dhtServersStatus(std::vector<object_ptr<engine_validator_dhtServerStatus>> &&servers_);
+
+  static const std::int32_t ID = 725155112;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validator_dhtServersStatus> fetch(td::TlParser &p);
+
+  explicit engine_validator_dhtServersStatus(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validator_electionBid final : public Object {
+ public:
+  std::int32_t election_date_;
+  td::Bits256 perm_key_;
+  td::Bits256 adnl_addr_;
+  td::BufferSlice to_send_payload_;
+
+  engine_validator_electionBid();
+
+  engine_validator_electionBid(std::int32_t election_date_, td::Bits256 const &perm_key_, td::Bits256 const &adnl_addr_, td::BufferSlice &&to_send_payload_);
+
+  static const std::int32_t ID = 598899261;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validator_electionBid> fetch(td::TlParser &p);
+
+  explicit engine_validator_electionBid(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validator_groupMember final : public Object {
+ public:
+  td::Bits256 public_key_hash_;
+  td::Bits256 adnl_;
+  std::int64_t weight_;
+
+  validator_groupMember();
+
+  validator_groupMember(td::Bits256 const &public_key_hash_, td::Bits256 const &adnl_, std::int64_t weight_);
+
+  static const std::int32_t ID = -1953208860;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validator_groupMember> fetch(td::TlParser &p);
+
+  explicit validator_groupMember(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validator_jsonConfig final : public Object {
+ public:
+  std::string data_;
+
+  engine_validator_jsonConfig();
+
+  explicit engine_validator_jsonConfig(std::string const &data_);
+
+  static const std::int32_t ID = 321753611;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validator_jsonConfig> fetch(td::TlParser &p);
+
+  explicit engine_validator_jsonConfig(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validator_keyHash final : public Object {
+ public:
+  td::Bits256 key_hash_;
+
+  engine_validator_keyHash();
+
+  explicit engine_validator_keyHash(td::Bits256 const &key_hash_);
+
+  static const std::int32_t ID = -1027168946;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validator_keyHash> fetch(td::TlParser &p);
+
+  explicit engine_validator_keyHash(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validator_oneStat final : public Object {
+ public:
+  std::string key_;
+  std::string value_;
+
+  engine_validator_oneStat();
+
+  engine_validator_oneStat(std::string const &key_, std::string const &value_);
+
+  static const std::int32_t ID = -1533527315;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validator_oneStat> fetch(td::TlParser &p);
+
+  explicit engine_validator_oneStat(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validator_signature final : public Object {
+ public:
+  td::BufferSlice signature_;
+
+  engine_validator_signature();
+
+  explicit engine_validator_signature(td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = -76791000;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validator_signature> fetch(td::TlParser &p);
+
+  explicit engine_validator_signature(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validator_stats final : public Object {
+ public:
+  std::vector<object_ptr<engine_validator_oneStat>> stats_;
+
+  engine_validator_stats();
+
+  explicit engine_validator_stats(std::vector<object_ptr<engine_validator_oneStat>> &&stats_);
+
+  static const std::int32_t ID = 1565119343;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validator_stats> fetch(td::TlParser &p);
+
+  explicit engine_validator_stats(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validator_success final : public Object {
+ public:
+
+  engine_validator_success();
+
+  static const std::int32_t ID = -1276860789;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validator_success> fetch(td::TlParser &p);
+
+  explicit engine_validator_success(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class engine_validator_time final : public Object {
+ public:
+  std::int32_t time_;
+
+  engine_validator_time();
+
+  explicit engine_validator_time(std::int32_t time_);
+
+  static const std::int32_t ID = -547380738;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<engine_validator_time> fetch(td::TlParser &p);
+
+  explicit engine_validator_time(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class fec_Type: public Object {
+ public:
+
+  static object_ptr<fec_Type> fetch(td::TlParser &p);
+};
+
+class fec_raptorQ final : public fec_Type {
+ public:
+  std::int32_t data_size_;
+  std::int32_t symbol_size_;
+  std::int32_t symbols_count_;
+
+  fec_raptorQ();
+
+  fec_raptorQ(std::int32_t data_size_, std::int32_t symbol_size_, std::int32_t symbols_count_);
+
+  static const std::int32_t ID = -1953257504;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<fec_Type> fetch(td::TlParser &p);
+
+  explicit fec_raptorQ(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class fec_roundRobin final : public fec_Type {
+ public:
+  std::int32_t data_size_;
+  std::int32_t symbol_size_;
+  std::int32_t symbols_count_;
+
+  fec_roundRobin();
+
+  fec_roundRobin(std::int32_t data_size_, std::int32_t symbol_size_, std::int32_t symbols_count_);
+
+  static const std::int32_t ID = 854927588;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<fec_Type> fetch(td::TlParser &p);
+
+  explicit fec_roundRobin(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class fec_online final : public fec_Type {
+ public:
+  std::int32_t data_size_;
+  std::int32_t symbol_size_;
+  std::int32_t symbols_count_;
+
+  fec_online();
+
+  fec_online(std::int32_t data_size_, std::int32_t symbol_size_, std::int32_t symbols_count_);
+
+  static const std::int32_t ID = 19359244;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<fec_Type> fetch(td::TlParser &p);
+
+  explicit fec_online(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class id_config_local final : public Object {
+ public:
+  object_ptr<PrivateKey> id_;
+
+  id_config_local();
+
+  explicit id_config_local(object_ptr<PrivateKey> &&id_);
+
+  static const std::int32_t ID = -1834367090;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<id_config_local> fetch(td::TlParser &p);
+
+  explicit id_config_local(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteclient_config_global final : public Object {
+ public:
+  std::vector<object_ptr<liteserver_desc>> liteservers_;
+  object_ptr<validator_config_global> validator_;
+
+  liteclient_config_global();
+
+  liteclient_config_global(std::vector<object_ptr<liteserver_desc>> &&liteservers_, object_ptr<validator_config_global> &&validator_);
+
+  static const std::int32_t ID = 143507704;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteclient_config_global> fetch(td::TlParser &p);
+
+  explicit liteclient_config_global(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteserver_desc final : public Object {
+ public:
+  object_ptr<PublicKey> id_;
+  std::int32_t ip_;
+  std::int32_t port_;
+
+  liteserver_desc();
+
+  liteserver_desc(object_ptr<PublicKey> &&id_, std::int32_t ip_, std::int32_t port_);
+
+  static const std::int32_t ID = -1001806732;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteserver_desc> fetch(td::TlParser &p);
+
+  explicit liteserver_desc(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteserver_config_Local: public Object {
+ public:
+
+  static object_ptr<liteserver_config_Local> fetch(td::TlParser &p);
+};
+
+class liteserver_config_local final : public liteserver_config_Local {
+ public:
+  object_ptr<PrivateKey> id_;
+  std::int32_t port_;
+
+  liteserver_config_local();
+
+  liteserver_config_local(object_ptr<PrivateKey> &&id_, std::int32_t port_);
+
+  static const std::int32_t ID = 1182002063;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteserver_config_Local> fetch(td::TlParser &p);
+
+  explicit liteserver_config_local(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class liteserver_config_random_local final : public liteserver_config_Local {
+ public:
+  std::int32_t port_;
+
+  liteserver_config_random_local();
+
+  explicit liteserver_config_random_local(std::int32_t port_);
+
+  static const std::int32_t ID = 2093565243;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<liteserver_config_Local> fetch(td::TlParser &p);
+
+  explicit liteserver_config_random_local(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_Broadcast: public Object {
+ public:
+
+  static object_ptr<overlay_Broadcast> fetch(td::TlParser &p);
+};
+
+class overlay_fec_received final : public overlay_Broadcast {
+ public:
+  td::Bits256 hash_;
+
+  overlay_fec_received();
+
+  explicit overlay_fec_received(td::Bits256 const &hash_);
+
+  static const std::int32_t ID = -715385620;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_Broadcast> fetch(td::TlParser &p);
+
+  explicit overlay_fec_received(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_fec_completed final : public overlay_Broadcast {
+ public:
+  td::Bits256 hash_;
+
+  overlay_fec_completed();
+
+  explicit overlay_fec_completed(td::Bits256 const &hash_);
+
+  static const std::int32_t ID = 165112084;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_Broadcast> fetch(td::TlParser &p);
+
+  explicit overlay_fec_completed(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_unicast final : public overlay_Broadcast {
+ public:
+  td::BufferSlice data_;
+
+  overlay_unicast();
+
+  explicit overlay_unicast(td::BufferSlice &&data_);
+
+  static const std::int32_t ID = 861097508;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_Broadcast> fetch(td::TlParser &p);
+
+  explicit overlay_unicast(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_broadcast final : public overlay_Broadcast {
+ public:
+  object_ptr<PublicKey> src_;
+  object_ptr<overlay_Certificate> certificate_;
+  std::int32_t flags_;
+  td::BufferSlice data_;
+  std::int32_t date_;
+  td::BufferSlice signature_;
+
+  overlay_broadcast();
+
+  overlay_broadcast(object_ptr<PublicKey> &&src_, object_ptr<overlay_Certificate> &&certificate_, std::int32_t flags_, td::BufferSlice &&data_, std::int32_t date_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = -1319490709;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_Broadcast> fetch(td::TlParser &p);
+
+  explicit overlay_broadcast(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_broadcastFec final : public overlay_Broadcast {
+ public:
+  object_ptr<PublicKey> src_;
+  object_ptr<overlay_Certificate> certificate_;
+  td::Bits256 data_hash_;
+  std::int32_t data_size_;
+  std::int32_t flags_;
+  td::BufferSlice data_;
+  std::int32_t seqno_;
+  object_ptr<fec_Type> fec_;
+  std::int32_t date_;
+  td::BufferSlice signature_;
+
+  overlay_broadcastFec();
+
+  overlay_broadcastFec(object_ptr<PublicKey> &&src_, object_ptr<overlay_Certificate> &&certificate_, td::Bits256 const &data_hash_, std::int32_t data_size_, std::int32_t flags_, td::BufferSlice &&data_, std::int32_t seqno_, object_ptr<fec_Type> &&fec_, std::int32_t date_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = -1160264854;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_Broadcast> fetch(td::TlParser &p);
+
+  explicit overlay_broadcastFec(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_broadcastFecShort final : public overlay_Broadcast {
+ public:
+  object_ptr<PublicKey> src_;
+  object_ptr<overlay_Certificate> certificate_;
+  td::Bits256 broadcast_hash_;
+  td::Bits256 part_data_hash_;
+  std::int32_t seqno_;
+  td::BufferSlice signature_;
+
+  overlay_broadcastFecShort();
+
+  overlay_broadcastFecShort(object_ptr<PublicKey> &&src_, object_ptr<overlay_Certificate> &&certificate_, td::Bits256 const &broadcast_hash_, td::Bits256 const &part_data_hash_, std::int32_t seqno_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = -242740414;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_Broadcast> fetch(td::TlParser &p);
+
+  explicit overlay_broadcastFecShort(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_broadcastNotFound final : public overlay_Broadcast {
+ public:
+
+  overlay_broadcastNotFound();
+
+  static const std::int32_t ID = -1786366428;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_Broadcast> fetch(td::TlParser &p);
+
+  explicit overlay_broadcastNotFound(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_broadcastList final : public Object {
+ public:
+  std::vector<td::Bits256> hashes_;
+
+  overlay_broadcastList();
+
+  explicit overlay_broadcastList(std::vector<td::Bits256> &&hashes_);
+
+  static const std::int32_t ID = 416407263;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_broadcastList> fetch(td::TlParser &p);
+
+  explicit overlay_broadcastList(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_Certificate: public Object {
+ public:
+
+  static object_ptr<overlay_Certificate> fetch(td::TlParser &p);
+};
+
+class overlay_certificate final : public overlay_Certificate {
+ public:
+  object_ptr<PublicKey> issued_by_;
+  std::int32_t expire_at_;
+  std::int32_t max_size_;
+  td::BufferSlice signature_;
+
+  overlay_certificate();
+
+  overlay_certificate(object_ptr<PublicKey> &&issued_by_, std::int32_t expire_at_, std::int32_t max_size_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = -526461135;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_Certificate> fetch(td::TlParser &p);
+
+  explicit overlay_certificate(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_emptyCertificate final : public overlay_Certificate {
+ public:
+
+  overlay_emptyCertificate();
+
+  static const std::int32_t ID = 853195983;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_Certificate> fetch(td::TlParser &p);
+
+  explicit overlay_emptyCertificate(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_certificateId final : public Object {
+ public:
+  td::Bits256 overlay_id_;
+  td::Bits256 node_;
+  std::int32_t expire_at_;
+  std::int32_t max_size_;
+
+  overlay_certificateId();
+
+  overlay_certificateId(td::Bits256 const &overlay_id_, td::Bits256 const &node_, std::int32_t expire_at_, std::int32_t max_size_);
+
+  static const std::int32_t ID = -1884397383;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_certificateId> fetch(td::TlParser &p);
+
+  explicit overlay_certificateId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_message final : public Object {
+ public:
+  td::Bits256 overlay_;
+
+  overlay_message();
+
+  explicit overlay_message(td::Bits256 const &overlay_);
+
+  static const std::int32_t ID = 1965368352;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_message> fetch(td::TlParser &p);
+
+  explicit overlay_message(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_node final : public Object {
+ public:
+  object_ptr<PublicKey> id_;
+  td::Bits256 overlay_;
+  std::int32_t version_;
+  td::BufferSlice signature_;
+
+  overlay_node();
+
+  overlay_node(object_ptr<PublicKey> &&id_, td::Bits256 const &overlay_, std::int32_t version_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = -1200911741;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_node> fetch(td::TlParser &p);
+
+  explicit overlay_node(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_nodes final : public Object {
+ public:
+  std::vector<object_ptr<overlay_node>> nodes_;
+
+  overlay_nodes();
+
+  explicit overlay_nodes(std::vector<object_ptr<overlay_node>> &&nodes_);
+
+  static const std::int32_t ID = -460904178;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_nodes> fetch(td::TlParser &p);
+
+  explicit overlay_nodes(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_broadcast_id final : public Object {
+ public:
+  td::Bits256 src_;
+  td::Bits256 data_hash_;
+  std::int32_t flags_;
+
+  overlay_broadcast_id();
+
+  overlay_broadcast_id(td::Bits256 const &src_, td::Bits256 const &data_hash_, std::int32_t flags_);
+
+  static const std::int32_t ID = 1375565978;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_broadcast_id> fetch(td::TlParser &p);
+
+  explicit overlay_broadcast_id(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_broadcast_toSign final : public Object {
+ public:
+  td::Bits256 hash_;
+  std::int32_t date_;
+
+  overlay_broadcast_toSign();
+
+  overlay_broadcast_toSign(td::Bits256 const &hash_, std::int32_t date_);
+
+  static const std::int32_t ID = -97038724;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_broadcast_toSign> fetch(td::TlParser &p);
+
+  explicit overlay_broadcast_toSign(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_broadcastFec_id final : public Object {
+ public:
+  td::Bits256 src_;
+  td::Bits256 type_;
+  td::Bits256 data_hash_;
+  std::int32_t size_;
+  std::int32_t flags_;
+
+  overlay_broadcastFec_id();
+
+  overlay_broadcastFec_id(td::Bits256 const &src_, td::Bits256 const &type_, td::Bits256 const &data_hash_, std::int32_t size_, std::int32_t flags_);
+
+  static const std::int32_t ID = -80652890;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_broadcastFec_id> fetch(td::TlParser &p);
+
+  explicit overlay_broadcastFec_id(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_broadcastFec_partId final : public Object {
+ public:
+  td::Bits256 broadcast_hash_;
+  td::Bits256 data_hash_;
+  std::int32_t seqno_;
+
+  overlay_broadcastFec_partId();
+
+  overlay_broadcastFec_partId(td::Bits256 const &broadcast_hash_, td::Bits256 const &data_hash_, std::int32_t seqno_);
+
+  static const std::int32_t ID = -1536597296;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_broadcastFec_partId> fetch(td::TlParser &p);
+
+  explicit overlay_broadcastFec_partId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_db_key_nodes final : public Object {
+ public:
+  td::Bits256 local_id_;
+  td::Bits256 overlay_;
+
+  overlay_db_key_nodes();
+
+  overlay_db_key_nodes(td::Bits256 const &local_id_, td::Bits256 const &overlay_);
+
+  static const std::int32_t ID = -992972010;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_db_key_nodes> fetch(td::TlParser &p);
+
+  explicit overlay_db_key_nodes(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_db_nodes final : public Object {
+ public:
+  object_ptr<overlay_nodes> nodes_;
+
+  overlay_db_nodes();
+
+  explicit overlay_db_nodes(object_ptr<overlay_nodes> &&nodes_);
+
+  static const std::int32_t ID = -712454630;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_db_nodes> fetch(td::TlParser &p);
+
+  explicit overlay_db_nodes(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class overlay_node_toSign final : public Object {
+ public:
+  object_ptr<adnl_id_short> id_;
+  td::Bits256 overlay_;
+  std::int32_t version_;
+
+  overlay_node_toSign();
+
+  overlay_node_toSign(object_ptr<adnl_id_short> &&id_, td::Bits256 const &overlay_, std::int32_t version_);
+
+  static const std::int32_t ID = 64530657;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<overlay_node_toSign> fetch(td::TlParser &p);
+
+  explicit overlay_node_toSign(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class rldp_Message: public Object {
+ public:
+
+  static object_ptr<rldp_Message> fetch(td::TlParser &p);
+};
+
+class rldp_message final : public rldp_Message {
+ public:
+  td::Bits256 id_;
+  td::BufferSlice data_;
+
+  rldp_message();
+
+  rldp_message(td::Bits256 const &id_, td::BufferSlice &&data_);
+
+  static const std::int32_t ID = 2098973982;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<rldp_Message> fetch(td::TlParser &p);
+
+  explicit rldp_message(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class rldp_query final : public rldp_Message {
+ public:
+  td::Bits256 query_id_;
+  std::int64_t max_answer_size_;
+  std::int32_t timeout_;
+  td::BufferSlice data_;
+
+  rldp_query();
+
+  rldp_query(td::Bits256 const &query_id_, std::int64_t max_answer_size_, std::int32_t timeout_, td::BufferSlice &&data_);
+
+  static const std::int32_t ID = -1971761815;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<rldp_Message> fetch(td::TlParser &p);
+
+  explicit rldp_query(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class rldp_answer final : public rldp_Message {
+ public:
+  td::Bits256 query_id_;
+  td::BufferSlice data_;
+
+  rldp_answer();
+
+  rldp_answer(td::Bits256 const &query_id_, td::BufferSlice &&data_);
+
+  static const std::int32_t ID = -1543742461;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<rldp_Message> fetch(td::TlParser &p);
+
+  explicit rldp_answer(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class rldp_MessagePart: public Object {
+ public:
+
+  static object_ptr<rldp_MessagePart> fetch(td::TlParser &p);
+};
+
+class rldp_messagePart final : public rldp_MessagePart {
+ public:
+  td::Bits256 transfer_id_;
+  object_ptr<fec_Type> fec_type_;
+  std::int32_t part_;
+  std::int64_t total_size_;
+  std::int32_t seqno_;
+  td::BufferSlice data_;
+
+  rldp_messagePart();
+
+  rldp_messagePart(td::Bits256 const &transfer_id_, object_ptr<fec_Type> &&fec_type_, std::int32_t part_, std::int64_t total_size_, std::int32_t seqno_, td::BufferSlice &&data_);
+
+  static const std::int32_t ID = 408691404;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<rldp_MessagePart> fetch(td::TlParser &p);
+
+  explicit rldp_messagePart(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class rldp_confirm final : public rldp_MessagePart {
+ public:
+  td::Bits256 transfer_id_;
+  std::int32_t part_;
+  std::int32_t seqno_;
+
+  rldp_confirm();
+
+  rldp_confirm(td::Bits256 const &transfer_id_, std::int32_t part_, std::int32_t seqno_);
+
+  static const std::int32_t ID = -175973288;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<rldp_MessagePart> fetch(td::TlParser &p);
+
+  explicit rldp_confirm(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class rldp_complete final : public rldp_MessagePart {
+ public:
+  td::Bits256 transfer_id_;
+  std::int32_t part_;
+
+  rldp_complete();
+
+  rldp_complete(td::Bits256 const &transfer_id_, std::int32_t part_);
+
+  static const std::int32_t ID = -1140018497;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<rldp_MessagePart> fetch(td::TlParser &p);
+
+  explicit rldp_complete(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tcp_Message: public Object {
+ public:
+
+  static object_ptr<tcp_Message> fetch(td::TlParser &p);
+};
+
+class tcp_authentificate final : public tcp_Message {
+ public:
+  td::BufferSlice nonce_;
+
+  tcp_authentificate();
+
+  explicit tcp_authentificate(td::BufferSlice &&nonce_);
+
+  static const std::int32_t ID = 1146858258;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tcp_Message> fetch(td::TlParser &p);
+
+  explicit tcp_authentificate(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tcp_authentificationNonce final : public tcp_Message {
+ public:
+  td::BufferSlice nonce_;
+
+  tcp_authentificationNonce();
+
+  explicit tcp_authentificationNonce(td::BufferSlice &&nonce_);
+
+  static const std::int32_t ID = -480425290;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tcp_Message> fetch(td::TlParser &p);
+
+  explicit tcp_authentificationNonce(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tcp_authentificationComplete final : public tcp_Message {
+ public:
+  object_ptr<PublicKey> key_;
+  td::BufferSlice signature_;
+
+  tcp_authentificationComplete();
+
+  tcp_authentificationComplete(object_ptr<PublicKey> &&key_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = -139616602;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tcp_Message> fetch(td::TlParser &p);
+
+  explicit tcp_authentificationComplete(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tcp_pong final : public Object {
+ public:
+  std::int64_t random_id_;
+
+  tcp_pong();
+
+  explicit tcp_pong(std::int64_t random_id_);
+
+  static const std::int32_t ID = -597034237;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tcp_pong> fetch(td::TlParser &p);
+
+  explicit tcp_pong(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class ton_BlockId: public Object {
+ public:
+
+  static object_ptr<ton_BlockId> fetch(td::TlParser &p);
+};
+
+class ton_blockId final : public ton_BlockId {
+ public:
+  td::Bits256 root_cell_hash_;
+  td::Bits256 file_hash_;
+
+  ton_blockId();
+
+  ton_blockId(td::Bits256 const &root_cell_hash_, td::Bits256 const &file_hash_);
+
+  static const std::int32_t ID = -989106576;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<ton_BlockId> fetch(td::TlParser &p);
+
+  explicit ton_blockId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class ton_blockIdApprove final : public ton_BlockId {
+ public:
+  td::Bits256 root_cell_hash_;
+  td::Bits256 file_hash_;
+
+  ton_blockIdApprove();
+
+  ton_blockIdApprove(td::Bits256 const &root_cell_hash_, td::Bits256 const &file_hash_);
+
+  static const std::int32_t ID = 768887369;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<ton_BlockId> fetch(td::TlParser &p);
+
+  explicit ton_blockIdApprove(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_BlockDescription: public Object {
+ public:
+
+  static object_ptr<tonNode_BlockDescription> fetch(td::TlParser &p);
+};
+
+class tonNode_blockDescriptionEmpty final : public tonNode_BlockDescription {
+ public:
+
+  tonNode_blockDescriptionEmpty();
+
+  static const std::int32_t ID = -2088456555;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_BlockDescription> fetch(td::TlParser &p);
+
+  explicit tonNode_blockDescriptionEmpty(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_blockDescription final : public tonNode_BlockDescription {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+
+  tonNode_blockDescription();
+
+  explicit tonNode_blockDescription(object_ptr<tonNode_blockIdExt> &&id_);
+
+  static const std::int32_t ID = 1185009800;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_BlockDescription> fetch(td::TlParser &p);
+
+  explicit tonNode_blockDescription(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_blockId final : public Object {
+ public:
+  std::int32_t workchain_;
+  std::int64_t shard_;
+  std::int32_t seqno_;
+
+  tonNode_blockId();
+
+  tonNode_blockId(std::int32_t workchain_, std::int64_t shard_, std::int32_t seqno_);
+
+  static const std::int32_t ID = -1211256473;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_blockId> fetch(td::TlParser &p);
+
+  explicit tonNode_blockId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_blockIdExt final : public Object {
+ public:
+  std::int32_t workchain_;
+  std::int64_t shard_;
+  std::int32_t seqno_;
+  td::Bits256 root_hash_;
+  td::Bits256 file_hash_;
+
+  tonNode_blockIdExt();
+
+  tonNode_blockIdExt(std::int32_t workchain_, std::int64_t shard_, std::int32_t seqno_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_);
+
+  static const std::int32_t ID = 1733487480;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_blockIdExt> fetch(td::TlParser &p);
+
+  explicit tonNode_blockIdExt(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_blockSignature final : public Object {
+ public:
+  td::Bits256 who_;
+  td::BufferSlice signature_;
+
+  tonNode_blockSignature();
+
+  tonNode_blockSignature(td::Bits256 const &who_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = 1357921331;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_blockSignature> fetch(td::TlParser &p);
+
+  explicit tonNode_blockSignature(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_Broadcast: public Object {
+ public:
+
+  static object_ptr<tonNode_Broadcast> fetch(td::TlParser &p);
+};
+
+class tonNode_blockBroadcast final : public tonNode_Broadcast {
+ public:
+  object_ptr<tonNode_blockIdExt> id_;
+  std::int32_t catchain_seqno_;
+  std::int32_t validator_set_hash_;
+  std::vector<object_ptr<tonNode_blockSignature>> signatures_;
+  td::BufferSlice proof_;
+  td::BufferSlice data_;
+
+  tonNode_blockBroadcast();
+
+  tonNode_blockBroadcast(object_ptr<tonNode_blockIdExt> &&id_, std::int32_t catchain_seqno_, std::int32_t validator_set_hash_, std::vector<object_ptr<tonNode_blockSignature>> &&signatures_, td::BufferSlice &&proof_, td::BufferSlice &&data_);
+
+  static const std::int32_t ID = -1372712699;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_Broadcast> fetch(td::TlParser &p);
+
+  explicit tonNode_blockBroadcast(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_ihrMessageBroadcast final : public tonNode_Broadcast {
+ public:
+  object_ptr<tonNode_ihrMessage> message_;
+
+  tonNode_ihrMessageBroadcast();
+
+  explicit tonNode_ihrMessageBroadcast(object_ptr<tonNode_ihrMessage> &&message_);
+
+  static const std::int32_t ID = 1381868723;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_Broadcast> fetch(td::TlParser &p);
+
+  explicit tonNode_ihrMessageBroadcast(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_externalMessageBroadcast final : public tonNode_Broadcast {
+ public:
+  object_ptr<tonNode_externalMessage> message_;
+
+  tonNode_externalMessageBroadcast();
+
+  explicit tonNode_externalMessageBroadcast(object_ptr<tonNode_externalMessage> &&message_);
+
+  static const std::int32_t ID = 1025185895;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_Broadcast> fetch(td::TlParser &p);
+
+  explicit tonNode_externalMessageBroadcast(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_newShardBlockBroadcast final : public tonNode_Broadcast {
+ public:
+  object_ptr<tonNode_newShardBlock> block_;
+
+  tonNode_newShardBlockBroadcast();
+
+  explicit tonNode_newShardBlockBroadcast(object_ptr<tonNode_newShardBlock> &&block_);
+
+  static const std::int32_t ID = 183696060;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_Broadcast> fetch(td::TlParser &p);
+
+  explicit tonNode_newShardBlockBroadcast(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_data final : public Object {
+ public:
+  td::BufferSlice data_;
+
+  tonNode_data();
+
+  explicit tonNode_data(td::BufferSlice &&data_);
+
+  static const std::int32_t ID = 1443505284;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_data> fetch(td::TlParser &p);
+
+  explicit tonNode_data(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_externalMessage final : public Object {
+ public:
+  td::BufferSlice data_;
+
+  tonNode_externalMessage();
+
+  explicit tonNode_externalMessage(td::BufferSlice &&data_);
+
+  static const std::int32_t ID = -596270583;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_externalMessage> fetch(td::TlParser &p);
+
+  explicit tonNode_externalMessage(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_ihrMessage final : public Object {
+ public:
+  td::BufferSlice data_;
+
+  tonNode_ihrMessage();
+
+  explicit tonNode_ihrMessage(td::BufferSlice &&data_);
+
+  static const std::int32_t ID = 1161085703;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_ihrMessage> fetch(td::TlParser &p);
+
+  explicit tonNode_ihrMessage(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_keyBlocks final : public Object {
+ public:
+  std::vector<object_ptr<tonNode_blockIdExt>> blocks_;
+  bool incomplete_;
+  bool error_;
+
+  tonNode_keyBlocks();
+
+  tonNode_keyBlocks(std::vector<object_ptr<tonNode_blockIdExt>> &&blocks_, bool incomplete_, bool error_);
+
+  static const std::int32_t ID = 124144985;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_keyBlocks> fetch(td::TlParser &p);
+
+  explicit tonNode_keyBlocks(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_newShardBlock final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+  std::int32_t cc_seqno_;
+  td::BufferSlice data_;
+
+  tonNode_newShardBlock();
+
+  tonNode_newShardBlock(object_ptr<tonNode_blockIdExt> &&block_, std::int32_t cc_seqno_, td::BufferSlice &&data_);
+
+  static const std::int32_t ID = -1533165015;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_newShardBlock> fetch(td::TlParser &p);
+
+  explicit tonNode_newShardBlock(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_Prepared: public Object {
+ public:
+
+  static object_ptr<tonNode_Prepared> fetch(td::TlParser &p);
+};
+
+class tonNode_prepared final : public tonNode_Prepared {
+ public:
+
+  tonNode_prepared();
+
+  static const std::int32_t ID = -356205619;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_Prepared> fetch(td::TlParser &p);
+
+  explicit tonNode_prepared(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_notFound final : public tonNode_Prepared {
+ public:
+
+  tonNode_notFound();
+
+  static const std::int32_t ID = -490521178;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_Prepared> fetch(td::TlParser &p);
+
+  explicit tonNode_notFound(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_PreparedProof: public Object {
+ public:
+
+  static object_ptr<tonNode_PreparedProof> fetch(td::TlParser &p);
+};
+
+class tonNode_preparedProofEmpty final : public tonNode_PreparedProof {
+ public:
+
+  tonNode_preparedProofEmpty();
+
+  static const std::int32_t ID = -949370502;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_PreparedProof> fetch(td::TlParser &p);
+
+  explicit tonNode_preparedProofEmpty(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_preparedProof final : public tonNode_PreparedProof {
+ public:
+
+  tonNode_preparedProof();
+
+  static const std::int32_t ID = -1986028981;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_PreparedProof> fetch(td::TlParser &p);
+
+  explicit tonNode_preparedProof(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_preparedProofLink final : public tonNode_PreparedProof {
+ public:
+
+  tonNode_preparedProofLink();
+
+  static const std::int32_t ID = 1040134797;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_PreparedProof> fetch(td::TlParser &p);
+
+  explicit tonNode_preparedProofLink(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_PreparedState: public Object {
+ public:
+
+  static object_ptr<tonNode_PreparedState> fetch(td::TlParser &p);
+};
+
+class tonNode_preparedState final : public tonNode_PreparedState {
+ public:
+
+  tonNode_preparedState();
+
+  static const std::int32_t ID = 928762733;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_PreparedState> fetch(td::TlParser &p);
+
+  explicit tonNode_preparedState(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_notFoundState final : public tonNode_PreparedState {
+ public:
+
+  tonNode_notFoundState();
+
+  static const std::int32_t ID = 842598993;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_PreparedState> fetch(td::TlParser &p);
+
+  explicit tonNode_notFoundState(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_sessionId final : public Object {
+ public:
+  std::int32_t workchain_;
+  std::int64_t shard_;
+  std::int32_t cc_seqno_;
+  td::Bits256 opts_hash_;
+
+  tonNode_sessionId();
+
+  tonNode_sessionId(std::int32_t workchain_, std::int64_t shard_, std::int32_t cc_seqno_, td::Bits256 const &opts_hash_);
+
+  static const std::int32_t ID = 2056402618;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_sessionId> fetch(td::TlParser &p);
+
+  explicit tonNode_sessionId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_shardPublicOverlayId final : public Object {
+ public:
+  std::int32_t workchain_;
+  std::int64_t shard_;
+  td::Bits256 zero_state_file_hash_;
+
+  tonNode_shardPublicOverlayId();
+
+  tonNode_shardPublicOverlayId(std::int32_t workchain_, std::int64_t shard_, td::Bits256 const &zero_state_file_hash_);
+
+  static const std::int32_t ID = 1302254377;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_shardPublicOverlayId> fetch(td::TlParser &p);
+
+  explicit tonNode_shardPublicOverlayId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class tonNode_zeroStateIdExt final : public Object {
+ public:
+  std::int32_t workchain_;
+  td::Bits256 root_hash_;
+  td::Bits256 file_hash_;
+
+  tonNode_zeroStateIdExt();
+
+  tonNode_zeroStateIdExt(std::int32_t workchain_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_);
+
+  static const std::int32_t ID = 494024110;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<tonNode_zeroStateIdExt> fetch(td::TlParser &p);
+
+  explicit tonNode_zeroStateIdExt(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validator_group final : public Object {
+ public:
+  std::int32_t workchain_;
+  std::int64_t shard_;
+  std::int32_t catchain_seqno_;
+  td::Bits256 config_hash_;
+  std::vector<object_ptr<validator_groupMember>> members_;
+
+  validator_group();
+
+  validator_group(std::int32_t workchain_, std::int64_t shard_, std::int32_t catchain_seqno_, td::Bits256 const &config_hash_, std::vector<object_ptr<validator_groupMember>> &&members_);
+
+  static const std::int32_t ID = -120029535;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validator_group> fetch(td::TlParser &p);
+
+  explicit validator_group(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validator_config_global final : public Object {
+ public:
+  object_ptr<tonNode_blockIdExt> zero_state_;
+  object_ptr<tonNode_blockIdExt> init_block_;
+  std::vector<object_ptr<tonNode_blockIdExt>> hardforks_;
+
+  validator_config_global();
+
+  validator_config_global(object_ptr<tonNode_blockIdExt> &&zero_state_, object_ptr<tonNode_blockIdExt> &&init_block_, std::vector<object_ptr<tonNode_blockIdExt>> &&hardforks_);
+
+  static const std::int32_t ID = -2038562966;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validator_config_global> fetch(td::TlParser &p);
+
+  explicit validator_config_global(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validator_config_Local: public Object {
+ public:
+
+  static object_ptr<validator_config_Local> fetch(td::TlParser &p);
+};
+
+class validator_config_local final : public validator_config_Local {
+ public:
+  object_ptr<adnl_id_short> id_;
+
+  validator_config_local();
+
+  explicit validator_config_local(object_ptr<adnl_id_short> &&id_);
+
+  static const std::int32_t ID = 1716256616;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validator_config_Local> fetch(td::TlParser &p);
+
+  explicit validator_config_local(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validator_config_random_local final : public validator_config_Local {
+ public:
+  object_ptr<adnl_addressList> addr_list_;
+
+  validator_config_random_local();
+
+  explicit validator_config_random_local(object_ptr<adnl_addressList> &&addr_list_);
+
+  static const std::int32_t ID = 1501795426;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validator_config_Local> fetch(td::TlParser &p);
+
+  explicit validator_config_random_local(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_blockUpdate final : public Object {
+ public:
+  std::int64_t ts_;
+  std::vector<object_ptr<validatorSession_round_Message>> actions_;
+  std::int32_t state_;
+
+  validatorSession_blockUpdate();
+
+  validatorSession_blockUpdate(std::int64_t ts_, std::vector<object_ptr<validatorSession_round_Message>> &&actions_, std::int32_t state_);
+
+  static const std::int32_t ID = -1836855753;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_blockUpdate> fetch(td::TlParser &p);
+
+  explicit validatorSession_blockUpdate(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_candidate final : public Object {
+ public:
+  td::Bits256 src_;
+  std::int32_t round_;
+  td::Bits256 root_hash_;
+  td::BufferSlice data_;
+  td::BufferSlice collated_data_;
+
+  validatorSession_candidate();
+
+  validatorSession_candidate(td::Bits256 const &src_, std::int32_t round_, td::Bits256 const &root_hash_, td::BufferSlice &&data_, td::BufferSlice &&collated_data_);
+
+  static const std::int32_t ID = 2100525125;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_candidate> fetch(td::TlParser &p);
+
+  explicit validatorSession_candidate(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_candidateId final : public Object {
+ public:
+  td::Bits256 src_;
+  td::Bits256 root_hash_;
+  td::Bits256 file_hash_;
+  td::Bits256 collated_data_file_hash_;
+
+  validatorSession_candidateId();
+
+  validatorSession_candidateId(td::Bits256 const &src_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_, td::Bits256 const &collated_data_file_hash_);
+
+  static const std::int32_t ID = 436135276;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_candidateId> fetch(td::TlParser &p);
+
+  explicit validatorSession_candidateId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_config final : public Object {
+ public:
+  double catchain_idle_timeout_;
+  std::int32_t catchain_max_deps_;
+  std::int32_t round_candidates_;
+  double next_candidate_delay_;
+  std::int32_t round_attempt_duration_;
+  std::int32_t max_round_attempts_;
+  std::int32_t max_block_size_;
+  std::int32_t max_collated_data_size_;
+
+  validatorSession_config();
+
+  validatorSession_config(double catchain_idle_timeout_, std::int32_t catchain_max_deps_, std::int32_t round_candidates_, double next_candidate_delay_, std::int32_t round_attempt_duration_, std::int32_t max_round_attempts_, std::int32_t max_block_size_, std::int32_t max_collated_data_size_);
+
+  static const std::int32_t ID = -1235092029;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_config> fetch(td::TlParser &p);
+
+  explicit validatorSession_config(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_Message: public Object {
+ public:
+
+  static object_ptr<validatorSession_Message> fetch(td::TlParser &p);
+};
+
+class validatorSession_message_startSession final : public validatorSession_Message {
+ public:
+
+  validatorSession_message_startSession();
+
+  static const std::int32_t ID = -1767807279;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_Message> fetch(td::TlParser &p);
+
+  explicit validatorSession_message_startSession(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_message_finishSession final : public validatorSession_Message {
+ public:
+
+  validatorSession_message_finishSession();
+
+  static const std::int32_t ID = -879025437;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_Message> fetch(td::TlParser &p);
+
+  explicit validatorSession_message_finishSession(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_pong final : public Object {
+ public:
+  std::int64_t hash_;
+
+  validatorSession_pong();
+
+  explicit validatorSession_pong(std::int64_t hash_);
+
+  static const std::int32_t ID = -590989459;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_pong> fetch(td::TlParser &p);
+
+  explicit validatorSession_pong(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_round_id final : public Object {
+ public:
+  td::Bits256 session_;
+  std::int64_t height_;
+  td::Bits256 prev_block_;
+  std::int32_t seqno_;
+
+  validatorSession_round_id();
+
+  validatorSession_round_id(td::Bits256 const &session_, std::int64_t height_, td::Bits256 const &prev_block_, std::int32_t seqno_);
+
+  static const std::int32_t ID = 2477989;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_round_id> fetch(td::TlParser &p);
+
+  explicit validatorSession_round_id(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_round_Message: public Object {
+ public:
+
+  static object_ptr<validatorSession_round_Message> fetch(td::TlParser &p);
+};
+
+class validatorSession_message_submittedBlock final : public validatorSession_round_Message {
+ public:
+  std::int32_t round_;
+  td::Bits256 root_hash_;
+  td::Bits256 file_hash_;
+  td::Bits256 collated_data_file_hash_;
+
+  validatorSession_message_submittedBlock();
+
+  validatorSession_message_submittedBlock(std::int32_t round_, td::Bits256 const &root_hash_, td::Bits256 const &file_hash_, td::Bits256 const &collated_data_file_hash_);
+
+  static const std::int32_t ID = 309732534;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_round_Message> fetch(td::TlParser &p);
+
+  explicit validatorSession_message_submittedBlock(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_message_approvedBlock final : public validatorSession_round_Message {
+ public:
+  std::int32_t round_;
+  td::Bits256 candidate_;
+  td::BufferSlice signature_;
+
+  validatorSession_message_approvedBlock();
+
+  validatorSession_message_approvedBlock(std::int32_t round_, td::Bits256 const &candidate_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = 77968769;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_round_Message> fetch(td::TlParser &p);
+
+  explicit validatorSession_message_approvedBlock(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_message_rejectedBlock final : public validatorSession_round_Message {
+ public:
+  std::int32_t round_;
+  td::Bits256 candidate_;
+  td::BufferSlice reason_;
+
+  validatorSession_message_rejectedBlock();
+
+  validatorSession_message_rejectedBlock(std::int32_t round_, td::Bits256 const &candidate_, td::BufferSlice &&reason_);
+
+  static const std::int32_t ID = -1786229141;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_round_Message> fetch(td::TlParser &p);
+
+  explicit validatorSession_message_rejectedBlock(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_message_commit final : public validatorSession_round_Message {
+ public:
+  std::int32_t round_;
+  td::Bits256 candidate_;
+  td::BufferSlice signature_;
+
+  validatorSession_message_commit();
+
+  validatorSession_message_commit(std::int32_t round_, td::Bits256 const &candidate_, td::BufferSlice &&signature_);
+
+  static const std::int32_t ID = -1408065803;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_round_Message> fetch(td::TlParser &p);
+
+  explicit validatorSession_message_commit(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_message_vote final : public validatorSession_round_Message {
+ public:
+  std::int32_t round_;
+  std::int32_t attempt_;
+  td::Bits256 candidate_;
+
+  validatorSession_message_vote();
+
+  validatorSession_message_vote(std::int32_t round_, std::int32_t attempt_, td::Bits256 const &candidate_);
+
+  static const std::int32_t ID = -1707978297;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_round_Message> fetch(td::TlParser &p);
+
+  explicit validatorSession_message_vote(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_message_voteFor final : public validatorSession_round_Message {
+ public:
+  std::int32_t round_;
+  std::int32_t attempt_;
+  td::Bits256 candidate_;
+
+  validatorSession_message_voteFor();
+
+  validatorSession_message_voteFor(std::int32_t round_, std::int32_t attempt_, td::Bits256 const &candidate_);
+
+  static const std::int32_t ID = 1643183663;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_round_Message> fetch(td::TlParser &p);
+
+  explicit validatorSession_message_voteFor(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_message_precommit final : public validatorSession_round_Message {
+ public:
+  std::int32_t round_;
+  std::int32_t attempt_;
+  td::Bits256 candidate_;
+
+  validatorSession_message_precommit();
+
+  validatorSession_message_precommit(std::int32_t round_, std::int32_t attempt_, td::Bits256 const &candidate_);
+
+  static const std::int32_t ID = -1470843566;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_round_Message> fetch(td::TlParser &p);
+
+  explicit validatorSession_message_precommit(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_message_empty final : public validatorSession_round_Message {
+ public:
+  std::int32_t round_;
+  std::int32_t attempt_;
+
+  validatorSession_message_empty();
+
+  validatorSession_message_empty(std::int32_t round_, std::int32_t attempt_);
+
+  static const std::int32_t ID = 1243619241;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_round_Message> fetch(td::TlParser &p);
+
+  explicit validatorSession_message_empty(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class validatorSession_candidate_id final : public Object {
+ public:
+  td::Bits256 round_;
+  td::Bits256 block_hash_;
+
+  validatorSession_candidate_id();
+
+  validatorSession_candidate_id(td::Bits256 const &round_, td::Bits256 const &block_hash_);
+
+  static const std::int32_t ID = -1126743751;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  static object_ptr<validatorSession_candidate_id> fetch(td::TlParser &p);
+
+  explicit validatorSession_candidate_id(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+};
+
+class adnl_ping final : public Function {
+ public:
+  std::int64_t value_;
+
+  adnl_ping();
+
+  explicit adnl_ping(std::int64_t value_);
+
+  static const std::int32_t ID = 531276223;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<adnl_pong>;
+
+  static object_ptr<adnl_ping> fetch(td::TlParser &p);
+
+  explicit adnl_ping(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class catchain_getBlock final : public Function {
+ public:
+  td::Bits256 block_;
+
+  catchain_getBlock();
+
+  explicit catchain_getBlock(td::Bits256 const &block_);
+
+  static const std::int32_t ID = 155049336;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<catchain_BlockResult>;
+
+  static object_ptr<catchain_getBlock> fetch(td::TlParser &p);
+
+  explicit catchain_getBlock(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class catchain_getBlockHistory final : public Function {
+ public:
+  td::Bits256 block_;
+  std::int64_t height_;
+  std::vector<td::Bits256> stop_if_;
+
+  catchain_getBlockHistory();
+
+  catchain_getBlockHistory(td::Bits256 const &block_, std::int64_t height_, std::vector<td::Bits256> &&stop_if_);
+
+  static const std::int32_t ID = -1470730762;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<catchain_sent>;
+
+  static object_ptr<catchain_getBlockHistory> fetch(td::TlParser &p);
+
+  explicit catchain_getBlockHistory(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class catchain_getBlocks final : public Function {
+ public:
+  std::vector<td::Bits256> blocks_;
+
+  catchain_getBlocks();
+
+  explicit catchain_getBlocks(std::vector<td::Bits256> &&blocks_);
+
+  static const std::int32_t ID = 53062594;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<catchain_sent>;
+
+  static object_ptr<catchain_getBlocks> fetch(td::TlParser &p);
+
+  explicit catchain_getBlocks(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class catchain_getDifference final : public Function {
+ public:
+  std::vector<std::int32_t> rt_;
+
+  catchain_getDifference();
+
+  explicit catchain_getDifference(std::vector<std::int32_t> &&rt_);
+
+  static const std::int32_t ID = -798175528;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<catchain_Difference>;
+
+  static object_ptr<catchain_getDifference> fetch(td::TlParser &p);
+
+  explicit catchain_getDifference(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class dht_findNode final : public Function {
+ public:
+  td::Bits256 key_;
+  std::int32_t k_;
+
+  dht_findNode();
+
+  dht_findNode(td::Bits256 const &key_, std::int32_t k_);
+
+  static const std::int32_t ID = 1826803307;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<dht_nodes>;
+
+  static object_ptr<dht_findNode> fetch(td::TlParser &p);
+
+  explicit dht_findNode(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class dht_findValue final : public Function {
+ public:
+  td::Bits256 key_;
+  std::int32_t k_;
+
+  dht_findValue();
+
+  dht_findValue(td::Bits256 const &key_, std::int32_t k_);
+
+  static const std::int32_t ID = -1370791919;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<dht_ValueResult>;
+
+  static object_ptr<dht_findValue> fetch(td::TlParser &p);
+
+  explicit dht_findValue(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class dht_getSignedAddressList final : public Function {
+ public:
+
+  dht_getSignedAddressList();
+
+  static const std::int32_t ID = -1451669267;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<dht_node>;
+
+  static object_ptr<dht_getSignedAddressList> fetch(td::TlParser &p);
+
+  explicit dht_getSignedAddressList(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class dht_ping final : public Function {
+ public:
+  std::int64_t random_id_;
+
+  dht_ping();
+
+  explicit dht_ping(std::int64_t random_id_);
+
+  static const std::int32_t ID = -873775336;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<dht_pong>;
+
+  static object_ptr<dht_ping> fetch(td::TlParser &p);
+
+  explicit dht_ping(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class dht_query final : public Function {
+ public:
+  object_ptr<dht_node> node_;
+
+  dht_query();
+
+  explicit dht_query(object_ptr<dht_node> &&node_);
+
+  static const std::int32_t ID = 2102593385;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = bool;
+
+  static object_ptr<dht_query> fetch(td::TlParser &p);
+
+  explicit dht_query(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class dht_store final : public Function {
+ public:
+  object_ptr<dht_value> value_;
+
+  dht_store();
+
+  explicit dht_store(object_ptr<dht_value> &&value_);
+
+  static const std::int32_t ID = 882065938;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<dht_stored>;
+
+  static object_ptr<dht_store> fetch(td::TlParser &p);
+
+  explicit dht_store(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_addAdnlId final : public Function {
+ public:
+  td::Bits256 key_hash_;
+  std::int32_t category_;
+
+  engine_validator_addAdnlId();
+
+  engine_validator_addAdnlId(td::Bits256 const &key_hash_, std::int32_t category_);
+
+  static const std::int32_t ID = -310029141;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_addAdnlId> fetch(td::TlParser &p);
+
+  explicit engine_validator_addAdnlId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_addControlInterface final : public Function {
+ public:
+  td::Bits256 key_hash_;
+  std::int32_t port_;
+
+  engine_validator_addControlInterface();
+
+  engine_validator_addControlInterface(td::Bits256 const &key_hash_, std::int32_t port_);
+
+  static const std::int32_t ID = 881587196;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_addControlInterface> fetch(td::TlParser &p);
+
+  explicit engine_validator_addControlInterface(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_addControlProcess final : public Function {
+ public:
+  td::Bits256 key_hash_;
+  std::int32_t port_;
+  td::Bits256 peer_key_;
+  std::int32_t permissions_;
+
+  engine_validator_addControlProcess();
+
+  engine_validator_addControlProcess(td::Bits256 const &key_hash_, std::int32_t port_, td::Bits256 const &peer_key_, std::int32_t permissions_);
+
+  static const std::int32_t ID = 1524692816;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_addControlProcess> fetch(td::TlParser &p);
+
+  explicit engine_validator_addControlProcess(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_addDhtId final : public Function {
+ public:
+  td::Bits256 key_hash_;
+
+  engine_validator_addDhtId();
+
+  explicit engine_validator_addDhtId(td::Bits256 const &key_hash_);
+
+  static const std::int32_t ID = -183755124;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_addDhtId> fetch(td::TlParser &p);
+
+  explicit engine_validator_addDhtId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_addListeningPort final : public Function {
+ public:
+  std::int32_t ip_;
+  std::int32_t port_;
+  std::vector<std::int32_t> categories_;
+  std::vector<std::int32_t> priority_categories_;
+
+  engine_validator_addListeningPort();
+
+  engine_validator_addListeningPort(std::int32_t ip_, std::int32_t port_, std::vector<std::int32_t> &&categories_, std::vector<std::int32_t> &&priority_categories_);
+
+  static const std::int32_t ID = -362051147;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_addListeningPort> fetch(td::TlParser &p);
+
+  explicit engine_validator_addListeningPort(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_addLiteserver final : public Function {
+ public:
+  td::Bits256 key_hash_;
+  std::int32_t port_;
+
+  engine_validator_addLiteserver();
+
+  engine_validator_addLiteserver(td::Bits256 const &key_hash_, std::int32_t port_);
+
+  static const std::int32_t ID = -259387577;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_addLiteserver> fetch(td::TlParser &p);
+
+  explicit engine_validator_addLiteserver(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_addProxy final : public Function {
+ public:
+  std::int32_t in_ip_;
+  std::int32_t in_port_;
+  std::int32_t out_ip_;
+  std::int32_t out_port_;
+  object_ptr<adnl_Proxy> proxy_;
+  std::vector<std::int32_t> categories_;
+  std::vector<std::int32_t> priority_categories_;
+
+  engine_validator_addProxy();
+
+  engine_validator_addProxy(std::int32_t in_ip_, std::int32_t in_port_, std::int32_t out_ip_, std::int32_t out_port_, object_ptr<adnl_Proxy> &&proxy_, std::vector<std::int32_t> &&categories_, std::vector<std::int32_t> &&priority_categories_);
+
+  static const std::int32_t ID = -151178251;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_addProxy> fetch(td::TlParser &p);
+
+  explicit engine_validator_addProxy(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_addValidatorAdnlAddress final : public Function {
+ public:
+  td::Bits256 permanent_key_hash_;
+  td::Bits256 key_hash_;
+  std::int32_t ttl_;
+
+  engine_validator_addValidatorAdnlAddress();
+
+  engine_validator_addValidatorAdnlAddress(td::Bits256 const &permanent_key_hash_, td::Bits256 const &key_hash_, std::int32_t ttl_);
+
+  static const std::int32_t ID = -624187774;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_addValidatorAdnlAddress> fetch(td::TlParser &p);
+
+  explicit engine_validator_addValidatorAdnlAddress(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_addValidatorPermanentKey final : public Function {
+ public:
+  td::Bits256 key_hash_;
+  std::int32_t election_date_;
+  std::int32_t ttl_;
+
+  engine_validator_addValidatorPermanentKey();
+
+  engine_validator_addValidatorPermanentKey(td::Bits256 const &key_hash_, std::int32_t election_date_, std::int32_t ttl_);
+
+  static const std::int32_t ID = -1844116104;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_addValidatorPermanentKey> fetch(td::TlParser &p);
+
+  explicit engine_validator_addValidatorPermanentKey(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_addValidatorTempKey final : public Function {
+ public:
+  td::Bits256 permanent_key_hash_;
+  td::Bits256 key_hash_;
+  std::int32_t ttl_;
+
+  engine_validator_addValidatorTempKey();
+
+  engine_validator_addValidatorTempKey(td::Bits256 const &permanent_key_hash_, td::Bits256 const &key_hash_, std::int32_t ttl_);
+
+  static const std::int32_t ID = -1926009038;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_addValidatorTempKey> fetch(td::TlParser &p);
+
+  explicit engine_validator_addValidatorTempKey(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_changeFullNodeAdnlAddress final : public Function {
+ public:
+  td::Bits256 adnl_id_;
+
+  engine_validator_changeFullNodeAdnlAddress();
+
+  explicit engine_validator_changeFullNodeAdnlAddress(td::Bits256 const &adnl_id_);
+
+  static const std::int32_t ID = -1094268539;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_changeFullNodeAdnlAddress> fetch(td::TlParser &p);
+
+  explicit engine_validator_changeFullNodeAdnlAddress(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_checkDhtServers final : public Function {
+ public:
+  td::Bits256 id_;
+
+  engine_validator_checkDhtServers();
+
+  explicit engine_validator_checkDhtServers(td::Bits256 const &id_);
+
+  static const std::int32_t ID = -773578550;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_dhtServersStatus>;
+
+  static object_ptr<engine_validator_checkDhtServers> fetch(td::TlParser &p);
+
+  explicit engine_validator_checkDhtServers(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_controlQuery final : public Function {
+ public:
+  td::BufferSlice data_;
+
+  engine_validator_controlQuery();
+
+  explicit engine_validator_controlQuery(td::BufferSlice &&data_);
+
+  static const std::int32_t ID = -1535722048;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<Object>;
+
+  static object_ptr<engine_validator_controlQuery> fetch(td::TlParser &p);
+
+  explicit engine_validator_controlQuery(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_createElectionBid final : public Function {
+ public:
+  std::int32_t election_date_;
+  std::string election_addr_;
+  std::string wallet_;
+
+  engine_validator_createElectionBid();
+
+  engine_validator_createElectionBid(std::int32_t election_date_, std::string const &election_addr_, std::string const &wallet_);
+
+  static const std::int32_t ID = -451038907;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_electionBid>;
+
+  static object_ptr<engine_validator_createElectionBid> fetch(td::TlParser &p);
+
+  explicit engine_validator_createElectionBid(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_delAdnlId final : public Function {
+ public:
+  td::Bits256 key_hash_;
+
+  engine_validator_delAdnlId();
+
+  explicit engine_validator_delAdnlId(td::Bits256 const &key_hash_);
+
+  static const std::int32_t ID = 691696882;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_delAdnlId> fetch(td::TlParser &p);
+
+  explicit engine_validator_delAdnlId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_delDhtId final : public Function {
+ public:
+  td::Bits256 key_hash_;
+
+  engine_validator_delDhtId();
+
+  explicit engine_validator_delDhtId(td::Bits256 const &key_hash_);
+
+  static const std::int32_t ID = -2063770818;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_delDhtId> fetch(td::TlParser &p);
+
+  explicit engine_validator_delDhtId(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_delListeningPort final : public Function {
+ public:
+  std::int32_t ip_;
+  std::int32_t port_;
+  std::vector<std::int32_t> categories_;
+  std::vector<std::int32_t> priority_categories_;
+
+  engine_validator_delListeningPort();
+
+  engine_validator_delListeningPort(std::int32_t ip_, std::int32_t port_, std::vector<std::int32_t> &&categories_, std::vector<std::int32_t> &&priority_categories_);
+
+  static const std::int32_t ID = 828094543;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_delListeningPort> fetch(td::TlParser &p);
+
+  explicit engine_validator_delListeningPort(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_delProxy final : public Function {
+ public:
+  std::int32_t out_ip_;
+  std::int32_t out_port_;
+  std::vector<std::int32_t> categories_;
+  std::vector<std::int32_t> priority_categories_;
+
+  engine_validator_delProxy();
+
+  engine_validator_delProxy(std::int32_t out_ip_, std::int32_t out_port_, std::vector<std::int32_t> &&categories_, std::vector<std::int32_t> &&priority_categories_);
+
+  static const std::int32_t ID = 1970850941;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_delProxy> fetch(td::TlParser &p);
+
+  explicit engine_validator_delProxy(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_delValidatorAdnlAddress final : public Function {
+ public:
+  td::Bits256 permanent_key_hash_;
+  td::Bits256 key_hash_;
+
+  engine_validator_delValidatorAdnlAddress();
+
+  engine_validator_delValidatorAdnlAddress(td::Bits256 const &permanent_key_hash_, td::Bits256 const &key_hash_);
+
+  static const std::int32_t ID = -150453414;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_delValidatorAdnlAddress> fetch(td::TlParser &p);
+
+  explicit engine_validator_delValidatorAdnlAddress(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_delValidatorPermanentKey final : public Function {
+ public:
+  td::Bits256 key_hash_;
+
+  engine_validator_delValidatorPermanentKey();
+
+  explicit engine_validator_delValidatorPermanentKey(td::Bits256 const &key_hash_);
+
+  static const std::int32_t ID = 390777082;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_delValidatorPermanentKey> fetch(td::TlParser &p);
+
+  explicit engine_validator_delValidatorPermanentKey(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_delValidatorTempKey final : public Function {
+ public:
+  td::Bits256 permanent_key_hash_;
+  td::Bits256 key_hash_;
+
+  engine_validator_delValidatorTempKey();
+
+  engine_validator_delValidatorTempKey(td::Bits256 const &permanent_key_hash_, td::Bits256 const &key_hash_);
+
+  static const std::int32_t ID = -1595481903;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_delValidatorTempKey> fetch(td::TlParser &p);
+
+  explicit engine_validator_delValidatorTempKey(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_exportPrivateKey final : public Function {
+ public:
+  td::Bits256 key_hash_;
+
+  engine_validator_exportPrivateKey();
+
+  explicit engine_validator_exportPrivateKey(td::Bits256 const &key_hash_);
+
+  static const std::int32_t ID = -864911288;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<PrivateKey>;
+
+  static object_ptr<engine_validator_exportPrivateKey> fetch(td::TlParser &p);
+
+  explicit engine_validator_exportPrivateKey(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_exportPublicKey final : public Function {
+ public:
+  td::Bits256 key_hash_;
+
+  engine_validator_exportPublicKey();
+
+  explicit engine_validator_exportPublicKey(td::Bits256 const &key_hash_);
+
+  static const std::int32_t ID = 1647618233;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<PublicKey>;
+
+  static object_ptr<engine_validator_exportPublicKey> fetch(td::TlParser &p);
+
+  explicit engine_validator_exportPublicKey(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_generateKeyPair final : public Function {
+ public:
+
+  engine_validator_generateKeyPair();
+
+  static const std::int32_t ID = -349872005;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_keyHash>;
+
+  static object_ptr<engine_validator_generateKeyPair> fetch(td::TlParser &p);
+
+  explicit engine_validator_generateKeyPair(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_getConfig final : public Function {
+ public:
+
+  engine_validator_getConfig();
+
+  static const std::int32_t ID = 1504518693;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_jsonConfig>;
+
+  static object_ptr<engine_validator_getConfig> fetch(td::TlParser &p);
+
+  explicit engine_validator_getConfig(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_getStats final : public Function {
+ public:
+
+  engine_validator_getStats();
+
+  static const std::int32_t ID = 1389740817;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_stats>;
+
+  static object_ptr<engine_validator_getStats> fetch(td::TlParser &p);
+
+  explicit engine_validator_getStats(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_getTime final : public Function {
+ public:
+
+  engine_validator_getTime();
+
+  static const std::int32_t ID = -515850543;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_time>;
+
+  static object_ptr<engine_validator_getTime> fetch(td::TlParser &p);
+
+  explicit engine_validator_getTime(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_importPrivateKey final : public Function {
+ public:
+  object_ptr<PrivateKey> key_;
+
+  engine_validator_importPrivateKey();
+
+  explicit engine_validator_importPrivateKey(object_ptr<PrivateKey> &&key_);
+
+  static const std::int32_t ID = 360741575;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_keyHash>;
+
+  static object_ptr<engine_validator_importPrivateKey> fetch(td::TlParser &p);
+
+  explicit engine_validator_importPrivateKey(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_setVerbosity final : public Function {
+ public:
+  std::int32_t verbosity_;
+
+  engine_validator_setVerbosity();
+
+  explicit engine_validator_setVerbosity(std::int32_t verbosity_);
+
+  static const std::int32_t ID = -1316856190;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_success>;
+
+  static object_ptr<engine_validator_setVerbosity> fetch(td::TlParser &p);
+
+  explicit engine_validator_setVerbosity(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class engine_validator_sign final : public Function {
+ public:
+  td::Bits256 key_hash_;
+  td::BufferSlice data_;
+
+  engine_validator_sign();
+
+  engine_validator_sign(td::Bits256 const &key_hash_, td::BufferSlice &&data_);
+
+  static const std::int32_t ID = 451549736;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<engine_validator_signature>;
+
+  static object_ptr<engine_validator_sign> fetch(td::TlParser &p);
+
+  explicit engine_validator_sign(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class getTestObject final : public Function {
+ public:
+
+  getTestObject();
+
+  static const std::int32_t ID = 197109379;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<TestObject>;
+
+  static object_ptr<getTestObject> fetch(td::TlParser &p);
+
+  explicit getTestObject(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class overlay_getBroadcast final : public Function {
+ public:
+  td::Bits256 hash_;
+
+  overlay_getBroadcast();
+
+  explicit overlay_getBroadcast(td::Bits256 const &hash_);
+
+  static const std::int32_t ID = 758510240;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<overlay_Broadcast>;
+
+  static object_ptr<overlay_getBroadcast> fetch(td::TlParser &p);
+
+  explicit overlay_getBroadcast(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class overlay_getBroadcastList final : public Function {
+ public:
+  object_ptr<overlay_broadcastList> list_;
+
+  overlay_getBroadcastList();
+
+  explicit overlay_getBroadcastList(object_ptr<overlay_broadcastList> &&list_);
+
+  static const std::int32_t ID = 1109141562;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<overlay_broadcastList>;
+
+  static object_ptr<overlay_getBroadcastList> fetch(td::TlParser &p);
+
+  explicit overlay_getBroadcastList(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class overlay_getRandomPeers final : public Function {
+ public:
+  object_ptr<overlay_nodes> peers_;
+
+  overlay_getRandomPeers();
+
+  explicit overlay_getRandomPeers(object_ptr<overlay_nodes> &&peers_);
+
+  static const std::int32_t ID = 1223582891;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<overlay_nodes>;
+
+  static object_ptr<overlay_getRandomPeers> fetch(td::TlParser &p);
+
+  explicit overlay_getRandomPeers(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class overlay_query final : public Function {
+ public:
+  td::Bits256 overlay_;
+
+  overlay_query();
+
+  explicit overlay_query(td::Bits256 const &overlay_);
+
+  static const std::int32_t ID = -855800765;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = bool;
+
+  static object_ptr<overlay_query> fetch(td::TlParser &p);
+
+  explicit overlay_query(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class tcp_ping final : public Function {
+ public:
+  std::int64_t random_id_;
+
+  tcp_ping();
+
+  explicit tcp_ping(std::int64_t random_id_);
+
+  static const std::int32_t ID = 1292381082;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<tcp_pong>;
+
+  static object_ptr<tcp_ping> fetch(td::TlParser &p);
+
+  explicit tcp_ping(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class tonNode_downloadBlock final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+
+  tonNode_downloadBlock();
+
+  explicit tonNode_downloadBlock(object_ptr<tonNode_blockIdExt> &&block_);
+
+  static const std::int32_t ID = -495814205;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<tonNode_data>;
+
+  static object_ptr<tonNode_downloadBlock> fetch(td::TlParser &p);
+
+  explicit tonNode_downloadBlock(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class tonNode_downloadBlockProof final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+
+  tonNode_downloadBlockProof();
+
+  explicit tonNode_downloadBlockProof(object_ptr<tonNode_blockIdExt> &&block_);
+
+  static const std::int32_t ID = 1272334218;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<tonNode_data>;
+
+  static object_ptr<tonNode_downloadBlockProof> fetch(td::TlParser &p);
+
+  explicit tonNode_downloadBlockProof(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class tonNode_downloadBlockProofLink final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+
+  tonNode_downloadBlockProofLink();
+
+  explicit tonNode_downloadBlockProofLink(object_ptr<tonNode_blockIdExt> &&block_);
+
+  static const std::int32_t ID = 632488134;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<tonNode_data>;
+
+  static object_ptr<tonNode_downloadBlockProofLink> fetch(td::TlParser &p);
+
+  explicit tonNode_downloadBlockProofLink(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class tonNode_downloadPersistentState final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+  object_ptr<tonNode_blockIdExt> masterchain_block_;
+
+  tonNode_downloadPersistentState();
+
+  tonNode_downloadPersistentState(object_ptr<tonNode_blockIdExt> &&block_, object_ptr<tonNode_blockIdExt> &&masterchain_block_);
+
+  static const std::int32_t ID = 2140791736;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<tonNode_data>;
+
+  static object_ptr<tonNode_downloadPersistentState> fetch(td::TlParser &p);
+
+  explicit tonNode_downloadPersistentState(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class tonNode_downloadZeroState final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+
+  tonNode_downloadZeroState();
+
+  explicit tonNode_downloadZeroState(object_ptr<tonNode_blockIdExt> &&block_);
+
+  static const std::int32_t ID = -1379131814;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<tonNode_data>;
+
+  static object_ptr<tonNode_downloadZeroState> fetch(td::TlParser &p);
+
+  explicit tonNode_downloadZeroState(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class tonNode_getNextBlockDescription final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> prev_block_;
+
+  tonNode_getNextBlockDescription();
+
+  explicit tonNode_getNextBlockDescription(object_ptr<tonNode_blockIdExt> &&prev_block_);
+
+  static const std::int32_t ID = 341160179;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<tonNode_BlockDescription>;
+
+  static object_ptr<tonNode_getNextBlockDescription> fetch(td::TlParser &p);
+
+  explicit tonNode_getNextBlockDescription(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class tonNode_getNextKeyBlockIds final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+  std::int32_t max_size_;
+
+  tonNode_getNextKeyBlockIds();
+
+  tonNode_getNextKeyBlockIds(object_ptr<tonNode_blockIdExt> &&block_, std::int32_t max_size_);
+
+  static const std::int32_t ID = -219689029;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<tonNode_keyBlocks>;
+
+  static object_ptr<tonNode_getNextKeyBlockIds> fetch(td::TlParser &p);
+
+  explicit tonNode_getNextKeyBlockIds(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class tonNode_prepareBlock final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+
+  tonNode_prepareBlock();
+
+  explicit tonNode_prepareBlock(object_ptr<tonNode_blockIdExt> &&block_);
+
+  static const std::int32_t ID = 1973649230;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<tonNode_Prepared>;
+
+  static object_ptr<tonNode_prepareBlock> fetch(td::TlParser &p);
+
+  explicit tonNode_prepareBlock(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class tonNode_prepareBlockProof final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+  bool allow_partial_;
+
+  tonNode_prepareBlockProof();
+
+  tonNode_prepareBlockProof(object_ptr<tonNode_blockIdExt> &&block_, bool allow_partial_);
+
+  static const std::int32_t ID = -2024000760;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<tonNode_PreparedProof>;
+
+  static object_ptr<tonNode_prepareBlockProof> fetch(td::TlParser &p);
+
+  explicit tonNode_prepareBlockProof(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class tonNode_preparePersistentState final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+  object_ptr<tonNode_blockIdExt> masterchain_block_;
+
+  tonNode_preparePersistentState();
+
+  tonNode_preparePersistentState(object_ptr<tonNode_blockIdExt> &&block_, object_ptr<tonNode_blockIdExt> &&masterchain_block_);
+
+  static const std::int32_t ID = -18209122;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<tonNode_PreparedState>;
+
+  static object_ptr<tonNode_preparePersistentState> fetch(td::TlParser &p);
+
+  explicit tonNode_preparePersistentState(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class tonNode_prepareZeroState final : public Function {
+ public:
+  object_ptr<tonNode_blockIdExt> block_;
+
+  tonNode_prepareZeroState();
+
+  explicit tonNode_prepareZeroState(object_ptr<tonNode_blockIdExt> &&block_);
+
+  static const std::int32_t ID = 1104021541;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<tonNode_PreparedState>;
+
+  static object_ptr<tonNode_prepareZeroState> fetch(td::TlParser &p);
+
+  explicit tonNode_prepareZeroState(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class validatorSession_downloadCandidate final : public Function {
+ public:
+  std::int32_t round_;
+  object_ptr<validatorSession_candidateId> id_;
+
+  validatorSession_downloadCandidate();
+
+  validatorSession_downloadCandidate(std::int32_t round_, object_ptr<validatorSession_candidateId> &&id_);
+
+  static const std::int32_t ID = -520274443;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<validatorSession_candidate>;
+
+  static object_ptr<validatorSession_downloadCandidate> fetch(td::TlParser &p);
+
+  explicit validatorSession_downloadCandidate(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+class validatorSession_ping final : public Function {
+ public:
+  std::int64_t hash_;
+
+  validatorSession_ping();
+
+  explicit validatorSession_ping(std::int64_t hash_);
+
+  static const std::int32_t ID = 1745111469;
+  std::int32_t get_id() const final {
+    return ID;
+  }
+
+  using ReturnType = object_ptr<validatorSession_pong>;
+
+  static object_ptr<validatorSession_ping> fetch(td::TlParser &p);
+
+  explicit validatorSession_ping(td::TlParser &p);
+
+  void store(td::TlStorerCalcLength &s) const final;
+
+  void store(td::TlStorerUnsafe &s) const final;
+
+  void store(td::TlStorerToString &s, const char *field_name) const final;
+
+  static ReturnType fetch_result(td::TlParser &p);
+};
+
+}  // namespace ton_api
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api.hpp b/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api.hpp
new file mode 100644
index 0000000000..26ea487284
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api.hpp
@@ -0,0 +1,1873 @@
+#pragma once
+
+#include "ton_api.h"
+
+namespace ton {
+namespace ton_api {
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(Object &obj, const T &func) {
+  switch (obj.get_id()) {
+    case hashable_bool::ID:
+      func(static_cast<hashable_bool &>(obj));
+      return true;
+    case hashable_int32::ID:
+      func(static_cast<hashable_int32 &>(obj));
+      return true;
+    case hashable_int64::ID:
+      func(static_cast<hashable_int64 &>(obj));
+      return true;
+    case hashable_int256::ID:
+      func(static_cast<hashable_int256 &>(obj));
+      return true;
+    case hashable_bytes::ID:
+      func(static_cast<hashable_bytes &>(obj));
+      return true;
+    case hashable_pair::ID:
+      func(static_cast<hashable_pair &>(obj));
+      return true;
+    case hashable_vector::ID:
+      func(static_cast<hashable_vector &>(obj));
+      return true;
+    case hashable_validatorSessionOldRound::ID:
+      func(static_cast<hashable_validatorSessionOldRound &>(obj));
+      return true;
+    case hashable_validatorSessionRoundAttempt::ID:
+      func(static_cast<hashable_validatorSessionRoundAttempt &>(obj));
+      return true;
+    case hashable_validatorSessionRound::ID:
+      func(static_cast<hashable_validatorSessionRound &>(obj));
+      return true;
+    case hashable_blockSignature::ID:
+      func(static_cast<hashable_blockSignature &>(obj));
+      return true;
+    case hashable_sentBlock::ID:
+      func(static_cast<hashable_sentBlock &>(obj));
+      return true;
+    case hashable_sentBlockEmpty::ID:
+      func(static_cast<hashable_sentBlockEmpty &>(obj));
+      return true;
+    case hashable_vote::ID:
+      func(static_cast<hashable_vote &>(obj));
+      return true;
+    case hashable_blockCandidate::ID:
+      func(static_cast<hashable_blockCandidate &>(obj));
+      return true;
+    case hashable_blockVoteCandidate::ID:
+      func(static_cast<hashable_blockVoteCandidate &>(obj));
+      return true;
+    case hashable_blockCandidateAttempt::ID:
+      func(static_cast<hashable_blockCandidateAttempt &>(obj));
+      return true;
+    case hashable_cntVector::ID:
+      func(static_cast<hashable_cntVector &>(obj));
+      return true;
+    case hashable_cntSortedVector::ID:
+      func(static_cast<hashable_cntSortedVector &>(obj));
+      return true;
+    case hashable_validatorSession::ID:
+      func(static_cast<hashable_validatorSession &>(obj));
+      return true;
+    case pk_unenc::ID:
+      func(static_cast<pk_unenc &>(obj));
+      return true;
+    case pk_ed25519::ID:
+      func(static_cast<pk_ed25519 &>(obj));
+      return true;
+    case pk_aes::ID:
+      func(static_cast<pk_aes &>(obj));
+      return true;
+    case pk_overlay::ID:
+      func(static_cast<pk_overlay &>(obj));
+      return true;
+    case pub_unenc::ID:
+      func(static_cast<pub_unenc &>(obj));
+      return true;
+    case pub_ed25519::ID:
+      func(static_cast<pub_ed25519 &>(obj));
+      return true;
+    case pub_aes::ID:
+      func(static_cast<pub_aes &>(obj));
+      return true;
+    case pub_overlay::ID:
+      func(static_cast<pub_overlay &>(obj));
+      return true;
+    case testObject::ID:
+      func(static_cast<testObject &>(obj));
+      return true;
+    case testString::ID:
+      func(static_cast<testString &>(obj));
+      return true;
+    case testInt::ID:
+      func(static_cast<testInt &>(obj));
+      return true;
+    case testVectorBytes::ID:
+      func(static_cast<testVectorBytes &>(obj));
+      return true;
+    case adnl_address_udp::ID:
+      func(static_cast<adnl_address_udp &>(obj));
+      return true;
+    case adnl_address_udp6::ID:
+      func(static_cast<adnl_address_udp6 &>(obj));
+      return true;
+    case adnl_addressList::ID:
+      func(static_cast<adnl_addressList &>(obj));
+      return true;
+    case adnl_message_createChannel::ID:
+      func(static_cast<adnl_message_createChannel &>(obj));
+      return true;
+    case adnl_message_confirmChannel::ID:
+      func(static_cast<adnl_message_confirmChannel &>(obj));
+      return true;
+    case adnl_message_custom::ID:
+      func(static_cast<adnl_message_custom &>(obj));
+      return true;
+    case adnl_message_nop::ID:
+      func(static_cast<adnl_message_nop &>(obj));
+      return true;
+    case adnl_message_reinit::ID:
+      func(static_cast<adnl_message_reinit &>(obj));
+      return true;
+    case adnl_message_query::ID:
+      func(static_cast<adnl_message_query &>(obj));
+      return true;
+    case adnl_message_answer::ID:
+      func(static_cast<adnl_message_answer &>(obj));
+      return true;
+    case adnl_message_part::ID:
+      func(static_cast<adnl_message_part &>(obj));
+      return true;
+    case adnl_node::ID:
+      func(static_cast<adnl_node &>(obj));
+      return true;
+    case adnl_nodes::ID:
+      func(static_cast<adnl_nodes &>(obj));
+      return true;
+    case adnl_packetContents::ID:
+      func(static_cast<adnl_packetContents &>(obj));
+      return true;
+    case adnl_pong::ID:
+      func(static_cast<adnl_pong &>(obj));
+      return true;
+    case adnl_proxy_none::ID:
+      func(static_cast<adnl_proxy_none &>(obj));
+      return true;
+    case adnl_proxy_fast::ID:
+      func(static_cast<adnl_proxy_fast &>(obj));
+      return true;
+    case adnl_proxyToFastHash::ID:
+      func(static_cast<adnl_proxyToFastHash &>(obj));
+      return true;
+    case adnl_proxyToFast::ID:
+      func(static_cast<adnl_proxyToFast &>(obj));
+      return true;
+    case adnl_config_global::ID:
+      func(static_cast<adnl_config_global &>(obj));
+      return true;
+    case adnl_db_node_key::ID:
+      func(static_cast<adnl_db_node_key &>(obj));
+      return true;
+    case adnl_db_node_value::ID:
+      func(static_cast<adnl_db_node_value &>(obj));
+      return true;
+    case adnl_id_short::ID:
+      func(static_cast<adnl_id_short &>(obj));
+      return true;
+    case catchain_block::ID:
+      func(static_cast<catchain_block &>(obj));
+      return true;
+    case catchain_blockNotFound::ID:
+      func(static_cast<catchain_blockNotFound &>(obj));
+      return true;
+    case catchain_blockResult::ID:
+      func(static_cast<catchain_blockResult &>(obj));
+      return true;
+    case catchain_blocks::ID:
+      func(static_cast<catchain_blocks &>(obj));
+      return true;
+    case catchain_difference::ID:
+      func(static_cast<catchain_difference &>(obj));
+      return true;
+    case catchain_differenceFork::ID:
+      func(static_cast<catchain_differenceFork &>(obj));
+      return true;
+    case catchain_firstblock::ID:
+      func(static_cast<catchain_firstblock &>(obj));
+      return true;
+    case catchain_sent::ID:
+      func(static_cast<catchain_sent &>(obj));
+      return true;
+    case catchain_blockUpdate::ID:
+      func(static_cast<catchain_blockUpdate &>(obj));
+      return true;
+    case catchain_block_data::ID:
+      func(static_cast<catchain_block_data &>(obj));
+      return true;
+    case catchain_block_dep::ID:
+      func(static_cast<catchain_block_dep &>(obj));
+      return true;
+    case catchain_block_id::ID:
+      func(static_cast<catchain_block_id &>(obj));
+      return true;
+    case catchain_block_data_badBlock::ID:
+      func(static_cast<catchain_block_data_badBlock &>(obj));
+      return true;
+    case catchain_block_data_fork::ID:
+      func(static_cast<catchain_block_data_fork &>(obj));
+      return true;
+    case catchain_block_data_nop::ID:
+      func(static_cast<catchain_block_data_nop &>(obj));
+      return true;
+    case catchain_block_data_vector::ID:
+      func(static_cast<catchain_block_data_vector &>(obj));
+      return true;
+    case catchain_config_global::ID:
+      func(static_cast<catchain_config_global &>(obj));
+      return true;
+    case config_global::ID:
+      func(static_cast<config_global &>(obj));
+      return true;
+    case config_local::ID:
+      func(static_cast<config_local &>(obj));
+      return true;
+    case control_config_local::ID:
+      func(static_cast<control_config_local &>(obj));
+      return true;
+    case db_candidate::ID:
+      func(static_cast<db_candidate &>(obj));
+      return true;
+    case db_block_info::ID:
+      func(static_cast<db_block_info &>(obj));
+      return true;
+    case db_block_archivedInfo::ID:
+      func(static_cast<db_block_archivedInfo &>(obj));
+      return true;
+    case db_blockdb_key_lru::ID:
+      func(static_cast<db_blockdb_key_lru &>(obj));
+      return true;
+    case db_blockdb_key_value::ID:
+      func(static_cast<db_blockdb_key_value &>(obj));
+      return true;
+    case db_blockdb_lru::ID:
+      func(static_cast<db_blockdb_lru &>(obj));
+      return true;
+    case db_blockdb_value::ID:
+      func(static_cast<db_blockdb_value &>(obj));
+      return true;
+    case db_candidate_id::ID:
+      func(static_cast<db_candidate_id &>(obj));
+      return true;
+    case db_celldb_value::ID:
+      func(static_cast<db_celldb_value &>(obj));
+      return true;
+    case db_celldb_key_value::ID:
+      func(static_cast<db_celldb_key_value &>(obj));
+      return true;
+    case db_filedb_key_empty::ID:
+      func(static_cast<db_filedb_key_empty &>(obj));
+      return true;
+    case db_filedb_key_blockFile::ID:
+      func(static_cast<db_filedb_key_blockFile &>(obj));
+      return true;
+    case db_filedb_key_zeroStateFile::ID:
+      func(static_cast<db_filedb_key_zeroStateFile &>(obj));
+      return true;
+    case db_filedb_key_persistentStateFile::ID:
+      func(static_cast<db_filedb_key_persistentStateFile &>(obj));
+      return true;
+    case db_filedb_key_proof::ID:
+      func(static_cast<db_filedb_key_proof &>(obj));
+      return true;
+    case db_filedb_key_proofLink::ID:
+      func(static_cast<db_filedb_key_proofLink &>(obj));
+      return true;
+    case db_filedb_key_signatures::ID:
+      func(static_cast<db_filedb_key_signatures &>(obj));
+      return true;
+    case db_filedb_key_candidate::ID:
+      func(static_cast<db_filedb_key_candidate &>(obj));
+      return true;
+    case db_filedb_value::ID:
+      func(static_cast<db_filedb_value &>(obj));
+      return true;
+    case db_lt_el_key::ID:
+      func(static_cast<db_lt_el_key &>(obj));
+      return true;
+    case db_lt_desc_key::ID:
+      func(static_cast<db_lt_desc_key &>(obj));
+      return true;
+    case db_lt_shard_key::ID:
+      func(static_cast<db_lt_shard_key &>(obj));
+      return true;
+    case db_lt_status_key::ID:
+      func(static_cast<db_lt_status_key &>(obj));
+      return true;
+    case db_lt_desc_value::ID:
+      func(static_cast<db_lt_desc_value &>(obj));
+      return true;
+    case db_lt_el_value::ID:
+      func(static_cast<db_lt_el_value &>(obj));
+      return true;
+    case db_lt_shard_value::ID:
+      func(static_cast<db_lt_shard_value &>(obj));
+      return true;
+    case db_lt_status_value::ID:
+      func(static_cast<db_lt_status_value &>(obj));
+      return true;
+    case db_root_config::ID:
+      func(static_cast<db_root_config &>(obj));
+      return true;
+    case db_root_dbDescription::ID:
+      func(static_cast<db_root_dbDescription &>(obj));
+      return true;
+    case db_root_key_cellDb::ID:
+      func(static_cast<db_root_key_cellDb &>(obj));
+      return true;
+    case db_root_key_blockDb::ID:
+      func(static_cast<db_root_key_blockDb &>(obj));
+      return true;
+    case db_root_key_config::ID:
+      func(static_cast<db_root_key_config &>(obj));
+      return true;
+    case db_state_asyncSerializer::ID:
+      func(static_cast<db_state_asyncSerializer &>(obj));
+      return true;
+    case db_state_destroyedSessions::ID:
+      func(static_cast<db_state_destroyedSessions &>(obj));
+      return true;
+    case db_state_gcBlockId::ID:
+      func(static_cast<db_state_gcBlockId &>(obj));
+      return true;
+    case db_state_initBlockId::ID:
+      func(static_cast<db_state_initBlockId &>(obj));
+      return true;
+    case db_state_key_destroyedSessions::ID:
+      func(static_cast<db_state_key_destroyedSessions &>(obj));
+      return true;
+    case db_state_key_initBlockId::ID:
+      func(static_cast<db_state_key_initBlockId &>(obj));
+      return true;
+    case db_state_key_gcBlockId::ID:
+      func(static_cast<db_state_key_gcBlockId &>(obj));
+      return true;
+    case db_state_key_shardClient::ID:
+      func(static_cast<db_state_key_shardClient &>(obj));
+      return true;
+    case db_state_key_asyncSerializer::ID:
+      func(static_cast<db_state_key_asyncSerializer &>(obj));
+      return true;
+    case db_state_shardClient::ID:
+      func(static_cast<db_state_shardClient &>(obj));
+      return true;
+    case dht_key::ID:
+      func(static_cast<dht_key &>(obj));
+      return true;
+    case dht_keyDescription::ID:
+      func(static_cast<dht_keyDescription &>(obj));
+      return true;
+    case dht_message::ID:
+      func(static_cast<dht_message &>(obj));
+      return true;
+    case dht_node::ID:
+      func(static_cast<dht_node &>(obj));
+      return true;
+    case dht_nodes::ID:
+      func(static_cast<dht_nodes &>(obj));
+      return true;
+    case dht_pong::ID:
+      func(static_cast<dht_pong &>(obj));
+      return true;
+    case dht_stored::ID:
+      func(static_cast<dht_stored &>(obj));
+      return true;
+    case dht_updateRule_signature::ID:
+      func(static_cast<dht_updateRule_signature &>(obj));
+      return true;
+    case dht_updateRule_anybody::ID:
+      func(static_cast<dht_updateRule_anybody &>(obj));
+      return true;
+    case dht_updateRule_overlayNodes::ID:
+      func(static_cast<dht_updateRule_overlayNodes &>(obj));
+      return true;
+    case dht_value::ID:
+      func(static_cast<dht_value &>(obj));
+      return true;
+    case dht_valueNotFound::ID:
+      func(static_cast<dht_valueNotFound &>(obj));
+      return true;
+    case dht_valueFound::ID:
+      func(static_cast<dht_valueFound &>(obj));
+      return true;
+    case dht_config_global::ID:
+      func(static_cast<dht_config_global &>(obj));
+      return true;
+    case dht_config_local::ID:
+      func(static_cast<dht_config_local &>(obj));
+      return true;
+    case dht_config_random_local::ID:
+      func(static_cast<dht_config_random_local &>(obj));
+      return true;
+    case dht_db_bucket::ID:
+      func(static_cast<dht_db_bucket &>(obj));
+      return true;
+    case dht_db_key_bucket::ID:
+      func(static_cast<dht_db_key_bucket &>(obj));
+      return true;
+    case dummyworkchain0_config_global::ID:
+      func(static_cast<dummyworkchain0_config_global &>(obj));
+      return true;
+    case engine_addr::ID:
+      func(static_cast<engine_addr &>(obj));
+      return true;
+    case engine_addrProxy::ID:
+      func(static_cast<engine_addrProxy &>(obj));
+      return true;
+    case engine_adnl::ID:
+      func(static_cast<engine_adnl &>(obj));
+      return true;
+    case engine_controlInterface::ID:
+      func(static_cast<engine_controlInterface &>(obj));
+      return true;
+    case engine_controlProcess::ID:
+      func(static_cast<engine_controlProcess &>(obj));
+      return true;
+    case engine_dht::ID:
+      func(static_cast<engine_dht &>(obj));
+      return true;
+    case engine_gc::ID:
+      func(static_cast<engine_gc &>(obj));
+      return true;
+    case engine_liteServer::ID:
+      func(static_cast<engine_liteServer &>(obj));
+      return true;
+    case engine_validator::ID:
+      func(static_cast<engine_validator &>(obj));
+      return true;
+    case engine_validatorAdnlAddress::ID:
+      func(static_cast<engine_validatorAdnlAddress &>(obj));
+      return true;
+    case engine_validatorTempKey::ID:
+      func(static_cast<engine_validatorTempKey &>(obj));
+      return true;
+    case engine_adnlProxy_config::ID:
+      func(static_cast<engine_adnlProxy_config &>(obj));
+      return true;
+    case engine_adnlProxy_port::ID:
+      func(static_cast<engine_adnlProxy_port &>(obj));
+      return true;
+    case engine_dht_config::ID:
+      func(static_cast<engine_dht_config &>(obj));
+      return true;
+    case engine_validator_config::ID:
+      func(static_cast<engine_validator_config &>(obj));
+      return true;
+    case engine_validator_controlQueryError::ID:
+      func(static_cast<engine_validator_controlQueryError &>(obj));
+      return true;
+    case engine_validator_dhtServerStatus::ID:
+      func(static_cast<engine_validator_dhtServerStatus &>(obj));
+      return true;
+    case engine_validator_dhtServersStatus::ID:
+      func(static_cast<engine_validator_dhtServersStatus &>(obj));
+      return true;
+    case engine_validator_electionBid::ID:
+      func(static_cast<engine_validator_electionBid &>(obj));
+      return true;
+    case validator_groupMember::ID:
+      func(static_cast<validator_groupMember &>(obj));
+      return true;
+    case engine_validator_jsonConfig::ID:
+      func(static_cast<engine_validator_jsonConfig &>(obj));
+      return true;
+    case engine_validator_keyHash::ID:
+      func(static_cast<engine_validator_keyHash &>(obj));
+      return true;
+    case engine_validator_oneStat::ID:
+      func(static_cast<engine_validator_oneStat &>(obj));
+      return true;
+    case engine_validator_signature::ID:
+      func(static_cast<engine_validator_signature &>(obj));
+      return true;
+    case engine_validator_stats::ID:
+      func(static_cast<engine_validator_stats &>(obj));
+      return true;
+    case engine_validator_success::ID:
+      func(static_cast<engine_validator_success &>(obj));
+      return true;
+    case engine_validator_time::ID:
+      func(static_cast<engine_validator_time &>(obj));
+      return true;
+    case fec_raptorQ::ID:
+      func(static_cast<fec_raptorQ &>(obj));
+      return true;
+    case fec_roundRobin::ID:
+      func(static_cast<fec_roundRobin &>(obj));
+      return true;
+    case fec_online::ID:
+      func(static_cast<fec_online &>(obj));
+      return true;
+    case id_config_local::ID:
+      func(static_cast<id_config_local &>(obj));
+      return true;
+    case liteclient_config_global::ID:
+      func(static_cast<liteclient_config_global &>(obj));
+      return true;
+    case liteserver_desc::ID:
+      func(static_cast<liteserver_desc &>(obj));
+      return true;
+    case liteserver_config_local::ID:
+      func(static_cast<liteserver_config_local &>(obj));
+      return true;
+    case liteserver_config_random_local::ID:
+      func(static_cast<liteserver_config_random_local &>(obj));
+      return true;
+    case overlay_fec_received::ID:
+      func(static_cast<overlay_fec_received &>(obj));
+      return true;
+    case overlay_fec_completed::ID:
+      func(static_cast<overlay_fec_completed &>(obj));
+      return true;
+    case overlay_unicast::ID:
+      func(static_cast<overlay_unicast &>(obj));
+      return true;
+    case overlay_broadcast::ID:
+      func(static_cast<overlay_broadcast &>(obj));
+      return true;
+    case overlay_broadcastFec::ID:
+      func(static_cast<overlay_broadcastFec &>(obj));
+      return true;
+    case overlay_broadcastFecShort::ID:
+      func(static_cast<overlay_broadcastFecShort &>(obj));
+      return true;
+    case overlay_broadcastNotFound::ID:
+      func(static_cast<overlay_broadcastNotFound &>(obj));
+      return true;
+    case overlay_broadcastList::ID:
+      func(static_cast<overlay_broadcastList &>(obj));
+      return true;
+    case overlay_certificate::ID:
+      func(static_cast<overlay_certificate &>(obj));
+      return true;
+    case overlay_emptyCertificate::ID:
+      func(static_cast<overlay_emptyCertificate &>(obj));
+      return true;
+    case overlay_certificateId::ID:
+      func(static_cast<overlay_certificateId &>(obj));
+      return true;
+    case overlay_message::ID:
+      func(static_cast<overlay_message &>(obj));
+      return true;
+    case overlay_node::ID:
+      func(static_cast<overlay_node &>(obj));
+      return true;
+    case overlay_nodes::ID:
+      func(static_cast<overlay_nodes &>(obj));
+      return true;
+    case overlay_broadcast_id::ID:
+      func(static_cast<overlay_broadcast_id &>(obj));
+      return true;
+    case overlay_broadcast_toSign::ID:
+      func(static_cast<overlay_broadcast_toSign &>(obj));
+      return true;
+    case overlay_broadcastFec_id::ID:
+      func(static_cast<overlay_broadcastFec_id &>(obj));
+      return true;
+    case overlay_broadcastFec_partId::ID:
+      func(static_cast<overlay_broadcastFec_partId &>(obj));
+      return true;
+    case overlay_db_key_nodes::ID:
+      func(static_cast<overlay_db_key_nodes &>(obj));
+      return true;
+    case overlay_db_nodes::ID:
+      func(static_cast<overlay_db_nodes &>(obj));
+      return true;
+    case overlay_node_toSign::ID:
+      func(static_cast<overlay_node_toSign &>(obj));
+      return true;
+    case rldp_message::ID:
+      func(static_cast<rldp_message &>(obj));
+      return true;
+    case rldp_query::ID:
+      func(static_cast<rldp_query &>(obj));
+      return true;
+    case rldp_answer::ID:
+      func(static_cast<rldp_answer &>(obj));
+      return true;
+    case rldp_messagePart::ID:
+      func(static_cast<rldp_messagePart &>(obj));
+      return true;
+    case rldp_confirm::ID:
+      func(static_cast<rldp_confirm &>(obj));
+      return true;
+    case rldp_complete::ID:
+      func(static_cast<rldp_complete &>(obj));
+      return true;
+    case tcp_authentificate::ID:
+      func(static_cast<tcp_authentificate &>(obj));
+      return true;
+    case tcp_authentificationNonce::ID:
+      func(static_cast<tcp_authentificationNonce &>(obj));
+      return true;
+    case tcp_authentificationComplete::ID:
+      func(static_cast<tcp_authentificationComplete &>(obj));
+      return true;
+    case tcp_pong::ID:
+      func(static_cast<tcp_pong &>(obj));
+      return true;
+    case ton_blockId::ID:
+      func(static_cast<ton_blockId &>(obj));
+      return true;
+    case ton_blockIdApprove::ID:
+      func(static_cast<ton_blockIdApprove &>(obj));
+      return true;
+    case tonNode_blockDescriptionEmpty::ID:
+      func(static_cast<tonNode_blockDescriptionEmpty &>(obj));
+      return true;
+    case tonNode_blockDescription::ID:
+      func(static_cast<tonNode_blockDescription &>(obj));
+      return true;
+    case tonNode_blockId::ID:
+      func(static_cast<tonNode_blockId &>(obj));
+      return true;
+    case tonNode_blockIdExt::ID:
+      func(static_cast<tonNode_blockIdExt &>(obj));
+      return true;
+    case tonNode_blockSignature::ID:
+      func(static_cast<tonNode_blockSignature &>(obj));
+      return true;
+    case tonNode_blockBroadcast::ID:
+      func(static_cast<tonNode_blockBroadcast &>(obj));
+      return true;
+    case tonNode_ihrMessageBroadcast::ID:
+      func(static_cast<tonNode_ihrMessageBroadcast &>(obj));
+      return true;
+    case tonNode_externalMessageBroadcast::ID:
+      func(static_cast<tonNode_externalMessageBroadcast &>(obj));
+      return true;
+    case tonNode_newShardBlockBroadcast::ID:
+      func(static_cast<tonNode_newShardBlockBroadcast &>(obj));
+      return true;
+    case tonNode_data::ID:
+      func(static_cast<tonNode_data &>(obj));
+      return true;
+    case tonNode_externalMessage::ID:
+      func(static_cast<tonNode_externalMessage &>(obj));
+      return true;
+    case tonNode_ihrMessage::ID:
+      func(static_cast<tonNode_ihrMessage &>(obj));
+      return true;
+    case tonNode_keyBlocks::ID:
+      func(static_cast<tonNode_keyBlocks &>(obj));
+      return true;
+    case tonNode_newShardBlock::ID:
+      func(static_cast<tonNode_newShardBlock &>(obj));
+      return true;
+    case tonNode_prepared::ID:
+      func(static_cast<tonNode_prepared &>(obj));
+      return true;
+    case tonNode_notFound::ID:
+      func(static_cast<tonNode_notFound &>(obj));
+      return true;
+    case tonNode_preparedProofEmpty::ID:
+      func(static_cast<tonNode_preparedProofEmpty &>(obj));
+      return true;
+    case tonNode_preparedProof::ID:
+      func(static_cast<tonNode_preparedProof &>(obj));
+      return true;
+    case tonNode_preparedProofLink::ID:
+      func(static_cast<tonNode_preparedProofLink &>(obj));
+      return true;
+    case tonNode_preparedState::ID:
+      func(static_cast<tonNode_preparedState &>(obj));
+      return true;
+    case tonNode_notFoundState::ID:
+      func(static_cast<tonNode_notFoundState &>(obj));
+      return true;
+    case tonNode_sessionId::ID:
+      func(static_cast<tonNode_sessionId &>(obj));
+      return true;
+    case tonNode_shardPublicOverlayId::ID:
+      func(static_cast<tonNode_shardPublicOverlayId &>(obj));
+      return true;
+    case tonNode_zeroStateIdExt::ID:
+      func(static_cast<tonNode_zeroStateIdExt &>(obj));
+      return true;
+    case validator_group::ID:
+      func(static_cast<validator_group &>(obj));
+      return true;
+    case validator_config_global::ID:
+      func(static_cast<validator_config_global &>(obj));
+      return true;
+    case validator_config_local::ID:
+      func(static_cast<validator_config_local &>(obj));
+      return true;
+    case validator_config_random_local::ID:
+      func(static_cast<validator_config_random_local &>(obj));
+      return true;
+    case validatorSession_blockUpdate::ID:
+      func(static_cast<validatorSession_blockUpdate &>(obj));
+      return true;
+    case validatorSession_candidate::ID:
+      func(static_cast<validatorSession_candidate &>(obj));
+      return true;
+    case validatorSession_candidateId::ID:
+      func(static_cast<validatorSession_candidateId &>(obj));
+      return true;
+    case validatorSession_config::ID:
+      func(static_cast<validatorSession_config &>(obj));
+      return true;
+    case validatorSession_message_startSession::ID:
+      func(static_cast<validatorSession_message_startSession &>(obj));
+      return true;
+    case validatorSession_message_finishSession::ID:
+      func(static_cast<validatorSession_message_finishSession &>(obj));
+      return true;
+    case validatorSession_pong::ID:
+      func(static_cast<validatorSession_pong &>(obj));
+      return true;
+    case validatorSession_round_id::ID:
+      func(static_cast<validatorSession_round_id &>(obj));
+      return true;
+    case validatorSession_message_submittedBlock::ID:
+      func(static_cast<validatorSession_message_submittedBlock &>(obj));
+      return true;
+    case validatorSession_message_approvedBlock::ID:
+      func(static_cast<validatorSession_message_approvedBlock &>(obj));
+      return true;
+    case validatorSession_message_rejectedBlock::ID:
+      func(static_cast<validatorSession_message_rejectedBlock &>(obj));
+      return true;
+    case validatorSession_message_commit::ID:
+      func(static_cast<validatorSession_message_commit &>(obj));
+      return true;
+    case validatorSession_message_vote::ID:
+      func(static_cast<validatorSession_message_vote &>(obj));
+      return true;
+    case validatorSession_message_voteFor::ID:
+      func(static_cast<validatorSession_message_voteFor &>(obj));
+      return true;
+    case validatorSession_message_precommit::ID:
+      func(static_cast<validatorSession_message_precommit &>(obj));
+      return true;
+    case validatorSession_message_empty::ID:
+      func(static_cast<validatorSession_message_empty &>(obj));
+      return true;
+    case validatorSession_candidate_id::ID:
+      func(static_cast<validatorSession_candidate_id &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(Function &obj, const T &func) {
+  switch (obj.get_id()) {
+    case adnl_ping::ID:
+      func(static_cast<adnl_ping &>(obj));
+      return true;
+    case catchain_getBlock::ID:
+      func(static_cast<catchain_getBlock &>(obj));
+      return true;
+    case catchain_getBlockHistory::ID:
+      func(static_cast<catchain_getBlockHistory &>(obj));
+      return true;
+    case catchain_getBlocks::ID:
+      func(static_cast<catchain_getBlocks &>(obj));
+      return true;
+    case catchain_getDifference::ID:
+      func(static_cast<catchain_getDifference &>(obj));
+      return true;
+    case dht_findNode::ID:
+      func(static_cast<dht_findNode &>(obj));
+      return true;
+    case dht_findValue::ID:
+      func(static_cast<dht_findValue &>(obj));
+      return true;
+    case dht_getSignedAddressList::ID:
+      func(static_cast<dht_getSignedAddressList &>(obj));
+      return true;
+    case dht_ping::ID:
+      func(static_cast<dht_ping &>(obj));
+      return true;
+    case dht_query::ID:
+      func(static_cast<dht_query &>(obj));
+      return true;
+    case dht_store::ID:
+      func(static_cast<dht_store &>(obj));
+      return true;
+    case engine_validator_addAdnlId::ID:
+      func(static_cast<engine_validator_addAdnlId &>(obj));
+      return true;
+    case engine_validator_addControlInterface::ID:
+      func(static_cast<engine_validator_addControlInterface &>(obj));
+      return true;
+    case engine_validator_addControlProcess::ID:
+      func(static_cast<engine_validator_addControlProcess &>(obj));
+      return true;
+    case engine_validator_addDhtId::ID:
+      func(static_cast<engine_validator_addDhtId &>(obj));
+      return true;
+    case engine_validator_addListeningPort::ID:
+      func(static_cast<engine_validator_addListeningPort &>(obj));
+      return true;
+    case engine_validator_addLiteserver::ID:
+      func(static_cast<engine_validator_addLiteserver &>(obj));
+      return true;
+    case engine_validator_addProxy::ID:
+      func(static_cast<engine_validator_addProxy &>(obj));
+      return true;
+    case engine_validator_addValidatorAdnlAddress::ID:
+      func(static_cast<engine_validator_addValidatorAdnlAddress &>(obj));
+      return true;
+    case engine_validator_addValidatorPermanentKey::ID:
+      func(static_cast<engine_validator_addValidatorPermanentKey &>(obj));
+      return true;
+    case engine_validator_addValidatorTempKey::ID:
+      func(static_cast<engine_validator_addValidatorTempKey &>(obj));
+      return true;
+    case engine_validator_changeFullNodeAdnlAddress::ID:
+      func(static_cast<engine_validator_changeFullNodeAdnlAddress &>(obj));
+      return true;
+    case engine_validator_checkDhtServers::ID:
+      func(static_cast<engine_validator_checkDhtServers &>(obj));
+      return true;
+    case engine_validator_controlQuery::ID:
+      func(static_cast<engine_validator_controlQuery &>(obj));
+      return true;
+    case engine_validator_createElectionBid::ID:
+      func(static_cast<engine_validator_createElectionBid &>(obj));
+      return true;
+    case engine_validator_delAdnlId::ID:
+      func(static_cast<engine_validator_delAdnlId &>(obj));
+      return true;
+    case engine_validator_delDhtId::ID:
+      func(static_cast<engine_validator_delDhtId &>(obj));
+      return true;
+    case engine_validator_delListeningPort::ID:
+      func(static_cast<engine_validator_delListeningPort &>(obj));
+      return true;
+    case engine_validator_delProxy::ID:
+      func(static_cast<engine_validator_delProxy &>(obj));
+      return true;
+    case engine_validator_delValidatorAdnlAddress::ID:
+      func(static_cast<engine_validator_delValidatorAdnlAddress &>(obj));
+      return true;
+    case engine_validator_delValidatorPermanentKey::ID:
+      func(static_cast<engine_validator_delValidatorPermanentKey &>(obj));
+      return true;
+    case engine_validator_delValidatorTempKey::ID:
+      func(static_cast<engine_validator_delValidatorTempKey &>(obj));
+      return true;
+    case engine_validator_exportPrivateKey::ID:
+      func(static_cast<engine_validator_exportPrivateKey &>(obj));
+      return true;
+    case engine_validator_exportPublicKey::ID:
+      func(static_cast<engine_validator_exportPublicKey &>(obj));
+      return true;
+    case engine_validator_generateKeyPair::ID:
+      func(static_cast<engine_validator_generateKeyPair &>(obj));
+      return true;
+    case engine_validator_getConfig::ID:
+      func(static_cast<engine_validator_getConfig &>(obj));
+      return true;
+    case engine_validator_getStats::ID:
+      func(static_cast<engine_validator_getStats &>(obj));
+      return true;
+    case engine_validator_getTime::ID:
+      func(static_cast<engine_validator_getTime &>(obj));
+      return true;
+    case engine_validator_importPrivateKey::ID:
+      func(static_cast<engine_validator_importPrivateKey &>(obj));
+      return true;
+    case engine_validator_setVerbosity::ID:
+      func(static_cast<engine_validator_setVerbosity &>(obj));
+      return true;
+    case engine_validator_sign::ID:
+      func(static_cast<engine_validator_sign &>(obj));
+      return true;
+    case getTestObject::ID:
+      func(static_cast<getTestObject &>(obj));
+      return true;
+    case overlay_getBroadcast::ID:
+      func(static_cast<overlay_getBroadcast &>(obj));
+      return true;
+    case overlay_getBroadcastList::ID:
+      func(static_cast<overlay_getBroadcastList &>(obj));
+      return true;
+    case overlay_getRandomPeers::ID:
+      func(static_cast<overlay_getRandomPeers &>(obj));
+      return true;
+    case overlay_query::ID:
+      func(static_cast<overlay_query &>(obj));
+      return true;
+    case tcp_ping::ID:
+      func(static_cast<tcp_ping &>(obj));
+      return true;
+    case tonNode_downloadBlock::ID:
+      func(static_cast<tonNode_downloadBlock &>(obj));
+      return true;
+    case tonNode_downloadBlockProof::ID:
+      func(static_cast<tonNode_downloadBlockProof &>(obj));
+      return true;
+    case tonNode_downloadBlockProofLink::ID:
+      func(static_cast<tonNode_downloadBlockProofLink &>(obj));
+      return true;
+    case tonNode_downloadPersistentState::ID:
+      func(static_cast<tonNode_downloadPersistentState &>(obj));
+      return true;
+    case tonNode_downloadZeroState::ID:
+      func(static_cast<tonNode_downloadZeroState &>(obj));
+      return true;
+    case tonNode_getNextBlockDescription::ID:
+      func(static_cast<tonNode_getNextBlockDescription &>(obj));
+      return true;
+    case tonNode_getNextKeyBlockIds::ID:
+      func(static_cast<tonNode_getNextKeyBlockIds &>(obj));
+      return true;
+    case tonNode_prepareBlock::ID:
+      func(static_cast<tonNode_prepareBlock &>(obj));
+      return true;
+    case tonNode_prepareBlockProof::ID:
+      func(static_cast<tonNode_prepareBlockProof &>(obj));
+      return true;
+    case tonNode_preparePersistentState::ID:
+      func(static_cast<tonNode_preparePersistentState &>(obj));
+      return true;
+    case tonNode_prepareZeroState::ID:
+      func(static_cast<tonNode_prepareZeroState &>(obj));
+      return true;
+    case validatorSession_downloadCandidate::ID:
+      func(static_cast<validatorSession_downloadCandidate &>(obj));
+      return true;
+    case validatorSession_ping::ID:
+      func(static_cast<validatorSession_ping &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(Hashable &obj, const T &func) {
+  switch (obj.get_id()) {
+    case hashable_bool::ID:
+      func(static_cast<hashable_bool &>(obj));
+      return true;
+    case hashable_int32::ID:
+      func(static_cast<hashable_int32 &>(obj));
+      return true;
+    case hashable_int64::ID:
+      func(static_cast<hashable_int64 &>(obj));
+      return true;
+    case hashable_int256::ID:
+      func(static_cast<hashable_int256 &>(obj));
+      return true;
+    case hashable_bytes::ID:
+      func(static_cast<hashable_bytes &>(obj));
+      return true;
+    case hashable_pair::ID:
+      func(static_cast<hashable_pair &>(obj));
+      return true;
+    case hashable_vector::ID:
+      func(static_cast<hashable_vector &>(obj));
+      return true;
+    case hashable_validatorSessionOldRound::ID:
+      func(static_cast<hashable_validatorSessionOldRound &>(obj));
+      return true;
+    case hashable_validatorSessionRoundAttempt::ID:
+      func(static_cast<hashable_validatorSessionRoundAttempt &>(obj));
+      return true;
+    case hashable_validatorSessionRound::ID:
+      func(static_cast<hashable_validatorSessionRound &>(obj));
+      return true;
+    case hashable_blockSignature::ID:
+      func(static_cast<hashable_blockSignature &>(obj));
+      return true;
+    case hashable_sentBlock::ID:
+      func(static_cast<hashable_sentBlock &>(obj));
+      return true;
+    case hashable_sentBlockEmpty::ID:
+      func(static_cast<hashable_sentBlockEmpty &>(obj));
+      return true;
+    case hashable_vote::ID:
+      func(static_cast<hashable_vote &>(obj));
+      return true;
+    case hashable_blockCandidate::ID:
+      func(static_cast<hashable_blockCandidate &>(obj));
+      return true;
+    case hashable_blockVoteCandidate::ID:
+      func(static_cast<hashable_blockVoteCandidate &>(obj));
+      return true;
+    case hashable_blockCandidateAttempt::ID:
+      func(static_cast<hashable_blockCandidateAttempt &>(obj));
+      return true;
+    case hashable_cntVector::ID:
+      func(static_cast<hashable_cntVector &>(obj));
+      return true;
+    case hashable_cntSortedVector::ID:
+      func(static_cast<hashable_cntSortedVector &>(obj));
+      return true;
+    case hashable_validatorSession::ID:
+      func(static_cast<hashable_validatorSession &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(PrivateKey &obj, const T &func) {
+  switch (obj.get_id()) {
+    case pk_unenc::ID:
+      func(static_cast<pk_unenc &>(obj));
+      return true;
+    case pk_ed25519::ID:
+      func(static_cast<pk_ed25519 &>(obj));
+      return true;
+    case pk_aes::ID:
+      func(static_cast<pk_aes &>(obj));
+      return true;
+    case pk_overlay::ID:
+      func(static_cast<pk_overlay &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(PublicKey &obj, const T &func) {
+  switch (obj.get_id()) {
+    case pub_unenc::ID:
+      func(static_cast<pub_unenc &>(obj));
+      return true;
+    case pub_ed25519::ID:
+      func(static_cast<pub_ed25519 &>(obj));
+      return true;
+    case pub_aes::ID:
+      func(static_cast<pub_aes &>(obj));
+      return true;
+    case pub_overlay::ID:
+      func(static_cast<pub_overlay &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(TestObject &obj, const T &func) {
+  switch (obj.get_id()) {
+    case testObject::ID:
+      func(static_cast<testObject &>(obj));
+      return true;
+    case testString::ID:
+      func(static_cast<testString &>(obj));
+      return true;
+    case testInt::ID:
+      func(static_cast<testInt &>(obj));
+      return true;
+    case testVectorBytes::ID:
+      func(static_cast<testVectorBytes &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(adnl_Address &obj, const T &func) {
+  switch (obj.get_id()) {
+    case adnl_address_udp::ID:
+      func(static_cast<adnl_address_udp &>(obj));
+      return true;
+    case adnl_address_udp6::ID:
+      func(static_cast<adnl_address_udp6 &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(adnl_Message &obj, const T &func) {
+  switch (obj.get_id()) {
+    case adnl_message_createChannel::ID:
+      func(static_cast<adnl_message_createChannel &>(obj));
+      return true;
+    case adnl_message_confirmChannel::ID:
+      func(static_cast<adnl_message_confirmChannel &>(obj));
+      return true;
+    case adnl_message_custom::ID:
+      func(static_cast<adnl_message_custom &>(obj));
+      return true;
+    case adnl_message_nop::ID:
+      func(static_cast<adnl_message_nop &>(obj));
+      return true;
+    case adnl_message_reinit::ID:
+      func(static_cast<adnl_message_reinit &>(obj));
+      return true;
+    case adnl_message_query::ID:
+      func(static_cast<adnl_message_query &>(obj));
+      return true;
+    case adnl_message_answer::ID:
+      func(static_cast<adnl_message_answer &>(obj));
+      return true;
+    case adnl_message_part::ID:
+      func(static_cast<adnl_message_part &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(adnl_Proxy &obj, const T &func) {
+  switch (obj.get_id()) {
+    case adnl_proxy_none::ID:
+      func(static_cast<adnl_proxy_none &>(obj));
+      return true;
+    case adnl_proxy_fast::ID:
+      func(static_cast<adnl_proxy_fast &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(catchain_BlockResult &obj, const T &func) {
+  switch (obj.get_id()) {
+    case catchain_blockNotFound::ID:
+      func(static_cast<catchain_blockNotFound &>(obj));
+      return true;
+    case catchain_blockResult::ID:
+      func(static_cast<catchain_blockResult &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(catchain_Difference &obj, const T &func) {
+  switch (obj.get_id()) {
+    case catchain_difference::ID:
+      func(static_cast<catchain_difference &>(obj));
+      return true;
+    case catchain_differenceFork::ID:
+      func(static_cast<catchain_differenceFork &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(catchain_block_inner_Data &obj, const T &func) {
+  switch (obj.get_id()) {
+    case catchain_block_data_badBlock::ID:
+      func(static_cast<catchain_block_data_badBlock &>(obj));
+      return true;
+    case catchain_block_data_fork::ID:
+      func(static_cast<catchain_block_data_fork &>(obj));
+      return true;
+    case catchain_block_data_nop::ID:
+      func(static_cast<catchain_block_data_nop &>(obj));
+      return true;
+    case catchain_block_data_vector::ID:
+      func(static_cast<catchain_block_data_vector &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(db_block_Info &obj, const T &func) {
+  switch (obj.get_id()) {
+    case db_block_info::ID:
+      func(static_cast<db_block_info &>(obj));
+      return true;
+    case db_block_archivedInfo::ID:
+      func(static_cast<db_block_archivedInfo &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(db_blockdb_Key &obj, const T &func) {
+  switch (obj.get_id()) {
+    case db_blockdb_key_lru::ID:
+      func(static_cast<db_blockdb_key_lru &>(obj));
+      return true;
+    case db_blockdb_key_value::ID:
+      func(static_cast<db_blockdb_key_value &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(db_filedb_Key &obj, const T &func) {
+  switch (obj.get_id()) {
+    case db_filedb_key_empty::ID:
+      func(static_cast<db_filedb_key_empty &>(obj));
+      return true;
+    case db_filedb_key_blockFile::ID:
+      func(static_cast<db_filedb_key_blockFile &>(obj));
+      return true;
+    case db_filedb_key_zeroStateFile::ID:
+      func(static_cast<db_filedb_key_zeroStateFile &>(obj));
+      return true;
+    case db_filedb_key_persistentStateFile::ID:
+      func(static_cast<db_filedb_key_persistentStateFile &>(obj));
+      return true;
+    case db_filedb_key_proof::ID:
+      func(static_cast<db_filedb_key_proof &>(obj));
+      return true;
+    case db_filedb_key_proofLink::ID:
+      func(static_cast<db_filedb_key_proofLink &>(obj));
+      return true;
+    case db_filedb_key_signatures::ID:
+      func(static_cast<db_filedb_key_signatures &>(obj));
+      return true;
+    case db_filedb_key_candidate::ID:
+      func(static_cast<db_filedb_key_candidate &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(db_lt_Key &obj, const T &func) {
+  switch (obj.get_id()) {
+    case db_lt_el_key::ID:
+      func(static_cast<db_lt_el_key &>(obj));
+      return true;
+    case db_lt_desc_key::ID:
+      func(static_cast<db_lt_desc_key &>(obj));
+      return true;
+    case db_lt_shard_key::ID:
+      func(static_cast<db_lt_shard_key &>(obj));
+      return true;
+    case db_lt_status_key::ID:
+      func(static_cast<db_lt_status_key &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(db_root_Key &obj, const T &func) {
+  switch (obj.get_id()) {
+    case db_root_key_cellDb::ID:
+      func(static_cast<db_root_key_cellDb &>(obj));
+      return true;
+    case db_root_key_blockDb::ID:
+      func(static_cast<db_root_key_blockDb &>(obj));
+      return true;
+    case db_root_key_config::ID:
+      func(static_cast<db_root_key_config &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(db_state_Key &obj, const T &func) {
+  switch (obj.get_id()) {
+    case db_state_key_destroyedSessions::ID:
+      func(static_cast<db_state_key_destroyedSessions &>(obj));
+      return true;
+    case db_state_key_initBlockId::ID:
+      func(static_cast<db_state_key_initBlockId &>(obj));
+      return true;
+    case db_state_key_gcBlockId::ID:
+      func(static_cast<db_state_key_gcBlockId &>(obj));
+      return true;
+    case db_state_key_shardClient::ID:
+      func(static_cast<db_state_key_shardClient &>(obj));
+      return true;
+    case db_state_key_asyncSerializer::ID:
+      func(static_cast<db_state_key_asyncSerializer &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(dht_UpdateRule &obj, const T &func) {
+  switch (obj.get_id()) {
+    case dht_updateRule_signature::ID:
+      func(static_cast<dht_updateRule_signature &>(obj));
+      return true;
+    case dht_updateRule_anybody::ID:
+      func(static_cast<dht_updateRule_anybody &>(obj));
+      return true;
+    case dht_updateRule_overlayNodes::ID:
+      func(static_cast<dht_updateRule_overlayNodes &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(dht_ValueResult &obj, const T &func) {
+  switch (obj.get_id()) {
+    case dht_valueNotFound::ID:
+      func(static_cast<dht_valueNotFound &>(obj));
+      return true;
+    case dht_valueFound::ID:
+      func(static_cast<dht_valueFound &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(dht_config_Local &obj, const T &func) {
+  switch (obj.get_id()) {
+    case dht_config_local::ID:
+      func(static_cast<dht_config_local &>(obj));
+      return true;
+    case dht_config_random_local::ID:
+      func(static_cast<dht_config_random_local &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(engine_Addr &obj, const T &func) {
+  switch (obj.get_id()) {
+    case engine_addr::ID:
+      func(static_cast<engine_addr &>(obj));
+      return true;
+    case engine_addrProxy::ID:
+      func(static_cast<engine_addrProxy &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(fec_Type &obj, const T &func) {
+  switch (obj.get_id()) {
+    case fec_raptorQ::ID:
+      func(static_cast<fec_raptorQ &>(obj));
+      return true;
+    case fec_roundRobin::ID:
+      func(static_cast<fec_roundRobin &>(obj));
+      return true;
+    case fec_online::ID:
+      func(static_cast<fec_online &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(liteserver_config_Local &obj, const T &func) {
+  switch (obj.get_id()) {
+    case liteserver_config_local::ID:
+      func(static_cast<liteserver_config_local &>(obj));
+      return true;
+    case liteserver_config_random_local::ID:
+      func(static_cast<liteserver_config_random_local &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(overlay_Broadcast &obj, const T &func) {
+  switch (obj.get_id()) {
+    case overlay_fec_received::ID:
+      func(static_cast<overlay_fec_received &>(obj));
+      return true;
+    case overlay_fec_completed::ID:
+      func(static_cast<overlay_fec_completed &>(obj));
+      return true;
+    case overlay_unicast::ID:
+      func(static_cast<overlay_unicast &>(obj));
+      return true;
+    case overlay_broadcast::ID:
+      func(static_cast<overlay_broadcast &>(obj));
+      return true;
+    case overlay_broadcastFec::ID:
+      func(static_cast<overlay_broadcastFec &>(obj));
+      return true;
+    case overlay_broadcastFecShort::ID:
+      func(static_cast<overlay_broadcastFecShort &>(obj));
+      return true;
+    case overlay_broadcastNotFound::ID:
+      func(static_cast<overlay_broadcastNotFound &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(overlay_Certificate &obj, const T &func) {
+  switch (obj.get_id()) {
+    case overlay_certificate::ID:
+      func(static_cast<overlay_certificate &>(obj));
+      return true;
+    case overlay_emptyCertificate::ID:
+      func(static_cast<overlay_emptyCertificate &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(rldp_Message &obj, const T &func) {
+  switch (obj.get_id()) {
+    case rldp_message::ID:
+      func(static_cast<rldp_message &>(obj));
+      return true;
+    case rldp_query::ID:
+      func(static_cast<rldp_query &>(obj));
+      return true;
+    case rldp_answer::ID:
+      func(static_cast<rldp_answer &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(rldp_MessagePart &obj, const T &func) {
+  switch (obj.get_id()) {
+    case rldp_messagePart::ID:
+      func(static_cast<rldp_messagePart &>(obj));
+      return true;
+    case rldp_confirm::ID:
+      func(static_cast<rldp_confirm &>(obj));
+      return true;
+    case rldp_complete::ID:
+      func(static_cast<rldp_complete &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(tcp_Message &obj, const T &func) {
+  switch (obj.get_id()) {
+    case tcp_authentificate::ID:
+      func(static_cast<tcp_authentificate &>(obj));
+      return true;
+    case tcp_authentificationNonce::ID:
+      func(static_cast<tcp_authentificationNonce &>(obj));
+      return true;
+    case tcp_authentificationComplete::ID:
+      func(static_cast<tcp_authentificationComplete &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(ton_BlockId &obj, const T &func) {
+  switch (obj.get_id()) {
+    case ton_blockId::ID:
+      func(static_cast<ton_blockId &>(obj));
+      return true;
+    case ton_blockIdApprove::ID:
+      func(static_cast<ton_blockIdApprove &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(tonNode_BlockDescription &obj, const T &func) {
+  switch (obj.get_id()) {
+    case tonNode_blockDescriptionEmpty::ID:
+      func(static_cast<tonNode_blockDescriptionEmpty &>(obj));
+      return true;
+    case tonNode_blockDescription::ID:
+      func(static_cast<tonNode_blockDescription &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(tonNode_Broadcast &obj, const T &func) {
+  switch (obj.get_id()) {
+    case tonNode_blockBroadcast::ID:
+      func(static_cast<tonNode_blockBroadcast &>(obj));
+      return true;
+    case tonNode_ihrMessageBroadcast::ID:
+      func(static_cast<tonNode_ihrMessageBroadcast &>(obj));
+      return true;
+    case tonNode_externalMessageBroadcast::ID:
+      func(static_cast<tonNode_externalMessageBroadcast &>(obj));
+      return true;
+    case tonNode_newShardBlockBroadcast::ID:
+      func(static_cast<tonNode_newShardBlockBroadcast &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(tonNode_Prepared &obj, const T &func) {
+  switch (obj.get_id()) {
+    case tonNode_prepared::ID:
+      func(static_cast<tonNode_prepared &>(obj));
+      return true;
+    case tonNode_notFound::ID:
+      func(static_cast<tonNode_notFound &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(tonNode_PreparedProof &obj, const T &func) {
+  switch (obj.get_id()) {
+    case tonNode_preparedProofEmpty::ID:
+      func(static_cast<tonNode_preparedProofEmpty &>(obj));
+      return true;
+    case tonNode_preparedProof::ID:
+      func(static_cast<tonNode_preparedProof &>(obj));
+      return true;
+    case tonNode_preparedProofLink::ID:
+      func(static_cast<tonNode_preparedProofLink &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(tonNode_PreparedState &obj, const T &func) {
+  switch (obj.get_id()) {
+    case tonNode_preparedState::ID:
+      func(static_cast<tonNode_preparedState &>(obj));
+      return true;
+    case tonNode_notFoundState::ID:
+      func(static_cast<tonNode_notFoundState &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(validator_config_Local &obj, const T &func) {
+  switch (obj.get_id()) {
+    case validator_config_local::ID:
+      func(static_cast<validator_config_local &>(obj));
+      return true;
+    case validator_config_random_local::ID:
+      func(static_cast<validator_config_random_local &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(validatorSession_Message &obj, const T &func) {
+  switch (obj.get_id()) {
+    case validatorSession_message_startSession::ID:
+      func(static_cast<validatorSession_message_startSession &>(obj));
+      return true;
+    case validatorSession_message_finishSession::ID:
+      func(static_cast<validatorSession_message_finishSession &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(validatorSession_round_Message &obj, const T &func) {
+  switch (obj.get_id()) {
+    case validatorSession_message_submittedBlock::ID:
+      func(static_cast<validatorSession_message_submittedBlock &>(obj));
+      return true;
+    case validatorSession_message_approvedBlock::ID:
+      func(static_cast<validatorSession_message_approvedBlock &>(obj));
+      return true;
+    case validatorSession_message_rejectedBlock::ID:
+      func(static_cast<validatorSession_message_rejectedBlock &>(obj));
+      return true;
+    case validatorSession_message_commit::ID:
+      func(static_cast<validatorSession_message_commit &>(obj));
+      return true;
+    case validatorSession_message_vote::ID:
+      func(static_cast<validatorSession_message_vote &>(obj));
+      return true;
+    case validatorSession_message_voteFor::ID:
+      func(static_cast<validatorSession_message_voteFor &>(obj));
+      return true;
+    case validatorSession_message_precommit::ID:
+      func(static_cast<validatorSession_message_precommit &>(obj));
+      return true;
+    case validatorSession_message_empty::ID:
+      func(static_cast<validatorSession_message_empty &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+}  // namespace ton_api
+}  // namespace ton 
diff --git a/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api_json.cpp b/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api_json.cpp
new file mode 100644
index 0000000000..b2b2987952
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api_json.cpp
@@ -0,0 +1,7722 @@
+#include "auto/tl/ton_api_json.h"
+
+#include "auto/tl/ton_api.h"
+#include "auto/tl/ton_api.hpp"
+
+#include "tl/tl_json.h"
+
+#include "td/utils/base64.h"
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+
+#include <unordered_map>
+
+namespace ton {
+namespace ton_api{
+  using namespace td;
+Result<int32> tl_constructor_from_string(ton_api::Hashable *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"hashable.bool", -815709156},
+    {"hashable.int32", -743074986},
+    {"hashable.int64", -405107134},
+    {"hashable.int256", 975377359},
+    {"hashable.bytes", 118742546},
+    {"hashable.pair", -941266795},
+    {"hashable.vector", -550190227},
+    {"hashable.validatorSessionOldRound", 1200318377},
+    {"hashable.validatorSessionRoundAttempt", 1276247981},
+    {"hashable.validatorSessionRound", 897011683},
+    {"hashable.blockSignature", 937530018},
+    {"hashable.sentBlock", -1111911125},
+    {"hashable.sentBlockEmpty", -1628289361},
+    {"hashable.vote", -1363203131},
+    {"hashable.blockCandidate", 195670285},
+    {"hashable.blockVoteCandidate", -821202971},
+    {"hashable.blockCandidateAttempt", 1063025931},
+    {"hashable.cntVector", 187199288},
+    {"hashable.cntSortedVector", 2073445977},
+    {"hashable.validatorSession", 1746035669}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::PrivateKey *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"pk.unenc", -1311007952},
+    {"pk.ed25519", 1231561495},
+    {"pk.aes", -1511501513},
+    {"pk.overlay", 933623387}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::PublicKey *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"pub.unenc", -1239464694},
+    {"pub.ed25519", 1209251014},
+    {"pub.aes", 767339988},
+    {"pub.overlay", 884622795}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::TestObject *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"testObject", -1521006198},
+    {"testString", -934972983},
+    {"testInt", 731271633},
+    {"testVectorBytes", 1267407827}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::adnl_Address *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"adnl.address.udp", 1728947943},
+    {"adnl.address.udp6", -484613126}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::adnl_Message *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"adnl.message.createChannel", -428620869},
+    {"adnl.message.confirmChannel", 1625103721},
+    {"adnl.message.custom", 541595893},
+    {"adnl.message.nop", 402186202},
+    {"adnl.message.reinit", 281150752},
+    {"adnl.message.query", -1265895046},
+    {"adnl.message.answer", 262964246},
+    {"adnl.message.part", -45798087}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::adnl_Proxy *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"adnl.proxy.none", -90551726},
+    {"adnl.proxy.fast", 554536094}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::catchain_BlockResult *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"catchain.blockNotFound", -1240397692},
+    {"catchain.blockResult", -1658179513}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::catchain_Difference *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"catchain.difference", 336974282},
+    {"catchain.differenceFork", 1227341935}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::catchain_block_inner_Data *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"catchain.block.data.badBlock", -1241359786},
+    {"catchain.block.data.fork", 1685731922},
+    {"catchain.block.data.nop", 1417852112},
+    {"catchain.block.data.vector", 1688809258}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::db_block_Info *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"db.block.info", 1254549287},
+    {"db.block.archivedInfo", 543128145}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::db_blockdb_Key *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"db.blockdb.key.lru", 1354536506},
+    {"db.blockdb.key.value", 2136461683}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::db_filedb_Key *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"db.filedb.key.empty", 2080319307},
+    {"db.filedb.key.blockFile", -1326783375},
+    {"db.filedb.key.zeroStateFile", 307398205},
+    {"db.filedb.key.persistentStateFile", -1346996660},
+    {"db.filedb.key.proof", -627749396},
+    {"db.filedb.key.proofLink", -1728330290},
+    {"db.filedb.key.signatures", -685175541},
+    {"db.filedb.key.candidate", -494269767}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::db_lt_Key *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"db.lt.el.key", -1523442974},
+    {"db.lt.desc.key", -236722287},
+    {"db.lt.shard.key", 1353120015},
+    {"db.lt.status.key", 2003591255}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::db_root_Key *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"db.root.key.cellDb", 1928966974},
+    {"db.root.key.blockDb", 806534976},
+    {"db.root.key.config", 331559556}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::db_state_Key *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"db.state.key.destroyedSessions", -386404007},
+    {"db.state.key.initBlockId", 1971484899},
+    {"db.state.key.gcBlockId", -1015417890},
+    {"db.state.key.shardClient", -912576121},
+    {"db.state.key.asyncSerializer", 699304479}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::dht_UpdateRule *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"dht.updateRule.signature", -861982217},
+    {"dht.updateRule.anybody", 1633127956},
+    {"dht.updateRule.overlayNodes", 645370755}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::dht_ValueResult *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"dht.valueNotFound", -1570634392},
+    {"dht.valueFound", -468912268}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::dht_config_Local *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"dht.config.local", 1981827695},
+    {"dht.config.random.local", -1679088265}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::engine_Addr *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"engine.addr", -281993236},
+    {"engine.addrProxy", -1965071031}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::fec_Type *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"fec.raptorQ", -1953257504},
+    {"fec.roundRobin", 854927588},
+    {"fec.online", 19359244}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::liteserver_config_Local *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"liteserver.config.local", 1182002063},
+    {"liteserver.config.random.local", 2093565243}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::overlay_Broadcast *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"overlay.fec.received", -715385620},
+    {"overlay.fec.completed", 165112084},
+    {"overlay.unicast", 861097508},
+    {"overlay.broadcast", -1319490709},
+    {"overlay.broadcastFec", -1160264854},
+    {"overlay.broadcastFecShort", -242740414},
+    {"overlay.broadcastNotFound", -1786366428}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::overlay_Certificate *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"overlay.certificate", -526461135},
+    {"overlay.emptyCertificate", 853195983}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::rldp_Message *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"rldp.message", 2098973982},
+    {"rldp.query", -1971761815},
+    {"rldp.answer", -1543742461}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::rldp_MessagePart *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"rldp.messagePart", 408691404},
+    {"rldp.confirm", -175973288},
+    {"rldp.complete", -1140018497}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::tcp_Message *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"tcp.authentificate", 1146858258},
+    {"tcp.authentificationNonce", -480425290},
+    {"tcp.authentificationComplete", -139616602}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::ton_BlockId *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"ton.blockId", -989106576},
+    {"ton.blockIdApprove", 768887369}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::tonNode_BlockDescription *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"tonNode.blockDescriptionEmpty", -2088456555},
+    {"tonNode.blockDescription", 1185009800}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::tonNode_Broadcast *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"tonNode.blockBroadcast", -1372712699},
+    {"tonNode.ihrMessageBroadcast", 1381868723},
+    {"tonNode.externalMessageBroadcast", 1025185895},
+    {"tonNode.newShardBlockBroadcast", 183696060}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::tonNode_Prepared *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"tonNode.prepared", -356205619},
+    {"tonNode.notFound", -490521178}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::tonNode_PreparedProof *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"tonNode.preparedProofEmpty", -949370502},
+    {"tonNode.preparedProof", -1986028981},
+    {"tonNode.preparedProofLink", 1040134797}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::tonNode_PreparedState *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"tonNode.preparedState", 928762733},
+    {"tonNode.notFoundState", 842598993}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::validator_config_Local *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"validator.config.local", 1716256616},
+    {"validator.config.random.local", 1501795426}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::validatorSession_Message *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"validatorSession.message.startSession", -1767807279},
+    {"validatorSession.message.finishSession", -879025437}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::validatorSession_round_Message *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"validatorSession.message.submittedBlock", 309732534},
+    {"validatorSession.message.approvedBlock", 77968769},
+    {"validatorSession.message.rejectedBlock", -1786229141},
+    {"validatorSession.message.commit", -1408065803},
+    {"validatorSession.message.vote", -1707978297},
+    {"validatorSession.message.voteFor", 1643183663},
+    {"validatorSession.message.precommit", -1470843566},
+    {"validatorSession.message.empty", 1243619241}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::Object *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"hashable.bool", -815709156},
+    {"hashable.int32", -743074986},
+    {"hashable.int64", -405107134},
+    {"hashable.int256", 975377359},
+    {"hashable.bytes", 118742546},
+    {"hashable.pair", -941266795},
+    {"hashable.vector", -550190227},
+    {"hashable.validatorSessionOldRound", 1200318377},
+    {"hashable.validatorSessionRoundAttempt", 1276247981},
+    {"hashable.validatorSessionRound", 897011683},
+    {"hashable.blockSignature", 937530018},
+    {"hashable.sentBlock", -1111911125},
+    {"hashable.sentBlockEmpty", -1628289361},
+    {"hashable.vote", -1363203131},
+    {"hashable.blockCandidate", 195670285},
+    {"hashable.blockVoteCandidate", -821202971},
+    {"hashable.blockCandidateAttempt", 1063025931},
+    {"hashable.cntVector", 187199288},
+    {"hashable.cntSortedVector", 2073445977},
+    {"hashable.validatorSession", 1746035669},
+    {"pk.unenc", -1311007952},
+    {"pk.ed25519", 1231561495},
+    {"pk.aes", -1511501513},
+    {"pk.overlay", 933623387},
+    {"pub.unenc", -1239464694},
+    {"pub.ed25519", 1209251014},
+    {"pub.aes", 767339988},
+    {"pub.overlay", 884622795},
+    {"testObject", -1521006198},
+    {"testString", -934972983},
+    {"testInt", 731271633},
+    {"testVectorBytes", 1267407827},
+    {"adnl.address.udp", 1728947943},
+    {"adnl.address.udp6", -484613126},
+    {"adnl.addressList", 573040216},
+    {"adnl.message.createChannel", -428620869},
+    {"adnl.message.confirmChannel", 1625103721},
+    {"adnl.message.custom", 541595893},
+    {"adnl.message.nop", 402186202},
+    {"adnl.message.reinit", 281150752},
+    {"adnl.message.query", -1265895046},
+    {"adnl.message.answer", 262964246},
+    {"adnl.message.part", -45798087},
+    {"adnl.node", 1800802949},
+    {"adnl.nodes", -1576412330},
+    {"adnl.packetContents", -784151159},
+    {"adnl.pong", 544504846},
+    {"adnl.proxy.none", -90551726},
+    {"adnl.proxy.fast", 554536094},
+    {"adnl.proxyToFastHash", -574752674},
+    {"adnl.proxyToFast", -1259462186},
+    {"adnl.config.global", -1099988784},
+    {"adnl.db.node.key", -979114962},
+    {"adnl.db.node.value", 1415390983},
+    {"adnl.id.short", 1044342095},
+    {"catchain.block", -699055756},
+    {"catchain.blockNotFound", -1240397692},
+    {"catchain.blockResult", -1658179513},
+    {"catchain.blocks", 1357697473},
+    {"catchain.difference", 336974282},
+    {"catchain.differenceFork", 1227341935},
+    {"catchain.firstblock", 281609467},
+    {"catchain.sent", -84454993},
+    {"catchain.blockUpdate", 593975492},
+    {"catchain.block.data", -122903008},
+    {"catchain.block.dep", 1511706959},
+    {"catchain.block.id", 620665018},
+    {"catchain.block.data.badBlock", -1241359786},
+    {"catchain.block.data.fork", 1685731922},
+    {"catchain.block.data.nop", 1417852112},
+    {"catchain.block.data.vector", 1688809258},
+    {"catchain.config.global", 1757918801},
+    {"config.global", -198795310},
+    {"config.local", 2023657820},
+    {"control.config.local", 1964895469},
+    {"db.candidate", 1708747482},
+    {"db.block.info", 1254549287},
+    {"db.block.archivedInfo", 543128145},
+    {"db.blockdb.key.lru", 1354536506},
+    {"db.blockdb.key.value", 2136461683},
+    {"db.blockdb.lru", -1055500877},
+    {"db.blockdb.value", -1299266515},
+    {"db.candidate.id", 935375495},
+    {"db.celldb.value", -435153856},
+    {"db.celldb.key.value", 1538341155},
+    {"db.filedb.key.empty", 2080319307},
+    {"db.filedb.key.blockFile", -1326783375},
+    {"db.filedb.key.zeroStateFile", 307398205},
+    {"db.filedb.key.persistentStateFile", -1346996660},
+    {"db.filedb.key.proof", -627749396},
+    {"db.filedb.key.proofLink", -1728330290},
+    {"db.filedb.key.signatures", -685175541},
+    {"db.filedb.key.candidate", -494269767},
+    {"db.filedb.value", -220390867},
+    {"db.lt.el.key", -1523442974},
+    {"db.lt.desc.key", -236722287},
+    {"db.lt.shard.key", 1353120015},
+    {"db.lt.status.key", 2003591255},
+    {"db.lt.desc.value", 1907315124},
+    {"db.lt.el.value", -1780064412},
+    {"db.lt.shard.value", 1014209147},
+    {"db.lt.status.value", -88150727},
+    {"db.root.config", -703495519},
+    {"db.root.dbDescription", -1273465869},
+    {"db.root.key.cellDb", 1928966974},
+    {"db.root.key.blockDb", 806534976},
+    {"db.root.key.config", 331559556},
+    {"db.state.asyncSerializer", -751883871},
+    {"db.state.destroyedSessions", -1381443196},
+    {"db.state.gcBlockId", -550453937},
+    {"db.state.initBlockId", 1932303605},
+    {"db.state.key.destroyedSessions", -386404007},
+    {"db.state.key.initBlockId", 1971484899},
+    {"db.state.key.gcBlockId", -1015417890},
+    {"db.state.key.shardClient", -912576121},
+    {"db.state.key.asyncSerializer", 699304479},
+    {"db.state.shardClient", 186033821},
+    {"dht.key", -160964977},
+    {"dht.keyDescription", 673009157},
+    {"dht.message", -1140008050},
+    {"dht.node", -2074922424},
+    {"dht.nodes", 2037686462},
+    {"dht.pong", 1519054721},
+    {"dht.stored", 1881602824},
+    {"dht.updateRule.signature", -861982217},
+    {"dht.updateRule.anybody", 1633127956},
+    {"dht.updateRule.overlayNodes", 645370755},
+    {"dht.value", -1867700277},
+    {"dht.valueNotFound", -1570634392},
+    {"dht.valueFound", -468912268},
+    {"dht.config.global", -2066822649},
+    {"dht.config.local", 1981827695},
+    {"dht.config.random.local", -1679088265},
+    {"dht.db.bucket", -1281557908},
+    {"dht.db.key.bucket", -1553420724},
+    {"dummyworkchain0.config.global", -631148845},
+    {"engine.addr", -281993236},
+    {"engine.addrProxy", -1965071031},
+    {"engine.adnl", 1658283344},
+    {"engine.controlInterface", 830566315},
+    {"engine.controlProcess", 1790986263},
+    {"engine.dht", 1575613178},
+    {"engine.gc", -1078093701},
+    {"engine.liteServer", -1150251266},
+    {"engine.validator", -2006980055},
+    {"engine.validatorAdnlAddress", -750434882},
+    {"engine.validatorTempKey", 1581962974},
+    {"engine.adnlProxy.config", 1848000769},
+    {"engine.adnlProxy.port", -117344950},
+    {"engine.dht.config", -197295930},
+    {"engine.validator.config", -1061804008},
+    {"engine.validator.controlQueryError", 1999018527},
+    {"engine.validator.dhtServerStatus", -1323440290},
+    {"engine.validator.dhtServersStatus", 725155112},
+    {"engine.validator.electionBid", 598899261},
+    {"validator.groupMember", -1953208860},
+    {"engine.validator.jsonConfig", 321753611},
+    {"engine.validator.keyHash", -1027168946},
+    {"engine.validator.oneStat", -1533527315},
+    {"engine.validator.signature", -76791000},
+    {"engine.validator.stats", 1565119343},
+    {"engine.validator.success", -1276860789},
+    {"engine.validator.time", -547380738},
+    {"fec.raptorQ", -1953257504},
+    {"fec.roundRobin", 854927588},
+    {"fec.online", 19359244},
+    {"id.config.local", -1834367090},
+    {"liteclient.config.global", 143507704},
+    {"liteserver.desc", -1001806732},
+    {"liteserver.config.local", 1182002063},
+    {"liteserver.config.random.local", 2093565243},
+    {"overlay.fec.received", -715385620},
+    {"overlay.fec.completed", 165112084},
+    {"overlay.unicast", 861097508},
+    {"overlay.broadcast", -1319490709},
+    {"overlay.broadcastFec", -1160264854},
+    {"overlay.broadcastFecShort", -242740414},
+    {"overlay.broadcastNotFound", -1786366428},
+    {"overlay.broadcastList", 416407263},
+    {"overlay.certificate", -526461135},
+    {"overlay.emptyCertificate", 853195983},
+    {"overlay.certificateId", -1884397383},
+    {"overlay.message", 1965368352},
+    {"overlay.node", -1200911741},
+    {"overlay.nodes", -460904178},
+    {"overlay.broadcast.id", 1375565978},
+    {"overlay.broadcast.toSign", -97038724},
+    {"overlay.broadcastFec.id", -80652890},
+    {"overlay.broadcastFec.partId", -1536597296},
+    {"overlay.db.key.nodes", -992972010},
+    {"overlay.db.nodes", -712454630},
+    {"overlay.node.toSign", 64530657},
+    {"rldp.message", 2098973982},
+    {"rldp.query", -1971761815},
+    {"rldp.answer", -1543742461},
+    {"rldp.messagePart", 408691404},
+    {"rldp.confirm", -175973288},
+    {"rldp.complete", -1140018497},
+    {"tcp.authentificate", 1146858258},
+    {"tcp.authentificationNonce", -480425290},
+    {"tcp.authentificationComplete", -139616602},
+    {"tcp.pong", -597034237},
+    {"ton.blockId", -989106576},
+    {"ton.blockIdApprove", 768887369},
+    {"tonNode.blockDescriptionEmpty", -2088456555},
+    {"tonNode.blockDescription", 1185009800},
+    {"tonNode.blockId", -1211256473},
+    {"tonNode.blockIdExt", 1733487480},
+    {"tonNode.blockSignature", 1357921331},
+    {"tonNode.blockBroadcast", -1372712699},
+    {"tonNode.ihrMessageBroadcast", 1381868723},
+    {"tonNode.externalMessageBroadcast", 1025185895},
+    {"tonNode.newShardBlockBroadcast", 183696060},
+    {"tonNode.data", 1443505284},
+    {"tonNode.externalMessage", -596270583},
+    {"tonNode.ihrMessage", 1161085703},
+    {"tonNode.keyBlocks", 124144985},
+    {"tonNode.newShardBlock", -1533165015},
+    {"tonNode.prepared", -356205619},
+    {"tonNode.notFound", -490521178},
+    {"tonNode.preparedProofEmpty", -949370502},
+    {"tonNode.preparedProof", -1986028981},
+    {"tonNode.preparedProofLink", 1040134797},
+    {"tonNode.preparedState", 928762733},
+    {"tonNode.notFoundState", 842598993},
+    {"tonNode.sessionId", 2056402618},
+    {"tonNode.shardPublicOverlayId", 1302254377},
+    {"tonNode.zeroStateIdExt", 494024110},
+    {"validator.group", -120029535},
+    {"validator.config.global", -2038562966},
+    {"validator.config.local", 1716256616},
+    {"validator.config.random.local", 1501795426},
+    {"validatorSession.blockUpdate", -1836855753},
+    {"validatorSession.candidate", 2100525125},
+    {"validatorSession.candidateId", 436135276},
+    {"validatorSession.config", -1235092029},
+    {"validatorSession.message.startSession", -1767807279},
+    {"validatorSession.message.finishSession", -879025437},
+    {"validatorSession.pong", -590989459},
+    {"validatorSession.round.id", 2477989},
+    {"validatorSession.message.submittedBlock", 309732534},
+    {"validatorSession.message.approvedBlock", 77968769},
+    {"validatorSession.message.rejectedBlock", -1786229141},
+    {"validatorSession.message.commit", -1408065803},
+    {"validatorSession.message.vote", -1707978297},
+    {"validatorSession.message.voteFor", 1643183663},
+    {"validatorSession.message.precommit", -1470843566},
+    {"validatorSession.message.empty", 1243619241},
+    {"validatorSession.candidate.id", -1126743751}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(ton_api::Function *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"adnl.ping", 531276223},
+    {"catchain.getBlock", 155049336},
+    {"catchain.getBlockHistory", -1470730762},
+    {"catchain.getBlocks", 53062594},
+    {"catchain.getDifference", -798175528},
+    {"dht.findNode", 1826803307},
+    {"dht.findValue", -1370791919},
+    {"dht.getSignedAddressList", -1451669267},
+    {"dht.ping", -873775336},
+    {"dht.query", 2102593385},
+    {"dht.store", 882065938},
+    {"engine.validator.addAdnlId", -310029141},
+    {"engine.validator.addControlInterface", 881587196},
+    {"engine.validator.addControlProcess", 1524692816},
+    {"engine.validator.addDhtId", -183755124},
+    {"engine.validator.addListeningPort", -362051147},
+    {"engine.validator.addLiteserver", -259387577},
+    {"engine.validator.addProxy", -151178251},
+    {"engine.validator.addValidatorAdnlAddress", -624187774},
+    {"engine.validator.addValidatorPermanentKey", -1844116104},
+    {"engine.validator.addValidatorTempKey", -1926009038},
+    {"engine.validator.changeFullNodeAdnlAddress", -1094268539},
+    {"engine.validator.checkDhtServers", -773578550},
+    {"engine.validator.controlQuery", -1535722048},
+    {"engine.validator.createElectionBid", -451038907},
+    {"engine.validator.delAdnlId", 691696882},
+    {"engine.validator.delDhtId", -2063770818},
+    {"engine.validator.delListeningPort", 828094543},
+    {"engine.validator.delProxy", 1970850941},
+    {"engine.validator.delValidatorAdnlAddress", -150453414},
+    {"engine.validator.delValidatorPermanentKey", 390777082},
+    {"engine.validator.delValidatorTempKey", -1595481903},
+    {"engine.validator.exportPrivateKey", -864911288},
+    {"engine.validator.exportPublicKey", 1647618233},
+    {"engine.validator.generateKeyPair", -349872005},
+    {"engine.validator.getConfig", 1504518693},
+    {"engine.validator.getStats", 1389740817},
+    {"engine.validator.getTime", -515850543},
+    {"engine.validator.importPrivateKey", 360741575},
+    {"engine.validator.setVerbosity", -1316856190},
+    {"engine.validator.sign", 451549736},
+    {"getTestObject", 197109379},
+    {"overlay.getBroadcast", 758510240},
+    {"overlay.getBroadcastList", 1109141562},
+    {"overlay.getRandomPeers", 1223582891},
+    {"overlay.query", -855800765},
+    {"tcp.ping", 1292381082},
+    {"tonNode.downloadBlock", -495814205},
+    {"tonNode.downloadBlockProof", 1272334218},
+    {"tonNode.downloadBlockProofLink", 632488134},
+    {"tonNode.downloadPersistentState", 2140791736},
+    {"tonNode.downloadZeroState", -1379131814},
+    {"tonNode.getNextBlockDescription", 341160179},
+    {"tonNode.getNextKeyBlockIds", -219689029},
+    {"tonNode.prepareBlock", 1973649230},
+    {"tonNode.prepareBlockProof", -2024000760},
+    {"tonNode.preparePersistentState", -18209122},
+    {"tonNode.prepareZeroState", 1104021541},
+    {"validatorSession.downloadCandidate", -520274443},
+    {"validatorSession.ping", 1745111469}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Status from_json(ton_api::hashable_bool &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_int32 &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_int64 &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_int256 &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_bytes &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_pair &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "left", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.left_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "right", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.right_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_vector &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_validatorSessionOldRound &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signatures", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.signatures_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "approve_signatures", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.approve_signatures_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_validatorSessionRoundAttempt &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "votes", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.votes_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "precommitted", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.precommitted_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "vote_for_inited", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.vote_for_inited_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "vote_for", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.vote_for_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_validatorSessionRound &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "locked_round", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.locked_round_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "locked_block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.locked_block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "precommitted", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.precommitted_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "first_attempt", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.first_attempt_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "approved_blocks", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.approved_blocks_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signatures", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.signatures_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "attempts", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.attempts_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_blockSignature &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_sentBlock &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "src", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.src_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "root_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.root_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "file_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.file_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "collated_data_file_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.collated_data_file_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_sentBlockEmpty &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_vote &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "node", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.node_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_blockCandidate &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "approved", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.approved_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_blockVoteCandidate &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "approved", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.approved_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_blockCandidateAttempt &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "votes", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.votes_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_cntVector &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_cntSortedVector &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::hashable_validatorSession &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ts", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ts_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "old_rounds", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.old_rounds_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "cur_round", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.cur_round_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::pk_unenc &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::pk_ed25519 &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::pk_aes &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::pk_overlay &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "name", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.name_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::pub_unenc &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::pub_ed25519 &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::pub_aes &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::pub_overlay &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "name", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.name_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::testObject &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "o", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.o_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "f", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.f_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::testString &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::testInt &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::testVectorBytes &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_vector_bytes(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_address_udp &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_address_udp6 &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_addressList &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "addrs", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.addrs_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "version", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.version_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "reinit_date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.reinit_date_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "priority", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.priority_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "expire_at", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.expire_at_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_message_createChannel &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.date_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_message_confirmChannel &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "peer_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.peer_key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.date_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_message_custom &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_message_nop &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_message_reinit &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.date_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_message_query &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "query_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.query_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "query", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.query_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_message_answer &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "query_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.query_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "answer", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.answer_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_message_part &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "total_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.total_size_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "offset", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.offset_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_node &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "addr_list", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.addr_list_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_nodes &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "nodes", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.nodes_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_packetContents &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "rand1", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.rand1_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "flags", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.flags_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "from", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.from_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "from_short", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.from_short_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "message", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.message_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "messages", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.messages_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "address", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.address_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "priority_address", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.priority_address_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "confirm_seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.confirm_seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "recv_addr_list_version", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.recv_addr_list_version_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "recv_priority_addr_list_version", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.recv_priority_addr_list_version_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "reinit_date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.reinit_date_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "dst_reinit_date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.dst_reinit_date_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "rand2", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.rand2_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_pong &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_proxy_none &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_proxy_fast &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "shared_secret", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.shared_secret_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_proxyToFastHash &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.date_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "shared_secret", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.shared_secret_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_proxyToFast &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.date_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_config_global &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "static_nodes", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.static_nodes_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_db_node_key &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "local_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.local_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "peer_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.peer_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_db_node_value &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.date_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "addr_list", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.addr_list_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "priority_addr_list", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.priority_addr_list_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_id_short &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_block &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "incarnation", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.incarnation_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "src", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.src_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "height", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.height_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_blockNotFound &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_blockResult &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_blocks &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "blocks", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.blocks_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_difference &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "sent_upto", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.sent_upto_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_differenceFork &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "left", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.left_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "right", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.right_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_firstblock &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "unique_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.unique_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "nodes", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.nodes_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_sent &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "cnt", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.cnt_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_blockUpdate &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_block_data &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "prev", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.prev_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "deps", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.deps_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_block_dep &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "src", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.src_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "height", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.height_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_block_id &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "incarnation", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.incarnation_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "src", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.src_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "height", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.height_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_block_data_badBlock &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_block_data_fork &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "left", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.left_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "right", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.right_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_block_data_nop &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_block_data_vector &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "msgs", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_vector_bytes(to.msgs_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_config_global &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "tag", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.tag_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "nodes", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.nodes_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::config_global &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "adnl", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.adnl_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "dht", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.dht_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "validator", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.validator_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::config_local &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "local_ids", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.local_ids_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "dht", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.dht_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "validators", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.validators_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "liteservers", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.liteservers_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "control", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.control_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::control_config_local &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "priv", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.priv_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "pub", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.pub_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_candidate &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "source", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.source_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "collated_data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.collated_data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_block_info &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "flags", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.flags_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "prev_left", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.prev_left_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "prev_right", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.prev_right_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "next_left", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.next_left_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "next_right", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.next_right_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "lt", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.lt_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ts", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ts_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "state", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.state_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_block_archivedInfo &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "flags", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.flags_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "next", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.next_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_blockdb_key_lru &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_blockdb_key_value &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_blockdb_lru &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "prev", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.prev_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "next", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.next_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_blockdb_value &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "next", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.next_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_candidate_id &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "source", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.source_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "collated_data_file_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.collated_data_file_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_celldb_value &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "prev", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.prev_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "next", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.next_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "root_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.root_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_celldb_key_value &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_filedb_key_empty &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::db_filedb_key_blockFile &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_filedb_key_zeroStateFile &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_filedb_key_persistentStateFile &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "masterchain_block_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.masterchain_block_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_filedb_key_proof &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_filedb_key_proofLink &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_filedb_key_signatures &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_filedb_key_candidate &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_filedb_value &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "prev", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.prev_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "next", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.next_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "file_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.file_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_lt_el_key &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "workchain", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.workchain_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "shard", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.shard_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "idx", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.idx_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_lt_desc_key &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "workchain", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.workchain_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "shard", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.shard_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_lt_shard_key &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "idx", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.idx_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_lt_status_key &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::db_lt_desc_value &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "first_idx", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.first_idx_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "last_idx", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.last_idx_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "last_seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.last_seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "last_lt", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.last_lt_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "last_ts", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.last_ts_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_lt_el_value &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "lt", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.lt_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ts", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ts_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_lt_shard_value &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "workchain", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.workchain_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "shard", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.shard_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_lt_status_value &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "total_shards", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.total_shards_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_root_config &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "celldb_version", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.celldb_version_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "blockdb_version", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.blockdb_version_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_root_dbDescription &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "version", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.version_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "first_masterchain_block_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.first_masterchain_block_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "flags", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.flags_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_root_key_cellDb &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "version", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.version_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_root_key_blockDb &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "version", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.version_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_root_key_config &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::db_state_asyncSerializer &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "last", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.last_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "last_ts", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.last_ts_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_state_destroyedSessions &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "sessions", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.sessions_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_state_gcBlockId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_state_initBlockId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::db_state_key_destroyedSessions &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::db_state_key_initBlockId &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::db_state_key_gcBlockId &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::db_state_key_shardClient &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::db_state_key_asyncSerializer &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::db_state_shardClient &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_key &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "name", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.name_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "idx", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.idx_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_keyDescription &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "update_rule", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.update_rule_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_message &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "node", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.node_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_node &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "addr_list", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.addr_list_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "version", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.version_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_nodes &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "nodes", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.nodes_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_pong &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "random_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.random_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_stored &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::dht_updateRule_signature &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::dht_updateRule_anybody &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::dht_updateRule_overlayNodes &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::dht_value &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.value_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ttl", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ttl_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_valueNotFound &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "nodes", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.nodes_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_valueFound &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_config_global &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "static_nodes", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.static_nodes_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "k", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.k_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "a", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.a_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_config_local &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_config_random_local &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "cnt", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.cnt_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_db_bucket &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "nodes", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.nodes_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_db_key_bucket &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dummyworkchain0_config_global &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "zero_state_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.zero_state_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_addr &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "categories", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.categories_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "priority_categories", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.priority_categories_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_addrProxy &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "in_ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.in_ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "in_port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.in_port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "out_ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.out_ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "out_port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.out_port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "proxy_type", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.proxy_type_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "categories", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.categories_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "priority_categories", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.priority_categories_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_adnl &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "category", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.category_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_controlInterface &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "allowed", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.allowed_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_controlProcess &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "permissions", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.permissions_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_dht &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_gc &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ids", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ids_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_liteServer &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "temp_keys", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.temp_keys_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "adnl_addrs", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.adnl_addrs_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "election_date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.election_date_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "expire_at", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.expire_at_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validatorAdnlAddress &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "expire_at", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.expire_at_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validatorTempKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "expire_at", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.expire_at_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_adnlProxy_config &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ports", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ports_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_adnlProxy_port &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "in_port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.in_port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "out_port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.out_port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "dst_ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.dst_ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "dst_port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.dst_port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "proxy_type", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.proxy_type_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_dht_config &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "dht", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.dht_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "gc", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.gc_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_config &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "out_port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.out_port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "addrs", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.addrs_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "adnl", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.adnl_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "dht", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.dht_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "validators", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.validators_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "fullnode", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.fullnode_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "liteservers", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.liteservers_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "control", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.control_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "gc", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.gc_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_controlQueryError &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "code", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.code_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "message", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.message_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_dhtServerStatus &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "status", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.status_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_dhtServersStatus &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "servers", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.servers_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_electionBid &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "election_date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.election_date_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "perm_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.perm_key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "adnl_addr", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.adnl_addr_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "to_send_payload", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.to_send_payload_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validator_groupMember &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "public_key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.public_key_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "adnl", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.adnl_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "weight", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.weight_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_jsonConfig &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_keyHash &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_oneStat &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_signature &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_stats &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "stats", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.stats_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_success &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_time &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "time", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.time_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::fec_raptorQ &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_size_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "symbol_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.symbol_size_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "symbols_count", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.symbols_count_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::fec_roundRobin &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_size_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "symbol_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.symbol_size_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "symbols_count", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.symbols_count_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::fec_online &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_size_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "symbol_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.symbol_size_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "symbols_count", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.symbols_count_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::id_config_local &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::liteclient_config_global &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "liteservers", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.liteservers_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "validator", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.validator_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::liteserver_desc &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::liteserver_config_local &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::liteserver_config_random_local &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_fec_received &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_fec_completed &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_unicast &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_broadcast &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "src", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.src_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "certificate", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.certificate_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "flags", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.flags_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.date_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_broadcastFec &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "src", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.src_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "certificate", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.certificate_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_size_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "flags", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.flags_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "fec", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.fec_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.date_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_broadcastFecShort &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "src", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.src_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "certificate", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.certificate_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "broadcast_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.broadcast_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "part_data_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.part_data_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_broadcastNotFound &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_broadcastList &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "hashes", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.hashes_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_certificate &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "issued_by", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.issued_by_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "expire_at", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.expire_at_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "max_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.max_size_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_emptyCertificate &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_certificateId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "overlay_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.overlay_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "node", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.node_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "expire_at", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.expire_at_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "max_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.max_size_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_message &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "overlay", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.overlay_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_node &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "overlay", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.overlay_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "version", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.version_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_nodes &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "nodes", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.nodes_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_broadcast_id &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "src", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.src_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "flags", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.flags_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_broadcast_toSign &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.date_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_broadcastFec_id &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "src", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.src_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "type", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.type_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.size_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "flags", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.flags_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_broadcastFec_partId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "broadcast_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.broadcast_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.data_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_db_key_nodes &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "local_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.local_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "overlay", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.overlay_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_db_nodes &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "nodes", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.nodes_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_node_toSign &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "overlay", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.overlay_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "version", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.version_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::rldp_message &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::rldp_query &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "query_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.query_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "max_answer_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.max_answer_size_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "timeout", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.timeout_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::rldp_answer &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "query_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.query_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::rldp_messagePart &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "transfer_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.transfer_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "fec_type", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.fec_type_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "part", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.part_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "total_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.total_size_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::rldp_confirm &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "transfer_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.transfer_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "part", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.part_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::rldp_complete &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "transfer_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.transfer_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "part", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.part_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tcp_authentificate &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "nonce", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.nonce_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tcp_authentificationNonce &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "nonce", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.nonce_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tcp_authentificationComplete &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tcp_pong &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "random_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.random_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::ton_blockId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "root_cell_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.root_cell_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "file_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.file_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::ton_blockIdApprove &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "root_cell_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.root_cell_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "file_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.file_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_blockDescriptionEmpty &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_blockDescription &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_blockId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "workchain", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.workchain_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "shard", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.shard_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_blockIdExt &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "workchain", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.workchain_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "shard", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.shard_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "root_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.root_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "file_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.file_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_blockSignature &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "who", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.who_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_blockBroadcast &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "catchain_seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.catchain_seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "validator_set_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.validator_set_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signatures", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.signatures_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "proof", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.proof_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_ihrMessageBroadcast &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "message", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.message_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_externalMessageBroadcast &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "message", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.message_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_newShardBlockBroadcast &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_data &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_externalMessage &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_ihrMessage &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_keyBlocks &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "blocks", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.blocks_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "incomplete", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.incomplete_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "error", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.error_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_newShardBlock &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "cc_seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.cc_seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_prepared &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_notFound &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_preparedProofEmpty &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_preparedProof &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_preparedProofLink &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_preparedState &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_notFoundState &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_sessionId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "workchain", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.workchain_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "shard", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.shard_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "cc_seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.cc_seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "opts_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.opts_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_shardPublicOverlayId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "workchain", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.workchain_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "shard", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.shard_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "zero_state_file_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.zero_state_file_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_zeroStateIdExt &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "workchain", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.workchain_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "root_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.root_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "file_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.file_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validator_group &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "workchain", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.workchain_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "shard", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.shard_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "catchain_seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.catchain_seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "config_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.config_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "members", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.members_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validator_config_global &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "zero_state", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.zero_state_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "init_block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.init_block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "hardforks", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.hardforks_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validator_config_local &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validator_config_random_local &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "addr_list", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.addr_list_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_blockUpdate &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ts", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ts_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "actions", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.actions_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "state", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.state_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_candidate &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "src", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.src_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "round", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.round_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "root_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.root_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "collated_data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.collated_data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_candidateId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "src", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.src_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "root_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.root_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "file_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.file_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "collated_data_file_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.collated_data_file_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_config &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "catchain_idle_timeout", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.catchain_idle_timeout_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "catchain_max_deps", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.catchain_max_deps_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "round_candidates", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.round_candidates_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "next_candidate_delay", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.next_candidate_delay_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "round_attempt_duration", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.round_attempt_duration_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "max_round_attempts", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.max_round_attempts_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "max_block_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.max_block_size_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "max_collated_data_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.max_collated_data_size_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_message_startSession &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_message_finishSession &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_pong &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_round_id &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "session", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.session_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "height", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.height_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "prev_block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.prev_block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_message_submittedBlock &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "round", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.round_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "root_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.root_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "file_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.file_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "collated_data_file_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.collated_data_file_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_message_approvedBlock &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "round", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.round_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "candidate", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.candidate_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_message_rejectedBlock &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "round", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.round_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "candidate", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.candidate_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "reason", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.reason_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_message_commit &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "round", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.round_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "candidate", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.candidate_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "signature", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.signature_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_message_vote &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "round", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.round_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "attempt", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.attempt_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "candidate", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.candidate_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_message_voteFor &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "round", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.round_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "attempt", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.attempt_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "candidate", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.candidate_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_message_precommit &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "round", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.round_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "attempt", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.attempt_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "candidate", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.candidate_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_message_empty &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "round", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.round_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "attempt", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.attempt_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_candidate_id &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "round", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.round_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::adnl_ping &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_getBlock &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_getBlockHistory &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "height", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.height_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "stop_if", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.stop_if_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_getBlocks &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "blocks", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.blocks_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::catchain_getDifference &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "rt", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.rt_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_findNode &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "k", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.k_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_findValue &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "k", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.k_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_getSignedAddressList &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::dht_ping &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "random_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.random_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_query &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "node", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.node_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::dht_store &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_addAdnlId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "category", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.category_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_addControlInterface &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_addControlProcess &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "peer_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.peer_key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "permissions", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.permissions_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_addDhtId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_addListeningPort &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "categories", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.categories_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "priority_categories", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.priority_categories_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_addLiteserver &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_addProxy &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "in_ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.in_ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "in_port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.in_port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "out_ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.out_ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "out_port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.out_port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "proxy", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.proxy_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "categories", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.categories_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "priority_categories", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.priority_categories_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_addValidatorAdnlAddress &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "permanent_key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.permanent_key_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ttl", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ttl_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_addValidatorPermanentKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "election_date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.election_date_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ttl", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ttl_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_addValidatorTempKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "permanent_key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.permanent_key_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ttl", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ttl_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_changeFullNodeAdnlAddress &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "adnl_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.adnl_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_checkDhtServers &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_controlQuery &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_createElectionBid &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "election_date", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.election_date_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "election_addr", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.election_addr_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "wallet", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.wallet_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_delAdnlId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_delDhtId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_delListeningPort &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "categories", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.categories_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "priority_categories", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.priority_categories_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_delProxy &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "out_ip", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.out_ip_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "out_port", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.out_port_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "categories", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.categories_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "priority_categories", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.priority_categories_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_delValidatorAdnlAddress &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "permanent_key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.permanent_key_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_delValidatorPermanentKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_delValidatorTempKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "permanent_key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.permanent_key_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_exportPrivateKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_exportPublicKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_generateKeyPair &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_getConfig &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_getStats &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_getTime &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_importPrivateKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_setVerbosity &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "verbosity", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.verbosity_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::engine_validator_sign &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_hash_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::getTestObject &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_getBroadcast &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_getBroadcastList &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "list", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.list_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_getRandomPeers &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "peers", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.peers_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::overlay_query &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "overlay", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.overlay_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tcp_ping &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "random_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.random_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_downloadBlock &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_downloadBlockProof &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_downloadBlockProofLink &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_downloadPersistentState &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "masterchain_block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.masterchain_block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_downloadZeroState &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_getNextBlockDescription &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "prev_block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.prev_block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_getNextKeyBlockIds &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "max_size", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.max_size_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_prepareBlock &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_prepareBlockProof &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "allow_partial", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.allow_partial_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_preparePersistentState &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "masterchain_block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.masterchain_block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::tonNode_prepareZeroState &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "block", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.block_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_downloadCandidate &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "round", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.round_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(ton_api::validatorSession_ping &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.hash_, value));
+    }
+  }
+  return Status::OK();
+}
+void to_json(JsonValueScope &jv, const ton_api::Hashable &object) {
+  ton_api::downcast_call(const_cast<ton_api::Hashable &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_bool &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.bool");
+  jo << ctie("value", ToJson(object.value_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_int32 &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.int32");
+  jo << ctie("value", ToJson(object.value_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_int64 &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.int64");
+  jo << ctie("value", ToJson(JsonInt64{object.value_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_int256 &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.int256");
+  jo << ctie("value", ToJson(object.value_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_bytes &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.bytes");
+  jo << ctie("value", ToJson(JsonBytes{object.value_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_pair &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.pair");
+  jo << ctie("left", ToJson(object.left_));
+  jo << ctie("right", ToJson(object.right_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_vector &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.vector");
+  jo << ctie("value", ToJson(object.value_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_validatorSessionOldRound &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.validatorSessionOldRound");
+  jo << ctie("seqno", ToJson(object.seqno_));
+  jo << ctie("block", ToJson(object.block_));
+  jo << ctie("signatures", ToJson(object.signatures_));
+  jo << ctie("approve_signatures", ToJson(object.approve_signatures_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_validatorSessionRoundAttempt &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.validatorSessionRoundAttempt");
+  jo << ctie("seqno", ToJson(object.seqno_));
+  jo << ctie("votes", ToJson(object.votes_));
+  jo << ctie("precommitted", ToJson(object.precommitted_));
+  jo << ctie("vote_for_inited", ToJson(object.vote_for_inited_));
+  jo << ctie("vote_for", ToJson(object.vote_for_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_validatorSessionRound &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.validatorSessionRound");
+  jo << ctie("locked_round", ToJson(object.locked_round_));
+  jo << ctie("locked_block", ToJson(object.locked_block_));
+  jo << ctie("seqno", ToJson(object.seqno_));
+  jo << ctie("precommitted", ToJson(object.precommitted_));
+  jo << ctie("first_attempt", ToJson(object.first_attempt_));
+  jo << ctie("approved_blocks", ToJson(object.approved_blocks_));
+  jo << ctie("signatures", ToJson(object.signatures_));
+  jo << ctie("attempts", ToJson(object.attempts_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_blockSignature &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.blockSignature");
+  jo << ctie("signature", ToJson(object.signature_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_sentBlock &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.sentBlock");
+  jo << ctie("src", ToJson(object.src_));
+  jo << ctie("root_hash", ToJson(object.root_hash_));
+  jo << ctie("file_hash", ToJson(object.file_hash_));
+  jo << ctie("collated_data_file_hash", ToJson(object.collated_data_file_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_sentBlockEmpty &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.sentBlockEmpty");
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_vote &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.vote");
+  jo << ctie("block", ToJson(object.block_));
+  jo << ctie("node", ToJson(object.node_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_blockCandidate &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.blockCandidate");
+  jo << ctie("block", ToJson(object.block_));
+  jo << ctie("approved", ToJson(object.approved_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_blockVoteCandidate &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.blockVoteCandidate");
+  jo << ctie("block", ToJson(object.block_));
+  jo << ctie("approved", ToJson(object.approved_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_blockCandidateAttempt &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.blockCandidateAttempt");
+  jo << ctie("block", ToJson(object.block_));
+  jo << ctie("votes", ToJson(object.votes_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_cntVector &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.cntVector");
+  jo << ctie("data", ToJson(object.data_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_cntSortedVector &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.cntSortedVector");
+  jo << ctie("data", ToJson(object.data_));
+}
+void to_json(JsonValueScope &jv, const ton_api::hashable_validatorSession &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "hashable.validatorSession");
+  jo << ctie("ts", ToJson(object.ts_));
+  jo << ctie("old_rounds", ToJson(object.old_rounds_));
+  jo << ctie("cur_round", ToJson(object.cur_round_));
+}
+void to_json(JsonValueScope &jv, const ton_api::PrivateKey &object) {
+  ton_api::downcast_call(const_cast<ton_api::PrivateKey &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::pk_unenc &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "pk.unenc");
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::pk_ed25519 &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "pk.ed25519");
+  jo << ctie("key", ToJson(object.key_));
+}
+void to_json(JsonValueScope &jv, const ton_api::pk_aes &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "pk.aes");
+  jo << ctie("key", ToJson(object.key_));
+}
+void to_json(JsonValueScope &jv, const ton_api::pk_overlay &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "pk.overlay");
+  jo << ctie("name", ToJson(JsonBytes{object.name_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::PublicKey &object) {
+  ton_api::downcast_call(const_cast<ton_api::PublicKey &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::pub_unenc &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "pub.unenc");
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::pub_ed25519 &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "pub.ed25519");
+  jo << ctie("key", ToJson(object.key_));
+}
+void to_json(JsonValueScope &jv, const ton_api::pub_aes &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "pub.aes");
+  jo << ctie("key", ToJson(object.key_));
+}
+void to_json(JsonValueScope &jv, const ton_api::pub_overlay &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "pub.overlay");
+  jo << ctie("name", ToJson(JsonBytes{object.name_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::TestObject &object) {
+  ton_api::downcast_call(const_cast<ton_api::TestObject &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::testObject &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testObject");
+  jo << ctie("value", ToJson(object.value_));
+  jo << ctie("o", ToJson(object.o_));
+  jo << ctie("f", ToJson(object.f_));
+}
+void to_json(JsonValueScope &jv, const ton_api::testString &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testString");
+  jo << ctie("value", ToJson(object.value_));
+}
+void to_json(JsonValueScope &jv, const ton_api::testInt &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testInt");
+  jo << ctie("value", ToJson(object.value_));
+}
+void to_json(JsonValueScope &jv, const ton_api::testVectorBytes &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testVectorBytes");
+  jo << ctie("value", ToJson(JsonVectorBytes(object.value_)));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_Address &object) {
+  ton_api::downcast_call(const_cast<ton_api::adnl_Address &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_address_udp &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.address.udp");
+  jo << ctie("ip", ToJson(object.ip_));
+  jo << ctie("port", ToJson(object.port_));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_address_udp6 &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.address.udp6");
+  jo << ctie("ip", ToJson(object.ip_));
+  jo << ctie("port", ToJson(object.port_));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_addressList &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.addressList");
+  jo << ctie("addrs", ToJson(object.addrs_));
+  jo << ctie("version", ToJson(object.version_));
+  jo << ctie("reinit_date", ToJson(object.reinit_date_));
+  jo << ctie("priority", ToJson(object.priority_));
+  jo << ctie("expire_at", ToJson(object.expire_at_));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_Message &object) {
+  ton_api::downcast_call(const_cast<ton_api::adnl_Message &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_createChannel &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.message.createChannel");
+  jo << ctie("key", ToJson(object.key_));
+  jo << ctie("date", ToJson(object.date_));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_confirmChannel &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.message.confirmChannel");
+  jo << ctie("key", ToJson(object.key_));
+  jo << ctie("peer_key", ToJson(object.peer_key_));
+  jo << ctie("date", ToJson(object.date_));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_custom &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.message.custom");
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_nop &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.message.nop");
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_reinit &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.message.reinit");
+  jo << ctie("date", ToJson(object.date_));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_query &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.message.query");
+  jo << ctie("query_id", ToJson(object.query_id_));
+  jo << ctie("query", ToJson(JsonBytes{object.query_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_answer &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.message.answer");
+  jo << ctie("query_id", ToJson(object.query_id_));
+  jo << ctie("answer", ToJson(JsonBytes{object.answer_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_part &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.message.part");
+  jo << ctie("hash", ToJson(object.hash_));
+  jo << ctie("total_size", ToJson(object.total_size_));
+  jo << ctie("offset", ToJson(object.offset_));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_node &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.node");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  if (object.addr_list_) {
+    jo << ctie("addr_list", ToJson(object.addr_list_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_nodes &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.nodes");
+  jo << ctie("nodes", ToJson(object.nodes_));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_packetContents &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.packetContents");
+  jo << ctie("rand1", ToJson(JsonBytes{object.rand1_}));
+  if (object.flags_) {
+    jo << ctie("flags", ToJson(object.flags_));
+  }
+  if (object.from_) {
+    jo << ctie("from", ToJson(object.from_));
+  }
+  if (object.from_short_) {
+    jo << ctie("from_short", ToJson(object.from_short_));
+  }
+  if (object.message_) {
+    jo << ctie("message", ToJson(object.message_));
+  }
+  jo << ctie("messages", ToJson(object.messages_));
+  if (object.address_) {
+    jo << ctie("address", ToJson(object.address_));
+  }
+  if (object.priority_address_) {
+    jo << ctie("priority_address", ToJson(object.priority_address_));
+  }
+  jo << ctie("seqno", ToJson(JsonInt64{object.seqno_}));
+  jo << ctie("confirm_seqno", ToJson(JsonInt64{object.confirm_seqno_}));
+  jo << ctie("recv_addr_list_version", ToJson(object.recv_addr_list_version_));
+  jo << ctie("recv_priority_addr_list_version", ToJson(object.recv_priority_addr_list_version_));
+  jo << ctie("reinit_date", ToJson(object.reinit_date_));
+  jo << ctie("dst_reinit_date", ToJson(object.dst_reinit_date_));
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+  jo << ctie("rand2", ToJson(JsonBytes{object.rand2_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_pong &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.pong");
+  jo << ctie("value", ToJson(JsonInt64{object.value_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_Proxy &object) {
+  ton_api::downcast_call(const_cast<ton_api::adnl_Proxy &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_proxy_none &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.proxy.none");
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_proxy_fast &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.proxy.fast");
+  jo << ctie("shared_secret", ToJson(JsonBytes{object.shared_secret_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_proxyToFastHash &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.proxyToFastHash");
+  jo << ctie("ip", ToJson(object.ip_));
+  jo << ctie("port", ToJson(object.port_));
+  jo << ctie("date", ToJson(object.date_));
+  jo << ctie("data_hash", ToJson(object.data_hash_));
+  jo << ctie("shared_secret", ToJson(object.shared_secret_));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_proxyToFast &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.proxyToFast");
+  jo << ctie("ip", ToJson(object.ip_));
+  jo << ctie("port", ToJson(object.port_));
+  jo << ctie("date", ToJson(object.date_));
+  jo << ctie("signature", ToJson(object.signature_));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_config_global &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.config.global");
+  if (object.static_nodes_) {
+    jo << ctie("static_nodes", ToJson(object.static_nodes_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_db_node_key &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.db.node.key");
+  jo << ctie("local_id", ToJson(object.local_id_));
+  jo << ctie("peer_id", ToJson(object.peer_id_));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_db_node_value &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.db.node.value");
+  jo << ctie("date", ToJson(object.date_));
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  if (object.addr_list_) {
+    jo << ctie("addr_list", ToJson(object.addr_list_));
+  }
+  if (object.priority_addr_list_) {
+    jo << ctie("priority_addr_list", ToJson(object.priority_addr_list_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_id_short &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.id.short");
+  jo << ctie("id", ToJson(object.id_));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_block &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.block");
+  jo << ctie("incarnation", ToJson(object.incarnation_));
+  jo << ctie("src", ToJson(object.src_));
+  jo << ctie("height", ToJson(object.height_));
+  if (object.data_) {
+    jo << ctie("data", ToJson(object.data_));
+  }
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_BlockResult &object) {
+  ton_api::downcast_call(const_cast<ton_api::catchain_BlockResult &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_blockNotFound &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.blockNotFound");
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_blockResult &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.blockResult");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_blocks &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.blocks");
+  jo << ctie("blocks", ToJson(object.blocks_));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_Difference &object) {
+  ton_api::downcast_call(const_cast<ton_api::catchain_Difference &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_difference &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.difference");
+  jo << ctie("sent_upto", ToJson(object.sent_upto_));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_differenceFork &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.differenceFork");
+  if (object.left_) {
+    jo << ctie("left", ToJson(object.left_));
+  }
+  if (object.right_) {
+    jo << ctie("right", ToJson(object.right_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_firstblock &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.firstblock");
+  jo << ctie("unique_hash", ToJson(object.unique_hash_));
+  jo << ctie("nodes", ToJson(object.nodes_));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_sent &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.sent");
+  jo << ctie("cnt", ToJson(object.cnt_));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_blockUpdate &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.blockUpdate");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_data &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.block.data");
+  if (object.prev_) {
+    jo << ctie("prev", ToJson(object.prev_));
+  }
+  jo << ctie("deps", ToJson(object.deps_));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_dep &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.block.dep");
+  jo << ctie("src", ToJson(object.src_));
+  jo << ctie("height", ToJson(object.height_));
+  jo << ctie("data_hash", ToJson(object.data_hash_));
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_id &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.block.id");
+  jo << ctie("incarnation", ToJson(object.incarnation_));
+  jo << ctie("src", ToJson(object.src_));
+  jo << ctie("height", ToJson(object.height_));
+  jo << ctie("data_hash", ToJson(object.data_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_inner_Data &object) {
+  ton_api::downcast_call(const_cast<ton_api::catchain_block_inner_Data &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_data_badBlock &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.block.data.badBlock");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_data_fork &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.block.data.fork");
+  if (object.left_) {
+    jo << ctie("left", ToJson(object.left_));
+  }
+  if (object.right_) {
+    jo << ctie("right", ToJson(object.right_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_data_nop &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.block.data.nop");
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_data_vector &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.block.data.vector");
+  jo << ctie("msgs", ToJson(JsonVectorBytes(object.msgs_)));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_config_global &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.config.global");
+  jo << ctie("tag", ToJson(object.tag_));
+  jo << ctie("nodes", ToJson(object.nodes_));
+}
+void to_json(JsonValueScope &jv, const ton_api::config_global &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "config.global");
+  if (object.adnl_) {
+    jo << ctie("adnl", ToJson(object.adnl_));
+  }
+  if (object.dht_) {
+    jo << ctie("dht", ToJson(object.dht_));
+  }
+  if (object.validator_) {
+    jo << ctie("validator", ToJson(object.validator_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::config_local &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "config.local");
+  jo << ctie("local_ids", ToJson(object.local_ids_));
+  jo << ctie("dht", ToJson(object.dht_));
+  jo << ctie("validators", ToJson(object.validators_));
+  jo << ctie("liteservers", ToJson(object.liteservers_));
+  jo << ctie("control", ToJson(object.control_));
+}
+void to_json(JsonValueScope &jv, const ton_api::control_config_local &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "control.config.local");
+  if (object.priv_) {
+    jo << ctie("priv", ToJson(object.priv_));
+  }
+  jo << ctie("pub", ToJson(object.pub_));
+  jo << ctie("port", ToJson(object.port_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_candidate &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.candidate");
+  if (object.source_) {
+    jo << ctie("source", ToJson(object.source_));
+  }
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+  jo << ctie("collated_data", ToJson(JsonBytes{object.collated_data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_block_Info &object) {
+  ton_api::downcast_call(const_cast<ton_api::db_block_Info &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::db_block_info &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.block.info");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  if (object.flags_) {
+    jo << ctie("flags", ToJson(object.flags_));
+  }
+  if (object.prev_left_) {
+    jo << ctie("prev_left", ToJson(object.prev_left_));
+  }
+  if (object.prev_right_) {
+    jo << ctie("prev_right", ToJson(object.prev_right_));
+  }
+  if (object.next_left_) {
+    jo << ctie("next_left", ToJson(object.next_left_));
+  }
+  if (object.next_right_) {
+    jo << ctie("next_right", ToJson(object.next_right_));
+  }
+  jo << ctie("lt", ToJson(JsonInt64{object.lt_}));
+  jo << ctie("ts", ToJson(object.ts_));
+  jo << ctie("state", ToJson(object.state_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_block_archivedInfo &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.block.archivedInfo");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  if (object.flags_) {
+    jo << ctie("flags", ToJson(object.flags_));
+  }
+  if (object.next_) {
+    jo << ctie("next", ToJson(object.next_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::db_blockdb_Key &object) {
+  ton_api::downcast_call(const_cast<ton_api::db_blockdb_Key &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::db_blockdb_key_lru &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.blockdb.key.lru");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::db_blockdb_key_value &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.blockdb.key.value");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::db_blockdb_lru &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.blockdb.lru");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  jo << ctie("prev", ToJson(object.prev_));
+  jo << ctie("next", ToJson(object.next_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_blockdb_value &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.blockdb.value");
+  if (object.next_) {
+    jo << ctie("next", ToJson(object.next_));
+  }
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_candidate_id &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.candidate.id");
+  if (object.source_) {
+    jo << ctie("source", ToJson(object.source_));
+  }
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  jo << ctie("collated_data_file_hash", ToJson(object.collated_data_file_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_celldb_value &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.celldb.value");
+  if (object.block_id_) {
+    jo << ctie("block_id", ToJson(object.block_id_));
+  }
+  jo << ctie("prev", ToJson(object.prev_));
+  jo << ctie("next", ToJson(object.next_));
+  jo << ctie("root_hash", ToJson(object.root_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_celldb_key_value &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.celldb.key.value");
+  jo << ctie("hash", ToJson(object.hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_Key &object) {
+  ton_api::downcast_call(const_cast<ton_api::db_filedb_Key &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_empty &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.filedb.key.empty");
+}
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_blockFile &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.filedb.key.blockFile");
+  if (object.block_id_) {
+    jo << ctie("block_id", ToJson(object.block_id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_zeroStateFile &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.filedb.key.zeroStateFile");
+  if (object.block_id_) {
+    jo << ctie("block_id", ToJson(object.block_id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_persistentStateFile &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.filedb.key.persistentStateFile");
+  if (object.block_id_) {
+    jo << ctie("block_id", ToJson(object.block_id_));
+  }
+  if (object.masterchain_block_id_) {
+    jo << ctie("masterchain_block_id", ToJson(object.masterchain_block_id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_proof &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.filedb.key.proof");
+  if (object.block_id_) {
+    jo << ctie("block_id", ToJson(object.block_id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_proofLink &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.filedb.key.proofLink");
+  if (object.block_id_) {
+    jo << ctie("block_id", ToJson(object.block_id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_signatures &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.filedb.key.signatures");
+  if (object.block_id_) {
+    jo << ctie("block_id", ToJson(object.block_id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_candidate &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.filedb.key.candidate");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_value &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.filedb.value");
+  if (object.key_) {
+    jo << ctie("key", ToJson(object.key_));
+  }
+  jo << ctie("prev", ToJson(object.prev_));
+  jo << ctie("next", ToJson(object.next_));
+  jo << ctie("file_hash", ToJson(object.file_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_lt_Key &object) {
+  ton_api::downcast_call(const_cast<ton_api::db_lt_Key &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::db_lt_el_key &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.lt.el.key");
+  jo << ctie("workchain", ToJson(object.workchain_));
+  jo << ctie("shard", ToJson(JsonInt64{object.shard_}));
+  jo << ctie("idx", ToJson(object.idx_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_lt_desc_key &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.lt.desc.key");
+  jo << ctie("workchain", ToJson(object.workchain_));
+  jo << ctie("shard", ToJson(JsonInt64{object.shard_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_lt_shard_key &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.lt.shard.key");
+  jo << ctie("idx", ToJson(object.idx_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_lt_status_key &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.lt.status.key");
+}
+void to_json(JsonValueScope &jv, const ton_api::db_lt_desc_value &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.lt.desc.value");
+  jo << ctie("first_idx", ToJson(object.first_idx_));
+  jo << ctie("last_idx", ToJson(object.last_idx_));
+  jo << ctie("last_seqno", ToJson(object.last_seqno_));
+  jo << ctie("last_lt", ToJson(JsonInt64{object.last_lt_}));
+  jo << ctie("last_ts", ToJson(object.last_ts_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_lt_el_value &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.lt.el.value");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  jo << ctie("lt", ToJson(JsonInt64{object.lt_}));
+  jo << ctie("ts", ToJson(object.ts_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_lt_shard_value &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.lt.shard.value");
+  jo << ctie("workchain", ToJson(object.workchain_));
+  jo << ctie("shard", ToJson(JsonInt64{object.shard_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_lt_status_value &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.lt.status.value");
+  jo << ctie("total_shards", ToJson(object.total_shards_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_root_config &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.root.config");
+  jo << ctie("celldb_version", ToJson(object.celldb_version_));
+  jo << ctie("blockdb_version", ToJson(object.blockdb_version_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_root_dbDescription &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.root.dbDescription");
+  jo << ctie("version", ToJson(object.version_));
+  if (object.first_masterchain_block_id_) {
+    jo << ctie("first_masterchain_block_id", ToJson(object.first_masterchain_block_id_));
+  }
+  jo << ctie("flags", ToJson(object.flags_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_root_Key &object) {
+  ton_api::downcast_call(const_cast<ton_api::db_root_Key &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::db_root_key_cellDb &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.root.key.cellDb");
+  jo << ctie("version", ToJson(object.version_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_root_key_blockDb &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.root.key.blockDb");
+  jo << ctie("version", ToJson(object.version_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_root_key_config &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.root.key.config");
+}
+void to_json(JsonValueScope &jv, const ton_api::db_state_asyncSerializer &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.state.asyncSerializer");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+  if (object.last_) {
+    jo << ctie("last", ToJson(object.last_));
+  }
+  jo << ctie("last_ts", ToJson(object.last_ts_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_state_destroyedSessions &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.state.destroyedSessions");
+  jo << ctie("sessions", ToJson(object.sessions_));
+}
+void to_json(JsonValueScope &jv, const ton_api::db_state_gcBlockId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.state.gcBlockId");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::db_state_initBlockId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.state.initBlockId");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::db_state_Key &object) {
+  ton_api::downcast_call(const_cast<ton_api::db_state_Key &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::db_state_key_destroyedSessions &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.state.key.destroyedSessions");
+}
+void to_json(JsonValueScope &jv, const ton_api::db_state_key_initBlockId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.state.key.initBlockId");
+}
+void to_json(JsonValueScope &jv, const ton_api::db_state_key_gcBlockId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.state.key.gcBlockId");
+}
+void to_json(JsonValueScope &jv, const ton_api::db_state_key_shardClient &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.state.key.shardClient");
+}
+void to_json(JsonValueScope &jv, const ton_api::db_state_key_asyncSerializer &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.state.key.asyncSerializer");
+}
+void to_json(JsonValueScope &jv, const ton_api::db_state_shardClient &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "db.state.shardClient");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_key &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.key");
+  jo << ctie("id", ToJson(object.id_));
+  jo << ctie("name", ToJson(JsonBytes{object.name_}));
+  jo << ctie("idx", ToJson(object.idx_));
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_keyDescription &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.keyDescription");
+  if (object.key_) {
+    jo << ctie("key", ToJson(object.key_));
+  }
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  if (object.update_rule_) {
+    jo << ctie("update_rule", ToJson(object.update_rule_));
+  }
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_message &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.message");
+  if (object.node_) {
+    jo << ctie("node", ToJson(object.node_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_node &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.node");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  if (object.addr_list_) {
+    jo << ctie("addr_list", ToJson(object.addr_list_));
+  }
+  jo << ctie("version", ToJson(object.version_));
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_nodes &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.nodes");
+  jo << ctie("nodes", ToJson(object.nodes_));
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_pong &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.pong");
+  jo << ctie("random_id", ToJson(JsonInt64{object.random_id_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_stored &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.stored");
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_UpdateRule &object) {
+  ton_api::downcast_call(const_cast<ton_api::dht_UpdateRule &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_updateRule_signature &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.updateRule.signature");
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_updateRule_anybody &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.updateRule.anybody");
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_updateRule_overlayNodes &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.updateRule.overlayNodes");
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_value &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.value");
+  if (object.key_) {
+    jo << ctie("key", ToJson(object.key_));
+  }
+  jo << ctie("value", ToJson(JsonBytes{object.value_}));
+  jo << ctie("ttl", ToJson(object.ttl_));
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_ValueResult &object) {
+  ton_api::downcast_call(const_cast<ton_api::dht_ValueResult &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_valueNotFound &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.valueNotFound");
+  if (object.nodes_) {
+    jo << ctie("nodes", ToJson(object.nodes_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_valueFound &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.valueFound");
+  if (object.value_) {
+    jo << ctie("value", ToJson(object.value_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_config_global &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.config.global");
+  if (object.static_nodes_) {
+    jo << ctie("static_nodes", ToJson(object.static_nodes_));
+  }
+  jo << ctie("k", ToJson(object.k_));
+  jo << ctie("a", ToJson(object.a_));
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_config_Local &object) {
+  ton_api::downcast_call(const_cast<ton_api::dht_config_Local &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_config_local &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.config.local");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_config_random_local &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.config.random.local");
+  jo << ctie("cnt", ToJson(object.cnt_));
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_db_bucket &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.db.bucket");
+  if (object.nodes_) {
+    jo << ctie("nodes", ToJson(object.nodes_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_db_key_bucket &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.db.key.bucket");
+  jo << ctie("id", ToJson(object.id_));
+}
+void to_json(JsonValueScope &jv, const ton_api::dummyworkchain0_config_global &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dummyworkchain0.config.global");
+  jo << ctie("zero_state_hash", ToJson(object.zero_state_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_Addr &object) {
+  ton_api::downcast_call(const_cast<ton_api::engine_Addr &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_addr &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.addr");
+  jo << ctie("ip", ToJson(object.ip_));
+  jo << ctie("port", ToJson(object.port_));
+  jo << ctie("categories", ToJson(object.categories_));
+  jo << ctie("priority_categories", ToJson(object.priority_categories_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_addrProxy &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.addrProxy");
+  jo << ctie("in_ip", ToJson(object.in_ip_));
+  jo << ctie("in_port", ToJson(object.in_port_));
+  jo << ctie("out_ip", ToJson(object.out_ip_));
+  jo << ctie("out_port", ToJson(object.out_port_));
+  if (object.proxy_type_) {
+    jo << ctie("proxy_type", ToJson(object.proxy_type_));
+  }
+  jo << ctie("categories", ToJson(object.categories_));
+  jo << ctie("priority_categories", ToJson(object.priority_categories_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_adnl &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.adnl");
+  jo << ctie("id", ToJson(object.id_));
+  jo << ctie("category", ToJson(object.category_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_controlInterface &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.controlInterface");
+  jo << ctie("id", ToJson(object.id_));
+  jo << ctie("port", ToJson(object.port_));
+  jo << ctie("allowed", ToJson(object.allowed_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_controlProcess &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.controlProcess");
+  jo << ctie("id", ToJson(object.id_));
+  jo << ctie("permissions", ToJson(object.permissions_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_dht &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.dht");
+  jo << ctie("id", ToJson(object.id_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_gc &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.gc");
+  jo << ctie("ids", ToJson(object.ids_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_liteServer &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.liteServer");
+  jo << ctie("id", ToJson(object.id_));
+  jo << ctie("port", ToJson(object.port_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator");
+  jo << ctie("id", ToJson(object.id_));
+  jo << ctie("temp_keys", ToJson(object.temp_keys_));
+  jo << ctie("adnl_addrs", ToJson(object.adnl_addrs_));
+  jo << ctie("election_date", ToJson(object.election_date_));
+  jo << ctie("expire_at", ToJson(object.expire_at_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validatorAdnlAddress &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validatorAdnlAddress");
+  jo << ctie("id", ToJson(object.id_));
+  jo << ctie("expire_at", ToJson(object.expire_at_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validatorTempKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validatorTempKey");
+  jo << ctie("key", ToJson(object.key_));
+  jo << ctie("expire_at", ToJson(object.expire_at_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_adnlProxy_config &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.adnlProxy.config");
+  jo << ctie("ports", ToJson(object.ports_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_adnlProxy_port &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.adnlProxy.port");
+  jo << ctie("in_port", ToJson(object.in_port_));
+  jo << ctie("out_port", ToJson(object.out_port_));
+  jo << ctie("dst_ip", ToJson(object.dst_ip_));
+  jo << ctie("dst_port", ToJson(object.dst_port_));
+  if (object.proxy_type_) {
+    jo << ctie("proxy_type", ToJson(object.proxy_type_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_dht_config &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.dht.config");
+  jo << ctie("dht", ToJson(object.dht_));
+  if (object.gc_) {
+    jo << ctie("gc", ToJson(object.gc_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_config &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.config");
+  jo << ctie("out_port", ToJson(object.out_port_));
+  jo << ctie("addrs", ToJson(object.addrs_));
+  jo << ctie("adnl", ToJson(object.adnl_));
+  jo << ctie("dht", ToJson(object.dht_));
+  jo << ctie("validators", ToJson(object.validators_));
+  jo << ctie("fullnode", ToJson(object.fullnode_));
+  jo << ctie("liteservers", ToJson(object.liteservers_));
+  jo << ctie("control", ToJson(object.control_));
+  if (object.gc_) {
+    jo << ctie("gc", ToJson(object.gc_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_controlQueryError &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.controlQueryError");
+  jo << ctie("code", ToJson(object.code_));
+  jo << ctie("message", ToJson(object.message_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_dhtServerStatus &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.dhtServerStatus");
+  jo << ctie("id", ToJson(object.id_));
+  jo << ctie("status", ToJson(object.status_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_dhtServersStatus &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.dhtServersStatus");
+  jo << ctie("servers", ToJson(object.servers_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_electionBid &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.electionBid");
+  jo << ctie("election_date", ToJson(object.election_date_));
+  jo << ctie("perm_key", ToJson(object.perm_key_));
+  jo << ctie("adnl_addr", ToJson(object.adnl_addr_));
+  jo << ctie("to_send_payload", ToJson(JsonBytes{object.to_send_payload_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::validator_groupMember &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validator.groupMember");
+  jo << ctie("public_key_hash", ToJson(object.public_key_hash_));
+  jo << ctie("adnl", ToJson(object.adnl_));
+  jo << ctie("weight", ToJson(JsonInt64{object.weight_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_jsonConfig &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.jsonConfig");
+  jo << ctie("data", ToJson(object.data_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_keyHash &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.keyHash");
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_oneStat &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.oneStat");
+  jo << ctie("key", ToJson(object.key_));
+  jo << ctie("value", ToJson(object.value_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_signature &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.signature");
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_stats &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.stats");
+  jo << ctie("stats", ToJson(object.stats_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_success &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.success");
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_time &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.time");
+  jo << ctie("time", ToJson(object.time_));
+}
+void to_json(JsonValueScope &jv, const ton_api::fec_Type &object) {
+  ton_api::downcast_call(const_cast<ton_api::fec_Type &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::fec_raptorQ &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "fec.raptorQ");
+  jo << ctie("data_size", ToJson(object.data_size_));
+  jo << ctie("symbol_size", ToJson(object.symbol_size_));
+  jo << ctie("symbols_count", ToJson(object.symbols_count_));
+}
+void to_json(JsonValueScope &jv, const ton_api::fec_roundRobin &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "fec.roundRobin");
+  jo << ctie("data_size", ToJson(object.data_size_));
+  jo << ctie("symbol_size", ToJson(object.symbol_size_));
+  jo << ctie("symbols_count", ToJson(object.symbols_count_));
+}
+void to_json(JsonValueScope &jv, const ton_api::fec_online &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "fec.online");
+  jo << ctie("data_size", ToJson(object.data_size_));
+  jo << ctie("symbol_size", ToJson(object.symbol_size_));
+  jo << ctie("symbols_count", ToJson(object.symbols_count_));
+}
+void to_json(JsonValueScope &jv, const ton_api::id_config_local &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "id.config.local");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::liteclient_config_global &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "liteclient.config.global");
+  jo << ctie("liteservers", ToJson(object.liteservers_));
+  if (object.validator_) {
+    jo << ctie("validator", ToJson(object.validator_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::liteserver_desc &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "liteserver.desc");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  jo << ctie("ip", ToJson(object.ip_));
+  jo << ctie("port", ToJson(object.port_));
+}
+void to_json(JsonValueScope &jv, const ton_api::liteserver_config_Local &object) {
+  ton_api::downcast_call(const_cast<ton_api::liteserver_config_Local &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::liteserver_config_local &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "liteserver.config.local");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  jo << ctie("port", ToJson(object.port_));
+}
+void to_json(JsonValueScope &jv, const ton_api::liteserver_config_random_local &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "liteserver.config.random.local");
+  jo << ctie("port", ToJson(object.port_));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_Broadcast &object) {
+  ton_api::downcast_call(const_cast<ton_api::overlay_Broadcast &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_fec_received &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.fec.received");
+  jo << ctie("hash", ToJson(object.hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_fec_completed &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.fec.completed");
+  jo << ctie("hash", ToJson(object.hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_unicast &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.unicast");
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcast &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.broadcast");
+  if (object.src_) {
+    jo << ctie("src", ToJson(object.src_));
+  }
+  if (object.certificate_) {
+    jo << ctie("certificate", ToJson(object.certificate_));
+  }
+  jo << ctie("flags", ToJson(object.flags_));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+  jo << ctie("date", ToJson(object.date_));
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcastFec &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.broadcastFec");
+  if (object.src_) {
+    jo << ctie("src", ToJson(object.src_));
+  }
+  if (object.certificate_) {
+    jo << ctie("certificate", ToJson(object.certificate_));
+  }
+  jo << ctie("data_hash", ToJson(object.data_hash_));
+  jo << ctie("data_size", ToJson(object.data_size_));
+  jo << ctie("flags", ToJson(object.flags_));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+  jo << ctie("seqno", ToJson(object.seqno_));
+  if (object.fec_) {
+    jo << ctie("fec", ToJson(object.fec_));
+  }
+  jo << ctie("date", ToJson(object.date_));
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcastFecShort &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.broadcastFecShort");
+  if (object.src_) {
+    jo << ctie("src", ToJson(object.src_));
+  }
+  if (object.certificate_) {
+    jo << ctie("certificate", ToJson(object.certificate_));
+  }
+  jo << ctie("broadcast_hash", ToJson(object.broadcast_hash_));
+  jo << ctie("part_data_hash", ToJson(object.part_data_hash_));
+  jo << ctie("seqno", ToJson(object.seqno_));
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcastNotFound &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.broadcastNotFound");
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcastList &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.broadcastList");
+  jo << ctie("hashes", ToJson(object.hashes_));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_Certificate &object) {
+  ton_api::downcast_call(const_cast<ton_api::overlay_Certificate &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_certificate &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.certificate");
+  if (object.issued_by_) {
+    jo << ctie("issued_by", ToJson(object.issued_by_));
+  }
+  jo << ctie("expire_at", ToJson(object.expire_at_));
+  jo << ctie("max_size", ToJson(object.max_size_));
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_emptyCertificate &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.emptyCertificate");
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_certificateId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.certificateId");
+  jo << ctie("overlay_id", ToJson(object.overlay_id_));
+  jo << ctie("node", ToJson(object.node_));
+  jo << ctie("expire_at", ToJson(object.expire_at_));
+  jo << ctie("max_size", ToJson(object.max_size_));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_message &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.message");
+  jo << ctie("overlay", ToJson(object.overlay_));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_node &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.node");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  jo << ctie("overlay", ToJson(object.overlay_));
+  jo << ctie("version", ToJson(object.version_));
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_nodes &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.nodes");
+  jo << ctie("nodes", ToJson(object.nodes_));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcast_id &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.broadcast.id");
+  jo << ctie("src", ToJson(object.src_));
+  jo << ctie("data_hash", ToJson(object.data_hash_));
+  jo << ctie("flags", ToJson(object.flags_));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcast_toSign &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.broadcast.toSign");
+  jo << ctie("hash", ToJson(object.hash_));
+  jo << ctie("date", ToJson(object.date_));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcastFec_id &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.broadcastFec.id");
+  jo << ctie("src", ToJson(object.src_));
+  jo << ctie("type", ToJson(object.type_));
+  jo << ctie("data_hash", ToJson(object.data_hash_));
+  jo << ctie("size", ToJson(object.size_));
+  jo << ctie("flags", ToJson(object.flags_));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcastFec_partId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.broadcastFec.partId");
+  jo << ctie("broadcast_hash", ToJson(object.broadcast_hash_));
+  jo << ctie("data_hash", ToJson(object.data_hash_));
+  jo << ctie("seqno", ToJson(object.seqno_));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_db_key_nodes &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.db.key.nodes");
+  jo << ctie("local_id", ToJson(object.local_id_));
+  jo << ctie("overlay", ToJson(object.overlay_));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_db_nodes &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.db.nodes");
+  if (object.nodes_) {
+    jo << ctie("nodes", ToJson(object.nodes_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_node_toSign &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.node.toSign");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  jo << ctie("overlay", ToJson(object.overlay_));
+  jo << ctie("version", ToJson(object.version_));
+}
+void to_json(JsonValueScope &jv, const ton_api::rldp_Message &object) {
+  ton_api::downcast_call(const_cast<ton_api::rldp_Message &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::rldp_message &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "rldp.message");
+  jo << ctie("id", ToJson(object.id_));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::rldp_query &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "rldp.query");
+  jo << ctie("query_id", ToJson(object.query_id_));
+  jo << ctie("max_answer_size", ToJson(JsonInt64{object.max_answer_size_}));
+  jo << ctie("timeout", ToJson(object.timeout_));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::rldp_answer &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "rldp.answer");
+  jo << ctie("query_id", ToJson(object.query_id_));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::rldp_MessagePart &object) {
+  ton_api::downcast_call(const_cast<ton_api::rldp_MessagePart &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::rldp_messagePart &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "rldp.messagePart");
+  jo << ctie("transfer_id", ToJson(object.transfer_id_));
+  if (object.fec_type_) {
+    jo << ctie("fec_type", ToJson(object.fec_type_));
+  }
+  jo << ctie("part", ToJson(object.part_));
+  jo << ctie("total_size", ToJson(JsonInt64{object.total_size_}));
+  jo << ctie("seqno", ToJson(object.seqno_));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::rldp_confirm &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "rldp.confirm");
+  jo << ctie("transfer_id", ToJson(object.transfer_id_));
+  jo << ctie("part", ToJson(object.part_));
+  jo << ctie("seqno", ToJson(object.seqno_));
+}
+void to_json(JsonValueScope &jv, const ton_api::rldp_complete &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "rldp.complete");
+  jo << ctie("transfer_id", ToJson(object.transfer_id_));
+  jo << ctie("part", ToJson(object.part_));
+}
+void to_json(JsonValueScope &jv, const ton_api::tcp_Message &object) {
+  ton_api::downcast_call(const_cast<ton_api::tcp_Message &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::tcp_authentificate &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tcp.authentificate");
+  jo << ctie("nonce", ToJson(JsonBytes{object.nonce_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::tcp_authentificationNonce &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tcp.authentificationNonce");
+  jo << ctie("nonce", ToJson(JsonBytes{object.nonce_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::tcp_authentificationComplete &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tcp.authentificationComplete");
+  if (object.key_) {
+    jo << ctie("key", ToJson(object.key_));
+  }
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::tcp_pong &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tcp.pong");
+  jo << ctie("random_id", ToJson(JsonInt64{object.random_id_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::ton_BlockId &object) {
+  ton_api::downcast_call(const_cast<ton_api::ton_BlockId &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::ton_blockId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "ton.blockId");
+  jo << ctie("root_cell_hash", ToJson(object.root_cell_hash_));
+  jo << ctie("file_hash", ToJson(object.file_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::ton_blockIdApprove &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "ton.blockIdApprove");
+  jo << ctie("root_cell_hash", ToJson(object.root_cell_hash_));
+  jo << ctie("file_hash", ToJson(object.file_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_BlockDescription &object) {
+  ton_api::downcast_call(const_cast<ton_api::tonNode_BlockDescription &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_blockDescriptionEmpty &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.blockDescriptionEmpty");
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_blockDescription &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.blockDescription");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_blockId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.blockId");
+  jo << ctie("workchain", ToJson(object.workchain_));
+  jo << ctie("shard", ToJson(JsonInt64{object.shard_}));
+  jo << ctie("seqno", ToJson(object.seqno_));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_blockIdExt &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.blockIdExt");
+  jo << ctie("workchain", ToJson(object.workchain_));
+  jo << ctie("shard", ToJson(JsonInt64{object.shard_}));
+  jo << ctie("seqno", ToJson(object.seqno_));
+  jo << ctie("root_hash", ToJson(object.root_hash_));
+  jo << ctie("file_hash", ToJson(object.file_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_blockSignature &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.blockSignature");
+  jo << ctie("who", ToJson(object.who_));
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_Broadcast &object) {
+  ton_api::downcast_call(const_cast<ton_api::tonNode_Broadcast &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_blockBroadcast &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.blockBroadcast");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+  jo << ctie("catchain_seqno", ToJson(object.catchain_seqno_));
+  jo << ctie("validator_set_hash", ToJson(object.validator_set_hash_));
+  jo << ctie("signatures", ToJson(object.signatures_));
+  jo << ctie("proof", ToJson(JsonBytes{object.proof_}));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_ihrMessageBroadcast &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.ihrMessageBroadcast");
+  if (object.message_) {
+    jo << ctie("message", ToJson(object.message_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_externalMessageBroadcast &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.externalMessageBroadcast");
+  if (object.message_) {
+    jo << ctie("message", ToJson(object.message_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_newShardBlockBroadcast &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.newShardBlockBroadcast");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_data &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.data");
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_externalMessage &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.externalMessage");
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_ihrMessage &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.ihrMessage");
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_keyBlocks &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.keyBlocks");
+  jo << ctie("blocks", ToJson(object.blocks_));
+  jo << ctie("incomplete", ToJson(object.incomplete_));
+  jo << ctie("error", ToJson(object.error_));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_newShardBlock &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.newShardBlock");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+  jo << ctie("cc_seqno", ToJson(object.cc_seqno_));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_Prepared &object) {
+  ton_api::downcast_call(const_cast<ton_api::tonNode_Prepared &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_prepared &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.prepared");
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_notFound &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.notFound");
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_PreparedProof &object) {
+  ton_api::downcast_call(const_cast<ton_api::tonNode_PreparedProof &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_preparedProofEmpty &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.preparedProofEmpty");
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_preparedProof &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.preparedProof");
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_preparedProofLink &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.preparedProofLink");
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_PreparedState &object) {
+  ton_api::downcast_call(const_cast<ton_api::tonNode_PreparedState &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_preparedState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.preparedState");
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_notFoundState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.notFoundState");
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_sessionId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.sessionId");
+  jo << ctie("workchain", ToJson(object.workchain_));
+  jo << ctie("shard", ToJson(JsonInt64{object.shard_}));
+  jo << ctie("cc_seqno", ToJson(object.cc_seqno_));
+  jo << ctie("opts_hash", ToJson(object.opts_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_shardPublicOverlayId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.shardPublicOverlayId");
+  jo << ctie("workchain", ToJson(object.workchain_));
+  jo << ctie("shard", ToJson(JsonInt64{object.shard_}));
+  jo << ctie("zero_state_file_hash", ToJson(object.zero_state_file_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_zeroStateIdExt &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.zeroStateIdExt");
+  jo << ctie("workchain", ToJson(object.workchain_));
+  jo << ctie("root_hash", ToJson(object.root_hash_));
+  jo << ctie("file_hash", ToJson(object.file_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::validator_group &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validator.group");
+  jo << ctie("workchain", ToJson(object.workchain_));
+  jo << ctie("shard", ToJson(JsonInt64{object.shard_}));
+  jo << ctie("catchain_seqno", ToJson(object.catchain_seqno_));
+  jo << ctie("config_hash", ToJson(object.config_hash_));
+  jo << ctie("members", ToJson(object.members_));
+}
+void to_json(JsonValueScope &jv, const ton_api::validator_config_global &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validator.config.global");
+  if (object.zero_state_) {
+    jo << ctie("zero_state", ToJson(object.zero_state_));
+  }
+  if (object.init_block_) {
+    jo << ctie("init_block", ToJson(object.init_block_));
+  }
+  jo << ctie("hardforks", ToJson(object.hardforks_));
+}
+void to_json(JsonValueScope &jv, const ton_api::validator_config_Local &object) {
+  ton_api::downcast_call(const_cast<ton_api::validator_config_Local &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::validator_config_local &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validator.config.local");
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::validator_config_random_local &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validator.config.random.local");
+  if (object.addr_list_) {
+    jo << ctie("addr_list", ToJson(object.addr_list_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_blockUpdate &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.blockUpdate");
+  jo << ctie("ts", ToJson(JsonInt64{object.ts_}));
+  jo << ctie("actions", ToJson(object.actions_));
+  jo << ctie("state", ToJson(object.state_));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_candidate &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.candidate");
+  jo << ctie("src", ToJson(object.src_));
+  jo << ctie("round", ToJson(object.round_));
+  jo << ctie("root_hash", ToJson(object.root_hash_));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+  jo << ctie("collated_data", ToJson(JsonBytes{object.collated_data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_candidateId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.candidateId");
+  jo << ctie("src", ToJson(object.src_));
+  jo << ctie("root_hash", ToJson(object.root_hash_));
+  jo << ctie("file_hash", ToJson(object.file_hash_));
+  jo << ctie("collated_data_file_hash", ToJson(object.collated_data_file_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_config &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.config");
+  jo << ctie("catchain_idle_timeout", ToJson(object.catchain_idle_timeout_));
+  jo << ctie("catchain_max_deps", ToJson(object.catchain_max_deps_));
+  jo << ctie("round_candidates", ToJson(object.round_candidates_));
+  jo << ctie("next_candidate_delay", ToJson(object.next_candidate_delay_));
+  jo << ctie("round_attempt_duration", ToJson(object.round_attempt_duration_));
+  jo << ctie("max_round_attempts", ToJson(object.max_round_attempts_));
+  jo << ctie("max_block_size", ToJson(object.max_block_size_));
+  jo << ctie("max_collated_data_size", ToJson(object.max_collated_data_size_));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_Message &object) {
+  ton_api::downcast_call(const_cast<ton_api::validatorSession_Message &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_startSession &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.message.startSession");
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_finishSession &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.message.finishSession");
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_pong &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.pong");
+  jo << ctie("hash", ToJson(JsonInt64{object.hash_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_round_id &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.round.id");
+  jo << ctie("session", ToJson(object.session_));
+  jo << ctie("height", ToJson(JsonInt64{object.height_}));
+  jo << ctie("prev_block", ToJson(object.prev_block_));
+  jo << ctie("seqno", ToJson(object.seqno_));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_round_Message &object) {
+  ton_api::downcast_call(const_cast<ton_api::validatorSession_round_Message &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_submittedBlock &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.message.submittedBlock");
+  jo << ctie("round", ToJson(object.round_));
+  jo << ctie("root_hash", ToJson(object.root_hash_));
+  jo << ctie("file_hash", ToJson(object.file_hash_));
+  jo << ctie("collated_data_file_hash", ToJson(object.collated_data_file_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_approvedBlock &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.message.approvedBlock");
+  jo << ctie("round", ToJson(object.round_));
+  jo << ctie("candidate", ToJson(object.candidate_));
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_rejectedBlock &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.message.rejectedBlock");
+  jo << ctie("round", ToJson(object.round_));
+  jo << ctie("candidate", ToJson(object.candidate_));
+  jo << ctie("reason", ToJson(JsonBytes{object.reason_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_commit &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.message.commit");
+  jo << ctie("round", ToJson(object.round_));
+  jo << ctie("candidate", ToJson(object.candidate_));
+  jo << ctie("signature", ToJson(JsonBytes{object.signature_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_vote &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.message.vote");
+  jo << ctie("round", ToJson(object.round_));
+  jo << ctie("attempt", ToJson(object.attempt_));
+  jo << ctie("candidate", ToJson(object.candidate_));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_voteFor &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.message.voteFor");
+  jo << ctie("round", ToJson(object.round_));
+  jo << ctie("attempt", ToJson(object.attempt_));
+  jo << ctie("candidate", ToJson(object.candidate_));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_precommit &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.message.precommit");
+  jo << ctie("round", ToJson(object.round_));
+  jo << ctie("attempt", ToJson(object.attempt_));
+  jo << ctie("candidate", ToJson(object.candidate_));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_empty &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.message.empty");
+  jo << ctie("round", ToJson(object.round_));
+  jo << ctie("attempt", ToJson(object.attempt_));
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_candidate_id &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.candidate.id");
+  jo << ctie("round", ToJson(object.round_));
+  jo << ctie("block_hash", ToJson(object.block_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::adnl_ping &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "adnl.ping");
+  jo << ctie("value", ToJson(JsonInt64{object.value_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_getBlock &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.getBlock");
+  jo << ctie("block", ToJson(object.block_));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_getBlockHistory &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.getBlockHistory");
+  jo << ctie("block", ToJson(object.block_));
+  jo << ctie("height", ToJson(JsonInt64{object.height_}));
+  jo << ctie("stop_if", ToJson(object.stop_if_));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_getBlocks &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.getBlocks");
+  jo << ctie("blocks", ToJson(object.blocks_));
+}
+void to_json(JsonValueScope &jv, const ton_api::catchain_getDifference &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "catchain.getDifference");
+  jo << ctie("rt", ToJson(object.rt_));
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_findNode &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.findNode");
+  jo << ctie("key", ToJson(object.key_));
+  jo << ctie("k", ToJson(object.k_));
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_findValue &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.findValue");
+  jo << ctie("key", ToJson(object.key_));
+  jo << ctie("k", ToJson(object.k_));
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_getSignedAddressList &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.getSignedAddressList");
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_ping &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.ping");
+  jo << ctie("random_id", ToJson(JsonInt64{object.random_id_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_query &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.query");
+  if (object.node_) {
+    jo << ctie("node", ToJson(object.node_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::dht_store &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "dht.store");
+  if (object.value_) {
+    jo << ctie("value", ToJson(object.value_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addAdnlId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.addAdnlId");
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+  jo << ctie("category", ToJson(object.category_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addControlInterface &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.addControlInterface");
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+  jo << ctie("port", ToJson(object.port_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addControlProcess &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.addControlProcess");
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+  jo << ctie("port", ToJson(object.port_));
+  jo << ctie("peer_key", ToJson(object.peer_key_));
+  jo << ctie("permissions", ToJson(object.permissions_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addDhtId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.addDhtId");
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addListeningPort &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.addListeningPort");
+  jo << ctie("ip", ToJson(object.ip_));
+  jo << ctie("port", ToJson(object.port_));
+  jo << ctie("categories", ToJson(object.categories_));
+  jo << ctie("priority_categories", ToJson(object.priority_categories_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addLiteserver &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.addLiteserver");
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+  jo << ctie("port", ToJson(object.port_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addProxy &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.addProxy");
+  jo << ctie("in_ip", ToJson(object.in_ip_));
+  jo << ctie("in_port", ToJson(object.in_port_));
+  jo << ctie("out_ip", ToJson(object.out_ip_));
+  jo << ctie("out_port", ToJson(object.out_port_));
+  if (object.proxy_) {
+    jo << ctie("proxy", ToJson(object.proxy_));
+  }
+  jo << ctie("categories", ToJson(object.categories_));
+  jo << ctie("priority_categories", ToJson(object.priority_categories_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addValidatorAdnlAddress &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.addValidatorAdnlAddress");
+  jo << ctie("permanent_key_hash", ToJson(object.permanent_key_hash_));
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+  jo << ctie("ttl", ToJson(object.ttl_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addValidatorPermanentKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.addValidatorPermanentKey");
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+  jo << ctie("election_date", ToJson(object.election_date_));
+  jo << ctie("ttl", ToJson(object.ttl_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addValidatorTempKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.addValidatorTempKey");
+  jo << ctie("permanent_key_hash", ToJson(object.permanent_key_hash_));
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+  jo << ctie("ttl", ToJson(object.ttl_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_changeFullNodeAdnlAddress &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.changeFullNodeAdnlAddress");
+  jo << ctie("adnl_id", ToJson(object.adnl_id_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_checkDhtServers &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.checkDhtServers");
+  jo << ctie("id", ToJson(object.id_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_controlQuery &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.controlQuery");
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_createElectionBid &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.createElectionBid");
+  jo << ctie("election_date", ToJson(object.election_date_));
+  jo << ctie("election_addr", ToJson(object.election_addr_));
+  jo << ctie("wallet", ToJson(object.wallet_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delAdnlId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.delAdnlId");
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delDhtId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.delDhtId");
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delListeningPort &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.delListeningPort");
+  jo << ctie("ip", ToJson(object.ip_));
+  jo << ctie("port", ToJson(object.port_));
+  jo << ctie("categories", ToJson(object.categories_));
+  jo << ctie("priority_categories", ToJson(object.priority_categories_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delProxy &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.delProxy");
+  jo << ctie("out_ip", ToJson(object.out_ip_));
+  jo << ctie("out_port", ToJson(object.out_port_));
+  jo << ctie("categories", ToJson(object.categories_));
+  jo << ctie("priority_categories", ToJson(object.priority_categories_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delValidatorAdnlAddress &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.delValidatorAdnlAddress");
+  jo << ctie("permanent_key_hash", ToJson(object.permanent_key_hash_));
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delValidatorPermanentKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.delValidatorPermanentKey");
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delValidatorTempKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.delValidatorTempKey");
+  jo << ctie("permanent_key_hash", ToJson(object.permanent_key_hash_));
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_exportPrivateKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.exportPrivateKey");
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_exportPublicKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.exportPublicKey");
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_generateKeyPair &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.generateKeyPair");
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_getConfig &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.getConfig");
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_getStats &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.getStats");
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_getTime &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.getTime");
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_importPrivateKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.importPrivateKey");
+  if (object.key_) {
+    jo << ctie("key", ToJson(object.key_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_setVerbosity &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.setVerbosity");
+  jo << ctie("verbosity", ToJson(object.verbosity_));
+}
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_sign &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "engine.validator.sign");
+  jo << ctie("key_hash", ToJson(object.key_hash_));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::getTestObject &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "getTestObject");
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_getBroadcast &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.getBroadcast");
+  jo << ctie("hash", ToJson(object.hash_));
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_getBroadcastList &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.getBroadcastList");
+  if (object.list_) {
+    jo << ctie("list", ToJson(object.list_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_getRandomPeers &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.getRandomPeers");
+  if (object.peers_) {
+    jo << ctie("peers", ToJson(object.peers_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::overlay_query &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "overlay.query");
+  jo << ctie("overlay", ToJson(object.overlay_));
+}
+void to_json(JsonValueScope &jv, const ton_api::tcp_ping &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tcp.ping");
+  jo << ctie("random_id", ToJson(JsonInt64{object.random_id_}));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_downloadBlock &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.downloadBlock");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_downloadBlockProof &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.downloadBlockProof");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_downloadBlockProofLink &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.downloadBlockProofLink");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_downloadPersistentState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.downloadPersistentState");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+  if (object.masterchain_block_) {
+    jo << ctie("masterchain_block", ToJson(object.masterchain_block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_downloadZeroState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.downloadZeroState");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_getNextBlockDescription &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.getNextBlockDescription");
+  if (object.prev_block_) {
+    jo << ctie("prev_block", ToJson(object.prev_block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_getNextKeyBlockIds &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.getNextKeyBlockIds");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+  jo << ctie("max_size", ToJson(object.max_size_));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_prepareBlock &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.prepareBlock");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_prepareBlockProof &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.prepareBlockProof");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+  jo << ctie("allow_partial", ToJson(object.allow_partial_));
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_preparePersistentState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.preparePersistentState");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+  if (object.masterchain_block_) {
+    jo << ctie("masterchain_block", ToJson(object.masterchain_block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::tonNode_prepareZeroState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "tonNode.prepareZeroState");
+  if (object.block_) {
+    jo << ctie("block", ToJson(object.block_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_downloadCandidate &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.downloadCandidate");
+  jo << ctie("round", ToJson(object.round_));
+  if (object.id_) {
+    jo << ctie("id", ToJson(object.id_));
+  }
+}
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_ping &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "validatorSession.ping");
+  jo << ctie("hash", ToJson(JsonInt64{object.hash_}));
+}
+}  // namespace ton_api
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api_json.h b/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api_json.h
new file mode 100644
index 0000000000..3b32d8ba1c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/auto/tl/ton_api_json.h
@@ -0,0 +1,713 @@
+#pragma once
+
+#include "auto/tl/ton_api.h"
+
+#include "auto/tl/ton_api.hpp"
+
+#include "td/utils/JsonBuilder.h"
+#include "td/utils/Status.h"
+
+#include "crypto/common/bitstring.h"
+namespace ton {
+namespace ton_api{
+  using namespace td;
+Result<int32> tl_constructor_from_string(ton_api::Hashable *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::PrivateKey *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::PublicKey *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::TestObject *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::adnl_Address *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::adnl_Message *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::adnl_Proxy *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::catchain_BlockResult *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::catchain_Difference *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::catchain_block_inner_Data *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::db_block_Info *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::db_blockdb_Key *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::db_filedb_Key *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::db_lt_Key *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::db_root_Key *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::db_state_Key *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::dht_UpdateRule *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::dht_ValueResult *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::dht_config_Local *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::engine_Addr *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::fec_Type *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::liteserver_config_Local *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::overlay_Broadcast *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::overlay_Certificate *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::rldp_Message *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::rldp_MessagePart *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::tcp_Message *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::ton_BlockId *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::tonNode_BlockDescription *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::tonNode_Broadcast *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::tonNode_Prepared *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::tonNode_PreparedProof *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::tonNode_PreparedState *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::validator_config_Local *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::validatorSession_Message *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::validatorSession_round_Message *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::Object *object, const std::string &str);
+Result<int32> tl_constructor_from_string(ton_api::Function *object, const std::string &str);
+Status from_json(ton_api::hashable_bool &to, JsonObject &from);
+Status from_json(ton_api::hashable_int32 &to, JsonObject &from);
+Status from_json(ton_api::hashable_int64 &to, JsonObject &from);
+Status from_json(ton_api::hashable_int256 &to, JsonObject &from);
+Status from_json(ton_api::hashable_bytes &to, JsonObject &from);
+Status from_json(ton_api::hashable_pair &to, JsonObject &from);
+Status from_json(ton_api::hashable_vector &to, JsonObject &from);
+Status from_json(ton_api::hashable_validatorSessionOldRound &to, JsonObject &from);
+Status from_json(ton_api::hashable_validatorSessionRoundAttempt &to, JsonObject &from);
+Status from_json(ton_api::hashable_validatorSessionRound &to, JsonObject &from);
+Status from_json(ton_api::hashable_blockSignature &to, JsonObject &from);
+Status from_json(ton_api::hashable_sentBlock &to, JsonObject &from);
+Status from_json(ton_api::hashable_sentBlockEmpty &to, JsonObject &from);
+Status from_json(ton_api::hashable_vote &to, JsonObject &from);
+Status from_json(ton_api::hashable_blockCandidate &to, JsonObject &from);
+Status from_json(ton_api::hashable_blockVoteCandidate &to, JsonObject &from);
+Status from_json(ton_api::hashable_blockCandidateAttempt &to, JsonObject &from);
+Status from_json(ton_api::hashable_cntVector &to, JsonObject &from);
+Status from_json(ton_api::hashable_cntSortedVector &to, JsonObject &from);
+Status from_json(ton_api::hashable_validatorSession &to, JsonObject &from);
+Status from_json(ton_api::pk_unenc &to, JsonObject &from);
+Status from_json(ton_api::pk_ed25519 &to, JsonObject &from);
+Status from_json(ton_api::pk_aes &to, JsonObject &from);
+Status from_json(ton_api::pk_overlay &to, JsonObject &from);
+Status from_json(ton_api::pub_unenc &to, JsonObject &from);
+Status from_json(ton_api::pub_ed25519 &to, JsonObject &from);
+Status from_json(ton_api::pub_aes &to, JsonObject &from);
+Status from_json(ton_api::pub_overlay &to, JsonObject &from);
+Status from_json(ton_api::testObject &to, JsonObject &from);
+Status from_json(ton_api::testString &to, JsonObject &from);
+Status from_json(ton_api::testInt &to, JsonObject &from);
+Status from_json(ton_api::testVectorBytes &to, JsonObject &from);
+Status from_json(ton_api::adnl_address_udp &to, JsonObject &from);
+Status from_json(ton_api::adnl_address_udp6 &to, JsonObject &from);
+Status from_json(ton_api::adnl_addressList &to, JsonObject &from);
+Status from_json(ton_api::adnl_message_createChannel &to, JsonObject &from);
+Status from_json(ton_api::adnl_message_confirmChannel &to, JsonObject &from);
+Status from_json(ton_api::adnl_message_custom &to, JsonObject &from);
+Status from_json(ton_api::adnl_message_nop &to, JsonObject &from);
+Status from_json(ton_api::adnl_message_reinit &to, JsonObject &from);
+Status from_json(ton_api::adnl_message_query &to, JsonObject &from);
+Status from_json(ton_api::adnl_message_answer &to, JsonObject &from);
+Status from_json(ton_api::adnl_message_part &to, JsonObject &from);
+Status from_json(ton_api::adnl_node &to, JsonObject &from);
+Status from_json(ton_api::adnl_nodes &to, JsonObject &from);
+Status from_json(ton_api::adnl_packetContents &to, JsonObject &from);
+Status from_json(ton_api::adnl_pong &to, JsonObject &from);
+Status from_json(ton_api::adnl_proxy_none &to, JsonObject &from);
+Status from_json(ton_api::adnl_proxy_fast &to, JsonObject &from);
+Status from_json(ton_api::adnl_proxyToFastHash &to, JsonObject &from);
+Status from_json(ton_api::adnl_proxyToFast &to, JsonObject &from);
+Status from_json(ton_api::adnl_config_global &to, JsonObject &from);
+Status from_json(ton_api::adnl_db_node_key &to, JsonObject &from);
+Status from_json(ton_api::adnl_db_node_value &to, JsonObject &from);
+Status from_json(ton_api::adnl_id_short &to, JsonObject &from);
+Status from_json(ton_api::catchain_block &to, JsonObject &from);
+Status from_json(ton_api::catchain_blockNotFound &to, JsonObject &from);
+Status from_json(ton_api::catchain_blockResult &to, JsonObject &from);
+Status from_json(ton_api::catchain_blocks &to, JsonObject &from);
+Status from_json(ton_api::catchain_difference &to, JsonObject &from);
+Status from_json(ton_api::catchain_differenceFork &to, JsonObject &from);
+Status from_json(ton_api::catchain_firstblock &to, JsonObject &from);
+Status from_json(ton_api::catchain_sent &to, JsonObject &from);
+Status from_json(ton_api::catchain_blockUpdate &to, JsonObject &from);
+Status from_json(ton_api::catchain_block_data &to, JsonObject &from);
+Status from_json(ton_api::catchain_block_dep &to, JsonObject &from);
+Status from_json(ton_api::catchain_block_id &to, JsonObject &from);
+Status from_json(ton_api::catchain_block_data_badBlock &to, JsonObject &from);
+Status from_json(ton_api::catchain_block_data_fork &to, JsonObject &from);
+Status from_json(ton_api::catchain_block_data_nop &to, JsonObject &from);
+Status from_json(ton_api::catchain_block_data_vector &to, JsonObject &from);
+Status from_json(ton_api::catchain_config_global &to, JsonObject &from);
+Status from_json(ton_api::config_global &to, JsonObject &from);
+Status from_json(ton_api::config_local &to, JsonObject &from);
+Status from_json(ton_api::control_config_local &to, JsonObject &from);
+Status from_json(ton_api::db_candidate &to, JsonObject &from);
+Status from_json(ton_api::db_block_info &to, JsonObject &from);
+Status from_json(ton_api::db_block_archivedInfo &to, JsonObject &from);
+Status from_json(ton_api::db_blockdb_key_lru &to, JsonObject &from);
+Status from_json(ton_api::db_blockdb_key_value &to, JsonObject &from);
+Status from_json(ton_api::db_blockdb_lru &to, JsonObject &from);
+Status from_json(ton_api::db_blockdb_value &to, JsonObject &from);
+Status from_json(ton_api::db_candidate_id &to, JsonObject &from);
+Status from_json(ton_api::db_celldb_value &to, JsonObject &from);
+Status from_json(ton_api::db_celldb_key_value &to, JsonObject &from);
+Status from_json(ton_api::db_filedb_key_empty &to, JsonObject &from);
+Status from_json(ton_api::db_filedb_key_blockFile &to, JsonObject &from);
+Status from_json(ton_api::db_filedb_key_zeroStateFile &to, JsonObject &from);
+Status from_json(ton_api::db_filedb_key_persistentStateFile &to, JsonObject &from);
+Status from_json(ton_api::db_filedb_key_proof &to, JsonObject &from);
+Status from_json(ton_api::db_filedb_key_proofLink &to, JsonObject &from);
+Status from_json(ton_api::db_filedb_key_signatures &to, JsonObject &from);
+Status from_json(ton_api::db_filedb_key_candidate &to, JsonObject &from);
+Status from_json(ton_api::db_filedb_value &to, JsonObject &from);
+Status from_json(ton_api::db_lt_el_key &to, JsonObject &from);
+Status from_json(ton_api::db_lt_desc_key &to, JsonObject &from);
+Status from_json(ton_api::db_lt_shard_key &to, JsonObject &from);
+Status from_json(ton_api::db_lt_status_key &to, JsonObject &from);
+Status from_json(ton_api::db_lt_desc_value &to, JsonObject &from);
+Status from_json(ton_api::db_lt_el_value &to, JsonObject &from);
+Status from_json(ton_api::db_lt_shard_value &to, JsonObject &from);
+Status from_json(ton_api::db_lt_status_value &to, JsonObject &from);
+Status from_json(ton_api::db_root_config &to, JsonObject &from);
+Status from_json(ton_api::db_root_dbDescription &to, JsonObject &from);
+Status from_json(ton_api::db_root_key_cellDb &to, JsonObject &from);
+Status from_json(ton_api::db_root_key_blockDb &to, JsonObject &from);
+Status from_json(ton_api::db_root_key_config &to, JsonObject &from);
+Status from_json(ton_api::db_state_asyncSerializer &to, JsonObject &from);
+Status from_json(ton_api::db_state_destroyedSessions &to, JsonObject &from);
+Status from_json(ton_api::db_state_gcBlockId &to, JsonObject &from);
+Status from_json(ton_api::db_state_initBlockId &to, JsonObject &from);
+Status from_json(ton_api::db_state_key_destroyedSessions &to, JsonObject &from);
+Status from_json(ton_api::db_state_key_initBlockId &to, JsonObject &from);
+Status from_json(ton_api::db_state_key_gcBlockId &to, JsonObject &from);
+Status from_json(ton_api::db_state_key_shardClient &to, JsonObject &from);
+Status from_json(ton_api::db_state_key_asyncSerializer &to, JsonObject &from);
+Status from_json(ton_api::db_state_shardClient &to, JsonObject &from);
+Status from_json(ton_api::dht_key &to, JsonObject &from);
+Status from_json(ton_api::dht_keyDescription &to, JsonObject &from);
+Status from_json(ton_api::dht_message &to, JsonObject &from);
+Status from_json(ton_api::dht_node &to, JsonObject &from);
+Status from_json(ton_api::dht_nodes &to, JsonObject &from);
+Status from_json(ton_api::dht_pong &to, JsonObject &from);
+Status from_json(ton_api::dht_stored &to, JsonObject &from);
+Status from_json(ton_api::dht_updateRule_signature &to, JsonObject &from);
+Status from_json(ton_api::dht_updateRule_anybody &to, JsonObject &from);
+Status from_json(ton_api::dht_updateRule_overlayNodes &to, JsonObject &from);
+Status from_json(ton_api::dht_value &to, JsonObject &from);
+Status from_json(ton_api::dht_valueNotFound &to, JsonObject &from);
+Status from_json(ton_api::dht_valueFound &to, JsonObject &from);
+Status from_json(ton_api::dht_config_global &to, JsonObject &from);
+Status from_json(ton_api::dht_config_local &to, JsonObject &from);
+Status from_json(ton_api::dht_config_random_local &to, JsonObject &from);
+Status from_json(ton_api::dht_db_bucket &to, JsonObject &from);
+Status from_json(ton_api::dht_db_key_bucket &to, JsonObject &from);
+Status from_json(ton_api::dummyworkchain0_config_global &to, JsonObject &from);
+Status from_json(ton_api::engine_addr &to, JsonObject &from);
+Status from_json(ton_api::engine_addrProxy &to, JsonObject &from);
+Status from_json(ton_api::engine_adnl &to, JsonObject &from);
+Status from_json(ton_api::engine_controlInterface &to, JsonObject &from);
+Status from_json(ton_api::engine_controlProcess &to, JsonObject &from);
+Status from_json(ton_api::engine_dht &to, JsonObject &from);
+Status from_json(ton_api::engine_gc &to, JsonObject &from);
+Status from_json(ton_api::engine_liteServer &to, JsonObject &from);
+Status from_json(ton_api::engine_validator &to, JsonObject &from);
+Status from_json(ton_api::engine_validatorAdnlAddress &to, JsonObject &from);
+Status from_json(ton_api::engine_validatorTempKey &to, JsonObject &from);
+Status from_json(ton_api::engine_adnlProxy_config &to, JsonObject &from);
+Status from_json(ton_api::engine_adnlProxy_port &to, JsonObject &from);
+Status from_json(ton_api::engine_dht_config &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_config &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_controlQueryError &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_dhtServerStatus &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_dhtServersStatus &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_electionBid &to, JsonObject &from);
+Status from_json(ton_api::validator_groupMember &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_jsonConfig &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_keyHash &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_oneStat &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_signature &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_stats &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_success &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_time &to, JsonObject &from);
+Status from_json(ton_api::fec_raptorQ &to, JsonObject &from);
+Status from_json(ton_api::fec_roundRobin &to, JsonObject &from);
+Status from_json(ton_api::fec_online &to, JsonObject &from);
+Status from_json(ton_api::id_config_local &to, JsonObject &from);
+Status from_json(ton_api::liteclient_config_global &to, JsonObject &from);
+Status from_json(ton_api::liteserver_desc &to, JsonObject &from);
+Status from_json(ton_api::liteserver_config_local &to, JsonObject &from);
+Status from_json(ton_api::liteserver_config_random_local &to, JsonObject &from);
+Status from_json(ton_api::overlay_fec_received &to, JsonObject &from);
+Status from_json(ton_api::overlay_fec_completed &to, JsonObject &from);
+Status from_json(ton_api::overlay_unicast &to, JsonObject &from);
+Status from_json(ton_api::overlay_broadcast &to, JsonObject &from);
+Status from_json(ton_api::overlay_broadcastFec &to, JsonObject &from);
+Status from_json(ton_api::overlay_broadcastFecShort &to, JsonObject &from);
+Status from_json(ton_api::overlay_broadcastNotFound &to, JsonObject &from);
+Status from_json(ton_api::overlay_broadcastList &to, JsonObject &from);
+Status from_json(ton_api::overlay_certificate &to, JsonObject &from);
+Status from_json(ton_api::overlay_emptyCertificate &to, JsonObject &from);
+Status from_json(ton_api::overlay_certificateId &to, JsonObject &from);
+Status from_json(ton_api::overlay_message &to, JsonObject &from);
+Status from_json(ton_api::overlay_node &to, JsonObject &from);
+Status from_json(ton_api::overlay_nodes &to, JsonObject &from);
+Status from_json(ton_api::overlay_broadcast_id &to, JsonObject &from);
+Status from_json(ton_api::overlay_broadcast_toSign &to, JsonObject &from);
+Status from_json(ton_api::overlay_broadcastFec_id &to, JsonObject &from);
+Status from_json(ton_api::overlay_broadcastFec_partId &to, JsonObject &from);
+Status from_json(ton_api::overlay_db_key_nodes &to, JsonObject &from);
+Status from_json(ton_api::overlay_db_nodes &to, JsonObject &from);
+Status from_json(ton_api::overlay_node_toSign &to, JsonObject &from);
+Status from_json(ton_api::rldp_message &to, JsonObject &from);
+Status from_json(ton_api::rldp_query &to, JsonObject &from);
+Status from_json(ton_api::rldp_answer &to, JsonObject &from);
+Status from_json(ton_api::rldp_messagePart &to, JsonObject &from);
+Status from_json(ton_api::rldp_confirm &to, JsonObject &from);
+Status from_json(ton_api::rldp_complete &to, JsonObject &from);
+Status from_json(ton_api::tcp_authentificate &to, JsonObject &from);
+Status from_json(ton_api::tcp_authentificationNonce &to, JsonObject &from);
+Status from_json(ton_api::tcp_authentificationComplete &to, JsonObject &from);
+Status from_json(ton_api::tcp_pong &to, JsonObject &from);
+Status from_json(ton_api::ton_blockId &to, JsonObject &from);
+Status from_json(ton_api::ton_blockIdApprove &to, JsonObject &from);
+Status from_json(ton_api::tonNode_blockDescriptionEmpty &to, JsonObject &from);
+Status from_json(ton_api::tonNode_blockDescription &to, JsonObject &from);
+Status from_json(ton_api::tonNode_blockId &to, JsonObject &from);
+Status from_json(ton_api::tonNode_blockIdExt &to, JsonObject &from);
+Status from_json(ton_api::tonNode_blockSignature &to, JsonObject &from);
+Status from_json(ton_api::tonNode_blockBroadcast &to, JsonObject &from);
+Status from_json(ton_api::tonNode_ihrMessageBroadcast &to, JsonObject &from);
+Status from_json(ton_api::tonNode_externalMessageBroadcast &to, JsonObject &from);
+Status from_json(ton_api::tonNode_newShardBlockBroadcast &to, JsonObject &from);
+Status from_json(ton_api::tonNode_data &to, JsonObject &from);
+Status from_json(ton_api::tonNode_externalMessage &to, JsonObject &from);
+Status from_json(ton_api::tonNode_ihrMessage &to, JsonObject &from);
+Status from_json(ton_api::tonNode_keyBlocks &to, JsonObject &from);
+Status from_json(ton_api::tonNode_newShardBlock &to, JsonObject &from);
+Status from_json(ton_api::tonNode_prepared &to, JsonObject &from);
+Status from_json(ton_api::tonNode_notFound &to, JsonObject &from);
+Status from_json(ton_api::tonNode_preparedProofEmpty &to, JsonObject &from);
+Status from_json(ton_api::tonNode_preparedProof &to, JsonObject &from);
+Status from_json(ton_api::tonNode_preparedProofLink &to, JsonObject &from);
+Status from_json(ton_api::tonNode_preparedState &to, JsonObject &from);
+Status from_json(ton_api::tonNode_notFoundState &to, JsonObject &from);
+Status from_json(ton_api::tonNode_sessionId &to, JsonObject &from);
+Status from_json(ton_api::tonNode_shardPublicOverlayId &to, JsonObject &from);
+Status from_json(ton_api::tonNode_zeroStateIdExt &to, JsonObject &from);
+Status from_json(ton_api::validator_group &to, JsonObject &from);
+Status from_json(ton_api::validator_config_global &to, JsonObject &from);
+Status from_json(ton_api::validator_config_local &to, JsonObject &from);
+Status from_json(ton_api::validator_config_random_local &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_blockUpdate &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_candidate &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_candidateId &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_config &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_message_startSession &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_message_finishSession &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_pong &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_round_id &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_message_submittedBlock &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_message_approvedBlock &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_message_rejectedBlock &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_message_commit &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_message_vote &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_message_voteFor &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_message_precommit &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_message_empty &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_candidate_id &to, JsonObject &from);
+Status from_json(ton_api::adnl_ping &to, JsonObject &from);
+Status from_json(ton_api::catchain_getBlock &to, JsonObject &from);
+Status from_json(ton_api::catchain_getBlockHistory &to, JsonObject &from);
+Status from_json(ton_api::catchain_getBlocks &to, JsonObject &from);
+Status from_json(ton_api::catchain_getDifference &to, JsonObject &from);
+Status from_json(ton_api::dht_findNode &to, JsonObject &from);
+Status from_json(ton_api::dht_findValue &to, JsonObject &from);
+Status from_json(ton_api::dht_getSignedAddressList &to, JsonObject &from);
+Status from_json(ton_api::dht_ping &to, JsonObject &from);
+Status from_json(ton_api::dht_query &to, JsonObject &from);
+Status from_json(ton_api::dht_store &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_addAdnlId &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_addControlInterface &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_addControlProcess &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_addDhtId &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_addListeningPort &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_addLiteserver &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_addProxy &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_addValidatorAdnlAddress &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_addValidatorPermanentKey &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_addValidatorTempKey &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_changeFullNodeAdnlAddress &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_checkDhtServers &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_controlQuery &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_createElectionBid &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_delAdnlId &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_delDhtId &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_delListeningPort &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_delProxy &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_delValidatorAdnlAddress &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_delValidatorPermanentKey &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_delValidatorTempKey &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_exportPrivateKey &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_exportPublicKey &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_generateKeyPair &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_getConfig &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_getStats &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_getTime &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_importPrivateKey &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_setVerbosity &to, JsonObject &from);
+Status from_json(ton_api::engine_validator_sign &to, JsonObject &from);
+Status from_json(ton_api::getTestObject &to, JsonObject &from);
+Status from_json(ton_api::overlay_getBroadcast &to, JsonObject &from);
+Status from_json(ton_api::overlay_getBroadcastList &to, JsonObject &from);
+Status from_json(ton_api::overlay_getRandomPeers &to, JsonObject &from);
+Status from_json(ton_api::overlay_query &to, JsonObject &from);
+Status from_json(ton_api::tcp_ping &to, JsonObject &from);
+Status from_json(ton_api::tonNode_downloadBlock &to, JsonObject &from);
+Status from_json(ton_api::tonNode_downloadBlockProof &to, JsonObject &from);
+Status from_json(ton_api::tonNode_downloadBlockProofLink &to, JsonObject &from);
+Status from_json(ton_api::tonNode_downloadPersistentState &to, JsonObject &from);
+Status from_json(ton_api::tonNode_downloadZeroState &to, JsonObject &from);
+Status from_json(ton_api::tonNode_getNextBlockDescription &to, JsonObject &from);
+Status from_json(ton_api::tonNode_getNextKeyBlockIds &to, JsonObject &from);
+Status from_json(ton_api::tonNode_prepareBlock &to, JsonObject &from);
+Status from_json(ton_api::tonNode_prepareBlockProof &to, JsonObject &from);
+Status from_json(ton_api::tonNode_preparePersistentState &to, JsonObject &from);
+Status from_json(ton_api::tonNode_prepareZeroState &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_downloadCandidate &to, JsonObject &from);
+Status from_json(ton_api::validatorSession_ping &to, JsonObject &from);
+void to_json(JsonValueScope &jv, const ton_api::Hashable &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_bool &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_int32 &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_int64 &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_int256 &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_bytes &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_pair &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_vector &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_validatorSessionOldRound &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_validatorSessionRoundAttempt &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_validatorSessionRound &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_blockSignature &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_sentBlock &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_sentBlockEmpty &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_vote &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_blockCandidate &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_blockVoteCandidate &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_blockCandidateAttempt &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_cntVector &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_cntSortedVector &object);
+void to_json(JsonValueScope &jv, const ton_api::hashable_validatorSession &object);
+void to_json(JsonValueScope &jv, const ton_api::PrivateKey &object);
+void to_json(JsonValueScope &jv, const ton_api::pk_unenc &object);
+void to_json(JsonValueScope &jv, const ton_api::pk_ed25519 &object);
+void to_json(JsonValueScope &jv, const ton_api::pk_aes &object);
+void to_json(JsonValueScope &jv, const ton_api::pk_overlay &object);
+void to_json(JsonValueScope &jv, const ton_api::PublicKey &object);
+void to_json(JsonValueScope &jv, const ton_api::pub_unenc &object);
+void to_json(JsonValueScope &jv, const ton_api::pub_ed25519 &object);
+void to_json(JsonValueScope &jv, const ton_api::pub_aes &object);
+void to_json(JsonValueScope &jv, const ton_api::pub_overlay &object);
+void to_json(JsonValueScope &jv, const ton_api::TestObject &object);
+void to_json(JsonValueScope &jv, const ton_api::testObject &object);
+void to_json(JsonValueScope &jv, const ton_api::testString &object);
+void to_json(JsonValueScope &jv, const ton_api::testInt &object);
+void to_json(JsonValueScope &jv, const ton_api::testVectorBytes &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_Address &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_address_udp &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_address_udp6 &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_addressList &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_Message &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_createChannel &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_confirmChannel &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_custom &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_nop &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_reinit &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_query &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_answer &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_message_part &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_node &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_nodes &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_packetContents &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_pong &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_Proxy &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_proxy_none &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_proxy_fast &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_proxyToFastHash &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_proxyToFast &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_config_global &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_db_node_key &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_db_node_value &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_id_short &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_block &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_BlockResult &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_blockNotFound &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_blockResult &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_blocks &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_Difference &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_difference &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_differenceFork &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_firstblock &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_sent &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_blockUpdate &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_data &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_dep &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_id &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_inner_Data &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_data_badBlock &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_data_fork &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_data_nop &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_block_data_vector &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_config_global &object);
+void to_json(JsonValueScope &jv, const ton_api::config_global &object);
+void to_json(JsonValueScope &jv, const ton_api::config_local &object);
+void to_json(JsonValueScope &jv, const ton_api::control_config_local &object);
+void to_json(JsonValueScope &jv, const ton_api::db_candidate &object);
+void to_json(JsonValueScope &jv, const ton_api::db_block_Info &object);
+void to_json(JsonValueScope &jv, const ton_api::db_block_info &object);
+void to_json(JsonValueScope &jv, const ton_api::db_block_archivedInfo &object);
+void to_json(JsonValueScope &jv, const ton_api::db_blockdb_Key &object);
+void to_json(JsonValueScope &jv, const ton_api::db_blockdb_key_lru &object);
+void to_json(JsonValueScope &jv, const ton_api::db_blockdb_key_value &object);
+void to_json(JsonValueScope &jv, const ton_api::db_blockdb_lru &object);
+void to_json(JsonValueScope &jv, const ton_api::db_blockdb_value &object);
+void to_json(JsonValueScope &jv, const ton_api::db_candidate_id &object);
+void to_json(JsonValueScope &jv, const ton_api::db_celldb_value &object);
+void to_json(JsonValueScope &jv, const ton_api::db_celldb_key_value &object);
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_Key &object);
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_empty &object);
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_blockFile &object);
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_zeroStateFile &object);
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_persistentStateFile &object);
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_proof &object);
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_proofLink &object);
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_signatures &object);
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_key_candidate &object);
+void to_json(JsonValueScope &jv, const ton_api::db_filedb_value &object);
+void to_json(JsonValueScope &jv, const ton_api::db_lt_Key &object);
+void to_json(JsonValueScope &jv, const ton_api::db_lt_el_key &object);
+void to_json(JsonValueScope &jv, const ton_api::db_lt_desc_key &object);
+void to_json(JsonValueScope &jv, const ton_api::db_lt_shard_key &object);
+void to_json(JsonValueScope &jv, const ton_api::db_lt_status_key &object);
+void to_json(JsonValueScope &jv, const ton_api::db_lt_desc_value &object);
+void to_json(JsonValueScope &jv, const ton_api::db_lt_el_value &object);
+void to_json(JsonValueScope &jv, const ton_api::db_lt_shard_value &object);
+void to_json(JsonValueScope &jv, const ton_api::db_lt_status_value &object);
+void to_json(JsonValueScope &jv, const ton_api::db_root_config &object);
+void to_json(JsonValueScope &jv, const ton_api::db_root_dbDescription &object);
+void to_json(JsonValueScope &jv, const ton_api::db_root_Key &object);
+void to_json(JsonValueScope &jv, const ton_api::db_root_key_cellDb &object);
+void to_json(JsonValueScope &jv, const ton_api::db_root_key_blockDb &object);
+void to_json(JsonValueScope &jv, const ton_api::db_root_key_config &object);
+void to_json(JsonValueScope &jv, const ton_api::db_state_asyncSerializer &object);
+void to_json(JsonValueScope &jv, const ton_api::db_state_destroyedSessions &object);
+void to_json(JsonValueScope &jv, const ton_api::db_state_gcBlockId &object);
+void to_json(JsonValueScope &jv, const ton_api::db_state_initBlockId &object);
+void to_json(JsonValueScope &jv, const ton_api::db_state_Key &object);
+void to_json(JsonValueScope &jv, const ton_api::db_state_key_destroyedSessions &object);
+void to_json(JsonValueScope &jv, const ton_api::db_state_key_initBlockId &object);
+void to_json(JsonValueScope &jv, const ton_api::db_state_key_gcBlockId &object);
+void to_json(JsonValueScope &jv, const ton_api::db_state_key_shardClient &object);
+void to_json(JsonValueScope &jv, const ton_api::db_state_key_asyncSerializer &object);
+void to_json(JsonValueScope &jv, const ton_api::db_state_shardClient &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_key &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_keyDescription &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_message &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_node &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_nodes &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_pong &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_stored &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_UpdateRule &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_updateRule_signature &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_updateRule_anybody &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_updateRule_overlayNodes &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_value &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_ValueResult &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_valueNotFound &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_valueFound &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_config_global &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_config_Local &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_config_local &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_config_random_local &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_db_bucket &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_db_key_bucket &object);
+void to_json(JsonValueScope &jv, const ton_api::dummyworkchain0_config_global &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_Addr &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_addr &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_addrProxy &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_adnl &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_controlInterface &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_controlProcess &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_dht &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_gc &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_liteServer &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validatorAdnlAddress &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validatorTempKey &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_adnlProxy_config &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_adnlProxy_port &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_dht_config &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_config &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_controlQueryError &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_dhtServerStatus &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_dhtServersStatus &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_electionBid &object);
+void to_json(JsonValueScope &jv, const ton_api::validator_groupMember &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_jsonConfig &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_keyHash &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_oneStat &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_signature &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_stats &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_success &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_time &object);
+void to_json(JsonValueScope &jv, const ton_api::fec_Type &object);
+void to_json(JsonValueScope &jv, const ton_api::fec_raptorQ &object);
+void to_json(JsonValueScope &jv, const ton_api::fec_roundRobin &object);
+void to_json(JsonValueScope &jv, const ton_api::fec_online &object);
+void to_json(JsonValueScope &jv, const ton_api::id_config_local &object);
+void to_json(JsonValueScope &jv, const ton_api::liteclient_config_global &object);
+void to_json(JsonValueScope &jv, const ton_api::liteserver_desc &object);
+void to_json(JsonValueScope &jv, const ton_api::liteserver_config_Local &object);
+void to_json(JsonValueScope &jv, const ton_api::liteserver_config_local &object);
+void to_json(JsonValueScope &jv, const ton_api::liteserver_config_random_local &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_Broadcast &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_fec_received &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_fec_completed &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_unicast &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcast &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcastFec &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcastFecShort &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcastNotFound &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcastList &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_Certificate &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_certificate &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_emptyCertificate &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_certificateId &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_message &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_node &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_nodes &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcast_id &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcast_toSign &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcastFec_id &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_broadcastFec_partId &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_db_key_nodes &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_db_nodes &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_node_toSign &object);
+void to_json(JsonValueScope &jv, const ton_api::rldp_Message &object);
+void to_json(JsonValueScope &jv, const ton_api::rldp_message &object);
+void to_json(JsonValueScope &jv, const ton_api::rldp_query &object);
+void to_json(JsonValueScope &jv, const ton_api::rldp_answer &object);
+void to_json(JsonValueScope &jv, const ton_api::rldp_MessagePart &object);
+void to_json(JsonValueScope &jv, const ton_api::rldp_messagePart &object);
+void to_json(JsonValueScope &jv, const ton_api::rldp_confirm &object);
+void to_json(JsonValueScope &jv, const ton_api::rldp_complete &object);
+void to_json(JsonValueScope &jv, const ton_api::tcp_Message &object);
+void to_json(JsonValueScope &jv, const ton_api::tcp_authentificate &object);
+void to_json(JsonValueScope &jv, const ton_api::tcp_authentificationNonce &object);
+void to_json(JsonValueScope &jv, const ton_api::tcp_authentificationComplete &object);
+void to_json(JsonValueScope &jv, const ton_api::tcp_pong &object);
+void to_json(JsonValueScope &jv, const ton_api::ton_BlockId &object);
+void to_json(JsonValueScope &jv, const ton_api::ton_blockId &object);
+void to_json(JsonValueScope &jv, const ton_api::ton_blockIdApprove &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_BlockDescription &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_blockDescriptionEmpty &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_blockDescription &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_blockId &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_blockIdExt &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_blockSignature &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_Broadcast &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_blockBroadcast &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_ihrMessageBroadcast &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_externalMessageBroadcast &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_newShardBlockBroadcast &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_data &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_externalMessage &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_ihrMessage &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_keyBlocks &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_newShardBlock &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_Prepared &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_prepared &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_notFound &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_PreparedProof &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_preparedProofEmpty &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_preparedProof &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_preparedProofLink &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_PreparedState &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_preparedState &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_notFoundState &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_sessionId &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_shardPublicOverlayId &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_zeroStateIdExt &object);
+void to_json(JsonValueScope &jv, const ton_api::validator_group &object);
+void to_json(JsonValueScope &jv, const ton_api::validator_config_global &object);
+void to_json(JsonValueScope &jv, const ton_api::validator_config_Local &object);
+void to_json(JsonValueScope &jv, const ton_api::validator_config_local &object);
+void to_json(JsonValueScope &jv, const ton_api::validator_config_random_local &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_blockUpdate &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_candidate &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_candidateId &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_config &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_Message &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_startSession &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_finishSession &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_pong &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_round_id &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_round_Message &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_submittedBlock &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_approvedBlock &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_rejectedBlock &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_commit &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_vote &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_voteFor &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_precommit &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_message_empty &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_candidate_id &object);
+void to_json(JsonValueScope &jv, const ton_api::adnl_ping &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_getBlock &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_getBlockHistory &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_getBlocks &object);
+void to_json(JsonValueScope &jv, const ton_api::catchain_getDifference &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_findNode &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_findValue &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_getSignedAddressList &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_ping &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_query &object);
+void to_json(JsonValueScope &jv, const ton_api::dht_store &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addAdnlId &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addControlInterface &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addControlProcess &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addDhtId &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addListeningPort &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addLiteserver &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addProxy &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addValidatorAdnlAddress &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addValidatorPermanentKey &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_addValidatorTempKey &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_changeFullNodeAdnlAddress &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_checkDhtServers &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_controlQuery &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_createElectionBid &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delAdnlId &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delDhtId &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delListeningPort &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delProxy &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delValidatorAdnlAddress &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delValidatorPermanentKey &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_delValidatorTempKey &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_exportPrivateKey &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_exportPublicKey &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_generateKeyPair &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_getConfig &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_getStats &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_getTime &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_importPrivateKey &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_setVerbosity &object);
+void to_json(JsonValueScope &jv, const ton_api::engine_validator_sign &object);
+void to_json(JsonValueScope &jv, const ton_api::getTestObject &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_getBroadcast &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_getBroadcastList &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_getRandomPeers &object);
+void to_json(JsonValueScope &jv, const ton_api::overlay_query &object);
+void to_json(JsonValueScope &jv, const ton_api::tcp_ping &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_downloadBlock &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_downloadBlockProof &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_downloadBlockProofLink &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_downloadPersistentState &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_downloadZeroState &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_getNextBlockDescription &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_getNextKeyBlockIds &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_prepareBlock &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_prepareBlockProof &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_preparePersistentState &object);
+void to_json(JsonValueScope &jv, const ton_api::tonNode_prepareZeroState &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_downloadCandidate &object);
+void to_json(JsonValueScope &jv, const ton_api::validatorSession_ping &object);
+inline void to_json(JsonValueScope &jv, const ton::ton_api::Object &object) {
+  ton::ton_api::downcast_call(const_cast<ton::ton_api::Object &>(object),[&jv](const auto &object) { to_json(jv, object); });
+}
+inline void to_json(JsonValueScope &jv, const ton::ton_api::Function &object) {
+  ton::ton_api::downcast_call(const_cast<ton::ton_api::Function &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+}  // namespace ton_api
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api.cpp b/submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api.cpp
new file mode 100644
index 0000000000..acd9c81126
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api.cpp
@@ -0,0 +1,1075 @@
+#include "tonlib_api.h"
+
+#include "tl/tl_object_parse.h"
+#include "tl/tl_object_store.h"
+#include "td/utils/int_types.h"
+
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+#include "td/utils/logging.h"
+#include "td/utils/tl_parsers.h"
+#include "td/utils/tl_storers.h"
+
+namespace ton {
+namespace tonlib_api {
+
+std::string to_string(const BaseObject &value) {
+  td::TlStorerToString storer;
+  value.store(storer, "");
+  return storer.str();
+}
+
+accountAddress::accountAddress()
+  : account_address_()
+{}
+
+accountAddress::accountAddress(std::string const &account_address_)
+  : account_address_(std::move(account_address_))
+{}
+
+const std::int32_t accountAddress::ID;
+
+void accountAddress::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "accountAddress");
+    s.store_field("account_address", account_address_);
+    s.store_class_end();
+  }
+}
+
+bip39Hints::bip39Hints()
+  : words_()
+{}
+
+bip39Hints::bip39Hints(std::vector<std::string> &&words_)
+  : words_(std::move(words_))
+{}
+
+const std::int32_t bip39Hints::ID;
+
+void bip39Hints::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "bip39Hints");
+    { const std::vector<std::string> &v = words_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("words", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+error::error()
+  : code_()
+  , message_()
+{}
+
+error::error(std::int32_t code_, std::string const &message_)
+  : code_(code_)
+  , message_(std::move(message_))
+{}
+
+const std::int32_t error::ID;
+
+void error::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "error");
+    s.store_field("code", code_);
+    s.store_field("message", message_);
+    s.store_class_end();
+  }
+}
+
+exportedEncryptedKey::exportedEncryptedKey()
+  : data_()
+{}
+
+exportedEncryptedKey::exportedEncryptedKey(td::SecureString &&data_)
+  : data_(std::move(data_))
+{}
+
+const std::int32_t exportedEncryptedKey::ID;
+
+void exportedEncryptedKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "exportedEncryptedKey");
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+exportedKey::exportedKey()
+  : word_list_()
+{}
+
+exportedKey::exportedKey(std::vector<td::SecureString> &&word_list_)
+  : word_list_(std::move(word_list_))
+{}
+
+const std::int32_t exportedKey::ID;
+
+void exportedKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "exportedKey");
+    { const std::vector<td::SecureString> &v = word_list_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("word_list", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { s.store_field("", v[i]); } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+exportedPemKey::exportedPemKey()
+  : pem_()
+{}
+
+exportedPemKey::exportedPemKey(td::SecureString &&pem_)
+  : pem_(std::move(pem_))
+{}
+
+const std::int32_t exportedPemKey::ID;
+
+void exportedPemKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "exportedPemKey");
+    s.store_field("pem", pem_);
+    s.store_class_end();
+  }
+}
+
+inputKey::inputKey()
+  : key_()
+  , local_password_()
+{}
+
+inputKey::inputKey(object_ptr<key> &&key_, td::SecureString &&local_password_)
+  : key_(std::move(key_))
+  , local_password_(std::move(local_password_))
+{}
+
+const std::int32_t inputKey::ID;
+
+void inputKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "inputKey");
+    if (key_ == nullptr) { s.store_field("key", "null"); } else { key_->store(s, "key"); }
+    s.store_bytes_field("local_password", local_password_);
+    s.store_class_end();
+  }
+}
+
+key::key()
+  : public_key_()
+  , secret_()
+{}
+
+key::key(std::string const &public_key_, td::SecureString &&secret_)
+  : public_key_(std::move(public_key_))
+  , secret_(std::move(secret_))
+{}
+
+const std::int32_t key::ID;
+
+void key::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "key");
+    s.store_field("public_key", public_key_);
+    s.store_bytes_field("secret", secret_);
+    s.store_class_end();
+  }
+}
+
+ok::ok() {
+}
+
+const std::int32_t ok::ID;
+
+void ok::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "ok");
+    s.store_class_end();
+  }
+}
+
+options::options()
+  : config_()
+  , keystore_directory_()
+{}
+
+options::options(std::string const &config_, std::string const &keystore_directory_)
+  : config_(std::move(config_))
+  , keystore_directory_(std::move(keystore_directory_))
+{}
+
+const std::int32_t options::ID;
+
+void options::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "options");
+    s.store_field("config", config_);
+    s.store_field("keystore_directory", keystore_directory_);
+    s.store_class_end();
+  }
+}
+
+generic_accountStateRaw::generic_accountStateRaw()
+  : account_state_()
+{}
+
+generic_accountStateRaw::generic_accountStateRaw(object_ptr<raw_accountState> &&account_state_)
+  : account_state_(std::move(account_state_))
+{}
+
+const std::int32_t generic_accountStateRaw::ID;
+
+void generic_accountStateRaw::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "generic_accountStateRaw");
+    if (account_state_ == nullptr) { s.store_field("account_state", "null"); } else { account_state_->store(s, "account_state"); }
+    s.store_class_end();
+  }
+}
+
+generic_accountStateTestWallet::generic_accountStateTestWallet()
+  : account_state_()
+{}
+
+generic_accountStateTestWallet::generic_accountStateTestWallet(object_ptr<testWallet_accountState> &&account_state_)
+  : account_state_(std::move(account_state_))
+{}
+
+const std::int32_t generic_accountStateTestWallet::ID;
+
+void generic_accountStateTestWallet::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "generic_accountStateTestWallet");
+    if (account_state_ == nullptr) { s.store_field("account_state", "null"); } else { account_state_->store(s, "account_state"); }
+    s.store_class_end();
+  }
+}
+
+generic_accountStateTestGiver::generic_accountStateTestGiver()
+  : account_state_()
+{}
+
+generic_accountStateTestGiver::generic_accountStateTestGiver(object_ptr<testGiver_accountState> &&account_state_)
+  : account_state_(std::move(account_state_))
+{}
+
+const std::int32_t generic_accountStateTestGiver::ID;
+
+void generic_accountStateTestGiver::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "generic_accountStateTestGiver");
+    if (account_state_ == nullptr) { s.store_field("account_state", "null"); } else { account_state_->store(s, "account_state"); }
+    s.store_class_end();
+  }
+}
+
+generic_accountStateUninited::generic_accountStateUninited()
+  : account_state_()
+{}
+
+generic_accountStateUninited::generic_accountStateUninited(object_ptr<uninited_accountState> &&account_state_)
+  : account_state_(std::move(account_state_))
+{}
+
+const std::int32_t generic_accountStateUninited::ID;
+
+void generic_accountStateUninited::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "generic_accountStateUninited");
+    if (account_state_ == nullptr) { s.store_field("account_state", "null"); } else { account_state_->store(s, "account_state"); }
+    s.store_class_end();
+  }
+}
+
+generic_initialAccountStateRaw::generic_initialAccountStateRaw()
+  : initital_account_state_()
+{}
+
+generic_initialAccountStateRaw::generic_initialAccountStateRaw(object_ptr<raw_initialAccountState> &&initital_account_state_)
+  : initital_account_state_(std::move(initital_account_state_))
+{}
+
+const std::int32_t generic_initialAccountStateRaw::ID;
+
+void generic_initialAccountStateRaw::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "generic_initialAccountStateRaw");
+    if (initital_account_state_ == nullptr) { s.store_field("initital_account_state", "null"); } else { initital_account_state_->store(s, "initital_account_state"); }
+    s.store_class_end();
+  }
+}
+
+generic_initialAccountStateTestWallet::generic_initialAccountStateTestWallet()
+  : initital_account_state_()
+{}
+
+generic_initialAccountStateTestWallet::generic_initialAccountStateTestWallet(object_ptr<testWallet_initialAccountState> &&initital_account_state_)
+  : initital_account_state_(std::move(initital_account_state_))
+{}
+
+const std::int32_t generic_initialAccountStateTestWallet::ID;
+
+void generic_initialAccountStateTestWallet::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "generic_initialAccountStateTestWallet");
+    if (initital_account_state_ == nullptr) { s.store_field("initital_account_state", "null"); } else { initital_account_state_->store(s, "initital_account_state"); }
+    s.store_class_end();
+  }
+}
+
+internal_transactionId::internal_transactionId()
+  : lt_()
+  , hash_()
+{}
+
+internal_transactionId::internal_transactionId(std::int64_t lt_, std::string const &hash_)
+  : lt_(lt_)
+  , hash_(std::move(hash_))
+{}
+
+const std::int32_t internal_transactionId::ID;
+
+void internal_transactionId::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "internal_transactionId");
+    s.store_field("lt", lt_);
+    s.store_bytes_field("hash", hash_);
+    s.store_class_end();
+  }
+}
+
+raw_accountState::raw_accountState()
+  : balance_()
+  , code_()
+  , data_()
+  , last_transaction_id_()
+{}
+
+raw_accountState::raw_accountState(std::int64_t balance_, std::string const &code_, std::string const &data_, object_ptr<internal_transactionId> &&last_transaction_id_)
+  : balance_(balance_)
+  , code_(std::move(code_))
+  , data_(std::move(data_))
+  , last_transaction_id_(std::move(last_transaction_id_))
+{}
+
+const std::int32_t raw_accountState::ID;
+
+void raw_accountState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "raw_accountState");
+    s.store_field("balance", balance_);
+    s.store_bytes_field("code", code_);
+    s.store_bytes_field("data", data_);
+    if (last_transaction_id_ == nullptr) { s.store_field("last_transaction_id", "null"); } else { last_transaction_id_->store(s, "last_transaction_id"); }
+    s.store_class_end();
+  }
+}
+
+raw_initialAccountState::raw_initialAccountState()
+  : code_()
+  , data_()
+{}
+
+raw_initialAccountState::raw_initialAccountState(std::string const &code_, std::string const &data_)
+  : code_(std::move(code_))
+  , data_(std::move(data_))
+{}
+
+const std::int32_t raw_initialAccountState::ID;
+
+void raw_initialAccountState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "raw_initialAccountState");
+    s.store_bytes_field("code", code_);
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+raw_message::raw_message()
+  : source_()
+  , destination_()
+  , value_()
+{}
+
+raw_message::raw_message(std::string const &source_, std::string const &destination_, std::int64_t value_)
+  : source_(std::move(source_))
+  , destination_(std::move(destination_))
+  , value_(value_)
+{}
+
+const std::int32_t raw_message::ID;
+
+void raw_message::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "raw_message");
+    s.store_field("source", source_);
+    s.store_field("destination", destination_);
+    s.store_field("value", value_);
+    s.store_class_end();
+  }
+}
+
+raw_transaction::raw_transaction()
+  : data_()
+  , previous_transaction_id_()
+  , fee_()
+  , in_msg_()
+  , out_msgs_()
+{}
+
+raw_transaction::raw_transaction(std::string const &data_, object_ptr<internal_transactionId> &&previous_transaction_id_, std::int64_t fee_, object_ptr<raw_message> &&in_msg_, std::vector<object_ptr<raw_message>> &&out_msgs_)
+  : data_(std::move(data_))
+  , previous_transaction_id_(std::move(previous_transaction_id_))
+  , fee_(fee_)
+  , in_msg_(std::move(in_msg_))
+  , out_msgs_(std::move(out_msgs_))
+{}
+
+const std::int32_t raw_transaction::ID;
+
+void raw_transaction::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "raw_transaction");
+    s.store_bytes_field("data", data_);
+    if (previous_transaction_id_ == nullptr) { s.store_field("previous_transaction_id", "null"); } else { previous_transaction_id_->store(s, "previous_transaction_id"); }
+    s.store_field("fee", fee_);
+    if (in_msg_ == nullptr) { s.store_field("in_msg", "null"); } else { in_msg_->store(s, "in_msg"); }
+    { const std::vector<object_ptr<raw_message>> &v = out_msgs_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("out_msgs", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+raw_transactions::raw_transactions()
+  : transactions_()
+{}
+
+raw_transactions::raw_transactions(std::vector<object_ptr<raw_transaction>> &&transactions_)
+  : transactions_(std::move(transactions_))
+{}
+
+const std::int32_t raw_transactions::ID;
+
+void raw_transactions::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "raw_transactions");
+    { const std::vector<object_ptr<raw_transaction>> &v = transactions_; const std::uint32_t multiplicity = static_cast<std::uint32_t>(v.size()); const auto vector_name = "vector[" + td::to_string(multiplicity)+ "]"; s.store_class_begin("transactions", vector_name.c_str()); for (std::uint32_t i = 0; i < multiplicity; i++) { if (v[i] == nullptr) { s.store_field("", "null"); } else { v[i]->store(s, ""); } } s.store_class_end(); }
+    s.store_class_end();
+  }
+}
+
+testGiver_accountState::testGiver_accountState()
+  : balance_()
+  , seqno_()
+  , last_transaction_id_()
+{}
+
+testGiver_accountState::testGiver_accountState(std::int64_t balance_, std::int32_t seqno_, object_ptr<internal_transactionId> &&last_transaction_id_)
+  : balance_(balance_)
+  , seqno_(seqno_)
+  , last_transaction_id_(std::move(last_transaction_id_))
+{}
+
+const std::int32_t testGiver_accountState::ID;
+
+void testGiver_accountState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testGiver_accountState");
+    s.store_field("balance", balance_);
+    s.store_field("seqno", seqno_);
+    if (last_transaction_id_ == nullptr) { s.store_field("last_transaction_id", "null"); } else { last_transaction_id_->store(s, "last_transaction_id"); }
+    s.store_class_end();
+  }
+}
+
+testWallet_accountState::testWallet_accountState()
+  : balance_()
+  , seqno_()
+  , last_transaction_id_()
+{}
+
+testWallet_accountState::testWallet_accountState(std::int64_t balance_, std::int32_t seqno_, object_ptr<internal_transactionId> &&last_transaction_id_)
+  : balance_(balance_)
+  , seqno_(seqno_)
+  , last_transaction_id_(std::move(last_transaction_id_))
+{}
+
+const std::int32_t testWallet_accountState::ID;
+
+void testWallet_accountState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testWallet_accountState");
+    s.store_field("balance", balance_);
+    s.store_field("seqno", seqno_);
+    if (last_transaction_id_ == nullptr) { s.store_field("last_transaction_id", "null"); } else { last_transaction_id_->store(s, "last_transaction_id"); }
+    s.store_class_end();
+  }
+}
+
+testWallet_initialAccountState::testWallet_initialAccountState()
+  : public_key_()
+{}
+
+testWallet_initialAccountState::testWallet_initialAccountState(std::string const &public_key_)
+  : public_key_(std::move(public_key_))
+{}
+
+const std::int32_t testWallet_initialAccountState::ID;
+
+void testWallet_initialAccountState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testWallet_initialAccountState");
+    s.store_field("public_key", public_key_);
+    s.store_class_end();
+  }
+}
+
+uninited_accountState::uninited_accountState()
+  : balance_()
+{}
+
+uninited_accountState::uninited_accountState(std::int64_t balance_)
+  : balance_(balance_)
+{}
+
+const std::int32_t uninited_accountState::ID;
+
+void uninited_accountState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "uninited_accountState");
+    s.store_field("balance", balance_);
+    s.store_class_end();
+  }
+}
+
+changeLocalPassword::changeLocalPassword()
+  : input_key_()
+  , new_local_password_()
+{}
+
+changeLocalPassword::changeLocalPassword(object_ptr<inputKey> &&input_key_, td::SecureString &&new_local_password_)
+  : input_key_(std::move(input_key_))
+  , new_local_password_(std::move(new_local_password_))
+{}
+
+const std::int32_t changeLocalPassword::ID;
+
+void changeLocalPassword::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "changeLocalPassword");
+    if (input_key_ == nullptr) { s.store_field("input_key", "null"); } else { input_key_->store(s, "input_key"); }
+    s.store_bytes_field("new_local_password", new_local_password_);
+    s.store_class_end();
+  }
+}
+
+close::close() {
+}
+
+const std::int32_t close::ID;
+
+void close::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "close");
+    s.store_class_end();
+  }
+}
+
+createNewKey::createNewKey()
+  : local_password_()
+  , mnemonic_password_()
+  , random_extra_seed_()
+{}
+
+createNewKey::createNewKey(td::SecureString &&local_password_, td::SecureString &&mnemonic_password_, td::SecureString &&random_extra_seed_)
+  : local_password_(std::move(local_password_))
+  , mnemonic_password_(std::move(mnemonic_password_))
+  , random_extra_seed_(std::move(random_extra_seed_))
+{}
+
+const std::int32_t createNewKey::ID;
+
+void createNewKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "createNewKey");
+    s.store_bytes_field("local_password", local_password_);
+    s.store_bytes_field("mnemonic_password", mnemonic_password_);
+    s.store_bytes_field("random_extra_seed", random_extra_seed_);
+    s.store_class_end();
+  }
+}
+
+deleteKey::deleteKey()
+  : public_key_()
+{}
+
+deleteKey::deleteKey(std::string const &public_key_)
+  : public_key_(std::move(public_key_))
+{}
+
+const std::int32_t deleteKey::ID;
+
+void deleteKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "deleteKey");
+    s.store_field("public_key", public_key_);
+    s.store_class_end();
+  }
+}
+
+exportEncryptedKey::exportEncryptedKey()
+  : input_key_()
+  , key_password_()
+{}
+
+exportEncryptedKey::exportEncryptedKey(object_ptr<inputKey> &&input_key_, td::SecureString &&key_password_)
+  : input_key_(std::move(input_key_))
+  , key_password_(std::move(key_password_))
+{}
+
+const std::int32_t exportEncryptedKey::ID;
+
+void exportEncryptedKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "exportEncryptedKey");
+    if (input_key_ == nullptr) { s.store_field("input_key", "null"); } else { input_key_->store(s, "input_key"); }
+    s.store_bytes_field("key_password", key_password_);
+    s.store_class_end();
+  }
+}
+
+exportKey::exportKey()
+  : input_key_()
+{}
+
+exportKey::exportKey(object_ptr<inputKey> &&input_key_)
+  : input_key_(std::move(input_key_))
+{}
+
+const std::int32_t exportKey::ID;
+
+void exportKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "exportKey");
+    if (input_key_ == nullptr) { s.store_field("input_key", "null"); } else { input_key_->store(s, "input_key"); }
+    s.store_class_end();
+  }
+}
+
+exportPemKey::exportPemKey()
+  : input_key_()
+  , key_password_()
+{}
+
+exportPemKey::exportPemKey(object_ptr<inputKey> &&input_key_, td::SecureString &&key_password_)
+  : input_key_(std::move(input_key_))
+  , key_password_(std::move(key_password_))
+{}
+
+const std::int32_t exportPemKey::ID;
+
+void exportPemKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "exportPemKey");
+    if (input_key_ == nullptr) { s.store_field("input_key", "null"); } else { input_key_->store(s, "input_key"); }
+    s.store_bytes_field("key_password", key_password_);
+    s.store_class_end();
+  }
+}
+
+generic_getAccountState::generic_getAccountState()
+  : account_address_()
+{}
+
+generic_getAccountState::generic_getAccountState(object_ptr<accountAddress> &&account_address_)
+  : account_address_(std::move(account_address_))
+{}
+
+const std::int32_t generic_getAccountState::ID;
+
+void generic_getAccountState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "generic_getAccountState");
+    if (account_address_ == nullptr) { s.store_field("account_address", "null"); } else { account_address_->store(s, "account_address"); }
+    s.store_class_end();
+  }
+}
+
+generic_sendGrams::generic_sendGrams()
+  : private_key_()
+  , source_()
+  , destination_()
+  , amount_()
+{}
+
+generic_sendGrams::generic_sendGrams(object_ptr<inputKey> &&private_key_, object_ptr<accountAddress> &&source_, object_ptr<accountAddress> &&destination_, std::int64_t amount_)
+  : private_key_(std::move(private_key_))
+  , source_(std::move(source_))
+  , destination_(std::move(destination_))
+  , amount_(amount_)
+{}
+
+const std::int32_t generic_sendGrams::ID;
+
+void generic_sendGrams::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "generic_sendGrams");
+    if (private_key_ == nullptr) { s.store_field("private_key", "null"); } else { private_key_->store(s, "private_key"); }
+    if (source_ == nullptr) { s.store_field("source", "null"); } else { source_->store(s, "source"); }
+    if (destination_ == nullptr) { s.store_field("destination", "null"); } else { destination_->store(s, "destination"); }
+    s.store_field("amount", amount_);
+    s.store_class_end();
+  }
+}
+
+getBip39Hints::getBip39Hints()
+  : prefix_()
+{}
+
+getBip39Hints::getBip39Hints(std::string const &prefix_)
+  : prefix_(std::move(prefix_))
+{}
+
+const std::int32_t getBip39Hints::ID;
+
+void getBip39Hints::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "getBip39Hints");
+    s.store_field("prefix", prefix_);
+    s.store_class_end();
+  }
+}
+
+importEncryptedKey::importEncryptedKey()
+  : local_password_()
+  , key_password_()
+  , exported_encrypted_key_()
+{}
+
+importEncryptedKey::importEncryptedKey(td::SecureString &&local_password_, td::SecureString &&key_password_, object_ptr<exportedEncryptedKey> &&exported_encrypted_key_)
+  : local_password_(std::move(local_password_))
+  , key_password_(std::move(key_password_))
+  , exported_encrypted_key_(std::move(exported_encrypted_key_))
+{}
+
+const std::int32_t importEncryptedKey::ID;
+
+void importEncryptedKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "importEncryptedKey");
+    s.store_bytes_field("local_password", local_password_);
+    s.store_bytes_field("key_password", key_password_);
+    if (exported_encrypted_key_ == nullptr) { s.store_field("exported_encrypted_key", "null"); } else { exported_encrypted_key_->store(s, "exported_encrypted_key"); }
+    s.store_class_end();
+  }
+}
+
+importKey::importKey()
+  : local_password_()
+  , mnemonic_password_()
+  , exported_key_()
+{}
+
+importKey::importKey(td::SecureString &&local_password_, td::SecureString &&mnemonic_password_, object_ptr<exportedKey> &&exported_key_)
+  : local_password_(std::move(local_password_))
+  , mnemonic_password_(std::move(mnemonic_password_))
+  , exported_key_(std::move(exported_key_))
+{}
+
+const std::int32_t importKey::ID;
+
+void importKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "importKey");
+    s.store_bytes_field("local_password", local_password_);
+    s.store_bytes_field("mnemonic_password", mnemonic_password_);
+    if (exported_key_ == nullptr) { s.store_field("exported_key", "null"); } else { exported_key_->store(s, "exported_key"); }
+    s.store_class_end();
+  }
+}
+
+importPemKey::importPemKey()
+  : local_password_()
+  , key_password_()
+  , exported_key_()
+{}
+
+importPemKey::importPemKey(td::SecureString &&local_password_, td::SecureString &&key_password_, object_ptr<exportedPemKey> &&exported_key_)
+  : local_password_(std::move(local_password_))
+  , key_password_(std::move(key_password_))
+  , exported_key_(std::move(exported_key_))
+{}
+
+const std::int32_t importPemKey::ID;
+
+void importPemKey::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "importPemKey");
+    s.store_bytes_field("local_password", local_password_);
+    s.store_bytes_field("key_password", key_password_);
+    if (exported_key_ == nullptr) { s.store_field("exported_key", "null"); } else { exported_key_->store(s, "exported_key"); }
+    s.store_class_end();
+  }
+}
+
+init::init()
+  : options_()
+{}
+
+init::init(object_ptr<options> &&options_)
+  : options_(std::move(options_))
+{}
+
+const std::int32_t init::ID;
+
+void init::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "init");
+    if (options_ == nullptr) { s.store_field("options", "null"); } else { options_->store(s, "options"); }
+    s.store_class_end();
+  }
+}
+
+options_setConfig::options_setConfig()
+  : config_()
+{}
+
+options_setConfig::options_setConfig(std::string const &config_)
+  : config_(std::move(config_))
+{}
+
+const std::int32_t options_setConfig::ID;
+
+void options_setConfig::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "options_setConfig");
+    s.store_field("config", config_);
+    s.store_class_end();
+  }
+}
+
+raw_getAccountAddress::raw_getAccountAddress()
+  : initital_account_state_()
+{}
+
+raw_getAccountAddress::raw_getAccountAddress(object_ptr<raw_initialAccountState> &&initital_account_state_)
+  : initital_account_state_(std::move(initital_account_state_))
+{}
+
+const std::int32_t raw_getAccountAddress::ID;
+
+void raw_getAccountAddress::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "raw_getAccountAddress");
+    if (initital_account_state_ == nullptr) { s.store_field("initital_account_state", "null"); } else { initital_account_state_->store(s, "initital_account_state"); }
+    s.store_class_end();
+  }
+}
+
+raw_getAccountState::raw_getAccountState()
+  : account_address_()
+{}
+
+raw_getAccountState::raw_getAccountState(object_ptr<accountAddress> &&account_address_)
+  : account_address_(std::move(account_address_))
+{}
+
+const std::int32_t raw_getAccountState::ID;
+
+void raw_getAccountState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "raw_getAccountState");
+    if (account_address_ == nullptr) { s.store_field("account_address", "null"); } else { account_address_->store(s, "account_address"); }
+    s.store_class_end();
+  }
+}
+
+raw_getTransactions::raw_getTransactions()
+  : account_address_()
+  , from_transaction_id_()
+{}
+
+raw_getTransactions::raw_getTransactions(object_ptr<accountAddress> &&account_address_, object_ptr<internal_transactionId> &&from_transaction_id_)
+  : account_address_(std::move(account_address_))
+  , from_transaction_id_(std::move(from_transaction_id_))
+{}
+
+const std::int32_t raw_getTransactions::ID;
+
+void raw_getTransactions::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "raw_getTransactions");
+    if (account_address_ == nullptr) { s.store_field("account_address", "null"); } else { account_address_->store(s, "account_address"); }
+    if (from_transaction_id_ == nullptr) { s.store_field("from_transaction_id", "null"); } else { from_transaction_id_->store(s, "from_transaction_id"); }
+    s.store_class_end();
+  }
+}
+
+raw_sendMessage::raw_sendMessage()
+  : destination_()
+  , initial_account_state_()
+  , data_()
+{}
+
+raw_sendMessage::raw_sendMessage(object_ptr<accountAddress> &&destination_, std::string const &initial_account_state_, std::string const &data_)
+  : destination_(std::move(destination_))
+  , initial_account_state_(std::move(initial_account_state_))
+  , data_(std::move(data_))
+{}
+
+const std::int32_t raw_sendMessage::ID;
+
+void raw_sendMessage::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "raw_sendMessage");
+    if (destination_ == nullptr) { s.store_field("destination", "null"); } else { destination_->store(s, "destination"); }
+    s.store_bytes_field("initial_account_state", initial_account_state_);
+    s.store_bytes_field("data", data_);
+    s.store_class_end();
+  }
+}
+
+runTests::runTests()
+  : dir_()
+{}
+
+runTests::runTests(std::string const &dir_)
+  : dir_(std::move(dir_))
+{}
+
+const std::int32_t runTests::ID;
+
+void runTests::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "runTests");
+    s.store_field("dir", dir_);
+    s.store_class_end();
+  }
+}
+
+testGiver_getAccountAddress::testGiver_getAccountAddress() {
+}
+
+const std::int32_t testGiver_getAccountAddress::ID;
+
+void testGiver_getAccountAddress::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testGiver_getAccountAddress");
+    s.store_class_end();
+  }
+}
+
+testGiver_getAccountState::testGiver_getAccountState() {
+}
+
+const std::int32_t testGiver_getAccountState::ID;
+
+void testGiver_getAccountState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testGiver_getAccountState");
+    s.store_class_end();
+  }
+}
+
+testGiver_sendGrams::testGiver_sendGrams()
+  : destination_()
+  , seqno_()
+  , amount_()
+{}
+
+testGiver_sendGrams::testGiver_sendGrams(object_ptr<accountAddress> &&destination_, std::int32_t seqno_, std::int64_t amount_)
+  : destination_(std::move(destination_))
+  , seqno_(seqno_)
+  , amount_(amount_)
+{}
+
+const std::int32_t testGiver_sendGrams::ID;
+
+void testGiver_sendGrams::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testGiver_sendGrams");
+    if (destination_ == nullptr) { s.store_field("destination", "null"); } else { destination_->store(s, "destination"); }
+    s.store_field("seqno", seqno_);
+    s.store_field("amount", amount_);
+    s.store_class_end();
+  }
+}
+
+testWallet_getAccountAddress::testWallet_getAccountAddress()
+  : initital_account_state_()
+{}
+
+testWallet_getAccountAddress::testWallet_getAccountAddress(object_ptr<testWallet_initialAccountState> &&initital_account_state_)
+  : initital_account_state_(std::move(initital_account_state_))
+{}
+
+const std::int32_t testWallet_getAccountAddress::ID;
+
+void testWallet_getAccountAddress::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testWallet_getAccountAddress");
+    if (initital_account_state_ == nullptr) { s.store_field("initital_account_state", "null"); } else { initital_account_state_->store(s, "initital_account_state"); }
+    s.store_class_end();
+  }
+}
+
+testWallet_getAccountState::testWallet_getAccountState()
+  : account_address_()
+{}
+
+testWallet_getAccountState::testWallet_getAccountState(object_ptr<accountAddress> &&account_address_)
+  : account_address_(std::move(account_address_))
+{}
+
+const std::int32_t testWallet_getAccountState::ID;
+
+void testWallet_getAccountState::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testWallet_getAccountState");
+    if (account_address_ == nullptr) { s.store_field("account_address", "null"); } else { account_address_->store(s, "account_address"); }
+    s.store_class_end();
+  }
+}
+
+testWallet_init::testWallet_init()
+  : private_key_()
+{}
+
+testWallet_init::testWallet_init(object_ptr<inputKey> &&private_key_)
+  : private_key_(std::move(private_key_))
+{}
+
+const std::int32_t testWallet_init::ID;
+
+void testWallet_init::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testWallet_init");
+    if (private_key_ == nullptr) { s.store_field("private_key", "null"); } else { private_key_->store(s, "private_key"); }
+    s.store_class_end();
+  }
+}
+
+testWallet_sendGrams::testWallet_sendGrams()
+  : private_key_()
+  , destination_()
+  , seqno_()
+  , amount_()
+{}
+
+testWallet_sendGrams::testWallet_sendGrams(object_ptr<inputKey> &&private_key_, object_ptr<accountAddress> &&destination_, std::int32_t seqno_, std::int64_t amount_)
+  : private_key_(std::move(private_key_))
+  , destination_(std::move(destination_))
+  , seqno_(seqno_)
+  , amount_(amount_)
+{}
+
+const std::int32_t testWallet_sendGrams::ID;
+
+void testWallet_sendGrams::store(td::TlStorerToString &s, const char *field_name) const {
+  if (!LOG_IS_STRIPPED(ERROR)) {
+    s.store_class_begin(field_name, "testWallet_sendGrams");
+    if (private_key_ == nullptr) { s.store_field("private_key", "null"); } else { private_key_->store(s, "private_key"); }
+    if (destination_ == nullptr) { s.store_field("destination", "null"); } else { destination_->store(s, "destination"); }
+    s.store_field("seqno", seqno_);
+    s.store_field("amount", amount_);
+    s.store_class_end();
+  }
+}
+}  // namespace tonlib_api
+}  // namespace ton
diff --git a/submodules/MtProtoKit/TON/iOS/include/auto/tl/tonlib_api.h b/submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api.h
similarity index 100%
rename from submodules/MtProtoKit/TON/iOS/include/auto/tl/tonlib_api.h
rename to submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api.h
diff --git a/submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api.hpp b/submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api.hpp
new file mode 100644
index 0000000000..1bbc15cd0c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api.hpp
@@ -0,0 +1,242 @@
+#pragma once
+
+#include "tonlib_api.h"
+
+namespace ton {
+namespace tonlib_api {
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(Object &obj, const T &func) {
+  switch (obj.get_id()) {
+    case accountAddress::ID:
+      func(static_cast<accountAddress &>(obj));
+      return true;
+    case bip39Hints::ID:
+      func(static_cast<bip39Hints &>(obj));
+      return true;
+    case error::ID:
+      func(static_cast<error &>(obj));
+      return true;
+    case exportedEncryptedKey::ID:
+      func(static_cast<exportedEncryptedKey &>(obj));
+      return true;
+    case exportedKey::ID:
+      func(static_cast<exportedKey &>(obj));
+      return true;
+    case exportedPemKey::ID:
+      func(static_cast<exportedPemKey &>(obj));
+      return true;
+    case inputKey::ID:
+      func(static_cast<inputKey &>(obj));
+      return true;
+    case key::ID:
+      func(static_cast<key &>(obj));
+      return true;
+    case ok::ID:
+      func(static_cast<ok &>(obj));
+      return true;
+    case options::ID:
+      func(static_cast<options &>(obj));
+      return true;
+    case generic_accountStateRaw::ID:
+      func(static_cast<generic_accountStateRaw &>(obj));
+      return true;
+    case generic_accountStateTestWallet::ID:
+      func(static_cast<generic_accountStateTestWallet &>(obj));
+      return true;
+    case generic_accountStateTestGiver::ID:
+      func(static_cast<generic_accountStateTestGiver &>(obj));
+      return true;
+    case generic_accountStateUninited::ID:
+      func(static_cast<generic_accountStateUninited &>(obj));
+      return true;
+    case generic_initialAccountStateRaw::ID:
+      func(static_cast<generic_initialAccountStateRaw &>(obj));
+      return true;
+    case generic_initialAccountStateTestWallet::ID:
+      func(static_cast<generic_initialAccountStateTestWallet &>(obj));
+      return true;
+    case internal_transactionId::ID:
+      func(static_cast<internal_transactionId &>(obj));
+      return true;
+    case raw_accountState::ID:
+      func(static_cast<raw_accountState &>(obj));
+      return true;
+    case raw_initialAccountState::ID:
+      func(static_cast<raw_initialAccountState &>(obj));
+      return true;
+    case raw_message::ID:
+      func(static_cast<raw_message &>(obj));
+      return true;
+    case raw_transaction::ID:
+      func(static_cast<raw_transaction &>(obj));
+      return true;
+    case raw_transactions::ID:
+      func(static_cast<raw_transactions &>(obj));
+      return true;
+    case testGiver_accountState::ID:
+      func(static_cast<testGiver_accountState &>(obj));
+      return true;
+    case testWallet_accountState::ID:
+      func(static_cast<testWallet_accountState &>(obj));
+      return true;
+    case testWallet_initialAccountState::ID:
+      func(static_cast<testWallet_initialAccountState &>(obj));
+      return true;
+    case uninited_accountState::ID:
+      func(static_cast<uninited_accountState &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(Function &obj, const T &func) {
+  switch (obj.get_id()) {
+    case changeLocalPassword::ID:
+      func(static_cast<changeLocalPassword &>(obj));
+      return true;
+    case close::ID:
+      func(static_cast<close &>(obj));
+      return true;
+    case createNewKey::ID:
+      func(static_cast<createNewKey &>(obj));
+      return true;
+    case deleteKey::ID:
+      func(static_cast<deleteKey &>(obj));
+      return true;
+    case exportEncryptedKey::ID:
+      func(static_cast<exportEncryptedKey &>(obj));
+      return true;
+    case exportKey::ID:
+      func(static_cast<exportKey &>(obj));
+      return true;
+    case exportPemKey::ID:
+      func(static_cast<exportPemKey &>(obj));
+      return true;
+    case generic_getAccountState::ID:
+      func(static_cast<generic_getAccountState &>(obj));
+      return true;
+    case generic_sendGrams::ID:
+      func(static_cast<generic_sendGrams &>(obj));
+      return true;
+    case getBip39Hints::ID:
+      func(static_cast<getBip39Hints &>(obj));
+      return true;
+    case importEncryptedKey::ID:
+      func(static_cast<importEncryptedKey &>(obj));
+      return true;
+    case importKey::ID:
+      func(static_cast<importKey &>(obj));
+      return true;
+    case importPemKey::ID:
+      func(static_cast<importPemKey &>(obj));
+      return true;
+    case init::ID:
+      func(static_cast<init &>(obj));
+      return true;
+    case options_setConfig::ID:
+      func(static_cast<options_setConfig &>(obj));
+      return true;
+    case raw_getAccountAddress::ID:
+      func(static_cast<raw_getAccountAddress &>(obj));
+      return true;
+    case raw_getAccountState::ID:
+      func(static_cast<raw_getAccountState &>(obj));
+      return true;
+    case raw_getTransactions::ID:
+      func(static_cast<raw_getTransactions &>(obj));
+      return true;
+    case raw_sendMessage::ID:
+      func(static_cast<raw_sendMessage &>(obj));
+      return true;
+    case runTests::ID:
+      func(static_cast<runTests &>(obj));
+      return true;
+    case testGiver_getAccountAddress::ID:
+      func(static_cast<testGiver_getAccountAddress &>(obj));
+      return true;
+    case testGiver_getAccountState::ID:
+      func(static_cast<testGiver_getAccountState &>(obj));
+      return true;
+    case testGiver_sendGrams::ID:
+      func(static_cast<testGiver_sendGrams &>(obj));
+      return true;
+    case testWallet_getAccountAddress::ID:
+      func(static_cast<testWallet_getAccountAddress &>(obj));
+      return true;
+    case testWallet_getAccountState::ID:
+      func(static_cast<testWallet_getAccountState &>(obj));
+      return true;
+    case testWallet_init::ID:
+      func(static_cast<testWallet_init &>(obj));
+      return true;
+    case testWallet_sendGrams::ID:
+      func(static_cast<testWallet_sendGrams &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(generic_AccountState &obj, const T &func) {
+  switch (obj.get_id()) {
+    case generic_accountStateRaw::ID:
+      func(static_cast<generic_accountStateRaw &>(obj));
+      return true;
+    case generic_accountStateTestWallet::ID:
+      func(static_cast<generic_accountStateTestWallet &>(obj));
+      return true;
+    case generic_accountStateTestGiver::ID:
+      func(static_cast<generic_accountStateTestGiver &>(obj));
+      return true;
+    case generic_accountStateUninited::ID:
+      func(static_cast<generic_accountStateUninited &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+/**
+ * Calls specified function object with the specified object downcasted to the most-derived type.
+ * \param[in] obj Object to pass as an argument to the function object.
+ * \param[in] func Function object to which the object will be passed.
+ * \returns whether function object call has happened. Should always return true for correct parameters.
+ */
+template <class T>
+bool downcast_call(generic_InitialAccountState &obj, const T &func) {
+  switch (obj.get_id()) {
+    case generic_initialAccountStateRaw::ID:
+      func(static_cast<generic_initialAccountStateRaw &>(obj));
+      return true;
+    case generic_initialAccountStateTestWallet::ID:
+      func(static_cast<generic_initialAccountStateTestWallet &>(obj));
+      return true;
+    default:
+      return false;
+  }
+}
+
+}  // namespace tonlib_api
+}  // namespace ton 
diff --git a/submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api_json.cpp b/submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api_json.cpp
new file mode 100644
index 0000000000..3667853c8f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api_json.cpp
@@ -0,0 +1,1190 @@
+#include "auto/tl/tonlib_api_json.h"
+
+#include "auto/tl/tonlib_api.h"
+#include "auto/tl/tonlib_api.hpp"
+
+#include "tl/tl_json.h"
+
+#include "td/utils/base64.h"
+#include "td/utils/common.h"
+#include "td/utils/Slice.h"
+
+#include <unordered_map>
+
+namespace ton {
+namespace tonlib_api{
+  using namespace td;
+Result<int32> tl_constructor_from_string(tonlib_api::generic_AccountState *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"generic.accountStateRaw", -1387096685},
+    {"generic.accountStateTestWallet", -1041955397},
+    {"generic.accountStateTestGiver", 1134654598},
+    {"generic.accountStateUninited", -908702008}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(tonlib_api::generic_InitialAccountState *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"generic.initialAccountStateRaw", -1178429153},
+    {"generic.initialAccountStateTestWallet", 710924204}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(tonlib_api::Object *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"accountAddress", 755613099},
+    {"bip39Hints", 1012243456},
+    {"error", -1679978726},
+    {"exportedEncryptedKey", 2024406612},
+    {"exportedKey", -1449248297},
+    {"exportedPemKey", 1425473725},
+    {"inputKey", 869287093},
+    {"key", -1978362923},
+    {"ok", -722616727},
+    {"options", -876766471},
+    {"generic.accountStateRaw", -1387096685},
+    {"generic.accountStateTestWallet", -1041955397},
+    {"generic.accountStateTestGiver", 1134654598},
+    {"generic.accountStateUninited", -908702008},
+    {"generic.initialAccountStateRaw", -1178429153},
+    {"generic.initialAccountStateTestWallet", 710924204},
+    {"internal.transactionId", -989527262},
+    {"raw.accountState", -550396199},
+    {"raw.initialAccountState", 777456197},
+    {"raw.message", -1131081640},
+    {"raw.transaction", -463758736},
+    {"raw.transactions", -442987753},
+    {"testGiver.accountState", 2037609684},
+    {"testWallet.accountState", 105752218},
+    {"testWallet.initialAccountState", -1231516227},
+    {"uninited.accountState", -1992757598}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Result<int32> tl_constructor_from_string(tonlib_api::Function *object, const std::string &str) {
+  static const std::unordered_map<Slice, int32, SliceHash> m = {
+    {"changeLocalPassword", -1685491421},
+    {"close", -1187782273},
+    {"createNewKey", -1861385712},
+    {"deleteKey", 917647652},
+    {"exportEncryptedKey", 155352861},
+    {"exportKey", 399723440},
+    {"exportPemKey", -2047752448},
+    {"generic.getAccountState", -657000446},
+    {"generic.sendGrams", 799772985},
+    {"getBip39Hints", -1889640982},
+    {"importEncryptedKey", 656724958},
+    {"importKey", -1607900903},
+    {"importPemKey", 76385617},
+    {"init", -2014661877},
+    {"options.setConfig", 21225546},
+    {"raw.getAccountAddress", -521283849},
+    {"raw.getAccountState", 663706721},
+    {"raw.getTransactions", 935377269},
+    {"raw.sendMessage", 473889461},
+    {"runTests", -2039925427},
+    {"testGiver.getAccountAddress", -540100768},
+    {"testGiver.getAccountState", 267738275},
+    {"testGiver.sendGrams", -178493799},
+    {"testWallet.getAccountAddress", -1557748223},
+    {"testWallet.getAccountState", 654082364},
+    {"testWallet.init", 419055225},
+    {"testWallet.sendGrams", -1716705044}
+  };
+  auto it = m.find(str);
+  if (it == m.end()) {
+    return Status::Error(str + "Unknown class");
+  }
+  return it->second;
+}
+Status from_json(tonlib_api::accountAddress &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "account_address", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.account_address_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::bip39Hints &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "words", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.words_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::error &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "code", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.code_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "message", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.message_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::exportedEncryptedKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::exportedKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "word_list", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.word_list_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::exportedPemKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "pem", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.pem_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::inputKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "local_password", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.local_password_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::key &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "public_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.public_key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "secret", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.secret_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::ok &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(tonlib_api::options &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "config", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.config_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "keystore_directory", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.keystore_directory_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::generic_accountStateRaw &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "account_state", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.account_state_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::generic_accountStateTestWallet &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "account_state", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.account_state_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::generic_accountStateTestGiver &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "account_state", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.account_state_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::generic_accountStateUninited &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "account_state", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.account_state_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::generic_initialAccountStateRaw &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "initital_account_state", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.initital_account_state_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::generic_initialAccountStateTestWallet &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "initital_account_state", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.initital_account_state_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::internal_transactionId &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "lt", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.lt_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "hash", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.hash_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::raw_accountState &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "balance", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.balance_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "code", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.code_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "last_transaction_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.last_transaction_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::raw_initialAccountState &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "code", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.code_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::raw_message &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "source", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.source_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "destination", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.destination_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "value", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.value_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::raw_transaction &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "previous_transaction_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.previous_transaction_id_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "fee", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.fee_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "in_msg", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.in_msg_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "out_msgs", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.out_msgs_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::raw_transactions &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "transactions", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.transactions_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::testGiver_accountState &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "balance", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.balance_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "last_transaction_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.last_transaction_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::testWallet_accountState &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "balance", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.balance_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "last_transaction_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.last_transaction_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::testWallet_initialAccountState &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "public_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.public_key_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::uninited_accountState &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "balance", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.balance_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::changeLocalPassword &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "input_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.input_key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "new_local_password", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.new_local_password_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::close &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(tonlib_api::createNewKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "local_password", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.local_password_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "mnemonic_password", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.mnemonic_password_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "random_extra_seed", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.random_extra_seed_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::deleteKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "public_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.public_key_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::exportEncryptedKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "input_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.input_key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_password", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.key_password_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::exportKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "input_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.input_key_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::exportPemKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "input_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.input_key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_password", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.key_password_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::generic_getAccountState &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "account_address", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.account_address_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::generic_sendGrams &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "private_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.private_key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "source", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.source_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "destination", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.destination_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "amount", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.amount_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::getBip39Hints &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "prefix", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.prefix_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::importEncryptedKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "local_password", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.local_password_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_password", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.key_password_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "exported_encrypted_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.exported_encrypted_key_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::importKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "local_password", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.local_password_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "mnemonic_password", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.mnemonic_password_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "exported_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.exported_key_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::importPemKey &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "local_password", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.local_password_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "key_password", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.key_password_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "exported_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.exported_key_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::init &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "options", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.options_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::options_setConfig &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "config", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.config_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::raw_getAccountAddress &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "initital_account_state", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.initital_account_state_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::raw_getAccountState &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "account_address", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.account_address_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::raw_getTransactions &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "account_address", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.account_address_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "from_transaction_id", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.from_transaction_id_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::raw_sendMessage &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "destination", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.destination_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "initial_account_state", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.initial_account_state_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "data", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json_bytes(to.data_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::runTests &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "dir", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.dir_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::testGiver_getAccountAddress &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(tonlib_api::testGiver_getAccountState &to, JsonObject &from) {
+  return Status::OK();
+}
+Status from_json(tonlib_api::testGiver_sendGrams &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "destination", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.destination_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "amount", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.amount_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::testWallet_getAccountAddress &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "initital_account_state", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.initital_account_state_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::testWallet_getAccountState &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "account_address", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.account_address_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::testWallet_init &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "private_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.private_key_, value));
+    }
+  }
+  return Status::OK();
+}
+Status from_json(tonlib_api::testWallet_sendGrams &to, JsonObject &from) {
+  {
+    TRY_RESULT(value, get_json_object_field(from, "private_key", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.private_key_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "destination", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.destination_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "seqno", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.seqno_, value));
+    }
+  }
+  {
+    TRY_RESULT(value, get_json_object_field(from, "amount", JsonValue::Type::Null, true));
+    if (value.type() != JsonValue::Type::Null) {
+      TRY_STATUS(from_json(to.amount_, value));
+    }
+  }
+  return Status::OK();
+}
+void to_json(JsonValueScope &jv, const tonlib_api::accountAddress &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "accountAddress");
+  jo << ctie("account_address", ToJson(object.account_address_));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::bip39Hints &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "bip39Hints");
+  jo << ctie("words", ToJson(object.words_));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::error &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "error");
+  jo << ctie("code", ToJson(object.code_));
+  jo << ctie("message", ToJson(object.message_));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::exportedEncryptedKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "exportedEncryptedKey");
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::exportedKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "exportedKey");
+  jo << ctie("word_list", ToJson(object.word_list_));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::exportedPemKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "exportedPemKey");
+  jo << ctie("pem", ToJson(object.pem_));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::inputKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "inputKey");
+  if (object.key_) {
+    jo << ctie("key", ToJson(object.key_));
+  }
+  jo << ctie("local_password", ToJson(JsonBytes{object.local_password_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::key &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "key");
+  jo << ctie("public_key", ToJson(object.public_key_));
+  jo << ctie("secret", ToJson(JsonBytes{object.secret_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::ok &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "ok");
+}
+void to_json(JsonValueScope &jv, const tonlib_api::options &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "options");
+  jo << ctie("config", ToJson(object.config_));
+  jo << ctie("keystore_directory", ToJson(object.keystore_directory_));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::generic_AccountState &object) {
+  tonlib_api::downcast_call(const_cast<tonlib_api::generic_AccountState &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const tonlib_api::generic_accountStateRaw &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "generic.accountStateRaw");
+  if (object.account_state_) {
+    jo << ctie("account_state", ToJson(object.account_state_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::generic_accountStateTestWallet &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "generic.accountStateTestWallet");
+  if (object.account_state_) {
+    jo << ctie("account_state", ToJson(object.account_state_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::generic_accountStateTestGiver &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "generic.accountStateTestGiver");
+  if (object.account_state_) {
+    jo << ctie("account_state", ToJson(object.account_state_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::generic_accountStateUninited &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "generic.accountStateUninited");
+  if (object.account_state_) {
+    jo << ctie("account_state", ToJson(object.account_state_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::generic_InitialAccountState &object) {
+  tonlib_api::downcast_call(const_cast<tonlib_api::generic_InitialAccountState &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+void to_json(JsonValueScope &jv, const tonlib_api::generic_initialAccountStateRaw &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "generic.initialAccountStateRaw");
+  if (object.initital_account_state_) {
+    jo << ctie("initital_account_state", ToJson(object.initital_account_state_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::generic_initialAccountStateTestWallet &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "generic.initialAccountStateTestWallet");
+  if (object.initital_account_state_) {
+    jo << ctie("initital_account_state", ToJson(object.initital_account_state_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::internal_transactionId &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "internal.transactionId");
+  jo << ctie("lt", ToJson(JsonInt64{object.lt_}));
+  jo << ctie("hash", ToJson(JsonBytes{object.hash_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::raw_accountState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "raw.accountState");
+  jo << ctie("balance", ToJson(JsonInt64{object.balance_}));
+  jo << ctie("code", ToJson(JsonBytes{object.code_}));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+  if (object.last_transaction_id_) {
+    jo << ctie("last_transaction_id", ToJson(object.last_transaction_id_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::raw_initialAccountState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "raw.initialAccountState");
+  jo << ctie("code", ToJson(JsonBytes{object.code_}));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::raw_message &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "raw.message");
+  jo << ctie("source", ToJson(object.source_));
+  jo << ctie("destination", ToJson(object.destination_));
+  jo << ctie("value", ToJson(JsonInt64{object.value_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::raw_transaction &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "raw.transaction");
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+  if (object.previous_transaction_id_) {
+    jo << ctie("previous_transaction_id", ToJson(object.previous_transaction_id_));
+  }
+  jo << ctie("fee", ToJson(JsonInt64{object.fee_}));
+  if (object.in_msg_) {
+    jo << ctie("in_msg", ToJson(object.in_msg_));
+  }
+  jo << ctie("out_msgs", ToJson(object.out_msgs_));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::raw_transactions &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "raw.transactions");
+  jo << ctie("transactions", ToJson(object.transactions_));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::testGiver_accountState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testGiver.accountState");
+  jo << ctie("balance", ToJson(JsonInt64{object.balance_}));
+  jo << ctie("seqno", ToJson(object.seqno_));
+  if (object.last_transaction_id_) {
+    jo << ctie("last_transaction_id", ToJson(object.last_transaction_id_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::testWallet_accountState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testWallet.accountState");
+  jo << ctie("balance", ToJson(JsonInt64{object.balance_}));
+  jo << ctie("seqno", ToJson(object.seqno_));
+  if (object.last_transaction_id_) {
+    jo << ctie("last_transaction_id", ToJson(object.last_transaction_id_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::testWallet_initialAccountState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testWallet.initialAccountState");
+  jo << ctie("public_key", ToJson(object.public_key_));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::uninited_accountState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "uninited.accountState");
+  jo << ctie("balance", ToJson(JsonInt64{object.balance_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::changeLocalPassword &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "changeLocalPassword");
+  if (object.input_key_) {
+    jo << ctie("input_key", ToJson(object.input_key_));
+  }
+  jo << ctie("new_local_password", ToJson(JsonBytes{object.new_local_password_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::close &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "close");
+}
+void to_json(JsonValueScope &jv, const tonlib_api::createNewKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "createNewKey");
+  jo << ctie("local_password", ToJson(JsonBytes{object.local_password_}));
+  jo << ctie("mnemonic_password", ToJson(JsonBytes{object.mnemonic_password_}));
+  jo << ctie("random_extra_seed", ToJson(JsonBytes{object.random_extra_seed_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::deleteKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "deleteKey");
+  jo << ctie("public_key", ToJson(object.public_key_));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::exportEncryptedKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "exportEncryptedKey");
+  if (object.input_key_) {
+    jo << ctie("input_key", ToJson(object.input_key_));
+  }
+  jo << ctie("key_password", ToJson(JsonBytes{object.key_password_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::exportKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "exportKey");
+  if (object.input_key_) {
+    jo << ctie("input_key", ToJson(object.input_key_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::exportPemKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "exportPemKey");
+  if (object.input_key_) {
+    jo << ctie("input_key", ToJson(object.input_key_));
+  }
+  jo << ctie("key_password", ToJson(JsonBytes{object.key_password_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::generic_getAccountState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "generic.getAccountState");
+  if (object.account_address_) {
+    jo << ctie("account_address", ToJson(object.account_address_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::generic_sendGrams &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "generic.sendGrams");
+  if (object.private_key_) {
+    jo << ctie("private_key", ToJson(object.private_key_));
+  }
+  if (object.source_) {
+    jo << ctie("source", ToJson(object.source_));
+  }
+  if (object.destination_) {
+    jo << ctie("destination", ToJson(object.destination_));
+  }
+  jo << ctie("amount", ToJson(JsonInt64{object.amount_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::getBip39Hints &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "getBip39Hints");
+  jo << ctie("prefix", ToJson(object.prefix_));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::importEncryptedKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "importEncryptedKey");
+  jo << ctie("local_password", ToJson(JsonBytes{object.local_password_}));
+  jo << ctie("key_password", ToJson(JsonBytes{object.key_password_}));
+  if (object.exported_encrypted_key_) {
+    jo << ctie("exported_encrypted_key", ToJson(object.exported_encrypted_key_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::importKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "importKey");
+  jo << ctie("local_password", ToJson(JsonBytes{object.local_password_}));
+  jo << ctie("mnemonic_password", ToJson(JsonBytes{object.mnemonic_password_}));
+  if (object.exported_key_) {
+    jo << ctie("exported_key", ToJson(object.exported_key_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::importPemKey &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "importPemKey");
+  jo << ctie("local_password", ToJson(JsonBytes{object.local_password_}));
+  jo << ctie("key_password", ToJson(JsonBytes{object.key_password_}));
+  if (object.exported_key_) {
+    jo << ctie("exported_key", ToJson(object.exported_key_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::init &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "init");
+  if (object.options_) {
+    jo << ctie("options", ToJson(object.options_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::options_setConfig &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "options.setConfig");
+  jo << ctie("config", ToJson(object.config_));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::raw_getAccountAddress &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "raw.getAccountAddress");
+  if (object.initital_account_state_) {
+    jo << ctie("initital_account_state", ToJson(object.initital_account_state_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::raw_getAccountState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "raw.getAccountState");
+  if (object.account_address_) {
+    jo << ctie("account_address", ToJson(object.account_address_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::raw_getTransactions &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "raw.getTransactions");
+  if (object.account_address_) {
+    jo << ctie("account_address", ToJson(object.account_address_));
+  }
+  if (object.from_transaction_id_) {
+    jo << ctie("from_transaction_id", ToJson(object.from_transaction_id_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::raw_sendMessage &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "raw.sendMessage");
+  if (object.destination_) {
+    jo << ctie("destination", ToJson(object.destination_));
+  }
+  jo << ctie("initial_account_state", ToJson(JsonBytes{object.initial_account_state_}));
+  jo << ctie("data", ToJson(JsonBytes{object.data_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::runTests &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "runTests");
+  jo << ctie("dir", ToJson(object.dir_));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::testGiver_getAccountAddress &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testGiver.getAccountAddress");
+}
+void to_json(JsonValueScope &jv, const tonlib_api::testGiver_getAccountState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testGiver.getAccountState");
+}
+void to_json(JsonValueScope &jv, const tonlib_api::testGiver_sendGrams &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testGiver.sendGrams");
+  if (object.destination_) {
+    jo << ctie("destination", ToJson(object.destination_));
+  }
+  jo << ctie("seqno", ToJson(object.seqno_));
+  jo << ctie("amount", ToJson(JsonInt64{object.amount_}));
+}
+void to_json(JsonValueScope &jv, const tonlib_api::testWallet_getAccountAddress &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testWallet.getAccountAddress");
+  if (object.initital_account_state_) {
+    jo << ctie("initital_account_state", ToJson(object.initital_account_state_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::testWallet_getAccountState &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testWallet.getAccountState");
+  if (object.account_address_) {
+    jo << ctie("account_address", ToJson(object.account_address_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::testWallet_init &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testWallet.init");
+  if (object.private_key_) {
+    jo << ctie("private_key", ToJson(object.private_key_));
+  }
+}
+void to_json(JsonValueScope &jv, const tonlib_api::testWallet_sendGrams &object) {
+  auto jo = jv.enter_object();
+  jo << ctie("@type", "testWallet.sendGrams");
+  if (object.private_key_) {
+    jo << ctie("private_key", ToJson(object.private_key_));
+  }
+  if (object.destination_) {
+    jo << ctie("destination", ToJson(object.destination_));
+  }
+  jo << ctie("seqno", ToJson(object.seqno_));
+  jo << ctie("amount", ToJson(JsonInt64{object.amount_}));
+}
+}  // namespace tonlib_api
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api_json.h b/submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api_json.h
new file mode 100644
index 0000000000..84134f3bd5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/auto/tl/tonlib_api_json.h
@@ -0,0 +1,133 @@
+#pragma once
+
+#include "auto/tl/tonlib_api.h"
+
+#include "auto/tl/tonlib_api.hpp"
+
+#include "td/utils/JsonBuilder.h"
+#include "td/utils/Status.h"
+
+#include "crypto/common/bitstring.h"
+namespace ton {
+namespace tonlib_api{
+  using namespace td;
+Result<int32> tl_constructor_from_string(tonlib_api::generic_AccountState *object, const std::string &str);
+Result<int32> tl_constructor_from_string(tonlib_api::generic_InitialAccountState *object, const std::string &str);
+Result<int32> tl_constructor_from_string(tonlib_api::Object *object, const std::string &str);
+Result<int32> tl_constructor_from_string(tonlib_api::Function *object, const std::string &str);
+Status from_json(tonlib_api::accountAddress &to, JsonObject &from);
+Status from_json(tonlib_api::bip39Hints &to, JsonObject &from);
+Status from_json(tonlib_api::error &to, JsonObject &from);
+Status from_json(tonlib_api::exportedEncryptedKey &to, JsonObject &from);
+Status from_json(tonlib_api::exportedKey &to, JsonObject &from);
+Status from_json(tonlib_api::exportedPemKey &to, JsonObject &from);
+Status from_json(tonlib_api::inputKey &to, JsonObject &from);
+Status from_json(tonlib_api::key &to, JsonObject &from);
+Status from_json(tonlib_api::ok &to, JsonObject &from);
+Status from_json(tonlib_api::options &to, JsonObject &from);
+Status from_json(tonlib_api::generic_accountStateRaw &to, JsonObject &from);
+Status from_json(tonlib_api::generic_accountStateTestWallet &to, JsonObject &from);
+Status from_json(tonlib_api::generic_accountStateTestGiver &to, JsonObject &from);
+Status from_json(tonlib_api::generic_accountStateUninited &to, JsonObject &from);
+Status from_json(tonlib_api::generic_initialAccountStateRaw &to, JsonObject &from);
+Status from_json(tonlib_api::generic_initialAccountStateTestWallet &to, JsonObject &from);
+Status from_json(tonlib_api::internal_transactionId &to, JsonObject &from);
+Status from_json(tonlib_api::raw_accountState &to, JsonObject &from);
+Status from_json(tonlib_api::raw_initialAccountState &to, JsonObject &from);
+Status from_json(tonlib_api::raw_message &to, JsonObject &from);
+Status from_json(tonlib_api::raw_transaction &to, JsonObject &from);
+Status from_json(tonlib_api::raw_transactions &to, JsonObject &from);
+Status from_json(tonlib_api::testGiver_accountState &to, JsonObject &from);
+Status from_json(tonlib_api::testWallet_accountState &to, JsonObject &from);
+Status from_json(tonlib_api::testWallet_initialAccountState &to, JsonObject &from);
+Status from_json(tonlib_api::uninited_accountState &to, JsonObject &from);
+Status from_json(tonlib_api::changeLocalPassword &to, JsonObject &from);
+Status from_json(tonlib_api::close &to, JsonObject &from);
+Status from_json(tonlib_api::createNewKey &to, JsonObject &from);
+Status from_json(tonlib_api::deleteKey &to, JsonObject &from);
+Status from_json(tonlib_api::exportEncryptedKey &to, JsonObject &from);
+Status from_json(tonlib_api::exportKey &to, JsonObject &from);
+Status from_json(tonlib_api::exportPemKey &to, JsonObject &from);
+Status from_json(tonlib_api::generic_getAccountState &to, JsonObject &from);
+Status from_json(tonlib_api::generic_sendGrams &to, JsonObject &from);
+Status from_json(tonlib_api::getBip39Hints &to, JsonObject &from);
+Status from_json(tonlib_api::importEncryptedKey &to, JsonObject &from);
+Status from_json(tonlib_api::importKey &to, JsonObject &from);
+Status from_json(tonlib_api::importPemKey &to, JsonObject &from);
+Status from_json(tonlib_api::init &to, JsonObject &from);
+Status from_json(tonlib_api::options_setConfig &to, JsonObject &from);
+Status from_json(tonlib_api::raw_getAccountAddress &to, JsonObject &from);
+Status from_json(tonlib_api::raw_getAccountState &to, JsonObject &from);
+Status from_json(tonlib_api::raw_getTransactions &to, JsonObject &from);
+Status from_json(tonlib_api::raw_sendMessage &to, JsonObject &from);
+Status from_json(tonlib_api::runTests &to, JsonObject &from);
+Status from_json(tonlib_api::testGiver_getAccountAddress &to, JsonObject &from);
+Status from_json(tonlib_api::testGiver_getAccountState &to, JsonObject &from);
+Status from_json(tonlib_api::testGiver_sendGrams &to, JsonObject &from);
+Status from_json(tonlib_api::testWallet_getAccountAddress &to, JsonObject &from);
+Status from_json(tonlib_api::testWallet_getAccountState &to, JsonObject &from);
+Status from_json(tonlib_api::testWallet_init &to, JsonObject &from);
+Status from_json(tonlib_api::testWallet_sendGrams &to, JsonObject &from);
+void to_json(JsonValueScope &jv, const tonlib_api::accountAddress &object);
+void to_json(JsonValueScope &jv, const tonlib_api::bip39Hints &object);
+void to_json(JsonValueScope &jv, const tonlib_api::error &object);
+void to_json(JsonValueScope &jv, const tonlib_api::exportedEncryptedKey &object);
+void to_json(JsonValueScope &jv, const tonlib_api::exportedKey &object);
+void to_json(JsonValueScope &jv, const tonlib_api::exportedPemKey &object);
+void to_json(JsonValueScope &jv, const tonlib_api::inputKey &object);
+void to_json(JsonValueScope &jv, const tonlib_api::key &object);
+void to_json(JsonValueScope &jv, const tonlib_api::ok &object);
+void to_json(JsonValueScope &jv, const tonlib_api::options &object);
+void to_json(JsonValueScope &jv, const tonlib_api::generic_AccountState &object);
+void to_json(JsonValueScope &jv, const tonlib_api::generic_accountStateRaw &object);
+void to_json(JsonValueScope &jv, const tonlib_api::generic_accountStateTestWallet &object);
+void to_json(JsonValueScope &jv, const tonlib_api::generic_accountStateTestGiver &object);
+void to_json(JsonValueScope &jv, const tonlib_api::generic_accountStateUninited &object);
+void to_json(JsonValueScope &jv, const tonlib_api::generic_InitialAccountState &object);
+void to_json(JsonValueScope &jv, const tonlib_api::generic_initialAccountStateRaw &object);
+void to_json(JsonValueScope &jv, const tonlib_api::generic_initialAccountStateTestWallet &object);
+void to_json(JsonValueScope &jv, const tonlib_api::internal_transactionId &object);
+void to_json(JsonValueScope &jv, const tonlib_api::raw_accountState &object);
+void to_json(JsonValueScope &jv, const tonlib_api::raw_initialAccountState &object);
+void to_json(JsonValueScope &jv, const tonlib_api::raw_message &object);
+void to_json(JsonValueScope &jv, const tonlib_api::raw_transaction &object);
+void to_json(JsonValueScope &jv, const tonlib_api::raw_transactions &object);
+void to_json(JsonValueScope &jv, const tonlib_api::testGiver_accountState &object);
+void to_json(JsonValueScope &jv, const tonlib_api::testWallet_accountState &object);
+void to_json(JsonValueScope &jv, const tonlib_api::testWallet_initialAccountState &object);
+void to_json(JsonValueScope &jv, const tonlib_api::uninited_accountState &object);
+void to_json(JsonValueScope &jv, const tonlib_api::changeLocalPassword &object);
+void to_json(JsonValueScope &jv, const tonlib_api::close &object);
+void to_json(JsonValueScope &jv, const tonlib_api::createNewKey &object);
+void to_json(JsonValueScope &jv, const tonlib_api::deleteKey &object);
+void to_json(JsonValueScope &jv, const tonlib_api::exportEncryptedKey &object);
+void to_json(JsonValueScope &jv, const tonlib_api::exportKey &object);
+void to_json(JsonValueScope &jv, const tonlib_api::exportPemKey &object);
+void to_json(JsonValueScope &jv, const tonlib_api::generic_getAccountState &object);
+void to_json(JsonValueScope &jv, const tonlib_api::generic_sendGrams &object);
+void to_json(JsonValueScope &jv, const tonlib_api::getBip39Hints &object);
+void to_json(JsonValueScope &jv, const tonlib_api::importEncryptedKey &object);
+void to_json(JsonValueScope &jv, const tonlib_api::importKey &object);
+void to_json(JsonValueScope &jv, const tonlib_api::importPemKey &object);
+void to_json(JsonValueScope &jv, const tonlib_api::init &object);
+void to_json(JsonValueScope &jv, const tonlib_api::options_setConfig &object);
+void to_json(JsonValueScope &jv, const tonlib_api::raw_getAccountAddress &object);
+void to_json(JsonValueScope &jv, const tonlib_api::raw_getAccountState &object);
+void to_json(JsonValueScope &jv, const tonlib_api::raw_getTransactions &object);
+void to_json(JsonValueScope &jv, const tonlib_api::raw_sendMessage &object);
+void to_json(JsonValueScope &jv, const tonlib_api::runTests &object);
+void to_json(JsonValueScope &jv, const tonlib_api::testGiver_getAccountAddress &object);
+void to_json(JsonValueScope &jv, const tonlib_api::testGiver_getAccountState &object);
+void to_json(JsonValueScope &jv, const tonlib_api::testGiver_sendGrams &object);
+void to_json(JsonValueScope &jv, const tonlib_api::testWallet_getAccountAddress &object);
+void to_json(JsonValueScope &jv, const tonlib_api::testWallet_getAccountState &object);
+void to_json(JsonValueScope &jv, const tonlib_api::testWallet_init &object);
+void to_json(JsonValueScope &jv, const tonlib_api::testWallet_sendGrams &object);
+inline void to_json(JsonValueScope &jv, const ton::tonlib_api::Object &object) {
+  ton::tonlib_api::downcast_call(const_cast<ton::tonlib_api::Object &>(object),[&jv](const auto &object) { to_json(jv, object); });
+}
+inline void to_json(JsonValueScope &jv, const ton::tonlib_api::Function &object) {
+  ton::tonlib_api::downcast_call(const_cast<ton::tonlib_api::Function &>(object), [&jv](const auto &object) { to_json(jv, object); });
+}
+}  // namespace tonlib_api
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl/generate/generate_common.cpp b/submodules/ton/tonlib-src/tl/generate/generate_common.cpp
new file mode 100644
index 0000000000..dff61f911d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/generate_common.cpp
@@ -0,0 +1,83 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_writer_cpp.h"
+#include "tl_writer_h.h"
+#include "tl_writer_hpp.h"
+#include "tl_writer_jni_h.h"
+#include "tl_writer_jni_cpp.h"
+#include "tl_json_converter.h"
+
+#include "td/tl/tl_config.h"
+#include "td/tl/tl_generate.h"
+
+#include <string>
+#include <vector>
+
+template <class WriterCpp = td::TD_TL_writer_cpp, class WriterH = td::TD_TL_writer_h,
+          class WriterHpp = td::TD_TL_writer_hpp>
+static void generate_cpp(const std::string &directory, const std::string &tl_name, const std::string &string_type,
+                         const std::string &bytes_type, const std::string &secure_string_type,
+                         const std::string &secure_bytes_type, const std::vector<std::string> &ext_cpp_includes,
+                         const std::vector<std::string> &ext_h_includes) {
+  std::string path = directory + "/" + tl_name;
+  td::tl::tl_config config = td::tl::read_tl_config_from_file("scheme/" + tl_name + ".tlo");
+  td::tl::write_tl_to_file(
+      config, path + ".cpp",
+      WriterCpp(tl_name, string_type, bytes_type, secure_string_type, secure_bytes_type, ext_cpp_includes));
+  td::tl::write_tl_to_file(
+      config, path + ".h",
+      WriterH(tl_name, string_type, bytes_type, secure_string_type, secure_bytes_type, ext_h_includes));
+  td::tl::write_tl_to_file(config, path + ".hpp",
+                           WriterHpp(tl_name, string_type, bytes_type, secure_string_type, secure_bytes_type));
+}
+
+int main() {
+  generate_cpp("auto/tl", "ton_api", "std::string", "td::BufferSlice", "std::string", "td::BufferSlice",
+               {"\"tl/tl_object_parse.h\"", "\"tl/tl_object_store.h\"", "\"td/utils/int_types.h\"",
+                "\"crypto/common/bitstring.h\""},
+               {"<string>", "\"td/utils/buffer.h\"", "\"crypto/common/bitstring.h\""});
+
+  generate_cpp("auto/tl", "lite_api", "std::string", "td::BufferSlice", "std::string", "td::BufferSlice",
+               {"\"tl/tl_object_parse.h\"", "\"tl/tl_object_store.h\"", "\"td/utils/int_types.h\"",
+                "\"crypto/common/bitstring.h\""},
+               {"<string>", "\"td/utils/buffer.h\"", "\"crypto/common/bitstring.h\""});
+  td::gen_json_converter(td::tl::read_tl_config_from_file("scheme/ton_api.tlo"), "auto/tl/ton_api_json", "ton_api");
+
+#ifdef TONLIB_ENABLE_JNI
+  generate_cpp<td::TD_TL_writer_jni_cpp, td::TD_TL_writer_jni_h>(
+      "auto/tl", "tonlib_api", "std::string", "std::string", "td::SecureString", "td::SecureString",
+      {"\"tl/tl_jni_object.h\"", "\"tl/tl_object_store.h\"", "\"td/utils/int_types.h\""},
+      {"<string>", "\"td/utils/SharedSlice.h\""});
+#else
+  generate_cpp<>("auto/tl", "tonlib_api", "std::string", "std::string", "td::SecureString", "td::SecureString",
+                 {"\"tl/tl_object_parse.h\"", "\"tl/tl_object_store.h\"", "\"td/utils/int_types.h\""},
+                 {"<string>", "\"td/utils/SharedSlice.h\""});
+#endif
+  td::gen_json_converter(td::tl::read_tl_config_from_file("scheme/tonlib_api.tlo"), "auto/tl/tonlib_api_json",
+                         "tonlib_api");
+}
diff --git a/submodules/ton/tonlib-src/tl/generate/generate_java.cpp b/submodules/ton/tonlib-src/tl/generate/generate_java.cpp
new file mode 100644
index 0000000000..d63c7d47de
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/generate_java.cpp
@@ -0,0 +1,50 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_writer_java.h"
+
+#include "td/tl/tl_config.h"
+#include "td/tl/tl_generate.h"
+
+#include <algorithm>
+#include <string>
+
+int main(int argc, char *argv[]) {
+  if (argc < 5) {
+    return 1;
+  }
+
+  std::string api_name = argv[1];
+  std::string source = argv[2];
+  std::string destination = argv[3];
+  std::string package = argv[4];
+  std::string package_name = package;
+  std::replace(package_name.begin(), package_name.end(), '/', '.');
+  destination += "/" + package + "/" + api_name + ".java";
+  td::tl::write_tl_to_file(td::tl::read_tl_config_from_file(source), destination,
+                           td::TD_TL_writer_java(api_name, package_name));
+}
diff --git a/submodules/ton/tonlib-src/tl/generate/scheme/lite_api.tl b/submodules/ton/tonlib-src/tl/generate/scheme/lite_api.tl
new file mode 100644
index 0000000000..dc85227c5c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/scheme/lite_api.tl
@@ -0,0 +1,76 @@
+int ? = Int;
+long ? = Long;
+double ? = Double;
+string ? = String;
+object ? = Object;
+function ? = Function;
+bytes data:string = Bytes;
+true = True;
+boolTrue = Bool;
+boolFalse = Bool;
+
+
+vector {t:Type} # [ t ] = Vector t;
+
+int128 4*[ int ] = Int128;
+int256 8*[ int ] = Int256;
+
+tonNode.blockId workchain:int shard:long seqno:int = tonNode.BlockId;
+tonNode.blockIdExt workchain:int shard:long seqno:int root_hash:int256 file_hash:int256 = tonNode.BlockIdExt;
+tonNode.zeroStateIdExt workchain:int root_hash:int256 file_hash:int256 = tonNode.ZeroStateIdExt;
+
+adnl.message.query query_id:int256 query:bytes = adnl.Message;
+adnl.message.answer query_id:int256 answer:bytes = adnl.Message;
+
+liteServer.error code:int message:string = liteServer.Error; 
+
+liteServer.accountId workchain:int id:int256 = liteServer.AccountId;
+
+liteServer.masterchainInfo last:tonNode.blockIdExt state_root_hash:int256 init:tonNode.zeroStateIdExt = liteServer.MasterchainInfo;
+liteServer.masterchainInfoExt mode:# version:int capabilities:long last:tonNode.blockIdExt last_utime:int now:int state_root_hash:int256 init:tonNode.zeroStateIdExt = liteServer.MasterchainInfoExt;
+liteServer.currentTime now:int = liteServer.CurrentTime;
+liteServer.version mode:# version:int capabilities:long now:int = liteServer.Version;
+liteServer.blockData id:tonNode.blockIdExt data:bytes = liteServer.BlockData;
+liteServer.blockState id:tonNode.blockIdExt root_hash:int256 file_hash:int256 data:bytes = liteServer.BlockState;
+liteServer.blockHeader id:tonNode.blockIdExt mode:# header_proof:bytes = liteServer.BlockHeader;
+liteServer.sendMsgStatus status:int = liteServer.SendMsgStatus;
+liteServer.accountState id:tonNode.blockIdExt shardblk:tonNode.blockIdExt shard_proof:bytes proof:bytes state:bytes = liteServer.AccountState;
+liteServer.shardInfo id:tonNode.blockIdExt shardblk:tonNode.blockIdExt shard_proof:bytes shard_descr:bytes = liteServer.ShardInfo;
+liteServer.allShardsInfo id:tonNode.blockIdExt proof:bytes data:bytes = liteServer.AllShardsInfo;
+liteServer.transactionInfo id:tonNode.blockIdExt proof:bytes transaction:bytes = liteServer.TransactionInfo;
+liteServer.transactionList ids:(vector tonNode.blockIdExt) transactions:bytes = liteServer.TransactionList;
+liteServer.transactionId mode:# account:mode.0?int256 lt:mode.1?long hash:mode.2?int256 = liteServer.TransactionId;
+liteServer.transactionId3 account:int256 lt:long = liteServer.TransactionId3;
+liteServer.blockTransactions id:tonNode.blockIdExt req_count:# incomplete:Bool ids:(vector liteServer.transactionId) proof:bytes = liteServer.BlockTransactions;
+liteServer.signature node_id_short:int256 signature:bytes = liteServer.Signature;
+liteServer.signatureSet validator_set_hash:int catchain_seqno:int signatures:(vector liteServer.signature) = liteServer.SignatureSet;
+liteServer.blockLinkBack to_key_block:Bool from:tonNode.blockIdExt to:tonNode.blockIdExt dest_proof:bytes proof:bytes state_proof:bytes = liteServer.BlockLink;
+liteServer.blockLinkForward to_key_block:Bool from:tonNode.blockIdExt to:tonNode.blockIdExt dest_proof:bytes config_proof:bytes signatures:liteServer.SignatureSet = liteServer.BlockLink;
+liteServer.partialBlockProof complete:Bool from:tonNode.blockIdExt to:tonNode.blockIdExt steps:(vector liteServer.BlockLink) = liteServer.PartialBlockProof;
+liteServer.configInfo mode:# id:tonNode.blockIdExt state_proof:bytes config_proof:bytes = liteServer.ConfigInfo;
+
+liteServer.debug.verbosity value:int = liteServer.debug.Verbosity;
+
+---functions---
+
+liteServer.getMasterchainInfo = liteServer.MasterchainInfo;
+liteServer.getMasterchainInfoExt mode:# = liteServer.MasterchainInfoExt;
+liteServer.getTime = liteServer.CurrentTime;
+liteServer.getVersion = liteServer.Version;
+liteServer.getBlock id:tonNode.blockIdExt = liteServer.BlockData;
+liteServer.getState id:tonNode.blockIdExt = liteServer.BlockState;
+liteServer.getBlockHeader id:tonNode.blockIdExt mode:# = liteServer.BlockHeader;
+liteServer.sendMessage body:bytes = liteServer.SendMsgStatus;
+liteServer.getAccountState id:tonNode.blockIdExt account:liteServer.accountId = liteServer.AccountState;
+liteServer.getShardInfo id:tonNode.blockIdExt workchain:int shard:long exact:Bool = liteServer.ShardInfo;
+liteServer.getAllShardsInfo id:tonNode.blockIdExt = liteServer.AllShardsInfo;
+liteServer.getOneTransaction id:tonNode.blockIdExt account:liteServer.accountId lt:long = liteServer.TransactionInfo;
+liteServer.getTransactions count:# account:liteServer.accountId lt:long hash:int256 = liteServer.TransactionList;
+liteServer.lookupBlock mode:# id:tonNode.blockId lt:mode.1?long utime:mode.2?int = liteServer.BlockHeader;
+liteServer.listBlockTransactions id:tonNode.blockIdExt mode:# count:# after:mode.7?liteServer.transactionId3 reverse_order:mode.6?true want_proof:mode.5?true = liteServer.BlockTransactions;
+liteServer.getBlockProof mode:# known_block:tonNode.blockIdExt target_block:mode.0?tonNode.blockIdExt = liteServer.PartialBlockProof;
+liteServer.getConfigAll mode:# id:tonNode.blockIdExt = liteServer.ConfigInfo;
+liteServer.getConfigParams mode:# id:tonNode.blockIdExt param_list:(vector int) = liteServer.ConfigInfo;
+
+liteServer.queryPrefix = Object; 
+liteServer.query data:bytes = Object;
diff --git a/submodules/ton/tonlib-src/tl/generate/scheme/lite_api.tlo b/submodules/ton/tonlib-src/tl/generate/scheme/lite_api.tlo
new file mode 100644
index 0000000000..495668b85f
Binary files /dev/null and b/submodules/ton/tonlib-src/tl/generate/scheme/lite_api.tlo differ
diff --git a/submodules/ton/tonlib-src/tl/generate/scheme/ton_api.tl b/submodules/ton/tonlib-src/tl/generate/scheme/ton_api.tl
new file mode 100644
index 0000000000..2d5fd20afa
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/scheme/ton_api.tl
@@ -0,0 +1,566 @@
+int ? = Int;
+long ? = Long;
+double ? = Double;
+string ? = String;
+object ? = Object;
+function ? = Function;
+bytes data:string = Bytes;
+true = True;
+boolTrue = Bool;
+boolFalse = Bool;
+
+
+vector {t:Type} # [ t ] = Vector t;
+
+int128 4*[ int ] = Int128;
+int256 8*[ int ] = Int256;
+
+testObject value:int o:object f:function = TestObject;
+testString value:string = TestObject;
+testInt value:int = TestObject;
+testVectorBytes value:(vector bytes) = TestObject;
+
+tcp.pong random_id:long = tcp.Pong;
+
+tcp.authentificate nonce:bytes = tcp.Message;
+tcp.authentificationNonce nonce:bytes = tcp.Message;
+tcp.authentificationComplete key:PublicKey signature:bytes = tcp.Message;
+
+fec.raptorQ data_size:int symbol_size:int symbols_count:int = fec.Type;
+fec.roundRobin data_size:int symbol_size:int symbols_count:int = fec.Type;
+fec.online data_size:int symbol_size:int symbols_count:int = fec.Type;
+
+---functions---
+
+tcp.ping random_id:long = tcp.Pong;
+
+getTestObject = TestObject;
+
+---types---
+
+pk.unenc data:bytes = PrivateKey;
+pk.ed25519 key:int256 = PrivateKey;
+pk.aes key:int256 = PrivateKey;
+pk.overlay name:bytes = PrivateKey;
+
+pub.unenc data:bytes = PublicKey;
+pub.ed25519 key:int256 = PublicKey;
+pub.aes key:int256 = PublicKey;
+pub.overlay name:bytes = PublicKey;
+
+
+---functions---
+
+---types---
+
+adnl.id.short id:int256 = adnl.id.Short;
+
+adnl.proxyToFastHash ip:int port:int date:int data_hash:int256 shared_secret:int256 = adnl.ProxyTo;
+adnl.proxyToFast ip:int port:int date:int signature:int256 = adnl.ProxyToSign;
+
+adnl.proxy.none = adnl.Proxy;
+adnl.proxy.fast shared_secret:bytes = adnl.Proxy;
+
+
+adnl.address.udp ip:int port:int = adnl.Address;
+adnl.address.udp6 ip:int128 port:int = adnl.Address;
+//adnl.address.tcp ip:int port:int = adnl.Address;
+//adnl.address.tcp6 ip:int128 port:int = adnl.Address;
+
+//adnl.address.tunnel to:adnl.Address tunid: = adnl.Address; 
+
+adnl.addressList addrs:(vector adnl.Address) version:int reinit_date:int priority:int expire_at:int = adnl.AddressList;
+
+adnl.node id:PublicKey addr_list:adnl.addressList = adnl.Node;
+adnl.nodes nodes:(vector adnl.node) = adnl.Nodes;
+
+---functions---
+
+---types---
+
+adnl.packetContents 
+  rand1:bytes 
+  flags:# 
+  from:flags.0?PublicKey 
+  from_short:flags.1?adnl.id.short
+  message:flags.2?adnl.Message 
+  messages:flags.3?(vector adnl.Message)
+  address:flags.4?adnl.addressList 
+  priority_address:flags.5?adnl.addressList
+  seqno:flags.6?long 
+  confirm_seqno:flags.7?long 
+  recv_addr_list_version:flags.8?int
+  recv_priority_addr_list_version:flags.9?int
+  reinit_date:flags.10?int 
+  dst_reinit_date:flags.10?int
+  signature:flags.11?bytes 
+  rand2:bytes 
+        = adnl.PacketContents;
+
+
+adnl.message.createChannel key:int256 date:int = adnl.Message;
+adnl.message.confirmChannel key:int256 peer_key:int256 date:int = adnl.Message;
+
+adnl.message.custom data:bytes = adnl.Message;
+
+adnl.message.nop = adnl.Message;
+adnl.message.reinit date:int = adnl.Message;
+
+adnl.message.query query_id:int256 query:bytes = adnl.Message;
+adnl.message.answer query_id:int256 answer:bytes = adnl.Message;
+
+adnl.message.part hash:int256 total_size:int offset:int data:bytes = adnl.Message;
+
+---functions---
+---types---
+
+adnl.db.node.key local_id:int256 peer_id:int256 = adnl.db.Key;
+adnl.db.node.value date:int id:PublicKey addr_list:adnl.addressList priority_addr_list:adnl.addressList = adnl.db.node.Value; 
+
+---functions---
+
+
+---types---
+
+rldp.messagePart transfer_id:int256 fec_type:fec.Type part:int total_size:long seqno:int data:bytes = rldp.MessagePart;
+rldp.confirm transfer_id:int256 part:int seqno:int = rldp.MessagePart;
+rldp.complete transfer_id:int256 part:int = rldp.MessagePart;
+
+rldp.message id:int256 data:bytes = rldp.Message;
+rldp.query query_id:int256 max_answer_size:long timeout:int data:bytes = rldp.Message;
+rldp.answer query_id:int256 data:bytes = rldp.Message;
+
+
+---functions---
+---types---
+dht.node id:PublicKey addr_list:adnl.addressList version:int signature:bytes = dht.Node;
+dht.nodes nodes:(vector dht.node) = dht.Nodes;
+
+dht.key id:int256 name:bytes idx:int = dht.Key;
+
+dht.updateRule.signature = dht.UpdateRule;
+dht.updateRule.anybody = dht.UpdateRule;
+dht.updateRule.overlayNodes = dht.UpdateRule;
+
+dht.keyDescription key:dht.key id:PublicKey update_rule:dht.UpdateRule signature:bytes = dht.KeyDescription;
+
+dht.value key:dht.keyDescription value:bytes ttl:int signature:bytes = dht.Value; 
+
+dht.pong random_id:long = dht.Pong;
+
+dht.valueNotFound nodes:dht.nodes = dht.ValueResult;
+dht.valueFound value:dht.Value = dht.ValueResult;
+
+dht.stored = dht.Stored;
+dht.message node:dht.node = dht.Message;
+
+dht.db.bucket nodes:dht.nodes = dht.db.Bucket;
+dht.db.key.bucket id:int = dht.db.Key;
+
+---functions---
+
+dht.ping random_id:long = dht.Pong;
+dht.store value:dht.value = dht.Stored;
+dht.findNode key:int256 k:int = dht.Nodes; 
+dht.findValue key:int256 k:int = dht.ValueResult; 
+dht.getSignedAddressList = dht.Node;
+
+dht.query node:dht.node = True;
+
+---types---
+
+overlay.node.toSign id:adnl.id.short overlay:int256 version:int = overlay.node.ToSign;
+overlay.node id:PublicKey overlay:int256 version:int signature:bytes = overlay.Node;
+overlay.nodes nodes:(vector overlay.node) = overlay.Nodes;
+
+overlay.message overlay:int256 = overlay.Message;
+//overlay.randomPeers peers:(vector adnl.node) = overlay.RandomPeers;
+overlay.broadcastList hashes:(vector int256) = overlay.BroadcastList;
+
+overlay.fec.received hash:int256 = overlay.Broadcast;
+overlay.fec.completed hash:int256 = overlay.Broadcast;
+
+overlay.broadcast.id src:int256 data_hash:int256 flags:int = overlay.broadcast.Id; 
+overlay.broadcastFec.id src:int256 type:int256 data_hash:int256 size:int flags:int = overlay.broadcastFec.Id;
+overlay.broadcastFec.partId broadcast_hash:int256 data_hash:int256 seqno:int = overlay.broadcastFec.PartId;
+
+overlay.broadcast.toSign hash:int256 date:int = overlay.broadcast.ToSign;
+
+overlay.certificate issued_by:PublicKey expire_at:int max_size:int signature:bytes = overlay.Certificate;
+overlay.emptyCertificate = overlay.Certificate;
+
+overlay.certificateId overlay_id:int256 node:int256 expire_at:int max_size:int = overlay.CertificateId;
+
+overlay.unicast data:bytes = overlay.Broadcast;
+overlay.broadcast src:PublicKey certificate:overlay.Certificate flags:int data:bytes date:int signature:bytes = overlay.Broadcast;
+overlay.broadcastFec src:PublicKey certificate:overlay.Certificate data_hash:int256 data_size:int flags:int
+          data:bytes seqno:int fec:fec.Type date:int signature:bytes = overlay.Broadcast;
+overlay.broadcastFecShort src:PublicKey certificate:overlay.Certificate broadcast_hash:int256 part_data_hash:int256 seqno:int signature:bytes = overlay.Broadcast; 
+overlay.broadcastNotFound = overlay.Broadcast;
+
+---functions---
+
+overlay.getRandomPeers peers:overlay.nodes = overlay.Nodes;
+
+overlay.query overlay:int256 = True;
+overlay.getBroadcast hash:int256 = overlay.Broadcast;
+overlay.getBroadcastList list:overlay.broadcastList = overlay.BroadcastList;
+
+---types---
+
+overlay.db.nodes nodes:overlay.nodes = overlay.db.Nodes;
+overlay.db.key.nodes local_id:int256 overlay:int256 = overlay.db.Key;
+
+---functions---
+
+---types---
+
+catchain.block.id incarnation:int256 src:int256 height:int data_hash:int256 = catchain.block.Id;
+catchain.block.dep src:int height:int data_hash:int256 signature:bytes = catchain.block.Dep;
+catchain.block.data prev:catchain.block.dep deps:(vector catchain.block.dep) = catchain.block.Data;
+catchain.block incarnation:int256 src:int height:int data:catchain.block.data signature:bytes = catchain.Block;
+catchain.blocks blocks:(vector catchain.block) = catchain.Blocks;
+catchain.blockUpdate block:catchain.block = catchain.Update;
+
+catchain.block.data.badBlock block:catchain.block = catchain.block.inner.Data;
+catchain.block.data.fork left:catchain.block.Dep right:catchain.block.Dep = catchain.block.inner.Data;
+catchain.block.data.nop = catchain.block.inner.Data;
+catchain.block.data.vector msgs:(vector bytes) = catchain.block.inner.Data;
+//catchain.block.data.custom = catchain.block.inner.Data;
+
+catchain.firstblock unique_hash:int256 nodes:(vector int256) = catchain.FirstBlock;
+
+catchain.difference sent_upto:(vector int) = catchain.Difference;
+catchain.differenceFork left:catchain.block.dep right:catchain.block.dep = catchain.Difference;
+
+catchain.blockNotFound = catchain.BlockResult;
+catchain.blockResult block:catchain.block = catchain.BlockResult;
+
+catchain.sent cnt:int = catchain.Sent;
+
+---functions---
+
+catchain.getBlock block:int256 = catchain.BlockResult;
+catchain.getBlocks blocks:(vector int256) = catchain.Sent;
+catchain.getDifference rt:(vector int) = catchain.Difference;
+catchain.getBlockHistory block:int256 height:long stop_if:(vector int256) = catchain.Sent;
+//catchain.getForkDifference src:int fork:catchain.fork = catchain.ForkDifference;
+
+---types---
+
+validatorSession.round.id session:int256 height:long prev_block:int256 seqno:int = validatorSession.round.Id;
+
+validatorSession.candidate.id round:int256 block_hash:int256 = validatorSession.tempBlock.Id;
+
+validatorSession.message.startSession = validatorSession.Message;
+validatorSession.message.finishSession = validatorSession.Message;
+
+validatorSession.message.submittedBlock round:int root_hash:int256 file_hash:int256 
+               collated_data_file_hash:int256 = validatorSession.round.Message;
+validatorSession.message.approvedBlock round:int candidate:int256 signature:bytes = validatorSession.round.Message;
+validatorSession.message.rejectedBlock round:int candidate:int256 reason:bytes = validatorSession.round.Message;
+validatorSession.message.commit round:int candidate:int256 signature:bytes = validatorSession.round.Message;
+
+validatorSession.message.vote round:int attempt:int candidate:int256 = validatorSession.round.Message;
+validatorSession.message.voteFor round:int attempt:int candidate:int256 = validatorSession.round.Message;
+validatorSession.message.precommit round:int attempt:int candidate:int256 = validatorSession.round.Message;
+validatorSession.message.empty round:int attempt:int = validatorSession.round.Message;
+
+validatorSession.pong hash:long = validatorSession.Pong;
+
+validatorSession.candidateId src:int256 root_hash:int256 file_hash:int256 collated_data_file_hash:int256 = validatorSession.CandidateId;
+
+validatorSession.blockUpdate ts:long actions:(vector validatorSession.round.Message) state:int = validatorSession.BlockUpdate;
+validatorSession.candidate src:int256 round:int root_hash:int256 data:bytes collated_data:bytes = validatorSession.Candidate;
+
+validatorSession.config catchain_idle_timeout:double catchain_max_deps:int round_candidates:int next_candidate_delay:double round_attempt_duration:int
+        max_round_attempts:int max_block_size:int max_collated_data_size:int = validatorSession.Config;
+
+---functions---
+
+validatorSession.ping hash:long = validatorSession.Pong;
+validatorSession.downloadCandidate round:int id:validatorSession.candidateId = validatorSession.Candidate; 
+
+---types---
+
+hashable.bool value:Bool = Hashable;
+hashable.int32 value:int = Hashable;
+hashable.int64 value:long = Hashable;
+hashable.int256 value:int256 = Hashable;
+hashable.bytes value:bytes = Hashable;
+hashable.pair left:int right:int = Hashable;
+hashable.vector value:(vector int) = Hashable;
+hashable.validatorSessionOldRound seqno:int block:int signatures:int approve_signatures:int = Hashable;
+hashable.validatorSessionRoundAttempt seqno:int votes:int precommitted:int vote_for_inited:int vote_for:int = Hashable;
+hashable.validatorSessionRound locked_round:int locked_block:int seqno:int precommitted:Bool
+          first_attempt:int approved_blocks:int signatures:int attempts:int = Hashable;
+hashable.blockSignature signature:int = Hashable;
+hashable.sentBlock src:int root_hash:int file_hash:int collated_data_file_hash:int = Hashable; 
+hashable.sentBlockEmpty = Hashable;
+hashable.vote block:int node:int = Hashable;
+hashable.blockCandidate block:int approved:int = Hashable;
+hashable.blockVoteCandidate block:int approved:int = Hashable;
+hashable.blockCandidateAttempt block:int votes:int = Hashable;
+
+hashable.cntVector data:int = Hashable;
+hashable.cntSortedVector data:int = Hashable;
+
+hashable.validatorSession ts:int old_rounds:int cur_round:int = Hashable;
+
+---functions---
+---types---
+
+
+tonNode.sessionId workchain:int shard:long cc_seqno:int opts_hash:int256 = tonNode.SessionId; 
+
+
+tonNode.blockSignature who:int256 signature:bytes = tonNode.BlockSignature;
+
+tonNode.blockId workchain:int shard:long seqno:int = tonNode.BlockId;
+tonNode.blockIdExt workchain:int shard:long seqno:int root_hash:int256 file_hash:int256 = tonNode.BlockIdExt;
+tonNode.zeroStateIdExt workchain:int root_hash:int256 file_hash:int256 = tonNode.ZeroStateIdExt;
+
+tonNode.blockDescriptionEmpty = tonNode.BlockDescription;
+tonNode.blockDescription id:tonNode.blockIdExt = tonNode.BlockDescription;
+tonNode.preparedProofEmpty = tonNode.PreparedProof;
+tonNode.preparedProof = tonNode.PreparedProof;
+tonNode.preparedProofLink = tonNode.PreparedProof;
+tonNode.preparedState = tonNode.PreparedState;
+tonNode.notFoundState = tonNode.PreparedState;
+tonNode.prepared = tonNode.Prepared;
+tonNode.notFound = tonNode.Prepared;
+tonNode.data data:bytes = tonNode.Data;
+//tonNode.preparedKeyBlockProofEmpty = tonNode.PreparedKeyBlockProof;
+//tonNode.preparedKeyBlockProof block_id:tonNode.blockIdExt = tonNode.PreparedKeyBlockProof;
+
+tonNode.ihrMessage data:bytes = tonNode.IhrMessage;
+tonNode.externalMessage data:bytes = tonNode.ExternalMessage;
+
+tonNode.newShardBlock block:tonNode.blockIdExt cc_seqno:int data:bytes = tonNode.NewShardBlock;
+
+tonNode.blockBroadcast id:tonNode.blockIdExt catchain_seqno:int validator_set_hash:int 
+              signatures:(vector tonNode.blockSignature) 
+              proof:bytes data:bytes = tonNode.Broadcast;
+tonNode.ihrMessageBroadcast message:tonNode.ihrMessage = tonNode.Broadcast;
+tonNode.externalMessageBroadcast message:tonNode.externalMessage = tonNode.Broadcast;
+tonNode.newShardBlockBroadcast block:tonNode.newShardBlock = tonNode.Broadcast;
+
+tonNode.shardPublicOverlayId workchain:int shard:long zero_state_file_hash:int256 = tonNode.ShardPublicOverlayId;
+
+tonNode.keyBlocks blocks:(vector tonNode.blockIdExt) incomplete:Bool error:Bool = tonNode.KeyBlocks;
+
+ton.blockId root_cell_hash:int256 file_hash:int256 = ton.BlockId;
+ton.blockIdApprove root_cell_hash:int256 file_hash:int256 = ton.BlockId;
+
+---functions---
+
+tonNode.getNextBlockDescription prev_block:tonNode.blockIdExt = tonNode.BlockDescription;
+tonNode.prepareBlockProof block:tonNode.blockIdExt allow_partial:Bool = tonNode.PreparedProof;
+tonNode.prepareBlock block:tonNode.blockIdExt = tonNode.Prepared;
+tonNode.preparePersistentState block:tonNode.blockIdExt masterchain_block:tonNode.blockIdExt = tonNode.PreparedState;
+tonNode.prepareZeroState block:tonNode.blockIdExt = tonNode.PreparedState;
+tonNode.getNextKeyBlockIds block:tonNode.blockIdExt max_size:int = tonNode.KeyBlocks;
+tonNode.downloadBlock block:tonNode.blockIdExt = tonNode.Data;
+tonNode.downloadPersistentState block:tonNode.blockIdExt masterchain_block:tonNode.blockIdExt = tonNode.Data;
+tonNode.downloadZeroState block:tonNode.blockIdExt = tonNode.Data;
+tonNode.downloadBlockProof block:tonNode.blockIdExt = tonNode.Data;
+tonNode.downloadBlockProofLink block:tonNode.blockIdExt = tonNode.Data;
+
+---types---
+
+// bit 0 - started
+// bit 1 - ready to switch
+// bit 2 - switched from
+// bit 3 - archived
+// bit 4 - disabled
+
+db.root.dbDescription version:int first_masterchain_block_id:tonNode.blockIdExt flags:int = db.root.DbDescription;
+
+db.root.key.cellDb version:int = db.root.Key; 
+db.root.key.blockDb version:int = db.root.Key; 
+
+db.root.config celldb_version:int blockdb_version:int = db.root.Config;
+db.root.key.config = db.root.Key;
+
+db.celldb.value block_id:tonNode.blockIdExt prev:int256 next:int256 root_hash:int256 = db.celldb.Value;
+db.celldb.key.value hash:int256 = db.celldb.key.Value;
+
+db.block.info id:tonNode.blockIdExt flags:# prev_left:flags.1?tonNode.blockIdExt
+                                            prev_right:flags.2?tonNode.blockIdExt
+                                            next_left:flags.3?tonNode.blockIdExt
+                                            next_right:flags.4?tonNode.blockIdExt
+                                            lt:flags.13?long 
+                                            ts:flags.14?int
+                                            state:flags.17?int256 = db.block.Info;
+db.block.archivedInfo id:tonNode.blockIdExt flags:# next:flags.0?tonNode.blockIdExt = db.block.Info;
+
+db.blockdb.value next:tonNode.blockIdExt data:bytes = db.blockdb.Value;
+db.blockdb.lru id:tonNode.blockIdExt prev:int256 next:int256 = db.blockdb.Lru;
+db.blockdb.key.lru id:tonNode.blockIdExt = db.blockdb.Key;
+db.blockdb.key.value id:tonNode.blockIdExt = db.blockdb.Key;
+
+db.candidate source:PublicKey id:tonNode.blockIdExt data:bytes collated_data:bytes = db.Candidate;
+db.candidate.id source:PublicKey id:tonNode.blockIdExt collated_data_file_hash:int256 = db.candidate.Id; 
+
+db.filedb.key.empty = db.filedb.Key;
+db.filedb.key.blockFile block_id:tonNode.blockIdExt = db.filedb.Key; 
+db.filedb.key.zeroStateFile block_id:tonNode.blockIdExt = db.filedb.Key; 
+db.filedb.key.persistentStateFile block_id:tonNode.blockIdExt masterchain_block_id:tonNode.blockIdExt = db.filedb.Key; 
+db.filedb.key.proof block_id:tonNode.blockIdExt = db.filedb.Key;
+db.filedb.key.proofLink block_id:tonNode.blockIdExt = db.filedb.Key;
+db.filedb.key.signatures block_id:tonNode.blockIdExt = db.filedb.Key;
+db.filedb.key.candidate id:db.candidate.id = db.filedb.Key;
+
+db.filedb.value key:db.filedb.Key prev:int256 next:int256 file_hash:int256 = db.filedb.Value;
+
+db.state.destroyedSessions sessions:(vector int256) = db.state.DestroyedSessions;
+db.state.initBlockId block:tonNode.blockIdExt = db.state.InitBlockId;
+db.state.gcBlockId block:tonNode.blockIdExt = db.state.GcBlockId;
+db.state.shardClient block:tonNode.blockIdExt = db.state.ShardClient;
+db.state.asyncSerializer block:tonNode.blockIdExt last:tonNode.blockIdExt last_ts:int = db.state.AsyncSerializer;
+
+db.state.key.destroyedSessions = db.state.Key;
+db.state.key.initBlockId = db.state.Key;
+db.state.key.gcBlockId = db.state.Key;
+db.state.key.shardClient = db.state.Key;
+db.state.key.asyncSerializer = db.state.Key;
+
+db.lt.el.key workchain:int shard:long idx:int = db.lt.Key;
+db.lt.desc.key workchain:int shard:long = db.lt.Key;
+db.lt.shard.key idx:int = db.lt.Key;
+db.lt.status.key = db.lt.Key;
+db.lt.el.value id:tonNode.blockIdExt lt:long ts:int = db.lt.el.Value;
+db.lt.desc.value first_idx:int last_idx:int last_seqno:int last_lt:long last_ts:int = db.lt.desc.Value; 
+db.lt.shard.value workchain:int shard:long = db.lt.shard.Value; 
+db.lt.status.value total_shards:int = db.lt.status.Value;
+
+---functions---
+
+---types---
+
+validator.groupMember public_key_hash:int256 adnl:int256 weight:long = engine.validator.GroupMember; 
+validator.group workchain:int shard:long catchain_seqno:int config_hash:int256 members:(vector validator.groupMember) = validator.Group; 
+
+---functions---
+
+
+---types---
+
+
+id.config.local id:PrivateKey = id.config.Local;
+dht.config.local id:adnl.id.short = dht.config.Local;
+dht.config.random.local cnt:int = dht.config.Local;
+liteserver.config.local id:PrivateKey port:int = liteserver.config.Local;
+liteserver.config.random.local port:int = liteserver.config.Local;
+validator.config.local id:adnl.id.short = validator.config.Local;
+validator.config.random.local addr_list:adnl.addressList = validator.config.Local;
+control.config.local priv:PrivateKey pub:int256 port:int = control.config.Local;
+config.local local_ids:(vector id.config.local) dht:(vector dht.config.Local) validators:(vector validator.config.Local) liteservers:(vector liteserver.config.Local) control:(vector control.config.local) = config.Local;
+
+dht.config.global static_nodes:dht.nodes k:int a:int = dht.config.Global;
+adnl.config.global static_nodes:adnl.nodes = adnl.config.Global;
+catchain.config.global tag:int256 nodes:(vector PublicKey) = catchain.config.Global;
+dummyworkchain0.config.global zero_state_hash:int256 = dummyworkchain0.config.Global;
+validator.config.global zero_state:tonNode.blockIdExt init_block:tonNode.blockIdExt hardforks:(vector tonNode.blockIdExt) = validator.config.Global;
+config.global adnl:adnl.config.global dht:dht.config.global validator:validator.config.global = config.Global;
+
+liteserver.desc id:PublicKey ip:int port:int = liteserver.Desc;
+liteclient.config.global liteservers:(vector liteserver.desc) validator:validator.config.global = liteclient.config.Global;
+
+engine.adnl id:int256 category:int = engine.Adnl;
+engine.addr ip:int port:int categories:(vector int) priority_categories:(vector int) = engine.Addr;
+engine.addrProxy in_ip:int in_port:int out_ip:int out_port:int 
+          proxy_type:adnl.Proxy categories:(vector int) priority_categories:(vector int) = engine.Addr;
+engine.dht id:int256 = engine.Dht;
+engine.validatorTempKey key:int256 expire_at:int = engine.ValidatorTempKey;
+engine.validatorAdnlAddress id:int256 expire_at:int = engine.ValidatorAdnlAddress;
+engine.validator id:int256 temp_keys:(vector engine.validatorTempKey) adnl_addrs:(vector engine.validatorAdnlAddress) election_date:int expire_at:int = engine.Validator;
+engine.liteServer id:int256 port:int = engine.LiteServer;
+engine.controlProcess id:int256 permissions:int = engine.ControlProcess;
+engine.controlInterface id:int256 port:int allowed:(vector engine.controlProcess) = engine.ControlInterface; 
+engine.gc ids:(vector int256) = engine.Gc;
+
+engine.dht.config dht:(vector engine.dht) gc:engine.gc = engine.dht.Config;
+engine.validator.config out_port:int addrs:(vector engine.Addr) adnl:(vector engine.adnl) 
+        dht:(vector engine.dht)
+        validators:(vector engine.validator) fullnode:int256  
+        liteservers:(vector engine.liteServer) control:(vector engine.controlInterface)
+        gc:engine.gc = engine.validator.Config; 
+
+---functions---
+---types---
+
+engine.adnlProxy.port in_port:int out_port:int dst_ip:int dst_port:int proxy_type:adnl.Proxy = engine.adnlProxy.Port;
+
+engine.adnlProxy.config ports:(vector engine.adnlProxy.port) = engine.adnlProxy.Config;
+
+---functions---
+
+---types---
+
+adnl.pong value:long = adnl.Pong;
+
+---functions---
+
+adnl.ping value:long = adnl.Pong;
+
+---types---
+
+engine.validator.keyHash key_hash:int256 = engine.validator.KeyHash;
+engine.validator.signature signature:bytes = engine.validator.Signature;
+
+engine.validator.oneStat key:string value:string = engine.validator.OneStat;
+engine.validator.stats stats:(vector engine.validator.oneStat) = engine.validator.Stats;
+
+engine.validator.controlQueryError code:int message:string = engine.validator.ControlQueryError;
+
+engine.validator.time time:int = engine.validator.Time;
+engine.validator.success = engine.validator.Success;
+
+engine.validator.jsonConfig data:string = engine.validator.JsonConfig;
+
+engine.validator.electionBid election_date:int perm_key:int256 adnl_addr:int256 to_send_payload:bytes = engine.validator.ElectionBid; 
+
+engine.validator.dhtServerStatus id:int256 status:int = engine.validator.DhtServerStatus;
+engine.validator.dhtServersStatus servers:(vector engine.validator.dhtServerStatus) = engine.validator.DhtServersStatus;
+
+---functions---
+
+engine.validator.getTime = engine.validator.Time;
+engine.validator.importPrivateKey key:PrivateKey = engine.validator.KeyHash;
+engine.validator.exportPrivateKey key_hash:int256 = PrivateKey;
+engine.validator.exportPublicKey key_hash:int256 = PublicKey;
+engine.validator.generateKeyPair = engine.validator.KeyHash;
+engine.validator.addAdnlId key_hash:int256 category:int = engine.validator.Success;
+engine.validator.addDhtId key_hash:int256 = engine.validator.Success;
+engine.validator.addValidatorPermanentKey key_hash:int256 election_date:int ttl:int = engine.validator.Success;
+engine.validator.addValidatorTempKey permanent_key_hash:int256 key_hash:int256 ttl:int = engine.validator.Success;
+engine.validator.addValidatorAdnlAddress permanent_key_hash:int256 key_hash:int256 ttl:int = engine.validator.Success;
+engine.validator.changeFullNodeAdnlAddress adnl_id:int256 = engine.validator.Success; 
+engine.validator.addLiteserver key_hash:int256 port:int = engine.validator.Success;
+engine.validator.addControlInterface key_hash:int256 port:int = engine.validator.Success;
+engine.validator.addControlProcess key_hash:int256 port:int peer_key:int256 permissions:int = engine.validator.Success;
+
+engine.validator.delAdnlId key_hash:int256 = engine.validator.Success;
+engine.validator.delDhtId key_hash:int256 = engine.validator.Success;
+engine.validator.delValidatorPermanentKey key_hash:int256 = engine.validator.Success;
+engine.validator.delValidatorTempKey permanent_key_hash:int256 key_hash:int256 = engine.validator.Success;
+engine.validator.delValidatorAdnlAddress permanent_key_hash:int256 key_hash:int256 = engine.validator.Success;
+
+engine.validator.addListeningPort ip:int port:int categories:(vector int) priority_categories:(vector int) = engine.validator.Success;
+engine.validator.addProxy in_ip:int in_port:int out_ip:int out_port:int proxy:adnl.Proxy categories:(vector int) priority_categories:(vector int) = engine.validator.Success;
+engine.validator.delListeningPort ip:int port:int categories:(vector int) priority_categories:(vector int) = engine.validator.Success;
+engine.validator.delProxy out_ip:int out_port:int categories:(vector int) priority_categories:(vector int) = engine.validator.Success;
+
+engine.validator.sign key_hash:int256 data:bytes = engine.validator.Signature;
+
+engine.validator.getStats = engine.validator.Stats;
+engine.validator.getConfig = engine.validator.JsonConfig;
+
+engine.validator.setVerbosity verbosity:int = engine.validator.Success; 
+
+engine.validator.createElectionBid election_date:int election_addr:string wallet:string = engine.validator.ElectionBid;
+
+engine.validator.checkDhtServers id:int256 = engine.validator.DhtServersStatus;
+
+engine.validator.controlQuery data:bytes = Object;
diff --git a/submodules/ton/tonlib-src/tl/generate/scheme/ton_api.tlo b/submodules/ton/tonlib-src/tl/generate/scheme/ton_api.tlo
new file mode 100644
index 0000000000..7e81b489d3
Binary files /dev/null and b/submodules/ton/tonlib-src/tl/generate/scheme/ton_api.tlo differ
diff --git a/submodules/ton/tonlib-src/tl/generate/scheme/tonlib_api.tl b/submodules/ton/tonlib-src/tl/generate/scheme/tonlib_api.tl
new file mode 100644
index 0000000000..e17c2356d3
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/scheme/tonlib_api.tl
@@ -0,0 +1,93 @@
+double ? = Double;
+string ? = String;
+
+int32 = Int32;
+int53 = Int53;
+int64 = Int64;
+bytes = Bytes;
+secureString = SecureString;
+secureBytes = SecureBytes;
+
+boolFalse = Bool;
+boolTrue = Bool;
+
+vector {t:Type} # [ t ] = Vector t;
+
+error code:int32 message:string = Error;
+ok = Ok;
+
+options config:string keystore_directory:string = Options;
+
+key public_key:string secret:secureBytes = Key;
+inputKey key:key local_password:secureBytes = InputKey;
+exportedKey word_list:vector<secureString> = ExportedKey;
+exportedPemKey pem:secureString = ExportedPemKey;
+exportedEncryptedKey data:secureBytes = ExportedEncryptedKey;
+
+bip39Hints words:vector<string> = Bip39Hints;
+
+accountAddress account_address:string = AccountAddress;
+
+internal.transactionId lt:int64 hash:bytes = internal.TransactionId;
+
+raw.initialAccountState code:bytes data:bytes = raw.InitialAccountState;
+raw.accountState balance:int64 code:bytes data:bytes last_transaction_id:internal.transactionId = raw.AccountState;
+raw.message source:string destination:string value:int64 = raw.Message;
+raw.transaction data:bytes previous_transaction_id:internal.transactionId fee:int64 in_msg:raw.message out_msgs:vector<raw.message> = raw.Transaction;
+raw.transactions transactions:vector<raw.Transaction> = raw.Transactions;
+
+testWallet.initialAccountState public_key:string = testWallet.InitialAccountState;
+testWallet.accountState balance:int64 seqno:int32 last_transaction_id:internal.transactionId = testWallet.AccountState;
+
+testGiver.accountState balance:int64 seqno:int32 last_transaction_id:internal.transactionId = testGiver.AccountState;
+
+uninited.accountState balance:int64 = uninited.AccountState;
+
+generic.initialAccountStateRaw initital_account_state:raw.initialAccountState = generic.InitialAccountState;
+generic.initialAccountStateTestWallet initital_account_state:testWallet.initialAccountState = generic.InitialAccountState;
+
+generic.accountStateRaw account_state:raw.accountState = generic.AccountState;
+generic.accountStateTestWallet account_state:testWallet.accountState = generic.AccountState;
+generic.accountStateTestGiver account_state:testGiver.accountState = generic.AccountState;
+generic.accountStateUninited account_state:uninited.accountState = generic.AccountState;
+
+---functions---
+
+init options:options = Ok;
+close = Ok;
+
+options.setConfig config:string = Ok;
+
+createNewKey local_password:secureBytes mnemonic_password:secureBytes random_extra_seed:secureBytes = Key;
+deleteKey public_key:string = Ok;
+exportKey input_key:inputKey = ExportedKey;
+exportPemKey input_key:inputKey key_password:secureBytes = ExportedPemKey;
+exportEncryptedKey input_key:inputKey key_password:secureBytes = ExportedEncryptedKey;
+importKey local_password:secureBytes mnemonic_password:secureBytes exported_key:exportedKey = Key;
+importPemKey local_password:secureBytes key_password:secureBytes exported_key:exportedPemKey = Key;
+importEncryptedKey local_password:secureBytes key_password:secureBytes exported_encrypted_key:exportedEncryptedKey = Key;
+changeLocalPassword input_key:inputKey new_local_password:secureBytes = Key;
+
+getBip39Hints prefix:string = Bip39Hints;
+
+//raw.init initial_account_state:raw.initialAccountState = Ok;
+raw.getAccountAddress initital_account_state:raw.initialAccountState = AccountAddress;
+raw.getAccountState account_address:accountAddress = raw.AccountState;
+raw.sendMessage destination:accountAddress initial_account_state:bytes data:bytes = Ok;
+raw.getTransactions account_address:accountAddress from_transaction_id:internal.transactionId = raw.Transactions;
+
+testWallet.init private_key:inputKey = Ok;
+testWallet.getAccountAddress initital_account_state:testWallet.initialAccountState = AccountAddress;
+testWallet.getAccountState account_address:accountAddress = testWallet.AccountState;
+testWallet.sendGrams private_key:inputKey destination:accountAddress seqno:int32 amount:int64 = Ok;
+
+testGiver.getAccountState = testGiver.AccountState;
+testGiver.getAccountAddress = AccountAddress;
+testGiver.sendGrams destination:accountAddress seqno:int32 amount:int64 = Ok;
+
+//generic.getAccountAddress initital_account_state:generic.InitialAccountState = AccountAddress;
+generic.getAccountState account_address:accountAddress = generic.AccountState;
+generic.sendGrams private_key:inputKey source:accountAddress destination:accountAddress amount:int64 = Ok;
+
+runTests dir:string = Ok;
+
diff --git a/submodules/ton/tonlib-src/tl/generate/scheme/tonlib_api.tlo b/submodules/ton/tonlib-src/tl/generate/scheme/tonlib_api.tlo
new file mode 100644
index 0000000000..4971c24f98
Binary files /dev/null and b/submodules/ton/tonlib-src/tl/generate/scheme/tonlib_api.tlo differ
diff --git a/submodules/ton/tonlib-src/tl/generate/scheme/update-tlo.sh b/submodules/ton/tonlib-src/tl/generate/scheme/update-tlo.sh
new file mode 100755
index 0000000000..decc73b18d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/scheme/update-tlo.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+cd $(dirname $0)
+tl-parser -e ton_api.tlo ton_api.tl
+tl-parser -e tonlib_api.tlo tonlib_api.tl
+tl-parser -e lite_api.tlo lite_api.tl
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_json_converter.cpp b/submodules/ton/tonlib-src/tl/generate/tl_json_converter.cpp
new file mode 100644
index 0000000000..d993cb5df1
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_json_converter.cpp
@@ -0,0 +1,271 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_json_converter.h"
+
+#include "td/tl/tl_simple.h"
+
+#include "td/utils/buffer.h"
+#include "td/utils/filesystem.h"
+#include "td/utils/logging.h"
+#include "td/utils/Slice.h"
+#include "td/utils/StringBuilder.h"
+
+#include <utility>
+
+namespace td {
+
+namespace {
+std::string tl_name = "ton_api";
+}
+
+template <class T>
+void gen_to_json_constructor(StringBuilder &sb, const T *constructor, bool is_header) {
+  sb << "void to_json(JsonValueScope &jv, "
+     << "const " << tl_name << "::" << tl::simple::gen_cpp_name(constructor->name) << " &object)";
+  if (is_header) {
+    sb << ";\n";
+    return;
+  }
+  sb << " {\n";
+  sb << "  auto jo = jv.enter_object();\n";
+  sb << "  jo << ctie(\"@type\", \"" << constructor->name << "\");\n";
+  for (auto &arg : constructor->args) {
+    auto field = tl::simple::gen_cpp_field_name(arg.name);
+    // TODO: or as null
+    bool is_custom = arg.type->type == tl::simple::Type::Custom;
+
+    if (is_custom) {
+      sb << "  if (object." << field << ") {\n  ";
+    }
+    auto object = PSTRING() << "object." << tl::simple::gen_cpp_field_name(arg.name);
+    if (arg.type->type == tl::simple::Type::Bytes || arg.type->type == tl::simple::Type::SecureBytes) {
+      object = PSTRING() << "JsonBytes{" << object << "}";
+    } else if (arg.type->type == tl::simple::Type::Int64) {
+      object = PSTRING() << "JsonInt64{" << object << "}";
+    } else if (arg.type->type == tl::simple::Type::Vector &&
+               (arg.type->vector_value_type->type == tl::simple::Type::Bytes ||
+                arg.type->vector_value_type->type == tl::simple::Type::SecureBytes)) {
+      object = PSTRING() << "JsonVectorBytes(" << object << ")";
+    } else if (arg.type->type == tl::simple::Type::Vector &&
+               arg.type->vector_value_type->type == tl::simple::Type::Int64) {
+      object = PSTRING() << "JsonVectorInt64{" << object << "}";
+    }
+    sb << "  jo << ctie(\"" << arg.name << "\", ToJson(" << object << "));\n";
+    if (is_custom) {
+      sb << "  }\n";
+    }
+  }
+  sb << "}\n";
+}
+
+void gen_to_json(StringBuilder &sb, const tl::simple::Schema &schema, bool is_header) {
+  for (auto *custom_type : schema.custom_types) {
+    if (custom_type->constructors.size() > 1) {
+      auto type_name = tl::simple::gen_cpp_name(custom_type->name);
+      sb << "void to_json(JsonValueScope &jv, const " << tl_name << "::" << type_name << " &object)";
+      if (is_header) {
+        sb << ";\n";
+      } else {
+        sb << " {\n"
+           << "  " << tl_name << "::downcast_call(const_cast<" << tl_name << "::" << type_name
+           << " &>(object), [&jv](const auto &object) { "
+              "to_json(jv, object); });\n"
+           << "}\n";
+      }
+    }
+    for (auto *constructor : custom_type->constructors) {
+      gen_to_json_constructor(sb, constructor, is_header);
+    }
+  }
+  for (auto *function : schema.functions) {
+    gen_to_json_constructor(sb, function, is_header);
+  }
+
+  if (is_header) {
+    sb << "inline void to_json(JsonValueScope &jv, const ton::" << tl_name
+       << "::Object &object) {\n"
+          "  ton::"
+       << tl_name << "::downcast_call(const_cast<ton::" << tl_name
+       << "::Object &>(object),[&jv](const auto &object) { "
+          "to_json(jv, object); });\n"
+       << "}\n";
+    sb << "inline void to_json(JsonValueScope &jv, const ton::" << tl_name << "::Function &object) {\n"
+       << "  ton::" << tl_name << "::downcast_call(const_cast<ton::" << tl_name
+       << "::Function &>(object), [&jv](const auto &object) { "
+          "to_json(jv, object); });\n"
+       << "}\n";
+  }
+}
+
+template <class T>
+void gen_from_json_constructor(StringBuilder &sb, const T *constructor, bool is_header) {
+  sb << "Status from_json(" << tl_name << "::" << tl::simple::gen_cpp_name(constructor->name)
+     << " &to, JsonObject &from)";
+  if (is_header) {
+    sb << ";\n";
+  } else {
+    sb << " {\n";
+    for (auto &arg : constructor->args) {
+      sb << "  {\n";
+      sb << "    TRY_RESULT(value, get_json_object_field(from, \"" << tl::simple::gen_cpp_name(arg.name)
+         << "\", JsonValue::Type::Null, true));\n";
+      sb << "    if (value.type() != JsonValue::Type::Null) {\n";
+      if (arg.type->type == tl::simple::Type::Bytes || arg.type->type == tl::simple::Type::SecureBytes) {
+        sb << "      TRY_STATUS(from_json_bytes(to." << tl::simple::gen_cpp_field_name(arg.name) << ", value));\n";
+      } else if (arg.type->type == tl::simple::Type::Vector &&
+                 (arg.type->vector_value_type->type == tl::simple::Type::Bytes ||
+                  arg.type->vector_value_type->type == tl::simple::Type::SecureBytes)) {
+        sb << "      TRY_STATUS(from_json_vector_bytes(to." << tl::simple::gen_cpp_field_name(arg.name)
+           << ", value));\n";
+      } else {
+        sb << "      TRY_STATUS(from_json(to." << tl::simple::gen_cpp_field_name(arg.name) << ", value));\n";
+      }
+      sb << "    }\n";
+      sb << "  }\n";
+    }
+    sb << "  return Status::OK();\n";
+    sb << "}\n";
+  }
+}
+
+void gen_from_json(StringBuilder &sb, const tl::simple::Schema &schema, bool is_header) {
+  for (auto *custom_type : schema.custom_types) {
+    for (auto *constructor : custom_type->constructors) {
+      gen_from_json_constructor(sb, constructor, is_header);
+    }
+  }
+  for (auto *function : schema.functions) {
+    gen_from_json_constructor(sb, function, is_header);
+  }
+}
+
+using Vec = std::vector<std::pair<int32, std::string>>;
+void gen_tl_constructor_from_string(StringBuilder &sb, Slice name, const Vec &vec, bool is_header) {
+  sb << "Result<int32> tl_constructor_from_string(" << tl_name << "::" << name << " *object, const std::string &str)";
+  if (is_header) {
+    sb << ";\n";
+    return;
+  }
+  sb << " {\n";
+  sb << "  static const std::unordered_map<Slice, int32, SliceHash> m = {\n";
+
+  bool is_first = true;
+  for (auto &p : vec) {
+    if (is_first) {
+      is_first = false;
+    } else {
+      sb << ",\n";
+    }
+    sb << "    {\"" << p.second << "\", " << p.first << "}";
+  }
+  sb << "\n  };\n";
+  sb << "  auto it = m.find(str);\n";
+  sb << "  if (it == m.end()) {\n"
+     << "    return Status::Error(str + \"Unknown class\");\n"
+     << "  }\n"
+     << "  return it->second;\n";
+  sb << "}\n";
+}
+
+void gen_tl_constructor_from_string(StringBuilder &sb, const tl::simple::Schema &schema, bool is_header) {
+  Vec vec_for_nullary;
+  for (auto *custom_type : schema.custom_types) {
+    Vec vec;
+    for (auto *constructor : custom_type->constructors) {
+      vec.push_back(std::make_pair(constructor->id, constructor->name));
+      vec_for_nullary.push_back(vec.back());
+    }
+
+    if (vec.size() > 1) {
+      gen_tl_constructor_from_string(sb, tl::simple::gen_cpp_name(custom_type->name), vec, is_header);
+    }
+  }
+  gen_tl_constructor_from_string(sb, "Object", vec_for_nullary, is_header);
+
+  Vec vec_for_function;
+  for (auto *function : schema.functions) {
+    vec_for_function.push_back(std::make_pair(function->id, function->name));
+  }
+  gen_tl_constructor_from_string(sb, "Function", vec_for_function, is_header);
+}
+
+void gen_json_converter_file(const tl::simple::Schema &schema, const std::string &file_name_base, bool is_header) {
+  auto file_name = is_header ? file_name_base + ".h" : file_name_base + ".cpp";
+  //file_name = "auto/" + file_name;
+  auto old_file_content = [&] {
+    auto r_content = read_file(file_name);
+    if (r_content.is_error()) {
+      return BufferSlice();
+    }
+    return r_content.move_as_ok();
+  }();
+
+  std::string buf(2000000, ' ');
+  StringBuilder sb(MutableSlice{buf});
+
+  if (is_header) {
+    sb << "#pragma once\n\n";
+
+    sb << "#include \"auto/tl/" << tl_name << ".h\"\n\n";
+    sb << "#include \"auto/tl/" << tl_name << ".hpp\"\n\n";
+
+    sb << "#include \"td/utils/JsonBuilder.h\"\n";
+    sb << "#include \"td/utils/Status.h\"\n\n";
+
+    sb << "#include \"crypto/common/bitstring.h\"\n";
+  } else {
+    sb << "#include \"" << file_name_base << ".h\"\n\n";
+
+    sb << "#include \"auto/tl/" << tl_name << ".h\"\n";
+    sb << "#include \"auto/tl/" << tl_name << ".hpp\"\n\n";
+
+    sb << "#include \"tl/tl_json.h\"\n\n";
+
+    sb << "#include \"td/utils/base64.h\"\n";
+    sb << "#include \"td/utils/common.h\"\n";
+    sb << "#include \"td/utils/Slice.h\"\n\n";
+
+    sb << "#include <unordered_map>\n\n";
+  }
+  sb << "namespace ton {\n";
+  sb << "namespace " << tl_name << "{\n";
+  sb << "  using namespace td;\n";
+  gen_tl_constructor_from_string(sb, schema, is_header);
+  gen_from_json(sb, schema, is_header);
+  gen_to_json(sb, schema, is_header);
+  sb << "}  // namespace " << tl_name << "\n";
+  sb << "}  // namespace ton\n";
+
+  CHECK(!sb.is_error());
+  buf.resize(sb.as_cslice().size());
+  auto new_file_content = std::move(buf);
+  if (new_file_content != old_file_content.as_slice()) {
+    write_file(file_name, new_file_content).ensure();
+  }
+}
+
+void gen_json_converter(const tl::tl_config &config, const std::string &file_name, const std::string &new_tl_name) {
+  tl_name = new_tl_name;
+
+  tl::simple::Schema schema(config);
+  gen_json_converter_file(schema, file_name, true);
+  gen_json_converter_file(schema, file_name, false);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_json_converter.h b/submodules/ton/tonlib-src/tl/generate/tl_json_converter.h
new file mode 100644
index 0000000000..7b69bc0375
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_json_converter.h
@@ -0,0 +1,29 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <string>
+
+#include "td/tl/tl_config.h"
+
+namespace td {
+
+void gen_json_converter(const tl::tl_config &config, const std::string &file_name, const std::string &tl_name);
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_cpp.cpp b/submodules/ton/tonlib-src/tl/generate/tl_writer_cpp.cpp
new file mode 100644
index 0000000000..329743127b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_cpp.cpp
@@ -0,0 +1,698 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_writer_cpp.h"
+
+#include <cassert>
+
+namespace td {
+
+std::string TD_TL_writer_cpp::gen_output_begin() const {
+  std::string ext_include_str;
+  for (auto &it : ext_include) {
+    ext_include_str += "#include " + it + "\n";
+  }
+  if (!ext_include_str.empty()) {
+    ext_include_str += "\n";
+  }
+
+  return "#include \"" + tl_name + ".h\"\n\n" + ext_include_str +
+         "#include \"td/utils/common.h\"\n"
+         "#include \"td/utils/format.h\"\n"
+         "#include \"td/utils/logging.h\"\n"
+         "#include \"td/utils/tl_parsers.h\"\n"
+         "#include \"td/utils/tl_storers.h\"\n\n"
+         "namespace ton {\n"
+         "namespace " +
+         tl_name +
+         " {\n\n"
+         "std::string to_string(const BaseObject &value) {\n"
+         "  td::TlStorerToString storer;\n"
+         "  value.store(storer, \"\");\n"
+         "  return storer.str();\n"
+         "}\n";
+}
+
+std::string TD_TL_writer_cpp::gen_output_end() const {
+  return "}  // namespace " + tl_name +
+         "\n"
+         "}  // namespace ton\n";
+}
+
+std::string TD_TL_writer_cpp::gen_field_definition(const std::string &class_name, const std::string &type_name,
+                                                   const std::string &field_name) const {
+  return "";
+}
+
+std::string TD_TL_writer_cpp::gen_vars(const tl::tl_combinator *t, const tl::tl_tree_type *result_type,
+                                       std::vector<tl::var_description> &vars) const {
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    vars[i].index = static_cast<int>(i);
+    vars[i].is_stored = false;
+    vars[i].is_type = false;
+    vars[i].parameter_num = -1;
+    vars[i].function_arg_num = -1;
+  }
+
+  if (result_type != nullptr) {
+    assert(result_type->children.empty());
+  }
+
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    const tl::arg &a = t->args[i];
+
+    int arg_type = a.type->get_type();
+    if (arg_type == tl::NODE_TYPE_VAR_TYPE) {
+      const tl::tl_tree_var_type *var_type = static_cast<const tl::tl_tree_var_type *>(a.type);
+      assert(a.flags & tl::FLAG_EXCL);
+      assert(var_type->var_num < static_cast<int>(vars.size()));
+      assert(var_type->var_num >= 0);
+      assert(!vars[var_type->var_num].is_type);
+      vars[var_type->var_num].is_type = true;
+      vars[var_type->var_num].function_arg_num = static_cast<int>(i);
+    }
+  }
+
+  std::string res;
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    if (!vars[i].is_type) {
+      assert(vars[i].parameter_num == -1);
+      assert(vars[i].function_arg_num == -1);
+      assert(vars[i].is_stored == false);
+      res += "  " + gen_class_name("#") + " " + gen_var_name(vars[i]) + ";\n";
+    }
+  }
+  return res;
+}
+
+std::string TD_TL_writer_cpp::gen_function_vars(const tl::tl_combinator *t,
+                                                std::vector<tl::var_description> &vars) const {
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    vars[i].index = static_cast<int>(i);
+    vars[i].is_stored = false;
+    vars[i].is_type = false;
+    vars[i].parameter_num = -1;
+    vars[i].function_arg_num = -1;
+  }
+
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    const tl::arg &a = t->args[i];
+
+    int arg_type = a.type->get_type();
+    if (arg_type == tl::NODE_TYPE_VAR_TYPE) {
+      const tl::tl_tree_var_type *var_type = static_cast<const tl::tl_tree_var_type *>(a.type);
+      assert(a.flags & tl::FLAG_EXCL);
+      assert(var_type->var_num >= 0);
+      assert(!vars[var_type->var_num].is_type);
+      vars[var_type->var_num].is_type = true;
+      vars[var_type->var_num].function_arg_num = static_cast<int>(i);
+    }
+  }
+
+  return "";
+}
+
+std::string TD_TL_writer_cpp::gen_uni(const tl::tl_tree_type *result_type, std::vector<tl::var_description> &vars,
+                                      bool check_negative) const {
+  assert(result_type->children.empty());
+  return "";
+}
+
+std::string TD_TL_writer_cpp::gen_constructor_id_store_raw(const std::string &id) const {
+  return "s.store_binary(" + id + ");";
+}
+
+std::string TD_TL_writer_cpp::gen_constructor_id_store(std::int32_t id, int storer_type) const {
+  if (storer_type == 1) {
+    return "";
+  }
+  return "  " + gen_constructor_id_store_raw(int_to_string(id)) + "\n";
+}
+
+std::string TD_TL_writer_cpp::gen_fetch_class_name(const tl::tl_tree_type *tree_type) const {
+  const tl::tl_type *t = tree_type->type;
+  const std::string &name = t->name;
+
+  if (name == "#" || name == "Int32") {
+    return "TlFetchInt";
+  }
+  if (name == "Int53" || name == "Int64") {
+    return "TlFetchLong";
+  }
+  if (name == "True" || name == "Bool" || name == "Int" || name == "Long" || name == "Double" || name == "Int128" ||
+      name == "Int256") {
+    return "TlFetch" + name;
+  }
+  if (name == "String" || name == "SecureString") {
+    return "TlFetchString<" + string_type + ">";
+  }
+  if (name == "Bytes" || name == "SecureBytes") {
+    return "TlFetchBytes<" + bytes_type + ">";
+  }
+  if (name == "Object") {
+    return "TlFetchObject<" + gen_base_type_class_name(0) + ">";
+  }
+  if (name == "Function") {
+    return "TlFetchObject<" + gen_base_function_class_name() + ">";
+  }
+
+  if (name == "Vector") {
+    assert(t->arity == 1);
+    assert(tree_type->children.size() == 1);
+    assert(tree_type->children[0]->get_type() == tl::NODE_TYPE_TYPE);
+    const tl::tl_tree_type *child = static_cast<const tl::tl_tree_type *>(tree_type->children[0]);
+
+    return "TlFetchVector<" + gen_full_fetch_class_name(child) + ">";
+  }
+
+  assert(!is_built_in_simple_type(name) && !is_built_in_complex_type(name));
+  for (std::size_t i = 0; i < tree_type->children.size(); i++) {
+    assert(tree_type->children[i]->get_type() == tl::NODE_TYPE_NAT_CONST);
+  }
+
+  assert(tree_type->children.empty());
+  return "TlFetchObject<" + gen_main_class_name(t) + ">";
+}
+
+std::string TD_TL_writer_cpp::gen_full_fetch_class_name(const tl::tl_tree_type *tree_type) const {
+  const tl::tl_type *t = tree_type->type;
+  const std::string &name = t->name;
+
+  assert(!(t->flags & tl::FLAG_DEFAULT_CONSTRUCTOR));  // Not supported yet
+
+  std::int32_t expected_constructor_id = 0;
+  if (tree_type->flags & tl::FLAG_BARE) {
+    assert(is_type_bare(t));
+  } else {
+    if (is_type_bare(t)) {
+      for (std::size_t i = 0; i < t->constructors_num; i++) {
+        if (is_built_in_complex_type(name) || is_combinator_supported(t->constructors[i])) {
+          assert(expected_constructor_id == 0);
+          expected_constructor_id = t->constructors[i]->id;
+          assert(expected_constructor_id != 0);
+        }
+      }
+    }
+  }
+  if (expected_constructor_id == 0) {
+    return gen_fetch_class_name(tree_type);
+  }
+  return "TlFetchBoxed<" + gen_fetch_class_name(tree_type) + ", " + int_to_string(expected_constructor_id) + ">";
+}
+
+std::string TD_TL_writer_cpp::gen_type_fetch(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                                             const std::vector<tl::var_description> &vars, int parser_type) const {
+  return gen_full_fetch_class_name(tree_type) + "::parse(p)";
+}
+
+std::string TD_TL_writer_cpp::gen_field_fetch(int field_num, const tl::arg &a, std::vector<tl::var_description> &vars,
+                                              bool flat, int parser_type) const {
+  assert(parser_type >= 0);
+  std::string field_name = (parser_type == 0 ? (field_num == 0 ? ": " : ", ") : "res->") + gen_field_name(a.name);
+
+  if (a.type->get_type() == tl::NODE_TYPE_VAR_TYPE) {
+    assert(parser_type == 1);
+
+    const tl::tl_tree_var_type *t = static_cast<const tl::tl_tree_var_type *>(a.type);
+    assert(a.flags == tl::FLAG_EXCL);
+
+    assert(a.var_num == -1);
+    assert(a.exist_var_num == -1);
+
+    assert(t->var_num >= 0);
+    assert(vars[t->var_num].is_type);
+    assert(!vars[t->var_num].is_stored);
+    vars[t->var_num].is_stored = true;
+
+    return "  " + field_name + " = " + gen_base_function_class_name() + "::fetch(p);\n";
+  }
+
+  assert(!(a.flags & tl::FLAG_EXCL));
+
+  assert(!(a.flags & tl::FLAG_OPT_VAR));
+
+  std::string res = "  ";
+  if (a.exist_var_num != -1) {
+    assert(0 <= a.exist_var_num && a.exist_var_num < static_cast<int>(vars.size()));
+    assert(vars[a.exist_var_num].is_stored);
+
+    res += "if (" + gen_var_name(vars[a.exist_var_num]) + " & " + int_to_string(1 << a.exist_var_bit) + ") { ";
+  }
+
+  if (flat) {
+    //    TODO
+    //    return gen_field_fetch(const tl::arg &a, std::vector<tl::var_description> &vars, int num, bool flat);
+  }
+
+  bool store_to_var_num = false;
+  if (a.var_num >= 0) {
+    assert(a.type->get_type() == tl::NODE_TYPE_TYPE);
+    assert(static_cast<const tl::tl_tree_type *>(a.type)->type->id == tl::ID_VAR_NUM);
+    assert(0 <= a.var_num && a.var_num < static_cast<int>(vars.size()));
+    if (!vars[a.var_num].is_stored) {
+      res += "if ((" + gen_var_name(vars[a.var_num]) + " = ";
+      store_to_var_num = true;
+    } else {
+      assert(false);
+    }
+    vars[a.var_num].is_stored = true;
+  }
+
+  res += field_name + (parser_type == 0 ? "(" : " = ");
+
+  assert(a.type->get_type() == tl::NODE_TYPE_TYPE);
+  const tl::tl_tree_type *tree_type = static_cast<tl::tl_tree_type *>(a.type);
+  res += gen_type_fetch(field_name, tree_type, vars, parser_type);
+  if (store_to_var_num) {
+    res += ") < 0) { FAIL(\"Variable of type # can't be negative\"); }";
+  } else {
+    res += (parser_type == 0 ? ")" : ";");
+  }
+
+  if (a.exist_var_num >= 0) {
+    res += " }";
+    if (store_to_var_num) {
+      res += " else { " + gen_var_name(vars[a.var_num]) + " = 0; }";
+    }
+  }
+  res += "\n";
+  return res;
+}
+
+std::string TD_TL_writer_cpp::gen_var_type_fetch(const tl::arg &a) const {
+  assert(false);
+  return "";
+}
+
+std::string TD_TL_writer_cpp::get_pretty_field_name(std::string field_name) const {
+  if (!field_name.empty() && field_name.back() == ']') {
+    return "";
+  }
+  auto equals_pos = field_name.find('=');
+  if (equals_pos != std::string::npos && equals_pos + 3 < field_name.size()) {
+    field_name = field_name.substr(equals_pos + 2);
+    if (field_name.back() == ')') {
+      field_name.pop_back();
+    }
+  }
+  while (!field_name.empty() && field_name.back() == '_') {
+    field_name.pop_back();
+  }
+  return field_name;
+}
+
+std::string TD_TL_writer_cpp::get_pretty_class_name(std::string class_name) const {
+  return class_name;
+}
+
+std::string TD_TL_writer_cpp::gen_vector_store(const std::string &field_name, const tl::tl_tree_type *t,
+                                               const std::vector<tl::var_description> &vars, int storer_type) const {
+  std::string num = field_name.back() == ']' ? "2" : "";
+  return "{ const std::vector<" + gen_type_name(t) + "> &v" + num + " = " + field_name +
+         "; const std::uint32_t multiplicity" + num + " = static_cast<std::uint32_t>(v" + num +
+         ".size()); const auto vector_name" + num + " = \"" + get_pretty_class_name("vector") +
+         "[\" + td::to_string(multiplicity" + num + ")+ \"]\"; s.store_class_begin(\"" +
+         get_pretty_field_name(field_name) + "\", vector_name" + num +
+         ".c_str()); "
+         "for (std::uint32_t i" +
+         num + " = 0; i" + num + " < multiplicity" + num + "; i" + num + "++) { " +
+         gen_type_store("v" + num + "[i" + num + "]", t, vars, storer_type) + " } s.store_class_end(); }";
+}
+
+std::string TD_TL_writer_cpp::gen_store_class_name(const tl::tl_tree_type *tree_type) const {
+  const tl::tl_type *t = tree_type->type;
+  const std::string &name = t->name;
+
+  if (name == "#" || name == "Int" || name == "Long" || name == "Int32" || name == "Int53" || name == "Int64" ||
+      name == "Double" || name == "Int128" || name == "Int256") {
+    return "TlStoreBinary";
+  }
+  if (name == "Bool") {
+    return "TlStoreBool";
+  }
+  if (name == "True") {
+    return "TlStoreTrue";
+  }
+  if (name == "String" || name == "Bytes" || name == "SecureString" || name == "SecureBytes") {
+    return "TlStoreString";
+  }
+  if (name == "Object" || name == "Function") {
+    return "TlStoreObject";
+  }
+
+  if (name == "Vector") {
+    assert(t->arity == 1);
+    assert(tree_type->children.size() == 1);
+    assert(tree_type->children[0]->get_type() == tl::NODE_TYPE_TYPE);
+    const tl::tl_tree_type *child = static_cast<const tl::tl_tree_type *>(tree_type->children[0]);
+
+    return "TlStoreVector<" + gen_full_store_class_name(child) + ">";
+  }
+
+  assert(!is_built_in_simple_type(name) && !is_built_in_complex_type(name));
+  for (std::size_t i = 0; i < tree_type->children.size(); i++) {
+    assert(tree_type->children[i]->get_type() == tl::NODE_TYPE_NAT_CONST);
+  }
+
+  assert(tree_type->children.empty());
+  return "TlStoreObject";
+}
+
+std::string TD_TL_writer_cpp::gen_full_store_class_name(const tl::tl_tree_type *tree_type) const {
+  const tl::tl_type *t = tree_type->type;
+
+  assert(!(t->flags & tl::FLAG_DEFAULT_CONSTRUCTOR));  // Not supported yet
+
+  if ((tree_type->flags & tl::FLAG_BARE) != 0 || t->name == "#" || t->name == "Bool") {
+    return gen_store_class_name(tree_type);
+  }
+
+  if (is_built_in_complex_type(t->name)) {
+    return "TlStoreBoxed<" + gen_store_class_name(tree_type) + ", " + int_to_string(t->constructors[0]->id) + ">";
+  }
+
+  if (!is_type_bare(t)) {
+    return "TlStoreBoxedUnknown<" + gen_store_class_name(tree_type) + ">";
+  }
+
+  for (std::size_t i = 0; i < t->constructors_num; i++) {
+    if (is_combinator_supported(t->constructors[i])) {
+      return "TlStoreBoxed<" + gen_store_class_name(tree_type) + ", " + int_to_string(t->constructors[i]->id) + ">";
+    }
+  }
+
+  assert(false);
+  return "";
+}
+
+std::string TD_TL_writer_cpp::gen_type_store(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                                             const std::vector<tl::var_description> &vars, int storer_type) const {
+  if (storer_type == 0) {
+    return gen_full_store_class_name(tree_type) + "::store(" + field_name + ", s);";
+  }
+
+  const tl::tl_type *t = tree_type->type;
+  const std::string &name = t->name;
+
+  assert(!(t->flags & tl::FLAG_DEFAULT_CONSTRUCTOR));  // Not supported yet
+
+  if (name == "#" || name == "Int" || name == "Long" || name == "Int32" || name == "Int53" || name == "Int64" ||
+      name == "Double" || name == "Bool" || name == "String" || name == "SecureString" || name == "Int128" ||
+      name == "Int256") {
+    return "s.store_field(\"" + get_pretty_field_name(field_name) + "\", " + field_name + ");";
+  } else if (name == "True") {
+    // currently nothing to do
+    return "";
+  } else if (name == "Bytes" || name == "SecureBytes") {
+    return "s.store_bytes_field(\"" + get_pretty_field_name(field_name) + "\", " + field_name + ");";
+  } else if (name == "Vector") {
+    const tl::tl_tree_type *child = static_cast<const tl::tl_tree_type *>(tree_type->children[0]);
+    return gen_vector_store(field_name, child, vars, storer_type);
+  } else {
+    assert(tree_type->children.empty());
+    return "if (" + field_name + " == nullptr) { s.store_field(\"" + get_pretty_field_name(field_name) +
+           "\", \"null\"); } else { " + field_name + "->store(s, \"" + get_pretty_field_name(field_name) + "\"); }";
+  }
+}
+
+std::string TD_TL_writer_cpp::gen_field_store(const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                                              int storer_type) const {
+  std::string field_name = gen_field_name(a.name);
+  std::string res = storer_type == 1 ? "    " : "  ";
+
+  if (a.type->get_type() == tl::NODE_TYPE_VAR_TYPE) {
+    const tl::tl_tree_var_type *t = static_cast<const tl::tl_tree_var_type *>(a.type);
+    assert(a.flags == tl::FLAG_EXCL);
+
+    assert(a.var_num == -1);
+    assert(a.exist_var_num == -1);
+
+    assert(t->var_num >= 0);
+    assert(!vars[t->var_num].is_stored);
+    vars[t->var_num].is_stored = true;
+    assert(vars[t->var_num].is_type);
+
+    return res + field_name + "->store(s);\n";
+  }
+
+  assert(!(a.flags & tl::FLAG_EXCL));
+
+  if (a.flags & tl::FLAG_OPT_VAR) {
+    assert(false);
+    assert(a.exist_var_num == -1);
+    assert(0 <= a.var_num && a.var_num < static_cast<int>(vars.size()));
+
+    assert(a.type->get_type() == tl::NODE_TYPE_TYPE);
+    assert(static_cast<const tl::tl_tree_type *>(a.type)->type->id == tl::ID_VAR_NUM);
+    assert(vars[a.var_num].is_stored);
+    assert(!vars[a.var_num].is_type);
+    return "";
+  }
+
+  if (a.exist_var_num >= 0) {
+    assert(a.exist_var_num < static_cast<int>(vars.size()));
+    assert(vars[a.exist_var_num].is_stored);
+
+    res += "if (" + gen_var_name(vars[a.exist_var_num]) + " & " + int_to_string(1 << a.exist_var_bit) + ") { ";
+  }
+
+  if (flat) {
+    //    TODO
+    //    return gen_field_store(const tl::arg &a, std::vector<tl::var_description> &vars, bool flat, int storer_type);
+  }
+
+  if (a.var_num >= 0) {
+    assert(a.type->get_type() == tl::NODE_TYPE_TYPE);
+    assert(static_cast<const tl::tl_tree_type *>(a.type)->type->id == tl::ID_VAR_NUM);
+    assert(a.var_num < static_cast<int>(vars.size()));
+    if (!vars[a.var_num].is_stored) {
+      field_name = "(" + gen_var_name(vars[a.var_num]) + " = " + field_name + ")";
+      vars[a.var_num].is_stored = true;
+    } else {
+      assert(false);  // need to check value of stored var
+      field_name = gen_var_name(vars[a.var_num]);
+    }
+  }
+
+  assert(a.type->get_type() == tl::NODE_TYPE_TYPE);
+  const tl::tl_tree_type *tree_type = static_cast<tl::tl_tree_type *>(a.type);
+  res += gen_type_store(field_name, tree_type, vars, storer_type);
+  if (a.exist_var_num >= 0) {
+    res += " }";
+  }
+  res += "\n";
+  return res;
+}
+
+std::string TD_TL_writer_cpp::gen_forward_class_declaration(const std::string &class_name, bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_cpp::gen_class_begin(const std::string &class_name, const std::string &base_class_name,
+                                              bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_cpp::gen_class_end() const {
+  return "";
+}
+
+std::string TD_TL_writer_cpp::gen_class_alias(const std::string &class_name, const std::string &alias_name) const {
+  return "";
+}
+
+std::string TD_TL_writer_cpp::gen_get_id(const std::string &class_name, std::int32_t id, bool is_proxy) const {
+  if (is_proxy) {
+    return "";
+  }
+  return "\nconst std::int32_t " + class_name + "::ID;\n";
+}
+
+std::string TD_TL_writer_cpp::gen_function_result_type(const tl::tl_tree *result) const {
+  return "";
+}
+
+std::string TD_TL_writer_cpp::gen_fetch_function_begin(const std::string &parser_name, const std::string &class_name,
+                                                       const std::string &parent_class_name, int arity,
+                                                       std::vector<tl::var_description> &vars, int parser_type) const {
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    assert(vars[i].is_stored == false);
+  }
+
+  std::string fetched_type = "object_ptr<" + class_name + "> ";
+  std::string returned_type = "object_ptr<" + parent_class_name + "> ";
+  assert(arity == 0);
+
+  if (parser_type == 0) {
+    return "\n" + returned_type + class_name + "::fetch(" + parser_name +
+           " &p) {\n"
+           "  return make_object<" +
+           class_name +
+           ">(p);\n"
+           "}\n\n" +
+           class_name + "::" + class_name + "(" + parser_name +
+           " &p)\n"
+           "#define FAIL(error) p.set_error(error)\n";
+  }
+
+  return "\n" + returned_type + class_name + "::fetch(" + parser_name +
+         " &p) {\n"
+         "#define FAIL(error) p.set_error(error); return nullptr;\n" +
+         (parser_type == -1 ? "" : "  " + fetched_type + "res = make_object<" + class_name + ">();\n");
+}
+
+std::string TD_TL_writer_cpp::gen_fetch_function_end(bool has_parent, int field_num,
+                                                     const std::vector<tl::var_description> &vars,
+                                                     int parser_type) const {
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    assert(vars[i].is_stored);
+  }
+
+  if (parser_type == 0) {
+    return "#undef FAIL\n"
+           "{" +
+           (field_num == 0 ? "\n  (void)p;\n" : std::string()) + "}\n";
+  }
+
+  if (parser_type == -1) {
+    return "#undef FAIL\n"
+           "}\n";
+  }
+
+  return "  if (p.get_error()) { FAIL(\"\"); }\n"
+         "  return " +
+         std::string(has_parent ? "std::move(res)" : "res") +
+         ";\n"
+         "#undef FAIL\n"
+         "}\n";
+}
+
+std::string TD_TL_writer_cpp::gen_fetch_function_result_begin(const std::string &parser_name,
+                                                              const std::string &class_name,
+                                                              const tl::tl_tree *result) const {
+  return "\n" + class_name + "::ReturnType " + class_name + "::fetch_result(" + parser_name +
+         " &p) {\n"
+         "#define FAIL(error) p.set_error(error); return ReturnType()\n"
+         "  return ";
+}
+
+std::string TD_TL_writer_cpp::gen_fetch_function_result_end() const {
+  return ";\n"
+         "#undef FAIL\n"
+         "}\n";
+}
+
+std::string TD_TL_writer_cpp::gen_fetch_function_result_any_begin(const std::string &parser_name,
+                                                                  const std::string &class_name, bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_cpp::gen_fetch_function_result_any_end(bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_cpp::gen_store_function_begin(const std::string &storer_name, const std::string &class_name,
+                                                       int arity, std::vector<tl::var_description> &vars,
+                                                       int storer_type) const {
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    vars[i].is_stored = false;
+  }
+
+  if (storer_type == -1) {
+    return "";
+  }
+
+  assert(arity == 0);
+  return "\n"
+         "void " +
+         class_name + "::store(" + storer_name + " &s" +
+         std::string(storer_type <= 0 ? "" : ", const char *field_name") + ") const {\n" +
+         (storer_type <= 0 ? "  (void)sizeof(s);\n"
+                           : "  if (!LOG_IS_STRIPPED(ERROR)) {\n"
+                             "    s.store_class_begin(field_name, \"" +
+                                 get_pretty_class_name(class_name) + "\");\n");
+}
+
+std::string TD_TL_writer_cpp::gen_store_function_end(const std::vector<tl::var_description> &vars,
+                                                     int storer_type) const {
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    assert(vars[i].is_stored);
+  }
+
+  if (storer_type == -1) {
+    return "";
+  }
+
+  return (storer_type <= 0 ? std::string()
+                           : "    s.store_class_end();\n"
+                             "  }\n") +
+         "}\n";
+}
+
+std::string TD_TL_writer_cpp::gen_fetch_switch_begin() const {
+  return "  int constructor = p.fetch_int();\n"
+         "  switch (constructor) {\n";
+}
+
+std::string TD_TL_writer_cpp::gen_fetch_switch_case(const tl::tl_combinator *t, int arity) const {
+  assert(arity == 0);
+  return "    case " + gen_class_name(t->name) +
+         "::ID:\n"
+         "      return " +
+         gen_class_name(t->name) + "::fetch(p);\n";
+}
+
+std::string TD_TL_writer_cpp::gen_fetch_switch_end() const {
+  return "    default:\n"
+         "      FAIL(PSTRING() << \"Unknown constructor found \" << td::format::as_hex(constructor));\n"
+         "  }\n";
+}
+
+std::string TD_TL_writer_cpp::gen_constructor_begin(int fields_num, const std::string &class_name,
+                                                    bool is_default) const {
+  return "\n" + class_name + "::" + class_name + "(";
+}
+
+std::string TD_TL_writer_cpp::gen_constructor_field_init(int field_num, const std::string &class_name, const tl::arg &a,
+                                                         bool is_default) const {
+  std::string field_type = gen_field_type(a);
+  if (field_type.empty()) {
+    return "";
+  }
+  std::string move_begin;
+  std::string move_end;
+  if ((field_type == bytes_type || field_type == secure_bytes_type || field_type == secure_string_type ||
+       field_type.compare(0, 11, "std::vector") == 0 || field_type.compare(0, 10, "object_ptr") == 0) &&
+      !is_default) {
+    move_begin = "std::move(";
+    move_end = ")";
+  }
+
+  return (field_num == 0 ? ")\n  : " : "  , ") + gen_field_name(a.name) + "(" + move_begin +
+         (is_default ? "" : gen_field_name(a.name)) + move_end + ")\n";
+}
+
+std::string TD_TL_writer_cpp::gen_constructor_end(const tl::tl_combinator *t, int fields_num, bool is_default) const {
+  if (fields_num == 0) {
+    return ") {\n"
+           "}\n";
+  }
+  return "{}\n";
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_cpp.h b/submodules/ton/tonlib-src/tl/generate/tl_writer_cpp.h
new file mode 100644
index 0000000000..025dc1e30d
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_cpp.h
@@ -0,0 +1,120 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "tl_writer_td.h"
+
+#include <cstdint>
+#include <string>
+#include <vector>
+
+namespace td {
+
+class TD_TL_writer_cpp : public TD_TL_writer {
+  std::string gen_constructor_id_store_raw(const std::string &id) const;
+
+  std::string gen_fetch_class_name(const tl::tl_tree_type *tree_type) const;
+
+  std::string gen_full_fetch_class_name(const tl::tl_tree_type *tree_type) const;
+
+  std::string gen_store_class_name(const tl::tl_tree_type *tree_type) const;
+
+  std::string gen_full_store_class_name(const tl::tl_tree_type *tree_type) const;
+
+  std::vector<std::string> ext_include;
+
+ protected:
+  std::string gen_vector_store(const std::string &field_name, const tl::tl_tree_type *t,
+                               const std::vector<tl::var_description> &vars, int storer_type) const;
+
+  virtual std::string get_pretty_field_name(std::string field_name) const;
+
+  virtual std::string get_pretty_class_name(std::string class_name) const;
+
+ public:
+  TD_TL_writer_cpp(const std::string &tl_name, const std::string &string_type, const std::string &bytes_type,
+                   const std::string &secure_string_type, const std::string &secure_bytes_type,
+                   const std::vector<std::string> &ext_include)
+      : TD_TL_writer(tl_name, string_type, bytes_type, secure_string_type, secure_bytes_type)
+      , ext_include(ext_include) {
+  }
+
+  std::string gen_output_begin() const override;
+  std::string gen_output_end() const override;
+
+  std::string gen_forward_class_declaration(const std::string &class_name, bool is_proxy) const override;
+
+  std::string gen_class_begin(const std::string &class_name, const std::string &base_class_name,
+                              bool is_proxy) const override;
+  std::string gen_class_end() const override;
+
+  std::string gen_class_alias(const std::string &class_name, const std::string &alias_name) const override;
+
+  std::string gen_field_definition(const std::string &class_name, const std::string &type_name,
+                                   const std::string &field_name) const override;
+
+  std::string gen_vars(const tl::tl_combinator *t, const tl::tl_tree_type *result_type,
+                       std::vector<tl::var_description> &vars) const override;
+  std::string gen_function_vars(const tl::tl_combinator *t, std::vector<tl::var_description> &vars) const override;
+  std::string gen_uni(const tl::tl_tree_type *result_type, std::vector<tl::var_description> &vars,
+                      bool check_negative) const override;
+  std::string gen_constructor_id_store(std::int32_t id, int storer_type) const override;
+
+  std::string gen_field_fetch(int field_num, const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                              int parser_type) const override;
+  std::string gen_field_store(const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                              int storer_type) const override;
+  std::string gen_type_fetch(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                             const std::vector<tl::var_description> &vars, int parser_type) const override;
+  std::string gen_type_store(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                             const std::vector<tl::var_description> &vars, int storer_type) const override;
+  std::string gen_var_type_fetch(const tl::arg &a) const override;
+
+  std::string gen_get_id(const std::string &class_name, std::int32_t id, bool is_proxy) const override;
+
+  std::string gen_function_result_type(const tl::tl_tree *result) const override;
+
+  std::string gen_fetch_function_begin(const std::string &parser_name, const std::string &class_name,
+                                       const std::string &parent_class_name, int arity,
+                                       std::vector<tl::var_description> &vars, int parser_type) const override;
+  std::string gen_fetch_function_end(bool has_parent, int field_num, const std::vector<tl::var_description> &vars,
+                                     int parser_type) const override;
+
+  std::string gen_fetch_function_result_begin(const std::string &parser_name, const std::string &class_name,
+                                              const tl::tl_tree *result) const override;
+  std::string gen_fetch_function_result_end() const override;
+  std::string gen_fetch_function_result_any_begin(const std::string &parser_name, const std::string &class_name,
+                                                  bool is_proxy) const override;
+  std::string gen_fetch_function_result_any_end(bool is_proxy) const override;
+
+  std::string gen_store_function_begin(const std::string &storer_name, const std::string &class_name, int arity,
+                                       std::vector<tl::var_description> &vars, int storer_type) const override;
+  std::string gen_store_function_end(const std::vector<tl::var_description> &vars, int storer_type) const override;
+
+  std::string gen_fetch_switch_begin() const override;
+  std::string gen_fetch_switch_case(const tl::tl_combinator *t, int arity) const override;
+  std::string gen_fetch_switch_end() const override;
+
+  std::string gen_constructor_begin(int fields_num, const std::string &class_name, bool is_default) const override;
+  std::string gen_constructor_field_init(int field_num, const std::string &class_name, const tl::arg &a,
+                                         bool is_default) const override;
+  std::string gen_constructor_end(const tl::tl_combinator *t, int fields_num, bool is_default) const override;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_h.cpp b/submodules/ton/tonlib-src/tl/generate/tl_writer_h.cpp
new file mode 100644
index 0000000000..559e5dddd8
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_h.cpp
@@ -0,0 +1,355 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_writer_h.h"
+
+#include <cassert>
+#include <utility>
+
+namespace td {
+
+std::string TD_TL_writer_h::forward_declaration(std::string type) {
+  std::string prefix;
+  std::string suffix;
+  do {
+    std::size_t pos = type.find("::");
+    if (pos == std::string::npos) {
+      return prefix + "class " + type + ";\n" + suffix;
+    }
+    std::string namespace_name = type.substr(0, pos);
+    type = type.substr(pos + 2);
+    prefix += "namespace " + namespace_name + " {\n";
+    suffix += "}  // namespace " + namespace_name + "\n";
+  } while (true);
+  assert(false);
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_output_begin() const {
+  std::string ext_include_str;
+  for (auto &it : ext_include) {
+    ext_include_str += "#include " + it + "\n";
+  }
+  if (!ext_include_str.empty()) {
+    ext_include_str += "\n";
+  }
+  std::string ext_forward_declaration;
+  for (auto &storer_name : get_storers()) {
+    ext_forward_declaration += forward_declaration(storer_name);
+  }
+  for (auto &parser_name : get_parsers()) {
+    ext_forward_declaration += forward_declaration(parser_name);
+  }
+  if (!ext_forward_declaration.empty()) {
+    ext_forward_declaration += "\n";
+  }
+  return "#pragma once\n\n"
+         "#include \"tl/TlObject.h\"\n\n"
+         "#include \"td/utils/int_types.h\"\n\n" +
+         ext_include_str +
+         "#include <cstdint>\n"
+         "#include <memory>\n"
+         "#include <utility>\n"
+         "#include <vector>\n\n" +
+         ext_forward_declaration + "namespace ton {\n" + "namespace " + tl_name + "{\n" +
+         "using BaseObject = ::ton::TlObject;\n\n"
+         "template <class Type>\n"
+         "using object_ptr = ::ton::tl_object_ptr<Type>;\n\n"
+         "template <class Type, class... Args>\n"
+         "object_ptr<Type> make_object(Args &&... args) {\n"
+         "  return object_ptr<Type>(new Type(std::forward<Args>(args)...));\n"
+         "}\n\n"
+
+         "template <class ToType, class FromType>\n"
+         "object_ptr<ToType> move_object_as(FromType &&from) {\n"
+         "  return object_ptr<ToType>(static_cast<ToType *>(from.release()));\n"
+         "}\n\n"
+
+         "std::string to_string(const BaseObject &value);\n\n"
+
+         "template <class T>\n"
+         "std::string to_string(const object_ptr<T> &value) {\n"
+         "  if (value == nullptr) {\n"
+         "    return \"null\";\n"
+         "  }\n"
+         "\n"
+         "  return to_string(*value);\n"
+         "}\n\n";
+}
+
+std::string TD_TL_writer_h::gen_output_end() const {
+  return "}  // namespace " + tl_name +
+         "\n"
+         "}  // namespace ton\n";
+}
+
+std::string TD_TL_writer_h::gen_field_definition(const std::string &class_name, const std::string &type_name,
+                                                 const std::string &field_name) const {
+  return "  " + type_name + (type_name.empty() || type_name[type_name.size() - 1] == ' ' ? "" : " ") + field_name +
+         ";\n";
+}
+
+std::string TD_TL_writer_h::gen_vars(const tl::tl_combinator *t, const tl::tl_tree_type *result_type,
+                                     std::vector<tl::var_description> &vars) const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_function_vars(const tl::tl_combinator *t,
+                                              std::vector<tl::var_description> &vars) const {
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    vars[i].index = static_cast<int>(i);
+    vars[i].is_stored = false;
+    vars[i].is_type = false;
+    vars[i].parameter_num = -1;
+    vars[i].function_arg_num = -1;
+  }
+
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    const tl::arg &a = t->args[i];
+
+    int arg_type = a.type->get_type();
+    if (arg_type == tl::NODE_TYPE_VAR_TYPE) {
+      const tl::tl_tree_var_type *var_type = static_cast<const tl::tl_tree_var_type *>(a.type);
+      assert(a.flags & tl::FLAG_EXCL);
+      assert(var_type->var_num >= 0);
+      assert(!vars[var_type->var_num].is_type);
+      vars[var_type->var_num].is_type = true;
+      vars[var_type->var_num].function_arg_num = static_cast<int>(i);
+    }
+  }
+
+  std::string res;
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    if (!vars[i].is_type) {
+      assert(vars[i].parameter_num == -1);
+      assert(vars[i].function_arg_num == -1);
+      assert(vars[i].is_stored == false);
+      res += "  mutable " + gen_class_name("#") + " " + gen_var_name(vars[i]) + ";\n";
+    }
+  }
+  return res;
+}
+
+std::string TD_TL_writer_h::gen_flags_definitions(const tl::tl_combinator *t) const {
+  std::vector<std::pair<std::string, std::int32_t>> flags;
+
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    const tl::arg &a = t->args[i];
+
+    if (a.exist_var_num != -1) {
+      auto name = a.name;
+      for (auto &c : name) {
+        c = to_upper(c);
+      }
+      flags.push_back(std::make_pair(name, a.exist_var_bit));
+    }
+  }
+  std::string res;
+  if (!flags.empty()) {
+    res += "  enum Flags : std::int32_t {";
+    bool first = true;
+    for (auto &p : flags) {
+      if (first) {
+        first = false;
+      } else {
+        res += ", ";
+      }
+      res += p.first + "_MASK = " + int_to_string(1 << p.second);
+    }
+    res += "};\n";
+  }
+  return res;
+}
+
+std::string TD_TL_writer_h::gen_uni(const tl::tl_tree_type *result_type, std::vector<tl::var_description> &vars,
+                                    bool check_negative) const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_constructor_id_store(std::int32_t id, int storer_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_field_fetch(int field_num, const tl::arg &a, std::vector<tl::var_description> &vars,
+                                            bool flat, int parser_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_field_store(const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                                            int storer_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_type_fetch(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                                           const std::vector<tl::var_description> &vars, int parser_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_type_store(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                                           const std::vector<tl::var_description> &vars, int storer_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_var_type_fetch(const tl::arg &a) const {
+  assert(false);
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_forward_class_declaration(const std::string &class_name, bool is_proxy) const {
+  return "class " + class_name + ";\n\n";
+}
+
+std::string TD_TL_writer_h::gen_class_begin(const std::string &class_name, const std::string &base_class_name,
+                                            bool is_proxy) const {
+  return "class " + class_name + (!is_proxy ? " final " : "") + ": public " + base_class_name +
+         " {\n"
+         " public:\n";
+}
+
+std::string TD_TL_writer_h::gen_class_end() const {
+  return "};\n\n";
+}
+
+std::string TD_TL_writer_h::gen_class_alias(const std::string &class_name, const std::string &alias_name) const {
+  return "";
+  //  return "typedef " + class_name + " " + alias_name + ";\n\n\n";
+}
+
+std::string TD_TL_writer_h::gen_get_id(const std::string &class_name, std::int32_t id, bool is_proxy) const {
+  if (is_proxy) {
+    if (class_name == gen_base_tl_class_name()) {
+      return "\n  virtual std::int32_t get_id() const = 0;\n";
+    }
+
+    return "";
+  }
+
+  return "\n"
+         "  static const std::int32_t ID = " +
+         int_to_string(id) +
+         ";\n"
+         "  std::int32_t get_id() const final {\n"
+         "    return ID;\n"
+         "  }\n";
+}
+
+std::string TD_TL_writer_h::gen_function_result_type(const tl::tl_tree *result) const {
+  assert(result->get_type() == tl::NODE_TYPE_TYPE);
+  const tl::tl_tree_type *result_type = static_cast<const tl::tl_tree_type *>(result);
+  std::string fetched_type = gen_type_name(result_type);
+
+  if (!fetched_type.empty() && fetched_type[fetched_type.size() - 1] == ' ') {
+    fetched_type.pop_back();
+  }
+
+  return "\n"
+         "  using ReturnType = " +
+         fetched_type + ";\n";
+}
+
+std::string TD_TL_writer_h::gen_fetch_function_begin(const std::string &parser_name, const std::string &class_name,
+                                                     const std::string &parent_class_name, int arity,
+                                                     std::vector<tl::var_description> &vars, int parser_type) const {
+  std::string returned_type = "object_ptr<" + parent_class_name + "> ";
+
+  if (parser_type == 0) {
+    return "\n"
+           "  static " +
+           returned_type + "fetch(" + parser_name + " &p);\n\n" + "  explicit " + class_name + "(" + parser_name +
+           " &p);\n";
+  }
+
+  assert(arity == 0);
+  return "\n"
+         "  static " +
+         returned_type + "fetch(" + parser_name + " &p);\n";
+}
+
+std::string TD_TL_writer_h::gen_fetch_function_end(bool has_parent, int field_num,
+                                                   const std::vector<tl::var_description> &vars,
+                                                   int parser_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_fetch_function_result_begin(const std::string &parser_name,
+                                                            const std::string &class_name,
+                                                            const tl::tl_tree *result) const {
+  return "\n"
+         "  static ReturnType fetch_result(" +
+         parser_name + " &p);\n";
+}
+
+std::string TD_TL_writer_h::gen_fetch_function_result_end() const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_fetch_function_result_any_begin(const std::string &parser_name,
+                                                                const std::string &class_name, bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_fetch_function_result_any_end(bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_store_function_begin(const std::string &storer_name, const std::string &class_name,
+                                                     int arity, std::vector<tl::var_description> &vars,
+                                                     int storer_type) const {
+  assert(arity == 0);
+  if (storer_type == -1) {
+    return "";
+  }
+  return "\n"
+         "  void store(" +
+         storer_name + " &s" + std::string(storer_type == 0 ? "" : ", const char *field_name") + ") const final;\n";
+}
+
+std::string TD_TL_writer_h::gen_store_function_end(const std::vector<tl::var_description> &vars,
+                                                   int storer_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_fetch_switch_begin() const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_fetch_switch_case(const tl::tl_combinator *t, int arity) const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_fetch_switch_end() const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_constructor_begin(int fields_num, const std::string &class_name,
+                                                  bool is_default) const {
+  return "\n"
+         "  " +
+         std::string(fields_num == 1 ? "explicit " : "") + class_name + "(";
+}
+
+std::string TD_TL_writer_h::gen_constructor_field_init(int field_num, const std::string &class_name, const tl::arg &a,
+                                                       bool is_default) const {
+  return "";
+}
+
+std::string TD_TL_writer_h::gen_constructor_end(const tl::tl_combinator *t, int fields_num, bool is_default) const {
+  return ");\n";
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_h.h b/submodules/ton/tonlib-src/tl/generate/tl_writer_h.h
new file mode 100644
index 0000000000..70b24da7dd
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_h.h
@@ -0,0 +1,106 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "tl_writer_td.h"
+
+#include <cstdint>
+#include <string>
+#include <vector>
+
+namespace td {
+
+class TD_TL_writer_h : public TD_TL_writer {
+ protected:
+  const std::vector<std::string> ext_include;
+
+  static std::string forward_declaration(std::string type);
+
+ public:
+  TD_TL_writer_h(const std::string &tl_name, const std::string &string_type, const std::string &bytes_type,
+                 const std::string &secure_string_type, const std::string &secure_bytes_type,
+                 const std::vector<std::string> &ext_include)
+      : TD_TL_writer(tl_name, string_type, bytes_type, secure_string_type, secure_bytes_type)
+      , ext_include(ext_include) {
+  }
+
+  std::string gen_output_begin() const override;
+  std::string gen_output_end() const override;
+
+  std::string gen_forward_class_declaration(const std::string &class_name, bool is_proxy) const override;
+
+  std::string gen_class_begin(const std::string &class_name, const std::string &base_class_name,
+                              bool is_proxy) const override;
+  std::string gen_class_end() const override;
+
+  std::string gen_class_alias(const std::string &class_name, const std::string &alias_name) const override;
+
+  std::string gen_field_definition(const std::string &class_name, const std::string &type_name,
+                                   const std::string &field_name) const override;
+
+  std::string gen_flags_definitions(const tl::tl_combinator *t) const override;
+  std::string gen_vars(const tl::tl_combinator *t, const tl::tl_tree_type *result_type,
+                       std::vector<tl::var_description> &vars) const override;
+  std::string gen_function_vars(const tl::tl_combinator *t, std::vector<tl::var_description> &vars) const override;
+  std::string gen_uni(const tl::tl_tree_type *result_type, std::vector<tl::var_description> &vars,
+                      bool check_negative) const override;
+  std::string gen_constructor_id_store(std::int32_t id, int storer_type) const override;
+
+  std::string gen_field_fetch(int field_num, const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                              int parser_type) const override;
+  std::string gen_field_store(const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                              int storer_type) const override;
+  std::string gen_type_fetch(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                             const std::vector<tl::var_description> &vars, int parser_type) const override;
+  std::string gen_type_store(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                             const std::vector<tl::var_description> &vars, int storer_type) const override;
+  std::string gen_var_type_fetch(const tl::arg &a) const override;
+
+  std::string gen_get_id(const std::string &class_name, std::int32_t id, bool is_proxy) const override;
+
+  std::string gen_function_result_type(const tl::tl_tree *result) const override;
+
+  std::string gen_fetch_function_begin(const std::string &parser_name, const std::string &class_name,
+                                       const std::string &parent_class_name, int arity,
+                                       std::vector<tl::var_description> &vars, int parser_type) const override;
+  std::string gen_fetch_function_end(bool has_parent, int field_num, const std::vector<tl::var_description> &vars,
+                                     int parser_type) const override;
+
+  std::string gen_fetch_function_result_begin(const std::string &parser_name, const std::string &class_name,
+                                              const tl::tl_tree *result) const override;
+  std::string gen_fetch_function_result_end() const override;
+  std::string gen_fetch_function_result_any_begin(const std::string &parser_name, const std::string &class_name,
+                                                  bool is_proxy) const override;
+  std::string gen_fetch_function_result_any_end(bool is_proxy) const override;
+
+  std::string gen_store_function_begin(const std::string &storer_name, const std::string &class_name, int arity,
+                                       std::vector<tl::var_description> &vars, int storer_type) const override;
+  std::string gen_store_function_end(const std::vector<tl::var_description> &vars, int storer_type) const override;
+
+  std::string gen_fetch_switch_begin() const override;
+  std::string gen_fetch_switch_case(const tl::tl_combinator *t, int arity) const override;
+  std::string gen_fetch_switch_end() const override;
+
+  std::string gen_constructor_begin(int fields_num, const std::string &class_name, bool is_default) const override;
+  std::string gen_constructor_field_init(int field_num, const std::string &class_name, const tl::arg &a,
+                                         bool is_default) const override;
+  std::string gen_constructor_end(const tl::tl_combinator *t, int fields_num, bool is_default) const override;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_hpp.cpp b/submodules/ton/tonlib-src/tl/generate/tl_writer_hpp.cpp
new file mode 100644
index 0000000000..d7fd15cc1c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_hpp.cpp
@@ -0,0 +1,267 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_writer_hpp.h"
+
+#include <cassert>
+
+namespace td {
+
+bool TD_TL_writer_hpp::is_documentation_generated() const {
+  return true;
+}
+
+int TD_TL_writer_hpp::get_additional_function_type(const std::string &additional_function_name) const {
+  assert(additional_function_name == "downcast_call");
+  return 2;
+}
+
+std::vector<std::string> TD_TL_writer_hpp::get_additional_functions() const {
+  std::vector<std::string> additional_functions;
+  additional_functions.push_back("downcast_call");
+  return additional_functions;
+}
+
+std::string TD_TL_writer_hpp::gen_base_type_class_name(int arity) const {
+  assert(arity == 0);
+  return "Object";
+}
+
+std::string TD_TL_writer_hpp::gen_base_tl_class_name() const {
+  return "BaseObject";
+}
+
+std::string TD_TL_writer_hpp::gen_output_begin() const {
+  return "#pragma once\n"
+         "\n"
+         "#include \"" +
+         tl_name +
+         ".h\"\n"
+         "\n"
+         "namespace ton {\n"
+         "namespace " +
+         tl_name + " {\n\n";
+}
+
+std::string TD_TL_writer_hpp::gen_output_end() const {
+  return "}  // namespace " + tl_name +
+         "\n"
+         "}  // namespace ton \n";
+}
+
+std::string TD_TL_writer_hpp::gen_field_definition(const std::string &class_name, const std::string &type_name,
+                                                   const std::string &field_name) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_vars(const tl::tl_combinator *t, const tl::tl_tree_type *result_type,
+                                       std::vector<tl::var_description> &vars) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_function_vars(const tl::tl_combinator *t,
+                                                std::vector<tl::var_description> &vars) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_uni(const tl::tl_tree_type *result_type, std::vector<tl::var_description> &vars,
+                                      bool check_negative) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_constructor_id_store(std::int32_t id, int storer_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_field_fetch(int field_num, const tl::arg &a, std::vector<tl::var_description> &vars,
+                                              bool flat, int parser_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_field_store(const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                                              int storer_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_type_fetch(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                                             const std::vector<tl::var_description> &vars, int parser_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_type_store(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                                             const std::vector<tl::var_description> &vars, int storer_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_var_type_fetch(const tl::arg &a) const {
+  assert(false);
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_forward_class_declaration(const std::string &class_name, bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_class_begin(const std::string &class_name, const std::string &base_class_name,
+                                              bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_class_end() const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_class_alias(const std::string &class_name, const std::string &alias_name) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_get_id(const std::string &class_name, std::int32_t id, bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_function_result_type(const tl::tl_tree *result) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_fetch_function_begin(const std::string &parser_name, const std::string &class_name,
+                                                       const std::string &parent_class_name, int arity,
+                                                       std::vector<tl::var_description> &vars, int parser_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_fetch_function_end(bool has_parent, int field_num,
+                                                     const std::vector<tl::var_description> &vars,
+                                                     int parser_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_fetch_function_result_begin(const std::string &parser_name,
+                                                              const std::string &class_name,
+                                                              const tl::tl_tree *result) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_fetch_function_result_end() const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_fetch_function_result_any_begin(const std::string &parser_name,
+                                                                  const std::string &class_name, bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_fetch_function_result_any_end(bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_store_function_begin(const std::string &storer_name, const std::string &class_name,
+                                                       int arity, std::vector<tl::var_description> &vars,
+                                                       int storer_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_store_function_end(const std::vector<tl::var_description> &vars,
+                                                     int storer_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_fetch_switch_begin() const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_fetch_switch_case(const tl::tl_combinator *t, int arity) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_fetch_switch_end() const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_additional_function(const std::string &function_name, const tl::tl_combinator *t,
+                                                      bool is_function) const {
+  assert(function_name == "downcast_call");
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_additional_proxy_function_begin(const std::string &function_name,
+                                                                  const tl::tl_type *type,
+                                                                  const std::string &class_name, int arity,
+                                                                  bool is_function) const {
+  assert(function_name == "downcast_call");
+  return "/**\n"
+         " * Calls specified function object with the specified object downcasted to the most-derived type.\n"
+         " * \\param[in] obj Object to pass as an argument to the function object.\n"
+         " * \\param[in] func Function object to which the object will be passed.\n"
+         " * \\returns whether function object call has happened. Should always return true for correct parameters.\n"
+         " */\n"
+         "template <class T>\n"
+         "bool downcast_call(" +
+         class_name +
+         " &obj, const T &func) {\n"
+         "  switch (obj.get_id()) {\n";
+}
+
+std::string TD_TL_writer_hpp::gen_additional_proxy_function_case(const std::string &function_name,
+                                                                 const tl::tl_type *type, const std::string &class_name,
+                                                                 int arity) const {
+  assert(function_name == "downcast_call");
+  assert(false);
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_additional_proxy_function_case(const std::string &function_name,
+                                                                 const tl::tl_type *type, const tl::tl_combinator *t,
+                                                                 int arity, bool is_function) const {
+  assert(function_name == "downcast_call");
+  return "    case " + gen_class_name(t->name) +
+         "::ID:\n"
+         "      func(static_cast<" +
+         gen_class_name(t->name) +
+         " &>(obj));\n"
+         "      return true;\n";
+}
+
+std::string TD_TL_writer_hpp::gen_additional_proxy_function_end(const std::string &function_name,
+                                                                const tl::tl_type *type, bool is_function) const {
+  assert(function_name == "downcast_call");
+  return "    default:\n"
+         "      return false;\n"
+         "  }\n"
+         "}\n\n";
+}
+
+std::string TD_TL_writer_hpp::gen_constructor_begin(int fields_num, const std::string &class_name,
+                                                    bool is_default) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_constructor_parameter(int field_num, const std::string &class_name, const tl::arg &a,
+                                                        bool is_default) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_constructor_field_init(int field_num, const std::string &class_name, const tl::arg &a,
+                                                         bool is_default) const {
+  return "";
+}
+
+std::string TD_TL_writer_hpp::gen_constructor_end(const tl::tl_combinator *t, int fields_num, bool is_default) const {
+  return "";
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_hpp.h b/submodules/ton/tonlib-src/tl/generate/tl_writer_hpp.h
new file mode 100644
index 0000000000..4c435fdee9
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_hpp.h
@@ -0,0 +1,121 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "tl_writer_td.h"
+
+#include <cstdint>
+#include <string>
+#include <vector>
+
+namespace td {
+
+class TD_TL_writer_hpp : public TD_TL_writer {
+ public:
+  TD_TL_writer_hpp(const std::string &tl_name, const std::string &string_type, const std::string &bytes_type,
+                   const std::string &secure_string_type, const std::string &secure_bytes_type)
+      : TD_TL_writer(tl_name, string_type, bytes_type, secure_string_type, secure_bytes_type) {
+  }
+
+  bool is_documentation_generated() const override;
+
+  int get_additional_function_type(const std::string &additional_function_name) const override;
+  std::vector<std::string> get_additional_functions() const override;
+
+  std::string gen_base_type_class_name(int arity) const override;
+  std::string gen_base_tl_class_name() const override;
+
+  std::string gen_output_begin() const override;
+  std::string gen_output_end() const override;
+
+  std::string gen_forward_class_declaration(const std::string &class_name, bool is_proxy) const override;
+
+  std::string gen_class_begin(const std::string &class_name, const std::string &base_class_name,
+                              bool is_proxy) const override;
+  std::string gen_class_end() const override;
+
+  std::string gen_class_alias(const std::string &class_name, const std::string &alias_name) const override;
+
+  std::string gen_field_definition(const std::string &class_name, const std::string &type_name,
+                                   const std::string &field_name) const override;
+
+  std::string gen_vars(const tl::tl_combinator *t, const tl::tl_tree_type *result_type,
+                       std::vector<tl::var_description> &vars) const override;
+  std::string gen_function_vars(const tl::tl_combinator *t, std::vector<tl::var_description> &vars) const override;
+  std::string gen_uni(const tl::tl_tree_type *result_type, std::vector<tl::var_description> &vars,
+                      bool check_negative) const override;
+  std::string gen_constructor_id_store(std::int32_t id, int storer_type) const override;
+
+  std::string gen_field_fetch(int field_num, const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                              int parser_type) const override;
+  std::string gen_field_store(const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                              int storer_type) const override;
+  std::string gen_type_fetch(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                             const std::vector<tl::var_description> &vars, int parser_type) const override;
+  std::string gen_type_store(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                             const std::vector<tl::var_description> &vars, int storer_type) const override;
+  std::string gen_var_type_fetch(const tl::arg &a) const override;
+
+  std::string gen_get_id(const std::string &class_name, std::int32_t id, bool is_proxy) const override;
+
+  std::string gen_function_result_type(const tl::tl_tree *result) const override;
+
+  std::string gen_fetch_function_begin(const std::string &parser_name, const std::string &class_name,
+                                       const std::string &parent_class_name, int arity,
+                                       std::vector<tl::var_description> &vars, int parser_type) const override;
+  std::string gen_fetch_function_end(bool has_parent, int field_num, const std::vector<tl::var_description> &vars,
+                                     int parser_type) const override;
+
+  std::string gen_fetch_function_result_begin(const std::string &parser_name, const std::string &class_name,
+                                              const tl::tl_tree *result) const override;
+  std::string gen_fetch_function_result_end() const override;
+  std::string gen_fetch_function_result_any_begin(const std::string &parser_name, const std::string &class_name,
+                                                  bool is_proxy) const override;
+  std::string gen_fetch_function_result_any_end(bool is_proxy) const override;
+
+  std::string gen_store_function_begin(const std::string &storer_name, const std::string &class_name, int arity,
+                                       std::vector<tl::var_description> &vars, int storer_type) const override;
+  std::string gen_store_function_end(const std::vector<tl::var_description> &vars, int storer_type) const override;
+
+  std::string gen_fetch_switch_begin() const override;
+  std::string gen_fetch_switch_case(const tl::tl_combinator *t, int arity) const override;
+  std::string gen_fetch_switch_end() const override;
+
+  std::string gen_constructor_begin(int fields_num, const std::string &class_name, bool is_default) const override;
+  std::string gen_constructor_parameter(int field_num, const std::string &class_name, const tl::arg &a,
+                                        bool is_default) const override;
+  std::string gen_constructor_field_init(int field_num, const std::string &class_name, const tl::arg &a,
+                                         bool is_default) const override;
+  std::string gen_constructor_end(const tl::tl_combinator *t, int fields_num, bool is_default) const override;
+
+  std::string gen_additional_function(const std::string &function_name, const tl::tl_combinator *t,
+                                      bool is_function) const override;
+  std::string gen_additional_proxy_function_begin(const std::string &function_name, const tl::tl_type *type,
+                                                  const std::string &class_name, int arity,
+                                                  bool is_function) const override;
+  std::string gen_additional_proxy_function_case(const std::string &function_name, const tl::tl_type *type,
+                                                 const std::string &class_name, int arity) const override;
+  std::string gen_additional_proxy_function_case(const std::string &function_name, const tl::tl_type *type,
+                                                 const tl::tl_combinator *t, int arity,
+                                                 bool is_function) const override;
+  std::string gen_additional_proxy_function_end(const std::string &function_name, const tl::tl_type *type,
+                                                bool is_function) const override;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_java.cpp b/submodules/ton/tonlib-src/tl/generate/tl_writer_java.cpp
new file mode 100644
index 0000000000..2c7649cc02
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_java.cpp
@@ -0,0 +1,465 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_writer_java.h"
+
+#include <cassert>
+
+namespace td {
+
+const int TD_TL_writer_java::MAX_ARITY;
+
+const std::string TD_TL_writer_java::base_type_class_names[MAX_ARITY + 1] = {"Object"};
+const std::string TD_TL_writer_java::base_tl_class_name = "Object";
+const std::string TD_TL_writer_java::base_function_class_name = "Function";
+
+int TD_TL_writer_java::get_max_arity() const {
+  return MAX_ARITY;
+}
+
+bool TD_TL_writer_java::is_built_in_simple_type(const std::string &name) const {
+  return name == "Bool" || name == "Int32" || name == "Int53" || name == "Int64" || name == "Double" ||
+         name == "String" || name == "Bytes" || name == "SecureString" || name == "SecureBytes";
+}
+
+bool TD_TL_writer_java::is_built_in_complex_type(const std::string &name) const {
+  return name == "Vector";
+}
+
+bool TD_TL_writer_java::is_type_bare(const tl::tl_type *t) const {
+  return t->simple_constructors == 1 || (is_built_in_simple_type(t->name) && t->name != "Bool") ||
+         is_built_in_complex_type(t->name);
+}
+
+bool TD_TL_writer_java::is_combinator_supported(const tl::tl_combinator *constructor) const {
+  if (!TL_writer::is_combinator_supported(constructor)) {
+    return false;
+  }
+
+  for (std::size_t i = 0; i < constructor->args.size(); i++) {
+    if (constructor->args[i].type->get_type() == tl::NODE_TYPE_VAR_TYPE) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+int TD_TL_writer_java::get_parser_type(const tl::tl_combinator *t, const std::string &parser_name) const {
+  return 0;
+}
+
+int TD_TL_writer_java::get_storer_type(const tl::tl_combinator *t, const std::string &storer_name) const {
+  return 0;
+}
+
+std::vector<std::string> TD_TL_writer_java::get_parsers() const {
+  std::vector<std::string> parsers;
+  parsers.push_back("<inlined>");
+  return parsers;
+}
+
+std::vector<std::string> TD_TL_writer_java::get_storers() const {
+  return std::vector<std::string>();
+}
+
+std::string TD_TL_writer_java::gen_base_tl_class_name() const {
+  return base_tl_class_name;
+}
+
+std::string TD_TL_writer_java::gen_base_type_class_name(int arity) const {
+  assert(arity == 0);
+  return base_type_class_names[arity];
+}
+
+std::string TD_TL_writer_java::gen_base_function_class_name() const {
+  return base_function_class_name;
+}
+
+std::string TD_TL_writer_java::gen_class_name(std::string name) const {
+  if (name == "Object" || name == "#") {
+    assert(false);
+  }
+  bool next_to_upper = true;
+  std::string result;
+  for (std::size_t i = 0; i < name.size(); i++) {
+    if (!is_alnum(name[i])) {
+      next_to_upper = true;
+      continue;
+    }
+    if (next_to_upper) {
+      result += to_upper(name[i]);
+      next_to_upper = false;
+    } else {
+      result += name[i];
+    }
+  }
+  return result;
+}
+
+std::string TD_TL_writer_java::gen_field_name(std::string name) const {
+  assert(name.size() > 0);
+  assert(is_alnum(name.back()));
+
+  bool next_to_upper = false;
+  std::string result;
+  for (std::size_t i = 0; i < name.size(); i++) {
+    if (!is_alnum(name[i])) {
+      next_to_upper = true;
+      continue;
+    }
+    if (next_to_upper) {
+      result += to_upper(name[i]);
+      next_to_upper = false;
+    } else {
+      result += name[i];
+    }
+  }
+  return result;
+}
+
+std::string TD_TL_writer_java::gen_var_name(const tl::var_description &desc) const {
+  assert(false);
+  return std::string();
+}
+
+std::string TD_TL_writer_java::gen_parameter_name(int index) const {
+  assert(false);
+  return std::string();
+}
+
+std::string TD_TL_writer_java::gen_type_name(const tl::tl_tree_type *tree_type) const {
+  const tl::tl_type *t = tree_type->type;
+  const std::string &name = t->name;
+
+  if (name == "#") {
+    assert(false);
+  }
+  if (name == "Bool") {
+    return "boolean";
+  }
+  if (name == "Int32") {
+    return "int";
+  }
+  if (name == "Int53" || name == "Int64") {
+    return "long";
+  }
+  if (name == "Double") {
+    return "double";
+  }
+  if (name == "String" || name == "SecureString") {
+    return "String";
+  }
+  if (name == "Bytes" || name == "SecureBytes") {
+    return "byte[]";
+  }
+
+  if (name == "Vector") {
+    assert(t->arity == 1);
+    assert(tree_type->children.size() == 1);
+    assert(tree_type->children[0]->get_type() == tl::NODE_TYPE_TYPE);
+    const tl::tl_tree_type *child = static_cast<const tl::tl_tree_type *>(tree_type->children[0]);
+
+    return gen_type_name(child) + "[]";
+  }
+
+  assert(!is_built_in_simple_type(name) && !is_built_in_complex_type(name));
+
+  for (std::size_t i = 0; i < tree_type->children.size(); i++) {
+    assert(tree_type->children[i]->get_type() == tl::NODE_TYPE_NAT_CONST);
+  }
+
+  return gen_main_class_name(t);
+}
+
+std::string TD_TL_writer_java::gen_array_type_name(const tl::tl_tree_array *arr, const std::string &field_name) const {
+  assert(false);
+  return std::string();
+}
+
+std::string TD_TL_writer_java::gen_var_type_name() const {
+  return gen_base_function_class_name();
+}
+
+std::string TD_TL_writer_java::gen_int_const(const tl::tl_tree *tree_c,
+                                             const std::vector<tl::var_description> &vars) const {
+  assert(false);
+  return std::string();
+}
+
+std::string TD_TL_writer_java::gen_output_begin() const {
+  return "package " + package_name +
+         ";\n\n"
+         "public class " +
+         tl_name + " {\n";
+}
+
+std::string TD_TL_writer_java::gen_output_end() const {
+  return "}\n";
+}
+
+std::string TD_TL_writer_java::gen_forward_class_declaration(const std::string &class_name, bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_class_begin(const std::string &class_name, const std::string &base_class_name,
+                                               bool is_proxy) const {
+  std::string full_class_name = "static class " + class_name;
+  if (class_name != gen_base_tl_class_name()) {
+    full_class_name += " extends " + base_class_name;
+  }
+  std::string result = "    public " + std::string(is_proxy ? "abstract " : "") + full_class_name + " {\n";
+  if (class_name == gen_base_tl_class_name() || class_name == gen_base_function_class_name()) {
+    result += "        public native String toString();\n";
+  }
+
+  return result;
+}
+
+std::string TD_TL_writer_java::gen_class_end() const {
+  return "    }\n\n";
+}
+
+std::string TD_TL_writer_java::gen_class_alias(const std::string &class_name, const std::string &alias_name) const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_field_definition(const std::string &class_name, const std::string &type_name,
+                                                    const std::string &field_name) const {
+  return "        public " + type_name + " " + field_name + ";\n";
+}
+
+std::string TD_TL_writer_java::gen_vars(const tl::tl_combinator *t, const tl::tl_tree_type *result_type,
+                                        std::vector<tl::var_description> &vars) const {
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    vars[i].index = static_cast<int>(i);
+    vars[i].is_stored = false;
+    vars[i].is_type = false;
+    vars[i].parameter_num = -1;
+    vars[i].function_arg_num = -1;
+  }
+
+  if (result_type != nullptr) {
+    assert(result_type->children.empty());
+  }
+
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    assert(t->args[i].type->get_type() != tl::NODE_TYPE_VAR_TYPE);
+  }
+
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    assert(vars[i].is_type);
+  }
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_function_vars(const tl::tl_combinator *t,
+                                                 std::vector<tl::var_description> &vars) const {
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    vars[i].index = static_cast<int>(i);
+    vars[i].is_stored = false;
+    vars[i].is_type = false;
+    vars[i].parameter_num = -1;
+    vars[i].function_arg_num = -1;
+  }
+
+  for (std::size_t i = 0; i < t->args.size(); i++) {
+    assert(t->args[i].type->get_type() != tl::NODE_TYPE_VAR_TYPE);
+  }
+
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    assert(vars[i].is_type);
+  }
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_uni(const tl::tl_tree_type *result_type, std::vector<tl::var_description> &vars,
+                                       bool check_negative) const {
+  assert(result_type->children.empty());
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_constructor_id_store(std::int32_t id, int storer_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_field_fetch(int field_num, const tl::arg &a, std::vector<tl::var_description> &vars,
+                                               bool flat, int parser_type) const {
+  assert(parser_type >= 0);
+
+  assert(a.exist_var_num == -1);
+  assert(a.type->get_type() != tl::NODE_TYPE_VAR_TYPE);
+
+  assert(!(a.flags & tl::FLAG_EXCL));
+  assert(!(a.flags & tl::FLAG_OPT_VAR));
+
+  if (flat) {
+    //    TODO
+    //    return gen_field_fetch(const tl::arg &a, std::vector<tl::var_description> &vars, int num, bool flat);
+  }
+
+  assert(a.var_num == -1);
+  assert(a.type->get_type() == tl::NODE_TYPE_TYPE);
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_field_store(const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                                               int storer_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_type_fetch(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                                              const std::vector<tl::var_description> &vars, int parser_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_type_store(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                                              const std::vector<tl::var_description> &vars, int storer_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_var_type_fetch(const tl::arg &a) const {
+  assert(false);
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_get_id(const std::string &class_name, std::int32_t id, bool is_proxy) const {
+  if (is_proxy) {
+    return class_name == gen_base_tl_class_name() ? "\n        public abstract int getConstructor();\n" : "";
+  }
+
+  return "\n"
+         "        public static final int CONSTRUCTOR = " +
+         int_to_string(id) +
+         ";\n\n"
+         "        @Override\n"
+         "        public int getConstructor() {\n"
+         "            return CONSTRUCTOR;\n"
+         "        }\n";
+}
+
+std::string TD_TL_writer_java::gen_function_result_type(const tl::tl_tree *result) const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_fetch_function_begin(const std::string &parser_name, const std::string &class_name,
+                                                        const std::string &parent_class_name, int arity,
+                                                        std::vector<tl::var_description> &vars, int parser_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_fetch_function_end(bool has_parent, int field_num,
+                                                      const std::vector<tl::var_description> &vars,
+                                                      int parser_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_fetch_function_result_begin(const std::string &parser_name,
+                                                               const std::string &class_name,
+                                                               const tl::tl_tree *result) const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_fetch_function_result_end() const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_fetch_function_result_any_begin(const std::string &parser_name,
+                                                                   const std::string &class_name, bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_fetch_function_result_any_end(bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_store_function_begin(const std::string &storer_name, const std::string &class_name,
+                                                        int arity, std::vector<tl::var_description> &vars,
+                                                        int storer_type) const {
+  assert(false);
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_store_function_end(const std::vector<tl::var_description> &vars,
+                                                      int storer_type) const {
+  assert(false);
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_fetch_switch_begin() const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_fetch_switch_case(const tl::tl_combinator *t, int arity) const {
+  assert(arity == 0);
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_fetch_switch_end() const {
+  return "";
+}
+
+std::string TD_TL_writer_java::gen_constructor_begin(int fields_num, const std::string &class_name,
+                                                     bool is_default) const {
+  return "\n"
+         "        public " +
+         class_name + "(";
+}
+
+std::string TD_TL_writer_java::gen_constructor_parameter(int field_num, const std::string &class_name, const tl::arg &a,
+                                                         bool is_default) const {
+  if (is_default) {
+    return "";
+  }
+
+  std::string field_type = gen_field_type(a);
+  if (field_type.empty()) {
+    return "";
+  }
+
+  if (field_type[field_type.size() - 1] != ' ') {
+    field_type += ' ';
+  }
+
+  return (field_num == 0 ? "" : ", ") + field_type + gen_field_name(a.name);
+}
+
+std::string TD_TL_writer_java::gen_constructor_field_init(int field_num, const std::string &class_name,
+                                                          const tl::arg &a, bool is_default) const {
+  std::string field_type = gen_field_type(a);
+  if (field_type.empty()) {
+    return "";
+  }
+
+  if (is_default) {
+    return (field_num == 0 ? ") {\n" : "");
+  }
+
+  return std::string(field_num == 0 ? ") {\n" : "") + "            this." + gen_field_name(a.name) + " = " +
+         gen_field_name(a.name) + ";\n";
+}
+
+std::string TD_TL_writer_java::gen_constructor_end(const tl::tl_combinator *t, int fields_num, bool is_default) const {
+  if (fields_num == 0) {
+    return ") {\n"
+           "        }\n";
+  }
+  return "        }\n";
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_java.h b/submodules/ton/tonlib-src/tl/generate/tl_writer_java.h
new file mode 100644
index 0000000000..ea58412e94
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_java.h
@@ -0,0 +1,131 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/tl/tl_writer.h"
+
+#include <cstdint>
+#include <string>
+#include <vector>
+
+namespace td {
+
+class TD_TL_writer_java : public tl::TL_writer {
+  static const int MAX_ARITY = 0;
+
+  static const std::string base_type_class_names[MAX_ARITY + 1];
+  static const std::string base_tl_class_name;
+  static const std::string base_function_class_name;
+
+  const std::string package_name;
+
+ public:
+  TD_TL_writer_java(const std::string &tl_name, const std::string &package_name)
+      : TL_writer(tl_name), package_name(package_name) {
+  }
+
+  int get_max_arity() const override;
+
+  bool is_built_in_simple_type(const std::string &name) const override;
+  bool is_built_in_complex_type(const std::string &name) const override;
+  bool is_type_bare(const tl::tl_type *t) const override;
+  bool is_combinator_supported(const tl::tl_combinator *constructor) const override;
+
+  int get_parser_type(const tl::tl_combinator *t, const std::string &parser_name) const override;
+  int get_storer_type(const tl::tl_combinator *t, const std::string &storer_name) const override;
+  std::vector<std::string> get_parsers() const override;
+  std::vector<std::string> get_storers() const override;
+
+  std::string gen_base_tl_class_name() const override;
+  std::string gen_base_type_class_name(int arity) const override;
+  std::string gen_base_function_class_name() const override;
+  std::string gen_class_name(std::string name) const override;
+  std::string gen_field_name(std::string name) const override;
+  std::string gen_var_name(const tl::var_description &desc) const override;
+  std::string gen_parameter_name(int index) const override;
+  std::string gen_type_name(const tl::tl_tree_type *tree_type) const override;
+  std::string gen_array_type_name(const tl::tl_tree_array *arr, const std::string &field_name) const override;
+  std::string gen_var_type_name() const override;
+
+  std::string gen_int_const(const tl::tl_tree *tree_c, const std::vector<tl::var_description> &vars) const override;
+
+  std::string gen_output_begin() const override;
+  std::string gen_output_end() const override;
+
+  std::string gen_forward_class_declaration(const std::string &class_name, bool is_proxy) const override;
+
+  std::string gen_class_begin(const std::string &class_name, const std::string &base_class_name,
+                              bool is_proxy) const override;
+  std::string gen_class_end() const override;
+
+  std::string gen_class_alias(const std::string &class_name, const std::string &alias_name) const override;
+
+  std::string gen_field_definition(const std::string &class_name, const std::string &type_name,
+                                   const std::string &field_name) const override;
+
+  std::string gen_vars(const tl::tl_combinator *t, const tl::tl_tree_type *result_type,
+                       std::vector<tl::var_description> &vars) const override;
+  std::string gen_function_vars(const tl::tl_combinator *t, std::vector<tl::var_description> &vars) const override;
+  std::string gen_uni(const tl::tl_tree_type *result_type, std::vector<tl::var_description> &vars,
+                      bool check_negative) const override;
+  std::string gen_constructor_id_store(std::int32_t id, int storer_type) const override;
+  std::string gen_field_fetch(int field_num, const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                              int parser_type) const override;
+  std::string gen_field_store(const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                              int storer_type) const override;
+  std::string gen_type_fetch(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                             const std::vector<tl::var_description> &vars, int parser_type) const override;
+  std::string gen_type_store(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                             const std::vector<tl::var_description> &vars, int storer_type) const override;
+  std::string gen_var_type_fetch(const tl::arg &a) const override;
+
+  std::string gen_get_id(const std::string &class_name, std::int32_t id, bool is_proxy) const override;
+
+  std::string gen_function_result_type(const tl::tl_tree *result) const override;
+
+  std::string gen_fetch_function_begin(const std::string &parser_name, const std::string &class_name,
+                                       const std::string &parent_class_name, int arity,
+                                       std::vector<tl::var_description> &vars, int parser_type) const override;
+  std::string gen_fetch_function_end(bool has_parent, int field_num, const std::vector<tl::var_description> &vars,
+                                     int parser_type) const override;
+
+  std::string gen_fetch_function_result_begin(const std::string &parser_name, const std::string &class_name,
+                                              const tl::tl_tree *result) const override;
+  std::string gen_fetch_function_result_end() const override;
+  std::string gen_fetch_function_result_any_begin(const std::string &parser_name, const std::string &class_name,
+                                                  bool is_proxy) const override;
+  std::string gen_fetch_function_result_any_end(bool is_proxy) const override;
+
+  std::string gen_store_function_begin(const std::string &storer_name, const std::string &class_name, int arity,
+                                       std::vector<tl::var_description> &vars, int storer_type) const override;
+  std::string gen_store_function_end(const std::vector<tl::var_description> &vars, int storer_type) const override;
+
+  std::string gen_fetch_switch_begin() const override;
+  std::string gen_fetch_switch_case(const tl::tl_combinator *t, int arity) const override;
+  std::string gen_fetch_switch_end() const override;
+
+  std::string gen_constructor_begin(int fields_num, const std::string &class_name, bool is_default) const override;
+  std::string gen_constructor_parameter(int field_num, const std::string &class_name, const tl::arg &a,
+                                        bool is_default) const override;
+  std::string gen_constructor_field_init(int field_num, const std::string &class_name, const tl::arg &a,
+                                         bool is_default) const override;
+  std::string gen_constructor_end(const tl::tl_combinator *t, int fields_num, bool is_default) const override;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_jni_cpp.cpp b/submodules/ton/tonlib-src/tl/generate/tl_writer_jni_cpp.cpp
new file mode 100644
index 0000000000..328ea0b463
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_jni_cpp.cpp
@@ -0,0 +1,676 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_writer_jni_cpp.h"
+
+#include <cassert>
+#include <cstdio>
+
+namespace td {
+
+bool TD_TL_writer_jni_cpp::is_built_in_simple_type(const std::string &name) const {
+  return name == "Bool" || name == "Int32" || name == "Int53" || name == "Int64" || name == "Double" ||
+         name == "String" || name == "Bytes" || name == "SecureString" || name == "SecureBytes";
+}
+
+bool TD_TL_writer_jni_cpp::is_built_in_complex_type(const std::string &name) const {
+  return name == "Vector";
+}
+
+int TD_TL_writer_jni_cpp::get_parser_type(const tl::tl_combinator *t, const std::string &parser_name) const {
+  return 1;
+}
+
+int TD_TL_writer_jni_cpp::get_additional_function_type(const std::string &additional_function_name) const {
+  return 1;
+}
+
+std::vector<std::string> TD_TL_writer_jni_cpp::get_parsers() const {
+  std::vector<std::string> parsers;
+  parsers.push_back("JNIEnv *env, jobject");
+  return parsers;
+}
+
+std::vector<std::string> TD_TL_writer_jni_cpp::get_storers() const {
+  std::vector<std::string> storers;
+  storers.push_back("JNIEnv *env, jobject");
+  storers.push_back("td::TlStorerToString");
+  return storers;
+}
+
+std::vector<std::string> TD_TL_writer_jni_cpp::get_additional_functions() const {
+  std::vector<std::string> additional_functions;
+  additional_functions.push_back("init_jni_vars");
+  return additional_functions;
+}
+
+std::string TD_TL_writer_jni_cpp::gen_base_type_class_name(int arity) const {
+  assert(arity == 0);
+  return "Object";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_base_tl_class_name() const {
+  return "Object";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_class_begin(const std::string &class_name, const std::string &base_class_name,
+                                                  bool is_proxy) const {
+  return "\n"
+         "jclass " +
+         class_name + "::Class;\n";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_field_definition(const std::string &class_name, const std::string &type_name,
+                                                       const std::string &field_name) const {
+  return "jfieldID " + class_name + "::" + field_name + "fieldID;\n";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_constructor_id_store(std::int32_t id, int storer_type) const {
+  return "";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_vector_fetch(std::string field_name, const tl::tl_tree_type *t,
+                                                   const std::vector<tl::var_description> &vars,
+                                                   int parser_type) const {
+  std::string vector_type = gen_type_name(t);
+
+  if (vector_type == "bool") {
+    assert(false);  // TODO
+  }
+
+  std::string fetch_object = "td::jni::fetch_object(env, p, " + field_name + "fieldID)";
+  std::string array_type;
+  if (vector_type == "std::int32_t") {
+    array_type = "jintArray";
+  }
+  if (vector_type == "std::int64_t") {
+    array_type = "jlongArray";
+  }
+  if (vector_type == "double") {
+    array_type = "jdoubleArray";
+  }
+
+  if (!array_type.empty()) {
+    return "td::jni::fetch_vector(env, (" + array_type + ")" + fetch_object + ");";
+  }
+
+  std::string template_type;
+  if (vector_type == string_type) {
+    template_type = "std::string";
+  } else if (vector_type == secure_string_type) {
+    template_type = secure_string_type;
+  } else if (vector_type.compare(0, 11, "std::vector") == 0) {
+    const tl::tl_tree_type *child = static_cast<const tl::tl_tree_type *>(t->children[0]);
+    template_type = gen_type_name(child);
+    if (template_type.compare(0, 10, "object_ptr") == 0) {
+      template_type = gen_main_class_name(child->type);
+    }
+    template_type = "std::vector<" + template_type + ">";
+  } else if (vector_type == bytes_type) {
+    std::fprintf(stderr, "Vector of Bytes is not supported\n");
+    assert(false);
+  } else {
+    assert(vector_type.compare(0, 10, "object_ptr") == 0);
+    template_type = gen_main_class_name(t->type);
+  }
+  return "td::jni::FetchVector<" + template_type + ">::fetch(env, (jobjectArray)" + fetch_object + ");";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_type_fetch(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                                                 const std::vector<tl::var_description> &vars, int parser_type) const {
+  const tl::tl_type *t = tree_type->type;
+  const std::string &name = t->name;
+
+  assert(!(t->flags & tl::FLAG_DEFAULT_CONSTRUCTOR));
+  assert(parser_type == 1);
+
+  if (!(tree_type->flags & tl::FLAG_BARE)) {
+    if (is_type_bare(t)) {
+      if (field_name != "") {
+        std::fprintf(stderr, "Do not use non-bare fields with bare type %s\n", name.c_str());
+        //        assert(false);
+      }
+    }
+  } else {
+    assert(is_type_bare(t));
+  }
+
+  std::string res_begin;
+  if (!field_name.empty()) {
+    res_begin = field_name + " = ";
+  }
+
+  std::string res;
+  assert(name != "#");
+  if (field_name.empty()) {
+    if (name == "Bool") {
+      return "env->CallObjectMethod(p, td::jni::BooleanGetValueMethodID)";
+    } else if (name == "Int32") {
+      return "env->CallObjectMethod(p, td::jni::IntegerGetValueMethodID)";
+    } else if (name == "Int53" || name == "Int64") {
+      return "env->CallObjectMethod(p, td::jni::LongGetValueMethodID)";
+    } else if (name == "Double") {
+      return "env->CallObjectMethod(p, td::jni::DoubleGetValueMethodID)";
+    } else if (name == "String") {
+      return "td::jni::from_jstring(env, (jstring)p)";
+    } else if (name == "Bytes") {
+      return "td::jni::from_bytes(env, (jbyteArray)p)";
+    } else if (name == "SecureString") {
+      return "td::jni::from_jstring_secure(env, (jstring)p)";
+    } else if (name == "SecureBytes") {
+      return "td::jni::from_bytes_secure(env, (jbyteArray)p)";
+    }
+  }
+
+  if (name == "Bool") {
+    res = "(env->GetBooleanField(p, " + field_name + "fieldID) != 0)";
+  } else if (name == "Int32") {
+    res = "env->GetIntField(p, " + field_name + "fieldID)";
+  } else if (name == "Int53" || name == "Int64") {
+    res = "env->GetLongField(p, " + field_name + "fieldID)";
+  } else if (name == "Double") {
+    res = "env->GetDoubleField(p, " + field_name + "fieldID)";
+  } else if (name == "String") {
+    res = "td::jni::fetch_string(env, p, " + field_name + "fieldID)";
+  } else if (name == "Bytes") {
+    res = "td::jni::from_bytes(env, (jbyteArray)td::jni::fetch_object(env, p, " + field_name + "fieldID))";
+  } else if (name == "SecureString") {
+    res = "td::jni::fetch_string_secure(env, p, " + field_name + "fieldID)";
+  } else if (name == "SecureBytes") {
+    res = "td::jni::from_bytes_secure(env, (jbyteArray)td::jni::fetch_object(env, p, " + field_name + "fieldID))";
+  } else if (name == "Vector") {
+    const tl::tl_tree_type *child = static_cast<const tl::tl_tree_type *>(tree_type->children[0]);
+    res = gen_vector_fetch(field_name, child, vars, parser_type);
+  } else {
+    if (field_name == "") {
+      return gen_main_class_name(tree_type->type) + "::fetch(env, p)";
+    }
+    res = "td::jni::fetch_tl_object<" + gen_main_class_name(tree_type->type) + ">(env, td::jni::fetch_object(env, p, " +
+          field_name + "fieldID));";
+  }
+  return res_begin + res;
+}
+
+std::string TD_TL_writer_jni_cpp::gen_field_fetch(int field_num, const tl::arg &a,
+                                                  std::vector<tl::var_description> &vars, bool flat,
+                                                  int parser_type) const {
+  assert(parser_type >= 0);
+  std::string field_name = (parser_type == 0 ? (field_num == 0 ? ": " : ", ") : "res->") + gen_field_name(a.name);
+
+  assert(a.exist_var_num == -1);
+  if (a.type->get_type() == tl::NODE_TYPE_VAR_TYPE) {
+    assert(parser_type == 1);
+
+    const tl::tl_tree_var_type *t = static_cast<const tl::tl_tree_var_type *>(a.type);
+    assert(a.flags == tl::FLAG_EXCL);
+
+    assert(a.var_num == -1);
+
+    assert(t->var_num >= 0);
+    assert(vars[t->var_num].is_type);
+    assert(!vars[t->var_num].is_stored);
+    vars[t->var_num].is_stored = true;
+
+    assert(false && "not supported");
+    return "  " + field_name + " = " + gen_base_function_class_name() + "::fetch(env, p);\n";
+  }
+
+  assert(!(a.flags & tl::FLAG_EXCL));
+  assert(!(a.flags & tl::FLAG_OPT_VAR));
+
+  if (flat) {
+    //    TODO
+    //    return gen_field_fetch(const tl::arg &a, std::vector<tl::var_description> &vars, int num, bool flat);
+  }
+
+  assert(a.var_num == -1);
+
+  assert(a.type->get_type() == tl::NODE_TYPE_TYPE);
+  const tl::tl_tree_type *tree_type = static_cast<tl::tl_tree_type *>(a.type);
+
+  assert(parser_type != 0);
+  return "  " + gen_type_fetch(field_name, tree_type, vars, parser_type) + ";\n";
+}
+
+std::string TD_TL_writer_jni_cpp::get_pretty_field_name(std::string field_name) const {
+  return gen_java_field_name(TD_TL_writer_cpp::get_pretty_field_name(field_name));
+}
+
+std::string TD_TL_writer_jni_cpp::get_pretty_class_name(std::string class_name) const {
+  if (class_name == "vector") {
+    return "Array";
+  }
+  return gen_basic_java_class_name(class_name);
+}
+
+std::string TD_TL_writer_jni_cpp::gen_vector_store(const std::string &field_name, const tl::tl_tree_type *t,
+                                                   const std::vector<tl::var_description> &vars,
+                                                   int storer_type) const {
+  if (storer_type == 1) {
+    return TD_TL_writer_cpp::gen_vector_store(field_name, t, vars, storer_type);
+  }
+
+  std::string vector_type = gen_type_name(t);
+
+  if (vector_type == "bool") {
+    assert(false);  // TODO
+  }
+  if (vector_type == "std::int32_t" || vector_type == "std::int64_t" || vector_type == "double" ||
+      vector_type == string_type || vector_type == secure_string_type ||
+      vector_type.compare(0, 11, "std::vector") == 0 || vector_type.compare(0, 10, "object_ptr") == 0) {
+    return "{ "
+           "auto arr_tmp_ = td::jni::store_vector(env, " +
+           field_name +
+           "); "
+           "if (arr_tmp_) { "
+           "env->SetObjectField(s, " +
+           field_name +
+           "fieldID, arr_tmp_); "
+           "env->DeleteLocalRef(arr_tmp_); "
+           "} }";
+  }
+  if (vector_type == bytes_type) {
+    std::fprintf(stderr, "Vector of Bytes is not supported\n");
+    assert(false);
+  }
+
+  assert(false);
+  return "";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_type_store(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                                                 const std::vector<tl::var_description> &vars, int storer_type) const {
+  const tl::tl_type *t = tree_type->type;
+  const std::string &name = t->name;
+
+  assert(!field_name.empty());
+
+  assert(!(t->flags & tl::FLAG_DEFAULT_CONSTRUCTOR));
+
+  if (!(tree_type->flags & tl::FLAG_BARE)) {
+    if (storer_type == 0) {
+      if (is_type_bare(t)) {
+        std::fprintf(stderr, "Do not use non-bare fields with bare type %s\n", name.c_str());
+        //        assert(false);
+      }
+    }
+  } else {
+    assert(is_type_bare(t));
+  }
+
+  std::string res;
+  if (name == "Int32" || name == "Int53" || name == "Int64" || name == "Double" || name == "Bool" || name == "String" ||
+      name == "SecureString") {
+    if (storer_type == 1) {
+      res = "s.store_field(\"" + get_pretty_field_name(field_name) + "\", " + field_name + ");";
+    } else if (name == "Bool") {
+      res = "env->SetBooleanField(s, " + field_name + "fieldID, " + field_name + ");";
+    } else if (name == "Int32") {
+      res = "env->SetIntField(s, " + field_name + "fieldID, " + field_name + ");";
+    } else if (name == "Int53" || name == "Int64") {
+      res = "env->SetLongField(s, " + field_name + "fieldID, " + field_name + ");";
+    } else if (name == "Double") {
+      res = "env->SetDoubleField(s, " + field_name + "fieldID, " + field_name + ");";
+    } else if (name == "String") {
+      res = "{ jstring nextString = td::jni::to_jstring(env, " + field_name +
+            "); if (nextString) { env->SetObjectField(s, " + field_name +
+            "fieldID, nextString); env->DeleteLocalRef(nextString); } }";
+    } else if (name == "SecureString") {
+      res = "{ jstring nextString = td::jni::to_jstring_secure(env, " + field_name +
+            "); if (nextString) { env->SetObjectField(s, " + field_name +
+            "fieldID, nextString); env->DeleteLocalRef(nextString); } }";
+    } else {
+      assert(false);
+    }
+  } else if (name == "Bytes") {
+    if (storer_type == 1) {
+      res = "s.store_bytes_field(\"" + get_pretty_field_name(field_name) + "\", " + field_name + ");";
+    } else {
+      res = "{ jbyteArray nextBytes = td::jni::to_bytes(env, " + field_name +
+            "); if (nextBytes) { env->SetObjectField(s, " + field_name +
+            "fieldID, nextBytes); env->DeleteLocalRef(nextBytes); } }";
+    }
+  } else if (name == "SecureBytes") {
+    if (storer_type == 1) {
+      res = "s.store_bytes_field(\"" + get_pretty_field_name(field_name) + "\", " + field_name + ");";
+    } else {
+      res = "{ jbyteArray nextBytes = td::jni::to_bytes_secure(env, " + field_name +
+            "); if (nextBytes) { env->SetObjectField(s, " + field_name +
+            "fieldID, nextBytes); env->DeleteLocalRef(nextBytes); } }";
+    }
+  } else if (name == "Vector") {
+    const tl::tl_tree_type *child = static_cast<const tl::tl_tree_type *>(tree_type->children[0]);
+    res = gen_vector_store(field_name, child, vars, storer_type);
+  } else {
+    if (storer_type == 1) {
+      res = "if (" + field_name + " == nullptr) { s.store_field(\"" + get_pretty_field_name(field_name) +
+            "\", \"null\"); } else { " + field_name + "->store(s, \"" + get_pretty_field_name(field_name) + "\"); }";
+    } else {
+      res = "if (" + field_name + " != nullptr) { jobject next; " + field_name +
+            "->store(env, next); if (next) { env->SetObjectField(s, " + field_name +
+            "fieldID, next); env->DeleteLocalRef(next); } }";
+    }
+    assert(tree_type->children.empty());
+  }
+  return res;
+}
+
+std::string TD_TL_writer_jni_cpp::gen_field_store(const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                                                  int storer_type) const {
+  std::string field_name = gen_field_name(a.name);
+  std::string shift = storer_type == 1 ? "    " : "  ";
+
+  assert(a.exist_var_num == -1);
+  if (a.type->get_type() == tl::NODE_TYPE_VAR_TYPE) {
+    const tl::tl_tree_var_type *t = static_cast<const tl::tl_tree_var_type *>(a.type);
+    assert(a.flags == tl::FLAG_EXCL);
+
+    assert(a.var_num == -1);
+
+    assert(t->var_num >= 0);
+    assert(!vars[t->var_num].is_stored);
+    vars[t->var_num].is_stored = true;
+    assert(vars[t->var_num].is_type);
+
+    assert(false && "not supported");
+    return shift + field_name + "->store(env, s);\n";
+  }
+
+  assert(!(a.flags & tl::FLAG_EXCL));
+  assert(!(a.flags & tl::FLAG_OPT_VAR));
+
+  if (flat) {
+    //    TODO
+    //    return gen_field_store(const tl::arg &a, std::vector<tl::var_description> &vars, bool flat, int storer_type);
+  }
+
+  assert(a.var_num == -1);
+  assert(a.type->get_type() == tl::NODE_TYPE_TYPE);
+  const tl::tl_tree_type *tree_type = static_cast<tl::tl_tree_type *>(a.type);
+  return shift + gen_type_store(field_name, tree_type, vars, storer_type) + "\n";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_get_id(const std::string &class_name, std::int32_t id, bool is_proxy) const {
+  if (is_proxy) {
+    return "";
+  }
+  return "\nconst std::int32_t " + class_name + "::ID;\n";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_fetch_function_begin(const std::string &parser_name,
+                                                           const std::string &class_name,
+                                                           const std::string &parent_class_name, int arity,
+                                                           std::vector<tl::var_description> &vars,
+                                                           int parser_type) const {
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    assert(vars[i].is_stored == false);
+  }
+
+  std::string fetched_type = "object_ptr<" + class_name + "> ";
+  std::string returned_type = "object_ptr<" + parent_class_name + "> ";
+  assert(arity == 0);
+
+  assert(parser_type != 0);
+
+  return "\n" + returned_type + class_name + "::fetch(" + parser_name + " &p) {\n" +
+         (parser_type == -1 ? ""
+                            : "  if (p == nullptr) return nullptr;\n"
+                              "  " +
+                                  fetched_type + "res = make_object<" + class_name + ">();\n");
+}
+
+std::string TD_TL_writer_jni_cpp::gen_fetch_function_end(bool has_parent, int field_num,
+                                                         const std::vector<tl::var_description> &vars,
+                                                         int parser_type) const {
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    assert(vars[i].is_stored);
+  }
+
+  assert(parser_type != 0);
+
+  if (parser_type == -1) {
+    return "}\n";
+  }
+
+  return "  return " + std::string(has_parent ? "std::move(res)" : "res") +
+         ";\n"
+         "}\n";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_fetch_function_result_begin(const std::string &parser_name,
+                                                                  const std::string &class_name,
+                                                                  const tl::tl_tree *result) const {
+  return "\n" + class_name + "::ReturnType " + class_name + "::fetch_result(" + parser_name +
+         " &p) {\n"
+         "  if (p == nullptr) return ReturnType();\n" +
+         "  return ";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_fetch_function_result_end() const {
+  return ";\n"
+         "}\n";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_fetch_function_result_any_begin(const std::string &parser_name,
+                                                                      const std::string &class_name,
+                                                                      bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_fetch_function_result_any_end(bool is_proxy) const {
+  return "";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_store_function_begin(const std::string &storer_name,
+                                                           const std::string &class_name, int arity,
+                                                           std::vector<tl::var_description> &vars,
+                                                           int storer_type) const {
+  for (std::size_t i = 0; i < vars.size(); i++) {
+    vars[i].is_stored = false;
+  }
+
+  if (storer_type == -1) {
+    return "";
+  }
+
+  assert(arity == 0);
+  return "\n"
+         "void " +
+         class_name + "::store(" + storer_name + " &s" +
+         std::string(storer_type <= 0 ? "" : ", const char *field_name") + ") const {\n" +
+         (storer_type <= 0 ? "  s = env->AllocObject(Class);\n"
+                             "  if (!s) { return; }\n"
+                           : "  if (!LOG_IS_STRIPPED(ERROR)) {\n"
+                             "    s.store_class_begin(field_name, \"" +
+                                 get_pretty_class_name(class_name) + "\");\n");
+}
+
+std::string TD_TL_writer_jni_cpp::gen_fetch_switch_begin() const {
+  return "  if (p == nullptr) { return nullptr; }\n"
+         "  auto id = env->CallIntMethod(p, td::jni::GetConstructorID);\n"
+         "  switch (id) {\n";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_fetch_switch_case(const tl::tl_combinator *t, int arity) const {
+  assert(arity == 0);
+  return "    case " + gen_class_name(t->name) +
+         "::ID:\n"
+         "      return " +
+         gen_class_name(t->name) + "::fetch(env, p);\n";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_fetch_switch_end() const {
+  return "    default:\n"
+         "      LOG(WARNING) << \"Unknown constructor found: \" << id;\n"
+         "      return nullptr;\n"
+         "  }\n";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_java_field_name(std::string name) const {
+  std::string result;
+  bool next_to_upper = false;
+  for (std::size_t i = 0; i < name.size(); i++) {
+    if (!is_alnum(name[i])) {
+      next_to_upper = true;
+      continue;
+    }
+    if (next_to_upper) {
+      result += to_upper(name[i]);
+      next_to_upper = false;
+    } else {
+      result += name[i];
+    }
+  }
+  return result;
+}
+
+std::string TD_TL_writer_jni_cpp::gen_basic_java_class_name(std::string name) const {
+  std::string result;
+  bool next_to_upper = true;
+  for (std::size_t i = 0; i < name.size(); i++) {
+    if (!is_alnum(name[i])) {
+      next_to_upper = true;
+      continue;
+    }
+    if (next_to_upper) {
+      result += to_upper(name[i]);
+      next_to_upper = false;
+    } else {
+      result += name[i];
+    }
+  }
+  return result;
+}
+
+std::string TD_TL_writer_jni_cpp::gen_java_class_name(std::string name) const {
+  return "(PSLICE() << package_name << \"/TonApi$" + gen_basic_java_class_name(name) + "\").c_str()";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_type_signature(const tl::tl_tree_type *tree_type) const {
+  const tl::tl_type *t = tree_type->type;
+  const std::string &name = t->name;
+
+  assert(name != "#");
+  assert(name != gen_base_tl_class_name());
+  if (name == "Bool") {
+    return "Z";
+  } else if (name == "Int32") {
+    return "I";
+  } else if (name == "Int53" || name == "Int64") {
+    return "J";
+  } else if (name == "Double") {
+    return "D";
+  } else if (name == "String" || name == "SecureString") {
+    return "Ljava/lang/String;";
+  } else if (name == "Bytes" || name == "SecureBytes") {
+    return "[B";
+  } else if (name == "Vector") {
+    const tl::tl_tree_type *child = static_cast<const tl::tl_tree_type *>(tree_type->children[0]);
+    return "[" + gen_type_signature(child);
+  } else {
+    return "L%PACKAGE_NAME%/TonApi$" + gen_basic_java_class_name(gen_main_class_name(t)) + ";";
+  }
+  assert(false);
+  return "";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_additional_function(const std::string &function_name, const tl::tl_combinator *t,
+                                                          bool is_function) const {
+  assert(function_name == "init_jni_vars");
+  std::string class_name = gen_class_name(t->name);
+  std::string class_name_class = "Class";
+  std::string res =
+      "\n"
+      "void " +
+      class_name + "::" + function_name +
+      "(JNIEnv *env, const char *package_name) {\n"
+      "  " +
+      class_name_class + " = td::jni::get_jclass(env, " + gen_java_class_name(gen_class_name(t->name)) + ");\n";
+
+  if (t->args.size()) {
+    for (std::size_t i = 0; i < t->args.size(); i++) {
+      const tl::arg &a = t->args[i];
+      assert(a.type->get_type() == tl::NODE_TYPE_TYPE);
+      const tl::tl_tree_type *tree_type = static_cast<tl::tl_tree_type *>(a.type);
+
+      std::string field_name = gen_field_name(a.name);
+      assert(field_name.size());
+      std::string java_field_name = gen_java_field_name(std::string(field_name, 0, field_name.size() - 1));
+
+      std::string type_signature = gen_type_signature(tree_type);
+      if (type_signature.find("%PACKAGE_NAME%") == std::string::npos) {
+        type_signature = '"' + type_signature + '"';
+      } else {
+        std::string new_type_signature = "(PSLICE()";
+        std::size_t pos = type_signature.find("%PACKAGE_NAME%");
+        while (pos != std::string::npos) {
+          new_type_signature += " << \"" + type_signature.substr(0, pos) + "\" << package_name";
+          type_signature = type_signature.substr(pos + 14);
+          pos = type_signature.find("%PACKAGE_NAME%");
+        }
+        if (!type_signature.empty()) {
+          new_type_signature += " << \"" + type_signature + "\"";
+        }
+        type_signature = new_type_signature + ").c_str()";
+      }
+      res += "  " + field_name + "fieldID = td::jni::get_field_id(env, " + class_name_class + ", \"" + java_field_name +
+             "\", " + type_signature + ");\n";
+    }
+  }
+  res += "}\n";
+  return res;
+}
+
+std::string TD_TL_writer_jni_cpp::gen_additional_proxy_function_begin(const std::string &function_name,
+                                                                      const tl::tl_type *type,
+                                                                      const std::string &class_name, int arity,
+                                                                      bool is_function) const {
+  assert(function_name == "init_jni_vars");
+  assert(arity == 0);
+  return "\n"
+         "void " +
+         class_name + "::" + function_name +
+         "(JNIEnv *env, const char *package_name) {\n"
+         "  Class = td::jni::get_jclass(env, " +
+         gen_java_class_name(class_name) + ");\n";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_additional_proxy_function_case(const std::string &function_name,
+                                                                     const tl::tl_type *type,
+                                                                     const std::string &class_name, int arity) const {
+  assert(function_name == "init_jni_vars");
+  assert(arity == 0);
+  return "  " + class_name + "::" + function_name + "(env, package_name);\n";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_additional_proxy_function_case(const std::string &function_name,
+                                                                     const tl::tl_type *type,
+                                                                     const tl::tl_combinator *t, int arity,
+                                                                     bool is_function) const {
+  assert(function_name == "init_jni_vars");
+  assert(arity == 0);
+  return "  " + gen_class_name(t->name) + "::" + function_name + "(env, package_name);\n";
+}
+
+std::string TD_TL_writer_jni_cpp::gen_additional_proxy_function_end(const std::string &function_name,
+                                                                    const tl::tl_type *type, bool is_function) const {
+  assert(function_name == "init_jni_vars");
+  return "}\n";
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_jni_cpp.h b/submodules/ton/tonlib-src/tl/generate/tl_writer_jni_cpp.h
new file mode 100644
index 0000000000..b04eede9bd
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_jni_cpp.h
@@ -0,0 +1,123 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "tl_writer_cpp.h"
+
+#include <cstddef>
+#include <cstdint>
+#include <string>
+#include <vector>
+
+namespace td {
+
+class TD_TL_writer_jni_cpp : public TD_TL_writer_cpp {
+  std::string gen_vector_fetch(std::string field_name, const tl::tl_tree_type *t,
+                               const std::vector<tl::var_description> &vars, int parser_type) const;
+
+  std::string gen_vector_store(const std::string &field_name, const tl::tl_tree_type *t,
+                               const std::vector<tl::var_description> &vars, int storer_type) const;
+
+  std::string package_name;
+
+  std::string gen_java_field_name(std::string name) const;
+
+  std::string gen_basic_java_class_name(std::string name) const;
+
+  std::string gen_java_class_name(std::string name) const;
+
+  std::string gen_type_signature(const tl::tl_tree_type *tree_type) const;
+
+  std::string get_pretty_field_name(std::string field_name) const override;
+
+  std::string get_pretty_class_name(std::string class_name) const override;
+
+ public:
+  TD_TL_writer_jni_cpp(const std::string &tl_name, const std::string &string_type, const std::string &bytes_type,
+                       const std::string &secure_string_type, const std::string &secure_bytes_type,
+                       const std::vector<std::string> &ext_include)
+      : TD_TL_writer_cpp(tl_name, string_type, bytes_type, secure_string_type, secure_bytes_type, ext_include) {
+  }
+
+  bool is_built_in_simple_type(const std::string &name) const override;
+  bool is_built_in_complex_type(const std::string &name) const override;
+
+  int get_parser_type(const tl::tl_combinator *t, const std::string &parser_name) const override;
+  int get_additional_function_type(const std::string &additional_function_name) const override;
+  std::vector<std::string> get_parsers() const override;
+  std::vector<std::string> get_storers() const override;
+  std::vector<std::string> get_additional_functions() const override;
+
+  std::string gen_base_type_class_name(int arity) const override;
+  std::string gen_base_tl_class_name() const override;
+
+  std::string gen_class_begin(const std::string &class_name, const std::string &base_class_name,
+                              bool is_proxy) const override;
+
+  std::string gen_field_definition(const std::string &class_name, const std::string &type_name,
+                                   const std::string &field_name) const override;
+
+  std::string gen_constructor_id_store(std::int32_t id, int storer_type) const override;
+
+  std::string gen_field_fetch(int field_num, const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                              int parser_type) const override;
+  std::string gen_field_store(const tl::arg &a, std::vector<tl::var_description> &vars, bool flat,
+                              int storer_type) const override;
+  std::string gen_type_fetch(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                             const std::vector<tl::var_description> &vars, int parser_type) const override;
+  std::string gen_type_store(const std::string &field_name, const tl::tl_tree_type *tree_type,
+                             const std::vector<tl::var_description> &vars, int storer_type) const override;
+
+  std::string gen_get_id(const std::string &class_name, std::int32_t id, bool is_proxy) const override;
+
+  std::string gen_fetch_function_begin(const std::string &parser_name, const std::string &class_name,
+                                       const std::string &parent_class_name, int arity,
+                                       std::vector<tl::var_description> &vars, int parser_type) const override;
+  std::string gen_fetch_function_end(bool has_parent, int field_num, const std::vector<tl::var_description> &vars,
+                                     int parser_type) const override;
+
+  std::string gen_fetch_function_result_begin(const std::string &parser_name, const std::string &class_name,
+                                              const tl::tl_tree *result) const override;
+  std::string gen_fetch_function_result_end() const override;
+  std::string gen_fetch_function_result_any_begin(const std::string &parser_name, const std::string &class_name,
+                                                  bool is_proxy) const override;
+  std::string gen_fetch_function_result_any_end(bool is_proxy) const override;
+
+  std::string gen_store_function_begin(const std::string &storer_name, const std::string &class_name, int arity,
+                                       std::vector<tl::var_description> &vars, int storer_type) const override;
+
+  std::string gen_fetch_switch_begin() const override;
+  std::string gen_fetch_switch_case(const tl::tl_combinator *t, int arity) const override;
+  std::string gen_fetch_switch_end() const override;
+
+  std::string gen_additional_function(const std::string &function_name, const tl::tl_combinator *t,
+                                      bool is_function) const override;
+  std::string gen_additional_proxy_function_begin(const std::string &function_name, const tl::tl_type *type,
+                                                  const std::string &class_name, int arity,
+                                                  bool is_function) const override;
+  std::string gen_additional_proxy_function_case(const std::string &function_name, const tl::tl_type *type,
+                                                 const std::string &class_name, int arity) const override;
+  std::string gen_additional_proxy_function_case(const std::string &function_name, const tl::tl_type *type,
+                                                 const tl::tl_combinator *t, int arity,
+                                                 bool is_function) const override;
+  std::string gen_additional_proxy_function_end(const std::string &function_name, const tl::tl_type *type,
+                                                bool is_function) const override;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_jni_h.cpp b/submodules/ton/tonlib-src/tl/generate/tl_writer_jni_h.cpp
new file mode 100644
index 0000000000..7e12246367
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_jni_h.cpp
@@ -0,0 +1,204 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_writer_jni_h.h"
+
+#include <cassert>
+
+namespace td {
+
+bool TD_TL_writer_jni_h::is_built_in_simple_type(const std::string &name) const {
+  return name == "Bool" || name == "Int32" || name == "Int53" || name == "Int64" || name == "Double" ||
+         name == "String" || name == "Bytes" || name == "SecureString" || name == "SecureBytes";
+}
+
+bool TD_TL_writer_jni_h::is_built_in_complex_type(const std::string &name) const {
+  return name == "Vector";
+}
+
+int TD_TL_writer_jni_h::get_additional_function_type(const std::string &additional_function_name) const {
+  if (additional_function_name == "init_jni_vars") {
+    return 1;
+  }
+  return TD_TL_writer_h::get_additional_function_type(additional_function_name);
+}
+
+int TD_TL_writer_jni_h::get_parser_type(const tl::tl_combinator *t, const std::string &parser_name) const {
+  return 1;
+}
+
+std::vector<std::string> TD_TL_writer_jni_h::get_parsers() const {
+  std::vector<std::string> parsers;
+  parsers.push_back("JNIEnv *env, jobject");
+  return parsers;
+}
+
+std::vector<std::string> TD_TL_writer_jni_h::get_storers() const {
+  std::vector<std::string> storers;
+  storers.push_back("JNIEnv *env, jobject");
+  storers.push_back("td::TlStorerToString");
+  return storers;
+}
+
+std::vector<std::string> TD_TL_writer_jni_h::get_additional_functions() const {
+  std::vector<std::string> additional_functions = TD_TL_writer_h::get_additional_functions();
+  additional_functions.push_back("init_jni_vars");
+  return additional_functions;
+}
+
+std::string TD_TL_writer_jni_h::gen_base_type_class_name(int arity) const {
+  assert(arity == 0);
+  return "Object";
+}
+
+std::string TD_TL_writer_jni_h::gen_base_tl_class_name() const {
+  return "Object";
+}
+
+std::string TD_TL_writer_jni_h::gen_output_begin() const {
+  std::string ext_include_str;
+  for (auto &it : ext_include) {
+    ext_include_str += "#include " + it + "\n";
+  }
+  return "#pragma once\n\n"
+         "#include \"tl/TlObject.h\"\n\n"
+         "#include <cstdint>\n"
+         "#include <utility>\n"
+         "#include <vector>\n\n"
+         "#include <jni.h>\n\n" +
+         ext_include_str +
+         "\n"
+
+         "namespace td {\n" +
+         forward_declaration("TlStorerToString") + "}\n" +
+
+         "namespace ton {\n" + "namespace " + tl_name +
+         " {\n\n"
+
+         "class " +
+         gen_base_tl_class_name() +
+         ";\n"
+         "using BaseObject = " +
+         gen_base_tl_class_name() +
+         ";\n\n"
+
+         "template <class Type>\n"
+         "using object_ptr = ::ton::tl_object_ptr<Type>;\n\n"
+         "template <class Type, class... Args>\n"
+         "object_ptr<Type> make_object(Args &&... args) {\n"
+         "  return object_ptr<Type>(new Type(std::forward<Args>(args)...));\n"
+         "}\n\n"
+
+         "template <class ToType, class FromType>\n"
+         "object_ptr<ToType> move_object_as(FromType &&from) {\n"
+         "  return object_ptr<ToType>(static_cast<ToType *>(from.release()));\n"
+         "}\n\n"
+
+         "std::string to_string(const BaseObject &value);\n\n"
+
+         "template <class T>\n"
+         "std::string to_string(const object_ptr<T> &value) {\n"
+         "  if (value == nullptr) {\n"
+         "    return \"null\";\n"
+         "  }\n"
+         "\n"
+         "  return to_string(*value);\n"
+         "}\n\n";
+}
+
+std::string TD_TL_writer_jni_h::gen_class_begin(const std::string &class_name, const std::string &base_class_name,
+                                                bool is_proxy) const {
+  if (class_name == gen_base_tl_class_name()) {
+    return "class " + class_name +
+           " {\n"
+           " public:\n"
+           "  virtual ~" +
+           class_name +
+           "() {\n"
+           "  }\n\n" +
+           "  virtual void store(JNIEnv *env, jobject &s) const {\n"
+           "  }\n\n"
+           "  virtual void store(td::TlStorerToString &s, const char *field_name) const = 0;\n\n"
+           "  static jclass Class;\n";
+  }
+  return "class " + class_name + (!is_proxy ? " final " : "") + ": public " + base_class_name +
+         " {\n"
+         " public:\n"
+         "  static jclass Class;\n";
+}
+
+std::string TD_TL_writer_jni_h::gen_field_definition(const std::string &class_name, const std::string &type_name,
+                                                     const std::string &field_name) const {
+  return TD_TL_writer_h::gen_field_definition(class_name, type_name, field_name) + "  static jfieldID " + field_name +
+         "fieldID;\n";
+}
+
+std::string TD_TL_writer_jni_h::gen_additional_function(const std::string &function_name, const tl::tl_combinator *t,
+                                                        bool is_function) const {
+  if (function_name == "init_jni_vars") {
+    return "\n"
+           "  static void " +
+           function_name + "(JNIEnv *env, const char *package_name);\n";
+  }
+
+  return TD_TL_writer_h::gen_additional_function(function_name, t, is_function);
+}
+
+std::string TD_TL_writer_jni_h::gen_additional_proxy_function_begin(const std::string &function_name,
+                                                                    const tl::tl_type *type,
+                                                                    const std::string &class_name, int arity,
+                                                                    bool is_function) const {
+  if (function_name == "init_jni_vars") {
+    return "\n"
+           "  static void " +
+           function_name + "(JNIEnv *env, const char *package_name);\n";
+  }
+
+  return TD_TL_writer_h::gen_additional_proxy_function_begin(function_name, type, class_name, arity, is_function);
+}
+
+std::string TD_TL_writer_jni_h::gen_additional_proxy_function_case(const std::string &function_name,
+                                                                   const tl::tl_type *type,
+                                                                   const std::string &class_name, int arity) const {
+  if (function_name == "init_jni_vars") {
+    return "";
+  }
+
+  return TD_TL_writer_h::gen_additional_proxy_function_case(function_name, type, class_name, arity);
+}
+
+std::string TD_TL_writer_jni_h::gen_additional_proxy_function_case(const std::string &function_name,
+                                                                   const tl::tl_type *type, const tl::tl_combinator *t,
+                                                                   int arity, bool is_function) const {
+  if (function_name == "init_jni_vars") {
+    return "";
+  }
+
+  return TD_TL_writer_h::gen_additional_proxy_function_case(function_name, type, t, arity, is_function);
+}
+
+std::string TD_TL_writer_jni_h::gen_additional_proxy_function_end(const std::string &function_name,
+                                                                  const tl::tl_type *type, bool is_function) const {
+  if (function_name == "init_jni_vars") {
+    return "";
+  }
+
+  return TD_TL_writer_h::gen_additional_proxy_function_end(function_name, type, is_function);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_jni_h.h b/submodules/ton/tonlib-src/tl/generate/tl_writer_jni_h.h
new file mode 100644
index 0000000000..a4194eb28f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_jni_h.h
@@ -0,0 +1,70 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "tl_writer_h.h"
+
+#include <string>
+#include <vector>
+
+namespace td {
+
+class TD_TL_writer_jni_h : public TD_TL_writer_h {
+ public:
+  TD_TL_writer_jni_h(const std::string &tl_name, const std::string &string_type, const std::string &bytes_type,
+                     const std::string &secure_string_type, const std::string &secure_bytes_type,
+                     const std::vector<std::string> &ext_include)
+      : TD_TL_writer_h(tl_name, string_type, bytes_type, secure_string_type, secure_bytes_type, ext_include) {
+  }
+
+  bool is_built_in_simple_type(const std::string &name) const override;
+  bool is_built_in_complex_type(const std::string &name) const override;
+
+  int get_parser_type(const tl::tl_combinator *t, const std::string &parser_name) const override;
+  int get_additional_function_type(const std::string &additional_function_name) const override;
+  std::vector<std::string> get_parsers() const override;
+  std::vector<std::string> get_storers() const override;
+  std::vector<std::string> get_additional_functions() const override;
+
+  std::string gen_base_type_class_name(int arity) const override;
+  std::string gen_base_tl_class_name() const override;
+
+  std::string gen_output_begin() const override;
+
+  std::string gen_class_begin(const std::string &class_name, const std::string &base_class_name,
+                              bool is_proxy) const override;
+
+  std::string gen_field_definition(const std::string &class_name, const std::string &type_name,
+                                   const std::string &field_name) const override;
+
+  std::string gen_additional_function(const std::string &function_name, const tl::tl_combinator *t,
+                                      bool is_function) const override;
+  std::string gen_additional_proxy_function_begin(const std::string &function_name, const tl::tl_type *type,
+                                                  const std::string &class_name, int arity,
+                                                  bool is_function) const override;
+  std::string gen_additional_proxy_function_case(const std::string &function_name, const tl::tl_type *type,
+                                                 const std::string &class_name, int arity) const override;
+  std::string gen_additional_proxy_function_case(const std::string &function_name, const tl::tl_type *type,
+                                                 const tl::tl_combinator *t, int arity,
+                                                 bool is_function) const override;
+  std::string gen_additional_proxy_function_end(const std::string &function_name, const tl::tl_type *type,
+                                                bool is_function) const override;
+};
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_td.cpp b/submodules/ton/tonlib-src/tl/generate/tl_writer_td.cpp
new file mode 100644
index 0000000000..f697942b8a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_td.cpp
@@ -0,0 +1,276 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_writer_td.h"
+
+#include <iostream>
+#include <cassert>
+
+namespace td {
+
+const int TD_TL_writer::MAX_ARITY;
+
+const std::string TD_TL_writer::base_type_class_names[MAX_ARITY + 1] = {"Object"};
+const std::string TD_TL_writer::base_tl_class_name = "TlObject";
+const std::string TD_TL_writer::base_function_class_name = "Function";
+
+int TD_TL_writer::get_max_arity() const {
+  return MAX_ARITY;
+}
+
+bool TD_TL_writer::is_built_in_simple_type(const std::string &name) const {
+  return name == "True" || name == "Bool" || name == "Int" || name == "Long" || name == "Double" || name == "String" ||
+         name == "Int32" || name == "Int53" || name == "Int64" || name == "Int128" || name == "Int256" ||
+         name == "Bytes" || name == "SecureString" || name == "SecureBytes" || name == "Function" || name == "Object";
+}
+
+bool TD_TL_writer::is_built_in_complex_type(const std::string &name) const {
+  return name == "Vector";
+}
+
+bool TD_TL_writer::is_type_bare(const tl::tl_type *t) const {
+  return t->simple_constructors <= 1 || (is_built_in_simple_type(t->name) && t->name != "Bool") ||
+         is_built_in_complex_type(t->name);
+}
+
+bool TD_TL_writer::is_combinator_supported(const tl::tl_combinator *constructor) const {
+  if (!TL_writer::is_combinator_supported(constructor)) {
+    return false;
+  }
+
+  for (std::size_t i = 0; i < constructor->args.size(); i++) {
+    if (constructor->args[i].type->get_type() == tl::NODE_TYPE_VAR_TYPE) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+int TD_TL_writer::get_storer_type(const tl::tl_combinator *t, const std::string &storer_name) const {
+  return storer_name == "td::TlStorerToString" || storer_name == "TlStorerToString";
+}
+
+tl::TL_writer::Mode TD_TL_writer::get_parser_mode(int type) const {
+  if (tl_name == "tonlib_api") {
+#ifndef TD_ENABLE_JNI  // we need to parse all types in order to implement toString
+    return Server;
+#endif
+  }
+  return All;
+}
+
+tl::TL_writer::Mode TD_TL_writer::get_storer_mode(int type) const {
+  if (type == 1) {
+    return All;
+  }
+
+  if (tl_name == "td_api") {
+    return Server;
+  }
+  if (tl_name == "telegram_api") {
+    return Client;
+  }
+  return All;
+}
+
+std::vector<std::string> TD_TL_writer::get_parsers() const {
+  std::vector<std::string> parsers;
+  if (tl_name == "ton_api" || tl_name == "lite_api") {
+    parsers.push_back("td::TlParser");
+  }
+  return parsers;
+}
+
+std::vector<std::string> TD_TL_writer::get_storers() const {
+  std::vector<std::string> storers;
+  if (tl_name == "ton_api" || tl_name == "lite_api") {
+    storers.push_back("td::TlStorerCalcLength");
+    storers.push_back("td::TlStorerUnsafe");
+  }
+  storers.push_back("td::TlStorerToString");
+  return storers;
+}
+
+std::string TD_TL_writer::gen_base_tl_class_name() const {
+  return base_tl_class_name;
+}
+
+std::string TD_TL_writer::gen_base_type_class_name(int arity) const {
+  assert(arity == 0);
+  return base_type_class_names[arity];
+}
+
+std::string TD_TL_writer::gen_base_function_class_name() const {
+  return base_function_class_name;
+}
+
+std::string TD_TL_writer::gen_class_name(std::string name) const {
+  if (name == "Object") {
+    //assert(false);
+  }
+  if (name == "#") {
+    return "std::int32_t";
+  }
+  for (std::size_t i = 0; i < name.size(); i++) {
+    if (!is_alnum(name[i])) {
+      name[i] = '_';
+    }
+  }
+  return name;
+}
+
+std::string TD_TL_writer::gen_field_name(std::string name) const {
+  for (std::size_t i = 0; i < name.size(); i++) {
+    if (!is_alnum(name[i])) {
+      name[i] = '_';
+    }
+  }
+  assert(name.size() > 0);
+  assert(name[name.size() - 1] != '_');
+  return name + "_";
+}
+
+std::string TD_TL_writer::gen_var_name(const tl::var_description &desc) const {
+  assert(!desc.is_type);
+
+  if (desc.parameter_num != -1) {
+    assert(false);
+  }
+  return "var" + int_to_string(desc.index);
+}
+
+std::string TD_TL_writer::gen_parameter_name(int index) const {
+  assert(false);
+  return std::string();
+}
+
+std::string TD_TL_writer::gen_type_name(const tl::tl_tree_type *tree_type) const {
+  const tl::tl_type *t = tree_type->type;
+  const std::string &name = t->name;
+
+  if (name == "#") {
+    return "std::int32_t";
+  }
+  if (name == "True") {
+    return "bool";
+  }
+  if (name == "Bool") {
+    return "bool";
+  }
+  if (name == "Int" || name == "Int32") {
+    return "std::int32_t";
+  }
+  if (name == "Long" || name == "Int53" || name == "Int64") {
+    return "std::int64_t";
+  }
+  if (name == "Double") {
+    return "double";
+  }
+  if (name == "String") {
+    return string_type;
+  }
+  if (name == "Int128") {
+    return "td::Bits128";
+  }
+  if (name == "Int256") {
+    return "td::Bits256";
+  }
+  if (name == "Bytes") {
+    return bytes_type;
+  }
+  if (name == "SecureString") {
+    return secure_string_type;
+  }
+  if (name == "SecureBytes") {
+    return secure_bytes_type;
+  }
+  if (name == "Object") {
+    return "object_ptr<" + gen_base_type_class_name(0) + ">";
+  }
+  if (name == "Function") {
+    return "object_ptr<" + gen_base_function_class_name() + ">";
+  }
+
+  if (name == "Vector") {
+    assert(t->arity == 1);
+    assert(tree_type->children.size() == 1);
+    assert(tree_type->children[0]->get_type() == tl::NODE_TYPE_TYPE);
+    const tl::tl_tree_type *child = static_cast<const tl::tl_tree_type *>(tree_type->children[0]);
+
+    return "std::vector<" + gen_type_name(child) + ">";
+  }
+
+  assert(!is_built_in_simple_type(name) && !is_built_in_complex_type(name));
+
+  for (std::size_t i = 0; i < tree_type->children.size(); i++) {
+    assert(tree_type->children[i]->get_type() == tl::NODE_TYPE_NAT_CONST);
+  }
+
+  return "object_ptr<" + gen_main_class_name(t) + ">";
+}
+
+std::string TD_TL_writer::gen_array_type_name(const tl::tl_tree_array *arr, const std::string &field_name) const {
+  assert(false);
+  return std::string();
+}
+
+std::string TD_TL_writer::gen_var_type_name() const {
+  return "object_ptr<" + gen_base_function_class_name() + ">";
+}
+
+std::string TD_TL_writer::gen_int_const(const tl::tl_tree *tree_c, const std::vector<tl::var_description> &vars) const {
+  assert(false);
+  return std::string();
+}
+
+std::string TD_TL_writer::gen_constructor_parameter(int field_num, const std::string &class_name, const tl::arg &a,
+                                                    bool is_default) const {
+  if (is_default) {
+    return "";
+  }
+
+  std::string field_type = gen_field_type(a);
+  if (field_type.empty()) {
+    return "";
+  }
+
+  if (field_type[field_type.size() - 1] != ' ') {
+    field_type += ' ';
+  }
+
+  std::string res = (field_num == 0 ? "" : ", ");
+  if (field_type == "bool " || field_type == "std::int32_t " || field_type == "std::int64_t " ||
+      field_type == "double ") {
+    res += field_type;
+  } else if (field_type == "td::Bits128 " || field_type == "td::Bits256 " || field_type == string_type + " ") {
+    res += field_type + "const &";
+  } else if (field_type.compare(0, 11, "std::vector") == 0 || field_type == bytes_type + " " ||
+             field_type == secure_string_type + " " || field_type == secure_bytes_type + " ") {
+    res += field_type + "&&";
+  } else if (field_type.compare(0, 10, "object_ptr") == 0) {
+    res += field_type + "&&";
+  } else {
+    std::cerr << field_type << "\n";
+    assert(false && "unreachable");
+  }
+
+  return res + gen_field_name(a.name);
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/generate/tl_writer_td.h b/submodules/ton/tonlib-src/tl/generate/tl_writer_td.h
new file mode 100644
index 0000000000..ae7885b1e4
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/generate/tl_writer_td.h
@@ -0,0 +1,81 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/tl/tl_writer.h"
+
+#include <string>
+#include <vector>
+
+namespace td {
+
+class TD_TL_writer : public tl::TL_writer {
+  static const int MAX_ARITY = 0;
+
+  static const std::string base_type_class_names[MAX_ARITY + 1];
+  static const std::string base_tl_class_name;
+  static const std::string base_function_class_name;
+
+ protected:
+  const std::string string_type;
+  const std::string bytes_type;
+  const std::string secure_string_type;
+  const std::string secure_bytes_type;
+
+ public:
+  TD_TL_writer(const std::string &tl_name, const std::string &string_type, const std::string &bytes_type,
+               const std::string &secure_string_type, const std::string &secure_bytes_type)
+      : TL_writer(tl_name)
+      , string_type(string_type)
+      , bytes_type(bytes_type)
+      , secure_string_type(secure_string_type)
+      , secure_bytes_type(secure_bytes_type) {
+  }
+
+  int get_max_arity() const override;
+
+  bool is_built_in_simple_type(const std::string &name) const override;
+  bool is_built_in_complex_type(const std::string &name) const override;
+  bool is_type_bare(const tl::tl_type *t) const override;
+  bool is_combinator_supported(const tl::tl_combinator *constructor) const override;
+
+  int get_storer_type(const tl::tl_combinator *t, const std::string &storer_name) const override;
+  Mode get_parser_mode(int type) const override;
+  Mode get_storer_mode(int type) const override;
+  std::vector<std::string> get_parsers() const override;
+  std::vector<std::string> get_storers() const override;
+
+  std::string gen_base_tl_class_name() const override;
+  std::string gen_base_type_class_name(int arity) const override;
+  std::string gen_base_function_class_name() const override;
+  std::string gen_class_name(std::string name) const override;
+  std::string gen_field_name(std::string name) const override;
+  std::string gen_var_name(const tl::var_description &desc) const override;
+  std::string gen_parameter_name(int index) const override;
+  std::string gen_type_name(const tl::tl_tree_type *tree_type) const override;
+  std::string gen_array_type_name(const tl::tl_tree_array *arr, const std::string &field_name) const override;
+  std::string gen_var_type_name() const override;
+
+  std::string gen_int_const(const tl::tl_tree *tree_c, const std::vector<tl::var_description> &vars) const override;
+
+  std::string gen_constructor_parameter(int field_num, const std::string &class_name, const tl::arg &a,
+                                        bool is_default) const override;
+};
+
+}  // namespace td
diff --git a/submodules/MtProtoKit/TON/iOS/include/tl/TlObject.h b/submodules/ton/tonlib-src/tl/tl/TlObject.h
similarity index 100%
rename from submodules/MtProtoKit/TON/iOS/include/tl/TlObject.h
rename to submodules/ton/tonlib-src/tl/tl/TlObject.h
diff --git a/submodules/ton/tonlib-src/tl/tl/tl_jni_object.cpp b/submodules/ton/tonlib-src/tl/tl/tl_jni_object.cpp
new file mode 100644
index 0000000000..ab6add81e5
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/tl/tl_jni_object.cpp
@@ -0,0 +1,416 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tl_jni_object.h"
+
+#include "td/utils/common.h"
+#include "td/utils/logging.h"
+#include "td/utils/misc.h"
+#include "td/utils/Slice.h"
+
+#include <memory>
+
+namespace td {
+namespace jni {
+
+thread_local bool parse_error;
+
+static jclass BooleanClass;
+static jclass IntegerClass;
+static jclass LongClass;
+static jclass DoubleClass;
+static jclass StringClass;
+static jclass ObjectClass;
+jmethodID GetConstructorID;
+jmethodID BooleanGetValueMethodID;
+jmethodID IntegerGetValueMethodID;
+jmethodID LongGetValueMethodID;
+jmethodID DoubleGetValueMethodID;
+
+static void fatal_error(JNIEnv *env, CSlice error) {
+  LOG(ERROR) << error;
+  env->FatalError(error.c_str());
+}
+
+jclass get_jclass(JNIEnv *env, const char *class_name) {
+  jclass clazz = env->FindClass(class_name);
+  if (!clazz) {
+    fatal_error(env, PSLICE() << "Can't find class [" << class_name << "]");
+  }
+  jclass clazz_global = (jclass)env->NewGlobalRef(clazz);
+
+  env->DeleteLocalRef(clazz);
+
+  if (!clazz_global) {
+    fatal_error(env, PSLICE() << "Can't create global reference to [" << class_name << "]");
+  }
+
+  return clazz_global;
+}
+
+jmethodID get_method_id(JNIEnv *env, jclass clazz, const char *name, const char *signature) {
+  jmethodID res = env->GetMethodID(clazz, name, signature);
+  if (!res) {
+    fatal_error(env, PSLICE() << "Can't find method [" << name << "] with signature [" << signature << "]");
+  }
+  return res;
+}
+
+jfieldID get_field_id(JNIEnv *env, jclass clazz, const char *name, const char *signature) {
+  jfieldID res = env->GetFieldID(clazz, name, signature);
+  if (!res) {
+    fatal_error(env, PSLICE() << "Can't find field [" << name << "] with signature [" << signature << "]");
+  }
+  return res;
+}
+
+void register_native_method(JNIEnv *env, jclass clazz, std::string name, std::string signature, void *function_ptr) {
+  JNINativeMethod native_method{&name[0], &signature[0], function_ptr};
+  if (env->RegisterNatives(clazz, &native_method, 1) != 0) {
+    fatal_error(env, PSLICE() << "RegisterNatives failed for " << name << " with signature " << signature);
+  }
+}
+
+std::unique_ptr<JNIEnv, JvmThreadDetacher> get_jni_env(JavaVM *java_vm, jint jni_version) {
+  JNIEnv *env = nullptr;
+  if (java_vm->GetEnv(reinterpret_cast<void **>(&env), jni_version) == JNI_EDETACHED) {
+#ifdef JDK1_2  // if not Android JNI
+    auto p_env = reinterpret_cast<void **>(&env);
+#else
+    auto p_env = &env;
+#endif
+    java_vm->AttachCurrentThread(p_env, nullptr);
+  } else {
+    java_vm = nullptr;
+  }
+
+  return std::unique_ptr<JNIEnv, JvmThreadDetacher>(env, JvmThreadDetacher(java_vm));
+}
+
+void init_vars(JNIEnv *env, const char *td_api_java_package) {
+  BooleanClass = get_jclass(env, "java/lang/Boolean");
+  IntegerClass = get_jclass(env, "java/lang/Integer");
+  LongClass = get_jclass(env, "java/lang/Long");
+  DoubleClass = get_jclass(env, "java/lang/Double");
+  StringClass = get_jclass(env, "java/lang/String");
+  ObjectClass = get_jclass(env, (PSLICE() << td_api_java_package << "/TonApi$Object").c_str());
+  GetConstructorID = get_method_id(env, ObjectClass, "getConstructor", "()I");
+  BooleanGetValueMethodID = get_method_id(env, BooleanClass, "booleanValue", "()Z");
+  IntegerGetValueMethodID = get_method_id(env, IntegerClass, "intValue", "()I");
+  LongGetValueMethodID = get_method_id(env, LongClass, "longValue", "()J");
+  DoubleGetValueMethodID = get_method_id(env, DoubleClass, "doubleValue", "()D");
+}
+
+static size_t get_utf8_from_utf16_length(const jchar *p, jsize len) {
+  size_t result = 0;
+  for (jsize i = 0; i < len; i++) {
+    unsigned int cur = p[i];
+    if ((cur & 0xF800) == 0xD800) {
+      if (i < len) {
+        unsigned int next = p[++i];
+        if ((next & 0xFC00) == 0xDC00 && (cur & 0x400) == 0) {
+          result += 4;
+          continue;
+        }
+      }
+
+      // TODO wrong UTF-16, it is possible
+      return 0;
+    }
+    result += 1 + (cur >= 0x80) + (cur >= 0x800);
+  }
+  return result;
+}
+
+static void utf16_to_utf8(const jchar *p, jsize len, char *res) {
+  for (jsize i = 0; i < len; i++) {
+    unsigned int cur = p[i];
+    // TODO conversion unsigned int -> signed char is implementation defined
+    if (cur <= 0x7f) {
+      *res++ = static_cast<char>(cur);
+    } else if (cur <= 0x7ff) {
+      *res++ = static_cast<char>(0xc0 | (cur >> 6));
+      *res++ = static_cast<char>(0x80 | (cur & 0x3f));
+    } else if ((cur & 0xF800) != 0xD800) {
+      *res++ = static_cast<char>(0xe0 | (cur >> 12));
+      *res++ = static_cast<char>(0x80 | ((cur >> 6) & 0x3f));
+      *res++ = static_cast<char>(0x80 | (cur & 0x3f));
+    } else {
+      // correctness is already checked
+      unsigned int next = p[++i];
+      unsigned int val = ((cur - 0xD800) << 10) + next - 0xDC00 + 0x10000;
+
+      *res++ = static_cast<char>(0xf0 | (val >> 18));
+      *res++ = static_cast<char>(0x80 | ((val >> 12) & 0x3f));
+      *res++ = static_cast<char>(0x80 | ((val >> 6) & 0x3f));
+      *res++ = static_cast<char>(0x80 | (val & 0x3f));
+    }
+  }
+}
+
+static jsize get_utf16_from_utf8_length(const char *p, size_t len, jsize *surrogates) {
+  // UTF-8 correctness is supposed
+  jsize result = 0;
+  for (size_t i = 0; i < len; i++) {
+    result += ((p[i] & 0xc0) != 0x80);
+    *surrogates += ((p[i] & 0xf8) == 0xf0);
+  }
+  return result;
+}
+
+static void utf8_to_utf16(const char *p, size_t len, jchar *res) {
+  // UTF-8 correctness is supposed
+  for (size_t i = 0; i < len;) {
+    unsigned int a = static_cast<unsigned char>(p[i++]);
+    if (a >= 0x80) {
+      unsigned int b = static_cast<unsigned char>(p[i++]);
+      if (a >= 0xe0) {
+        unsigned int c = static_cast<unsigned char>(p[i++]);
+        if (a >= 0xf0) {
+          unsigned int d = static_cast<unsigned char>(p[i++]);
+          unsigned int val = ((a & 0x07) << 18) + ((b & 0x3f) << 12) + ((c & 0x3f) << 6) + (d & 0x3f) - 0x10000;
+          *res++ = static_cast<jchar>(0xD800 + (val >> 10));
+          *res++ = static_cast<jchar>(0xDC00 + (val & 0x3ff));
+        } else {
+          *res++ = static_cast<jchar>(((a & 0x0f) << 12) + ((b & 0x3f) << 6) + (c & 0x3f));
+        }
+      } else {
+        *res++ = static_cast<jchar>(((a & 0x1f) << 6) + (b & 0x3f));
+      }
+    } else {
+      *res++ = static_cast<jchar>(a);
+    }
+  }
+}
+
+std::string fetch_string(JNIEnv *env, jobject o, jfieldID id) {
+  jstring s = (jstring)env->GetObjectField(o, id);
+  if (s == nullptr) {
+    // treat null as an empty string
+    return std::string();
+  }
+  std::string res = from_jstring(env, s);
+  env->DeleteLocalRef(s);
+  return res;
+}
+
+SecureString fetch_string_secure(JNIEnv *env, jobject o, jfieldID id) {
+  jstring s = (jstring)env->GetObjectField(o, id);
+  if (s == nullptr) {
+    // treat null as an empty string
+    return {};
+  }
+  auto res = from_jstring_secure(env, s);
+  env->DeleteLocalRef(s);
+  return res;
+}
+
+template <class T>
+T do_from_jstring(JNIEnv *env, jstring s) {
+  if (!s) {
+    return T{};
+  }
+  jsize s_len = env->GetStringLength(s);
+  const jchar *p = env->GetStringChars(s, nullptr);
+  if (p == nullptr) {
+    parse_error = true;
+    return T{};
+  }
+  size_t len = get_utf8_from_utf16_length(p, s_len);
+  T res(len, '\0');
+  if (len) {
+    utf16_to_utf8(p, s_len, as_mutable_slice(res).begin());
+  }
+  env->ReleaseStringChars(s, p);
+  return res;
+}
+
+std::string from_jstring(JNIEnv *env, jstring s) {
+  return do_from_jstring<std::string>(env, s);
+}
+
+jstring do_to_jstring(JNIEnv *env, CSlice s) {
+  jsize surrogates = 0;
+  jsize unicode_len = get_utf16_from_utf8_length(s.c_str(), s.size(), &surrogates);
+  if (surrogates == 0) {
+    // TODO '\0'
+    return env->NewStringUTF(s.c_str());
+  }
+  jsize result_len = surrogates + unicode_len;
+  if (result_len <= 256) {
+    jchar result[256];
+    utf8_to_utf16(s.c_str(), s.size(), result);
+    return env->NewString(result, result_len);
+  }
+
+  auto result = std::make_unique<jchar[]>(result_len);
+  utf8_to_utf16(s.c_str(), s.size(), result.get());
+  return env->NewString(result.get(), result_len);
+}
+
+jstring to_jstring(JNIEnv *env, const std::string &s) {
+  return do_to_jstring(env, s);
+}
+
+template <class T>
+T do_from_bytes(JNIEnv *env, jbyteArray arr) {
+  T b;
+  if (arr != nullptr) {
+    jsize length = env->GetArrayLength(arr);
+    if (length != 0) {
+      b = T(narrow_cast<size_t>(length), '\0');
+      env->GetByteArrayRegion(arr, 0, length, reinterpret_cast<jbyte *>(as_mutable_slice(b).begin()));
+    }
+    env->DeleteLocalRef(arr);
+  }
+  return b;
+}
+std::string from_bytes(JNIEnv *env, jbyteArray arr) {
+  return do_from_bytes<std::string>(env, arr);
+}
+
+jbyteArray to_bytes(JNIEnv *env, Slice b) {
+  static_assert(sizeof(char) == sizeof(jbyte), "Mismatched jbyte size");
+  jsize length = narrow_cast<jsize>(b.size());
+  jbyteArray arr = env->NewByteArray(length);
+  if (arr != nullptr && length != 0) {
+    env->SetByteArrayRegion(arr, 0, length, reinterpret_cast<const jbyte *>(b.data()));
+  }
+  return arr;
+}
+
+SecureString from_jstring_secure(JNIEnv *env, jstring s) {
+  return do_from_jstring<SecureString>(env, s);
+}
+
+jstring to_jstring_secure(JNIEnv *env, Slice s) {
+  SecureString cstr(s.size() + 1);
+  cstr.as_mutable_slice().copy_from(s);
+  cstr.as_mutable_slice().back() = 0;
+  return do_to_jstring(env, CSlice(cstr.data(), cstr.data() + s.size()));
+}
+
+SecureString from_bytes_secure(JNIEnv *env, jbyteArray arr) {
+  return do_from_bytes<SecureString>(env, arr);
+}
+
+jbyteArray to_bytes_secure(JNIEnv *env, Slice b) {
+  return to_bytes(env, b);
+}
+
+jintArray store_vector(JNIEnv *env, const std::vector<std::int32_t> &v) {
+  static_assert(sizeof(std::int32_t) == sizeof(jint), "Mismatched jint size");
+  jsize length = narrow_cast<jsize>(v.size());
+  jintArray arr = env->NewIntArray(length);
+  if (arr != nullptr && length != 0) {
+    env->SetIntArrayRegion(arr, 0, length, reinterpret_cast<const jint *>(&v[0]));
+  }
+  return arr;
+}
+
+jlongArray store_vector(JNIEnv *env, const std::vector<std::int64_t> &v) {
+  static_assert(sizeof(std::int64_t) == sizeof(jlong), "Mismatched jlong size");
+  jsize length = narrow_cast<jsize>(v.size());
+  jlongArray arr = env->NewLongArray(length);
+  if (arr != nullptr && length != 0) {
+    env->SetLongArrayRegion(arr, 0, length, reinterpret_cast<const jlong *>(&v[0]));
+  }
+  return arr;
+}
+
+jdoubleArray store_vector(JNIEnv *env, const std::vector<double> &v) {
+  static_assert(sizeof(double) == sizeof(jdouble), "Mismatched jdouble size");
+  jsize length = narrow_cast<jsize>(v.size());
+  jdoubleArray arr = env->NewDoubleArray(length);
+  if (arr != nullptr && length != 0) {
+    env->SetDoubleArrayRegion(arr, 0, length, reinterpret_cast<const jdouble *>(&v[0]));
+  }
+  return arr;
+}
+
+jobjectArray store_vector(JNIEnv *env, const std::vector<std::string> &v) {
+  jsize length = narrow_cast<jsize>(v.size());
+  jobjectArray arr = env->NewObjectArray(length, StringClass, 0);
+  if (arr != nullptr) {
+    for (jsize i = 0; i < length; i++) {
+      jstring str = to_jstring(env, v[i]);
+      if (str) {
+        env->SetObjectArrayElement(arr, i, str);
+        env->DeleteLocalRef(str);
+      }
+    }
+  }
+  return arr;
+}
+
+jobjectArray store_vector(JNIEnv *env, const std::vector<SecureString> &v) {
+  jsize length = narrow_cast<jsize>(v.size());
+  jobjectArray arr = env->NewObjectArray(length, StringClass, 0);
+  if (arr != nullptr) {
+    for (jsize i = 0; i < length; i++) {
+      jstring str = to_jstring_secure(env, v[i]);
+      if (str) {
+        env->SetObjectArrayElement(arr, i, str);
+        env->DeleteLocalRef(str);
+      }
+    }
+  }
+  return arr;
+}
+
+std::vector<std::int32_t> fetch_vector(JNIEnv *env, jintArray arr) {
+  std::vector<std::int32_t> result;
+  if (arr != nullptr) {
+    jsize length = env->GetArrayLength(arr);
+    if (length != 0) {
+      result.resize(length);
+      env->GetIntArrayRegion(arr, 0, length, reinterpret_cast<jint *>(&result[0]));
+    }
+    env->DeleteLocalRef(arr);
+  }
+  return result;
+}
+
+std::vector<std::int64_t> fetch_vector(JNIEnv *env, jlongArray arr) {
+  std::vector<std::int64_t> result;
+  if (arr != nullptr) {
+    jsize length = env->GetArrayLength(arr);
+    if (length != 0) {
+      result.resize(length);
+      env->GetLongArrayRegion(arr, 0, length, reinterpret_cast<jlong *>(&result[0]));
+    }
+    env->DeleteLocalRef(arr);
+  }
+  return result;
+}
+
+std::vector<double> fetch_vector(JNIEnv *env, jdoubleArray arr) {
+  std::vector<double> result;
+  if (arr != nullptr) {
+    jsize length = env->GetArrayLength(arr);
+    if (length != 0) {
+      result.resize(length);
+      env->GetDoubleArrayRegion(arr, 0, length, reinterpret_cast<jdouble *>(&result[0]));
+    }
+    env->DeleteLocalRef(arr);
+  }
+  return result;
+}
+
+}  // namespace jni
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/tl/tl_jni_object.h b/submodules/ton/tonlib-src/tl/tl/tl_jni_object.h
new file mode 100644
index 0000000000..24af446265
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/tl/tl_jni_object.h
@@ -0,0 +1,250 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <jni.h>
+
+#include <cstdint>
+#include <memory>
+#include <string>
+#include <vector>
+
+#include "td/utils/Slice.h"
+#include "td/utils/SharedSlice.h"
+
+namespace td {
+namespace jni {
+
+extern thread_local bool parse_error;
+
+extern jmethodID GetConstructorID;
+extern jmethodID BooleanGetValueMethodID;
+extern jmethodID IntegerGetValueMethodID;
+extern jmethodID LongGetValueMethodID;
+extern jmethodID DoubleGetValueMethodID;
+
+jclass get_jclass(JNIEnv *env, const char *class_name);
+
+jmethodID get_method_id(JNIEnv *env, jclass clazz, const char *name, const char *signature);
+
+jfieldID get_field_id(JNIEnv *env, jclass clazz, const char *name, const char *signature);
+
+void register_native_method(JNIEnv *env, jclass clazz, std::string name, std::string signature, void *function_ptr);
+
+class JvmThreadDetacher {
+  JavaVM *java_vm_;
+
+  void detach() {
+    if (java_vm_ != nullptr) {
+      java_vm_->DetachCurrentThread();
+      java_vm_ = nullptr;
+    }
+  }
+
+ public:
+  explicit JvmThreadDetacher(JavaVM *java_vm) : java_vm_(java_vm) {
+  }
+
+  JvmThreadDetacher(const JvmThreadDetacher &other) = delete;
+  JvmThreadDetacher &operator=(const JvmThreadDetacher &other) = delete;
+  JvmThreadDetacher(JvmThreadDetacher &&other) : java_vm_(other.java_vm_) {
+    other.java_vm_ = nullptr;
+  }
+  JvmThreadDetacher &operator=(JvmThreadDetacher &&other) = delete;
+  ~JvmThreadDetacher() {
+    detach();
+  }
+
+  void operator()(JNIEnv *env) {
+    detach();
+  }
+};
+
+std::unique_ptr<JNIEnv, JvmThreadDetacher> get_jni_env(JavaVM *java_vm, jint jni_version);
+
+std::string fetch_string(JNIEnv *env, jobject o, jfieldID id);
+SecureString fetch_string_secure(JNIEnv *env, jobject o, jfieldID id);
+
+inline jobject fetch_object(JNIEnv *env, const jobject &o, const jfieldID &id) {
+  // null return object is implicitly allowed
+  return env->GetObjectField(o, id);
+}
+
+inline bool have_parse_error() {
+  return parse_error;
+}
+
+inline void reset_parse_error() {
+  parse_error = false;
+}
+
+std::string from_jstring(JNIEnv *env, jstring s);
+SecureString from_jstring_secure(JNIEnv *env, jstring s);
+
+jstring to_jstring(JNIEnv *env, const std::string &s);
+jstring to_jstring_secure(JNIEnv *env, Slice s);
+
+std::string from_bytes(JNIEnv *env, jbyteArray arr);
+SecureString from_bytes_secure(JNIEnv *env, jbyteArray arr);
+
+jbyteArray to_bytes(JNIEnv *env, Slice b);
+jbyteArray to_bytes_secure(JNIEnv *env, Slice b);
+
+void init_vars(JNIEnv *env, const char *td_api_java_package);
+
+jintArray store_vector(JNIEnv *env, const std::vector<std::int32_t> &v);
+
+jlongArray store_vector(JNIEnv *env, const std::vector<std::int64_t> &v);
+
+jdoubleArray store_vector(JNIEnv *env, const std::vector<double> &v);
+
+jobjectArray store_vector(JNIEnv *env, const std::vector<std::string> &v);
+
+jobjectArray store_vector(JNIEnv *env, const std::vector<SecureString> &v);
+
+template <class T>
+jobjectArray store_vector(JNIEnv *env, const std::vector<T> &v) {
+  jint length = static_cast<jint>(v.size());
+  jobjectArray arr = env->NewObjectArray(length, T::element_type::Class, jobject());
+  if (arr != nullptr) {
+    for (jint i = 0; i < length; i++) {
+      if (v[i] != nullptr) {
+        jobject stored_object;
+        v[i]->store(env, stored_object);
+        if (stored_object) {
+          env->SetObjectArrayElement(arr, i, stored_object);
+          env->DeleteLocalRef(stored_object);
+        }
+      }
+    }
+  }
+  return arr;
+}
+
+template <class T>
+class get_array_class {
+  static jclass get();
+};
+
+template <class T>
+jobjectArray store_vector(JNIEnv *env, const std::vector<std::vector<T>> &v) {
+  jint length = static_cast<jint>(v.size());
+  jobjectArray arr = env->NewObjectArray(length, get_array_class<typename T::element_type>::get(), 0);
+  if (arr != nullptr) {
+    for (jint i = 0; i < length; i++) {
+      auto stored_array = store_vector(env, v[i]);
+      if (stored_array) {
+        env->SetObjectArrayElement(arr, i, stored_array);
+        env->DeleteLocalRef(stored_array);
+      }
+    }
+  }
+  return arr;
+}
+
+template <class T>
+auto fetch_tl_object(JNIEnv *env, jobject obj) {
+  decltype(T::fetch(env, obj)) result;
+  if (obj != nullptr) {
+    result = T::fetch(env, obj);
+    env->DeleteLocalRef(obj);
+  }
+  return result;
+}
+
+std::vector<std::int32_t> fetch_vector(JNIEnv *env, jintArray arr);
+
+std::vector<std::int64_t> fetch_vector(JNIEnv *env, jlongArray arr);
+
+std::vector<double> fetch_vector(JNIEnv *env, jdoubleArray arr);
+
+template <class T>
+struct FetchVector {
+  static auto fetch(JNIEnv *env, jobjectArray arr) {
+    std::vector<decltype(fetch_tl_object<T>(env, jobject()))> result;
+    if (arr != nullptr) {
+      jsize length = env->GetArrayLength(arr);
+      result.reserve(length);
+      for (jsize i = 0; i < length; i++) {
+        result.push_back(fetch_tl_object<T>(env, env->GetObjectArrayElement(arr, i)));
+      }
+      env->DeleteLocalRef(arr);
+    }
+    return result;
+  }
+};
+
+template <>
+struct FetchVector<std::string> {
+  static std::vector<std::string> fetch(JNIEnv *env, jobjectArray arr) {
+    std::vector<std::string> result;
+    if (arr != nullptr) {
+      jsize length = env->GetArrayLength(arr);
+      result.reserve(length);
+      for (jsize i = 0; i < length; i++) {
+        jstring str = (jstring)env->GetObjectArrayElement(arr, i);
+        result.push_back(jni::from_jstring(env, str));
+        if (str) {
+          env->DeleteLocalRef(str);
+        }
+      }
+      env->DeleteLocalRef(arr);
+    }
+    return result;
+  }
+};
+
+template <>
+struct FetchVector<SecureString> {
+  static std::vector<SecureString> fetch(JNIEnv *env, jobjectArray arr) {
+    std::vector<SecureString> result;
+    if (arr != nullptr) {
+      jsize length = env->GetArrayLength(arr);
+      result.reserve(length);
+      for (jsize i = 0; i < length; i++) {
+        jstring str = (jstring)env->GetObjectArrayElement(arr, i);
+        result.push_back(jni::from_jstring_secure(env, str));
+        if (str) {
+          env->DeleteLocalRef(str);
+        }
+      }
+      env->DeleteLocalRef(arr);
+    }
+    return result;
+  }
+};
+
+template <class T>
+struct FetchVector<std::vector<T>> {
+  static auto fetch(JNIEnv *env, jobjectArray arr) {
+    std::vector<decltype(FetchVector<T>::fetch(env, jobjectArray()))> result;
+    if (arr != nullptr) {
+      jsize length = env->GetArrayLength(arr);
+      result.reserve(length);
+      for (jsize i = 0; i < length; i++) {
+        result.push_back(FetchVector<T>::fetch(env, (jobjectArray)env->GetObjectArrayElement(arr, i)));
+      }
+      env->DeleteLocalRef(arr);
+    }
+    return result;
+  }
+};
+
+}  // namespace jni
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/tl/tl_json.h b/submodules/ton/tonlib-src/tl/tl/tl_json.h
new file mode 100644
index 0000000000..b39ac35ef6
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/tl/tl_json.h
@@ -0,0 +1,305 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/base64.h"
+#include "td/utils/buffer.h"
+#include "td/utils/format.h"
+#include "td/utils/JsonBuilder.h"
+#include "td/utils/misc.h"
+#include "td/utils/Slice.h"
+#include "td/utils/SharedSlice.h"
+#include "td/utils/Status.h"
+#include "td/utils/tl_storers.h"
+
+#include <type_traits>
+
+namespace td {
+struct JsonInt64 {
+  int64 value;
+};
+
+inline void to_json(JsonValueScope &jv, const JsonInt64 json_int64) {
+  jv << JsonString(PSLICE() << json_int64.value);
+}
+struct JsonVectorInt64 {
+  const std::vector<int64> &value;
+};
+
+inline void to_json(JsonValueScope &jv, const JsonVectorInt64 &vec) {
+  auto ja = jv.enter_array();
+  for (auto &value : vec.value) {
+    ja.enter_value() << ToJson(JsonInt64{value});
+  }
+}
+struct JsonBytes {
+  td::Slice bytes;
+};
+
+inline void to_json(JsonValueScope &jv, const JsonBytes json_bytes) {
+  jv << JsonString(PSLICE() << base64_encode(json_bytes.bytes));
+}
+template <class T>
+struct JsonVectorBytesImpl {
+  const std::vector<T> &value;
+};
+
+template <class T>
+auto JsonVectorBytes(const std::vector<T> &value) {
+  return JsonVectorBytesImpl<T>{value};
+}
+
+template <class T>
+void to_json(JsonValueScope &jv, const JsonVectorBytesImpl<T> &vec) {
+  auto ja = jv.enter_array();
+  for (auto &value : vec.value) {
+    ja.enter_value() << ToJson(JsonBytes{value});
+  }
+}
+template <unsigned size>
+inline void to_json(JsonValueScope &jv, const td::BitArray<size> &vec) {
+  to_json(jv, base64_encode(as_slice(vec)));
+}
+
+template <class T>
+void to_json(JsonValueScope &jv, const ton::tl_object_ptr<T> &value) {
+  if (value) {
+    to_json(jv, *value);
+  } else {
+    jv << JsonNull();
+  }
+}
+
+template <class T>
+void to_json(JsonValueScope &jv, const std::vector<T> &v) {
+  auto ja = jv.enter_array();
+  for (auto &value : v) {
+    ja.enter_value() << ToJson(value);
+  }
+}
+
+inline Status from_json(std::int32_t &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::Number && from.type() != JsonValue::Type::String) {
+    return Status::Error(PSLICE() << "Expected number, got " << from.type());
+  }
+  Slice number = from.type() == JsonValue::Type::String ? from.get_string() : from.get_number();
+  TRY_RESULT(res, to_integer_safe<int32>(number));
+  to = res;
+  return Status::OK();
+}
+
+inline Status from_json(bool &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::Boolean) {
+    int32 x;
+    auto status = from_json(x, from);
+    if (status.is_ok()) {
+      to = x != 0;
+      return Status::OK();
+    }
+    return Status::Error(PSLICE() << "Expected bool, got " << from.type());
+  }
+  to = from.get_boolean();
+  return Status::OK();
+}
+
+inline Status from_json(std::int64_t &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::Number && from.type() != JsonValue::Type::String) {
+    return Status::Error(PSLICE() << "Expected number, got " << from.type());
+  }
+  Slice number = from.type() == JsonValue::Type::String ? from.get_string() : from.get_number();
+  TRY_RESULT(res, to_integer_safe<int64>(number));
+  to = res;
+  return Status::OK();
+}
+inline Status from_json(double &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::Number) {
+    return Status::Error(PSLICE() << "Expected number, got " << from.type());
+  }
+  to = to_double(from.get_number().str());
+  return Status::OK();
+}
+
+inline Status from_json(string &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::String) {
+    return Status::Error(PSLICE() << "Expected string, got " << from.type());
+  }
+  to = from.get_string().str();
+  return Status::OK();
+}
+
+inline Status from_json(SecureString &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::String) {
+    return Status::Error(PSLICE() << "Expected string, got " << from.type());
+  }
+  to = SecureString(from.get_string().str());
+  return Status::OK();
+}
+
+inline Status from_json(Slice &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::String) {
+    return Status::Error(PSLICE() << "Expected string, got " << from.type());
+  }
+  to = from.get_string();
+  return Status::OK();
+}
+
+inline Status from_json_bytes(string &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::String) {
+    return Status::Error(PSLICE() << "Expected string, got " << from.type());
+  }
+  TRY_RESULT(decoded, base64_decode(from.get_string()));
+  to = std::move(decoded);
+  return Status::OK();
+}
+
+inline Status from_json_bytes(SecureString &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::String) {
+    return Status::Error(PSLICE() << "Expected string, got " << from.type());
+  }
+  TRY_RESULT(decoded, base64_decode_secure(from.get_string()));
+  to = std::move(decoded);
+  return Status::OK();
+}
+
+inline Status from_json_bytes(BufferSlice &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::String) {
+    return Status::Error(PSLICE() << "Expected string, got " << from.type());
+  }
+  TRY_RESULT(decoded, base64_decode(from.get_string()));
+  to = BufferSlice(decoded);
+  return Status::OK();
+}
+
+inline Status from_json_bytes(Slice &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::String) {
+    return Status::Error(PSLICE() << "Expected string, got " << from.type());
+  }
+  TRY_RESULT(decoded, base64_decode(from.get_string()));
+  from.get_string().copy_from(decoded);
+  from.get_string().truncate(decoded.size());
+  to = from.get_string();
+  return Status::OK();
+}
+
+template <unsigned size>
+inline Status from_json(td::BitArray<size> &to, JsonValue &from) {
+  string raw;
+  TRY_STATUS(from_json_bytes(raw, from));
+  auto S = to.as_slice();
+  if (raw.size() != S.size()) {
+    return Status::Error("Wrong length for UInt");
+  }
+  S.copy_from(raw);
+  return Status::OK();
+}
+
+template <class T>
+Status from_json(std::vector<T> &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::Array) {
+    return Status::Error(PSLICE() << "Expected array, got " << from.type());
+  }
+  to = std::vector<T>(from.get_array().size());
+  size_t i = 0;
+  for (auto &value : from.get_array()) {
+    TRY_STATUS(from_json(to[i], value));
+    i++;
+  }
+  return Status::OK();
+}
+
+template <class T>
+inline Status from_json_vector_bytes(std::vector<T> &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::Array) {
+    return Status::Error(PSLICE() << "Expected array, got " << from.type());
+  }
+  to = std::vector<T>(from.get_array().size());
+  size_t i = 0;
+  for (auto &value : from.get_array()) {
+    TRY_STATUS(from_json_bytes(to[i], value));
+    i++;
+  }
+  return Status::OK();
+}
+
+template <class T>
+class DowncastHelper : public T {
+ public:
+  explicit DowncastHelper(int32 constructor) : constructor_(constructor) {
+  }
+  int32 get_id() const override {
+    return constructor_;
+  }
+  void store(TlStorerToString &s, const char *field_name) const override {
+  }
+
+ private:
+  int32 constructor_{0};
+};
+
+template <class T>
+std::enable_if_t<!std::is_constructible<T>::value, Status> from_json(ton::tl_object_ptr<T> &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::Object) {
+    if (from.type() == JsonValue::Type::Null) {
+      to = nullptr;
+      return Status::OK();
+    }
+    return Status::Error(PSLICE() << "Expected object, got " << from.type());
+  }
+
+  auto &object = from.get_object();
+  TRY_RESULT(constructor_value, get_json_object_field(object, "@type", JsonValue::Type::Null, false));
+  int32 constructor = 0;
+  if (constructor_value.type() == JsonValue::Type::Number) {
+    constructor = to_integer<int32>(constructor_value.get_number());
+  } else if (constructor_value.type() == JsonValue::Type::String) {
+    TRY_RESULT(t_constructor, tl_constructor_from_string(to.get(), constructor_value.get_string().str()));
+    constructor = t_constructor;
+  } else {
+    return Status::Error(PSLICE() << "Expected string or int, got " << constructor_value.type());
+  }
+
+  DowncastHelper<T> helper(constructor);
+  Status status;
+  bool ok = downcast_call(static_cast<T &>(helper), [&](auto &dummy) {
+    auto result = ton::create_tl_object<std::decay_t<decltype(dummy)>>();
+    status = from_json(*result, object);
+    to = std::move(result);
+  });
+  TRY_STATUS(std::move(status));
+  if (!ok) {
+    return Status::Error(PSLICE() << "Unknown constructor " << format::as_hex(constructor));
+  }
+
+  return Status::OK();
+}
+
+template <class T>
+std::enable_if_t<std::is_constructible<T>::value, Status> from_json(ton::tl_object_ptr<T> &to, JsonValue &from) {
+  if (from.type() != JsonValue::Type::Object) {
+    if (from.type() == JsonValue::Type::Null) {
+      to = nullptr;
+      return Status::OK();
+    }
+    return Status::Error(PSLICE() << "Expected object, got " << from.type());
+  }
+  to = ton::create_tl_object<T>();
+  return from_json(*to, from.get_object());
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/tl/tl/tl_object_parse.h b/submodules/ton/tonlib-src/tl/tl/tl_object_parse.h
new file mode 100644
index 0000000000..f3efd47c7b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/tl/tl_object_parse.h
@@ -0,0 +1,158 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <cstdint>
+#include <memory>
+#include <string>
+#include <vector>
+
+#include "tl/TlObject.h"
+
+#include "td/utils/int_types.h"
+#include "crypto/common/bitstring.h"
+
+namespace ton {
+
+template <class Func, std::int32_t constructor_id>
+class TlFetchBoxed {
+ public:
+  template <class Parser>
+  static auto parse(Parser &p) -> decltype(Func::parse(p)) {
+    if (p.fetch_int() != constructor_id) {
+      p.set_error("Wrong constructor found");
+      return decltype(Func::parse(p))();
+    }
+    return Func::parse(p);
+  }
+};
+
+class TlFetchTrue {
+ public:
+  template <class Parser>
+  static bool parse(Parser &p) {
+    return true;
+  }
+};
+
+class TlFetchBool {
+ public:
+  template <class Parser>
+  static bool parse(Parser &p) {
+    constexpr std::int32_t ID_BOOL_FALSE = 0xbc799737;
+    constexpr std::int32_t ID_BOOL_TRUE = 0x997275b5;
+
+    std::int32_t c = p.fetch_int();
+    if (c == ID_BOOL_TRUE) {
+      return true;
+    }
+    if (c != ID_BOOL_FALSE) {
+      p.set_error("Bool expected");
+    }
+    return false;
+  }
+};
+
+class TlFetchInt {
+ public:
+  template <class Parser>
+  static std::int32_t parse(Parser &p) {
+    return p.fetch_int();
+  }
+};
+
+class TlFetchLong {
+ public:
+  template <class Parser>
+  static std::int64_t parse(Parser &p) {
+    return p.fetch_long();
+  }
+};
+
+class TlFetchDouble {
+ public:
+  template <class Parser>
+  static double parse(Parser &p) {
+    return p.fetch_double();
+  }
+};
+
+class TlFetchInt128 {
+ public:
+  template <class Parser>
+  static td::Bits128 parse(Parser &p) {
+    return p.template fetch_binary<td::Bits128>();
+  }
+};
+
+class TlFetchInt256 {
+ public:
+  template <class Parser>
+  static td::Bits256 parse(Parser &p) {
+    return p.template fetch_binary<td::Bits256>();
+  }
+};
+
+template <class T>
+class TlFetchString {
+ public:
+  template <class Parser>
+  static T parse(Parser &p) {
+    return p.template fetch_string<T>();
+  }
+};
+
+template <class T>
+class TlFetchBytes {
+ public:
+  template <class Parser>
+  static T parse(Parser &p) {
+    return p.template fetch_string<T>();
+  }
+};
+
+template <class Func>
+class TlFetchVector {
+ public:
+  template <class Parser>
+  static auto parse(Parser &p) -> std::vector<decltype(Func::parse(p))> {
+    const std::uint32_t multiplicity = p.fetch_int();
+    std::vector<decltype(Func::parse(p))> v;
+    if (p.get_left_len() < multiplicity) {
+      p.set_error("Wrong vector length");
+    } else {
+      v.reserve(multiplicity);
+      for (std::uint32_t i = 0; i < multiplicity; i++) {
+        v.push_back(Func::parse(p));
+      }
+    }
+    return v;
+  }
+};
+
+template <class T>
+class TlFetchObject {
+ public:
+  template <class Parser>
+  static tl_object_ptr<T> parse(Parser &p) {
+    return move_tl_object_as<T>(T::fetch(p));
+  }
+};
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tl/tl/tl_object_store.h b/submodules/ton/tonlib-src/tl/tl/tl_object_store.h
new file mode 100644
index 0000000000..c484923b4f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tl/tl/tl_object_store.h
@@ -0,0 +1,107 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include <cstdint>
+#include <memory>
+#include <string>
+#include <vector>
+
+#include "tl/TlObject.h"
+
+#include "td/utils/misc.h"
+
+namespace ton {
+
+template <class Func, std::int32_t constructor_id>
+class TlStoreBoxed {
+ public:
+  template <class T, class Storer>
+  static void store(const T &x, Storer &s) {
+    s.store_binary(constructor_id);
+    Func::store(x, s);
+  }
+};
+
+template <class Func>
+class TlStoreBoxedUnknown {
+ public:
+  template <class T, class Storer>
+  static void store(const T &x, Storer &s) {
+    s.store_binary(x->get_id());
+    Func::store(x, s);
+  }
+};
+
+class TlStoreBool {
+ public:
+  template <class Storer>
+  static void store(const bool &x, Storer &s) {
+    constexpr std::int32_t ID_BOOL_FALSE = 0xbc799737;
+    constexpr std::int32_t ID_BOOL_TRUE = 0x997275b5;
+
+    s.store_binary(x ? ID_BOOL_TRUE : ID_BOOL_FALSE);
+  }
+};
+
+class TlStoreTrue {
+ public:
+  template <class Storer>
+  static void store(const bool &x, Storer &s) {
+    // currently nothing to do
+  }
+};
+
+class TlStoreBinary {
+ public:
+  template <class T, class Storer>
+  static void store(const T &x, Storer &s) {
+    s.store_binary(x);
+  }
+};
+
+class TlStoreString {
+ public:
+  template <class T, class Storer>
+  static void store(const T &x, Storer &s) {
+    s.store_string(x);
+  }
+};
+
+template <class Func>
+class TlStoreVector {
+ public:
+  template <class T, class Storer>
+  static void store(const T &vec, Storer &s) {
+    s.store_binary(td::narrow_cast<td::int32>(vec.size()));
+    for (auto &val : vec) {
+      Func::store(val, s);
+    }
+  }
+};
+
+class TlStoreObject {
+ public:
+  template <class T, class Storer>
+  static void store(const tl_object_ptr<T> &obj, Storer &s) {
+    return obj->store(s);
+  }
+};
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/ton/lite-tl.hpp b/submodules/ton/tonlib-src/ton/lite-tl.hpp
new file mode 100644
index 0000000000..649b621b15
--- /dev/null
+++ b/submodules/ton/tonlib-src/ton/lite-tl.hpp
@@ -0,0 +1,56 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "ton-types.h"
+#include "auto/tl/lite_api.h"
+
+namespace ton {
+
+inline tl_object_ptr<lite_api::tonNode_blockIdExt> create_tl_lite_block_id(const BlockIdExt &block_id) {
+  return create_tl_object<lite_api::tonNode_blockIdExt>(block_id.id.workchain, block_id.id.shard, block_id.id.seqno,
+                                                        block_id.root_hash, block_id.file_hash);
+}
+
+inline BlockIdExt create_block_id(const tl_object_ptr<lite_api::tonNode_blockIdExt> &B) {
+  return BlockIdExt{B->workchain_, static_cast<td::uint64>(B->shard_), static_cast<BlockSeqno>(B->seqno_),
+                    B->root_hash_, B->file_hash_};
+}
+
+inline tl_object_ptr<lite_api::tonNode_blockId> create_tl_lite_block_id_simple(const BlockId &block_id) {
+  return create_tl_object<lite_api::tonNode_blockId>(block_id.workchain, block_id.shard, block_id.seqno);
+}
+
+inline BlockId create_block_id_simple(const tl_object_ptr<lite_api::tonNode_blockId> &B) {
+  return BlockId{B->workchain_, static_cast<td::uint64>(B->shard_), static_cast<BlockSeqno>(B->seqno_)};
+}
+
+inline BlockIdExt lite_empty_block_id() {
+  return BlockIdExt{workchainIdNotYet, 0, 0, RootHash::zero(), FileHash::zero()};
+}
+
+inline tl_object_ptr<lite_api::tonNode_zeroStateIdExt> create_tl_lite_zero_state_id(const ZeroStateIdExt &id) {
+  return create_tl_object<lite_api::tonNode_zeroStateIdExt>(id.workchain, id.root_hash, id.file_hash);
+}
+
+inline ZeroStateIdExt create_zero_state_id(tl_object_ptr<lite_api::tonNode_zeroStateIdExt> &B) {
+  return ZeroStateIdExt{B->workchain_, B->root_hash_, B->file_hash_};
+}
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/ton/ton-io.hpp b/submodules/ton/tonlib-src/ton/ton-io.hpp
new file mode 100644
index 0000000000..a6e0610e43
--- /dev/null
+++ b/submodules/ton/tonlib-src/ton/ton-io.hpp
@@ -0,0 +1,46 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "ton-types.h"
+#include "td/utils/base64.h"
+
+namespace td {
+
+inline td::StringBuilder &operator<<(td::StringBuilder &stream, const ton::Bits256 &x) {
+  return stream << td::base64_encode(td::Slice(x.data(), x.size() / 8));
+}
+
+inline td::StringBuilder &operator<<(td::StringBuilder &stream, const ton::ShardIdFull &x) {
+  return stream << "[ w=" << x.workchain << " s=" << x.shard << " ]";
+}
+
+inline td::StringBuilder &operator<<(td::StringBuilder &stream, const ton::AccountIdPrefixFull &x) {
+  return stream << "[ w=" << x.workchain << " s=" << x.account_id_prefix << " ]";
+}
+
+inline td::StringBuilder &operator<<(td::StringBuilder &stream, const ton::BlockId &x) {
+  return stream << "[ w=" << x.workchain << " s=" << x.shard << " seq=" << x.seqno << " ]";
+}
+inline td::StringBuilder &operator<<(td::StringBuilder &stream, const ton::BlockIdExt &x) {
+  return stream << "[ w=" << x.id.workchain << " s=" << x.id.shard << " seq=" << x.id.seqno << " " << x.root_hash << " "
+                << x.file_hash << " ]";
+}
+
+}  // namespace td
diff --git a/submodules/ton/tonlib-src/ton/ton-shard.h b/submodules/ton/tonlib-src/ton/ton-shard.h
new file mode 100644
index 0000000000..188ea8a3a7
--- /dev/null
+++ b/submodules/ton/tonlib-src/ton/ton-shard.h
@@ -0,0 +1,210 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "ton-types.h"
+#include "td/utils/bits.h"
+#include "crypto/common/bitstring.h"
+
+namespace ton {
+
+constexpr ShardId rootShardId = (1ULL << 63);
+
+inline AccountIdPrefix extract_top64(td::UInt256 addr) {
+  return td::ConstBitPtr{addr.raw}.get_uint(64);
+}
+
+inline AccountIdPrefix extract_top64(const Bits256& addr) {
+  return addr.cbits().get_uint(64);
+}
+
+inline AccountIdPrefix extract_top64(td::ConstBitPtr addr) {
+  return addr.get_uint(64);
+}
+
+inline AccountIdPrefixFull extract_addr_prefix(WorkchainId workchain, const StdSmcAddress& addr) {
+  return AccountIdPrefixFull{workchain, extract_top64(addr)};
+}
+
+inline AccountIdPrefixFull extract_addr_prefix(WorkchainId workchain, td::ConstBitPtr addr) {
+  return AccountIdPrefixFull{workchain, extract_top64(addr)};
+}
+
+inline int count_matching_bits(AccountIdPrefix x, AccountIdPrefix y) {
+  return x == y ? 64 : td::count_leading_zeroes64(x ^ y);
+}
+
+inline int count_matching_bits(AccountIdPrefixFull x, AccountIdPrefixFull y) {
+  if (x.workchain != y.workchain) {
+    return td::count_leading_zeroes32(x.workchain ^ y.workchain);
+  } else {
+    return 32 + count_matching_bits(x.account_id_prefix, y.account_id_prefix);
+  }
+}
+
+inline td::uint32 shard_prefix_length(ShardId shard) {
+  return shard ? 63 - td::count_trailing_zeroes_non_zero64(shard) : 0;
+}
+
+inline td::uint32 shard_prefix_length(ShardIdFull shard) {
+  return shard_prefix_length(shard.shard);
+}
+
+inline bool shard_is_ancestor(ShardId parent, ShardId child) {
+  td::uint64 x = td::lower_bit64(parent), y = td::lower_bit64(child);
+  return x >= y && !((parent ^ child) & (td::bits_negate64(x) << 1));
+}
+
+inline bool shard_is_proper_ancestor(ShardId parent, ShardId child) {
+  td::uint64 x = td::lower_bit64(parent), y = td::lower_bit64(child);
+  return x > y && !((parent ^ child) & (td::bits_negate64(x) << 1));
+}
+
+inline bool shard_is_ancestor(ShardIdFull parent, ShardIdFull child) {
+  return parent.workchain == child.workchain && shard_is_ancestor(parent.shard, child.shard);
+}
+
+inline bool shard_is_proper_ancestor(ShardIdFull parent, ShardIdFull child) {
+  return parent.workchain == child.workchain && shard_is_proper_ancestor(parent.shard, child.shard);
+}
+
+inline bool shard_contains(ShardId parent, AccountIdPrefix child) {
+  td::uint64 x = td::lower_bit64(parent);
+  return !((parent ^ child) & (td::bits_negate64(x) << 1));
+}
+
+inline bool shard_contains(ShardIdFull parent, ShardIdFull child) {
+  return parent.workchain == child.workchain && shard_contains(parent.shard, child.shard);
+}
+
+inline bool shard_contains(ShardIdFull parent, const AccountIdPrefixFull& child) {
+  return parent.workchain == child.workchain && shard_contains(parent.shard, child.account_id_prefix);
+}
+
+inline bool shard_contains(ShardId parent, const StdSmcAddress& addr) {
+  return shard_contains(parent, extract_top64(addr));
+}
+
+inline bool shard_intersects(ShardId x, ShardId y) {
+  td::uint64 z = std::max(td::lower_bit64(x), td::lower_bit64(y));
+  return !((x ^ y) & (td::bits_negate64(z) << 1));
+}
+
+inline bool shard_intersects(ShardIdFull x, ShardIdFull y) {
+  return x.workchain == y.workchain && shard_intersects(x.shard, y.shard);
+}
+
+inline ShardId shard_intersection(ShardId x, ShardId y) {
+  return td::lower_bit64(x) < td::lower_bit64(y) ? x : y;
+}
+
+inline ShardIdFull shard_intersection(ShardIdFull x, ShardIdFull y) {
+  return {x.workchain, shard_intersection(x.shard, y.shard)};
+}
+
+inline bool is_right_child(ShardId x) {
+  return x & (td::lower_bit64(x) << 1);
+}
+
+inline bool is_left_child(ShardId x) {
+  return !is_right_child(x);
+}
+
+inline bool is_right_child(ShardIdFull shard) {
+  return is_right_child(shard.shard);
+}
+
+inline bool is_left_child(ShardIdFull shard) {
+  return is_left_child(shard.shard);
+}
+
+template <typename T>
+inline bool shard_is_ancestor(ShardId parent, T child) {
+  return shard_contains(parent, extract_top64(child));
+}
+
+inline ShardId shard_prefix(ShardId id, td::uint32 len) {
+  CHECK(len <= 63);
+  td::uint64 x = td::lower_bit64(id), y = 1ULL << (63 - len);
+  CHECK(y >= x);
+  return (id & td::bits_negate64(y)) | y;
+}
+
+inline ShardIdFull shard_prefix(ShardIdFull id, td::uint32 len) {
+  return ShardIdFull{id.workchain, shard_prefix(id.shard, len)};
+}
+
+inline ShardIdFull shard_prefix(AccountIdPrefixFull id, td::uint32 len) {
+  ShardId y = 1ULL << (63 - len);
+  return ShardIdFull{id.workchain, (id.account_id_prefix & td::bits_negate64(y)) | y};
+}
+
+template <typename T>
+inline ShardId shard_prefix(T addr, td::uint32 len) {
+  CHECK(len <= 63);
+  td::uint64 y = 1ULL << (63 - len);
+  return (extract_top64(addr) & td::bits_negate64(y)) | y;
+}
+
+inline ShardId shard_parent(ShardId shard) {
+  td::uint64 x = td::lower_bit64(shard);
+  CHECK(x);
+  return (shard - x) | (x << 1);
+}
+
+inline ShardIdFull shard_parent(ShardIdFull shard) {
+  return ShardIdFull{shard.workchain, shard_parent(shard.shard)};
+}
+
+inline bool shard_is_parent(ShardId parent, ShardId child) {
+  td::uint64 y = td::lower_bit64(child);
+  return y && shard_parent(child) == parent;
+}
+
+inline bool shard_is_parent(ShardIdFull parent, ShardIdFull child) {
+  return parent.workchain == child.workchain && shard_is_parent(parent.shard, child.shard);
+}
+
+inline ShardId shard_child(ShardId shard, bool left) {
+  td::uint64 x = td::lower_bit64(shard) >> 1;
+  CHECK(x);
+  return left ? shard - x : shard + x;
+}
+
+inline ShardIdFull shard_child(ShardIdFull shard, bool left) {
+  return ShardIdFull{shard.workchain, shard_child(shard.shard, left)};
+}
+
+inline bool shard_is_sibling(ShardId x, ShardId y) {
+  return (x ^ y) && ((x ^ y) == ((x & td::bits_negate64(x)) << 1));
+}
+
+inline bool shard_is_sibling(ShardIdFull x, ShardIdFull y) {
+  return x.workchain == y.workchain && shard_is_sibling(x.shard, y.shard);
+}
+
+inline ShardId shard_sibling(ShardId x) {
+  return x ^ ((x & td::bits_negate64(x)) << 1);
+}
+
+inline ShardIdFull shard_sibling(ShardIdFull shard) {
+  return ShardIdFull{shard.workchain, shard_sibling(shard.shard)};
+}
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/ton/ton-tl.hpp b/submodules/ton/tonlib-src/ton/ton-tl.hpp
new file mode 100644
index 0000000000..99edcc8776
--- /dev/null
+++ b/submodules/ton/tonlib-src/ton/ton-tl.hpp
@@ -0,0 +1,56 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "ton-types.h"
+#include "auto/tl/ton_api.h"
+
+namespace ton {
+
+inline tl_object_ptr<ton_api::tonNode_blockIdExt> create_tl_block_id(const BlockIdExt &block_id) {
+  return create_tl_object<ton_api::tonNode_blockIdExt>(block_id.id.workchain, block_id.id.shard, block_id.id.seqno,
+                                                       block_id.root_hash, block_id.file_hash);
+}
+
+inline BlockIdExt create_block_id(const tl_object_ptr<ton_api::tonNode_blockIdExt> &B) {
+  return BlockIdExt{B->workchain_, static_cast<td::uint64>(B->shard_), static_cast<BlockSeqno>(B->seqno_),
+                    B->root_hash_, B->file_hash_};
+}
+
+inline tl_object_ptr<ton_api::tonNode_blockId> create_tl_block_id_simple(const BlockId &block_id) {
+  return create_tl_object<ton_api::tonNode_blockId>(block_id.workchain, block_id.shard, block_id.seqno);
+}
+
+inline BlockId create_block_id_simple(const tl_object_ptr<ton_api::tonNode_blockId> &B) {
+  return BlockId{B->workchain_, static_cast<td::uint64>(B->shard_), static_cast<BlockSeqno>(B->seqno_)};
+}
+
+inline BlockIdExt empty_block_id() {
+  return BlockIdExt{workchainIdNotYet, 0, 0, RootHash::zero(), FileHash::zero()};
+}
+
+inline tl_object_ptr<ton_api::tonNode_zeroStateIdExt> create_tl_zero_state_id(const ZeroStateIdExt &id) {
+  return create_tl_object<ton_api::tonNode_zeroStateIdExt>(id.workchain, id.root_hash, id.file_hash);
+}
+
+inline ZeroStateIdExt create_zero_state_id(tl_object_ptr<ton_api::tonNode_zeroStateIdExt> &B) {
+  return ZeroStateIdExt{B->workchain_, B->root_hash_, B->file_hash_};
+}
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/ton/ton-types.h b/submodules/ton/tonlib-src/ton/ton-types.h
new file mode 100644
index 0000000000..be9fcb6716
--- /dev/null
+++ b/submodules/ton/tonlib-src/ton/ton-types.h
@@ -0,0 +1,425 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "crypto/common/bitstring.h"
+#include "td/utils/buffer.h"
+#include "td/utils/bits.h"
+#include "td/utils/Slice.h"
+#include "td/utils/UInt.h"
+
+namespace ton {
+
+using WorkchainId = td::int32;
+constexpr WorkchainId workchainIdNotYet = (1U << 31);
+using ShardId = td::uint64;  // prefix a of length l encoded as ((2 * a + 1) << (63 - l))
+using AccountIdPrefix = td::uint64;
+using BlockSeqno = td::uint32;      // usually >= 1; 0 used to indicate the initial state ("zerostate")
+using Bits256 = td::BitArray<256>;  // was: td::UInt256
+using BlockHash = Bits256;
+using RootHash = Bits256;
+using FileHash = Bits256;
+using NodeIdShort = Bits256;    // compatible with adnl::AdnlNodeIdShort
+using StdSmcAddress = Bits256;  // masterchain / base workchain smart-contract addresses
+using UnixTime = td::uint32;
+using LogicalTime = td::uint64;
+using ValidatorWeight = td::uint64;  // was td::uint32 before
+using CatchainSeqno = td::uint32;
+
+using ValidatorSessionId = td::Bits256;
+
+constexpr WorkchainId masterchainId = -1, basechainId = 0, workchainInvalid = 0x80000000;
+constexpr ShardId shardIdAll = (1ULL << 63);
+
+constexpr unsigned split_merge_delay = 100;        // prepare (delay) split/merge for 100 seconds
+constexpr unsigned split_merge_interval = 100;     // split/merge is enabled during 60 second interval
+constexpr unsigned min_split_merge_interval = 30;  // split/merge interval must be at least 30 seconds
+constexpr unsigned max_split_merge_delay =
+    1000;  // end of split/merge interval must be at most 1000 seconds in the future
+
+enum GlobalCapabilities { capIhrEnabled = 1, capCreateStatsEnabled = 2 };
+
+inline int shard_pfx_len(ShardId shard) {
+  return shard ? 63 - td::count_trailing_zeroes_non_zero64(shard) : 0;
+}
+
+inline std::string shard_to_str(ShardId shard) {
+  char buffer[64];
+  return std::string{buffer, (unsigned)snprintf(buffer, 63, "%016llx", static_cast<unsigned long long>(shard))};
+}
+
+struct ShardIdFull {
+  WorkchainId workchain;
+  ShardId shard;
+  ShardIdFull() : workchain(workchainInvalid) {
+  }
+  explicit ShardIdFull(WorkchainId workchain) : workchain(workchain), shard(shardIdAll) {
+  }
+  ShardIdFull(WorkchainId workchain, ShardId shard) : workchain(workchain), shard(shard) {
+  }
+  bool operator==(const ShardIdFull& other) const {
+    return workchain == other.workchain && shard == other.shard;
+  }
+  bool operator!=(const ShardIdFull& other) const {
+    return workchain != other.workchain || shard != other.shard;
+  }
+  bool operator<(const ShardIdFull& other) const {
+    return workchain < other.workchain || (workchain == other.workchain && shard < other.shard);
+  }
+  bool is_valid() const {
+    return workchain != workchainInvalid;
+  }
+  bool is_valid_ext() const {
+    return is_valid() && shard;
+  }
+  bool is_masterchain() const {
+    return workchain == masterchainId;
+  }
+  bool is_split() const {
+    return shard != shardIdAll;
+  }
+  bool is_masterchain_ext() const {
+    return is_masterchain() && shard == shardIdAll;
+  }
+  int pfx_len() const {
+    return shard_pfx_len(shard);
+  }
+  ShardIdFull operator+(int delta) const {
+    return ShardIdFull{workchain, shard + delta};
+  }
+  ShardIdFull operator-(int delta) const {
+    return ShardIdFull{workchain, shard - delta};
+  }
+  std::string to_str() const {
+    char buffer[64];
+    return std::string{buffer, (unsigned)snprintf(buffer, 63, "(%d,%016llx)", workchain, (unsigned long long)shard)};
+  }
+};
+
+struct AccountIdPrefixFull {
+  WorkchainId workchain;
+  AccountIdPrefix account_id_prefix;
+  AccountIdPrefixFull() : workchain(workchainInvalid) {
+  }
+  AccountIdPrefixFull(WorkchainId workchain, AccountIdPrefix prefix) : workchain(workchain), account_id_prefix(prefix) {
+  }
+  bool operator==(const AccountIdPrefixFull& other) const {
+    return workchain == other.workchain && account_id_prefix == other.account_id_prefix;
+  }
+  bool operator!=(const AccountIdPrefixFull& other) const {
+    return workchain != other.workchain || account_id_prefix != other.account_id_prefix;
+  }
+  bool operator<(const AccountIdPrefixFull& other) const {
+    return workchain < other.workchain || (workchain == other.workchain && account_id_prefix < other.account_id_prefix);
+  }
+  bool is_valid() const {
+    return workchain != workchainInvalid;
+  }
+  bool is_masterchain() const {
+    return workchain == masterchainId;
+  }
+  ShardIdFull as_leaf_shard() const {
+    return ShardIdFull{workchain, account_id_prefix | 1};
+  }
+  std::string to_str() const {
+    char buffer[64];
+    return std::string{
+        buffer, (unsigned)snprintf(buffer, 63, "(%d,%016llx)", workchain, (unsigned long long)account_id_prefix)};
+  }
+};
+
+struct BlockId {
+  WorkchainId workchain;
+  BlockSeqno seqno;
+  ShardId shard;
+
+  BlockId(WorkchainId workchain, ShardId shard, BlockSeqno seqno) : workchain(workchain), seqno(seqno), shard(shard) {
+  }
+  BlockId(ShardIdFull shard, BlockSeqno seqno) : workchain(shard.workchain), seqno(seqno), shard(shard.shard) {
+  }
+  BlockId() : workchain(workchainInvalid) {
+  }
+  explicit operator ShardIdFull() const {
+    return ShardIdFull{workchain, shard};
+  }
+  bool is_valid() const {
+    return workchain != workchainInvalid;
+  }
+  bool is_valid_ext() const {
+    return is_valid() && shard;
+  }
+  bool is_masterchain() const {
+    return workchain == masterchainId;
+  }
+  bool is_masterchain_ext() const {
+    return is_masterchain() && shard == shardIdAll;
+  }
+  bool is_valid_full() const {
+    return is_valid() && shard && !(shard & 7) && seqno <= 0x7fffffff && (!is_masterchain() || shard == shardIdAll);
+  }
+  bool invalidate() {
+    workchain = workchainInvalid;
+    return false;
+  }
+  bool invalidate_clear() {
+    shard = 0;
+    seqno = 0;
+    return invalidate();
+  }
+  bool operator==(const BlockId& other) const {
+    return workchain == other.workchain && seqno == other.seqno && shard == other.shard;
+  }
+  bool operator!=(const BlockId& other) const {
+    return !(workchain == other.workchain && seqno == other.seqno && shard == other.shard);
+  }
+  bool operator<(const BlockId& other) const {
+    return workchain < other.workchain ||
+           (workchain == other.workchain && (seqno < other.seqno || (seqno == other.seqno && shard < other.shard)));
+  }
+  bool operator<(const ShardIdFull& other) const {
+    return workchain < other.workchain || (workchain == other.workchain && shard < other.shard);
+  }
+  int pfx_len() const {
+    return shard_pfx_len(shard);
+  }
+  std::string to_str() const {
+    char buffer[64];
+    return std::string{buffer,
+                       (unsigned)snprintf(buffer, 63, "(%d,%016llx,%u)", workchain, (unsigned long long)shard, seqno)};
+  }
+};
+
+inline bool operator<(const ShardIdFull& x, const BlockId& y) {
+  return x.workchain < y.workchain || (x.workchain == y.workchain && x.shard < y.shard);
+}
+
+struct BlockIdExt {
+  BlockId id;
+  RootHash root_hash;
+  FileHash file_hash;
+  BlockIdExt(WorkchainId workchain, ShardId shard, BlockSeqno seqno, const RootHash& root_hash,
+             const FileHash& file_hash)
+      : id{workchain, shard, seqno}, root_hash(root_hash), file_hash(file_hash) {
+  }
+  BlockIdExt(BlockId id, const RootHash& root_hash, const FileHash& file_hash)
+      : id(id), root_hash(root_hash), file_hash(file_hash) {
+  }
+  BlockIdExt(BlockId id, const FileHash& file_hash) : id(id), file_hash(file_hash) {
+    root_hash.set_zero();
+  }
+  explicit BlockIdExt(BlockId id) : id(id) {
+    root_hash.set_zero();
+    file_hash.set_zero();
+  }
+  BlockIdExt() : id(workchainIdNotYet, 0, 0) {
+  }
+  bool invalidate() {
+    return id.invalidate();
+  }
+  bool invalidate_clear() {
+    root_hash.set_zero();
+    file_hash.set_zero();
+    return id.invalidate_clear();
+  }
+  bool operator==(const BlockIdExt& b) const {
+    return id == b.id && root_hash == b.root_hash && file_hash == b.file_hash;
+  }
+  bool operator!=(const BlockIdExt& b) const {
+    return !(id == b.id && root_hash == b.root_hash && file_hash == b.file_hash);
+  }
+  bool operator<(const BlockIdExt& b) const {
+    return id < b.id || (id == b.id && root_hash < b.root_hash) ||
+           (id == b.id && root_hash == b.root_hash && file_hash < b.file_hash);
+  }
+  ShardIdFull shard_full() const {
+    return ShardIdFull(id);
+  }
+  explicit operator ShardIdFull() const {
+    return ShardIdFull(id);
+  }
+  BlockSeqno seqno() const {
+    return id.seqno;
+  }
+  bool is_valid() const {
+    return id.is_valid();
+  }
+  bool is_valid_ext() const {
+    return id.is_valid_ext();
+  }
+  bool is_valid_full() const {
+    return id.is_valid_full() && !root_hash.is_zero() && !file_hash.is_zero();
+  }
+  bool is_masterchain() const {
+    return id.is_masterchain();
+  }
+  bool is_masterchain_ext() const {
+    return id.is_masterchain_ext();
+  }
+  std::string to_str() const {
+    return id.to_str() + ':' + root_hash.to_hex() + ':' + file_hash.to_hex();
+  }
+};
+
+struct ZeroStateIdExt {
+  WorkchainId workchain{workchainInvalid};
+  RootHash root_hash;
+  FileHash file_hash;
+  ZeroStateIdExt() = default;
+  ZeroStateIdExt(WorkchainId wc, const RootHash& rhash, const FileHash& fhash)
+      : workchain(wc), root_hash(rhash), file_hash(fhash) {
+  }
+  bool operator==(const ZeroStateIdExt& b) const {
+    return workchain == b.workchain && root_hash == b.root_hash && file_hash == b.file_hash;
+  }
+  bool operator!=(const ZeroStateIdExt& b) const {
+    return !(workchain == b.workchain && root_hash == b.root_hash && file_hash == b.file_hash);
+  }
+  bool operator<(const ZeroStateIdExt& b) const {
+    return file_hash < b.file_hash;
+  }
+  bool is_valid() const {
+    return workchain != workchainInvalid;
+  }
+  bool is_masterchain() const {
+    return workchain == masterchainId;
+  }
+  bool is_valid_full() const {
+    return is_valid() && !root_hash.is_zero() && !file_hash.is_zero();
+  }
+  std::string to_str() const {
+    return PSTRING() << workchain << ':' << root_hash.to_hex() << ':' << file_hash.to_hex();
+  }
+};
+
+//enum class BlockStatus { block_none, block_prevalidated, block_validated, block_applied };
+
+struct BlockSignature {
+  NodeIdShort node;
+  td::BufferSlice signature;
+  BlockSignature(const NodeIdShort& _node, td::BufferSlice _signature) : node(_node), signature(std::move(_signature)) {
+  }
+};
+
+struct ReceivedBlock {
+  BlockIdExt id;
+  td::BufferSlice data;
+};
+
+struct BlockBroadcast {
+  BlockIdExt block_id;
+  std::vector<BlockSignature> signatures;
+  CatchainSeqno catchain_seqno;
+  td::uint32 validator_set_hash;
+  td::BufferSlice data;
+  td::BufferSlice proof;
+};
+
+struct Ed25519_PrivateKey {
+  Bits256 _privkey;
+  explicit Ed25519_PrivateKey(const Bits256& x) : _privkey(x) {
+  }
+  explicit Ed25519_PrivateKey(const td::ConstBitPtr x) : _privkey(x) {
+  }
+  explicit Ed25519_PrivateKey(const td::UInt256& x) : _privkey(x.raw) {
+  }
+  Bits256 as_bits256() const {
+    return _privkey;
+  }
+  operator Bits256() const {
+    return _privkey;
+  }
+};
+
+struct Ed25519_PublicKey {
+  Bits256 _pubkey;
+  explicit Ed25519_PublicKey(const Bits256& x) : _pubkey(x) {
+  }
+  explicit Ed25519_PublicKey(const td::ConstBitPtr x) : _pubkey(x) {
+  }
+  explicit Ed25519_PublicKey(const td::UInt256& x) : _pubkey(x.raw) {
+  }
+  Bits256 as_bits256() const {
+    return _pubkey;
+  }
+  operator Bits256() const {
+    return _pubkey;
+  }
+  td::Slice as_slice() const {
+    return _pubkey.as_slice();
+  }
+  bool operator==(const Ed25519_PublicKey& other) const {
+    return _pubkey == other._pubkey;
+  }
+};
+
+// represents (the contents of) a block
+struct BlockCandidate {
+  BlockCandidate(Ed25519_PublicKey pubkey, BlockIdExt id, FileHash collated_file_hash, td::BufferSlice data,
+                 td::BufferSlice collated_data)
+      : pubkey(pubkey)
+      , id(id)
+      , collated_file_hash(collated_file_hash)
+      , data(std::move(data))
+      , collated_data(std::move(collated_data)) {
+  }
+  Ed25519_PublicKey pubkey;
+  BlockIdExt id;
+  FileHash collated_file_hash;
+  td::BufferSlice data;
+  td::BufferSlice collated_data;
+
+  BlockCandidate clone() const {
+    return BlockCandidate{pubkey, id, collated_file_hash, data.clone(), collated_data.clone()};
+  }
+};
+
+struct ValidatorDescr {
+  /* ton::validator::ValidatorFullId */ Ed25519_PublicKey key;
+  ValidatorWeight weight;
+  /* adnl::AdnlNodeIdShort */ Bits256 addr;
+  ValidatorDescr(const Ed25519_PublicKey& key_, ValidatorWeight weight_) : key(key_), weight(weight_) {
+    addr.set_zero();
+  }
+  ValidatorDescr(const Ed25519_PublicKey& key_, ValidatorWeight weight_, const Bits256& addr_)
+      : key(key_), weight(weight_), addr(addr_) {
+  }
+  bool operator==(const ValidatorDescr& other) const {
+    return key == other.key && weight == other.weight && addr == other.addr;
+  }
+  bool operator!=(const ValidatorDescr& other) const {
+    return !(operator==(other));
+  }
+};
+
+struct ValidatorSessionConfig {
+  td::uint32 proto_version = 0;
+
+  /* td::Clocks::Duration */ double catchain_idle_timeout = 16.0;
+  td::uint32 catchain_max_deps = 4;
+
+  td::uint32 round_candidates = 3;
+  /* td::Clocks::Duration */ double next_candidate_delay = 2.0;
+  td::uint32 round_attempt_duration = 16;
+  td::uint32 max_round_attempts = 4;
+
+  td::uint32 max_block_size = (4 << 20);
+  td::uint32 max_collated_data_size = (4 << 20);
+};
+
+}  // namespace ton
diff --git a/submodules/ton/tonlib-src/tonlib/CMakeLists.txt b/submodules/ton/tonlib-src/tonlib/CMakeLists.txt
new file mode 100644
index 0000000000..d3bf247099
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/CMakeLists.txt
@@ -0,0 +1,160 @@
+cmake_minimum_required(VERSION 3.0.2 FATAL_ERROR)
+
+if (NOT OPENSSL_FOUND)
+  find_package(OpenSSL REQUIRED)
+endif()
+
+set(TONLIB_SOURCE
+  tonlib/Client.cpp
+  tonlib/Config.cpp
+  tonlib/ExtClient.cpp
+  tonlib/ExtClientLazy.cpp
+  tonlib/GenericAccount.cpp
+  tonlib/KeyStorage.cpp
+  tonlib/LastBlock.cpp
+  tonlib/TestGiver.cpp
+  tonlib/TestWallet.cpp
+  tonlib/TonlibClient.cpp
+  tonlib/utils.cpp
+
+  tonlib/Client.h
+  tonlib/Config.h
+  tonlib/ExtClient.h
+  tonlib/ExtClientLazy.h
+  tonlib/GenericAccount.h
+  tonlib/KeyStorage.h
+  tonlib/LastBlock.h
+  tonlib/TestGiver.h
+  tonlib/TestWallet.h
+  tonlib/TonlibCallback.h
+  tonlib/TonlibClient.h
+  tonlib/utils.h
+
+  tonlib/keys/bip39.cpp
+  tonlib/keys/DecryptedKey.cpp
+  tonlib/keys/EncryptedKey.cpp
+  tonlib/keys/Mnemonic.cpp
+  tonlib/keys/SimpleEncryption.cpp
+  tonlib/keys/bip39.h
+  tonlib/keys/DecryptedKey.h
+  tonlib/keys/EncryptedKey.h
+  tonlib/keys/Mnemonic.h
+  tonlib/keys/SimpleEncryption.h
+)
+
+set(TONLIB_OFFLINE_TEST_SOURCE ${CMAKE_CURRENT_SOURCE_DIR}/test/offline.cpp PARENT_SCOPE)
+set(TONLIB_ONLINE_TEST_SOURCE ${CMAKE_CURRENT_SOURCE_DIR}/test/online.cpp PARENT_SCOPE)
+
+add_library(tonlib STATIC ${TONLIB_SOURCE})
+
+target_include_directories(tonlib PUBLIC
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>/..
+  $<BUILD_INTERFACE:${OPENSSL_INCLUDE_DIR}>
+)
+target_link_libraries(tonlib PRIVATE tdactor adnllite tl_lite_api tl-lite-utils ton_crypto ton_block lite-client-common)
+target_link_libraries(tonlib PUBLIC tdutils tl_tonlib_api)
+
+if (TONLIB_ENABLE_JNI AND NOT ANDROID) # jni is available by default on Android
+  if (NOT JNI_FOUND)
+    find_package(JNI REQUIRED)
+  endif()
+  message(STATUS "Found JNI: ${JNI_INCLUDE_DIRS} ${JNI_LIBRARIES}")
+  target_include_directories(tonlib PUBLIC ${JAVA_INCLUDE_PATH} ${JAVA_INCLUDE_PATH2})
+  target_link_libraries(tonlib PUBLIC ${JAVA_JVM_LIBRARY})
+endif()
+
+add_executable(tonlib-cli tonlib/tonlib-cli.cpp)
+target_link_libraries(tonlib-cli tonlib tdactor tdutils terminal)
+
+if (NOT CMAKE_CROSSCOMPILING)
+  if (TD_ENABLE_JNI)
+	  #FIXME
+	  #add_dependencies(tonlib tonlib_generate_java_api)
+  endif()
+endif() 
+add_library(tonlibjson_private STATIC tonlib/ClientJson.cpp tonlib/ClientJson.h)
+target_include_directories(tonlibjson_private PUBLIC
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>
+  $<BUILD_INTERFACE:${TL_TD_AUTO_INCLUDES}>)
+target_link_libraries(tonlibjson_private PUBLIC tonlib PRIVATE tl_tonlib_api_json)
+
+set(TONLIB_JSON_HEADERS tonlib/tonlib_client_json.h)
+set(TONLIB_JSON_SOURCE tonlib/tonlib_client_json.cpp)
+
+include(GenerateExportHeader)
+
+add_library(tonlibjson SHARED ${TONLIB_JSON_SOURCE} ${TONLIB_JSON_HEADERS})
+target_link_libraries(tonlibjson PRIVATE tonlibjson_private)
+generate_export_header(tonlibjson EXPORT_FILE_NAME ${CMAKE_CURRENT_BINARY_DIR}/tonlib/tonlibjson_export.h)
+target_include_directories(tonlibjson PUBLIC
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_BINARY_DIR}>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+if (APPLE)
+  set_target_properties(tonlibjson PROPERTIES LINK_FLAGS "-Wl,-exported_symbols_list,${CMAKE_CURRENT_SOURCE_DIR}/tonlibclientjson_export_list")
+endif()
+
+add_library(tonlibjson_static STATIC ${TONLIB_JSON_SOURCE} ${TONLIB_JSON_HEADERS})
+target_link_libraries(tonlibjson_static PRIVATE tonlibjson_private)
+target_compile_definitions(tonlibjson_static PUBLIC TONLIBJSON_STATIC_DEFINE)
+target_include_directories(tonlibjson_static PUBLIC
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_BINARY_DIR}>
+  $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+
+add_library(TonlibJson INTERFACE)
+target_link_libraries(TonlibJson INTERFACE tonlibjson)
+
+add_library(Tonlib::TonlibJson ALIAS TonlibJson)
+
+add_library(Tonlib INTERFACE)
+target_link_libraries(Tonlib INTERFACE tonlib)
+
+add_library(Tonlib::Tonlib ALIAS Tonlib)
+
+install(TARGETS tonlibjson TonlibJson EXPORT Tonlib
+  LIBRARY DESTINATION lib
+  ARCHIVE DESTINATION lib
+  RUNTIME DESTINATION bin
+  INCLUDES DESTINATION include
+)
+
+if (NOT TON_USE_ABSEIL)
+install(TARGETS tdnet keys crc32c tdactor adnllite tl_api tl-utils tl_lite_api tl-lite-utils ton_crypto ton_block
+  tdutils tl_tonlib_api tonlib lite-client-common Tonlib EXPORT Tonlib
+  LIBRARY DESTINATION lib
+  ARCHIVE DESTINATION lib
+  RUNTIME DESTINATION bin
+  INCLUDES DESTINATION include
+)
+install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/tonlib/Client.h DESTINATION include/tonlib/)
+install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/../tl/generate/auto/tl/tonlib_api.h DESTINATION include/auto/tl/)
+install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/../tl/tl/TlObject.h DESTINATION include/tl/)
+install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/../tdutils/td/utils/int_types.h DESTINATION include/td/utils/)
+install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/../tdutils/td/utils/Slice-decl.h DESTINATION include/td/utils/)
+install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/../tdutils/td/utils/Slice.h DESTINATION include/td/utils/)
+install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/../tdutils/td/utils/common.h DESTINATION include/td/utils/)
+install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/../tdutils/td/utils/unique_ptr.h DESTINATION include/td/utils/)
+install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/../tdutils/td/utils/check.h DESTINATION include/td/utils/)
+install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/../tdutils/td/utils/SharedSlice.h DESTINATION include/td/utils/)
+install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/../tdutils/td/utils/port/platform.h DESTINATION include/td/utils/port)
+install(FILES ${CMAKE_CURRENT_BINARY_DIR}/../tdutils/td/utils/config.h DESTINATION include/td/utils/)
+endif()
+
+install(FILES ${TONLIB_JSON_HEADERS} ${CMAKE_CURRENT_BINARY_DIR}/tonlib/tonlibjson_export.h DESTINATION include/tonlib/)
+
+install(EXPORT Tonlib
+  FILE TonlibTargets.cmake
+  NAMESPACE Tonlib::
+  DESTINATION lib/cmake/Tonlib
+)
+include(CMakePackageConfigHelpers)
+write_basic_package_version_file("TonlibConfigVersion.cmake"
+  VERSION ${TON_VERSION}
+  COMPATIBILITY ExactVersion
+)
+install(FILES "TonlibConfig.cmake" "${CMAKE_CURRENT_BINARY_DIR}/TonlibConfigVersion.cmake"
+  DESTINATION lib/cmake/Tonlib
+)
+
+# Add SOVERSION to shared libraries
+set_property(TARGET tonlibjson PROPERTY SOVERSION ${TON_VERSION})
diff --git a/submodules/ton/tonlib-src/tonlib/TonlibConfig.cmake b/submodules/ton/tonlib-src/tonlib/TonlibConfig.cmake
new file mode 100644
index 0000000000..5f3a33ebf7
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/TonlibConfig.cmake
@@ -0,0 +1,3 @@
+include(CMakeFindDependencyMacro)
+#TODO: write all external dependencies
+include("${CMAKE_CURRENT_LIST_DIR}/TonlibTargets.cmake")
diff --git a/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeCache.txt b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeCache.txt
new file mode 100644
index 0000000000..4b041ac97b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeCache.txt
@@ -0,0 +1,385 @@
+# This is the CMakeCache file.
+# For build in directory: /Users/arseny30/code/ton/tonlib/build/build/build-iOS
+# It was generated by CMake: /usr/local/Cellar/cmake/3.15.1/bin/cmake
+# You can edit this file to change values found and used by cmake.
+# If you do not want to change any of the values, simply exit the editor.
+# If you do want to change a value, simply edit, save, and exit the editor.
+# The syntax for the file is as follows:
+# KEY:TYPE=VALUE
+# KEY is the name of a variable in the cache.
+# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
+# VALUE is the current value for the KEY.
+
+########################
+# EXTERNAL cache entries
+########################
+
+CMAKE_AR:FILEPATH=ar
+
+//Choose the type of build, options are: None Debug Release RelWithDebInfo
+// MinSizeRel ...
+CMAKE_BUILD_TYPE:STRING=Release
+
+//Enable/Disable color output during build.
+CMAKE_COLOR_MAKEFILE:BOOL=ON
+
+//Flags used by the CXX compiler during all build types.
+CMAKE_CXX_FLAGS:STRING=-fembed-bitcode -fvisibility-inlines-hidden
+
+//Flags used by the CXX compiler during DEBUG builds.
+CMAKE_CXX_FLAGS_DEBUG:STRING=-g
+
+//Flags used by the CXX compiler during MINSIZEREL builds.
+CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
+
+//Flags used by the CXX compiler during RELEASE builds.
+CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
+
+//Flags used by the CXX compiler during RELWITHDEBINFO builds.
+CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
+
+//Flags used by the C compiler during all build types.
+CMAKE_C_FLAGS:STRING=-fembed-bitcode
+
+//Flags used by the C compiler during DEBUG builds.
+CMAKE_C_FLAGS_DEBUG:STRING=-g
+
+//Flags used by the C compiler during MINSIZEREL builds.
+CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
+
+//Flags used by the C compiler during RELEASE builds.
+CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
+
+//Flags used by the C compiler during RELWITHDEBINFO builds.
+CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
+
+//Executable file format
+CMAKE_EXECUTABLE_FORMAT:STRING=MACHO
+
+//Flags used by the linker during all build types.
+CMAKE_EXE_LINKER_FLAGS:STRING=
+
+//Flags used by the linker during DEBUG builds.
+CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
+
+//Flags used by the linker during MINSIZEREL builds.
+CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
+
+//Flags used by the linker during RELEASE builds.
+CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
+
+//Flags used by the linker during RELWITHDEBINFO builds.
+CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
+
+//Enable/Disable output of compile commands during generation.
+CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
+
+//iOS find search path root
+CMAKE_FIND_ROOT_PATH:STRING=/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer;/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk
+
+//Path to a program.
+CMAKE_INSTALL_NAME_TOOL:FILEPATH=/usr/bin/install_name_tool
+
+//Install path prefix, prepended onto install directories.
+CMAKE_INSTALL_PREFIX:PATH=/Users/arseny30/code/ton/tonlib/build/build/install-iOS
+
+//Location of iOS Platform
+CMAKE_IOS_DEVELOPER_ROOT:PATH=/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer
+
+//Location of the selected iOS SDK
+CMAKE_IOS_SDK_ROOT:PATH=/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk
+
+//Path to a program.
+CMAKE_LINKER:FILEPATH=CMAKE_LINKER-NOTFOUND
+
+//Path to a program.
+CMAKE_MAKE_PROGRAM:FILEPATH=/Applications/Xcode.app/Contents/Developer/usr/bin/make
+
+//Flags used by the linker during the creation of modules during
+// all build types.
+CMAKE_MODULE_LINKER_FLAGS:STRING=
+
+//Flags used by the linker during the creation of modules during
+// DEBUG builds.
+CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
+
+//Flags used by the linker during the creation of modules during
+// MINSIZEREL builds.
+CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
+
+//Flags used by the linker during the creation of modules during
+// RELEASE builds.
+CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
+
+//Flags used by the linker during the creation of modules during
+// RELWITHDEBINFO builds.
+CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
+
+//Path to a program.
+CMAKE_NM:FILEPATH=CMAKE_NM-NOTFOUND
+
+//Path to a program.
+CMAKE_OBJCOPY:FILEPATH=CMAKE_OBJCOPY-NOTFOUND
+
+//Path to a program.
+CMAKE_OBJDUMP:FILEPATH=CMAKE_OBJDUMP-NOTFOUND
+
+//Build architecture for iOS
+CMAKE_OSX_ARCHITECTURES:STRING=armv7;arm64
+
+//Force unset of the deployment target for iOS
+CMAKE_OSX_DEPLOYMENT_TARGET:STRING=
+
+//Sysroot used for iOS support
+CMAKE_OSX_SYSROOT:PATH=/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk
+
+//Value Computed by CMake
+CMAKE_PROJECT_DESCRIPTION:STATIC=
+
+//Value Computed by CMake
+CMAKE_PROJECT_HOMEPAGE_URL:STATIC=
+
+//Value Computed by CMake
+CMAKE_PROJECT_NAME:STATIC=Project
+
+CMAKE_RANLIB:FILEPATH=ranlib
+
+//Flags used by the linker during the creation of shared libraries
+// during all build types.
+CMAKE_SHARED_LINKER_FLAGS:STRING=-fapplication-extension
+
+//Flags used by the linker during the creation of shared libraries
+// during DEBUG builds.
+CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
+
+//Flags used by the linker during the creation of shared libraries
+// during MINSIZEREL builds.
+CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
+
+//Flags used by the linker during the creation of shared libraries
+// during RELEASE builds.
+CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
+
+//Flags used by the linker during the creation of shared libraries
+// during RELWITHDEBINFO builds.
+CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
+
+//If set, runtime paths are not added when installing shared libraries,
+// but are added when building.
+CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
+
+//If set, runtime paths are not added when using shared libraries.
+CMAKE_SKIP_RPATH:BOOL=NO
+
+//Flags used by the linker during the creation of static libraries
+// during all build types.
+CMAKE_STATIC_LINKER_FLAGS:STRING=
+
+//Flags used by the linker during the creation of static libraries
+// during DEBUG builds.
+CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
+
+//Flags used by the linker during the creation of static libraries
+// during MINSIZEREL builds.
+CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
+
+//Flags used by the linker during the creation of static libraries
+// during RELEASE builds.
+CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
+
+//Flags used by the linker during the creation of static libraries
+// during RELWITHDEBINFO builds.
+CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
+
+//Path to a program.
+CMAKE_STRIP:FILEPATH=CMAKE_STRIP-NOTFOUND
+
+//The CMake toolchain file
+CMAKE_TOOLCHAIN_FILE:FILEPATH=/Users/arseny30/code/ton/tonlib/ios/iOS.cmake
+
+//If this value is on, makefiles will be generated without the
+// .SILENT directive, and all commands will be echoed to the console
+// during the make.  This is useful for debugging only. With Visual
+// Studio IDE projects all commands are done without /nologo.
+CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
+
+//Minimum iOS version
+IOS_DEPLOYMENT_TARGET:STRING=
+
+//Type of iOS Platform
+IOS_PLATFORM:STRING=OS
+
+//No help, variable specified on the command line.
+OPENSSL_CRYPTO_LIBRARY:UNINITIALIZED=/Users/arseny30/code/ton/tonlib/ios/openssl/iOS/lib/libcrypto.a
+
+//No help, variable specified on the command line.
+OPENSSL_FOUND:UNINITIALIZED=1
+
+//No help, variable specified on the command line.
+OPENSSL_INCLUDE_DIR:UNINITIALIZED=/Users/arseny30/code/ton/tonlib/ios/openssl/iOS/include
+
+//No help, variable specified on the command line.
+OPENSSL_LIBRARIES:UNINITIALIZED=/Users/arseny30/code/ton/tonlib/ios/openssl/iOS/lib/libcrypto.a;/Users/arseny30/code/ton/tonlib/ios/openssl/iOS/lib/libssl.a
+
+PKG_CONFIG_EXECUTABLE:FILEPATH=pkg-config
+
+//Value Computed by CMake
+Project_BINARY_DIR:STATIC=/Users/arseny30/code/ton/tonlib/build/build/build-iOS
+
+//Value Computed by CMake
+Project_SOURCE_DIR:STATIC=/Users/arseny30/code/ton/tonlib
+
+//No help, variable specified on the command line.
+TON_ARCH:UNINITIALIZED=armv7
+
+//Dependencies for the target
+tonlib_LIB_DEPENDS:STATIC=general;tdactor;general;adnllite;general;tl_lite_api;general;tl-lite-utils;general;ton_crypto;general;ton_block;general;tdutils;general;tl_tonlib_api;
+
+//Dependencies for the target
+tonlibjson_LIB_DEPENDS:STATIC=general;tonlibjson_private;
+
+//Dependencies for the target
+tonlibjson_private_LIB_DEPENDS:STATIC=general;tonlib;general;tl_tonlib_api_json;
+
+//Dependencies for the target
+tonlibjson_static_LIB_DEPENDS:STATIC=general;tonlibjson_private;
+
+
+########################
+# INTERNAL cache entries
+########################
+
+//ADVANCED property for variable: CMAKE_AR
+CMAKE_AR-ADVANCED:INTERNAL=1
+//This is the directory where this CMakeCache.txt was created
+CMAKE_CACHEFILE_DIR:INTERNAL=/Users/arseny30/code/ton/tonlib/build/build/build-iOS
+//Major version of cmake used to create the current loaded cache
+CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
+//Minor version of cmake used to create the current loaded cache
+CMAKE_CACHE_MINOR_VERSION:INTERNAL=15
+//Patch version of cmake used to create the current loaded cache
+CMAKE_CACHE_PATCH_VERSION:INTERNAL=1
+//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
+CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
+//Path to CMake executable.
+CMAKE_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.15.1/bin/cmake
+//Path to cpack program executable.
+CMAKE_CPACK_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.15.1/bin/cpack
+//Path to ctest program executable.
+CMAKE_CTEST_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.15.1/bin/ctest
+//ADVANCED property for variable: CMAKE_CXX_FLAGS
+CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
+CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
+CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
+CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
+CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS
+CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
+CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
+CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
+CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
+CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//Path to cache edit program executable.
+CMAKE_EDIT_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.15.1/bin/ccmake
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
+CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
+CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
+CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
+CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
+CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
+CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
+//Name of external makefile project generator.
+CMAKE_EXTRA_GENERATOR:INTERNAL=
+//Name of generator.
+CMAKE_GENERATOR:INTERNAL=Unix Makefiles
+//Generator instance identifier.
+CMAKE_GENERATOR_INSTANCE:INTERNAL=
+//Name of generator platform.
+CMAKE_GENERATOR_PLATFORM:INTERNAL=
+//Name of generator toolset.
+CMAKE_GENERATOR_TOOLSET:INTERNAL=
+//Source directory with the top level CMakeLists.txt file for this
+// project
+CMAKE_HOME_DIRECTORY:INTERNAL=/Users/arseny30/code/ton/tonlib
+//ADVANCED property for variable: CMAKE_INSTALL_NAME_TOOL
+CMAKE_INSTALL_NAME_TOOL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_LINKER
+CMAKE_LINKER-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
+CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
+CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
+CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
+CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
+CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
+CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_NM
+CMAKE_NM-ADVANCED:INTERNAL=1
+//number of local generators
+CMAKE_NUMBER_OF_MAKEFILES:INTERNAL=1
+//ADVANCED property for variable: CMAKE_OBJCOPY
+CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_OBJDUMP
+CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
+//Platform information initialized
+CMAKE_PLATFORM_INFO_INITIALIZED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_RANLIB
+CMAKE_RANLIB-ADVANCED:INTERNAL=1
+//Path to CMake installation.
+CMAKE_ROOT:INTERNAL=/usr/local/Cellar/cmake/3.15.1/share/cmake
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
+CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
+CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
+CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
+CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
+CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
+CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SKIP_RPATH
+CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
+CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
+CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
+CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
+CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
+CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STRIP
+CMAKE_STRIP-ADVANCED:INTERNAL=1
+//uname command
+CMAKE_UNAME:INTERNAL=/usr/bin/uname
+//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
+CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
+//Compiler support for a deprecated attribute
+COMPILER_HAS_DEPRECATED:INTERNAL=1
+//Test COMPILER_HAS_DEPRECATED_ATTR
+COMPILER_HAS_DEPRECATED_ATTR:INTERNAL=1
+//Test COMPILER_HAS_HIDDEN_INLINE_VISIBILITY
+COMPILER_HAS_HIDDEN_INLINE_VISIBILITY:INTERNAL=1
+//Test COMPILER_HAS_HIDDEN_VISIBILITY
+COMPILER_HAS_HIDDEN_VISIBILITY:INTERNAL=1
+
diff --git a/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeCCompiler.cmake b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeCCompiler.cmake
new file mode 100644
index 0000000000..bdd8c98523
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeCCompiler.cmake
@@ -0,0 +1,76 @@
+set(CMAKE_C_COMPILER "/usr/bin/gcc")
+set(CMAKE_C_COMPILER_ARG1 "")
+set(CMAKE_C_COMPILER_ID "AppleClang")
+set(CMAKE_C_COMPILER_VERSION "10.0.1.10010046")
+set(CMAKE_C_COMPILER_VERSION_INTERNAL "")
+set(CMAKE_C_COMPILER_WRAPPER "")
+set(CMAKE_C_STANDARD_COMPUTED_DEFAULT "11")
+set(CMAKE_C_COMPILE_FEATURES "c_std_90;c_function_prototypes;c_std_99;c_restrict;c_variadic_macros;c_std_11;c_static_assert")
+set(CMAKE_C90_COMPILE_FEATURES "c_std_90;c_function_prototypes")
+set(CMAKE_C99_COMPILE_FEATURES "c_std_99;c_restrict;c_variadic_macros")
+set(CMAKE_C11_COMPILE_FEATURES "c_std_11;c_static_assert")
+
+set(CMAKE_C_PLATFORM_ID "Darwin")
+set(CMAKE_C_SIMULATE_ID "")
+set(CMAKE_C_COMPILER_FRONTEND_VARIANT "")
+set(CMAKE_C_SIMULATE_VERSION "")
+
+
+
+set(CMAKE_AR "ar")
+set(CMAKE_C_COMPILER_AR "")
+set(CMAKE_RANLIB "ranlib")
+set(CMAKE_C_COMPILER_RANLIB "")
+set(CMAKE_LINKER "CMAKE_LINKER-NOTFOUND")
+set(CMAKE_MT "")
+set(CMAKE_COMPILER_IS_GNUCC )
+set(CMAKE_C_COMPILER_LOADED 1)
+set(CMAKE_C_COMPILER_WORKS TRUE)
+set(CMAKE_C_ABI_COMPILED TRUE)
+set(CMAKE_COMPILER_IS_MINGW )
+set(CMAKE_COMPILER_IS_CYGWIN )
+if(CMAKE_COMPILER_IS_CYGWIN)
+  set(CYGWIN 1)
+  set(UNIX 1)
+endif()
+
+set(CMAKE_C_COMPILER_ENV_VAR "CC")
+
+if(CMAKE_COMPILER_IS_MINGW)
+  set(MINGW 1)
+endif()
+set(CMAKE_C_COMPILER_ID_RUN 1)
+set(CMAKE_C_SOURCE_FILE_EXTENSIONS c;m)
+set(CMAKE_C_IGNORE_EXTENSIONS h;H;o;O;obj;OBJ;def;DEF;rc;RC)
+set(CMAKE_C_LINKER_PREFERENCE 10)
+
+# Save compiler ABI information.
+set(CMAKE_C_SIZEOF_DATA_PTR "8")
+set(CMAKE_C_COMPILER_ABI "")
+set(CMAKE_C_LIBRARY_ARCHITECTURE "")
+
+if(CMAKE_C_SIZEOF_DATA_PTR)
+  set(CMAKE_SIZEOF_VOID_P "${CMAKE_C_SIZEOF_DATA_PTR}")
+endif()
+
+if(CMAKE_C_COMPILER_ABI)
+  set(CMAKE_INTERNAL_PLATFORM_ABI "${CMAKE_C_COMPILER_ABI}")
+endif()
+
+if(CMAKE_C_LIBRARY_ARCHITECTURE)
+  set(CMAKE_LIBRARY_ARCHITECTURE "")
+endif()
+
+set(CMAKE_C_CL_SHOWINCLUDES_PREFIX "")
+if(CMAKE_C_CL_SHOWINCLUDES_PREFIX)
+  set(CMAKE_CL_SHOWINCLUDES_PREFIX "${CMAKE_C_CL_SHOWINCLUDES_PREFIX}")
+endif()
+
+
+
+
+
+set(CMAKE_C_IMPLICIT_INCLUDE_DIRECTORIES "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include;/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include;/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include")
+set(CMAKE_C_IMPLICIT_LINK_LIBRARIES "")
+set(CMAKE_C_IMPLICIT_LINK_DIRECTORIES "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib")
+set(CMAKE_C_IMPLICIT_LINK_FRAMEWORK_DIRECTORIES "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks")
diff --git a/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeCXXCompiler.cmake b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeCXXCompiler.cmake
new file mode 100644
index 0000000000..cf5ef31991
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeCXXCompiler.cmake
@@ -0,0 +1,79 @@
+set(CMAKE_CXX_COMPILER "/usr/bin/g++")
+set(CMAKE_CXX_COMPILER_ARG1 "")
+set(CMAKE_CXX_COMPILER_ID "AppleClang")
+set(CMAKE_CXX_COMPILER_VERSION "10.0.1.10010046")
+set(CMAKE_CXX_COMPILER_VERSION_INTERNAL "")
+set(CMAKE_CXX_COMPILER_WRAPPER "")
+set(CMAKE_CXX_STANDARD_COMPUTED_DEFAULT "98")
+set(CMAKE_CXX_COMPILE_FEATURES "cxx_std_98;cxx_template_template_parameters;cxx_std_11;cxx_alias_templates;cxx_alignas;cxx_alignof;cxx_attributes;cxx_auto_type;cxx_constexpr;cxx_decltype;cxx_decltype_incomplete_return_types;cxx_default_function_template_args;cxx_defaulted_functions;cxx_defaulted_move_initializers;cxx_delegating_constructors;cxx_deleted_functions;cxx_enum_forward_declarations;cxx_explicit_conversions;cxx_extended_friend_declarations;cxx_extern_templates;cxx_final;cxx_func_identifier;cxx_generalized_initializers;cxx_inheriting_constructors;cxx_inline_namespaces;cxx_lambdas;cxx_local_type_template_args;cxx_long_long_type;cxx_noexcept;cxx_nonstatic_member_init;cxx_nullptr;cxx_override;cxx_range_for;cxx_raw_string_literals;cxx_reference_qualified_functions;cxx_right_angle_brackets;cxx_rvalue_references;cxx_sizeof_member;cxx_static_assert;cxx_strong_enums;cxx_thread_local;cxx_trailing_return_types;cxx_unicode_literals;cxx_uniform_initialization;cxx_unrestricted_unions;cxx_user_literals;cxx_variadic_macros;cxx_variadic_templates;cxx_std_14;cxx_aggregate_default_initializers;cxx_attribute_deprecated;cxx_binary_literals;cxx_contextual_conversions;cxx_decltype_auto;cxx_digit_separators;cxx_generic_lambdas;cxx_lambda_init_captures;cxx_relaxed_constexpr;cxx_return_type_deduction;cxx_variable_templates;cxx_std_17;cxx_std_20")
+set(CMAKE_CXX98_COMPILE_FEATURES "cxx_std_98;cxx_template_template_parameters")
+set(CMAKE_CXX11_COMPILE_FEATURES "cxx_std_11;cxx_alias_templates;cxx_alignas;cxx_alignof;cxx_attributes;cxx_auto_type;cxx_constexpr;cxx_decltype;cxx_decltype_incomplete_return_types;cxx_default_function_template_args;cxx_defaulted_functions;cxx_defaulted_move_initializers;cxx_delegating_constructors;cxx_deleted_functions;cxx_enum_forward_declarations;cxx_explicit_conversions;cxx_extended_friend_declarations;cxx_extern_templates;cxx_final;cxx_func_identifier;cxx_generalized_initializers;cxx_inheriting_constructors;cxx_inline_namespaces;cxx_lambdas;cxx_local_type_template_args;cxx_long_long_type;cxx_noexcept;cxx_nonstatic_member_init;cxx_nullptr;cxx_override;cxx_range_for;cxx_raw_string_literals;cxx_reference_qualified_functions;cxx_right_angle_brackets;cxx_rvalue_references;cxx_sizeof_member;cxx_static_assert;cxx_strong_enums;cxx_thread_local;cxx_trailing_return_types;cxx_unicode_literals;cxx_uniform_initialization;cxx_unrestricted_unions;cxx_user_literals;cxx_variadic_macros;cxx_variadic_templates")
+set(CMAKE_CXX14_COMPILE_FEATURES "cxx_std_14;cxx_aggregate_default_initializers;cxx_attribute_deprecated;cxx_binary_literals;cxx_contextual_conversions;cxx_decltype_auto;cxx_digit_separators;cxx_generic_lambdas;cxx_lambda_init_captures;cxx_relaxed_constexpr;cxx_return_type_deduction;cxx_variable_templates")
+set(CMAKE_CXX17_COMPILE_FEATURES "cxx_std_17")
+set(CMAKE_CXX20_COMPILE_FEATURES "cxx_std_20")
+
+set(CMAKE_CXX_PLATFORM_ID "Darwin")
+set(CMAKE_CXX_SIMULATE_ID "")
+set(CMAKE_CXX_COMPILER_FRONTEND_VARIANT "")
+set(CMAKE_CXX_SIMULATE_VERSION "")
+
+
+
+set(CMAKE_AR "ar")
+set(CMAKE_CXX_COMPILER_AR "")
+set(CMAKE_RANLIB "ranlib")
+set(CMAKE_CXX_COMPILER_RANLIB "")
+set(CMAKE_LINKER "CMAKE_LINKER-NOTFOUND")
+set(CMAKE_MT "")
+set(CMAKE_COMPILER_IS_GNUCXX )
+set(CMAKE_CXX_COMPILER_LOADED 1)
+set(CMAKE_CXX_COMPILER_WORKS TRUE)
+set(CMAKE_CXX_ABI_COMPILED TRUE)
+set(CMAKE_COMPILER_IS_MINGW )
+set(CMAKE_COMPILER_IS_CYGWIN )
+if(CMAKE_COMPILER_IS_CYGWIN)
+  set(CYGWIN 1)
+  set(UNIX 1)
+endif()
+
+set(CMAKE_CXX_COMPILER_ENV_VAR "CXX")
+
+if(CMAKE_COMPILER_IS_MINGW)
+  set(MINGW 1)
+endif()
+set(CMAKE_CXX_COMPILER_ID_RUN 1)
+set(CMAKE_CXX_IGNORE_EXTENSIONS inl;h;hpp;HPP;H;o;O;obj;OBJ;def;DEF;rc;RC)
+set(CMAKE_CXX_SOURCE_FILE_EXTENSIONS C;M;c++;cc;cpp;cxx;mm;CPP)
+set(CMAKE_CXX_LINKER_PREFERENCE 30)
+set(CMAKE_CXX_LINKER_PREFERENCE_PROPAGATES 1)
+
+# Save compiler ABI information.
+set(CMAKE_CXX_SIZEOF_DATA_PTR "8")
+set(CMAKE_CXX_COMPILER_ABI "")
+set(CMAKE_CXX_LIBRARY_ARCHITECTURE "")
+
+if(CMAKE_CXX_SIZEOF_DATA_PTR)
+  set(CMAKE_SIZEOF_VOID_P "${CMAKE_CXX_SIZEOF_DATA_PTR}")
+endif()
+
+if(CMAKE_CXX_COMPILER_ABI)
+  set(CMAKE_INTERNAL_PLATFORM_ABI "${CMAKE_CXX_COMPILER_ABI}")
+endif()
+
+if(CMAKE_CXX_LIBRARY_ARCHITECTURE)
+  set(CMAKE_LIBRARY_ARCHITECTURE "")
+endif()
+
+set(CMAKE_CXX_CL_SHOWINCLUDES_PREFIX "")
+if(CMAKE_CXX_CL_SHOWINCLUDES_PREFIX)
+  set(CMAKE_CL_SHOWINCLUDES_PREFIX "${CMAKE_CXX_CL_SHOWINCLUDES_PREFIX}")
+endif()
+
+
+
+
+
+set(CMAKE_CXX_IMPLICIT_INCLUDE_DIRECTORIES "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include/c++/v1;/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include;/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include;/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include")
+set(CMAKE_CXX_IMPLICIT_LINK_LIBRARIES "")
+set(CMAKE_CXX_IMPLICIT_LINK_DIRECTORIES "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib")
+set(CMAKE_CXX_IMPLICIT_LINK_FRAMEWORK_DIRECTORIES "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks")
diff --git a/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeDetermineCompilerABI_C.bin b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeDetermineCompilerABI_C.bin
new file mode 100755
index 0000000000..8e72d080b5
Binary files /dev/null and b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeDetermineCompilerABI_C.bin differ
diff --git a/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeDetermineCompilerABI_CXX.bin b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeDetermineCompilerABI_CXX.bin
new file mode 100755
index 0000000000..0af87cedc0
Binary files /dev/null and b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeDetermineCompilerABI_CXX.bin differ
diff --git a/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeSystem.cmake b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeSystem.cmake
new file mode 100644
index 0000000000..d209cae009
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CMakeSystem.cmake
@@ -0,0 +1,15 @@
+set(CMAKE_HOST_SYSTEM "Darwin-18.7.0")
+set(CMAKE_HOST_SYSTEM_NAME "Darwin")
+set(CMAKE_HOST_SYSTEM_VERSION "18.7.0")
+set(CMAKE_HOST_SYSTEM_PROCESSOR "x86_64")
+
+include("/Users/arseny30/code/ton/tonlib/ios/iOS.cmake")
+
+set(CMAKE_SYSTEM "Darwin-1")
+set(CMAKE_SYSTEM_NAME "Darwin")
+set(CMAKE_SYSTEM_VERSION "1")
+set(CMAKE_SYSTEM_PROCESSOR "")
+
+set(CMAKE_CROSSCOMPILING "TRUE")
+
+set(CMAKE_SYSTEM_LOADED 1)
diff --git a/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdC/CMakeCCompilerId.c b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdC/CMakeCCompilerId.c
new file mode 100644
index 0000000000..917e8b9870
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdC/CMakeCCompilerId.c
@@ -0,0 +1,665 @@
+#ifdef __cplusplus
+# error "A C++ compiler has been selected for C."
+#endif
+
+#if defined(__18CXX)
+# define ID_VOID_MAIN
+#endif
+#if defined(__CLASSIC_C__)
+/* cv-qualifiers did not exist in K&R C */
+# define const
+# define volatile
+#endif
+
+
+/* Version number components: V=Version, R=Revision, P=Patch
+   Version date components:   YYYY=Year, MM=Month,   DD=Day  */
+
+#if defined(__INTEL_COMPILER) || defined(__ICC)
+# define COMPILER_ID "Intel"
+# if defined(_MSC_VER)
+#  define SIMULATE_ID "MSVC"
+# endif
+# if defined(__GNUC__)
+#  define SIMULATE_ID "GNU"
+# endif
+  /* __INTEL_COMPILER = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__INTEL_COMPILER/100)
+# define COMPILER_VERSION_MINOR DEC(__INTEL_COMPILER/10 % 10)
+# if defined(__INTEL_COMPILER_UPDATE)
+#  define COMPILER_VERSION_PATCH DEC(__INTEL_COMPILER_UPDATE)
+# else
+#  define COMPILER_VERSION_PATCH DEC(__INTEL_COMPILER   % 10)
+# endif
+# if defined(__INTEL_COMPILER_BUILD_DATE)
+  /* __INTEL_COMPILER_BUILD_DATE = YYYYMMDD */
+#  define COMPILER_VERSION_TWEAK DEC(__INTEL_COMPILER_BUILD_DATE)
+# endif
+# if defined(_MSC_VER)
+   /* _MSC_VER = VVRR */
+#  define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+#  define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+# endif
+# if defined(__GNUC__)
+#  define SIMULATE_VERSION_MAJOR DEC(__GNUC__)
+# elif defined(__GNUG__)
+#  define SIMULATE_VERSION_MAJOR DEC(__GNUG__)
+# endif
+# if defined(__GNUC_MINOR__)
+#  define SIMULATE_VERSION_MINOR DEC(__GNUC_MINOR__)
+# endif
+# if defined(__GNUC_PATCHLEVEL__)
+#  define SIMULATE_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
+# endif
+
+#elif defined(__PATHCC__)
+# define COMPILER_ID "PathScale"
+# define COMPILER_VERSION_MAJOR DEC(__PATHCC__)
+# define COMPILER_VERSION_MINOR DEC(__PATHCC_MINOR__)
+# if defined(__PATHCC_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__PATHCC_PATCHLEVEL__)
+# endif
+
+#elif defined(__BORLANDC__) && defined(__CODEGEARC_VERSION__)
+# define COMPILER_ID "Embarcadero"
+# define COMPILER_VERSION_MAJOR HEX(__CODEGEARC_VERSION__>>24 & 0x00FF)
+# define COMPILER_VERSION_MINOR HEX(__CODEGEARC_VERSION__>>16 & 0x00FF)
+# define COMPILER_VERSION_PATCH DEC(__CODEGEARC_VERSION__     & 0xFFFF)
+
+#elif defined(__BORLANDC__)
+# define COMPILER_ID "Borland"
+  /* __BORLANDC__ = 0xVRR */
+# define COMPILER_VERSION_MAJOR HEX(__BORLANDC__>>8)
+# define COMPILER_VERSION_MINOR HEX(__BORLANDC__ & 0xFF)
+
+#elif defined(__WATCOMC__) && __WATCOMC__ < 1200
+# define COMPILER_ID "Watcom"
+   /* __WATCOMC__ = VVRR */
+# define COMPILER_VERSION_MAJOR DEC(__WATCOMC__ / 100)
+# define COMPILER_VERSION_MINOR DEC((__WATCOMC__ / 10) % 10)
+# if (__WATCOMC__ % 10) > 0
+#  define COMPILER_VERSION_PATCH DEC(__WATCOMC__ % 10)
+# endif
+
+#elif defined(__WATCOMC__)
+# define COMPILER_ID "OpenWatcom"
+   /* __WATCOMC__ = VVRP + 1100 */
+# define COMPILER_VERSION_MAJOR DEC((__WATCOMC__ - 1100) / 100)
+# define COMPILER_VERSION_MINOR DEC((__WATCOMC__ / 10) % 10)
+# if (__WATCOMC__ % 10) > 0
+#  define COMPILER_VERSION_PATCH DEC(__WATCOMC__ % 10)
+# endif
+
+#elif defined(__SUNPRO_C)
+# define COMPILER_ID "SunPro"
+# if __SUNPRO_C >= 0x5100
+   /* __SUNPRO_C = 0xVRRP */
+#  define COMPILER_VERSION_MAJOR HEX(__SUNPRO_C>>12)
+#  define COMPILER_VERSION_MINOR HEX(__SUNPRO_C>>4 & 0xFF)
+#  define COMPILER_VERSION_PATCH HEX(__SUNPRO_C    & 0xF)
+# else
+   /* __SUNPRO_CC = 0xVRP */
+#  define COMPILER_VERSION_MAJOR HEX(__SUNPRO_C>>8)
+#  define COMPILER_VERSION_MINOR HEX(__SUNPRO_C>>4 & 0xF)
+#  define COMPILER_VERSION_PATCH HEX(__SUNPRO_C    & 0xF)
+# endif
+
+#elif defined(__HP_cc)
+# define COMPILER_ID "HP"
+  /* __HP_cc = VVRRPP */
+# define COMPILER_VERSION_MAJOR DEC(__HP_cc/10000)
+# define COMPILER_VERSION_MINOR DEC(__HP_cc/100 % 100)
+# define COMPILER_VERSION_PATCH DEC(__HP_cc     % 100)
+
+#elif defined(__DECC)
+# define COMPILER_ID "Compaq"
+  /* __DECC_VER = VVRRTPPPP */
+# define COMPILER_VERSION_MAJOR DEC(__DECC_VER/10000000)
+# define COMPILER_VERSION_MINOR DEC(__DECC_VER/100000  % 100)
+# define COMPILER_VERSION_PATCH DEC(__DECC_VER         % 10000)
+
+#elif defined(__IBMC__) && defined(__COMPILER_VER__)
+# define COMPILER_ID "zOS"
+  /* __IBMC__ = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__IBMC__/100)
+# define COMPILER_VERSION_MINOR DEC(__IBMC__/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__IBMC__    % 10)
+
+#elif defined(__ibmxl__) && defined(__clang__)
+# define COMPILER_ID "XLClang"
+# define COMPILER_VERSION_MAJOR DEC(__ibmxl_version__)
+# define COMPILER_VERSION_MINOR DEC(__ibmxl_release__)
+# define COMPILER_VERSION_PATCH DEC(__ibmxl_modification__)
+# define COMPILER_VERSION_TWEAK DEC(__ibmxl_ptf_fix_level__)
+
+
+#elif defined(__IBMC__) && !defined(__COMPILER_VER__) && __IBMC__ >= 800
+# define COMPILER_ID "XL"
+  /* __IBMC__ = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__IBMC__/100)
+# define COMPILER_VERSION_MINOR DEC(__IBMC__/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__IBMC__    % 10)
+
+#elif defined(__IBMC__) && !defined(__COMPILER_VER__) && __IBMC__ < 800
+# define COMPILER_ID "VisualAge"
+  /* __IBMC__ = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__IBMC__/100)
+# define COMPILER_VERSION_MINOR DEC(__IBMC__/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__IBMC__    % 10)
+
+#elif defined(__PGI)
+# define COMPILER_ID "PGI"
+# define COMPILER_VERSION_MAJOR DEC(__PGIC__)
+# define COMPILER_VERSION_MINOR DEC(__PGIC_MINOR__)
+# if defined(__PGIC_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__PGIC_PATCHLEVEL__)
+# endif
+
+#elif defined(_CRAYC)
+# define COMPILER_ID "Cray"
+# define COMPILER_VERSION_MAJOR DEC(_RELEASE_MAJOR)
+# define COMPILER_VERSION_MINOR DEC(_RELEASE_MINOR)
+
+#elif defined(__TI_COMPILER_VERSION__)
+# define COMPILER_ID "TI"
+  /* __TI_COMPILER_VERSION__ = VVVRRRPPP */
+# define COMPILER_VERSION_MAJOR DEC(__TI_COMPILER_VERSION__/1000000)
+# define COMPILER_VERSION_MINOR DEC(__TI_COMPILER_VERSION__/1000   % 1000)
+# define COMPILER_VERSION_PATCH DEC(__TI_COMPILER_VERSION__        % 1000)
+
+#elif defined(__FUJITSU) || defined(__FCC_VERSION) || defined(__fcc_version)
+# define COMPILER_ID "Fujitsu"
+
+#elif defined(__ghs__)
+# define COMPILER_ID "GHS"
+/* __GHS_VERSION_NUMBER = VVVVRP */
+# ifdef __GHS_VERSION_NUMBER
+# define COMPILER_VERSION_MAJOR DEC(__GHS_VERSION_NUMBER / 100)
+# define COMPILER_VERSION_MINOR DEC(__GHS_VERSION_NUMBER / 10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__GHS_VERSION_NUMBER      % 10)
+# endif
+
+#elif defined(__TINYC__)
+# define COMPILER_ID "TinyCC"
+
+#elif defined(__BCC__)
+# define COMPILER_ID "Bruce"
+
+#elif defined(__SCO_VERSION__)
+# define COMPILER_ID "SCO"
+
+#elif defined(__ARMCC_VERSION) && !defined(__clang__)
+# define COMPILER_ID "ARMCC"
+#if __ARMCC_VERSION >= 1000000
+  /* __ARMCC_VERSION = VRRPPPP */
+  # define COMPILER_VERSION_MAJOR DEC(__ARMCC_VERSION/1000000)
+  # define COMPILER_VERSION_MINOR DEC(__ARMCC_VERSION/10000 % 100)
+  # define COMPILER_VERSION_PATCH DEC(__ARMCC_VERSION     % 10000)
+#else
+  /* __ARMCC_VERSION = VRPPPP */
+  # define COMPILER_VERSION_MAJOR DEC(__ARMCC_VERSION/100000)
+  # define COMPILER_VERSION_MINOR DEC(__ARMCC_VERSION/10000 % 10)
+  # define COMPILER_VERSION_PATCH DEC(__ARMCC_VERSION    % 10000)
+#endif
+
+
+#elif defined(__clang__) && defined(__apple_build_version__)
+# define COMPILER_ID "AppleClang"
+# if defined(_MSC_VER)
+#  define SIMULATE_ID "MSVC"
+# endif
+# define COMPILER_VERSION_MAJOR DEC(__clang_major__)
+# define COMPILER_VERSION_MINOR DEC(__clang_minor__)
+# define COMPILER_VERSION_PATCH DEC(__clang_patchlevel__)
+# if defined(_MSC_VER)
+   /* _MSC_VER = VVRR */
+#  define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+#  define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+# endif
+# define COMPILER_VERSION_TWEAK DEC(__apple_build_version__)
+
+#elif defined(__clang__) && defined(__ARMCOMPILER_VERSION)
+# define COMPILER_ID "ARMClang"
+  # define COMPILER_VERSION_MAJOR DEC(__ARMCOMPILER_VERSION/1000000)
+  # define COMPILER_VERSION_MINOR DEC(__ARMCOMPILER_VERSION/10000 % 100)
+  # define COMPILER_VERSION_PATCH DEC(__ARMCOMPILER_VERSION     % 10000)
+# define COMPILER_VERSION_INTERNAL DEC(__ARMCOMPILER_VERSION)
+
+#elif defined(__clang__)
+# define COMPILER_ID "Clang"
+# if defined(_MSC_VER)
+#  define SIMULATE_ID "MSVC"
+# endif
+# define COMPILER_VERSION_MAJOR DEC(__clang_major__)
+# define COMPILER_VERSION_MINOR DEC(__clang_minor__)
+# define COMPILER_VERSION_PATCH DEC(__clang_patchlevel__)
+# if defined(_MSC_VER)
+   /* _MSC_VER = VVRR */
+#  define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+#  define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+# endif
+
+#elif defined(__GNUC__)
+# define COMPILER_ID "GNU"
+# define COMPILER_VERSION_MAJOR DEC(__GNUC__)
+# if defined(__GNUC_MINOR__)
+#  define COMPILER_VERSION_MINOR DEC(__GNUC_MINOR__)
+# endif
+# if defined(__GNUC_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
+# endif
+
+#elif defined(_MSC_VER)
+# define COMPILER_ID "MSVC"
+  /* _MSC_VER = VVRR */
+# define COMPILER_VERSION_MAJOR DEC(_MSC_VER / 100)
+# define COMPILER_VERSION_MINOR DEC(_MSC_VER % 100)
+# if defined(_MSC_FULL_VER)
+#  if _MSC_VER >= 1400
+    /* _MSC_FULL_VER = VVRRPPPPP */
+#   define COMPILER_VERSION_PATCH DEC(_MSC_FULL_VER % 100000)
+#  else
+    /* _MSC_FULL_VER = VVRRPPPP */
+#   define COMPILER_VERSION_PATCH DEC(_MSC_FULL_VER % 10000)
+#  endif
+# endif
+# if defined(_MSC_BUILD)
+#  define COMPILER_VERSION_TWEAK DEC(_MSC_BUILD)
+# endif
+
+#elif defined(__VISUALDSPVERSION__) || defined(__ADSPBLACKFIN__) || defined(__ADSPTS__) || defined(__ADSP21000__)
+# define COMPILER_ID "ADSP"
+#if defined(__VISUALDSPVERSION__)
+  /* __VISUALDSPVERSION__ = 0xVVRRPP00 */
+# define COMPILER_VERSION_MAJOR HEX(__VISUALDSPVERSION__>>24)
+# define COMPILER_VERSION_MINOR HEX(__VISUALDSPVERSION__>>16 & 0xFF)
+# define COMPILER_VERSION_PATCH HEX(__VISUALDSPVERSION__>>8  & 0xFF)
+#endif
+
+#elif defined(__IAR_SYSTEMS_ICC__) || defined(__IAR_SYSTEMS_ICC)
+# define COMPILER_ID "IAR"
+# if defined(__VER__) && defined(__ICCARM__)
+#  define COMPILER_VERSION_MAJOR DEC((__VER__) / 1000000)
+#  define COMPILER_VERSION_MINOR DEC(((__VER__) / 1000) % 1000)
+#  define COMPILER_VERSION_PATCH DEC((__VER__) % 1000)
+#  define COMPILER_VERSION_INTERNAL DEC(__IAR_SYSTEMS_ICC__)
+# elif defined(__VER__) && (defined(__ICCAVR__) || defined(__ICCRX__) || defined(__ICCRH850__) || defined(__ICCRL78__) || defined(__ICC430__) || defined(__ICCRISCV__))
+#  define COMPILER_VERSION_MAJOR DEC((__VER__) / 100)
+#  define COMPILER_VERSION_MINOR DEC((__VER__) - (((__VER__) / 100)*100))
+#  define COMPILER_VERSION_PATCH DEC(__SUBVERSION__)
+#  define COMPILER_VERSION_INTERNAL DEC(__IAR_SYSTEMS_ICC__)
+# endif
+
+#elif defined(__SDCC_VERSION_MAJOR) || defined(SDCC)
+# define COMPILER_ID "SDCC"
+# if defined(__SDCC_VERSION_MAJOR)
+#  define COMPILER_VERSION_MAJOR DEC(__SDCC_VERSION_MAJOR)
+#  define COMPILER_VERSION_MINOR DEC(__SDCC_VERSION_MINOR)
+#  define COMPILER_VERSION_PATCH DEC(__SDCC_VERSION_PATCH)
+# else
+  /* SDCC = VRP */
+#  define COMPILER_VERSION_MAJOR DEC(SDCC/100)
+#  define COMPILER_VERSION_MINOR DEC(SDCC/10 % 10)
+#  define COMPILER_VERSION_PATCH DEC(SDCC    % 10)
+# endif
+
+
+/* These compilers are either not known or too old to define an
+  identification macro.  Try to identify the platform and guess that
+  it is the native compiler.  */
+#elif defined(__hpux) || defined(__hpua)
+# define COMPILER_ID "HP"
+
+#else /* unknown compiler */
+# define COMPILER_ID ""
+#endif
+
+/* Construct the string literal in pieces to prevent the source from
+   getting matched.  Store it in a pointer rather than an array
+   because some compilers will just produce instructions to fill the
+   array rather than assigning a pointer to a static array.  */
+char const* info_compiler = "INFO" ":" "compiler[" COMPILER_ID "]";
+#ifdef SIMULATE_ID
+char const* info_simulate = "INFO" ":" "simulate[" SIMULATE_ID "]";
+#endif
+
+#ifdef __QNXNTO__
+char const* qnxnto = "INFO" ":" "qnxnto[]";
+#endif
+
+#if defined(__CRAYXE) || defined(__CRAYXC)
+char const *info_cray = "INFO" ":" "compiler_wrapper[CrayPrgEnv]";
+#endif
+
+#define STRINGIFY_HELPER(X) #X
+#define STRINGIFY(X) STRINGIFY_HELPER(X)
+
+/* Identify known platforms by name.  */
+#if defined(__linux) || defined(__linux__) || defined(linux)
+# define PLATFORM_ID "Linux"
+
+#elif defined(__CYGWIN__)
+# define PLATFORM_ID "Cygwin"
+
+#elif defined(__MINGW32__)
+# define PLATFORM_ID "MinGW"
+
+#elif defined(__APPLE__)
+# define PLATFORM_ID "Darwin"
+
+#elif defined(_WIN32) || defined(__WIN32__) || defined(WIN32)
+# define PLATFORM_ID "Windows"
+
+#elif defined(__FreeBSD__) || defined(__FreeBSD)
+# define PLATFORM_ID "FreeBSD"
+
+#elif defined(__NetBSD__) || defined(__NetBSD)
+# define PLATFORM_ID "NetBSD"
+
+#elif defined(__OpenBSD__) || defined(__OPENBSD)
+# define PLATFORM_ID "OpenBSD"
+
+#elif defined(__sun) || defined(sun)
+# define PLATFORM_ID "SunOS"
+
+#elif defined(_AIX) || defined(__AIX) || defined(__AIX__) || defined(__aix) || defined(__aix__)
+# define PLATFORM_ID "AIX"
+
+#elif defined(__hpux) || defined(__hpux__)
+# define PLATFORM_ID "HP-UX"
+
+#elif defined(__HAIKU__)
+# define PLATFORM_ID "Haiku"
+
+#elif defined(__BeOS) || defined(__BEOS__) || defined(_BEOS)
+# define PLATFORM_ID "BeOS"
+
+#elif defined(__QNX__) || defined(__QNXNTO__)
+# define PLATFORM_ID "QNX"
+
+#elif defined(__tru64) || defined(_tru64) || defined(__TRU64__)
+# define PLATFORM_ID "Tru64"
+
+#elif defined(__riscos) || defined(__riscos__)
+# define PLATFORM_ID "RISCos"
+
+#elif defined(__sinix) || defined(__sinix__) || defined(__SINIX__)
+# define PLATFORM_ID "SINIX"
+
+#elif defined(__UNIX_SV__)
+# define PLATFORM_ID "UNIX_SV"
+
+#elif defined(__bsdos__)
+# define PLATFORM_ID "BSDOS"
+
+#elif defined(_MPRAS) || defined(MPRAS)
+# define PLATFORM_ID "MP-RAS"
+
+#elif defined(__osf) || defined(__osf__)
+# define PLATFORM_ID "OSF1"
+
+#elif defined(_SCO_SV) || defined(SCO_SV) || defined(sco_sv)
+# define PLATFORM_ID "SCO_SV"
+
+#elif defined(__ultrix) || defined(__ultrix__) || defined(_ULTRIX)
+# define PLATFORM_ID "ULTRIX"
+
+#elif defined(__XENIX__) || defined(_XENIX) || defined(XENIX)
+# define PLATFORM_ID "Xenix"
+
+#elif defined(__WATCOMC__)
+# if defined(__LINUX__)
+#  define PLATFORM_ID "Linux"
+
+# elif defined(__DOS__)
+#  define PLATFORM_ID "DOS"
+
+# elif defined(__OS2__)
+#  define PLATFORM_ID "OS2"
+
+# elif defined(__WINDOWS__)
+#  define PLATFORM_ID "Windows3x"
+
+# else /* unknown platform */
+#  define PLATFORM_ID
+# endif
+
+#elif defined(__INTEGRITY)
+# if defined(INT_178B)
+#  define PLATFORM_ID "Integrity178"
+
+# else /* regular Integrity */
+#  define PLATFORM_ID "Integrity"
+# endif
+
+#else /* unknown platform */
+# define PLATFORM_ID
+
+#endif
+
+/* For windows compilers MSVC and Intel we can determine
+   the architecture of the compiler being used.  This is because
+   the compilers do not have flags that can change the architecture,
+   but rather depend on which compiler is being used
+*/
+#if defined(_WIN32) && defined(_MSC_VER)
+# if defined(_M_IA64)
+#  define ARCHITECTURE_ID "IA64"
+
+# elif defined(_M_X64) || defined(_M_AMD64)
+#  define ARCHITECTURE_ID "x64"
+
+# elif defined(_M_IX86)
+#  define ARCHITECTURE_ID "X86"
+
+# elif defined(_M_ARM64)
+#  define ARCHITECTURE_ID "ARM64"
+
+# elif defined(_M_ARM)
+#  if _M_ARM == 4
+#   define ARCHITECTURE_ID "ARMV4I"
+#  elif _M_ARM == 5
+#   define ARCHITECTURE_ID "ARMV5I"
+#  else
+#   define ARCHITECTURE_ID "ARMV" STRINGIFY(_M_ARM)
+#  endif
+
+# elif defined(_M_MIPS)
+#  define ARCHITECTURE_ID "MIPS"
+
+# elif defined(_M_SH)
+#  define ARCHITECTURE_ID "SHx"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__WATCOMC__)
+# if defined(_M_I86)
+#  define ARCHITECTURE_ID "I86"
+
+# elif defined(_M_IX86)
+#  define ARCHITECTURE_ID "X86"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__IAR_SYSTEMS_ICC__) || defined(__IAR_SYSTEMS_ICC)
+# if defined(__ICCARM__)
+#  define ARCHITECTURE_ID "ARM"
+
+# elif defined(__ICCRX__)
+#  define ARCHITECTURE_ID "RX"
+
+# elif defined(__ICCRH850__)
+#  define ARCHITECTURE_ID "RH850"
+
+# elif defined(__ICCRL78__)
+#  define ARCHITECTURE_ID "RL78"
+
+# elif defined(__ICCRISCV__)
+#  define ARCHITECTURE_ID "RISCV"
+
+# elif defined(__ICCAVR__)
+#  define ARCHITECTURE_ID "AVR"
+
+# elif defined(__ICC430__)
+#  define ARCHITECTURE_ID "MSP430"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__ghs__)
+# if defined(__PPC64__)
+#  define ARCHITECTURE_ID "PPC64"
+
+# elif defined(__ppc__)
+#  define ARCHITECTURE_ID "PPC"
+
+# elif defined(__ARM__)
+#  define ARCHITECTURE_ID "ARM"
+
+# elif defined(__x86_64__)
+#  define ARCHITECTURE_ID "x64"
+
+# elif defined(__i386__)
+#  define ARCHITECTURE_ID "X86"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+#else
+#  define ARCHITECTURE_ID
+#endif
+
+/* Convert integer to decimal digit literals.  */
+#define DEC(n)                   \
+  ('0' + (((n) / 10000000)%10)), \
+  ('0' + (((n) / 1000000)%10)),  \
+  ('0' + (((n) / 100000)%10)),   \
+  ('0' + (((n) / 10000)%10)),    \
+  ('0' + (((n) / 1000)%10)),     \
+  ('0' + (((n) / 100)%10)),      \
+  ('0' + (((n) / 10)%10)),       \
+  ('0' +  ((n) % 10))
+
+/* Convert integer to hex digit literals.  */
+#define HEX(n)             \
+  ('0' + ((n)>>28 & 0xF)), \
+  ('0' + ((n)>>24 & 0xF)), \
+  ('0' + ((n)>>20 & 0xF)), \
+  ('0' + ((n)>>16 & 0xF)), \
+  ('0' + ((n)>>12 & 0xF)), \
+  ('0' + ((n)>>8  & 0xF)), \
+  ('0' + ((n)>>4  & 0xF)), \
+  ('0' + ((n)     & 0xF))
+
+/* Construct a string literal encoding the version number components. */
+#ifdef COMPILER_VERSION_MAJOR
+char const info_version[] = {
+  'I', 'N', 'F', 'O', ':',
+  'c','o','m','p','i','l','e','r','_','v','e','r','s','i','o','n','[',
+  COMPILER_VERSION_MAJOR,
+# ifdef COMPILER_VERSION_MINOR
+  '.', COMPILER_VERSION_MINOR,
+#  ifdef COMPILER_VERSION_PATCH
+   '.', COMPILER_VERSION_PATCH,
+#   ifdef COMPILER_VERSION_TWEAK
+    '.', COMPILER_VERSION_TWEAK,
+#   endif
+#  endif
+# endif
+  ']','\0'};
+#endif
+
+/* Construct a string literal encoding the internal version number. */
+#ifdef COMPILER_VERSION_INTERNAL
+char const info_version_internal[] = {
+  'I', 'N', 'F', 'O', ':',
+  'c','o','m','p','i','l','e','r','_','v','e','r','s','i','o','n','_',
+  'i','n','t','e','r','n','a','l','[',
+  COMPILER_VERSION_INTERNAL,']','\0'};
+#endif
+
+/* Construct a string literal encoding the version number components. */
+#ifdef SIMULATE_VERSION_MAJOR
+char const info_simulate_version[] = {
+  'I', 'N', 'F', 'O', ':',
+  's','i','m','u','l','a','t','e','_','v','e','r','s','i','o','n','[',
+  SIMULATE_VERSION_MAJOR,
+# ifdef SIMULATE_VERSION_MINOR
+  '.', SIMULATE_VERSION_MINOR,
+#  ifdef SIMULATE_VERSION_PATCH
+   '.', SIMULATE_VERSION_PATCH,
+#   ifdef SIMULATE_VERSION_TWEAK
+    '.', SIMULATE_VERSION_TWEAK,
+#   endif
+#  endif
+# endif
+  ']','\0'};
+#endif
+
+/* Construct the string literal in pieces to prevent the source from
+   getting matched.  Store it in a pointer rather than an array
+   because some compilers will just produce instructions to fill the
+   array rather than assigning a pointer to a static array.  */
+char const* info_platform = "INFO" ":" "platform[" PLATFORM_ID "]";
+char const* info_arch = "INFO" ":" "arch[" ARCHITECTURE_ID "]";
+
+
+
+
+#if !defined(__STDC__)
+# if (defined(_MSC_VER) && !defined(__clang__)) \
+  || (defined(__ibmxl__) || defined(__IBMC__))
+#  define C_DIALECT "90"
+# else
+#  define C_DIALECT
+# endif
+#elif __STDC_VERSION__ >= 201000L
+# define C_DIALECT "11"
+#elif __STDC_VERSION__ >= 199901L
+# define C_DIALECT "99"
+#else
+# define C_DIALECT "90"
+#endif
+const char* info_language_dialect_default =
+  "INFO" ":" "dialect_default[" C_DIALECT "]";
+
+/*--------------------------------------------------------------------------*/
+
+#ifdef ID_VOID_MAIN
+void main() {}
+#else
+# if defined(__CLASSIC_C__)
+int main(argc, argv) int argc; char *argv[];
+# else
+int main(int argc, char* argv[])
+# endif
+{
+  int require = 0;
+  require += info_compiler[argc];
+  require += info_platform[argc];
+  require += info_arch[argc];
+#ifdef COMPILER_VERSION_MAJOR
+  require += info_version[argc];
+#endif
+#ifdef COMPILER_VERSION_INTERNAL
+  require += info_version_internal[argc];
+#endif
+#ifdef SIMULATE_ID
+  require += info_simulate[argc];
+#endif
+#ifdef SIMULATE_VERSION_MAJOR
+  require += info_simulate_version[argc];
+#endif
+#if defined(__CRAYXE) || defined(__CRAYXC)
+  require += info_cray[argc];
+#endif
+  require += info_language_dialect_default[argc];
+  (void)argv;
+  return require;
+}
+#endif
diff --git a/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdC/a.out b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdC/a.out
new file mode 100755
index 0000000000..c795c39369
Binary files /dev/null and b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdC/a.out differ
diff --git a/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdCXX/CMakeCXXCompilerId.cpp b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdCXX/CMakeCXXCompilerId.cpp
new file mode 100644
index 0000000000..4761ea2b8f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdCXX/CMakeCXXCompilerId.cpp
@@ -0,0 +1,644 @@
+/* This source file must have a .cpp extension so that all C++ compilers
+   recognize the extension without flags.  Borland does not know .cxx for
+   example.  */
+#ifndef __cplusplus
+# error "A C compiler has been selected for C++."
+#endif
+
+
+/* Version number components: V=Version, R=Revision, P=Patch
+   Version date components:   YYYY=Year, MM=Month,   DD=Day  */
+
+#if defined(__COMO__)
+# define COMPILER_ID "Comeau"
+  /* __COMO_VERSION__ = VRR */
+# define COMPILER_VERSION_MAJOR DEC(__COMO_VERSION__ / 100)
+# define COMPILER_VERSION_MINOR DEC(__COMO_VERSION__ % 100)
+
+#elif defined(__INTEL_COMPILER) || defined(__ICC)
+# define COMPILER_ID "Intel"
+# if defined(_MSC_VER)
+#  define SIMULATE_ID "MSVC"
+# endif
+# if defined(__GNUC__)
+#  define SIMULATE_ID "GNU"
+# endif
+  /* __INTEL_COMPILER = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__INTEL_COMPILER/100)
+# define COMPILER_VERSION_MINOR DEC(__INTEL_COMPILER/10 % 10)
+# if defined(__INTEL_COMPILER_UPDATE)
+#  define COMPILER_VERSION_PATCH DEC(__INTEL_COMPILER_UPDATE)
+# else
+#  define COMPILER_VERSION_PATCH DEC(__INTEL_COMPILER   % 10)
+# endif
+# if defined(__INTEL_COMPILER_BUILD_DATE)
+  /* __INTEL_COMPILER_BUILD_DATE = YYYYMMDD */
+#  define COMPILER_VERSION_TWEAK DEC(__INTEL_COMPILER_BUILD_DATE)
+# endif
+# if defined(_MSC_VER)
+   /* _MSC_VER = VVRR */
+#  define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+#  define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+# endif
+# if defined(__GNUC__)
+#  define SIMULATE_VERSION_MAJOR DEC(__GNUC__)
+# elif defined(__GNUG__)
+#  define SIMULATE_VERSION_MAJOR DEC(__GNUG__)
+# endif
+# if defined(__GNUC_MINOR__)
+#  define SIMULATE_VERSION_MINOR DEC(__GNUC_MINOR__)
+# endif
+# if defined(__GNUC_PATCHLEVEL__)
+#  define SIMULATE_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
+# endif
+
+#elif defined(__PATHCC__)
+# define COMPILER_ID "PathScale"
+# define COMPILER_VERSION_MAJOR DEC(__PATHCC__)
+# define COMPILER_VERSION_MINOR DEC(__PATHCC_MINOR__)
+# if defined(__PATHCC_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__PATHCC_PATCHLEVEL__)
+# endif
+
+#elif defined(__BORLANDC__) && defined(__CODEGEARC_VERSION__)
+# define COMPILER_ID "Embarcadero"
+# define COMPILER_VERSION_MAJOR HEX(__CODEGEARC_VERSION__>>24 & 0x00FF)
+# define COMPILER_VERSION_MINOR HEX(__CODEGEARC_VERSION__>>16 & 0x00FF)
+# define COMPILER_VERSION_PATCH DEC(__CODEGEARC_VERSION__     & 0xFFFF)
+
+#elif defined(__BORLANDC__)
+# define COMPILER_ID "Borland"
+  /* __BORLANDC__ = 0xVRR */
+# define COMPILER_VERSION_MAJOR HEX(__BORLANDC__>>8)
+# define COMPILER_VERSION_MINOR HEX(__BORLANDC__ & 0xFF)
+
+#elif defined(__WATCOMC__) && __WATCOMC__ < 1200
+# define COMPILER_ID "Watcom"
+   /* __WATCOMC__ = VVRR */
+# define COMPILER_VERSION_MAJOR DEC(__WATCOMC__ / 100)
+# define COMPILER_VERSION_MINOR DEC((__WATCOMC__ / 10) % 10)
+# if (__WATCOMC__ % 10) > 0
+#  define COMPILER_VERSION_PATCH DEC(__WATCOMC__ % 10)
+# endif
+
+#elif defined(__WATCOMC__)
+# define COMPILER_ID "OpenWatcom"
+   /* __WATCOMC__ = VVRP + 1100 */
+# define COMPILER_VERSION_MAJOR DEC((__WATCOMC__ - 1100) / 100)
+# define COMPILER_VERSION_MINOR DEC((__WATCOMC__ / 10) % 10)
+# if (__WATCOMC__ % 10) > 0
+#  define COMPILER_VERSION_PATCH DEC(__WATCOMC__ % 10)
+# endif
+
+#elif defined(__SUNPRO_CC)
+# define COMPILER_ID "SunPro"
+# if __SUNPRO_CC >= 0x5100
+   /* __SUNPRO_CC = 0xVRRP */
+#  define COMPILER_VERSION_MAJOR HEX(__SUNPRO_CC>>12)
+#  define COMPILER_VERSION_MINOR HEX(__SUNPRO_CC>>4 & 0xFF)
+#  define COMPILER_VERSION_PATCH HEX(__SUNPRO_CC    & 0xF)
+# else
+   /* __SUNPRO_CC = 0xVRP */
+#  define COMPILER_VERSION_MAJOR HEX(__SUNPRO_CC>>8)
+#  define COMPILER_VERSION_MINOR HEX(__SUNPRO_CC>>4 & 0xF)
+#  define COMPILER_VERSION_PATCH HEX(__SUNPRO_CC    & 0xF)
+# endif
+
+#elif defined(__HP_aCC)
+# define COMPILER_ID "HP"
+  /* __HP_aCC = VVRRPP */
+# define COMPILER_VERSION_MAJOR DEC(__HP_aCC/10000)
+# define COMPILER_VERSION_MINOR DEC(__HP_aCC/100 % 100)
+# define COMPILER_VERSION_PATCH DEC(__HP_aCC     % 100)
+
+#elif defined(__DECCXX)
+# define COMPILER_ID "Compaq"
+  /* __DECCXX_VER = VVRRTPPPP */
+# define COMPILER_VERSION_MAJOR DEC(__DECCXX_VER/10000000)
+# define COMPILER_VERSION_MINOR DEC(__DECCXX_VER/100000  % 100)
+# define COMPILER_VERSION_PATCH DEC(__DECCXX_VER         % 10000)
+
+#elif defined(__IBMCPP__) && defined(__COMPILER_VER__)
+# define COMPILER_ID "zOS"
+  /* __IBMCPP__ = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__IBMCPP__/100)
+# define COMPILER_VERSION_MINOR DEC(__IBMCPP__/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__IBMCPP__    % 10)
+
+#elif defined(__ibmxl__) && defined(__clang__)
+# define COMPILER_ID "XLClang"
+# define COMPILER_VERSION_MAJOR DEC(__ibmxl_version__)
+# define COMPILER_VERSION_MINOR DEC(__ibmxl_release__)
+# define COMPILER_VERSION_PATCH DEC(__ibmxl_modification__)
+# define COMPILER_VERSION_TWEAK DEC(__ibmxl_ptf_fix_level__)
+
+
+#elif defined(__IBMCPP__) && !defined(__COMPILER_VER__) && __IBMCPP__ >= 800
+# define COMPILER_ID "XL"
+  /* __IBMCPP__ = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__IBMCPP__/100)
+# define COMPILER_VERSION_MINOR DEC(__IBMCPP__/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__IBMCPP__    % 10)
+
+#elif defined(__IBMCPP__) && !defined(__COMPILER_VER__) && __IBMCPP__ < 800
+# define COMPILER_ID "VisualAge"
+  /* __IBMCPP__ = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__IBMCPP__/100)
+# define COMPILER_VERSION_MINOR DEC(__IBMCPP__/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__IBMCPP__    % 10)
+
+#elif defined(__PGI)
+# define COMPILER_ID "PGI"
+# define COMPILER_VERSION_MAJOR DEC(__PGIC__)
+# define COMPILER_VERSION_MINOR DEC(__PGIC_MINOR__)
+# if defined(__PGIC_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__PGIC_PATCHLEVEL__)
+# endif
+
+#elif defined(_CRAYC)
+# define COMPILER_ID "Cray"
+# define COMPILER_VERSION_MAJOR DEC(_RELEASE_MAJOR)
+# define COMPILER_VERSION_MINOR DEC(_RELEASE_MINOR)
+
+#elif defined(__TI_COMPILER_VERSION__)
+# define COMPILER_ID "TI"
+  /* __TI_COMPILER_VERSION__ = VVVRRRPPP */
+# define COMPILER_VERSION_MAJOR DEC(__TI_COMPILER_VERSION__/1000000)
+# define COMPILER_VERSION_MINOR DEC(__TI_COMPILER_VERSION__/1000   % 1000)
+# define COMPILER_VERSION_PATCH DEC(__TI_COMPILER_VERSION__        % 1000)
+
+#elif defined(__FUJITSU) || defined(__FCC_VERSION) || defined(__fcc_version)
+# define COMPILER_ID "Fujitsu"
+
+#elif defined(__ghs__)
+# define COMPILER_ID "GHS"
+/* __GHS_VERSION_NUMBER = VVVVRP */
+# ifdef __GHS_VERSION_NUMBER
+# define COMPILER_VERSION_MAJOR DEC(__GHS_VERSION_NUMBER / 100)
+# define COMPILER_VERSION_MINOR DEC(__GHS_VERSION_NUMBER / 10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__GHS_VERSION_NUMBER      % 10)
+# endif
+
+#elif defined(__SCO_VERSION__)
+# define COMPILER_ID "SCO"
+
+#elif defined(__ARMCC_VERSION) && !defined(__clang__)
+# define COMPILER_ID "ARMCC"
+#if __ARMCC_VERSION >= 1000000
+  /* __ARMCC_VERSION = VRRPPPP */
+  # define COMPILER_VERSION_MAJOR DEC(__ARMCC_VERSION/1000000)
+  # define COMPILER_VERSION_MINOR DEC(__ARMCC_VERSION/10000 % 100)
+  # define COMPILER_VERSION_PATCH DEC(__ARMCC_VERSION     % 10000)
+#else
+  /* __ARMCC_VERSION = VRPPPP */
+  # define COMPILER_VERSION_MAJOR DEC(__ARMCC_VERSION/100000)
+  # define COMPILER_VERSION_MINOR DEC(__ARMCC_VERSION/10000 % 10)
+  # define COMPILER_VERSION_PATCH DEC(__ARMCC_VERSION    % 10000)
+#endif
+
+
+#elif defined(__clang__) && defined(__apple_build_version__)
+# define COMPILER_ID "AppleClang"
+# if defined(_MSC_VER)
+#  define SIMULATE_ID "MSVC"
+# endif
+# define COMPILER_VERSION_MAJOR DEC(__clang_major__)
+# define COMPILER_VERSION_MINOR DEC(__clang_minor__)
+# define COMPILER_VERSION_PATCH DEC(__clang_patchlevel__)
+# if defined(_MSC_VER)
+   /* _MSC_VER = VVRR */
+#  define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+#  define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+# endif
+# define COMPILER_VERSION_TWEAK DEC(__apple_build_version__)
+
+#elif defined(__clang__) && defined(__ARMCOMPILER_VERSION)
+# define COMPILER_ID "ARMClang"
+  # define COMPILER_VERSION_MAJOR DEC(__ARMCOMPILER_VERSION/1000000)
+  # define COMPILER_VERSION_MINOR DEC(__ARMCOMPILER_VERSION/10000 % 100)
+  # define COMPILER_VERSION_PATCH DEC(__ARMCOMPILER_VERSION     % 10000)
+# define COMPILER_VERSION_INTERNAL DEC(__ARMCOMPILER_VERSION)
+
+#elif defined(__clang__)
+# define COMPILER_ID "Clang"
+# if defined(_MSC_VER)
+#  define SIMULATE_ID "MSVC"
+# endif
+# define COMPILER_VERSION_MAJOR DEC(__clang_major__)
+# define COMPILER_VERSION_MINOR DEC(__clang_minor__)
+# define COMPILER_VERSION_PATCH DEC(__clang_patchlevel__)
+# if defined(_MSC_VER)
+   /* _MSC_VER = VVRR */
+#  define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+#  define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+# endif
+
+#elif defined(__GNUC__) || defined(__GNUG__)
+# define COMPILER_ID "GNU"
+# if defined(__GNUC__)
+#  define COMPILER_VERSION_MAJOR DEC(__GNUC__)
+# else
+#  define COMPILER_VERSION_MAJOR DEC(__GNUG__)
+# endif
+# if defined(__GNUC_MINOR__)
+#  define COMPILER_VERSION_MINOR DEC(__GNUC_MINOR__)
+# endif
+# if defined(__GNUC_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
+# endif
+
+#elif defined(_MSC_VER)
+# define COMPILER_ID "MSVC"
+  /* _MSC_VER = VVRR */
+# define COMPILER_VERSION_MAJOR DEC(_MSC_VER / 100)
+# define COMPILER_VERSION_MINOR DEC(_MSC_VER % 100)
+# if defined(_MSC_FULL_VER)
+#  if _MSC_VER >= 1400
+    /* _MSC_FULL_VER = VVRRPPPPP */
+#   define COMPILER_VERSION_PATCH DEC(_MSC_FULL_VER % 100000)
+#  else
+    /* _MSC_FULL_VER = VVRRPPPP */
+#   define COMPILER_VERSION_PATCH DEC(_MSC_FULL_VER % 10000)
+#  endif
+# endif
+# if defined(_MSC_BUILD)
+#  define COMPILER_VERSION_TWEAK DEC(_MSC_BUILD)
+# endif
+
+#elif defined(__VISUALDSPVERSION__) || defined(__ADSPBLACKFIN__) || defined(__ADSPTS__) || defined(__ADSP21000__)
+# define COMPILER_ID "ADSP"
+#if defined(__VISUALDSPVERSION__)
+  /* __VISUALDSPVERSION__ = 0xVVRRPP00 */
+# define COMPILER_VERSION_MAJOR HEX(__VISUALDSPVERSION__>>24)
+# define COMPILER_VERSION_MINOR HEX(__VISUALDSPVERSION__>>16 & 0xFF)
+# define COMPILER_VERSION_PATCH HEX(__VISUALDSPVERSION__>>8  & 0xFF)
+#endif
+
+#elif defined(__IAR_SYSTEMS_ICC__) || defined(__IAR_SYSTEMS_ICC)
+# define COMPILER_ID "IAR"
+# if defined(__VER__) && defined(__ICCARM__)
+#  define COMPILER_VERSION_MAJOR DEC((__VER__) / 1000000)
+#  define COMPILER_VERSION_MINOR DEC(((__VER__) / 1000) % 1000)
+#  define COMPILER_VERSION_PATCH DEC((__VER__) % 1000)
+#  define COMPILER_VERSION_INTERNAL DEC(__IAR_SYSTEMS_ICC__)
+# elif defined(__VER__) && (defined(__ICCAVR__) || defined(__ICCRX__) || defined(__ICCRH850__) || defined(__ICCRL78__) || defined(__ICC430__) || defined(__ICCRISCV__))
+#  define COMPILER_VERSION_MAJOR DEC((__VER__) / 100)
+#  define COMPILER_VERSION_MINOR DEC((__VER__) - (((__VER__) / 100)*100))
+#  define COMPILER_VERSION_PATCH DEC(__SUBVERSION__)
+#  define COMPILER_VERSION_INTERNAL DEC(__IAR_SYSTEMS_ICC__)
+# endif
+
+
+/* These compilers are either not known or too old to define an
+  identification macro.  Try to identify the platform and guess that
+  it is the native compiler.  */
+#elif defined(__hpux) || defined(__hpua)
+# define COMPILER_ID "HP"
+
+#else /* unknown compiler */
+# define COMPILER_ID ""
+#endif
+
+/* Construct the string literal in pieces to prevent the source from
+   getting matched.  Store it in a pointer rather than an array
+   because some compilers will just produce instructions to fill the
+   array rather than assigning a pointer to a static array.  */
+char const* info_compiler = "INFO" ":" "compiler[" COMPILER_ID "]";
+#ifdef SIMULATE_ID
+char const* info_simulate = "INFO" ":" "simulate[" SIMULATE_ID "]";
+#endif
+
+#ifdef __QNXNTO__
+char const* qnxnto = "INFO" ":" "qnxnto[]";
+#endif
+
+#if defined(__CRAYXE) || defined(__CRAYXC)
+char const *info_cray = "INFO" ":" "compiler_wrapper[CrayPrgEnv]";
+#endif
+
+#define STRINGIFY_HELPER(X) #X
+#define STRINGIFY(X) STRINGIFY_HELPER(X)
+
+/* Identify known platforms by name.  */
+#if defined(__linux) || defined(__linux__) || defined(linux)
+# define PLATFORM_ID "Linux"
+
+#elif defined(__CYGWIN__)
+# define PLATFORM_ID "Cygwin"
+
+#elif defined(__MINGW32__)
+# define PLATFORM_ID "MinGW"
+
+#elif defined(__APPLE__)
+# define PLATFORM_ID "Darwin"
+
+#elif defined(_WIN32) || defined(__WIN32__) || defined(WIN32)
+# define PLATFORM_ID "Windows"
+
+#elif defined(__FreeBSD__) || defined(__FreeBSD)
+# define PLATFORM_ID "FreeBSD"
+
+#elif defined(__NetBSD__) || defined(__NetBSD)
+# define PLATFORM_ID "NetBSD"
+
+#elif defined(__OpenBSD__) || defined(__OPENBSD)
+# define PLATFORM_ID "OpenBSD"
+
+#elif defined(__sun) || defined(sun)
+# define PLATFORM_ID "SunOS"
+
+#elif defined(_AIX) || defined(__AIX) || defined(__AIX__) || defined(__aix) || defined(__aix__)
+# define PLATFORM_ID "AIX"
+
+#elif defined(__hpux) || defined(__hpux__)
+# define PLATFORM_ID "HP-UX"
+
+#elif defined(__HAIKU__)
+# define PLATFORM_ID "Haiku"
+
+#elif defined(__BeOS) || defined(__BEOS__) || defined(_BEOS)
+# define PLATFORM_ID "BeOS"
+
+#elif defined(__QNX__) || defined(__QNXNTO__)
+# define PLATFORM_ID "QNX"
+
+#elif defined(__tru64) || defined(_tru64) || defined(__TRU64__)
+# define PLATFORM_ID "Tru64"
+
+#elif defined(__riscos) || defined(__riscos__)
+# define PLATFORM_ID "RISCos"
+
+#elif defined(__sinix) || defined(__sinix__) || defined(__SINIX__)
+# define PLATFORM_ID "SINIX"
+
+#elif defined(__UNIX_SV__)
+# define PLATFORM_ID "UNIX_SV"
+
+#elif defined(__bsdos__)
+# define PLATFORM_ID "BSDOS"
+
+#elif defined(_MPRAS) || defined(MPRAS)
+# define PLATFORM_ID "MP-RAS"
+
+#elif defined(__osf) || defined(__osf__)
+# define PLATFORM_ID "OSF1"
+
+#elif defined(_SCO_SV) || defined(SCO_SV) || defined(sco_sv)
+# define PLATFORM_ID "SCO_SV"
+
+#elif defined(__ultrix) || defined(__ultrix__) || defined(_ULTRIX)
+# define PLATFORM_ID "ULTRIX"
+
+#elif defined(__XENIX__) || defined(_XENIX) || defined(XENIX)
+# define PLATFORM_ID "Xenix"
+
+#elif defined(__WATCOMC__)
+# if defined(__LINUX__)
+#  define PLATFORM_ID "Linux"
+
+# elif defined(__DOS__)
+#  define PLATFORM_ID "DOS"
+
+# elif defined(__OS2__)
+#  define PLATFORM_ID "OS2"
+
+# elif defined(__WINDOWS__)
+#  define PLATFORM_ID "Windows3x"
+
+# else /* unknown platform */
+#  define PLATFORM_ID
+# endif
+
+#elif defined(__INTEGRITY)
+# if defined(INT_178B)
+#  define PLATFORM_ID "Integrity178"
+
+# else /* regular Integrity */
+#  define PLATFORM_ID "Integrity"
+# endif
+
+#else /* unknown platform */
+# define PLATFORM_ID
+
+#endif
+
+/* For windows compilers MSVC and Intel we can determine
+   the architecture of the compiler being used.  This is because
+   the compilers do not have flags that can change the architecture,
+   but rather depend on which compiler is being used
+*/
+#if defined(_WIN32) && defined(_MSC_VER)
+# if defined(_M_IA64)
+#  define ARCHITECTURE_ID "IA64"
+
+# elif defined(_M_X64) || defined(_M_AMD64)
+#  define ARCHITECTURE_ID "x64"
+
+# elif defined(_M_IX86)
+#  define ARCHITECTURE_ID "X86"
+
+# elif defined(_M_ARM64)
+#  define ARCHITECTURE_ID "ARM64"
+
+# elif defined(_M_ARM)
+#  if _M_ARM == 4
+#   define ARCHITECTURE_ID "ARMV4I"
+#  elif _M_ARM == 5
+#   define ARCHITECTURE_ID "ARMV5I"
+#  else
+#   define ARCHITECTURE_ID "ARMV" STRINGIFY(_M_ARM)
+#  endif
+
+# elif defined(_M_MIPS)
+#  define ARCHITECTURE_ID "MIPS"
+
+# elif defined(_M_SH)
+#  define ARCHITECTURE_ID "SHx"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__WATCOMC__)
+# if defined(_M_I86)
+#  define ARCHITECTURE_ID "I86"
+
+# elif defined(_M_IX86)
+#  define ARCHITECTURE_ID "X86"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__IAR_SYSTEMS_ICC__) || defined(__IAR_SYSTEMS_ICC)
+# if defined(__ICCARM__)
+#  define ARCHITECTURE_ID "ARM"
+
+# elif defined(__ICCRX__)
+#  define ARCHITECTURE_ID "RX"
+
+# elif defined(__ICCRH850__)
+#  define ARCHITECTURE_ID "RH850"
+
+# elif defined(__ICCRL78__)
+#  define ARCHITECTURE_ID "RL78"
+
+# elif defined(__ICCRISCV__)
+#  define ARCHITECTURE_ID "RISCV"
+
+# elif defined(__ICCAVR__)
+#  define ARCHITECTURE_ID "AVR"
+
+# elif defined(__ICC430__)
+#  define ARCHITECTURE_ID "MSP430"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__ghs__)
+# if defined(__PPC64__)
+#  define ARCHITECTURE_ID "PPC64"
+
+# elif defined(__ppc__)
+#  define ARCHITECTURE_ID "PPC"
+
+# elif defined(__ARM__)
+#  define ARCHITECTURE_ID "ARM"
+
+# elif defined(__x86_64__)
+#  define ARCHITECTURE_ID "x64"
+
+# elif defined(__i386__)
+#  define ARCHITECTURE_ID "X86"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+#else
+#  define ARCHITECTURE_ID
+#endif
+
+/* Convert integer to decimal digit literals.  */
+#define DEC(n)                   \
+  ('0' + (((n) / 10000000)%10)), \
+  ('0' + (((n) / 1000000)%10)),  \
+  ('0' + (((n) / 100000)%10)),   \
+  ('0' + (((n) / 10000)%10)),    \
+  ('0' + (((n) / 1000)%10)),     \
+  ('0' + (((n) / 100)%10)),      \
+  ('0' + (((n) / 10)%10)),       \
+  ('0' +  ((n) % 10))
+
+/* Convert integer to hex digit literals.  */
+#define HEX(n)             \
+  ('0' + ((n)>>28 & 0xF)), \
+  ('0' + ((n)>>24 & 0xF)), \
+  ('0' + ((n)>>20 & 0xF)), \
+  ('0' + ((n)>>16 & 0xF)), \
+  ('0' + ((n)>>12 & 0xF)), \
+  ('0' + ((n)>>8  & 0xF)), \
+  ('0' + ((n)>>4  & 0xF)), \
+  ('0' + ((n)     & 0xF))
+
+/* Construct a string literal encoding the version number components. */
+#ifdef COMPILER_VERSION_MAJOR
+char const info_version[] = {
+  'I', 'N', 'F', 'O', ':',
+  'c','o','m','p','i','l','e','r','_','v','e','r','s','i','o','n','[',
+  COMPILER_VERSION_MAJOR,
+# ifdef COMPILER_VERSION_MINOR
+  '.', COMPILER_VERSION_MINOR,
+#  ifdef COMPILER_VERSION_PATCH
+   '.', COMPILER_VERSION_PATCH,
+#   ifdef COMPILER_VERSION_TWEAK
+    '.', COMPILER_VERSION_TWEAK,
+#   endif
+#  endif
+# endif
+  ']','\0'};
+#endif
+
+/* Construct a string literal encoding the internal version number. */
+#ifdef COMPILER_VERSION_INTERNAL
+char const info_version_internal[] = {
+  'I', 'N', 'F', 'O', ':',
+  'c','o','m','p','i','l','e','r','_','v','e','r','s','i','o','n','_',
+  'i','n','t','e','r','n','a','l','[',
+  COMPILER_VERSION_INTERNAL,']','\0'};
+#endif
+
+/* Construct a string literal encoding the version number components. */
+#ifdef SIMULATE_VERSION_MAJOR
+char const info_simulate_version[] = {
+  'I', 'N', 'F', 'O', ':',
+  's','i','m','u','l','a','t','e','_','v','e','r','s','i','o','n','[',
+  SIMULATE_VERSION_MAJOR,
+# ifdef SIMULATE_VERSION_MINOR
+  '.', SIMULATE_VERSION_MINOR,
+#  ifdef SIMULATE_VERSION_PATCH
+   '.', SIMULATE_VERSION_PATCH,
+#   ifdef SIMULATE_VERSION_TWEAK
+    '.', SIMULATE_VERSION_TWEAK,
+#   endif
+#  endif
+# endif
+  ']','\0'};
+#endif
+
+/* Construct the string literal in pieces to prevent the source from
+   getting matched.  Store it in a pointer rather than an array
+   because some compilers will just produce instructions to fill the
+   array rather than assigning a pointer to a static array.  */
+char const* info_platform = "INFO" ":" "platform[" PLATFORM_ID "]";
+char const* info_arch = "INFO" ":" "arch[" ARCHITECTURE_ID "]";
+
+
+
+
+#if defined(_MSC_VER) && defined(_MSVC_LANG)
+#define CXX_STD _MSVC_LANG
+#else
+#define CXX_STD __cplusplus
+#endif
+
+const char* info_language_dialect_default = "INFO" ":" "dialect_default["
+#if CXX_STD > 201703L
+  "20"
+#elif CXX_STD >= 201703L
+  "17"
+#elif CXX_STD >= 201402L
+  "14"
+#elif CXX_STD >= 201103L
+  "11"
+#else
+  "98"
+#endif
+"]";
+
+/*--------------------------------------------------------------------------*/
+
+int main(int argc, char* argv[])
+{
+  int require = 0;
+  require += info_compiler[argc];
+  require += info_platform[argc];
+#ifdef COMPILER_VERSION_MAJOR
+  require += info_version[argc];
+#endif
+#ifdef COMPILER_VERSION_INTERNAL
+  require += info_version_internal[argc];
+#endif
+#ifdef SIMULATE_ID
+  require += info_simulate[argc];
+#endif
+#ifdef SIMULATE_VERSION_MAJOR
+  require += info_simulate_version[argc];
+#endif
+#if defined(__CRAYXE) || defined(__CRAYXC)
+  require += info_cray[argc];
+#endif
+  require += info_language_dialect_default[argc];
+  (void)argv;
+  return require;
+}
diff --git a/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdCXX/a.out b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdCXX/a.out
new file mode 100755
index 0000000000..a5dafb114b
Binary files /dev/null and b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdCXX/a.out differ
diff --git a/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/CMakeOutput.log b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/CMakeOutput.log
new file mode 100644
index 0000000000..912da6cdaa
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/CMakeOutput.log
@@ -0,0 +1,439 @@
+The target system is: Darwin - 1 - 
+The host system is: Darwin - 18.7.0 - x86_64
+Compiling the C compiler identification source file "CMakeCCompilerId.c" succeeded.
+Compiler: /usr/bin/gcc 
+Build flags: 
+Id flags:  
+
+The output was:
+0
+
+
+Compilation of the C compiler identification source "CMakeCCompilerId.c" produced "a.out"
+
+The C compiler identification is AppleClang, found in "/Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdC/a.out"
+
+Compiling the CXX compiler identification source file "CMakeCXXCompilerId.cpp" succeeded.
+Compiler: /usr/bin/g++ 
+Build flags: 
+Id flags:  
+
+The output was:
+0
+
+
+Compilation of the CXX compiler identification source "CMakeCXXCompilerId.cpp" produced "a.out"
+
+The CXX compiler identification is AppleClang, found in "/Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/3.15.1/CompilerIdCXX/a.out"
+
+Determining if the C compiler works passed with the following output:
+Change Dir: /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp
+
+Run Build Command(s):/Applications/Xcode.app/Contents/Developer/usr/bin/make cmTC_1f109/fast && /Applications/Xcode.app/Contents/Developer/usr/bin/make -f CMakeFiles/cmTC_1f109.dir/build.make CMakeFiles/cmTC_1f109.dir/build
+Building C object CMakeFiles/cmTC_1f109.dir/testCCompiler.c.o
+/usr/bin/gcc   -fembed-bitcode  -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk   -o CMakeFiles/cmTC_1f109.dir/testCCompiler.c.o   -c /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/testCCompiler.c
+Linking C executable cmTC_1f109
+/usr/local/Cellar/cmake/3.15.1/bin/cmake -E cmake_link_script CMakeFiles/cmTC_1f109.dir/link.txt --verbose=1
+/usr/bin/gcc -fembed-bitcode  -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -Wl,-headerpad_max_install_names   CMakeFiles/cmTC_1f109.dir/testCCompiler.c.o  -o cmTC_1f109 
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+
+
+
+Detecting C compiler ABI info compiled with the following output:
+Change Dir: /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp
+
+Run Build Command(s):/Applications/Xcode.app/Contents/Developer/usr/bin/make cmTC_98c36/fast && /Applications/Xcode.app/Contents/Developer/usr/bin/make -f CMakeFiles/cmTC_98c36.dir/build.make CMakeFiles/cmTC_98c36.dir/build
+Building C object CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.o
+/usr/bin/gcc   -fembed-bitcode  -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk   -v -Wl,-v -o CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.o   -c /usr/local/Cellar/cmake/3.15.1/share/cmake/Modules/CMakeCCompilerABI.c
+Apple LLVM version 10.0.1 (clang-1001.0.46.4)
+Target: aarch64-apple-darwin18.7.0
+Thread model: posix
+InstalledDir: /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin
+clang: warning: -Wl,-v: 'linker' input unused [-Wunused-command-line-argument]
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple thumbv7-apple-ios10.99.99 -emit-llvm-bc -disable-free -disable-llvm-verifier -discard-value-names -main-file-name CMakeCCompilerABI.c -mrelocation-model pic -pic-level 2 -mthread-model posix -mdisable-fp-elim -fno-strict-return -masm-verbose -faligned-alloc-unavailable -target-sdk-version=12.4 -target-cpu generic -target-feature +soft-float-abi -target-abi apcs-gnu -mfloat-abi soft -fallow-half-arguments-and-returns -dwarf-column-info -debugger-tuning=lldb -target-linker-version 450.3 -v -coverage-notes-file /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.gcno -resource-dir /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -Wno-atomic-implicit-seq-cst -Wno-framework-include-private-from-public -Wno-atimport-in-framework-header -Wno-quoted-include-in-framework-header -fdebug-compilation-dir /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp -ferror-limit 19 -fmessage-length 0 -stack-protector 1 -fblocks -fencode-extended-block-signature -fregister-global-dtors-with-atexit -fobjc-runtime=ios-10.99.99 -fsjlj-exceptions -fmax-type-align=16 -fdiagnostics-show-option -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-b9fadf.bc -x c /usr/local/Cellar/cmake/3.15.1/share/cmake/Modules/CMakeCCompilerABI.c
+clang -cc1 version 10.0.1 (clang-1001.0.46.4) default target x86_64-apple-darwin18.7.0
+ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/local/include"
+ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/Library/Frameworks"
+#include "..." search starts here:
+#include <...> search starts here:
+ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include
+ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include
+ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include
+ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks (framework directory)
+End of search list.
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple thumbv7-apple-ios10.99.99 -emit-obj -fembed-bitcode=all -disable-llvm-passes -target-abi apcs-gnu -mfloat-abi soft -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-5f1d4e.o -x ir /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-b9fadf.bc
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple arm64-apple-ios12.4.0 -Wdeprecated-objc-isa-usage -Werror=deprecated-objc-isa-usage -Werror=implicit-function-declaration -emit-llvm-bc -disable-free -disable-llvm-verifier -discard-value-names -main-file-name CMakeCCompilerABI.c -mrelocation-model pic -pic-level 2 -mthread-model posix -mdisable-fp-elim -fno-strict-return -masm-verbose -munwind-tables -target-sdk-version=12.4 -target-cpu cyclone -target-feature +fp-armv8 -target-feature +neon -target-feature +crypto -target-feature +zcm -target-feature +zcz -target-abi darwinpcs -fallow-half-arguments-and-returns -dwarf-column-info -debugger-tuning=lldb -target-linker-version 450.3 -v -coverage-notes-file /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.gcno -resource-dir /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -Wno-atomic-implicit-seq-cst -Wno-framework-include-private-from-public -Wno-atimport-in-framework-header -Wno-quoted-include-in-framework-header -fdebug-compilation-dir /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp -ferror-limit 19 -fmessage-length 0 -stack-protector 1 -fblocks -fencode-extended-block-signature -fregister-global-dtors-with-atexit -fobjc-runtime=ios-12.4.0 -fmax-type-align=16 -fdiagnostics-show-option -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-5bd9a8.bc -x c /usr/local/Cellar/cmake/3.15.1/share/cmake/Modules/CMakeCCompilerABI.c
+clang -cc1 version 10.0.1 (clang-1001.0.46.4) default target x86_64-apple-darwin18.7.0
+ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/local/include"
+ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/Library/Frameworks"
+#include "..." search starts here:
+#include <...> search starts here:
+ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include
+ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include
+ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include
+ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks (framework directory)
+End of search list.
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple arm64-apple-ios12.4.0 -Wdeprecated-objc-isa-usage -Werror=deprecated-objc-isa-usage -Werror=implicit-function-declaration -emit-obj -fembed-bitcode=all -disable-llvm-passes -target-abi darwinpcs -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-e69450.o -x ir /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-5bd9a8.bc
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/lipo" -create -output CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-5f1d4e.o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-e69450.o
+Linking C executable cmTC_98c36
+/usr/local/Cellar/cmake/3.15.1/bin/cmake -E cmake_link_script CMakeFiles/cmTC_98c36.dir/link.txt --verbose=1
+/usr/bin/gcc -fembed-bitcode  -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -Wl,-headerpad_max_install_names  -v -Wl,-v CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.o  -o cmTC_98c36 
+Apple LLVM version 10.0.1 (clang-1001.0.46.4)
+Target: aarch64-apple-darwin18.7.0
+Thread model: posix
+InstalledDir: /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/ld" -demangle -lto_library /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/libLTO.dylib -dynamic -arch armv7 -iphoneos_version_min 10.99.99 -bitcode_bundle -syslibroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/-65f24e.out -headerpad_max_install_names -v CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.o -arch_multiple -final_output cmTC_98c36 -lSystem /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/lib/darwin/libclang_rt.ios.a
+@(#)PROGRAM:ld  PROJECT:ld64-450.3
+BUILD 18:16:53 Apr  5 2019
+configured to support archs: armv6 armv7 armv7s arm64 arm64e arm64_32 i386 x86_64 x86_64h armv6m armv7k armv7m armv7em
+Library search paths:
+	/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib
+Framework search paths:
+	/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks/
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/ld" -demangle -lto_library /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/libLTO.dylib -no_deduplicate -dynamic -arch arm64 -iphoneos_version_min 12.4.0 -bitcode_bundle -syslibroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/-6a108d.out -headerpad_max_install_names -v CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.o -arch_multiple -final_output cmTC_98c36 -lSystem /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/lib/darwin/libclang_rt.ios.a
+@(#)PROGRAM:ld  PROJECT:ld64-450.3
+BUILD 18:16:53 Apr  5 2019
+configured to support archs: armv6 armv7 armv7s arm64 arm64e arm64_32 i386 x86_64 x86_64h armv6m armv7k armv7m armv7em
+Library search paths:
+	/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib
+Framework search paths:
+	/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks/
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/lipo" -create -output cmTC_98c36 /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/-65f24e.out /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/-6a108d.out
+
+
+
+Parsed C implicit include dir info from above output: rv=done
+  found start of include info
+  found start of implicit include info
+    add: [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include]
+    add: [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include]
+    add: [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include]
+  end of search list found
+  collapse include dir [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include] ==> [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include]
+  collapse include dir [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include] ==> [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include]
+  collapse include dir [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include] ==> [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include]
+  implicit include dirs: [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include;/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include;/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include]
+
+
+Parsed C implicit link information from above output:
+  link line regex: [^( *|.*[/\])(CMAKE_LINKER-NOTFOUND|CMAKE_LINK_STARTFILE-NOTFOUND|([^/\]+-)?ld|collect2)[^/\]*( |$)]
+  ignore line: [Change Dir: /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp]
+  ignore line: []
+  ignore line: [Run Build Command(s):/Applications/Xcode.app/Contents/Developer/usr/bin/make cmTC_98c36/fast && /Applications/Xcode.app/Contents/Developer/usr/bin/make -f CMakeFiles/cmTC_98c36.dir/build.make CMakeFiles/cmTC_98c36.dir/build]
+  ignore line: [Building C object CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.o]
+  ignore line: [/usr/bin/gcc   -fembed-bitcode  -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk   -v -Wl,-v -o CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.o   -c /usr/local/Cellar/cmake/3.15.1/share/cmake/Modules/CMakeCCompilerABI.c]
+  ignore line: [Apple LLVM version 10.0.1 (clang-1001.0.46.4)]
+  ignore line: [Target: aarch64-apple-darwin18.7.0]
+  ignore line: [Thread model: posix]
+  ignore line: [InstalledDir: /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin]
+  ignore line: [clang: warning: -Wl,-v: 'linker' input unused [-Wunused-command-line-argument]]
+  ignore line: [ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple thumbv7-apple-ios10.99.99 -emit-llvm-bc -disable-free -disable-llvm-verifier -discard-value-names -main-file-name CMakeCCompilerABI.c -mrelocation-model pic -pic-level 2 -mthread-model posix -mdisable-fp-elim -fno-strict-return -masm-verbose -faligned-alloc-unavailable -target-sdk-version=12.4 -target-cpu generic -target-feature +soft-float-abi -target-abi apcs-gnu -mfloat-abi soft -fallow-half-arguments-and-returns -dwarf-column-info -debugger-tuning=lldb -target-linker-version 450.3 -v -coverage-notes-file /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.gcno -resource-dir /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -Wno-atomic-implicit-seq-cst -Wno-framework-include-private-from-public -Wno-atimport-in-framework-header -Wno-quoted-include-in-framework-header -fdebug-compilation-dir /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp -ferror-limit 19 -fmessage-length 0 -stack-protector 1 -fblocks -fencode-extended-block-signature -fregister-global-dtors-with-atexit -fobjc-runtime=ios-10.99.99 -fsjlj-exceptions -fmax-type-align=16 -fdiagnostics-show-option -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-b9fadf.bc -x c /usr/local/Cellar/cmake/3.15.1/share/cmake/Modules/CMakeCCompilerABI.c]
+  ignore line: [clang -cc1 version 10.0.1 (clang-1001.0.46.4) default target x86_64-apple-darwin18.7.0]
+  ignore line: [ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/local/include"]
+  ignore line: [ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/Library/Frameworks"]
+  ignore line: [#include "..." search starts here:]
+  ignore line: [#include <...> search starts here:]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks (framework directory)]
+  ignore line: [End of search list.]
+  ignore line: [ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple thumbv7-apple-ios10.99.99 -emit-obj -fembed-bitcode=all -disable-llvm-passes -target-abi apcs-gnu -mfloat-abi soft -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-5f1d4e.o -x ir /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-b9fadf.bc]
+  ignore line: [ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple arm64-apple-ios12.4.0 -Wdeprecated-objc-isa-usage -Werror=deprecated-objc-isa-usage -Werror=implicit-function-declaration -emit-llvm-bc -disable-free -disable-llvm-verifier -discard-value-names -main-file-name CMakeCCompilerABI.c -mrelocation-model pic -pic-level 2 -mthread-model posix -mdisable-fp-elim -fno-strict-return -masm-verbose -munwind-tables -target-sdk-version=12.4 -target-cpu cyclone -target-feature +fp-armv8 -target-feature +neon -target-feature +crypto -target-feature +zcm -target-feature +zcz -target-abi darwinpcs -fallow-half-arguments-and-returns -dwarf-column-info -debugger-tuning=lldb -target-linker-version 450.3 -v -coverage-notes-file /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.gcno -resource-dir /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -Wno-atomic-implicit-seq-cst -Wno-framework-include-private-from-public -Wno-atimport-in-framework-header -Wno-quoted-include-in-framework-header -fdebug-compilation-dir /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp -ferror-limit 19 -fmessage-length 0 -stack-protector 1 -fblocks -fencode-extended-block-signature -fregister-global-dtors-with-atexit -fobjc-runtime=ios-12.4.0 -fmax-type-align=16 -fdiagnostics-show-option -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-5bd9a8.bc -x c /usr/local/Cellar/cmake/3.15.1/share/cmake/Modules/CMakeCCompilerABI.c]
+  ignore line: [clang -cc1 version 10.0.1 (clang-1001.0.46.4) default target x86_64-apple-darwin18.7.0]
+  ignore line: [ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/local/include"]
+  ignore line: [ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/Library/Frameworks"]
+  ignore line: [#include "..." search starts here:]
+  ignore line: [#include <...> search starts here:]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks (framework directory)]
+  ignore line: [End of search list.]
+  ignore line: [ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple arm64-apple-ios12.4.0 -Wdeprecated-objc-isa-usage -Werror=deprecated-objc-isa-usage -Werror=implicit-function-declaration -emit-obj -fembed-bitcode=all -disable-llvm-passes -target-abi darwinpcs -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-e69450.o -x ir /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-5bd9a8.bc]
+  ignore line: [ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/lipo" -create -output CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-5f1d4e.o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCCompilerABI-e69450.o]
+  ignore line: [Linking C executable cmTC_98c36]
+  ignore line: [/usr/local/Cellar/cmake/3.15.1/bin/cmake -E cmake_link_script CMakeFiles/cmTC_98c36.dir/link.txt --verbose=1]
+  ignore line: [/usr/bin/gcc -fembed-bitcode  -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -Wl,-headerpad_max_install_names  -v -Wl,-v CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.o  -o cmTC_98c36 ]
+  ignore line: [Apple LLVM version 10.0.1 (clang-1001.0.46.4)]
+  ignore line: [Target: aarch64-apple-darwin18.7.0]
+  ignore line: [Thread model: posix]
+  ignore line: [InstalledDir: /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin]
+  link line: [ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/ld" -demangle -lto_library /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/libLTO.dylib -dynamic -arch armv7 -iphoneos_version_min 10.99.99 -bitcode_bundle -syslibroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/-65f24e.out -headerpad_max_install_names -v CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.o -arch_multiple -final_output cmTC_98c36 -lSystem /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/lib/darwin/libclang_rt.ios.a]
+    arg [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/ld] ==> ignore
+    arg [-demangle] ==> ignore
+    arg [-lto_library] ==> ignore, skip following value
+    arg [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/libLTO.dylib] ==> skip value of -lto_library
+    arg [-dynamic] ==> ignore
+    arg [-arch] ==> ignore
+    arg [armv7] ==> ignore
+    arg [-iphoneos_version_min] ==> ignore
+    arg [10.99.99] ==> ignore
+    arg [-bitcode_bundle] ==> ignore
+    arg [-syslibroot] ==> ignore
+    arg [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk] ==> ignore
+    arg [-o] ==> ignore
+    arg [/var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/-65f24e.out] ==> ignore
+    arg [-headerpad_max_install_names] ==> ignore
+    arg [-v] ==> ignore
+    arg [CMakeFiles/cmTC_98c36.dir/CMakeCCompilerABI.c.o] ==> ignore
+    arg [-arch_multiple] ==> ignore
+    arg [-final_output] ==> ignore
+    arg [cmTC_98c36] ==> ignore
+    arg [-lSystem] ==> lib [System]
+    arg [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/lib/darwin/libclang_rt.ios.a] ==> lib [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/lib/darwin/libclang_rt.ios.a]
+  Library search paths: [;/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib]
+  Framework search paths: [;/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks/]
+  remove lib [System]
+  remove lib [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/lib/darwin/libclang_rt.ios.a]
+  collapse library dir [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib] ==> [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib]
+  collapse framework dir [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks/] ==> [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks]
+  implicit libs: []
+  implicit dirs: [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib]
+  implicit fwks: [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks]
+
+
+Determining if the CXX compiler works passed with the following output:
+Change Dir: /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp
+
+Run Build Command(s):/Applications/Xcode.app/Contents/Developer/usr/bin/make cmTC_feed8/fast && /Applications/Xcode.app/Contents/Developer/usr/bin/make -f CMakeFiles/cmTC_feed8.dir/build.make CMakeFiles/cmTC_feed8.dir/build
+Building CXX object CMakeFiles/cmTC_feed8.dir/testCXXCompiler.cxx.o
+/usr/bin/g++    -fembed-bitcode -fvisibility-inlines-hidden  -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk   -o CMakeFiles/cmTC_feed8.dir/testCXXCompiler.cxx.o -c /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/testCXXCompiler.cxx
+Linking CXX executable cmTC_feed8
+/usr/local/Cellar/cmake/3.15.1/bin/cmake -E cmake_link_script CMakeFiles/cmTC_feed8.dir/link.txt --verbose=1
+/usr/bin/g++  -fembed-bitcode -fvisibility-inlines-hidden  -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -Wl,-headerpad_max_install_names   CMakeFiles/cmTC_feed8.dir/testCXXCompiler.cxx.o  -o cmTC_feed8 
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+
+
+
+Detecting CXX compiler ABI info compiled with the following output:
+Change Dir: /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp
+
+Run Build Command(s):/Applications/Xcode.app/Contents/Developer/usr/bin/make cmTC_9c08f/fast && /Applications/Xcode.app/Contents/Developer/usr/bin/make -f CMakeFiles/cmTC_9c08f.dir/build.make CMakeFiles/cmTC_9c08f.dir/build
+Building CXX object CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.o
+/usr/bin/g++    -fembed-bitcode -fvisibility-inlines-hidden  -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk   -v -Wl,-v -o CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.o -c /usr/local/Cellar/cmake/3.15.1/share/cmake/Modules/CMakeCXXCompilerABI.cpp
+Apple LLVM version 10.0.1 (clang-1001.0.46.4)
+Target: aarch64-apple-darwin18.7.0
+Thread model: posix
+InstalledDir: /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin
+clang: warning: -Wl,-v: 'linker' input unused [-Wunused-command-line-argument]
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple thumbv7-apple-ios10.99.99 -emit-llvm-bc -disable-free -disable-llvm-verifier -discard-value-names -main-file-name CMakeCXXCompilerABI.cpp -mrelocation-model pic -pic-level 2 -mthread-model posix -mdisable-fp-elim -fno-strict-return -masm-verbose -faligned-alloc-unavailable -target-sdk-version=12.4 -target-cpu generic -target-feature +soft-float-abi -target-abi apcs-gnu -mfloat-abi soft -fallow-half-arguments-and-returns -dwarf-column-info -debugger-tuning=lldb -target-linker-version 450.3 -v -coverage-notes-file /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.gcno -resource-dir /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -stdlib=libc++ -Wno-atomic-implicit-seq-cst -Wno-framework-include-private-from-public -Wno-atimport-in-framework-header -Wno-quoted-include-in-framework-header -fdeprecated-macro -fdebug-compilation-dir /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp -ferror-limit 19 -fmessage-length 0 -fvisibility-inlines-hidden -stack-protector 1 -fblocks -fencode-extended-block-signature -fregister-global-dtors-with-atexit -fobjc-runtime=ios-10.99.99 -fcxx-exceptions -fexceptions -fsjlj-exceptions -fmax-type-align=16 -fdiagnostics-show-option -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-bca139.bc -x c++ /usr/local/Cellar/cmake/3.15.1/share/cmake/Modules/CMakeCXXCompilerABI.cpp
+clang -cc1 version 10.0.1 (clang-1001.0.46.4) default target x86_64-apple-darwin18.7.0
+ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include/c++/v1"
+ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/local/include"
+ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/Library/Frameworks"
+#include "..." search starts here:
+#include <...> search starts here:
+ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include/c++/v1
+ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include
+ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include
+ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include
+ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks (framework directory)
+End of search list.
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple thumbv7-apple-ios10.99.99 -emit-obj -fembed-bitcode=all -disable-llvm-passes -target-abi apcs-gnu -mfloat-abi soft -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-c0bc7e.o -x ir /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-bca139.bc
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple arm64-apple-ios12.4.0 -Wdeprecated-objc-isa-usage -Werror=deprecated-objc-isa-usage -Werror=implicit-function-declaration -emit-llvm-bc -disable-free -disable-llvm-verifier -discard-value-names -main-file-name CMakeCXXCompilerABI.cpp -mrelocation-model pic -pic-level 2 -mthread-model posix -mdisable-fp-elim -fno-strict-return -masm-verbose -munwind-tables -target-sdk-version=12.4 -target-cpu cyclone -target-feature +fp-armv8 -target-feature +neon -target-feature +crypto -target-feature +zcm -target-feature +zcz -target-abi darwinpcs -fallow-half-arguments-and-returns -dwarf-column-info -debugger-tuning=lldb -target-linker-version 450.3 -v -coverage-notes-file /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.gcno -resource-dir /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -stdlib=libc++ -Wno-atomic-implicit-seq-cst -Wno-framework-include-private-from-public -Wno-atimport-in-framework-header -Wno-quoted-include-in-framework-header -fdeprecated-macro -fdebug-compilation-dir /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp -ferror-limit 19 -fmessage-length 0 -fvisibility-inlines-hidden -stack-protector 1 -fblocks -fencode-extended-block-signature -fregister-global-dtors-with-atexit -fobjc-runtime=ios-12.4.0 -fcxx-exceptions -fexceptions -fmax-type-align=16 -fdiagnostics-show-option -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-9fb0bd.bc -x c++ /usr/local/Cellar/cmake/3.15.1/share/cmake/Modules/CMakeCXXCompilerABI.cpp
+clang -cc1 version 10.0.1 (clang-1001.0.46.4) default target x86_64-apple-darwin18.7.0
+ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include/c++/v1"
+ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/local/include"
+ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/Library/Frameworks"
+#include "..." search starts here:
+#include <...> search starts here:
+ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include/c++/v1
+ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include
+ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include
+ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include
+ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks (framework directory)
+End of search list.
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple arm64-apple-ios12.4.0 -Wdeprecated-objc-isa-usage -Werror=deprecated-objc-isa-usage -Werror=implicit-function-declaration -emit-obj -fembed-bitcode=all -disable-llvm-passes -target-abi darwinpcs -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-0c9d5d.o -x ir /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-9fb0bd.bc
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/lipo" -create -output CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-c0bc7e.o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-0c9d5d.o
+Linking CXX executable cmTC_9c08f
+/usr/local/Cellar/cmake/3.15.1/bin/cmake -E cmake_link_script CMakeFiles/cmTC_9c08f.dir/link.txt --verbose=1
+/usr/bin/g++  -fembed-bitcode -fvisibility-inlines-hidden  -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -Wl,-headerpad_max_install_names  -v -Wl,-v CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.o  -o cmTC_9c08f 
+Apple LLVM version 10.0.1 (clang-1001.0.46.4)
+Target: aarch64-apple-darwin18.7.0
+Thread model: posix
+InstalledDir: /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/ld" -demangle -lto_library /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/libLTO.dylib -dynamic -arch armv7 -iphoneos_version_min 10.99.99 -bitcode_bundle -syslibroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/-b203f2.out -headerpad_max_install_names -v CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.o -arch_multiple -final_output cmTC_9c08f -lc++ -lSystem /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/lib/darwin/libclang_rt.ios.a
+@(#)PROGRAM:ld  PROJECT:ld64-450.3
+BUILD 18:16:53 Apr  5 2019
+configured to support archs: armv6 armv7 armv7s arm64 arm64e arm64_32 i386 x86_64 x86_64h armv6m armv7k armv7m armv7em
+Library search paths:
+	/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib
+Framework search paths:
+	/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks/
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/ld" -demangle -lto_library /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/libLTO.dylib -no_deduplicate -dynamic -arch arm64 -iphoneos_version_min 12.4.0 -bitcode_bundle -syslibroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/-7576c4.out -headerpad_max_install_names -v CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.o -arch_multiple -final_output cmTC_9c08f -lc++ -lSystem /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/lib/darwin/libclang_rt.ios.a
+@(#)PROGRAM:ld  PROJECT:ld64-450.3
+BUILD 18:16:53 Apr  5 2019
+configured to support archs: armv6 armv7 armv7s arm64 arm64e arm64_32 i386 x86_64 x86_64h armv6m armv7k armv7m armv7em
+Library search paths:
+	/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib
+Framework search paths:
+	/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks/
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/lipo" -create -output cmTC_9c08f /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/-b203f2.out /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/-7576c4.out
+
+
+
+Parsed CXX implicit include dir info from above output: rv=done
+  found start of include info
+  found start of implicit include info
+    add: [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include/c++/v1]
+    add: [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include]
+    add: [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include]
+    add: [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include]
+  end of search list found
+  collapse include dir [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include/c++/v1] ==> [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include/c++/v1]
+  collapse include dir [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include] ==> [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include]
+  collapse include dir [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include] ==> [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include]
+  collapse include dir [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include] ==> [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include]
+  implicit include dirs: [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include/c++/v1;/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include;/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include;/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include]
+
+
+Parsed CXX implicit link information from above output:
+  link line regex: [^( *|.*[/\])(CMAKE_LINKER-NOTFOUND|CMAKE_LINK_STARTFILE-NOTFOUND|([^/\]+-)?ld|collect2)[^/\]*( |$)]
+  ignore line: [Change Dir: /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp]
+  ignore line: []
+  ignore line: [Run Build Command(s):/Applications/Xcode.app/Contents/Developer/usr/bin/make cmTC_9c08f/fast && /Applications/Xcode.app/Contents/Developer/usr/bin/make -f CMakeFiles/cmTC_9c08f.dir/build.make CMakeFiles/cmTC_9c08f.dir/build]
+  ignore line: [Building CXX object CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.o]
+  ignore line: [/usr/bin/g++    -fembed-bitcode -fvisibility-inlines-hidden  -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk   -v -Wl,-v -o CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.o -c /usr/local/Cellar/cmake/3.15.1/share/cmake/Modules/CMakeCXXCompilerABI.cpp]
+  ignore line: [Apple LLVM version 10.0.1 (clang-1001.0.46.4)]
+  ignore line: [Target: aarch64-apple-darwin18.7.0]
+  ignore line: [Thread model: posix]
+  ignore line: [InstalledDir: /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin]
+  ignore line: [clang: warning: -Wl,-v: 'linker' input unused [-Wunused-command-line-argument]]
+  ignore line: [ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple thumbv7-apple-ios10.99.99 -emit-llvm-bc -disable-free -disable-llvm-verifier -discard-value-names -main-file-name CMakeCXXCompilerABI.cpp -mrelocation-model pic -pic-level 2 -mthread-model posix -mdisable-fp-elim -fno-strict-return -masm-verbose -faligned-alloc-unavailable -target-sdk-version=12.4 -target-cpu generic -target-feature +soft-float-abi -target-abi apcs-gnu -mfloat-abi soft -fallow-half-arguments-and-returns -dwarf-column-info -debugger-tuning=lldb -target-linker-version 450.3 -v -coverage-notes-file /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.gcno -resource-dir /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -stdlib=libc++ -Wno-atomic-implicit-seq-cst -Wno-framework-include-private-from-public -Wno-atimport-in-framework-header -Wno-quoted-include-in-framework-header -fdeprecated-macro -fdebug-compilation-dir /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp -ferror-limit 19 -fmessage-length 0 -fvisibility-inlines-hidden -stack-protector 1 -fblocks -fencode-extended-block-signature -fregister-global-dtors-with-atexit -fobjc-runtime=ios-10.99.99 -fcxx-exceptions -fexceptions -fsjlj-exceptions -fmax-type-align=16 -fdiagnostics-show-option -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-bca139.bc -x c++ /usr/local/Cellar/cmake/3.15.1/share/cmake/Modules/CMakeCXXCompilerABI.cpp]
+  ignore line: [clang -cc1 version 10.0.1 (clang-1001.0.46.4) default target x86_64-apple-darwin18.7.0]
+  ignore line: [ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include/c++/v1"]
+  ignore line: [ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/local/include"]
+  ignore line: [ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/Library/Frameworks"]
+  ignore line: [#include "..." search starts here:]
+  ignore line: [#include <...> search starts here:]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include/c++/v1]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks (framework directory)]
+  ignore line: [End of search list.]
+  ignore line: [ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple thumbv7-apple-ios10.99.99 -emit-obj -fembed-bitcode=all -disable-llvm-passes -target-abi apcs-gnu -mfloat-abi soft -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-c0bc7e.o -x ir /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-bca139.bc]
+  ignore line: [ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple arm64-apple-ios12.4.0 -Wdeprecated-objc-isa-usage -Werror=deprecated-objc-isa-usage -Werror=implicit-function-declaration -emit-llvm-bc -disable-free -disable-llvm-verifier -discard-value-names -main-file-name CMakeCXXCompilerABI.cpp -mrelocation-model pic -pic-level 2 -mthread-model posix -mdisable-fp-elim -fno-strict-return -masm-verbose -munwind-tables -target-sdk-version=12.4 -target-cpu cyclone -target-feature +fp-armv8 -target-feature +neon -target-feature +crypto -target-feature +zcm -target-feature +zcz -target-abi darwinpcs -fallow-half-arguments-and-returns -dwarf-column-info -debugger-tuning=lldb -target-linker-version 450.3 -v -coverage-notes-file /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.gcno -resource-dir /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -stdlib=libc++ -Wno-atomic-implicit-seq-cst -Wno-framework-include-private-from-public -Wno-atimport-in-framework-header -Wno-quoted-include-in-framework-header -fdeprecated-macro -fdebug-compilation-dir /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp -ferror-limit 19 -fmessage-length 0 -fvisibility-inlines-hidden -stack-protector 1 -fblocks -fencode-extended-block-signature -fregister-global-dtors-with-atexit -fobjc-runtime=ios-12.4.0 -fcxx-exceptions -fexceptions -fmax-type-align=16 -fdiagnostics-show-option -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-9fb0bd.bc -x c++ /usr/local/Cellar/cmake/3.15.1/share/cmake/Modules/CMakeCXXCompilerABI.cpp]
+  ignore line: [clang -cc1 version 10.0.1 (clang-1001.0.46.4) default target x86_64-apple-darwin18.7.0]
+  ignore line: [ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include/c++/v1"]
+  ignore line: [ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/local/include"]
+  ignore line: [ignoring nonexistent directory "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/Library/Frameworks"]
+  ignore line: [#include "..." search starts here:]
+  ignore line: [#include <...> search starts here:]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include/c++/v1]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/include]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/include]
+  ignore line: [ /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks (framework directory)]
+  ignore line: [End of search list.]
+  ignore line: [ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang" -cc1 -triple arm64-apple-ios12.4.0 -Wdeprecated-objc-isa-usage -Werror=deprecated-objc-isa-usage -Werror=implicit-function-declaration -emit-obj -fembed-bitcode=all -disable-llvm-passes -target-abi darwinpcs -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-0c9d5d.o -x ir /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-9fb0bd.bc]
+  ignore line: [ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/lipo" -create -output CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-c0bc7e.o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/CMakeCXXCompilerABI-0c9d5d.o]
+  ignore line: [Linking CXX executable cmTC_9c08f]
+  ignore line: [/usr/local/Cellar/cmake/3.15.1/bin/cmake -E cmake_link_script CMakeFiles/cmTC_9c08f.dir/link.txt --verbose=1]
+  ignore line: [/usr/bin/g++  -fembed-bitcode -fvisibility-inlines-hidden  -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -Wl,-headerpad_max_install_names  -v -Wl,-v CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.o  -o cmTC_9c08f ]
+  ignore line: [Apple LLVM version 10.0.1 (clang-1001.0.46.4)]
+  ignore line: [Target: aarch64-apple-darwin18.7.0]
+  ignore line: [Thread model: posix]
+  ignore line: [InstalledDir: /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin]
+  link line: [ "/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/ld" -demangle -lto_library /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/libLTO.dylib -dynamic -arch armv7 -iphoneos_version_min 10.99.99 -bitcode_bundle -syslibroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -o /var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/-b203f2.out -headerpad_max_install_names -v CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.o -arch_multiple -final_output cmTC_9c08f -lc++ -lSystem /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/lib/darwin/libclang_rt.ios.a]
+    arg [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/ld] ==> ignore
+    arg [-demangle] ==> ignore
+    arg [-lto_library] ==> ignore, skip following value
+    arg [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/libLTO.dylib] ==> skip value of -lto_library
+    arg [-dynamic] ==> ignore
+    arg [-arch] ==> ignore
+    arg [armv7] ==> ignore
+    arg [-iphoneos_version_min] ==> ignore
+    arg [10.99.99] ==> ignore
+    arg [-bitcode_bundle] ==> ignore
+    arg [-syslibroot] ==> ignore
+    arg [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk] ==> ignore
+    arg [-o] ==> ignore
+    arg [/var/folders/mv/bk1z8tdn6wjd3prvt052q9br0000gn/T/-b203f2.out] ==> ignore
+    arg [-headerpad_max_install_names] ==> ignore
+    arg [-v] ==> ignore
+    arg [CMakeFiles/cmTC_9c08f.dir/CMakeCXXCompilerABI.cpp.o] ==> ignore
+    arg [-arch_multiple] ==> ignore
+    arg [-final_output] ==> ignore
+    arg [cmTC_9c08f] ==> ignore
+    arg [-lc++] ==> lib [c++]
+    arg [-lSystem] ==> lib [System]
+    arg [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/lib/darwin/libclang_rt.ios.a] ==> lib [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/lib/darwin/libclang_rt.ios.a]
+  Library search paths: [;/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib]
+  Framework search paths: [;/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks/]
+  remove lib [System]
+  remove lib [/Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/clang/10.0.1/lib/darwin/libclang_rt.ios.a]
+  collapse library dir [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib] ==> [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib]
+  collapse framework dir [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks/] ==> [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks]
+  implicit libs: [c++]
+  implicit dirs: [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/usr/lib]
+  implicit fwks: [/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk/System/Library/Frameworks]
+
+
+Performing C++ SOURCE FILE Test COMPILER_HAS_HIDDEN_VISIBILITY succeeded with the following output:
+Change Dir: /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp
+
+Run Build Command(s):/Applications/Xcode.app/Contents/Developer/usr/bin/make cmTC_3c977/fast && /Applications/Xcode.app/Contents/Developer/usr/bin/make -f CMakeFiles/cmTC_3c977.dir/build.make CMakeFiles/cmTC_3c977.dir/build
+Building CXX object CMakeFiles/cmTC_3c977.dir/src.cxx.o
+/usr/bin/g++    -fembed-bitcode -fvisibility-inlines-hidden -DCOMPILER_HAS_HIDDEN_VISIBILITY -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk   -fvisibility=hidden -o CMakeFiles/cmTC_3c977.dir/src.cxx.o -c /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/src.cxx
+Linking CXX executable cmTC_3c977
+/usr/local/Cellar/cmake/3.15.1/bin/cmake -E cmake_link_script CMakeFiles/cmTC_3c977.dir/link.txt --verbose=1
+/usr/bin/g++  -fembed-bitcode -fvisibility-inlines-hidden -DCOMPILER_HAS_HIDDEN_VISIBILITY -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -Wl,-headerpad_max_install_names   CMakeFiles/cmTC_3c977.dir/src.cxx.o  -o cmTC_3c977 
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+
+
+Source file was:
+int main() { return 0; }
+Performing C++ SOURCE FILE Test COMPILER_HAS_HIDDEN_INLINE_VISIBILITY succeeded with the following output:
+Change Dir: /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp
+
+Run Build Command(s):/Applications/Xcode.app/Contents/Developer/usr/bin/make cmTC_dd3ea/fast && /Applications/Xcode.app/Contents/Developer/usr/bin/make -f CMakeFiles/cmTC_dd3ea.dir/build.make CMakeFiles/cmTC_dd3ea.dir/build
+Building CXX object CMakeFiles/cmTC_dd3ea.dir/src.cxx.o
+/usr/bin/g++    -fembed-bitcode -fvisibility-inlines-hidden -DCOMPILER_HAS_HIDDEN_INLINE_VISIBILITY -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk   -fvisibility-inlines-hidden -o CMakeFiles/cmTC_dd3ea.dir/src.cxx.o -c /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/src.cxx
+Linking CXX executable cmTC_dd3ea
+/usr/local/Cellar/cmake/3.15.1/bin/cmake -E cmake_link_script CMakeFiles/cmTC_dd3ea.dir/link.txt --verbose=1
+/usr/bin/g++  -fembed-bitcode -fvisibility-inlines-hidden -DCOMPILER_HAS_HIDDEN_INLINE_VISIBILITY -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -Wl,-headerpad_max_install_names   CMakeFiles/cmTC_dd3ea.dir/src.cxx.o  -o cmTC_dd3ea 
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+
+
+Source file was:
+int main() { return 0; }
+Performing C++ SOURCE FILE Test COMPILER_HAS_DEPRECATED_ATTR succeeded with the following output:
+Change Dir: /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp
+
+Run Build Command(s):/Applications/Xcode.app/Contents/Developer/usr/bin/make cmTC_f54d2/fast && /Applications/Xcode.app/Contents/Developer/usr/bin/make -f CMakeFiles/cmTC_f54d2.dir/build.make CMakeFiles/cmTC_f54d2.dir/build
+Building CXX object CMakeFiles/cmTC_f54d2.dir/src.cxx.o
+/usr/bin/g++    -fembed-bitcode -fvisibility-inlines-hidden -DCOMPILER_HAS_DEPRECATED_ATTR -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk   -o CMakeFiles/cmTC_f54d2.dir/src.cxx.o -c /Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/src.cxx
+/Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/src.cxx:2:25: warning: 'somefunc' is deprecated [-Wdeprecated-declarations]
+    int main() { return somefunc();}
+                        ^
+/Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/src.cxx:1:16: note: 'somefunc' has been explicitly marked deprecated here
+__attribute__((__deprecated__)) int somefunc() { return 0; }
+               ^
+1 warning generated.
+/Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/src.cxx:2:25: warning: 'somefunc' is deprecated [-Wdeprecated-declarations]
+    int main() { return somefunc();}
+                        ^
+/Users/arseny30/code/ton/tonlib/build/build/build-iOS/CMakeFiles/CMakeTmp/src.cxx:1:16: note: 'somefunc' has been explicitly marked deprecated here
+__attribute__((__deprecated__)) int somefunc() { return 0; }
+               ^
+1 warning generated.
+Linking CXX executable cmTC_f54d2
+/usr/local/Cellar/cmake/3.15.1/bin/cmake -E cmake_link_script CMakeFiles/cmTC_f54d2.dir/link.txt --verbose=1
+/usr/bin/g++  -fembed-bitcode -fvisibility-inlines-hidden -DCOMPILER_HAS_DEPRECATED_ATTR -arch armv7 -arch arm64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS12.4.sdk -Wl,-headerpad_max_install_names   CMakeFiles/cmTC_f54d2.dir/src.cxx.o  -o cmTC_f54d2 
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+ld: warning: -headerpad_max_install_names is ignored when used with -bitcode_bundle (Xcode setting ENABLE_BITCODE=YES)
+
+
+Source file was:
+__attribute__((__deprecated__)) int somefunc() { return 0; }
+    int main() { return somefunc();}
diff --git a/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/cmake.check_cache b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/cmake.check_cache
new file mode 100644
index 0000000000..3dccd73172
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/CMakeFiles/cmake.check_cache
@@ -0,0 +1 @@
+# This file is generated by cmake for dependency checking of the CMakeCache.txt file
diff --git a/submodules/MtProtoKit/TON/iOS/include/tonlib/tonlibjson_export.h b/submodules/ton/tonlib-src/tonlib/build/build/build-iOS/tonlib/tonlibjson_export.h
similarity index 100%
rename from submodules/MtProtoKit/TON/iOS/include/tonlib/tonlibjson_export.h
rename to submodules/ton/tonlib-src/tonlib/build/build/build-iOS/tonlib/tonlibjson_export.h
diff --git a/submodules/ton/tonlib-src/tonlib/test/offline.cpp b/submodules/ton/tonlib-src/tonlib/test/offline.cpp
new file mode 100644
index 0000000000..5d41803417
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/test/offline.cpp
@@ -0,0 +1,428 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+
+#include "fift/Fift.h"
+#include "fift/words.h"
+#include "fift/utils.h"
+
+#include "block/block.h"
+#include "block/block-auto.h"
+
+#include "vm/cells.h"
+#include "vm/boc.h"
+#include "vm/cells/MerkleProof.h"
+
+#include "tonlib/utils.h"
+#include "tonlib/TestGiver.h"
+#include "tonlib/TestWallet.h"
+#include "tonlib/GenericAccount.h"
+#include "tonlib/TonlibClient.h"
+#include "tonlib/Client.h"
+
+#include "auto/tl/ton_api_json.h"
+#include "auto/tl/tonlib_api_json.h"
+
+#include "td/utils/benchmark.h"
+#include "td/utils/filesystem.h"
+#include "td/utils/optional.h"
+#include "td/utils/port/path.h"
+#include "td/utils/PathView.h"
+#include "td/utils/tests.h"
+
+// KeyManager
+#include "tonlib/keys/bip39.h"
+#include "tonlib/keys/DecryptedKey.h"
+#include "tonlib/keys/EncryptedKey.h"
+#include "tonlib/keys/Mnemonic.h"
+#include "tonlib/keys/SimpleEncryption.h"
+
+using namespace tonlib;
+
+std::string current_dir() {
+  return td::PathView(td::realpath(__FILE__).move_as_ok()).parent_dir().str();
+}
+
+std::string load_source(std::string name) {
+  return td::read_file_str(current_dir() + "../../crypto/" + name).move_as_ok();
+}
+
+td::Ref<vm::Cell> get_test_wallet_source() {
+  std::string code = R"ABCD(
+SETCP0 DUP IFNOTRET // return if recv_internal
+DUP 85143 INT EQUAL IFJMP:<{ // "seqno" get-method
+  DROP c4 PUSHCTR CTOS 32 PLDU  // cnt
+}>
+INC 32 THROWIF  // fail unless recv_external
+512 INT LDSLICEX DUP 32 PLDU   // sign cs cnt
+c4 PUSHCTR CTOS 32 LDU 256 LDU ENDS  // sign cs cnt cnt' pubk
+s1 s2 XCPU            // sign cs cnt pubk cnt' cnt
+EQUAL 33 THROWIFNOT   // ( seqno mismatch? )
+s2 PUSH HASHSU        // sign cs cnt pubk hash
+s0 s4 s4 XC2PU        // pubk cs cnt hash sign pubk
+CHKSIGNU              // pubk cs cnt ?
+34 THROWIFNOT         // signature mismatch
+ACCEPT
+SWAP 32 LDU NIP
+DUP SREFS IF:<{
+  // 3 INT 35 LSHIFT# 3 INT RAWRESERVE    // reserve all but 103 Grams from the balance
+  8 LDU LDREF         // pubk cnt mode msg cs
+  s0 s2 XCHG SENDRAWMSG  // pubk cnt cs ; ( message sent )
+}>
+ENDS
+INC NEWC 32 STU 256 STU ENDC c4 POPCTR
+)ABCD";
+  return fift::compile_asm(code).move_as_ok();
+}
+
+TEST(Tonlib, TestWallet) {
+  LOG(ERROR) << td::base64_encode(std_boc_serialize(get_test_wallet_source()).move_as_ok());
+  CHECK(get_test_wallet_source()->get_hash() == TestWallet::get_init_code()->get_hash());
+  auto fift_output = fift::mem_run_fift(load_source("smartcont/new-wallet.fif"), {"aba", "0"}).move_as_ok();
+
+  auto new_wallet_pk = fift_output.source_lookup.read_file("new-wallet.pk").move_as_ok().data;
+  auto new_wallet_query = fift_output.source_lookup.read_file("new-wallet-query.boc").move_as_ok().data;
+  auto new_wallet_addr = fift_output.source_lookup.read_file("new-wallet.addr").move_as_ok().data;
+
+  td::Ed25519::PrivateKey priv_key{td::SecureString{new_wallet_pk}};
+  auto pub_key = priv_key.get_public_key().move_as_ok();
+  auto init_state = TestWallet::get_init_state(pub_key);
+  auto init_message = TestWallet::get_init_message(priv_key);
+  auto address = GenericAccount::get_address(0, init_state);
+
+  CHECK(address.addr.as_slice() == td::Slice(new_wallet_addr).substr(0, 32));
+
+  td::Ref<vm::Cell> res = GenericAccount::create_ext_message(address, init_state, init_message);
+
+  LOG(ERROR) << "-------";
+  vm::load_cell_slice(res).print_rec(std::cerr);
+  LOG(ERROR) << "-------";
+  vm::load_cell_slice(vm::std_boc_deserialize(new_wallet_query).move_as_ok()).print_rec(std::cerr);
+  CHECK(vm::std_boc_deserialize(new_wallet_query).move_as_ok()->get_hash() == res->get_hash());
+}
+
+TEST(Tonlib, TestGiver) {
+  auto address =
+      block::StdAddress::parse("-1:60c04141c6a7b96d68615e7a91d265ad0f3a9a922e9ae9c901d4fa83f5d3c0d0").move_as_ok();
+  LOG(ERROR) << address.bounceable;
+  auto fift_output = fift::mem_run_fift(load_source("smartcont/testgiver.fif"),
+                                        {"aba", address.rserialize(), "0", "6.666", "wallet-query"})
+                         .move_as_ok();
+  LOG(ERROR) << fift_output.output;
+
+  auto wallet_query = fift_output.source_lookup.read_file("wallet-query.boc").move_as_ok().data;
+
+  auto res = GenericAccount::create_ext_message(TestGiver::address(), {},
+                                                TestGiver::make_a_gift_message(0, 1000000000ll * 6666 / 1000, address));
+  vm::CellSlice(vm::NoVm(), res).print_rec(std::cerr);
+  CHECK(vm::std_boc_deserialize(wallet_query).move_as_ok()->get_hash() == res->get_hash());
+}
+TEST(Tonlib, PublicKey) {
+  block::PublicKey::parse("pubjns2gp7DGCnEH7EOWeCnb6Lw1akm538YYaz6sdLVHfRB2").ensure_error();
+  auto key = block::PublicKey::parse("Pubjns2gp7DGCnEH7EOWeCnb6Lw1akm538YYaz6sdLVHfRB2").move_as_ok();
+  CHECK(td::buffer_to_hex(key.key) == "3EE9DC0A7A0B6CA01770CE34698792BD8ECB53A6949BFD6C81B6E3CA475B74D7");
+  CHECK(key.serialize() == "Pubjns2gp7DGCnEH7EOWeCnb6Lw1akm538YYaz6sdLVHfRB2");
+}
+
+TEST(Tonlib, Address) {
+  auto a = block::StdAddress::parse("-1:538fa7cc24ff8eaa101d84a5f1ab7e832fe1d84b309cdfef4ee94373aac80f7d").move_as_ok();
+  auto b = block::StdAddress::parse("Ef9Tj6fMJP+OqhAdhKXxq36DL+HYSzCc3+9O6UNzqsgPfYFX").move_as_ok();
+  auto c = block::StdAddress::parse("Ef9Tj6fMJP-OqhAdhKXxq36DL-HYSzCc3-9O6UNzqsgPfYFX").move_as_ok();
+  CHECK(a == b);
+  CHECK(a == c);
+  CHECK(block::StdAddress::parse("Ef9Tj6fMJp-OqhAdhKXxq36DL-HYSzCc3-9O6UNzqsgPfYFX").is_error());
+  CHECK(block::StdAddress::parse("Ef9Tj6fMJp+OqhAdhKXxq36DL+HYSzCc3+9O6UNzqsgPfYFX").is_error());
+  CHECK(block::StdAddress::parse(a.rserialize()).move_as_ok() == a);
+}
+
+static auto sync_send = [](auto &client, auto query) {
+  using ReturnTypePtr = typename std::decay_t<decltype(*query)>::ReturnType;
+  using ReturnType = typename ReturnTypePtr::element_type;
+  client.send({1, std::move(query)});
+  while (true) {
+    auto response = client.receive(100);
+    if (response.object) {
+      CHECK(response.id == 1);
+      if (response.object->get_id() == tonlib_api::error::ID) {
+        auto error = tonlib_api::move_object_as<tonlib_api::error>(response.object);
+        return td::Result<ReturnTypePtr>(td::Status::Error(error->code_, error->message_));
+      }
+      return td::Result<ReturnTypePtr>(tonlib_api::move_object_as<ReturnType>(response.object));
+    }
+  }
+};
+
+TEST(Tonlib, InitClose) {
+  using tonlib_api::make_object;
+  {
+    Client client;
+    sync_send(client, make_object<tonlib_api::close>()).ensure();
+    sync_send(client, make_object<tonlib_api::init>(make_object<tonlib_api::options>("", "."))).ensure_error();
+  }
+  {
+    Client client;
+    sync_send(client, make_object<tonlib_api::init>(nullptr)).ensure_error();
+    sync_send(client, make_object<tonlib_api::init>(make_object<tonlib_api::options>("fdajkfldsjkafld", ".")))
+        .ensure_error();
+    sync_send(client, make_object<tonlib_api::init>(make_object<tonlib_api::options>("", "fdhskfds"))).ensure_error();
+    sync_send(client, make_object<tonlib_api::init>(make_object<tonlib_api::options>("", "."))).ensure();
+    sync_send(client, make_object<tonlib_api::init>(make_object<tonlib_api::options>("", "."))).ensure_error();
+
+    td::Slice bad_config = R"abc(
+{
+  "@type": "config.global",
+  "liteclients": [ ]
+}
+)abc";
+
+    sync_send(client, make_object<tonlib_api::options_setConfig>(bad_config.str())).ensure_error();
+    sync_send(client, make_object<tonlib_api::testGiver_getAccountState>()).ensure_error();
+    sync_send(client, make_object<tonlib_api::close>()).ensure();
+    sync_send(client, make_object<tonlib_api::close>()).ensure_error();
+    sync_send(client, make_object<tonlib_api::init>(make_object<tonlib_api::options>("", "."))).ensure_error();
+  }
+}
+
+TEST(Tonlib, SimpleEncryption) {
+  std::string secret = "secret";
+  {
+    std::string data = "some private data";
+    std::string wrong_secret = "wrong secret";
+    auto encrypted_data = SimpleEncryption::encrypt_data(data, secret);
+    LOG(ERROR) << encrypted_data.size();
+    auto decrypted_data = SimpleEncryption::decrypt_data(encrypted_data, secret).move_as_ok();
+    CHECK(data == decrypted_data);
+    SimpleEncryption::decrypt_data(encrypted_data, wrong_secret).ensure_error();
+    SimpleEncryption::decrypt_data("", secret).ensure_error();
+    SimpleEncryption::decrypt_data(std::string(32, 'a'), secret).ensure_error();
+    SimpleEncryption::decrypt_data(std::string(33, 'a'), secret).ensure_error();
+    SimpleEncryption::decrypt_data(std::string(64, 'a'), secret).ensure_error();
+    SimpleEncryption::decrypt_data(std::string(128, 'a'), secret).ensure_error();
+  }
+
+  for (size_t i = 0; i < 255; i++) {
+    auto data = td::rand_string('a', 'z', static_cast<int>(i));
+    auto encrypted_data = SimpleEncryption::encrypt_data(data, secret);
+    auto decrypted_data = SimpleEncryption::decrypt_data(encrypted_data, secret).move_as_ok();
+    CHECK(data == decrypted_data);
+  }
+}
+
+class MnemonicBench : public td::Benchmark {
+ public:
+  std::string get_description() const override {
+    return "mnemonic is_password_seed";
+  }
+  void start_up() override {
+    Mnemonic::Options options;
+    options.password = td::SecureString("qwerty");
+    mnemonic_ = Mnemonic::create_new(std::move(options)).move_as_ok();
+  }
+  void run(int n) override {
+    int x = 0;
+    for (int i = 0; i < n; i++) {
+      x += mnemonic_.value().is_password_seed();
+    }
+    td::do_not_optimize_away(x);
+  }
+
+  td::optional<Mnemonic> mnemonic_;
+};
+
+TEST(Tonlib, Mnemonic) {
+  td::bench(MnemonicBench());
+  //for (int i = 0; i < 20; i++) {
+  //td::PerfWarningTimer perf("Mnemonic::create", 0.01);
+  //Mnemonic::Options options;
+  //options.password = td::SecureString("qwerty");
+  //Mnemonic::create_new(std::move(options)).move_as_ok();
+  //}
+  // FIXME
+  //auto tmp = std::vector<td::SecureString>{"hello", "world"};
+  //CHECK(tmp[0].as_slice() == "hello");
+  auto a = Mnemonic::create(td::SecureString(" Hello, . $^\n# World!   "), td::SecureString("cucumber")).move_as_ok();
+  auto get_word_list = [] {
+    std::vector<td::SecureString> words;
+    words.emplace_back("hello");
+    words.emplace_back("world");
+    return words;
+  };
+  auto b = Mnemonic::create(get_word_list(), td::SecureString("cucumber")).move_as_ok();
+  CHECK(a.get_words() == b.get_words());
+  CHECK(a.get_words() == get_word_list());
+
+  Mnemonic::Options options;
+  options.password = td::SecureString("qwerty");
+  auto password = options.password.copy();
+  auto c = Mnemonic::create_new(std::move(options)).move_as_ok();
+  auto d = Mnemonic::create(c.get_words(), std::move(password)).move_as_ok();
+  CHECK(c.to_private_key().as_octet_string() == d.to_private_key().as_octet_string());
+}
+
+TEST(Tonlib, Keys) {
+  auto a = Mnemonic::create(td::SecureString(" Hello, . $^\n# World!   "), td::SecureString("cucumber")).move_as_ok();
+  DecryptedKey decrypted_key(std::move(a));
+  EncryptedKey encrypted_key = decrypted_key.encrypt("qwerty");
+  auto other_decrypted_key = encrypted_key.decrypt("qwerty").move_as_ok();
+  encrypted_key.decrypt("abcde").ensure_error();
+  CHECK(decrypted_key.mnemonic_words == other_decrypted_key.mnemonic_words);
+  CHECK(decrypted_key.private_key.as_octet_string() == other_decrypted_key.private_key.as_octet_string());
+}
+
+TEST(Tonlib, KeysApi) {
+  using tonlib_api::make_object;
+  Client client;
+
+  // init
+  sync_send(client, make_object<tonlib_api::init>(make_object<tonlib_api::options>("", "."))).ensure();
+  auto local_password = td::SecureString("local password");
+  auto mnemonic_password = td::SecureString("mnemonic password");
+  {
+    auto key = sync_send(client, make_object<tonlib_api::createNewKey>(local_password.copy(), td::SecureString{},
+                                                                       td::SecureString{}))
+                   .move_as_ok();
+  }
+
+  //createNewKey local_password:bytes mnemonic_password:bytes = Key;
+  auto key = sync_send(client, make_object<tonlib_api::createNewKey>(local_password.copy(), mnemonic_password.copy(),
+                                                                     td::SecureString{}))
+                 .move_as_ok();
+
+  sync_send(client, make_object<tonlib_api::exportKey>(make_object<tonlib_api::inputKey>(
+                        make_object<tonlib_api::key>(key->public_key_, key->secret_.copy()),
+                        td::SecureString("wrong password"))))
+      .ensure_error();
+
+  //exportKey input_key:inputKey = ExportedKey;
+  auto exported_key =
+      sync_send(client,
+                make_object<tonlib_api::exportKey>(make_object<tonlib_api::inputKey>(
+                    make_object<tonlib_api::key>(key->public_key_, key->secret_.copy()), local_password.copy())))
+          .move_as_ok();
+  LOG(ERROR) << to_string(exported_key);
+  auto copy_word_list = [&] {
+    std::vector<td::SecureString> word_list_copy;
+    for (auto &w : exported_key->word_list_) {
+      word_list_copy.push_back(w.copy());
+    }
+    return word_list_copy;
+  };
+
+  //changeLocalPassword input_key:inputKey new_local_password:bytes = Key;
+  auto new_key =
+      sync_send(client,
+                make_object<tonlib_api::changeLocalPassword>(
+                    make_object<tonlib_api::inputKey>(
+                        make_object<tonlib_api::key>(key->public_key_, key->secret_.copy()), local_password.copy()),
+                    td::SecureString("tmp local password")))
+          .move_as_ok();
+  sync_send(client,
+            make_object<tonlib_api::exportKey>(make_object<tonlib_api::inputKey>(
+                make_object<tonlib_api::key>(key->public_key_, new_key->secret_.copy()), local_password.copy())))
+      .ensure_error();
+
+  auto exported_key2 = sync_send(client, make_object<tonlib_api::exportKey>(make_object<tonlib_api::inputKey>(
+                                             make_object<tonlib_api::key>(key->public_key_, new_key->secret_.copy()),
+                                             td::SecureString("tmp local password"))))
+                           .move_as_ok();
+  CHECK(exported_key2->word_list_ == exported_key->word_list_);
+
+  //importKey local_password:bytes mnemonic_password:bytes exported_key:exportedKey = Key;
+  auto new_local_password = td::SecureString("new_local_password");
+  // import already existed key
+  sync_send(client, make_object<tonlib_api::importKey>(new_local_password.copy(), mnemonic_password.copy(),
+                                                       make_object<tonlib_api::exportedKey>(copy_word_list())))
+      .ensure_error();
+
+  {
+    auto export_password = td::SecureString("export password");
+    auto wrong_export_password = td::SecureString("wrong_export password");
+    auto exported_encrypted_key =
+        sync_send(client, make_object<tonlib_api::exportEncryptedKey>(
+                              make_object<tonlib_api::inputKey>(
+                                  make_object<tonlib_api::key>(key->public_key_, new_key->secret_.copy()),
+                                  td::SecureString("tmp local password")),
+                              export_password.copy()))
+            .move_as_ok();
+
+    sync_send(client, make_object<tonlib_api::deleteKey>(key->public_key_)).move_as_ok();
+
+    sync_send(client, make_object<tonlib_api::importEncryptedKey>(
+                          new_local_password.copy(), wrong_export_password.copy(),
+                          make_object<tonlib_api::exportedEncryptedKey>(exported_encrypted_key->data_.copy())))
+        .ensure_error();
+
+    auto imported_encrypted_key =
+        sync_send(client, make_object<tonlib_api::importEncryptedKey>(
+                              new_local_password.copy(), export_password.copy(),
+                              make_object<tonlib_api::exportedEncryptedKey>(exported_encrypted_key->data_.copy())))
+            .move_as_ok();
+    CHECK(imported_encrypted_key->public_key_ == key->public_key_);
+  }
+
+  //deleteKey public_key:bytes = Ok;
+  sync_send(client, make_object<tonlib_api::deleteKey>(key->public_key_)).move_as_ok();
+
+  auto err1 = sync_send(client, make_object<tonlib_api::importKey>(
+                                    new_local_password.copy(), td::SecureString("wrong password"),
+                                    make_object<tonlib_api::exportedKey>(copy_word_list())))
+                  .move_as_error();
+  auto err2 =
+      sync_send(client, make_object<tonlib_api::importKey>(new_local_password.copy(), td::SecureString(),
+                                                           make_object<tonlib_api::exportedKey>(copy_word_list())))
+          .move_as_error();
+  LOG(INFO) << err1 << " | " << err2;
+  auto imported_key =
+      sync_send(client, make_object<tonlib_api::importKey>(new_local_password.copy(), mnemonic_password.copy(),
+                                                           make_object<tonlib_api::exportedKey>(copy_word_list())))
+          .move_as_ok();
+  CHECK(imported_key->public_key_ == key->public_key_);
+  CHECK(imported_key->secret_ != key->secret_);
+
+  //exportPemKey input_key:inputKey key_password:bytes = ExportedPemKey;
+  auto pem_password = td::SecureString("pem password");
+  auto r_exported_pem_key = sync_send(
+      client,
+      make_object<tonlib_api::exportPemKey>(
+          make_object<tonlib_api::inputKey>(
+              make_object<tonlib_api::key>(key->public_key_, imported_key->secret_.copy()), new_local_password.copy()),
+          pem_password.copy()));
+  if (r_exported_pem_key.is_error() && r_exported_pem_key.error().message() == "Not supported") {
+    return;
+  }
+  auto exported_pem_key = r_exported_pem_key.move_as_ok();
+  LOG(ERROR) << to_string(exported_pem_key);
+
+  //importPemKey exported_key:exportedPemKey key_password:bytes = Key;
+  sync_send(client, make_object<tonlib_api::importPemKey>(
+                        new_local_password.copy(), pem_password.copy(),
+                        make_object<tonlib_api::exportedPemKey>(exported_pem_key->pem_.copy())))
+      .ensure_error();
+  sync_send(client, make_object<tonlib_api::deleteKey>(key->public_key_)).move_as_ok();
+  sync_send(client, make_object<tonlib_api::importPemKey>(
+                        new_local_password.copy(), td::SecureString("wrong pem password"),
+                        make_object<tonlib_api::exportedPemKey>(exported_pem_key->pem_.copy())))
+      .ensure_error();
+
+  auto new_imported_key = sync_send(client, make_object<tonlib_api::importPemKey>(
+                                                new_local_password.copy(), pem_password.copy(),
+                                                make_object<tonlib_api::exportedPemKey>(exported_pem_key->pem_.copy())))
+                              .move_as_ok();
+  CHECK(new_imported_key->public_key_ == key->public_key_);
+  CHECK(new_imported_key->secret_ != key->secret_);
+}
diff --git a/submodules/ton/tonlib-src/tonlib/test/online.cpp b/submodules/ton/tonlib-src/tonlib/test/online.cpp
new file mode 100644
index 0000000000..89a9eaa7d4
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/test/online.cpp
@@ -0,0 +1,336 @@
+/* 
+    This file is part of TON Blockchain source code.
+
+    TON Blockchain is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    TON Blockchain is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with TON Blockchain.  If not, see <http://www.gnu.org/licenses/>.
+
+    In addition, as a special exception, the copyright holders give permission 
+    to link the code of portions of this program with the OpenSSL library. 
+    You must obey the GNU General Public License in all respects for all 
+    of the code used other than OpenSSL. If you modify file(s) with this 
+    exception, you may extend this exception to your version of the file(s), 
+    but you are not obligated to do so. If you do not wish to do so, delete this 
+    exception statement from your version. If you delete this exception statement 
+    from all source files in the program, then also delete it here.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "adnl/adnl-ext-client.h"
+#include "tl-utils/tl-utils.hpp"
+#include "auto/tl/ton_api_json.h"
+#include "auto/tl/tonlib_api_json.h"
+#include "tl/tl_json.h"
+#include "ton/ton-types.h"
+#include "ton/ton-tl.hpp"
+#include "block/block.h"
+#include "block/block-auto.h"
+
+#include "tonlib/GenericAccount.h"
+#include "tonlib/TestGiver.h"
+#include "tonlib/TestWallet.h"
+#include "tonlib/LastBlock.h"
+#include "tonlib/ExtClient.h"
+#include "tonlib/utils.h"
+
+#include "tonlib/TonlibCallback.h"
+#include "tonlib/Client.h"
+
+#include "vm/cells.h"
+#include "vm/boc.h"
+#include "vm/cells/MerkleProof.h"
+
+#include "td/utils/Container.h"
+#include "td/utils/OptionsParser.h"
+#include "td/utils/Random.h"
+#include "td/utils/filesystem.h"
+#include "td/utils/tests.h"
+#include "td/utils/optional.h"
+#include "td/utils/overloaded.h"
+#include "td/utils/MpscPollableQueue.h"
+
+#include "td/utils/port/signals.h"
+
+using namespace tonlib;
+
+auto sync_send = [](auto& client, auto query) {
+  using ReturnTypePtr = typename std::decay_t<decltype(*query)>::ReturnType;
+  using ReturnType = typename ReturnTypePtr::element_type;
+  client.send({1, std::move(query)});
+  while (true) {
+    auto response = client.receive(100);
+    if (response.object) {
+      CHECK(response.id == 1);
+      if (response.object->get_id() == tonlib_api::error::ID) {
+        auto error = tonlib_api::move_object_as<tonlib_api::error>(response.object);
+        return td::Result<ReturnTypePtr>(td::Status::Error(error->code_, error->message_));
+      }
+      return td::Result<ReturnTypePtr>(tonlib_api::move_object_as<ReturnType>(response.object));
+    }
+  }
+};
+
+struct Key {
+  std::string public_key;
+  td::SecureString secret;
+  tonlib_api::object_ptr<tonlib_api::inputKey> get_input_key() const {
+    return tonlib_api::make_object<tonlib_api::inputKey>(
+        tonlib_api::make_object<tonlib_api::key>(public_key, secret.copy()), td::SecureString("local"));
+  }
+};
+struct Wallet {
+  std::string address;
+  Key key;
+};
+
+std::string test_giver_address(Client& client) {
+  using tonlib_api::make_object;
+  return sync_send(client, make_object<tonlib_api::testGiver_getAccountAddress>()).move_as_ok()->account_address_;
+}
+
+td::int64 get_balance(Client& client, std::string address) {
+  auto generic_state = sync_send(client, tonlib_api::make_object<tonlib_api::generic_getAccountState>(
+                                             tonlib_api::make_object<tonlib_api::accountAddress>(address)))
+                           .move_as_ok();
+  td::int64 res = 0;
+  tonlib_api::downcast_call(*generic_state, [&](auto& state) { res = state.account_state_->balance_; });
+  return res;
+}
+
+bool is_inited(Client& client, std::string address) {
+  auto generic_state = sync_send(client, tonlib_api::make_object<tonlib_api::generic_getAccountState>(
+                                             tonlib_api::make_object<tonlib_api::accountAddress>(address)))
+                           .move_as_ok();
+  return generic_state->get_id() != tonlib_api::generic_accountStateUninited::ID;
+}
+
+void transfer_grams(Client& client, std::string from, std::string to, td::int64 amount,
+                    tonlib_api::object_ptr<tonlib_api::inputKey> input_key) {
+  auto balance = get_balance(client, to);
+  sync_send(client, tonlib_api::make_object<tonlib_api::generic_sendGrams>(
+                        std::move(input_key), tonlib_api::make_object<tonlib_api::accountAddress>(from),
+                        tonlib_api::make_object<tonlib_api::accountAddress>(to), amount))
+      .ensure();
+  while (balance == get_balance(client, to)) {
+    client.receive(1);
+  }
+}
+Wallet create_empty_wallet(Client& client) {
+  using tonlib_api::make_object;
+  auto key = sync_send(client, make_object<tonlib_api::createNewKey>(td::SecureString("local"),
+                                                                     td::SecureString("mnemonic"), td::SecureString()))
+                 .move_as_ok();
+  Wallet wallet{"", {key->public_key_, std::move(key->secret_)}};
+
+  auto account_address =
+      sync_send(client, make_object<tonlib_api::testWallet_getAccountAddress>(
+                            make_object<tonlib_api::testWallet_initialAccountState>(wallet.key.public_key)))
+          .move_as_ok();
+
+  wallet.address = account_address->account_address_;
+  return wallet;
+}
+
+Wallet create_wallet(Client& client) {
+  using tonlib_api::make_object;
+  auto wallet = create_empty_wallet(client);
+
+  transfer_grams(client, test_giver_address(client), wallet.address, 6000000000, {});
+  sync_send(client, make_object<tonlib_api::testWallet_init>(wallet.key.get_input_key())).ensure();
+  while (!is_inited(client, wallet.address)) {
+    client.receive(1);
+  }
+  LOG(ERROR) << get_balance(client, wallet.address);
+  return wallet;
+}
+
+std::string get_test_giver_address(Client& client) {
+  return sync_send(client, tonlib_api::make_object<tonlib_api::testGiver_getAccountAddress>())
+      .move_as_ok()
+      ->account_address_;
+}
+
+void dump_transaction_history(Client& client, std::string address) {
+  using tonlib_api::make_object;
+  auto state = sync_send(client, make_object<tonlib_api::testGiver_getAccountState>()).move_as_ok();
+  auto tid = std::move(state->last_transaction_id_);
+  int cnt = 0;
+  while (tid->lt_ != 0) {
+    auto lt = tid->lt_;
+    auto got_transactions = sync_send(client, make_object<tonlib_api::raw_getTransactions>(
+                                                  make_object<tonlib_api::accountAddress>(address), std::move(tid)))
+                                .move_as_ok();
+    CHECK(got_transactions->transactions_.size() > 0);
+    CHECK(got_transactions->transactions_[0]->previous_transaction_id_->lt_ < lt);
+    for (auto& txn : got_transactions->transactions_) {
+      LOG(ERROR) << to_string(txn);
+      cnt++;
+    }
+    tid = std::move(got_transactions->transactions_.back()->previous_transaction_id_);
+  }
+  LOG(ERROR) << cnt;
+}
+
+int main(int argc, char* argv[]) {
+  td::set_default_failure_signal_handler();
+  using tonlib_api::make_object;
+
+  td::OptionsParser p;
+  std::string global_config_str;
+  p.add_option('C', "global-config", "file to read global config", [&](td::Slice fname) {
+    TRY_RESULT(str, td::read_file_str(fname.str()));
+    global_config_str = std::move(str);
+    LOG(ERROR) << global_config_str;
+    return td::Status::OK();
+  });
+  p.run(argc, argv).ensure();
+
+  Client client;
+  {
+    sync_send(client, make_object<tonlib_api::init>(make_object<tonlib_api::options>(global_config_str, "."))).ensure();
+  }
+  //dump_transaction_history(client, get_test_giver_address(client));
+  auto wallet_a = create_wallet(client);
+  auto wallet_b = create_empty_wallet(client);
+  transfer_grams(client, wallet_a.address, wallet_b.address, 3000000000, wallet_a.key.get_input_key());
+  auto a = get_balance(client, wallet_a.address);
+  auto b = get_balance(client, wallet_b.address);
+  LOG(ERROR) << a << " " << b;
+  return 0;
+  {
+    // init
+    sync_send(client, make_object<tonlib_api::init>(make_object<tonlib_api::options>(global_config_str, "."))).ensure();
+
+    auto key = sync_send(client, make_object<tonlib_api::createNewKey>(
+                                     td::SecureString("local"), td::SecureString("mnemonic"), td::SecureString()))
+                   .move_as_ok();
+
+    auto create_input_key = [&] {
+      return make_object<tonlib_api::inputKey>(make_object<tonlib_api::key>(key->public_key_, key->secret_.copy()),
+                                               td::SecureString("local"));
+    };
+
+    auto public_key_raw = key->public_key_;
+    td::Ed25519::PublicKey public_key_std(td::SecureString{public_key_raw});
+
+    sync_send(client, make_object<tonlib_api::options_setConfig>(global_config_str)).ensure();
+
+    auto wallet_addr = GenericAccount::get_address(0, TestWallet::get_init_state(public_key_std));
+    {
+      auto account_address =
+          sync_send(client, make_object<tonlib_api::testWallet_getAccountAddress>(
+                                make_object<tonlib_api::testWallet_initialAccountState>(public_key_raw)))
+              .move_as_ok();
+      ASSERT_EQ(wallet_addr.rserialize(), account_address->account_address_);
+    }
+
+    std::string test_giver_address;
+    {
+      auto account_address = sync_send(client, make_object<tonlib_api::testGiver_getAccountAddress>()).move_as_ok();
+      test_giver_address = account_address->account_address_;
+      ASSERT_EQ(TestGiver::address().rserialize(), test_giver_address);
+    }
+
+    {
+      auto account_address =
+          sync_send(
+              client,
+              make_object<tonlib_api::raw_getAccountAddress>(make_object<tonlib_api::raw_initialAccountState>(
+                  vm::std_boc_serialize(TestWallet::get_init_code()).move_as_ok().as_slice().str(),
+                  vm::std_boc_serialize(TestWallet::get_init_data(public_key_std)).move_as_ok().as_slice().str())))
+              .move_as_ok();
+      ASSERT_EQ(wallet_addr.rserialize(), account_address->account_address_);
+    }
+
+    {
+      auto state = sync_send(client, make_object<tonlib_api::raw_getAccountState>(
+                                         make_object<tonlib_api::accountAddress>(wallet_addr.rserialize())))
+                       .move_as_ok();
+      LOG(ERROR) << to_string(state);
+    }
+
+    td::int32 seqno = 0;
+    {
+      auto state = sync_send(client, make_object<tonlib_api::testGiver_getAccountState>()).move_as_ok();
+      LOG(ERROR) << to_string(state);
+      seqno = state->seqno_;
+    }
+
+    {
+      sync_send(client, make_object<tonlib_api::testGiver_sendGrams>(
+                            make_object<tonlib_api::accountAddress>(wallet_addr.rserialize()), seqno,
+                            1000000000ll * 6666 / 1000))
+          .ensure();
+    }
+
+    while (true) {
+      auto state = sync_send(client, make_object<tonlib_api::testGiver_getAccountState>()).move_as_ok();
+      if (state->seqno_ > seqno) {
+        break;
+      }
+      client.receive(1);
+    }
+
+    while (true) {
+      auto state = sync_send(client, make_object<tonlib_api::raw_getAccountState>(
+                                         make_object<tonlib_api::accountAddress>(wallet_addr.rserialize())))
+                       .move_as_ok();
+      td::int64 grams_count = state->balance_;
+      if (grams_count > 0) {
+        LOG(ERROR) << "GOT " << grams_count;
+        break;
+      }
+      client.receive(1);
+    }
+
+    { sync_send(client, make_object<tonlib_api::testWallet_init>(create_input_key())).ensure(); }
+
+    while (true) {
+      auto r_state = sync_send(client, make_object<tonlib_api::testWallet_getAccountState>(
+                                           make_object<tonlib_api::accountAddress>(wallet_addr.rserialize())));
+      if (r_state.is_ok()) {
+        LOG(ERROR) << to_string(r_state.ok());
+        break;
+      }
+      client.receive(1);
+    }
+
+    {
+      sync_send(client, make_object<tonlib_api::generic_sendGrams>(
+                            create_input_key(), make_object<tonlib_api::accountAddress>(wallet_addr.rserialize()),
+                            make_object<tonlib_api::accountAddress>(test_giver_address), 1000000000ll * 3333 / 1000))
+          .ensure();
+    }
+    while (true) {
+      auto generic_state = sync_send(client, make_object<tonlib_api::generic_getAccountState>(
+                                                 make_object<tonlib_api::accountAddress>(wallet_addr.rserialize())))
+                               .move_as_ok();
+      if (generic_state->get_id() == tonlib_api::generic_accountStateTestWallet::ID) {
+        auto state = tonlib_api::move_object_as<tonlib_api::generic_accountStateTestWallet>(generic_state);
+        if (state->account_state_->balance_ < 5617007000) {
+          LOG(ERROR) << to_string(state);
+          break;
+        }
+      }
+      client.receive(1);
+    }
+    {
+      auto generic_state = sync_send(client, make_object<tonlib_api::generic_getAccountState>(
+                                                 make_object<tonlib_api::accountAddress>(test_giver_address)))
+                               .move_as_ok();
+      CHECK(generic_state->get_id() == tonlib_api::generic_accountStateTestGiver::ID);
+      LOG(ERROR) << to_string(generic_state);
+    }
+  }
+
+  return 0;
+}
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/.TestGiver.cpp.swp b/submodules/ton/tonlib-src/tonlib/tonlib/.TestGiver.cpp.swp
new file mode 100644
index 0000000000..67505dfe77
Binary files /dev/null and b/submodules/ton/tonlib-src/tonlib/tonlib/.TestGiver.cpp.swp differ
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/Client.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/Client.cpp
new file mode 100644
index 0000000000..c42b19655a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/Client.cpp
@@ -0,0 +1,158 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "Client.h"
+
+#include "tonlib/TonlibClient.h"
+#include "tonlib/TonlibCallback.h"
+
+#include "td/actor/actor.h"
+#include "td/utils/MpscPollableQueue.h"
+
+int VERBOSITY_NAME(tonlib_requests) = VERBOSITY_NAME(DEBUG);
+
+namespace tonlib {
+class Client::Impl final {
+ public:
+  using OutputQueue = td::MpscPollableQueue<Client::Response>;
+  Impl() {
+    output_queue_ = std::make_shared<OutputQueue>();
+    output_queue_->init();
+
+    class Callback : public TonlibCallback {
+     public:
+      explicit Callback(std::shared_ptr<OutputQueue> output_queue) : output_queue_(std::move(output_queue)) {
+      }
+      void on_result(std::uint64_t id, tonlib_api::object_ptr<tonlib_api::Object> result) override {
+        output_queue_->writer_put({id, std::move(result)});
+      }
+      void on_error(std::uint64_t id, tonlib_api::object_ptr<tonlib_api::error> error) override {
+        output_queue_->writer_put({id, std::move(error)});
+      }
+      Callback(const Callback&) = delete;
+      Callback& operator=(const Callback&) = delete;
+      Callback(Callback&&) = delete;
+      Callback& operator=(Callback&&) = delete;
+      ~Callback() override {
+        output_queue_->writer_put({0, nullptr});
+      }
+
+     private:
+      std::shared_ptr<OutputQueue> output_queue_;
+    };
+
+    scheduler_.run_in_context(
+        [&] { tonlib_ = td::actor::create_actor<TonlibClient>("Tonlib", td::make_unique<Callback>(output_queue_)); });
+
+    scheduler_thread_ = td::thread([&] { scheduler_.run(); });
+  }
+
+  void send(Client::Request request) {
+    if (request.id == 0 || request.function == nullptr) {
+      LOG(ERROR) << "Drop wrong request " << request.id;
+      return;
+    }
+
+    scheduler_.run_in_context_external(
+        [&] { send_closure(tonlib_, &TonlibClient::request, request.id, std::move(request.function)); });
+  }
+
+  Client::Response receive(double timeout) {
+    VLOG(tonlib_requests) << "Begin to wait for updates with timeout " << timeout;
+    auto is_locked = receive_lock_.exchange(true);
+    CHECK(!is_locked);
+    auto response = receive_unlocked(timeout);
+    is_locked = receive_lock_.exchange(false);
+    CHECK(is_locked);
+    VLOG(tonlib_requests) << "End to wait for updates, returning object " << response.id << ' '
+                          << response.object.get();
+    return response;
+  }
+
+  Impl(const Impl&) = delete;
+  Impl& operator=(const Impl&) = delete;
+  Impl(Impl&&) = delete;
+  Impl& operator=(Impl&&) = delete;
+  ~Impl() {
+    LOG(ERROR) << "~Impl";
+    scheduler_.run_in_context_external([&] { tonlib_.reset(); });
+    LOG(ERROR) << "Wait till closed";
+    while (!is_closed_) {
+      receive(10);
+    }
+    LOG(ERROR) << "Stop";
+    scheduler_.run_in_context_external([] { td::actor::SchedulerContext::get()->stop(); });
+    LOG(ERROR) << "join";
+    scheduler_thread_.join();
+  }
+
+ private:
+  std::shared_ptr<OutputQueue> output_queue_;
+  int output_queue_ready_cnt_{0};
+  std::atomic<bool> receive_lock_{false};
+  bool is_closed_{false};
+
+  td::actor::Scheduler scheduler_{{0}};
+  td::thread scheduler_thread_;
+  td::actor::ActorOwn<TonlibClient> tonlib_;
+
+  Client::Response receive_unlocked(double timeout) {
+    if (output_queue_ready_cnt_ == 0) {
+      output_queue_ready_cnt_ = output_queue_->reader_wait_nonblock();
+    }
+    if (output_queue_ready_cnt_ > 0) {
+      output_queue_ready_cnt_--;
+      auto res = output_queue_->reader_get_unsafe();
+      if (res.object == nullptr && res.id == 0) {
+        is_closed_ = true;
+      }
+      return res;
+    }
+    if (timeout != 0) {
+      output_queue_->reader_get_event_fd().wait(static_cast<int>(timeout * 1000));
+      return receive_unlocked(0);
+    }
+    return {0, nullptr};
+  }
+};
+
+Client::Client() : impl_(std::make_unique<Impl>()) {
+  // At least it should be enough for everybody who uses TDLib
+  // FIXME
+  //td::init_openssl_threads();
+}
+
+void Client::send(Request&& request) {
+  impl_->send(std::move(request));
+}
+
+Client::Response Client::receive(double timeout) {
+  return impl_->receive(timeout);
+}
+
+Client::Response Client::execute(Request&& request) {
+  Response response;
+  response.id = request.id;
+  response.object = TonlibClient::static_request(std::move(request.function));
+  return response;
+}
+
+Client::~Client() = default;
+Client::Client(Client&& other) = default;
+Client& Client::operator=(Client&& other) = default;
+}  // namespace tonlib
diff --git a/submodules/MtProtoKit/TON/iOS/include/tonlib/Client.h b/submodules/ton/tonlib-src/tonlib/tonlib/Client.h
similarity index 100%
rename from submodules/MtProtoKit/TON/iOS/include/tonlib/Client.h
rename to submodules/ton/tonlib-src/tonlib/tonlib/Client.h
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/ClientActor.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/ClientActor.cpp
new file mode 100644
index 0000000000..d93ab1b9a3
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/ClientActor.cpp
@@ -0,0 +1,18 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/ClientActor.h b/submodules/ton/tonlib-src/tonlib/tonlib/ClientActor.h
new file mode 100644
index 0000000000..b763715006
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/ClientActor.h
@@ -0,0 +1,41 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "tonlib/TonlibCallback.h"
+#include "tonlib/TonlibClient.h"
+#include "auto/tl/tonlib_api.h"
+
+namespace tonlinb {
+class ClientActor : public td::actor::Actor {
+ public:
+  explicit ClientActor(td::unique_ptr<TonlibCallback> callback);
+  void request(td::uint64 id, tonlib_api::object_ptr<tonlib_api::Function> request);
+  static tonlib_api::object_ptr<tonlib_api::Object> execute(tonlib_api::object_ptr<tonlib_api::Function> request);
+  ~ClientActor();
+  ClientActor(ClientActor&& other);
+  ClientActor& operator=(ClientActor&& other);
+
+  ClientActor(const ClientActor& other) = delete;
+  ClientActor& operator=(const ClientActor& other) = delete;
+
+ private:
+  td::actor::ActorOwn<TonlibClient> tonlib_;
+};
+}  // namespace tonlinb
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/ClientJson.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/ClientJson.cpp
new file mode 100644
index 0000000000..b1113441d0
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/ClientJson.cpp
@@ -0,0 +1,119 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tonlib/ClientJson.h"
+
+#include "auto/tl/tonlib_api_json.h"
+
+#include "tl/tl_json.h"
+
+#include "td/utils/common.h"
+#include "td/utils/format.h"
+#include "td/utils/JsonBuilder.h"
+#include "td/utils/logging.h"
+#include "td/utils/port/thread_local.h"
+#include "td/utils/Status.h"
+
+#include <utility>
+
+namespace tonlib {
+
+static td::Result<std::pair<tonlib_api::object_ptr<tonlib_api::Function>, std::string>> to_request(td::Slice request) {
+  auto request_str = request.str();
+  TRY_RESULT(json_value, td::json_decode(request_str));
+  if (json_value.type() != td::JsonValue::Type::Object) {
+    return td::Status::Error("Expected an Object");
+  }
+
+  std::string extra;
+  if (has_json_object_field(json_value.get_object(), "@extra")) {
+    extra = td::json_encode<std::string>(
+        get_json_object_field(json_value.get_object(), "@extra", td::JsonValue::Type::Null).move_as_ok());
+  }
+
+  tonlib_api::object_ptr<tonlib_api::Function> func;
+  TRY_STATUS(from_json(func, json_value));
+  return std::make_pair(std::move(func), extra);
+}
+
+static std::string from_response(const tonlib_api::Object &object, const td::string &extra) {
+  auto str = td::json_encode<td::string>(td::ToJson(object));
+  CHECK(!str.empty() && str.back() == '}');
+  if (!extra.empty()) {
+    str.pop_back();
+    str.reserve(str.size() + 11 + extra.size());
+    str += ",\"@extra\":";
+    str += extra;
+    str += '}';
+  }
+  return str;
+}
+
+static TD_THREAD_LOCAL std::string *current_output;
+
+static td::CSlice store_string(std::string str) {
+  td::init_thread_local<std::string>(current_output);
+  *current_output = std::move(str);
+  return *current_output;
+}
+
+void ClientJson::send(td::Slice request) {
+  auto r_request = to_request(request);
+  if (r_request.is_error()) {
+    LOG(ERROR) << "Failed to parse " << tag("request", td::format::escaped(request)) << " " << r_request.error();
+    return;
+  }
+
+  std::uint64_t extra_id = extra_id_.fetch_add(1, std::memory_order_relaxed);
+  if (!r_request.ok_ref().second.empty()) {
+    std::lock_guard<std::mutex> guard(mutex_);
+    extra_[extra_id] = std::move(r_request.ok_ref().second);
+  }
+  client_.send(Client::Request{extra_id, std::move(r_request.ok_ref().first)});
+}
+
+td::CSlice ClientJson::receive(double timeout) {
+  auto response = client_.receive(timeout);
+  if (!response.object) {
+    return {};
+  }
+
+  std::string extra;
+  if (response.id != 0) {
+    std::lock_guard<std::mutex> guard(mutex_);
+    auto it = extra_.find(response.id);
+    if (it != extra_.end()) {
+      extra = std::move(it->second);
+      extra_.erase(it);
+    }
+  }
+  return store_string(from_response(*response.object, extra));
+}
+
+td::CSlice ClientJson::execute(td::Slice request) {
+  auto r_request = to_request(request);
+  if (r_request.is_error()) {
+    LOG(ERROR) << "Failed to parse " << tag("request", td::format::escaped(request)) << " " << r_request.error();
+    return {};
+  }
+
+  return store_string(from_response(*Client::execute(Client::Request{0, std::move(r_request.ok_ref().first)}).object,
+                                    r_request.ok().second));
+}
+
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/ClientJson.h b/submodules/ton/tonlib-src/tonlib/tonlib/ClientJson.h
new file mode 100644
index 0000000000..f08bb7c48c
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/ClientJson.h
@@ -0,0 +1,48 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "tonlib/Client.h"
+
+#include "td/utils/Slice.h"
+
+#include <atomic>
+#include <cstdint>
+#include <mutex>
+#include <string>
+#include <unordered_map>
+
+namespace tonlib {
+
+class ClientJson final {
+ public:
+  void send(td::Slice request);
+
+  td::CSlice receive(double timeout);
+
+  static td::CSlice execute(td::Slice request);
+
+ private:
+  Client client_;
+  std::mutex mutex_;  // for extra_
+  std::unordered_map<std::int64_t, std::string> extra_;
+  std::atomic<std::uint64_t> extra_id_{1};
+};
+
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/Config.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/Config.cpp
new file mode 100644
index 0000000000..6ffdb1d6fc
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/Config.cpp
@@ -0,0 +1,119 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "Config.h"
+#include "adnl/adnl-node-id.hpp"
+#include "td/utils/JsonBuilder.h"
+
+namespace tonlib {
+td::Result<Config> Config::parse(std::string str) {
+  TRY_RESULT(json, td::json_decode(str));
+  if (json.type() != td::JsonValue::Type::Object) {
+    return td::Status::Error("Invalid config (1)");
+  }
+  //TRY_RESULT(main_type, td::get_json_object_string_field(json.get_object(), "@type", false));
+  //if (main_type != "config.global") {
+  //return td::Status::Error("Invalid config (3)");
+  //}
+  TRY_RESULT(lite_clients_obj,
+             td::get_json_object_field(json.get_object(), "liteservers", td::JsonValue::Type::Array, false));
+  auto &lite_clients = lite_clients_obj.get_array();
+
+  Config res;
+  for (auto &value : lite_clients) {
+    if (value.type() != td::JsonValue::Type::Object) {
+      return td::Status::Error("Invalid config (2)");
+    }
+    auto &object = value.get_object();
+    //TRY_RESULT(value_type, td::get_json_object_string_field(object, "@type", false));
+    //if (value_type != "liteclient.config.global") {
+    //return td::Status::Error("Invalid config (4)");
+    //}
+
+    TRY_RESULT(ip, td::get_json_object_int_field(object, "ip", false));
+    TRY_RESULT(port, td::get_json_object_int_field(object, "port", false));
+    Config::LiteClient client;
+    TRY_STATUS(client.address.init_host_port(td::IPAddress::ipv4_to_str(ip), port));
+
+    TRY_RESULT(id_obj, td::get_json_object_field(object, "id", td::JsonValue::Type::Object, false));
+    auto &id = id_obj.get_object();
+    TRY_RESULT(id_type, td::get_json_object_string_field(id, "@type", false));
+    if (id_type != "pub.ed25519") {
+      return td::Status::Error("Invalid config (5)");
+    }
+    TRY_RESULT(key_base64, td::get_json_object_string_field(id, "key", false));
+    TRY_RESULT(key, td::base64_decode(key_base64));
+    if (key.size() != 32) {
+      return td::Status::Error("Invalid config (6)");
+    }
+
+    client.adnl_id = ton::adnl::AdnlNodeIdFull(ton::pubkeys::Ed25519(td::Bits256(td::Slice(key).ubegin())));
+    res.lite_clients.push_back(std::move(client));
+  }
+
+  TRY_RESULT(validator_obj,
+             td::get_json_object_field(json.get_object(), "validator", td::JsonValue::Type::Object, false));
+  auto &validator = validator_obj.get_object();
+  TRY_RESULT(validator_type, td::get_json_object_string_field(validator, "@type", false));
+  if (validator_type != "validator.config.global") {
+    return td::Status::Error("Invalid config (7)");
+  }
+  TRY_RESULT(zero_state_obj, td::get_json_object_field(validator, "zero_state", td::JsonValue::Type::Object, false));
+  auto &zero_state = zero_state_obj.get_object();
+
+  ton::WorkchainId zero_workchain_id;
+  {
+    TRY_RESULT(wc, td::get_json_object_int_field(zero_state, "workchain"));
+    zero_workchain_id = wc;
+  }
+  ton::ShardId zero_shard_id;  // uint64
+  {
+    TRY_RESULT(shard_id, td::get_json_object_long_field(zero_state, "shard"));
+    zero_shard_id = static_cast<ton::ShardId>(shard_id);
+  }
+  ton::BlockSeqno zero_seqno;
+  {
+    TRY_RESULT(seqno, td::get_json_object_int_field(zero_state, "seqno"));
+    zero_seqno = seqno;
+  }
+
+  ton::RootHash zero_root_hash;
+  {
+    TRY_RESULT(hash_b64, td::get_json_object_string_field(zero_state, "root_hash"));
+    TRY_RESULT(hash, td::base64_decode(hash_b64));
+    if (hash.size() * 8 != ton::RootHash::size()) {
+      return td::Status::Error("Invalid config (8)");
+    }
+    zero_root_hash = ton::RootHash(td::ConstBitPtr(td::Slice(hash).ubegin()));
+  }
+  ton::FileHash zero_file_hash;
+  {
+    TRY_RESULT(hash_b64, td::get_json_object_string_field(zero_state, "file_hash"));
+    TRY_RESULT(hash, td::base64_decode(hash_b64));
+    if (hash.size() * 8 != ton::FileHash::size()) {
+      return td::Status::Error("Invalid config (9)");
+    }
+    zero_file_hash = ton::RootHash(td::ConstBitPtr(td::Slice(hash).ubegin()));
+  }
+
+  res.zero_state_id = ton::BlockIdExt(zero_workchain_id, zero_shard_id, zero_seqno, std::move(zero_root_hash),
+                                      std::move(zero_file_hash));
+
+  return res;
+}
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/Config.h b/submodules/ton/tonlib-src/tonlib/tonlib/Config.h
new file mode 100644
index 0000000000..30f7f3513e
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/Config.h
@@ -0,0 +1,34 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "adnl/adnl-node-id.hpp"
+#include "td/utils/port/IPAddress.h"
+#include "ton/ton-types.h"
+
+namespace tonlib {
+struct Config {
+  struct LiteClient {
+    ton::adnl::AdnlNodeIdFull adnl_id;
+    td::IPAddress address;
+  };
+  ton::BlockIdExt zero_state_id;
+  std::vector<LiteClient> lite_clients;
+  static td::Result<Config> parse(std::string str);
+};
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/ExtClient.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/ExtClient.cpp
new file mode 100644
index 0000000000..56ba74772a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/ExtClient.cpp
@@ -0,0 +1,52 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tonlib/ExtClient.h"
+
+#include "tonlib/LastBlock.h"
+
+namespace tonlib {
+void ExtClient::with_last_block(td::Promise<ton::BlockIdExt> promise) {
+  auto query_id = last_block_queries_.create(std::move(promise));
+  td::Promise<ton::BlockIdExt> P = [query_id, self = this,
+                                    actor_id = td::actor::actor_id()](td::Result<ton::BlockIdExt> result) {
+    send_lambda(actor_id, [self, query_id, result = std::move(result)]() mutable {
+      self->last_block_queries_.extract(query_id).set_result(std::move(result));
+    });
+  };
+  if (client_.last_block_actor_.empty()) {
+    return P.set_error(td::Status::Error(500, "No lite clients"));
+  }
+  td::actor::send_closure(client_.last_block_actor_, &LastBlock::get_last_block, std::move(P));
+}
+
+void ExtClient::send_raw_query(td::BufferSlice query, td::Promise<td::BufferSlice> promise) {
+  auto query_id = queries_.create(std::move(promise));
+  td::Promise<td::BufferSlice> P = [query_id, self = this,
+                                    actor_id = td::actor::actor_id()](td::Result<td::BufferSlice> result) {
+    send_lambda(actor_id, [self, query_id, result = std::move(result)]() mutable {
+      self->queries_.extract(query_id).set_result(std::move(result));
+    });
+  };
+  if (client_.andl_ext_client_.empty()) {
+    return P.set_error(td::Status::Error(500, "No lite clients"));
+  }
+  td::actor::send_closure(client_.andl_ext_client_, &ton::adnl::AdnlExtClient::send_query, "query", std::move(query),
+                          td::Timestamp::in(10.0), std::move(P));
+}
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/ExtClient.h b/submodules/ton/tonlib-src/tonlib/tonlib/ExtClient.h
new file mode 100644
index 0000000000..e3fe8412d2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/ExtClient.h
@@ -0,0 +1,82 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "adnl/adnl-ext-client.h"
+#include "tl-utils/lite-utils.hpp"
+
+#include "auto/tl/lite_api.h"
+
+#include "ton/ton-types.h"
+
+#include "td/actor/actor.h"
+#include "td/utils/Container.h"
+
+namespace tonlib {
+class LastBlock;
+struct ExtClientRef {
+  td::actor::ActorId<ton::adnl::AdnlExtClient> andl_ext_client_;
+  td::actor::ActorId<LastBlock> last_block_actor_;
+};
+
+class ExtClient {
+ public:
+  ExtClient() = default;
+  ExtClient(const ExtClient&) = delete;
+  ExtClient(ExtClient&&) = delete;
+  ExtClient& operator=(const ExtClient&) = delete;
+  ExtClient& operator=(ExtClient&&) = delete;
+
+  void set_client(ExtClientRef client) {
+    client_ = client;
+  }
+  ExtClientRef get_client() {
+    return client_;
+  }
+
+  void with_last_block(td::Promise<ton::BlockIdExt> promise);
+
+  template <class QueryT>
+  void send_query(QueryT query, td::Promise<typename QueryT::ReturnType> promise) {
+    auto raw_query = ton::serialize_tl_object(&query, true);
+    LOG(ERROR) << "send query to liteserver: " << to_string(query);
+    td::BufferSlice liteserver_query =
+        ton::serialize_tl_object(ton::create_tl_object<ton::lite_api::liteServer_query>(std::move(raw_query)), true);
+
+    send_raw_query(std::move(liteserver_query), [promise = std::move(promise)](td::Result<td::BufferSlice> R) mutable {
+      promise.set_result([&]() -> td::Result<typename QueryT::ReturnType> {
+        TRY_RESULT(data, std::move(R));
+        auto r_error = ton::fetch_tl_object<ton::lite_api::liteServer_error>(data.clone(), true);
+        if (r_error.is_ok()) {
+          auto f = r_error.move_as_ok();
+          return td::Status::Error(f->code_, f->message_);
+        }
+        auto res = ton::fetch_result<QueryT>(std::move(data));
+        return std::move(res);
+      }());
+    });
+  }
+
+ private:
+  ExtClientRef client_;
+  td::Container<td::Promise<td::BufferSlice>> queries_;
+  td::Container<td::Promise<ton::BlockIdExt>> last_block_queries_;
+
+  void send_raw_query(td::BufferSlice query, td::Promise<td::BufferSlice> promise);
+};
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/ExtClientLazy.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/ExtClientLazy.cpp
new file mode 100644
index 0000000000..d5adb770e1
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/ExtClientLazy.cpp
@@ -0,0 +1,100 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "ExtClientLazy.h"
+namespace tonlib {
+
+class ExtClientLazyImp : public ton::adnl::AdnlExtClient {
+ public:
+  ExtClientLazyImp(ton::adnl::AdnlNodeIdFull dst, td::IPAddress dst_addr,
+                   td::unique_ptr<ExtClientLazy::Callback> callback)
+      : dst_(std::move(dst)), dst_addr_(std::move(dst_addr)), callback_(std::move(callback)) {
+  }
+
+  void check_ready(td::Promise<td::Unit> promise) override {
+    before_query();
+    send_closure(client_, &ton::adnl::AdnlExtClient::check_ready, std::move(promise));
+  }
+
+  void send_query(std::string name, td::BufferSlice data, td::Timestamp timeout,
+                  td::Promise<td::BufferSlice> promise) override {
+    before_query();
+    send_closure(client_, &ton::adnl::AdnlExtClient::send_query, std::move(name), std::move(data), timeout,
+                 std::move(promise));
+  }
+
+  void before_query() {
+    if (is_closing_) {
+      return;
+    }
+    if (!client_.empty()) {
+      alarm_timestamp() = td::Timestamp::in(MAX_NO_QUERIES_TIMEOUT);
+      return;
+    }
+    class Callback : public ton::adnl::AdnlExtClient::Callback {
+     public:
+      explicit Callback(td::actor::ActorShared<> parent) : parent_(std::move(parent)) {
+      }
+      void on_ready() override {
+      }
+      void on_stop_ready() override {
+      }
+
+     private:
+      td::actor::ActorShared<> parent_;
+    };
+    ref_cnt_++;
+    client_ = ton::adnl::AdnlExtClient::create(dst_, dst_addr_, std::make_unique<Callback>(td::actor::actor_shared()));
+  }
+
+ private:
+  ton::adnl::AdnlNodeIdFull dst_;
+  td::IPAddress dst_addr_;
+  td::actor::ActorOwn<ton::adnl::AdnlExtClient> client_;
+  td::unique_ptr<ExtClientLazy::Callback> callback_;
+  static constexpr double MAX_NO_QUERIES_TIMEOUT = 100;
+
+  bool is_closing_{false};
+  td::uint32 ref_cnt_{1};
+
+  void alarm() override {
+    client_.reset();
+  }
+  void hangup_shared() override {
+    ref_cnt_--;
+    try_stop();
+  }
+  void hangup() override {
+    is_closing_ = true;
+    ref_cnt_--;
+    client_.reset();
+    try_stop();
+  }
+  void try_stop() {
+    if (is_closing_ && ref_cnt_ == 0) {
+      stop();
+    }
+  }
+};
+
+td::actor::ActorOwn<ton::adnl::AdnlExtClient> ExtClientLazy::create(ton::adnl::AdnlNodeIdFull dst,
+                                                                    td::IPAddress dst_addr,
+                                                                    td::unique_ptr<Callback> callback) {
+  return td::actor::create_actor<ExtClientLazyImp>("ExtClientLazy", dst, dst_addr, std::move(callback));
+}
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/ExtClientLazy.h b/submodules/ton/tonlib-src/tonlib/tonlib/ExtClientLazy.h
new file mode 100644
index 0000000000..441b4c9eea
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/ExtClientLazy.h
@@ -0,0 +1,36 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/actor/actor.h"
+
+#include "adnl/adnl-ext-client.h"
+
+namespace tonlib {
+class ExtClientLazy {
+ public:
+  class Callback {
+   public:
+    virtual ~Callback() {
+    }
+  };
+  static td::actor::ActorOwn<ton::adnl::AdnlExtClient> create(ton::adnl::AdnlNodeIdFull dst, td::IPAddress dst_addr,
+                                                              td::unique_ptr<Callback> callback);
+};
+
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/GenericAccount.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/GenericAccount.cpp
new file mode 100644
index 0000000000..ca02099400
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/GenericAccount.cpp
@@ -0,0 +1,79 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tonlib/GenericAccount.h"
+#include "tonlib/utils.h"
+#include "block/block-auto.h"
+namespace tonlib {
+td::Ref<vm::Cell> GenericAccount::get_init_state(td::Ref<vm::Cell> code, td::Ref<vm::Cell> data) {
+  return vm::CellBuilder()
+      .append_cellslice(binary_bitstring_to_cellslice("b{00110}").move_as_ok())
+      .store_ref(std::move(code))
+      .store_ref(std::move(data))
+      .finalize();
+}
+block::StdAddress GenericAccount::get_address(ton::WorkchainId workchain_id, const td::Ref<vm::Cell>& init_state) {
+  return block::StdAddress(workchain_id, init_state->get_hash().bits());
+}
+td::Ref<vm::Cell> GenericAccount::create_ext_message(const block::StdAddress& address, td::Ref<vm::Cell> new_state,
+                                                     td::Ref<vm::Cell> body) {
+  block::gen::Message::Record message;
+  /*info*/ {
+    block::gen::CommonMsgInfo::Record_ext_in_msg_info info;
+    /* src */
+    tlb::csr_pack(info.src, block::gen::MsgAddressExt::Record_addr_none{});
+    /* dest */ {
+      block::gen::MsgAddressInt::Record_addr_std dest;
+      dest.anycast = vm::CellBuilder().store_zeroes(1).as_cellslice_ref();
+      dest.workchain_id = address.workchain;
+      dest.address = address.addr;
+
+      tlb::csr_pack(info.dest, dest);
+    }
+    /* import_fee */ {
+      vm::CellBuilder cb;
+      block::tlb::t_Grams.store_integer_value(cb, td::BigInt256(0));
+      info.import_fee = cb.as_cellslice_ref();
+    }
+
+    tlb::csr_pack(message.info, info);
+  }
+  /* init */ {
+    if (new_state.not_null()) {
+      // Just(Left(new_state))
+      message.init = vm::CellBuilder()
+                         .store_ones(1)
+                         .store_zeroes(1)
+                         .append_cellslice(vm::load_cell_slice(new_state))
+                         .as_cellslice_ref();
+    } else {
+      message.init = vm::CellBuilder().store_zeroes(1).as_cellslice_ref();
+      CHECK(message.init.not_null());
+    }
+  }
+  /* body */ {
+    message.body = vm::CellBuilder().store_zeroes(1).append_cellslice(vm::load_cell_slice_ref(body)).as_cellslice_ref();
+  }
+
+  td::Ref<vm::Cell> res;
+  tlb::type_pack_cell(res, block::gen::t_Message_Any, message);
+  CHECK(res.not_null());
+
+  return res;
+}
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/GenericAccount.h b/submodules/ton/tonlib-src/tonlib/tonlib/GenericAccount.h
new file mode 100644
index 0000000000..253274f05e
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/GenericAccount.h
@@ -0,0 +1,30 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cells.h"
+#include "block/block.h"
+namespace tonlib {
+class GenericAccount {
+ public:
+  static td::Ref<vm::Cell> get_init_state(td::Ref<vm::Cell> code, td::Ref<vm::Cell> data);
+  static block::StdAddress get_address(ton::WorkchainId workchain_id, const td::Ref<vm::Cell>& init_state);
+  static td::Ref<vm::Cell> create_ext_message(const block::StdAddress& address, td::Ref<vm::Cell> new_state,
+                                              td::Ref<vm::Cell> body);
+};
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/KeyStorage.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/KeyStorage.cpp
new file mode 100644
index 0000000000..1c25764328
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/KeyStorage.cpp
@@ -0,0 +1,150 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "KeyStorage.h"
+
+#include "tonlib/keys/Mnemonic.h"
+#include "tonlib/keys/DecryptedKey.h"
+#include "tonlib/keys/EncryptedKey.h"
+
+#include "td/utils/filesystem.h"
+#include "td/utils/port/path.h"
+
+namespace tonlib {
+std::string to_file_name(td::Slice public_key) {
+  return td::buffer_to_hex(public_key);
+}
+
+std::string KeyStorage::to_file_path(td::Slice public_key) {
+  return directory_ + TD_DIR_SLASH + to_file_name(public_key);
+}
+td::Status KeyStorage::set_directory(std::string directory) {
+  TRY_RESULT(path, td::realpath(directory));
+  TRY_RESULT(stat, td::stat(path));
+  if (!stat.is_dir_) {
+    return td::Status::Error("not a directory");
+  }
+  directory_ = std::move(path);
+  return td::Status::OK();
+}
+
+td::Result<KeyStorage::Key> KeyStorage::save_key(const DecryptedKey &decrypted_key, td::Slice local_password) {
+  auto encrypted_key = decrypted_key.encrypt(local_password);
+
+  Key res;
+  res.public_key = encrypted_key.public_key.as_octet_string();
+  res.secret = std::move(encrypted_key.secret);
+
+  auto size = encrypted_key.encrypted_data.size();
+
+  LOG(ERROR) << "SAVE " << to_file_name(res.public_key);
+  TRY_RESULT(to_file, td::FileFd::open(to_file_path(res.public_key), td::FileFd::CreateNew | td::FileFd::Write));
+  TRY_RESULT(written, to_file.write(encrypted_key.encrypted_data));
+  if (written != static_cast<size_t>(size)) {
+    return td::Status::Error(PSLICE() << "Failed to write file: written " << written << " bytes instead of " << size);
+  }
+  to_file.close();
+
+  return std::move(res);
+}
+
+td::Result<KeyStorage::Key> KeyStorage::create_new_key(td::Slice local_password, td::Slice mnemonic_password,
+                                                       td::Slice entropy) {
+  Mnemonic::Options create_options;
+  create_options.password = td::SecureString(mnemonic_password);
+  create_options.entropy = td::SecureString(entropy);
+  TRY_RESULT(mnemonic, Mnemonic::create_new(std::move(create_options)));
+
+  return save_key(DecryptedKey(std::move(mnemonic)), local_password);
+}
+
+td::Result<DecryptedKey> KeyStorage::export_decrypted_key(InputKey input_key) {
+  TRY_RESULT(encrypted_data, td::read_file_secure(to_file_path(input_key.key.public_key)));
+  EncryptedKey encrypted_key{std::move(encrypted_data), td::Ed25519::PublicKey(std::move(input_key.key.public_key)),
+                             std::move(input_key.key.secret)};
+  return encrypted_key.decrypt(std::move(input_key.local_password));
+}
+
+td::Result<KeyStorage::ExportedKey> KeyStorage::export_key(InputKey input_key) {
+  TRY_RESULT(decrypted_key, export_decrypted_key(std::move(input_key)));
+  ExportedKey exported_key;
+  exported_key.mnemonic_words = std::move(decrypted_key.mnemonic_words);
+  return std::move(exported_key);
+}
+
+td::Result<KeyStorage::PrivateKey> KeyStorage::load_private_key(InputKey input_key) {
+  TRY_RESULT(decrypted_key, export_decrypted_key(std::move(input_key)));
+  PrivateKey private_key;
+  private_key.private_key = decrypted_key.private_key.as_octet_string();
+  return std::move(private_key);
+}
+
+td::Status KeyStorage::delete_key(td::Slice public_key) {
+  return td::unlink(to_file_path(public_key));
+}
+
+td::Result<KeyStorage::Key> KeyStorage::import_key(td::Slice local_password, td::Slice mnemonic_password,
+                                                   ExportedKey exported_key) {
+  TRY_RESULT(mnemonic, Mnemonic::create(std::move(exported_key.mnemonic_words), td::SecureString(mnemonic_password)));
+  if (!mnemonic.is_basic_seed()) {
+    if (mnemonic_password.empty() && mnemonic.is_password_seed()) {
+      return td::Status::Error("Mnemonic password is expected");
+    }
+    return td::Status::Error("Invalid mnemonic words or password (invalid checksum)");
+  }
+  return save_key(DecryptedKey(std::move(mnemonic)), local_password);
+}
+
+td::Result<KeyStorage::ExportedPemKey> KeyStorage::export_pem_key(InputKey input_key, td::Slice key_password) {
+  TRY_RESULT(decrypted_key, export_decrypted_key(std::move(input_key)));
+  TRY_RESULT(pem, decrypted_key.private_key.as_pem(key_password));
+  return ExportedPemKey{std::move(pem)};
+}
+
+td::Result<KeyStorage::Key> KeyStorage::change_local_password(InputKey input_key, td::Slice new_local_password) {
+  auto new_secret =
+      DecryptedKey::change_local_password(input_key.key.secret, input_key.local_password, new_local_password);
+  Key res;
+  res.public_key = std::move(input_key.key.public_key);
+  res.secret = std::move(new_secret);
+  return std::move(res);
+}
+
+td::Result<KeyStorage::Key> KeyStorage::import_pem_key(td::Slice local_password, td::Slice key_password,
+                                                       ExportedPemKey exported_key) {
+  TRY_RESULT(key, td::Ed25519::PrivateKey::from_pem(exported_key.pem, key_password));
+  return save_key(DecryptedKey({}, std::move(key)), local_password);
+}
+
+static std::string dummy_secret = "dummy secret of 32 bytes length!";
+td::Result<KeyStorage::ExportedEncryptedKey> KeyStorage::export_encrypted_key(InputKey input_key,
+                                                                              td::Slice key_password) {
+  TRY_RESULT(decrypted_key, export_decrypted_key(std::move(input_key)));
+  auto res = decrypted_key.encrypt(key_password, dummy_secret);
+  return ExportedEncryptedKey{std::move(res.encrypted_data)};
+}
+
+td::Result<KeyStorage::Key> KeyStorage::import_encrypted_key(td::Slice local_password, td::Slice key_password,
+                                                             ExportedEncryptedKey exported_key) {
+  EncryptedKey encrypted_key{std::move(exported_key.data), td::Ed25519::PublicKey(td::SecureString()),
+                             td::SecureString(dummy_secret)};
+  TRY_RESULT(decrypted_key, encrypted_key.decrypt(key_password, false));
+  return save_key(std::move(decrypted_key), local_password);
+}
+
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/KeyStorage.h b/submodules/ton/tonlib-src/tonlib/tonlib/KeyStorage.h
new file mode 100644
index 0000000000..305872be23
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/KeyStorage.h
@@ -0,0 +1,77 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/Status.h"
+#include "td/utils/SharedSlice.h"
+
+#include <string>
+
+namespace tonlib {
+struct DecryptedKey;
+class KeyStorage {
+ public:
+  struct Key {
+    td::SecureString public_key;
+    td::SecureString secret;
+  };
+  struct InputKey {
+    Key key;
+    td::SecureString local_password;
+  };
+  struct ExportedKey {
+    std::vector<td::SecureString> mnemonic_words;
+  };
+  struct ExportedPemKey {
+    td::SecureString pem;
+  };
+  struct ExportedEncryptedKey {
+    td::SecureString data;
+  };
+  struct PrivateKey {
+    td::SecureString private_key;
+  };
+
+  td::Status set_directory(std::string directory);
+
+  td::Result<Key> create_new_key(td::Slice local_password, td::Slice key_password, td::Slice entropy);
+
+  td::Result<ExportedKey> export_key(InputKey input_key);
+  td::Result<ExportedPemKey> export_pem_key(InputKey input_key, td::Slice key_password);
+  td::Result<ExportedEncryptedKey> export_encrypted_key(InputKey input_key, td::Slice key_password);
+  td::Result<Key> change_local_password(InputKey input_key, td::Slice new_local_password);
+
+  td::Status delete_key(td::Slice public_key);
+
+  td::Result<Key> import_key(td::Slice local_password, td::Slice mnemonic_password, ExportedKey exported_key);
+  td::Result<Key> import_pem_key(td::Slice local_password, td::Slice key_password, ExportedPemKey exported_key);
+  td::Result<Key> import_encrypted_key(td::Slice local_password, td::Slice key_password,
+                                       ExportedEncryptedKey exported_key);
+
+  td::Result<PrivateKey> load_private_key(InputKey input_key);
+
+ private:
+  std::string directory_;
+
+  td::Result<Key> save_key(const DecryptedKey& mnemonic, td::Slice local_password);
+  td::Result<DecryptedKey> export_decrypted_key(InputKey input_key);
+
+  std::string to_file_path(td::Slice public_key);
+};
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/LastBlock.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/LastBlock.cpp
new file mode 100644
index 0000000000..16eb3eb7e2
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/LastBlock.cpp
@@ -0,0 +1,134 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tonlib/LastBlock.h"
+
+#include "ton/lite-tl.hpp"
+
+#include "lite-client/lite-client-common.h"
+
+namespace tonlib {
+LastBlock::LastBlock(ExtClientRef client, ton::ZeroStateIdExt zero_state_id, ton::BlockIdExt last_block_id,
+                     td::actor::ActorShared<> parent) {
+  zero_state_id_ = std::move(zero_state_id);
+  mc_last_block_id_ = std::move(last_block_id);
+  client_.set_client(client);
+  parent_ = std::move(parent);
+}
+
+void LastBlock::get_last_block(td::Promise<ton::BlockIdExt> promise) {
+  if (promises_.empty()) {
+    do_get_last_block();
+  }
+  promises_.push_back(std::move(promise));
+}
+
+void LastBlock::do_get_last_block() {
+  client_.send_query(ton::lite_api::liteServer_getMasterchainInfo(),
+                     [this](auto r_info) { this->on_masterchain_info(std::move(r_info)); });
+  return;
+  //liteServer.getBlockProof mode:# known_block:tonNode.blockIdExt target_block:mode.0?tonNode.blockIdExt = liteServer.PartialBlockProof;
+  client_.send_query(
+      ton::lite_api::liteServer_getBlockProof(0, create_tl_lite_block_id(mc_last_block_id_), nullptr),
+      [this, from = mc_last_block_id_](auto r_block_proof) { this->on_block_proof(from, std::move(r_block_proof)); });
+}
+
+td::Result<bool> LastBlock::process_block_proof(
+    ton::BlockIdExt from,
+    td::Result<ton::ton_api::object_ptr<ton::lite_api::liteServer_partialBlockProof>> r_block_proof) {
+  TRY_RESULT(block_proof, std::move(r_block_proof));
+  LOG(ERROR) << to_string(block_proof);
+  TRY_RESULT(chain, liteclient::deserialize_proof_chain(std::move(block_proof)));
+  if (chain->from != from) {
+    return td::Status::Error(PSLICE() << "block proof chain starts from block " << chain->from.to_str()
+                                      << ", not from requested block " << from.to_str());
+  }
+  TRY_STATUS(chain->validate());
+  update_mc_last_block(chain->to);
+  return chain->complete;
+}
+
+void LastBlock::on_block_proof(
+    ton::BlockIdExt from,
+    td::Result<ton::ton_api::object_ptr<ton::lite_api::liteServer_partialBlockProof>> r_block_proof) {
+  auto r_is_ready = process_block_proof(from, std::move(r_block_proof));
+  if (r_is_ready.is_error()) {
+    LOG(WARNING) << "Failed liteServer_getBlockProof " << r_block_proof.error();
+    return;
+  }
+  auto is_ready = r_is_ready.move_as_ok();
+  if (is_ready) {
+    for (auto& promise : promises_) {
+      auto copy = mc_last_block_id_;
+      promise.set_value(std::move(copy));
+    }
+    promises_.clear();
+  } else {
+    do_get_last_block();
+  }
+}
+
+void LastBlock::on_masterchain_info(
+    td::Result<ton::ton_api::object_ptr<ton::lite_api::liteServer_masterchainInfo>> r_info) {
+  if (r_info.is_ok()) {
+    auto info = r_info.move_as_ok();
+    update_zero_state(create_zero_state_id(info->init_));
+    update_mc_last_block(create_block_id(info->last_));
+  } else {
+    LOG(WARNING) << "Failed liteServer_getMasterchainInfo " << r_info.error();
+  }
+  for (auto& promise : promises_) {
+    auto copy = mc_last_block_id_;
+    promise.set_value(std::move(copy));
+  }
+  promises_.clear();
+}
+
+void LastBlock::update_zero_state(ton::ZeroStateIdExt zero_state_id) {
+  if (!zero_state_id.is_valid()) {
+    LOG(ERROR) << "Ignore invalid zero state update";
+    return;
+  }
+
+  if (!zero_state_id_.is_valid()) {
+    LOG(INFO) << "Init zerostate: " << zero_state_id.to_str();
+    zero_state_id_ = std::move(zero_state_id);
+    return;
+  }
+
+  if (zero_state_id_ == zero_state_id_) {
+    return;
+  }
+
+  LOG(FATAL) << "Masterchain zerostate mismatch: expected: " << zero_state_id_.to_str() << ", found "
+             << zero_state_id.to_str();
+  // TODO: all other updates will be inconsitent.
+  // One will have to restart ton client
+}
+
+void LastBlock::update_mc_last_block(ton::BlockIdExt mc_block_id) {
+  if (!mc_block_id.is_valid()) {
+    LOG(ERROR) << "Ignore invalid masterchain block";
+    return;
+  }
+  if (!mc_last_block_id_.is_valid() || mc_last_block_id_.id.seqno < mc_block_id.id.seqno) {
+    mc_last_block_id_ = mc_block_id;
+    LOG(INFO) << "Update masterchain block id: " << mc_last_block_id_.to_str();
+  }
+}
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/LastBlock.h b/submodules/ton/tonlib-src/tonlib/tonlib/LastBlock.h
new file mode 100644
index 0000000000..79a6527705
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/LastBlock.h
@@ -0,0 +1,53 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/actor/actor.h"
+
+#include "tonlib/ExtClient.h"
+
+namespace tonlib {
+class LastBlock : public td::actor::Actor {
+ public:
+  explicit LastBlock(ExtClientRef client, ton::ZeroStateIdExt zero_state_id, ton::BlockIdExt last_block_id,
+                     td::actor::ActorShared<> parent);
+
+  void get_last_block(td::Promise<ton::BlockIdExt> promise);
+
+ private:
+  ExtClient client_;
+  ton::ZeroStateIdExt zero_state_id_;
+  ton::BlockIdExt mc_last_block_id_;
+
+  std::vector<td::Promise<ton::BlockIdExt>> promises_;
+
+  td::actor::ActorShared<> parent_;
+
+  void do_get_last_block();
+  void on_masterchain_info(td::Result<ton::ton_api::object_ptr<ton::lite_api::liteServer_masterchainInfo>> r_info);
+  void on_block_proof(ton::BlockIdExt from,
+                      td::Result<ton::ton_api::object_ptr<ton::lite_api::liteServer_partialBlockProof>> r_block_proof);
+  td::Result<bool> process_block_proof(
+      ton::BlockIdExt from,
+      td::Result<ton::ton_api::object_ptr<ton::lite_api::liteServer_partialBlockProof>> r_block_proof);
+
+  void update_zero_state(ton::ZeroStateIdExt zero_state_id);
+
+  void update_mc_last_block(ton::BlockIdExt mc_block_id);
+};
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/TestGiver.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/TestGiver.cpp
new file mode 100644
index 0000000000..572f709f7a
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/TestGiver.cpp
@@ -0,0 +1,52 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tonlib/TestGiver.h"
+#include "tonlib/utils.h"
+
+#include "td/utils/base64.h"
+
+namespace tonlib {
+const block::StdAddress& TestGiver::address() {
+  //static block::StdAddress res =
+  //block::StdAddress::parse("-1:8156775b79325e5d62e742d9b96c30b6515a5cd2f1f64c5da4b193c03f070e0d").move_as_ok();
+  static block::StdAddress res =
+      block::StdAddress::parse("kf9cW6egIIUMvWKfGOWfopbU4zLTUzrsNAwm87SUXnE5UcEG").move_as_ok();
+  return res;
+}
+
+vm::CellHash TestGiver::get_init_code_hash() {
+  return vm::CellHash::from_slice(td::base64_decode("s7RouN9wfJ4Avx8h0uw6X3ZEJfN3MYOUmzrC8JXfMAw=").move_as_ok());
+}
+
+td::Ref<vm::Cell> TestGiver::make_a_gift_message(td::uint32 seqno, td::uint64 gramms,
+                                                 const block::StdAddress& dest_address) {
+  td::BigInt256 dest_addr;
+  dest_addr.import_bits(dest_address.addr.as_bitslice());
+  vm::CellBuilder cb;
+  cb.append_cellslice(binary_bitstring_to_cellslice("b{01}").move_as_ok())
+      .store_long(dest_address.bounceable, 1)
+      .append_cellslice(binary_bitstring_to_cellslice("b{000100}").move_as_ok())
+      .store_long(dest_address.workchain, 8)
+      .store_int256(dest_addr, 256);
+  block::tlb::t_Grams.store_integer_value(cb, td::BigInt256(gramms));
+
+  auto message_inner = cb.store_zeroes(9 + 64 + 32 + 1 + 1).store_bytes("GIFT").finalize();
+  return vm::CellBuilder().store_long(seqno, 32).store_long(1, 8).store_ref(message_inner).finalize();
+}
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/TestGiver.h b/submodules/ton/tonlib-src/tonlib/tonlib/TestGiver.h
new file mode 100644
index 0000000000..88ccd1b772
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/TestGiver.h
@@ -0,0 +1,29 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "block/block.h"
+namespace tonlib {
+class TestGiver {
+ public:
+  static const block::StdAddress& address();
+  static vm::CellHash get_init_code_hash();
+  static td::Ref<vm::Cell> make_a_gift_message(td::uint32 seqno, td::uint64 gramms,
+                                               const block::StdAddress& dest_address);
+};
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/TestWallet.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/TestWallet.cpp
new file mode 100644
index 0000000000..bda32c1752
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/TestWallet.cpp
@@ -0,0 +1,74 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tonlib/TestWallet.h"
+#include "tonlib/GenericAccount.h"
+#include "tonlib/utils.h"
+
+#include "vm/boc.h"
+#include "td/utils/base64.h"
+
+namespace tonlib {
+td::Ref<vm::Cell> TestWallet::get_init_state(const td::Ed25519::PublicKey& public_key) {
+  auto code = get_init_code();
+  auto data = get_init_data(public_key);
+  return GenericAccount::get_init_state(std::move(code), std::move(data));
+}
+
+td::Ref<vm::Cell> TestWallet::get_init_message(const td::Ed25519::PrivateKey& private_key) {
+  std::string seq_no(4, 0);
+  auto signature =
+      private_key.sign(vm::CellBuilder().store_bytes(seq_no).finalize()->get_hash().as_slice()).move_as_ok();
+  return vm::CellBuilder().store_bytes(signature).store_bytes(seq_no).finalize();
+}
+
+td::Ref<vm::Cell> TestWallet::make_a_gift_message(const td::Ed25519::PrivateKey& private_key, td::uint32 seqno,
+                                                  td::int64 gramms, const block::StdAddress& dest_address) {
+  td::BigInt256 dest_addr;
+  dest_addr.import_bits(dest_address.addr.as_bitslice());
+  vm::CellBuilder cb;
+  cb.append_cellslice(binary_bitstring_to_cellslice("b{010000100}").move_as_ok())
+      .store_long(dest_address.workchain, 8)
+      .store_int256(dest_addr, 256);
+  block::tlb::t_Grams.store_integer_value(cb, td::BigInt256(gramms));
+  auto message_inner = cb.store_zeroes(9 + 64 + 32 + 1 + 1).store_bytes("GIFT").finalize();
+  auto message = vm::CellBuilder().store_long(seqno, 32).store_long(1, 8).store_ref(message_inner).finalize();
+  std::string seq_no(4, 0);
+  auto signature = private_key.sign(message->get_hash().as_slice()).move_as_ok();
+  return vm::CellBuilder().store_bytes(signature).append_cellslice(vm::load_cell_slice(message)).finalize();
+}
+
+td::Ref<vm::Cell> TestWallet::get_init_code() {
+  static auto res = [] {
+    auto serialized_code = td::base64_decode(
+                               "te6ccgEEAQEAAAAAUwAAov8AIN0gggFMl7qXMO1E0NcLH+Ck8mCBAgDXGCDXCx/tRNDTH9P/"
+                               "0VESuvKhIvkBVBBE+RDyovgAAdMfMSDXSpbTB9QC+wDe0aTIyx/L/8ntVA==")
+                               .move_as_ok();
+    return vm::std_boc_deserialize(serialized_code).move_as_ok();
+  }();
+  return res;
+}
+
+vm::CellHash TestWallet::get_init_code_hash() {
+  return get_init_code()->get_hash();
+}
+
+td::Ref<vm::Cell> TestWallet::get_init_data(const td::Ed25519::PublicKey& public_key) {
+  return vm::CellBuilder().store_long(0, 32).store_bytes(public_key.as_octet_string()).finalize();
+}
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/TestWallet.h b/submodules/ton/tonlib-src/tonlib/tonlib/TestWallet.h
new file mode 100644
index 0000000000..f4de1f6ae6
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/TestWallet.h
@@ -0,0 +1,37 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "vm/cells.h"
+#include "Ed25519.h"
+#include "block/block.h"
+
+namespace tonlib {
+class TestWallet {
+ public:
+  static td::Ref<vm::Cell> get_init_state(const td::Ed25519::PublicKey& public_key);
+  static td::Ref<vm::Cell> get_init_message(const td::Ed25519::PrivateKey& private_key);
+  static td::Ref<vm::Cell> make_a_gift_message(const td::Ed25519::PrivateKey& private_key, td::uint32 seqno,
+                                               td::int64 gramms, const block::StdAddress& dest_address);
+
+  static td::Ref<vm::Cell> get_init_code();
+  static vm::CellHash get_init_code_hash();
+  static td::Ref<vm::Cell> get_init_data(const td::Ed25519::PublicKey& public_key);
+};
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/TonlibCallback.h b/submodules/ton/tonlib-src/tonlib/tonlib/TonlibCallback.h
new file mode 100644
index 0000000000..9ff010ab7b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/TonlibCallback.h
@@ -0,0 +1,32 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "auto/tl/tonlib_api.h"
+
+namespace tonlib_api = ton::tonlib_api;
+namespace tonlib {
+
+class TonlibCallback {
+ public:
+  virtual void on_result(std::uint64_t id, tonlib_api::object_ptr<tonlib_api::Object> result) = 0;
+  virtual void on_error(std::uint64_t id, tonlib_api::object_ptr<tonlib_api::error> error) = 0;
+  virtual ~TonlibCallback() = default;
+};
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/TonlibClient.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/TonlibClient.cpp
new file mode 100644
index 0000000000..489abb6e7b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/TonlibClient.cpp
@@ -0,0 +1,1022 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "TonlibClient.h"
+
+#include "tonlib/ExtClientLazy.h"
+#include "tonlib/GenericAccount.h"
+#include "tonlib/LastBlock.h"
+#include "tonlib/TestWallet.h"
+#include "tonlib/TestGiver.h"
+#include "tonlib/utils.h"
+#include "tonlib/keys/Mnemonic.h"
+
+#include "auto/tl/tonlib_api.hpp"
+#include "block/block-auto.h"
+#include "block/check-proof.h"
+#include "ton/lite-tl.hpp"
+#include "ton/ton-shard.h"
+
+#include "vm/boc.h"
+
+#include "td/utils/Random.h"
+#include "td/utils/overloaded.h"
+
+#include "td/utils/tests.h"
+#include "td/utils/port/path.h"
+
+namespace ton {}  // namespace ton
+
+namespace tonlib {
+
+template <class F>
+auto try_f(F&& f) noexcept -> decltype(f()) {
+  try {
+    return f();
+  } catch (vm::VmError error) {
+    return td::Status::Error(PSLICE() << "Got a vm exception: " << error.get_msg());
+  }
+}
+
+#define TRY_VM(f) try_f([&] { return f; })
+
+tonlib_api::object_ptr<tonlib_api::error> status_to_tonlib_api(const td::Status& status) {
+  return tonlib_api::make_object<tonlib_api::error>(status.code(), status.message().str());
+}
+
+static block::AccountState create_account_state(ton::tl_object_ptr<ton::lite_api::liteServer_accountState> from) {
+  block::AccountState res;
+  res.blk = ton::create_block_id(from->id_);
+  res.shard_blk = ton::create_block_id(from->shardblk_);
+  res.shard_proof = std::move(from->shard_proof_);
+  res.proof = std::move(from->proof_);
+  res.state = std::move(from->state_);
+  return res;
+}
+struct RawAccountState {
+  td::int64 balance = -1;
+  td::Ref<vm::CellSlice> code;
+  td::Ref<vm::CellSlice> data;
+  block::AccountState::Info info;
+};
+
+td::Result<td::int64> to_balance_or_throw(td::Ref<vm::CellSlice> balance_ref) {
+  vm::CellSlice balance_slice = *balance_ref;
+  auto balance = block::tlb::t_Grams.as_integer_skip(balance_slice);
+  if (balance.is_null()) {
+    return td::Status::Error("Failed to unpack balance");
+  }
+  auto res = balance->to_long();
+  if (res == td::int64(~0ULL << 63)) {
+    return td::Status::Error("Failed to unpack balance (2)");
+  }
+  return res;
+}
+
+td::Result<td::int64> to_balance(td::Ref<vm::CellSlice> balance_ref) {
+  return TRY_VM(to_balance_or_throw(std::move(balance_ref)));
+}
+
+class GetTransactionHistory : public td::actor::Actor {
+ public:
+  GetTransactionHistory(ExtClientRef ext_client_ref, block::StdAddress address, ton::LogicalTime lt, ton::Bits256 hash,
+                        td::Promise<block::TransactionList::Info> promise)
+      : address_(std::move(address)), lt_(std::move(lt)), hash_(std::move(hash)), promise_(std::move(promise)) {
+    client_.set_client(ext_client_ref);
+  }
+
+ private:
+  block::StdAddress address_;
+  ton::LogicalTime lt_;
+  ton::Bits256 hash_;
+  ExtClient client_;
+  td::int32 count_{10};
+  td::Promise<block::TransactionList::Info> promise_;
+
+  void check(td::Status status) {
+    if (status.is_error()) {
+      LOG(ERROR) << status;
+      promise_.set_error(std::move(status));
+      stop();
+    }
+  }
+
+  td::Status do_with_transactions(std::vector<ton::BlockIdExt> blkids, td::BufferSlice transactions) {
+    LOG(INFO) << "got up to " << count_ << " transactions for " << address_ << " from last transaction " << lt_ << ":"
+              << hash_.to_hex();
+    block::TransactionList list;
+    list.blkids = std::move(blkids);
+    list.hash = hash_;
+    list.lt = lt_;
+    list.transactions_boc = std::move(transactions);
+    TRY_RESULT(info, list.validate());
+    if (info.transactions.size() > static_cast<size_t>(count_)) {
+      LOG(WARNING) << "obtained " << info.transactions.size() << " transaction, but only " << count_
+                   << " have been requested";
+    }
+    promise_.set_value(std::move(info));
+    return td::Status::OK();
+  }
+
+  td::Status do_with_transactions(
+      td::Result<ton::lite_api::object_ptr<ton::lite_api::liteServer_transactionList>> r_transactions) {
+    TRY_RESULT(transactions, std::move(r_transactions));
+    std::vector<ton::BlockIdExt> blkids;
+    for (auto& id : transactions->ids_) {
+      blkids.push_back(ton::create_block_id(std::move(id)));
+    }
+    return do_with_transactions(std::move(blkids), std::move(transactions->transactions_));
+  }
+
+  void with_transactions(
+      td::Result<ton::lite_api::object_ptr<ton::lite_api::liteServer_transactionList>> r_transactions) {
+    check(TRY_VM(do_with_transactions(std::move(r_transactions))));
+    stop();
+  }
+
+  void start_up() override {
+    client_.send_query(
+        ton::lite_api::liteServer_getTransactions(
+            count_, ton::create_tl_object<ton::lite_api::liteServer_accountId>(address_.workchain, address_.addr), lt_,
+            hash_),
+        [self = this](auto r_transactions) { self->with_transactions(std::move(r_transactions)); });
+  }
+};
+
+class GetRawAccountState : public td::actor::Actor {
+ public:
+  GetRawAccountState(ExtClientRef ext_client_ref, block::StdAddress address, td::Promise<RawAccountState>&& promise)
+      : address_(std::move(address)), promise_(std::move(promise)) {
+    client_.set_client(ext_client_ref);
+  }
+
+ private:
+  block::StdAddress address_;
+  td::Promise<RawAccountState> promise_;
+  ExtClient client_;
+  ton::BlockIdExt last_block_;
+
+  void with_account_state(td::Result<ton::tl_object_ptr<ton::lite_api::liteServer_accountState>> r_account_state) {
+    promise_.set_result(TRY_VM(do_with_account_state(std::move(r_account_state))));
+    stop();
+  }
+
+  td::Result<RawAccountState> do_with_account_state(
+      td::Result<ton::tl_object_ptr<ton::lite_api::liteServer_accountState>> r_account_state) {
+    TRY_RESULT(raw_account_state, std::move(r_account_state));
+    auto account_state = create_account_state(std::move(raw_account_state));
+    TRY_RESULT(info, account_state.validate(last_block_, address_));
+    auto serialized_state = account_state.state.clone();
+    RawAccountState res;
+    res.info = std::move(info);
+    auto cell = res.info.root;
+    if (cell.is_null()) {
+      return res;
+    }
+    //block::gen::t_Account.print_ref(std::cerr, cell);
+    block::gen::Account::Record_account account;
+    if (!tlb::unpack_cell(cell, account)) {
+      return td::Status::Error("Failed to unpack Account");
+    }
+    block::gen::AccountStorage::Record storage;
+    if (!tlb::csr_unpack(account.storage, storage)) {
+      return td::Status::Error("Failed to unpack AccountStorage");
+    }
+    TRY_RESULT(balance, to_balance(storage.balance));
+    res.balance = balance;
+    auto state_tag = block::gen::t_AccountState.get_tag(*storage.state);
+    if (state_tag < 0) {
+      return td::Status::Error("Failed to parse AccountState tag");
+    }
+    // TODO: handle frozen account
+    if (state_tag != block::gen::AccountState::account_active) {
+      return res;
+    }
+    block::gen::AccountState::Record_account_active state;
+    if (!tlb::csr_unpack(storage.state, state)) {
+      return td::Status::Error("Failed to parse AccountState");
+    }
+    block::gen::StateInit::Record state_init;
+    if (!tlb::csr_unpack(state.x, state_init)) {
+      return td::Status::Error("Failed to parse StateInit");
+    }
+    res.code = std::move(state_init.code);
+    res.data = std::move(state_init.data);
+
+    return res;
+  }
+
+  void start_up() override {
+    client_.with_last_block([self = this](td::Result<ton::BlockIdExt> r_last_block) {
+      if (r_last_block.is_error()) {
+        return self->check(r_last_block.move_as_error());
+      }
+      self->last_block_ = r_last_block.move_as_ok();
+
+      self->client_.send_query(
+          ton::lite_api::liteServer_getAccountState(ton::create_tl_lite_block_id(self->last_block_),
+                                                    ton::create_tl_object<ton::lite_api::liteServer_accountId>(
+                                                        self->address_.workchain, self->address_.addr)),
+          [self](auto r_state) { self->with_account_state(std::move(r_state)); });
+    });
+  }
+
+  void check(td::Status status) {
+    if (status.is_error()) {
+      promise_.set_error(std::move(status));
+      stop();
+    }
+  }
+};
+
+TonlibClient::TonlibClient(td::unique_ptr<TonlibCallback> callback) : callback_(std::move(callback)) {
+}
+TonlibClient::~TonlibClient() = default;
+
+void TonlibClient::hangup() {
+  is_closing_ = true;
+  ref_cnt_--;
+  raw_client_ = {};
+  raw_last_block_ = {};
+  try_stop();
+}
+
+ExtClientRef TonlibClient::get_client_ref() {
+  ExtClientRef ref;
+  ref.andl_ext_client_ = raw_client_.get();
+  ref.last_block_actor_ = raw_last_block_.get();
+
+  return ref;
+}
+void TonlibClient::init_ext_client() {
+  auto lite_clients_size = config_.lite_clients.size();
+  CHECK(lite_clients_size != 0);
+  auto lite_client_id = td::Random::fast(0, td::narrow_cast<int>(lite_clients_size) - 1);
+  auto& lite_client = config_.lite_clients[lite_client_id];
+  class Callback : public ExtClientLazy::Callback {
+   public:
+    explicit Callback(td::actor::ActorShared<> parent) : parent_(std::move(parent)) {
+    }
+
+   private:
+    td::actor::ActorShared<> parent_;
+  };
+  ref_cnt_++;
+  raw_client_ = ExtClientLazy::create(lite_client.adnl_id, lite_client.address,
+                                      td::make_unique<Callback>(td::actor::actor_shared()));
+  ref_cnt_++;
+  raw_last_block_ = td::actor::create_actor<LastBlock>(
+      "LastBlock", get_client_ref(),
+      ton::ZeroStateIdExt(config_.zero_state_id.id.workchain, config_.zero_state_id.root_hash,
+                          config_.zero_state_id.file_hash),
+      config_.zero_state_id, td::actor::actor_shared());
+  client_.set_client(get_client_ref());
+}
+
+void TonlibClient::on_result(td::uint64 id, tonlib_api::object_ptr<tonlib_api::Object> response) {
+  if (response->get_id() == tonlib_api::error::ID) {
+    callback_->on_error(id, tonlib_api::move_object_as<tonlib_api::error>(response));
+    return;
+  }
+  callback_->on_result(id, std::move(response));
+}
+void TonlibClient::request(td::uint64 id, tonlib_api::object_ptr<tonlib_api::Function> function) {
+  LOG(ERROR) << to_string(function);
+  if (function == nullptr) {
+    LOG(ERROR) << "Receive empty static request";
+    return on_result(id, tonlib_api::make_object<tonlib_api::error>(400, "Request is empty"));
+  }
+
+  if (is_static_request(function->get_id())) {
+    return on_result(id, static_request(std::move(function)));
+  }
+
+  if (state_ == State::Closed) {
+    return on_result(id, tonlib_api::make_object<tonlib_api::error>(400, "tonlib is closed"));
+  }
+  if (state_ == State::Uninited) {
+    if (!is_uninited_request(function->get_id())) {
+      return on_result(id, tonlib_api::make_object<tonlib_api::error>(400, "library is not inited"));
+    }
+  }
+
+  downcast_call(*function, [this, self = this, id](auto& request) {
+    using ReturnType = typename std::decay_t<decltype(request)>::ReturnType;
+    td::Promise<ReturnType> promise = [actor_id = actor_id(self), id](td::Result<ReturnType> r_result) {
+      tonlib_api::object_ptr<tonlib_api::Object> result;
+      if (r_result.is_error()) {
+        result = status_to_tonlib_api(r_result.error());
+      } else {
+        result = r_result.move_as_ok();
+      }
+
+      send_closure(actor_id, &TonlibClient::on_result, id, std::move(result));
+    };
+    auto status = this->do_request(request, std::move(promise));
+    if (status.is_error()) {
+      CHECK(promise);
+      promise.set_error(std::move(status));
+    }
+  });
+}
+void TonlibClient::close() {
+  stop();
+}
+tonlib_api::object_ptr<tonlib_api::Object> TonlibClient::static_request(
+    tonlib_api::object_ptr<tonlib_api::Function> function) {
+  if (function == nullptr) {
+    LOG(ERROR) << "Receive empty static request";
+    return tonlib_api::make_object<tonlib_api::error>(400, "Request is empty");
+  }
+
+  tonlib_api::object_ptr<tonlib_api::Object> response;
+  downcast_call(*function, [&response](auto& request) { response = TonlibClient::do_static_request(request); });
+  return response;
+}
+
+bool TonlibClient::is_static_request(td::int32 id) {
+  switch (id) {
+    case tonlib_api::runTests::ID:
+    case tonlib_api::raw_getAccountAddress::ID:
+    case tonlib_api::testWallet_getAccountAddress::ID:
+    case tonlib_api::testGiver_getAccountAddress::ID:
+    case tonlib_api::getBip39Hints::ID:
+      return true;
+    default:
+      return false;
+  }
+}
+bool TonlibClient::is_uninited_request(td::int32 id) {
+  switch (id) {
+    case tonlib_api::init::ID:
+    case tonlib_api::close::ID:
+      return true;
+    default:
+      return false;
+  }
+}
+
+tonlib_api::object_ptr<tonlib_api::Object> TonlibClient::do_static_request(const tonlib_api::runTests& request) {
+  auto& runner = td::TestsRunner::get_default();
+  if (!request.dir_.empty()) {
+    td::chdir(request.dir_).ignore();
+  }
+  runner.run_all();
+  return tonlib_api::make_object<tonlib_api::ok>();
+}
+td::Result<block::StdAddress> get_account_address(const tonlib_api::raw_initialAccountState& raw_state) {
+  TRY_RESULT(code, vm::std_boc_deserialize(raw_state.code_));
+  TRY_RESULT(data, vm::std_boc_deserialize(raw_state.data_));
+  return GenericAccount::get_address(0 /*zerochain*/, GenericAccount::get_init_state(std::move(code), std::move(data)));
+}
+
+td::Result<block::StdAddress> get_account_address(const tonlib_api::testWallet_initialAccountState& test_wallet_state) {
+  TRY_RESULT(key_bytes, block::PublicKey::parse(test_wallet_state.public_key_));
+  auto key = td::Ed25519::PublicKey(td::SecureString(key_bytes.key));
+  return GenericAccount::get_address(0 /*zerochain*/, TestWallet::get_init_state(key));
+}
+
+tonlib_api::object_ptr<tonlib_api::Object> TonlibClient::do_static_request(
+    const tonlib_api::raw_getAccountAddress& request) {
+  auto r_account_address = get_account_address(*request.initital_account_state_);
+  if (r_account_address.is_error()) {
+    return status_to_tonlib_api(r_account_address.error());
+  }
+  return tonlib_api::make_object<tonlib_api::accountAddress>(r_account_address.ok().rserialize());
+}
+tonlib_api::object_ptr<tonlib_api::Object> TonlibClient::do_static_request(
+    const tonlib_api::testWallet_getAccountAddress& request) {
+  auto r_account_address = get_account_address(*request.initital_account_state_);
+  if (r_account_address.is_error()) {
+    return status_to_tonlib_api(r_account_address.error());
+  }
+  return tonlib_api::make_object<tonlib_api::accountAddress>(r_account_address.ok().rserialize());
+}
+tonlib_api::object_ptr<tonlib_api::Object> TonlibClient::do_static_request(
+    const tonlib_api::testGiver_getAccountAddress& request) {
+  return tonlib_api::make_object<tonlib_api::accountAddress>(TestGiver::address().rserialize());
+}
+
+tonlib_api::object_ptr<tonlib_api::Object> TonlibClient::do_static_request(tonlib_api::getBip39Hints& request) {
+  return tonlib_api::make_object<tonlib_api::bip39Hints>(
+      td::transform(Mnemonic::word_hints(td::trim(td::to_lower_inplace(request.prefix_))), [](auto& x) { return x; }));
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::init& request,
+                                    td::Promise<object_ptr<tonlib_api::ok>>&& promise) {
+  if (state_ != State::Uninited) {
+    return td::Status::Error(400, "Tonlib is already inited");
+  }
+  if (!request.options_) {
+    return td::Status::Error(400, "Field options must not be empty");
+  }
+  TRY_STATUS(key_storage_.set_directory(request.options_->keystore_directory_));
+  if (!request.options_->config_.empty()) {
+    TRY_STATUS(set_config(std::move(request.options_->config_)));
+  }
+  state_ = State::Running;
+  promise.set_value(tonlib_api::make_object<tonlib_api::ok>());
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::set_config(std::string config) {
+  if (config.empty()) {
+    return td::Status::Error("config is empty");
+  }
+  TRY_RESULT(new_config, Config::parse(std::move(config)));
+  if (new_config.lite_clients.empty()) {
+    return td::Status::Error("No lite clients in config");
+  }
+  config_ = std::move(new_config);
+  init_ext_client();
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::close& request,
+                                    td::Promise<object_ptr<tonlib_api::ok>>&& promise) {
+  CHECK(state_ != State::Closed);
+  state_ = State::Closed;
+  promise.set_value(tonlib_api::make_object<tonlib_api::ok>());
+  return td::Status::OK();
+}
+td::Status TonlibClient::do_request(const tonlib_api::options_setConfig& request,
+                                    td::Promise<object_ptr<tonlib_api::ok>>&& promise) {
+  TRY_STATUS(set_config(request.config_));
+  promise.set_value(tonlib_api::make_object<tonlib_api::ok>());
+  return td::Status::OK();
+}
+
+tonlib_api::object_ptr<tonlib_api::internal_transactionId> to_transaction_id(const block::AccountState::Info& info) {
+  return tonlib_api::make_object<tonlib_api::internal_transactionId>(info.last_trans_lt,
+                                                                     info.last_trans_hash.as_slice().str());
+}
+
+td::Result<tonlib_api::object_ptr<tonlib_api::raw_accountState>> to_raw_accountState(RawAccountState&& raw_state) {
+  std::string code;
+  if (raw_state.code.not_null()) {
+    code = vm::std_boc_serialize(vm::CellBuilder().append_cellslice(std::move(raw_state.code)).finalize())
+               .move_as_ok()
+               .as_slice()
+               .str();
+  }
+  std::string data;
+  if (raw_state.data.not_null()) {
+    data = vm::std_boc_serialize(vm::CellBuilder().append_cellslice(std::move(raw_state.data)).finalize())
+               .move_as_ok()
+               .as_slice()
+               .str();
+  }
+  return tonlib_api::make_object<tonlib_api::raw_accountState>(raw_state.balance, std::move(code), std::move(data),
+                                                               to_transaction_id(raw_state.info));
+}
+
+td::Result<std::string> to_std_address_or_throw(td::Ref<vm::CellSlice> cs) {
+  auto tag = block::gen::MsgAddressInt().get_tag(*cs);
+  if (tag < 0) {
+    return td::Status::Error("Failed to read MsgAddressInt tag");
+  }
+  if (tag != block::gen::MsgAddressInt::addr_std) {
+    return "";
+  }
+  block::gen::MsgAddressInt::Record_addr_std addr;
+  if (!tlb::csr_unpack(cs, addr)) {
+    return td::Status::Error("Failed to unpack MsgAddressInt");
+  }
+  return block::StdAddress(addr.workchain_id, addr.address).rserialize();
+}
+
+td::Result<std::string> to_std_address(td::Ref<vm::CellSlice> cs) {
+  return TRY_VM(to_std_address_or_throw(std::move(cs)));
+}
+
+td::Result<tonlib_api::object_ptr<tonlib_api::raw_message>> to_raw_message_or_throw(td::Ref<vm::Cell> cell) {
+  block::gen::Message::Record message;
+  if (!tlb::type_unpack_cell(cell, block::gen::t_Message_Any, message)) {
+    return td::Status::Error("Failed to unpack Message");
+  }
+
+  auto tag = block::gen::CommonMsgInfo().get_tag(*message.info);
+  if (tag < 0) {
+    return td::Status::Error("Failed to read CommonMsgInfo tag");
+  }
+  switch (tag) {
+    case block::gen::CommonMsgInfo::int_msg_info: {
+      block::gen::CommonMsgInfo::Record_int_msg_info msg_info;
+      if (!tlb::csr_unpack(message.info, msg_info)) {
+        return td::Status::Error("Failed to unpack CommonMsgInfo::int_msg_info");
+      }
+      TRY_RESULT(balance, to_balance(msg_info.value));
+      TRY_RESULT(src, to_std_address(msg_info.src));
+      TRY_RESULT(dest, to_std_address(msg_info.dest));
+      return tonlib_api::make_object<tonlib_api::raw_message>(std::move(src), std::move(dest), balance);
+    }
+    case block::gen::CommonMsgInfo::ext_in_msg_info: {
+      block::gen::CommonMsgInfo::Record_ext_in_msg_info msg_info;
+      if (!tlb::csr_unpack(message.info, msg_info)) {
+        return td::Status::Error("Failed to unpack CommonMsgInfo::ext_in_msg_info");
+      }
+      TRY_RESULT(dest, to_std_address(msg_info.dest));
+      return tonlib_api::make_object<tonlib_api::raw_message>("", std::move(dest), 0);
+    }
+    case block::gen::CommonMsgInfo::ext_out_msg_info: {
+      block::gen::CommonMsgInfo::Record_ext_out_msg_info msg_info;
+      if (!tlb::csr_unpack(message.info, msg_info)) {
+        return td::Status::Error("Failed to unpack CommonMsgInfo::ext_out_msg_info");
+      }
+      TRY_RESULT(src, to_std_address(msg_info.src));
+      return tonlib_api::make_object<tonlib_api::raw_message>(std::move(src), "", 0);
+    }
+  }
+
+  return td::Status::Error("Unknown CommonMsgInfo tag");
+}
+
+td::Result<tonlib_api::object_ptr<tonlib_api::raw_message>> to_raw_message(td::Ref<vm::Cell> cell) {
+  return TRY_VM(to_raw_message_or_throw(std::move(cell)));
+}
+
+td::Result<tonlib_api::object_ptr<tonlib_api::raw_transaction>> to_raw_transaction_or_throw(
+    block::Transaction::Info&& info) {
+  std::string data;
+
+  tonlib_api::object_ptr<tonlib_api::raw_message> in_msg;
+  std::vector<tonlib_api::object_ptr<tonlib_api::raw_message>> out_msgs;
+  td::int64 fees = 0;
+  if (info.transaction.not_null()) {
+    TRY_RESULT(copy_data, vm::std_boc_serialize(info.transaction));
+    data = copy_data.as_slice().str();
+    block::gen::Transaction::Record trans;
+    if (!tlb::unpack_cell(info.transaction, trans)) {
+      return td::Status::Error("Failed to unpack Transaction");
+    }
+
+    TRY_RESULT(copy_fees, to_balance(trans.total_fees));
+    fees = copy_fees;
+
+    std::ostringstream outp;
+    block::gen::t_Transaction.print_ref(outp, info.transaction);
+    LOG(ERROR) << outp.str();
+
+    auto is_just = trans.r1.in_msg->prefetch_long(1);
+    if (is_just == trans.r1.in_msg->fetch_long_eof) {
+      return td::Status::Error("Failed to parse long");
+    }
+    if (is_just == 1) {
+      auto msg = trans.r1.in_msg->prefetch_ref();
+      TRY_RESULT(in_msg_copy, to_raw_message(trans.r1.in_msg->prefetch_ref()));
+      in_msg = std::move(in_msg_copy);
+    }
+
+    if (trans.outmsg_cnt != 0) {
+      vm::Dictionary dict{trans.r1.out_msgs, 15};
+      for (int x = 0; x < trans.outmsg_cnt && x < 100; x++) {
+        TRY_RESULT(out_msg, to_raw_message(dict.lookup_ref(td::BitArray<15>{x})));
+        out_msgs.push_back(std::move(out_msg));
+      }
+    }
+  }
+  return tonlib_api::make_object<tonlib_api::raw_transaction>(
+      data,
+      tonlib_api::make_object<tonlib_api::internal_transactionId>(info.prev_trans_lt,
+                                                                  info.prev_trans_hash.as_slice().str()),
+      fees, std::move(in_msg), std::move(out_msgs));
+}
+
+td::Result<tonlib_api::object_ptr<tonlib_api::raw_transaction>> to_raw_transaction(block::Transaction::Info&& info) {
+  return TRY_VM(to_raw_transaction_or_throw(std::move(info)));
+}
+
+td::Result<tonlib_api::object_ptr<tonlib_api::raw_transactions>> to_raw_transactions(
+    block::TransactionList::Info&& info) {
+  std::vector<tonlib_api::object_ptr<tonlib_api::raw_transaction>> transactions;
+  for (auto& transaction : info.transactions) {
+    TRY_RESULT(raw_transaction, to_raw_transaction(std::move(transaction)));
+    transactions.push_back(std::move(raw_transaction));
+  }
+  return tonlib_api::make_object<tonlib_api::raw_transactions>(std::move(transactions));
+}
+
+td::Result<tonlib_api::object_ptr<tonlib_api::testWallet_accountState>> to_testWallet_accountState(
+    RawAccountState&& raw_state) {
+  if (raw_state.data.is_null()) {
+    return td::Status::Error(400, "Not a TestWallet");
+  }
+  auto ref = raw_state.data->prefetch_ref();
+  auto cs = vm::load_cell_slice(std::move(ref));
+  auto seqno = cs.fetch_ulong(32);
+  if (seqno == cs.fetch_ulong_eof) {
+    return td::Status::Error("Failed to parse seq_no");
+  }
+  return tonlib_api::make_object<tonlib_api::testWallet_accountState>(raw_state.balance, static_cast<td::uint32>(seqno),
+                                                                      to_transaction_id(raw_state.info));
+}
+
+td::Result<tonlib_api::object_ptr<tonlib_api::testGiver_accountState>> to_testGiver_accountState(
+    RawAccountState&& raw_state) {
+  if (raw_state.data.is_null()) {
+    return td::Status::Error(400, "Not a TestGiver");
+  }
+  auto ref = raw_state.data->prefetch_ref();
+  auto cs = vm::load_cell_slice(std::move(ref));
+  auto seqno = cs.fetch_ulong(32);
+  if (seqno == cs.fetch_ulong_eof) {
+    return td::Status::Error("Failed to parse seq_no");
+  }
+  return tonlib_api::make_object<tonlib_api::testGiver_accountState>(raw_state.balance, static_cast<td::uint32>(seqno),
+                                                                     to_transaction_id(raw_state.info));
+}
+
+td::Result<tonlib_api::object_ptr<tonlib_api::generic_AccountState>> to_generic_accountState(
+    RawAccountState&& raw_state) {
+  if (raw_state.code.is_null()) {
+    return tonlib_api::make_object<tonlib_api::generic_accountStateUninited>(
+        tonlib_api::make_object<tonlib_api::uninited_accountState>(raw_state.balance));
+  }
+
+  auto code_hash = raw_state.code->prefetch_ref()->get_hash();
+  if (code_hash == TestWallet::get_init_code_hash()) {
+    TRY_RESULT(test_wallet, to_testWallet_accountState(std::move(raw_state)));
+    return tonlib_api::make_object<tonlib_api::generic_accountStateTestWallet>(std::move(test_wallet));
+  }
+  if (code_hash == TestGiver::get_init_code_hash()) {
+    TRY_RESULT(test_wallet, to_testGiver_accountState(std::move(raw_state)));
+    return tonlib_api::make_object<tonlib_api::generic_accountStateTestGiver>(std::move(test_wallet));
+  }
+  TRY_RESULT(raw, to_raw_accountState(std::move(raw_state)));
+  return tonlib_api::make_object<tonlib_api::generic_accountStateRaw>(std::move(raw));
+}
+
+// Raw
+
+td::Status TonlibClient::do_request(const tonlib_api::raw_sendMessage& request,
+                                    td::Promise<object_ptr<tonlib_api::ok>>&& promise) {
+  td::Ref<vm::Cell> init_state;
+  if (!request.initial_account_state_.empty()) {
+    TRY_RESULT(new_init_state, vm::std_boc_deserialize(request.initial_account_state_));
+    init_state = std::move(new_init_state);
+  }
+  TRY_RESULT(data, vm::std_boc_deserialize(request.data_));
+  TRY_RESULT(account_address, block::StdAddress::parse(request.destination_->account_address_));
+  auto message = GenericAccount::create_ext_message(account_address, std::move(init_state), std::move(data));
+  client_.send_query(ton::lite_api::liteServer_sendMessage(vm::std_boc_serialize(message).move_as_ok()),
+                     [promise = std::move(promise)](auto r_info) mutable {
+                       if (r_info.is_error()) {
+                         promise.set_error(r_info.move_as_error());
+                       } else {
+                         auto info = r_info.move_as_ok();
+                         LOG(ERROR) << "info: " << to_string(info);
+                         promise.set_value(tonlib_api::make_object<tonlib_api::ok>());
+                       }
+                     });
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(tonlib_api::raw_getAccountState& request,
+                                    td::Promise<object_ptr<tonlib_api::raw_accountState>>&& promise) {
+  if (!request.account_address_) {
+    return td::Status::Error(400, "Field account_address must not be empty");
+  }
+  TRY_RESULT(account_address, block::StdAddress::parse(request.account_address_->account_address_));
+  td::actor::create_actor<GetRawAccountState>(
+      "GetAccountState", client_.get_client(), std::move(account_address),
+      [promise = std::move(promise)](td::Result<RawAccountState> r_state) mutable {
+        if (r_state.is_error()) {
+          return promise.set_error(r_state.move_as_error());
+        }
+        promise.set_result(to_raw_accountState(r_state.move_as_ok()));
+      })
+      .release();
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(tonlib_api::raw_getTransactions& request,
+                                    td::Promise<object_ptr<tonlib_api::raw_transactions>>&& promise) {
+  if (!request.account_address_) {
+    return td::Status::Error(400, "Field account_address must not be empty");
+  }
+  if (!request.from_transaction_id_) {
+    return td::Status::Error(400, "Field from_transaction_id must not be empty");
+  }
+  TRY_RESULT(account_address, block::StdAddress::parse(request.account_address_->account_address_));
+  auto lt = request.from_transaction_id_->lt_;
+  auto hash_str = request.from_transaction_id_->hash_;
+  if (hash_str.size() != 32) {
+    return td::Status::Error(400, "Invalid transaction id hash size");
+  }
+  td::Bits256 hash;
+  hash.as_slice().copy_from(hash_str);
+
+  td::actor::create_actor<GetTransactionHistory>(
+      "GetTransactionHistory", client_.get_client(), account_address, lt, hash,
+      [promise = std::move(promise)](td::Result<block::TransactionList::Info> r_info) mutable {
+        if (r_info.is_error()) {
+          return promise.set_error(r_info.move_as_error());
+        }
+        promise.set_result(to_raw_transactions(r_info.move_as_ok()));
+      })
+      .release();
+  return td::Status::OK();
+}
+
+td::Result<KeyStorage::InputKey> from_tonlib(tonlib_api::inputKey& input_key) {
+  if (!input_key.key_) {
+    return td::Status::Error(400, "Field key must not be empty");
+  }
+
+  TRY_RESULT(key_bytes, block::PublicKey::parse(input_key.key_->public_key_));
+  return KeyStorage::InputKey{{td::SecureString(key_bytes.key), std::move(input_key.key_->secret_)},
+                              std::move(input_key.local_password_)};
+}
+
+// TestWallet
+td::Status TonlibClient::do_request(const tonlib_api::testWallet_init& request,
+                                    td::Promise<object_ptr<tonlib_api::ok>>&& promise) {
+  if (!request.private_key_) {
+    return td::Status::Error(400, "Field private_key must not be empty");
+  }
+  TRY_RESULT(input_key, from_tonlib(*request.private_key_));
+  auto init_state = TestWallet::get_init_state(td::Ed25519::PublicKey(input_key.key.public_key.copy()));
+  auto address = GenericAccount::get_address(0 /*zerochain*/, init_state);
+  TRY_RESULT(private_key, key_storage_.load_private_key(std::move(input_key)));
+  auto init_message = TestWallet::get_init_message(td::Ed25519::PrivateKey(std::move(private_key.private_key)));
+  return do_request(
+      tonlib_api::raw_sendMessage(tonlib_api::make_object<tonlib_api::accountAddress>(address.rserialize()),
+                                  vm::std_boc_serialize(init_state).move_as_ok().as_slice().str(),
+                                  vm::std_boc_serialize(init_message).move_as_ok().as_slice().str()),
+      std::move(promise));
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::testWallet_sendGrams& request,
+                                    td::Promise<object_ptr<tonlib_api::ok>>&& promise) {
+  if (!request.destination_) {
+    return td::Status::Error(400, "Field destination must not be empty");
+  }
+  if (!request.private_key_) {
+    return td::Status::Error(400, "Field private_key must not be empty");
+  }
+  TRY_RESULT(account_address, block::StdAddress::parse(request.destination_->account_address_));
+  account_address.bounceable = false;
+  TRY_RESULT(input_key, from_tonlib(*request.private_key_));
+  auto address = GenericAccount::get_address(
+      0 /*zerochain*/, TestWallet::get_init_state(td::Ed25519::PublicKey(input_key.key.public_key.copy())));
+  TRY_RESULT(private_key, key_storage_.load_private_key(std::move(input_key)));
+  return do_request(
+      tonlib_api::raw_sendMessage(tonlib_api::make_object<tonlib_api::accountAddress>(address.rserialize()), "",
+                                  vm::std_boc_serialize(TestWallet::make_a_gift_message(
+                                                            td::Ed25519::PrivateKey(std::move(private_key.private_key)),
+                                                            request.seqno_, request.amount_, account_address))
+                                      .move_as_ok()
+                                      .as_slice()
+                                      .str()),
+      std::move(promise));
+}
+
+td::Status TonlibClient::do_request(tonlib_api::testWallet_getAccountState& request,
+                                    td::Promise<object_ptr<tonlib_api::testWallet_accountState>>&& promise) {
+  if (!request.account_address_) {
+    return td::Status::Error(400, "Field account_address must not be empty");
+  }
+  TRY_RESULT(account_address, block::StdAddress::parse(request.account_address_->account_address_));
+  td::actor::create_actor<GetRawAccountState>(
+      "GetAccountState", client_.get_client(), std::move(account_address),
+      [promise = std::move(promise)](td::Result<RawAccountState> r_state) mutable {
+        if (r_state.is_error()) {
+          return promise.set_error(r_state.move_as_error());
+        }
+        promise.set_result(to_testWallet_accountState(r_state.move_as_ok()));
+      })
+      .release();
+  return td::Status::OK();
+}
+
+// TestGiver
+td::Status TonlibClient::do_request(const tonlib_api::testGiver_sendGrams& request,
+                                    td::Promise<object_ptr<tonlib_api::ok>>&& promise) {
+  if (!request.destination_) {
+    return td::Status::Error(400, "Field destination must not be empty");
+  }
+  TRY_RESULT(account_address, block::StdAddress::parse(request.destination_->account_address_));
+  account_address.bounceable = false;
+  return do_request(
+      tonlib_api::raw_sendMessage(
+          tonlib_api::make_object<tonlib_api::accountAddress>(TestGiver::address().rserialize()), "",
+          vm::std_boc_serialize(TestGiver::make_a_gift_message(request.seqno_, request.amount_, account_address))
+              .move_as_ok()
+              .as_slice()
+              .str()),
+      std::move(promise));
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::testGiver_getAccountState& request,
+                                    td::Promise<object_ptr<tonlib_api::testGiver_accountState>>&& promise) {
+  td::actor::create_actor<GetRawAccountState>(
+      "GetAccountState", client_.get_client(), TestGiver::address(),
+      [promise = std::move(promise)](td::Result<RawAccountState> r_state) mutable {
+        if (r_state.is_error()) {
+          return promise.set_error(r_state.move_as_error());
+        }
+        promise.set_result(to_testGiver_accountState(r_state.move_as_ok()));
+      })
+      .release();
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::generic_getAccountState& request,
+                                    td::Promise<object_ptr<tonlib_api::generic_AccountState>>&& promise) {
+  if (!request.account_address_) {
+    return td::Status::Error(400, "Field account_address must not be empty");
+  }
+  TRY_RESULT(account_address, block::StdAddress::parse(request.account_address_->account_address_));
+  td::actor::create_actor<GetRawAccountState>(
+      "GetAccountState", client_.get_client(), std::move(account_address),
+      [promise = std::move(promise)](td::Result<RawAccountState> r_state) mutable {
+        if (r_state.is_error()) {
+          return promise.set_error(r_state.move_as_error());
+        }
+        promise.set_result(to_generic_accountState(r_state.move_as_ok()));
+      })
+      .release();
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(tonlib_api::generic_sendGrams& request,
+                                    td::Promise<object_ptr<tonlib_api::ok>>&& promise) {
+  TRY_RESULT(account_address, block::StdAddress::parse(request.source_->account_address_));
+  LOG(INFO) << "Send " << request.amount_ << " nanograms from " << account_address.rserialize();
+  td::actor::create_actor<GetRawAccountState>(
+      "GetAccountState", client_.get_client(), std::move(account_address),
+      [promise = std::move(promise), self = this, actor_id = td::actor::actor_id(),
+       private_key = std::move(request.private_key_), destination = std::move(request.destination_),
+       amount = request.amount_](td::Result<RawAccountState> r_state) mutable {
+        if (r_state.is_error()) {
+          return promise.set_error(r_state.move_as_error());
+        }
+        auto rr_state = to_generic_accountState(r_state.move_as_ok());
+        if (rr_state.is_error()) {
+          return promise.set_error(rr_state.move_as_error());
+        }
+        auto state = rr_state.move_as_ok();
+
+        downcast_call(*state,
+                      td::overloaded(
+                          [&](tonlib_api::generic_accountStateTestGiver& test_giver_state) {
+                            send_lambda(actor_id, [promise = std::move(promise), self,
+                                                   query = tonlib_api::testGiver_sendGrams(
+                                                       std::move(destination), test_giver_state.account_state_->seqno_,
+                                                       amount)]() mutable {
+                              LOG(INFO) << "Send " << to_string(query);
+                              auto status = self->do_request(query, std::move(promise));
+                              if (status.is_error()) {
+                                CHECK(promise);
+                                promise.set_error(std::move(status));
+                              }
+                            });
+                            return;
+                          },
+                          [&](tonlib_api::generic_accountStateTestWallet& test_wallet_state) {
+                            send_lambda(actor_id, [promise = std::move(promise), self,
+                                                   query = tonlib_api::testWallet_sendGrams(
+                                                       std::move(private_key), std::move(destination),
+                                                       test_wallet_state.account_state_->seqno_, amount)]() mutable {
+                              auto status = self->do_request(query, std::move(promise));
+                              if (status.is_error()) {
+                                CHECK(promise);
+                                promise.set_error(std::move(status));
+                              }
+                            });
+                          },
+                          [&](tonlib_api::generic_accountStateUninited&) {
+                            promise.set_error(td::Status::Error(400, "Account is not inited"));
+                          },
+                          [&](tonlib_api::generic_accountStateRaw&) {
+                            promise.set_error(td::Status::Error(400, "Unknown account type"));
+                          }));
+      })
+      .release();
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::createNewKey& request,
+                                    td::Promise<object_ptr<tonlib_api::key>>&& promise) {
+  TRY_RESULT(key, key_storage_.create_new_key(std::move(request.local_password_), std::move(request.mnemonic_password_),
+                                              std::move(request.random_extra_seed_)));
+  TRY_RESULT(key_bytes, block::PublicKey::from_bytes(key.public_key.as_slice()));
+  promise.set_value(tonlib_api::make_object<tonlib_api::key>(key_bytes.serialize(), std::move(key.secret)));
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::exportKey& request,
+                                    td::Promise<object_ptr<tonlib_api::exportedKey>>&& promise) {
+  if (!request.input_key_) {
+    return td::Status::Error(400, "Field input_key must not be empty");
+  }
+  TRY_RESULT(input_key, from_tonlib(*request.input_key_));
+  TRY_RESULT(exported_key, key_storage_.export_key(std::move(input_key)));
+  promise.set_value(tonlib_api::make_object<tonlib_api::exportedKey>(std::move(exported_key.mnemonic_words)));
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::deleteKey& request,
+                                    td::Promise<object_ptr<tonlib_api::ok>>&& promise) {
+  TRY_RESULT(key_bytes, block::PublicKey::parse(request.public_key_));
+  TRY_STATUS(key_storage_.delete_key(key_bytes.key));
+  promise.set_value(tonlib_api::make_object<tonlib_api::ok>());
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::importKey& request,
+                                    td::Promise<object_ptr<tonlib_api::key>>&& promise) {
+  if (!request.exported_key_) {
+    return td::Status::Error(400, "Field exported_key must not be empty");
+  }
+  TRY_RESULT(key, key_storage_.import_key(std::move(request.local_password_), std::move(request.mnemonic_password_),
+                                          KeyStorage::ExportedKey{std::move(request.exported_key_->word_list_)}));
+  TRY_RESULT(key_bytes, block::PublicKey::from_bytes(key.public_key.as_slice()));
+  promise.set_value(tonlib_api::make_object<tonlib_api::key>(key_bytes.serialize(), std::move(key.secret)));
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::exportPemKey& request,
+                                    td::Promise<object_ptr<tonlib_api::exportedPemKey>>&& promise) {
+  if (!request.input_key_) {
+    return td::Status::Error(400, "Field input_key must not be empty");
+  }
+  if (!request.input_key_->key_) {
+    return td::Status::Error(400, "Field key must not be empty");
+  }
+
+  TRY_RESULT(key_bytes, block::PublicKey::parse(request.input_key_->key_->public_key_));
+  KeyStorage::InputKey input_key{{td::SecureString(key_bytes.key), std::move(request.input_key_->key_->secret_)},
+                                 std::move(request.input_key_->local_password_)};
+  TRY_RESULT(exported_pem_key, key_storage_.export_pem_key(std::move(input_key), std::move(request.key_password_)));
+  promise.set_value(tonlib_api::make_object<tonlib_api::exportedPemKey>(std::move(exported_pem_key.pem)));
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::importPemKey& request,
+                                    td::Promise<object_ptr<tonlib_api::key>>&& promise) {
+  if (!request.exported_key_) {
+    return td::Status::Error(400, "Field exported_key must not be empty");
+  }
+  TRY_RESULT(key, key_storage_.import_pem_key(std::move(request.local_password_), std::move(request.key_password_),
+                                              KeyStorage::ExportedPemKey{std::move(request.exported_key_->pem_)}));
+  TRY_RESULT(key_bytes, block::PublicKey::from_bytes(key.public_key.as_slice()));
+  promise.set_value(tonlib_api::make_object<tonlib_api::key>(key_bytes.serialize(), std::move(key.secret)));
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::exportEncryptedKey& request,
+                                    td::Promise<object_ptr<tonlib_api::exportedEncryptedKey>>&& promise) {
+  if (!request.input_key_) {
+    return td::Status::Error(400, "Field input_key must not be empty");
+  }
+  TRY_RESULT(input_key, from_tonlib(*request.input_key_));
+  TRY_RESULT(exported_key, key_storage_.export_encrypted_key(std::move(input_key), request.key_password_));
+  promise.set_value(tonlib_api::make_object<tonlib_api::exportedEncryptedKey>(std::move(exported_key.data)));
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::importEncryptedKey& request,
+                                    td::Promise<object_ptr<tonlib_api::key>>&& promise) {
+  if (!request.exported_encrypted_key_) {
+    return td::Status::Error(400, "Field exported_encrypted_key must not be empty");
+  }
+  TRY_RESULT(key, key_storage_.import_encrypted_key(
+                      std::move(request.local_password_), std::move(request.key_password_),
+                      KeyStorage::ExportedEncryptedKey{std::move(request.exported_encrypted_key_->data_)}));
+  TRY_RESULT(key_bytes, block::PublicKey::from_bytes(key.public_key.as_slice()));
+  promise.set_value(tonlib_api::make_object<tonlib_api::key>(key_bytes.serialize(), std::move(key.secret)));
+  return td::Status::OK();
+}
+
+td::Status TonlibClient::do_request(const tonlib_api::changeLocalPassword& request,
+                                    td::Promise<object_ptr<tonlib_api::key>>&& promise) {
+  if (!request.input_key_) {
+    return td::Status::Error(400, "Field input_key must not be empty");
+  }
+  if (!request.input_key_->key_) {
+    return td::Status::Error(400, "Field key must not be empty");
+  }
+  TRY_RESULT(input_key, from_tonlib(*request.input_key_));
+  TRY_RESULT(key, key_storage_.change_local_password(std::move(input_key), std::move(request.new_local_password_)));
+  promise.set_value(
+      tonlib_api::make_object<tonlib_api::key>(request.input_key_->key_->public_key_, std::move(key.secret)));
+  return td::Status::OK();
+}
+
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/TonlibClient.h b/submodules/ton/tonlib-src/tonlib/tonlib/TonlibClient.h
new file mode 100644
index 0000000000..244506c850
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/TonlibClient.h
@@ -0,0 +1,134 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "TonlibCallback.h"
+
+#include "tonlib/Config.h"
+#include "tonlib/ExtClient.h"
+#include "tonlib/KeyStorage.h"
+
+#include "td/actor/actor.h"
+
+namespace tonlib {
+class TonlibClient : public td::actor::Actor {
+ public:
+  template <class T>
+  using object_ptr = tonlib_api::object_ptr<T>;
+
+  explicit TonlibClient(td::unique_ptr<TonlibCallback> callback);
+  void request(td::uint64 id, object_ptr<tonlib_api::Function> function);
+  void close();
+  static object_ptr<tonlib_api::Object> static_request(object_ptr<tonlib_api::Function> function);
+
+  ~TonlibClient();
+
+ private:
+  enum class State { Uninited, Running, Closed } state_ = State::Uninited;
+  td::unique_ptr<TonlibCallback> callback_;
+  Config config_;
+
+  // KeyStorage
+  KeyStorage key_storage_;
+
+  // network
+  td::actor::ActorOwn<ton::adnl::AdnlExtClient> raw_client_;
+  td::actor::ActorOwn<LastBlock> raw_last_block_;
+  ExtClient client_;
+
+  ExtClientRef get_client_ref();
+  void init_ext_client();
+
+  bool is_closing_{false};
+  td::uint32 ref_cnt_{1};
+  void hangup_shared() override {
+    ref_cnt_--;
+    try_stop();
+  }
+  void hangup() override;
+  void try_stop() {
+    if (is_closing_ && ref_cnt_ == 0) {
+      stop();
+    }
+  }
+
+  void on_result(td::uint64 id, object_ptr<tonlib_api::Object> response);
+  static bool is_static_request(td::int32 id);
+  static bool is_uninited_request(td::int32 id);
+  template <class T>
+  static object_ptr<tonlib_api::Object> do_static_request(const T& request) {
+    return tonlib_api::make_object<tonlib_api::error>(400, "Function can't be executed synchronously");
+  }
+  static object_ptr<tonlib_api::Object> do_static_request(const tonlib_api::runTests& request);
+  static object_ptr<tonlib_api::Object> do_static_request(const tonlib_api::raw_getAccountAddress& request);
+  static object_ptr<tonlib_api::Object> do_static_request(const tonlib_api::testWallet_getAccountAddress& request);
+  static object_ptr<tonlib_api::Object> do_static_request(const tonlib_api::testGiver_getAccountAddress& request);
+  static object_ptr<tonlib_api::Object> do_static_request(tonlib_api::getBip39Hints& request);
+  template <class T, class P>
+  td::Status do_request(const T& request, P&& promise) {
+    return td::Status::Error(400, "Function is unsupported");
+  }
+
+  td::Status set_config(std::string config);
+
+  td::Status do_request(const tonlib_api::init& request, td::Promise<object_ptr<tonlib_api::ok>>&& promise);
+  td::Status do_request(const tonlib_api::close& request, td::Promise<object_ptr<tonlib_api::ok>>&& promise);
+  td::Status do_request(const tonlib_api::options_setConfig& request,
+                        td::Promise<object_ptr<tonlib_api::ok>>&& promise);
+
+  td::Status do_request(const tonlib_api::raw_sendMessage& request, td::Promise<object_ptr<tonlib_api::ok>>&& promise);
+  td::Status do_request(tonlib_api::raw_getAccountState& request,
+                        td::Promise<object_ptr<tonlib_api::raw_accountState>>&& promise);
+  td::Status do_request(tonlib_api::raw_getTransactions& request,
+                        td::Promise<object_ptr<tonlib_api::raw_transactions>>&& promise);
+
+  td::Status do_request(const tonlib_api::testWallet_init& request, td::Promise<object_ptr<tonlib_api::ok>>&& promise);
+  td::Status do_request(const tonlib_api::testWallet_sendGrams& request,
+                        td::Promise<object_ptr<tonlib_api::ok>>&& promise);
+  td::Status do_request(tonlib_api::testWallet_getAccountState& request,
+                        td::Promise<object_ptr<tonlib_api::testWallet_accountState>>&& promise);
+
+  td::Status do_request(const tonlib_api::testGiver_getAccountState& request,
+                        td::Promise<object_ptr<tonlib_api::testGiver_accountState>>&& promise);
+  td::Status do_request(const tonlib_api::testGiver_sendGrams& request,
+                        td::Promise<object_ptr<tonlib_api::ok>>&& promise);
+
+  td::Status do_request(const tonlib_api::generic_getAccountState& request,
+                        td::Promise<object_ptr<tonlib_api::generic_AccountState>>&& promise);
+  td::Status do_request(tonlib_api::generic_sendGrams& request, td::Promise<object_ptr<tonlib_api::ok>>&& promise);
+
+  td::Status do_request(const tonlib_api::createNewKey& request, td::Promise<object_ptr<tonlib_api::key>>&& promise);
+  td::Status do_request(const tonlib_api::exportKey& request,
+                        td::Promise<object_ptr<tonlib_api::exportedKey>>&& promise);
+  td::Status do_request(const tonlib_api::deleteKey& request, td::Promise<object_ptr<tonlib_api::ok>>&& promise);
+  td::Status do_request(const tonlib_api::importKey& request, td::Promise<object_ptr<tonlib_api::key>>&& promise);
+
+  td::Status do_request(const tonlib_api::exportPemKey& request,
+                        td::Promise<object_ptr<tonlib_api::exportedPemKey>>&& promise);
+  td::Status do_request(const tonlib_api::importPemKey& request, td::Promise<object_ptr<tonlib_api::key>>&& promise);
+
+  td::Status do_request(const tonlib_api::exportEncryptedKey& request,
+                        td::Promise<object_ptr<tonlib_api::exportedEncryptedKey>>&& promise);
+  td::Status do_request(const tonlib_api::importEncryptedKey& request,
+                        td::Promise<object_ptr<tonlib_api::key>>&& promise);
+
+  td::Status do_request(const tonlib_api::changeLocalPassword& request,
+                        td::Promise<object_ptr<tonlib_api::key>>&& promise);
+};
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/keys/DecryptedKey.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/keys/DecryptedKey.cpp
new file mode 100644
index 0000000000..3161d904c7
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/keys/DecryptedKey.cpp
@@ -0,0 +1,81 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "DecryptedKey.h"
+
+#include "tonlib/keys/EncryptedKey.h"
+#include "tonlib/keys/SimpleEncryption.h"
+
+#include "td/utils/Random.h"
+#include "td/utils/crypto.h"
+
+namespace tonlib {
+DecryptedKey::DecryptedKey(const Mnemonic &mnemonic)
+    : mnemonic_words(mnemonic.get_words()), private_key(mnemonic.to_private_key()) {
+}
+DecryptedKey::DecryptedKey(std::vector<td::SecureString> mnemonic_words, td::Ed25519::PrivateKey key)
+    : mnemonic_words(std::move(mnemonic_words)), private_key(std::move(key)) {
+}
+DecryptedKey::DecryptedKey(RawDecryptedKey key)
+    : DecryptedKey(std::move(key.mnemonic_words), td::Ed25519::PrivateKey(key.private_key.copy())) {
+}
+
+td::SecureString DecryptedKey::change_local_password(td::Slice secret_str, td::Slice old_local_password,
+                                                     td::Slice new_local_password) {
+  CHECK(secret_str.size() == 32);
+  td::SecureString old_local_password_hash(32);
+  sha256(old_local_password, old_local_password_hash.as_mutable_slice());
+  td::SecureString new_local_password_hash(32);
+  sha256(new_local_password, new_local_password_hash.as_mutable_slice());
+
+  td::SecureString new_secret(32);
+  for (size_t i = 0; i < new_secret.size(); i++) {
+    new_secret.as_mutable_slice()[i] =
+        secret_str[i] ^ old_local_password_hash.as_slice()[i] ^ new_local_password_hash.as_slice()[i];
+  }
+  return new_secret;
+}
+
+EncryptedKey DecryptedKey::encrypt(td::Slice local_password, td::Slice old_secret) const {
+  LOG(ERROR) << "encrypt";
+  td::SecureString secret(32);
+  if (old_secret.size() == td::as_slice(secret).size()) {
+    secret.as_mutable_slice().copy_from(old_secret);
+  } else {
+    td::Random::secure_bytes(secret.as_mutable_slice());
+  }
+  td::SecureString local_password_hash(32);
+  sha256(local_password, local_password_hash.as_mutable_slice());
+  td::SecureString decrypted_secret(32);
+  for (size_t i = 0; i < decrypted_secret.size(); i++) {
+    decrypted_secret.as_mutable_slice()[i] = secret.as_slice()[i] ^ local_password_hash.as_slice()[i];
+  }
+
+  td::SecureString encryption_secret(64);
+  pbkdf2_sha512(as_slice(decrypted_secret), "TON local key", PBKDF_ITERATIONS, encryption_secret.as_mutable_slice());
+
+  std::vector<td::SecureString> mnemonic_words_copy;
+  for (auto &w : mnemonic_words) {
+    mnemonic_words_copy.push_back(w.copy());
+  }
+  auto data = td::serialize_secure(RawDecryptedKey{std::move(mnemonic_words_copy), private_key.as_octet_string()});
+  auto encrypted_data = SimpleEncryption::encrypt_data(data, as_slice(encryption_secret));
+
+  return EncryptedKey{std::move(encrypted_data), private_key.get_public_key().move_as_ok(), std::move(secret)};
+}
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/keys/DecryptedKey.h b/submodules/ton/tonlib-src/tonlib/tonlib/keys/DecryptedKey.h
new file mode 100644
index 0000000000..19f60adcdc
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/keys/DecryptedKey.h
@@ -0,0 +1,64 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include <vector>
+#include <string>
+
+#include "td/utils/tl_helpers.h"
+#include "td/utils/SharedSlice.h"
+
+#include "tonlib/keys/Mnemonic.h"
+
+namespace tonlib {
+
+struct RawDecryptedKey {
+  std::vector<td::SecureString> mnemonic_words;
+  td::SecureString private_key;
+
+  template <class StorerT>
+  void store(StorerT &storer) const {
+    using td::store;
+    store(mnemonic_words, storer);
+    store(private_key, storer);
+  }
+
+  template <class ParserT>
+  void parse(ParserT &parser) {
+    using td::parse;
+    parse(mnemonic_words, parser);
+    parse(private_key, parser);
+  }
+};
+
+struct EncryptedKey;
+struct DecryptedKey {
+  DecryptedKey() = default;
+  explicit DecryptedKey(const Mnemonic &mnemonic);
+  DecryptedKey(std::vector<td::SecureString> mnemonic_words, td::Ed25519::PrivateKey key);
+  DecryptedKey(RawDecryptedKey key);
+
+  std::vector<td::SecureString> mnemonic_words;
+  td::Ed25519::PrivateKey private_key;
+
+  static td::SecureString change_local_password(td::Slice secret, td::Slice old_local_password,
+                                                td::Slice new_local_password);
+  EncryptedKey encrypt(td::Slice local_password, td::Slice secret = {}) const;
+};
+
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/keys/EncryptedKey.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/keys/EncryptedKey.cpp
new file mode 100644
index 0000000000..075e89f479
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/keys/EncryptedKey.cpp
@@ -0,0 +1,53 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "EncryptedKey.h"
+
+#include "tonlib/keys/DecryptedKey.h"
+#include "tonlib/keys/SimpleEncryption.h"
+
+#include "td/utils/crypto.h"
+
+namespace tonlib {
+td::Result<DecryptedKey> EncryptedKey::decrypt(td::Slice local_password, bool check_public_key) {
+  LOG(ERROR) << "decrypt";
+  if (secret.size() != 32) {
+    return td::Status::Error("Failed to decrypt key: invalid secret size");
+  }
+  td::SecureString local_password_hash(32);
+  sha256(local_password, local_password_hash.as_mutable_slice());
+  td::SecureString decrypted_secret(32);
+  for (size_t i = 0; i < 32; i++) {
+    decrypted_secret.as_mutable_slice()[i] = secret.as_slice()[i] ^ local_password_hash.as_slice()[i];
+  }
+
+  td::SecureString encryption_secret(64);
+  pbkdf2_sha512(as_slice(decrypted_secret), "TON local key", PBKDF_ITERATIONS, encryption_secret.as_mutable_slice());
+  TRY_RESULT(decrypted_data, SimpleEncryption::decrypt_data(as_slice(encrypted_data), as_slice(encryption_secret)));
+
+  RawDecryptedKey raw_decrypted_key;
+  TRY_STATUS(td::unserialize(raw_decrypted_key, decrypted_data));
+  DecryptedKey res(std::move(raw_decrypted_key));
+  TRY_RESULT(got_public_key, res.private_key.get_public_key());
+  if (check_public_key &&
+      got_public_key.as_octet_string().as_slice() != this->public_key.as_octet_string().as_slice()) {
+    return td::Status::Error("Something wrong: public key of decrypted private key differs from requested public key");
+  }
+  return std::move(res);
+}
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/keys/EncryptedKey.h b/submodules/ton/tonlib-src/tonlib/tonlib/keys/EncryptedKey.h
new file mode 100644
index 0000000000..5a32c9f89f
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/keys/EncryptedKey.h
@@ -0,0 +1,38 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/Status.h"
+
+#include "crypto/Ed25519.h"
+
+#include <string>
+
+namespace tonlib {
+constexpr int PBKDF_ITERATIONS = 100000;
+struct DecryptedKey;
+struct EncryptedKey {
+  td::SecureString encrypted_data;
+  td::Ed25519::PublicKey public_key;
+  td::SecureString secret;
+
+  td::Result<DecryptedKey> decrypt(td::Slice local_password, bool check_public_key = true);
+};
+
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/keys/Mnemonic.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/keys/Mnemonic.cpp
new file mode 100644
index 0000000000..9cddd862cc
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/keys/Mnemonic.cpp
@@ -0,0 +1,226 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "Mnemonic.h"
+
+#include "tonlib/keys/bip39.h"
+
+#include <vector>
+
+#include "td/utils/crypto.h"
+#include "td/utils/format.h"
+#include "td/utils/Random.h"
+#include "td/utils/Span.h"
+#include "td/utils/misc.h"
+#include "td/utils/optional.h"
+#include "td/utils/Timer.h"
+
+#include "crypto/Ed25519.h"
+
+#include <algorithm>
+
+namespace tonlib {
+td::Result<Mnemonic> Mnemonic::create(td::SecureString words, td::SecureString password) {
+  return create_from_normalized(normalize_and_split(std::move(words)), std::move(password));
+}
+td::Result<Mnemonic> Mnemonic::create(std::vector<td::SecureString> words, td::SecureString password) {
+  return create(join(words), std::move(password));
+}
+td::Result<Mnemonic> Mnemonic::create_from_normalized(std::vector<td::SecureString> words, td::SecureString password) {
+  auto new_words = normalize_and_split(join(words));
+  if (new_words != words) {
+    return td::Status::Error("Mnemonic string is not normalized");
+  }
+  return Mnemonic(std::move(words), std::move(password));
+}
+
+td::SecureString Mnemonic::to_entropy() const {
+  td::SecureString res(64);
+  td::hmac_sha512(join(words_), password_, res.as_mutable_slice());
+  return res;
+}
+
+td::SecureString Mnemonic::to_seed() const {
+  td::SecureString hash(64);
+  td::pbkdf2_sha512(as_slice(to_entropy()), "TON default seed", PBKDF_ITERATIONS, hash.as_mutable_slice());
+  return hash;
+}
+
+td::Ed25519::PrivateKey Mnemonic::to_private_key() const {
+  return td::Ed25519::PrivateKey(td::SecureString(as_slice(to_seed()).substr(0, td::Ed25519::PrivateKey::LENGTH)));
+}
+
+bool Mnemonic::is_basic_seed() {
+  td::SecureString hash(64);
+  td::pbkdf2_sha512(as_slice(to_entropy()), "TON seed version", td::max(1, PBKDF_ITERATIONS / 256),
+                    hash.as_mutable_slice());
+  return hash.as_slice()[0] == 0;
+}
+
+bool Mnemonic::is_password_seed() {
+  td::SecureString hash(64);
+  td::pbkdf2_sha512(as_slice(to_entropy()), "TON fast seed version", 1, hash.as_mutable_slice());
+  return hash.as_slice()[0] == 1;
+}
+
+std::vector<td::SecureString> Mnemonic::get_words() const {
+  std::vector<td::SecureString> res;
+  for (auto &word : words_) {
+    res.push_back(word.copy());
+  }
+  return res;
+}
+
+std::vector<td::SecureString> Mnemonic::normalize_and_split(td::SecureString words) {
+  for (auto &c : words.as_mutable_slice()) {
+    if (td::is_alpha(c)) {
+      c = td::to_lower(c);
+    } else {
+      c = ' ';
+    }
+  }
+  auto vec = td::full_split(words.as_slice(), ' ');
+  std::vector<td::SecureString> res;
+  for (auto &s : vec) {
+    if (!s.empty()) {
+      res.push_back(td::SecureString(s));
+    }
+  }
+  return res;
+}
+
+td::StringBuilder &operator<<(td::StringBuilder &sb, const Mnemonic &mnemonic) {
+  sb << "Mnemonic" << td::format::as_array(mnemonic.words_);
+  if (!mnemonic.password_.empty()) {
+    sb << " with password[" << mnemonic.password_ << "]";
+  }
+  return sb;
+}
+
+Mnemonic::Mnemonic(std::vector<td::SecureString> words, td::SecureString password)
+    : words_(std::move(words)), password_(std::move(password)) {
+}
+td::SecureString Mnemonic::join(td::Span<td::SecureString> words) {
+  size_t res_size = 0;
+  for (size_t i = 0; i < words.size(); i++) {
+    if (i != 0) {
+      res_size++;
+    }
+    res_size += words[i].size();
+  }
+  td::SecureString res(res_size);
+  auto dst = res.as_mutable_slice();
+  for (size_t i = 0; i < words.size(); i++) {
+    if (i != 0) {
+      dst[0] = ' ';
+      dst.remove_prefix(1);
+    }
+    dst.copy_from(words[i].as_slice());
+    dst.remove_prefix(words[i].size());
+  }
+  return res;
+}
+
+td::Span<std::string> Mnemonic::word_hints(td::Slice prefix) {
+  static std::vector<std::string> words = [] {
+    auto bip_words = Mnemonic::normalize_and_split(td::SecureString(bip39_english()));
+    std::vector<std::string> res;
+    for (auto &word : bip_words) {
+      res.push_back(word.as_slice().str());
+    }
+    return res;
+  }();
+  if (prefix.empty()) {
+    return words;
+  }
+
+  auto p = std::equal_range(words.begin(), words.end(), prefix, [&](td::Slice a, td::Slice b) {
+    return a.truncate(prefix.size()) < b.truncate(prefix.size());
+  });
+
+  return td::Span<std::string>(&*p.first, p.second - p.first);
+}
+
+td::Result<Mnemonic> Mnemonic::create_new(Options options) {
+  td::Timer timer;
+  if (options.words_count == 0) {
+    options.words_count = 24;
+  }
+  if (options.words_count < 8 || options.words_count > 48) {
+    return td::Status::Error(PSLICE() << "Invalid words count(" << options.words_count
+                                      << ") requested for mnemonic creation");
+  }
+  td::int32 max_iterations = 256 * 20;
+  if (!options.password.empty()) {
+    max_iterations *= 256;
+  }
+
+  td::Random::add_seed(options.entropy.as_slice());
+  SCOPE_EXIT {
+    td::Random::secure_cleanup();
+  };
+
+  auto bip_words = Mnemonic::normalize_and_split(td::SecureString(bip39_english()));
+  CHECK(bip_words.size() == 2048);
+
+  int A = 0, B = 0, C = 0;
+  for (int iteration = 0; iteration < max_iterations; iteration++) {
+    std::vector<td::SecureString> words;
+    td::SecureString rnd((options.words_count * 11 + 7) / 8);
+    td::Random::secure_bytes(rnd.as_mutable_slice());
+    for (int i = 0; i < options.words_count; i++) {
+      size_t word_i = 0;
+      for (size_t j = 0; j < 11; j++) {
+        size_t offset = i * 11 + j;
+        if ((rnd[offset / 8] & (1 << (offset & 7))) != 0) {
+          word_i |= 1 << j;
+        }
+      }
+      words.push_back(bip_words[word_i].copy());
+    }
+
+    bool has_password = !options.password.empty();
+
+    td::optional<Mnemonic> mnemonic_without_password;
+    if (has_password) {
+      auto copy_words = td::transform(words, [](auto &w) { return w.copy(); });
+      mnemonic_without_password = Mnemonic::create(std::move(copy_words), {}).move_as_ok();
+      if (!mnemonic_without_password.value().is_password_seed()) {
+        A++;
+        continue;
+      }
+    }
+
+    auto mnemonic = Mnemonic::create(std::move(words), options.password.copy()).move_as_ok();
+
+    if (!mnemonic.is_basic_seed()) {
+      B++;
+      continue;
+    }
+
+    if (has_password && mnemonic_without_password.value().is_basic_seed()) {
+      C++;
+      continue;
+    }
+
+    LOG(INFO) << "Mnemonic generation debug stats: " << A << " " << B << " " << C << " " << timer;
+    return std::move(mnemonic);
+  }
+  return td::Status::Error("Failed to create a mnemonic (should not happen)");
+}
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/keys/Mnemonic.h b/submodules/ton/tonlib-src/tonlib/tonlib/keys/Mnemonic.h
new file mode 100644
index 0000000000..27d6a8337b
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/keys/Mnemonic.h
@@ -0,0 +1,67 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "crypto/Ed25519.h"
+
+#include "td/utils/int_types.h"
+#include "td/utils/Span.h"
+#include "td/utils/Status.h"
+#include "td/utils/UInt.h"
+
+namespace tonlib {
+class Mnemonic {
+ public:
+  static constexpr int PBKDF_ITERATIONS = 100000;
+  static td::Result<Mnemonic> create(td::SecureString words, td::SecureString password);
+  static td::Result<Mnemonic> create(std::vector<td::SecureString> words, td::SecureString password);
+  struct Options {
+    Options() {
+    }
+    int words_count = 24;
+    td::SecureString password;
+    td::SecureString entropy;
+  };
+  static td::Result<Mnemonic> create_new(Options options = {});
+
+  td::SecureString to_entropy() const;
+
+  td::SecureString to_seed() const;
+
+  td::Ed25519::PrivateKey to_private_key() const;
+
+  bool is_basic_seed();
+  bool is_password_seed();
+
+  std::vector<td::SecureString> get_words() const;
+
+  static std::vector<td::SecureString> normalize_and_split(td::SecureString words);
+  static td::Span<std::string> word_hints(td::Slice prefix);
+
+ private:
+  std::vector<td::SecureString> words_;
+  td::SecureString password_;
+
+  Mnemonic(std::vector<td::SecureString> words, td::SecureString password);
+  static td::SecureString join(td::Span<td::SecureString> words);
+  static td::Result<Mnemonic> create_from_normalized(std::vector<td::SecureString> words, td::SecureString password);
+  friend td::StringBuilder &operator<<(td::StringBuilder &sb, const Mnemonic &mnemonic);
+};
+
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/keys/SimpleEncryption.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/keys/SimpleEncryption.cpp
new file mode 100644
index 0000000000..760dda36b9
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/keys/SimpleEncryption.cpp
@@ -0,0 +1,101 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "SimpleEncryption.h"
+
+#include "td/utils/Random.h"
+#include "td/utils/SharedSlice.h"
+
+namespace tonlib {
+td::AesCbcState SimpleEncryption::calc_aes_cbc_state_hash(td::Slice hash) {
+  CHECK(hash.size() == 64);
+  td::SecureString key(32);
+  key.as_mutable_slice().copy_from(hash.substr(0, 32));
+  td::SecureString iv(16);
+  iv.as_mutable_slice().copy_from(hash.substr(32, 16));
+  return td::AesCbcState{key, iv};
+}
+
+td::AesCbcState SimpleEncryption::calc_aes_cbc_state_sha512(td::Slice seed) {
+  td::SecureString hash(64);
+  sha512(seed, hash.as_mutable_slice());
+  return calc_aes_cbc_state_hash(hash.as_slice());
+}
+td::SecureString SimpleEncryption::gen_random_prefix(td::int64 data_size) {
+  td::SecureString buff(td::narrow_cast<size_t>(((32 + 15 + data_size) & -16) - data_size), 0);
+  td::Random::secure_bytes(buff.as_mutable_slice());
+  buff.as_mutable_slice()[0] = td::narrow_cast<td::uint8>(buff.size());
+  CHECK((buff.size() + data_size) % 16 == 0);
+  return buff;
+}
+
+td::SecureString SimpleEncryption::combine_secrets(td::Slice a, td::Slice b) {
+  td::SecureString res(64, 0);
+  hmac_sha512(a, b, res.as_mutable_slice());
+  return res;
+}
+
+td::SecureString SimpleEncryption::encrypt_data_with_prefix(td::Slice data, td::Slice secret) {
+  CHECK(data.size() % 16 == 0);
+  auto data_hash = sha256(data);
+
+  td::SecureString res_buf(data.size() + 32, 0);
+  auto res = res_buf.as_mutable_slice();
+  res.copy_from(data_hash);
+
+  auto cbc_state = calc_aes_cbc_state_hash(combine_secrets(data_hash, secret));
+  cbc_state.encrypt(data, res.substr(32));
+
+  return res_buf;
+}
+
+td::SecureString SimpleEncryption::encrypt_data(td::Slice data, td::Slice secret) {
+  auto prefix = gen_random_prefix(data.size());
+  td::SecureString combined(prefix.size() + data.size());
+  combined.as_mutable_slice().copy_from(prefix);
+  combined.as_mutable_slice().substr(prefix.size()).copy_from(data);
+  return encrypt_data_with_prefix(combined.as_slice(), secret);
+}
+
+td::Result<td::SecureString> SimpleEncryption::decrypt_data(td::Slice encrypted_data, td::Slice secret) {
+  if (encrypted_data.size() < 33) {
+    return td::Status::Error("Failed to decrypt: data is too small");
+  }
+  if (encrypted_data.size() % 16 != 0) {
+    return td::Status::Error("Failed to decrypt: data size is not divisible by 32");
+  }
+  auto data_hash = encrypted_data.substr(0, 32);
+  encrypted_data = encrypted_data.substr(32);
+
+  auto cbc_state = calc_aes_cbc_state_hash(combine_secrets(data_hash, secret));
+  td::SecureString decrypted_data(encrypted_data.size(), 0);
+  cbc_state.decrypt(encrypted_data, decrypted_data.as_mutable_slice());
+
+  // check hash
+  if (data_hash != td::sha256(decrypted_data)) {
+    return td::Status::Error("Failed to decrypt: hash mismatch");
+  }
+
+  td::uint8 prefix_size = static_cast<td::uint8>(decrypted_data[0]);
+  if (prefix_size > decrypted_data.size() || prefix_size < 32) {
+    return td::Status::Error("Failed to decrypt: invalid prefix size");
+  }
+
+  return td::SecureString(decrypted_data.as_slice().substr(prefix_size));
+}
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/keys/SimpleEncryption.h b/submodules/ton/tonlib-src/tonlib/tonlib/keys/SimpleEncryption.h
new file mode 100644
index 0000000000..981925b2c9
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/keys/SimpleEncryption.h
@@ -0,0 +1,39 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+
+#include "td/utils/crypto.h"
+#include "td/utils/Slice.h"
+#include "td/utils/SharedSlice.h"
+
+namespace tonlib {
+class SimpleEncryption {
+ public:
+  static td::SecureString encrypt_data(td::Slice data, td::Slice secret);
+  static td::Result<td::SecureString> decrypt_data(td::Slice encrypted_data, td::Slice secret);
+
+ private:
+  static td::AesCbcState calc_aes_cbc_state_hash(td::Slice hash);
+  static td::AesCbcState calc_aes_cbc_state_sha512(td::Slice seed);
+  static td::SecureString gen_random_prefix(td::int64 data_size);
+
+  static td::SecureString combine_secrets(td::Slice a, td::Slice b);
+  static td::SecureString encrypt_data_with_prefix(td::Slice data, td::Slice secret);
+};
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/keys/bip39.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/keys/bip39.cpp
new file mode 100644
index 0000000000..bbd6fa22d0
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/keys/bip39.cpp
@@ -0,0 +1,2072 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tonlib/keys/bip39.h"
+namespace tonlib {
+td::CSlice bip39_english() {
+  return R"abcd(abandon
+ability
+able
+about
+above
+absent
+absorb
+abstract
+absurd
+abuse
+access
+accident
+account
+accuse
+achieve
+acid
+acoustic
+acquire
+across
+act
+action
+actor
+actress
+actual
+adapt
+add
+addict
+address
+adjust
+admit
+adult
+advance
+advice
+aerobic
+affair
+afford
+afraid
+again
+age
+agent
+agree
+ahead
+aim
+air
+airport
+aisle
+alarm
+album
+alcohol
+alert
+alien
+all
+alley
+allow
+almost
+alone
+alpha
+already
+also
+alter
+always
+amateur
+amazing
+among
+amount
+amused
+analyst
+anchor
+ancient
+anger
+angle
+angry
+animal
+ankle
+announce
+annual
+another
+answer
+antenna
+antique
+anxiety
+any
+apart
+apology
+appear
+apple
+approve
+april
+arch
+arctic
+area
+arena
+argue
+arm
+armed
+armor
+army
+around
+arrange
+arrest
+arrive
+arrow
+art
+artefact
+artist
+artwork
+ask
+aspect
+assault
+asset
+assist
+assume
+asthma
+athlete
+atom
+attack
+attend
+attitude
+attract
+auction
+audit
+august
+aunt
+author
+auto
+autumn
+average
+avocado
+avoid
+awake
+aware
+away
+awesome
+awful
+awkward
+axis
+baby
+bachelor
+bacon
+badge
+bag
+balance
+balcony
+ball
+bamboo
+banana
+banner
+bar
+barely
+bargain
+barrel
+base
+basic
+basket
+battle
+beach
+bean
+beauty
+because
+become
+beef
+before
+begin
+behave
+behind
+believe
+below
+belt
+bench
+benefit
+best
+betray
+better
+between
+beyond
+bicycle
+bid
+bike
+bind
+biology
+bird
+birth
+bitter
+black
+blade
+blame
+blanket
+blast
+bleak
+bless
+blind
+blood
+blossom
+blouse
+blue
+blur
+blush
+board
+boat
+body
+boil
+bomb
+bone
+bonus
+book
+boost
+border
+boring
+borrow
+boss
+bottom
+bounce
+box
+boy
+bracket
+brain
+brand
+brass
+brave
+bread
+breeze
+brick
+bridge
+brief
+bright
+bring
+brisk
+broccoli
+broken
+bronze
+broom
+brother
+brown
+brush
+bubble
+buddy
+budget
+buffalo
+build
+bulb
+bulk
+bullet
+bundle
+bunker
+burden
+burger
+burst
+bus
+business
+busy
+butter
+buyer
+buzz
+cabbage
+cabin
+cable
+cactus
+cage
+cake
+call
+calm
+camera
+camp
+can
+canal
+cancel
+candy
+cannon
+canoe
+canvas
+canyon
+capable
+capital
+captain
+car
+carbon
+card
+cargo
+carpet
+carry
+cart
+case
+cash
+casino
+castle
+casual
+cat
+catalog
+catch
+category
+cattle
+caught
+cause
+caution
+cave
+ceiling
+celery
+cement
+census
+century
+cereal
+certain
+chair
+chalk
+champion
+change
+chaos
+chapter
+charge
+chase
+chat
+cheap
+check
+cheese
+chef
+cherry
+chest
+chicken
+chief
+child
+chimney
+choice
+choose
+chronic
+chuckle
+chunk
+churn
+cigar
+cinnamon
+circle
+citizen
+city
+civil
+claim
+clap
+clarify
+claw
+clay
+clean
+clerk
+clever
+click
+client
+cliff
+climb
+clinic
+clip
+clock
+clog
+close
+cloth
+cloud
+clown
+club
+clump
+cluster
+clutch
+coach
+coast
+coconut
+code
+coffee
+coil
+coin
+collect
+color
+column
+combine
+come
+comfort
+comic
+common
+company
+concert
+conduct
+confirm
+congress
+connect
+consider
+control
+convince
+cook
+cool
+copper
+copy
+coral
+core
+corn
+correct
+cost
+cotton
+couch
+country
+couple
+course
+cousin
+cover
+coyote
+crack
+cradle
+craft
+cram
+crane
+crash
+crater
+crawl
+crazy
+cream
+credit
+creek
+crew
+cricket
+crime
+crisp
+critic
+crop
+cross
+crouch
+crowd
+crucial
+cruel
+cruise
+crumble
+crunch
+crush
+cry
+crystal
+cube
+culture
+cup
+cupboard
+curious
+current
+curtain
+curve
+cushion
+custom
+cute
+cycle
+dad
+damage
+damp
+dance
+danger
+daring
+dash
+daughter
+dawn
+day
+deal
+debate
+debris
+decade
+december
+decide
+decline
+decorate
+decrease
+deer
+defense
+define
+defy
+degree
+delay
+deliver
+demand
+demise
+denial
+dentist
+deny
+depart
+depend
+deposit
+depth
+deputy
+derive
+describe
+desert
+design
+desk
+despair
+destroy
+detail
+detect
+develop
+device
+devote
+diagram
+dial
+diamond
+diary
+dice
+diesel
+diet
+differ
+digital
+dignity
+dilemma
+dinner
+dinosaur
+direct
+dirt
+disagree
+discover
+disease
+dish
+dismiss
+disorder
+display
+distance
+divert
+divide
+divorce
+dizzy
+doctor
+document
+dog
+doll
+dolphin
+domain
+donate
+donkey
+donor
+door
+dose
+double
+dove
+draft
+dragon
+drama
+drastic
+draw
+dream
+dress
+drift
+drill
+drink
+drip
+drive
+drop
+drum
+dry
+duck
+dumb
+dune
+during
+dust
+dutch
+duty
+dwarf
+dynamic
+eager
+eagle
+early
+earn
+earth
+easily
+east
+easy
+echo
+ecology
+economy
+edge
+edit
+educate
+effort
+egg
+eight
+either
+elbow
+elder
+electric
+elegant
+element
+elephant
+elevator
+elite
+else
+embark
+embody
+embrace
+emerge
+emotion
+employ
+empower
+empty
+enable
+enact
+end
+endless
+endorse
+enemy
+energy
+enforce
+engage
+engine
+enhance
+enjoy
+enlist
+enough
+enrich
+enroll
+ensure
+enter
+entire
+entry
+envelope
+episode
+equal
+equip
+era
+erase
+erode
+erosion
+error
+erupt
+escape
+essay
+essence
+estate
+eternal
+ethics
+evidence
+evil
+evoke
+evolve
+exact
+example
+excess
+exchange
+excite
+exclude
+excuse
+execute
+exercise
+exhaust
+exhibit
+exile
+exist
+exit
+exotic
+expand
+expect
+expire
+explain
+expose
+express
+extend
+extra
+eye
+eyebrow
+fabric
+face
+faculty
+fade
+faint
+faith
+fall
+false
+fame
+family
+famous
+fan
+fancy
+fantasy
+farm
+fashion
+fat
+fatal
+father
+fatigue
+fault
+favorite
+feature
+february
+federal
+fee
+feed
+feel
+female
+fence
+festival
+fetch
+fever
+few
+fiber
+fiction
+field
+figure
+file
+film
+filter
+final
+find
+fine
+finger
+finish
+fire
+firm
+first
+fiscal
+fish
+fit
+fitness
+fix
+flag
+flame
+flash
+flat
+flavor
+flee
+flight
+flip
+float
+flock
+floor
+flower
+fluid
+flush
+fly
+foam
+focus
+fog
+foil
+fold
+follow
+food
+foot
+force
+forest
+forget
+fork
+fortune
+forum
+forward
+fossil
+foster
+found
+fox
+fragile
+frame
+frequent
+fresh
+friend
+fringe
+frog
+front
+frost
+frown
+frozen
+fruit
+fuel
+fun
+funny
+furnace
+fury
+future
+gadget
+gain
+galaxy
+gallery
+game
+gap
+garage
+garbage
+garden
+garlic
+garment
+gas
+gasp
+gate
+gather
+gauge
+gaze
+general
+genius
+genre
+gentle
+genuine
+gesture
+ghost
+giant
+gift
+giggle
+ginger
+giraffe
+girl
+give
+glad
+glance
+glare
+glass
+glide
+glimpse
+globe
+gloom
+glory
+glove
+glow
+glue
+goat
+goddess
+gold
+good
+goose
+gorilla
+gospel
+gossip
+govern
+gown
+grab
+grace
+grain
+grant
+grape
+grass
+gravity
+great
+green
+grid
+grief
+grit
+grocery
+group
+grow
+grunt
+guard
+guess
+guide
+guilt
+guitar
+gun
+gym
+habit
+hair
+half
+hammer
+hamster
+hand
+happy
+harbor
+hard
+harsh
+harvest
+hat
+have
+hawk
+hazard
+head
+health
+heart
+heavy
+hedgehog
+height
+hello
+helmet
+help
+hen
+hero
+hidden
+high
+hill
+hint
+hip
+hire
+history
+hobby
+hockey
+hold
+hole
+holiday
+hollow
+home
+honey
+hood
+hope
+horn
+horror
+horse
+hospital
+host
+hotel
+hour
+hover
+hub
+huge
+human
+humble
+humor
+hundred
+hungry
+hunt
+hurdle
+hurry
+hurt
+husband
+hybrid
+ice
+icon
+idea
+identify
+idle
+ignore
+ill
+illegal
+illness
+image
+imitate
+immense
+immune
+impact
+impose
+improve
+impulse
+inch
+include
+income
+increase
+index
+indicate
+indoor
+industry
+infant
+inflict
+inform
+inhale
+inherit
+initial
+inject
+injury
+inmate
+inner
+innocent
+input
+inquiry
+insane
+insect
+inside
+inspire
+install
+intact
+interest
+into
+invest
+invite
+involve
+iron
+island
+isolate
+issue
+item
+ivory
+jacket
+jaguar
+jar
+jazz
+jealous
+jeans
+jelly
+jewel
+job
+join
+joke
+journey
+joy
+judge
+juice
+jump
+jungle
+junior
+junk
+just
+kangaroo
+keen
+keep
+ketchup
+key
+kick
+kid
+kidney
+kind
+kingdom
+kiss
+kit
+kitchen
+kite
+kitten
+kiwi
+knee
+knife
+knock
+know
+lab
+label
+labor
+ladder
+lady
+lake
+lamp
+language
+laptop
+large
+later
+latin
+laugh
+laundry
+lava
+law
+lawn
+lawsuit
+layer
+lazy
+leader
+leaf
+learn
+leave
+lecture
+left
+leg
+legal
+legend
+leisure
+lemon
+lend
+length
+lens
+leopard
+lesson
+letter
+level
+liar
+liberty
+library
+license
+life
+lift
+light
+like
+limb
+limit
+link
+lion
+liquid
+list
+little
+live
+lizard
+load
+loan
+lobster
+local
+lock
+logic
+lonely
+long
+loop
+lottery
+loud
+lounge
+love
+loyal
+lucky
+luggage
+lumber
+lunar
+lunch
+luxury
+lyrics
+machine
+mad
+magic
+magnet
+maid
+mail
+main
+major
+make
+mammal
+man
+manage
+mandate
+mango
+mansion
+manual
+maple
+marble
+march
+margin
+marine
+market
+marriage
+mask
+mass
+master
+match
+material
+math
+matrix
+matter
+maximum
+maze
+meadow
+mean
+measure
+meat
+mechanic
+medal
+media
+melody
+melt
+member
+memory
+mention
+menu
+mercy
+merge
+merit
+merry
+mesh
+message
+metal
+method
+middle
+midnight
+milk
+million
+mimic
+mind
+minimum
+minor
+minute
+miracle
+mirror
+misery
+miss
+mistake
+mix
+mixed
+mixture
+mobile
+model
+modify
+mom
+moment
+monitor
+monkey
+monster
+month
+moon
+moral
+more
+morning
+mosquito
+mother
+motion
+motor
+mountain
+mouse
+move
+movie
+much
+muffin
+mule
+multiply
+muscle
+museum
+mushroom
+music
+must
+mutual
+myself
+mystery
+myth
+naive
+name
+napkin
+narrow
+nasty
+nation
+nature
+near
+neck
+need
+negative
+neglect
+neither
+nephew
+nerve
+nest
+net
+network
+neutral
+never
+news
+next
+nice
+night
+noble
+noise
+nominee
+noodle
+normal
+north
+nose
+notable
+note
+nothing
+notice
+novel
+now
+nuclear
+number
+nurse
+nut
+oak
+obey
+object
+oblige
+obscure
+observe
+obtain
+obvious
+occur
+ocean
+october
+odor
+off
+offer
+office
+often
+oil
+okay
+old
+olive
+olympic
+omit
+once
+one
+onion
+online
+only
+open
+opera
+opinion
+oppose
+option
+orange
+orbit
+orchard
+order
+ordinary
+organ
+orient
+original
+orphan
+ostrich
+other
+outdoor
+outer
+output
+outside
+oval
+oven
+over
+own
+owner
+oxygen
+oyster
+ozone
+pact
+paddle
+page
+pair
+palace
+palm
+panda
+panel
+panic
+panther
+paper
+parade
+parent
+park
+parrot
+party
+pass
+patch
+path
+patient
+patrol
+pattern
+pause
+pave
+payment
+peace
+peanut
+pear
+peasant
+pelican
+pen
+penalty
+pencil
+people
+pepper
+perfect
+permit
+person
+pet
+phone
+photo
+phrase
+physical
+piano
+picnic
+picture
+piece
+pig
+pigeon
+pill
+pilot
+pink
+pioneer
+pipe
+pistol
+pitch
+pizza
+place
+planet
+plastic
+plate
+play
+please
+pledge
+pluck
+plug
+plunge
+poem
+poet
+point
+polar
+pole
+police
+pond
+pony
+pool
+popular
+portion
+position
+possible
+post
+potato
+pottery
+poverty
+powder
+power
+practice
+praise
+predict
+prefer
+prepare
+present
+pretty
+prevent
+price
+pride
+primary
+print
+priority
+prison
+private
+prize
+problem
+process
+produce
+profit
+program
+project
+promote
+proof
+property
+prosper
+protect
+proud
+provide
+public
+pudding
+pull
+pulp
+pulse
+pumpkin
+punch
+pupil
+puppy
+purchase
+purity
+purpose
+purse
+push
+put
+puzzle
+pyramid
+quality
+quantum
+quarter
+question
+quick
+quit
+quiz
+quote
+rabbit
+raccoon
+race
+rack
+radar
+radio
+rail
+rain
+raise
+rally
+ramp
+ranch
+random
+range
+rapid
+rare
+rate
+rather
+raven
+raw
+razor
+ready
+real
+reason
+rebel
+rebuild
+recall
+receive
+recipe
+record
+recycle
+reduce
+reflect
+reform
+refuse
+region
+regret
+regular
+reject
+relax
+release
+relief
+rely
+remain
+remember
+remind
+remove
+render
+renew
+rent
+reopen
+repair
+repeat
+replace
+report
+require
+rescue
+resemble
+resist
+resource
+response
+result
+retire
+retreat
+return
+reunion
+reveal
+review
+reward
+rhythm
+rib
+ribbon
+rice
+rich
+ride
+ridge
+rifle
+right
+rigid
+ring
+riot
+ripple
+risk
+ritual
+rival
+river
+road
+roast
+robot
+robust
+rocket
+romance
+roof
+rookie
+room
+rose
+rotate
+rough
+round
+route
+royal
+rubber
+rude
+rug
+rule
+run
+runway
+rural
+sad
+saddle
+sadness
+safe
+sail
+salad
+salmon
+salon
+salt
+salute
+same
+sample
+sand
+satisfy
+satoshi
+sauce
+sausage
+save
+say
+scale
+scan
+scare
+scatter
+scene
+scheme
+school
+science
+scissors
+scorpion
+scout
+scrap
+screen
+script
+scrub
+sea
+search
+season
+seat
+second
+secret
+section
+security
+seed
+seek
+segment
+select
+sell
+seminar
+senior
+sense
+sentence
+series
+service
+session
+settle
+setup
+seven
+shadow
+shaft
+shallow
+share
+shed
+shell
+sheriff
+shield
+shift
+shine
+ship
+shiver
+shock
+shoe
+shoot
+shop
+short
+shoulder
+shove
+shrimp
+shrug
+shuffle
+shy
+sibling
+sick
+side
+siege
+sight
+sign
+silent
+silk
+silly
+silver
+similar
+simple
+since
+sing
+siren
+sister
+situate
+six
+size
+skate
+sketch
+ski
+skill
+skin
+skirt
+skull
+slab
+slam
+sleep
+slender
+slice
+slide
+slight
+slim
+slogan
+slot
+slow
+slush
+small
+smart
+smile
+smoke
+smooth
+snack
+snake
+snap
+sniff
+snow
+soap
+soccer
+social
+sock
+soda
+soft
+solar
+soldier
+solid
+solution
+solve
+someone
+song
+soon
+sorry
+sort
+soul
+sound
+soup
+source
+south
+space
+spare
+spatial
+spawn
+speak
+special
+speed
+spell
+spend
+sphere
+spice
+spider
+spike
+spin
+spirit
+split
+spoil
+sponsor
+spoon
+sport
+spot
+spray
+spread
+spring
+spy
+square
+squeeze
+squirrel
+stable
+stadium
+staff
+stage
+stairs
+stamp
+stand
+start
+state
+stay
+steak
+steel
+stem
+step
+stereo
+stick
+still
+sting
+stock
+stomach
+stone
+stool
+story
+stove
+strategy
+street
+strike
+strong
+struggle
+student
+stuff
+stumble
+style
+subject
+submit
+subway
+success
+such
+sudden
+suffer
+sugar
+suggest
+suit
+summer
+sun
+sunny
+sunset
+super
+supply
+supreme
+sure
+surface
+surge
+surprise
+surround
+survey
+suspect
+sustain
+swallow
+swamp
+swap
+swarm
+swear
+sweet
+swift
+swim
+swing
+switch
+sword
+symbol
+symptom
+syrup
+system
+table
+tackle
+tag
+tail
+talent
+talk
+tank
+tape
+target
+task
+taste
+tattoo
+taxi
+teach
+team
+tell
+ten
+tenant
+tennis
+tent
+term
+test
+text
+thank
+that
+theme
+then
+theory
+there
+they
+thing
+this
+thought
+three
+thrive
+throw
+thumb
+thunder
+ticket
+tide
+tiger
+tilt
+timber
+time
+tiny
+tip
+tired
+tissue
+title
+toast
+tobacco
+today
+toddler
+toe
+together
+toilet
+token
+tomato
+tomorrow
+tone
+tongue
+tonight
+tool
+tooth
+top
+topic
+topple
+torch
+tornado
+tortoise
+toss
+total
+tourist
+toward
+tower
+town
+toy
+track
+trade
+traffic
+tragic
+train
+transfer
+trap
+trash
+travel
+tray
+treat
+tree
+trend
+trial
+tribe
+trick
+trigger
+trim
+trip
+trophy
+trouble
+truck
+true
+truly
+trumpet
+trust
+truth
+try
+tube
+tuition
+tumble
+tuna
+tunnel
+turkey
+turn
+turtle
+twelve
+twenty
+twice
+twin
+twist
+two
+type
+typical
+ugly
+umbrella
+unable
+unaware
+uncle
+uncover
+under
+undo
+unfair
+unfold
+unhappy
+uniform
+unique
+unit
+universe
+unknown
+unlock
+until
+unusual
+unveil
+update
+upgrade
+uphold
+upon
+upper
+upset
+urban
+urge
+usage
+use
+used
+useful
+useless
+usual
+utility
+vacant
+vacuum
+vague
+valid
+valley
+valve
+van
+vanish
+vapor
+various
+vast
+vault
+vehicle
+velvet
+vendor
+venture
+venue
+verb
+verify
+version
+very
+vessel
+veteran
+viable
+vibrant
+vicious
+victory
+video
+view
+village
+vintage
+violin
+virtual
+virus
+visa
+visit
+visual
+vital
+vivid
+vocal
+voice
+void
+volcano
+volume
+vote
+voyage
+wage
+wagon
+wait
+walk
+wall
+walnut
+want
+warfare
+warm
+warrior
+wash
+wasp
+waste
+water
+wave
+way
+wealth
+weapon
+wear
+weasel
+weather
+web
+wedding
+weekend
+weird
+welcome
+west
+wet
+whale
+what
+wheat
+wheel
+when
+where
+whip
+whisper
+wide
+width
+wife
+wild
+will
+win
+window
+wine
+wing
+wink
+winner
+winter
+wire
+wisdom
+wise
+wish
+witness
+wolf
+woman
+wonder
+wood
+wool
+word
+work
+world
+worry
+worth
+wrap
+wreck
+wrestle
+wrist
+write
+wrong
+yard
+year
+yellow
+you
+young
+youth
+zebra
+zero
+zone
+zoo
+)abcd";
+}
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/keys/bip39.h b/submodules/ton/tonlib-src/tonlib/tonlib/keys/bip39.h
new file mode 100644
index 0000000000..da894dcb21
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/keys/bip39.h
@@ -0,0 +1,25 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "td/utils/Slice.h"
+#include "td/utils/Span.h"
+
+namespace tonlib {
+td::CSlice bip39_english();
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/tonlib-cli.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/tonlib-cli.cpp
new file mode 100644
index 0000000000..8de1133fbe
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/tonlib-cli.cpp
@@ -0,0 +1,605 @@
+#include "td/actor/actor.h"
+
+#include "td/utils/filesystem.h"
+#include "td/utils/OptionsParser.h"
+#include "td/utils/Parser.h"
+#include "td/utils/port/signals.h"
+#include "td/utils/port/path.h"
+
+#include "terminal/terminal.h"
+
+#include "tonlib/TonlibClient.h"
+#include "tonlib/TonlibCallback.h"
+
+#include <iostream>
+#include <map>
+
+class TonlibCli : public td::actor::Actor {
+ public:
+  struct Options {
+    bool enable_readline{true};
+    std::string config;
+    std::string key_dir{"."};
+  };
+  TonlibCli(Options options) : options_(std::move(options)) {
+  }
+
+ private:
+  Options options_;
+  td::actor::ActorOwn<td::TerminalIO> io_;
+  td::actor::ActorOwn<tonlib::TonlibClient> client_;
+  std::uint64_t next_query_id_{1};
+  td::Promise<td::Slice> cont_;
+
+  struct KeyInfo {
+    std::string public_key;
+    td::SecureString secret;
+  };
+  std::vector<KeyInfo> keys_;
+
+  std::map<std::uint64_t, td::Promise<tonlib_api::object_ptr<tonlib_api::Object>>> query_handlers_;
+
+  bool is_closing_{false};
+  td::uint32 ref_cnt_{1};
+
+  void start_up() override {
+    class Cb : public td::TerminalIO::Callback {
+     public:
+      void line_cb(td::BufferSlice line) override {
+        td::actor::send_closure(id_, &TonlibCli::parse_line, std::move(line));
+      }
+      Cb(td::actor::ActorShared<TonlibCli> id) : id_(std::move(id)) {
+      }
+
+     private:
+      td::actor::ActorShared<TonlibCli> id_;
+    };
+    ref_cnt_++;
+    io_ = td::TerminalIO::create("> ", options_.enable_readline, std::make_unique<Cb>(actor_shared(this)));
+    td::actor::send_closure(io_, &td::TerminalIO::set_log_interface);
+
+    class TonlibCb : public tonlib::TonlibCallback {
+     public:
+      TonlibCb(td::actor::ActorShared<TonlibCli> id) : id_(std::move(id)) {
+      }
+      void on_result(std::uint64_t id, tonlib_api::object_ptr<tonlib_api::Object> result) override {
+        send_closure(id_, &TonlibCli::on_tonlib_result, id, std::move(result));
+      }
+      void on_error(std::uint64_t id, tonlib_api::object_ptr<tonlib_api::error> error) override {
+        send_closure(id_, &TonlibCli::on_tonlib_error, id, std::move(error));
+      }
+
+     private:
+      td::actor::ActorShared<TonlibCli> id_;
+    };
+    ref_cnt_++;
+    client_ = td::actor::create_actor<tonlib::TonlibClient>("Tonlib", td::make_unique<TonlibCb>(actor_shared(this)));
+
+    td::mkdir(options_.key_dir).ignore();
+
+    load_keys();
+
+    using tonlib_api::make_object;
+    send_query(make_object<tonlib_api::init>(make_object<tonlib_api::options>(options_.config, options_.key_dir)),
+               [](auto r_ok) {
+                 LOG_IF(ERROR, r_ok.is_error()) << r_ok.error();
+                 td::TerminalIO::out() << "Tonlib is inited\n";
+               });
+  }
+  void hangup_shared() override {
+    CHECK(ref_cnt_ > 0);
+    ref_cnt_--;
+    try_stop();
+  }
+  void try_stop() {
+    if (is_closing_ && ref_cnt_ == 0) {
+      stop();
+    }
+  }
+  void tear_down() override {
+    td::actor::SchedulerContext::get()->stop();
+  }
+
+  void parse_line(td::BufferSlice line) {
+    if (is_closing_) {
+      return;
+    }
+    if (cont_) {
+      auto cont = std::move(cont_);
+      cont.set_value(line.as_slice());
+      return;
+    }
+    td::ConstParser parser(line.as_slice());
+    auto cmd = parser.read_word();
+    if (cmd.empty()) {
+      return;
+    }
+    if (cmd == "help") {
+      td::TerminalIO::out() << "help - show this help\n";
+      td::TerminalIO::out() << "genkey - generate new secret key\n";
+      td::TerminalIO::out() << "keys - show all stored keys\n";
+      td::TerminalIO::out() << "exportkey [key_id] - export key\n";
+      td::TerminalIO::out() << "setconfig <path> - set lite server config\n";
+      td::TerminalIO::out() << "getstate <key_id> - get state of simple wallet with requested key\n";
+      td::TerminalIO::out() << "init <key_id> - init simple wallet with requested key\n";
+      td::TerminalIO::out() << "transfer <from_key_id> <to_key_id> <amount> - transfer <amount> of grams from "
+                               "<from_key_id> to <to_key_id>.\n"
+                            << "\t<from_key_id> could also be 'giver'\n"
+                            << "\t<to_key_id> could also be 'giver' or smartcontract address\n";
+      td::TerminalIO::out() << "exit - exit from this programm\n";
+    } else if (cmd == "genkey") {
+      generate_key();
+    } else if (cmd == "exit") {
+      is_closing_ = true;
+      io_.reset();
+      client_.reset();
+      ref_cnt_--;
+      try_stop();
+    } else if (cmd == "keys") {
+      dump_keys();
+    } else if (cmd == "exportkey") {
+      export_key(parser.read_word());
+    } else if (cmd == "importkey") {
+      import_key(parser.read_all());
+    } else if (cmd == "setconfig") {
+      set_config(parser.read_word());
+    } else if (cmd == "getstate") {
+      get_state(parser.read_word());
+    } else if (cmd == "init") {
+      init_simple_wallet(parser.read_word());
+    } else if (cmd == "transfer") {
+      auto from = parser.read_word();
+      auto to = parser.read_word();
+      auto grams = parser.read_word();
+      transfer(from, to, grams);
+    } else if (cmd == "hint") {
+      get_hints(parser.read_word());
+    }
+  }
+
+  void on_tonlib_result(std::uint64_t id, tonlib_api::object_ptr<tonlib_api::Object> result) {
+    auto it = query_handlers_.find(id);
+    if (it == query_handlers_.end()) {
+      return;
+    }
+    auto promise = std::move(it->second);
+    query_handlers_.erase(it);
+    promise.set_value(std::move(result));
+  }
+
+  void on_tonlib_error(std::uint64_t id, tonlib_api::object_ptr<tonlib_api::error> error) {
+    auto it = query_handlers_.find(id);
+    if (it == query_handlers_.end()) {
+      return;
+    }
+    auto promise = std::move(it->second);
+    query_handlers_.erase(it);
+    promise.set_error(td::Status::Error(error->code_, error->message_));
+  }
+
+  template <class QueryT>
+  void send_query(tonlib_api::object_ptr<QueryT> query, td::Promise<typename QueryT::ReturnType> promise) {
+    if (is_closing_) {
+      return;
+    }
+    auto query_id = next_query_id_++;
+    td::actor::send_closure(client_, &tonlib::TonlibClient::request, query_id, std::move(query));
+    query_handlers_[query_id] =
+        [promise = std::move(promise)](td::Result<tonlib_api::object_ptr<tonlib_api::Object>> r_obj) mutable {
+          if (r_obj.is_error()) {
+            return promise.set_error(r_obj.move_as_error());
+          }
+          promise.set_value(ton::move_tl_object_as<typename QueryT::ReturnType::element_type>(r_obj.move_as_ok()));
+        };
+  }
+
+  void generate_key(td::SecureString entropy = {}) {
+    if (entropy.size() < 20) {
+      td::TerminalIO::out() << "Enter some entropy";
+      cont_ = [this, entropy = std::move(entropy)](td::Slice new_entropy) {
+        td::SecureString res(entropy.size() + new_entropy.size());
+        res.as_mutable_slice().copy_from(entropy.as_slice());
+        res.as_mutable_slice().substr(entropy.size()).copy_from(new_entropy);
+        generate_key(std::move(res));
+      };
+      return;
+    }
+    td::TerminalIO::out() << "Enter password (could be empty)";
+    cont_ = [this, entropy = std::move(entropy)](td::Slice password) mutable {
+      generate_key(std::move(entropy), td::SecureString(password));
+    };
+  }
+
+  void generate_key(td::SecureString entropy, td::SecureString password) {
+    auto password_copy = password.copy();
+    send_query(tonlib_api::make_object<tonlib_api::createNewKey>(
+                   std::move(password_copy), td::SecureString() /*mnemonic password*/, std::move(entropy)),
+               [this, password = std::move(password)](auto r_key) mutable {
+                 if (r_key.is_error()) {
+                   LOG(ERROR) << "Failed to create new key: " << r_key.error();
+                 }
+                 auto key = r_key.move_as_ok();
+                 LOG(ERROR) << to_string(key);
+                 KeyInfo info;
+                 info.public_key = key->public_key_;
+                 info.secret = std::move(key->secret_);
+                 keys_.push_back(std::move(info));
+                 export_key(info.public_key, keys_.size() - 1, std::move(password));
+                 store_keys();
+               });
+  }
+
+  void store_keys() {
+    td::SecureString buf(10000);
+    td::StringBuilder sb(buf.as_mutable_slice());
+    for (auto& info : keys_) {
+      sb << info.public_key << " " << td::base64_encode(info.secret) << "\n";
+    }
+    LOG_IF(FATAL, sb.is_error()) << "StringBuilder overflow";
+    td::atomic_write_file(key_db_path(), sb.as_cslice());
+  }
+
+  void load_keys() {
+    auto r_db = td::read_file_secure(key_db_path());
+    if (r_db.is_error()) {
+      return;
+    }
+    auto db = r_db.move_as_ok();
+    td::ConstParser parser(db.as_slice());
+    while (true) {
+      auto public_key = parser.read_word();
+      auto secret_b64 = parser.read_word();
+      if (secret_b64.empty()) {
+        break;
+      }
+      auto r_secret = td::base64_decode_secure(secret_b64);
+      if (r_secret.is_error()) {
+        LOG(ERROR) << "Invalid secret database at " << key_db_path();
+      }
+
+      KeyInfo info;
+      info.public_key = public_key.str();
+      info.secret = r_secret.move_as_ok();
+      LOG(INFO) << info.public_key;
+
+      keys_.push_back(std::move(info));
+    }
+  }
+
+  void dump_keys() {
+    td::TerminalIO::out() << "Got " << keys_.size() << " keys"
+                          << "\n";
+    for (size_t i = 0; i < keys_.size(); i++) {
+      td::TerminalIO::out() << "  #" << i << ": " << keys_[i].public_key << "\n";
+    }
+  }
+
+  std::string key_db_path() {
+    return options_.key_dir + TD_DIR_SLASH + "key_db";
+  }
+
+  td::Result<size_t> to_key_i(td::Slice key) {
+    if (key.empty()) {
+      return td::Status::Error("Empty key id");
+    }
+    if (key[0] == '#') {
+      TRY_RESULT(res, td::to_integer_safe<size_t>(key.substr(1)));
+      if (res < keys_.size()) {
+        return res;
+      }
+      return td::Status::Error("Invalid key id");
+    }
+    auto r_res = td::to_integer_safe<size_t>(key);
+    if (r_res.is_ok() && r_res.ok() < keys_.size()) {
+      return r_res.ok();
+    }
+    if (key.size() < 3) {
+      return td::Status::Error("Too short key id");
+    }
+
+    auto prefix = td::to_lower(key);
+    size_t res = 0;
+    size_t cnt = 0;
+    for (size_t i = 0; i < keys_.size(); i++) {
+      auto full_key = td::to_lower(keys_[i].public_key);
+      if (td::begins_with(full_key, prefix)) {
+        res = i;
+        cnt++;
+      }
+    }
+    if (cnt == 0) {
+      return td::Status::Error("Unknown key prefix");
+    }
+    if (cnt > 1) {
+      return td::Status::Error("Non unique key prefix");
+    }
+    return res;
+  }
+
+  struct Address {
+    tonlib_api::object_ptr<tonlib_api::accountAddress> address;
+    std::string public_key;
+    td::SecureString secret;
+  };
+
+  td::Result<Address> to_account_address(td::Slice key, bool need_private_key) {
+    if (key.empty()) {
+      return td::Status::Error("account address is empty");
+    }
+    auto r_key_i = to_key_i(key);
+    using tonlib_api::make_object;
+    if (r_key_i.is_ok()) {
+      auto obj = tonlib::TonlibClient::static_request(make_object<tonlib_api::testWallet_getAccountAddress>(
+          make_object<tonlib_api::testWallet_initialAccountState>(keys_[r_key_i.ok()].public_key)));
+      if (obj->get_id() != tonlib_api::error::ID) {
+        Address res;
+        res.address = ton::move_tl_object_as<tonlib_api::accountAddress>(obj);
+        res.public_key = keys_[r_key_i.ok()].public_key;
+        res.secret = keys_[r_key_i.ok()].secret.copy();
+        return std::move(res);
+      }
+    }
+    if (key == "giver") {
+      auto obj = tonlib::TonlibClient::static_request(make_object<tonlib_api::testGiver_getAccountAddress>());
+      if (obj->get_id() != tonlib_api::error::ID) {
+        Address res;
+        res.address = ton::move_tl_object_as<tonlib_api::accountAddress>(obj);
+        return std::move(res);
+      } else {
+        LOG(ERROR) << "Unexpected error during testGiver_getAccountAddress: " << to_string(obj);
+      }
+    }
+    if (need_private_key) {
+      return td::Status::Error("Don't have a private key for this address");
+    }
+    //TODO: validate address
+    Address res;
+    res.address = make_object<tonlib_api::accountAddress>(key.str());
+    return std::move(res);
+  }
+
+  void export_key(td::Slice key) {
+    if (key.empty()) {
+      dump_keys();
+      td::TerminalIO::out() << "Choose public key (hex prefix or #N)";
+      cont_ = [this](td::Slice key) { this->export_key(key); };
+      return;
+    }
+    auto r_key_i = to_key_i(key);
+    if (r_key_i.is_error()) {
+      td::TerminalIO::out() << "Unknown key id: [" << key << "]\n";
+      return;
+    }
+    auto key_i = r_key_i.move_as_ok();
+
+    td::TerminalIO::out() << "Key #" << key_i << "\n"
+                          << "public key: " << td::buffer_to_hex(keys_[key_i].public_key) << "\n";
+
+    td::TerminalIO::out() << "Enter password (could be empty)";
+    cont_ = [this, key = key.str(), key_i](td::Slice password) { this->export_key(key, key_i, password); };
+  }
+
+  void export_key(std::string key, size_t key_i, td::Slice password) {
+    using tonlib_api::make_object;
+    send_query(make_object<tonlib_api::exportKey>(make_object<tonlib_api::inputKey>(
+                   make_object<tonlib_api::key>(keys_[key_i].public_key, keys_[key_i].secret.copy()),
+                   td::SecureString(password))),
+               [key = std::move(key)](auto r_res) {
+                 if (r_res.is_error()) {
+                   td::TerminalIO::out() << "Can't export key id: [" << key << "] " << r_res.error() << "\n";
+                   return;
+                 }
+                 td::TerminalIO::out() << to_string(r_res.ok());
+               });
+  }
+
+  void import_key(td::Slice slice, std::vector<td::SecureString> words = {}) {
+    td::ConstParser parser(slice);
+    while (true) {
+      auto word = parser.read_word();
+      if (word.empty()) {
+        break;
+      }
+      words.push_back(td::SecureString(word));
+    }
+    if (words.size() < 24) {
+      td::TerminalIO::out() << "Enter mnemonic words (got " << words.size() << " out of 24)";
+      cont_ = [this, words = std::move(words)](td::Slice slice) mutable { this->import_key(slice, std::move(words)); };
+      return;
+    }
+    td::TerminalIO::out() << "Enter password (could be empty)";
+    cont_ = [this, words = std::move(words)](td::Slice password) mutable {
+      this->import_key(std::move(words), password);
+    };
+  }
+
+  void import_key(std::vector<td::SecureString> words, td::Slice password) {
+    using tonlib_api::make_object;
+    send_query(make_object<tonlib_api::importKey>(td::SecureString(password), td::SecureString(),
+                                                  make_object<tonlib_api::exportedKey>(std::move(words))),
+               [](auto r_res) {
+                 if (r_res.is_error()) {
+                   td::TerminalIO::out() << "Can't import key " << r_res.error() << "\n";
+                   return;
+                 }
+                 td::TerminalIO::out() << to_string(r_res.ok());
+               });
+  }
+
+  void set_config(td::Slice path) {
+    auto r_data = td::read_file_str(path.str());
+    if (r_data.is_error()) {
+      td::TerminalIO::out() << "Can't read file [" << path << "] : " << r_data.error() << "\n";
+      return;
+    }
+
+    auto data = r_data.move_as_ok();
+    using tonlib_api::make_object;
+    send_query(make_object<tonlib_api::options_setConfig>(data), [](auto r_res) {
+      if (r_res.is_error()) {
+        td::TerminalIO::out() << "Can't set config: " << r_res.error() << "\n";
+        return;
+      }
+      td::TerminalIO::out() << to_string(r_res.ok());
+    });
+  }
+
+  void get_state(td::Slice key) {
+    if (key.empty()) {
+      dump_keys();
+      td::TerminalIO::out() << "Choose public key (hex prefix or #N)";
+      cont_ = [this](td::Slice key) { this->get_state(key); };
+      return;
+    }
+    auto r_address = to_account_address(key, false);
+    if (r_address.is_error()) {
+      td::TerminalIO::out() << "Unknown key id: [" << key << "]\n";
+      return;
+    }
+    auto address = r_address.move_as_ok();
+    using tonlib_api::make_object;
+    send_query(make_object<tonlib_api::generic_getAccountState>(
+                   ton::move_tl_object_as<tonlib_api::accountAddress>(std::move(address.address))),
+               [](auto r_res) {
+                 if (r_res.is_error()) {
+                   td::TerminalIO::out() << "Can't get state: " << r_res.error() << "\n";
+                   return;
+                 }
+                 td::TerminalIO::out() << to_string(r_res.ok());
+               });
+  }
+
+  void transfer(td::Slice from, td::Slice to, td::Slice grams) {
+    auto r_from_address = to_account_address(from, true);
+    if (r_from_address.is_error()) {
+      td::TerminalIO::out() << "Unknown key id: [" << from << "] : " << r_from_address.error() << "\n";
+      return;
+    }
+    auto r_to_address = to_account_address(to, false);
+    if (r_to_address.is_error()) {
+      td::TerminalIO::out() << "Unknown key id: [" << to << "] : " << r_to_address.error() << "\n";
+      return;
+    }
+    auto r_grams = td::to_integer_safe<td::uint64>(grams);
+    if (r_grams.is_error()) {
+      td::TerminalIO::out() << "Invalid grams amount: [" << grams << "]\n";
+      return;
+    }
+    if (from != "giver") {
+      td::TerminalIO::out() << "Enter password (could be empty)";
+      cont_ = [this, from = r_from_address.move_as_ok(), to = r_to_address.move_as_ok(), grams = r_grams.move_as_ok()](
+                  td::Slice password) mutable { this->transfer(std::move(from), std::move(to), grams, password); };
+      return;
+    }
+    transfer(r_from_address.move_as_ok(), r_to_address.move_as_ok(), r_grams.move_as_ok(), "");
+  }
+
+  void transfer(Address from, Address to, td::uint64 grams, td::Slice password) {
+    using tonlib_api::make_object;
+    auto key = !from.secret.empty()
+                   ? make_object<tonlib_api::inputKey>(
+                         make_object<tonlib_api::key>(from.public_key, from.secret.copy()), td::SecureString(password))
+                   : nullptr;
+    send_query(make_object<tonlib_api::generic_sendGrams>(std::move(key), std::move(from.address),
+                                                          std::move(to.address), grams),
+               [](auto r_res) {
+                 if (r_res.is_error()) {
+                   td::TerminalIO::out() << "Can't get state: " << r_res.error() << "\n";
+                   return;
+                 }
+                 td::TerminalIO::out() << to_string(r_res.ok());
+               });
+  }
+
+  void init_simple_wallet(td::Slice key) {
+    if (key.empty()) {
+      dump_keys();
+      td::TerminalIO::out() << "Choose public key (hex prefix or #N)";
+      cont_ = [this](td::Slice key) { this->init_simple_wallet(key); };
+      return;
+    }
+    auto r_key_i = to_key_i(key);
+    if (r_key_i.is_error()) {
+      td::TerminalIO::out() << "Unknown key id: [" << key << "]\n";
+      return;
+    }
+    auto key_i = r_key_i.move_as_ok();
+
+    td::TerminalIO::out() << "Key #" << key_i << "\n"
+                          << "public key: " << td::buffer_to_hex(keys_[key_i].public_key) << "\n";
+
+    td::TerminalIO::out() << "Enter password (could be empty)";
+    cont_ = [this, key = key.str(), key_i](td::Slice password) { this->init_simple_wallet(key, key_i, password); };
+  }
+
+  void init_simple_wallet(std::string key, size_t key_i, td::Slice password) {
+    using tonlib_api::make_object;
+    send_query(make_object<tonlib_api::testWallet_init>(make_object<tonlib_api::inputKey>(
+                   make_object<tonlib_api::key>(keys_[key_i].public_key, keys_[key_i].secret.copy()),
+                   td::SecureString(password))),
+               [key = std::move(key)](auto r_res) {
+                 if (r_res.is_error()) {
+                   td::TerminalIO::out() << "Can't init wallet with key: [" << key << "] " << r_res.error() << "\n";
+                   return;
+                 }
+                 td::TerminalIO::out() << to_string(r_res.ok());
+               });
+  }
+
+  void get_hints(td::Slice prefix) {
+    using tonlib_api::make_object;
+    auto obj = tonlib::TonlibClient::static_request(make_object<tonlib_api::getBip39Hints>(prefix.str()));
+    if (obj->get_id() == tonlib_api::error::ID) {
+      return;
+    }
+    td::TerminalIO::out() << to_string(obj);
+  }
+};
+
+int main(int argc, char* argv[]) {
+  using tonlib_api::make_object;
+  SET_VERBOSITY_LEVEL(verbosity_INFO);
+  td::set_default_failure_signal_handler();
+
+  td::OptionsParser p;
+  TonlibCli::Options options;
+  p.set_description("console for validator for TON Blockchain");
+  p.add_option('h', "help", "prints_help", [&]() {
+    std::cout << (PSLICE() << p).c_str();
+    std::exit(2);
+    return td::Status::OK();
+  });
+  p.add_option('r', "disable-readline", "disable readline", [&]() {
+    options.enable_readline = false;
+    return td::Status::OK();
+  });
+  p.add_option('R', "enable-readline", "enable readline", [&]() {
+    options.enable_readline = true;
+    return td::Status::OK();
+  });
+  p.add_option('D', "directory", "set keys directory", [&](td::Slice arg) {
+    options.key_dir = arg.str();
+    return td::Status::OK();
+  });
+  p.add_option('v', "verbosity", "set verbosity level", [&](td::Slice arg) {
+    auto verbosity = td::to_integer<int>(arg);
+    SET_VERBOSITY_LEVEL(VERBOSITY_NAME(FATAL) + verbosity);
+    return (verbosity >= 0 && verbosity <= 20) ? td::Status::OK() : td::Status::Error("verbosity must be 0..20");
+  });
+  p.add_option('C', "config", "set lite server config", [&](td::Slice arg) {
+    TRY_RESULT(data, td::read_file_str(arg.str()));
+    options.config = std::move(data);
+    return td::Status::OK();
+  });
+
+  auto S = p.run(argc, argv);
+  if (S.is_error()) {
+    std::cerr << S.move_as_error().message().str() << std::endl;
+    std::_Exit(2);
+  }
+
+  td::actor::Scheduler scheduler({2});
+  scheduler.run_in_context([&] { td::actor::create_actor<TonlibCli>("console", options).release(); });
+  scheduler.run();
+  return 0;
+}
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/tonlib_client_json.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/tonlib_client_json.cpp
new file mode 100644
index 0000000000..f2aa82df81
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/tonlib_client_json.cpp
@@ -0,0 +1,57 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tonlib/tonlib_client_json.h"
+
+#include "tonlib/ClientJson.h"
+
+#include "td/utils/Slice.h"
+
+extern "C" int tonlib_client_json_square(int x, const char *str) {
+  return x * x;
+}
+
+void *tonlib_client_json_create() {
+  return new tonlib::ClientJson();
+}
+
+void tonlib_client_json_destroy(void *client) {
+  delete static_cast<tonlib::ClientJson *>(client);
+}
+
+void tonlib_client_json_send(void *client, const char *request) {
+  static_cast<tonlib::ClientJson *>(client)->send(td::Slice(request == nullptr ? "" : request));
+}
+
+const char *tonlib_client_json_receive(void *client, double timeout) {
+  auto slice = static_cast<tonlib::ClientJson *>(client)->receive(timeout);
+  if (slice.empty()) {
+    return nullptr;
+  } else {
+    return slice.c_str();
+  }
+}
+
+const char *tonlib_client_json_execute(void *client, const char *request) {
+  auto slice = tonlib::ClientJson::execute(td::Slice(request == nullptr ? "" : request));
+  if (slice.empty()) {
+    return nullptr;
+  } else {
+    return slice.c_str();
+  }
+}
diff --git a/submodules/MtProtoKit/TON/iOS/include/tonlib/tonlib_client_json.h b/submodules/ton/tonlib-src/tonlib/tonlib/tonlib_client_json.h
similarity index 100%
rename from submodules/MtProtoKit/TON/iOS/include/tonlib/tonlib_client_json.h
rename to submodules/ton/tonlib-src/tonlib/tonlib/tonlib_client_json.h
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/utils.cpp b/submodules/ton/tonlib-src/tonlib/tonlib/utils.cpp
new file mode 100644
index 0000000000..b577faf3f0
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/utils.cpp
@@ -0,0 +1,35 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#include "tonlib/utils.h"
+#include "td/utils/misc.h"
+#include "vm/cellslice.h"
+namespace tonlib {
+td::Result<td::Ref<vm::CellSlice>> binary_bitstring_to_cellslice(td::Slice literal) {
+  unsigned char buff[128];
+  if (!begins_with(literal, "b{") || !ends_with(literal, "}")) {
+    return td::Status::Error("Invalid binary bitstring constant");
+  }
+  int bits =
+      (int)td::bitstring::parse_bitstring_binary_literal(buff, sizeof(buff), literal.begin() + 2, literal.end() - 1);
+  if (bits < 0) {
+    return td::Status::Error("Invalid binary bitstring constant");
+  }
+  return td::Ref<vm::CellSlice>{true, vm::CellBuilder().store_bits(td::ConstBitPtr{buff}, bits).finalize()};
+}
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlib/utils.h b/submodules/ton/tonlib-src/tonlib/tonlib/utils.h
new file mode 100644
index 0000000000..924e86d695
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlib/utils.h
@@ -0,0 +1,26 @@
+/*
+    This file is part of TON Blockchain Library.
+
+    TON Blockchain Library is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation, either version 2 of the License, or
+    (at your option) any later version.
+
+    TON Blockchain Library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
+
+    Copyright 2017-2019 Telegram Systems LLP
+*/
+#pragma once
+#include "vm/cells.h"
+#include "ton/ton-types.h"
+#include "block/block.h"
+#include "block/block-parse.h"
+namespace tonlib {
+td::Result<td::Ref<vm::CellSlice>> binary_bitstring_to_cellslice(td::Slice literal);
+}  // namespace tonlib
diff --git a/submodules/ton/tonlib-src/tonlib/tonlibclientjson_export_list b/submodules/ton/tonlib-src/tonlib/tonlibclientjson_export_list
new file mode 100644
index 0000000000..217f3dd52e
--- /dev/null
+++ b/submodules/ton/tonlib-src/tonlib/tonlibclientjson_export_list
@@ -0,0 +1,5 @@
+_tonlib_client_json_create
+_tonlib_client_json_destroy
+_tonlib_client_json_send
+_tonlib_client_json_receive
+_tonlib_client_json_execute